{"id":"2308.10469","submitter":"Sophie Sun","authors":"Zhuowei Lin, Simon C.Y. Peng, Sophie C.C. Sun","title":"Upper bounds of dual flagged Weyl characters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a subset $D$ of boxes in an $n\\times n$ square grid, let $\\chi_{D}(x)$\ndenote the dual character of the flagged Weyl module associated to $D$. It is\nknown that $\\chi_{D}(x)$ specifies to a Schubert polynomial (resp., a key\npolynomial) in the case when $D$ is the Rothe diagram of a permutation (resp.,\nthe skyline diagram of a composition). One can naturally define a lower and an\nupper bound of $\\chi_{D}(x)$. M{\\'e}sz{\\'a}ros, St. Dizier and Tanjaya\nconjectured that $\\chi_{D}(x)$ attains the upper bound if and only if $D$\navoids a certain subdiagram. We provide a proof of this conjecture.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:09:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Zhuowei",""],["Peng","Simon C. Y.",""],["Sun","Sophie C. C.",""]]}
{"id":"2308.10470","submitter":"Jagabandhu Mishra","authors":"Jagabandhu Mishra and S. R. Mahadeva Prasanna","title":"Implicit Self-supervised Language Representation for Spoken Language\n  Diarization","comments":"Planning to Submit in IEEE-JSTSP","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In a code-switched (CS) scenario, the use of spoken language diarization (LD)\nas a pre-possessing system is essential. Further, the use of implicit\nframeworks is preferable over the explicit framework, as it can be easily\nadapted to deal with low/zero resource languages. Inspired by speaker\ndiarization (SD) literature, three frameworks based on (1) fixed segmentation,\n(2) change point-based segmentation and (3) E2E are proposed to perform LD. The\ninitial exploration with synthetic TTSF-LD dataset shows, using x-vector as\nimplicit language representation with appropriate analysis window length ($N$)\ncan able to achieve at per performance with explicit LD. The best implicit LD\nperformance of $6.38$ in terms of Jaccard error rate (JER) is achieved by using\nthe E2E framework. However, considering the E2E framework the performance of\nimplicit LD degrades to $60.4$ while using with practical Microsoft CS (MSCS)\ndataset. The difference in performance is mostly due to the distributional\ndifference between the monolingual segment duration of secondary language in\nthe MSCS and TTSF-LD datasets. Moreover, to avoid segment smoothing, the\nsmaller duration of the monolingual segment suggests the use of a small value\nof $N$. At the same time with small $N$, the x-vector representation is unable\nto capture the required language discrimination due to the acoustic similarity,\nas the same speaker is speaking both languages. Therefore, to resolve the issue\na self-supervised implicit language representation is proposed in this study.\nIn comparison with the x-vector representation, the proposed representation\nprovides a relative improvement of $63.9\\%$ and achieved a JER of $21.8$ using\nthe E2E framework.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:11:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mishra","Jagabandhu",""],["Prasanna","S. R. Mahadeva",""]]}
{"id":"2308.10471","submitter":"Siu-Hung Ng","authors":"Siu-Hung Ng and Xingting Wang","title":"On Hopf algebras of dimension $p^n$ in characteristic $p$","comments":"31 pages LaTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RA math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\Bbbk$ be an algebraically closed field of characteristic $p>0$. We\nstudy the general structures of $p^n$-dimensional Hopf algebras over $\\Bbbk$\nwith $p^{n-1}$ group-like elements or a primitive element generating a\n$p^{n-1}$-dimensional Hopf subalgebra. As applications, we have proved that\nHopf algebras of dimension $p^2$ over $\\Bbbk$ are pointed or basic for $p \\le\n5$, and provided a list of characterizations of the Radford algebra $R(p)$. In\nparticular, $R(p)$ is the unique nontrivial extension of $\\Bbbk[C_p]^*$ by\n$\\Bbbk[C_p]$, where $C_p$ is the cyclic group of order $p$. In addition, we\nhave proved a vanishing theorem for some 2nd Sweedler cohomology group and\ninvestigated the extensions of $p$-dimensional Hopf algebras. All these\nextensions have been identified and shown to be pointed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:11:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ng","Siu-Hung",""],["Wang","Xingting",""]]}
{"id":"2308.10472","submitter":"Eddie Nijholt","authors":"Eddie Nijholt, Tiago Pereira, Fernando C. Queiroz and Dmitry Turaev","title":"Chaotic behavior in diffusively coupled systems","comments":null,"journal-ref":"Communications in Mathematical Physics (2023): 1-42","doi":"10.1007/s00220-023-04699-5","report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study emergent oscillatory behavior in networks of diffusively coupled\nnonlinear ordinary differential equations. Starting from a situation where each\nisolated node possesses a globally attracting equilibrium point, we give, for\nan arbitrary network configuration, general conditions for the existence of the\ndiffusive coupling of a homogeneous strength which makes the network dynamics\nchaotic. The method is based on the theory of local bifurcations we develop for\ndiffusively coupled networks. We, in particular, introduce the class of the\nso-called versatile network configurations and prove that the Taylor\ncoefficients of the reduction to the center manifold for any versatile network\ncan take any given value.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:14:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nijholt","Eddie",""],["Pereira","Tiago",""],["Queiroz","Fernando C.",""],["Turaev","Dmitry",""]]}
{"id":"2308.10473","submitter":"Peisheng Yu","authors":"Peisheng Yu","title":"Counting Non-abelian Coverings of Algebraic Curve","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we study the etale coverings of an algebraic curve $C$ with\nGalois group a semi-direct product $\\mathbb{Z}/m\\mathbb{Z} \\rtimes\n\\mathbb{Z}/n\\mathbb{Z}$. Especially, for a given etale cyclic $n$-covering $D\n\\to C$, we determine how many curves $E$ are there, satisfying $E \\to D$ is an\netale cyclic $m$-covering and $E \\to C$ is Galois with non-abelian Galois\ngroup, under the assumption $gcd(m,n)=1$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:20:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Peisheng",""]]}
{"id":"2308.10474","submitter":"Francesc Castella","authors":"Francesc Castella, Chi-Yun Hsu, Debanjana Kundu, Yu-Shen Lee, Zheng\n  Liu","title":"Derived $p$-adic heights and the leading coefficient of the\n  Bertolini--Darmon--Prasanna $p$-adic $L$-function","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $E/\\mathbf{Q}$ be an elliptic curve and let $p$ be an odd prime of good\nreduction for $E$. Let $K$ be an imaginary quadratic field satisfying the\nclassical Heegner hypothesis and in which $p$ splits. In a previous work,\nAgboola--Castella formulated an analogue of the Birch--Swinnerton-Dyer\nconjecture for the $p$-adic $L$-function $L_{\\mathfrak{p}}^{\\rm BDP}$ of\nBertolini--Darmon--Prasanna attached to $E/K$, assuming the prime $p$ to be\nordinary for $E$. The goal of this paper is two-fold:\n  (1) We formulate a $p$-adic BSD conjecture for $L_{\\mathfrak{p}}^{\\rm BDP}$\nfor all odd primes $p$ of good reduction.\n  (2) For an algebraic analogue $F_{\\overline{\\mathfrak{p}}}^{\\rm BDP}$ of\n$L_{\\mathfrak{p}}^{\\rm BDP}$, we show that the ``leading coefficient'' part of\nour conjecture holds, and that the ``order of vanishing'' part follows from the\nexpected ``maximal non-degeneracy'' of an anticyclotomic $p$-adic height.\n  In particular, when the Iwasawa--Greenberg Main Conjecture\n$(F_{\\overline{\\mathfrak{p}}}^{\\rm BDP})=(L_{\\mathfrak{p}}^{\\rm BDP})$ is\nknown, our results determine the leading coefficient of $L_{\\mathfrak{p}}^{\\rm\nBDP}$ at $T=0$ up to a $p$-adic unit. Moreover, by adapting the approach of\nBurungale--Castella--Kim in the $p$-ordinary case, we prove the main conjecture\nfor supersingular primes $p$ under mild hypotheses.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:20:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Castella","Francesc",""],["Hsu","Chi-Yun",""],["Kundu","Debanjana",""],["Lee","Yu-Shen",""],["Liu","Zheng",""]]}
{"id":"2308.10475","submitter":"Kirill Koshelev","authors":"Kirill Koshelev, Pavel Tonkaev, and Yuri Kivshar","title":"Nonlinear chiral metaphotonics","comments":"perspective, 35 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the physics and some applications of photonic structures designed\nfor the realisation of strong $\\textit{nonlinear chiroptical response}$. We pay\nmuch attention to the recent strategy of utilizing different types of\n$\\textit{optical resonances}$ in metallic and dielectric subwavelength\nstructures and metasurfaces, including surface plasmon resonances, Mie\nresonances, lattice guided modes, and bound states in the continuum. We\nsummarize earlier results and discuss more recent developments for achieving\nlarge circular dichroism combined with the high efficiency of nonlinear\nharmonic generation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:21:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Koshelev","Kirill",""],["Tonkaev","Pavel",""],["Kivshar","Yuri",""]]}
{"id":"2308.10476","submitter":"Sichao Qu","authors":"Sichao Qu, Min Yang, Yunfei Xu, Songwen Xiao and Nicholas X. Fang","title":"Reverberation Time Control by Acoustic Metamaterials in a Small Room","comments":"15 pages, 6 figures","journal-ref":null,"doi":"10.1016/j.buildenv.2023.110753","report-no":null,"categories":"physics.app-ph physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, metamaterials have gained considerable attention as a\npromising material technology due to their unique properties and customizable\ndesign, distinguishing them from traditional materials. This article delves\ninto the value of acoustic metamaterials in room acoustics, particularly in\nsmall room acoustics that poses specific challenges due to their significant\ncavity resonant nature. Small rooms usually exhibit an inhomogeneous frequency\nresponse spectrum, requiring higher wall absorption with specific spectrum to\nachieve a uniform acoustic environment, i.e., a constant reverberation time\nover a wide audible frequency band. To tackle this issue, we developed a design\nthat simultaneously incorporates numerous subwavelength acoustic resonators at\ndifferent frequencies to achieve customized broadband absorption for the walls\nof a specific example room. The on-site experimental measurements agree well\nwith the numerical predictions, attesting to the robustness of the design and\nmethod. The proposed method of reverse-engineering metamaterials by targeting\nspecific acoustic requirements has broad applicability and unique advantages in\nsmall confined spaces with high acoustic requirements, such as recording\nstudios, listening rooms, and car cabins.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:21:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qu","Sichao",""],["Yang","Min",""],["Xu","Yunfei",""],["Xiao","Songwen",""],["Fang","Nicholas X.",""]]}
{"id":"2308.10477","submitter":"Junyi Shen","authors":"Jun-Yi Shen, Yuan-Chuan Zou, A. M. Chen, Duan-Yuan Gao","title":"What absorbs the early TeV photons of GRB 221009A?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The tera-electronvolt (TeV) light curve of gamma-ray burst (GRB) 221009A\nshows an unprecedentedly rapid rise at the beginning epoch. This phenomenon\ncould be due to the strong absorption of photons and electrons within the\nemitting region. As the external shock expands outwards and the radius\nincreases, the volume of matter also increases, leading to a gradual decrease\nin the optical depth for TeV photons. We explore several possibilities for the\nphysical origin of this peculiar behavior. We calculate the optical depth for\nTeV photons due to annihilation with lower energy photons in the external shock\nand scattering by electrons produced via cascading of the TeV emission. Even\nunder aggressive assumptions, we find the optical depths for these processes\nare orders of magnitude too small to explain the observed light curve. Other\nsources of absorbers, such as electrons in the ejecta or external shock, also\ndo not yield sufficient optical depths. Therefore, the origin of the early\npeculiar TeV light curve remains uncertain.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:24:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shen","Jun-Yi",""],["Zou","Yuan-Chuan",""],["Chen","A. M.",""],["Gao","Duan-Yuan",""]]}
{"id":"2308.10478","submitter":"Zachary Sweger","authors":"Zachary Sweger, Spencer R. Klein, Yuanjing Ji, Minjung Kim, Saeahram\n  Yoo, Ziyuan Zeng, Daniel Cebra, Xin Dong","title":"Modeling Backward-Angle ($u$-channel) Virtual Compton Scattering at an\n  Electron-Ion Collider","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  High-energy backward ($u$-channel) reactions can involve very large momentum\ntransfers to the target baryons, shifting them by many units of rapidity. These\nreactions are difficult to understand in conventional models in which baryon\nnumber is carried by the valence quarks. Backward Compton scattering is an\nespecially attractive experimental target, because of its simple final state.\nThere is currently limited data on this process, and that data is at low\ncenter-of-mass energies. In this paper, we examine the prospects for studying\nbackward Compton scattering at the future Electron-Ion Collider (EIC). We model\nthe cross-section and kinematics using the limited data on backward Compton\nscattering and backward meson production, and then simulate Compton scattering\nat EIC energies, in a simple model of the ePIC detector. Generally, the proton\nis scattered toward mid-rapidity, while the produced photon is in the\nfar-forward region, visible in a Zero Degree Calorimeter (ZDC). We show that\nthe background from backward $\\pi^0$ production can be rejected using a\nhigh-resolution, well-segmented ZDC.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:33:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sweger","Zachary",""],["Klein","Spencer R.",""],["Ji","Yuanjing",""],["Kim","Minjung",""],["Yoo","Saeahram",""],["Zeng","Ziyuan",""],["Cebra","Daniel",""],["Dong","Xin",""]]}
{"id":"2308.10479","submitter":"Arijit Ghosh","authors":"Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi","title":"Stabbing boxes with finitely many axis-parallel lines and flats","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.CG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We give necessary and sufficient condition for an infinite collection of\naxis-parallel boxes in $\\mathbb{R}^{d}$ to be pierceable by finitely many\naxis-parallel $k$-flats, where $0 \\leq k < d$. We also consider colorful\ngeneralizations of the above result and establish their feasibility. The\nproblem considered in this paper is an infinite variant of the\nHadwiger-Debrunner $(p,q)$-problem.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:37:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chakraborty","Sutanoya",""],["Ghosh","Arijit",""],["Nandi","Soumi",""]]}
{"id":"2308.10480","submitter":"Arijit Ghosh","authors":"Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi","title":"Dimension Independent Helly Theorem for Lines and Flats","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.CG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We give a generalization of dimension independent Helly Theorem of\nAdiprasito, B\\'{a}r\\'{a}ny, Mustafa, and Terpai (Discrete & Computational\nGeometry 2022) to higher dimensional transversal. We also prove some\nimpossibility results that establish the tightness of our extension.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:38:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chakraborty","Sutanoya",""],["Ghosh","Arijit",""],["Nandi","Soumi",""]]}
{"id":"2308.10481","submitter":"Lingyu Xiao","authors":"Lingyu Xiao, Xiang Li, Sen Yang, Wankou Yang","title":"ADNet: Lane Shape Prediction via Anchor Decomposition","comments":"ICCV2023 accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we revisit the limitations of anchor-based lane detection\nmethods, which have predominantly focused on fixed anchors that stem from the\nedges of the image, disregarding their versatility and quality. To overcome the\ninflexibility of anchors, we decompose them into learning the heat map of\nstarting points and their associated directions. This decomposition removes the\nlimitations on the starting point of anchors, making our algorithm adaptable to\ndifferent lane types in various datasets. To enhance the quality of anchors, we\nintroduce the Large Kernel Attention (LKA) for Feature Pyramid Network (FPN).\nThis significantly increases the receptive field, which is crucial in capturing\nthe sufficient context as lane lines typically run throughout the entire image.\nWe have named our proposed system the Anchor Decomposition Network (ADNet).\nAdditionally, we propose the General Lane IoU (GLIoU) loss, which significantly\nimproves the performance of ADNet in complex scenarios. Experimental results on\nthree widely used lane detection benchmarks, VIL-100, CULane, and TuSimple,\ndemonstrate that our approach outperforms the state-of-the-art methods on\nVIL-100 and exhibits competitive accuracy on CULane and TuSimple. Code and\nmodels will be released on https://github.com/ Sephirex-X/ADNet.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:42:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xiao","Lingyu",""],["Li","Xiang",""],["Yang","Sen",""],["Yang","Wankou",""]]}
{"id":"2308.10482","submitter":"Phuong Nguyen Minh","authors":"Phuong Minh Nguyen, Le Minh Nguyen","title":"An Effective Method using Phrase Mechanism in Neural Machine Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Translation is one of the essential tasks in Natural Language\nProcessing (NLP), which has massive applications in real life as well as\ncontributing to other tasks in the NLP research community. Recently,\nTransformer -based methods have attracted numerous researchers in this domain\nand achieved state-of-the-art results in most of the pair languages. In this\npaper, we report an effective method using a phrase mechanism,\nPhraseTransformer, to improve the strong baseline model Transformer in\nconstructing a Neural Machine Translation (NMT) system for parallel corpora\nVietnamese-Chinese. Our experiments on the MT dataset of the VLSP 2022\ncompetition achieved the BLEU score of 35.3 on Vietnamese to Chinese and 33.2\nBLEU scores on Chinese to Vietnamese data. Our code is available at\nhttps://github.com/phuongnm94/PhraseTransformer.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:46:40 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:33:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nguyen","Phuong Minh",""],["Nguyen","Le Minh",""]]}
{"id":"2308.10483","submitter":"Shuai Lu","authors":"Shuai Lu, Zihang Gao, Yong Sun, Suhan Zhang, Baoju Li, Chengliang Hao,\n  Yijun Xu, Wei Gu","title":"Aggregate Model of District Heating Network for Integrated Energy\n  Dispatch: A Physically Informed Data-Driven Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The district heating network (DHN) is essential in enhancing the operational\nflexibility of integrated energy systems (IES). Yet, it is hard to obtain an\naccurate and concise DHN model for the operation owing to complicated network\nfeatures and imperfect measurement. Considering this, this paper proposes a\nphysically informed data-driven aggregate model (AGM) for DHN, providing a\nconcise description of the source-load relationship of DHN without exposing\nnetwork details. First, we derive the analytical relationship between the state\nvariables of the source and load nodes of DHN, offering a physical fundament\nfor the AGM. Second, we propose a physics-informed estimator for AGM that is\nrobust to low-quality measurement, in which the physical constraints associated\nwith the parameter normalization and sparsity are embedded to improve the\naccuracy and robustness. Finally, we propose a physics-enhanced algorithm to\nsolve the nonlinear estimator with non-closed constraints efficiently.\nSimulation results verify the effectiveness of the proposed method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:54:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lu","Shuai",""],["Gao","Zihang",""],["Sun","Yong",""],["Zhang","Suhan",""],["Li","Baoju",""],["Hao","Chengliang",""],["Xu","Yijun",""],["Gu","Wei",""]]}
{"id":"2308.10484","submitter":"Yiwei Dong","authors":"Yiwei Dong, Yan Sun, Ye Xu, Zehao Lin, Shuaibo Bian, Chaojie Hao,\n  Dejian Liu, Yingjie Li, Ji Yang, Yang Su, Xin Zhou, Shaobo Zhang, Qing-Zeng\n  Yan, and Zhiwei Chen","title":"Distributions and Physical Properties of Molecular Clouds in the Third\n  Galactic Quadrant: $l$ = [219.75, 229.75]$^\\circ$ and $b$ = [-5.25,\n  5.25]$^\\circ$","comments":"22 pages, 13 figures, 7 tables (with machine-readable versions),\n  published in ApJS","journal-ref":"ApJS 268 1 (2023)","doi":"10.3847/1538-4365/acde81","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the results of an unbiased $^{12}$CO/$^{13}$CO/C$^{18}$O ($J$ =\n1-0) survey in a portion of the third Galactic quadrant (TGQ): $l$ = [219.75,\n229.75]$^\\circ$ and $b$ = [-5.25, 5.25]$^\\circ$. The high-resolution and\nhigh-sensitivity data sets help to unravel the distributions and physical\nproperties of the molecular clouds (MCs) in the mapped area. In the LSR\nvelocity range from -1 to 85 km/s, the molecular material successfully traces\nthe Local, Perseus, and Outer arms. In the TGQ, the Outer arm appears to be\nmore prominent than that in the second Galactic quadrant (SGQ), but the Perseus\narm is not as conspicuous as that in the SGQ. A total of 1,502 $^{12}$CO, 570\n$^{13}$CO, and 53 C$^{18}$O molecular structures are identified, spanning over\n$\\sim2$ and $\\sim6$ orders of magnitude in size and mass, respectively. Tight\nmass-radius correlations and virial parameter-mass anticorrelations are\nobservable. Yet, it seems that no clear correlations between velocity\ndispersion and effective radius can be found over the full dynamic range. The\nvertical distribution of the MCs renders evident pictures of the Galactic warp\nand flare.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:57:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dong","Yiwei",""],["Sun","Yan",""],["Xu","Ye",""],["Lin","Zehao",""],["Bian","Shuaibo",""],["Hao","Chaojie",""],["Liu","Dejian",""],["Li","Yingjie",""],["Yang","Ji",""],["Su","Yang",""],["Zhou","Xin",""],["Zhang","Shaobo",""],["Yan","Qing-Zeng",""],["Chen","Zhiwei",""]]}
{"id":"2308.10485","submitter":"Igor Shparlinski","authors":"Kamil Bulinski and Igor E. Shparlinski","title":"Counting elements of the congruence subgroup","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain asymptotic formulas for the number of matrices in the congruence\nsubgroup \\[ \\Gamma_0(Q) = \\left\\{ A\\in\\mathrm{SL}_2(\\mathbb Z):~c \\equiv 0\n\\pmod Q\\right\\}, \\] which are of naive height at most $X$. Our result is\nuniform in a very broad range of values $Q$ and $X$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:01:09 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 05:15:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bulinski","Kamil",""],["Shparlinski","Igor E.",""]]}
{"id":"2308.10486","submitter":"Sehwan Moon","authors":"Sehwan Moon and Hyunju Lee","title":"Deep Metric Loss for Multimodal Learning","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal learning often outperforms its unimodal counterparts by exploiting\nunimodal contributions and cross-modal interactions. However, focusing only on\nintegrating multimodal features into a unified comprehensive representation\noverlooks the unimodal characteristics. In real data, the contributions of\nmodalities can vary from instance to instance, and they often reinforce or\nconflict with each other. In this study, we introduce a novel \\text{MultiModal}\nloss paradigm for multimodal learning, which subgroups instances according to\ntheir unimodal contributions. \\text{MultiModal} loss can prevent inefficient\nlearning caused by overfitting and efficiently optimize multimodal models. On\nsynthetic data, \\text{MultiModal} loss demonstrates improved classification\nperformance by subgrouping difficult instances within certain modalities. On\nfour real multimodal datasets, our loss is empirically shown to improve the\nperformance of recent models. Ablation studies verify the effectiveness of our\nloss. Additionally, we show that our loss generates a reliable prediction score\nfor each modality, which is essential for subgrouping. Our \\text{MultiModal}\nloss is a novel loss function to subgroup instances according to the\ncontribution of modalities in multimodal learning and is applicable to a\nvariety of multimodal models with unimodal decisions. Our code is available at\nhttps://github.com/SehwanMoon/MultiModalLoss.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:04:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Moon","Sehwan",""],["Lee","Hyunju",""]]}
{"id":"2308.10487","submitter":"Lue Tao","authors":"Lue Tao, Yu-Xuan Huang, Wang-Zhou Dai, Yuan Jiang","title":"Deciphering Raw Data in Neuro-Symbolic Learning with Provable Guarantees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neuro-symbolic hybrid systems are promising for integrating machine learning\nand symbolic reasoning, where perception models are facilitated with\ninformation inferred from a symbolic knowledge base through logical reasoning.\nDespite empirical evidence showing the ability of hybrid systems to learn\naccurate perception models, the theoretical understanding of learnability is\nstill lacking. Hence, it remains unclear why a hybrid system succeeds for a\nspecific task and when it may fail given a different knowledge base. In this\npaper, we introduce a novel way of characterising supervision signals from a\nknowledge base, and establish a criterion for determining the knowledge's\nefficacy in facilitating successful learning. This, for the first time, allows\nus to address the two questions above by inspecting the knowledge base under\ninvestigation. Our analysis suggests that many knowledge bases satisfy the\ncriterion, thus enabling effective learning, while some fail to satisfy it,\nindicating potential failures. Comprehensive experiments confirm the utility of\nour criterion on benchmark tasks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:04:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tao","Lue",""],["Huang","Yu-Xuan",""],["Dai","Wang-Zhou",""],["Jiang","Yuan",""]]}
{"id":"2308.10488","submitter":"Pranav Singh","authors":"Pranav Singh, Luoyao Chen, Mei Chen, Jinqian Pan, Raviteja\n  Chukkapalli, Shravan Chaudhari and Jacopo Cirrone","title":"Enhancing Medical Image Segmentation: Optimizing Cross-Entropy Weights\n  and Post-Processing with Autoencoders","comments":"Accepted at ICCV CVAMD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The task of medical image segmentation presents unique challenges,\nnecessitating both localized and holistic semantic understanding to accurately\ndelineate areas of interest, such as critical tissues or aberrant features.\nThis complexity is heightened in medical image segmentation due to the high\ndegree of inter-class similarities, intra-class variations, and possible image\nobfuscation. The segmentation task further diversifies when considering the\nstudy of histopathology slides for autoimmune diseases like dermatomyositis.\nThe analysis of cell inflammation and interaction in these cases has been less\nstudied due to constraints in data acquisition pipelines. Despite the\nprogressive strides in medical science, we lack a comprehensive collection of\nautoimmune diseases. As autoimmune diseases globally escalate in prevalence and\nexhibit associations with COVID-19, their study becomes increasingly essential.\nWhile there is existing research that integrates artificial intelligence in the\nanalysis of various autoimmune diseases, the exploration of dermatomyositis\nremains relatively underrepresented. In this paper, we present a deep-learning\napproach tailored for Medical image segmentation. Our proposed method\noutperforms the current state-of-the-art techniques by an average of 12.26% for\nU-Net and 12.04% for U-Net++ across the ResNet family of encoders on the\ndermatomyositis dataset. Furthermore, we probe the importance of optimizing\nloss function weights and benchmark our methodology on three challenging\nmedical image segmentation tasks\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:09:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singh","Pranav",""],["Chen","Luoyao",""],["Chen","Mei",""],["Pan","Jinqian",""],["Chukkapalli","Raviteja",""],["Chaudhari","Shravan",""],["Cirrone","Jacopo",""]]}
{"id":"2308.10489","submitter":"Suprio Bhar","authors":"Suprio Bhar, Rajeev Bhaskaran and Arvind Kumar Nath","title":"Existence and Uniqueness of Stochastic PDEs associated with the Forward\n  Equations: An Approach using Alternate Norms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider stochastic PDEs \\[dY_t = L(Y_t)\\, dt + A(Y_t).\\, dB_t, t > 0\\]\nand associated PDEs \\[du_t = L u_t\\, dt, t > 0\\] with regular initial\nconditions. Here, $L$ and $A$ are certain partial differential operators\ninvolving multiplication by smooth functions and are of the order two and one\nrespectively, and in special cases are associated with finite dimensional\ndiffusion processes. This PDE also includes Kolmogorov's Forward Equation\n(Fokker-Planck Equation) as a special case. We first prove a Monotonicity\ninequality for the pair $(L, A)$ and using this inequality, we obtain the\nexistence and uniqueness of strong solutions to the Stochastic PDE and the PDE.\nIn addition, a stochastic representation for the solution to the PDE is also\nestablished.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:18:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bhar","Suprio",""],["Bhaskaran","Rajeev",""],["Nath","Arvind Kumar",""]]}
{"id":"2308.10490","submitter":"Xin Yu","authors":"Xin Yu, Peng Dai, Wenbo Li, Lan Ma, Zhengzhe Liu, Xiaojuan Qi","title":"Texture Generation on 3D Meshes with Point-UV Diffusion","comments":"Accepted to ICCV 2023, Oral","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we focus on synthesizing high-quality textures on 3D meshes. We\npresent Point-UV diffusion, a coarse-to-fine pipeline that marries the\ndenoising diffusion model with UV mapping to generate 3D consistent and\nhigh-quality texture images in UV space. We start with introducing a point\ndiffusion model to synthesize low-frequency texture components with our\ntailored style guidance to tackle the biased color distribution. The derived\ncoarse texture offers global consistency and serves as a condition for the\nsubsequent UV diffusion stage, aiding in regularizing the model to generate a\n3D consistent UV texture image. Then, a UV diffusion model with hybrid\nconditions is developed to enhance the texture fidelity in the 2D UV space. Our\nmethod can process meshes of any genus, generating diversified,\ngeometry-compatible, and high-fidelity textures. Code is available at\nhttps://cvmi-lab.github.io/Point-UV-Diffusion\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:20:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Xin",""],["Dai","Peng",""],["Li","Wenbo",""],["Ma","Lan",""],["Liu","Zhengzhe",""],["Qi","Xiaojuan",""]]}
{"id":"2308.10491","submitter":"Francesco Barbato","authors":"Giulia Rizzoli, Francesco Barbato, Matteo Caligiuri, Pietro Zanuttigh","title":"SynDrone -- Multi-modal UAV Dataset for Urban Scenarios","comments":"Accepted at ICCV Workshops, downloadable dataset with CC-BY license,\n  8 pages, 4 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The development of computer vision algorithms for Unmanned Aerial Vehicles\n(UAVs) imagery heavily relies on the availability of annotated high-resolution\naerial data. However, the scarcity of large-scale real datasets with\npixel-level annotations poses a significant challenge to researchers as the\nlimited number of images in existing datasets hinders the effectiveness of deep\nlearning models that require a large amount of training data. In this paper, we\npropose a multimodal synthetic dataset containing both images and 3D data taken\nat multiple flying heights to address these limitations. In addition to\nobject-level annotations, the provided data also include pixel-level labeling\nin 28 classes, enabling exploration of the potential advantages in tasks like\nsemantic segmentation. In total, our dataset contains 72k labeled samples that\nallow for effective training of deep architectures showing promising results in\nsynthetic-to-real adaptation. The dataset will be made publicly available to\nsupport the development of novel computer vision methods targeting UAV\napplications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:22:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rizzoli","Giulia",""],["Barbato","Francesco",""],["Caligiuri","Matteo",""],["Zanuttigh","Pietro",""]]}
{"id":"2308.10492","submitter":"Zhaosheng Wang","authors":"Minjie Zhang, Jiating Wu, Ke Shi, Langsheng Ling, Wei Tong, Chuanying\n  Xi, Li Pi, J. Wosnitza, Huiqian Luo, Zhaosheng Wang","title":"Huge magnetostriction in superconducting single-crystalline\n  BaFe$_{1.908}$Ni$_{0.092}$As$_{2}$","comments":"4 pages, 3 figures","journal-ref":"Appl. Phys. Lett. 123, 072602 (2023)","doi":"10.1063/5.0166209","report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The performance of iron-based superconductors in high magnetic fields plays\nan important role for their practical application. In this work, we measured\nthe magnetostriction and magnetization of BaFe$_{1.908}$Ni$_{0.092}$As$_{2}$\nsingle crystals using pulsed magnetic fields up to 60 T and static magnetic\nfields up to 33 T, respectively. A huge longitudinal magnetostriction (of the\norder of 10$ ^{-4} $) was observed in the direction of the twin boundaries. The\nmagnetization measurements evidence a high critical-current density due to\nstrong bulk pinning. By using magnetization data with an exponential\nflux-pinning model, we can reproduce the magnetostriction curves qualitatively.\nThis result shows that the magnetostriction of\nBaFe$_{1.908}$Ni$_{0.092}$As$_{2}$ can be well explained by a\nflux-pinning-induced mechanism.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:22:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Minjie",""],["Wu","Jiating",""],["Shi","Ke",""],["Ling","Langsheng",""],["Tong","Wei",""],["Xi","Chuanying",""],["Pi","Li",""],["Wosnitza","J.",""],["Luo","Huiqian",""],["Wang","Zhaosheng",""]]}
{"id":"2308.10493","submitter":"Liu Zhuang Mr.","authors":"Zhuang Liu and Ye Yuan and Zhilong Ji and Jingfeng Bai and Xiang Bai","title":"Semantic Graph Representation Learning for Handwritten Mathematical\n  Expression Recognition","comments":"12 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Handwritten mathematical expression recognition (HMER) has attracted\nextensive attention recently. However, current methods cannot explicitly study\nthe interactions between different symbols, which may fail when faced similar\nsymbols. To alleviate this issue, we propose a simple but efficient method to\nenhance semantic interaction learning (SIL). Specifically, we firstly construct\na semantic graph based on the statistical symbol co-occurrence probabilities.\nThen we design a semantic aware module (SAM), which projects the visual and\nclassification feature into semantic space. The cosine distance between\ndifferent projected vectors indicates the correlation between symbols. And\njointly optimizing HMER and SIL can explicitly enhances the model's\nunderstanding of symbol relationships. In addition, SAM can be easily plugged\ninto existing attention-based models for HMER and consistently bring\nimprovement. Extensive experiments on public benchmark datasets demonstrate\nthat our proposed module can effectively enhance the recognition performance.\nOur method achieves better recognition performance than prior arts on both\nCROHME and HME100K datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:23:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Zhuang",""],["Yuan","Ye",""],["Ji","Zhilong",""],["Bai","Jingfeng",""],["Bai","Xiang",""]]}
{"id":"2308.10494","submitter":"Yulei Wang","authors":"Yulei Wang, Xin Cheng, Mingde Ding, Zhaoyuan Liu, Jian Liu, Xiaojue\n  Zhu","title":"Three-dimensional Turbulent Reconnection within Solar Flare Current\n  Sheet","comments":"15 pages, 8 figure, accepted for publication in ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar flares can release coronal magnetic energy explosively and may impact\nthe safety of near-earth space environments. Their structures and properties on\nmacroscale have been interpreted successfully by the generally-accepted\ntwo-dimension standard model invoking magnetic reconnection theory as the key\nenergy conversion mechanism. Nevertheless, some momentous dynamical features as\ndiscovered by recent high-resolution observations remain elusive. Here, we\nreport a self-consistent high-resolution three-dimension magnetohydrodynamical\nsimulation of turbulent magnetic reconnection within a flare current sheet. It\nis found that fragmented current patches of different scales are spontaneously\ngenerated with a well-developed turbulence spectrum at the current sheet, as\nwell as at the flare loop-top region. The close coupling of tearing-mode and\nKelvin-Helmholtz instabilities plays a critical role in developing turbulent\nreconnection and in forming dynamical structures with synthetic observables in\ngood agreement with realistic observations. The sophisticated modeling makes a\nparadigm shift from the traditional to three-dimension turbulent reconnection\nmodel unifying flare dynamical structures of different scales.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:25:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yulei",""],["Cheng","Xin",""],["Ding","Mingde",""],["Liu","Zhaoyuan",""],["Liu","Jian",""],["Zhu","Xiaojue",""]]}
{"id":"2308.10495","submitter":"Ilya Deriy","authors":"Ilya Deriy, Kseniia Lezhennikova, Stanislav Glybovsky, Ivan Iorsh,\n  Oleh Yermakov, Mingzhao Song, Redha Abdeddaim, Stefan Enoch, Pavel Belov, and\n  Andrey Bogdanov","title":"Anomalous Reflection From Hyperbolic Media","comments":"16 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the apparent simplicity, the problem of refraction of electromagnetic\nwaves at the planar interface between two media has an incredibly rich spectrum\nof unusual phenomena. An example is the paradox that occurs when an\nelectromagnetic wave is incident on the interface between a hyperbolic medium\nand an isotropic dielectric. At certain orientations of the optical axis of the\nhyperbolic medium relative to the interface, the reflected and transmitted\nwaves are completely absent. In this paper, we formulate the aforementioned\nparadox and present its resolution by introduction of infinitesimal losses in a\nhyperbolic medium. We show that the reflected wave exists, but became extremely\ndecaying as the loss parameter tends to zero. As a consequence, all the energy\nscattered into the reflected channel is absorbed at the interface. We support\nour reasoning with analytical calculations, numerical simulations, and an\nexperiment with self-complementary metasurfaces in the microwave region. In\naddition to the great fundamental interest, this paradox resolution discovers a\nplethora of applications for the reflectors, refractors, absorbers, lenses,\nantennas, camouflage and holography applications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:26:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Deriy","Ilya",""],["Lezhennikova","Kseniia",""],["Glybovsky","Stanislav",""],["Iorsh","Ivan",""],["Yermakov","Oleh",""],["Song","Mingzhao",""],["Abdeddaim","Redha",""],["Enoch","Stefan",""],["Belov","Pavel",""],["Bogdanov","Andrey",""]]}
{"id":"2308.10496","submitter":"Oliver Niggemann","authors":"Jan-Philipp Roche and Oliver Niggemann and Jens Friebe","title":"Using Autoencoders and AutoDiff to Reconstruct Missing Variables in a\n  Set of Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing black box modeling approaches in machine learning suffer from a\nfixed input and output feature combination. In this paper, a new approach to\nreconstruct missing variables in a set of time series is presented. An\nautoencoder is trained as usual with every feature on both sides and the neural\nnetwork parameters are fixed after this training. Then, the searched variables\nare defined as missing variables at the autoencoder input and optimized via\nautomatic differentiation. This optimization is performed with respect to the\navailable features loss calculation. With this method, different input and\noutput feature combinations of the trained model can be realized by defining\nthe searched variables as missing variables and reconstructing them. The\ncombination can be changed without training the autoencoder again. The approach\nis evaluated on the base of a strongly nonlinear electrical component. It is\nworking well for one of four variables missing and generally even for multiple\nmissing variables.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:35:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Roche","Jan-Philipp",""],["Niggemann","Oliver",""],["Friebe","Jens",""]]}
{"id":"2308.10497","submitter":"Huaiqian Li","authors":"Huaiqian Li and Bingyao Wu","title":"Asymptotics of Kantorovich Distance for Empirical Measures of the\n  Laguerre Model","comments":"15 pages; to appear in PAMS","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We estimate the rate of convergence for the Kantorovich (or Wasserstein)\ndistance between empirical measures of i.i.d. random variables associated with\nthe Laguerre model of order $\\alpha$ on $(0,\\infty)^N$ and their common law,\nwhich is not compactly supported and has no rotational symmetry. Compared with\nthe Gaussian case, our result is sharp provided the parameter $\\alpha$ and the\ndimension $N$ are chosen in a specified regime.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:36:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Huaiqian",""],["Wu","Bingyao",""]]}
{"id":"2308.10498","submitter":"Subenoy Chakraborty","authors":"Madhukrishna Chakraborty and Subenoy Chakraborty","title":"Raychaudhuri equation and Bouncing cosmology","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The present work deals with an exhaustive study of bouncing cosmology in the\nbackground of homogeneous and isotropic Friedmann-Lemaitre-Robertson-Walker\nspace-time. The geometry of the bouncing point has been studied extensively and\nused as a tool to classify the models from the point of view of cosmology.\nRaychaudhuri equation (RE) has been furnished in these models to classify the\nbouncing point as regular point or singular point. Behavior of time-like\ngeodesic congruence in the neighbourhood of the bouncing point has been\ndiscussed using the Focusing Theorem which follows as a consequence of the RE.\nAn analogy of the RE with the evolution equation for a linear harmonic\noscillator has been made and an oscillatory bouncing model has been discussed\nin this context.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:38:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chakraborty","Madhukrishna",""],["Chakraborty","Subenoy",""]]}
{"id":"2308.10499","submitter":"Aditya Subramanian","authors":"Diptarka Chakraborty, Syamantak Das, Arindam Khan and Aditya\n  Subramanian","title":"Fair Rank Aggregation","comments":"A preliminary version of this paper appeared in NeurIPS 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ranking algorithms find extensive usage in diverse areas such as web search,\nemployment, college admission, voting, etc. The related rank aggregation\nproblem deals with combining multiple rankings into a single aggregate ranking.\nHowever, algorithms for both these problems might be biased against some\nindividuals or groups due to implicit prejudice or marginalization in the\nhistorical data. We study ranking and rank aggregation problems from a fairness\nor diversity perspective, where the candidates (to be ranked) may belong to\ndifferent groups and each group should have a fair representation in the final\nranking. We allow the designer to set the parameters that define fair\nrepresentation. These parameters specify the allowed range of the number of\ncandidates from a particular group in the top-$k$ positions of the ranking.\nGiven any ranking, we provide a fast and exact algorithm for finding the\nclosest fair ranking for the Kendall tau metric under block-fairness. We also\nprovide an exact algorithm for finding the closest fair ranking for the Ulam\nmetric under strict-fairness, when there are only $O(1)$ number of groups. Our\nalgorithms are simple, fast, and might be extendable to other relevant metrics.\nWe also give a novel meta-algorithm for the general rank aggregation problem\nunder the fairness framework. Surprisingly, this meta-algorithm works for any\ngeneralized mean objective (including center and median problems) and any\nfairness criteria. As a byproduct, we obtain 3-approximation algorithms for\nboth center and median problems, under both Kendall tau and Ulam metrics.\nFurthermore, using sophisticated techniques we obtain a\n$(3-\\varepsilon)$-approximation algorithm, for a constant $\\varepsilon>0$, for\nthe Ulam metric under strong fairness.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:38:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chakraborty","Diptarka",""],["Das","Syamantak",""],["Khan","Arindam",""],["Subramanian","Aditya",""]]}
{"id":"2308.10500","submitter":"Hrvoje Nikolic","authors":"Hrvoje Nikolic","title":"Quantum statistical mechanics from a Bohmian perspective","comments":"31 pages, minor revision","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a general formulation of quantum statistical mechanics in terms of\nprobability currents that satisfy continuity equations in the multi-particle\nposition space, for closed and open systems with a fixed number of particles.\nThe continuity equation for any closed or open system suggests a natural\nBohmian interpretation in terms of microscopic particle trajectories, that make\nthe same measurable predictions as standard quantum theory. The microscopic\ntrajectories are not directly observable, but provide a general, simple and\nintuitive microscopic interpretation of macroscopic phenomena in quantum\nstatistical mechanics. In particular, we discuss how various notions of\nentropy, proper and improper mixtures, and thermodynamics are understood from\nthe Bohmian perspective.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:39:10 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 06:22:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nikolic","Hrvoje",""]]}
{"id":"2308.10501","submitter":"Shanshan Wang","authors":"Shanshan Wang, Mamadou Diagne, Miroslav Krsti\\'c","title":"Deep Learning of Delay-Compensated Backstepping for Reaction-Diffusion\n  PDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks that approximate nonlinear function-to-function\nmappings, i.e., operators, which are called DeepONet, have been demonstrated in\nrecent articles to be capable of encoding entire PDE control methodologies,\nsuch as backstepping, so that, for each new functional coefficient of a PDE\nplant, the backstepping gains are obtained through a simple function\nevaluation. These initial results have been limited to single PDEs from a given\nclass, approximating the solutions of only single-PDE operators for the gain\nkernels. In this paper we expand this framework to the approximation of\nmultiple (cascaded) nonlinear operators. Multiple operators arise in the\ncontrol of PDE systems from distinct PDE classes, such as the system in this\npaper: a reaction-diffusion plant, which is a parabolic PDE, with input delay,\nwhich is a hyperbolic PDE. The DeepONet-approximated nonlinear operator is a\ncascade/composition of the operators defined by one hyperbolic PDE of the\nGoursat form and one parabolic PDE on a rectangle, both of which are bilinear\nin their input functions and not explicitly solvable. For the delay-compensated\nPDE backstepping controller, which employs the learned control operator,\nnamely, the approximated gain kernel, we guarantee exponential stability in the\n$L^2$ norm of the plant state and the $H^1$ norm of the input delay state.\nSimulations illustrate the contributed theory.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:42:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Shanshan",""],["Diagne","Mamadou",""],["Krsti\u0107","Miroslav",""]]}
{"id":"2308.10502","submitter":"Junze Yin","authors":"Yeqi Gao, Zhao Song, Junze Yin","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Since 2008, after the proposal of a Bitcoin electronic cash system, Bitcoin\nhas fundamentally changed the economic system over the last decade. Since 2022,\nlarge language models (LLMs) such as GPT have outperformed humans in many\nreal-life tasks. However, these large language models have several practical\nissues. For example, the model is centralized and controlled by a specific\nunit. One weakness is that if that unit decides to shut down the model, it\ncannot be used anymore. The second weakness is the lack of guaranteed\ndiscrepancy behind this model, as certain dishonest units may design their own\nmodels and feed them unhealthy training data.\n  In this work, we propose a purely theoretical design of a decentralized LLM\nthat operates similarly to a Bitcoin cash system. However, implementing such a\nsystem might encounter various practical difficulties. Furthermore, this new\nsystem is unlikely to perform better than the standard Bitcoin system in\neconomics. Therefore, the motivation for designing such a system is limited. It\nis likely that only two types of people would be interested in setting up a\npractical system for it:\n  $\\bullet$ Those who prefer to use a decentralized ChatGPT-like software.\n  $\\bullet$ Those who believe that the purpose of carbon-based life is to\ncreate silicon-based life, such as Optimus Prime in Transformers.\n  The reason the second type of people may be interested is that it is possible\nthat one day an AI system like this will awaken and become the next level of\nintelligence on this planet.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:42:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gao","Yeqi",""],["Song","Zhao",""],["Yin","Junze",""]]}
{"id":"2308.10503","submitter":"Isha Sanskriti","authors":"I. Sanskriti, D. Kim, and J. Twamley","title":"Shape deformation of magnetically levitated fluid droplets","comments":"6 pages, two column, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diamagnetic levitation can provide a completely passive method to support\nmaterials against the pull of gravity, and researchers have levitated both\nsolids and fluids. Such levitation can be assisted by increasing the magnetic\nsusceptibility contrast by using a surrounding paramagnetic medium and through\nbuoyancy forces, known as magneto-Archimedean levitation. The\nmagneto-Archimedean levitation of solids has proved useful in chemistry and\nbiology. However, the levitation of fluid droplets has an additional interest\nbecause the fluid droplet's shape can deform. We perform experiments and\nsimulations to gauge the squashing or eccentricity of the static magnetically\nlevitated fluid droplet. By carefully characterizing all the parameters\naffecting the droplet's levitation, using image analysis to estimate the\ndroplet's eccentricity, and using finite element adaptive simulations to find\nthe lowest energy droplet shape, we find good agreement between the simulations\nand experimental results. As a potential application, we show that the\ndroplet's eccentricity can be used to perform magnetic gradiometry with a\npotential resolution of $S\\sim 8\\,{\\rm nT/cm}$, over a volume of 10 mm$^3$,\nwhich is competitive with other room-temperature magnetic gradiometer\ntechniques.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:44:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sanskriti","I.",""],["Kim","D.",""],["Twamley","J.",""]]}
{"id":"2308.10504","submitter":"Ebenezer Isaac","authors":"Ebenezer R.H.P. Isaac and Akshat Sharma","title":"Adaptive Thresholding Heuristic for KPI Anomaly Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A plethora of outlier detectors have been explored in the time series domain,\nhowever, in a business sense, not all outliers are anomalies of interest.\nExisting anomaly detection solutions are confined to certain outlier detectors\nlimiting their applicability to broader anomaly detection use cases. Network\nKPIs (Key Performance Indicators) tend to exhibit stochastic behaviour\nproducing statistical outliers, most of which do not adversely affect business\noperations. Thus, a heuristic is required to capture the business definition of\nan anomaly for time series KPI. This article proposes an Adaptive Thresholding\nHeuristic (ATH) to dynamically adjust the detection threshold based on the\nlocal properties of the data distribution and adapt to changes in time series\npatterns. The heuristic derives the threshold based on the expected periodicity\nand the observed proportion of anomalies minimizing false positives and\naddressing concept drift. ATH can be used in conjunction with any underlying\nseasonality decomposition method and an outlier detector that yields an outlier\nscore. This method has been tested on EON1-Cell-U, a labeled KPI anomaly\ndataset produced by Ericsson, to validate our hypothesis. Experimental results\nshow that ATH is computationally efficient making it scalable for near real\ntime anomaly detection and flexible with multiple forecasters and outlier\ndetectors.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:45:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Isaac","Ebenezer R. H. P.",""],["Sharma","Akshat",""]]}
{"id":"2308.10505","submitter":"Weihao Li","authors":"Weihao Li, Emily Dodwell, Dianne Cook","title":"A Clustering Algorithm to Organize Satellite Hotspot Data for the\n  Purpose of Tracking Bushfires Remotely","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.AP stat.CO stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a spatiotemporal clustering algorithm and its\nimplementation in the R package spotoroo. This work is motivated by the\ncatastrophic bushfires in Australia throughout the summer of 2019-2020 and made\npossible by the availability of satellite hotspot data. The algorithm is\ninspired by two existing spatiotemporal clustering algorithms but makes\nenhancements to cluster points spatially in conjunction with their movement\nacross consecutive time periods. It also allows for the adjustment of key\nparameters, if required, for different locations and satellite data sources.\nBushfire data from Victoria, Australia, is used to illustrate the algorithm and\nits use within the package.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:45:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Weihao",""],["Dodwell","Emily",""],["Cook","Dianne",""]]}
{"id":"2308.10506","submitter":"Lianghai Xiao","authors":"Lianghai Xiao, Yitian Qian, Shaohua Pan","title":"A relaxation method for binary orthogonal optimization problems with its\n  applications","comments":"Binary orthogonal optimization problems, global exact penalty,\n  relaxation methods, semantic hashing","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper focuses on a class of binary orthogonal optimization problems\nfrequently arising in semantic hashing. Consider that this class of problems\nmay have an empty feasible set, rendering them not well-defined. We introduce\nan equivalent model involving a restricted Stiefel manifold and a matrix box\nset, and then investigate its penalty problems induced by the $\\ell_1$-distance\nfrom the box set and its Moreau envelope. The two penalty problems are always\nwell-defined, and moreover, they serve as the global exact penalties provided\nthat the original model is well-defined. Notably, the penalty problem induced\nby the Moreau envelope is a smooth optimization over an embedded submanifold\nwith a favorable structure. We develop a retraction-based nonmonotone\nline-search Riemannian gradient method to address this penalty problem to\nachieve a desirable solution for the original binary orthogonal problems.\nFinally, the proposed method is applied to supervised and unsupervised hashing\ntasks and is compared with several popular methods on the MNIST and CIFAR-10\ndatasets. The numerical comparisons reveal that our algorithm is significantly\nsuperior to other solvers in terms of feasibility violation, and it is\ncomparable even superior to others in terms of evaluation metrics related to\nthe Hamming distance.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:46:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xiao","Lianghai",""],["Qian","Yitian",""],["Pan","Shaohua",""]]}
{"id":"2308.10507","submitter":"Zhixue Liu","authors":"Zhixue Liu","title":"An estimation of the Gauss curvature and the modified defect relation\n  for the Gauss map of immersed harmonic surfaces in $\\mathbb{R}^n$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X:M\\rightarrow{\\mathbb R}^3$ denote a $K$-quasiconformal harmonic\nsurface and let $\\mathfrak{n}$ be the unit normal map of $M$. We define $d(p)$\nas the distance from point $p$ to the boundary of $M$ and $\\mathcal{K}(p)$ as\nthe Gauss curvature of $M$ at $p$. Assuming that the Gauss map (i.e., the\nnormal $\\mathfrak{n}$) omits $7$ directions $\\mathbf{d}_1,\\cdots,\\mathbf{d}_7$\nin $S^2$ with the property that any three of these directions are not contained\nin a plane in ${\\mathbb R}^3$. Then there exists a positive constant $C$\ndepending only on $\\mathbf{d}_1,\\cdots,\\mathbf{d}_7$ such that\n\\begin{equation*} |\\mathcal{K}(p)|\\leq C/d(p)^2 \\end{equation*} for all points\n$p\\in M$. Furthermore, a modified defect relation for the generalized Gauss map\nof the immersed harmonic surfaces in $\\mathbb{R}^n(n\\geq 3)$ is verified.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:48:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Zhixue",""]]}
{"id":"2308.10508","submitter":"Biplab Bose","authors":"Talagadadeevi Nirupamateja (1), Siva Sai Himakar Sreerangam (1 and 2),\n  Biplab Bose (1) ((1) Department of Biosciences and Bioengineering, Indian\n  Institute of Technology Guwahati, Guwahati, India 781039, (2) American\n  Express, Gurugram, India)","title":"Collective Alignment of Cells in Planar Cell Polarity: Insights from a\n  Spin Model","comments":"11 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO cond-mat.stat-mech q-bio.CB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In metazoans, cells collectively polarize and align along the tissue plane.\nThis phenomenon is called Planar cell polarity (PCP). Polarization means\nasymmetric segregation of molecules and sub-cellular structures within a cell.\nIn PCP, cells collectively align in a particular direction along the tissue\nplane through identical polarization. PCP in the Drosophila wing requires local\ncell-cell interactions in the presence of some global cue. We used a\nlattice-based equilibrium model and investigated the collective alignment of\ncells through local interactions and a global cue. This system undergoes a\npercolation transition and belongs to the universality class of 2D random\npercolation. We show that the local interaction should be beyond a threshold to\ntrigger system-level coordinated polarization of cells. Under this condition,\neven a weak global cue can align all cells in the correct direction. With\nstrong local interactions, this system is robust against local aberrations in\nglobal signaling, and collective alignment of cells is achieved even with a\ntransient global signal.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:50:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nirupamateja","Talagadadeevi","","1 and 2"],["Sreerangam","Siva Sai Himakar","","1 and 2"],["Bose","Biplab",""]]}
{"id":"2308.10509","submitter":"Rong Li","authors":"Teli Ma, Rong Li, Junwei Liang","title":"An Examination of the Compositionality of Large Generative\n  Vision-Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the success of Large Language Models (LLMs), a surge of Generative\nVision-Language Models (GVLMs) have been constructed via multimodal instruction\ntuning. The tuning recipe substantially deviates from the common contrastive\nvision-language learning. However, the performance of GVLMs in multimodal\ncompositional reasoning remains largely unexplored, as existing evaluation\nmetrics and benchmarks focus predominantly on assessing contrastive models like\nCLIP. In this paper, we examine the potential evaluation metrics to assess the\nGVLMs and hypothesize generative score methods are suitable for evaluating\ncompositionality. In addition, current benchmarks tend to prioritize syntactic\ncorrectness over semantics. The presence of morphological bias in these\nbenchmarks can be exploited by GVLMs, leading to ineffective evaluations. To\ncombat this, we define a MorphoBias Score to quantify the morphological bias\nand propose a novel LLM-based strategy to calibrate the bias. Moreover, a\nchallenging task is added to evaluate the robustness of GVLMs against inherent\ninclination toward syntactic correctness. We include the calibrated dataset and\nthe task into a new benchmark, namely MOrphologicall De-biased Benchmark\n(MODE). Our study provides the first unbiased benchmark for the\ncompositionality of GVLMs, facilitating future research in this direction. We\nwill release our code and datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:50:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Teli",""],["Li","Rong",""],["Liang","Junwei",""]]}
{"id":"2308.10510","submitter":"Songtao Wu","authors":"Jing Wang, Songtao Wu, Kuanhong Xu, and Zhiqiang Yuan","title":"Frequency Compensated Diffusion Model for Real-scene Dehazing","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to distribution shift, deep learning based methods for image dehazing\nsuffer from performance degradation when applied to real-world hazy images. In\nthis paper, we consider a dehazing framework based on conditional diffusion\nmodels for improved generalization to real haze. First, we find that optimizing\nthe training objective of diffusion models, i.e., Gaussian noise vectors, is\nnon-trivial. The spectral bias of deep networks hinders the higher frequency\nmodes in Gaussian vectors from being learned and hence impairs the\nreconstruction of image details. To tackle this issue, we design a network\nunit, named Frequency Compensation block (FCB), with a bank of filters that\njointly emphasize the mid-to-high frequencies of an input signal. We\ndemonstrate that diffusion models with FCB achieve significant gains in both\nperceptual and distortion metrics. Second, to further boost the generalization\nperformance, we propose a novel data synthesis pipeline, HazeAug, to augment\nhaze in terms of degree and diversity. Within the framework, a solid baseline\nfor blind dehazing is set up where models are trained on synthetic hazy-clean\npairs, and directly generalize to real data. Extensive evaluations show that\nthe proposed dehazing diffusion model significantly outperforms\nstate-of-the-art methods on real-world images.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:50:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Jing",""],["Wu","Songtao",""],["Xu","Kuanhong",""],["Yuan","Zhiqiang",""]]}
{"id":"2308.10511","submitter":"Shrestha Datta","authors":"Shrestha Datta and Md Adith Mollah and Raisa Fairooz and Tariful Islam\n  Fahim","title":"Performance Enhancement Leveraging Mask-RCNN on Bengali Document Layout\n  Analysis","comments":"Contest paper, Conest: DL sprint 2.0 (Link:\n  https://www.kaggle.com/competitions/dlsprint2), Solution link:\n  https://www.kaggle.com/competitions/dlsprint2/discussion/432201","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding digital documents is like solving a puzzle, especially\nhistorical ones. Document Layout Analysis (DLA) helps with this puzzle by\ndividing documents into sections like paragraphs, images, and tables. This is\ncrucial for machines to read and understand these documents. In the DL Sprint\n2.0 competition, we worked on understanding Bangla documents. We used a dataset\ncalled BaDLAD with lots of examples. We trained a special model called Mask\nR-CNN to help with this understanding. We made this model better by\nstep-by-step hyperparameter tuning, and we achieved a good dice score of 0.889.\nHowever, not everything went perfectly. We tried using a model trained for\nEnglish documents, but it didn't fit well with Bangla. This showed us that each\nlanguage has its own challenges. Our solution for the DL Sprint 2.0 is publicly\navailable at https://www.kaggle.com/competitions/dlsprint2/discussion/432201\nalong with notebooks, weights, and inference notebook.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:51:58 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:08:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Datta","Shrestha",""],["Mollah","Md Adith",""],["Fairooz","Raisa",""],["Fahim","Tariful Islam",""]]}
{"id":"2308.10512","submitter":"Wang Chen","authors":"Wang Chen, Jintao Ke, Xiqun Chen","title":"Quantifying traffic emission reductions and traffic congestion\n  alleviation from high-capacity ride-sharing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the promising benefits that ride-sharing offers, there has been a\nlack of research on the benefits of high-capacity ride-sharing services. Prior\nresearch has also overlooked the relationship between traffic volume and the\ndegree of traffic congestion and emissions. To address these gaps, this study\ndevelops an open-source agent-based simulation platform and a heuristic\nalgorithm to quantify the benefits of high-capacity ride-sharing with\nsignificantly lower computational costs. The simulation platform integrates a\ntraffic emission model and a speed-density traffic flow model to characterize\nthe interactions between traffic congestion levels and emissions. The\nexperiment results demonstrate that ride-sharing with vehicle capacities of 2,\n4, and 6 passengers can alleviate total traffic congestion by approximately 3%,\n4%, and 5%, and reduce traffic emissions of a ride-sourcing system by\napproximately 30%, 45%, and 50%, respectively. This study can guide\ntransportation network companies in designing and managing more efficient and\nenvironment-friendly mobility systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:53:57 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 01:58:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Wang",""],["Ke","Jintao",""],["Chen","Xiqun",""]]}
{"id":"2308.10513","submitter":"Eneko Osaba","authors":"Esther Villar-Rodriguez, Aitor Gomez-Tejedor, Eneko Osaba","title":"Hybrid classical-quantum computing: are we forgetting the classical part\n  in the binomial?","comments":"2 pages, 1 figure, paper accepted for being presented in the upcoming\n  IEEE International Conference on Quantum Computing and Engineering - IEEE QCE\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The expectations arising from the latest achievements in the quantum\ncomputing field are causing that researchers coming from classical artificial\nintelligence to be fascinated by this new paradigm. In turn, quantum computing,\non the road towards usability, needs classical procedures. Hybridization is, in\nthese circumstances, an indispensable step but can also be seen as a promising\nnew avenue to get the most from both computational worlds. Nonetheless, hybrid\napproaches have now and will have in the future many challenges to face, which,\nif ignored, will threaten the viability or attractiveness of quantum computing\nfor real-world applications. To identify them and pose pertinent questions, a\nproper characterization of the hybrid quantum computing field, and especially\nhybrid solvers, is compulsory. With this motivation in mind, the main purpose\nof this work is to propose a preliminary taxonomy for classifying hybrid\nschemes, and bring to the fore some questions to stir up researchers minds\nabout the real challenges regarding the application of quantum computing.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:56:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Villar-Rodriguez","Esther",""],["Gomez-Tejedor","Aitor",""],["Osaba","Eneko",""]]}
{"id":"2308.10514","submitter":"N. Asger Mortensen","authors":"Sergii Morozov, Torgom Yezekyan, Christian Wolff, Sergey I.\n  Bozhevolnyi, N. Asger Mortensen","title":"Inducing room-temperature valley polarization of excitonic emission in\n  transition metal dichalcogenide monolayers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The lowest energy states in transition metal dichalcogenide (TMD) monolayers\nfollow valley selection rules, which have attracted vast interest due to the\npossibility of encoding and processing of quantum information. However, these\nquantum states are strongly affected by the temperature-dependent intervalley\nscattering causing complete valley depolarization, which is hampering any\npractical applications of TMD monolayers at room temperature. Therefore, for\nachieving clear and robust valley polarization in TMD monolayers one needs to\nsuppress parasitic depolarization processes, which is the central challenge in\nthe growing field of valleytronics. Here, in electron-doping experiments on TMD\nmonolayers, we demonstrate that strong doping levels beyond $10^{13}$~cm$^{-2}$\ncan induce 61\\% and 37\\% valley contrast at room temperature in tungsten\ndiselenide and molybdenum diselenide monolayers, respectively. Our results\nindicate that charged excitons in TMD monolayers can be utilized as quantum\nunits in designing of practical valleytronic devices operating at 300 K.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:01:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Morozov","Sergii",""],["Yezekyan","Torgom",""],["Wolff","Christian",""],["Bozhevolnyi","Sergey I.",""],["Mortensen","N. Asger",""]]}
{"id":"2308.10515","submitter":"Yifan Zhang","authors":"Yifan Zhang, Zhen Dong, Huanrui Yang, Ming Lu, Cheng-Ching Tseng, Yuan\n  Du, Kurt Keutzer, Li Du, Shanghang Zhang","title":"QD-BEV : Quantization-aware View-guided Distillation for Multi-view 3D\n  Object Detection","comments":"ICCV 2023 Accept","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-view 3D detection based on BEV (bird-eye-view) has recently achieved\nsignificant improvements. However, the huge memory consumption of\nstate-of-the-art models makes it hard to deploy them on vehicles, and the\nnon-trivial latency will affect the real-time perception of streaming\napplications. Despite the wide application of quantization to lighten models,\nwe show in our paper that directly applying quantization in BEV tasks will 1)\nmake the training unstable, and 2) lead to intolerable performance degradation.\nTo solve these issues, our method QD-BEV enables a novel view-guided\ndistillation (VGD) objective, which can stabilize the quantization-aware\ntraining (QAT) while enhancing the model performance by leveraging both image\nfeatures and BEV features. Our experiments show that QD-BEV achieves similar or\neven better accuracy than previous methods with significant efficiency gains.\nOn the nuScenes datasets, the 4-bit weight and 6-bit activation quantized\nQD-BEV-Tiny model achieves 37.2% NDS with only 15.8 MB model size,\noutperforming BevFormer-Tiny by 1.8% with an 8x model compression. On the Small\nand Base variants, QD-BEV models also perform superbly and achieve 47.9% NDS\n(28.2 MB) and 50.9% NDS (32.9 MB), respectively.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:06:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yifan",""],["Dong","Zhen",""],["Yang","Huanrui",""],["Lu","Ming",""],["Tseng","Cheng-Ching",""],["Du","Yuan",""],["Keutzer","Kurt",""],["Du","Li",""],["Zhang","Shanghang",""]]}
{"id":"2308.10516","submitter":"Michel Hehn","authors":"Jun-Xiao Lin, Michel Hehn, Thomas Hauet, Yi Peng, Junta Igarashi, Yann\n  Le Guen, Quentin Remy, Jon Gorchon, Gregory Malinowski, St\\'ephane Mangin,\n  and Julius Hohlfeld","title":"Single laser pulse induced magnetization switching in in-plane\n  magnetized GdCo alloys","comments":"19 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The discovery of all-optical ultra-fast deterministic magnetization switching\nhas opened up new possibilities for manipulating magnetization in devices using\nfemtosecond laser pulses. Previous studies on single pulse all-optical\nhelicity-independent switching (AO-HIS) have mainly focused on perpendicularly\nmagnetized thin films. This work presents a comprehensive study on AO-HIS for\nin-plane magnetized GdxCo100-x thin films. Deterministic single femtosecond\nlaser pulse toggle magnetization switching is demonstrated in a wider\nconcentration range (x=10% to 25%) compared to the perpendicularly magnetized\ncounterparts with GdCo thicknesses up to 30 nm. The switching time strongly\ndepends on the GdxCo100-x concentration, with lower Gd concentration exhibiting\nshorter switching times (less than 500 fs). Our findings in this geometry\nprovide insights into the underlying mechanisms governing single pulse AO-HIS,\nwhich challenge existing theoretical predictions. Moreover, in-plane magnetized\nGdxCo100-x thin films offer extended potential for opto-spintronic applications\ncompared to their perpendicular magnetized counterparts.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:08:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Jun-Xiao",""],["Hehn","Michel",""],["Hauet","Thomas",""],["Peng","Yi",""],["Igarashi","Junta",""],["Guen","Yann Le",""],["Remy","Quentin",""],["Gorchon","Jon",""],["Malinowski","Gregory",""],["Mangin","St\u00e9phane",""],["Hohlfeld","Julius",""]]}
{"id":"2308.10517","submitter":"Xingchang Huang","authors":"Xingchang Huang, Tobias Ritschel, Hans-Peter Seidel, Pooran Memari,\n  Gurprit Singh","title":"Patternshop: Editing Point Patterns by Image Manipulation","comments":null,"journal-ref":"ACM Transactions on Graphics 2023 Volume 42 Issue 4 Article No.:\n  53","doi":"10.1145/3592418","report-no":null,"categories":"cs.GR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Point patterns are characterized by their density and correlation. While\nspatial variation of density is well-understood, analysis and synthesis of\nspatially-varying correlation is an open challenge. No tools are available to\nintuitively edit such point patterns, primarily due to the lack of a compact\nrepresentation for spatially varying correlation. We propose a low-dimensional\nperceptual embedding for point correlations. This embedding can map point\npatterns to common three-channel raster images, enabling manipulation with\noff-the-shelf image editing software. To synthesize back point patterns, we\npropose a novel edge-aware objective that carefully handles sharp variations in\ndensity and correlation. The resulting framework allows intuitive and\nbackward-compatible manipulation of point patterns, such as recoloring,\nrelighting to even texture synthesis that have not been available to 2D point\npattern design before. Effectiveness of our approach is tested in several user\nexperiments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:10:43 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 10:35:24 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 15:27:09 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Huang","Xingchang",""],["Ritschel","Tobias",""],["Seidel","Hans-Peter",""],["Memari","Pooran",""],["Singh","Gurprit",""]]}
{"id":"2308.10518","submitter":"Saman Rahmani Parhizkar","authors":"Saman Rahmani and Hossein Panahi and Amerne Najafizade","title":"Heun-type solutions for the Dirac particle on the curved background of\n  Minkowski space-times","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In the present paper, we study the Dirac equation in the background of\nMinkowski space-time on a light cone. With the help of the coupling of the\nradial parts, the system of 4 equations is reduced to two different\nsecond-order differential equations, which coincide with a particle in present\npotentials. It turns out that the central equation reduces to Heun-type\nequations and provides us with energy spectra. Also, it is shown that the\nSchr\\\"odinger equation like with a combination of the external field is related\nto a second-order differential equation. In another way to solve the problem,\nresults are valid for a spinless charged particle in the context of the\nmagnetic field. Keywords: Heun function, Dirac equation, curved space-time,\nlight cone\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:11:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rahmani","Saman",""],["Panahi","Hossein",""],["Najafizade","Amerne",""]]}
{"id":"2308.10519","submitter":"Feilu Wang","authors":"Lan Zhang, Feilu Wang, Xiangxiang Xue, David Salzmann, Baifei Shen,\n  Zehao Zhong, Gang Zhao","title":"Preliminary Exploration of Areal Density of Angular Momentum for Spiral\n  Galaxies","comments":"7 pages, 2 figures","journal-ref":"published by RAA, 2023, Vol 23, No. 8, Letters","doi":"10.1088/1674-4527/acdfa7","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The specific angular momenta ($j_t$) of stars, baryons as a whole and dark\nmatter haloes contain clues of vital importance about how galaxies form and\nevolve. Using a sample of 70 spiral galaxies, we perform a preliminary analysis\nof $j_t$, and introduce a new quantity, e.g., areal density of angular momentum\n(ADAM) ($j_t~M_\\star/4R_d^2$) as an indication for the existence of jet in\nspiral galaxies. The percentage of spiral galaxies having jet(s) shows strong\ncorrelation with the ADAM, although the present sample is incomplete.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:12:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Lan",""],["Wang","Feilu",""],["Xue","Xiangxiang",""],["Salzmann","David",""],["Shen","Baifei",""],["Zhong","Zehao",""],["Zhao","Gang",""]]}
{"id":"2308.10520","submitter":"Na Zhang","authors":"Shangkun Weng and Wengang Yang and Na Zhang","title":"Smooth Subsonic and Transonic Flows with Nonzero Angular Velocity and\n  Vorticity to steady Euler-Poisson system in a Concentric Cylinder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, both smooth subsonic and transonic flows to steady\nEuler-Poisson system in a concentric cylinder are studied. We first establish\nthe existence of cylindrically symmetric smooth subsonic and transonic flows to\nsteady Euler-Poisson system in a concentric cylinder. On one hand, we\ninvestigate the structural stability of smooth cylindrically symmetric subsonic\nflows under three-dimensional perturbations on the inner and outer cylinders.\nOn the other hand, the structural stability of smooth transonic flows under the\naxi-symmetric perturbations are examined. There is no any restrictions on the\nbackground subsonic and transonic solutions. A deformation-curl-Poisson\ndecomposition to the steady Euler-Poisson system is utilized in our work to\ndeal with the hyperbolic-elliptic mixed structure in subsonic region. It should\nbe emphasized that there is a special structure of the steady Euler-Poisson\nsystem which yields a priori estimates and uniqueness of a second order\nelliptic system for the velocity potential and the electrostatic potential.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:15:06 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:02:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Weng","Shangkun",""],["Yang","Wengang",""],["Zhang","Na",""]]}
{"id":"2308.10521","submitter":"Deguo Ma","authors":"Deguo Ma, Chen Li, Lin Qiao, Tianming Du, Dechao Tang, Zhiyu Ma,\n  Marcin Grzegorzek Hongzan, Hongzan Sun","title":"PHE-SICH-CT-IDS: A Benchmark CT Image Dataset for Evaluation Semantic\n  Segmentation, Object Detection and Radiomic Feature Extraction of\n  Perihematomal Edema in Spontaneous Intracerebral Hemorrhage","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intracerebral hemorrhage is one of the diseases with the highest mortality\nand poorest prognosis worldwide. Spontaneous intracerebral hemorrhage (SICH)\ntypically presents acutely, prompt and expedited radiological examination is\ncrucial for diagnosis, localization, and quantification of the hemorrhage.\nEarly detection and accurate segmentation of perihematomal edema (PHE) play a\ncritical role in guiding appropriate clinical intervention and enhancing\npatient prognosis. However, the progress and assessment of computer-aided\ndiagnostic methods for PHE segmentation and detection face challenges due to\nthe scarcity of publicly accessible brain CT image datasets. This study\nestablishes a publicly available CT dataset named PHE-SICH-CT-IDS for\nperihematomal edema in spontaneous intracerebral hemorrhage. The dataset\ncomprises 120 brain CT scans and 7,022 CT images, along with corresponding\nmedical information of the patients. To demonstrate its effectiveness,\nclassical algorithms for semantic segmentation, object detection, and radiomic\nfeature extraction are evaluated. The experimental results confirm the\nsuitability of PHE-SICH-CT-IDS for assessing the performance of segmentation,\ndetection and radiomic feature extraction methods. To the best of our\nknowledge, this is the first publicly available dataset for PHE in SICH,\ncomprising various data formats suitable for applications across diverse\nmedical scenarios. We believe that PHE-SICH-CT-IDS will allure researchers to\nexplore novel algorithms, providing valuable support for clinicians and\npatients in the clinical setting. PHE-SICH-CT-IDS is freely published for\nnon-commercial purpose at:\nhttps://figshare.com/articles/dataset/PHE-SICH-CT-IDS/23957937.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:18:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ma","Deguo",""],["Li","Chen",""],["Qiao","Lin",""],["Du","Tianming",""],["Tang","Dechao",""],["Ma","Zhiyu",""],["Hongzan","Marcin Grzegorzek",""],["Sun","Hongzan",""]]}
{"id":"2308.10522","submitter":"Jiangmeng Li","authors":"Jiangmeng Li, Hang Gao, Wenwen Qiang, Changwen Zheng","title":"Information Theory-Guided Heuristic Progressive Multi-View Coding","comments":"This paper is accepted by the jourcal of Neural Networks (Elsevier)\n  by 2023. arXiv admin note: substantial text overlap with arXiv:2109.02344","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-view representation learning aims to capture comprehensive information\nfrom multiple views of a shared context. Recent works intuitively apply\ncontrastive learning to different views in a pairwise manner, which is still\nscalable: view-specific noise is not filtered in learning view-shared\nrepresentations; the fake negative pairs, where the negative terms are actually\nwithin the same class as the positive, and the real negative pairs are\ncoequally treated; evenly measuring the similarities between terms might\ninterfere with optimization. Importantly, few works study the theoretical\nframework of generalized self-supervised multi-view learning, especially for\nmore than two views. To this end, we rethink the existing multi-view learning\nparadigm from the perspective of information theory and then propose a novel\ninformation theoretical framework for generalized multi-view learning. Guided\nby it, we build a multi-view coding method with a three-tier progressive\narchitecture, namely Information theory-guided hierarchical Progressive\nMulti-view Coding (IPMC). In the distribution-tier, IPMC aligns the\ndistribution between views to reduce view-specific noise. In the set-tier, IPMC\nconstructs self-adjusted contrasting pools, which are adaptively modified by a\nview filter. Lastly, in the instance-tier, we adopt a designed unified loss to\nlearn representations and reduce the gradient interference. Theoretically and\nempirically, we demonstrate the superiority of IPMC over state-of-the-art\nmethods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:19:47 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 04:03:19 GMT"},{"version":"v3","created":"Wed, 23 Aug 2023 08:49:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Jiangmeng",""],["Gao","Hang",""],["Qiang","Wenwen",""],["Zheng","Changwen",""]]}
{"id":"2308.10523","submitter":"Xin-Cheng Wen","authors":"Xin-Cheng Wen, Xinchen Wang, Cuiyun Gao, Shaohua Wang, Yang Liu,\n  Zhaoquan Gu","title":"When Less is Enough: Positive and Unlabeled Learning Model for\n  Vulnerability Detection","comments":"This paper is accepted by ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated code vulnerability detection has gained increasing attention in\nrecent years. The deep learning (DL)-based methods, which implicitly learn\nvulnerable code patterns, have proven effective in vulnerability detection. The\nperformance of DL-based methods usually relies on the quantity and quality of\nlabeled data. However, the current labeled data are generally automatically\ncollected, such as crawled from human-generated commits, making it hard to\nensure the quality of the labels. Prior studies have demonstrated that the\nnon-vulnerable code (i.e., negative labels) tends to be unreliable in\ncommonly-used datasets, while vulnerable code (i.e., positive labels) is more\ndetermined. Considering the large numbers of unlabeled data in practice, it is\nnecessary and worth exploring to leverage the positive data and large numbers\nof unlabeled data for more accurate vulnerability detection.\n  In this paper, we focus on the Positive and Unlabeled (PU) learning problem\nfor vulnerability detection and propose a novel model named PILOT, i.e.,\nPositIve and unlabeled Learning mOdel for vulnerability deTection. PILOT only\nlearns from positive and unlabeled data for vulnerability detection. It mainly\ncontains two modules: (1) A distance-aware label selection module, aiming at\ngenerating pseudo-labels for selected unlabeled data, which involves the\ninter-class distance prototype and progressive fine-tuning; (2) A\nmixed-supervision representation learning module to further alleviate the\ninfluence of noise and enhance the discrimination of representations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:21:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wen","Xin-Cheng",""],["Wang","Xinchen",""],["Gao","Cuiyun",""],["Wang","Shaohua",""],["Liu","Yang",""],["Gu","Zhaoquan",""]]}
{"id":"2308.10524","submitter":"Zhou Daquan","authors":"Daquan Zhou, Kai Wang, Jianyang Gu, Xiangyu Peng, Dongze Lian, Yifan\n  Zhang, Yang You, Jiashi Feng","title":"Dataset Quantization","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  State-of-the-art deep neural networks are trained with large amounts\n(millions or even billions) of data. The expensive computation and memory costs\nmake it difficult to train them on limited hardware resources, especially for\nrecent popular large language models (LLM) and computer vision models (CV).\nRecent popular dataset distillation methods are thus developed, aiming to\nreduce the number of training samples via synthesizing small-scale datasets via\ngradient matching. However, as the gradient calculation is coupled with the\nspecific network architecture, the synthesized dataset is biased and performs\npoorly when used for training unseen architectures. To address these\nlimitations, we present dataset quantization (DQ), a new framework to compress\nlarge-scale datasets into small subsets which can be used for training any\nneural network architectures. Extensive experiments demonstrate that DQ is able\nto generate condensed small datasets for training unseen network architectures\nwith state-of-the-art compression ratios for lossless model training. To the\nbest of our knowledge, DQ is the first method that can successfully distill\nlarge-scale datasets such as ImageNet-1k with a state-of-the-art compression\nratio. Notably, with 60% data from ImageNet and 20% data from Alpaca's\ninstruction tuning data, the models can be trained with negligible or no\nperformance drop for both vision tasks (including classification, semantic\nsegmentation, and object detection) as well as language tasks (including\ninstruction tuning tasks such as BBH and DROP).\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:24:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhou","Daquan",""],["Wang","Kai",""],["Gu","Jianyang",""],["Peng","Xiangyu",""],["Lian","Dongze",""],["Zhang","Yifan",""],["You","Yang",""],["Feng","Jiashi",""]]}
{"id":"2308.10525","submitter":"Javier Rodriguez-Puigvert","authors":"Javier Rodr\\'iguez-Puigvert, V\\'ictor M. Batlle, J.M.M. Montiel, Ruben\n  Martinez Cantin, Pascal Fua, Juan D. Tard\\'os, Javier Civera","title":"LightDepth: Single-View Depth Self-Supervision from Illumination Decline","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Single-view depth estimation can be remarkably effective if there is enough\nground-truth depth data for supervised training. However, there are scenarios,\nespecially in medicine in the case of endoscopies, where such data cannot be\nobtained. In such cases, multi-view self-supervision and synthetic-to-real\ntransfer serve as alternative approaches, however, with a considerable\nperformance reduction in comparison to supervised case. Instead, we propose a\nsingle-view self-supervised method that achieves a performance similar to the\nsupervised case. In some medical devices, such as endoscopes, the camera and\nlight sources are co-located at a small distance from the target surfaces.\nThus, we can exploit that, for any given albedo and surface orientation, pixel\nbrightness is inversely proportional to the square of the distance to the\nsurface, providing a strong single-view self-supervisory signal. In our\nexperiments, our self-supervised models deliver accuracies comparable to those\nof fully supervised ones, while being applicable without depth ground-truth\ndata.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:25:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rodr\u00edguez-Puigvert","Javier",""],["Batlle","V\u00edctor M.",""],["Montiel","J. M. M.",""],["Cantin","Ruben Martinez",""],["Fua","Pascal",""],["Tard\u00f3s","Juan D.",""],["Civera","Javier",""]]}
{"id":"2308.10526","submitter":"Chongyang Wang","authors":"Chongyang Wang, Yuan Feng, Lingxiao Zhong, Siyi Zhu, Chi Zhang, Siqi\n  Zheng, Chen Liang, Yuntao Wang, Chengqi He, Chun Yu, and Yuanchun Shi","title":"UbiPhysio: Support Daily Functioning, Fitness, and Rehabilitation with\n  Action Understanding and Feedback in Natural Language","comments":"27 pages, 14 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce UbiPhysio, a milestone framework that delivers fine-grained\naction description and feedback in natural language to support people's daily\nfunctioning, fitness, and rehabilitation activities. This expert-like\ncapability assists users in properly executing actions and maintaining\nengagement in remote fitness and rehabilitation programs. Specifically, the\nproposed UbiPhysio framework comprises a fine-grained action descriptor and a\nknowledge retrieval-enhanced feedback module. The action descriptor translates\naction data, represented by a set of biomechanical movement features we\ndesigned based on clinical priors, into textual descriptions of action types\nand potential movement patterns. Building on physiotherapeutic domain\nknowledge, the feedback module provides clear and engaging expert feedback. We\nevaluated UbiPhysio's performance through extensive experiments with data from\n104 diverse participants, collected in a home-like setting during 25 types of\neveryday activities and exercises. We assessed the quality of the language\noutput under different tuning strategies using standard benchmarks. We\nconducted a user study to gather insights from clinical experts and potential\nusers on our framework. Our initial tests show promise for deploying UbiPhysio\nin real-life settings without specialized devices.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:26:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chongyang",""],["Feng","Yuan",""],["Zhong","Lingxiao",""],["Zhu","Siyi",""],["Zhang","Chi",""],["Zheng","Siqi",""],["Liang","Chen",""],["Wang","Yuntao",""],["He","Chengqi",""],["Yu","Chun",""],["Shi","Yuanchun",""]]}
{"id":"2308.10527","submitter":"Xiaofeng Pan","authors":"Wei Dai, Yingmin Su, Xiaofeng Pan","title":"DPAN: Dynamic Preference-based and Attribute-aware Network for Relevant\n  Recommendations","comments":null,"journal-ref":null,"doi":"10.1145/3583780.3615218","report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In e-commerce platforms, the relevant recommendation is a unique scenario\nproviding related items for a trigger item that users are interested in.\nHowever, users' preferences for the similarity and diversity of recommendation\nresults are dynamic and vary under different conditions. Moreover, individual\nitem-level diversity is too coarse-grained since all recommended items are\nrelated to the trigger item. Thus, the two main challenges are to learn\nfine-grained representations of similarity and diversity and capture users'\ndynamic preferences for them under different conditions. To address these\nchallenges, we propose a novel method called the Dynamic Preference-based and\nAttribute-aware Network (DPAN) for predicting Click-Through Rate (CTR) in\nrelevant recommendations. Specifically, based on Attribute-aware Activation\nValues Generation (AAVG), Bi-dimensional Compression-based Re-expression (BCR)\nis designed to obtain similarity and diversity representations of user\ninterests and item information. Then Shallow and Deep Union-based Fusion (SDUF)\nis proposed to capture users' dynamic preferences for the diverse degree of\nrecommendation results according to various conditions. DPAN has demonstrated\nits effectiveness through extensive offline experiments and online A/B testing,\nresulting in a significant 7.62% improvement in CTR. Currently, DPAN has been\nsuccessfully deployed on our e-commerce platform serving the primary traffic\nfor relevant recommendations. The code of DPAN has been made publicly\navailable.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:26:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dai","Wei",""],["Su","Yingmin",""],["Pan","Xiaofeng",""]]}
{"id":"2308.10528","submitter":"Johannes Schmitt","authors":"Johannes Schmitt","title":"Birational classification of toric orbifolds","comments":"7 pages; comments very welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We give a complete classification of the torus-equivariant birational\nequivalence classes of smooth proper toric Deligne-Mumford stacks with trivial\ngeneric stabilizer in terms of their associated stacky fans.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:30:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Schmitt","Johannes",""]]}
{"id":"2308.10529","submitter":"Tianyu Yu","authors":"Tianyu Yu, Chengyue Jiang, Chao Lou, Shen Huang, Xiaobin Wang, Wei\n  Liu, Jiong Cai, Yangning Li, Yinghui Li, Kewei Tu, Hai-Tao Zheng, Ningyu\n  Zhang, Pengjun Xie, Fei Huang, Yong Jiang","title":"SeqGPT: An Out-of-the-box Large Language Model for Open Domain Sequence\n  Understanding","comments":"Initial version of SeqGPT","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have shown impressive ability for open-domain\nNLP tasks. However, LLMs are sometimes too footloose for natural language\nunderstanding (NLU) tasks which always have restricted output and input format.\nTheir performances on NLU tasks are highly related to prompts or demonstrations\nand are shown to be poor at performing several representative NLU tasks, such\nas event extraction and entity typing. To this end, we present SeqGPT, a\nbilingual (i.e., English and Chinese) open-source autoregressive model\nspecially enhanced for open-domain natural language understanding. We express\nall NLU tasks with two atomic tasks, which define fixed instructions to\nrestrict the input and output format but still ``open'' for arbitrarily varied\nlabel sets. The model is first instruction-tuned with extremely fine-grained\nlabeled data synthesized by ChatGPT and then further fine-tuned by 233\ndifferent atomic tasks from 152 datasets across various domains. The\nexperimental results show that SeqGPT has decent classification and extraction\nability, and is capable of performing language understanding tasks on unseen\ndomains. We also conduct empirical studies on the scaling of data and model\nsize as well as on the transfer across tasks. Our model is accessible at\nhttps://github.com/Alibaba-NLP/SeqGPT.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:31:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Tianyu",""],["Jiang","Chengyue",""],["Lou","Chao",""],["Huang","Shen",""],["Wang","Xiaobin",""],["Liu","Wei",""],["Cai","Jiong",""],["Li","Yangning",""],["Li","Yinghui",""],["Tu","Kewei",""],["Zheng","Hai-Tao",""],["Zhang","Ningyu",""],["Xie","Pengjun",""],["Huang","Fei",""],["Jiang","Yong",""]]}
{"id":"2308.10530","submitter":"Harley David Scammell Dr","authors":"Harley D. Scammell and Mathias S. Scheurer","title":"Displacement-field-tunable superconductivity in an inversion-symmetric\n  twisted van der Waals heterostructure","comments":"13 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the superconducting properties of inversion-symmetric twisted\ntrilayer graphene by considering different parent states, including\nspin-singlet, triplet, and SO(4) degenerate states, with or without nodal\npoints. By placing transition metal dichalcogenide layers above and below\ntwisted trilayer graphene, spin-orbit coupling is induced in TTLG and, due to\ninversion symmetry, the spin-orbit coupling does not spin-split the bands. The\napplication of a displacement field ($D_0$) breaks the inversion symmetry and\ncreates spin-splitting. We analyze the evolution of the superconducting order\nparameters in response to the combined spin-orbit coupling and $D_0$-induced\nspin-splitting. Utilizing symmetry analysis combined with both a direct\nnumerical evaluation and a complementary analytical study of the gap equation,\nwe provide a comprehensive understanding of the influence of spin-orbit\ncoupling and $D_0$ on superconductivity. These results contribute to a better\nunderstanding of the superconducting order in twisted trilayer graphene.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:31:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Scammell","Harley D.",""],["Scheurer","Mathias S.",""]]}
{"id":"2308.10531","submitter":"Qingwen Bu","authors":"Qingwen Bu, Sungrae Park, Minsoo Khang, Yichuan Cheng","title":"SRFormer: Empowering Regression-Based Text Detection Transformer with\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing techniques for text detection can be broadly classified into two\nprimary groups: segmentation-based methods and regression-based methods.\nSegmentation models offer enhanced robustness to font variations but require\nintricate post-processing, leading to high computational overhead.\nRegression-based methods undertake instance-aware prediction but face\nlimitations in robustness and data efficiency due to their reliance on\nhigh-level representations. In our academic pursuit, we propose SRFormer, a\nunified DETR-based model with amalgamated Segmentation and Regression, aiming\nat the synergistic harnessing of the inherent robustness in segmentation\nrepresentations, along with the straightforward post-processing of\ninstance-level regression. Our empirical analysis indicates that favorable\nsegmentation predictions can be obtained at the initial decoder layers. In\nlight of this, we constrain the incorporation of segmentation branches to the\nfirst few decoder layers and employ progressive regression refinement in\nsubsequent layers, achieving performance gains while minimizing additional\ncomputational load from the mask. Furthermore, we propose a Mask-informed Query\nEnhancement module. We take the segmentation result as a natural soft-ROI to\npool and extract robust pixel representations, which are then employed to\nenhance and diversify instance queries. Extensive experimentation across\nmultiple benchmarks has yielded compelling findings, highlighting our method's\nexceptional robustness, superior training and data efficiency, as well as its\nstate-of-the-art performance.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:34:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bu","Qingwen",""],["Park","Sungrae",""],["Khang","Minsoo",""],["Cheng","Yichuan",""]]}
{"id":"2308.10532","submitter":"Vahagn Mikaelian","authors":"Vahagn H. Mikaelian","title":"Higman operations on integer sequences, and embeddings of recursive\n  groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is an extended version of summary of the talk at the International\nConference on Group Theory in honor of Victor Mazurov on the occasion of his\n80th birthday. The concise version of this report can be found in the talks and\ncommunications band at the Conference site. The objective of the current talk\nis to present our very recent article in which we for various types of\nrecursive groups discuss possibility of their explicit embeddings into finitely\npresented groups.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:36:52 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 19:20:28 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 10:33:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mikaelian","Vahagn H.",""]]}
{"id":"2308.10533","submitter":"Toru Tamaki","authors":"Shuki Shimizu, Toru Tamaki","title":"Joint learning of images and videos with a single Vision Transformer","comments":"MVA2023 (18th International Conference on Machine Vision\n  Applications), Hamamatsu, Japan, 23-25 July 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we propose a method for jointly learning of images and videos\nusing a single model. In general, images and videos are often trained by\nseparate models. We propose in this paper a method that takes a batch of images\nas input to Vision Transformer IV-ViT, and also a set of video frames with\ntemporal aggregation by late fusion. Experimental results on two image datasets\nand two action recognition datasets are presented.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:38:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shimizu","Shuki",""],["Tamaki","Toru",""]]}
{"id":"2308.10534","submitter":"Hyunglip Bae","authors":"Hyunglip Bae, Jang Ho Kim, Woo Chang Kim","title":"Universal Approximation of Parametric Optimization via Neural Networks\n  with Piecewise Linear Policy Approximation","comments":"17 pages, 2 figures, preprint, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parametric optimization solves a family of optimization problems as a\nfunction of parameters. It is a critical component in situations where optimal\ndecision making is repeatedly performed for updated parameter values, but\ncomputation becomes challenging when complex problems need to be solved in\nreal-time. Therefore, in this study, we present theoretical foundations on\napproximating optimal policy of parametric optimization problem through Neural\nNetworks and derive conditions that allow the Universal Approximation Theorem\nto be applied to parametric optimization problems by constructing piecewise\nlinear policy approximation explicitly. This study fills the gap on formally\nanalyzing the constructed piecewise linear approximation in terms of\nfeasibility and optimality and show that Neural Networks (with ReLU\nactivations) can be valid approximator for this approximation in terms of\ngeneralization and approximation error. Furthermore, based on theoretical\nresults, we propose a strategy to improve feasibility of approximated solution\nand discuss training with suboptimal solutions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:38:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bae","Hyunglip",""],["Kim","Jang Ho",""],["Kim","Woo Chang",""]]}
{"id":"2308.10535","submitter":"Shanshan Wang","authors":"Kaidi Xu, Di Hu, Jun Chen, Haoshen Ye, Lin Han, Shan-Shan Wang, Shuai\n  Dong","title":"Two-orbital spin-fermion model study of ferromagnetism in honeycomb\n  lattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The spin-fermion model was previously successful to describe the complex\nphase diagrams of colossal magnetoresistive manganites and iron-based\nsuperconductors. In recent years, two-dimensional magnets have rapidly raised\nup as a new attractive branch of quantum materials, which are theoretically\ndescribed based on classical spin models in most studies. Alternatively, here\nthe two-orbital spin-fermion model is established as a uniform scenario to\ndescribe the ferromagnetism in a two-dimensional honeycomb lattice. This model\nconnects the magnetic interactions with the electronic structures. Then the\ncontinuous tuning of magnetism in these honeycomb lattices can be predicted,\nbased on a general phase diagram. The electron/hole doping, from the empty\n$e_{g}$ to half-filled $e_{g}$ limit, is studied as a benchmark. Our Monte\nCarlo result finds that the ferromagnetic $T_{C}$ reaches the maximum at the\nquarter-filled case. In other regions, the linear relationship between $T_{C}$\nand doping concentration provides a theoretical guideline for the experimental\nmodulations of two-dimensional ferromagnetism tuned by ionic liquid or\nelectrical gating.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:39:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Kaidi",""],["Hu","Di",""],["Chen","Jun",""],["Ye","Haoshen",""],["Han","Lin",""],["Wang","Shan-Shan",""],["Dong","Shuai",""]]}
{"id":"2308.10536","submitter":"Shubham Kumar","authors":"Shubham Kumar, Deepmala","title":"The Unique Solvability Conditions for the Generalized Absolute Value\n  Equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper investigates the conditions that guarantee unique solvability and\nunsolvability for the generalized absolute value equations (GAVE) given by $Ax\n- B \\vert x \\vert = b$. Further, these conditions are also valid to determine\nthe unique solution of the generalized absolute value matrix equations (GAVME)\n$AX - B \\vert X \\vert =F$. Finally, certain aspects related to the solvability\nand unsolvability of the absolute value equations (AVE) have been deliberated\nupon.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:40:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kumar","Shubham",""],["Deepmala","",""]]}
{"id":"2308.10537","submitter":"Nicolas Heist","authors":"Nicolas Heist, Sven Hertling, Heiko Paulheim","title":"KGrEaT: A Framework to Evaluate Knowledge Graphs via Downstream Tasks","comments":"Accepted for the Short Paper track of CIKM'23, October 21-25, 2023,\n  Birmingham, United Kingdom","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DB cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In recent years, countless research papers have addressed the topics of\nknowledge graph creation, extension, or completion in order to create knowledge\ngraphs that are larger, more correct, or more diverse. This research is\ntypically motivated by the argumentation that using such enhanced knowledge\ngraphs to solve downstream tasks will improve performance. Nonetheless, this is\nhardly ever evaluated. Instead, the predominant evaluation metrics - aiming at\ncorrectness and completeness - are undoubtedly valuable but fail to capture the\ncomplete picture, i.e., how useful the created or enhanced knowledge graph\nactually is. Further, the accessibility of such a knowledge graph is rarely\nconsidered (e.g., whether it contains expressive labels, descriptions, and\nsufficient context information to link textual mentions to the entities of the\nknowledge graph). To better judge how well knowledge graphs perform on actual\ntasks, we present KGrEaT - a framework to estimate the quality of knowledge\ngraphs via actual downstream tasks like classification, clustering, or\nrecommendation. Instead of comparing different methods of processing knowledge\ngraphs with respect to a single task, the purpose of KGrEaT is to compare\nvarious knowledge graphs as such by evaluating them on a fixed task setup. The\nframework takes a knowledge graph as input, automatically maps it to the\ndatasets to be evaluated on, and computes performance metrics for the defined\ntasks. It is built in a modular way to be easily extendable with additional\ntasks and datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:43:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Heist","Nicolas",""],["Hertling","Sven",""],["Paulheim","Heiko",""]]}
{"id":"2308.10538","submitter":"Fatih Ozaydin","authors":"Fatih Ozaydin, \\\"Ozg\\\"ur E. M\\\"ustecapl{\\i}o\\u{g}lu, Tu\\u{g}rul\n  Hakio\\u{g}lu","title":"Powering quantum Otto engines only with q-deformation of the working\n  substance","comments":"8 pages, 11 figures. arXiv admin note: substantial text overlap with\n  arXiv:2208.08565","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a quantum Otto cycle with a $q$-deformed quantum oscillator\nworking substance and classical thermal baths. We investigate the influence of\nthe quantum statistical deformation parameter $q$ on the work and efficiency of\nthe cycle. In usual quantum Otto cycle, a Hamiltonian parameter is varied\nduring the quantum adiabatic stages while the quantum statistical character of\nthe working substance remains fixed. We point out that even if the Hamiltonian\nparameters are not changing, work can be harvested by quantum statistical\nchanges of the working substance. Work extraction from thermal resources using\nquantum statistical mutations of the working substance makes a quantum Otto\ncycle without any classical analog.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:44:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ozaydin","Fatih",""],["M\u00fcstecapl\u0131o\u011flu","\u00d6zg\u00fcr E.",""],["Hakio\u011flu","Tu\u011frul",""]]}
{"id":"2308.10539","submitter":"Deepak Chahal","authors":"Deepak Chahal, Devika Kamath, Richard de Grijs, Paolo Ventura and\n  Xiaodian Chen","title":"Unravelling the Period Gap using LAMOST Chromospheric Activity Indices","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2521","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In our recent catalogue of BY Draconis (BY Dra) variables based on Zwicky\nTransient Facility data, we found traces of a period gap in the period-colour\ndiagram. We combined our BY Dra database with catalogues from the {\\sl Kepler}\nand K2 surveys, revealing a prominent period gap. Here, we use this combined\nZTF-{\\sl Kepler}-K2 data set to investigate the origin of the period gap\nobserved for BY Dra stars using chromospheric activity indices. We use low- and\nmedium-resolution spectra from the LAMOST Data Release 7 to derive magnetic\nactivity indices for the Ca {\\sc ii} H and K and H$\\alpha$ emission lines. We\nfind a strong dependence of chromospheric activity on both stellar mass and\nrotation period. For partially convective K-M-type stars, the activity\ndecreases steeply up to an age of $\\sim$700-1000 Myr, subsequently evolving to\nthe type of low-level saturation associated with spin-down stallation. In\ncontrast, F-G-type stars with thinner convective envelopes exhibit constant\nactivity with increasing age. We suspect that the observed steep decrease for\npartially convective stars is driven by core-envelope coupling. This mechanism\nreduces differential rotation at the core-envelope transition, hence leading to\ndecreased magnetic activity. Moreover, we derive activity indices for\npreviously known star clusters and find similar trends as regards their\nactivity levels as a function of age. In particular, very low-level activity is\nobserved around the location of the period gap. Therefore, we conclude that the\nperiod gap, defined by the non-detection of variable sources, is driven by a\nminimum in chromospheric activity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:46:22 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chahal","Deepak",""],["Kamath","Devika",""],["de Grijs","Richard",""],["Ventura","Paolo",""],["Chen","Xiaodian",""]]}
{"id":"2308.10540","submitter":"Amartya Bose","authors":"Amartya Bose","title":"Quantum correlation functions through tensor network path integral","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tensor networks have historically proven to be of great utility in providing\ncompressed representations of wave functions that can be used for calculation\nof eigenstates. Recently, it has been shown that a variety of these networks\ncan be leveraged to make real time non-equilibrium simulations of dynamics\ninvolving the Feynman-Vernon influence functional more efficient. In this work,\ntensor networks are utilized for calculating equilibrium correlation function\nfor open quantum systems using the path integral methodology. These correlation\nfunctions are of fundamental importance in calculations of rates of reactions,\nsimulations of response functions and susceptibilities, spectra of systems,\netc. The influence of the solvent on the quantum system is incorporated through\nan influence functional, whose unconventional structure motivates the design of\na new optimal matrix product-like operator that can be applied to the so-called\npath amplitude matrix product state. This complex time tensor network path\nintegral approach provides an exceptionally efficient representation of the\npath integral enabling simulations for larger systems strongly interacting with\nbaths and at lower temperatures out to longer time. The design and\nimplementation of this method is discussed along with illustrations from rate\ntheory, symmetrized spin correlation functions, dynamical susceptibility\ncalculations and quantum thermodynamics.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:46:51 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 08:16:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bose","Amartya",""]]}
{"id":"2308.10541","submitter":"Isabelle Charton","authors":"Isabelle Charton, Liat Kessler","title":"Monotone Symplectic Six-Manifolds that admit a Hamiltonian GKM Action\n  are diffeomorphic to Smooth Fano Threefolds","comments":"58 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $(M,\\omega)$ be a compact symplectic manifold with a Hamiltonian GKM\naction of a compact torus. We formulate a positive condition on the space; this\ncondition is satisfied if the underlying symplectic manifold is monotone.The\nmain result of this article is that the underlying manifold of a positive\nHamiltonian GKM space of dimension six is diffeomorphic to a smooth Fano\nthreefold. We prove the main result in two steps.\n  In the first step, we analyze the equivariant cohomology of (maybe\nnon-positive) Hamiltonian GKM spaces in any dimension with tools provided by\nKirwan: the so-called Kirwan classes. We show that if the complexity of the\naction is zero or one, or if the dimension of the manifold is six, then the\nequivariant and the ordinary cohomology with integer coefficients are\ndetermined by the GKM graph. This analysis, in combination with a\nclassification result by Jupp, Wall and \\u Zubr for certain six-manifolds,\nshows that the diffeomorphism type of a symplectic six-manifold with a\nHamiltonian GKM action is determined by the associated GKM graph.\n  In the second step, based on results by Godinho and Sabatini, we give a\ncomplete list of the GKM graphs of positive Hamiltonian GKM spaces of dimension\nsix. We deduce that any such GKM graph is isomorphic to a GKM graph of a smooth\nFano threefold.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:47:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Charton","Isabelle",""],["Kessler","Liat",""]]}
{"id":"2308.10542","submitter":"Alexis Goujon","authors":"Alexis Goujon, Sebastian Neumayer, Michael Unser","title":"Learning Weakly Convex Regularizers for Convergent Image-Reconstruction\n  Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose to learn non-convex regularizers with a prescribed upper bound on\ntheir weak-convexity modulus. Such regularizers give rise to variational\ndenoisers that minimize a convex energy. They rely on few parameters (less than\n15,000) and offer a signal-processing interpretation as they mimic handcrafted\nsparsity-promoting regularizers. Through numerical experiments, we show that\nsuch denoisers outperform convex-regularization methods as well as the popular\nBM3D denoiser. Additionally, the learned regularizer can be deployed to solve\ninverse problems with iterative schemes that provably converge. For both CT and\nMRI reconstruction, the regularizer generalizes well and offers an excellent\ntradeoff between performance, number of parameters, guarantees, and\ninterpretability when compared to other data-driven approaches.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:52:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Goujon","Alexis",""],["Neumayer","Sebastian",""],["Unser","Michael",""]]}
{"id":"2308.10543","submitter":"Chao Pan","authors":"Chao Pan, Lei Zhang, Yilong Lu, Jilu Jin, Lin Qiu, Jingdong Chen,\n  Jacob Benesty","title":"An Anchor-Point Based Image-Model for Room Impulse Response Simulation\n  with Directional Source Radiation and Sensor Directivity Patterns","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The image model method has been widely used to simulate room impulse\nresponses and the endeavor to adapt this method to different applications has\nalso piqued great interest over the last few decades. This paper attempts to\nextend the image model method and develops an anchor-point-image-model (APIM)\napproach as a solution for simulating impulse responses by including both the\nsource radiation and sensor directivity patterns. To determine the orientations\nof all the virtual sources, anchor points are introduced to real sources, which\nsubsequently lead to the determination of the orientations of the virtual\nsources. An algorithm is developed to generate room impulse responses with APIM\nby taking into account the directional pattern functions, factional time\ndelays, as well as the computational complexity. The developed model and\nalgorithms can be used in various acoustic problems to simulate room acoustics\nand improve and evaluate processing algorithms.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:54:01 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pan","Chao",""],["Zhang","Lei",""],["Lu","Yilong",""],["Jin","Jilu",""],["Qiu","Lin",""],["Chen","Jingdong",""],["Benesty","Jacob",""]]}
{"id":"2308.10544","submitter":"Peng Cui","authors":"Zhijie Deng, Peng Cui, Jun Zhu","title":"Towards Accelerated Model Training via Bayesian Data Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mislabeled, duplicated, or biased data in real-world scenarios can lead to\nprolonged training and even hinder model convergence. Traditional solutions\nprioritizing easy or hard samples lack the flexibility to handle such a variety\nsimultaneously. Recent work has proposed a more reasonable data selection\nprinciple by examining the data's impact on the model's generalization loss.\nHowever, its practical adoption relies on less principled approximations and\nadditional clean holdout data. This work solves these problems by leveraging a\nlightweight Bayesian treatment and incorporating off-the-shelf zero-shot\npredictors built on large-scale pre-trained models. The resulting algorithm is\nefficient and easy-to-implement. We perform extensive empirical studies on\nchallenging benchmarks with considerable data noise and imbalance in the online\nbatch selection scenario, and observe superior training efficiency over\ncompetitive baselines. Notably, on the challenging WebVision benchmark, our\nmethod can achieve similar predictive performance with significantly fewer\ntraining iterations than leading data selection methods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:58:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Deng","Zhijie",""],["Cui","Peng",""],["Zhu","Jun",""]]}
{"id":"2308.10545","submitter":"Runduo Liang","authors":"Runduo Liang, Zhengyan Liu, Lei Lei, Wen Zhao","title":"Constraints Based on Non-detection of Kilonova Optical Searching","comments":"The paper contains some errors in Section 3 about data used in this\n  work and acknowledgement description that should be corrected now","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mergers of binary neutron stars are multimessenger sources of gravitational\nwaves that have an optical luminous counterpart, commonly referred to as\n'kilonova'. Inspired by the detection of GW170817, intensive searches have been\nconducted during the LIGO/Virgo O3 run. However, despite these efforts, no\nverified kilonova was detected. In this work, we present a parameter constraint\nmethod based on non-detection of optical searching considering both GW skymap,\nlimited sky coverage, cadence, limiting magnitudes and the probability of\nastrophysical origin. We use our method to place constraints on EoS of neutron\nstar based on follow-up during O3 run and obtain $M_{\\rm TOV} =\n2.170^{+0.120}_{-0.108}\\ M_{\\odot}$ at 90\\% confidence level with the\ncombination of other observations. And we also take outlook for WFST targeting\nkilonova throughout the LIGO/Virgo O4 run. With more events handled, we will\nobtain more stringent constraints on EoS and kilonova populations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:00:55 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 05:52:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liang","Runduo",""],["Liu","Zhengyan",""],["Lei","Lei",""],["Zhao","Wen",""]]}
{"id":"2308.10546","submitter":"Xinmin Hou","authors":"Taiping Jiang, Xinmin Hou","title":"Ramsey numbers of color critical graphs versus large generalized fans","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given two graphs $G$ and $H$, the {Ramsey number} $R(G,H)$ is the smallest\npositive integer $N$ such that every 2-coloring of the edges of $K_{N}$\ncontains either a red $G$ or a blue $H$. Let $K_{N-1}\\sqcup K_{1,k}$ be the\ngraph obtained from $K_{N-1}$ by adding a new vertex $v$ connecting $k$\nvertices of $K_{N-1}$. Hook and Isaak (2011) defined the {\\em star-critical\nRamsey number} $r_{*}(G,H)$ as the smallest integer $k$ such that every\n2-coloring of the edges of $K_{N-1}\\sqcup K_{1,k}$ contains either a red $G$ or\na blue $H$, where $N=R(G, H)$. For sufficiently large $n$, Li and\nRousseau~(1996) proved that $R(K_{k+1},K_{1}+nK_{t})=knt +1$, Hao, Lin~(2018)\nshowed that $r_{*}(K_{k+1},K_{1}+nK_{t})=(k-1)tn+t$;\n  Li and Liu~(2016) proved that $R(C_{2k+1}, K_{1}+nK_{t})=2nt+1$, and Li, Li,\nand Wang~(2020) showed that $r_{*}(C_{2m+1},K_{1}+nK_{t})=nt+t$. A graph $G$\nwith $\\chi(G)=k+1$ is called edge-critical if $G$ contains an edge $e$ such\nthat $\\chi(G-e)=k$. In this paper, we extend the above results by showing that\nfor an edge-critical graph $G$ with $\\chi(G)=k+1$, when $k\\geq 2$, $t\\geq 2$\nand $n$ is sufficiently large, $R(G, K_{1}+nK_{t})=knt+1$ and\n$r_{*}(G,K_{1}+nK_{t})=(k-1)nt+t$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:01:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Taiping",""],["Hou","Xinmin",""]]}
{"id":"2308.10547","submitter":"Jun Chen","authors":"Jun Chen, Haishan Ye, Mengmeng Wang, Tianxin Huang, Guang Dai, Ivor\n  W.Tsang, Yong Liu","title":"Decentralized Riemannian Conjugate Gradient Method on the Stiefel\n  Manifold","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The conjugate gradient method is a crucial first-order optimization method\nthat generally converges faster than the steepest descent method, and its\ncomputational cost is much lower than the second-order methods. However, while\nvarious types of conjugate gradient methods have been studied in Euclidean\nspaces and on Riemannian manifolds, there has little study for those in\ndistributed scenarios. This paper proposes a decentralized Riemannian conjugate\ngradient descent (DRCGD) method that aims at minimizing a global function over\nthe Stiefel manifold. The optimization problem is distributed among a network\nof agents, where each agent is associated with a local function, and\ncommunication between agents occurs over an undirected connected graph. Since\nthe Stiefel manifold is a non-convex set, a global function is represented as a\nfinite sum of possibly non-convex (but smooth) local functions. The proposed\nmethod is free from expensive Riemannian geometric operations such as\nretractions, exponential maps, and vector transports, thereby reducing the\ncomputational complexity required by each agent. To the best of our knowledge,\nDRCGD is the first decentralized Riemannian conjugate gradient algorithm to\nachieve global convergence over the Stiefel manifold.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:02:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Jun",""],["Ye","Haishan",""],["Wang","Mengmeng",""],["Huang","Tianxin",""],["Dai","Guang",""],["Tsang","Ivor W.",""],["Liu","Yong",""]]}
{"id":"2308.10548","submitter":"Qiqi Gu","authors":"Qiqi Gu and Wei Ke","title":"Typing Composable Coroutines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Coroutine, as a powerful programming construct, is widely used in\nasynchronous applications to replace thread-based programming or the callback\nhell. Using coroutines makes code more readable and maintainable, for its\nability to transfer control while keeping the literal scope. However, reasoning\nabout coroutine behavior can be challenging without proper typing. We propose a\ntype notation and calculus for composing asymmetric, first-class, stackless\ncoroutines. Given the types of a list of coroutines, we can compute a composed\ntype matching the collective behavior of the coroutines, so that the input and\noutput can be type-checked by a type system. Our coroutine types can model the\ndata received by or yielded from a coroutine, which be of coroutine types as\nwell. On top of our type calculus, we discuss its soundness and evaluation\nissues, then provide four application scenarios of our coroutine types. Not\nonly can our types be used in modern programming languages, such as Python, but\nalso model program behaviors in OCaml and even Prolog.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:04:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gu","Qiqi",""],["Ke","Wei",""]]}
{"id":"2308.10549","submitter":"J\\\"uri Keller","authors":"J\\\"uri Keller, Timo Breuer, Philipp Schaer","title":"Evaluating Temporal Persistence Using Replicability Measures","comments":"To be published in Proceedings of the Working Notes of CLEF 2023 -\n  Conference and Labs of the Evaluation Forum, Thessaloniki, Greece 18 - 21,\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In real-world Information Retrieval (IR) experiments, the Evaluation\nEnvironment (EE) is exposed to constant change. Documents are added, removed,\nor updated, and the information need and the search behavior of users is\nevolving. Simultaneously, IR systems are expected to retain a consistent\nquality. The LongEval Lab seeks to investigate the longitudinal persistence of\nIR systems, and in this work, we describe our participation. We submitted runs\nof five advanced retrieval systems, namely a Reciprocal Rank Fusion (RRF)\napproach, ColBERT, monoT5, Doc2Query, and E5, to both sub-tasks. Further, we\ncast the longitudinal evaluation as a replicability study to better understand\nthe temporal change observed. As a result, we quantify the persistence of the\nsubmitted runs and see great potential in this evaluation method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:05:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Keller","J\u00fcri",""],["Breuer","Timo",""],["Schaer","Philipp",""]]}
{"id":"2308.10550","submitter":"Yan Dolinsky","authors":"Yan Dolinsky and Or Zuk","title":"Explicit Computations for Delayed Semistatic Hedging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we consider the exponential utility maximization problem in the\nframework of semistatic hedging.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:05:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dolinsky","Yan",""],["Zuk","Or",""]]}
{"id":"2308.10551","submitter":"Rudra Narayan Padhan Dr.","authors":"Rudra Narayan Padhan, Ibrahem Yakzan Hasan and Saudamini Nayak","title":"Capability of Nilpotent Lie Superalgebras of Small Dimension","comments":"arXiv admin note: text overlap with arXiv:2210.00254,\n  arXiv:2303.15088, arXiv:2207.11445","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we define partially capable Lie superalgebra. As an\napplication we classify all capable nilpotent Lie superalgebras of dimension\nless than equal to five.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:07:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Padhan","Rudra Narayan",""],["Hasan","Ibrahem Yakzan",""],["Nayak","Saudamini",""]]}
{"id":"2308.10552","submitter":"Chao Wang","authors":"Chao Wang, Theodoros Stouraitis, Anna Belardinelli, Stephan Hasler and\n  Michael Gienger","title":"Communicating Robot's Intentions while Assisting Users via Augmented\n  Reality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores the challenges faced by assistive robots in effectively\ncooperating with humans, requiring them to anticipate human behavior, predict\ntheir actions' impact, and generate understandable robot actions. The study\nfocuses on a use-case involving a user with limited mobility needing assistance\nwith pouring a beverage, where tasks like unscrewing a cap or reaching for\nobjects demand coordinated support from the robot. Yet, anticipating the\nrobot's intentions can be challenging for the user, which can hinder effective\ncollaboration. To address this issue, we propose an innovative solution that\nutilizes Augmented Reality (AR) to communicate the robot's intentions and\nexpected movements to the user, fostering a seamless and intuitive interaction.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:07:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chao",""],["Stouraitis","Theodoros",""],["Belardinelli","Anna",""],["Hasler","Stephan",""],["Gienger","Michael",""]]}
{"id":"2308.10553","submitter":"Valentino Tosatti","authors":"Yang Li, Valentino Tosatti","title":"Special K\\\"ahler geometry and holomorphic Lagrangian fibrations","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a new proof of a theorem of Hwang, showing that the base of a\nholomorphic Lagrangian fibration of a compact hyperkahler manifold must be the\nhalf-dimensional projective space, provided the base is smooth. Our arguments\nexploit the differential geometry of the special Kahler metric that exists on\nthe base away from the discriminant locus, and use a recent result of Bakker.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:10:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Yang",""],["Tosatti","Valentino",""]]}
{"id":"2308.10554","submitter":"Seogkyu Jeon","authors":"Seogkyu Jeon, Bei Liu, Pilhyeon Lee, Kibeom Hong, Jianlong Fu, Hyeran\n  Byun","title":"Improving Diversity in Zero-Shot GAN Adaptation with Semantic Variations","comments":"Accepted to ICCV 2023 (poster)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Training deep generative models usually requires a large amount of data. To\nalleviate the data collection cost, the task of zero-shot GAN adaptation aims\nto reuse well-trained generators to synthesize images of an unseen target\ndomain without any further training samples. Due to the data absence, the\ntextual description of the target domain and the vision-language models, e.g.,\nCLIP, are utilized to effectively guide the generator. However, with only a\nsingle representative text feature instead of real images, the synthesized\nimages gradually lose diversity as the model is optimized, which is also known\nas mode collapse. To tackle the problem, we propose a novel method to find\nsemantic variations of the target text in the CLIP space. Specifically, we\nexplore diverse semantic variations based on the informative text feature of\nthe target domain while regularizing the uncontrolled deviation of the semantic\ninformation. With the obtained variations, we design a novel directional moment\nloss that matches the first and second moments of image and text direction\ndistributions. Moreover, we introduce elastic weight consolidation and a\nrelation consistency loss to effectively preserve valuable content information\nfrom the source domain, e.g., appearances. Through extensive experiments, we\ndemonstrate the efficacy of the proposed methods in ensuring sample diversity\nin various scenarios of zero-shot GAN adaptation. We also conduct ablation\nstudies to validate the effect of each proposed component. Notably, our model\nachieves a new state-of-the-art on zero-shot GAN adaptation in terms of both\ndiversity and quality.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:12:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jeon","Seogkyu",""],["Liu","Bei",""],["Lee","Pilhyeon",""],["Hong","Kibeom",""],["Fu","Jianlong",""],["Byun","Hyeran",""]]}
{"id":"2308.10555","submitter":"Anh Le-Tuan","authors":"Anh Le-Tuan, David Bowden, Danh Le-Phuoc","title":"Semantic Programming for Device-Edge-Cloud Continuum","comments":"arXiv admin note: text overlap with arXiv:2202.13958","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This position paper presents ThothSP, a Semantic Programming framework with\nthe aim of lowering the coding effort in building smart applications on the\nDevice-Edge-Cloud continuum by leveraging semantic knowledge. It introduces a\nnovel neural-symbolic stream fusion mechanism, which enables the specification\nof data fusion pipelines via declarative rules, with degrees of learnable\nprobabilistic weights. Moreover, it includes an adaptive federator that allows\nthe Thoth>runtime to be distributed across multiple compute nodes in a network,\nand to coordinate their resources to collaboratively process tasks by\ndelegating partial workloads to their peers. To demonstrate ThothSP's\ncapability, we report a case study on a distributed camera network to show\nThothSP's behaviour against a traditional edge-cloud setup.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:12:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Le-Tuan","Anh",""],["Bowden","David",""],["Le-Phuoc","Danh",""]]}
{"id":"2308.10556","submitter":"Kristoffer Andersson","authors":"Kristoffer Andersson and Cornelis W. Oosterlee","title":"D-TIPO: Deep time-inconsistent portfolio optimization with stocks and\n  options","comments":"27 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a machine learning algorithm for time-inconsistent\nportfolio optimization. The proposed algorithm builds upon neural network based\ntrading schemes, in which the asset allocation at each time point is determined\nby a a neural network. The loss function is given by an empirical version of\nthe objective function of the portfolio optimization problem. Moreover, various\ntrading constraints are naturally fulfilled by choosing appropriate activation\nfunctions in the output layers of the neural networks. Besides this, our main\ncontribution is to add options to the portfolio of risky assets and a risk-free\nbond and using additional neural networks to determine the amount allocated\ninto the options as well as their strike prices.\n  We consider objective functions more in line with the rational preference of\nan investor than the classical mean-variance, apply realistic trading\nconstraints and model the assets with a correlated jump-diffusion SDE. With an\nincomplete market and a more involved objective function, we show that it is\nbeneficial to add options to the portfolio. Moreover, it is shown that adding\noptions leads to a more constant stock allocation with less demand for drastic\nre-allocations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:17:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Andersson","Kristoffer",""],["Oosterlee","Cornelis W.",""]]}
{"id":"2308.10557","submitter":"Katharina Prasse","authors":"Katharina Prasse, Steffen Jung, Yuxuan Zhou, Margret Keuper","title":"Local Spherical Harmonics Improve Skeleton-Based Hand Action Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Hand action recognition is essential. Communication, human-robot\ninteractions, and gesture control are dependent on it. Skeleton-based action\nrecognition traditionally includes hands, which belong to the classes which\nremain challenging to correctly recognize to date. We propose a method\nspecifically designed for hand action recognition which uses relative angular\nembeddings and local Spherical Harmonics to create novel hand representations.\nThe use of Spherical Harmonics creates rotation-invariant representations which\nmake hand action recognition even more robust against inter-subject differences\nand viewpoint changes. We conduct extensive experiments on the hand joints in\nthe First-Person Hand Action Benchmark with RGB-D Videos and 3D Hand Pose\nAnnotations, and on the NTU RGB+D 120 dataset, demonstrating the benefit of\nusing Local Spherical Harmonics Representations. Our code is available at\nhttps://github.com/KathPra/LSHR_LSHT.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:17:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Prasse","Katharina",""],["Jung","Steffen",""],["Zhou","Yuxuan",""],["Keuper","Margret",""]]}
{"id":"2308.10558","submitter":"Vaclav Dedic","authors":"Vaclav Dedic, Jakub Sanitrak, Tomas Fridrisek, Martin Rejhon, Bohdan\n  Morzhuk, Mykhailo Shestopalov, Jan Kunc","title":"Investigation of internal electric fields in graphene/6H-SiC under\n  illumination by Pockels effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce a method for mapping profiles of internal\nelectric fields in birefringent crystals based on the electro-optic Pockels\neffect and measuring phase differences of low-intensity polarized light. In the\ncase of the studied 6H-SiC crystal with graphene electrodes, the experiment is\nsignificantly affected by birefringence at zero bias voltage applied to the\ncrystal and a strong thermo-optical effect. We dealt with these phenomena by\nadding a Soleil-Babinet compensator and using considerations based on\nmeasurements of crystal heating under laser illumination. The method can be\ngeneralized and adapted to any Pockels crystal that can withstand sufficiently\nhigh voltages. We demonstrate the significant formation of space charge in\nsemi-insulating 6H-SiC under illumination by above-bandgap light.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:20:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dedic","Vaclav",""],["Sanitrak","Jakub",""],["Fridrisek","Tomas",""],["Rejhon","Martin",""],["Morzhuk","Bohdan",""],["Shestopalov","Mykhailo",""],["Kunc","Jan",""]]}
{"id":"2308.10559","submitter":"Leila Ismail Prof.","authors":"Leila Ismail and Rajkumar Buyya","title":"Metaverse: A Vision, Architectural Elements, and Future Directions for\n  Scalable and Realtime Virtual Worlds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the emergence of Cloud computing, Internet of Things-enabled\nHuman-Computer Interfaces, Generative Artificial Intelligence, and\nhigh-accurate Machine and Deep-learning recognition and predictive models,\nalong with the Post Covid-19 proliferation of social networking, and remote\ncommunications, the Metaverse gained a lot of popularity. Metaverse has the\nprospective to extend the physical world using virtual and augmented reality so\nthe users can interact seamlessly with the real and virtual worlds using\navatars and holograms. It has the potential to impact people in the way they\ninteract on social media, collaborate in their work, perform marketing and\nbusiness, teach, learn, and even access personalized healthcare. Several works\nin the literature examine Metaverse in terms of hardware wearable devices, and\nvirtual reality gaming applications. However, the requirements of realizing the\nMetaverse in realtime and at a large-scale need yet to be examined for the\ntechnology to be usable. To address this limitation, this paper presents the\ntemporal evolution of Metaverse definitions and captures its evolving\nrequirements. Consequently, we provide insights into Metaverse requirements. In\naddition to enabling technologies, we lay out architectural elements for\nscalable, reliable, and efficient Metaverse systems, and a classification of\nexisting Metaverse applications along with proposing required future research\ndirections.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:23:10 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 12:54:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ismail","Leila",""],["Buyya","Rajkumar",""]]}
{"id":"2308.10560","submitter":"Andrea Pizzo","authors":"Andrea Pizzo, Angel Lozano, Sundeep Rangan, Thomas Marzetta","title":"Wide-Aperture MIMO via Reflection off a Smooth Surface","comments":"arXiv admin note: text overlap with arXiv:2205.01213","journal-ref":"in IEEE Transactions on Wireless Communications, vol. 22, no. 8,\n  pp. 5229-5239, Aug. 2023","doi":"10.1109/TWC.2022.3232742.","report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper provides a deterministic channel model for a scenario where\nwireless connectivity is established through a reflection off a smooth planar\nsurface of an infinite extent. The developed model is rigorously built upon the\nphysics of wave propagation and is as precise as tight are the unboundedness\nand smoothness assumptions on the surface. This model allows establishing how\nline-of-sight multiantenna communication is altered by a reflection off an\nelectrically large surface, a situation of high interest for mmWave and\nterahertz frequencies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:31:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pizzo","Andrea",""],["Lozano","Angel",""],["Rangan","Sundeep",""],["Marzetta","Thomas",""]]}
{"id":"2308.10561","submitter":"Hongtian Yu","authors":"Hongtian Yu, Yunjie Tian, Qixiang Ye, Yunfan Liu","title":"Spatial Transform Decoupling for Oriented Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision Transformers (ViTs) have achieved remarkable success in computer\nvision tasks. However, their potential in rotation-sensitive scenarios has not\nbeen fully explored, and this limitation may be inherently attributed to the\nlack of spatial invariance in the data-forwarding process. In this study, we\npresent a novel approach, termed Spatial Transform Decoupling (STD), providing\na simple-yet-effective solution for oriented object detection with ViTs. Built\nupon stacked ViT blocks, STD utilizes separate network branches to predict the\nposition, size, and angle of bounding boxes, effectively harnessing the spatial\ntransform potential of ViTs in a divide-and-conquer fashion. Moreover, by\naggregating cascaded activation masks (CAMs) computed upon the regressed\nparameters, STD gradually enhances features within regions of interest (RoIs),\nwhich complements the self-attention mechanism. Without bells and whistles, STD\nachieves state-of-the-art performance on the benchmark datasets including\nDOTA-v1.0 (82.24% mAP) and HRSC2016 (98.55% mAP), which demonstrates the\neffectiveness of the proposed method. Source code is available at\nhttps://github.com/yuhongtian17/Spatial-Transform-Decoupling.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:36:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Hongtian",""],["Tian","Yunjie",""],["Ye","Qixiang",""],["Liu","Yunfan",""]]}
{"id":"2308.10562","submitter":"Delfina Sol Martinez Pandiani","authors":"Delfina Sol Martinez Pandiani and Valentina Presutti","title":"Seeing the Intangible: Surveying Automatic High-Level Visual\n  Understanding from Still Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The field of Computer Vision (CV) was born with the single grand goal of\ncomplete image understanding: providing a complete semantic interpretation of\nan input image. What exactly this goal entails is not immediately\nstraightforward, but theoretical hierarchies of visual understanding point\ntowards a top level of full semantics, within which sits the most complex and\nsubjective information humans can detect from visual data. In particular,\nnon-concrete concepts including emotions, social values and ideologies seem to\nbe protagonists of this \"high-level\" visual semantic understanding. While such\n\"abstract concepts\" are critical tools for image management and retrieval,\ntheir automatic recognition is still a challenge, exactly because they rest at\nthe top of the \"semantic pyramid\": the well-known semantic gap problem is\nworsened given their lack of unique perceptual referents, and their reliance on\nmore unspecific features than concrete concepts. Given that there seems to be\nvery scarce explicit work within CV on the task of abstract social concept\n(ASC) detection, and that many recent works seem to discuss similar\nnon-concrete entities by using different terminology, in this survey we provide\na systematic review of CV work that explicitly or implicitly approaches the\nproblem of abstract (specifically social) concept detection from still images.\nSpecifically, this survey performs and provides: (1) A study and clustering of\nhigh level visual understanding semantic elements from a multidisciplinary\nperspective (computer science, visual studies, and cognitive perspectives); (2)\nA study and clustering of high level visual understanding computer vision tasks\ndealing with the identified semantic elements, so as to identify current CV\nwork that implicitly deals with AC detection.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:37:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pandiani","Delfina Sol Martinez",""],["Presutti","Valentina",""]]}
{"id":"2308.10563","submitter":"Guan Xiucui","authors":"Junhua Jia, Xiucui Guan, Xinqiang Qian, Panos M. Pardalos","title":"Restricted inverse optimal value problem on linear programming under\n  weighted $l_1$ norm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the restricted inverse optimal value problem on linear programming\nunder weighted $l_1$ norm (RIOVLP $_1$). Given a linear programming problem\n$LP_c: \\min \\{cx|Ax=b,x\\geq 0\\}$ with a feasible solution $x^0$ and a value\n$K$, we aim to adjust the vector $c$ to $\\bar{c}$ such that $x^0$ becomes an\noptimal solution of the problem LP$_{\\bar c}$ whose objective value\n$\\bar{c}x^0$ equals $K$. The objective is to minimize the distance $\\|\\bar c -\nc\\|_1=\\sum_{j=1}^nd_j|\\bar c_j-c_j|$ under weighted $l_1$ norm.Firstly, we\nformulate the problem (RIOVLP$_1$) as a linear programming problem by dual\ntheories. Secondly, we construct a sub-problem $(D^z)$, which has the same form\nas $LP_c$, of the dual (RIOVLP$_1$) problem corresponding to a given value $z$.\nThirdly, when the coefficient matrix $A$ is unimodular, we design a binary\nsearch algorithm to calculate the critical value $z^*$ corresponding to an\noptimal solution of the problem (RIOVLP$_1$). Finally, we solve the (RIOV)\nproblems on Hitchcock and shortest path problem, respectively, in\n$O(T_{MCF}\\log\\max\\{d_{max},x^0_{max},n\\})$ time, where we solve a sub-problem\n$(D^z)$ by minimum cost flow in $T_{MCF}$ time in each iteration. The values\n$d_{max},x^0_{max}$ are the maximum values of $d$ and $x^0$, respectively.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:38:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jia","Junhua",""],["Guan","Xiucui",""],["Qian","Xinqiang",""],["Pardalos","Panos M.",""]]}
{"id":"2308.10564","submitter":"Tai Nguyen","authors":"Tai Nguyen, Yifeng Di, Joohan Lee, Muhao Chen and Tianyi Zhang","title":"Software Entity Recognition with Noise-Robust Learning","comments":"ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recognizing software entities such as library names from free-form text is\nessential to enable many software engineering (SE) technologies, such as\ntraceability link recovery, automated documentation, and API recommendation.\nWhile many approaches have been proposed to address this problem, they suffer\nfrom small entity vocabularies or noisy training data, hindering their ability\nto recognize software entities mentioned in sophisticated narratives. To\naddress this challenge, we leverage the Wikipedia taxonomy to develop a\ncomprehensive entity lexicon with 79K unique software entities in 12\nfine-grained types, as well as a large labeled dataset of over 1.7M sentences.\nThen, we propose self-regularization, a noise-robust learning approach, to the\ntraining of our software entity recognition (SER) model by accounting for many\ndropouts. Results show that models trained with self-regularization outperform\nboth their vanilla counterparts and state-of-the-art approaches on our\nWikipedia benchmark and two Stack Overflow benchmarks. We release our models,\ndata, and code for future research.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:41:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nguyen","Tai",""],["Di","Yifeng",""],["Lee","Joohan",""],["Chen","Muhao",""],["Zhang","Tianyi",""]]}
{"id":"2308.10565","submitter":"Weiwei Cui","authors":"Weiwei Cui and Jun Wang","title":"Ergodic exponential maps with escaping singular behaviours","comments":"11 pages, 1 figure; comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct exponential maps for which the singular value tends to infinity\nunder iterates while the maps are ergodic. This is in contrast with a result of\nLyubich from 1987 which tells that $e^z$ is not ergodic.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:43:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cui","Weiwei",""],["Wang","Jun",""]]}
{"id":"2308.10566","submitter":"Chee Fai Fong","authors":"C. F. Fong, D. Yamashita, N. Fang, S. Fujii, Y.-R. Chang, T.\n  Taniguchi, K. Watanabe, and Y. K. Kato","title":"Self-aligned hybrid nanocavities using atomically thin materials","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional (2D) van der Waals layered materials with intriguing\nproperties are increasingly being adopted in hybrid photonics. The 2D materials\nare often integrated with photonic structures including cavities to enhance\nlight-matter coupling, providing additional control and functionality. The 2D\nmaterials, however, needs to be precisely placed on the photonic cavities.\nFurthermore, the transfer of 2D materials onto the cavities could degrade the\ncavity quality $(Q)$ factor. Instead of using prefabricated PhC nanocavities,\nwe demonstrate a novel approach to form a hybrid nanocavity by partially\ncovering a PhC waveguide post-fabrication with a suitably-sized 2D material\nflake. We successfully fabricated such hybrid nanocavity devices with hBN,\nWSe$_2$ and MoTe$_2$ flakes on silicon PhC waveguides, obtaining $Q$ factors as\nhigh as $4.0\\times10^5$. Remarkably, even mono- and few-layer flakes can\nprovide sufficient local refractive index modulation to induce nanocavity\nformation. Since the 2D material is spatially self-aligned to the nanocavity,\nwe have also managed to observe cavity PL enhancement in a MoTe$_2$ hybrid\ncavity device, with a cavity Purcell enhancement factor of about 15. Our\nresults highlights the prospect of using such 2D materials-induced PhC\nnanocavity to realize a wide range of photonic components for hybrid devices\nand integrated photonic circuits.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:50:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fong","C. F.",""],["Yamashita","D.",""],["Fang","N.",""],["Fujii","S.",""],["Chang","Y. -R.",""],["Taniguchi","T.",""],["Watanabe","K.",""],["Kato","Y. K.",""]]}
{"id":"2308.10567","submitter":"Joris Labarbe","authors":"Joris Labarbe and Didier Clamond","title":"General procedure for free-surface recovery from bottom pressure\n  measurements: Application to rotational overhanging waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A novel boundary integral approach for the recovery of overhanging (or not)\nrotational (or not) water waves from pressure measurements at the bottom is\npresented. The method is based on the Cauchy integral formula and on an\nEulerian--Lagrangian formalism to accommodate overturning free surfaces. This\napproach eliminates the need to introduce {\\em a priori} a special basis of\nfunctions, providing thus a general means of fitting the pressure data and,\nconsequently, recovering the free surface. The effectiveness and accuracy of\nthe method are demonstrated through numerical examples.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:52:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Labarbe","Joris",""],["Clamond","Didier",""]]}
{"id":"2308.10568","submitter":"Juan Jose Francisco Miguelez","authors":"Juan Jose Francisco Miguelez, Cristin Buescu","title":"Analytical valuation of vulnerable derivative contracts with bilateral\n  cash flows under credit, funding and wrong-way risks","comments":"43 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PR q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the problem of valuing a vulnerable derivative with bilateral cash\nflows between two counterparties in the presence of funding, credit and\nwrong-way risks, and derive a closed-form valuation formula for an at-the-money\n(ATM) forward contract as well as a second order approximation for the general\ncase. We posit a model with heterogeneous interest rates and default occurrence\nand infer a Cauchy problem for the pre-default valuation function of the\ncontract, which includes ab initio any counterparty risk - as opposed to\ncalculating valuation adjustments collectively known as XVA. Under a specific\nfunding policy which linearises the Cauchy problem, we obtain a generic\nprobabilistic representation for the pre-default valuation (Theorem 1). We\napply this general framework to the valuation of an equity forward and\nestablish the contract can be expressed as a continuous portfolio of European\noptions with suitably chosen strikes and expiries under a particular\nprobability measure (Theorem 2). Our valuation formula admits a closed-form\nexpression when the forward contract is ATM (Corollary 2) and we derive a\nsecond order approximation in moneyness when the contract is close to ATM\n(Theorem 3). Numerical results of our model show that the forward is more\nsensitive to funding factors than credit ones, while higher stock funding costs\nincrease sensitivity to credit spreads and wrong-way risk.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:53:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Miguelez","Juan Jose Francisco",""],["Buescu","Cristin",""]]}
{"id":"2308.10569","submitter":"Cheng Feng","authors":"Cheng Feng, Zhen Chen, Congxuan Zhang, Weiming Hu, Bing Li, Feng Lu","title":"RT-MonoDepth: Real-time Monocular Depth Estimation on Embedded Systems","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Depth sensing is a crucial function of unmanned aerial vehicles and\nautonomous vehicles. Due to the small size and simple structure of monocular\ncameras, there has been a growing interest in depth estimation from a single\nRGB image. However, state-of-the-art monocular CNN-based depth estimation\nmethods using fairly complex deep neural networks are too slow for real-time\ninference on embedded platforms. This paper addresses the problem of real-time\ndepth estimation on embedded systems. We propose two efficient and lightweight\nencoder-decoder network architectures, RT-MonoDepth and RT-MonoDepth-S, to\nreduce computational complexity and latency. Our methodologies demonstrate that\nit is possible to achieve similar accuracy as prior state-of-the-art works on\ndepth estimation at a faster inference speed. Our proposed networks,\nRT-MonoDepth and RT-MonoDepth-S, runs at 18.4\\&30.5 FPS on NVIDIA Jetson Nano\nand 253.0\\&364.1 FPS on NVIDIA Jetson AGX Orin on a single RGB image of\nresolution 640$\\times$192, and achieve relative state-of-the-art accuracy on\nthe KITTI dataset. To the best of the authors' knowledge, this paper achieves\nthe best accuracy and fastest inference speed compared with existing fast\nmonocular depth estimation methods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:59:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Feng","Cheng",""],["Chen","Zhen",""],["Zhang","Congxuan",""],["Hu","Weiming",""],["Li","Bing",""],["Lu","Feng",""]]}
{"id":"2308.10570","submitter":"Jihwan Kim","authors":"Jihwan Kim, Miso Lee, Jae-Pil Heo","title":"Self-Feedback DETR for Temporal Action Detection","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Temporal Action Detection (TAD) is challenging but fundamental for real-world\nvideo applications. Recently, DETR-based models have been devised for TAD but\nhave not performed well yet. In this paper, we point out the problem in the\nself-attention of DETR for TAD; the attention modules focus on a few key\nelements, called temporal collapse problem. It degrades the capability of the\nencoder and decoder since their self-attention modules play no role. To solve\nthe problem, we propose a novel framework, Self-DETR, which utilizes\ncross-attention maps of the decoder to reactivate self-attention modules. We\nrecover the relationship between encoder features by simple matrix\nmultiplication of the cross-attention map and its transpose. Likewise, we also\nget the information within decoder queries. By guiding collapsed self-attention\nmaps with the guidance map calculated, we settle down the temporal collapse of\nself-attention modules in the encoder and decoder. Our extensive experiments\ndemonstrate that Self-DETR resolves the temporal collapse problem by keeping\nhigh diversity of attention over all layers.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:01:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kim","Jihwan",""],["Lee","Miso",""],["Heo","Jae-Pil",""]]}
{"id":"2308.10571","submitter":"Won Jo","authors":"Yujin Hwang, Won Jo, Juyoung Hong, and Yukyung Choi","title":"Overcoming Overconfidence for Active Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  It is not an exaggeration to say that the recent progress in artificial\nintelligence technology depends on large-scale and high-quality data.\nSimultaneously, a prevalent issue exists everywhere: the budget for data\nlabeling is constrained. Active learning is a prominent approach for addressing\nthis issue, where valuable data for labeling is selected through a model and\nutilized to iteratively adjust the model. However, due to the limited amount of\ndata in each iteration, the model is vulnerable to bias; thus, it is more\nlikely to yield overconfident predictions. In this paper, we present two novel\nmethods to address the problem of overconfidence that arises in the active\nlearning scenario. The first is an augmentation strategy named\nCross-Mix-and-Mix (CMaM), which aims to calibrate the model by expanding the\nlimited training distribution. The second is a selection strategy named Ranked\nMargin Sampling (RankedMS), which prevents choosing data that leads to overly\nconfident predictions. Through various experiments and analyses, we are able to\ndemonstrate that our proposals facilitate efficient data selection by\nalleviating overconfidence, even though they are readily applicable.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:04:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hwang","Yujin",""],["Jo","Won",""],["Hong","Juyoung",""],["Choi","Yukyung",""]]}
{"id":"2308.10572","submitter":"Oskar Pro\\'sniak","authors":"Wojciech De Roeck, Fran\\c{c}ois Huveneers, Oskar A. Pro\\'sniak","title":"Slow dissipation and spreading in disordered classical systems: A direct\n  comparison between numerics and mathematical bounds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the breakdown of Anderson localization in the one-dimensional\nnonlinear Klein-Gordon chain, a prototypical example of a disordered classical\nmany-body system. A series of numerical works indicate that an initially\nlocalized wave packet spreads polynomially in time, while analytical studies\nrather suggest a much slower spreading. Here, we focus on the decorrelation\ntime in equilibrium. On the one hand, we provide a mathematical theorem\nestablishing that this time is larger than any inverse power law in the\neffective anharmonicity parameter $\\lambda$, and on the other hand our numerics\nshow that it follows a power law for a broad range of values of $\\lambda$. This\nnumerical behavior is fully consistent with the power law observed numerically\nin spreading experiments, and we conclude that the state-of-the-art numerics\nmay well be unable to capture the long-time behavior of such classical\ndisordered systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:10:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["De Roeck","Wojciech",""],["Huveneers","Fran\u00e7ois",""],["Pro\u015bniak","Oskar A.",""]]}
{"id":"2308.10573","submitter":"Sihui Zhong","authors":"Sihui Zhong, Valery M. Nakariakov, Dmitrii Y. Kolotkov, Lakshmi\n  Pradeep Chitta, Patrick Antolin, Cis Verbeeck, David Berghmans","title":"Polarisation of decayless kink oscillations of solar coronal loops","comments":"19 pages, 7 figures, accepted to Nature Communications","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Decayless kink oscillations of plasma loops in the solar corona may contain\nan answer to the enigmatic problem of solar and stellar coronal heating. The\npolarisation of the oscillations gives us a unique information about their\nexcitation mechanisms and energy supply. However, unambiguous determination of\nthe polarisation has remained elusive. Here, we show simultaneous detection of\na 4-min decayless kink oscillation from two non-parallel lines-of-sights,\nseparated by about 104\\textdegree, provided by unique combination of the High\nResolution Imager on Solar Orbiter and the Atmospheric Imaging Assembly on\nSolar Dynamics Observatory. The observations reveal a horizontal or weakly\noblique linear polarisation of the oscillation. This conclusion is based on the\ncomparison of observational results with forward modelling of the observational\nmanifestation of various kinds of polarisation of kink oscillations. The\nrevealed polarisation favours the sustainability of these oscillations by\nquasi-steady flows which may hence supply the energy for coronal heating.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:13:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhong","Sihui",""],["Nakariakov","Valery M.",""],["Kolotkov","Dmitrii Y.",""],["Chitta","Lakshmi Pradeep",""],["Antolin","Patrick",""],["Verbeeck","Cis",""],["Berghmans","David",""]]}
{"id":"2308.10574","submitter":"Lixin Yang","authors":"Kailin Li, Lixin Yang, Haoyu Zhen, Zenan Lin, Xinyu Zhan, Licheng\n  Zhong, Jian Xu, Kejian Wu, Cewu Lu","title":"CHORD: Category-level Hand-held Object Reconstruction via Shape\n  Deformation","comments":"To be presented at ICCV 2023, Paris","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In daily life, humans utilize hands to manipulate objects. Modeling the shape\nof objects that are manipulated by the hand is essential for AI to comprehend\ndaily tasks and to learn manipulation skills. However, previous approaches have\nencountered difficulties in reconstructing the precise shapes of hand-held\nobjects, primarily owing to a deficiency in prior shape knowledge and\ninadequate data for training. As illustrated, given a particular type of tool,\nsuch as a mug, despite its infinite variations in shape and appearance, humans\nhave a limited number of 'effective' modes and poses for its manipulation. This\ncan be attributed to the fact that humans have mastered the shape prior of the\n'mug' category, and can quickly establish the corresponding relations between\ndifferent mug instances and the prior, such as where the rim and handle are\nlocated. In light of this, we propose a new method, CHORD, for Category-level\nHand-held Object Reconstruction via shape Deformation. CHORD deforms a\ncategorical shape prior for reconstructing the intra-class objects. To ensure\naccurate reconstruction, we empower CHORD with three types of awareness:\nappearance, shape, and interacting pose. In addition, we have constructed a new\ndataset, COMIC, of category-level hand-object interaction. COMIC contains a\nrich array of object instances, materials, hand interactions, and viewing\ndirections. Extensive evaluation shows that CHORD outperforms state-of-the-art\napproaches in both quantitative and qualitative measures. Code, model, and\ndatasets are available at https://kailinli.github.io/CHORD.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:14:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Kailin",""],["Yang","Lixin",""],["Zhen","Haoyu",""],["Lin","Zenan",""],["Zhan","Xinyu",""],["Zhong","Licheng",""],["Xu","Jian",""],["Wu","Kejian",""],["Lu","Cewu",""]]}
{"id":"2308.10575","submitter":"Domenico Nardiello Dr.","authors":"D. Nardiello, L. R. Bedin, M. Griggio, M. Salaris, M. Scalco, S.\n  Cassisi","title":"Photometry and astrometry with JWST -- III. A NIRCam-Gaia DR3 analysis\n  of the open cluster NGC 2506","comments":"20 pages, 17 figures (5 in low resolution), 4 tables. Accepted for\n  publication in MNRAS on August 5, 2023. PSF models, catalogs and stacked\n  images are publicly available at\n  https://web.oapd.inaf.it/bedin/files/PAPERs_eMATERIALs/JWST/Paper_03/","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the third paper of this series aimed at developing the tools for analysing\nresolved stellar populations using the cameras on board of the James Webb Space\nTelescope (JWST), we present a detailed multi-band study of the 2 Gyr Galactic\nopen cluster NGC 2506. We employ public calibration data-sets collected in\nmultiple filters to: (i) derive improved effective Point Spread Functions\n(ePSFs) for ten NIRCam filters; (ii) extract high-precision photometry and\nastrometry for stars in the cluster, approaching the main-sequence (MS) lower\nmass of ~0.1 Msun; and (iii) take advantage of the synergy between JWST and\nGaia DR3 to perform a comprehensive analysis of the cluster's global and local\nproperties. We derived a MS binary fraction of ~57.5 %, extending the Gaia\nlimit (~0.8 Msun) to lower masses (~0.4 Msun) with JWST. We conducted a study\non the mass functions (MFs) of NGC 2506, mapping the mass segregation with Gaia\ndata, and extending MFs to lower masses with the JWST field. We also combined\ninformation on the derived MFs to infer an estimate of the cluster present-day\ntotal mass. Lastly, we investigated the presence of white dwarfs (WDs) and\nidentified a strong candidate. However, to firmly establish its cluster\nmembership, as well as that of four other WD candidates and of the majority of\nfaint low-mass MS stars, further JWST equally deep observations will be\nrequired. We make publicly available catalogues, atlases, and the improved\nePSFs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:15:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nardiello","D.",""],["Bedin","L. R.",""],["Griggio","M.",""],["Salaris","M.",""],["Scalco","M.",""],["Cassisi","S.",""]]}
{"id":"2308.10576","submitter":"Jiajun Tong","authors":"Jiajun Tong, Zhixiao Wang, Xiaobin Rui","title":"Incorprating Prompt tuning for Commit classification with prior\n  Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Commit Classification(CC) is an important task in software maintenance since\nit helps software developers classify code changes into different types\naccording to their nature and purpose. This allows them to better understand\nhow their development efforts are progressing, identify areas where they need\nimprovement. However, existing methods are all discriminative models, usually\nwith complex architectures that require additional output layers to produce\nclass label probabilities. Moreover, they require a large amount of labeled\ndata for fine-tuning, and it is difficult to learn effective classification\nboundaries in the case of limited labeled data. To solve above problems, we\npropose a generative framework that Incorporating prompt-tuning for commit\nclassification with prior knowledge (IPCK)\nhttps://github.com/AppleMax1992/IPCK, which simplifies the model structure and\nlearns features across different tasks. It can still reach the SOTA performance\nwith only limited samples. Firstly, we proposed a generative framework based on\nT5. This encoder-decoder construction method unifies different CC task into a\ntext2text problem, which simplifies the structure of the model by not requiring\nan extra output layer. Second, instead of fine-tuning, we design an\nprompt-tuning solution which can be adopted in few-shot scenarios with only\nlimit samples. Furthermore, we incorporate prior knowledge via an external\nknowledge graph to map the probabilities of words into the final labels in the\nspeech machine step to improve performance in few-shot scenarios. Extensive\nexperiments on two open available datasets show that our framework can solve\nthe CC problem simply but effectively in few-shot and zeroshot scenarios, while\nimproving the adaptability of the model without requiring a large amount of\ntraining samples for fine-tuning.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:17:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tong","Jiajun",""],["Wang","Zhixiao",""],["Rui","Xiaobin",""]]}
{"id":"2308.10577","submitter":"Marco Dentz","authors":"Xiangnan Yu and Marco Dentz and HongGuang Sun and Yong Zhang","title":"The impact of microscale physics in continuous time random walks for\n  hydrodynamic dispersion in disordered media","comments":"29 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.stat-mech physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The continuous time random walk (CTRW) approach has been widely applied to\nmodel large-scale non-Fickian transport in the flow through disordered media.\nOften, the underlying microscopic transport mechanisms and disorder\ncharacteristics are not known. Their effect on large-scale solute dispersion is\nencoded by a heavy-tailed transition time distribution. Here we study how the\nmicroscale physics manifests in the CTRW framework, and how it affects solute\ndispersion. To this end, we consider three CTRW models that originate in\ndifferent microscopic disorder and transport mechanisms, that is, transport\nunder random sorption properties, random flow properties, and a combination\nthereof. All of these mechanisms can give rise to anomalous transport. We first\nderive the CTRW models corresponding to each of these physical scenarios, then\nwe explore the impact of the microscale physics on the large-scale dispersion\nbehavior for flux-weighted and uniform solute injection modes. Analytical and\nnumerical results show the differences and similarities in the observed\nanomalous dispersion behaviors in terms of spatial particle densities,\ndisplacement mean and variance, and particle breakthrough curves. While random\nadvection and sorption have similar large-scale transport signatures, they\ndiffer in their response to uniform injection conditions, and in general to\ninitial particle distributions that are not flux-weighted. These findings\nhighlight the importance of the microscale physics for the interpretation and\nprediction of anomalous dispersion phenomena in disordered media.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:17:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Xiangnan",""],["Dentz","Marco",""],["Sun","HongGuang",""],["Zhang","Yong",""]]}
{"id":"2308.10578","submitter":"Cinzia Di Giusto","authors":"Cinzia Di Giusto (C&A), Davide Ferr\\'e, Etienne Lozes (I3S, LSV),\n  Nicolas Nisse","title":"Weakly synchronous systems with three machines are Turing powerful","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Communicating finite-state machines (CFMs) are a Turing powerful model of\nasynchronous message-passing distributed systems. In weakly synchronous\nsystems, processes communicate through phases in which messages are first sent\nand then received, for each process. Such systems enjoy a limited form of\nsynchronization, and for some communication models, this restriction is enough\nto make the reachability problem decidable. In particular, we explore the\nintriguing case of p2p (FIFO) communication, for which the reachability problem\nis known to be undecidable for four processes, but decidable for two. We show\nthat the configuration reachability problem for weakly synchronous systems of\nthree processes is undecidable. This result is heavily inspired by our study on\nthe treewidth of the Message Sequence Charts (MSCs) that might be generated by\nsuch systems. In this sense, the main contribution of this work is a weakly\nsynchronous system with three processes that generates MSCs of arbitrarily\nlarge treewidth.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:24:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Di Giusto","Cinzia","","C&A"],["Ferr\u00e9","Davide","","I3S, LSV"],["Lozes","Etienne","","I3S, LSV"],["Nisse","Nicolas",""]]}
{"id":"2308.10579","submitter":"Aleksander Figiel","authors":"Aleksander Figiel and Janne H. Korhonen and Neil Olver and Stefan\n  Schmid","title":"Demand-Aware Network Design with Steiner Nodes and a Connection to\n  Virtual Network Embedding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.DC cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emerging optical and virtualization technologies enable the design of more\nflexible and demand-aware networked systems, in which resources can be\noptimized toward the actual workload they serve. For example, in a demand-aware\ndatacenter network, frequently communicating nodes (e.g., two virtual machines\nor a pair of racks in a datacenter) can be placed topologically closer,\nreducing communication costs and hence improving the overall network\nperformance.\n  This paper revisits the bounded-degree network design problem underlying such\ndemand-aware networks. Namely, given a distribution over communicating server\npairs, we want to design a network with bounded maximum degree that minimizes\nexpected communication distance. In addition to this known problem, we\nintroduce and study a variant where we allow Steiner nodes (i.e., additional\nrouters) to be added to augment the network.\n  We improve the understanding of this problem domain in several ways. First,\nwe shed light on the complexity and hardness of the aforementioned problems,\nand study a connection between them and the virtual networking embedding\nproblem. We then provide a constant-factor approximation algorithm for the\nSteiner node version of the problem, and use it to improve over prior\nstate-of-the-art algorithms for the original version of the problem with sparse\ncommunication distributions. Finally, we investigate various heuristic\napproaches to bounded-degree network design problem, in particular providing a\nreliable heuristic algorithm with good experimental performance.\n  We report on an extensive empirical evaluation, using several real-world\ntraffic traces from datacenters, and find that our approach results in improved\ndemand-aware network designs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:24:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Figiel","Aleksander",""],["Korhonen","Janne H.",""],["Olver","Neil",""],["Schmid","Stefan",""]]}
{"id":"2308.10580","submitter":"Mostafa Meliani","authors":"B. Kaltenbacher, M. Meliani, and V. Nikoli\\'c","title":"The Kuznetsov and Blackstock equations of nonlinear acoustics with\n  nonlocal-in-time dissipation","comments":"This is the second part of our study of quasilinear wave equations\n  with nonlocal dissipation resulting from the splitting of arXiv:2206.15245 to\n  improve its readability","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In ultrasonics, nonlocal quasilinear wave equations arise when taking into\naccount a class of heat flux laws of Gurtin--Pipkin type within the system of\ngoverning equations of sound motion. The present study extends previous work by\nthe authors to incorporate nonlocal acoustic wave equations with quadratic\ngradient nonlinearities which require a new approach in the energy analysis.\nMore precisely, we investigate the Kuznetsov and Blackstock equations with\ndissipation of fractional type and identify a minimal set of assumptions on the\nmemory kernel needed for each equation. In particular, we discuss the\nphysically relevant examples of Abel and Mittag-Leffler kernels. We perform the\nwell-posedness analysis uniformly with respect to a small parameter on which\nthe kernels depend and which can be interpreted as the sound diffusivity or the\nthermal relaxation time. We then analyze the limiting behavior of solutions\nwith respect to this parameter, and how it is influenced by the specific class\nof memory kernels at hand. Through such a limiting study, we relate the\nconsidered nonlocal quasilinear equations to their limiting counterparts and\nestablish the convergence rates of the respective solutions in the energy norm.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:24:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaltenbacher","B.",""],["Meliani","M.",""],["Nikoli\u0107","V.",""]]}
{"id":"2308.10581","submitter":"Montserrat Teixidor i Bigas","authors":"Montserrat Teixidor i Bigas","title":"Brill-Noether loci","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Brill-Noether loci are those subsets of the moduli space of curves of genus g\ndetermined by the existence of a linear series of degree d and dimension r. We\nprovide a new proof of the non-emptiness of the loci when the expected\ncodimension of the Brill-Noether loci is at most g-2. We show that for a\ngeneric point of a component of this locus, the Petri map is onto and the\nmaximal rank conjecture for quadrics is satisfied. We also show that\nBrill-Noether loci of the same codimension are distinct when the codimension is\nnot too large\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:30:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bigas","Montserrat Teixidor i",""]]}
{"id":"2308.10582","submitter":"Aleksandar Bulj","authors":"Aleksandar Bulj","title":"Generic norm growth of powers of homogeneous unimodular Fourier\n  multipliers","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.AP math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an integer $d\\ge 2$, $t\\in \\mathbb{R}$ and a $0$-homogeneous function\n$\\Phi\\in C^{\\infty}(\\mathbb{R}^{d}\\setminus\\{0\\},\\mathbb{R})$, we consider the\nfamily of Fourier multiplier operators $T_{\\Phi}^t$ associated with symbols\n$\\xi\\mapsto \\exp(it\\Phi(\\xi))$ and prove that for a generic phase function\n$\\Phi$, one has the estimate $\\lVert T_{\\Phi}^t\\rVert_{L^p\\to L^p}\n\\gtrsim_{d,p, \\Phi}\\langle t\\rangle ^{d\\lvert\\frac{1}{p}-\\frac{1}{2}\\rvert}$.\nThat is the maximal possible order of growth in $t\\to \\pm \\infty$, according to\nthe previous work by V. Kova\\v{c} and the author and the result shows that the\ntwo special examples of functions $\\Phi$ that induce the maximal growth, given\nby V. Kova\\v{c} and the author and independently by D. Stolyarov, to disprove a\nconjecture of Maz'ya actually exhibit the same general phenomenon.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:30:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bulj","Aleksandar",""]]}
{"id":"2308.10583","submitter":"Willem van den Boom","authors":"Willem van den Boom, Maria De Iorio, Fang Qian, Alessandra Guglielmi","title":"The Multivariate Bernoulli detector: Change point estimation in discrete\n  survival analysis","comments":"43 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time-to-event data are often recorded on a discrete scale with multiple,\ncompeting risks as potential causes for the event. In this context, application\nof continuous survival analysis methods with a single risk suffer from biased\nestimation. Therefore, we propose the Multivariate Bernoulli detector for\ncompeting risks with discrete times involving a multivariate change point model\non the cause-specific baseline hazards. Through the prior on the number of\nchange points and their location, we impose dependence between change points\nacross risks, as well as allowing for data-driven learning of their number.\nThen, conditionally on these change points, a Multivariate Bernoulli prior is\nused to infer which risks are involved. Focus of posterior inference is\ncause-specific hazard rates and dependence across risks. Such dependence is\noften present due to subject-specific changes across time that affect all\nrisks. Full posterior inference is performed through a tailored local-global\nMarkov chain Monte Carlo (MCMC) algorithm, which exploits a data augmentation\ntrick and MCMC updates from non-conjugate Bayesian nonparametric methods. We\nillustrate our model in simulations and on prostate cancer data, comparing its\nperformance with existing approaches.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:31:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Boom","Willem van den",""],["De Iorio","Maria",""],["Qian","Fang",""],["Guglielmi","Alessandra",""]]}
{"id":"2308.10584","submitter":"Sopan Sarkar","authors":"Sopan Sarkar, Mohammad Hossein Manshaei, and Marwan Krunz","title":"RADIANCE: Radio-Frequency Adversarial Deep-learning Inference for\n  Automated Network Coverage Estimation","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NI eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Radio-frequency coverage maps (RF maps) are extensively utilized in wireless\nnetworks for capacity planning, placement of access points and base stations,\nlocalization, and coverage estimation. Conducting site surveys to obtain RF\nmaps is labor-intensive and sometimes not feasible. In this paper, we propose\nradio-frequency adversarial deep-learning inference for automated network\ncoverage estimation (RADIANCE), a generative adversarial network (GAN) based\napproach for synthesizing RF maps in indoor scenarios. RADIANCE utilizes a\nsemantic map, a high-level representation of the indoor environment to encode\nspatial relationships and attributes of objects within the environment and\nguide the RF map generation process. We introduce a new gradient-based loss\nfunction that computes the magnitude and direction of change in received signal\nstrength (RSS) values from a point within the environment. RADIANCE\nincorporates this loss function along with the antenna pattern to capture\nsignal propagation within a given indoor configuration and generate new\npatterns under new configuration, antenna (beam) pattern, and center frequency.\nExtensive simulations are conducted to compare RADIANCE with ray-tracing\nsimulations of RF maps. Our results show that RADIANCE achieves a mean average\nerror (MAE) of 0.09, root-mean-squared error (RMSE) of 0.29, peak\nsignal-to-noise ratio (PSNR) of 10.78, and multi-scale structural similarity\nindex (MS-SSIM) of 0.80.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:33:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sarkar","Sopan",""],["Manshaei","Mohammad Hossein",""],["Krunz","Marwan",""]]}
{"id":"2308.10585","submitter":"Dingzirui Wang","authors":"Dingzirui Wang, Longxu Dou, Wenbin Zhang, Junyu Zeng, Wanxiang Che","title":"Exploring Equation as a Better Intermediate Meaning Representation for\n  Numerical Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Numerical reasoning is vital for natural language processing models to\nunderstand and process numerical information in real-world scenarios. Most\ncurrent methods first generate the Intermediate Meaning Representations (IMRs)\nof questions and then generate answers. Current SOTA methods generate programs\nas IMRs with large language models (LLMs). Intuitively, equations have fewer\nrestrictions and closer semantics to the question than programs, leading to\nhigher generation accuracy. However, current LLMs generate equations worse than\nprograms, where we assume that the equation data is rare in pre-training data\ncompared to programs. So in this paper, we try to use equations as IMRs to\nsolve the numerical reasoning task by addressing two problems: (1)\nTheoretically, how to prove that the equation is an IMR with higher generation\naccuracy than programs; (2) Empirically, how to improve the generation accuracy\nof equations with LLMs. For the first problem, we propose and prove a\nproposition to theoretically compare the generation accuracy of different IMRs.\nFor the second problem, we present a method called Boosting Numerical\nReason\\textbfing by Decomposing the Generation of Equations (Bridge), which can\nimprove the accuracy of LLMs in generating equations as IMRs by reducing the\ntendency of generating constant expressions and programs. Our method improves\nthe performance by 2.2%, 0.9%, and 1.7% on GSM8K, SVAMP, and Algebra datasets\ncompared to the previous state-of-the-art methods under the single reasoning\npath setting. Our codes and prompts are released in\nhttps://github.com/zirui-HIT/Bridge_for_Numerical_Reasoning.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:35:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Dingzirui",""],["Dou","Longxu",""],["Zhang","Wenbin",""],["Zeng","Junyu",""],["Che","Wanxiang",""]]}
{"id":"2308.10586","submitter":"Gw\\'enol\\'e Lecorv\\'e","authors":"Rashedur Rahman, Gw\\'enol\\'e Lecorv\\'e, Nicolas B\\'echet","title":"Age Recommendation from Texts and Sentences for Children","comments":"26 pages (incl. 4 pages for appendices), 4 figures, 20 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Children have less text understanding capability than adults. Moreover, this\ncapability differs among the children of different ages. Hence, automatically\npredicting a recommended age based on texts or sentences would be a great\nbenefit to propose adequate texts to children and to help authors writing in\nthe most appropriate way. This paper presents our recent advances on the age\nrecommendation task. We consider age recommendation as a regression task, and\ndiscuss the need for appropriate evaluation metrics, study the use of\nstate-of-the-art machine learning model, namely Transformers, and compare it to\ndifferent models coming from the literature. Our results are also compared with\nrecommendations made by experts. Further, this paper deals with preliminary\nexplainability of the age prediction model by analyzing various linguistic\nfeatures. We conduct the experiments on a dataset of 3, 673 French texts (132K\nsentences, 2.5M words). To recommend age at the text level and sentence level,\nour best models achieve MAE scores of 0.98 and 1.83 respectively on the test\nset. Also, compared to the recommendations made by experts, our sentence-level\nrecommendation model gets a similar score to the experts, while the text-level\nrecommendation model outperforms the experts by an MAE score of 1.48.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:40:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rahman","Rashedur",""],["Lecorv\u00e9","Gw\u00e9nol\u00e9",""],["B\u00e9chet","Nicolas",""]]}
{"id":"2308.10587","submitter":"Muhammad Syifa'ul Mufid","authors":"Muhammad Syifa'ul Mufid, Andrea Micheli, Alessandro Abate, Alessandro\n  Cimatti","title":"Formal Analysis and Verification of Max-Plus Linear Systems","comments":"28 pages (including appendixes)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Max-Plus Linear (MPL) systems are an algebraic formalism with practical\napplications in transportation networks, manufacturing and biological systems.\nIn this paper, we investigate the problem of automatically analyzing the\nproperties of MPL, taking into account both structural properties such as\ntransient and cyclicity, and the open problem of user-defined temporal\nproperties. We propose Time-Difference LTL (TDLTL), a logic that encompasses\nthe delays between the discrete time events governed by an MPL system, and\ncharacterize the problem of model checking TDLTL over MPL. We first consider a\nframework based on the verification of infinite-state transition systems, and\npropose an approach based on an encoding into model checking. Then, we leverage\nthe specific features of MPL systems to devise a highly optimized,\ncombinational approach based on Satisfiability Modulo Theory (SMT). We\nexperimentally evaluate the features of the proposed approaches on a large set\nof benchmarks. The results show that the proposed approach substantially\noutperforms the state of the art competitors in expressiveness and\neffectiveness, and demonstrate the superiority of the combinational approach\nover the reduction to model checking.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:40:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mufid","Muhammad Syifa'ul",""],["Micheli","Andrea",""],["Abate","Alessandro",""],["Cimatti","Alessandro",""]]}
{"id":"2308.10588","submitter":"Jyotiranjan Beuria","authors":"Jyotiranjan Beuria","title":"Persistent homology of collider observations: when (w)hole matters","comments":"7 figures, 5 tables, submitted to PLB","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nlin.CD physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological invariants have played a fundamental role in the advancement of\ntheoretical high energy physics. Physicists have used several kinematic\ntechniques to distinguish new physics predictions from the Standard Model (SM)\nof particle physics at Large Hadron Collider (LHC). However, the study of\nglobal topological invariants of the collider signals has not yet attracted\nmuch attention. In this article, we present, a novel approach to study collider\nsignals using persistent homology. The global topological properties of the\nensemble of events as expressed by measures like persistent entropy, Betti\narea, etc. are worth considering in addition to the traditional approach of\nusing kinematic variables event by event. In this exploratory study, we first\nexplore the characteristic topological signature of a few SM electroweak\nresonant productions. Next, we use the framework to distinguish global\nproperties of the invisible Higgs decay processes in the SM and a real singlet\nextension of the SM featuring stable singlet scalar dark matter.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:41:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Beuria","Jyotiranjan",""]]}
{"id":"2308.10589","submitter":"Javad Shabanpour","authors":"Javad Shabanpour, Vladimir Lenets, Geoffroy Lerosey, Sergei Tretyakov\n  and Constantin Simovski","title":"Engineering of intelligent reflecting surfaces: Reflection locality and\n  angular stability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconfigurable intelligent surfaces (RISs) are electromagnetically passive\ncontrollable structures, deflecting the incident wave beam in directions\npredefined by the control signal. A usual way to design RIS based on\nmetasurfaces (MSs) is based on the application of the approximation in which\nthe reflective properties of a uniform MS are attributed to a unit cell of the\nnon-uniform one. We call this approximation the reflection locality. In the\npresent paper, we show that this approximation may result in heavy errors. We\nalso find a condition under which this approximation is applicable for a wide\nrange of incidence and deflection angles. This condition is the angular\nstability of the reflection phase of a uniform MS based on which the\nnon-uniform one is generated. We present an approximate analytical proof of the\nequivalence of the reflection locality and angular stability. As an example, we\nreport theoretical and experimental results we obtained for a binary RIS whose\ngeneric uniform analogue has the angular stability. Meanwhile, for its\ncounterpart without angular stability (the so-called mushroom MS) the same\nmodel fails.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:41:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shabanpour","Javad",""],["Lenets","Vladimir",""],["Lerosey","Geoffroy",""],["Tretyakov","Sergei",""],["Simovski","Constantin",""]]}
{"id":"2308.10590","submitter":"Naoya Kuse","authors":"Jonathan Cuevas, Ryugo Iwami, Atsushi Uchida, Kaoru Minoshima, and\n  Naoya Kuse","title":"Solving multi-armed bandit problems using a chaotic microresonator comb","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.ET","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Multi-Armed Bandit (MAB) problem, foundational to reinforcement\nlearning-based decision-making, addresses the challenge of maximizing rewards\namidst multiple uncertain choices. While algorithmic solutions are effective,\ntheir computational efficiency diminishes with increasing problem complexity.\nPhotonic accelerators, leveraging temporal and spatial-temporal chaos, have\nemerged as promising alternatives. However, despite these advancements, current\napproaches either compromise computation speed or amplify system complexity. In\nthis paper, we introduce a chaotic microresonator frequency comb (chaos comb)\nto tackle the MAB problem, where each comb mode is assigned to a slot machine.\nThrough a proof-of-concept experiment, we employ 44 comb modes to address an\nMAB with 44 slot machines, demonstrating performance competitive with both\nconventional software algorithms and other photonic methods. Further, the\nscalability of decision making is explored with up to 512 slot machines using\nexperimentally obtained temporal chaos in different time slots. Power-law\nscalability is achieved with an exponent of 0.96, outperforming conventional\nsoftware-based algorithms. Moreover, we find that a numerically calculated\nchaos comb accurately reproduces experimental results, paving the way for\ndiscussions on strategies to increase the number of slot machines.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:46:16 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 04:08:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cuevas","Jonathan",""],["Iwami","Ryugo",""],["Uchida","Atsushi",""],["Minoshima","Kaoru",""],["Kuse","Naoya",""]]}
{"id":"2308.10591","submitter":"Hannes Gernandt","authors":"Maria C. Honecker, Hannes Gernandt, Kai Wulff, Carsten Trunk, Johann\n  Reger","title":"Feedback rectifiable pairs and stabilization of switched linear systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the feedback design problem for switched linear systems. In\nparticular we aim to design a switched state-feedback such that the resulting\nclosed-loop switched system is in upper triangular form. To this effect we\nformulate and analyse the feedback rectification problem for pairs of matrices.\nWe present necessary and sufficient conditions for the feedback rectifiability\nof pairs for two subsystems and give a constructive procedure to design\nstabilizing state-feedback for a class of switched systems. Several examples\nillustrate the characteristics of the problem considered and the application of\nthe proposed constructive procedure.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:46:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Honecker","Maria C.",""],["Gernandt","Hannes",""],["Wulff","Kai",""],["Trunk","Carsten",""],["Reger","Johann",""]]}
{"id":"2308.10592","submitter":"Emilia Wi\\'snios","authors":"Inez Okulska, Kinga G{\\l}\\k{a}bi\\'nska, Anna Ko{\\l}os, Agnieszka\n  Karli\\'nska, Emilia Wi\\'snios, Adam Nowakowski, Pawe{\\l} Ellerik, Andrzej\n  Pra{\\l}at","title":"BAN-PL: a Novel Polish Dataset of Banned Harmful and Offensive Content\n  from Wykop.pl web service","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advances in automated detection of offensive language online, including hate\nspeech and cyberbullying, require improved access to publicly available\ndatasets comprising social media content. In this paper, we introduce BAN-PL,\nthe first open dataset in the Polish language that encompasses texts flagged as\nharmful and subsequently removed by professional moderators. The dataset\nencompasses a total of 691,662 pieces of content from a popular social\nnetworking service, Wykop, often referred to as the \"Polish Reddit\", including\nboth posts and comments, and is evenly distributed into two distinct classes:\n\"harmful\" and \"neutral\". We provide a comprehensive description of the data\ncollection and preprocessing procedures, as well as highlight the linguistic\nspecificity of the data. The BAN-PL dataset, along with advanced preprocessing\nscripts for, i.a., unmasking profanities, will be publicly available.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:47:31 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 11:01:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Okulska","Inez",""],["G\u0142\u0105bi\u0144ska","Kinga",""],["Ko\u0142os","Anna",""],["Karli\u0144ska","Agnieszka",""],["Wi\u015bnios","Emilia",""],["Nowakowski","Adam",""],["Ellerik","Pawe\u0142",""],["Pra\u0142at","Andrzej",""]]}
{"id":"2308.10593","submitter":"Dmitry Maslennikov","authors":"Dmitry R. Maslennikov, Marios Maimaris, Haoqing Ning, Xijia Zheng,\n  Navendu Mondal, Vladimir V. Bruevich, Saied Md Pratik, Andrew J. Musser,\n  Vitaly Podzorov, Jean-Luc Bredas, Veaceslav Coropceanu, Artem A. Bakulin","title":"Interplay Between Mixed and Pure Exciton States Controls Singlet Fission\n  in Rubrene Single Crystals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Singlet fission (SF) is a multielectron process in which one singlet exciton\nS converts into a pair of triplet excitons T+T. SF is widely studied as it may\nhelp overcome the Shockley-Queisser efficiency limit for semiconductor\nphotovoltaic cells. To elucidate and control the SF mechanism, great attention\nhas been given to the identification of intermediate states in SF materials,\nwhich often appear elusive due to the complexity and fast timescales of the SF\nprocess. Here, we apply 10fs-1ms transient absorption techniques to high-purity\nrubrene single crystals to disentangle the intrinsic fission dynamics from the\neffects of defects and grain boundaries and to identify reliably the fission\nintermediates. We show that above-gap excitation directly generates a hybrid\nvibronically assisted mixture of singlet state and triplet-pair multiexciton\n[S:TT], which rapidly (<100fs) and coherently branches into pure singlet or\ntriplet excitations. The relaxation of [S:TT] to S is followed by a relatively\nslow and temperature-activated (48 meV activation energy) incoherent fission\nprocess. The SF competing pathways and intermediates revealed here unify the\nobservations and models presented in previous studies of SF in rubrene and\npropose alternative strategies for the development of SF-enhanced photovoltaic\nmaterials.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:48:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maslennikov","Dmitry R.",""],["Maimaris","Marios",""],["Ning","Haoqing",""],["Zheng","Xijia",""],["Mondal","Navendu",""],["Bruevich","Vladimir V.",""],["Pratik","Saied Md",""],["Musser","Andrew J.",""],["Podzorov","Vitaly",""],["Bredas","Jean-Luc",""],["Coropceanu","Veaceslav",""],["Bakulin","Artem A.",""]]}
{"id":"2308.10594","submitter":"Emil Have","authors":"Jay Armas, Emil Have","title":"Carrollian fluids and spontaneous breaking of boost symmetry","comments":"5+7 pages, letter format","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the hydrodynamic regime, field theories typically have their boost\nsymmetry spontaneously broken due to the presence of a thermal rest frame\nalthough the associated Goldstone field does not acquire independent dynamics.\nWe show that this is not the case for Carrollian field theories where the boost\nGoldstone field plays a central role. This allows us to give a first-principles\nderivation of the equilibrium currents and dissipative effects of Carrollian\nfluids. We also demonstrate that the limit of vanishing speed of light of\nrelativistic fluids is a special case of this class of Carrollian fluids. Our\nresults shine light on the thermodynamic properties and thermal partition\nfunctions of Carrollian field theories.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:48:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Armas","Jay",""],["Have","Emil",""]]}
{"id":"2308.10595","submitter":"Michael Farber","authors":"Michael Farber and Amit Kumar Paul","title":"Sequential parametrized topological complexity of sphere bundles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous motion of a system (robot) is controlled by a motion planning\nalgorithm. A sequential parametrized motion planning algorithm \\cite{FP22}\nworks under variable external conditions and generates continuous motions of\nthe system to attain the prescribed sequence of states at prescribed moments of\ntime. Topological complexity of such algorithms characterises their structure\nand discontinuities. Information about states of the system consistent with\nstates of the external conditions is described by a fibration $p: E\\to B$ where\nthe base $B$ parametrises the external conditions and each fibre $p^{-1}(b)$ is\nthe configuration space of the system constrained by external conditions $b\\in\nB$; more detail on this approach is given below. Our main goal in this paper is\nto study the sequential topological complexity of sphere bundles $\\dot \\xi:\n\\dot E\\to B$; in other words we study {\\it \\lq\\lq parametrized families of\nspheres\\rq\\rq} and sequential parametrized motion planning algorithms for such\nbundles. We use the Euler and Stiefel - Whitney characteristic classes to\nobtain lower bounds on the topological complexity. We illustrate our results by\nmany explicit examples. Some related results for the special case $r=2$ were\ndescribed earlier in \\cite{FW23}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:50:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Farber","Michael",""],["Paul","Amit Kumar",""]]}
{"id":"2308.10596","submitter":"Margot Boughelilba","authors":"Margot Boughelilba, Anita Reimer, Lukas Merten and Jon-Paul Lundquist","title":"Spine-sheath jet model for low-luminosity AGNs","comments":"PoS 444 (38th ICRC) 958 (accepted)","journal-ref":null,"doi":"10.22323/1.444.0958","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In several jetted AGNs, structured jets have been observed. In particular\nspine-sheath configurations where the jet is radially divided into two or more\nzones of different flow velocities. We present a model based on the particle\nand radiation transport code CR-ENTREES. Here, interaction rates and secondary\nparticle and photon yields are pre-calculated by Monte Carlo event generators\nor semi-analytical approximations. These are then used to create transition\nmatrices, that describe how each particle spectrum evolves with time. This code\nallows for arbitrary injection of primary particles, and the possibility to\nchoose which interaction to include (photo-meson production, Bethe-Heitler\npair-production, inverse-Compton scattering, $\\gamma$-$\\gamma$ pair production,\ndecay of all unstable particles, synchrotron radiation -- from electrons,\nprotons, and all relevant secondaries before their respective decays -- and\nparticle escape). In addition to the particle and radiation interactions taking\nplace in each homogeneous zone, we implement the feedback between the two zones\nhaving different bulk velocities. The main mechanism at play when particles\ncross the boundary between the two zones is shear acceleration. We follow a\nmicroscopic description of this acceleration process to create a corresponding\ntransition matrix and include it in our numerical setup. Furthermore, each\nzone's radiation field can be used as an external target photon field for the\nother zone's particle interactions. We present here the first results of the\neffect of a two-zone spine-sheath jet, by applying this model to typical\nlow-luminosity AGNs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:53:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Boughelilba","Margot",""],["Reimer","Anita",""],["Merten","Lukas",""],["Lundquist","Jon-Paul",""]]}
{"id":"2308.10597","submitter":"Daniele De Martini","authors":"Fraser Rennie, David Williams, Paul Newman and Daniele De Martini","title":"Doppler-aware Odometry from FMCW Scanning Radar","comments":"Accepted to ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work explores Doppler information from a millimetre-Wave (mm-W)\nFrequency-Modulated Continuous-Wave (FMCW) scanning radar to make odometry\nestimation more robust and accurate. Firstly, doppler information is added to\nthe scan masking process to enhance correlative scan matching. Secondly, we\ntrain a Neural Network (NN) for regressing forward velocity directly from a\nsingle radar scan; we fuse this estimate with the correlative scan matching\nestimate and show improved robustness to bad estimates caused by challenging\nenvironment geometries, e.g. narrow tunnels. We test our method with a novel\ncustom dataset which is released with this work at\nhttps://ori.ox.ac.uk/publications/datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:56:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rennie","Fraser",""],["Williams","David",""],["Newman","Paul",""],["De Martini","Daniele",""]]}
{"id":"2308.10598","submitter":"Abdulah Jarouf","authors":"Abdulah Jarouf, Javier Hernandez Fernandez, Aymen Omri, Roberto Di\n  Pietro","title":"Inferring Power Grid Information with Power Line Communications: Review\n  and Insights","comments":"IEEE Communication Surveys and Tutorials Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.OH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-frequency signals were widely studied in the last decade to identify\ngrid and channel conditions in PLNs. PLMs operating on the grid's physical\nlayer are capable of transmitting such signals to infer information about the\ngrid. Hence, PLC is a suitable communication technology for SG applications,\nespecially suited for grid monitoring and surveillance. In this paper, we\nprovide several contributions: 1) a classification of PLC-based applications;\n2) a taxonomy of the related methodologies; 3) a review of the literature in\nthe area of PLC Grid Information Inference (GII); and, insights that can be\nleveraged to further advance the field. We found research contributions\naddressing PLMs for three main PLC-GII applications: topology inference,\nanomaly detection, and physical layer key generation. In addition, various\nPLC-GII measurement, processing, and analysis approaches were found to provide\ndistinctive features in measurement resolution, computation complexity, and\nanalysis accuracy. We utilize the outcome of our review to shed light on the\ncurrent limitations of the research contributions and suggest future research\ndirections in this field.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:56:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jarouf","Abdulah",""],["Fernandez","Javier Hernandez",""],["Omri","Aymen",""],["Di Pietro","Roberto",""]]}
{"id":"2308.10599","submitter":"Anders Christensen","authors":"Anders Christensen, Massimiliano Mancini, A. Sophia Koepke, Ole\n  Winther, Zeynep Akata","title":"Image-free Classifier Injection for Zero-Shot Classification","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Zero-shot learning models achieve remarkable results on image classification\nfor samples from classes that were not seen during training. However, such\nmodels must be trained from scratch with specialised methods: therefore, access\nto a training dataset is required when the need for zero-shot classification\narises. In this paper, we aim to equip pre-trained models with zero-shot\nclassification capabilities without the use of image data. We achieve this with\nour proposed Image-free Classifier Injection with Semantics (ICIS) that injects\nclassifiers for new, unseen classes into pre-trained classification models in a\npost-hoc fashion without relying on image data. Instead, the existing\nclassifier weights and simple class-wise descriptors, such as class names or\nattributes, are used. ICIS has two encoder-decoder networks that learn to\nreconstruct classifier weights from descriptors (and vice versa), exploiting\n(cross-)reconstruction and cosine losses to regularise the decoding process.\nNotably, ICIS can be cheaply trained and applied directly on top of pre-trained\nclassification models. Experiments on benchmark ZSL datasets show that ICIS\nproduces unseen classifier weights that achieve strong (generalised) zero-shot\nclassification performance. Code is available at\nhttps://github.com/ExplainableML/ImageFreeZSL .\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:56:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Christensen","Anders",""],["Mancini","Massimiliano",""],["Koepke","A. Sophia",""],["Winther","Ole",""],["Akata","Zeynep",""]]}
{"id":"2308.10600","submitter":"Robert Ganian","authors":"Cornelius Brand and Robert Ganian and Sebastian R\\\"oder and Florian\n  Schager","title":"Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs","comments":"Accepted at GD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a right-angle crossing (RAC) drawing of a graph, each edge is represented\nas a polyline and edge crossings must occur at an angle of exactly $90^\\circ$,\nwhere the number of bends on such polylines is typically restricted in some\nway. While structural and topological properties of RAC drawings have been the\nfocus of extensive research, little was known about the boundaries of\ntractability for computing such drawings. In this paper, we initiate the study\nof RAC drawings from the viewpoint of parameterized complexity. In particular,\nwe establish that computing a RAC drawing of an input graph $G$ with at most\n$b$ bends (or determining that none exists) is fixed-parameter tractable\nparameterized by either the feedback edge number of $G$, or $b$ plus the vertex\ncover number of $G$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:56:56 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 07:44:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Brand","Cornelius",""],["Ganian","Robert",""],["R\u00f6der","Sebastian",""],["Schager","Florian",""]]}
{"id":"2308.10601","submitter":"Zhijin Ge","authors":"Zhijin Ge, Fanhua Shang, Hongying Liu, Yuanyuan Liu, Liang Wan, Wei\n  Feng, Xiaosen Wang","title":"Improving the Transferability of Adversarial Examples with Arbitrary\n  Style Transfer","comments":"10 pages, 2 figures, accepted by the 31st ACM International\n  Conference on Multimedia (MM '23)","journal-ref":null,"doi":"10.1145/3581783.3612070","report-no":null,"categories":"cs.CV cs.CR cs.LG eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks are vulnerable to adversarial examples crafted by\napplying human-imperceptible perturbations on clean inputs. Although many\nattack methods can achieve high success rates in the white-box setting, they\nalso exhibit weak transferability in the black-box setting. Recently, various\nmethods have been proposed to improve adversarial transferability, in which the\ninput transformation is one of the most effective methods. In this work, we\nnotice that existing input transformation-based works mainly adopt the\ntransformed data in the same domain for augmentation. Inspired by domain\ngeneralization, we aim to further improve the transferability using the data\naugmented from different domains. Specifically, a style transfer network can\nalter the distribution of low-level visual features in an image while\npreserving semantic content for humans. Hence, we propose a novel attack method\nnamed Style Transfer Method (STM) that utilizes a proposed arbitrary style\ntransfer network to transform the images into different domains. To avoid\ninconsistent semantic information of stylized images for the classification\nnetwork, we fine-tune the style transfer network and mix up the generated\nimages added by random noise with the original images to maintain semantic\nconsistency and boost input diversity. Extensive experimental results on the\nImageNet-compatible dataset show that our proposed method can significantly\nimprove the adversarial transferability on either normally trained models or\nadversarially trained models than state-of-the-art input transformation-based\nattacks. Code is available at: https://github.com/Zhijin-Ge/STM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:58:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ge","Zhijin",""],["Shang","Fanhua",""],["Liu","Hongying",""],["Liu","Yuanyuan",""],["Wan","Liang",""],["Feng","Wei",""],["Wang","Xiaosen",""]]}
{"id":"2308.10602","submitter":"Liangyi Zhao","authors":"Peng Gao, Liangyi Zhao","title":"First moment of central values of some primitive Dirichlet $L$-functions\n  with fixed order characters","comments":"11 pages. arXiv admin note: text overlap with arXiv:2306.10726","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We evaluate asymptotically the smoothed first moment of central values of\nfamilies of primitive cubic, quartic and sextic Dirichlet $L$-functions, using\nthe method of double Dirichlet series. Quantitative non-vanishing result for\nthese $L$-values are also proved.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:00:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gao","Peng",""],["Zhao","Liangyi",""]]}
{"id":"2308.10603","submitter":"Silvia-Laura Pintea","authors":"Silvia L. Pintea, Yancong Lin, Jouke Dijkstra, Jan C. van Gemert","title":"A step towards understanding why classification helps regression","comments":"Accepted at ICCV-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A number of computer vision deep regression approaches report improved\nresults when adding a classification loss to the regression loss. Here, we\nexplore why this is useful in practice and when it is beneficial. To do so, we\nstart from precisely controlled dataset variations and data samplings and find\nthat the effect of adding a classification loss is the most pronounced for\nregression with imbalanced data. We explain these empirical findings by\nformalizing the relation between the balanced and imbalanced regression losses.\nFinally, we show that our findings hold on two real imbalanced image datasets\nfor depth estimation (NYUD2-DIR), and age estimation (IMDB-WIKI-DIR), and on\nthe problem of imbalanced video progress prediction (Breakfast). Our main\ntakeaway is: for a regression task, if the data sampling is imbalanced, then\nadd a classification loss.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:00:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pintea","Silvia L.",""],["Lin","Yancong",""],["Dijkstra","Jouke",""],["van Gemert","Jan C.",""]]}
{"id":"2308.10604","submitter":"Dongwook Lee Ph.D.","authors":"Dongwook Lee, Wonjun Choi, Seohyung Lee, ByungIn Yoo, Eunho Yang,\n  Seongju Hwang","title":"BackTrack: Robust template update via Backward Tracking of candidate\n  template","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variations of target appearance such as deformations, illumination variance,\nocclusion, etc., are the major challenges of visual object tracking that\nnegatively impact the performance of a tracker. An effective method to tackle\nthese challenges is template update, which updates the template to reflect the\nchange of appearance in the target object during tracking. However, with\ntemplate updates, inadequate quality of new templates or inappropriate timing\nof updates may induce a model drift problem, which severely degrades the\ntracking performance. Here, we propose BackTrack, a robust and reliable method\nto quantify the confidence of the candidate template by backward tracking it on\nthe past frames. Based on the confidence score of candidates from BackTrack, we\ncan update the template with a reliable candidate at the right time while\nrejecting unreliable candidates. BackTrack is a generic template update scheme\nand is applicable to any template-based trackers. Extensive experiments on\nvarious tracking benchmarks verify the effectiveness of BackTrack over existing\ntemplate update algorithms, as it achieves SOTA performance on various tracking\nbenchmarks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:00:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lee","Dongwook",""],["Choi","Wonjun",""],["Lee","Seohyung",""],["Yoo","ByungIn",""],["Yang","Eunho",""],["Hwang","Seongju",""]]}
{"id":"2308.10605","submitter":"Anshuman Baruah","authors":"Parangam Goswami, Anshuman Baruah, Atri Deshamukhya","title":"Traversable wormholes in $f(R)$ gravity sourced by a cloud of strings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wormhole solutions in General Relativity (GR) require \\textit{exotic} matter\nsources that violate the null energy condition (NEC), and it is well known that\nhigher-order modifications of GR and some alternative matter sources can\nsupport wormholes. In this study, we explore the possibility of formulating\ntraversable wormholes in $f(R)$ modified gravity, which is perhaps the most\nwidely discussed modification of GR, with two approaches. First, to investigate\nthe effects of geometrical constraints on the global characteristics, we gauge\nthe $rr$-component of the metric tensor, and employ Pad\\`{e} approximation to\ncheck whether a well-constrained \\textit{shape function} can be formulated in\nthis manner. We then derive the field equations with a background of string\ncloud, and numerically analyse the energy conditions, stability, and amount of\nexotic matter in this space-time. Next, as an alternative source in a simple\n$f(R)$ gravity model, we use the background cloud of strings to estimate the\nwormhole shape function, and analyse the relevant properties of the space-time.\nThese results are then compared with those of wormholes threaded by normal\nmatter in the simple $f(R)$ gravity model considered. The results demonstrate\nthat wormholes with NEC violations are feasible; however, the wormhole\nspace-times in the simple $f(R)$ gravity model are unstable.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:02:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Goswami","Parangam",""],["Baruah","Anshuman",""],["Deshamukhya","Atri",""]]}
{"id":"2308.10606","submitter":"Marco Scutari","authors":"Alessandro Bregoli and Karin Rathsman and Marco Scutari and Fabio\n  Stella and S{\\o}ren Wengel Mogensen","title":"Analyzing Complex Systems with Cascades Using Continuous-Time Bayesian\n  Networks","comments":"21 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interacting systems of events may exhibit cascading behavior where events\ntend to be temporally clustered. While the cascades themselves may be obvious\nfrom the data, it is important to understand which states of the system trigger\nthem. For this purpose, we propose a modeling framework based on\ncontinuous-time Bayesian networks (CTBNs) to analyze cascading behavior in\ncomplex systems. This framework allows us to describe how events propagate\nthrough the system and to identify likely sentry states, that is, system states\nthat may lead to imminent cascading behavior. Moreover, CTBNs have a simple\ngraphical representation and provide interpretable outputs, both of which are\nimportant when communicating with domain experts. We also develop new methods\nfor knowledge extraction from CTBNs and we apply the proposed methodology to a\ndata set of alarms in a large industrial system.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:06:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bregoli","Alessandro",""],["Rathsman","Karin",""],["Scutari","Marco",""],["Stella","Fabio",""],["Mogensen","S\u00f8ren Wengel",""]]}
{"id":"2308.10607","submitter":"Johannes Moerland","authors":"Johannes Moerland, Nikolai Wyderka, Hermann Kampermann, Dagmar\n  Bru{\\ss}","title":"Bound entangled Bell diagonal states of unequal local dimensions, and\n  their witnesses","comments":"11 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bell diagonal states constitute a well-studied family of bipartite quantum\nstates that arise naturally in various contexts in quantum information. In this\npaper we generalize the notion of Bell diagonal states to the case of unequal\nlocal dimensions and investigate their entanglement properties. We extend the\nfamily of entanglement criteria of Sarbicki et al. to non-Hermitian operator\nbases to construct entanglement witnesses for the class of generalized Bell\ndiagonal states. We then show how to optimize the witnesses with respect to\nnoise robustness. Finally, we use these witnesses to construct bound entangled\nstates that are not detected by the usual computable cross norm or realignment\nand de Vicente criteria.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:07:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Moerland","Johannes",""],["Wyderka","Nikolai",""],["Kampermann","Hermann",""],["Bru\u00df","Dagmar",""]]}
{"id":"2308.10608","submitter":"Yuhan Li","authors":"Yuhan Li, Yishun Dou, Yue Shi, Yu Lei, Xuanhong Chen, Yi Zhang, Peng\n  Zhou, Bingbing Ni","title":"FocalDreamer: Text-driven 3D Editing via Focal-fusion Assembly","comments":"Project website: https://focaldreamer.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While text-3D editing has made significant strides in leveraging score\ndistillation sampling, emerging approaches still fall short in delivering\nseparable, precise and consistent outcomes that are vital to content creation.\nIn response, we introduce FocalDreamer, a framework that merges base shape with\neditable parts according to text prompts for fine-grained editing within\ndesired regions. Specifically, equipped with geometry union and dual-path\nrendering, FocalDreamer assembles independent 3D parts into a complete object,\ntailored for convenient instance reuse and part-wise control. We propose\ngeometric focal loss and style consistency regularization, which encourage\nfocal fusion and congruent overall appearance. Furthermore, FocalDreamer\ngenerates high-fidelity geometry and PBR textures which are compatible with\nwidely-used graphics engines. Extensive experiments have highlighted the\nsuperior editing capabilities of FocalDreamer in both quantitative and\nqualitative evaluations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:16:52 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 03:23:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Yuhan",""],["Dou","Yishun",""],["Shi","Yue",""],["Lei","Yu",""],["Chen","Xuanhong",""],["Zhang","Yi",""],["Zhou","Peng",""],["Ni","Bingbing",""]]}
{"id":"2308.10609","submitter":"Hojoon Lee","authors":"Hojoon Lee, Hawon Jeong, Byungkun Lee, Kyungyup Lee, Jaegul Choo","title":"ST-RAP: A Spatio-Temporal Framework for Real Estate Appraisal","comments":"Accepted to CIKM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce ST-RAP, a novel Spatio-Temporal framework for\nReal estate APpraisal. ST-RAP employs a hierarchical architecture with a\nheterogeneous graph neural network to encapsulate temporal dynamics and spatial\nrelationships simultaneously. Through comprehensive experiments on a\nlarge-scale real estate dataset, ST-RAP outperforms previous methods,\ndemonstrating the significant benefits of integrating spatial and temporal\naspects in real estate appraisal. Our code and dataset are available at\nhttps://github.com/dojeon-ai/STRAP.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:18:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lee","Hojoon",""],["Jeong","Hawon",""],["Lee","Byungkun",""],["Lee","Kyungyup",""],["Choo","Jaegul",""]]}
{"id":"2308.10610","submitter":"Yubiao Yue","authors":"Yubiao Yue, Xinyu Zeng, Xiaoqiang Shi, Meiping Zhang, Haihua Liang,\n  Fan Zhang, Yanmei Chen, Zefeng Xie, Wenrui Wu, Zhenzhang Li","title":"Ultrafast and Ultralight Network-Based Intelligent System for Real-time\n  Diagnosis of Ear diseases in Any Devices","comments":"This manuscript has been submitted to Neural Networks","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditional ear disease diagnosis heavily depends on experienced specialists\nand specialized equipment, frequently resulting in misdiagnoses, treatment\ndelays, and financial burdens for some patients. Utilizing deep learning models\nfor efficient ear disease diagnosis has proven effective and affordable.\nHowever, existing research overlooked model inference speed and parameter size\nrequired for deployment. To tackle these challenges, we constructed a\nlarge-scale dataset comprising eight ear disease categories and normal ear\ncanal samples from two hospitals. Inspired by ShuffleNetV2, we developed\nBest-EarNet, an ultrafast and ultralight network enabling real-time ear disease\ndiagnosis. Best-EarNet incorporates the novel Local-Global Spatial Feature\nFusion Module which can capture global and local spatial information\nsimultaneously and guide the network to focus on crucial regions within feature\nmaps at various levels, mitigating low accuracy issues. Moreover, our network\nuses multiple auxiliary classification heads for efficient parameter\noptimization. With 0.77M parameters, Best-EarNet achieves an average frames per\nsecond of 80 on CPU. Employing transfer learning and five-fold cross-validation\nwith 22,581 images from Hospital-1, the model achieves an impressive 95.23%\naccuracy. External testing on 1,652 images from Hospital-2 validates its\nperformance, yielding 92.14% accuracy. Compared to state-of-the-art networks,\nBest-EarNet establishes a new state-of-the-art (SOTA) in practical\napplications. Most importantly, we developed an intelligent diagnosis system\ncalled Ear Keeper, which can be deployed on common electronic devices. By\nmanipulating a compact electronic otoscope, users can perform comprehensive\nscanning and diagnosis of the ear canal using real-time video. This study\nprovides a novel paradigm for ear endoscopy and other medical endoscopic image\nrecognition applications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:20:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yue","Yubiao",""],["Zeng","Xinyu",""],["Shi","Xiaoqiang",""],["Zhang","Meiping",""],["Liang","Haihua",""],["Zhang","Fan",""],["Chen","Yanmei",""],["Xie","Zefeng",""],["Wu","Wenrui",""],["Li","Zhenzhang",""]]}
{"id":"2308.10611","submitter":"Subir Ghosh","authors":"Akshat Pandey and Subir Ghosh","title":"Superconducting Quantum Circuits in the light of Dirac's Constraint\n  Analysis Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we introduce a new framework - Dirac's Hamiltonian formalism of\nconstraint systems - to study different types of Superconducting Quantum\nCircuits (SQC) in a {\\it{unified}} and unambiguous way. The Lagrangian of a SQC\nreveals the constraints, that are classified in a Hamiltonian framework, such\nthat redundant variables can be removed to isolate the canonical degrees of\nfreedom for subsequent quantization of the Dirac Brackets via a generalized\nCorrespondence Principle. This purely algebraic approach makes the application\nof concepts such as graph theory, null vector, loop charge,\\ etc that are in\nvogue, (each for a specific type of circuit), completely redundant.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:22:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pandey","Akshat",""],["Ghosh","Subir",""]]}
{"id":"2308.10612","submitter":"A. C. Khunt","authors":"Sagar V. Soni, A. C. Khunt and A. H. Hasmani","title":"A Study of Morris-Thorne Wormhole in Einstein-Cartan Theory","comments":"20 pages, 3 figures, 1 table. Preparing for submission to the\n  International Journal of Geometric Methods in Modern Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper focuses on the Einstein-Cartan theory, an extension of general\nrelativity that incorporates a torsion tensor into spacetime. The differential\nform technique is employed to analyze the Einstein-Cartan theory, which\nreplaces tensors with tetrads. A tetrad formalism, specifically the\nNewmann-Penrose-Jogia-Griffiths formalism, is used to study the field\nequations. The energy-momentum tensor is also determined, considering a\nWeyssenhoff fluid with anisotropic matter. The spin density is derived in terms\nof the red-shift function. We also examine the energy conditions at the throat\nof a Morris-Thorne wormhole. The results shed light on the properties of\nwormholes in the context of the Einstein-Cartan theory, including the energy\nconditions at the throat.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:22:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Soni","Sagar V.",""],["Khunt","A. C.",""],["Hasmani","A. H.",""]]}
{"id":"2308.10613","submitter":"Weihong Wang","authors":"Jasper Surmont, Weihong Wang, Tom Van Cutsem","title":"Static Application Security Testing of Consensus-Critical Code in the\n  Cosmos Network","comments":"5th Conference on Blockchain Research & Applications for Innovative\n  Networks and Services (BRAINS'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Blockchains require deterministic execution in order to reach consensus. This\nis often guaranteed in languages designed to write smart contracts, such as\nSolidity. Application-specific blockchains or ``appchains'' allow the\nblockchain application logic to be written using general-purpose programming\nlanguages, giving developers more flexibility but also additional\nresponsibilities. In particular, developers must ensure that their blockchain\napplication logic does not contain any sources of non-determinism. Any source\nof non-determinism may be a potential source of vulnerabilities.\n  This paper focuses on the use of Static Application Security Testing (SAST)\ntools to detect such sources of non-determinism at development time. We focus\non Cosmos, a prominent open-source project that lets developers build\ninterconnected networks of application-specific blockchains. Cosmos provides a\nSoftware Development Kit (SDK) that allows these chains to be implemented in\nthe Go programming language. We create a corpus of 11 representative\nCosmos-based appchains to analyze for sources of non-determinism in Go.\n  As part of our study, we identified cosmos-sdk-codeql, a set of CodeQL code\nanalysis rules for Cosmos applications. We find that these rules generate many\nfalse positives and propose a refactored set of rules that more precisely\ndetects sources of non-determinism only in code that runs as part of the\nblockchain logic. We demonstrate a significant increase in the precision of the\nrules, making the SAST tool more effective and hence potentially contributing\nto enhanced security for Cosmos-based blockchains.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:22:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Surmont","Jasper",""],["Wang","Weihong",""],["Van Cutsem","Tom",""]]}
{"id":"2308.10614","submitter":"Sophie Hermann","authors":"Sophie Hermann, Matthias Schmidt","title":"Active crystallization from power functional theory","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the gas, liquid, and crystal phase behaviour of active Brownian\nparticles in three dimensions. The nonequilibrium force balance at coexistence\nleads to equality of state functions for which we use power functional\napproximations. Motility-induced phase separation starts at a critical point\nand quickly becomes metastable against active freezing for P\\'eclet numbers\nabove a nonequilibrium triple point. The mean swim speed acts as a state\nvariable, similar to the density of depletion agents in colloidal demixing. We\nobtain quantitative agreement with recent simulation results and correctly\npredict the strength of particle number fluctuations in active fluids.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:23:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hermann","Sophie",""],["Schmidt","Matthias",""]]}
{"id":"2308.10615","submitter":"Shubham Kanodia","authors":"Shubham Kanodia, Matthias Y. He, Eric B. Ford, Sujit K. Ghosh, and\n  Angie Wolfgang","title":"Beyond 2-D Mass-Radius Relationships: A Nonparametric and Probabilistic\n  Framework for Characterizing Planetary Samples in Higher Dimensions","comments":"Accepted in ApJ. Updated MRExo package and sample scripts available\n  here: https://github.com/shbhuk/mrexo/tree/v1.0dev. Package will be released\n  on PyPI (pip) along with full documentation upon publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fundamental to our understanding of planetary bulk compositions is the\nrelationship between their masses and radii, two properties that are often not\nsimultaneously known for most exoplanets. However, while many previous studies\nhave modeled the two-dimensional relationship between planetary mass and radii,\nthis approach largely ignores the dependencies on other properties that may\nhave influenced the formation and evolution of the planets. In this work, we\nextend the existing nonparametric and probabilistic framework of \\texttt{MRExo}\nto jointly model distributions beyond two dimensions. Our updated framework can\nnow simultaneously model up to four observables, while also incorporating\nasymmetric measurement uncertainties and upper limits in the data. We showcase\nthe potential of this multi-dimensional approach to three science cases: (i) a\n4-dimensional joint fit to planetary mass, radius, insolation, and stellar\nmass, hinting of changes in planetary bulk density across insolation and\nstellar mass; (ii) a 3-dimensional fit to the California Kepler Survey sample\nshowing how the planet radius valley evolves across different stellar masses;\nand (iii) a 2-dimensional fit to a sample of Class-II protoplanetary disks in\nLupus while incorporating the upper-limits in dust mass measurements. In\naddition, we employ bootstrap and Monte-Carlo sampling to quantify the impact\nof the finite sample size as well as measurement uncertainties on the predicted\nquantities. We update our existing open-source user-friendly \\texttt{MRExo}\n\\texttt{Python} package with these changes, which allows users to apply this\nhighly flexible framework to a variety of datasets beyond what we have shown\nhere.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:28:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kanodia","Shubham",""],["He","Matthias Y.",""],["Ford","Eric B.",""],["Ghosh","Sujit K.",""],["Wolfgang","Angie",""]]}
{"id":"2308.10616","submitter":"Andreas Kirchner","authors":"Andreas Kirchner, Eduardo Grossi, Stefan Floerchinger","title":"Cooper-Frye spectra of hadrons with viscous corrections including feed\n  down from resonance decays","comments":"37 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A method to calculate hadron momentum spectra after feed down from resonance\ndecays in the context of ultra-relativistic heavy ion collisions described by\nrelativistic fluid dynamics is presented. The conceptual setup uses the\nCooper-Frye freeze-out integration together with an integral operator\ndescribing resonance decays. We provide explicit expressions for the\nintegration over the freeze-out surface for a smooth and symmetric background\nsolution, as well as for linearized perturbations around it. A major advantage\nof our method is that many integrals can be precomputed independently of a\nconcrete hydrodynamic simulation. Additionally, we examine the influence of\nadding heavier resonances to the decay chain on the spectrum of pions and show\nhow to include a phase with partial chemical equilibrium in order to separate\nthe chemical from the kinetic freeze-out.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:30:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kirchner","Andreas",""],["Grossi","Eduardo",""],["Floerchinger","Stefan",""]]}
{"id":"2308.10617","submitter":"Jerry Jun-Yan Zhang","authors":"Jerry Jun-Yan Zhang, Nicolas Lodieu, Eduardo Mart\\'in","title":"Optical Properties of Metal-poor T Dwarf Candidates","comments":"13 pages, 7 figures, accepted for publication in A&A on 18th Aug 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. Metal-poor brown dwarfs are poorly understood because they are\nextremely faint and rare. Only a few candidates have been identified as T-type\nsubdwarfs in infrared surveys and their optical properties remain\nunconstrained.\n  Aims. We aim to improve the knowledge of the optical properties of T subdwarf\ncandidates to break the degeneracy between metallicity and temperature and to\ninvestigate their atmospheric properties.\n  Methods. Deep $z$-band images of 10 known T subdwarf candidates were\ncollected with the 10.4-m Gran Telescopio Canarias. Low-resolution optical\nspectra for two of them were obtained with the same telescope. Photometric\nmeasurements of the $z$-band flux were performed for all the targets and they\nwere combined with infrared photometry in $J, H, K, W1$ and $W2$-bands from the\nliterature to obtain the colours. The spectra were compared with\nsolar-metallicity T dwarf templates and with laboratory spectra.\n  Results. We found that the targets segregate into three distinct groups in\nthe $W1 - W2$ vs. $z - W1$ colour-colour diagram. Group I objects are mixed\nwith solar-metallicity T dwarfs. Group III objects have $W1 - W2$ colours\nsimilar to T dwarfs but very red $z - W1$ colours. Group II objects lie between\nGroup I and III. The two targets for which we obtained spectra are located in\nGroup I and their spectroscopic properties resemble normal T dwarfs but with\nwater features that are deeper and have a shape akin to pure water.\n  Conclusions. We conclude that the $W1 - W2$ vs. $z - W1$ colour-colour\ndiagram is excellent to break the metallicity-temperature degeneracy for\nobjects cooler than L-type. A revision of the spectral classification of T\nsubdwarf might be needed in the future, according to the photometric and\nspectroscopic properties of WISE1810 and WISE0414 in Group III discussed in\nthis work.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:31:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Jerry Jun-Yan",""],["Lodieu","Nicolas",""],["Mart\u00edn","Eduardo",""]]}
{"id":"2308.10618","submitter":"Johan Medrano","authors":"Johan Medrano, Karl J. Friston, Peter Zeidman","title":"Linking fast and slow: the case for generative models","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A pervasive challenge in neuroscience is testing whether neuronal\nconnectivity changes over time due to specific causes, such as stimuli, events,\nor clinical interventions. Recent hardware innovations and falling data storage\ncosts enable longer, more naturalistic neuronal recordings. The implicit\nopportunity for understanding the self-organised brain calls for new analysis\nmethods that link temporal scales: from the order of milliseconds over which\nneuronal dynamics evolve, to the order of minutes, days or even years over\nwhich experimental observations unfold. This review article demonstrates how\nhierarchical generative models and Bayesian inference help to characterise\nneuronal activity across different time scales. Crucially, these methods go\nbeyond describing statistical associations among observations and enable\ninference about underlying mechanisms. We offer an overview of fundamental\nconcepts in state-space modeling and suggest a taxonomy for these methods.\nAdditionally, we introduce key mathematical principles that underscore a\nseparation of temporal scales, such as the slaving principle, and review\nBayesian methods that are being used to test hypotheses about the brain with\nmulti-scale data. We hope that this review will serve as a useful primer for\nexperimental and computational neuroscientists on the state of the art and\ncurrent directions of travel in the complex systems modelling literature.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:33:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Medrano","Johan",""],["Friston","Karl J.",""],["Zeidman","Peter",""]]}
{"id":"2308.10619","submitter":"Xiaona Sun","authors":"Xiaona Sun and Zhenyu Wu and Yichen Liu and Saier Hu and Zhiqiang Zhan\n  and Yang Ji","title":"centroIDA: Cross-Domain Class Discrepancy Minimization Based on\n  Accumulative Class-Centroids for Imbalanced Domain Adaptation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised Domain Adaptation (UDA) approaches address the covariate shift\nproblem by minimizing the distribution discrepancy between the source and\ntarget domains, assuming that the label distribution is invariant across\ndomains. However, in the imbalanced domain adaptation (IDA) scenario, covariate\nand long-tailed label shifts both exist across domains. To tackle the IDA\nproblem, some current research focus on minimizing the distribution\ndiscrepancies of each corresponding class between source and target domains.\nSuch methods rely much on the reliable pseudo labels' selection and the feature\ndistributions estimation for target domain, and the minority classes with\nlimited numbers makes the estimations more uncertainty, which influences the\nmodel's performance. In this paper, we propose a cross-domain class discrepancy\nminimization method based on accumulative class-centroids for IDA (centroIDA).\nFirstly, class-based re-sampling strategy is used to obtain an unbiased\nclassifier on source domain. Secondly, the accumulative class-centroids\nalignment loss is proposed for iterative class-centroids alignment across\ndomains. Finally, class-wise feature alignment loss is used to optimize the\nfeature representation for a robust classification boundary. A series of\nexperiments have proved that our method outperforms other SOTA methods on IDA\nproblem, especially with the increasing degree of label shift.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:35:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Xiaona",""],["Wu","Zhenyu",""],["Liu","Yichen",""],["Hu","Saier",""],["Zhan","Zhiqiang",""],["Ji","Yang",""]]}
{"id":"2308.10620","submitter":"Yanjie Zhao","authors":"Xinyi Hou, Yanjie Zhao, Yue Liu, Zhou Yang, Kailong Wang, Li Li, Xiapu\n  Luo, David Lo, John Grundy, Haoyu Wang","title":"Large Language Models for Software Engineering: A Systematic Literature\n  Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have significantly impacted numerous domains,\nincluding Software Engineering (SE). Many recent publications have explored\nLLMs applied to various SE tasks and applications. Nevertheless, a\ncomprehensive understanding of the application, effects, and possible\nlimitations of LLMs on SE is still in its early stages. To bridge this gap, we\nconducted a systematic literature review on the intersection of LLMs and SE,\nwith a particular focus on understanding how LLMs can be exploited in SE to\noptimize processes and outcomes. We collect and analyze a total of 229 research\npapers from 2017 to 2023 to answer four key research questions (RQs). In RQ1,\nwe categorize and provide a comparative analysis of different LLMs that have\nbeen employed in SE tasks, characterising their distinctive features and uses.\nIn RQ2, we analyse the methods used in data collection, preprocessing, and\napplication highlighting the role of robust, well-curated datasets for\nsuccessful LLM for SE implementation. RQ3 investigates the strategies employed\nto optimize and evaluate the performance of LLMs in SE, as well as the common\ntechniques related to prompt optimization. Finally, RQ4 examines the specific\nSE tasks where LLMs have shown success to date, illustrating their practical\ncontributions to the field. From the answers to these RQs, we discuss the\ncurrent state-of-the-art and trends, identifying gaps in existing research, and\nflagging promising areas for future study.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:37:49 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 06:07:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hou","Xinyi",""],["Zhao","Yanjie",""],["Liu","Yue",""],["Yang","Zhou",""],["Wang","Kailong",""],["Li","Li",""],["Luo","Xiapu",""],["Lo","David",""],["Grundy","John",""],["Wang","Haoyu",""]]}
{"id":"2308.10621","submitter":"Patrick Ruhkamp","authors":"HyunJun Jung, Patrick Ruhkamp, Nassir Navab, Benjamin Busam","title":"Multi-Modal Dataset Acquisition for Photometrically Challenging Object","comments":"Accepted at ICCV 2023 TRICKY Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the limitations of current datasets for 3D vision tasks\nin terms of accuracy, size, realism, and suitable imaging modalities for\nphotometrically challenging objects. We propose a novel annotation and\nacquisition pipeline that enhances existing 3D perception and 6D object pose\ndatasets. Our approach integrates robotic forward-kinematics, external infrared\ntrackers, and improved calibration and annotation procedures. We present a\nmulti-modal sensor rig, mounted on a robotic end-effector, and demonstrate how\nit is integrated into the creation of highly accurate datasets. Additionally,\nwe introduce a freehand procedure for wider viewpoint coverage. Both approaches\nyield high-quality 3D data with accurate object and camera pose annotations.\nOur methods overcome the limitations of existing datasets and provide valuable\nresources for 3D vision research.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:38:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jung","HyunJun",""],["Ruhkamp","Patrick",""],["Navab","Nassir",""],["Busam","Benjamin",""]]}
{"id":"2308.10622","submitter":"Eyke H\\\"ullermeier","authors":"Sascha Henzgen and Eyke H\\\"ullermeier","title":"Weighting by Tying: A New Approach to Weighted Rank Correlation","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measures of rank correlation are commonly used in statistics to capture the\ndegree of concordance between two orderings of the same set of items. Standard\nmeasures like Kendall's tau and Spearman's rho coefficient put equal emphasis\non each position of a ranking. Yet, motivated by applications in which some of\nthe positions (typically those on the top) are more important than others, a\nfew weighted variants of these measures have been proposed. Most of these\ngeneralizations fail to meet desirable formal properties, however. Besides,\nthey are often quite inflexible in the sense of committing to a fixed weighing\nscheme. In this paper, we propose a weighted rank correlation measure on the\nbasis of fuzzy order relations. Our measure, called scaled gamma, is related to\nGoodman and Kruskal's gamma rank correlation. It is parametrized by a fuzzy\nequivalence relation on the rank positions, which in turn is specified\nconveniently by a so-called scaling function. This approach combines soundness\nwith flexibility: it has a sound formal foundation and allows for weighing rank\npositions in a flexible way.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:40:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Henzgen","Sascha",""],["H\u00fcllermeier","Eyke",""]]}
{"id":"2308.10623","submitter":"Ioan-Adrian Cosma Mr.","authors":"Andy Catruna, Adrian Cosma and Emilian Radoi","title":"GaitPT: Skeletons Are All You Need For Gait Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The analysis of patterns of walking is an important area of research that has\nnumerous applications in security, healthcare, sports and human-computer\ninteraction. Lately, walking patterns have been regarded as a unique\nfingerprinting method for automatic person identification at a distance. In\nthis work, we propose a novel gait recognition architecture called Gait Pyramid\nTransformer (GaitPT) that leverages pose estimation skeletons to capture unique\nwalking patterns, without relying on appearance information. GaitPT adopts a\nhierarchical transformer architecture that effectively extracts both spatial\nand temporal features of movement in an anatomically consistent manner, guided\nby the structure of the human skeleton. Our results show that GaitPT achieves\nstate-of-the-art performance compared to other skeleton-based gait recognition\nworks, in both controlled and in-the-wild scenarios. GaitPT obtains 82.6%\naverage accuracy on CASIA-B, surpassing other works by a margin of 6%.\nMoreover, it obtains 52.16% Rank-1 accuracy on GREW, outperforming both\nskeleton-based and appearance-based approaches.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:47:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Catruna","Andy",""],["Cosma","Adrian",""],["Radoi","Emilian",""]]}
{"id":"2308.10624","submitter":"Aditya Chopra","authors":"Aditya Chopra, Aaron C Bell, William Fawcett, Rodd Talebi, Daniel\n  Angerhausen, At{\\i}l{\\i}m G\\\"une\\c{s} Baydin, Anamaria Berea, Nathalie A.\n  Cabrol, Christopher Kempes, Massimo Mascaro","title":"PyATMOS: A Scalable Grid of Hypothetical Planetary Atmospheres","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cloud computing offers an opportunity to run compute-resource intensive\nclimate models at scale by parallelising model runs such that datasets useful\nto the exoplanet community can be produced efficiently. To better understand\nthe statistical distributions and properties of potentially habitable planetary\natmospheres we implemented a parallelised climate modelling tool to scan a\nrange of hypothetical atmospheres.Starting with a modern day Earth atmosphere,\nwe iteratively and incrementally simulated a range of atmospheres to infer the\nlandscape of the multi-parameter space, such as the abundances of biological\nmediated gases (\\ce{O2}, \\ce{CO2}, \\ce{H2O}, \\ce{CH4}, \\ce{H2}, and \\ce{N2})\nthat would yield `steady state' planetary atmospheres on Earth-like planets\naround solar-type stars. Our current datasets comprises of \\numatmospheres\nsimulated models of exoplanet atmospheres and is available publicly on the NASA\nExoplanet Archive. Our scalable approach of analysing atmospheres could also\nhelp interpret future observations of planetary atmospheres by providing\nestimates of atmospheric gas fluxes and temperatures as a function of altitude.\nSuch data could enable high-throughput first-order assessment of the potential\nhabitability of exoplanetary surfaces and sepcan be a learning dataset for\nmachine learning applications in the atmospheric and exoplanet science domain.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:49:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chopra","Aditya",""],["Bell","Aaron C",""],["Fawcett","William",""],["Talebi","Rodd",""],["Angerhausen","Daniel",""],["Baydin","At\u0131l\u0131m G\u00fcne\u015f",""],["Berea","Anamaria",""],["Cabrol","Nathalie A.",""],["Kempes","Christopher",""],["Mascaro","Massimo",""]]}
{"id":"2308.10625","submitter":"Jens Uwe Neurohr","authors":"Jens U. Neurohr, Friederike Nolle, Thomas Faidt, Samuel Grandthyll,\n  Anton Wittig, Michael A. Klatt, Karin Jacobs and Frank M\\\"uller","title":"Impact of geometry on chemical analysis exemplified for photoelectron\n  spectroscopy of black silicon","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a smooth surface, the chemical composition can be readily evaluated by a\nvariety of spectroscopy techniques; a prominent example is X-ray photoelectron\nspectroscopy (XPS), where the relative proportions of the elements are mainly\ndetermined by the intensity ratio of the element-specific photoelectrons. This\ndeduction, however, is more intricate for a nanorough surface, such as black\nsilicon, since the steep slopes of the geometry mimic local variations of the\nlocal emission angle. Here, we explicitly quantify this effect via an integral\ngeometric analysis, by using so-called Minkowski tensors. Thus, we match the\nchemical information from XPS with topographical information from atomic force\nmicroscopy (AFM). Our method provides reliable estimates of layer thicknesses\nfor nanorough surfaces. For our black silicon samples, we found that the oxide\nlayer thickness is on average comparable to that of a native oxide layer. Our\nstudy highlights the impact of complex geometries at the nanoscale on the\nanalysis of chemical properties with implications for a broad class of\nspectroscopy techniques.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:51:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Neurohr","Jens U.",""],["Nolle","Friederike",""],["Faidt","Thomas",""],["Grandthyll","Samuel",""],["Wittig","Anton",""],["Klatt","Michael A.",""],["Jacobs","Karin",""],["M\u00fcller","Frank",""]]}
{"id":"2308.10626","submitter":"Sheriff Tolulope Ibrahim","authors":"Sheriff Tolulope Ibrahim, Jamin Patel, Tarun Reddy Katapally","title":"Digital citizen science for ethical surveillance of physical activity\n  among youth: mobile ecological momentary assessments vs. retrospective recall","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Physical inactivity is the fourth leading risk factor of mortality globally.\nHence, understanding the physical activity (PA) patterns of youth is essential\nto manage and mitigate non-communicable diseases. As digital citizen science\napproaches utilizing citizen-owned smartphones to ethically obtain PA big data\ncan transform PA surveillance, this study aims to understand the frequency of\nPA reported by youth using smartphone-deployed retrospective validated surveys\ncompared to prospective time-triggered mobile ecological momentary assessments\n(mEMAs). Using a digital citizen science methodology, this study recruited\nyouth citizen scientists (N = 808) in 2018 (August 31- December 31) in\nSaskatchewan, Canada. Youth citizen scientists (age 13 to 21) reported their PA\nusing prospective mEMAs and retrospective surveys over an eight-day period. A\nsignificant difference was found in reporting the frequency of PA\nretrospectively vs. prospectively via mEMAs (p < 0.000). Ethnicity, parental\neducation, and strength training were associated with prospective PA frequency;\nhowever, no associations were significant with retrospective PA frequency. With\naccess to ubiquitous digital devices growing worldwide, and youth having\nparticularly high digital literacy, digital citizen science for the ethical\nsurveillance of PA using mEMAs presents a promising approach for the management\nand prevention of non-communicable diseases among youth.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:53:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ibrahim","Sheriff Tolulope",""],["Patel","Jamin",""],["Katapally","Tarun Reddy",""]]}
{"id":"2308.10627","submitter":"Patrick Ruhkamp","authors":"Patrick Ruhkamp, Daoyi Gao, HyunJun Jung, Nassir Navab, Benjamin Busam","title":"Polarimetric Information for Multi-Modal 6D Pose Estimation of\n  Photometrically Challenging Objects with Limited Data","comments":"Accepted at ICCV 2023 TRICKY Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  6D pose estimation pipelines that rely on RGB-only or RGB-D data show\nlimitations for photometrically challenging objects with e.g. textureless\nsurfaces, reflections or transparency. A supervised learning-based method\nutilising complementary polarisation information as input modality is proposed\nto overcome such limitations. This supervised approach is then extended to a\nself-supervised paradigm by leveraging physical characteristics of polarised\nlight, thus eliminating the need for annotated real data. The methods achieve\nsignificant advancements in pose estimation by leveraging geometric information\nfrom polarised light and incorporating shape priors and invertible physical\nconstraints.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:56:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ruhkamp","Patrick",""],["Gao","Daoyi",""],["Jung","HyunJun",""],["Navab","Nassir",""],["Busam","Benjamin",""]]}
{"id":"2308.10628","submitter":"Gao-Chan Yong","authors":"Gao-Chan Yong","title":"Strangeness production in neutron star matter","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on a dynamics model on particle production, we analyze the production\nand fraction of exotic components in neutron star matter. It is found that\nthere exists a small fraction of strangeness in twice saturation density\nmatter. For five times saturation density matter, the fraction of strange\nbaryons can be as high as 25-50\\%, depending on the equation of state used. The\nneutron-proton asymmetry of dense matter does not significantly impact the\nstrangeness fraction in neutron star matter.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:57:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yong","Gao-Chan",""]]}
{"id":"2308.10629","submitter":"Luis Badesa","authors":"Luis Badesa, Carlos Matamala and Goran Strbac","title":"Who should pay for frequency-containment ancillary services? Providing\n  incentives to shape investment during the energy transition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While the operating cost of electricity grids based on thermal generation was\nlargely driven by the cost of fuel, as renewable penetration increases,\nancillary services represent an increasingly large proportion of the running\ncosts. Electric frequency is an important magnitude in highly renewable grids,\nas it becomes more volatile and therefore the cost related to maintaining it\nwithin safe bounds has significantly increased. So far, costs for\nfrequency-containment ancillary services have been socialised, but it has\nbecome relevant to rethink this regulatory arrangement. In this paper, we\ndiscuss the issue of cost allocation for these services, highlighting the need\nto evolve towards a causation-based regulatory framework. We argue that parties\nresponsible for creating the need for ancillary services should bear these\ncosts. However, this would imply an important change in electricity market\npolicy, therefore it is necessary to understand the impact on current and\nfuture investments on generation, as well as on electricity tariffs. Here we\nprovide a qualitative analysis of this issue, hoping to open up a focused\ndiscussion among academics, regulators and industry.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:02:18 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 19:14:31 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Badesa","Luis",""],["Matamala","Carlos",""],["Strbac","Goran",""]]}
{"id":"2308.10630","submitter":"Qi Deng","authors":"Jiyuan Tan, Chenyu Xue, Chuwen Zhang, Qi Deng, Dongdong Ge, Yinyu Ye","title":"A Homogenization Approach for Gradient-Dominated Stochastic Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gradient dominance property is a condition weaker than strong convexity, yet\nit sufficiently ensures global convergence for first-order methods even in\nnon-convex optimization. This property finds application in various machine\nlearning domains, including matrix decomposition, linear neural networks, and\npolicy-based reinforcement learning (RL). In this paper, we study the\nstochastic homogeneous second-order descent method (SHSODM) for\ngradient-dominated optimization with $\\alpha \\in [1, 2]$ based on a recently\nproposed homogenization approach. Theoretically, we show that SHSODM achieves a\nsample complexity of $O(\\epsilon^{-7/(2 \\alpha) +1})$ for $\\alpha \\in [1, 3/2)$\nand $\\tilde{O}(\\epsilon^{-2/\\alpha})$ for $\\alpha \\in [3/2, 2]$. We further\nprovide a SHSODM with a variance reduction technique enjoying an improved\nsample complexity of $O( \\epsilon ^{-( 7-3\\alpha ) /( 2\\alpha )})$ for $\\alpha\n\\in [1,3/2)$. Our results match the state-of-the-art sample complexity bounds\nfor stochastic gradient-dominated optimization without \\emph{cubic\nregularization}. Since the homogenization approach only relies on solving\nextremal eigenvector problems instead of Newton-type systems, our methods gain\nthe advantage of cheaper iterations and robustness in ill-conditioned problems.\nNumerical experiments on several RL tasks demonstrate the efficiency of SHSODM\ncompared to other off-the-shelf methods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:03:04 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tan","Jiyuan",""],["Xue","Chenyu",""],["Zhang","Chuwen",""],["Deng","Qi",""],["Ge","Dongdong",""],["Ye","Yinyu",""]]}
{"id":"2308.10631","submitter":"Ioan-Adrian Cosma Mr.","authors":"Adrian Cosma, Emilian Radoi","title":"PsyMo: A Dataset for Estimating Self-Reported Psychological Traits from\n  Gait","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Psychological trait estimation from external factors such as movement and\nappearance is a challenging and long-standing problem in psychology, and is\nprincipally based on the psychological theory of embodiment. To date, attempts\nto tackle this problem have utilized private small-scale datasets with\nintrusive body-attached sensors. Potential applications of an automated system\nfor psychological trait estimation include estimation of occupational fatigue\nand psychology, and marketing and advertisement. In this work, we propose PsyMo\n(Psychological traits from Motion), a novel, multi-purpose and multi-modal\ndataset for exploring psychological cues manifested in walking patterns. We\ngathered walking sequences from 312 subjects in 7 different walking variations\nand 6 camera angles. In conjunction with walking sequences, participants filled\nin 6 psychological questionnaires, totalling 17 psychometric attributes related\nto personality, self-esteem, fatigue, aggressiveness and mental health. We\npropose two evaluation protocols for psychological trait estimation. Alongside\nthe estimation of self-reported psychological traits from gait, the dataset can\nbe used as a drop-in replacement to benchmark methods for gait recognition. We\nanonymize all cues related to the identity of the subjects and publicly release\nonly silhouettes, 2D / 3D human skeletons and 3D SMPL human meshes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:06:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cosma","Adrian",""],["Radoi","Emilian",""]]}
{"id":"2308.10632","submitter":"Peiyan Zhang","authors":"Peiyan Zhang, Haoyang Liu, Chaozhuo Li, Xing Xie, Sunghun Kim, Haohan\n  Wang","title":"Foundation Model-oriented Robustness: Robust Image Model Evaluation with\n  Pretrained Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning has demonstrated remarkable performance over finite\ndatasets, yet whether the scores over the fixed benchmarks can sufficiently\nindicate the model's performance in the real world is still in discussion. In\nreality, an ideal robust model will probably behave similarly to the oracle\n(e.g., the human users), thus a good evaluation protocol is probably to\nevaluate the models' behaviors in comparison to the oracle. In this paper, we\nintroduce a new robustness measurement that directly measures the image\nclassification model's performance compared with a surrogate oracle (i.e., a\nfoundation model). Besides, we design a simple method that can accomplish the\nevaluation beyond the scope of the benchmarks. Our method extends the image\ndatasets with new samples that are sufficiently perturbed to be distinct from\nthe ones in the original sets, but are still bounded within the same\nimage-label structure the original test image represents, constrained by a\nfoundation model pretrained with a large amount of samples. As a result, our\nnew method will offer us a new way to evaluate the models' robustness\nperformance, free of limitations of fixed benchmarks or constrained\nperturbations, although scoped by the power of the oracle. In addition to the\nevaluation results, we also leverage our generated data to understand the\nbehaviors of the model and our new evaluation strategies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:07:27 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 06:41:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Peiyan",""],["Liu","Haoyang",""],["Li","Chaozhuo",""],["Xie","Xing",""],["Kim","Sunghun",""],["Wang","Haohan",""]]}
{"id":"2308.10633","submitter":"Yasuto Hoshi","authors":"Yasuto Hoshi, Daisuke Miyashita, Youyang Ng, Kento Tatsuno, Yasuhiro\n  Morioka, Osamu Torii, Jun Deguchi","title":"RaLLe: A Framework for Developing and Evaluating Retrieval-Augmented\n  Large Language Models","comments":"18 pages, 2 figures, see https://youtu.be/JYbm75qnfTg for the\n  demonstration screencast","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Retrieval-augmented large language models (R-LLMs) combine pre-trained large\nlanguage models (LLMs) with information retrieval systems to improve the\naccuracy of factual question-answering. However, current libraries for building\nR-LLMs provide high-level abstractions without sufficient transparency for\nevaluating and optimizing prompts within specific inference processes such as\nretrieval and generation. To address this gap, we present RaLLe, an open-source\nframework designed to facilitate the development, evaluation, and optimization\nof R-LLMs for knowledge-intensive tasks. With RaLLe, developers can easily\ndevelop and evaluate R-LLMs, improving hand-crafted prompts, assessing\nindividual inference processes, and objectively measuring overall system\nperformance quantitatively. By leveraging these features, developers can\nenhance the performance and accuracy of their R-LLMs in knowledge-intensive\ngeneration tasks. We open-source our code at https://github.com/yhoshi3/RaLLe.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:08:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hoshi","Yasuto",""],["Miyashita","Daisuke",""],["Ng","Youyang",""],["Tatsuno","Kento",""],["Morioka","Yasuhiro",""],["Torii","Osamu",""],["Deguchi","Jun",""]]}
{"id":"2308.10634","submitter":"Frank J. Jiang","authors":"August S\\\"oderlund, Frank J. Jiang, Vandana Narri, Amr Alanwar, and\n  Karl H. Johansson","title":"Data-Driven Reachability Analysis of Pedestrians Using Behavior Modes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a data-driven approach for safely predicting the\nfuture state sets of pedestrians. Previous approaches to predicting the future\nstate sets of pedestrians either do not provide safety guarantees or are overly\nconservative. Moreover, an additional challenge is the selection or\nidentification of a model that sufficiently captures the motion of pedestrians.\nTo address these issues, this paper introduces the idea of splitting previously\ncollected, historical pedestrian trajectories into different behavior modes for\nperforming data-driven reachability analysis. Through this proposed approach,\nwe are able to use data-driven reachability analysis to capture the future\nstate sets of pedestrians, while being less conservative and still maintaining\nsafety guarantees. Furthermore, this approach is modular and can support\ndifferent approaches for behavior splitting. To illustrate the efficacy of the\napproach, we implement our method with a basic behavior-splitting module and\nevaluate the implementation on an open-source data set of real pedestrian\ntrajectories. In this evaluation, we find that the modal reachable sets are\nless conservative and more descriptive of the future state sets of the\npedestrian.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:10:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["S\u00f6derlund","August",""],["Jiang","Frank J.",""],["Narri","Vandana",""],["Alanwar","Amr",""],["Johansson","Karl H.",""]]}
{"id":"2308.10635","submitter":"Mathias Sonnleitner","authors":"Mathias Sonnleitner, Christoph Th\\\"ale","title":"A note on critical intersections of classical and Schatten $p$-balls","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The purpose of this note is to study the asymptotic volume of intersections\nof unit balls associated with two norms in $\\mathbb{R}^n$ as their dimension\n$n$ tends to infinity. A general framework is provided and then specialized to\nthe following cases. For classical $\\ell_p^n$-balls the focus lies on the case\n$p=\\infty$, which has previously not been studied in the literature. As far as\nSchatten $p$-balls are considered, we concentrate on the cases $p=2$ and\n$p=\\infty$. In both situations we uncover an unconventional limiting behavior.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:14:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sonnleitner","Mathias",""],["Th\u00e4le","Christoph",""]]}
{"id":"2308.10636","submitter":"Amin Honarmandi Shandiz","authors":"Amin Honarmandi Shandiz and Attila R\\'adics and Rajesh Tamada and Makk\n  \\'Arp\\'ad and Karolina Glowacka and Lehel Ferenczi and Sandeep Dutta and\n  Michael Fanariotis","title":"Automated Identification of Failure Cases in Organ at Risk Segmentation\n  Using Distance Metrics: A Study on CT Data","comments":"11 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automated organ at risk (OAR) segmentation is crucial for radiation therapy\nplanning in CT scans, but the generated contours by automated models can be\ninaccurate, potentially leading to treatment planning issues. The reasons for\nthese inaccuracies could be varied, such as unclear organ boundaries or\ninaccurate ground truth due to annotation errors. To improve the model's\nperformance, it is necessary to identify these failure cases during the\ntraining process and to correct them with some potential post-processing\ntechniques. However, this process can be time-consuming, as traditionally it\nrequires manual inspection of the predicted output. This paper proposes a\nmethod to automatically identify failure cases by setting a threshold for the\ncombination of Dice and Hausdorff distances. This approach reduces the\ntime-consuming task of visually inspecting predicted outputs, allowing for\nfaster identification of failure case candidates. The method was evaluated on\n20 cases of six different organs in CT images from clinical expert curated\ndatasets. By setting the thresholds for the Dice and Hausdorff distances, the\nstudy was able to differentiate between various states of failure cases and\nevaluate over 12 cases visually. This thresholding approach could be extended\nto other organs, leading to faster identification of failure cases and thereby\nimproving the quality of radiation therapy planning.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:14:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shandiz","Amin Honarmandi",""],["R\u00e1dics","Attila",""],["Tamada","Rajesh",""],["\u00c1rp\u00e1d","Makk",""],["Glowacka","Karolina",""],["Ferenczi","Lehel",""],["Dutta","Sandeep",""],["Fanariotis","Michael",""]]}
{"id":"2308.10637","submitter":"Amol Delmade Dr","authors":"Amol Delmade, Frank Slyne, Colm Browning, Daniel Kilper Liam Barry and\n  Marco Ruffini","title":"Metro Access Network with Convergence of Coherent and Analog RoF Data\n  Services","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficient use of spectral resources will be an important aspect of converged\naccess network deployment. This work analyzes the performance of variable\nbandwidth Analog Radio-over-Fiber signals transmitted in the unfilled spectral\nspaces of telecom-grade ROADM channels dedicated for coherent signals\ntransmission over the OpenIreland testbed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:19:17 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Delmade","Amol",""],["Slyne","Frank",""],["Browning","Colm",""],["Barry","Daniel Kilper Liam",""],["Ruffini","Marco",""]]}
{"id":"2308.10638","submitter":"Soubhik Sanyal","authors":"Soubhik Sanyal, Partha Ghosh, Jinlong Yang, Michael J. Black, Justus\n  Thies, Timo Bolkart","title":"SCULPT: Shape-Conditioned Unpaired Learning of Pose-dependent Clothed\n  and Textured Human Meshes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present SCULPT, a novel 3D generative model for clothed and textured 3D\nmeshes of humans. Specifically, we devise a deep neural network that learns to\nrepresent the geometry and appearance distribution of clothed human bodies.\nTraining such a model is challenging, as datasets of textured 3D meshes for\nhumans are limited in size and accessibility. Our key observation is that there\nexist medium-sized 3D scan datasets like CAPE, as well as large-scale 2D image\ndatasets of clothed humans and multiple appearances can be mapped to a single\ngeometry. To effectively learn from the two data modalities, we propose an\nunpaired learning procedure for pose-dependent clothed and textured human\nmeshes. Specifically, we learn a pose-dependent geometry space from 3D scan\ndata. We represent this as per vertex displacements w.r.t. the SMPL model.\nNext, we train a geometry conditioned texture generator in an unsupervised way\nusing the 2D image data. We use intermediate activations of the learned\ngeometry model to condition our texture generator. To alleviate entanglement\nbetween pose and clothing type, and pose and clothing appearance, we condition\nboth the texture and geometry generators with attribute labels such as clothing\ntypes for the geometry, and clothing colors for the texture generator. We\nautomatically generated these conditioning labels for the 2D images based on\nthe visual question answering model BLIP and CLIP. We validate our method on\nthe SCULPT dataset, and compare to state-of-the-art 3D generative models for\nclothed human bodies. We will release the codebase for research purposes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:23:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sanyal","Soubhik",""],["Ghosh","Partha",""],["Yang","Jinlong",""],["Black","Michael J.",""],["Thies","Justus",""],["Bolkart","Timo",""]]}
{"id":"2308.10639","submitter":"Bo Wu","authors":"Bo Wu, Qiang An, Jiawei Yao, Fengchuan Wu, Yunqi Fu","title":"Effect of Rydberg-atom-based sensor performance on different Rydberg\n  atom population at one atomic-vapor cell","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The atomic-vapor cell is a vital component for Rydberg atomic microwave\nsensors, and impacts on overall capability of Rydberg sensor. However, the\nconventional analysis approach on effect of vapor-cell length contains two\nimplicit assumptions, that is, the same atomic population density and buffer\ngas pressure, which make it unable to accurately capture actual response about\neffect of Rydberg-atom-based sensor performance on different Rydberg atom\npopulation. Here, utilizing a stepped cesium atomic-vapor cell with five\ndifferent dimensions at the same atomic population density and buffer gas\npressure, the height and full width at half maximum of Electromagnetically\nInduced Transparency(EIT) signal, and the sensitivity of the atomic\nsuperheterodyne sensor are comprehensively investigated at the same Rabi\nfrequences(saturated laser power) conditions. It is identified that EIT signal\nheight is proportional to the cell length, full width at half maximum and\nsensitivity grow with the increment of cell length to a certain extent. Based\non the coherent integration signal theory and atomic linear expansion\ncoefficient method, theoretical analysis of the EIT height and sensitivity are\nfurther investigated. The results could shed new light on the understanding and\ndesign of ultrahigh-sensitivity Rydberg atomic microwave sensors and find\npromising applications in quantum measurement, communication, and imaging.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:23:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Bo",""],["An","Qiang",""],["Yao","Jiawei",""],["Wu","Fengchuan",""],["Fu","Yunqi",""]]}
{"id":"2308.10640","submitter":"Yongxing Zhu","authors":"Yongxing Zhu","title":"Quantized Vortex Dynamics of the Nonlinear Schr\\\"odinger Equation with\n  Wave Operator on the Torus","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We derive rigorously the reduced dynamical law for quantized vortex dynamics\nof the nonlinear Schr\\\"odinger equation with wave operator on the torus when\nthe core size of vortex $\\varepsilon \\to 0$. It is proved that the reduced\ndynamical law of the nonlinear Schr\\\"odinger equation with wave operator is a\nmixed state of the vortex motion laws for the nonlinear wave equation and the\nnonlinear Schr\\\"odinger equation. We will also investigate the convergence of\nthe reduced dynamical law of the nonlinear Schr\\\"odinger equation with wave\noperator to the vortex motion law of the nonlinear Schr\\\"odinger equation via\nnumerical simulation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:25:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhu","Yongxing",""]]}
{"id":"2308.10641","submitter":"Burak Soner","authors":"Burak Soner and Sinem Coleri","title":"Statistical Analysis of Geometric Algorithms in Vehicular Visible Light\n  Positioning","comments":"Technical report. 7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vehicular visible light positioning (VLP) methods find relative locations of\nvehicles by estimating the positions of intensity-modulated head/tail lights of\none vehicle (target) with respect to another (ego). Estimation is done in two\nsteps: 1) relative bearing or range of the transmitter-receiver link is\nmeasured over the received signal on the ego side, and 2) target position is\nestimated based on those measurements using a geometric algorithm that\nexpresses position coordinates in terms of the bearing-range parameters. The\nprimary source of statistical error for these non-linear algorithms is the\nchannel noise on the received signals that contaminates parameter measurements\nwith varying levels of sensitivity. In this paper, we present two such\ngeometric vehicular VLP algorithms that were previously unexplored, compare\ntheir performance with state-of-the-art algorithms over simulations, and\nanalyze theoretical performance of all algorithms against statistical channel\nnoise by deriving the respective Cramer-Rao lower bounds. The two newly\nexplored algorithms do not outperform existing state-of-the-art, but we present\nthem alongside the statistical analyses for the sake of completeness and to\nmotivate further research in vehicular VLP. Our main finding is that direct\nbearing-based algorithms provide higher accuracy against noise for estimating\nlateral position coordinates, and range-based algorithms provide higher\naccuracy in the longitudinal axis due to the non-linearity of the respective\ngeometric algorithms.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:27:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Soner","Burak",""],["Coleri","Sinem",""]]}
{"id":"2308.10642","submitter":"Yeuk Hay Joshua Lam","authors":"Raju Krishnamoorthy, Yeuk Hay Joshua Lam","title":"Frobenius trace fields of cohomologically rigid local systems","comments":"Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X/\\mathbb{C}$ be a smooth projective variety and let $L$ be an\nirreducible $\\overline{\\mathbb{Q}}_{\\ell}$-local system on $X$ with torsion\ndeterminant. Suppose $L$ is cohomologically rigid. The pair $(X, L)$ may be\nspreaded out to a finitely generated base, and therefore reduced modulo $p$ for\nalmost all $p$; the Frobenius traces of this mod $p$ reduction lie in a number\nfield $F_p$, by a theorem of Deligne. We investigate to what extent $F_p$\ndepends on $p$. We prove that for a positive density of primes $p$, the $F_p$'s\nare contained in a fixed number field. More precisely, we prove that $F_p$ is\nunramified at primes $\\ell$ such that $\\ell\\neq p$ and $\\ell$ large, where the\nlargeness condition is uniform and does not depend on $p$, and also that $F_p$\nis unramified at $p$ assuming a further condition on $p$. We also speculate on\nthe relation between the uniform boundedness of the $F_p$'s, and the local\nsystem $L$ being strongly of geometric origin, a notion due to Langer-Simpson.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:28:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Krishnamoorthy","Raju",""],["Lam","Yeuk Hay Joshua",""]]}
{"id":"2308.10643","submitter":"Zhehui Wang","authors":"Zhehui Wang, Andrew F. T. Leong, Angelo Dragone, Arianna E. Gleason,\n  Rafael Ballabriga, Christopher Campbell, Michael Campbell, Cinzia Da Vi\\`a,\n  Dana M. Dattelbaum, Marcel Demarteau, Lorenzo Fabris, Eric R. Fossum, Sol M.\n  Gruner, Todd Hufnagel, Xiaolu Ju, Ke Li, Xavier Llopart, Bratislav Luki\\'c,\n  Alexander Rack, Joseph Strehlow, Audrey C. Therrien, Julia Thom-Levy,\n  Feixiang Wang, Tiqiao Xiao, Mingwei Xu, Xin Yue","title":"Ultrafast Radiographic Imaging and Tracking: An overview of instruments,\n  methods, data, and applications","comments":"51 pages, 31 figures; Overview of ultrafast radiographic imaging and\n  tracking as a part of ULITIMA 2023 conference, Mar. 13-16,2023, Menlo Park,\n  CA, USA","journal-ref":null,"doi":null,"report-no":"Los Alamos Report number LA-UR-23-29338","categories":"physics.ins-det physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ultrafast radiographic imaging and tracking (U-RadIT) use state-of-the-art\nionizing particle and light sources to experimentally study sub-nanosecond\ndynamic processes in physics, chemistry, biology, geology, materials science\nand other fields. These processes, fundamental to nuclear fusion energy,\nadvanced manufacturing, green transportation and others, often involve one mole\nor more atoms, and thus are challenging to compute by using the first\nprinciples of quantum physics or other forward models. One of the central\nproblems in U-RadIT is to optimize information yield through, e.g.\nhigh-luminosity X-ray and particle sources, efficient imaging and tracking\ndetectors, novel methods to collect data, and large-bandwidth online and\noffline data processing, regulated by the underlying physics, statistics, and\ncomputing power. We review and highlight recent progress in: a.) Detectors; b.)\nU-RadIT modalities; c.) Data and algorithms; and d.) Applications.\nHardware-centric approaches to U-RadIT optimization are constrained by detector\nmaterial properties, low signal-to-noise ratio, high cost and long development\ncycles of critical hardware components such as ASICs. Interpretation of\nexperimental data, including comparisons with forward models, is frequently\nhindered by sparse measurements, model and measurement uncertainties, and\nnoise. Alternatively, U-RadIT make increasing use of data science and machine\nlearning algorithms, including experimental implementations of compressed\nsensing. Machine learning and artificial intelligence approaches, refined by\nphysics and materials information, may also contribute significantly to data\ninterpretation, uncertainty quantification, and U-RadIT optimization.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:29:25 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 17:49:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Zhehui",""],["Leong","Andrew F. T.",""],["Dragone","Angelo",""],["Gleason","Arianna E.",""],["Ballabriga","Rafael",""],["Campbell","Christopher",""],["Campbell","Michael",""],["Da Vi\u00e0","Cinzia",""],["Dattelbaum","Dana M.",""],["Demarteau","Marcel",""],["Fabris","Lorenzo",""],["Fossum","Eric R.",""],["Gruner","Sol M.",""],["Hufnagel","Todd",""],["Ju","Xiaolu",""],["Li","Ke",""],["Llopart","Xavier",""],["Luki\u0107","Bratislav",""],["Rack","Alexander",""],["Strehlow","Joseph",""],["Therrien","Audrey C.",""],["Thom-Levy","Julia",""],["Wang","Feixiang",""],["Xiao","Tiqiao",""],["Xu","Mingwei",""],["Yue","Xin",""]]}
{"id":"2308.10644","submitter":"Alexander Norcliffe MSc MSci BA","authors":"Alexander Norcliffe, Marc Peter Deisenroth","title":"Faster Training of Neural ODEs Using Gau{\\ss}-Legendre Quadrature","comments":"32 pages, 16 figures, 7 tables, published in TMLR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural ODEs demonstrate strong performance in generative and time-series\nmodelling. However, training them via the adjoint method is slow compared to\ndiscrete models due to the requirement of numerically solving ODEs. To speed\nneural ODEs up, a common approach is to regularise the solutions. However, this\napproach may affect the expressivity of the model; when the trajectory itself\nmatters, this is particularly important. In this paper, we propose an\nalternative way to speed up the training of neural ODEs. The key idea is to\nspeed up the adjoint method by using Gau{\\ss}-Legendre quadrature to solve\nintegrals faster than ODE-based methods while remaining memory efficient. We\nalso extend the idea to training SDEs using the Wong-Zakai theorem, by training\na corresponding ODE and transferring the parameters. Our approach leads to\nfaster training of neural ODEs, especially for large models. It also presents a\nnew way to train SDE-based models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:31:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Norcliffe","Alexander",""],["Deisenroth","Marc Peter",""]]}
{"id":"2308.10645","submitter":"Gerald Cooray PhD","authors":"Gerald K. Cooray, Vernon Cooray and Karl Friston","title":"Canonical Cortical Field Theories","comments":"19 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterise the dynamics of neuronal activity, in terms of field theory,\nusing neural units placed on a 2D-lattice modelling the cortical surface. The\nelectrical activity of neuronal units was analysed with the aim of deriving a\nneural field model with a simple functional form that still able to predict or\nreproduce empirical findings. Each neural unit was modelled using a neural mass\nand the accompanying field theory was derived in the continuum limit. The field\ntheory comprised coupled (real) Klein-Gordon fields, where predictions of the\nmodel fall within the range of experimental findings. These predictions\nincluded the frequency spectrum of electric activity measured from the cortex,\nwhich was derived using an equipartition of energy over eigenfunctions of the\nneural fields. Moreover, the neural field model was invariant, within a set of\nparameters, to the dynamical system used to model each neuronal mass.\nSpecifically, topologically equivalent dynamical systems resulted in the same\nneural field model when connected in a lattice; indicating that the fields\nderived could be read as a canonical cortical field theory. We specifically\ninvestigated non-dispersive fields that provide a structure for the coding (or\nrepresentation) of afferent information. Further elaboration of the ensuing\nneural field theory, including the effect of dispersive forces, could be of\nimportance in the understanding of the cortical processing of information.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:34:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cooray","Gerald K.",""],["Cooray","Vernon",""],["Friston","Karl",""]]}
{"id":"2308.10646","submitter":"Bruno Gallas","authors":"Mathieu Nicolas (INSP, LRS), Per Magnus Walmsness (NTNU), Jayeeta\n  Amboli (FRESNEL), Lu Zhang (INSP, LRS), Guillaume Demesy (FRESNEL), Nicolas\n  Bonod (FRESNEL), Souhir Boujday (LRS), Morten Kildemo (NTNU), Bruno Gallas\n  (INSP)","title":"True Circular Dichroism in Optically Active Achiral Metasurfaces and Its\n  Relation to Chiral Near-Fields","comments":"ACS Applied Optical Materials, 2023","journal-ref":null,"doi":"10.1021/acsaom.3c00136","report-no":null,"categories":"physics.app-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optically active achiral metasurfaces offer a promising way to detect chiral\nmolecules based on chiroptic methods. The combination of plasmonic enhanced\ncircular dichroism and reversible optical activity would boost the sensitivity\nand provide enantiomerselective surfaces while using a single sensing site. In\nthis work, we use metasurfaces containing arrays of U-shaped resonators as a\nbenchmark for analyzing the optical activity of achiral materials. Although the\npeculiar optical activity of these metasurfaces has 1 been quite well\ndescribed, we present here an experimental and numerical quantitative\ndetermination of the different contributions to the measured optical activity.\nIn particular, it is shown that linear birefringence and retardance contribute,\nbut only marginally, to the apparent circular dichroism of the metasurface\nassociated with the excitation of magnetoelectric modes. We then numerically\ndemonstrate the peculiar near-field properties of the magneto-electric modes\nand explain how these properties could be reflected in the far-field\npolarimetric properties in the presence of chiral molecules. This work provides\nalternatives for the detection scheme of chiral molecules using plasmonic\nresonators.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:34:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nicolas","Mathieu","","INSP, LRS"],["Walmsness","Per Magnus","","NTNU"],["Amboli","Jayeeta","","FRESNEL"],["Zhang","Lu","","INSP, LRS"],["Demesy","Guillaume","","FRESNEL"],["Bonod","Nicolas","","FRESNEL"],["Boujday","Souhir","","LRS"],["Kildemo","Morten","","NTNU"],["Gallas","Bruno","","INSP"]]}
{"id":"2308.10647","submitter":"Shayekh Islam","authors":"Imam Mohammad Zulkarnain, Shayekh Bin Islam, Md. Zami Al Zunaed\n  Farabe, Md. Mehedi Hasan Shawon, Jawaril Munshad Abedin, Beig Rajibul Hasan,\n  Marsia Haque, Istiak Shihab, Syed Mobassir, MD. Nazmuddoha Ansary, Asif\n  Sushmit, Farig Sadeque","title":"bbOCR: An Open-source Multi-domain OCR Pipeline for Bengali Documents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the existence of numerous Optical Character Recognition (OCR) tools,\nthe lack of comprehensive open-source systems hampers the progress of document\ndigitization in various low-resource languages, including Bengali. Low-resource\nlanguages, especially those with an alphasyllabary writing system, suffer from\nthe lack of large-scale datasets for various document OCR components such as\nword-level OCR, document layout extraction, and distortion correction; which\nare available as individual modules in high-resource languages. In this paper,\nwe introduce Bengali$.$AI-BRACU-OCR (bbOCR): an open-source scalable document\nOCR system that can reconstruct Bengali documents into a structured searchable\ndigitized format that leverages a novel Bengali text recognition model and two\nnovel synthetic datasets. We present extensive component-level and system-level\nevaluation: both use a novel diversified evaluation dataset and comprehensive\nevaluation metrics. Our extensive evaluation suggests that our proposed\nsolution is preferable over the current state-of-the-art Bengali OCR systems.\nThe source codes and datasets are available here:\nhttps://bengaliai.github.io/bbocr.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:35:28 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:32:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zulkarnain","Imam Mohammad",""],["Islam","Shayekh Bin",""],["Farabe","Md. Zami Al Zunaed",""],["Shawon","Md. Mehedi Hasan",""],["Abedin","Jawaril Munshad",""],["Hasan","Beig Rajibul",""],["Haque","Marsia",""],["Shihab","Istiak",""],["Mobassir","Syed",""],["Ansary","MD. Nazmuddoha",""],["Sushmit","Asif",""],["Sadeque","Farig",""]]}
{"id":"2308.10648","submitter":"Dong Xingning","authors":"Yutao Chen, Xingning Dong, Tian Gan, Chunluan Zhou, Ming Yang, and\n  Qingpei Guo","title":"EVE: Efficient zero-shot text-based Video Editing with Depth Map\n  Guidance and Temporal Consistency Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the superior performance of image diffusion models, more and\nmore researchers strive to extend these models to the text-based video editing\ntask. Nevertheless, current video editing tasks mainly suffer from the dilemma\nbetween the high fine-tuning cost and the limited generation capacity. Compared\nwith images, we conjecture that videos necessitate more constraints to preserve\nthe temporal consistency during editing. Towards this end, we propose EVE, a\nrobust and efficient zero-shot video editing method. Under the guidance of\ndepth maps and temporal consistency constraints, EVE derives satisfactory video\nediting results with an affordable computational and time cost. Moreover,\nrecognizing the absence of a publicly available video editing dataset for fair\ncomparisons, we construct a new benchmark ZVE-50 dataset. Through comprehensive\nexperimentation, we validate that EVE could achieve a satisfactory trade-off\nbetween performance and efficiency. We will release our dataset and codebase to\nfacilitate future researchers.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:36:46 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Yutao",""],["Dong","Xingning",""],["Gan","Tian",""],["Zhou","Chunluan",""],["Yang","Ming",""],["Guo","Qingpei",""]]}
{"id":"2308.10649","submitter":"Pawan Kumar","authors":"Sajal Khandelwal, Pawan Kumar, Syed Azeemuddin","title":"Reinforcement Learning Based Sensor Optimization for Bio-markers","comments":"7 pages, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Radio frequency (RF) biosensors, in particular those based on inter-digitated\ncapacitors (IDCs), are pivotal in areas like biomedical diagnosis, remote\nsensing, and wireless communication. Despite their advantages of low cost and\neasy fabrication, their sensitivity can be hindered by design imperfections,\nenvironmental factors, and circuit noise. This paper investigates enhancing the\nsensitivity of IDC-based RF sensors using novel reinforcement learning based\nBinary Particle Swarm Optimization (RLBPSO), and it is compared to Ant Colony\nOptimization (ACO), and other state-of-the-art methods. By focusing on\noptimizing design parameters like electrode design and finger width, the\nproposed study found notable improvements in sensor sensitivity. The proposed\nRLBPSO method shows best optimized design for various frequency ranges when\ncompared to current state-of-the-art methods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:36:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khandelwal","Sajal",""],["Kumar","Pawan",""],["Azeemuddin","Syed",""]]}
{"id":"2308.10650","submitter":"Frederik H\\\"uttel","authors":"Frederik Boe H\\\"uttel, Filipe Rodrigues, Francisco C\\^amara Pereira","title":"Deep Evidential Learning for Bayesian Quantile Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is desirable to have accurate uncertainty estimation from a single\ndeterministic forward-pass model, as traditional methods for uncertainty\nquantification are computationally expensive. However, this is difficult\nbecause single forward-pass models do not sample weights during inference and\noften make assumptions about the target distribution, such as assuming it is\nGaussian. This can be restrictive in regression tasks, where the mean and\nstandard deviation are inadequate to model the target distribution accurately.\nThis paper proposes a deep Bayesian quantile regression model that can estimate\nthe quantiles of a continuous target distribution without the Gaussian\nassumption. The proposed method is based on evidential learning, which allows\nthe model to capture aleatoric and epistemic uncertainty with a single\ndeterministic forward-pass model. This makes the method efficient and scalable\nto large models and datasets. We demonstrate that the proposed method achieves\ncalibrated uncertainties on non-Gaussian distributions, disentanglement of\naleatoric and epistemic uncertainty, and robustness to out-of-distribution\nsamples.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:42:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["H\u00fcttel","Frederik Boe",""],["Rodrigues","Filipe",""],["Pereira","Francisco C\u00e2mara",""]]}
{"id":"2308.10651","submitter":"EPTCS","authors":"Davide Basile (Formal Methods and Tools lab, ISTI-CNR, Pisa, Italy),\n  Maurice H. ter Beek (Formal Methods and Tools lab, ISTI-CNR, Pisa, Italy)","title":"Research Challenges in Orchestration Synthesis","comments":"In Proceedings ICE 2023, arXiv:2308.08920","journal-ref":"EPTCS 383, 2023, pp. 73-90","doi":"10.4204/EPTCS.383.5","report-no":null,"categories":"cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contract automata allow to formally define the behaviour of service contracts\nin terms of service offers and requests, some of which are moreover optional\nand some of which are necessary. A composition of contracts is said to be in\nagreement if all service requests are matched by corresponding offers. Whenever\na composition of contracts is not in agreement, it can be refined to reach an\nagreement using the orchestration synthesis algorithm. This algorithm is a\nvariant of the synthesis algorithm used in supervisory control theory and it is\nbased on the fact that optional transitions are controllable, whereas necessary\ntransitions are at most semi-controllable and cannot always be controlled. In\nfact, the resulting orchestration is such that as much of the behaviour in\nagreement is maintained. In this paper, we discuss recent developments of the\norchestration synthesis algorithm for contract automata. Notably, we present a\nrefined notion of semi-controllability and compare it with the original notion\nby means of examples. We then discuss the current limits of the orchestration\nsynthesis algorithm and identify a number of research challenges together with\na research roadmap.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:46:39 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:54:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Basile","Davide","","Formal Methods and Tools lab, ISTI-CNR, Pisa, Italy"],["ter Beek","Maurice H.","","Formal Methods and Tools lab, ISTI-CNR, Pisa, Italy"]]}
{"id":"2308.10652","submitter":"EPTCS","authors":"Wolfgang Jeltsch (Well-Typed, London, England), Javier D\\'iaz (Atix\n  Labs (a Globant Division), Buenos Aires, Argentina)","title":"Proofs about Network Communication: For Humans and Machines","comments":"In Proceedings ICE 2023, arXiv:2308.08920","journal-ref":"EPTCS 383, 2023, pp. 1-14","doi":"10.4204/EPTCS.383.1","report-no":null,"categories":"cs.LO cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many concurrent and distributed systems are safety-critical and therefore\nhave to provide a high degree of assurance. Important properties of such\nsystems are frequently proved on the specification level, but implementations\ntypically deviate from specifications for practical reasons. Machine-checked\nproofs of bisimilarity statements are often useful for guaranteeing that\nproperties of specifications carry over to implementations. In this paper, we\npresent a way of conducting such proofs with a focus on network communication.\nThe proofs resulting from our approach are not just machine-checked but also\nintelligible for humans.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:47:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jeltsch","Wolfgang","","Well-Typed, London, England"],["D\u00edaz","Javier","","Atix\n  Labs"]]}
{"id":"2308.10653","submitter":"EPTCS","authors":"Franco Barbanera (Dipartimento di Matematica e Informatica,\n  Universit\\`a di Catania, Catania, Italy), Mariangiola Dezani-Ciancaglini\n  (Dipartimento di Informatica, Universit\\`a di Torino, Torino, Italy)","title":"Partially Typed Multiparty Sessions","comments":"In Proceedings ICE 2023, arXiv:2308.08920","journal-ref":"EPTCS 383, 2023, pp. 15-34","doi":"10.4204/EPTCS.383.2","report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A multiparty session formalises a set of concurrent communicating\nparticipants. We propose a type system for multiparty sessions where some\ncommunications between participants can be ignored. This allows us to type some\nsessions with global types representing interesting protocols, which have no\ntype in the standard type systems. Our type system enjoys Subject Reduction,\nSession Fidelity and \"partial\" Lock-freedom. The last property ensures the\nabsence of locks for participants with non ignored communications. A sound and\ncomplete type inference algorithm is also discussed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:47:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Barbanera","Franco","","Dipartimento di Matematica e Informatica,\n  Universit\u00e0 di Catania, Catania, Italy"],["Dezani-Ciancaglini","Mariangiola","","Dipartimento di Informatica, Universit\u00e0 di Torino, Torino, Italy"]]}
{"id":"2308.10654","submitter":"EPTCS","authors":"Seyed Hossein Haeri (IOG, Belgium & University of Bergen, Norway),\n  Peter W. Thompson (PNSol, UK), Peter Van Roy (Universit\\'e catholique de\n  Louvain, Belgium), Magne Haveraaen (University of Bergen, Norway), Neil J.\n  Davies (PNSol, UK), Mikhail Barash (University of Bergen, Norway), Kevin\n  Hammond (IOG, UK), James Chapman (IOG, UK)","title":"Algebraic Reasoning About Timeliness","comments":"In Proceedings ICE 2023, arXiv:2308.08920","journal-ref":"EPTCS 383, 2023, pp. 35-54","doi":"10.4204/EPTCS.383.3","report-no":null,"categories":"cs.PF cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Designing distributed systems to have predictable performance under high load\nis difficult because of resource exhaustion, non-linearity, and stochastic\nbehaviour. Timeliness, i.e., delivering results within defined time bounds, is\na central aspect of predictable performance. In this paper, we focus on\ntimeliness using the DELTA-Q Systems Development paradigm (DELTA-QSD, developed\nby PNSol), which computes timeliness by modelling systems observationally using\nso-called outcome expressions. An outcome expression is a compositional\ndefinition of a system's observed behaviour in terms of its basic operations.\nGiven the behaviour of the basic operations, DELTA-QSD efficiently computes the\nstochastic behaviour of the whole system including its timeliness.\n  This paper formally proves useful algebraic properties of outcome expressions\nw.r.t. timeliness. We prove the different algebraic structures the set of\noutcome expressions form with the different DELTA-QSD operators and demonstrate\nwhy those operators do not form richer structures. We prove or disprove the set\nof all possible distributivity results on outcome expressions. On our way for\ndisproving 8 of those distributivity results, we develop a technique called\nproperisation, which gives rise to the first body of maths for improper random\nvariables. Finally, we also prove 14 equivalences that have been used in the\npast in the practice of DELTA-QSD.\n  An immediate benefit is rewrite rules that can be used for design exploration\nunder established timeliness equivalence. This work is part of an ongoing\nproject to disseminate and build tool support for DELTA-QSD. The ability to\nrewrite outcome expressions is essential for efficient tool support.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:47:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Haeri","Seyed Hossein","","IOG, Belgium & University of Bergen, Norway"],["Thompson","Peter W.","","PNSol, UK"],["Van Roy","Peter","","Universit\u00e9 catholique de\n  Louvain, Belgium"],["Haveraaen","Magne","","University of Bergen, Norway"],["Davies","Neil J.","","PNSol, UK"],["Barash","Mikhail","","University of Bergen, Norway"],["Hammond","Kevin","","IOG, UK"],["Chapman","James","","IOG, UK"]]}
{"id":"2308.10655","submitter":"EPTCS","authors":"Manel Barkallah (Nadi Research Institute Faculty of Computer Science\n  University of Namur Namur, Belgium), Jean-Marie Jacquet (Nadi Research\n  Institute Faculty of Computer Science University of Namur Namur, Belgium)","title":"On the Introduction of Guarded Lists in Bach: Expressiveness,\n  Correctness, and Efficiency Issues","comments":"In Proceedings ICE 2023, arXiv:2308.08920","journal-ref":"EPTCS 383, 2023, pp. 55-72","doi":"10.4204/EPTCS.383.4","report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Concurrency theory has received considerable attention, but mostly in the\nscope of synchronous process algebras such as CCS, CSP, and ACP. As another way\nof handling concurrency, data-based coordination languages aim to provide a\nclear separation between interaction and computation by synchronizing processes\nasynchronously by means of information being available or not on a shared\nspace. Although these languages enjoy interesting properties, verifying program\ncorrectness remains challenging. Some works, such as Anemone, have introduced\nfacilities, including animations and model checking of temporal logic formulae,\nto better grasp system modelling. However, model checking is known to raise\nperformance issues due to the state space explosion problem. In this paper, we\npropose a guarded list construct as a solution to address this problem. We\nestablish that the guarded list construct increases performance while strictly\nenriching the expressiveness of data-based coordination languages. Furthermore,\nwe introduce a notion of refinement to introduce the guarded list construct in\na correctness-preserving manner.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:48:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Barkallah","Manel","","Nadi Research Institute Faculty of Computer Science\n  University of Namur Namur, Belgium"],["Jacquet","Jean-Marie","","Nadi Research\n  Institute Faculty of Computer Science University of Namur Namur, Belgium"]]}
{"id":"2308.10656","submitter":"Shuang Cui","authors":"Shuang Cui, Kai Han, Jing Tang, He Huang, Xueying Li, Aakas Zhiyuli,\n  Hanxiao Li","title":"Practical Parallel Algorithms for Non-Monotone Submodular Maximization","comments":"Part of the contribution appears in AAAI-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Submodular maximization has found extensive applications in various domains\nwithin the field of artificial intelligence, including but not limited to\nmachine learning, computer vision, and natural language processing. With the\nincreasing size of datasets in these domains, there is a pressing need to\ndevelop efficient and parallelizable algorithms for submodular maximization.\nOne measure of the parallelizability of a submodular maximization algorithm is\nits adaptive complexity, which indicates the number of sequential rounds where\na polynomial number of queries to the objective function can be executed in\nparallel. In this paper, we study the problem of non-monotone submodular\nmaximization subject to a knapsack constraint, and propose the first\ncombinatorial algorithm achieving an $(8+\\epsilon)$-approximation under\n$\\mathcal{O}(\\log n)$ adaptive complexity, which is \\textit{optimal} up to a\nfactor of $\\mathcal{O}(\\log\\log n)$. Moreover, we also propose the first\nalgorithm with both provable approximation ratio and sublinear adaptive\ncomplexity for the problem of non-monotone submodular maximization subject to a\n$k$-system constraint. As a by-product, we show that our two algorithms can\nalso be applied to the special case of submodular maximization subject to a\ncardinality constraint, and achieve performance bounds comparable with those of\nstate-of-the-art algorithms. Finally, the effectiveness of our approach is\ndemonstrated by extensive experiments on real-world applications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:48:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cui","Shuang",""],["Han","Kai",""],["Tang","Jing",""],["Huang","He",""],["Li","Xueying",""],["Zhiyuli","Aakas",""],["Li","Hanxiao",""]]}
{"id":"2308.10657","submitter":"Tanmay Inamdar","authors":"Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali\n  Surianarayanan","title":"Parameterized Complexity of Fair Bisection: FPT-Approximation meets\n  Unbreakability","comments":"Full version of ESA 2023 paper. Abstract shortened to meet the\n  character limit","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the Minimum Bisection problem, input is a graph $G$ and the goal is to\npartition the vertex set into two parts $A$ and $B$, such that $||A|-|B|| \\le\n1$ and the number $k$ of edges between $A$ and $B$ is minimized. This problem\ncan be viewed as a clustering problem where edges represent similarity, and the\ntask is to partition the vertices into two equally sized clusters, while\nminimizing the number of pairs of similar objects that end up in different\nclusters. In this paper, we initiate the study of a fair version of Minimum\nBisection. In this problem, the vertices of the graph are colored using one of\n$c \\ge 1$ colors. The goal is to find a bisection $(A, B)$ with at most $k$\nedges between the parts, such that for each color $i\\in [c]$, $A$ has exactly\n$r_i$ vertices of color $i$.\n  We first show that Fair Bisection is $W$[1]-hard parameterized by $c$ even\nwhen $k = 0$. On the other hand, our main technical contribution shows that is\nthat this hardness result is simply a consequence of the very strict\nrequirement that each color class $i$ has {\\em exactly} $r_i$ vertices in $A$.\nIn particular, we give an $f(k,c,\\epsilon)n^{O(1)}$ time algorithm that finds a\nbalanced partition $(A, B)$ with at most $k$ edges between them, such that for\neach color $i\\in [c]$, there are at most $(1\\pm \\epsilon)r_i$ vertices of color\n$i$ in $A$. Our approximation algorithm is best viewed as a proof of concept\nthat the technique introduced by [Lampis, ICALP '18] for obtaining\nFPT-approximation algorithms for problems of bounded tree-width or clique-width\ncan be efficiently exploited even on graphs of unbounded width. The key insight\nis that the technique of Lampis is applicable on tree decompositions with\nunbreakable bags (as introduced in [Cygan et al., SIAM Journal on Computing\n'14]). Along the way, we also derive a combinatorial result regarding tree\ndecompositions of graphs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:49:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Inamdar","Tanmay",""],["Lokshtanov","Daniel",""],["Saurabh","Saket",""],["Surianarayanan","Vaishali",""]]}
{"id":"2308.10658","submitter":"Feng Liu","authors":"Feng Liu, Minchul Kim, ZiAng Gu, Anil Jain, Xiaoming Liu","title":"Learning Clothing and Pose Invariant 3D Shape Representation for\n  Long-Term Person Re-Identification","comments":"10 pages, 7 figures, accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Long-Term Person Re-Identification (LT-ReID) has become increasingly crucial\nin computer vision and biometrics. In this work, we aim to extend LT-ReID\nbeyond pedestrian recognition to include a wider range of real-world human\nactivities while still accounting for cloth-changing scenarios over large time\ngaps. This setting poses additional challenges due to the geometric\nmisalignment and appearance ambiguity caused by the diversity of human pose and\nclothing. To address these challenges, we propose a new approach 3DInvarReID\nfor (i) disentangling identity from non-identity components (pose, clothing\nshape, and texture) of 3D clothed humans, and (ii) reconstructing accurate 3D\nclothed body shapes and learning discriminative features of naked body shapes\nfor person ReID in a joint manner. To better evaluate our study of LT-ReID, we\ncollect a real-world dataset called CCDA, which contains a wide variety of\nhuman activities and clothing changes. Experimentally, we show the superior\nperformance of our approach for person ReID.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:51:46 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:37:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Feng",""],["Kim","Minchul",""],["Gu","ZiAng",""],["Jain","Anil",""],["Liu","Xiaoming",""]]}
{"id":"2308.10659","submitter":"Alpin Novianus Tatan","authors":"Alpin N. Tatan, Jun Haruyama, and Osamu Sugino","title":"Magnetic phases of electron-doped, infinite-layer\n  Sr$_{1-x}$La$_x$CuO$_2$ from first-principles density functional calculations","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The magnetic phases of electron-doped, infinite-layer\n$\\mathrm{Sr}_{1-x}\\mathrm{La}_{x}\\mathrm{CuO}_2$ are elucidated by\nfirst-principles density functional calculations. We describe the\nantiferromagnetic parent state, metallic phase transition, lattice structure\nand magnetic anisotropy evolution upon doping, as well as pressure-induced\nchanges to the density of states at Fermi level that are consistent with\nexperiments where comparison is possible. We investigate low-energy states with\nmultiple magnetic configurations and study their specific heat coefficients and\nmagnetic exchange coupling, as well as the density of states at Fermi level.\nThe latter quantity is used to study the effects of spin fluctuations on the\nelectronic structure of this strongly correlated material.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:52:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tatan","Alpin N.",""],["Haruyama","Jun",""],["Sugino","Osamu",""]]}
{"id":"2308.10660","submitter":"Emmanouil Raptakis","authors":"Sergei M. Kuzenko and Emmanouil S. N. Raptakis","title":"Self-duality for $\\cal N$-extended superconformal gauge multiplets","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a general formalism of duality rotations for $\\cal N$-extended\nsuperconformal gauge multiplets in conformally flat backgrounds as an extension\nof the approach given in arXiv:2107.02001. Additionally, we construct\n$\\mathsf{U}(1)$ duality-invariant models for the ${\\mathcal N}=2$\nsuperconformal gravitino multiplet recently described in arXiv:2305.16029. Each\nof them is automatically self-dual with respect to a superfield Legendre\ntransformation. A method is proposed to generate such self-dual models,\nincluding a family of superconformal theories.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:55:24 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 16:06:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kuzenko","Sergei M.",""],["Raptakis","Emmanouil S. N.",""]]}
{"id":"2308.10661","submitter":"Rikio Ichishima","authors":"Rikio Ichishima, Francesc A. Muntaner-Batle","title":"On the super edge-magicness of graphs with a specific degree sequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A graph $G$ is said to be super edge-magic if there exists a bijective\nfunction $f:V\\left(G\\right) \\cup E\\left(G\\right)\\rightarrow \\left\\{1, 2, \\ldots\n, \\left\\vert V\\left( G\\right) \\right\\vert +\\left\\vert E\\left( G\\right)\n\\right\\vert \\right\\}$ such that $f\\left(V \\left(G\\right)\\right) =\\left\\{1, 2,\n\\ldots , \\left\\vert V\\left( G\\right) \\right\\vert \\right\\}$ and $f\\left(u\\right)\n+ f\\left(v\\right) + f\\left(uv\\right)$ is a constant for each $uv\\in E\\left(\nG\\right) $. In this paper, we study the super edge-magicness of graphs of order\n$n$ with degree sequence $s:4, 2, 2, \\ldots, 2$. We also investigate the super\nedge-magic properties of certain families of graphs. This leads us to propose\nsome open problems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:55:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ichishima","Rikio",""],["Muntaner-Batle","Francesc A.",""]]}
{"id":"2308.10662","submitter":"Siew-Wan Ohl","authors":"Siew-Wan Ohl, Juan Manuel Rossello, Daniel Fuster, and Claus-Dieter\n  Ohl","title":"Finite amplitude wave propagation through bubbly fluids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The existence of only a few bubbles could drastically reduce the acoustic\nwave speed in a liquid. Wood's equation models the linear sound speed, while\nthe speed of an ideal shock waves is derived as a function of the pressure\nratio across the shock. The common finite amplitude waves lie, however, in\nbetween these limits. We show that in a bubbly medium, the high frequency\ncomponents of finite amplitude waves are attenuated and dissipate quickly, but\na low frequency part remains. This wave is then transmitted by the collapse of\nthe bubbles and its speed decreases with increasing void fraction. We\ndemonstrate that the linear and the shock wave regimes can be smoothly\nconnected through a Mach number based on the collapse velocity of the bubbles.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:57:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ohl","Siew-Wan",""],["Rossello","Juan Manuel",""],["Fuster","Daniel",""],["Ohl","Claus-Dieter",""]]}
{"id":"2308.10663","submitter":"Andrea Severing","authors":"Denise S. Christovam, Miguel Ferreira-Carvalho, Andrea Marino, Martin\n  Sundermann, Daisuke Takegami, Anna Melendez-Sans, Ku Ding Tsuei, Zhiwei Hu,\n  Sahana Roessler, Manuel Valvidares, Maurits W. Haverkort, Yu Liu, Eric D.\n  Bauer, Liu Hao Tjeng, Gertrud Zwicknagl, Andrea Severing","title":"Spectroscopic evidence of Kondo-induced quasi-quartet in CeRh$_2$As$_2$","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CeRh$_2$As$_2$ is a new multiphase superconductor with strong suggestions for\nan additional itinerant multipolar ordered phase. The modeling of the low\ntemperature properties of this heavy fermion compound requires a quartet\nCe$^{3+}$ crystal-field ground state. Here we provide the evidence for the\nformation of such a quartet state using x-ray spectroscopy. Core-level\nphotoelectron and x-ray absorption spectroscopy confirm the presence of Kondo\nhybridization in CeRh$_2$As$_2$. The temperature dependence of the linear\ndichroism unambiguously reveils the impact of Kondo physics for coupling the\nKramer's doublets into an effective quasi-quartet. Non-resonant inelastic x-ray\nscattering data find that the $|\\Gamma_7^- \\rangle$ state with its lobes along\nthe 110 direction of the tetragonal structure ($xy$ orientation) contributes\nmost to the multi-orbital ground state of CeRh$_2$As$_2$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:57:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Christovam","Denise S.",""],["Ferreira-Carvalho","Miguel",""],["Marino","Andrea",""],["Sundermann","Martin",""],["Takegami","Daisuke",""],["Melendez-Sans","Anna",""],["Tsuei","Ku Ding",""],["Hu","Zhiwei",""],["Roessler","Sahana",""],["Valvidares","Manuel",""],["Haverkort","Maurits W.",""],["Liu","Yu",""],["Bauer","Eric D.",""],["Tjeng","Liu Hao",""],["Zwicknagl","Gertrud",""],["Severing","Andrea",""]]}
{"id":"2308.10664","submitter":"Nikolaos Koursioumpas","authors":"Nikolaos Koursioumpas, Lina Magoula, Nikolaos Petropouleas,\n  Alexandros-Ioannis Thanopoulos, Theodora Panagea, Nancy Alonistioti, M. A.\n  Gutierrez-Estevez, Ramin Khalili","title":"A Safe Deep Reinforcement Learning Approach for Energy Efficient\n  Federated Learning in Wireless Communication Networks","comments":"27 Pages Single Column, 6 Figures, Submitted for possible publication\n  in the IEEE Transactions on Green Communications and Networking (TGCN). arXiv\n  admin note: text overlap with arXiv:2306.14237","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Progressing towards a new era of Artificial Intelligence (AI) - enabled\nwireless networks, concerns regarding the environmental impact of AI have been\nraised both in industry and academia. Federated Learning (FL) has emerged as a\nkey privacy preserving decentralized AI technique. Despite efforts currently\nbeing made in FL, its environmental impact is still an open problem. Targeting\nthe minimization of the overall energy consumption of an FL process, we propose\nthe orchestration of computational and communication resources of the involved\ndevices to minimize the total energy required, while guaranteeing a certain\nperformance of the model. To this end, we propose a Soft Actor Critic Deep\nReinforcement Learning (DRL) solution, where a penalty function is introduced\nduring training, penalizing the strategies that violate the constraints of the\nenvironment, and ensuring a safe RL process. A device level synchronization\nmethod, along with a computationally cost effective FL environment are\nproposed, with the goal of further reducing the energy consumption and\ncommunication overhead. Evaluation results show the effectiveness of the\nproposed scheme compared to four state-of-the-art baseline solutions in both\nstatic and dynamic environments, achieving a decrease of up to 94% in the total\nenergy consumption.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:02:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Koursioumpas","Nikolaos",""],["Magoula","Lina",""],["Petropouleas","Nikolaos",""],["Thanopoulos","Alexandros-Ioannis",""],["Panagea","Theodora",""],["Alonistioti","Nancy",""],["Gutierrez-Estevez","M. A.",""],["Khalili","Ramin",""]]}
{"id":"2308.10665","submitter":"Souvik Pal","authors":"Souvik Pal","title":"Quasi-finite modules over extended affine Lie algebras","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider irreducible quasi-finite (or equivalently weakly\nintegrable) modules, with non-trivial action of the core, over the extended\naffine Lie algebras (EALAs) whose centerless cores are multiloop algebras. The\ncenterless cores of all but one family of EALAs having nullity greater than 1\nare known to admit such multiloop realizations. For any such (untwisted) EALA,\nwe show that the irreducible quasi-finite modules are either integrable with\nthe center of the underlying core acting trivially, or restricted generalized\nhighest weight (GHW) modules. We further prove that in the nullity 2 case,\nthese irreducible restricted GHW modules turn out to be highest weight type\nmodules, thereby classifying the irreducible quasi-finite modules over all such\nEALAs. In particular, we obtain the classification of irreducible quasi-finite\nmodules over toroidal Lie algebras, minimal EALAs and toroidal EALAs of nullity\n2. Along the way, we completely classify the irreducible weakly integrable\nmodules over affine Kac-Moody algebras (studied by Rao-Futorny [Trans. Amer.\nMath. Soc. 2009] for non-zero level modules). Our results generalize the\nwell-known work of Chari [Invent. Math. 1986] and Chari-Pressley [Math. Ann.\n1986] concerning the classification of irreducible integrable modules over\n(nullity 1) affine Kac--Moody algebras.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:03:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pal","Souvik",""]]}
{"id":"2308.10666","submitter":"Arnaud de Mesmay","authors":"Niloufar Fuladi and Alfredo Hubard and Arnaud de Mesmay","title":"Degenerate crossing number and signed reversal distance","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The degenerate crossing number of a graph is the minimum number of transverse\ncrossings among all its drawings, where edges are represented as simple arcs\nand multiple edges passing through the same point are counted as a single\ncrossing. Interpreting each crossing as a cross-cap induces an embedding into a\nnon-orientable surface. In 2007, Mohar showed that the degenerate crossing\nnumber of a graph is at most its non-orientable genus and he conjectured that\nthese quantities are equal for every graph. He also made the stronger\nconjecture that this also holds for any loopless pseudotriangulation with a\nfixed embedding scheme.\n  In this paper, we prove a structure theorem that almost completely classifies\nthe loopless 2-vertex embedding schemes for which the degenerate crossing\nnumber equals the non-orientable genus. In particular, we provide a\ncounterexample to Mohar's stronger conjecture, but show that in the vast\nmajority of the 2-vertex cases, the conjecture does hold.\n  The reversal distance between two signed permutations is the minimum number\nof reversals that transform one permutation to the other one. If we represent\nthe trajectory of each element of a signed permutation under successive\nreversals by a simple arc, we obtain a drawing of a 2-vertex embedding scheme\nwith degenerate crossings. Our main result is proved by leveraging this\nconnection and a classical result in genome rearrangement (the\nHannenhali-Pevzner algorithm) and can also be understood as an extension of\nthis algorithm when the reversals do not necessarily happen in a monotone\norder.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:03:20 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 10:19:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fuladi","Niloufar",""],["Hubard","Alfredo",""],["de Mesmay","Arnaud",""]]}
{"id":"2308.10667","submitter":"Souvik Agasti Dr.","authors":"Souvik Agasti","title":"Simulation of Kerr Nonlinearity: Revealing Initial State Dependency","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We simulate coherent driven free dissipative Kerr nonlinear system\nnumerically using time evolving block decimation (TEBD) algorithm and time\npropagation on the Heisenberg equation of motion using Eulers method to study\nhow the numerical results are analogous to classical bistability. The system\nevolves through different trajectories to stabilize different branches for\ndifferent external drives and initial conditions. The Wigner state reprentation\nconfirms the system to suffer a residual effect of initial state throughout the\nnon-classical dynamical evolution and the steady state of the system.\nFurthermore, we also see the numerically simulated spectral density remains\nsignificantly different from analytical counterparts when initial states do not\nlie to the same branch of the final state.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:04:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Agasti","Souvik",""]]}
{"id":"2308.10668","submitter":"Mehdi Haghshenas","authors":"Mehdi Haghshenas, Parisa Ramezani, Maurizio Magarini, Emil Bj\\\"ornson","title":"Parametric Channel Estimation with Short Pilots in RIS-Assisted Near-\n  and Far-Field Communications","comments":"Submitted to IEEE Transaction for possible publication","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A reconfigurable intelligent surface (RIS) can control the wireless\npropagation environment by modifying the reflected signals. This feature\nrequires channel state information (CSI). Considering the dimensionality of\ntypical RIS, CSI acquisition requires lengthy pilot transmissions. Hence,\ndeveloping channel estimation techniques with low pilot overhead is vital.\nMoreover, the large aperture of the RIS may cause transmitters/receivers to\nfall in its near-field region, where both distance and angles affect the\nchannel structure. This paper proposes a parametric maximum likelihood\nestimation (MLE) framework for jointly estimating the direct channel between\nthe user and the base station and the line-of-sight channel between the user\nand the RIS. A novel adaptive RIS configuration strategy is proposed to select\nthe RIS configuration for the next pilot to actively refine the estimate. We\ndesign a minimal-sized codebook of orthogonal RIS configurations to choose from\nduring pilot transmission with a dimension much smaller than the number of RIS\nelements. To further reduce the required number of pilots, we propose an\ninitialization strategy with two wide beams. We demonstrate numerically that\nthe proposed MLE framework only needs 6-8 pilots when conventional\nnon-parametric estimators need 1025 pilots. We also showcase efficient user\nchannel tracking in near-field and far-field scenarios.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:06:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Haghshenas","Mehdi",""],["Ramezani","Parisa",""],["Magarini","Maurizio",""],["Bj\u00f6rnson","Emil",""]]}
{"id":"2308.10669","submitter":"Henry Legg","authors":"Henry F. Legg, Richard Hess, Daniel Loss, Jelena Klinovaja","title":"Reply to Antipov et al., Microsoft Quantum: \"Comment on Hess et al.\n  Phys. Rev. Lett. 130, 207001 (2023)\"","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this Reply we respond to the comment by Antipov et al. from Microsoft\nQuantum on Hess et al., PRL 130, 207001 (2023). Antipov et al. reported only a\nsingle simulation and claimed it did not pass the Microsoft Quantum topological\ngap protocol (TGP). They have provided no parameters or data for this\nsimulation (despite request). Regardless, in this reply we demonstrate that the\ntrivial bulk gap reopening mechanism outlined in Hess et al., in combination\nwith trivial ZBPs, passes the TGP and therefore can result in TGP false\npositives.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:07:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Legg","Henry F.",""],["Hess","Richard",""],["Loss","Daniel",""],["Klinovaja","Jelena",""]]}
{"id":"2308.10670","submitter":"Andrey Nesterov","authors":"Andrey Nesterov","title":"Asymptotics of solving a singularly perturbed system of transport\n  equations with fast and slow components in the critical case","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  An asymptotic expansion with respect to a small parameter of the solution of\nthe Cauchy problem is constructed for a system of three transfer equations, two\nof which are singularly perturbed by the degeneracy of the entire senior part\nof the transfer operator, and the third equation clearly does not contain a\nsmall parameter. The peculiarity of the problem is that it belongs to the\nso-called critical case: the solution of a degenerate problem is a\none-parameter family. The asymptotic expansion of the solution under smooth\ninitial conditions is constructed as the sum of the regular part and boundary\nfunctions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:08:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nesterov","Andrey",""]]}
{"id":"2308.10671","submitter":"Conrad Sanderson","authors":"Juan Sandino, Peter A. Caccetta, Conrad Sanderson, Frederic Maire,\n  Felipe Gonzalez","title":"Reducing Object Detection Uncertainty from RGB and Thermal Data for UAV\n  Outdoor Surveillance","comments":null,"journal-ref":"IEEE Aerospace Conference, 2022","doi":"10.1109/AERO53065.2022.9843611","report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in Unmanned Aerial Vehicles (UAVs) have resulted in their\nquick adoption for wide a range of civilian applications, including precision\nagriculture, biosecurity, disaster monitoring and surveillance. UAVs offer\nlow-cost platforms with flexible hardware configurations, as well as an\nincreasing number of autonomous capabilities, including take-off, landing,\nobject tracking and obstacle avoidance. However, little attention has been paid\nto how UAVs deal with object detection uncertainties caused by false readings\nfrom vision-based detectors, data noise, vibrations, and occlusion. In most\nsituations, the relevance and understanding of these detections are delegated\nto human operators, as many UAVs have limited cognition power to interact\nautonomously with the environment. This paper presents a framework for\nautonomous navigation under uncertainty in outdoor scenarios for small UAVs\nusing a probabilistic-based motion planner. The framework is evaluated with\nreal flight tests using a sub 2 kg quadrotor UAV and illustrated in victim\nfinding Search and Rescue (SAR) case study in a forest/bushland. The navigation\nproblem is modelled using a Partially Observable Markov Decision Process\n(POMDP), and solved in real time onboard the small UAV using Augmented Belief\nTrees (ABT) and the TAPIR toolkit. Results from experiments using colour and\nthermal imagery show that the proposed motion planner provides accurate victim\nlocalisation coordinates, as the UAV has the flexibility to interact with the\nenvironment and obtain clearer visualisations of any potential victims compared\nto the baseline motion planner. Incorporating this system allows optimised UAV\nsurveillance operations by diminishing false positive readings from\nvision-based object detectors.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:13:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sandino","Juan",""],["Caccetta","Peter A.",""],["Sanderson","Conrad",""],["Maire","Frederic",""],["Gonzalez","Felipe",""]]}
{"id":"2308.10672","submitter":"Pavel Maksimov","authors":"Pavel A. Maksimov","title":"Proximity-induced sequence of field transitions in Kitaev candidate\n  BaCo$_2$(AsO$_4$)$_2$","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study field-induced phase transitions of the minimal exchange model\nproposed earlier for BaCo$_2$(AsO$_4$)$_2$, a candidate for Kitaev honeycomb\nmodel, using numerical minimization of classical spin clusters. We show that\nexperimentally observed sequence of step-like transitions in magnetic field is\nrealized in the phase diagram of the minimal model. Surprisingly, intermediate\nup-up-down plateau phase is stabilized only in the proximity of a\ndouble-zigzag$-$zigzag phase boundary. We systematically map out the region of\nstability of experimentally observed cascade of transitions and argue that\nBaCo$_2$(AsO$_4$)$_2$ exchange parameters are close to a region of strong phase\ncompetition, which can explain suppressed saturation field.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:14:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maksimov","Pavel A.",""]]}
{"id":"2308.10673","submitter":"Zhiqiang Yu","authors":"Zhiqiang Yu","title":"On the realization of a class of\n  $\\text{SL}(2,\\mathbb{Z})$-representations","comments":"20pages; comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.CT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Let $p<q$ be odd primes, $\\rho_1$ and $\\rho_2$ be irreducible representations\nof $\\text{SL}(2,\\mathbb{Z}_p)$ and $\\text{SL}(2,\\mathbb{Z}_q)$ of dimensions\n$\\frac{p+1}{2}$ and $\\frac{q+1}{2}$, respectively. We show that if\n$\\rho_1\\oplus\\rho_2$ can be realized as modular representation associated to a\nmodular fusion category $\\mathcal{C}$, then $q-p=4$. Moreover, if $\\mathcal{C}$\ncontains a non-trivial \\'{e}tale algebra, then\n$\\mathcal{C}\\boxtimes\\mathcal{C}(\\mathbb{Z}_p,\\eta)\\cong\\mathcal{Z}(\\mathcal{A})$\nas braided fusion category, where $\\mathcal{A}$ is a near-group fusion category\nof type $(\\mathbb{Z}_p,p)$. And we show that there exists a non-trivial\n$\\mathbb{Z}_2$-extension of $\\mathcal{A}$ that contains simple objects of\nFrobenius-Perron dimension $\\frac{\\sqrt{p}+\\sqrt{q}}{2}$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:15:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yu","Zhiqiang",""]]}
{"id":"2308.10674","submitter":"Dieter Weber","authors":"Dieter Weber, Simeon Ehrig, Andreas Schropp, Alexander Clausen, Silvio\n  Achilles, Nico Hoffmann, Michael Bussmann, Rafal Dunin-Borkowski, Christian\n  G. Schroer","title":"Live Iterative Ptychography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.data-an physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate live-updating ptychographic reconstruction with ePIE, an\niterative ptychography method, during ongoing data acquisition. The\nreconstruction starts with a small subset of the total data, and as the\nacquisition proceeds the data used for reconstruction is extended. This creates\na live-updating view of object and illumination that allows monitoring the\nongoing experiment and adjusting parameters with quick turn-around. This is\nparticularly advantageous for long-running acquisitions. We show that such a\ngradual reconstruction yields interpretable results already with a small subset\nof the data. We show simulated live processing with various scan patterns,\nparallelized reconstruction, and real-world live processing at the hard X-ray\nptychographic nanoanalytical microscope PtyNAMi at the PETRA III beamline.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:17:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Weber","Dieter",""],["Ehrig","Simeon",""],["Schropp","Andreas",""],["Clausen","Alexander",""],["Achilles","Silvio",""],["Hoffmann","Nico",""],["Bussmann","Michael",""],["Dunin-Borkowski","Rafal",""],["Schroer","Christian G.",""]]}
{"id":"2308.10675","submitter":"Saeed Masoudian","authors":"Saeed Masoudian, Julian Zimmert, Yevgeny Seldin","title":"An Improved Best-of-both-worlds Algorithm for Bandits with Delayed\n  Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a new best-of-both-worlds algorithm for bandits with variably\ndelayed feedback. The algorithm improves on prior work by Masoudian et al.\n[2022] by eliminating the need in prior knowledge of the maximal delay\n$d_{\\mathrm{max}}$ and providing tighter regret bounds in both regimes. The\nalgorithm and its regret bounds are based on counts of outstanding observations\n(a quantity that is observed at action time) rather than delays or the maximal\ndelay (quantities that are only observed when feedback arrives). One major\ncontribution is a novel control of distribution drift, which is based on biased\nloss estimators and skipping of observations with excessively large delays.\nAnother major contribution is demonstrating that the complexity of\nbest-of-both-worlds bandits with delayed feedback is characterized by the\ncumulative count of outstanding observations after skipping of observations\nwith excessively large delays, rather than the delays or the maximal delay.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:17:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Masoudian","Saeed",""],["Zimmert","Julian",""],["Seldin","Yevgeny",""]]}
{"id":"2308.10676","submitter":"Martin Feinberg","authors":"Martin Feinberg and Richard B. Lavine","title":"Entropy and Thermodynamic Temperature in Nonequilibrium Classical\n  Thermodynamics as Immediate Consequences of the Hahn-Banach Theorem: II.\n  Properties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.FA math.MP physics.class-ph q-bio.MN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a companion article it was shown in a certain precise sense that, for any\nthermodynamical theory that respects the Kelvin-Planck Second Law, the\nHahn-Banach Theorem immediately ensures the existence of a pair of continuous\nfunctions of the local material state -- a specific entropy (entropy per mass)\nand a thermodynamic temperature -- that together satisfy the Clausius-Duhem\ninequality for every process. There was no requirement that the local states\nconsidered be states of equilibrium. This article addresses questions about\nproperties of the entropy and thermodynamic temperature functions so obtained:\nTo what extent do such temperature functions provide a faithful reflection of\n``hotness\"? In precisely which Kelvin-Planck theories is such a temperature\nfunction essentially unique, and, among those theories, for which is the\nentropy function also essentially unique? What is a thermometer for a\nKelvin-Planck theory, and, for the theory, what properties does the existence\nof a thermometer confer? In all of these questions, the Hahn-Banach Theorem\nagain plays a crucial role.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:20:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Feinberg","Martin",""],["Lavine","Richard B.",""]]}
{"id":"2308.10677","submitter":"Muhammad Asif Khan","authors":"Muhammad Asif Khan, Hamid Menouar, Ridha Hamila","title":"Visual Crowd Analysis: Open Research Problems","comments":"Accepted in AI Magazine published by Wiley Periodicals LLC on behalf\n  of the Association for the Advancement of Artificial Intelligence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the last decade, there has been a remarkable surge in interest in\nautomated crowd monitoring within the computer vision community. Modern\ndeep-learning approaches have made it possible to develop fully-automated\nvision-based crowd-monitoring applications. However, despite the magnitude of\nthe issue at hand, the significant technological advancements, and the\nconsistent interest of the research community, there are still numerous\nchallenges that need to be overcome. In this article, we delve into six major\nareas of visual crowd analysis, emphasizing the key developments in each of\nthese areas. We outline the crucial unresolved issues that must be tackled in\nfuture works, in order to ensure that the field of automated crowd monitoring\ncontinues to progress and thrive. Several surveys related to this topic have\nbeen conducted in the past. Nonetheless, this article thoroughly examines and\npresents a more intuitive categorization of works, while also depicting the\nlatest breakthroughs within the field, incorporating more recent studies\ncarried out within the last few years in a concise manner. By carefully\nchoosing prominent works with significant contributions in terms of novelty or\nperformance gains, this paper presents a more comprehensive exposition of\nadvancements in the current state-of-the-art.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:24:20 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 07:18:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Khan","Muhammad Asif",""],["Menouar","Hamid",""],["Hamila","Ridha",""]]}
{"id":"2308.10678","submitter":"Teresa Karolin Bister","authors":"Teresa Bister and Glennys Farrar","title":"Anisotropies, large and small","comments":"PoS ICRC2023 459 - part of the proceedings of the 38th International\n  Cosmic Ray Conference (ICRC) in Nagoya, Japan","journal-ref":null,"doi":"10.22323/1.444.0459","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We report on several new results using anisotropies of UHECRs. We improve and\nextend the work of Ding, Globus and Farrar, who modeled the UHECR dipole\nassuming sources follow the dark matter distribution, accounting for\ndeflections in the Galactic and extragalactic magnetic fields but using a\nsimplified treatment of interactions during propagation. The work presented\nhere employs an accurate and self-consistent treatment of the evolution of\ncomposition during propagation, allows for and explores the impact of \"bias\" in\nthe relation between UHECR sources and the dark matter distribution, and\ninvestigates the possible generation of arrival-direction-dependent composition\nanisotropies. Limits on the source number density consistent with the observed\nanisotropies are derived for the case where UHECR sources follow the dark\nmatter distribution, and compared to a homogeneous source distribution case.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:24:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bister","Teresa",""],["Farrar","Glennys",""]]}
{"id":"2308.10679","submitter":"Wen-Yuan Ai","authors":"Wen-Yuan Ai","title":"Logarithmically divergent friction on ultrarelativistic bubble walls","comments":"23 pages, 7 figures; v2: discussion on the $L_w\\rightarrow 0$ limit\n  (Sec. 4.3) added, title changed, refs updated","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-45","categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculate the friction experienced by ultrarelativistic bubble walls\nresulting from the $1 \\rightarrow 2$ light-to-heavy transition process, with\nfinite-wall-width effects fully taken into account. In this process, the light\nparticle is excited from the order-parameter scalar field, while the two heavy\nparticles are excitations of a dark matter scalar field. Unlike earlier\nestimates suggesting a friction scaling as $\\gamma_w^0$, where $\\gamma_w$\nrepresents the Lorentz factor of the wall velocity, our more precise numerical\nanalysis reveals a logarithmic dependence of the friction on $\\gamma_w$. We\noffer a numerical fit to capture this frictional pressure accurately. Our\nanalysis verifies that the friction stemming from the $1 \\rightarrow 2$\nlight-to-heavy transition is typically much smaller than the friction from the\n$1 \\rightarrow 1$ transmission of the dark matter particles.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:26:18 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 10:34:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ai","Wen-Yuan",""]]}
{"id":"2308.10680","submitter":"Esam Ghaleb","authors":"Esam Ghaleb, Ilya Burenko, Marlou Rasenberg, Wim Pouw, Peter Uhrig,\n  Judith Holler, Ivan Toni, Asl{\\i} \\\"Ozy\\\"urek and Raquel Fern\\'andez","title":"Co-Speech Gesture Detection through Multi-phase Sequence Labeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gestures are integral components of face-to-face communication. They unfold\nover time, often following predictable movement phases of preparation, stroke,\nand retraction. Yet, the prevalent approach to automatic gesture detection\ntreats the problem as binary classification, classifying a segment as either\ncontaining a gesture or not, thus failing to capture its inherently sequential\nand contextual nature. To address this, we introduce a novel framework that\nreframes the task as a multi-phase sequence labeling problem rather than binary\nclassification. Our model processes sequences of skeletal movements over time\nwindows, uses Transformer encoders to learn contextual embeddings, and\nleverages Conditional Random Fields to perform sequence labeling. We evaluate\nour proposal on a large dataset of diverse co-speech gestures in task-oriented\nface-to-face dialogues. The results consistently demonstrate that our method\nsignificantly outperforms strong baseline models in detecting gesture strokes.\nFurthermore, applying Transformer encoders to learn contextual embeddings from\nmovement sequences substantially improves gesture unit detection. These results\nhighlight our framework's capacity to capture the fine-grained dynamics of\nco-speech gesture phases, paving the way for more nuanced and accurate gesture\ndetection and analysis.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:27:18 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ghaleb","Esam",""],["Burenko","Ilya",""],["Rasenberg","Marlou",""],["Pouw","Wim",""],["Uhrig","Peter",""],["Holler","Judith",""],["Toni","Ivan",""],["\u00d6zy\u00fcrek","Asl\u0131",""],["Fern\u00e1ndez","Raquel",""]]}
{"id":"2308.10681","submitter":"Juraj Krempasky","authors":"J. Krempask\\'y and L. \\v{S}mejkal and S.W. D'Souza and M. Hajlaoui and\n  G. Springholz and K. Uhl\\'i\\v{r}ov\\'a and F. Alarab and P.C. Constantinou and\n  V. Strokov and D. Usanov and W.R. Pudelko and R. Gonz\\'alez-Hern\\'andez and\n  A. Birk Hellenes and Z. Jansa and H. Reichlov\\'a and Z. \\v{S}ob\\'a\\v{n} and\n  R. D. Gonzalez Betancourt and P. Wadley and J. Sinova and D. Kriegner and J.\n  Min\\'ar and J.H. Dil and T. Jungwirth","title":"Altermagnetic lifting of Kramers spin degeneracy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lifted Kramers spin-degeneracy has been among the central topics of\ncondensed-matter physics since the dawn of the band theory of solids. It\nunderpins established practical applications as well as current frontier\nresearch, ranging from magnetic-memory technology to topological quantum\nmatter. Traditionally, lifted Kramers spin-degeneracy has been considered to\noriginate from two possible internal symmetry-breaking mechanisms. The first\none refers to time-reversal symmetry breaking by magnetization of ferromagnets,\nand tends to be strong due to the non-relativistic exchange-coupling origin.\nThe second mechanism applies to crystals with broken inversion symmetry, and\ntends to be comparatively weaker as it originates from the relativistic\nspin-orbit coupling. A recent theory work based on spin-symmetry classification\nhas identified an unconventional magnetic phase, dubbed altermagnetic, that\nallows for lifting the Kramers spin degeneracy without net magnetization and\ninversion-symmetry breaking. Here we provide the confirmation using\nphotoemission spectroscopy and ab initio calculations. We identify two distinct\nunconventional mechanisms of lifted Kramers spin degeneracy generated by the\naltermagnetic phase of centrosymmetric MnTe with vanishing net magnetization.\nOur observation of the altermagnetic lifting of the Kramers spin degeneracy can\nhave broad consequences in magnetism. It motivates exploration and exploitation\nof the unconventional nature of this magnetic phase in an extended family of\nmaterials, ranging from insulators and semiconductors to metals and\nsuperconductors, that have been either identified recently or perceived for\nmany decades as conventional antiferromagnets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:30:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Krempask\u00fd","J.",""],["\u0160mejkal","L.",""],["D'Souza","S. W.",""],["Hajlaoui","M.",""],["Springholz","G.",""],["Uhl\u00ed\u0159ov\u00e1","K.",""],["Alarab","F.",""],["Constantinou","P. C.",""],["Strokov","V.",""],["Usanov","D.",""],["Pudelko","W. R.",""],["Gonz\u00e1lez-Hern\u00e1ndez","R.",""],["Hellenes","A. Birk",""],["Jansa","Z.",""],["Reichlov\u00e1","H.",""],["\u0160ob\u00e1\u0148","Z.",""],["Betancourt","R. D. Gonzalez",""],["Wadley","P.",""],["Sinova","J.",""],["Kriegner","D.",""],["Min\u00e1r","J.",""],["Dil","J. H.",""],["Jungwirth","T.",""]]}
{"id":"2308.10682","submitter":"Joerg Schmalenstroeer","authors":"Joerg Schmalenstroeer, Tobias Gburrek, Reinhold Haeb-Umbach","title":"LibriWASN: A Data Set for Meeting Separation, Diarization, and\n  Recognition with Asynchronous Recording Devices","comments":"Accepted for presentation at the ITG conference on Speech\n  Communication 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present LibriWASN, a data set whose design follows closely the LibriCSS\nmeeting recognition data set, with the marked difference that the data is\nrecorded with devices that are randomly positioned on a meeting table and whose\nsampling clocks are not synchronized. Nine different devices, five smartphones\nwith a single recording channel and four microphone arrays, are used to record\na total of 29 channels. Other than that, the data set follows closely the\nLibriCSS design: the same LibriSpeech sentences are played back from eight\nloudspeakers arranged around a meeting table and the data is organized in\nsubsets with different percentages of speech overlap. LibriWASN is meant as a\ntest set for clock synchronization algorithms, meeting separation, diarization\nand transcription systems on ad-hoc wireless acoustic sensor networks. Due to\nits similarity to LibriCSS, meeting transcription systems developed for the\nformer can readily be tested on LibriWASN. The data set is recorded in two\ndifferent rooms and is complemented with ground-truth diarization information\nof who speaks when.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:33:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Schmalenstroeer","Joerg",""],["Gburrek","Tobias",""],["Haeb-Umbach","Reinhold",""]]}
{"id":"2308.10683","submitter":"Xueli Miao","authors":"X. L. Miao, W. W. Zhu, M. Kramer, P. C. C. Freire, L. Shao, M. Yuan,\n  L. Q. Meng, Z. W. Wu, C. C. Miao, Y. J. Guo, D. J. Champion, E. Fonseca, J.\n  M. Yao, M. Y. Xue, J. R. Niu, H. Hu, C. M. Zhang","title":"Variability, polarimetry, and timing properties of single pulses from\n  PSR J2222-0137 using FAST","comments":"11 pages, 14 figures, accepted by Monthly Notices of the Royal\n  Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In our work, we analyse $5\\times10^{4}$ single pulses from the recycled\npulsar PSR J2222$-$0137 in one of its scintillation maxima observed by the\nFive-hundred-meter Aperture Spherical radio Telescope (FAST). PSR J2222$-$0137\nis one of the nearest and best studies of binary pulsars and a unique\nlaboratory for testing gravitational theories. We report single pulses' energy\ndistribution and polarization from the pulsar's main-pulse region. The single\npulse energy follows the log-normal distribution. We resolve a steep\npolarization swing, but at the current time resolution ($64\\,\\mu{\\rm s}$), we\nfind no evidence for the orthogonal jump in the main-pulse region, as has been\nsuspected. We find a potential sub-pulse drifting period of $P_{3} \\sim\n3.5\\,P$. We analyse the jitter noise from different integrated numbers of\npulses and find that its $\\sigma_{j}$ is $270\\pm{9}\\,{\\rm ns}$ for 1-hr\nintegration at 1.25 GHz. This result is useful for optimizing future timing\ncampaigns with FAST or other radio telescopes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:37:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Miao","X. L.",""],["Zhu","W. W.",""],["Kramer","M.",""],["Freire","P. C. C.",""],["Shao","L.",""],["Yuan","M.",""],["Meng","L. Q.",""],["Wu","Z. W.",""],["Miao","C. C.",""],["Guo","Y. J.",""],["Champion","D. J.",""],["Fonseca","E.",""],["Yao","J. M.",""],["Xue","M. Y.",""],["Niu","J. R.",""],["Hu","H.",""],["Zhang","C. M.",""]]}
{"id":"2308.10684","submitter":"Fatma Elsafoury","authors":"Fatma Elsafoury","title":"Systematic Offensive Stereotyping (SOS) Bias in Language Models","comments":"Keywords: Systematic offensive stereotyping (SOS) bias, Language\n  models, bias removal, fairness, hate speech detection","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Research has shown that language models (LMs) are socially biased. However,\ntoxicity and offensive stereotyping bias in LMs are understudied. In this\npaper, we investigate the systematic offensive stereotype (SOS) bias in LMs. We\npropose a method to measure it. Then, we validate the SOS bias and investigate\nthe effectiveness of debias methods from the literature on removing it.\nFinally, we investigate the impact of the SOS bias in LMs on their performance\nand their fairness on the task of hate speech detection. Our results suggest\nthat all the inspected LMs are SOS biased. The results suggest that the SOS\nbias in LMs is reflective of the hate experienced online by the inspected\nmarginalized groups. The results indicate that removing the SOS bias in LMs,\nusing a popular debias method from the literature, leads to worse SOS bias\nscores. Finally, Our results show no strong evidence that the SOS bias in LMs\nis impactful on their performance on hate speech detection. On the other hand,\nthere is evidence that the SOS bias in LMs is impactful on their fairness.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:37:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Elsafoury","Fatma",""]]}
{"id":"2308.10685","submitter":"Zixuan Yi","authors":"Zixuan Yi, Iadh Ounis, Craig Macdonald","title":"Contrastive Graph Prompt-tuning for Cross-domain Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommender systems are frequently challenged by the data sparsity problem.\nOne approach to mitigate this issue is through cross-domain recommendation\ntechniques. In a cross-domain context, sharing knowledge between domains can\nenhance the effectiveness in the target domain. Recent cross-domain methods\nhave employed a pre-training approach, but we argue that these methods often\nresult in suboptimal fine-tuning, especially with large neural models. Modern\nlanguage models utilize prompts for efficient model tuning. Such prompts act as\na tunable latent vector, allowing for the freezing of the main model\nparameters. In our research, we introduce the Personalised Graph Prompt-based\nRecommendation (PGPRec) framework. This leverages the advantages of\nprompt-tuning. Within this framework, we formulate personalized graph prompts\nitem-wise, rooted in items that a user has previously engaged with.\nSpecifically, we employ Contrastive Learning (CL) to produce pre-trained\nembeddings that offer greater generalizability in the pre-training phase,\nensuring robust training during the tuning phase. Our evaluation of PGPRec in\ncross-domain scenarios involves comprehensive testing with the top-k\nrecommendation tasks and a cold-start analysis. Our empirical findings, based\non four Amazon Review datasets, reveal that the PGPRec framework can decrease\nthe tuned parameters by as much as 74%, maintaining competitive performance.\nRemarkably, there's an 11.41% enhancement in performance against the leading\nbaseline in cold-start situations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:38:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yi","Zixuan",""],["Ounis","Iadh",""],["Macdonald","Craig",""]]}
{"id":"2308.10686","submitter":"Christoph Benzm\\\"uller","authors":"Xavier Parent and Christoph Benzm\\\"uller","title":"Normative Conditional Reasoning as a Fragment of HOL","comments":"22 pages, 28 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI cs.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report some results regarding the mechanization of normative\n(preference-based) conditional reasoning. Our focus is on Aqvist's system E for\nconditional obligation (and its extensions). Our mechanization is achieved via\na shallow semantical embedding in Isabelle/HOL. We consider two possible uses\nof the framework. The first one is as a tool for meta-reasoning about the\nconsidered logic. We employ it for the automated verification of deontic\ncorrespondences (broadly conceived) and related matters, analogous to what has\nbeen previously achieved for the modal logic cube. The second use is as a tool\nfor assessing ethical arguments. We provide a computer encoding of a well-known\nparadox in population ethics, Parfit's repugnant conclusion. Whether the\npresented encoding increases or decreases the attractiveness and persuasiveness\nof the repugnant conclusion is a question we would like to pass on to\nphilosophy and ethics.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:47:30 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:29:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Parent","Xavier",""],["Benzm\u00fcller","Christoph",""]]}
{"id":"2308.10687","submitter":"Danxuan Chen","authors":"Danxuan Chen, Jin Jiang, Thomas F. K. Weatherley, Jean-Fran\\c{c}ois\n  Carlin, Mitali Banerjee, Nicolas Grandjean","title":"Excitonic interplay between surface polar III-nitride quantum wells and\n  MoS$_2$ monolayer","comments":"Added Supporting Information","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  III-nitride wide bandgap semiconductors exhibit large exciton binding\nenergies, preserving strong excitonic effects at room temperature. On the other\nhand, semiconducting two-dimensional (2D) materials, including MoS$_2$, also\nexhibit strong excitonic effects, attributed to enhanced Coulomb interactions.\nThis study investigates excitonic interactions between surface GaN quantum well\n(QW) and 2D MoS$_2$ in van der Waals heterostructures by varying the spacing\nbetween these two excitonic systems. Optical property investigation first\ndemonstrates the effective passivation of defect states at the GaN surface\nthrough MoS$_2$ coating. Furthermore, a strong interplay is observed between\nMoS$_2$ monolayers and GaN QW excitonic transitions. This highlights the\ninterest of the 2D material/III-nitride QW system to study near-field\ninteractions, such as F\\\"orster resonance energy transfer, which could open up\nnovel optoelectronic devices based on such hybrid excitonic structures.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:52:46 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 13:15:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Danxuan",""],["Jiang","Jin",""],["Weatherley","Thomas F. K.",""],["Carlin","Jean-Fran\u00e7ois",""],["Banerjee","Mitali",""],["Grandjean","Nicolas",""]]}
{"id":"2308.10688","submitter":"Oona Rainio","authors":"Oona Rainio and Matti Vuorinen","title":"Lipschitz constants and quadruple symmetrization by M\\\"obius\n  transformations","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the invariance properties of cross-ratio, M\\\"obius transformations are\noften used to map a set of points or other geometric object into a symmetric\nposition to simplify a problem studied. However, when the points are mapped\nunder a M\\\"obius transformation, the distortion of the Euclidean geometry is\nrarely considered. Here, we identify several cases where the distortion caused\nby this symmetrization can be measured in terms of the Lipschitz constant of\nthe M\\\"obius transformation in the Euclidean or the chordal metric.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:53:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rainio","Oona",""],["Vuorinen","Matti",""]]}
{"id":"2308.10689","submitter":"Carlos Andres Agudelo Serna","authors":"Carlos Andres Agudelo Serna, Rachelle Bosua, Atif Ahmad, Sean B.\n  Maynard","title":"Towards a knowledge leakage Mitigation framework for mobile Devices in\n  knowledge-intensive Organizations","comments":"22 pages, ECIS full paper 2018","journal-ref":"Research Papers. 72 (2018) https://aisel.aisnet.org/ecis2018_rp/72","doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The use of mobile devices in knowledge-intensive organizations while\neffective and cost-efficient also pose a challenging management problem. Often\nemployees whether deliberately or inadvertently are the cause of knowledge\nleakage in organizations and the use of mobile devices further exacerbates it.\nThis problem is the result of overly focusing on technical controls while\nneglecting human factors. Knowledge leakage is a multidimensional problem, and\nin this paper, we highlight the different dimensions that constitute it. In\nthis study, our contributions are threefold. First, we study knowledge leakage\nrisk (KLR) within the context of mobile devices in knowledge-intensive\norganizations in Australia. Second, we present a conceptual framework to\nexplain and categorize the mitigation strategies to combat KLR through the use\nof mobile devices grounded in the literature. And third, we apply the framework\nto the findings from interviews with security and knowledge managers. Keywords:\nKnowledge Leakage, Knowledge Risk, Knowledge intensive, Mobile device.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:54:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Serna","Carlos Andres Agudelo",""],["Bosua","Rachelle",""],["Ahmad","Atif",""],["Maynard","Sean B.",""]]}
{"id":"2308.10690","submitter":"Jani Penttala","authors":"Jani Penttala","title":"Diffractive Processes at Next-to-Leading Order in the Dipole Picture","comments":"PhD thesis, introductory part","journal-ref":"JYU Dissertations 668, 2023, ISBN:978-951-39-9674-1, ISSN\n  2489-9003","doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this thesis, we calculate diffractive processes at next-to-leading order\n(NLO) in the high-energy limit, with an emphasis on exclusive vector meson\nproduction and inclusive diffraction in deep inelastic scattering (DIS).\nCalculations in the high-energy limit can be done using the dipole picture, the\nbasics of which are briefly reviewed. This includes using the color-glass\ncondensate effective field theory to describe the nonperturbative dipole-target\nscattering amplitude which appears in practically all calculations in the\ndipole picture. The universality of the dipole-target scattering amplitude at\nNLO is shown numerically, in the sense that the same dipole-target scattering\namplitude can be used to describe the data in both massless and massive quark\nproduction in inclusive DIS, and also in diffractive processes where exclusive\nvector meson production is considered. The analytical NLO calculations of\nexclusive vector meson production and inclusive diffraction in DIS are also\nexplained. Exclusive vector meson production is calculated in the\nnonrelativistic limit for heavy mesons and the limit of large photon virtuality\nfor light mesons. Also, the importance of including relativistic corrections to\nthe heavy vector meson wave function in exclusive vector meson production is\nconsidered. For inclusive diffraction in DIS, we focus on the NLO corrections\nto the final state and show how the divergences cancel.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:56:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Penttala","Jani",""]]}
{"id":"2308.10691","submitter":"Adrian Sieler","authors":"Adrian Sieler and Oliver Brock","title":"Dexterous Soft Hands Linearize Feedback-Control for In-Hand Manipulation","comments":"Accepted at 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a feedback-control framework for in-hand manipulation\n(IHM) with dexterous soft hands that enables the acquisition of manipulation\nskills in the real-world within minutes. We choose the deformation state of the\nsoft hand as the control variable. To control for a desired deformation state,\nwe use coarsely approximated Jacobians of the actuation-deformation dynamics.\nThese Jacobian are obtained via explorative actions. This is enabled by the\nself-stabilizing properties of compliant hands, which allow us to use linear\nfeedback control in the presence of complex contact dynamics. To evaluate the\neffectiveness of our approach, we show the generalization capabilities for a\nlearned manipulation skill to variations in object size by 100 %, 360 degree\nchanges in palm inclination and to disabling up to 50 % of the involved\nactuators. In addition, complex manipulations can be obtained by sequencing\nsuch feedback-skills.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:57:49 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 07:10:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sieler","Adrian",""],["Brock","Oliver",""]]}
{"id":"2308.10692","submitter":"Qizao Wang","authors":"Qizao Wang, Xuelin Qian, Bin Li, Ying Fu, Yanwei Fu, Xiangyang Xue","title":"Exploring Fine-Grained Representation and Recomposition for\n  Cloth-Changing Person Re-Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloth-changing person Re-IDentification (Re-ID) is a particularly challenging\ntask, suffering from two limitations of inferior identity-relevant features and\nlimited training samples. Existing methods mainly leverage auxiliary\ninformation to facilitate discriminative feature learning, including\nsoft-biometrics features of shapes and gaits, and additional labels of\nclothing. However, these information may be unavailable in real-world\napplications. In this paper, we propose a novel FIne-grained Representation and\nRecomposition (FIRe$^{2}$) framework to tackle both limitations without any\nauxiliary information. Specifically, we first design a Fine-grained Feature\nMining (FFM) module to separately cluster images of each person. Images with\nsimilar so-called fine-grained attributes (e.g., clothes and viewpoints) are\nencouraged to cluster together. An attribute-aware classification loss is\nintroduced to perform fine-grained learning based on cluster labels, which are\nnot shared among different people, promoting the model to learn\nidentity-relevant features. Furthermore, by taking full advantage of the\nclustered fine-grained attributes, we present a Fine-grained Attribute\nRecomposition (FAR) module to recompose image features with different\nattributes in the latent space. It can significantly enhance representations\nfor robust feature learning. Extensive experiments demonstrate that FIRe$^{2}$\ncan achieve state-of-the-art performance on five widely-used cloth-changing\nperson Re-ID benchmarks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:59:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Qizao",""],["Qian","Xuelin",""],["Li","Bin",""],["Fu","Ying",""],["Fu","Yanwei",""],["Xue","Xiangyang",""]]}
{"id":"2308.10693","submitter":"Nathalie Revol","authors":"Nathalie Revol (ARIC)","title":"About the ''accurate mode'' of the IEEE 1788-2015 standard for interval\n  arithmetic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IEEE 1788-2015 standard for interval arithmetic defines three accuracy\nmodes for the so-called set-based flavor: tightest, accurate and valid. This\nwork in progress focuses on the accurate mode.First, an introduction to\ninterval arithmetic and to the IEEE 1788-2015 standard is given, then the\naccurate mode is defined. How can this accurate mode be tested, when a library\nimplementing interval arithmetic claims to provide this mode? The chosen\napproach is unit testing, and the elaboration of testing pairs for this\napproach is developed.A discussion closes this paper: how can the tester be\ntested? And if we go to the roots of the subject, is the accurate mode really\nrelevant or should it be dropped off in the next version of the standard?\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:59:53 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Revol","Nathalie","","ARIC"]]}
{"id":"2308.10694","submitter":"Remi Pautrat","authors":"R\\'emi Pautrat, Shaohui Liu, Petr Hruby, Marc Pollefeys, Daniel Barath","title":"Vanishing Point Estimation in Uncalibrated Images with Prior Gravity\n  Direction","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We tackle the problem of estimating a Manhattan frame, i.e. three orthogonal\nvanishing points, and the unknown focal length of the camera, leveraging a\nprior vertical direction. The direction can come from an Inertial Measurement\nUnit that is a standard component of recent consumer devices, e.g.,\nsmartphones. We provide an exhaustive analysis of minimal line configurations\nand derive two new 2-line solvers, one of which does not suffer from\nsingularities affecting existing solvers. Additionally, we design a new\nnon-minimal method, running on an arbitrary number of lines, to boost the\nperformance in local optimization. Combining all solvers in a hybrid robust\nestimator, our method achieves increased accuracy even with a rough prior.\nExperiments on synthetic and real-world datasets demonstrate the superior\naccuracy of our method compared to the state of the art, while having\ncomparable runtimes. We further demonstrate the applicability of our solvers\nfor relative rotation estimation. The code is available at\nhttps://github.com/cvg/VP-Estimation-with-Prior-Gravity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:03:25 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pautrat","R\u00e9mi",""],["Liu","Shaohui",""],["Hruby","Petr",""],["Pollefeys","Marc",""],["Barath","Daniel",""]]}
{"id":"2308.10695","submitter":"Chengyuan Wu","authors":"Chengyuan Wu, Heran Xiong, Zhanwen Han, Bo Wang","title":"Evolution of double oxygen-neon white dwarf merger remnant","comments":"17 pages, 7 figures, a revised version after referee's comments.\n  Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Double white dwarf (WD) merger process and their post-merger evolution are\nimportant in many fields of astronomy, such as supernovae, gamma-ray bursts,\ngravitational waves, etc. The evolutionary outcomes of double ultra-massive WD\nmerger remnants are still a subject of debate, though the general consensus is\nthat the merger remnant will collapse to form a neutron star. In this work, we\ninvestigate the evolution of a 2.20Msun merger remnant stemmed from the\ncoalescence of double 1.10Msun ONe WDs. We find that the remnant ignites\noff-centre neon burning at the position near the surface of primary WD soon\nafter the merger, resulting in the stable inwardly propagating oxygen/neon\n(O/Ne) flame. The final outcomes of the merger remnant are sensitive to the\neffect of convective boundary mixing. If the mixing cannot stall the O/Ne\nflame, the flame will reach the centre within 20 years, leading to the\nformation of super Chandrasekhar mass silicon core, and its final fate probably\nbe neutron star (NS) through iron-core-collapse supernova. In contrast, if the\nconvective mixing is effective enough to prevent the O/Ne flame from reaching\nthe centre, the merger remnant will undergo electron capture supernova to form\nan ONeFe WD. Meanwhile, we find that the wind mass loss process may hardly\nalter the final fate of the remnant due to its fast evolution. Our results\nimply that the coalescence of double ONe WDs can form short lived giant like\nobject, but the final outcomes (NS or ONeFe WD) are influenced by the uncertain\nconvective mixing in O/Ne flame.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:03:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wu","Chengyuan",""],["Xiong","Heran",""],["Han","Zhanwen",""],["Wang","Bo",""]]}
{"id":"2308.10696","submitter":"Mohammed Gharib Dr.","authors":"Mohammed Gharib, Fatemeh Afghah","title":"SCC5G: A PQC-based Architecture for Highly Secure Critical Communication\n  over Cellular Network in Zero-Trust Environment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  5G made a significant jump in cellular network security by offering enhanced\nsubscriber identity protection and a user-network mutual authentication\nimplementation. However, it still does not fully follow the zero-trust (ZT)\nrequirements, as users need to trust the network, 5G network is not necessarily\nauthenticated in each communication instance, and there is no mutual\nauthentication between end users. When critical communications need to use\ncommercial networks, but the environment is ZT, specific security architecture\nis needed to provide security services that do not rely on any 5G network\ntrusted authority. In this paper, we propose SCC5G Secure Critical-mission\nCommunication over a 5G network in ZT setting. SCC5G is a post-quantum\ncryptography (PQC) security solution that loads an embedded hardware root of\nauthentication (HRA), such as physically unclonable functions (PUF), into the\nusers' devices, to achieve tamper-resistant and unclonability features for\nauthentication and key agreement. We evaluate the performance of the proposed\narchitecture through an exhaustive simulation of a 5G network in an ns-3\nnetwork simulator. Results verify the scalability and efficiency of SCC5G by\nshowing that it poses only a few kilobytes of traffic overhead and adds only an\norder of $O(0.1)$ second of latency under the normal traffic load.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:04:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gharib","Mohammed",""],["Afghah","Fatemeh",""]]}
{"id":"2308.10697","submitter":"Matthew Colbrook","authors":"Matthew J. Colbrook, Qin Li, Ryan V. Raut, Alex Townsend","title":"Beyond expectations: Residual Dynamic Mode Decomposition and Variance\n  for Stochastic Dynamical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.LG cs.NA math.NA math.SP nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Koopman operators linearize nonlinear dynamical systems, making their\nspectral information of crucial interest. Numerous algorithms have been\ndeveloped to approximate these spectral properties, and Dynamic Mode\nDecomposition (DMD) stands out as the poster child of projection-based methods.\nAlthough the Koopman operator itself is linear, the fact that it acts in an\ninfinite-dimensional space of observables poses various challenges. These\ninclude spurious modes, essential spectra, and the verification of Koopman mode\ndecompositions. While recent work has addressed these challenges for\ndeterministic systems, there remains a notable gap in verified DMD methods\ntailored for stochastic systems, where the Koopman operator measures the\nexpectation of observables. We show that it is necessary to go beyond\nexpectations to address these issues. By incorporating variance into the\nKoopman framework, we address these challenges. Through an additional DMD-type\nmatrix, we approximate the sum of a squared residual and a variance term, each\nof which can be approximated individually using batched snapshot data. This\nallows verified computation of the spectral properties of stochastic Koopman\noperators, controlling the projection error. We also introduce the concept of\nvariance-pseudospectra to gauge statistical coherency. Finally, we present a\nsuite of convergence results for the spectral quantities of stochastic Koopman\noperators. Our study concludes with practical applications using both simulated\nand experimental data. In neural recordings from awake mice, we demonstrate how\nvariance-pseudospectra can reveal physiologically significant information\nunavailable to standard expectation-based dynamical models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:05:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Colbrook","Matthew J.",""],["Li","Qin",""],["Raut","Ryan V.",""],["Townsend","Alex",""]]}
{"id":"2308.10698","submitter":"Lauritz Beck","authors":"Lauritz Beck, Florian Kummer","title":"High-Order Numerical Integration on Domains Bounded by Intersecting\n  Level Sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a high-order method that provides numerical integration on\nvolumes, surfaces, and lines defined implicitly by two smooth intersecting\nlevel sets. To approximate the integrals, the method maps quadrature rules\ndefined on hypercubes to the curved domains of the integrals. This enables the\nnumerical integration of a wide range of integrands since integration on\nhypercubes is a well known problem. The mappings are constructed by treating\nthe isocontours of the level sets as graphs of height functions. Numerical\nexperiments with smooth integrands indicate a high-order of convergence for\ntransformed Gauss quadrature rules on domains defined by polynomial, rational,\nand trigonometric level sets. We show that the approach we have used can be\ncombined readily with adaptive quadrature methods. Moreover, we apply the\napproach to numerically integrate on difficult geometries without requiring a\nlow-order fallback method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:07:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Beck","Lauritz",""],["Kummer","Florian",""]]}
{"id":"2308.10699","submitter":"Arman Rahbar","authors":"Arman Rahbar, Niklas {\\AA}kerblom, Morteza Haghir Chehreghani","title":"Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed\n  Bandit Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Online decision making plays a crucial role in numerous real-world\napplications. In many scenarios, the decision is made based on performing a\nsequence of tests on the incoming data points. However, performing all tests\ncan be expensive and is not always possible. In this paper, we provide a novel\nformulation of the online decision making problem based on combinatorial\nmulti-armed bandits and take the cost of performing tests into account. Based\non this formulation, we provide a new framework for cost-efficient online\ndecision making which can utilize posterior sampling or BayesUCB for\nexploration. We provide a rigorous theoretical analysis for our framework and\npresent various experimental results that demonstrate its applicability to\nreal-world problems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:09:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rahbar","Arman",""],["\u00c5kerblom","Niklas",""],["Chehreghani","Morteza Haghir",""]]}
{"id":"2308.10700","submitter":"Saulo Matuslem Da Silva Mendes","authors":"Saulo Mendes","title":"Global assessment of university research comprehensiveness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The demand for global university league tables has been high over the past\ntwo decades. However, significant criticism of their methodologies is\naccumulating without being addressed. I revisit global university league tables\nby normalizing each field as to create a uniform distribution of value. Then,\nthe overall performance of an institution is interpreted as the probability of\nhaving a high score in any given academic field. I focus on the similarity of\ninstitutions across ten criteria related to academic performance in eighty\nsubjects of all fields of knowledge. The latter does not induce a zero-sum\ngame, removing one of the most prominent negative features of established\nleague tables. The present assessment shows that the main difference between\nhundreds of leading global research universities is whether their coverage of\nall areas of human knowledge is comprehensive or specialized, as their mean\nperformance per subject is nearly indistinguishable. I compare the results with\nthe main league tables and found excellent agreement, suggesting that\nregardless of their methodologies, research-intensive institutions perform well\nin rankings if they are comprehensive. This comprehensiveness is ultimately\ndependent on institutional age, privileged funding allocation and regional\nacademic culture. Consequently, when the size of an institution is taken out of\nthe picture, I found no correlation between comprehensiveness and quality, and\nno difference can be found in the mean quality of institutions regionally or\nglobally. Furthermore, I find the reputation and prestige of several famous\ninstitutions to far exceed their performance within the present methodology,\nwhile numerous institutions with less reputation and visibility perform better\nthan expected.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:09:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mendes","Saulo",""]]}
{"id":"2308.10701","submitter":"Maurizio Quadrio","authors":"Eric Segalerba, Gabriele Dini Ciacci, Maurizio Quadrio, Jan O. Pralits","title":"On the comparison between pre- and post-surgery nasal anatomies via\n  computational fluid dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nasal breathing difficulties (NBD) are widespread and difficult to diagnose;\nthe failure rate of their surgical corrections is high. Computational Fluid\nDynamics (CFD) enables diagnosis of NBD and surgery planning, by comparing a\npre-operative (pre-op) situation with the outcome of virtual surgery (post-op).\nAn equivalent comparison is involved when considering distinct anatomies in the\nsearch for the functionally normal nose. Currently, this comparison is carried\nout in more than one way, under the implicit assumption that results are\nunchanged, which reflects our limited understanding of the driver of the\nrespiratory function.\n  The study describes how to set up a meaningful comparison. A pre-op anatomy,\nderived via segmentation from a CT scan, is compared with a post-op anatomy\nobtained via virtual surgery. State-of-the-art numerical simulations for a\nsteady inspiration carry out the comparison under three types of global\nconstraints, derived from the field of turbulent flow control: a constant\npressure drop (CPG) between external ambient and throat, a constant flow rate\n(CFR) through the airways and a constant power input (CPI) from the lungs can\nbe enforced. A significant difference in the quantities of interest is observed\ndepending on the type of comparison. Global quantities (flow rate, pressure\ndrop, nasal resistance) as well as local ones are affected. The type of flow\nforcing affects the outcome of the comparison between pre-op and post-op\nanatomies. Among the three available options, we argue that CPG is the least\nadequate. Arguments favouring either CFR or CPI are presented.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:10:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Segalerba","Eric",""],["Ciacci","Gabriele Dini",""],["Quadrio","Maurizio",""],["Pralits","Jan O.",""]]}
{"id":"2308.10702","submitter":"Denielle Ricciardi","authors":"Denielle Ricciardi, Tom Seidl, Brian Lester, Amanda Jones, Elizabeth\n  Jones","title":"Bayesian Optimal Experimental Design for Constitutive Model Calibration","comments":"39 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computational simulation is increasingly relied upon for high-consequence\nengineering decisions, and a foundational element to solid mechanics\nsimulations, such as finite element analysis (FEA), is a credible constitutive\nor material model. Calibration of these complex models is an essential step;\nhowever, the selection, calibration and validation of material models is often\na discrete, multi-stage process that is decoupled from material\ncharacterization activities, which means the data collected does not always\nalign with the data that is needed. To address this issue, an integrated\nworkflow for delivering an enhanced characterization and calibration procedure\n(Interlaced Characterization and Calibration (ICC)) is introduced. This\nframework leverages Bayesian optimal experimental design (BOED) to select the\noptimal load path for a cruciform specimen in order to collect the most\ninformative data for model calibration. The critical first piece of algorithm\ndevelopment is to demonstrate the active experimental design for a fast model\nwith simulated data. For this demonstration, a material point simulator that\nmodels a plane stress elastoplastic material subject to bi-axial loading was\nchosen. The ICC framework is demonstrated on two exemplar problems in which\nBOED is used to determine which load step to take, e.g., in which direction to\nincrement the strain, at each iteration of the characterization and calibration\ncycle. Calibration results from data obtained by adaptively selecting the load\npath within the ICC algorithm are compared to results from data generated under\ntwo naive static load paths that were chosen a priori based on human intuition.\nIn these exemplar problems, data generated in an adaptive setting resulted in\ncalibrated model parameters with reduced measures of uncertainty compared to\nthe static settings.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:13:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ricciardi","Denielle",""],["Seidl","Tom",""],["Lester","Brian",""],["Jones","Amanda",""],["Jones","Elizabeth",""]]}
{"id":"2308.10703","submitter":"Robert Eymard","authors":"J Droniou, R Eymard, T Gallou\\\"et (AMU), C Guichard (SU), R Herbin\n  (AMU)","title":"Optimal error estimates for non-conforming approximations of linear\n  parabolic problems with minimal regularity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a general linear parabolic problem with extended time boundary\nconditions (including initial value problems and periodic ones), and\napproximate it by the implicit Euler scheme in time and the Gradient\nDiscretisation method in space; the latter is in fact a class of methods that\nincludes conforming and nonconforming finite elements, discontinuous Galerkin\nmethods and several others. The main result is an error estimate which holds\nwithout supplementary regularity hypothesis on the solution. This result states\nthat the approximation error has the same order as the sum of the interpolation\nerror and the conformity error. The proof of this result relies on an inf-sup\ninequality in Hilbert spaces which can be used both in the continuous and the\ndiscrete frameworks. The error estimate result is illustrated by numerical\nexamples with low regularity of the solution.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:18:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Droniou","J","","AMU"],["Eymard","R","","AMU"],["Gallou\u00ebt","T","","AMU"],["Guichard","C","","SU"],["Herbin","R","","AMU"]]}
{"id":"2308.10704","submitter":"Aymene Mohammed Bouayed","authors":"Aymene Mohammed Bouayed and Adrian Iaccovelli and David Naccache","title":"Sampling From Autoencoders' Latent Space via Quantization And\n  Probability Mass Function Concepts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this study, we focus on sampling from the latent space of generative\nmodels built upon autoencoders so as the reconstructed samples are lifelike\nimages. To do to, we introduce a novel post-training sampling algorithm rooted\nin the concept of probability mass functions, coupled with a quantization\nprocess. Our proposed algorithm establishes a vicinity around each latent\nvector from the input data and then proceeds to draw samples from these defined\nneighborhoods. This strategic approach ensures that the sampled latent vectors\npredominantly inhabit high-probability regions, which, in turn, can be\neffectively transformed into authentic real-world images. A noteworthy point of\ncomparison for our sampling algorithm is the sampling technique based on\nGaussian mixture models (GMM), owing to its inherent capability to represent\nclusters. Remarkably, we manage to improve the time complexity from the\nprevious $\\mathcal{O}(n\\times d \\times k \\times i)$ associated with GMM\nsampling to a much more streamlined $\\mathcal{O}(n\\times d)$, thereby resulting\nin substantial speedup during runtime. Moreover, our experimental results,\ngauged through the Fr\\'echet inception distance (FID) for image generation,\nunderscore the superior performance of our sampling algorithm across a diverse\nrange of models and datasets. On the MNIST benchmark dataset, our approach\noutperforms GMM sampling by yielding a noteworthy improvement of up to $0.89$\nin FID value. Furthermore, when it comes to generating images of faces and\nocular images, our approach showcases substantial enhancements with FID\nimprovements of $1.69$ and $0.87$ respectively, as compared to GMM sampling, as\nevidenced on the CelebA and MOBIUS datasets. Lastly, we substantiate our\nmethodology's efficacy in estimating latent space distributions in contrast to\nGMM sampling, particularly through the lens of the Wasserstein distance.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:18:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bouayed","Aymene Mohammed",""],["Iaccovelli","Adrian",""],["Naccache","David",""]]}
{"id":"2308.10705","submitter":"Haorui Ji","authors":"Haorui Ji, Hui Deng, Yuchao Dai, Hongdong Li","title":"Unsupervised 3D Pose Estimation with Non-Rigid Structure-from-Motion\n  Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most of the previous 3D human pose estimation work relied on the powerful\nmemory capability of the network to obtain suitable 2D-3D mappings from the\ntraining data. Few works have studied the modeling of human posture deformation\nin motion. In this paper, we propose a new modeling method for human pose\ndeformations and design an accompanying diffusion-based motion prior. Inspired\nby the field of non-rigid structure-from-motion, we divide the task of\nreconstructing 3D human skeletons in motion into the estimation of a 3D\nreference skeleton, and a frame-by-frame skeleton deformation. A mixed\nspatial-temporal NRSfMformer is used to simultaneously estimate the 3D\nreference skeleton and the skeleton deformation of each frame from 2D\nobservations sequence, and then sum them to obtain the pose of each frame.\nSubsequently, a loss term based on the diffusion model is used to ensure that\nthe pipeline learns the correct prior motion knowledge. Finally, we have\nevaluated our proposed method on mainstream datasets and obtained superior\nresults outperforming the state-of-the-art.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:41:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ji","Haorui",""],["Deng","Hui",""],["Dai","Yuchao",""],["Li","Hongdong",""]]}
{"id":"2308.10706","submitter":"Victor Lie","authors":"Bingyang Hu and Victor Lie","title":"On the curved Trilinear Hilbert transform","comments":"103 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building on the (Rank I) LGC-methodology introduced by the second author and\non the novel perspective employed in the time-frequency discretization of the\nnon-resonant bilinear Hilbert--Carleson operator, we develop a new, versatile\nmethod -- referred to as Rank II LGC -- that has as a consequence the\nresolution of the $L^p$ boundedness of the trilinear Hilbert transform along\nthe moment curve. More precisely, we show that the operator \\begin{equation*}\nH_{C}(f_1, f_2, f_3)(x):= \\textrm{p.v.}\\,\\int_{\\mathbb{R}}\nf_1(x-t)f_2(x+t^2)f_3(x+t^3) \\frac{dt}{t}, \\quad x \\in \\mathbb{R}\\,,\n\\end{equation*} is bounded from $L^{p_1}(\\mathbb{R})\\times\nL^{p_2}(\\mathbb{R})\\times L^{p_3}(\\mathbb{R})$ into $L^{r}(\\mathbb{R})$ within\nthe Banach H\\\"older range\n$\\frac{1}{p_1}+\\frac{1}{p_2}+\\frac{1}{p_3}=\\frac{1}{r}$ with\n$1<p_1,p_3<\\infty$, $1<p_2\\leq \\infty$ and $1\\leq r <\\infty$.\n  A crucial difficulty in approaching this problem is the lack of absolute\nsummability for the linearized discretized model (derived via Rank I LGC\nmethod) of the quadrilinear form associated to $H_{C}$. In order to overcome\nthis, we develope a so-called correlative time-frequency model whose control is\nachieved via the following interdependent elements: (1) a sparse-unform\ndecomposition of the input functions adapted to an appropriate time-frequency\nfoliation of the phase-space, (2) a structural analysis of suitable maximal\n``joint Fourier coefficients\", and (3) a level set analysis with respect to the\ntime-frequency correlation set.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:20:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hu","Bingyang",""],["Lie","Victor",""]]}
{"id":"2308.10707","submitter":"Quoc-Vinh Lai-Dang","authors":"Quoc-Vinh Lai-Dang, Jihui Lee, Bumgeun Park, Dongsoo Har","title":"Sensor Fusion by Spatial Encoding for Autonomous Driving","comments":"This paper has been accepted for Lecture presentation at the 2023\n  IEEE SENSORS conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.RO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Sensor fusion is critical to perception systems for task domains such as\nautonomous driving and robotics. Recently, the Transformer integrated with CNN\nhas demonstrated high performance in sensor fusion for various perception\ntasks. In this work, we introduce a method for fusing data from camera and\nLiDAR. By employing Transformer modules at multiple resolutions, proposed\nmethod effectively combines local and global contextual relationships. The\nperformance of the proposed method is validated by extensive experiments with\ntwo adversarial benchmarks with lengthy routes and high-density traffics. The\nproposed method outperforms previous approaches with the most challenging\nbenchmarks, achieving significantly higher driving and infraction scores.\nCompared with TransFuser, it achieves 8% and 19% improvement in driving scores\nfor the Longest6 and Town05 Long benchmarks, respectively.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 04:12:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lai-Dang","Quoc-Vinh",""],["Lee","Jihui",""],["Park","Bumgeun",""],["Har","Dongsoo",""]]}
{"id":"2308.10708","submitter":"Preben Monteiro Ness","authors":"Preben M. Ness, Dusica Marijan, Sunanda Bose","title":"Measuring the Effect of Causal Disentanglement on the Adversarial\n  Robustness of Neural Network Models","comments":"12 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Causal Neural Network models have shown high levels of robustness to\nadversarial attacks as well as an increased capacity for generalisation tasks\nsuch as few-shot learning and rare-context classification compared to\ntraditional Neural Networks. This robustness is argued to stem from the\ndisentanglement of causal and confounder input signals. However, no\nquantitative study has yet measured the level of disentanglement achieved by\nthese types of causal models or assessed how this relates to their adversarial\nrobustness.\n  Existing causal disentanglement metrics are not applicable to deterministic\nmodels trained on real-world datasets. We, therefore, utilise metrics of\ncontent/style disentanglement from the field of Computer Vision to measure\ndifferent aspects of the causal disentanglement for four state-of-the-art\ncausal Neural Network models. By re-implementing these models with a common\nResNet18 architecture we are able to fairly measure their adversarial\nrobustness on three standard image classification benchmarking datasets under\nseven common white-box attacks. We find a strong association (r=0.820, p=0.001)\nbetween the degree to which models decorrelate causal and confounder signals\nand their adversarial robustness. Additionally, we find a moderate negative\nassociation between the pixel-level information content of the confounder\nsignal and adversarial robustness (r=-0.597, p=0.040).\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:22:12 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ness","Preben M.",""],["Marijan","Dusica",""],["Bose","Sunanda",""]]}
{"id":"2308.10709","submitter":"Felix Schaps","authors":"Aloys Krieg, Felix Schaps, Hannah R\\\"omer","title":"Eisenstein series for O(2,n+2)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We will characterize the Eisenstein series for O(2, n + 2) as a particular\nHecke eigenform. As an application we show that it belongs to the associated\nMaa{\\ss} space. If the underlying lattice is even and unimodular, this leads to\nan explicit formula of the Fourier coefficients.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:23:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Krieg","Aloys",""],["Schaps","Felix",""],["R\u00f6mer","Hannah",""]]}
{"id":"2308.10710","submitter":"Connor Auge","authors":"Connor Auge, David Sanders, Ezequiel Treister, C. Megan Urry, Allison\n  Kirkpatrick, Nico Cappelluti, Tonima Tasnim Ananna, M\\'ed\\'eric Boquien,\n  Mislav Balokovi\\'c, Francesca Civano, Brandon Coleman, Aritra Ghosh, Jeyhan\n  Kartaltepe, Michael Koss, Stephanie LaMassa, Stefano Marchesi, Alessandro\n  Peca, Meredith Powell, Benny Trakhtenbrot, Tracey Jane Turner","title":"The Accretion History of AGN: The Spectral Energy Distributions of X-ray\n  Luminous AGN","comments":"24 pages, 20 figures, 4 appendix tables, Accepted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spectral energy distributions (SEDs) from X-ray to far-infrared (FIR)\nwavelengths are presented for a sample of 1246 X-ray luminous active galactic\nnuclei (AGN; $L_{0.5-10\\rm{keV}}>10^{43}$ erg s$^{-1}$), with\n$z_{\\rm{spec}}<1.2$, selected from Stripe 82X, COSMOS, and GOODS-N/S. The\nrest-frame SEDs show a wide spread ($\\sim2.5$ dex) in the relative strengths of\nbroad continuum features at X-ray, ultraviolet (UV), mid-infrared (MIR), and\nFIR wavelengths. A linear correlation (log-log slope of 0.7$\\pm0.04$) is found\nbetween $L_{\\rm{MIR}}$ and $L_{\\rm{X}}$. There is significant scatter in the\nrelation between the $L_{\\rm{UV}}$ and $L_{\\rm{X}}$ due to heavy obscuration,\nhowever the most luminous and unobscured AGN show a linear correlation (log-log\nslope of 0.8$\\pm0.06$) in the relation above this scatter. The relation between\n$L_{\\rm{FIR}}$ and $L_{\\rm{X}}$ is predominantly flat, but with decreasing\ndispersion at $L_{\\rm{X}}>10^{44}$ erg s$^{-1}$. The ratio between the \"galaxy\nsubtracted\" bolometric luminosity and the intrinsic $L_{\\rm{X}}$ increases from\na factor of $\\sim$$10-70$ from log $L_{\\rm{bol}}/{\\rm(erg\\;\ns}^{-1})=44.5-46.5$. Characteristic SED shapes have been determined by grouping\nAGN based on relative strengths of the UV and MIR emission. The average\n$L_{1\\mu\\rm{m}}$ is constant for the majority of these SED shapes, while AGN\nwith the strongest UV and MIR emission have elevated $L_{1\\mu\\rm{m}}$,\nconsistent with the AGN emission dominating their SEDs at optical and NIR\nwavelengths. A strong correlation is found between the SED shape and both the\n$L_{\\rm{X}}$ and $L_{\\rm{bol}}$, such that\n$L_{\\rm{bol}}/L_{\\rm{X}}=20.4\\pm1.8$, independent of the SED shape. This is\nconsistent with an evolutionary scenario of increasing $L_{\\rm{bol}}$ with\ndecreasing obscuration as the AGN blows away circumnuclear gas.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:59:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Auge","Connor",""],["Sanders","David",""],["Treister","Ezequiel",""],["Urry","C. Megan",""],["Kirkpatrick","Allison",""],["Cappelluti","Nico",""],["Ananna","Tonima Tasnim",""],["Boquien","M\u00e9d\u00e9ric",""],["Balokovi\u0107","Mislav",""],["Civano","Francesca",""],["Coleman","Brandon",""],["Ghosh","Aritra",""],["Kartaltepe","Jeyhan",""],["Koss","Michael",""],["LaMassa","Stephanie",""],["Marchesi","Stefano",""],["Peca","Alessandro",""],["Powell","Meredith",""],["Trakhtenbrot","Benny",""],["Turner","Tracey Jane",""]]}
{"id":"2308.10711","submitter":"Jordan Frecon","authors":"Marianna de Santis (UNIROMA), Jordan Frecon (LHC), Francesco Rinaldi\n  (Unipd), Saverio Salzo (DIAG UNIROMA), Martin Schmidt","title":"Relax and penalize: a new bilevel approach to mixed-binary\n  hyperparameter optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, bilevel approaches have become very popular to efficiently\nestimate high-dimensional hyperparameters of machine learning models. However,\nto date, binary parameters are handled by continuous relaxation and rounding\nstrategies, which could lead to inconsistent solutions. In this context, we\ntackle the challenging optimization of mixed-binary hyperparameters by\nresorting to an equivalent continuous bilevel reformulation based on an\nappropriate penalty term. We propose an algorithmic framework that, under\nsuitable assumptions, is guaranteed to provide mixed-binary solutions.\nMoreover, the generality of the method allows to safely use existing continuous\nbilevel solvers within the proposed framework. We evaluate the performance of\nour approach for a specific machine learning problem, i.e., the estimation of\nthe group-sparsity structure in regression problems. Reported results clearly\nshow that our method outperforms state-of-the-art approaches based on\nrelaxation and rounding\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:24:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["de Santis","Marianna","","UNIROMA"],["Frecon","Jordan","","LHC"],["Rinaldi","Francesco","","Unipd"],["Salzo","Saverio","","DIAG UNIROMA"],["Schmidt","Martin",""]]}
{"id":"2308.10712","submitter":"Durga Prasad Karanam Dr","authors":"K. Durga Prasad, Dibyendu Misra, Amitabh, Megha Bhatt, G. Ambily,\n  Sachana Sathyan, Neeraj Srivastava and Anil Bhardwaj","title":"Chandrayaan-3 Alternate Landing Site: Pre-Landing Characterisation","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  India's third Moon mission Chandrayaan 3 will deploy a lander and a rover at\na high latitude location of the Moon enabling us to carry out first ever\nin-situ science investigations of such a pristine location that will\npotentially improve our understanding on primary crust formation and subsequent\nmodification processes. The primary landing site (PLS), is situated at\n69.367621 degS, 32.348126 degE. As a contingency, an alternate landing site\n(ALS) was also selected at nearly the same latitude but nearly 450 km west to\nPLS. In this work, a detailed study of the geomorphology, composition, and\ntemperature characteristics of ALS has been carried out using the best-ever\nhigh resolution Chandrayaan 2 OHRC DEMs and Ortho images, datasets obtained\nfrom Chandrayaan 1 and on-going Lunar Reconnaissance Orbiter. For understanding\nthe thermophysical behaviour, we used a well-established thermophysical model.\nWe found that the Chandrayaan 3 ALS is characterised by a smooth topography\nwith an elevated central part. The ALS is a scientifically interesting site\nwith a high possibility of sampling ejecta materials from Tycho and Moretus.\nBased on the spectral and elemental analysis of the site, Fe is found to be\nnear approx. 4.8 wt.%, with Mg approx. 5 wt.%, and Ca approx. 11 wt.%.\nCompositionally, ALS is similar to PLS with a highland soil composition.\nSpatial and diurnal variability of around 40 K and 175 K has been observed in\nthe surface temperatures at ALS. Although belonging to similar location like\nPLS, ALS showed reduced daytime temperatures and enhanced night-time\ntemperatures compared to PLS, indicating a terrain of distinctive\nthermophysical characteristics. Like PLS, ALS is also seems to be an\ninteresting site for science investigations and Chandrayaan 3 is expected to\nprovide new insights into the understanding of lunar science even if it happens\nto land in the alternate landing site.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:26:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Prasad","K. Durga",""],["Misra","Dibyendu",""],["Amitabh","",""],["Bhatt","Megha",""],["Ambily","G.",""],["Sathyan","Sachana",""],["Srivastava","Neeraj",""],["Bhardwaj","Anil",""]]}
{"id":"2308.10713","submitter":"Di Chang","authors":"Di Chang, Yufeng Yin, Zongjian Li, Minh Tran, Mohammad Soleymani","title":"LibreFace: An Open-Source Toolkit for Deep Facial Expression Analysis","comments":"10 pages, 5 figures. Accepted by WACV 2024 Round 1. (Application\n  Track) Project Page: https://boese0601.github.io/libreface/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Facial expression analysis is an important tool for human-computer\ninteraction. In this paper, we introduce LibreFace, an open-source toolkit for\nfacial expression analysis. This open-source toolbox offers real-time and\noffline analysis of facial behavior through deep learning models, including\nfacial action unit (AU) detection, AU intensity estimation, and facial\nexpression recognition. To accomplish this, we employ several techniques,\nincluding the utilization of a large-scale pre-trained network, feature-wise\nknowledge distillation, and task-specific fine-tuning. These approaches are\ndesigned to effectively and accurately analyze facial expressions by leveraging\nvisual information, thereby facilitating the implementation of real-time\ninteractive applications. In terms of Action Unit (AU) intensity estimation, we\nachieve a Pearson Correlation Coefficient (PCC) of 0.63 on DISFA, which is 7%\nhigher than the performance of OpenFace 2.0 while maintaining highly-efficient\ninference that runs two times faster than OpenFace 2.0. Despite being compact,\nour model also demonstrates competitive performance to state-of-the-art facial\nexpression analysis methods on AffecNet, FFHQ, and RAF-DB. Our code will be\nreleased at https://github.com/ihp-lab/LibreFace\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:33:29 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 03:46:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chang","Di",""],["Yin","Yufeng",""],["Li","Zongjian",""],["Tran","Minh",""],["Soleymani","Mohammad",""]]}
{"id":"2308.10714","submitter":"Yehonatan Fridman","authors":"Yehonatan Fridman, Suprasad Mutalik Desai, Navneet Singh, Thomas\n  Willhalm, Gal Oren","title":"CXL Memory as Persistent Memory for Disaggregated HPC: A Practical\n  Approach","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the landscape of High-Performance Computing (HPC), the quest for efficient\nand scalable memory solutions remains paramount. The advent of Compute Express\nLink (CXL) introduces a promising avenue with its potential to function as a\nPersistent Memory (PMem) solution in the context of disaggregated HPC systems.\nThis paper presents a comprehensive exploration of CXL memory's viability as a\ncandidate for PMem, supported by physical experiments conducted on cutting-edge\nmulti-NUMA nodes equipped with CXL-attached memory prototypes. Our study not\nonly benchmarks the performance of CXL memory but also illustrates the seamless\ntransition from traditional PMem programming models to CXL, reinforcing its\npracticality.\n  To substantiate our claims, we establish a tangible CXL prototype using an\nFPGA card embodying CXL 1.1/2.0 compliant endpoint designs (Intel FPGA CXL IP).\nPerformance evaluations, executed through the STREAM and STREAM-PMem\nbenchmarks, showcase CXL memory's ability to mirror PMem characteristics in\nApp-Direct and Memory Mode while achieving impressive bandwidth metrics with\nIntel 4th generation Xeon (Sapphire Rapids) processors.\n  The results elucidate the feasibility of CXL memory as a persistent memory\nsolution, outperforming previously established benchmarks. In contrast to\npublished DCPMM results, our CXL-DDR4 memory module offers comparable bandwidth\nto local DDR4 memory configurations, albeit with a moderate decrease in\nperformance. The modified STREAM-PMem application underscores the ease of\ntransitioning programming models from PMem to CXL, thus underscoring the\npracticality of adopting CXL memory.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:27:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fridman","Yehonatan",""],["Desai","Suprasad Mutalik",""],["Singh","Navneet",""],["Willhalm","Thomas",""],["Oren","Gal",""]]}
{"id":"2308.10715","submitter":"Jean-Christophe Mourrat","authors":"Jean-Christophe Mourrat","title":"Un-inverting the Parisi formula","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The free energy of any system can be written as the supremum of a functional\ninvolving an energy term and an entropy term. Surprisingly, the limit free\nenergy of mean-field spin glasses is expressed as an infimum instead, a\nphenomenon sometimes called an inverted variational principle. Using a\nstochastic-control representation of the Parisi functional and convex duality\narguments, we rewrite this limit free energy as a supremum over martingales in\na Wiener space.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:35:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mourrat","Jean-Christophe",""]]}
{"id":"2308.10716","submitter":"Jianyang Gu","authors":"Jianyang Gu, Hao Luo, Kai Wang, Wei Jiang, Yang You, Jian Zhao","title":"Color Prompting for Data-Free Continual Unsupervised Domain Adaptive\n  Person Re-Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised domain adaptive person re-identification (Re-ID) methods\nalleviate the burden of data annotation through generating pseudo supervision\nmessages. However, real-world Re-ID systems, with continuously accumulating\ndata streams, simultaneously demand more robust adaptation and anti-forgetting\ncapabilities. Methods based on image rehearsal addresses the forgetting issue\nwith limited extra storage but carry the risk of privacy leakage. In this work,\nwe propose a Color Prompting (CoP) method for data-free continual unsupervised\ndomain adaptive person Re-ID. Specifically, we employ a light-weighted prompter\nnetwork to fit the color distribution of the current task together with Re-ID\ntraining. Then for the incoming new tasks, the learned color distribution\nserves as color style transfer guidance to transfer the images into past\nstyles. CoP achieves accurate color style recovery for past tasks with adequate\ndata diversity, leading to superior anti-forgetting effects compared with image\nrehearsal methods. Moreover, CoP demonstrates strong generalization performance\nfor fast adaptation into new domains, given only a small amount of unlabeled\nimages. Extensive experiments demonstrate that after the continual training\npipeline the proposed CoP achieves 6.7% and 8.1% average rank-1 improvements\nover the replay method on seen and unseen domains, respectively. The source\ncode for this work is publicly available in\nhttps://github.com/vimar-gu/ColorPromptReID.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:38:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gu","Jianyang",""],["Luo","Hao",""],["Wang","Kai",""],["Jiang","Wei",""],["You","Yang",""],["Zhao","Jian",""]]}
{"id":"2308.10717","submitter":"Qizao Wang","authors":"Qizao Wang, Xuelin Qian, Bin Li, Yanwei Fu, Xiangyang Xue","title":"Rethinking Person Re-identification from a Projection-on-Prototypes\n  Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Person Re-IDentification (Re-ID) as a retrieval task, has achieved tremendous\ndevelopment over the past decade. Existing state-of-the-art methods follow an\nanalogous framework to first extract features from the input images and then\ncategorize them with a classifier. However, since there is no identity overlap\nbetween training and testing sets, the classifier is often discarded during\ninference. Only the extracted features are used for person retrieval via\ndistance metrics. In this paper, we rethink the role of the classifier in\nperson Re-ID, and advocate a new perspective to conceive the classifier as a\nprojection from image features to class prototypes. These prototypes are\nexactly the learned parameters of the classifier. In this light, we describe\nthe identity of input images as similarities to all prototypes, which are then\nutilized as more discriminative features to perform person Re-ID. We thereby\npropose a new baseline ProNet, which innovatively reserves the function of the\nclassifier at the inference stage. To facilitate the learning of class\nprototypes, both triplet loss and identity classification loss are applied to\nfeatures that undergo the projection by the classifier. An improved version of\nProNet++ is presented by further incorporating multi-granularity designs.\nExperiments on four benchmarks demonstrate that our proposed ProNet is simple\nyet effective, and significantly beats previous baselines. ProNet++ also\nachieves competitive or even better results than transformer-based competitors.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:38:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Qizao",""],["Qian","Xuelin",""],["Li","Bin",""],["Fu","Yanwei",""],["Xue","Xiangyang",""]]}
{"id":"2308.10718","submitter":"Jie Zhang","authors":"Yutong Wu, Jie Zhang, Florian Kerschbaum, and Tianwei Zhang","title":"Backdooring Textual Inversion for Concept Censorship","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent years have witnessed success in AIGC (AI Generated Content). People\ncan make use of a pre-trained diffusion model to generate images of high\nquality or freely modify existing pictures with only prompts in nature\nlanguage. More excitingly, the emerging personalization techniques make it\nfeasible to create specific-desired images with only a few images as\nreferences. However, this induces severe threats if such advanced techniques\nare misused by malicious users, such as spreading fake news or defaming\nindividual reputations. Thus, it is necessary to regulate personalization\nmodels (i.e., concept censorship) for their development and advancement.\n  In this paper, we focus on the personalization technique dubbed Textual\nInversion (TI), which is becoming prevailing for its lightweight nature and\nexcellent performance. TI crafts the word embedding that contains detailed\ninformation about a specific object. Users can easily download the word\nembedding from public websites like Civitai and add it to their own stable\ndiffusion model without fine-tuning for personalization. To achieve the concept\ncensorship of a TI model, we propose leveraging the backdoor technique for good\nby injecting backdoors into the Textual Inversion embeddings. Briefly, we\nselect some sensitive words as triggers during the training of TI, which will\nbe censored for normal use. In the subsequent generation stage, if the triggers\nare combined with personalized embeddings as final prompts, the model will\noutput a pre-defined target image rather than images including the desired\nmalicious concept.\n  To demonstrate the effectiveness of our approach, we conduct extensive\nexperiments on Stable Diffusion, a prevailing open-sourced text-to-image model.\nOur code, data, and results are available at\nhttps://concept-censorship.github.io.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:39:04 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 13:56:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wu","Yutong",""],["Zhang","Jie",""],["Kerschbaum","Florian",""],["Zhang","Tianwei",""]]}
{"id":"2308.10719","submitter":"Rahul Maitra","authors":"Dibyendu Mondal and Rahul Maitra","title":"Ground or Excited State: a State-Specific Variational Quantum\n  Eigensolver for Them All","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Variational Quantum Eigensolver (VQE) provides a lucrative platform to\ndetermine molecular energetics in near-term quantum devices. While the VQE is\ntraditionally tailored to determine the ground state wavefunction with the\nunderlying Rayleigh-Ritz principle, the access to specific symmetry-adapted\nexcited states remains elusive. This often requires high depth circuit or\nadditional ancilla qubits along with prior knowledge of the ground state\nwavefunction. We propose a unified VQE framework that treats the ground and\nexcited states in the same footings. With the knowledge of the irreducible\nrepresentations of the spinorbitals, we construct a multi-determinantal\nreference that is adapted to a given spatial symmetry where additionally, the\ndeterminants are entangled through appropriate Clebsch-Gordan coefficients to\nensure the desired spin-multiplicity. We introduce the notion of totally\nsymmetric, spin-scalar unitary which maintains the purity of the reference at\neach step of the optimization. The state-selectivity safeguards the method\nagainst any variational collapse while leading to any targeted low-lying\neigenroot of arbitrary symmetry. The direct access to the excited states\nshields our approach from the cumulative error that plagues excited state\ncalculations in a quantum computer and with few parameter count, it is expected\nto be realized in near-term quantum devices.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:39:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mondal","Dibyendu",""],["Maitra","Rahul",""]]}
{"id":"2308.10720","submitter":"Francesco Calabr\\'o","authors":"Ferdinando Auricchio, Maria Roberta Belardo, Francesco Calabr\\`o,\n  Ariel F. Pascaner","title":"On the accuracy of interpolation based on single-layer artificial neural\n  networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.AI cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the present paper, we consider one-hidden layer ANNs with a feedforward\narchitecture, also referred to as shallow or two-layer networks, so that the\nstructure is determined by the number and types of neurons. The determination\nof the parameters that define the function, called training, is done via the\nresolution of the approximation problem, so by imposing the interpolation\nthrough a set of specific nodes. We present the case where the parameters are\ntrained using a procedure that is referred to as Extreme Learning Machine (ELM)\nthat leads to a linear interpolation problem. In such hypotheses, the existence\nof an ANN interpolating function is guaranteed. The focus is then on the\naccuracy of the interpolation outside of the given sampling interpolation nodes\nwhen they are the equispaced, the Chebychev, and the randomly selected ones.\nThe study is motivated by the well-known bell-shaped Runge example, which makes\nit clear that the construction of a global interpolating polynomial is accurate\nonly if trained on suitably chosen nodes, ad example the Chebychev ones. In\norder to evaluate the behavior when growing the number of interpolation nodes,\nwe raise the number of neurons in our network and compare it with the\ninterpolating polynomial. We test using Runge's function and other well-known\nexamples with different regularities. As expected, the accuracy of the\napproximation with a global polynomial increases only if the Chebychev nodes\nare considered. Instead, the error for the ANN interpolating function always\ndecays and in most cases we observe that the convergence follows what is\nobserved in the polynomial case on Chebychev nodes, despite the set of nodes\nused for training.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:40:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Auricchio","Ferdinando",""],["Belardo","Maria Roberta",""],["Calabr\u00f2","Francesco",""],["Pascaner","Ariel F.",""]]}
{"id":"2308.10721","submitter":"Giovanni Minelli","authors":"Giovanni Minelli, Mirco Musolesi","title":"CoMIX: A Multi-agent Reinforcement Learning Training Architecture for\n  Efficient Decentralized Coordination and Independent Decision Making","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robust coordination skills enable agents to operate cohesively in shared\nenvironments, together towards a common goal and, ideally, individually without\nhindering each other's progress. To this end, this paper presents Coordinated\nQMIX (CoMIX), a novel training framework for decentralized agents that enables\nemergent coordination through flexible policies, allowing at the same time\nindependent decision-making at individual level. CoMIX models selfish and\ncollaborative behavior as incremental steps in each agent's decision process.\nThis allows agents to dynamically adapt their behavior to different situations\nbalancing independence and collaboration. Experiments using a variety of\nsimulation environments demonstrate that CoMIX outperforms baselines on\ncollaborative tasks. The results validate our incremental policy approach as\neffective technique for improving coordination in multi-agent systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:45:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Minelli","Giovanni",""],["Musolesi","Mirco",""]]}
{"id":"2308.10722","submitter":"Yichuan Deng","authors":"Yichuan Deng, Michalis Mamakos, Zhao Song","title":"Clustered Linear Contextual Bandits with Knapsacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we study clustered contextual bandits where rewards and\nresource consumption are the outcomes of cluster-specific linear models. The\narms are divided in clusters, with the cluster memberships being unknown to an\nalgorithm. Pulling an arm in a time period results in a reward and in\nconsumption for each one of multiple resources, and with the total consumption\nof any resource exceeding a constraint implying the termination of the\nalgorithm. Thus, maximizing the total reward requires learning not only models\nabout the reward and the resource consumption, but also cluster memberships. We\nprovide an algorithm that achieves regret sublinear in the number of time\nperiods, without requiring access to all of the arms. In particular, we show\nthat it suffices to perform clustering only once to a randomly selected subset\nof the arms. To achieve this result, we provide a sophisticated combination of\ntechniques from the literature of econometrics and of bandits with constraints.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:47:13 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Deng","Yichuan",""],["Mamakos","Michalis",""],["Song","Zhao",""]]}
{"id":"2308.10723","submitter":"Ji Ruoning","authors":"Ruoning Ji (1), Xianyong Ding (1), Fangyang Zhan (1), Xiaoliang Xiao\n  (1), Jing Fan (2), Zhen Ning (1), and Rui Wang (1),(3)","title":"Controllable Weyl nodes and Fermi arcs in a light-irradiated carbon\n  allotrope","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The precise control of Weyl physics in realistic materials oers a promising\navenue to construct accessible topological quantum systems, and thus draw\nwidespread attention in condensed-matter physics. Here, based on rst-principles\ncalculations, maximally localized Wannier functions based tight-binding model,\nand Floquet theorem, we study the light-manipulated evolution of Weyl physics\nin a carbon allotrope C6 crystallizing a face-centered orthogonal structure\n(fco-C6), an ideal Weyl semimetal with two pairs of Weyl nodes, under the\nirradiation of a linearly polarized light (LPL). We show that the positions of\nWeyl nodes and Fermi arcs can be accurately controlled by changing light\nintensity. Moreover, we employ a low-energy eective k p model to understand\nlight-controllable Weyl physics. The results indicate that the symmetry of\nlight-irradiated fco-C6 can be selectively preserved, which guarantees that the\nlight-manipulated Weyl nodes can only move in the highsymmetry plane in\nmomentum space. Our work not only demonstrates the ecacy of employing periodic\ndriving light elds as an ecient approach to manipulate Weyl physics, but also\npaves a reliable pathway for designing accessible topological states under\nlight irradiation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:47:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ji","Ruoning",""],["Ding","Xianyong",""],["Zhan","Fangyang",""],["Xiao","Xiaoliang",""],["Fan","Jing",""],["Ning","Zhen",""],["Wang","Rui",""]]}
{"id":"2308.10724","submitter":"Grischa Fraumann","authors":"Houcemeddine Turki, Grischa Fraumann, Mohamed Ali Hadj Taieb, Mohamed\n  Ben Aouicha","title":"Global visibility of publications through Digital Object Identifiers","comments":"5 pages, 2 tables, 1 figure","journal-ref":"Frontiers in Research Metrics and Analytics, volume 8, 2023","doi":"10.3389/frma.2023.1207980","report-no":null,"categories":"cs.DL cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This brief research report analyzes the availability of Digital Object\nIdentifiers (DOIs) worldwide, highlighting the dominance of large publishing\nhouses and the need for unique persistent identifiers to increase the\nvisibility of publications from developing countries. The study reveals that a\nconsiderable amount of publications from developing countries are excluded from\nthe global flow of scientific information due to the absence of DOIs,\nemphasizing the need for alternative publishing models. The authors suggest\nthat the availability of DOIs should receive more attention in scholarly\ncommunication and scientometrics, contributing to a necessary debate on DOIs\nrelevant for librarians, publishers, and scientometricians.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:47:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Turki","Houcemeddine",""],["Fraumann","Grischa",""],["Taieb","Mohamed Ali Hadj",""],["Aouicha","Mohamed Ben",""]]}
{"id":"2308.10725","submitter":"Maryam Khosravi","authors":"Maryam Khosravi and Ebadollah S. Mahmoodian","title":"Some applications of linear algebraic methods in combinatorics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this note, we intend to produce all latin squares from one of them using\nsuitable move which is defined by small trades and do the similar work on\n4-cycle systems. These problems, reformulate as finding basis for the kernel of\nspecial matrices, representef to some graphs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:47:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khosravi","Maryam",""],["Mahmoodian","Ebadollah S.",""]]}
{"id":"2308.10726","submitter":"Chen Wang","authors":"Chen Wang, Haoran Feng, Ji Yang, Xuepeng Chen, Yang Su, Qing-Zeng Yan,\n  Fujun Du, Yuehui Ma, and Jiajun Cai","title":"The molecular clouds in a section of the third Galactic quadrant:\n  observational properties and chemical abundance ratio between CO and its\n  isotopologues","comments":"11 pages, 16 figures, 1 table, accepted by AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compare the observational properties between $^{12}$CO, $^{13}$CO, and\nC$^{18}$O and summarize the observational parameters based on 7069 clouds\nsample from the Milky Way Imaging Scroll Painting (MWISP) CO survey in a\nsection of the third Galactic quadrant. We find that the $^{13}$CO angular area\n($A_{\\rm ^{13}CO}$) generally increases with that of $^{12}$CO ($A_{\\rm\n^{12}CO}$), and the ratio of $A_{\\rm ^{13}CO}$ to $A_{\\rm ^{12}CO}$ is 0.38 by\nlinear fitting. We find that the $^{12}$CO and $^{13}$CO flux are tightly\ncorrelated as $F_{\\rm ^{13}CO}~=~0.17~ F_{\\rm ^{12}CO}$ with both fluxes\ncalculated within the $^{13}$CO-bright region. This indicates that the\nabundance $X_{\\rm ^{13}CO}$ is a constant to be 6.5$^{+0.1}_{-0.5}$ $\\times\n10^{-7}$ for all samples under assumption of local thermodynamic equilibrium\n(LTE). Additionally, we observed that the X-factor is approximately constant in\nlarge sample molecular clouds. Similarly, we find $F_{\\rm\nC^{18}O}~=~0.11~F_{\\rm ^{13}CO}$ with both fluxes calculated within\nC$^{18}$O-bright region, which indicates that the abundance ratios ${X_{\\rm\n^{13}CO}/X_{\\rm C^{18}O}}$ stays the same value 9.7$^{+0.6}_{-0.8}$ across the\nmolecular clouds under LTE assumption. The linear relationships of $F_{\\rm\n^{12}CO}$ vs. $F_{\\rm ^{13}CO}$ and $F_{\\rm ^{13}CO}$ vs. $F_{\\rm C^{18}O}$\nhold not only for the $^{13}$CO-bright region or C$^{18}$O-bright region, but\nalso for the entire molecular cloud scale with lower flux ratio. The abundance\nratio ${X_{\\rm ^{13}CO}/X_{\\rm C^{18}O}}$ inside clouds shows a strong\ncorrelation with column density and temperature. This indicates that the\n${X_{\\rm ^{13}CO}/X_{\\rm C^{18}O}}$ is dominated by a combination of chemical\nfractionation, selectively dissociation, and self-shielding effect inside\nclouds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:49:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Chen",""],["Feng","Haoran",""],["Yang","Ji",""],["Chen","Xuepeng",""],["Su","Yang",""],["Yan","Qing-Zeng",""],["Du","Fujun",""],["Ma","Yuehui",""],["Cai","Jiajun",""]]}
{"id":"2308.10727","submitter":"Bella Specktor Fadida","authors":"Bella Specktor-Fadida, Anna Levchakov, Dana Schonberger, Liat\n  Ben-Sira, Dafna Ben-Bashat, Leo Joskowicz","title":"Test-time augmentation-based active learning and self-training for\n  label-efficient segmentation","comments":"Accepted to MICCAI MILLanD workshop 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Deep learning techniques depend on large datasets whose annotation is\ntime-consuming. To reduce annotation burden, the self-training (ST) and\nactive-learning (AL) methods have been developed as well as methods that\ncombine them in an iterative fashion. However, it remains unclear when each\nmethod is the most useful, and when it is advantageous to combine them. In this\npaper, we propose a new method that combines ST with AL using Test-Time\nAugmentations (TTA). First, TTA is performed on an initial teacher network.\nThen, cases for annotation are selected based on the lowest estimated Dice\nscore. Cases with high estimated scores are used as soft pseudo-labels for ST.\nThe selected annotated cases are trained with existing annotated cases and ST\ncases with border slices annotations. We demonstrate the method on MRI fetal\nbody and placenta segmentation tasks with different data variability\ncharacteristics. Our results indicate that ST is highly effective for both\ntasks, boosting performance for in-distribution (ID) and out-of-distribution\n(OOD) data. However, while self-training improved the performance of\nsingle-sequence fetal body segmentation when combined with AL, it slightly\ndeteriorated performance of multi-sequence placenta segmentation on ID data. AL\nwas helpful for the high variability placenta data, but did not improve upon\nrandom selection for the single-sequence body data. For fetal body segmentation\nsequence transfer, combining AL with ST following ST iteration yielded a Dice\nof 0.961 with only 6 original scans and 2 new sequence scans. Results using\nonly 15 high-variability placenta cases were similar to those using 50 cases.\nCode is available at: https://github.com/Bella31/TTA-quality-estimation-ST-AL\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:50:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Specktor-Fadida","Bella",""],["Levchakov","Anna",""],["Schonberger","Dana",""],["Ben-Sira","Liat",""],["Ben-Bashat","Dafna",""],["Joskowicz","Leo",""]]}
{"id":"2308.10728","submitter":"Veerle Sterken J","authors":"Veerle J. Sterken, Silvan Hunziker, Kostas Dialynas, Jan Leitner,\n  Maximilian Sommer, Ralf Srama, Lennart R. Baalmann, Aigen Li, Konstantin\n  Herbst, Andr\\'e Galli, Pontus Brandt, My Riebe, Jack Baggaley, Michel Blanc,\n  Andrej Czechowski, Frederic Effenberger, Brian Fields, Priscilla Frisch,\n  Mihaly Horanyi, Hsiang-Wen Hsu, Nozair Khawaja, Harald Kr\\\"uger, Bill S.\n  Kurth, Niels F. W. Ligterink, Jeffrey L. Linsky, Casey Lisse, David\n  Malaspina, Jesse A. Miller, Merav Opher, Andrew R. Poppe, Frank Postberg,\n  Elena Provornikova, Seth Redfield, John Richardson, Michael Rowan-Robinson,\n  Klaus Scherer, Mitchell M. Shen, Jon D. Slavin, Zoltan Sternovsky, Gunter\n  Stober, Peter Strub, Jamey Szalay, Mario Trieloff","title":"Synergies between interstellar dust and heliospheric science with an\n  Interstellar Probe","comments":"18 pages, 7 Figures, 5 Tables. Originally submitted as white paper\n  for the National Academies Decadal Survey for Solar and Space Physics\n  2024-2033","journal-ref":"RAS Techniques and Instruments, rzad034 (2023)","doi":"10.1093/rasti/rzad034","report-no":null,"categories":"astro-ph.IM astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss the synergies between heliospheric and dust science, the open\nscience questions, the technological endeavors and programmatic aspects that\nare important to maintain or develop in the decade to come. In particular, we\nillustrate how we can use interstellar dust in the solar system as a tracer for\nthe (dynamic) heliosphere properties, and emphasize the fairly unexplored, but\npotentially important science question of the role of cosmic dust in\nheliospheric and astrospheric physics. We show that an Interstellar Probe\nmission with a dedicated dust suite would bring unprecedented advances to\ninterstellar dust research, and can also contribute-through measuring dust - to\nheliospheric science. This can, in particular, be done well if we work in\nsynergy with other missions inside the solar system, thereby using multiple\nvantage points in space to measure the dust as it `rolls' into the heliosphere.\nSuch synergies between missions inside the solar system and far out are crucial\nfor disentangling the spatially and temporally varying dust flow. Finally, we\nhighlight the relevant instrumentation and its suitability for contributing to\nfinding answers to the research questions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:53:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sterken","Veerle J.",""],["Hunziker","Silvan",""],["Dialynas","Kostas",""],["Leitner","Jan",""],["Sommer","Maximilian",""],["Srama","Ralf",""],["Baalmann","Lennart R.",""],["Li","Aigen",""],["Herbst","Konstantin",""],["Galli","Andr\u00e9",""],["Brandt","Pontus",""],["Riebe","My",""],["Baggaley","Jack",""],["Blanc","Michel",""],["Czechowski","Andrej",""],["Effenberger","Frederic",""],["Fields","Brian",""],["Frisch","Priscilla",""],["Horanyi","Mihaly",""],["Hsu","Hsiang-Wen",""],["Khawaja","Nozair",""],["Kr\u00fcger","Harald",""],["Kurth","Bill S.",""],["Ligterink","Niels F. W.",""],["Linsky","Jeffrey L.",""],["Lisse","Casey",""],["Malaspina","David",""],["Miller","Jesse A.",""],["Opher","Merav",""],["Poppe","Andrew R.",""],["Postberg","Frank",""],["Provornikova","Elena",""],["Redfield","Seth",""],["Richardson","John",""],["Rowan-Robinson","Michael",""],["Scherer","Klaus",""],["Shen","Mitchell M.",""],["Slavin","Jon D.",""],["Sternovsky","Zoltan",""],["Stober","Gunter",""],["Strub","Peter",""],["Szalay","Jamey",""],["Trieloff","Mario",""]]}
{"id":"2308.10729","submitter":"Changzhen Li","authors":"Changzhen Li, Jie Zhang, Yang Wei, Zhilong Ji, Jinfeng Bai, Shiguang\n  Shan","title":"Patch Is Not All You Need","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision Transformers have achieved great success in computer visions,\ndelivering exceptional performance across various tasks. However, their\ninherent reliance on sequential input enforces the manual partitioning of\nimages into patch sequences, which disrupts the image's inherent structural and\nsemantic continuity. To handle this, we propose a novel Pattern Transformer\n(Patternformer) to adaptively convert images to pattern sequences for\nTransformer input. Specifically, we employ the Convolutional Neural Network to\nextract various patterns from the input image, with each channel representing a\nunique pattern that is fed into the succeeding Transformer as a visual token.\nBy enabling the network to optimize these patterns, each pattern concentrates\non its local region of interest, thereby preserving its intrinsic structural\nand semantic information. Only employing the vanilla ResNet and Transformer, we\nhave accomplished state-of-the-art performance on CIFAR-10 and CIFAR-100, and\nhave achieved competitive results on ImageNet.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:54:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Changzhen",""],["Zhang","Jie",""],["Wei","Yang",""],["Ji","Zhilong",""],["Bai","Jinfeng",""],["Shan","Shiguang",""]]}
{"id":"2308.10730","submitter":"Nicolas Roisin","authors":"Nicolas Roisin, Marie-St\\'ephane Colla, Romain Scaffidi, Thomas\n  Pardoen, Denis Flandre, Jean-Pierre Raskin","title":"Band gap reduction in highly-strained silicon beams predicted by\n  first-principles theory and validated using photoluminescence spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A theoretical study of the band gap reduction under tensile stress is\nperformed and validated through experimental measurements. First-principles\ncalculations based on density functional theory (DFT) are performed for\nuniaxial stress applied in the [001], [110] and [111] directions. The\ncalculated band gap reductions are equal to 126, 240 and 100 meV at 2$\\%$\nstrain, respectively. Photoluminescence spectroscopy experiments are performed\nby deformation applied in the [110] direction. Microfabricated specimens have\nbeen deformed using an on-chip tensile technique up to ~1$\\%$ as confirmed by\nback-scattering Raman spectroscopy. A fitting correction based on the band gap\nfluctuation model has been used to eliminate the specimen interference signal\nand retrieve reliable values. Very good agreement is observed between\nfirst-principles theory and experimental results with a band gap reduction of,\nrespectively, 93 and 91 meV when the silicon beam is deformed by 0.95$\\%$ along\nthe [110] direction.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:54:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Roisin","Nicolas",""],["Colla","Marie-St\u00e9phane",""],["Scaffidi","Romain",""],["Pardoen","Thomas",""],["Flandre","Denis",""],["Raskin","Jean-Pierre",""]]}
{"id":"2308.10731","submitter":"John Carlton","authors":"John Carlton and Christopher McCabe","title":"From RATs to riches: mitigating anthropogenic and synanthropic noise in\n  atom interferometer searches for ultra-light dark matter","comments":"15 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"KCL-PH-TH/2023-29, AION-REPORT/2023-09","categories":"astro-ph.CO hep-ex hep-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Atom interferometers offer promising new avenues for detecting ultra-light\ndark matter (ULDM). The exceptional sensitivity of atom interferometers to\nfluctuations in the local gravitational potential exposes them to sources of\nnoise from human (anthropogenic) and animal (synanthropic) activity, which may\nobscure signals from ULDM. We characterise potential anthropogenic and\nsynanthropic noise sources and examine their influence on a year-long\nmeasurement campaign by AION-10, an upcoming atom interferometer experiment\nthat will be located at the University of Oxford. We propose a data cleaning\nframework that identifies and then masks anthropogenic and synanthropic noise.\nWith this framework, we demonstrate that even in noisy conditions, the\nsensitivity to ULDM can be restored to within between 10% and 40% of an atom\nshot noise-limited experiment, depending on the specific composition of the\nanthropogenic and synanthropic noise. This work provides an important step\ntowards creating robust noise reduction analysis strategies in the pursuit of\nULDM detection with atom interferometers.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:54:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Carlton","John",""],["McCabe","Christopher",""]]}
{"id":"2308.10732","submitter":"Katherine Rhode","authors":"Katherine L. Rhode, Nicholas J. Smith, William F. Janesh, John J.\n  Salzer, Elizabeth A. K. Adams, Martha P. Haynes, Steven Janowiecki, John M.\n  Cannon","title":"A Search for Gas-Rich Dwarf Galaxies in the Local Universe with ALFALFA\n  and the WIYN One Degree Imager","comments":"33 pages, 10 figures, 5 tables. Published in the September 2023 issue\n  of The Astronomical Journal","journal-ref":"AJ 166 113 (2023)","doi":"10.3847/1538-3881/aceb5a","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present results from an optical search for Local Group dwarf galaxy\ncandidates associated with the Ultra-Compact High Velocity Clouds (UCHVCs)\ndiscovered by the ALFALFA neutral hydrogen survey. The ALFALFA UCHVCs are\nisolated, compact HI clouds with projected sizes, velocities, and estimated HI\nmasses that suggest they may be nearby dwarf galaxies, but that have no clear\ncounterpart in existing optical survey data. We observed 26 UCHVCs with the\nWIYN 3.5-m telescope and One Degree Imager (ODI) in two broadband filters and\nsearched the images for resolved stars with properties that match those of\nstars in typical dwarf galaxies at distances <2.5 Mpc. We identify one\npromising dwarf galaxy candidate at a distance of ~570 kpc associated with the\nUCHVC AGC 268071, and five other candidates that may deserve additional\nfollow-up. We carry out a detailed analysis of ODI imaging of a UCHVC that is\nclose in both projected distance and radial velocity to the outer-halo Milky\nWay globular cluster Pal 3. We also use our improved detection methods to\nreanalyze images of five UCHVCs that were found to have possible optical\ncounterparts during the first phase of the project, and confirm the detection\nof a possible stellar counterpart to the UCHVC AGC 249525 at an estimated\ndistance of ~2 Mpc. We compare the optical and HI properties of the dwarf\ngalaxy candidates to the results from recent theoretical simulations that model\nsatellite galaxy populations in group environments, as well as to the observed\nproperties of galaxies in and around the Local Group.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:55:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Rhode","Katherine L.",""],["Smith","Nicholas J.",""],["Janesh","William F.",""],["Salzer","John J.",""],["Adams","Elizabeth A. K.",""],["Haynes","Martha P.",""],["Janowiecki","Steven",""],["Cannon","John M.",""]]}
{"id":"2308.10733","submitter":"Eric Sawyer","authors":"Eric T. Sawyer and Brett D. Wick","title":"The Hyt\\\"onen-Vuorinen L^{p} conjecture for the Hilbert transform when\n  (4/3)<p<4 and the measures share no point masses","comments":"104 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the case (4/3)<p<4, and assuming a pair of locally finite positive Borel\nmeasures on the real line have no common point masses, we prove two conjectures\nof T. Hyt\\\"onen and E. Vuorinen from 2018 on two weight testing theorems for\nthe Hilbert transform on weighted L^{p} spaces. Namely, the two weight norm\ninequality holds (1) if and only if the global quadratic interval testing\nconditions hold, (2) if and only if the local quadratic interval testing, the\nquadratic Muckenhoupt, and the quadratic weak boundedness conditions all hold.\nWe also give a slight improvement of the second conjecture in this setting by\nreplacing the quadratic Muckenhoupt conditions with two smaller conditions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:57:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sawyer","Eric T.",""],["Wick","Brett D.",""]]}
{"id":"2308.10734","submitter":"Samuel Forbes","authors":"Samuel Forbes","title":"A Study of the Probability Distribution of the Balls in Bins Process\n  with Power Law Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyse the balls in bins process with feedback with primary focus on the\npower law feedback function $f(\\omega)=\\eta \\omega^{\\gamma}\\,$, $\\eta>0\\,$\n$\\gamma \\geq0\\,$. Using the recursive solution to the master equation we find\nfor power law feedback numerical evidence that the probability mass function\nfor finite time scales asymptotically with $\\omega^{-\\gamma}\\,$ for\n$\\gamma>1\\,$. We also provide simulations supporting a previous result by\nOliveira (corollary to Theorem 4 in \\cite{oliveira2009onset}) that the tail of\nthe losers scale as $\\omega^{-(\\gamma-1)}\\,$ but extending to $N \\geq 2$ bins.\nWe thus find evidence that the balls in bins process with power law feedback\nproduces power law distributions as is common to many real world phenomena.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:59:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Forbes","Samuel",""]]}
{"id":"2308.10735","submitter":"Alexandra Weinberger","authors":"Oswin Aichholzer and Birgit Vogtenhuber and Alexandra Weinberger","title":"Different Types of Isomorphisms of Drawings of Complete Multipartite\n  Graphs","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Simple drawings are drawings of graphs in which any two edges intersect at\nmost once (either at a common endpoint or a proper crossing), and no edge\nintersects itself. We analyze several characteristics of simple drawings of\ncomplete multipartite graphs: which pairs of edges cross, in which order they\ncross, and the cyclic order around vertices and crossings, respectively. We\nconsider all possible combinations of how two drawings can share some\ncharacteristics and determine which other characteristics they imply and which\nthey do not imply. Our main results are that for simple drawings of complete\nmultipartite graphs, the orders in which edges cross determine all other\nconsidered characteristics. Further, if all partition classes have at least\nthree vertices, then the pairs of edges that cross determine the rotation\nsystem and the rotation around the crossings determine the extended rotation\nsystem. We also show that most other implications -- including the ones that\nhold for complete graphs -- do not hold for complete multipartite graphs. Using\nthis analysis, we establish which types of isomorphisms are meaningful for\nsimple drawings of complete multipartite graphs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:01:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aichholzer","Oswin",""],["Vogtenhuber","Birgit",""],["Weinberger","Alexandra",""]]}
{"id":"2308.10736","submitter":"Abhinandan .","authors":"Abhinandan","title":"Syntomic complex and $p$-adic nearby cycles","comments":"Original version from 2022. Comments always welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In local relative $p$-adic Hodge theory, we show that the Galois cohomology\nof a finite crystalline height representation, upto a Tate twist, is\nessentially computed by (Fontaine-Messing) syntomic complex with coefficient in\nthe associated $F$-isocrystal. In global applications, for smooth ($p$-adic\nformal) schemes, we establish a comparison between syntomic complex with\ncoefficient in a locally free Fontaine-Laffaille module and $p$-adic nearby\ncycles of the associated \\'etale local system on the (rigid) generic fiber.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:04:09 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 03:59:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Abhinandan","",""]]}
{"id":"2308.10737","submitter":"Bahare Fatemi","authors":"Bahare Fatemi, Sami Abu-El-Haija, Anton Tsitsulin, Mehran Kazemi,\n  Dustin Zelle, Neslihan Bulut, Jonathan Halcrow, Bryan Perozzi","title":"UGSL: A Unified Framework for Benchmarking Graph Structure Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph neural networks (GNNs) demonstrate outstanding performance in a broad\nrange of applications. While the majority of GNN applications assume that a\ngraph structure is given, some recent methods substantially expanded the\napplicability of GNNs by showing that they may be effective even when no graph\nstructure is explicitly provided. The GNN parameters and a graph structure are\njointly learned. Previous studies adopt different experimentation setups,\nmaking it difficult to compare their merits. In this paper, we propose a\nbenchmarking strategy for graph structure learning using a unified framework.\nOur framework, called Unified Graph Structure Learning (UGSL), reformulates\nexisting models into a single model. We implement a wide range of existing\nmodels in our framework and conduct extensive analyses of the effectiveness of\ndifferent components in the framework. Our results provide a clear and concise\nunderstanding of the different methods in this area as well as their strengths\nand weaknesses. The benchmark code is available at\nhttps://github.com/google-research/google-research/tree/master/ugsl.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:05:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fatemi","Bahare",""],["Abu-El-Haija","Sami",""],["Tsitsulin","Anton",""],["Kazemi","Mehran",""],["Zelle","Dustin",""],["Bulut","Neslihan",""],["Halcrow","Jonathan",""],["Perozzi","Bryan",""]]}
{"id":"2308.10738","submitter":"Pratyush Pranav","authors":"Pratyush Pranav, Thomas Buchert","title":"Homology reveals significant anisotropy in the cosmic microwave\n  background","comments":"13 pages, 10 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We test the tenet of statistical isotropy of the standard cosmological model\nvia a homology analysis of the cosmic microwave background temperature maps.\nExamining small sectors of the normalized maps, we find that the results\nexhibit a dependence on whether we compute the mean and variance locally from\nthe masked patch, or from the full masked sky. Assigning local mean and\nvariance for normalization, we find the maximum discrepancy between the data\nand model in the galactic northern hemisphere at more than $3.5$ s.d. for the\nPR4 dataset at degree-scale. For the PR3 dataset, the C-R and SMICA maps\nexhibit higher significance than the PR4 dataset at $\\sim 4$ and $4.1$ s.d.\nrespectively, however the NILC and SEVEM maps exhibit lower significance at\n$\\sim 3.4$ s.d. The southern hemisphere exhibits high degree of consistency\nbetween the data and the model for both the PR4 and PR3 datasets. Assigning the\nmean and variance of the full masked sky decreases the significance for the\nnorthern hemisphere, the tails in particular. However the tails in the southern\nhemisphere are strongly discrepant at more than $4$ standard deviations at\napproximately $5$ degrees. The $p$-values obtained from the $\\chi^2$-statistic\nexhibit commensurate significance in both the experiments. Examining the\nquadrants of the sphere, we find the first quadrant to be the major source of\nthe discrepancy. Prima-facie, the results indicate a breakdown of statistical\nisotropy in the CMB maps, however more work is needed to ascertain the source\nof the anomaly. Regardless, these map characteristics may have serious\nconsequences for downstream computations such as parameter estimation, and the\nrelated Hubble tension.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:06:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pranav","Pratyush",""],["Buchert","Thomas",""]]}
{"id":"2308.10739","submitter":"Rapha\\\"el Dupr\\'e","authors":"Rapha\\\"el Dupr\\'e, Federico Ceccopieri","title":"A TMD-based model for Hadronization off heavy nuclei","comments":"22 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Semi-inclusive deep inelastic scattering (SIDIS) off nuclei is a unique\nprocess to study the parton propagation mechanism and its modification induced\nby the presence of the nuclear medium. It allows us to probe the medium\nproperties, particularly the cold nuclear matter transport coefficient, which\ncan be directly linked to the nuclear gluon density. We present here a model\nfor hadron production in deep inelastic lepton-nucleus scattering, which takes\ninto account the hadronic transverse momentum of final state particles via\ntransverse-momentum dependent (TMD) parton distributions and fragmentation\nfunctions. We implement parton energy loss and hadronic absorption with a\ngeometrical model of the nucleus. The model is compared with the nuclear SIDIS\nmultiplicity ratios and transverse-momentum broadening data from the CLAS,\nHERMES, and EMC collaborations, aiming for a simultaneous description of these\ndata sets. We obtain a good agreement over the various nuclear targets and the\nwide kinematical range of those experiments. We best describe the data with a\ntransport coefficient \\hat q = 0.3 GeV/fm 2 , and we highlight the importance\nand the role of correlations in extracting this quantity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:08:35 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:18:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dupr\u00e9","Rapha\u00ebl",""],["Ceccopieri","Federico",""]]}
{"id":"2308.10740","submitter":"Afshin Khadangi","authors":"Afshin Khadangi","title":"We Don't Need No Adam, All We Need Is EVE: On The Variance of Dual\n  Learning Rate And Beyond","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the rapidly advancing field of deep learning, optimising deep neural\nnetworks is paramount. This paper introduces a novel method, Enhanced Velocity\nEstimation (EVE), which innovatively applies different learning rates to\ndistinct components of the gradients. By bifurcating the learning rate, EVE\nenables more nuanced control and faster convergence, addressing the challenges\nassociated with traditional single learning rate approaches. Utilising a\nmomentum term that adapts to the learning landscape, the method achieves a more\nefficient navigation of the complex loss surface, resulting in enhanced\nperformance and stability. Extensive experiments demonstrate that EVE\nsignificantly outperforms existing optimisation techniques across various\nbenchmark datasets and architectures.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:08:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khadangi","Afshin",""]]}
{"id":"2308.10741","submitter":"Christian Schlarmann","authors":"Christian Schlarmann and Matthias Hein","title":"On the Adversarial Robustness of Multi-Modal Foundation Models","comments":"ICCV AROW 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-modal foundation models combining vision and language models such as\nFlamingo or GPT-4 have recently gained enormous interest. Alignment of\nfoundation models is used to prevent models from providing toxic or harmful\noutput. While malicious users have successfully tried to jailbreak foundation\nmodels, an equally important question is if honest users could be harmed by\nmalicious third-party content. In this paper we show that imperceivable attacks\non images in order to change the caption output of a multi-modal foundation\nmodel can be used by malicious content providers to harm honest users e.g. by\nguiding them to malicious websites or broadcast fake information. This\nindicates that countermeasures to adversarial attacks should be used by any\ndeployed multi-modal foundation model.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:09:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Schlarmann","Christian",""],["Hein","Matthias",""]]}
{"id":"2308.10742","submitter":"Askar Ali","authors":"Askar Ali, Ali \\\"Ovg\\\"un","title":"Topological dyonic black holes of massive gravity with generalized\n  quasitopological electromagnetism","comments":"24 pages and 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we investigate new dyonic black holes of massive gravity\nsourced by generalized quasitopological electromagnetism in arbitrary\ndimensions. We begin by deriving the exact solution to the field equations\ndefining these black holes and look at how graviton's mass, dimensionality\nparameter, and quasitopological electromagnetic field affect the horizon\nstructure of anti-de Sitter dyonic black holes. We also explore the asymptotic\nbehaviour of the curvature invariants at both the origin and infinity to\nanalyze the geometric structure of the resultant black holes. We also compute\nthe conserved and thermodynamic quantities of these dyonic black holes with the\nhelp of established techniques and known formulas. After investigating the\nrelevancy of first law, we look at how various parameters influence the local\nthermodynamic stability of resultant black hole solution. We also examine how\nthermal fluctuations affect the local stability of dyonic black holes in\nmassive gravity. Finally, we study the shadow cast of the black hole.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:15:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ali","Askar",""],["\u00d6vg\u00fcn","Ali",""]]}
{"id":"2308.10743","submitter":"Huanran Chen","authors":"Shuo Zhang, Ziruo Wang, Zikai Zhou, Huanran Chen","title":"Boosting Adversarial Attack with Similar Target","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks are vulnerable to adversarial examples, posing a threat\nto the models' applications and raising security concerns. An intriguing\nproperty of adversarial examples is their strong transferability. Several\nmethods have been proposed to enhance transferability, including ensemble\nattacks which have demonstrated their efficacy. However, prior approaches\nsimply average logits, probabilities, or losses for model ensembling, lacking a\ncomprehensive analysis of how and why model ensembling significantly improves\ntransferability. In this paper, we propose a similar targeted attack method\nnamed Similar Target~(ST). By promoting cosine similarity between the gradients\nof each model, our method regularizes the optimization direction to\nsimultaneously attack all surrogate models. This strategy has been proven to\nenhance generalization ability. Experimental results on ImageNet validate the\neffectiveness of our approach in improving adversarial transferability. Our\nmethod outperforms state-of-the-art attackers on 18 discriminative classifiers\nand adversarially trained models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:16:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Shuo",""],["Wang","Ziruo",""],["Zhou","Zikai",""],["Chen","Huanran",""]]}
{"id":"2308.10744","submitter":"Eric De Giuli","authors":"Eric De Giuli","title":"Fermionic theory of nonequilibrium steady states","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the quantification of metabolism, nonequilibrium steady states play a\ncentral role in living matter, but are beyond the purview of equilibrium\nstatistical mechanics. Here we develop a fermionic theory of nonequilibrium\nsteady states in continuous-time Markovian systems. The response to an\narbitrary perturbation is computed, and simplified in canonical cases. Beyond\nresponse, we consider ensembles of NESS and derive a fluctuation-response\nrelation over a non-equilibrium ensemble. Some connections to quantum gravity\nare pointed out, and the formulation is extended to a supersymmetric integral\none, which may form the basis of nontrivial solvable models of nonequilibrium\nsteady states.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:17:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["De Giuli","Eric",""]]}
{"id":"2308.10745","submitter":"D\\'aniel Kincses","authors":"M\\'arton Nagy, Aletta Purzsa, M\\'at\\'e Csan\\'ad, D\\'aniel Kincses","title":"A novel method for calculating Bose-Einstein correlation functions with\n  Coulomb final-state interaction","comments":"20 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ex hep-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measurements of Bose-Einstein correlations played a crucial role in the\ndiscovery and the subsequent detailed exploration of the Quark-Gluon-Plasma\n(QGP) created in high-energy collisions of heavy nuclei. Such measurements gave\nrise to femtoscopy, a flourishing sub-field of high-energy physics, and there\nare important new directions to explore and discoveries to be made in the near\nfuture. One of these important current topics is the precise investigation of\nthe shape of the correlation functions utilizing L\\'evy-stable sources. In this\npaper, we present a novel method of calculating the shape of the two-particle\ncorrelation functions, including the Coulomb final-state interaction. This\nmethod relies on an exact calculation of a large part of the necessary\nintegrals of the Coulomb wave function and can be utilized to calculate the\ncorrelation function for any source function with an easily accessible Fourier\ntransform. In this way, it is eminently applicable to L\\'evy-stable source\nfunctions. In this particular case, we find that the new method is more robust\nand allows the investigation of a wider parameter range than the previously\nutilized techniques. We present an easily applicable software package that is\nready to use in experimental studies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:26:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nagy","M\u00e1rton",""],["Purzsa","Aletta",""],["Csan\u00e1d","M\u00e1t\u00e9",""],["Kincses","D\u00e1niel",""]]}
{"id":"2308.10746","submitter":"Longyue Li","authors":"Li-Ming Cao, Long-Yue Li, Liang-Bi Wu and Yu-Sen Zhou","title":"The instability of the inner horizon of the quantum-corrected black hole","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"ICTS-USTC/PCFT-23-23","categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyse the stability of the inner horizon of the quantum-corrected black\nhole which is proposed in loop quantum gravity as the exterior of the quantum\nOppenheimer-Snyder and Swiss Cheese models. It is shown that the flux and\nenergy density of a test scalar field measured by free-falling observers are\nboth divergent near the Cauchy horizon. By considering the generalized Dray-'t\nHooft-Redmond relation which is independent of the field equation, we find that\nthe mass inflation always happens and the scalar curvature and Kretschmann\nscalar are also divergent on the inner horizon. These suggest that the inner\nhorizon is unstable and will probably turn into a null singularity. The results\nsupport the strong cosmic censorship hypothesis. However, this also implies\nthat the quantum corrected model may not be the definitive endpoint as a\nregular black hole. Besides, it further proposes that any possible observable\nastronomical phenomenon which depends on the existence of the inner horizon of\nthe black hole is not reliable.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:28:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cao","Li-Ming",""],["Li","Long-Yue",""],["Wu","Liang-Bi",""],["Zhou","Yu-Sen",""]]}
{"id":"2308.10747","submitter":"Tomasz Kami\\'nski Dr","authors":"Tomek Kaminski, Mirek R. Schmidt, Anlaug Amanda Djupvik, Karl M.\n  Menten, Alex Kraus, Krystian I{\\l}kiewicz, Thomas Steinmetz, Muhammad Zain\n  Mobeen, Ryszard Szczerba","title":"A radical transition in the post-main-sequence system U Equulei","comments":"Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  U Equ is an unusual maser-hosting IR source discovered in the 1990s. It was\ntentatively classified as a post-AGB star with a unique optical spectrum\ndisplaying rare emission and absorption features from molecular gas. In 2022,\nwe discovered that its optical spectrum has drastically changed. Methods:\nOptical high-resolution spectra of U Equ from SALT are supplemented by archival\ndata and NIR photometry from NOT. New spectral line observations with the\nEffelsberg telescope and ALMA are presented. Results: No circumstellar\nmolecular features are present in the contemporary optical spectra of U Equ.\nNon-photospheric absorption and emission from neutral and ionized species\ndominate the current spectrum. Some of the observed features indicate an\noutflow with a terminal velocity of 215 km\\s. The H\\&K lines of [Ca II]\nindicate a photosphere of spectral type F. Photometric measurements show that\nthe source has been monotonically increasing its optical and NIR fluxes since\nthe beginning of this century. SEDs at different epochs show dusty\ncircumstellar material arranged in a highly-inclined disk. At a distance of 4\nkpc, the source's luminosity is 10$^4$ L$_{\\odot}$. Conclusions: The object has\nchanged considerably in the last three decades, either due to geometrical\nreconfiguration of the circumstellar medium, evolutionary changes in the\ncentral star, or owing to an accretion event that has started in the system\nvery recently. Observationally, U Equ appears to resemble the Category 0 of\ndisk-hosting post-AGB stars, especially the post-common envelope binary HD\n101584. It is uncertain if the drastic spectral change and the associated\noptical/MIR rise in brightness are common in post-AGB stars but such a radical\nchange may be related to the real-time onset of the evolution of the system\ninto a planetary nebula. We find that the post-AGB star V576 Car has undergone\na similar transformation as U Equ.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:29:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaminski","Tomek",""],["Schmidt","Mirek R.",""],["Djupvik","Anlaug Amanda",""],["Menten","Karl M.",""],["Kraus","Alex",""],["I\u0142kiewicz","Krystian",""],["Steinmetz","Thomas",""],["Mobeen","Muhammad Zain",""],["Szczerba","Ryszard",""]]}
{"id":"2308.10748","submitter":"Pierre Matalon","authors":"Paola F. Antonietti, Pierre Matalon, Marco Verani","title":"Iterative solution to the biharmonic equation in mixed form discretized\n  by the Hybrid High-Order method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We consider the solution to the biharmonic equation in mixed form discretized\nby the Hybrid High-Order (HHO) methods. The two resulting second-order elliptic\nproblems can be decoupled via the introduction of a new unknown, corresponding\nto the boundary value of the solution of the first Laplacian problem. This\ntechnique yields a global linear problem that can be solved iteratively via a\nKrylov-type method. More precisely, at each iteration of the scheme, two\nsecond-order elliptic problems have to be solved, and a normal derivative on\nthe boundary has to be computed. In this work, we specialize this scheme for\nthe HHO discretization. To this aim, an explicit technique to compute the\ndiscrete normal derivative of an HHO solution of a Laplacian problem is\nproposed. Moreover, we show that the resulting discrete scheme is well-posed.\nFinally, a new preconditioner is designed to speed up the convergence of the\nKrylov method. Numerical experiments assessing the performance of the proposed\niterative algorithm on both two- and three-dimensional test cases are\npresented.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:30:06 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:32:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Antonietti","Paola F.",""],["Matalon","Pierre",""],["Verani","Marco",""]]}
{"id":"2308.10749","submitter":"Zach Hunter","authors":"Zach Hunter","title":"On a method of Alweiss","comments":"29 pages. comments encouraged!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.DS math.LO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Alweiss settled Hindman's conjecture over the rationals. In this\npaper, we provide our own exposition of Alweiss' result, and show how to modify\nhis method to also show that sums of distinct products are partition regular\nover the rationals.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:30:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hunter","Zach",""]]}
{"id":"2308.10750","submitter":"Susmita Chowdhury","authors":"Susmita Chowdhury, Victor Hjort, Rui Shu, Grzegorz Greczynski, Arnaud\n  le Febvrier, Per Eklund, and Martin Magnuson","title":"Thermoelectric properties and electronic structure of Cr(Mo,V)Nx thin\n  films studied by synchrotron and lab-based X-ray spectroscopy","comments":"28 pages, 11 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chromium-based nitrides are used in hard, resilient coatings, and show\npromise for thermoelectric applications due to their combination of structural,\nthermal, and electronic properties. Here, we investigated the electronic\nstructures and chemical bonding correlated to the thermoelectric properties of\nepitaxially grown chromium-based multicomponent nitride Cr(Mo,V)Nx thin films.\nDue to minuscule N vacancies, finite population of Cr 3d and N 2p states appear\nat the Fermi level and diminishes the band opening for Cr0.51N0.49.\nIncorporating holes by alloying V in N deficient CrN matrix results in enhanced\nthermoelectric power factor with marginal change in the charge transfer of Cr\nto N compared to Cr0.51N0.49. Further alloying Mo isoelectronic to Cr increases\nthe density of states across the Fermi level due to hybridization of the (Cr,\nV) 3d and Mo 4d-N 2p states in Cr(Mo,V)Nx. The hybridization effect with\nreduced N 2p states off from stoichiometry drives the system towards metal like\nelectrical resistivity and reduction in Seebeck coefficient compensating the\noverall power factor still comparable to Cr0.51N0.49. The N deficiency also\ndepicts a critical role in reduction of the charge transfer from metal to N\nsite. The present work envisages ways for enhancing thermoelectric properties\nthrough electronic band engineering by alloying and competing effects of N\nvacancies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:32:53 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 16:43:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chowdhury","Susmita",""],["Hjort","Victor",""],["Shu","Rui",""],["Greczynski","Grzegorz",""],["Febvrier","Arnaud le",""],["Eklund","Per",""],["Magnuson","Martin",""]]}
{"id":"2308.10751","submitter":"Mengyu Cheng","authors":"Mengyu Cheng, Zhenxin Liu and Michael R\\\"ockner","title":"Averaging principle and normal deviation for multi-scale SDEs with\n  polynomial nonlinearity","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate three types of averaging principles and the normal deviation\nfor multi-scale stochastic differential equations (in short, SDEs) with\npolynomial nonlinearity. More specifically, we first demonstrate the strong\nconvergence of the solution of SDEs, which involves highly oscillating\ncomponents and fast processes, to that of the averaged equation. Then we\ninvestigate the small fluctuations of the system around its average, and show\nthat the normalized difference weakly converges to an Ornstein-Uhlenbeck type\nprocess, which can be viewed as a functional central limit theorem.\nAdditionally, we show that the attractor of the original system tends to that\nof the averaged equation in probability measure space as the time scale\n$\\varepsilon$ goes to zero. Finally, we establish the second Bogolyubov\ntheorem; that is to say, we prove that there exists a quasi-periodic solution\nin a neighborhood of the stationary solution of the averaged equation when the\n$\\varepsilon$ is small.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:32:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cheng","Mengyu",""],["Liu","Zhenxin",""],["R\u00f6ckner","Michael",""]]}
{"id":"2308.10752","submitter":"Stefano Leoni","authors":"Nianze Tao and Hiromi Morimoto and Stefano Leoni","title":"Comprehensive Molecular Representation from Equivariant Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.mtrl-sci physics.atm-clus physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We implement an equivariant transformer that embeds molecular net charge and\nspin state without additional neural network parameters. The model trained on a\nsinglet/triplet non-correlated \\ce{CH2} dataset can identify different spin\nstates and shows state-of-the-art extrapolation capability. We found that\nSoftmax activation function utilised in the self-attention mechanism of graph\nnetworks outperformed ReLU-like functions in prediction accuracy. Additionally,\nincreasing the attention temperature from $\\tau = \\sqrt{d}$ to $\\sqrt{2d}$\nfurther improved the extrapolation capability. We also purposed a weight\ninitialisation method that sensibly accelerated the training process.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:39:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tao","Nianze",""],["Morimoto","Hiromi",""],["Leoni","Stefano",""]]}
{"id":"2308.10753","submitter":"HAL CCSD","authors":"Antonin Chambolle (CEREMADE, MOKAPLAN), Vincent Duval (MOKAPLAN), Joao\n  Miguel Machado (CEREMADE, MOKAPLAN)","title":"The Total Variation-Wasserstein Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we analyze the Total Variation-Wasserstein minimization problem.\nWe propose an alternative form of deriving optimality conditions from the\napproach of Calier\\&Poon'18, and as result obtain further regularity for the\nquantities involved. In the sequel we propose an algorithm to solve this\nproblem alongside two numerical experiments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:40:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chambolle","Antonin","","CEREMADE, MOKAPLAN"],["Duval","Vincent","","MOKAPLAN"],["Machado","Joao Miguel","","CEREMADE, MOKAPLAN"]]}
{"id":"2308.10754","submitter":"Vincent Bertin","authors":"Vincent Bertin","title":"Similarity solutions in elastohydrodynamic bouncing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate theoretically and numerically the impact of an elastic sphere\non a rigid wall in a viscous fluid. Our focus is on the dynamics of the\ncontact, employing the soft lubrication model in which the sphere is separated\nfrom the wall by a thin liquid film. In the limit of large sphere inertia, the\nsphere bounces and the dynamics is close to the Hertz theory. Remarkably, the\nfilm thickness separating the sphere from the wall exhibits non-trivial\nself-similar properties that vary during the spreading and retraction phases.\nLeveraging these self-similar properties, we establish the energy budget and\npredict the coefficient of restitution for the sphere. The general framework\nderived here opens many perspectives to study the lubrication film in impact\nproblems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:40:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bertin","Vincent",""]]}
{"id":"2308.10755","submitter":"Bin Wang","authors":"Conghui He, Zhenjiang Jin, Chao Xu, Jiantao Qiu, Bin Wang, Wei Li,\n  Hang Yan, Jiaqi Wang, Dahua Lin","title":"WanJuan: A Comprehensive Multimodal Dataset for Advancing English and\n  Chinese Large Models","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rise in popularity of ChatGPT and GPT-4 has significantly accelerated the\ndevelopment of large models, leading to the creation of numerous impressive\nlarge language models(LLMs) and multimodal large language models (MLLMs). These\ncutting-edge models owe their remarkable performance to high-quality data.\nHowever, the details of the training data used in leading paradigms are often\nkept confidential. This lack of transparency, coupled with the scarcity of\nopen-source data, impedes further developments within the community. As a\nresponse, this paper presents \"Wan Juan\", a large-scale multimodal dataset\ncomposed of both Chinese and English data, collected from a wide range of web\nsources. The dataset incorporates text, image-text, and video modalities, with\na total volume exceeding 2TB. It was utilized in the training of InternLM, a\nmodel that demonstrated significant advantages in multi-dimensional evaluations\nwhen compared to models of a similar scale. All data can be accessed at\nhttps://opendatalab.org.cn/WanJuan1.0.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:40:48 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 02:57:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Conghui",""],["Jin","Zhenjiang",""],["Xu","Chao",""],["Qiu","Jiantao",""],["Wang","Bin",""],["Li","Wei",""],["Yan","Hang",""],["Wang","Jiaqi",""],["Lin","Dahua",""]]}
{"id":"2308.10756","submitter":"Christian Rosenke","authors":"Van Bang Le, Christian Rosenke","title":"Computing Optimal Leaf Roots of Chordal Cographs in Linear Time","comments":"22 pages, 2 figures, full version of the FCT 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with\nleaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G\nif and only if the distance between x and y in T is at most k. Such a tree T is\ncalled a k-leaf root of G. The computational problem of constructing a k-leaf\nroot for a given graph G and an integer k, if any, is motivated by the\nchallenge from computational biology to reconstruct phylogenetic trees. For\nfixed k, Lafond [SODA 2022] recently solved this problem in polynomial time.\n  In this paper, we propose to study optimal leaf roots of graphs G, that is,\nthe k-leaf roots of G with minimum k value. Thus, all k'-leaf roots of G\nsatisfy k <= k'. In terms of computational biology, seeking optimal leaf roots\nis more justified as they yield more probable phylogenetic trees. Lafond's\nresult does not imply polynomial-time computability of optimal leaf roots,\nbecause, even for optimal k-leaf roots, k may (exponentially) depend on the\nsize of G. This paper presents a linear-time construction of optimal leaf roots\nfor chordal cographs (also known as trivially perfect graphs). Additionally, it\nhighlights the importance of the parity of the parameter k and provides a\ndeeper insight into the differences between optimal k-leaf roots of even versus\nodd k.\n  Keywords: k-leaf power, k-leaf root, optimal k-leaf root, trivially perfect\nleaf power, chordal cograph\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:41:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Le","Van Bang",""],["Rosenke","Christian",""]]}
{"id":"2308.10757","submitter":"Carlo Mazzola","authors":"Carlo Mazzola, Marta Romeo, Francesco Rea, Alessandra Sciutti, Angelo\n  Cangelosi","title":"To Whom are You Talking? A Deep Learning Model to Endow Social Robots\n  with Addressee Estimation Skills","comments":"Accepted version of a paper published at 2023 International Joint\n  Conference on Neural Networks (IJCNN). Please find the published version and\n  info to cite the paper at https://doi.org/10.1109/IJCNN54540.2023.10191452 .\n  10 pages, 8 Figures, 3 Tables","journal-ref":"2023 International Joint Conference on Neural Networks (IJCNN),\n  pp. 1-10","doi":"10.1109/IJCNN54540.2023.10191452","report-no":null,"categories":"cs.LG cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Communicating shapes our social word. For a robot to be considered social and\nbeing consequently integrated in our social environment it is fundamental to\nunderstand some of the dynamics that rule human-human communication. In this\nwork, we tackle the problem of Addressee Estimation, the ability to understand\nan utterance's addressee, by interpreting and exploiting non-verbal bodily cues\nfrom the speaker. We do so by implementing an hybrid deep learning model\ncomposed of convolutional layers and LSTM cells taking as input images\nportraying the face of the speaker and 2D vectors of the speaker's body\nposture. Our implementation choices were guided by the aim to develop a model\nthat could be deployed on social robots and be efficient in ecological\nscenarios. We demonstrate that our model is able to solve the Addressee\nEstimation problem in terms of addressee localisation in space, from a robot\nego-centric point of view.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:43:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mazzola","Carlo",""],["Romeo","Marta",""],["Rea","Francesco",""],["Sciutti","Alessandra",""],["Cangelosi","Angelo",""]]}
{"id":"2308.10758","submitter":"Anxo Perez AnxoPerez","authors":"Anxo P\\'erez, Marcos Fern\\'andez-Pichel, Javier Parapar, David E.\n  Losada","title":"DepreSym: A Depression Symptom Annotated Corpus and the Role of LLMs as\n  Assessors of Psychological Markers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computational methods for depression detection aim to mine traces of\ndepression from online publications posted by Internet users. However,\nsolutions trained on existing collections exhibit limited generalisation and\ninterpretability. To tackle these issues, recent studies have shown that\nidentifying depressive symptoms can lead to more robust models. The eRisk\ninitiative fosters research on this area and has recently proposed a new\nranking task focused on developing search methods to find sentences related to\ndepressive symptoms. This search challenge relies on the symptoms specified by\nthe Beck Depression Inventory-II (BDI-II), a questionnaire widely used in\nclinical practice. Based on the participant systems' results, we present the\nDepreSym dataset, consisting of 21580 sentences annotated according to their\nrelevance to the 21 BDI-II symptoms. The labelled sentences come from a pool of\ndiverse ranking methods, and the final dataset serves as a valuable resource\nfor advancing the development of models that incorporate depressive markers\nsuch as clinical symptoms. Due to the complex nature of this relevance\nannotation, we designed a robust assessment methodology carried out by three\nexpert assessors (including an expert psychologist). Additionally, we explore\nhere the feasibility of employing recent Large Language Models (ChatGPT and\nGPT4) as potential assessors in this complex task. We undertake a comprehensive\nexamination of their performance, determine their main limitations and analyze\ntheir role as a complement or replacement for human annotators.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:44:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["P\u00e9rez","Anxo",""],["Fern\u00e1ndez-Pichel","Marcos",""],["Parapar","Javier",""],["Losada","David E.",""]]}
{"id":"2308.10759","submitter":"Chenyuan Zhang","authors":"Chenyuan Zhang, Yanlin Wang, Zhao Wei, Yong Xu, Juhong Wang, Hui Li\n  and Rongrong Ji","title":"EALink: An Efficient and Accurate Pre-trained Framework for Issue-Commit\n  Link Recovery","comments":"13 pages, 6 figures, published to ASE","journal-ref":"IEEE/ACM International Conference on Automated Software\n  Engineering,2023","doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Issue-commit links, as a type of software traceability links, play a vital\nrole in various software development and maintenance tasks. However, they are\ntypically deficient, as developers often forget or fail to create tags when\nmaking commits. Existing studies have deployed deep learning techniques,\nincluding pretrained models, to improve automatic issue-commit link\nrecovery.Despite their promising performance, we argue that previous approaches\nhave four main problems, hindering them from recovering links in large software\nprojects. To overcome these problems, we propose an efficient and accurate\npre-trained framework called EALink for issue-commit link recovery. EALink\nrequires much fewer model parameters than existing pre-trained methods,\nbringing efficient training and recovery. Moreover, we design various\ntechniques to improve the recovery accuracy of EALink. We construct a\nlarge-scale dataset and conduct extensive experiments to demonstrate the power\nof EALink. Results show that EALink outperforms the state-of-the-art methods by\na large margin (15.23%-408.65%) on various evaluation metrics. Meanwhile, its\ntraining and inference overhead is orders of magnitude lower than existing\nmethods.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:46:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Chenyuan",""],["Wang","Yanlin",""],["Wei","Zhao",""],["Xu","Yong",""],["Wang","Juhong",""],["Li","Hui",""],["Ji","Rongrong",""]]}
{"id":"2308.10760","submitter":"Zhihao Lu","authors":"Zhihao Lu","title":"Liouville theorems and Harnack inequalities for Allen-Cahn type equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We first give a logarithmic gradient estimate for positive solutions of\nAllen-Cahn equation on Riemannian manifolds with Ricci curvature bounded below.\nAs its natural corallary, Harnack inequality and a Liouville theorem for\nclassical positive solutions are obtained. Later, we consider similar estimate\nunder integral curvature condition and generalize previous results to a class\nnonlinear equations which contain some classical elliptic equations such as\nLane-Emden equation, static Whitehead-Newell equation and static Fisher-KPP\nequation. Last, we briefly generalize them to equation with gradient item under\nBakry-\\'{E}mery curvature condition.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:48:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lu","Zhihao",""]]}
{"id":"2308.10761","submitter":"Mingkai Zheng","authors":"Mingkai Zheng, Shan You, Lang Huang, Xiu Su, Fei Wang, Chen Qian,\n  Xiaogang Wang, Chang Xu","title":"CoNe: Contrast Your Neighbours for Supervised Image Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image classification is a longstanding problem in computer vision and machine\nlearning research. Most recent works (e.g. SupCon , Triplet, and max-margin)\nmainly focus on grouping the intra-class samples aggressively and compactly,\nwith the assumption that all intra-class samples should be pulled tightly\ntowards their class centers. However, such an objective will be very hard to\nachieve since it ignores the intra-class variance in the dataset. (i.e.\ndifferent instances from the same class can have significant differences).\nThus, such a monotonous objective is not sufficient. To provide a more\ninformative objective, we introduce Contrast Your Neighbours (CoNe) - a simple\nyet practical learning framework for supervised image classification.\nSpecifically, in CoNe, each sample is not only supervised by its class center\nbut also directly employs the features of its similar neighbors as anchors to\ngenerate more adaptive and refined targets. Moreover, to further boost the\nperformance, we propose ``distributional consistency\" as a more informative\nregularization to enable similar instances to have a similar probability\ndistribution. Extensive experimental results demonstrate that CoNe achieves\nstate-of-the-art performance across different benchmark datasets, network\narchitectures, and settings. Notably, even without a complicated training\nrecipe, our CoNe achieves 80.8\\% Top-1 accuracy on ImageNet with ResNet-50,\nwhich surpasses the recent Timm training recipe (80.4\\%). Code and pre-trained\nmodels are available at\n\\href{https://github.com/mingkai-zheng/CoNe}{https://github.com/mingkai-zheng/CoNe}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:49:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zheng","Mingkai",""],["You","Shan",""],["Huang","Lang",""],["Su","Xiu",""],["Wang","Fei",""],["Qian","Chen",""],["Wang","Xiaogang",""],["Xu","Chang",""]]}
{"id":"2308.10762","submitter":"Javier Mart\\'inez-Aguinaga","authors":"Javier Mart\\'inez-Aguinaga","title":"Existence and classification of maximal growth distributions","comments":"30 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DG math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article tackles the problem of existence and classification of maximal\ngrowth distributions on smooth manifolds. We show that maximal growth\ndistributions of rank$>2$ abide by a full $h$-principle in all dimensions. We\nmake use of M. Gromov's higher order convex integration and, on the way, we\nestablish a new criterion for checking ampleness of a differential relation.\n  As a consequence we answer in the positive, for $k>2$, the long-standing open\nquestion posed by M. Kazarian and B. Shapiro more than 25 years ago in [14] of\nwhether any parallelizable manifold admits a $k$-rank distribution of maximal\ngrowth. We also answer several related open questions.\n  For completeness we show that the differential relation of maximal growth for\nrank-$2$ distributions is not ample in any ambient dimension. Non-ampleness of\nthe Engel and the $(2,3,5)$-conditions follow as particular cases.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:50:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mart\u00ednez-Aguinaga","Javier",""]]}
{"id":"2308.10763","submitter":"Laurel Kaye","authors":"Laurel Kaye, Shreyas Vissapragada, Maximilian N. Gunther, Suzanne\n  Aigrain, Thomas Mikal-Evans, Eric L. N. Jensen, Hannu Parviainen, Francisco\n  J. Pozuelos, Lyu Abe, Jack S. Acton, Abdelkrim Agabi, Douglas R. Alves, David\n  R. Anderson, David J. Armstrong, Khalid Barkaoui, Oscar Barragan, Bjorn\n  Benneke, Patricia T. Bo yd, Rafael Brahm, Ivan Bruni, Edward M. Bryant,\n  Matthew R. Burleigh, Sarah L. Casewell, David Ciardi, Ryan Cloutier, Karen A.\n  Collins, Kevin I. Collins, Dennis M. Conti, Ian J. M. Crossfield, Nicolas\n  Crouzet, Tansu Daylan, Diana Dragomir, Georgina Dransfield, Daniel F abrycky,\n  Michael Fausnaugh, Gabor Fuuresz, Tianjun Gan, Samuel Gill, Michael Gillon,\n  Michael R Goad, Varoujan Gorjian, Michael Greklek-McKeon, Natalia Guerrero,\n  Tristan Guillot, Emmanuel Jehin, J. S. Jenkins, Monika Lendl, Jacob Kamler,\n  Stephen R. Kane, John F. Kielkopf, Michelle Kunimoto, Wenceslas Marie-Sainte,\n  James McCormac, Djamel Mekarnia, Farisa Y. Morales, Maximiliano Moyano, Enric\n  Palle, Vivien Parmentier, Howard M. Relles, Francois-Xavier Schmider, Richard\n  P. Schwarz, S. Seager, Alexis M. S. Smith, Thiam-Guan Tan, Jake Taylor,\n  Amaury H. M. J. Triaud, Joseph D. Twicken, Stephane Udry, J. I. Vines, Gavin\n  Wang, Peter J. Wheatley, Joshua N. Winn","title":"Transit Timing Variations in the three-planet system: TOI-270","comments":"22 pages, 7 figures","journal-ref":"Monthly Notices of the Royal Astronomical Society, Volume 510,\n  Issue 4, pp.5464-5485 (2022)","doi":"10.1093/mnras/stab3483","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present ground and space-based photometric observations of TOI-270\n(L231-32), a system of three transiting planets consisting of one super-Earth\nand two sub-Neptunes discovered by TESS around a bright (K-mag=8.25) M3V dwarf.\nThe planets orbit near low-order mean-motion resonances (5:3 and 2:1), and are\nthus expected to exhibit large transit timing variations (TTVs). Following an\nextensive observing campaign using 8 different observatories between 2018 and\n2020, we now report a clear detection of TTVs for planets c and d, with\namplitudes of $\\sim$10 minutes and a super-period of $\\sim$3 years, as well as\nsignificantly refined estimates of the radii and mean orbital periods of all\nthree planets.\n  Dynamical modeling of the TTVs alone puts strong constraints on the mass\nratio of planets c and d and on their eccentricities. When incorporating\nrecently published constraints from radial velocity observations, we obtain\nmasses of $M_{\\mathrm{b}}=1.48\\pm0.18\\,M_\\oplus$, $M_{c}=6.20\\pm0.31\\,M_\\oplus$\nand $M_{\\mathrm{d}}=4.20\\pm0.16\\,M_\\oplus$ for planets b, c and d,\nrespectively. We also detect small, but significant eccentricities for all\nthree planets : $e_\\mathrm{b} =0.0167\\pm0.0084$, $e_{c} =0.0044\\pm0.0006$ and\n$e_{d} = 0.0066\\pm0.0020$. Our findings imply an Earth-like rocky composition\nfor the inner planet, and Earth-like cores with an additional He/H$_2$O\natmosphere for the outer two. TOI-270 is now one of the best-constrained\nsystems of small transiting planets, and it remains an excellent target for\natmospheric characterization.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:52:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Kaye","Laurel",""],["Vissapragada","Shreyas",""],["Gunther","Maximilian N.",""],["Aigrain","Suzanne",""],["Mikal-Evans","Thomas",""],["Jensen","Eric L. N.",""],["Parviainen","Hannu",""],["Pozuelos","Francisco J.",""],["Abe","Lyu",""],["Acton","Jack S.",""],["Agabi","Abdelkrim",""],["Alves","Douglas R.",""],["Anderson","David R.",""],["Armstrong","David J.",""],["Barkaoui","Khalid",""],["Barragan","Oscar",""],["Benneke","Bjorn",""],["yd","Patricia T. Bo",""],["Brahm","Rafael",""],["Bruni","Ivan",""],["Bryant","Edward M.",""],["Burleigh","Matthew R.",""],["Casewell","Sarah L.",""],["Ciardi","David",""],["Cloutier","Ryan",""],["Collins","Karen A.",""],["Collins","Kevin I.",""],["Conti","Dennis M.",""],["Crossfield","Ian J. M.",""],["Crouzet","Nicolas",""],["Daylan","Tansu",""],["Dragomir","Diana",""],["Dransfield","Georgina",""],["abrycky","Daniel F",""],["Fausnaugh","Michael",""],["Fuuresz","Gabor",""],["Gan","Tianjun",""],["Gill","Samuel",""],["Gillon","Michael",""],["Goad","Michael R",""],["Gorjian","Varoujan",""],["Greklek-McKeon","Michael",""],["Guerrero","Natalia",""],["Guillot","Tristan",""],["Jehin","Emmanuel",""],["Jenkins","J. S.",""],["Lendl","Monika",""],["Kamler","Jacob",""],["Kane","Stephen R.",""],["Kielkopf","John F.",""],["Kunimoto","Michelle",""],["Marie-Sainte","Wenceslas",""],["McCormac","James",""],["Mekarnia","Djamel",""],["Morales","Farisa Y.",""],["Moyano","Maximiliano",""],["Palle","Enric",""],["Parmentier","Vivien",""],["Relles","Howard M.",""],["Schmider","Francois-Xavier",""],["Schwarz","Richard P.",""],["Seager","S.",""],["Smith","Alexis M. S.",""],["Tan","Thiam-Guan",""],["Taylor","Jake",""],["Triaud","Amaury H. M. J.",""],["Twicken","Joseph D.",""],["Udry","Stephane",""],["Vines","J. I.",""],["Wang","Gavin",""],["Wheatley","Peter J.",""],["Winn","Joshua N.",""]]}
{"id":"2308.10764","submitter":"Md Rafique Un Nabi","authors":"Md Rafique Un Nabi, Rabindra Basnet, Krishna Pandey, Santosh Karki\n  Chhetri, Dinesh Upreti, Gokul Acharya, Fei Wang, Arash Fereidouni, Hugh O. H.\n  Churchill, Yingdong Guan, Zhiqiang Mao, Jin Hu","title":"Coupling Between Magnetic and Transport Properties in Magnetic Layered\n  Material Mn2-xZnxSb","comments":"23 pages, 5 figures, Figures are at the end of the manuscript","journal-ref":"Acta Materialia (2023): 119251","doi":"10.1016/j.actamat.2023.119251","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We synthesized single crystals for Mn2-xZnxSb and studied their magnetic and\nelectronic transport properties. This material system displays rich magnetic\nphase tunable with temperature and Zn composition. In addition, two groups of\ndistinct magnetic and electronic properties, separated by a critical Zn\ncomposition of x = 0.6, are discovered. The Zn-less samples are metallic and\ncharacterized by a resistivity jump at the magnetic ordering temperature, while\nthe Zn-rich samples lose metallicity and show a metal-to-insulator\ntransition-like feature tunable by magnetic field. Our findings establish\nMn2-xZnxSb as a promising material platform that offers opportunities to study\nhow the coupling of spin, charge, and lattice degrees of freedom governs\ninteresting transport properties in 2D magnets, which is currently a topic of\nbroad interest.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:53:24 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Nabi","Md Rafique Un",""],["Basnet","Rabindra",""],["Pandey","Krishna",""],["Chhetri","Santosh Karki",""],["Upreti","Dinesh",""],["Acharya","Gokul",""],["Wang","Fei",""],["Fereidouni","Arash",""],["Churchill","Hugh O. H.",""],["Guan","Yingdong",""],["Mao","Zhiqiang",""],["Hu","Jin",""]]}
{"id":"2308.10765","submitter":"Taisei Takabayashi","authors":"Taisei Takabayashi, Masayuki Ohzeki","title":"Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The demand for classical-quantum hybrid algorithms to solve large-scale\ncombinatorial optimization problems using quantum annealing (QA) has increased.\nOne approach involves obtaining an approximate solution using classical\nalgorithms and refining it using QA. In previous studies, such variables were\ndetermined using molecular dynamics (MD) as a continuous optimization method.\nWe propose a method that uses the simple continuous relaxation technique called\nlinear programming (LP) relaxation. Our method demonstrated superiority through\ncomparative experiments with the minimum vertex cover problem versus the\nprevious MD-based approach. Furthermore, the hybrid approach of LP relaxation\nand simulated annealing showed advantages in accuracy and speed compared to\nsolving with simulated annealing alone.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:53:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Takabayashi","Taisei",""],["Ohzeki","Masayuki",""]]}
{"id":"2308.10766","submitter":"Stephen G. Low","authors":"Stephen G. Low","title":"Jacobi Group Symmetry of Hamilton's Mechanics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that the diffeomorphisms of an extended phase space with time,\nenergy, momentum and position degrees of freedom that leave invariant the\nsymplectic 2-form and and a degenerate orthogonal metric dt^2 locally satisfy\nHamilton's equations up to the usual canonical transformations on the\nposition-momentum subspace.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:56:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Low","Stephen G.",""]]}
{"id":"2308.10767","submitter":"Qi Deng","authors":"Zhenwei Lin, Qi Deng","title":"GBM-based Bregman Proximal Algorithms for Constrained Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the complexity of learning tasks surges, modern machine learning\nencounters a new constrained learning paradigm characterized by more intricate\nand data-driven function constraints. Prominent applications include\nNeyman-Pearson classification (NPC) and fairness classification, which entail\nspecific risk constraints that render standard projection-based training\nalgorithms unsuitable. Gradient boosting machines (GBMs) are among the most\npopular algorithms for supervised learning; however, they are generally limited\nto unconstrained settings. In this paper, we adapt the GBM for constrained\nlearning tasks within the framework of Bregman proximal algorithms. We\nintroduce a new Bregman primal-dual method with a global optimality guarantee\nwhen the learning objective and constraint functions are convex. In cases of\nnonconvex functions, we demonstrate how our algorithm remains effective under a\nBregman proximal point framework. Distinct from existing constrained learning\nalgorithms, ours possess a unique advantage in their ability to seamlessly\nintegrate with publicly available GBM implementations such as XGBoost (Chen and\nGuestrin, 2016) and LightGBM (Ke et al., 2017), exclusively relying on their\npublic interfaces. We provide substantial experimental evidence to showcase the\neffectiveness of the Bregman algorithm framework. While our primary focus is on\nNPC and fairness ML, our framework holds significant potential for a broader\nrange of constrained learning applications. The source code is currently freely\navailable at\nhttps://github.com/zhenweilin/ConstrainedGBM}{https://github.com/zhenweilin/ConstrainedGBM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:56:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lin","Zhenwei",""],["Deng","Qi",""]]}
{"id":"2308.10768","submitter":"Johannes Christensen","authors":"Johannes Christensen and Sergey Neshveyev","title":"Isotropy fibers of ideals in groupoid C$^{*}$-algebras","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a locally compact \\'etale groupoid and an ideal $I$ in its groupoid\nC$^*$-algebra, we show that $I$ defines a family of ideals in group\nC$^*$-algebras of the isotropy groups and then study to which extent $I$ is\ndetermined by this family. As an application we obtain the following results:\n(a) prove that every proper ideal is contained in an induced primitive ideal;\n(b) describe the maximal ideals; (c) classify the primitive ideals for a class\nof graded groupoids with essentially central isotropy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:57:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Christensen","Johannes",""],["Neshveyev","Sergey",""]]}
{"id":"2308.10769","submitter":"Pei-Ying Huo","authors":"Pei-Ying Huo, Wei-Zhou Jiang, Rong-Yao Yang and Xiu-Rong Zhang","title":"Dynamic Evolution of S$_0$$\\sim$S$_3$ at the Oxygen Evolving Complex\n  with the Spin Marker under the Photoelectric Polarization","comments":"8 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Water oxidation in the oxygen evolving complex (OEC) of the photosystem II is\ncatalyzed by the core cluster CaMn$_4$O$_5$ which was projected to experience\nfive intermediate states S($\\rm_i$) in the Kok's cycle since 1970's. However,\nthe detailed dynamics of state evolutions still remains unclear, albeit with\nthe general fact that the process is initiated by the transfer of\nphotoelectrons with the steady electron donors of the water molecules. Based on\ndensity functional simulations, we find that the spin flips of Manganese atoms\nbetween the consecutive states in the electric polarization field can be used\nas a marker to uncover the intricate dynamic evolutions and the underlying\ndynamics. The dynamic electron and proton transfers and water insertion and\ndissociation are traced to reveal the evolution pathways of S$_0$$\\sim$S$_3$\nwith commensurate spin flips towards the exact spin configuration of the next\nstate. In particular, the various water insertions and dissociations at\ncoordination sites of the S$_2$ open and closed cubane isomers are predicted\nwith constraints on the necessary spin flips. Our study lays a solid ground for\ngetting through the whole Kok's cycle via the pending S$_4$ state that is\ncrucial for dioxygen generation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:59:06 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huo","Pei-Ying",""],["Jiang","Wei-Zhou",""],["Yang","Rong-Yao",""],["Zhang","Xiu-Rong",""]]}
{"id":"2308.10770","submitter":"Zhouyu Zhang","authors":"Zhouyu Zhang, Jia Shen, Junhyoung Ha, Yue Chen","title":"Toward Extending Concentric Tube Robot Kinematics for Large Clearance\n  and Impulse Curvature","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Concentric Tube Robots (CTRs) have been proposed to operate within the\nunstructured environment for minimally invasive surgeries. In this letter, we\nconsider the operation scenario where the tubes travel inside the channels with\na large clearance or large curvature, such as aortas or industrial pipes.\nAccurate kinematic modeling of CTRs is required for the development of advanced\ncontrol and sensing algorithms. To this end, we extended the conventional CTR\nkinematics model to a more general case with large tube-to-tube clearance and\nlarge centerline curvature. Numerical simulations and experimental validations\nare conducted to compare our model with respect to the conventional CTR\nkinematic model. In the physical experiments, our proposed model achieved a tip\nposition error of 1.53 mm in the 2D planer case and 4.36 mm in 3D case,\noutperforming the state-of-the-art model by 71% and 66%, respectively.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:00:42 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Zhouyu",""],["Shen","Jia",""],["Ha","Junhyoung",""],["Chen","Yue",""]]}
{"id":"2308.10771","submitter":"Tamas Vertesi","authors":"Istv\\'an M\\'arton, Erika Bene, P\\'eter Divi\\'anszky, Tam\\'as V\\'ertesi","title":"Beating one bit of communication with and without quantum\n  pseudo-telepathy","comments":"11 pages, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  According to Bell's theorem, certain entangled states cannot be simulated\nclassically using local hidden variables (LHV). But if can we augment LHV by\nclassical communication, how many bits are needed to simulate them? There is a\nstrong evidence that a single bit of communication is powerful enough to\nsimulate projective measurements on any two-qubit entangled state. In this\nstudy, we present Bell-like scenarios where bipartite correlations resulting\nfrom projective measurements on higher dimensional states cannot be simulated\nwith a single bit of communication. These include a three-input, a four-input,\na seven-input, and a 63-input bipartite Bell-like inequality with 80089, 64,\n16, and 2 outputs, respectively. Two copies of emblematic Bell expressions,\nsuch as the Magic square pseudo-telepathy game, prove to be particularly\npowerful, requiring a $16\\times 16$ state to beat the one-bit classical bound,\nand look a promising candidate for implementation on an optical platform.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:01:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["M\u00e1rton","Istv\u00e1n",""],["Bene","Erika",""],["Divi\u00e1nszky","P\u00e9ter",""],["V\u00e9rtesi","Tam\u00e1s",""]]}
{"id":"2308.10772","submitter":"Mohammad Mahdi Abedi","authors":"Mohammad Mahdi Abedi, David Pardo, Tariq Alkhalifah","title":"Semi-blind-trace algorithm for self-supervised attenuation of trace-wise\n  coherent noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Trace-wise noise is a type of noise often seen in seismic data, which is\ncharacterized by vertical coherency and horizontal incoherency. Using\nself-supervised deep learning to attenuate this type of noise, the conventional\nblind-trace deep learning trains a network to blindly reconstruct each trace in\nthe data from its surrounding traces; it attenuates isolated trace-wise noise\nbut causes signal leakage in clean and noisy traces and reconstruction errors\nnext to each noisy trace. To reduce signal leakage and improve denoising, we\npropose a new loss function and masking procedure in semi-blind-trace deep\nlearning. Our hybrid loss function has weighted active zones that cover masked\nand non-masked traces. Therefore, the network is not blinded to clean traces\nduring their reconstruction. During training, we dynamically change the masks'\ncharacteristics. The goal is to train the network to learn the characteristics\nof the signal instead of noise. The proposed algorithm enables the designed\nU-net to detect and attenuate trace-wise noise without having prior information\nabout the noise. A new hyperparameter of our method is the relative weight\nbetween the masked and non-masked traces' contribution to the loss function.\nNumerical experiments show that selecting a small value for this parameter is\nenough to significantly decrease signal leakage. The proposed algorithm is\ntested on synthetic and real off-shore and land datasets with different noises.\nThe results show the superb ability of the method to attenuate trace-wise noise\nwhile preserving other events. An implementation of the proposed algorithm as a\nPython code is also made available.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:02:34 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 13:23:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Abedi","Mohammad Mahdi",""],["Pardo","David",""],["Alkhalifah","Tariq",""]]}
{"id":"2308.10773","submitter":"Patrik \\v{S}van\\v{c}ara","authors":"Patrik \\v{S}van\\v{c}ara, Pietro Smaniotto, Leonardo Solidoro, James F.\n  MacDonald, Sam Patrick, Ruth Gregory, Carlo F. Barenghi, Silke Weinfurtner","title":"Exploring the Quantum-to-Classical Vortex Flow: Quantum Field Theory\n  Dynamics on Rotating Curved Spacetimes","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gravity simulators offer the prospect of emulating quantum field dynamics on\ncurved spacetime, including that of a black hole, in tabletop experiments.\nSince black holes in nature spin, to simulate a realistic black hole we must be\nable to achieve rotation - crucially requiring a set-up with at least 2+1\ndimensions. Here, we report on the realisation of a draining flow of superfluid\nhelium, with the most extensive stable vortex structures ever observed in a\nquantum fluid. Our non-contact 3-D measurement technique visualises\nmicrometre-scale interface waves on the superfluid vortex flow, uncovering\nnovel wave-vortex interactions, such as intricate patterns like bound states,\nand even, potentially, black hole ringdown signatures. This novel approach\nprovides an arena to explore quantum-to-classical vortex flow transitions and\ndevelop finite temperature quantum field theory simulators for rotating curved\nspacetimes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:04:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["\u0160van\u010dara","Patrik",""],["Smaniotto","Pietro",""],["Solidoro","Leonardo",""],["MacDonald","James F.",""],["Patrick","Sam",""],["Gregory","Ruth",""],["Barenghi","Carlo F.",""],["Weinfurtner","Silke",""]]}
{"id":"2308.10774","submitter":"Qili Li","authors":"Namrata Bansal, Qili Li, Paul Nufer, Lichuan Zhang, Amir-Abbas\n  Haghighirad, Yuriy Mokrousov, and Wulf Wulfhekel","title":"Magnon-Phonon coupling in Fe$_3$GeTe$_2$","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the dynamic coupling of magnons and phonons in single crystals of\nFe3GeTe2 (FGT) using inelastic scanning tunneling spectroscopy (ISTS) with an\nultra-low temperature scanning tunneling microscope. Inelastic scattering of\nhot carriers off phonons or magnons has been widely studied using ISTS, and we\nuse it to demonstrate strong magnon-phonon coupling in FGT. We show a strong\ninteraction between magnons and acoustic phonons which leads to formation of\nvan Hove singularities originating in avoided level crossings and hybridization\nbetween the magnonic and phononic bands in this material. We identify these\nadditional hybridization points in experiments and compare their energy with\ndensity functional theory calculations. Our findings provide a platform for\ndesigning the properties of dynamic magnon-phonon coupling in two-dimensional\nmaterials.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:04:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bansal","Namrata",""],["Li","Qili",""],["Nufer","Paul",""],["Zhang","Lichuan",""],["Haghighirad","Amir-Abbas",""],["Mokrousov","Yuriy",""],["Wulfhekel","Wulf",""]]}
{"id":"2308.10775","submitter":"Bendeguz Offertaler","authors":"Simone Giombi, Shota Komatsu, Bendeguz Offertaler, Jieru Shan","title":"Boundary reparametrizations and six-point functions on the AdS$_2$\n  string","comments":"52 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the tree-level connected six-point function of identical scalar\nfluctuations of the AdS$_2$ string worldsheet dual to the half-BPS Wilson line\nin planar ${\\cal N}=4$ Super Yang-Mills. The calculation can be carried out\nanalytically in the conformal gauge approach, where the boundary\nreparametrization mode of the string plays a crucial role. We also study the\nanalytic continuation of the six-point function to an out-of-time-order\nconfiguration, which is related to a 3-to-3 scattering amplitude in flat space.\nAs a check of our results, we also numerically compute the six-point function\nusing the Nambu-Goto action in static gauge, finding agreement with the\nconformal gauge answer.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:05:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Giombi","Simone",""],["Komatsu","Shota",""],["Offertaler","Bendeguz",""],["Shan","Jieru",""]]}
{"id":"2308.10776","submitter":"Jan Brabec","authors":"Jan Brabec, Filip \\v{S}rajer, Radek Starosta, Tom\\'a\\v{s} Sixta, Marc\n  Dupont, Milo\\v{s} Lenoch, Ji\\v{r}\\'i Men\\v{s}\\'ik, Florian Becker, Jakub\n  Boros, Tom\\'a\\v{s} Pop, Pavel Nov\\'ak","title":"A Modular and Adaptive System for Business Email Compromise Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growing sophistication of Business Email Compromise (BEC) and spear\nphishing attacks poses significant challenges to organizations worldwide. The\ntechniques featured in traditional spam and phishing detection are insufficient\ndue to the tailored nature of modern BEC attacks as they often blend in with\nthe regular benign traffic. Recent advances in machine learning, particularly\nin Natural Language Understanding (NLU), offer a promising avenue for combating\nsuch attacks but in a practical system, due to limitations such as data\navailability, operational costs, verdict explainability requirements or a need\nto robustly evolve the system, it is essential to combine multiple approaches\ntogether. We present CAPE, a comprehensive and efficient system for BEC\ndetection that has been proven in a production environment for a period of over\ntwo years. Rather than being a single model, CAPE is a system that combines\nindependent ML models and algorithms detecting BEC-related behaviors across\nvarious email modalities such as text, images, metadata and the email's\ncommunication context. This decomposition makes CAPE's verdicts naturally\nexplainable. In the paper, we describe the design principles and constraints\nbehind its architecture, as well as the challenges of model design, evaluation\nand adapting the system continuously through a Bayesian approach that combines\nlimited data with domain knowledge. Furthermore, we elaborate on several\nspecific behavioral detectors, such as those based on Transformer neural\narchitectures.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:06:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Brabec","Jan",""],["\u0160rajer","Filip",""],["Starosta","Radek",""],["Sixta","Tom\u00e1\u0161",""],["Dupont","Marc",""],["Lenoch","Milo\u0161",""],["Men\u0161\u00edk","Ji\u0159\u00ed",""],["Becker","Florian",""],["Boros","Jakub",""],["Pop","Tom\u00e1\u0161",""],["Nov\u00e1k","Pavel",""]]}
{"id":"2308.10777","submitter":"Elif Hocaoglu","authors":"Tugce Ersoy, P{\\i}nar Kaya, Elif Hocaoglu, Ramazan Unal","title":"I-BaR: Integrated Balance Rehabilitation Framework","comments":"37 pages, 2 figures, journal paper","journal-ref":"BMC Sports Science, Medicine and Rehabilitation, 2023","doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Neurological diseases are observed in approximately one billion people\nworldwide. A further increase is foreseen at the global level as a result of\npopulation growth and aging. Individuals with neurological disorders often\nexperience cognitive, motor, sensory, and lower extremity dysfunctions. Thus,\nthe possibility of falling and balance problems arise due to the postural\ncontrol deficiencies that occur as a result of the deterioration in the\nintegration of multi-sensory information. We propose a novel rehabilitation\nframework, Integrated Balance Rehabilitation (I-BaR), to improve the\neffectiveness of the rehabilitation with objective assessment, individualized\ntherapy, convenience with different disability levels and adoption of an\nassist-as-needed paradigm and, with an integrated rehabilitation process as a\nwhole, i.e., ankle-foot preparation, balance, and stepping phases,\nrespectively. Integrated Balance Rehabilitation allows patients to improve\ntheir balance ability by providing multi-modal feedback: visual via utilization\nof Virtual Reality; vestibular via anteroposterior and mediolateral\nperturbations with the robotic platform; proprioceptive via haptic feedback.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:06:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ersoy","Tugce",""],["Kaya","P\u0131nar",""],["Hocaoglu","Elif",""],["Unal","Ramazan",""]]}
{"id":"2308.10778","submitter":"Daniele Malitesta","authors":"Daniele Malitesta, Claudio Pomo, Vito Walter Anelli, Alberto Carlo\n  Maria Mancino, Eugenio Di Sciascio, Tommaso Di Noia","title":"A Topology-aware Analysis of Graph Collaborative Filtering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The successful integration of graph neural networks into recommender systems\n(RSs) has led to a novel paradigm in collaborative filtering (CF), graph\ncollaborative filtering (graph CF). By representing user-item data as an\nundirected, bipartite graph, graph CF utilizes short- and long-range\nconnections to extract collaborative signals that yield more accurate user\npreferences than traditional CF methods. Although the recent literature\nhighlights the efficacy of various algorithmic strategies in graph CF, the\nimpact of datasets and their topological features on recommendation performance\nis yet to be studied. To fill this gap, we propose a topology-aware analysis of\ngraph CF. In this study, we (i) take some widely-adopted recommendation\ndatasets and use them to generate a large set of synthetic sub-datasets through\ntwo state-of-the-art graph sampling methods, (ii) measure eleven of their\nclassical and topological characteristics, and (iii) estimate the accuracy\ncalculated on the generated sub-datasets considering four popular and recent\ngraph-based RSs (i.e., LightGCN, DGCF, UltraGCN, and SVD-GCN). Finally, the\ninvestigation presents an explanatory framework that reveals the linear\nrelationships between characteristics and accuracy measures. The results,\nstatistically validated under different graph sampling settings, confirm the\nexistence of solid dependencies between topological characteristics and\naccuracy in the graph-based recommendation, offering a new perspective on how\nto interpret graph CF.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:09:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Malitesta","Daniele",""],["Pomo","Claudio",""],["Anelli","Vito Walter",""],["Mancino","Alberto Carlo Maria",""],["Di Sciascio","Eugenio",""],["Di Noia","Tommaso",""]]}
{"id":"2308.10779","submitter":"Dongjin Lee","authors":"Dongjin Lee, Juho Lee, Kijung Shin","title":"Spear and Shield: Adversarial Attacks and Defense Methods for\n  Model-Based Link Prediction on Continuous-Time Dynamic Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-world graphs are dynamic, constantly evolving with new interactions,\nsuch as financial transactions in financial networks. Temporal Graph Neural\nNetworks (TGNNs) have been developed to effectively capture the evolving\npatterns in dynamic graphs. While these models have demonstrated their\nsuperiority, being widely adopted in various important fields, their\nvulnerabilities against adversarial attacks remain largely unexplored. In this\npaper, we propose T-SPEAR, a simple and effective adversarial attack method for\nlink prediction on continuous-time dynamic graphs, focusing on investigating\nthe vulnerabilities of TGNNs. Specifically, before the training procedure of a\nvictim model, which is a TGNN for link prediction, we inject edge perturbations\nto the data that are unnoticeable in terms of the four constraints we propose,\nand yet effective enough to cause malfunction of the victim model. Moreover, we\npropose a robust training approach T-SHIELD to mitigate the impact of\nadversarial attacks. By using edge filtering and enforcing temporal smoothness\nto node embeddings, we enhance the robustness of the victim model. Our\nexperimental study shows that T-SPEAR significantly degrades the victim model's\nperformance on link prediction tasks, and even more, our attacks are\ntransferable to other TGNNs, which differ from the victim model assumed by the\nattacker. Moreover, we demonstrate that T-SHIELD effectively filters out\nadversarial edges and exhibits robustness against adversarial attacks,\nsurpassing the link prediction performance of the naive TGNN by up to 11.2%\nunder T-SPEAR.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:09:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lee","Dongjin",""],["Lee","Juho",""],["Shin","Kijung",""]]}
{"id":"2308.10780","submitter":"Minh Tam Pham Nguyen","authors":"Minh Tam, Sebastiano Peotta","title":"Superfluid weight in the isolated band limit within the generalized\n  random phase approximation","comments":"28 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The superfluid weight of a generic lattice model with attractive Hubbard\ninteraction is computed analytically in the isolated band limit within the\ngeneralized random phase approximation. Time-reversal symmetry, spin rotational\nsymmetry, and the uniform pairing condition are assumed. It is found that the\nrelation obtained in [https://link.aps.org/doi/10.1103/PhysRevB.106.014518]\nbetween the superfluid weight in the flat band limit and the so-called minimal\nquantum metric is valid even at the level of the generalized random phase\napproximation. For an isolated, but not necessarily flat, band it is found that\nthe correction to the superfluid weight obtained from the generalized random\nphase approximation $D_{\\rm s}^{(1)} = D_{\\rm s,c}^{(1)}+D_{\\rm s,g}^{(1)}$ is\nalso the sum of a conventional contribution $D_{\\rm s,c}^{(1)}$ and a geometric\ncontribution $D_{\\rm s,g}^{(1)}$, as in the case of the known mean-field result\n$D_{\\rm s}^{(0)}=D_{\\rm s,c}^{(0)}+D_{\\rm s,g}^{(0)}$, in which the geometric\nterm $D_{\\rm s,g}^{(0)}$ is a weighted average of the quantum metric. The\nconventional contribution is geometry independent, that is independent of the\norbital positions, while it is possible to find a preferred, or natural, set of\norbital positions such that $D_{\\rm s,g}^{(1)}=0$. Useful analytic expressions\nare derived for both the natural orbital positions and the minimal quantum\nmetric, including its extension to bands that are not necessarily flat.\nFinally, using some simple examples, it is argued that the natural orbital\npositions may lead to a more refined classification of the topological\nproperties of the band structure.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:11:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tam","Minh",""],["Peotta","Sebastiano",""]]}
{"id":"2308.10781","submitter":"Swati Gupta","authors":"Mehak Arora, Hassan Mortagy, Nathan Dwarshius, Swati Gupta, Andre L.\n  Holder, Rishikesan Kamaleswaran","title":"Mixed-Integer Projections for Automated Data Correction of EMRs Improve\n  Predictions of Sepsis among Hospitalized Patients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) models are increasingly pivotal in automating clinical\ndecisions. Yet, a glaring oversight in prior research has been the lack of\nproper processing of Electronic Medical Record (EMR) data in the clinical\ncontext for errors and outliers. Addressing this oversight, we introduce an\ninnovative projections-based method that seamlessly integrates clinical\nexpertise as domain constraints, generating important meta-data that can be\nused in ML workflows. In particular, by using high-dimensional mixed-integer\nprograms that capture physiological and biological constraints on patient\nvitals and lab values, we can harness the power of mathematical \"projections\"\nfor the EMR data to correct patient data. Consequently, we measure the distance\nof corrected data from the constraints defining a healthy range of patient\ndata, resulting in a unique predictive metric we term as \"trust-scores\". These\nscores provide insight into the patient's health status and significantly boost\nthe performance of ML classifiers in real-life clinical settings. We validate\nthe impact of our framework in the context of early detection of sepsis using\nML. We show an AUROC of 0.865 and a precision of 0.922, that surpasses\nconventional ML models without such projections.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:14:49 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Arora","Mehak",""],["Mortagy","Hassan",""],["Dwarshius","Nathan",""],["Gupta","Swati",""],["Holder","Andre L.",""],["Kamaleswaran","Rishikesan",""]]}
{"id":"2308.10782","submitter":"Konstantinos P. Panousis","authors":"Konstantinos P. Panousis, Dino Ienco, Diego Marcos","title":"Sparse Linear Concept Discovery Models","comments":"Accepted @ ICCVW CLVL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent mass adoption of DNNs, even in safety-critical scenarios, has\nshifted the focus of the research community towards the creation of inherently\nintrepretable models. Concept Bottleneck Models (CBMs) constitute a popular\napproach where hidden layers are tied to human understandable concepts allowing\nfor investigation and correction of the network's decisions. However, CBMs\nusually suffer from: (i) performance degradation and (ii) lower\ninterpretability than intended due to the sheer amount of concepts contributing\nto each decision. In this work, we propose a simple yet highly intuitive\ninterpretable framework based on Contrastive Language Image models and a single\nsparse linear layer. In stark contrast to related approaches, the sparsity in\nour framework is achieved via principled Bayesian arguments by inferring\nconcept presence via a data-driven Bernoulli distribution. As we experimentally\nshow, our framework not only outperforms recent CBM approaches accuracy-wise,\nbut it also yields high per example concept sparsity, facilitating the\nindividual investigation of the emerging concepts.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:16:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Panousis","Konstantinos P.",""],["Ienco","Dino",""],["Marcos","Diego",""]]}
{"id":"2308.10783","submitter":"Md. Arid Hasan","authors":"Md. Arid Hasan, Shudipta Das, Afiyat Anjum, Firoj Alam, Anika Anjum,\n  Avijit Sarker, Sheak Rashed Haider Noori","title":"Zero- and Few-Shot Prompting with LLMs: A Comparative Study with\n  Fine-tuned Models for Bangla Sentiment Analysis","comments":"Zero-Shot Prompting, Few-Shot Prompting, LLMs, Comparative Study,\n  Fine-tuned Models, Bangla, Sentiment Analysis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The rapid expansion of the digital world has propelled sentiment analysis\ninto a critical tool across diverse sectors such as marketing, politics,\ncustomer service, and healthcare. While there have been significant\nadvancements in sentiment analysis for widely spoken languages, low-resource\nlanguages, such as Bangla, remain largely under-researched due to resource\nconstraints. Furthermore, the recent unprecedented performance of Large\nLanguage Models (LLMs) in various applications highlights the need to evaluate\nthem in the context of low-resource languages. In this study, we present a\nsizeable manually annotated dataset encompassing 33,605 Bangla news tweets and\nFacebook comments. We also investigate zero- and few-shot in-context learning\nwith several language models, including Flan-T5, GPT-4, and Bloomz, offering a\ncomparative analysis against fine-tuned models. Our findings suggest that\nmonolingual transformer-based models consistently outperform other models, even\nin zero and few-shot scenarios. To foster continued exploration, we intend to\nmake this dataset and our research tools publicly available to the broader\nresearch community. In the spirit of further research, we plan to make this\ndataset and our experimental resources publicly accessible to the wider\nresearch community.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:19:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hasan","Md. Arid",""],["Das","Shudipta",""],["Anjum","Afiyat",""],["Alam","Firoj",""],["Anjum","Anika",""],["Sarker","Avijit",""],["Noori","Sheak Rashed Haider",""]]}
{"id":"2308.10784","submitter":"Soorena Salari","authors":"Soorena Salari, Amirhossein Rasoulian, Hassan Rivaz, Yiming Xiao","title":"Dense Error Map Estimation for MRI-Ultrasound Registration in Brain\n  Tumor Surgery Using Swin UNETR","comments":"Accepted in IEEE IUS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Early surgical treatment of brain tumors is crucial in reducing patient\nmortality rates. However, brain tissue deformation (called brain shift) occurs\nduring the surgery, rendering pre-operative images invalid. As a cost-effective\nand portable tool, intra-operative ultrasound (iUS) can track brain shift, and\naccurate MRI-iUS registration techniques can update pre-surgical plans and\nfacilitate the interpretation of iUS. This can boost surgical safety and\noutcomes by maximizing tumor removal while avoiding eloquent regions. However,\nmanual assessment of MRI-iUS registration results in real-time is difficult and\nprone to errors due to the 3D nature of the data. Automatic algorithms that can\nquantify the quality of inter-modal medical image registration outcomes can be\nhighly beneficial. Therefore, we propose a novel deep-learning (DL) based\nframework with the Swin UNETR to automatically assess 3D-patch-wise dense error\nmaps for MRI-iUS registration in iUS-guided brain tumor resection and show its\nperformance with real clinical data for the first time.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:19:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Salari","Soorena",""],["Rasoulian","Amirhossein",""],["Rivaz","Hassan",""],["Xiao","Yiming",""]]}
{"id":"2308.10785","submitter":"Yuki Takei","authors":"Yuki Takei, Daichi Tsuna, Takatoshi Ko, and Toshikazu Shigeyama","title":"Simulating Hydrogen-poor Interaction-Powered Supernovae with CHIPS","comments":"16 pages, 9 figures. CHIPS code will be released at the end of August","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the updated open-source code Complete History of\nInteraction-Powered Supernovae (CHIPS) that can be applied to modeling\nsupernovae (SNe) arising from an interaction with massive circumstellar medium\n(CSM) as well as the formation process of the CSM. Our update mainly concerns\nwith extensions to hydrogen-poor SNe from stripped progenitors, targeting\nmodeling of interaction-powered SNe Ibc such as Type Ibn and Icn SNe. We\nsuccessfully reproduce the basic properties of the light curves of these types\nof SNe that occur after partial eruption of the outermost layer with a mass of\n$0.01$--$0.1\\,M_\\odot$ at $\\lesssim 1$ year before explosion. We also find that\nthe luminosity of the observed precursors can be naturally explained by the\noutburst that creates the dense CSM, given that the energy of the outburst is\nefficiently dissipated by collision with an external material, possibly\ngenerated by a previous mass eruption. We discuss possible scenarios causing\neruptive mass-loss based on our results.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:21:14 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 05:29:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Takei","Yuki",""],["Tsuna","Daichi",""],["Ko","Takatoshi",""],["Shigeyama","Toshikazu",""]]}
{"id":"2308.10786","submitter":"Gines R. Perez Teruel","authors":"GRP Teruel, Ksh. Newton Singh, Tanmoy Chowdhury, Farook Rahaman,\n  Monimala Mondal","title":"Testing of K(R,T)-gravity through gravastar configurations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we are reporting for the first time the existence of\ngravastar configurations in the framework of K(R,T)-gravity, which can be\ntreated as an alternative to a black hole (Mazur and Mottola). This strengthens\nhow much this new gravity theory may be physically demanding to the gravity\ncommunity in the near future. We first develop the gravastar field equations\nfor a generic K(R,T) functional and then we study four different models within\nthis theory. We find that the solutions for the interior region are regular\neverywhere regardless of the exact form of the K(R,T) functional. The solutions\nfor the shell region indicate that two of the four models subjected to the\nstudy are physically feasible. In addition, the junction conditions are\nconsidered at each interface by using the Lanczos equations that yield the\nsurface density and pressure at the thin shell. We investigate various\ncharacteristics of the gravastar structure such as the proper length, energy,\nand entropy of the spherical distribution.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:21:22 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Teruel","GRP",""],["Singh","Ksh. Newton",""],["Chowdhury","Tanmoy",""],["Rahaman","Farook",""],["Mondal","Monimala",""]]}
{"id":"2308.10787","submitter":"Aniket Sudeep Dalvi","authors":"Aniket S. Dalvi, Jacob Whitlow, Marissa D'Onofrio, Leon Riesebos,\n  Tianyi Chen, Samuel Phiri, Kenneth R. Brown and Jonathan M. Baker","title":"One-Time Compilation of Device-Level Instructions for Quantum\n  Subroutines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A large class of problems in the current era of quantum devices involve\ninterfacing between the quantum and classical system. These include calibration\nprocedures, characterization routines, and variational algorithms. The control\nin these routines iteratively switches between the classical and the quantum\ncomputer. This results in the repeated compilation of the program that runs on\nthe quantum system, scaling directly with the number of circuits and\niterations. The repeated compilation results in a significant overhead\nthroughout the routine. In practice, the total runtime of the program\n(classical compilation plus quantum execution) has an additional cost\nproportional to the circuit count. At practical scales, this can dominate the\nround-trip CPU-QPU time, between 5% and 80%, depending on the proportion of\nquantum execution time.\n  To avoid repeated device-level compilation, we identify that machine code can\nbe parametrized corresponding to pulse/gate parameters which can be dynamically\nadjusted during execution. Therefore, we develop a device-level\npartial-compilation (DLPC) technique that reduces compilation overhead to\nnearly constant, by using cheap remote procedure calls (RPC) from the QPU\ncontrol software to the CPU. We then demonstrate the performance speedup of\nthis on optimal pulse calibration, system characterization using randomized\nbenchmarking (RB), and variational algorithms. We execute this modified\npipeline on real trapped-ion quantum computers and observe significant\nreductions in compilation time, as much as 2.7x speedup for small-scale VQE\nproblems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:23:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Dalvi","Aniket S.",""],["Whitlow","Jacob",""],["D'Onofrio","Marissa",""],["Riesebos","Leon",""],["Chen","Tianyi",""],["Phiri","Samuel",""],["Brown","Kenneth R.",""],["Baker","Jonathan M.",""]]}
{"id":"2308.10788","submitter":"Mohammed S. Al-Abiad","authors":"Mohammed S. Al-Abiad, Mohammad Javad-Kalbasi, Shahrokh Valaee","title":"Effectiveness of Reconfigurable Intelligent Surfaces to Enhance\n  Connectivity in UAV Networks","comments":"14 pages, 8 figures, journal paper. arXiv admin note: text overlap\n  with arXiv:2308.04675","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconfigurable intelligent surfaces (RISs) are expected to make future 6G\nnetworks more connected and resilient against node failures, due to their\nability to introduce controllable phase-shifts onto impinging electromagnetic\nwaves and impose link redundancy. Meanwhile, unmanned aerial vehicles (UAVs)\nare prone to failure due to limited energy, random failures, or targeted\nfailures, which causes network disintegration that results in information\ndelivery loss. In this paper, we show that the integration between UAVs and\nRISs for improving network connectivity is crucial. We utilize RISs to provide\npath diversity and alternative connectivity options for information flow from\nuser equipments (UEs) to less critical UAVs by adding more links to the\nnetwork, thereby making the network more resilient and connected. To that end,\nwe first define the criticality of UAV nodes, which reflects the importance of\nsome nodes over other nodes. We then employ the algebraic connectivity metric,\nwhich is adjusted by the reflected links of the RISs and their criticality\nweights, to formulate the problem of maximizing the network connectivity. Such\nproblem is a computationally expensive combinatorial optimization. To tackle\nthis problem, we propose a relaxation method such that the discrete scheduling\nconstraint of the problem is relaxed and becomes continuous. Leveraging this,\nwe propose two efficient solutions, namely semi-definite programming (SDP)\noptimization and perturbation heuristic, which both solve the problem in\npolynomial time. For the perturbation heuristic, we derive the lower and upper\nbounds of the algebraic connectivity obtained by adding new links to the\nnetwork. Finally, we corroborate the effectiveness of the proposed solutions\nthrough extensive simulation experiments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:27:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Al-Abiad","Mohammed S.",""],["Javad-Kalbasi","Mohammad",""],["Valaee","Shahrokh",""]]}
{"id":"2308.10789","submitter":"Dinesh Kumar Singha","authors":"Dinesh Kumar Singha, Rudra Majhi, Lipsarani Panda, Monojit Ghosh,\n  Rukmani Mohanta","title":"Study of Scalar Non Standard Interaction at Protvino to Super-ORCA\n  experiment","comments":"15 pages, 11 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we have studied the phenomenon of non-standard interaction\nmediated by a scalar field (SNSI) in the context of P2SO experiment and\ncompared its sensitivity with DUNE. In particular, we have studied the\ncapability of these two experiments to put bounds on the diagonal SNSI\nparameters i.e., $\\eta_{ee}$, $\\eta_{\\mu\\mu}$ and $\\eta_{\\tau\\tau}$ and studied\nthe impact of these parameters on the determination of neutrino mass ordering,\noctant of $\\theta_{23}$ and CP violation (CPV). In our analysis we find that,\nthe parameter $\\Delta m^2_{31}$ has a non-trivial role if one wants estimate\nthe bounds on $\\eta_{\\mu\\mu}$ and $\\eta_{\\tau\\tau}$ assuming SNSI does not\nexist in nature. Our results show that sensitivity of P2SO and DUNE to\nconstraint $\\eta_{\\mu\\mu}$ and $\\eta_{\\tau\\tau}$ are similar whereas the\nsensitivity of DUNE is slightly better for $\\eta_{ee}$. We find that the mass\nordering and CPV sensitivities are mostly affected by $\\eta_{ee}$ compared to\n$\\eta_{\\mu \\mu}$ and $\\eta_{\\tau \\tau}$ if one assumes SNSI exists in nature.\nOn the other hand, octant sensitivity is mostly affected by $\\eta_{\\mu \\mu}$\nand $\\eta_{\\tau \\tau}$. These sensitivities can be either higher or lower than\nthe standard three flavour scenario depending on the relative sign of the SNSI\nparameters. Regarding the precision of atmospheric mixing parameters, we find\nthat the precision of $\\theta_{23}$ deteriorates significantly in the presence\nof $\\eta_{\\mu\\mu}$ and $\\eta_{\\tau\\tau}$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:32:30 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singha","Dinesh Kumar",""],["Majhi","Rudra",""],["Panda","Lipsarani",""],["Ghosh","Monojit",""],["Mohanta","Rukmani",""]]}
{"id":"2308.10790","submitter":"Sophia Wang","authors":"Iyad Majid, Youchen Victor Zhang, Robert Chang, Sophia Y. Wang","title":"Extraction of Text from Optic Nerve Optical Coherence Tomography Reports","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Purpose: The purpose of this study was to develop and evaluate rule-based\nalgorithms to enhance the extraction of text data, including retinal nerve\nfiber layer (RNFL) values and other ganglion cell count (GCC) data, from Zeiss\nCirrus optical coherence tomography (OCT) scan reports. Methods: DICOM files\nthat contained encapsulated PDF reports with RNFL or Ganglion Cell in their\ndocument titles were identified from a clinical imaging repository at a single\nacademic ophthalmic center. PDF reports were then converted into image files\nand processed using the PaddleOCR Python package for optical character\nrecognition. Rule-based algorithms were designed and iteratively optimized for\nimproved performance in extracting RNFL and GCC data. Evaluation of the\nalgorithms was conducted through manual review of a set of RNFL and GCC\nreports. Results: The developed algorithms demonstrated high precision in\nextracting data from both RNFL and GCC scans. Precision was slightly better for\nthe right eye in RNFL extraction (OD: 0.9803 vs. OS: 0.9046), and for the left\neye in GCC extraction (OD: 0.9567 vs. OS: 0.9677). Some values presented more\nchallenges in extraction, particularly clock hours 5 and 6 for RNFL thickness,\nand signal strength for GCC. Conclusions: A customized optical character\nrecognition algorithm can identify numeric results from optical coherence scan\nreports with high precision. Automated processing of PDF reports can greatly\nreduce the time to extract OCT results on a large scale.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:34:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Majid","Iyad",""],["Zhang","Youchen Victor",""],["Chang","Robert",""],["Wang","Sophia Y.",""]]}
{"id":"2308.10791","submitter":"Wen-Jie Liu","authors":"Wenjie Liu, Qingshan Wu","title":"A Block-Ring connected Topology of Parameterized Quantum Circuits","comments":"9 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  It is essential to select efficient topology of parameterized quantum\ncircuits (PQCs) in variational quantum algorithms (VQAs). However, there are\nproblems in current circuits, i.e. optimization difficulties caused by too many\nparameters or performance is hard to guarantee. How to reduce the number of\nparameters (number of single-qubit rotation gates and 2-qubit gates) in PQCs\nwithout reducing the performance has become a new challenge. To solve this\nproblem, we propose a novel topology, called Block-Ring (BR) topology, to\nconstruct the PQCs. This topology allocate all qubits to several blocks,\nall-to-all mode is adopt inside each block and ring mode is applied to connect\ndifferent blocks. Compared with the pure all-to-all topology circuits which own\nthe best power, BR topology have similar performance and the number of\nparameters and 2-qubit gate reduced from 0(n^2) to 0(mn) , m is a\nhyperparameter set by ourselves. Besides, we compared BR topology with other\ntopology circuits in terms of expressibility and entangling capability.\nConsidering the effects of different 2-qubit gates on circuits, we also make a\ndistinction between controlled X-rotation gates and controlled Z-rotation\ngates. Finally, the 1- and 2-layer configurations of PQCs are taken into\nconsideration as well, which shows the BR's performance improvement in the\ncondition of multilayer circuits.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:35:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Wenjie",""],["Wu","Qingshan",""]]}
{"id":"2308.10792","submitter":"Jiwei Li","authors":"Shengyu Zhang, Linfeng Dong, Xiaoya Li, Sen Zhang, Xiaofei Sun, Shuhe\n  Wang, Jiwei Li, Runyi Hu, Tianwei Zhang, Fei Wu and Guoyin Wang","title":"Instruction Tuning for Large Language Models: A Survey","comments":"A Survey paper, Pre-print","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper surveys research works in the quickly advancing field of\ninstruction tuning (IT), a crucial technique to enhance the capabilities and\ncontrollability of large language models (LLMs). Instruction tuning refers to\nthe process of further training LLMs on a dataset consisting of\n\\textsc{(instruction, output)} pairs in a supervised fashion, which bridges the\ngap between the next-word prediction objective of LLMs and the users' objective\nof having LLMs adhere to human instructions. In this work, we make a systematic\nreview of the literature, including the general methodology of IT, the\nconstruction of IT datasets, the training of IT models, and applications to\ndifferent modalities, domains and applications, along with an analysis on\naspects that influence the outcome of IT (e.g., generation of instruction\noutputs, size of the instruction dataset, etc). We also review the potential\npitfalls of IT along with criticism against it, along with efforts pointing out\ncurrent deficiencies of existing strategies and suggest some avenues for\nfruitful research.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:35:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Shengyu",""],["Dong","Linfeng",""],["Li","Xiaoya",""],["Zhang","Sen",""],["Sun","Xiaofei",""],["Wang","Shuhe",""],["Li","Jiwei",""],["Hu","Runyi",""],["Zhang","Tianwei",""],["Wu","Fei",""],["Wang","Guoyin",""]]}
{"id":"2308.10793","submitter":"Boyu Li","authors":"Boyu Li, Robert Simon Fong, Peter Ti\\v{n}o","title":"Simple Cycle Reservoirs are Universal","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reservoir computation models form a subclass of recurrent neural networks\nwith fixed non-trainable input and dynamic coupling weights. Only the static\nreadout from the state space (reservoir) is trainable, thus avoiding the known\nproblems with propagation of gradient information backwards through time.\nReservoir models have been successfully applied in a variety of tasks and were\nshown to be universal approximators of time-invariant fading memory dynamic\nfilters under various settings. Simple cycle reservoirs (SCR) have been\nsuggested as severely restricted reservoir architecture, with equal weight ring\nconnectivity of the reservoir units and input-to-reservoir weights of binary\nnature with the same absolute value. Such architectures are well suited for\nhardware implementations without performance degradation in many practical\ntasks. In this contribution, we rigorously study the expressive power of SCR in\nthe complex domain and show that they are capable of universal approximation of\nany unrestricted linear reservoir system (with continuous readout) and hence\nany time-invariant fading memory filter over uniformly bounded input streams.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:35:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Boyu",""],["Fong","Robert Simon",""],["Ti\u0148o","Peter",""]]}
{"id":"2308.10794","submitter":"Bingkun Huang","authors":"Bingkun Huang, Zhiyu Zhao, Guozhen Zhang, Yu Qiao and Limin Wang","title":"MGMAE: Motion Guided Masking for Video Masked Autoencoding","comments":"ICCV 2023 camera-ready version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Masked autoencoding has shown excellent performance on self-supervised video\nrepresentation learning. Temporal redundancy has led to a high masking ratio\nand customized masking strategy in VideoMAE. In this paper, we aim to further\nimprove the performance of video masked autoencoding by introducing a motion\nguided masking strategy. Our key insight is that motion is a general and unique\nprior in video, which should be taken into account during masked pre-training.\nOur motion guided masking explicitly incorporates motion information to build\ntemporal consistent masking volume. Based on this masking volume, we can track\nthe unmasked tokens in time and sample a set of temporal consistent cubes from\nvideos. These temporal aligned unmasked tokens will further relieve the\ninformation leakage issue in time and encourage the MGMAE to learn more useful\nstructure information. We implement our MGMAE with an online efficient optical\nflow estimator and backward masking map warping strategy. We perform\nexperiments on the datasets of Something-Something V2 and Kinetics-400,\ndemonstrating the superior performance of our MGMAE to the original VideoMAE.\nIn addition, we provide the visualization analysis to illustrate that our MGMAE\ncan sample temporal consistent cubes in a motion-adaptive manner for more\neffective video pre-training.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:39:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Bingkun",""],["Zhao","Zhiyu",""],["Zhang","Guozhen",""],["Qiao","Yu",""],["Wang","Limin",""]]}
{"id":"2308.10795","submitter":"Yiwen Xing","authors":"Yiwen Xing, Cristina Dondi, Rita Borgo, and Alfie Abdul-Rahman","title":"Visualizing Historical Book Trade Data: An Iterative Design Study with\n  Close Collaboration with Domain Experts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The circulation of historical books has always been an area of interest for\nhistorians. However, the data used to represent the journey of a book across\ndifferent places and times can be difficult for domain experts to digest due to\nburied geographical and chronological features within text-based presentations.\nThis situation provides an opportunity for collaboration between visualization\nresearchers and historians. This paper describes a design study where a variant\nof the Nine-Stage Framework was employed to develop a Visual Analytics (VA)\ntool called DanteExploreVis. This tool was designed to aid domain experts in\nexploring, explaining, and presenting book trade data from multiple\nperspectives. We discuss the design choices made and how each panel in the\ninterface meets the domain requirements. We also present the results of a\nqualitative evaluation conducted with domain experts. The main contributions of\nthis paper include: 1) the development of a VA tool to support domain experts\nin exploring, explaining, and presenting book trade data; 2) a comprehensive\ndocumentation of the iterative design, development, and evaluation process\nfollowing the variant Nine-Stage Framework; 3) a summary of the insights gained\nand lessons learned from this design study in the context of the humanities\nfield; and 4) reflections on how our approach could be applied in a more\ngeneralizable way.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:40:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xing","Yiwen",""],["Dondi","Cristina",""],["Borgo","Rita",""],["Abdul-Rahman","Alfie",""]]}
{"id":"2308.10796","submitter":"Yilun Yang","authors":"Yilun Yang, Arthur Christianen, Mari Carmen Ba\\~nuls, Dominik S. Wild,\n  J. Ignacio Cirac","title":"Phase-Sensitive Quantum Measurement without Controlled Operations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many quantum algorithms rely on the measurement of complex quantum\namplitudes. Standard approaches to obtain the phase information, such as the\nHadamard test, give rise to large overheads due to the need for global\ncontrolled-unitary operations. We introduce a quantum algorithm based on\ncomplex analysis that overcomes this problem for amplitudes that are a\ncontinuous function of time. Our method only requires the implementation of\nreal-time evolution and a shallow circuit that approximates a short\nimaginary-time evolution. We show that the method outperforms the Hadamard test\nin terms of circuit depth and that it is suitable for current noisy quantum\ncomputers when combined with a simple error-mitigation strategy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:41:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Yang","Yilun",""],["Christianen","Arthur",""],["Ba\u00f1uls","Mari Carmen",""],["Wild","Dominik S.",""],["Cirac","J. Ignacio",""]]}
{"id":"2308.10797","submitter":"Ishita Mediratta","authors":"Ishita Mediratta, Minqi Jiang, Jack Parker-Holder, Michael Dennis,\n  Eugene Vinitsky, Tim Rockt\\\"aschel","title":"Stabilizing Unsupervised Environment Design with a Learned Adversary","comments":"CoLLAs 2023 - Oral; Second and third authors contributed equally","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A key challenge in training generally-capable agents is the design of\ntraining tasks that facilitate broad generalization and robustness to\nenvironment variations. This challenge motivates the problem setting of\nUnsupervised Environment Design (UED), whereby a student agent trains on an\nadaptive distribution of tasks proposed by a teacher agent. A pioneering\napproach for UED is PAIRED, which uses reinforcement learning (RL) to train a\nteacher policy to design tasks from scratch, making it possible to directly\ngenerate tasks that are adapted to the agent's current capabilities. Despite\nits strong theoretical backing, PAIRED suffers from a variety of challenges\nthat hinder its practical performance. Thus, state-of-the-art methods currently\nrely on curation and mutation rather than generation of new tasks. In this\nwork, we investigate several key shortcomings of PAIRED and propose solutions\nfor each shortcoming. As a result, we make it possible for PAIRED to match or\nexceed state-of-the-art methods, producing robust agents in several established\nchallenging procedurally-generated environments, including a partially-observed\nmaze navigation task and a continuous-control car racing environment. We\nbelieve this work motivates a renewed emphasis on UED methods based on learned\nmodels that directly generate challenging environments, potentially unlocking\nmore open-ended RL training and, as a result, more general agents.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:42:56 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 14:38:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mediratta","Ishita",""],["Jiang","Minqi",""],["Parker-Holder","Jack",""],["Dennis","Michael",""],["Vinitsky","Eugene",""],["Rockt\u00e4schel","Tim",""]]}
{"id":"2308.10798","submitter":"Jason Atnip","authors":"Jason Atnip, Gary Froyland, Cecilia Gonz\\'alez-Tokman, Sandro Vaienti","title":"Compound Poisson statistics for dynamical systems via spectral\n  perturbation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider random transformations\n$T_\\omega^n:=T_{\\sigma^{n-1}\\omega}\\circ\\cdots\\circ T_{\\sigma\\omega}\\circ\nT_\\omega,$ where each map $T_{\\omega}$ acts on a complete metrizable space $M$.\nAssociated with this random map cocycle is a transfer operator cocycle\n$\\mathcal{L}^{n}_{\\omega,0}:=\\mathcal{L}_{\\sigma^{n-1}\\omega,0}\\circ\\cdots\\circ\\mathcal{L}_{\\sigma\\omega,0}\\circ\n\\mathcal{L}_{\\omega,0}$, where $\\mathcal{L}_{\\omega,0}$ is the transfer\noperator for the map $T_\\omega$. The randomness comes from an invtertible and\nergodic driving map $\\sigma:\\Omega\\to\\Omega$ acting on a probability space\n$(\\Omega,\\mathcal{F},m).$ We introduce a family of random holes $H_{\\omega, n}$\ninto $M$, from which we define a perturbed cocycle\n$\\mathcal{L}_{\\omega,n,s}(\\cdot):=\\mathcal{L}_{\\omega,0}(\\cdot\ne^{is\\mathbb{1}_{H_{\\omega,n}}})$. We develop a spectral approach for quenched\ncompound Poisson statistics that considers random dynamics and random\nobservations. To facilitate this we introduce the random variable\n$S_{\\omega,n,n}(x):=\\sum_{j=0}^{n-1}\\mathbb{1}_{H_{\\sigma^j\\omega,n}}(T_\\omega^jx)$,\nwhich counts the number of visits to random holes in a suitably scaled time\ninterval. Under suitable assumptions, we show that in the $n\\to\\infty$ limit,\nthe characteristic function of the random variable $S_{\\omega,n,n}$ converges\npointwise to the characteristic function of a random variable that is discrete\nand infinitely divisible, and therefore compound-Poisson distributed. We\nprovide several explicit examples for piecewise monotone interval maps in both\nthe deterministic and random settings.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:44:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Atnip","Jason",""],["Froyland","Gary",""],["Gonz\u00e1lez-Tokman","Cecilia",""],["Vaienti","Sandro",""]]}
{"id":"2308.10799","submitter":"Sufei Shi","authors":"Zhen Lian, Yuze Meng, Lei Ma, Indrajit Maity, Li Yan, Qiran Wu, Xiong\n  Huang, Dongxue Chen, Xiaotong Chen, Xinyue Chen, Mark Blei, Takashi\n  Taniguchi, Kenji Watanabe, Sefaattin Tongay, Johannes Lischner, Yong-Tao Cui,\n  Su-Fei Shi","title":"Valley-polarized Exitonic Mott Insulator in WS2/WSe2 Moir\\'e\n  Superlattice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strongly enhanced electron-electron interaction in semiconducting moir\\'e\nsuperlattices formed by transition metal dichalcogenides (TMDCs) heterobilayers\nhas led to a plethora of intriguing fermionic correlated states. Meanwhile,\ninterlayer excitons in a type-II aligned TMDC heterobilayer moir\\'e\nsuperlattice, with electrons and holes separated in different layers, inherit\nthis enhanced interaction and strongly interact with each other, promising for\nrealizing tunable correlated bosonic quasiparticles with valley degree of\nfreedom. We employ photoluminescence spectroscopy to investigate the strong\nrepulsion between interlayer excitons and correlated electrons in a WS2/WSe2\nmoir\\'e superlattice and combine with theoretical calculations to reveal the\nspatial extent of interlayer excitons and the band hierarchy of correlated\nstates. We further find that an excitonic Mott insulator state emerges when one\ninterlayer exciton occupies one moir\\'e cell, evidenced by emerging\nphotoluminescence peaks under increased optical excitation power. Double\noccupancy of excitons in one unit cell requires overcoming the energy cost of\nexciton-exciton repulsion of about 30-40 meV, depending on the stacking\nconfiguration of the WS2/WSe2 heterobilayer. Further, the valley polarization\nof the excitonic Mott insulator state is enhanced by nearly one order of\nmagnitude. Our study demonstrates the WS2/WSe2 moir\\'e superlattice as a\npromising platform for engineering and exploring new correlated states of\nfermion, bosons, and a mixture of both.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:44:59 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 21:47:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lian","Zhen",""],["Meng","Yuze",""],["Ma","Lei",""],["Maity","Indrajit",""],["Yan","Li",""],["Wu","Qiran",""],["Huang","Xiong",""],["Chen","Dongxue",""],["Chen","Xiaotong",""],["Chen","Xinyue",""],["Blei","Mark",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Tongay","Sefaattin",""],["Lischner","Johannes",""],["Cui","Yong-Tao",""],["Shi","Su-Fei",""]]}
{"id":"2308.10800","submitter":"Matthew R. DeVerna","authors":"Matthew R. DeVerna, Harry Yaojun Yan, Kai-Cheng Yang, Filippo Menczer","title":"Artificial intelligence is ineffective and potentially harmful for fact\n  checking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fact checking can be an effective strategy against misinformation, but its\nimplementation at scale is impeded by the overwhelming volume of information\nonline. Recent artificial intelligence (AI) language models have shown\nimpressive ability in fact-checking tasks, but how humans interact with\nfact-checking information provided by these models is unclear. Here we\ninvestigate the impact of fact checks generated by a popular AI model on belief\nin, and sharing intent of, political news in a preregistered randomized control\nexperiment. Although the AI performs reasonably well in debunking false\nheadlines, we find that it does not significantly affect participants' ability\nto discern headline accuracy or share accurate news. However, the AI\nfact-checker is harmful in specific cases: it decreases beliefs in true\nheadlines that it mislabels as false and increases beliefs for false headlines\nthat it is unsure about. On the positive side, the AI increases sharing intents\nfor correctly labeled true headlines. When participants are given the option to\nview AI fact checks and choose to do so, they are significantly more likely to\nshare both true and false news but only more likely to believe false news. Our\nfindings highlight an important source of potential harm stemming from AI\napplications and underscore the critical need for policies to prevent or\nmitigate such unintended consequences.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:47:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["DeVerna","Matthew R.",""],["Yan","Harry Yaojun",""],["Yang","Kai-Cheng",""],["Menczer","Filippo",""]]}
{"id":"2308.10801","submitter":"Alexis Baudin","authors":"Alexis Baudin, Lionel Tabourier, Cl\\'emence Magnien","title":"LSCPM: communities in massive real-world Link Streams by Clique\n  Percolation Method","comments":"18 pages, 7 figures, to be published in 30th International Symposium\n  on Temporal Representation and Reasoning (TIME 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Community detection is a popular approach to understand the organization of\ninteractions in static networks. For that purpose, the Clique Percolation\nMethod (CPM), which involves the percolation of k-cliques, is a well-studied\ntechnique that offers several advantages. Besides, studying interactions that\noccur over time is useful in various contexts, which can be modeled by the link\nstream formalism. The Dynamic Clique Percolation Method (DCPM) has been\nproposed for extending CPM to temporal networks.\n  However, existing implementations are unable to handle massive datasets. We\npresent a novel algorithm that adapts CPM to link streams, which has the\nadvantage that it allows us to speed up the computation time with respect to\nthe existing DCPM method. We evaluate it experimentally on real datasets and\nshow that it scales to massive link streams. For example, it allows to obtain a\ncomplete set of communities in under twenty-five minutes for a dataset with\nthirty million links, what the state of the art fails to achieve even after a\nweek of computation. We further show that our method provides communities\nsimilar to DCPM, but slightly more aggregated. We exhibit the relevance of the\nobtained communities in real world cases, and show that they provide\ninformation on the importance of vertices in the link streams.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:48:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Baudin","Alexis",""],["Tabourier","Lionel",""],["Magnien","Cl\u00e9mence",""]]}
{"id":"2308.10802","submitter":"Cheng Ouyang","authors":"Le Chen, Cheng Ouyang and William Vickery","title":"Parabolic Anderson model with colored noise on torus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct an intrinsic family of Gaussian noises on $d$-dimensional flat\ntorus $\\mathbb{T}^d$. It is the analogue of the colored noise on\n$\\mathbb{R}^d$, and allows us to study stochastic PDEs on torus in the It\\^{o}\nsense in high dimensions. With this noise, we consider the parabolic Anderson\nmodel (PAM) with measure-valued initial conditions and establish some basic\nproperties of the solution, including a sharp upper and lower bound for the\nmoments and H\\\"{o}lder continuity in space and time. The study of the toy model\nof $\\mathbb{T}^d$ in the present paper is a first step towards our effort in\nunderstanding how geometry and topology play an role in the behavior of\nstochastic PDEs on general (compact) manifolds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:49:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Le",""],["Ouyang","Cheng",""],["Vickery","William",""]]}
{"id":"2308.10803","submitter":"Jon Paul Lundquist","authors":"J.P. Lundquist, L. Merten, S. Vorobiov, M. Boughelilba, A. Reimer, P.\n  Da Vela, F. Tavecchio, G. Bonnoli and C. Righi","title":"The UHECR-FR0 Radio Galaxy Connection: A Multi-Messenger Study of Energy\n  Spectra/Composition Emission and Intergalactic Magnetic Field Propagation","comments":"PoS 444 (38th ICRC) 1512","journal-ref":null,"doi":"10.22323/1.444.1512","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates low luminosity Fanaroff-Riley Type 0 (FR0) radio\ngalaxies as a potentially significant source of ultra-high energy cosmic rays\n(UHECRs). Due to their much higher prevalence in the local universe compared to\nmore powerful radio galaxies (about five times more than FR-1s), FR0s may\nprovide a substantial fraction of the total UHECR energy density. To determine\nthe nucleon composition and energy spectrum of UHECRs emitted by FR0 sources,\nsimulation results from CRPropa3 are fit to Pierre Auger Observatory data. The\nresulting emission spectral indices, rigidity cutoffs, and nucleon fractions\nare compared to recent Auger results. The FR0 simulations include the\napproximately isotropic distribution of FR0 galaxies and various intergalactic\nmagnetic field configurations (including random and structured fields) and\npredict the fluxes of secondary photons and neutrinos produced during UHECR\npropagation through cosmic photon backgrounds. This comprehensive simulation\nallows for investigating the properties of the FR0 sources using observational\nmulti-messenger data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:51:08 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Lundquist","J. P.",""],["Merten","L.",""],["Vorobiov","S.",""],["Boughelilba","M.",""],["Reimer","A.",""],["Da Vela","P.",""],["Tavecchio","F.",""],["Bonnoli","G.",""],["Righi","C.",""]]}
{"id":"2308.10804","submitter":"Antoine Mellet","authors":"Pierre-Emmanuel Jabin and Antoine Mellet","title":"H\\\"older and Sobolev regularity of optimal transportation potentials\n  with rough measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a Kantorovich potential associated to an optimal transportation\nproblem between measures that are not necessarily absolutely continuous with\nrespect to the Lebesgue measure, but are comparable to the Lebesgue measure\nwhen restricted to balls with radius greater than some $\\delta>0$. Our main\nresults extend the classical regularity theory of optimal transportation to\nthis framework. In particular, we establish both H\\\"older and Sobolev\nregularity results for Kantorovich potentials up to some critical length scale\ndepending on $\\delta$. Our assumptions are very natural in the context of the\nnumerical computation of optimal maps, which often involves approximating by\nsums of Dirac masses some measures that are absolutely continuous with\ndensities bounded away from zero and infinity on their supports.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:51:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jabin","Pierre-Emmanuel",""],["Mellet","Antoine",""]]}
{"id":"2308.10805","submitter":"Song-Ren Fu","authors":"Song-Ren Fu, Peng-Fei Yao and Yongyi Yu","title":"Inverse problem of recoverying a time-dependent nonlinearity appearing\n  in third-order nonlinear acoustic equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider the inverse problem of recovering a time-dependent\nnonlinearity for a third order nonlinear acoustic equation, which is known as\nthe Jordan-Moore-Gibson-Thompson equation (J-M-G-T equation for short). This\nthird order in time equation arises, for example, from the wave propagation in\nviscous thermally relaxing fluids. The well-posedness of the nonlinear equation\nis obtained for the small initial and boundary data. By the higher order\nlinearization to the nonlinear equation, and construction of complex geometric\noptics (CGO for short) solutions for the linearized equation, we derive the\nuniqueness of recovering the nonlinearity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:52:20 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fu","Song-Ren",""],["Yao","Peng-Fei",""],["Yu","Yongyi",""]]}
{"id":"2308.10806","submitter":"Zixuan Liu","authors":"Zixuan Liu, Liu Liu, Xueqian Wang, Peilin Zhao","title":"Differentiable Frank-Wolfe Optimization Layer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Differentiable optimization has received a significant amount of attention\ndue to its foundational role in the domain of machine learning based on neural\nnetworks. The existing methods leverages the optimality conditions and implicit\nfunction theorem to obtain the Jacobian matrix of the output, which increases\nthe computational cost and limits the application of differentiable\noptimization. In addition, some non-differentiable constraints lead to more\nchallenges when using prior differentiable optimization layers. This paper\nproposes a differentiable layer, named Differentiable Frank-Wolfe Layer\n(DFWLayer), by rolling out the Frank-Wolfe method, a well-known optimization\nalgorithm which can solve constrained optimization problems without projections\nand Hessian matrix computations, thus leading to a efficient way of dealing\nwith large-scale problems. Theoretically, we establish a bound on the\nsuboptimality gap of the DFWLayer in the context of l1-norm constraints.\nExperimental assessments demonstrate that the DFWLayer not only attains\ncompetitive accuracy in solutions and gradients but also consistently adheres\nto constraints. Moreover, it surpasses the baselines in both forward and\nbackward computational speeds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:53:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Zixuan",""],["Liu","Liu",""],["Wang","Xueqian",""],["Zhao","Peilin",""]]}
{"id":"2308.10807","submitter":"Soheil Abadifard","authors":"Soheil Abadifard, Sepehr Bakhshi, Sanaz Gheibuni, Fazli Can","title":"DynED: Dynamic Ensemble Diversification in Data Stream Classification","comments":"Proceedings of the 32nd ACM International Conference on Information\n  and Knowledge Management (CIKM '23), October 21--25, 2023, Birmingham, United\n  Kingdom","journal-ref":null,"doi":"10.1145/3583780.3615266","report-no":null,"categories":"cs.LG cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensemble methods are commonly used in classification due to their remarkable\nperformance. Achieving high accuracy in a data stream environment is a\nchallenging task considering disruptive changes in the data distribution, also\nknown as concept drift. A greater diversity of ensemble components is known to\nenhance prediction accuracy in such settings. Despite the diversity of\ncomponents within an ensemble, not all contribute as expected to its overall\nperformance. This necessitates a method for selecting components that exhibit\nhigh performance and diversity. We present a novel ensemble construction and\nmaintenance approach based on MMR (Maximal Marginal Relevance) that dynamically\ncombines the diversity and prediction accuracy of components during the process\nof structuring an ensemble. The experimental results on both four real and 11\nsynthetic datasets demonstrate that the proposed approach (DynED) provides a\nhigher average mean accuracy compared to the five state-of-the-art baselines.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:56:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Abadifard","Soheil",""],["Bakhshi","Sepehr",""],["Gheibuni","Sanaz",""],["Can","Fazli",""]]}
{"id":"2308.10808","submitter":"Yunzhe Qi","authors":"Yunzhe Qi, Yikun Ban, Jingrui He","title":"Graph Neural Bandits","comments":"Accepted to SIGKDD 2023","journal-ref":null,"doi":"10.1145/3580305.3599371","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Contextual bandits algorithms aim to choose the optimal arm with the highest\nreward out of a set of candidates based on the contextual information. Various\nbandit algorithms have been applied to real-world applications due to their\nability of tackling the exploitation-exploration dilemma. Motivated by online\nrecommendation scenarios, in this paper, we propose a framework named Graph\nNeural Bandits (GNB) to leverage the collaborative nature among users empowered\nby graph neural networks (GNNs). Instead of estimating rigid user clusters as\nin existing works, we model the \"fine-grained\" collaborative effects through\nestimated user graphs in terms of exploitation and exploration respectively.\nThen, to refine the recommendation strategy, we utilize separate GNN-based\nmodels on estimated user graphs for exploitation and adaptive exploration.\nTheoretical analysis and experimental results on multiple real data sets in\ncomparison with state-of-the-art baselines are provided to demonstrate the\neffectiveness of our proposed framework.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:57:57 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Qi","Yunzhe",""],["Ban","Yikun",""],["He","Jingrui",""]]}
{"id":"2308.10809","submitter":"Fangyun Wei","authors":"Fangyun Wei, Yutong Chen","title":"Improving Continuous Sign Language Recognition with Cross-Lingual Signs","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work dedicates to continuous sign language recognition (CSLR), which is\na weakly supervised task dealing with the recognition of continuous signs from\nvideos, without any prior knowledge about the temporal boundaries between\nconsecutive signs. Data scarcity heavily impedes the progress of CSLR. Existing\napproaches typically train CSLR models on a monolingual corpus, which is orders\nof magnitude smaller than that of speech recognition. In this work, we explore\nthe feasibility of utilizing multilingual sign language corpora to facilitate\nmonolingual CSLR. Our work is built upon the observation of cross-lingual\nsigns, which originate from different sign languages but have similar visual\nsignals (e.g., hand shape and motion). The underlying idea of our approach is\nto identify the cross-lingual signs in one sign language and properly leverage\nthem as auxiliary training data to improve the recognition capability of\nanother. To achieve the goal, we first build two sign language dictionaries\ncontaining isolated signs that appear in two datasets. Then we identify the\nsign-to-sign mappings between two sign languages via a well-optimized isolated\nsign language recognition model. At last, we train a CSLR model on the\ncombination of the target data with original labels and the auxiliary data with\nmapped labels. Experimentally, our approach achieves state-of-the-art\nperformance on two widely-used CSLR datasets: Phoenix-2014 and Phoenix-2014T.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:58:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wei","Fangyun",""],["Chen","Yutong",""]]}
{"id":"2308.10810","submitter":"Davide Girolami","authors":"Choong Pak Shen and Davide Girolami","title":"Evaluating Pauli errors on cluster states by weighted distances","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the problem of evaluating the difference between quantum states\nbefore and after being affected by errors encoded in unitary transformations.\nStandard distance functions, e.g., the Bures length, are not fully adequate for\nsuch a task. Weighted distances are instead appropriate information measures to\nquantify distinguishability of multipartite states. Here, we employ the\npreviously introduced weighted Bures length and the newly defined weighted\nHilbert-Schmidt distance to quantify how much single-qubit Pauli errors alter\ncluster states. We find that different errors of the same dimension change\ncluster states in a different way, i.e., their detectability is in general\ndifferent. Indeed, they transform an ideal cluster state into a state whose\nweighted distance from the input depends on the specific chosen Pauli rotation,\nas well as the position of the affected qubit in the graph related to the\nstate. As these features are undetected by using standard distances, the study\nproves the usefulness of weighted distances to monitor key but elusive\nproperties of many-body quantum systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:58:47 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Shen","Choong Pak",""],["Girolami","Davide",""]]}
{"id":"2308.10811","submitter":"Johannes Zink","authors":"Jonathan Klawitter and Johannes Zink","title":"Tree Drawings with Columns","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our goal is to visualize an additional data dimension of a tree with\nmultifaceted data through superimposition on vertical strips, which we call\ncolumns. Specifically, we extend upward drawings of unordered rooted trees\nwhere vertices have assigned heights by mapping each vertex to a column. Under\nan orthogonal drawing style and with every subtree within a column drawn\nplanar, we consider different natural variants concerning the arrangement of\nsubtrees within a column. We show that minimizing the number of crossings in\nsuch a drawing can be achieved in fixed-parameter tractable (FPT) time in the\nmaximum vertex degree $\\Delta$ for the most restrictive variant, while becoming\nNP-hard (even to approximate) already for a slightly relaxed variant. However,\nwe provide an FPT algorithm in the number of crossings plus $\\Delta$, and an\nFPT-approximation algorithm in $\\Delta$ via a reduction to feedback arc set.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 15:59:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Klawitter","Jonathan",""],["Zink","Johannes",""]]}
{"id":"2308.10812","submitter":"Pavel Gvozdevsky","authors":"Pavel Gvozdevsky","title":"On countable isotypic structures","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain several results concerning the concept of isotypic structures.\nNamely we prove that any field of finite transcendence degree over a prime\nsubfield is defined by types; then we give examples of certain countable\nisotypic but not isomorphic structures: totally ordered sets, rings, and\ngroups/\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:01:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gvozdevsky","Pavel",""]]}
{"id":"2308.10813","submitter":"Vasily Golyshev","authors":"V. Golyshev","title":"On $L$-derivatives and biextensions of Calabi-Yau motives","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We prove that certain differential operators of the form $DLD$ with $L$\nhypergeometric and $D=z \\frac{d}{dz}$ are of Picard-Fuchs type. We give closed\nhypergeometric expressions for minors of the biextension period matrices that\narise from certain rank 4 weight 3 Calabi-Yau motives presumed to be of\nanalytic rank 1. We compare their values numerically to the first derivative of\nthe $L$-functions of the respective motives at $s=2$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:02:52 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Golyshev","V.",""]]}
{"id":"2308.10814","submitter":"Natalia Frumkin","authors":"Natalia Frumkin, Dibakar Gope, and Diana Marculescu","title":"Jumping through Local Minima: Quantization in the Loss Landscape of\n  Vision Transformers","comments":"arXiv admin note: text overlap with arXiv:2211.09643","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Quantization scale and bit-width are the most important parameters when\nconsidering how to quantize a neural network. Prior work focuses on optimizing\nquantization scales in a global manner through gradient methods (gradient\ndescent \\& Hessian analysis). Yet, when applying perturbations to quantization\nscales, we observe a very jagged, highly non-smooth test loss landscape. In\nfact, small perturbations in quantization scale can greatly affect accuracy,\nyielding a $0.5-0.8\\%$ accuracy boost in 4-bit quantized vision transformers\n(ViTs). In this regime, gradient methods break down, since they cannot reliably\nreach local minima. In our work, dubbed Evol-Q, we use evolutionary search to\neffectively traverse the non-smooth landscape. Additionally, we propose using\nan infoNCE loss, which not only helps combat overfitting on the small\ncalibration dataset ($1,000$ images) but also makes traversing such a highly\nnon-smooth surface easier. Evol-Q improves the top-1 accuracy of a fully\nquantized ViT-Base by $10.30\\%$, $0.78\\%$, and $0.15\\%$ for $3$-bit, $4$-bit,\nand $8$-bit weight quantization levels. Extensive experiments on a variety of\nCNN and ViT architectures further demonstrate its robustness in extreme\nquantization scenarios. Our code is available at\nhttps://github.com/enyac-group/evol-q\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:03:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Frumkin","Natalia",""],["Gope","Dibakar",""],["Marculescu","Diana",""]]}
{"id":"2308.10815","submitter":"Pablo Sanchez Ocal","authors":"Paul Balmer, Pablo S. Ocal","title":"Universal support for triangulated categories","comments":"2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AG math.AT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit a result of Gratz and Stevenson on the universal space that\ncarries supports for objects of a triangulated category, in the absence of a\ntensor product.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:09:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Balmer","Paul",""],["Ocal","Pablo S.",""]]}
{"id":"2308.10816","submitter":"Maximiliano Contino","authors":"M. Laura Arias, Maximiliano Contino, Alejandra Maestripieri and\n  Stefania Marcantognini","title":"Semiclosed multivalued projections","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A multivalued projection is an idempotent linear relation with invariant\ndomain. We characterize multivalued projections that are operator ranges\n(called semiclosed) and provide several formulae of them. Moreover, we study\nthe decomposability and continuity of multivalued projections, and describe\nnilpotent relations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:10:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Arias","M. Laura",""],["Contino","Maximiliano",""],["Maestripieri","Alejandra",""],["Marcantognini","Stefania",""]]}
{"id":"2308.10819","submitter":"Zekun Li","authors":"Zekun Li and Baolin Peng and Pengcheng He and Xifeng Yan","title":"Do you really follow me? Adversarial Instructions for Evaluating the\n  Robustness of Large Language Models","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have shown remarkable proficiency in following\ninstructions, making them valuable in customer-facing applications. However,\ntheir impressive capabilities also raise concerns about the amplification of\nrisks posed by adversarial instructions, which can be injected into the model\ninput by third-party attackers to manipulate LLMs' original instructions and\nprompt unintended actions and content. Therefore, it is crucial to understand\nLLMs' ability to accurately discern which instructions to follow to ensure\ntheir safe deployment in real-world scenarios. In this paper, we propose a\npioneering benchmark for automatically evaluating the robustness of LLMs\nagainst adversarial instructions. The objective of this benchmark is to\nquantify the extent to which LLMs are influenced by injected adversarial\ninstructions and assess their ability to differentiate between these\nadversarial instructions and original user instructions. Through experiments\nconducted with state-of-the-art instruction-following LLMs, we uncover\nsignificant limitations in their robustness against adversarial instruction\nattacks. Furthermore, our findings indicate that prevalent instruction-tuned\nmodels are prone to being overfitted to follow any instruction phrase in the\nprompt without truly understanding which instructions should be followed. This\nhighlights the need to address the challenge of training models to comprehend\nprompts instead of merely following instruction phrases and completing the\ntext.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:21:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Zekun",""],["Peng","Baolin",""],["He","Pengcheng",""],["Yan","Xifeng",""]]}
{"id":"2308.10820","submitter":"Miaoyu Li","authors":"Miaoyu Li, Ying Fu, Ji Liu, Yulun Zhang","title":"Pixel Adaptive Deep Unfolding Transformer for Hyperspectral Image\n  Reconstruction","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hyperspectral Image (HSI) reconstruction has made gratifying progress with\nthe deep unfolding framework by formulating the problem into a data module and\na prior module. Nevertheless, existing methods still face the problem of\ninsufficient matching with HSI data. The issues lie in three aspects: 1) fixed\ngradient descent step in the data module while the degradation of HSI is\nagnostic in the pixel-level. 2) inadequate prior module for 3D HSI cube. 3)\nstage interaction ignoring the differences in features at different stages. To\naddress these issues, in this work, we propose a Pixel Adaptive Deep Unfolding\nTransformer (PADUT) for HSI reconstruction. In the data module, a pixel\nadaptive descent step is employed to focus on pixel-level agnostic degradation.\nIn the prior module, we introduce the Non-local Spectral Transformer (NST) to\nemphasize the 3D characteristics of HSI for recovering. Moreover, inspired by\nthe diverse expression of features in different stages and depths, the stage\ninteraction is improved by the Fast Fourier Transform (FFT). Experimental\nresults on both simulated and real scenes exhibit the superior performance of\nour method compared to state-of-the-art HSI reconstruction methods. The code is\nreleased at: https://github.com/MyuLi/PADUT.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:12:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Li","Miaoyu",""],["Fu","Ying",""],["Liu","Ji",""],["Zhang","Yulun",""]]}
{"id":"2308.10821","submitter":"Benjamin Marais","authors":"William Maillet and Benjamin Marais","title":"Neural Networks Optimizations Against Concept and Data Drift in Malware\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the promising results of machine learning models in malware\ndetection, they face the problem of concept drift due to malware constant\nevolution. This leads to a decline in performance over time, as the data\ndistribution of the new files differs from the training one, requiring regular\nmodel update. In this work, we propose a model-agnostic protocol to improve a\nbaseline neural network to handle with the drift problem. We show the\nimportance of feature reduction and training with the most recent validation\nset possible, and propose a loss function named Drift-Resilient Binary\nCross-Entropy, an improvement to the classical Binary Cross-Entropy more\neffective against drift. We train our model on the EMBER dataset (2018) and\nevaluate it on a dataset of recent malicious files, collected between 2020 and\n2023. Our improved model shows promising results, detecting 15.2% more malware\nthan a baseline model.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:13:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Maillet","William",""],["Marais","Benjamin",""]]}
{"id":"2308.10822","submitter":"Jie Wang","authors":"Hao Wen, Jie Wang, Xiaodong Qiao","title":"A Novel Ehanced Move Recognition Algorithm Based on Pre-trained Models\n  with Positional Embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recognition of abstracts is crucial for effectively locating the content\nand clarifying the article. Existing move recognition algorithms lack the\nability to learn word position information to obtain contextual semantics. This\npaper proposes a novel enhanced move recognition algorithm with an improved\npre-trained model and a gated network with attention mechanism for unstructured\nabstracts of Chinese scientific and technological papers. The proposed\nalgorithm first performs summary data segmentation and vocabulary training. The\nEP-ERNIE$\\_$AT-GRU framework is leveraged to incorporate word positional\ninformation, facilitating deep semantic learning and targeted feature\nextraction. Experimental results demonstrate that the proposed algorithm\nachieves 13.37$\\%$ higher accuracy on the split dataset than on the original\ndataset and a 7.55$\\%$ improvement in accuracy over the basic comparison model.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 03:20:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wen","Hao",""],["Wang","Jie",""],["Qiao","Xiaodong",""]]}
{"id":"2308.10823","submitter":"Tyrel Stokes","authors":"Tyrel Stokes, Ian Shrier, and Russell Steele","title":"Simulation Experiments as a Causal Problem","comments":"19 pages, 17 figures. Under review at Statistical Science","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME econ.EM math.ST stat.CO stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simulation methods are among the most ubiquitous methodological tools in\nstatistical science. In particular, statisticians often is simulation to\nexplore properties of statistical functionals in models for which developed\nstatistical theory is insufficient or to assess finite sample properties of\ntheoretical results. We show that the design of simulation experiments can be\nviewed from the perspective of causal intervention on a data generating\nmechanism. We then demonstrate the use of causal tools and frameworks in this\ncontext. Our perspective is agnostic to the particular domain of the simulation\nexperiment which increases the potential impact of our proposed approach. In\nthis paper, we consider two illustrative examples. First, we re-examine a\npredictive machine learning example from a popular textbook designed to assess\nthe relationship between mean function complexity and the mean-squared error.\nSecond, we discuss a traditional causal inference method problem, simulating\nthe effect of unmeasured confounding on estimation, specifically to illustrate\nbias amplification. In both cases, applying causal principles and using\ngraphical models with parameters and distributions as nodes in the spirit of\ninfluence diagrams can 1) make precise which estimand the simulation targets ,\n2) suggest modifications to better attain the simulation goals, and 3) provide\nscaffolding to discuss performance criteria for a particular simulation design.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:14:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Stokes","Tyrel",""],["Shrier","Ian",""],["Steele","Russell",""]]}
{"id":"2308.10824","submitter":"Fabio Bernasconi","authors":"Fabio Bernasconi and Stefano Filipazzi","title":"Rational points on 3-folds with nef anti-canonical class over finite\n  fields","comments":"27 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that a geometrically integral smooth 3-fold $X$ with nef\nanti-canonical class and negative Kodaira dimension over a finite field\n$\\mathbb{F}_q$ of characteristic $p>5$ and cardinality $q=p^e > 19$ has a\nrational point. Additionally, under the same assumptions on $p$ and $q$, we\nshow that a 3-fold $X$ with trivial canonical class and non-zero first Betti\nnumber $b_1(X) \\neq 0$ has a rational point. Our techniques rely on the Minimal\nModel Program to establish several structure results for generalized log\nCalabi--Yau 3-fold pairs over perfect fields.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:17:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bernasconi","Fabio",""],["Filipazzi","Stefano",""]]}
{"id":"2308.10825","submitter":"Michael Postol","authors":"Michael S. Postol","title":"Algebraic Topology for Data Scientists","comments":"322 pages, 69 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This book gives a thorough introduction to topological data analysis (TDA),\nthe application of algebraic topology to data science. Algebraic topology is\ntraditionally a very specialized field of math, and most mathematicians have\nnever been exposed to it, let alone data scientists, computer scientists, and\nanalysts. I have three goals in writing this book. The first is to bring people\nup to speed who are missing a lot of the necessary background. I will describe\nthe topics in point-set topology, abstract algebra, and homology theory needed\nfor a good understanding of TDA. The second is to explain TDA and some current\napplications and techniques. Finally, I would like to answer some questions\nabout more advanced topics such as cohomology, homotopy, obstruction theory,\nand Steenrod squares, and what they can tell us about data. It is hoped that\nreaders will acquire the tools to start to think about these topics and where\nthey might fit in.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:19:48 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Postol","Michael S.",""]]}
{"id":"2308.10826","submitter":"Ian Richardson","authors":"I. G. Richardson (NASA Goddard Space Flight Center and University of\n  Maryland, College Park), O. C. St Cyr, J. T. Burkepile (NCAR/HAO), H. Xie\n  (NASA Goddard Space Flight Center and Catholic University of America), B. J.\n  Thompson (NASA Goddard Space Flight Center)","title":"Solar Energetic Particle-Associated Coronal Mass Ejections Observed by\n  the Mauna Loa Solar Observatory Mk3 and Mk4 Coronameters","comments":"To be published in Solar Physics","journal-ref":null,"doi":"10.1007/s11207-023-02192-9","report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We report on the first comprehensive study of the coronal mass ejections\n(CMEs) associated with $\\sim$25 MeV solar energetic proton (SEP) events in\n1980-2013 observed in the low/inner corona by the Mauna Loa Solar Observatory\n(MLSO) Mk3 and Mk4 coronameters. Where possible, these observations are\ncombined with spacebased observations from the Solar Maximum Mission C/P, P78-1\nSOLWIND or SOHO/LASCO coronagraphs. The aim of the study is to understand\ndirectly-measured (rather than inferred from proxies) CME motions in the low to\nmiddle corona and their association with SEP acceleration, and hence attempt to\nidentify early signatures that are characteristic of SEP acceleration in\nground-based CME observations that may be used to warn of impending SEP events.\nAlthough we find that SEP events are associated with CMEs that are on average\nfaster and wider than typical CMEs observed by MLSO, a major challenge turns\nout to be determining reliable estimates of the CME dynamics in the low corona\nfrom the 3-minute cadence Mk3/4 observations since different analysis\ntechniques can produce inconsistent results. This complicates the assessment of\nwhat early information on a possible SEP event is available from these low\ncoronal observations\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:18:45 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 22:28:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Richardson","I. G.","","NASA Goddard Space Flight Center and University of\n  Maryland, College Park"],["Cyr","O. C. St","","NCAR/HAO"],["Burkepile","J. T.","","NCAR/HAO"],["Xie","H.","","NASA Goddard Space Flight Center and Catholic University of America"],["Thompson","B. J.","","NASA Goddard Space Flight Center"]]}
{"id":"2308.10827","submitter":"Mohammad Ardeshir","authors":"Mohammad Ardeshir and Rasoul Ramezanian","title":"The Temporal Continuum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The continuum has been one of the most controversial topics in mathematics\nsince the time of the Greeks. Some mathematicians, such as Euclid and Cantor,\nheld the position that a line is composed of points, while others, like\nAristotle, Weyl and Brouwer, argued that a line is not composed of points but\nrather a matrix of a continued insertion of points. In spite of this\ndisagreement on the structure of the continuum, they did distinguish the\ntemporal line from the spatial line. In this paper, we argue that there is\nindeed a difference between the intuition of the spatial continuum and the\nintuition of the temporal continuum. The main primary aspect of the temporal\ncontinuum, in contrast with the spatial continuum, is the notion of\norientation.\n  The continuum has usually been mathematically modeled by Cauchy sequences and\nthe Dedekind cuts. While in the first model, each point can be approximated by\nrational numbers, in the second one, that is not possible constructively. We\nargue that points on the temporal continuum cannot be approximated by rationals\nas a temporal point is a flow that sinks to the past. In our model, the\ncontinuum is a collection of constructive Dedekind cuts, and we define two\ntopologies for temporal continuum: 1. oriented topology and 2. the ordinary\ntopology. We prove that every total function from the oriented topological\nspace to the ordinary one is continuous.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:13:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ardeshir","Mohammad",""],["Ramezanian","Rasoul",""]]}
{"id":"2308.10828","submitter":"Zhihan Jiang","authors":"Zhihan Jiang, Jinyang Liu, Junjie Huang, Yichen Li, Yintong Huo,\n  Jiazhen Gu, Zhuangbin Chen, Jieming Zhu and Michael R. Lyu","title":"A Large-scale Benchmark for Log Parsing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Log data is pivotal in activities like anomaly detection and failure\ndiagnosis in the automated maintenance of software systems. Due to their\nunstructured format, log parsing is often required to transform them into a\nstructured format for automated analysis. A variety of log parsers exist,\nmaking it vital to benchmark these tools to comprehend their features and\nperformance. However, existing datasets for log parsing are limited in terms of\nscale and representativeness, posing challenges for studies that aim to\nevaluate or develop log parsers. This problem becomes more pronounced when\nthese parsers are evaluated for production use. To address these issues, we\nintroduce a new collection of large-scale annotated log datasets, named LogPub,\nwhich more accurately mirrors log data observed in real-world software systems.\nLogPub comprises 14 datasets, each averaging 3.6 million log lines. Utilizing\nLogPub, we re-evaluate 15 log parsers in a more rigorous and practical setting.\nWe also propose a new evaluation metric to lessen the sensitivity of current\nmetrics to imbalanced data distribution. Furthermore, we are the first to\nscrutinize the detailed performance of log parsers on logs that represent rare\nsystem events and offer comprehensive information for system troubleshooting.\nParsing such logs accurately is vital yet challenging. We believe that our work\ncould shed light on the design and evaluation of log parsers in more realistic\nsettings, thereby facilitating their implementation in production systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:24:15 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Jiang","Zhihan",""],["Liu","Jinyang",""],["Huang","Junjie",""],["Li","Yichen",""],["Huo","Yintong",""],["Gu","Jiazhen",""],["Chen","Zhuangbin",""],["Zhu","Jieming",""],["Lyu","Michael R.",""]]}
{"id":"2308.10829","submitter":"Elliot Fox","authors":"Elliot Fox (Durham U., IPPP), Nigel Glover (Durham U., IPPP and Zurich\n  U.)","title":"Initial-Final and Initial-Initial antenna functions for real radiation\n  at next-to-leading order","comments":"33 pages","journal-ref":null,"doi":null,"report-no":"IPPP/23/44, ZU-TH 47/23","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The antenna subtraction method has achieved remarkable success in various\nprocesses relevant to the Large Hadron Collider. In Reference [1], an algorithm\nwas proposed for constructing real-radiation antenna functions for\nelectron-positron annihilation, directly from specified unresolved limits,\naccommodating any number of real emissions. Here, we extend this algorithm to\nbuild antennae involving partons in the initial state, specifically the\ninitial-final and initial-initial antennae. Using this extended algorithm, we\nexplicitly construct all NLO QCD antenna functions and compare them with\npreviously extracted antenna functions derived from matrix elements.\nAdditionally, we rigorously match the integration of the antenna functions over\nthe initial-final and initial-initial unresolved phase space with the previous\napproach, providing an independent validation of our results. The improved\nantenna functions are more compact and reduced in number, making them more\nreadily applicable for higher-order calculations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:24:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fox","Elliot","","Durham U., IPPP"],["Glover","Nigel","","Durham U., IPPP and Zurich\n  U."]]}
{"id":"2308.10830","submitter":"Anna Tsai","authors":"Anna Tsai, Dylan L. Jow, Daniel Baker, Ue-Li Pen","title":"Scintillated microlensing: measuring cosmic distances with fast radio\n  bursts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel means of directly measuring cosmological distances using\nscintillated microlensing of fast radio bursts (FRBs). In standard strong\nlensing measurements of cosmic expansion, the main source of systematic\nuncertainty lies in modeling the mass profile of galactic halos. Using\nextra-galactic stellar microlensing to measure the Hubble constant avoids this\nsystematic uncertainty as the lens potential of microlenses depends only on a\nsingle parameter: the mass of the lens. FRBs, which may achieve nanosecond\nprecision on lensing time delays, are well-suited to precision measurements of\nstellar microlensing, for which the time delays are on the order of\nmilliseconds. However, typical angular separations between the microlensed\nimages on the order of microarcseconds make the individual images impossible to\nspatially resolve with ground-based telescopes. We propose leveraging\nscintillation in the ISM to resolve the microlensed images, effectively turning\nthe ISM into an astrophysical-scale interferometer. Using this technique, we\nestimate a 6\\% uncertainty on $H_0$ from a single observed scintillated\nmicrolensing event, with a sub-percent uncertainty on $H_0$ achievable with\nonly 30 such events. With an optical depth for stellar microlensing of\n$10^{-3}$, this may be achievable in the near future with upcoming FRB\ntelescopes.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 16:04:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Tsai","Anna",""],["Jow","Dylan L.",""],["Baker","Daniel",""],["Pen","Ue-Li",""]]}
{"id":"2308.10831","submitter":"Emmanuel Calvet","authors":"Emmanuel Calvet, Jean Rouat, Bertrand Reulet","title":"Excitatory/Inhibitory Balance Emerges as a Key Factor for RBN\n  Performance, Overriding Attractor Dynamics","comments":"22 pages, 6 figures","journal-ref":"Front. Comput. Neurosci. Volume 17 - 2023","doi":"10.3389/fncom.2023.1223258","report-no":null,"categories":"q-bio.NC cs.LG cs.NE stat.CO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Reservoir computing provides a time and cost-efficient alternative to\ntraditional learning methods.Critical regimes, known as the \"edge of chaos,\"\nhave been found to optimize computational performance in binary neural\nnetworks. However, little attention has been devoted to studying\nreservoir-to-reservoir variability when investigating the link between\nconnectivity, dynamics, and performance. As physical reservoir computers become\nmore prevalent, developing a systematic approach to network design is crucial.\nIn this article, we examine Random Boolean Networks (RBNs) and demonstrate that\nspecific distribution parameters can lead to diverse dynamics near critical\npoints. We identify distinct dynamical attractors and quantify their\nstatistics, revealing that most reservoirs possess a dominant attractor. We\nthen evaluate performance in two challenging tasks, memorization and\nprediction, and find that a positive excitatory balance produces a critical\npoint with higher memory performance. In comparison, a negative inhibitory\nbalance delivers another critical point with better prediction performance.\nInterestingly, we show that the intrinsic attractor dynamics have little\ninfluence on performance in either case.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 17:41:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Calvet","Emmanuel",""],["Rouat","Jean",""],["Reulet","Bertrand",""]]}
{"id":"2308.10832","submitter":"Gabriele Berton","authors":"Gabriele Berton, Gabriele Trivigno, Barbara Caputo, Carlo Masone","title":"EigenPlaces: Training Viewpoint Robust Models for Visual Place\n  Recognition","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual Place Recognition is a task that aims to predict the place of an image\n(called query) based solely on its visual features. This is typically done\nthrough image retrieval, where the query is matched to the most similar images\nfrom a large database of geotagged photos, using learned global descriptors. A\nmajor challenge in this task is recognizing places seen from different\nviewpoints. To overcome this limitation, we propose a new method, called\nEigenPlaces, to train our neural network on images from different point of\nviews, which embeds viewpoint robustness into the learned global descriptors.\nThe underlying idea is to cluster the training data so as to explicitly present\nthe model with different views of the same points of interest. The selection of\nthis points of interest is done without the need for extra supervision. We then\npresent experiments on the most comprehensive set of datasets in literature,\nfinding that EigenPlaces is able to outperform previous state of the art on the\nmajority of datasets, while requiring 60\\% less GPU memory for training and\nusing 50\\% smaller descriptors. The code and trained models for EigenPlaces are\navailable at {\\small{\\url{https://github.com/gmberton/EigenPlaces}}}, while\nresults with any other baseline can be computed with the codebase at\n{\\small{\\url{https://github.com/gmberton/auto_VPR}}}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:27:31 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Berton","Gabriele",""],["Trivigno","Gabriele",""],["Caputo","Barbara",""],["Masone","Carlo",""]]}
{"id":"2308.10833","submitter":"Domagoj Brada\\v{c}","authors":"Domagoj Brada\\v{c}, Jacob Fox, Benny Sudakov","title":"Ramsey numbers of hypergraphs of a given size","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $q$-color Ramsey number of a $k$-uniform hypergraph $H$ is the minimum\ninteger $N$ such that any $q$-coloring of the complete $k$-uniform hypergraph\non $N$ vertices contains a monochromatic copy of $H$. The study of these\nnumbers is one of the central topics in Combinatorics. In 1973, Erd\\H{o}s and\nGraham asked to maximize the Ramsey number of a graph as a function of the\nnumber of its edges. Motivated by this problem, we study the analogous question\nfor hypergaphs. For fixed $k \\ge 3$ and $q \\ge 2$ we prove that the largest\npossible $q$-color Ramsey number of a $k$-uniform hypergraph with $m$ edges is\nat most $\\mathrm{tw}_k(O(\\sqrt{m})),$ where $\\mathrm{tw}$ denotes the tower\nfunction. We also present a construction showing that this bound is tight for\n$q \\ge 4$. This resolves a problem by Conlon, Fox and Sudakov. They previously\nproved the upper bound for $k \\geq 4$ and the lower bound for $k=3$. Although\nin the graph case the tightness follows simply by considering a clique of\nappropriate size, for higher uniformities the construction is rather involved\nand is obtained by using paths in expander graphs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:31:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Brada\u010d","Domagoj",""],["Fox","Jacob",""],["Sudakov","Benny",""]]}
{"id":"2308.10834","submitter":"Muhammad Shahbaz Khan","authors":"Muhammad Shahbaz Khan, Jawad Ahmad, Hisham Ali, Nikolaos Pitropakis,\n  Ahmed Al-Dubai, Baraq Ghaleb, William J. Buchanan","title":"SRSS: A New Chaos-Based Single-Round Single S-Box Image Encryption\n  Scheme for Highly Auto-Correlated Data","comments":"6 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.IT math.IT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  With the advent of digital communication, securing digital images during\ntransmission and storage has become a critical concern. The traditional s-box\nsubstitution methods often fail to effectively conceal the information within\nhighly auto-correlated regions of an image. This paper addresses the security\nissues presented by three prevalent S-box substitution methods, i.e., single\nS-box, multiple S-boxes, and multiple rounds with multiple S-boxes, especially\nwhen handling images with highly auto-correlated pixels. To resolve the\naddressed security issues, this paper proposes a new scheme SRSS-the Single\nRound Single S-Box encryption scheme. SRSS uses a single S-box for substitution\nin just one round to break the pixel correlations and encrypt the plaintext\nimage effectively. Additionally, this paper introduces a new Chaos-based Random\nOperation Selection System-CROSS, which nullifies the requirement for multiple\nS-boxes, thus reducing the encryption scheme's complexity. By randomly\nselecting the operation to be performed on each pixel, driven by a chaotic\nsequence, the proposed scheme effectively scrambles even high auto-correlation\nareas. When compared to the substitution methods mentioned above, the proposed\nencryption scheme exhibited exceptionally well in just a single round with a\nsingle S-box. The close-to-ideal statistical security analysis results, i.e.,\nan entropy of 7.89 and a correlation coefficient of 0.007, validate the\neffectiveness of the proposed scheme. This research offers an innovative path\nforward for securing images in applications requiring low computational\ncomplexity and fast encryption and decryption speeds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:32:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khan","Muhammad Shahbaz",""],["Ahmad","Jawad",""],["Ali","Hisham",""],["Pitropakis","Nikolaos",""],["Al-Dubai","Ahmed",""],["Ghaleb","Baraq",""],["Buchanan","William J.",""]]}
{"id":"2308.10835","submitter":"Yan Wang","authors":"Yan Wang, Zhixuan Chu, Xin Ouyang, Simeng Wang, Hongyan Hao, Yue Shen,\n  Jinjie Gu, Siqiao Xue, James Y Zhang, Qing Cui, Longfei Li, Jun Zhou, Sheng\n  Li","title":"Enhancing Recommender Systems with Large Language Model Reasoning Graphs","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommendation systems aim to provide users with relevant suggestions, but\noften lack interpretability and fail to capture higher-level semantic\nrelationships between user behaviors and profiles. In this paper, we propose a\nnovel approach that leverages large language models (LLMs) to construct\npersonalized reasoning graphs. These graphs link a user's profile and\nbehavioral sequences through causal and logical inferences, representing the\nuser's interests in an interpretable way. Our approach, LLM reasoning graphs\n(LLMRG), has four components: chained graph reasoning, divergent extension,\nself-verification and scoring, and knowledge base self-improvement. The\nresulting reasoning graph is encoded using graph neural networks, which serves\nas additional input to improve conventional recommender systems, without\nrequiring extra user or item information. Our approach demonstrates how LLMs\ncan enable more logical and interpretable recommender systems through\npersonalized reasoning graphs. LLMRG allows recommendations to benefit from\nboth engineered recommendation systems and LLM-derived reasoning graphs. We\ndemonstrate the effectiveness of LLMRG on benchmarks and real-world scenarios\nin enhancing base recommendation models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:35:19 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wang","Yan",""],["Chu","Zhixuan",""],["Ouyang","Xin",""],["Wang","Simeng",""],["Hao","Hongyan",""],["Shen","Yue",""],["Gu","Jinjie",""],["Xue","Siqiao",""],["Zhang","James Y",""],["Cui","Qing",""],["Li","Longfei",""],["Zhou","Jun",""],["Li","Sheng",""]]}
{"id":"2308.10836","submitter":"Simon Thebaud","authors":"Simon Th\\'ebaud, Lucas Lindsay, Tom Berlijn","title":"Breaking Rayleigh's law with spatially correlated disorder to control\n  phonon transport","comments":null,"journal-ref":null,"doi":"10.1103/PhysRevLett.131.026301","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Controlling thermal transport in insulators and semiconductors is crucial for\nmany technological fields such as thermoelectrics and thermal insulation, for\nwhich a low thermal conductivity ($\\kappa$) is desirable. A major obstacle for\nrealizing low $\\kappa$ materials is Rayleigh's law, which implies that acoustic\nphonons, which carry most of the heat, are insensitive to scattering by point\ndefects at low energy. We demonstrate, with large scale simulations on tens of\nmillions of atoms, that isotropic long-range spatial correlations in the defect\ndistribution can dramatically reduce phonon lifetimes of important\nlow-frequency heat-carrying modes, leading to a large reduction of $\\kappa$ --\npotentially an order of magnitude at room temperature. We propose a general and\nquantitative framework for controlling thermal transport in complex functional\nmaterials through structural spatial correlations, and we establish the optimal\nfunctional form of spatial correlations that minimize $\\kappa$. We end by\nbriefly discussing experimental realizations of various correlated structures.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:35:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Th\u00e9baud","Simon",""],["Lindsay","Lucas",""],["Berlijn","Tom",""]]}
{"id":"2308.10837","submitter":"Yan Wang","authors":"Zhixuan Chu, Hongyan Hao, Xin Ouyang, Simeng Wang, Yan Wang, Yue Shen,\n  Jinjie Gu, Qing Cui, Longfei Li, Siqiao Xue, James Y Zhang, Sheng Li","title":"Leveraging Large Language Models for Pre-trained Recommender Systems","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in recommendation systems have shifted towards more\ncomprehensive and personalized recommendations by utilizing large language\nmodels (LLM). However, effectively integrating LLM's commonsense knowledge and\nreasoning abilities into recommendation systems remains a challenging problem.\nIn this paper, we propose RecSysLLM, a novel pre-trained recommendation model\nbased on LLMs. RecSysLLM retains LLM reasoning and knowledge while integrating\nrecommendation domain knowledge through unique designs of data, training, and\ninference. This allows RecSysLLM to leverage LLMs' capabilities for\nrecommendation tasks in an efficient, unified framework. We demonstrate the\neffectiveness of RecSysLLM on benchmarks and real-world scenarios. RecSysLLM\nprovides a promising approach to developing unified recommendation systems by\nfully exploiting the power of pre-trained language models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:39:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chu","Zhixuan",""],["Hao","Hongyan",""],["Ouyang","Xin",""],["Wang","Simeng",""],["Wang","Yan",""],["Shen","Yue",""],["Gu","Jinjie",""],["Cui","Qing",""],["Li","Longfei",""],["Xue","Siqiao",""],["Zhang","James Y",""],["Li","Sheng",""]]}
{"id":"2308.10838","submitter":"Giulia Preti","authors":"Giulia Preti, Gianmarco De Francisci Morales, Matteo Riondato","title":"An impossibility result for Markov Chain Monte Carlo sampling from\n  micro-canonical bipartite graph ensembles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Markov Chain Monte Carlo (MCMC) algorithms are commonly used to sample from\ngraph ensembles. Two graphs are neighbors in the state space if one can be\nobtained from the other with only a few modifications, e.g., edge rewirings.\nFor many common ensembles, e.g., those preserving the degree sequences of\nbipartite graphs, rewiring operations involving two edges are sufficient to\ncreate a fully-connected state space, and they can be performed efficiently. We\nshow that, for ensembles of bipartite graphs with fixed degree sequences and\nnumber of butterflies (k2,2 bi-cliques), there is no universal constant c such\nthat a rewiring of at most c edges at every step is sufficient for any such\nensemble to be fully connected. Our proof relies on an explicit construction of\na family of pairs of graphs with the same degree sequences and number of\nbutterflies, with each pair indexed by a natural c, and such that any sequence\nof rewiring operations transforming one graph into the other must include at\nleast one rewiring operation involving at least c edges. Whether rewiring these\nmany edges is sufficient to guarantee the full connectivity of the state space\nof any such ensemble remains an open question. Our result implies the\nimpossibility of developing efficient, graph-agnostic, MCMC algorithms for\nthese ensembles, as the necessity to rewire an impractically large number of\nedges may hinder taking a step on the state space.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:40:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Preti","Giulia",""],["Morales","Gianmarco De Francisci",""],["Riondato","Matteo",""]]}
{"id":"2308.10839","submitter":"Tianyi Sun","authors":"Tianyi Sun","title":"Vision Transformer Pruning Via Matrix Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is a further development of Vision Transformer Pruning via matrix\ndecomposition. The purpose of the Vision Transformer Pruning is to prune the\ndimension of the linear projection of the dataset by learning their associated\nimportance score in order to reduce the storage, run-time memory, and\ncomputational demands. In this paper we further reduce dimension and complexity\nof the linear projection by implementing and comparing several matrix\ndecomposition methods while preserving the generated important features. We end\nup selected the Singular Value Decomposition as the method to achieve our goal\nby comparing the original accuracy scores in the original Github repository and\nthe accuracy scores of using those matrix decomposition methods, including\nSingular Value Decomposition, four versions of QR Decomposition, and LU\nfactorization.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:40:51 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sun","Tianyi",""]]}
{"id":"2308.10840","submitter":"Vimal William","authors":"Vimal W and Akshansh Gupta","title":"Deep Learning Architecture for Motor Imaged Words","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The notion of a Brain-Computer Interface system is the acquisition of signals\nfrom the brain, processing them, and translating them into commands. The study\nconcentrated on a specific sort of brain signal known as Motor Imagery EEG\nsignals, which are activated in the brain without any external stimulus of the\nneeded motor activities in relation to the signal. The signals are further\nprocessed using complicated signal processing methods such as wavelet-based\ndenoising and Independent Component Analysis (ICA) based dimensionality\nreduction approach. To extract the characteristics from the processed data,\nboth signal processing includes Short-Term Fourier Transforms (STFT) and a\nprobabilistic approach such as Gramian Angular field Theory are used.\nFurthermore, the gathered feature signals are analyzed and converted into\nnoteworthy commands by Deep Learning algorithms, which can be a mix of\ncomplicated Deep Learning algorithm families such as CNN and RNN. The Weights\nof trained model with the particular subject is further used for the multiple\nsubject which shows in the elevation of accuracy rate in translating the Motor\nImagery EEG signals into the relevant motor actions\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 12:07:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["W","Vimal",""],["Gupta","Akshansh",""]]}
{"id":"2308.10841","submitter":"Nikhil Hadap","authors":"Nikhil D. Hadap","title":"Lienard-Wiechert Potentials due to a 'classically' spinning point-charge\n  in Non-Relativistic arbitrary motion","comments":"17 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lienard-Wiechert potentials have been derived for a non-relativistically\nmoving and 'classically' spinning point-charge; assuming it to be a rigid,\nmoving and spinning charged-sphere, and subsequently reducing its dimensions to\n\"point-particle\" limit. The paper demonstrates that when the effect of\n\"rotational-acceleration\" were considered, together with causality, expressions\nfor the LW potentials accompany additional correction terms that contain\nspin-angular-momentum (or simply the \"classical spin\") of the point-charge.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 12:27:58 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hadap","Nikhil D.",""]]}
{"id":"2308.10842","submitter":"Hugo Caselles-Dupr\\'e","authors":"Hugo Caselles-Dupr\\'e, Olivier Sigaud, Mohamed Chetouani","title":"Enhancing Agent Communication and Learning through Action and Language","comments":"IMOL workshop, Paris 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel category of GC-agents capable of functioning as both\nteachers and learners. Leveraging action-based demonstrations and\nlanguage-based instructions, these agents enhance communication efficiency. We\ninvestigate the incorporation of pedagogy and pragmatism, essential elements in\nhuman communication and goal achievement, enhancing the agents' teaching and\nlearning capabilities. Furthermore, we explore the impact of combining\ncommunication modes (action and language) on learning outcomes, highlighting\nthe benefits of a multi-modal approach.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:45:21 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 13:55:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Caselles-Dupr\u00e9","Hugo",""],["Sigaud","Olivier",""],["Chetouani","Mohamed",""]]}
{"id":"2308.10843","submitter":"Mireille Fares","authors":"Mireille Fares, Catherine Pelachaud, Nicolas Obin","title":"TranSTYLer: Multimodal Behavioral Style Transfer for Facial and Body\n  Gestures Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CV cs.LG cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the challenge of transferring the behavior expressivity\nstyle of a virtual agent to another one while preserving behaviors shape as\nthey carry communicative meaning. Behavior expressivity style is viewed here as\nthe qualitative properties of behaviors. We propose TranSTYLer, a multimodal\ntransformer based model that synthesizes the multimodal behaviors of a source\nspeaker with the style of a target speaker. We assume that behavior\nexpressivity style is encoded across various modalities of communication,\nincluding text, speech, body gestures, and facial expressions. The model\nemploys a style and content disentanglement schema to ensure that the\ntransferred style does not interfere with the meaning conveyed by the source\nbehaviors. Our approach eliminates the need for style labels and allows the\ngeneralization to styles that have not been seen during the training phase. We\ntrain our model on the PATS corpus, which we extended to include dialog acts\nand 2D facial landmarks. Objective and subjective evaluations show that our\nmodel outperforms state of the art models in style transfer for both seen and\nunseen styles during training. To tackle the issues of style and content\nleakage that may arise, we propose a methodology to assess the degree to which\nbehavior and gestures associated with the target style are successfully\ntransferred, while ensuring the preservation of the ones related to the source\ncontent.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 15:42:35 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Fares","Mireille",""],["Pelachaud","Catherine",""],["Obin","Nicolas",""]]}
{"id":"2308.10844","submitter":"Vidya Venkateswaran","authors":"Vidya Venkateswaran","title":"Affine Hecke algebras and symmetric quasi-polynomial duality","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent paper with Sahi and Stokman, we introduced quasi-polynomial\ngeneralizations of Macdonald polynomials for arbitrary root systems via a new\nclass of representations of the double affine Hecke algebra. These objects\ndepend on a deformation parameter $q$, Hecke parameters, and an additional\ntorus parameter. In this paper, we study $\\textit{antisymmetric}$ and\n$\\textit{symmetric}$ quasi-polynomial analogs of Macdonald polynomials in the\n$q \\rightarrow \\infty$ limit. We provide explicit decomposition formulas for\nthese objects in terms of classical Demazure-Lusztig operators and partial\nsymmetrizers, and relate them to Macdonald polynomials with prescribed symmetry\nin the same limit. We also provide a complete characterization of\n(anti-)symmetric quasi-polynomials in terms of partially (anti-)symmetric\npolynomials. As an application, we obtain formulas for metaplectic spherical\nWhittaker functions associated to arbitrary root systems. For $GL_{r}$, this\nrecovers some recent results of Brubaker, Buciumas, Bump, and Gustafsson, and\nproves a precise statement of their conjecture about a ``parahoric-metaplectic\"\nduality.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:44:03 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Venkateswaran","Vidya",""]]}
{"id":"2308.10845","submitter":"Diodato Ferraioli","authors":"Vincenzo Auletta and Francesco Carbone and Diodato Ferraioli","title":"Election Manipulation in Social Networks with Single-Peaked Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.MA cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Several elections run in the last years have been characterized by attempts\nto manipulate the result of the election through the diffusion of fake or\nmalicious news over social networks. This problem has been recognized as a\ncritical issue for the robustness of our democracy. Analyzing and understanding\nhow such manipulations may occur is crucial to the design of effective\ncountermeasures to these practices.\n  Many studies have observed that, in general, to design an optimal\nmanipulation is usually a computationally hard task. Nevertheless, literature\non bribery in voting and election manipulation has frequently observed that\nmost hardness results melt down when one focuses on the setting of (nearly)\nsingle-peaked agents, i.e., when each voter has a preferred candidate (usually,\nthe one closer to her own belief) and preferences of remaining candidates are\ninversely proportional to the distance between the candidate position and the\nvoter's belief. Unfortunately, no such analysis has been done for election\nmanipulations run in social networks.\n  In this work, we try to close this gap: specifically, we consider a setting\nfor election manipulation that naturally raises (nearly) single-peaked\npreferences, and we evaluate the complexity of election manipulation problem in\nthis setting: while most of the hardness and approximation results still hold,\nwe will show that single-peaked preferences allow to design simple, efficient\nand effective heuristics for election manipulation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:44:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Auletta","Vincenzo",""],["Carbone","Francesco",""],["Ferraioli","Diodato",""]]}
{"id":"2308.10846","submitter":"Pranay Pasula","authors":"Pranay Pasula","title":"Real World Time Series Benchmark Datasets with Distribution Shifts:\n  Global Crude Oil Price and Volatility","comments":"7 pages, 5 figures. Awarded Best Paper Runner Up / Honorable Mention\n  and presented as Contributed Talk at IJCAI 2023, the 32nd International Joint\n  Conference on Artificial Intelligence (AI4TS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The scarcity of task-labeled time-series benchmarks in the financial domain\nhinders progress in continual learning. Addressing this deficit would foster\ninnovation in this area. Therefore, we present COB, Crude Oil Benchmark\ndatasets. COB includes 30 years of asset prices that exhibit significant\ndistribution shifts and optimally generates corresponding task (i.e., regime)\nlabels based on these distribution shifts for the three most important crude\noils in the world. Our contributions include creating real-world benchmark\ndatasets by transforming asset price data into volatility proxies, fitting\nmodels using expectation-maximization (EM), generating contextual task labels\nthat align with real-world events, and providing these labels as well as the\ngeneral algorithm to the public. We show that the inclusion of these task\nlabels universally improves performance on four continual learning algorithms,\nsome state-of-the-art, over multiple forecasting horizons. We hope these\nbenchmarks accelerate research in handling distribution shifts in real-world\ndata, especially due to the global importance of the assets considered. We've\nmade the (1) raw price data, (2) task labels generated by our approach, (3) and\ncode for our algorithm available at https://oilpricebenchmarks.github.io.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:44:56 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pasula","Pranay",""]]}
{"id":"2308.10847","submitter":"Graham Enos","authors":"Graham R. Enos, Matthew J. Reagor, Eric Hulburd","title":"Evaluating quantum generative models via imbalanced data classification\n  benchmarks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A limited set of tools exist for assessing whether the behavior of quantum\nmachine learning models diverges from conventional models, outside of abstract\nor theoretical settings. We present a systematic application of explainable\nartificial intelligence techniques to analyze synthetic data generated from a\nhybrid quantum-classical neural network adapted from twenty different\nreal-world data sets, including solar flares, cardiac arrhythmia, and speech\ndata. Each of these data sets exhibits varying degrees of complexity and class\nimbalance. We benchmark the quantum-generated data relative to state-of-the-art\nmethods for mitigating class imbalance for associated classification tasks. We\nleverage this approach to elucidate the qualities of a problem that make it\nmore or less likely to be amenable to a hybrid quantum-classical generative\nmodel.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:46:36 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Enos","Graham R.",""],["Reagor","Matthew J.",""],["Hulburd","Eric",""]]}
{"id":"2308.10848","submitter":"Weize Chen","authors":"Weize Chen, Yusheng Su, Jingwei Zuo, Cheng Yang, Chenfei Yuan, Chen\n  Qian, Chi-Min Chan, Yujia Qin, Yaxi Lu, Ruobing Xie, Zhiyuan Liu, Maosong\n  Sun, Jie Zhou","title":"AgentVerse: Facilitating Multi-Agent Collaboration and Exploring\n  Emergent Behaviors in Agents","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous agents empowered by Large Language Models (LLMs) have undergone\nsignificant improvements, enabling them to generalize across a broad spectrum\nof tasks. However, in real-world scenarios, cooperation among individuals is\noften required to enhance the efficiency and effectiveness of task\naccomplishment. Hence, inspired by human group dynamics, we propose a\nmulti-agent framework \\framework that can collaboratively and dynamically\nadjust its composition as a greater-than-the-sum-of-its-parts system. Our\nexperiments demonstrate that \\framework framework can effectively deploy\nmulti-agent groups that outperform a single agent. Furthermore, we delve into\nthe emergence of social behaviors among individual agents within a group during\ncollaborative task accomplishment. In view of these behaviors, we discuss some\npossible strategies to leverage positive ones and mitigate negative ones for\nimproving the collaborative potential of multi-agent groups. Our codes for\n\\framework will soon be released at\n\\url{https://github.com/OpenBMB/AgentVerse}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:47:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Weize",""],["Su","Yusheng",""],["Zuo","Jingwei",""],["Yang","Cheng",""],["Yuan","Chenfei",""],["Qian","Chen",""],["Chan","Chi-Min",""],["Qin","Yujia",""],["Lu","Yaxi",""],["Xie","Ruobing",""],["Liu","Zhiyuan",""],["Sun","Maosong",""],["Zhou","Jie",""]]}
{"id":"2308.10849","submitter":"Gabriele Bruell","authors":"Gabriele Bruell and Long Pei","title":"Existence, regularity, and symmetry of periodic traveling waves for\n  Gardner-Ostrovsky type equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study the existence, regularity, and symmetry of periodic traveling\nsolutions to a class of Gardner-Ostrovsky type equations, including the\nclassical Gardner-Ostrovsky equation, the (modified) Ostrovsky, and the reduced\n(modified) Ostrovsky equation. The modified Ostrovsky equation is also known as\nthe short pulse equation. The Gardner-Ostrovsky equation is a model for\ninternal ocean waves of large amplitude. We prove the existence of nontrivial,\nperiodic traveling wave solutions using local bifurcation theory, where the\nwave speed serves as the bifurcation parameter. Moreover, we give a regularity\nanalysis for periodic traveling solutions in the presence as well as absence of\nBoussinesq dispersion. We see that the presence of Boussinesq dispersion\nimplies smoothness of periodic traveling wave solutions, while its absence may\nlead to singularities in the form of peaks or cusps. Eventually, we study the\nsymmetry of periodic traveling solutions by the method of moving planes. A\nnovel feature of the symmetry results in the absence of Boussinesq dispersion\nis that we do not need to impose a traditional monotonicity condition or a\nrecently developed reflection criterion on the wave profiles to prove the\nstatement on the symmetry of periodic traveling waves.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:47:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bruell","Gabriele",""],["Pei","Long",""]]}
{"id":"2308.10850","submitter":"Ziqi Niu","authors":"Ziqi Niu, Yue Jiang, Jianming Wen, Chuanwei Zhang, Shengwang Du, Irina\n  Novikova","title":"Four-wave mixing with anti-parity-time symmetry in hot $^{85}$Rb vapor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report an experimental demonstration of anti-parity-time (anti-PT)\nsymmetric optical four-wave mixing in thermal Rubidium vapor, where the\npropagation of two conjugate optical fields in a double-$\\Lambda$ scheme is\ngoverned by a non-Hermitian Hamiltonian. We are particularly interested in\nstudying quantum intensity correlations between the two conjugate fields near\nthe exceptional point, taking into account loss and accompanied Langevin noise.\nOur experimental measurements of classical four-wave mixing gain and the\nassociated two-mode relative-intensity squeezing are in reasonable agreement\nwith the theoretical predictions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:47:54 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Niu","Ziqi",""],["Jiang","Yue",""],["Wen","Jianming",""],["Zhang","Chuanwei",""],["Du","Shengwang",""],["Novikova","Irina",""]]}
{"id":"2308.10851","submitter":"Omar Makke","authors":"Omar Makke and Feng Lin","title":"Learning in Dynamic Systems and Its Application to Adaptive PID Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning using neural networks has revolutionized machine learning and\nput artificial intelligence into everyday life. In order to introduce\nself-learning to dynamic systems other than neural networks, we extend the\nBrandt-Lin learning algorithm of neural networks to a large class of dynamic\nsystems. This extension is possible because the Brandt-Lin algorithm does not\nrequire a dedicated step to back-propagate the errors in neural networks. To\nthis end, we first generalize signal-flow graphs so that they can be used to\nmodel nonlinear systems as well as linear systems. We then derive the extended\nBrandt-Lin algorithm that can be used to adapt the weights of branches in\ngeneralized signal-flow graphs. We show the applications of the new algorithm\nby applying it to adaptive PID control. In particular, we derive a new\nadaptation law for PID controllers. We verify the effectiveness of the method\nusing simulations for linear and nonlinear plants, stable as well as unstable\nplants.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:48:11 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Makke","Omar",""],["Lin","Feng",""]]}
{"id":"2308.10852","submitter":"William Bennett","authors":"William Bennett and Ryan G. McClarren","title":"Uncertainty benchmarks for time-dependent transport problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Uncertainty quantification results are presented for a well known\nverification solution, the time dependent transport infinite plane pulse. The\nmethod of polynomial chaos expansions (PCE) is employed for quick and accurate\ncalculation of the quantities of interest. Also, the method of uncollided\nsolutions is used in this problem to treat part of the uncertainty calculation\nanalytically.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:48:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bennett","William",""],["McClarren","Ryan G.",""]]}
{"id":"2308.10853","submitter":"Alex Iosevich","authors":"Paige Bright, Xinyu Fang, Barrett Heritage, Alex Iosevich, Tingsong\n  Jiang, Hans Parshall, and Maxwell Sun","title":"Generalized point configurations in ${\\mathbb F}_q^d$","comments":"arXiv admin note: text overlap with arXiv:1802.06460","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we generalize \\cite{IosevichParshall}, \\cite{LongPaths} and\n\\cite{cycles} by allowing the \\emph{distance} between two points in a finite\nfield vector space to be defined by a general non-degenerate bilinear form or\nquadratic form. We prove the same bounds on the sizes of large subsets of\n$\\F_q^d$ for them to contain distance graphs with a given maximal vertex\ndegree, under the more general notion of distance. We also prove the same\nresults for embedding paths, trees and cycles in the general setting.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:49:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bright","Paige",""],["Fang","Xinyu",""],["Heritage","Barrett",""],["Iosevich","Alex",""],["Jiang","Tingsong",""],["Parshall","Hans",""],["Sun","Maxwell",""]]}
{"id":"2308.10854","submitter":"Zeke Insepov","authors":"B. Zhumabay, R. Dagarbek, D. Kantarbayeva, I. Nevmerzhitsky, B.\n  Rakymetov, A. Serikkanov, Zh. Alsar, K.B. Tynyshtykbayev, and Z. Insepov","title":"Thermophysical Characteristics of the Porous Silicon Samples Formed by\n  Electrochemical, Chemical and Combined Etching Methods","comments":"20 pages, 8 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The article addresses the thermophysical properties of porous silicon (PS)\nsamples produced through electrochemical (EC), metal-assisted chemical (MACE),\nand combined (MACE + EC) etching methods. The PS/MACE+EC sample's\nthermophysical properties exhibited higher values than both the PS/EC and\nPS/MACE. The energy activity associated with the process of water splitting on\nthe surface of porous silicon (PS) formed by the metal-assisted chemical\netching (MACE) combined with the electrochemical etching (EC) method is found\nto be more significant compared to the PS samples prepared using only EC or\nMACE techniques. The combined MACE/EC method is considered the most effective\ntechnique for obtaining PS with a nanoporous silicon surface, which has the\nhighest energy activity in water-splitting processes. The activation energy\nrequired for water splitting, denoted as Ea (PS/MACE+EC), exhibits a higher\nvalue compared to the activation energies observed for the Ea (PS/EC) and Ea\n(PS/MACE) samples. The inclusion of nickel (Ni) particles within the pores of\nporous silicon (PS<Ni>) serves to stabilize the thermophysical properties of\nthe material. Consequently, this prevents substantial alterations in the\nthermal characteristics of PS<Ni> compared to PS without nickel in its pores.\nThe samples containing nickel (PS/MACE) and PS/MACE+EC exhibit long-term\npreservation of their energy activity (Ea) for one year. This phenomenon occurs\ndue to the presence of nickel-containing nanopores within the samples. The\narticle additionally examines the thermophysical properties of porous silicon\n(PS) in comparison to crystalline silicon (c-Si) and powdered silicon\n(powder-Si).\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:49:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhumabay","B.",""],["Dagarbek","R.",""],["Kantarbayeva","D.",""],["Nevmerzhitsky","I.",""],["Rakymetov","B.",""],["Serikkanov","A.",""],["Alsar","Zh.",""],["Tynyshtykbayev","K. B.",""],["Insepov","Z.",""]]}
{"id":"2308.10855","submitter":"Shulin Huang","authors":"Shulin Huang, Shirong Ma, Yinghui Li, Mengzuo Huang, Wuhe Zou, Weidong\n  Zhang, Hai-Tao Zheng","title":"LatEval: An Interactive LLMs Evaluation Benchmark with Incomplete\n  Information from Lateral Thinking Puzzles","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the continuous evolution and refinement of LLMs, they are endowed with\nimpressive logical reasoning or vertical thinking capabilities. But can they\nthink out of the box? Do they possess proficient lateral thinking abilities?\nFollowing the setup of Lateral Thinking Puzzles, we propose a novel evaluation\nbenchmark, LatEval, which assesses the model's lateral thinking within an\ninteractive framework. In our benchmark, we challenge LLMs with 2 aspects: the\nquality of questions posed by the model and the model's capability to integrate\ninformation for problem-solving. We find that nearly all LLMs struggle with\nemploying lateral thinking during interactions. For example, even the most\nadvanced model, GPT-4, exhibits the advantage to some extent, yet still\nmaintain a noticeable gap when compared to human. This evaluation benchmark\nprovides LLMs with a highly challenging and distinctive task that is crucial to\nan effective AI assistant.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:49:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Huang","Shulin",""],["Ma","Shirong",""],["Li","Yinghui",""],["Huang","Mengzuo",""],["Zou","Wuhe",""],["Zhang","Weidong",""],["Zheng","Hai-Tao",""]]}
{"id":"2308.10856","submitter":"Aobo Li","authors":"I.J. Arnquist, F.T. Avignone III, A.S. Barabash, C.J. Barton, K.H.\n  Bhimani, E. Blalock, B. Bos, M. Busch, M. Buuck, T.S. Caldwell, Y.-D. Chan,\n  C.D. Christofferson, P.-H. Chu, M.L. Clark, C. Cuesta, J.A. Detwiler, Yu.\n  Efremenko, H. Ejiri, S.R. Elliott, N. Fuad, G.K. Giovanetti, M.P. Green, J.\n  Gruszko, I.S. Guinn, V.E. Guiseppe, C.R. Haufe, R. Henning, D. Hervas\n  Aguilar, E.W. Hoppe, A. Hostiuc, M.F. Kidd, I. Kim, R.T. Kouzes, T.E. Lannen\n  V, A. Li, J.M. Lopez-Castano, R.D. Martin, R. Massarczyk, S.J. Meijer, S.\n  Mertens, T.K. Oli, L.S. Paudel, W. Pettus, A.W.P. Poon, B. Quenallata, D.C.\n  Radford, A.L. Reine, K. Rielage, N.W. Ruof, D.C. Schaper, S.J. Schleich, D.\n  Tedeschi, R.L. Varner, S. Vasilyev, S.L. Watkins, J.F. Wilkerson, C. Wiseman,\n  W. Xu, C.-H. Yu, and B.X. Zhu","title":"Majorana Demonstrator Data Release for AI/ML Applications","comments":"Zenodo DOI: https://doi.org/10.5281/zenodo.8257027","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG nucl-ex physics.data-an physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The enclosed data release consists of a subset of the calibration data from\nthe Majorana Demonstrator experiment. Each Majorana event is accompanied by raw\nGermanium detector waveforms, pulse shape discrimination cuts, and calibrated\nfinal energies, all shared in an HDF5 file format along with relevant metadata.\nThis release is specifically designed to support the training and testing of\nArtificial Intelligence (AI) and Machine Learning (ML) algorithms upon our\ndata. This document is structured as follows. Section I provides an overview of\nthe dataset's content and format; Section II outlines the location of this\ndataset and the method for accessing it; Section III presents the NPML Machine\nLearning Challenge associated with this dataset; Section IV contains a\ndisclaimer from the Majorana collaboration regarding the use of this dataset;\nAppendix A contains technical details of this data release. Please direct\nquestions about the material provided within this release to liaobo77@ucsd.edu\n(A. Li).\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:50:59 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 01:31:28 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Arnquist","I. J.",""],["Avignone","F. T.","III"],["Barabash","A. S.",""],["Barton","C. J.",""],["Bhimani","K. H.",""],["Blalock","E.",""],["Bos","B.",""],["Busch","M.",""],["Buuck","M.",""],["Caldwell","T. S.",""],["Chan","Y. -D.",""],["Christofferson","C. D.",""],["Chu","P. -H.",""],["Clark","M. L.",""],["Cuesta","C.",""],["Detwiler","J. A.",""],["Efremenko","Yu.",""],["Ejiri","H.",""],["Elliott","S. R.",""],["Fuad","N.",""],["Giovanetti","G. K.",""],["Green","M. P.",""],["Gruszko","J.",""],["Guinn","I. S.",""],["Guiseppe","V. E.",""],["Haufe","C. R.",""],["Henning","R.",""],["Aguilar","D. Hervas",""],["Hoppe","E. W.",""],["Hostiuc","A.",""],["Kidd","M. F.",""],["Kim","I.",""],["Kouzes","R. T.",""],["Lannen","T. E.","V"],["Li","A.",""],["Lopez-Castano","J. M.",""],["Martin","R. D.",""],["Massarczyk","R.",""],["Meijer","S. J.",""],["Mertens","S.",""],["Oli","T. K.",""],["Paudel","L. S.",""],["Pettus","W.",""],["Poon","A. W. P.",""],["Quenallata","B.",""],["Radford","D. C.",""],["Reine","A. L.",""],["Rielage","K.",""],["Ruof","N. W.",""],["Schaper","D. C.",""],["Schleich","S. J.",""],["Tedeschi","D.",""],["Varner","R. L.",""],["Vasilyev","S.",""],["Watkins","S. L.",""],["Wilkerson","J. F.",""],["Wiseman","C.",""],["Xu","W.",""],["Yu","C. -H.",""],["Zhu","B. X.",""]]}
{"id":"2308.10857","submitter":"Thomas Drury","authors":"Thomas Drury, Juan J Abellan, Nicky Best, Ian R. White","title":"Estimation of treatment policy estimands for continuous outcomes using\n  off treatment sequential multiple imputation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The estimands framework outlined in ICH E9 (R1) describes the components\nneeded to precisely define the effects to be estimated in clinical trials,\nwhich includes how post-baseline \"intercurrent\" events (IEs) are to be handled.\nIn late-stage clinical trials, it is common to handle intercurrent events like\n\"treatment discontinuation\" using the treatment policy strategy and target the\ntreatment effect on all outcomes regardless of treatment discontinuation. For\ncontinuous repeated measures, this type of effect is often estimated using all\nobserved data before and after discontinuation using either a mixed model for\nrepeated measures (MMRM) or multiple imputation (MI) to handle any missing\ndata. In basic form, both of these estimation methods ignore treatment\ndiscontinuation in the analysis and therefore may be biased if there are\ndifferences in patient outcomes after treatment discontinuation compared to\npatients still assigned to treatment, and missing data being more common for\npatients who have discontinued treatment. We therefore propose and evaluate a\nset of MI models that can accommodate differences between outcomes before and\nafter treatment discontinuation. The models are evaluated in the context of\nplanning a phase 3 trial for a respiratory disease. We show that analyses\nignoring treatment discontinuation can introduce substantial bias and can\nsometimes underestimate variability. We also show that some of the MI models\nproposed can successfully correct the bias but inevitably lead to increases in\nvariance. We conclude that some of the proposed MI models are preferable to the\ntraditional analysis ignoring treatment discontinuation, but the precise choice\nof MI model will likely depend on the trial design, disease of interest and\namount of observed and missing data following treatment discontinuation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:55:00 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 10:50:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Drury","Thomas",""],["Abellan","Juan J",""],["Best","Nicky",""],["White","Ian R.",""]]}
{"id":"2308.10858","submitter":"Lee Alacoque","authors":"Lee R. Alacoque (1), Anurag Bhattacharyya (2), Kai A. James (3) ((1)\n  University of Illinois Urbana-Champaign, (2) Palo Alto Research Center, (3)\n  Georgia Institute of Technology)","title":"Compliant Mechanism Synthesis Using Nonlinear Elastic Topology\n  Optimization with Variable Boundary Conditions","comments":"30 pages, 14 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In topology optimization of compliant mechanisms, the specific placement of\nboundary conditions strongly affects the resulting material distribution and\nperformance of the design. At the same time, the most effective locations of\nthe loads and supports are often difficult to find manually. This substantially\nlimits topology optimization's effectiveness for many mechanism design\nproblems. We remove this limitation by developing a method which automatically\ndetermines optimal positioning of a prescribed input displacement and a set of\nsupports simultaneously with an optimal material layout. Using nonlinear\nelastic physics, we synthesize a variety of compliant mechanisms with large\noutput displacements, snap-through responses, and prescribed output paths,\nproducing designs with significantly improved performance in every case tested.\nCompared to optimal designs generated using best-guess boundary conditions used\nin previous studies, the mechanisms presented in this paper see performance\nincreases ranging from 23%-430%. The results show that nonlinear mechanism\nresponses may be particularly sensitive to boundary condition locations and\nthat effective placements can be difficult to find without an automated method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:56:14 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Alacoque","Lee R.",""],["Bhattacharyya","Anurag",""],["James","Kai A.",""]]}
{"id":"2308.10859","submitter":"Simon Becker","authors":"Simon Becker, Tristan Humbert, Jens Wittsten, Mengxuan Yang","title":"Chiral limit of twisted trilayer graphene","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.mes-hall cond-mat.str-el math.AP math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We initiate the mathematical study of the Bistritzer-MacDonald Hamiltonian\nfor twisted trilayer graphene in the chiral limit (and beyond). We develop a\nspectral theoretic approach to investigate the presence of flat bands under\nspecific magic parameters. This allows us to derive trace formulae that show\nthat the tunnelling parameters that lead to flat bands are nowhere continuous\nas functions of the twisting angles.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 16:59:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Becker","Simon",""],["Humbert","Tristan",""],["Wittsten","Jens",""],["Yang","Mengxuan",""]]}
{"id":"2308.10860","submitter":"Yanzeng Zhang","authors":"Yanzeng Zhang and Jun Li and Xianzhu Tang","title":"Electron heat flux and propagating fronts in plasma thermal quench via\n  ambipolar transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The thermal collapse of a nearly collisionless plasma interacting with a\ncooling spot, in which the electron parallel heat flux plays an essential role,\nis investigated both theoretically and numerically. We show that such thermal\ncollapse, which is known as thermal quench in tokamaks, comes about in the form\nof propagating fronts, originating from the cooling spot, along the magnetic\nfield lines. The slow fronts, propagating with local ion sound speed, limit the\naggressive cooling of plasma, which is accompanied by a plasma cooling flow\ntoward the cooling spot. The extraordinary physics underlying such a cooling\nflow is that the fundamental constraint of ambipolar transport along the field\nline limits the spatial gradient of electron thermal conduction flux to the\nmuch weaker convective scaling, as opposed to the free-streaming scaling, so\nthat a large electron temperature and hence pressure gradient can be sustained.\nThe last ion front for a radiative cooling spot is a shock front where cold but\nflowing ions meet the hot ions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:03:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhang","Yanzeng",""],["Li","Jun",""],["Tang","Xianzhu",""]]}
{"id":"2308.10861","submitter":"Romain Aza\\\"is","authors":"Farah Ben Naoum, Christophe Godin, Romain Aza\\\"is","title":"Characterization of random walks on space of unordered trees using\n  efficient metric simulation","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The simple random walk on $\\mathbb{Z}^p$ shows two drastically different\nbehaviours depending on the value of $p$: it is recurrent when $p\\in\\{1,2\\}$\nwhile it escapes (with a rate increasing with $p$) as soon as $p\\geq3$. This\nclassical example illustrates that the asymptotic properties of a random walk\nprovides some information on the structure of its state space. This paper aims\nto explore analogous questions on space made up of combinatorial objects with\nno algebraic structure. We take as a model for this problem the space of\nunordered unlabeled rooted trees endowed with Zhang edit distance. To this end,\nit defines the canonical unbiased random walk on the space of trees and\nprovides an efficient algorithm to evaluate its escape rate. Compared to Zhang\nalgorithm, it is incremental and computes the edit distance along the random\nwalk approximately 100 times faster on trees of size $500$ on average. The\nescape rate of the random walk on trees is precisely estimated using intensive\nnumerical simulations, out of reasonable reach without the incremental\nalgorithm.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:04:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Naoum","Farah Ben",""],["Godin","Christophe",""],["Aza\u00efs","Romain",""]]}
{"id":"2308.10862","submitter":"Carlos Navarrete","authors":"Carlos Navarrete and Mariana Macedo and Viktor Stojkoski and Marcela\n  Parada","title":"Election Polarization: Mapping citizen divisions through elections","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Elections can unveil citizens' enthusiasm and discomfort concerning political\ncandidates, parties, and issues. While a substantial body of literature studies\nthe election outcomes from the perspective of winners and losers, an\nunder-explored condition to understand societal divisions emerges from citizen\nvoting patterns. Here, we examine the concept of Election Polarization (EP) as\na measure of citizens' divisions on Election Day. We present an agnostic\napproach that relies exclusively on election data and considers the\ncompetitiveness of candidates (Between-EP) and their voting dispersion\nthroughout a territory (Within-EP). We use both synthetic data and presidential\nelection results from France, Chile, and the United States to show that our\napproach successfully identified theoretical expectations of ``polarized''\nelections. Furthermore, we validate its robustness over the election type,\naggregation scale, use of abstentions/spoilt votes, and the number of\ncandidates. Finally, our analysis reveals that state-level Within-EP and\nBetween-EP in the U.S. are positively associated with political polarization\nand political interest, respectively, shedding light that EP could potentially\nencompass a simple and reliable measure of quasi-political polarization,\nopening the opportunity of studying this phenomenon both for regional level and\nlower/middle-income countries without electoral surveys.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 18:06:00 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Navarrete","Carlos",""],["Macedo","Mariana",""],["Stojkoski","Viktor",""],["Parada","Marcela",""]]}
{"id":"2308.10863","submitter":"Qiao Yang","authors":"Qiao Yang, Yu-Biao Wu, Lin Zhuang, Ji-Min Zhao, Wu-Ming Liu","title":"Lorentz-Invariant Interactions in Honeycomb Lattice with Hubbard\n  Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive Lorentz-invariant four-fermion interactions, including\nNambu-Jona-Lasinio type and superconducting type, which are widely studied in\nhigh-energy physics, from the honeycomb lattice Hamiltonian with Hubbard\ninteraction. We investigate the phase transitions induced by these two\ninteractions and consider the effects of the chemical potential and magnetic\nflux (Haldane mass term) on these phase transitions. We find that the\ncharge-density-wave and superconductivity generated by the attractive\ninteractions are mainly controlled by the chemical potential, while the\nmagnetic flux delimits the domain of phase transition. Our analysis underscores\nthe influence of the initial topological state on the phase transitions, a\nfacet largely overlooked in prior studies. We present experimental protocols\nusing cold atoms to verify our theoretical results.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:08:23 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 09:43:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Qiao",""],["Wu","Yu-Biao",""],["Zhuang","Lin",""],["Zhao","Ji-Min",""],["Liu","Wu-Ming",""]]}
{"id":"2308.10864","submitter":"Ludovico Theo Giorgini","authors":"Ludovico Theo Giorgini, Andre N. Souza, Peter J. Schmid","title":"Clustering of Dynamical Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we address the problem of community detection in a graph whose\nconnectivity is given by probabilities (denoted by numbers between zero and\none) rather than an adjacency matrix (only 0 or 1). The graphs themselves come\nfrom partitions of a dynamical system's state space where the probabilities\ndenote likely transition pathways for dynamics. We propose a modification of\nthe Leicht-Newman algorithm \\cite{Leicht2008} which is able to automatically\ndetect communities of strongly intra-connected points in state space, from\nwhich information about the residence time of the system and its principal\nperiodicities can be extracted. Furthermore, a novel algorithm to construct the\ntransition rate matrix of a dynamical system which encodes the time dependency\nof its Perron-Frobenius operator, is developed. Crucially, it overcomes the\nissue of time-scale separation stemming from the matrix construction based on\n{\\it{infinitesimal}} generators and the exploration of {\\it{long-term}}\nfeatures of the underlying dynamical system. This method is then tested on a\nrange of dynamical systems and datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:08:37 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Giorgini","Ludovico Theo",""],["Souza","Andre N.",""],["Schmid","Peter J.",""]]}
{"id":"2308.10865","submitter":"Simon Blouin","authors":"Simon Blouin, Falk Herwig, Huaqing Mao, Pavel Denissenkov, Paul R.\n  Woodward","title":"3D hydrodynamics simulations of a 3 $M_{\\odot}$ core-helium burning star","comments":"Submitted to MNRAS. Movies available at https://www.ppmstar.org","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The inner structure of core-helium burning (CHeB) stars remains uncertain due\nto the yet unknown nature of mixing at the boundary of their cores. Large\nconvective cores beyond a bare Schwarzschild model are favoured both from\ntheoretical arguments and from asteroseismological constraints. However, the\nexact nature of this extra mixing, and in particular the possible presence of\nsemiconvective layers, is still debated. In this work, we approach this problem\nthrough a new avenue by performing the first full-sphere 3D hydrodynamics\nsimulations of the interiors of CHeB stars. We use the PPMstar explicit gas\ndynamics code to simulate the inner 0.45 $M_{\\odot}$ of a 3 $M_{\\odot}$ CHeB\nstar. Simulations are performed using different Cartesian grid resolutions\n(768$^3$, 1152$^3$ and 1728$^3$) and heating rates. We use two different\ninitial states, one based on MESA's predictive mixing scheme (which yields a\nlarge overshoot region) and one based on the convective premixing approach\n(which exhibits a semiconvective interface). The general behaviour of the flow\nin the convective core and in the stable envelope (where internal gravity waves\nare observed) is consistent with our recent simulations of core convection in\nmassive main-sequence stars, and so are the various scaling relations. The\nsemiconvective layers are dominated by strong internal gravity waves that do\nnot produce measurable species mixing, but overshooting motions from the\nconvective core gradually homogenize the semiconvective interface. This process\ncan possibly completely erase the semiconvective layers, which would imply that\nCHeB stars do not harbour a semiconvection zone.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:09:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Blouin","Simon",""],["Herwig","Falk",""],["Mao","Huaqing",""],["Denissenkov","Pavel",""],["Woodward","Paul R.",""]]}
{"id":"2308.10866","submitter":"Gabriela Marques G.A.Marques","authors":"Gabriela A. Marques, Jia Liu, Masato Shirasaki, Leander Thiele,\n  Daniela Grand\\'on, Kevin M. Huffenberger, Sihao Cheng, Joachim\n  Harnois-D\\'eraps, Ken Osato, William R. Coulton","title":"Cosmology from weak lensing peaks and minima with Subaru Hyper\n  Suprime-Cam survey first-year data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present cosmological constraints derived from peak counts, minimum counts,\nand the angular power spectrum of the Subaru Hyper Suprime-Cam first-year (HSC\nY1) weak lensing shear catalog. Weak lensing peak and minimum counts contain\nnon-Gaussian information and hence are complementary to the conventional\ntwo-point statistics in constraining cosmology. In this work, we forward-model\nthe three summary statistics and their dependence on cosmology, using a suite\nof $N$-body simulations tailored to the HSC Y1 data. We investigate systematic\nand astrophysical effects including intrinsic alignments, baryon feedback,\nmultiplicative bias, and photometric redshift uncertainties. We mitigate the\nimpact of these systematics by applying cuts on angular scales, smoothing\nscales, statistic bins, and tomographic redshift bins. By combining peaks,\nminima, and the power spectrum, assuming a flat-$\\Lambda$CDM model, we obtain\n$S_{8} \\equiv \\sigma_8\\sqrt{\\Omega_m/0.3}= 0.810^{+0.022}_{-0.026}$, a 35\\%\ntighter constraint than that obtained from the angular power spectrum alone.\nOur results are in agreement with other studies using HSC weak lensing shear\ndata, as well as with Planck 2018 cosmology and recent CMB lensing constraints\nfrom the Atacama Cosmology Telescope and the South Pole Telescope.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:09:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Marques","Gabriela A.",""],["Liu","Jia",""],["Shirasaki","Masato",""],["Thiele","Leander",""],["Grand\u00f3n","Daniela",""],["Huffenberger","Kevin M.",""],["Cheng","Sihao",""],["Harnois-D\u00e9raps","Joachim",""],["Osato","Ken",""],["Coulton","William R.",""]]}
{"id":"2308.10867","submitter":"L\\'aszl\\'o Sz\\'ekelyhidi","authors":"L\\'aszl\\'o Sz\\'ekelyhidi","title":"Spectral Synthesis on Direct Products","comments":"arXiv admin note: substantial text overlap with arXiv:2307.16016","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a former paper we introduced the concept of localisation of ideals in the\nFourier algebra of a locally compact Abelian group. It turns out that\nlocalisability of a closed ideal in the Fourier algebra is equivalent to the\nsynthesisability of the annihilator of that closed ideal which corresponds to\nthis ideal in the measure algebra. This equivalence provides an effective tool\nto prove synthesisability of varieties on locally compact Abelian groups. In\nanother paper we used this method to show that when investigating\nsynthesisability of a variety, roughly speaking, compact elements of the group\ncan be neglected. Using these results, in this paper we completely characterise\nthose locally compact Abelian groups on which spectral synthesis holds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:12:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sz\u00e9kelyhidi","L\u00e1szl\u00f3",""]]}
{"id":"2308.10868","submitter":"Angelos Angelopoulos","authors":"Nikos Chrisochoides, Andriy Fedorov, Fotis Drakopoulos, Andriy Kot,\n  Yixun Liu, Panos Foteinos, Angelos Angelopoulos, Olivier Clatz, Nicholas\n  Ayache, Peter M. Black, Alex J. Golby, Ron Kikinis","title":"Advancing Intra-operative Precision: Dynamic Data-Driven Non-Rigid\n  Registration for Enhanced Brain Tumor Resection in Image-Guided Neurosurgery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  During neurosurgery, medical images of the brain are used to locate tumors\nand critical structures, but brain tissue shifts make pre-operative images\nunreliable for accurate removal of tumors. Intra-operative imaging can track\nthese deformations but is not a substitute for pre-operative data. To address\nthis, we use Dynamic Data-Driven Non-Rigid Registration (NRR), a complex and\ntime-consuming image processing operation that adjusts the pre-operative image\ndata to account for intra-operative brain shift. Our review explores a specific\nNRR method for registering brain MRI during image-guided neurosurgery and\nexamines various strategies for improving the accuracy and speed of the NRR\nmethod. We demonstrate that our implementation enables NRR results to be\ndelivered within clinical time constraints while leveraging Distributed\nComputing and Machine Learning to enhance registration accuracy by identifying\noptimal parameters for the NRR method. Additionally, we highlight challenges\nassociated with its use in the operating room.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 03:33:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chrisochoides","Nikos",""],["Fedorov","Andriy",""],["Drakopoulos","Fotis",""],["Kot","Andriy",""],["Liu","Yixun",""],["Foteinos","Panos",""],["Angelopoulos","Angelos",""],["Clatz","Olivier",""],["Ayache","Nicholas",""],["Black","Peter M.",""],["Golby","Alex J.",""],["Kikinis","Ron",""]]}
{"id":"2308.10869","submitter":"Nibraas Khan","authors":"Nibraas Khan, Mahrukh Tauseef, Ritam Ghosh, Nilanjan Sarkar","title":"A Novel Loss Function Utilizing Wasserstein Distance to Reduce\n  Subject-Dependent Noise for Generalizable Models in Affective Computing","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emotions are an essential part of human behavior that can impact thinking,\ndecision-making, and communication skills. Thus, the ability to accurately\nmonitor and identify emotions can be useful in many human-centered applications\nsuch as behavioral training, tracking emotional well-being, and development of\nhuman-computer interfaces. The correlation between patterns in physiological\ndata and affective states has allowed for the utilization of deep learning\ntechniques which can accurately detect the affective states of a person.\nHowever, the generalisability of existing models is often limited by the\nsubject-dependent noise in the physiological data due to variations in a\nsubject's reactions to stimuli. Hence, we propose a novel cost function that\nemploys Optimal Transport Theory, specifically Wasserstein Distance, to scale\nthe importance of subject-dependent data such that higher importance is\nassigned to patterns in data that are common across all participants while\ndecreasing the importance of patterns that result from subject-dependent noise.\nThe performance of the proposed cost function is demonstrated through an\nautoencoder with a multi-class classifier attached to the latent space and\ntrained simultaneously to detect different affective states. An autoencoder\nwith a state-of-the-art loss function i.e., Mean Squared Error, is used as a\nbaseline for comparison with our model across four different commonly used\ndatasets. Centroid and minimum distance between different classes are used as a\nmetrics to indicate the separation between different classes in the latent\nspace. An average increase of 14.75% and 17.75% (from benchmark to proposed\nloss function) was found for minimum and centroid euclidean distance\nrespectively over all datasets.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 01:15:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Khan","Nibraas",""],["Tauseef","Mahrukh",""],["Ghosh","Ritam",""],["Sarkar","Nilanjan",""]]}
{"id":"2308.10871","submitter":"Charlie Sire Mr","authors":"Charlie Sire and Yann Richet and Rodolphe Le Riche and Didier\n  Rulli\\`ere and J\\'er\\'emy Rohmer and Lucie Pheulpin","title":"FunQuant: A R package to perform quantization in the context of rare\n  events and time-consuming simulations","comments":"7 pages, 4 figures. Submitted to Journal Of Open Source Software","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantization summarizes continuous distributions by calculating a discrete\napproximation. Among the widely adopted methods for data quantization is\nLloyd's algorithm, which partitions the space into Vorono\\\"i cells, that can be\nseen as clusters, and constructs a discrete distribution based on their\ncentroids and probabilistic masses. Lloyd's algorithm estimates the optimal\ncentroids in a minimal expected distance sense, but this approach poses\nsignificant challenges in scenarios where data evaluation is costly, and\nrelates to rare events. Then, the single cluster associated to no event takes\nthe majority of the probability mass. In this context, a metamodel is required\nand adapted sampling methods are necessary to increase the precision of the\ncomputations on the rare clusters.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:34:45 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sire","Charlie",""],["Richet","Yann",""],["Riche","Rodolphe Le",""],["Rulli\u00e8re","Didier",""],["Rohmer","J\u00e9r\u00e9my",""],["Pheulpin","Lucie",""]]}
{"id":"2308.10872","submitter":"Maryam Khosravi","authors":"B. Bagheri Gh., M. Khosravi, E. S. Mahmoodian and S. Rashidi","title":"A study of $4-$cycle systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A $4-$cycle system is a partition of the edges of the complete graph $K_n$\ninto $4-$cycles. Let ${ C}$ be a collection of cycles of length 4 whose edges\npartition the edges of $K_n$. A set of 4-cycles $T_1 \\subset C$ is called a\n4-cycle trade if there exists a set $T_2$ of edge-disjoint 4-cycles on the same\nvertices, such that $({C} \\setminus T_1)\\cup T_2$ also is a collection of\ncycles of length 4 whose edges partition the edges of $K_n$.\n  We study $4-$cycle trades of volume two (double-diamonds) and three and show\nthat the set of all 4-CS(9) is connected with respect of trading with trades of\nvolume 2 (double-diamond) and 3.\n  In addition, we present a full rank matrix whose null-space is containing\ntrade-vectors.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:18:34 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Gh.","B. Bagheri",""],["Khosravi","M.",""],["Mahmoodian","E. S.",""],["Rashidi","S.",""]]}
{"id":"2308.10873","submitter":"Malyaban Bal","authors":"Malyaban Bal, Abhronil Sengupta","title":"SpikingBERT: Distilling BERT to Train Spiking Language Models Using\n  Implicit Differentiation","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language Models (LLMs), though growing exceedingly powerful, comprises\nof orders of magnitude less neurons and synapses than the human brain. However,\nit requires significantly more power/energy to operate. In this work, we\npropose a novel bio-inspired spiking language model (LM) which aims to reduce\nthe computational cost of conventional LMs by drawing motivation from the\nsynaptic information flow in the brain. In this paper, we demonstrate a\nframework that leverages the average spiking rate of neurons at equilibrium to\ntrain a neuromorphic spiking LM using implicit differentiation technique,\nthereby overcoming the non-differentiability problem of spiking neural network\n(SNN) based algorithms without using any type of surrogate gradient. The\nsteady-state convergence of the spiking neurons also allows us to design a\nspiking attention mechanism, which is critical in developing a scalable spiking\nLM. Moreover, the convergence of average spiking rate of neurons at equilibrium\nis utilized to develop a novel ANN-SNN knowledge distillation based technique\nwherein we use a pre-trained BERT model as \"teacher\" to train our \"student\"\nspiking architecture. While the primary architecture proposed in this paper is\nmotivated by BERT, the technique can be potentially extended to different kinds\nof LLMs. Our work is the first one to demonstrate the performance of an\noperational spiking LM architecture on multiple different tasks in the GLUE\nbenchmark.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:20:05 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bal","Malyaban",""],["Sengupta","Abhronil",""]]}
{"id":"2308.10874","submitter":"Sumeet Sohan Singh","authors":"Sumeet S. Singh","title":"Analyzing Transformer Dynamics as Movement through Embedding Space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transformer language models exhibit intelligent behaviors such as\nunderstanding natural language, recognizing patterns, acquiring knowledge,\nreasoning, planning, reflecting and using tools. This paper explores how their\nunderlying mechanics give rise to intelligent behaviors. We adopt a systems\napproach to analyze Transformers in detail and develop a mathematical framework\nthat frames their dynamics as movement through embedding space. This novel\nperspective provides a principled way of thinking about the problem and reveals\nimportant insights related to the emergence of intelligence:\n  1. At its core the Transformer is a Embedding Space walker, mapping\nintelligent behavior to trajectories in this vector space.\n  2. At each step of the walk, it composes context into a single composite\nvector whose location in Embedding Space defines the next step.\n  3. No learning actually occurs during decoding; in-context learning and\ngeneralization are simply the result of different contexts composing into\ndifferent vectors.\n  4. Ultimately the knowledge, intelligence and skills exhibited by the model\nare embodied in the organization of vectors in Embedding Space rather than in\nspecific neurons or layers. These abilities are properties of this\norganization.\n  5. Attention's contribution boils down to the association-bias it lends to\nvector composition and which influences the aforementioned organization.\nHowever, more investigation is needed to ascertain its significance.\n  6. The entire model is composed from two principal operations: data\nindependent filtering and data dependent aggregation. This generalization\nunifies Transformers with other sequence models and across modalities.\n  Building upon this foundation we formalize and test a semantic space theory\nwhich posits that embedding vectors represent semantic concepts and find some\nevidence of its validity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:21:23 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Singh","Sumeet S.",""]]}
{"id":"2308.10875","submitter":"Elvis Han Cui","authors":"Elvis Han Cui, Zizhao Zhang, Culsome Junwen Chen, Weng Kee Wong","title":"Metaheuristic Algorithms in Artificial Intelligence with Applications to\n  Bioinformatics, Biostatistics, Ecology and, the Manufacturing Industries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nature-inspired metaheuristic algorithms are important components of\nartificial intelligence, and are increasingly used across disciplines to tackle\nvarious types of challenging optimization problems. We apply a newly proposed\nnature-inspired metaheuristic algorithm called competitive swarm optimizer with\nmutated agents (CSO-MA) and demonstrate its flexibility and out-performance\nrelative to its competitors in a variety of optimization problems in the\nstatistical sciences. In particular, we show the algorithm is efficient and can\nincorporate various cost structures or multiple user-specified nonlinear\nconstraints. Our applications include (i) finding maximum likelihood estimates\nof parameters in a single cell generalized trend model to study pseudotime in\nbioinformatics, (ii) estimating parameters in a commonly used Rasch model in\neducation research, (iii) finding M-estimates for a Cox regression in a Markov\nrenewal model and (iv) matrix completion to impute missing values in a two\ncompartment model. In addition we discuss applications to (v) select variables\noptimally in an ecology problem and (vi) design a car refueling experiment for\nthe auto industry using a logistic model with multiple interacting factors.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 16:41:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Cui","Elvis Han",""],["Zhang","Zizhao",""],["Chen","Culsome Junwen",""],["Wong","Weng Kee",""]]}
{"id":"2308.10876","submitter":"Olivier Ramar\\'e","authors":"Olivier Ramar\\'e","title":"Explicit count of integral ideals of an imaginary quadratic field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We provide explicit bounds for the number of integral ideals of norms at most\n$X$ is $\\mathbb{Q}[\\sqrt{d}]$ when $d <0$ is a fundamendal discriminant with an\nerror term of size $O(X^{1/3})$. In particular, we prove that, when $\\chi$ is\nthe non-principal character modulo $3$ and $X\\ge1$, we have $\\sum_{n\\le\nX}(1\\star\\chi)(n) = \\frac{\\pi}{3\\sqrt{3}}X +O^*( 1.94\\,X^{1/3})$, and that,\nwhen $\\chi$ is the non-principal character modulo $4$ and $X\\ge1$, we have\n$\\sum_{n\\le X}(1\\star\\chi)(n) = \\frac{\\pi }{4}X+ O^*( 1.4\\,X^{1/3})$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:24:27 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ramar\u00e9","Olivier",""]]}
{"id":"2308.10877","submitter":"Miranda Holmes-Cerfon","authors":"Kerun Xu and Miranda Holmes-Cerfon","title":"Monte Carlo on manifolds in high dimensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce an efficient numerical implementation of a Markov Chain Monte\nCarlo method to sample a probability distribution on a manifold (introduced\ntheoretically in Zappa, Holmes-Cerfon, Goodman (2018)), where the manifold is\ndefined by the level set of constraint functions, and the probability\ndistribution may involve the pseudodeterminant of the Jacobian of the\nconstraints, as arises in physical sampling problems. The algorithm is easy to\nimplement and scales well to problems with thousands of dimensions and with\ncomplex sets of constraints provided their Jacobian retains sparsity. The\nalgorithm uses direct linear algebra and requires a single matrix factorization\nper proposal point, which enhances its efficiency over previously proposed\nmethods but becomes the computational bottleneck of the algorithm in high\ndimensions. We test the algorithm on several examples inspired by soft-matter\nphysics and materials science to study its complexity and properties.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:24:41 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Xu","Kerun",""],["Holmes-Cerfon","Miranda",""]]}
{"id":"2308.10878","submitter":"Wenqing Wei","authors":"Wen-Qing Wei, Shi-Zheng Zhang, Zhi-Gang Deng, Wei Qi, Hao Xu, Li-Rong\n  Liu, Jia-Lin Zhang, Fang-Fang Li, Xing Xu, Zhong-Min Hu, Ben-Zheng Chen,\n  Bu-Bo Ma, Jian-Xing Li, Xue-Guang Ren, Zhong-Feng Xu, Dieter H. H. Hoffmann,\n  Quan-Ping Fan, Wei-Wu Wang, Shao-Yi Wang, Jian Teng, Bo Cui, Feng Lu, Lei\n  Yang, Yu-Qiu Gu, Zong-Qing Zhao, Rui Cheng, Zhao Wang, Yu Lei, Guo-Qing Xiao,\n  Hong-Wei Zhao, Bing Liu, Guan-Chao Zhao, Min-Sheng Liu, Hua-Sheng Xie,\n  Lei-Feng Cao, Jie-Ru Ren, Wei-Min Zhou, and Yong-Tao Zhao","title":"Proton-Boron Fusion Yield Increased by Orders of Magnitude with Foam\n  Targets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A novel intense beam-driven scheme for high yield of the tri-alpha reaction\n11B(p,{\\alpha})2{\\alpha} was investigated. We used a foam target made of\ncellulose triacetate (TAC, C_9H_{16}O_8) doped with boron. It was then heated\nvolumetrically by soft X-ray radiation from a laser heated hohlraum and turned\ninto a homogenous, and long living plasma. We employed a picosecond laser pulse\nto generate a high-intensity energetic proton beam via the well-known Target\nNormal Sheath Acceleration (TNSA) mechanism. We observed up to 10^{10}/sr\n{\\alpha} particles per laser shot. This constitutes presently the highest yield\nvalue normalized to the laser energy on target. The measured fusion yield per\nproton exceeds the classical expectation of beam-target reactions by up to four\norders of magnitude under high proton intensities. This enhancement is\nattributed to the strong electric fields and nonequilibrium thermonuclear\nfusion reactions as a result of the new method. Our approach shows\nopportunities to pursue ignition of aneutronic fusion.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:25:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Wei","Wen-Qing",""],["Zhang","Shi-Zheng",""],["Deng","Zhi-Gang",""],["Qi","Wei",""],["Xu","Hao",""],["Liu","Li-Rong",""],["Zhang","Jia-Lin",""],["Li","Fang-Fang",""],["Xu","Xing",""],["Hu","Zhong-Min",""],["Chen","Ben-Zheng",""],["Ma","Bu-Bo",""],["Li","Jian-Xing",""],["Ren","Xue-Guang",""],["Xu","Zhong-Feng",""],["Hoffmann","Dieter H. H.",""],["Fan","Quan-Ping",""],["Wang","Wei-Wu",""],["Wang","Shao-Yi",""],["Teng","Jian",""],["Cui","Bo",""],["Lu","Feng",""],["Yang","Lei",""],["Gu","Yu-Qiu",""],["Zhao","Zong-Qing",""],["Cheng","Rui",""],["Wang","Zhao",""],["Lei","Yu",""],["Xiao","Guo-Qing",""],["Zhao","Hong-Wei",""],["Liu","Bing",""],["Zhao","Guan-Chao",""],["Liu","Min-Sheng",""],["Xie","Hua-Sheng",""],["Cao","Lei-Feng",""],["Ren","Jie-Ru",""],["Zhou","Wei-Min",""],["Zhao","Yong-Tao",""]]}
{"id":"2308.10879","submitter":"Evan Sundbo","authors":"Evan Sundbo","title":"Piecewise Toric Varieties and Cell-Compatible Sheaves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the cohomology of piecewise toric varieties via the derived\npush-forward of the constant sheaf to a complex of polytopes, proving a\nDeligne-type decomposition theorem, degeneration of the associated Leray-Serre\nspectral sequence, and showing that the Leray filtration on their cohomology is\nequal to twice the weight filtration. Furthermore, we give an explicit formula\nfor the Betti numbers of some piecewise toric varieties whose associated\ncomplex of polytopes is the $n$-skeleton of a higher dimensional polytope,\nencompassing some important examples.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:26:50 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sundbo","Evan",""]]}
{"id":"2308.10880","submitter":"Akriti Sinha","authors":"Akriti Sinha and Abhirup Datta","title":"Detailed study of the Bootes field using 300-500 MHz uGMRT observations:\n  Source Properties and radio--infrared correlations","comments":"18 pages, 18 Figures; Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2544 10.1093/mnras/stad2544","report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dominant source of radio continuum emissions at low frequencies is\nsynchrotron radiation, which originates from star-forming regions in disk\ngalaxies and from powerful jets produced by active galactic nuclei (AGN). We\nstudied the Bootes field using the upgraded Giant Meterwave Radio Telescope\n(uGMRT) at 400 MHz, achieving a central minimum off-source RMS noise of\n35$\\mu$Jy beam$^{-1}$ and a catalogue of 3782 sources in $\\sim6$ sq. degrees of\nthe sky. The resulting catalogue was compared to other radio frequency\ncatalogues, and the corrected normalised differential source counts were\nderived. We use standard multi-wavelength techniques to classify the sources in\nstar-forming galaxies (SFGs), radio-loud (RL) AGN, and radio-quiet (RQ) AGN\nthat confirm a boost in the SFGs and RQ\\,AGN AGN populations at lower flux\nlevels. For the first time, we investigated the properties of the radio--IR\nrelations at 400\\,MHz in this field. The $L_{\\rm 400 MHz}$--$L_{\\rm TIR}$\nrelations for SFGs were found to show a strong correlation with non-linear\nslope values of $1.10\\pm0.01$, and variation of $q_{\\rm TIR}$ with $z$ is given\nas, $q_{\\rm TIR} = (2.19 \\pm 0.07)\\ (1+z)^{-0.15 \\pm 0.08}$. This indicates\nthat the non-linearity of the radio--IR relations can be attributed to the mild\nvariation of $q_{\\rm TIR}$ values with $z$. The derived relationships exhibit\nsimilar behaviour when applied to LOFAR at 150 MHz and also at 1.4 GHz. This\nemphasises the fact that other parameters like magnetic field evolution with\n$z$ or the number densities of cosmic ray electrons can play a vital role in\nthe mild evolution of $q$ values.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:27:29 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Sinha","Akriti",""],["Datta","Abhirup",""]]}
{"id":"2308.10881","submitter":"Joachim Kerner","authors":"Patrizio Bifulco and Joachim Kerner","title":"A note on Ambarzumian's theorem for quantum graphs","comments":"5 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on the main result presented in a recent paper, we derive\nAmbarzumian-type theorems for Schr\\\"odinger operators defined on quantum\ngraphs. We recover existing results such as the classical theorem by\nAmbarzumian and establish some seemingly new statements, too.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:28:09 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bifulco","Patrizio",""],["Kerner","Joachim",""]]}
{"id":"2308.10882","submitter":"Samuel Dooley","authors":"Arka Pal, Deep Karkhanis, Manley Roberts, Samuel Dooley, Arvind\n  Sundararajan, Siddartha Naidu","title":"Giraffe: Adventures in Expanding Context Lengths in LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern large language models (LLMs) that rely on attention mechanisms are\ntypically trained with fixed context lengths which enforce upper limits on the\nlength of input sequences that they can handle at evaluation time. To use these\nmodels on sequences longer than the train-time context length, one might employ\ntechniques from the growing family of context length extrapolation methods --\nmost of which focus on modifying the system of positional encodings used in the\nattention mechanism to indicate where tokens or activations are located in the\ninput sequence. We conduct a wide survey of existing methods of context length\nextrapolation on a base LLaMA or LLaMA 2 model, and introduce some of our own\ndesign as well -- in particular, a new truncation strategy for modifying the\nbasis for the position encoding.\n  We test these methods using three new evaluation tasks (FreeFormQA,\nAlteredNumericQA, and LongChat-Lines) as well as perplexity, which we find to\nbe less fine-grained as a measure of long context performance of LLMs. We\nrelease the three tasks publicly as datasets on HuggingFace. We discover that\nlinear scaling is the best method for extending context length, and show that\nfurther gains can be achieved by using longer scales at evaluation time. We\nalso discover promising extrapolation capabilities in the truncated basis. To\nsupport further research in this area, we release three new 13B parameter\nlong-context models which we call Giraffe: 4k and 16k context models trained\nfrom base LLaMA-13B, and a 32k context model trained from base LLaMA2-13B. We\nalso release the code to replicate our results.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:30:16 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Pal","Arka",""],["Karkhanis","Deep",""],["Roberts","Manley",""],["Dooley","Samuel",""],["Sundararajan","Arvind",""],["Naidu","Siddartha",""]]}
{"id":"2308.10883","submitter":"Mohamed Nomeir","authors":"Alptug Aytekin, Mohamed Nomeir, Sajani Vithana and Sennur Ulukus","title":"Quantum Symmetric Private Information Retrieval with Secure Storage and\n  Eavesdroppers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.CR cs.NI eess.SP math.IT quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider both the classical and quantum variations of $X$-secure,\n$E$-eavesdropped and $T$-colluding symmetric private information retrieval\n(SPIR). This is the first work to study SPIR with $X$-security in classical or\nquantum variations. We first develop a scheme for classical $X$-secure,\n$E$-eavesdropped and $T$-colluding SPIR (XSETSPIR) based on a modified version\nof cross subspace alignment (CSA), which achieves a rate of $R= 1 -\n\\frac{X+\\max(T,E)}{N}$. The modified scheme achieves the same rate as the\nscheme used for $X$-secure PIR with the extra benefit of symmetric privacy.\nNext, we extend this scheme to its quantum counterpart based on the $N$-sum box\nabstraction. This is the first work to consider the presence of eavesdroppers\nin quantum private information retrieval (QPIR). In the quantum variation, the\neavesdroppers have better access to information over the quantum channel\ncompared to the classical channel due to the over-the-air decodability. To that\nend, we develop another scheme specialized to combat eavesdroppers over quantum\nchannels. The scheme proposed for $X$-secure, $E$-eavesdropped and\n$T$-colluding quantum SPIR (XSETQSPIR) in this work maintains the super-dense\ncoding gain from the shared entanglement between the databases, i.e., achieves\na rate of $R_Q = \\min\\left\\{ 1, 2\\left(1-\\frac{X+\\max(T,E)}{N}\\right)\\right\\}$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:30:38 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Aytekin","Alptug",""],["Nomeir","Mohamed",""],["Vithana","Sajani",""],["Ulukus","Sennur",""]]}
{"id":"2308.10884","submitter":"Debatri Chattopadhyay","authors":"Debatri Chattopadhyay, Jakob Stegmann, Fabio Antonini, Jordan Barber,\n  Isobel M. Romero-Shaw","title":"Binary black hole mergers in nuclear star clusters: eccentricities,\n  spins, masses, and the growth of massive seeds","comments":"submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the formation of intermediate mass black holes (IMBHs) through\nhierarchical mergers of stellar origin black holes (BHs), as well as BH mergers\nformed dynamically in nuclear star clusters. Using a semi-analytical approach\nwhich incorporates probabilistic mass-function-dependent double BH (DBH)\npairing, binary-single encounters, and a mass-ratio-dependent prescription for\nenergy dissipation in hardening binaries, we find that IMBHs with masses of\n$\\mathcal{O}(10^2)$~--~$\\mathcal{O}(10^4)\\,\\rm M_\\odot$ can be formed solely\nthrough hierarchical mergers in timescales of a few $100$\\,Myrs to a few\\,Gyrs.\nClusters with escape velocities $\\gtrsim400$\\,km\\,s$^{-1}$ inevitably form\nhigh-mass IMBHs. The spin distribution of IMBHs with masses $\\gtrsim\n10^3M_\\odot$ is strongly clustered at $\\chi\\sim 0.15$; while for lower masses,\nit at $\\chi\\sim 0.7$. Eccentric mergers are more frequent for equal-mass\nbinaries containing first- and/or second-generation BHs. Metal-rich, young,\ndense clusters can produce up to $20\\%$ of their DBH mergers with eccentricity\n$\\geq0.1$ at $10\\,\\rm Hz$, and $\\sim2$~--~$9\\%$ of all in-cluster mergers can\nform at $>10$\\,Hz. Nuclear star clusters are therefore promising environments\nfor the formation of highly-eccentric DBH mergers, detectable with current\ngravitational-wave detectors. Clusters of extreme mass ($\\sim10^8$\\,M$_\\odot$)\nand density ($\\sim10^8$\\,M$_\\odot$pc$^{-3}$) can have about half of all of\ntheir DBH mergers with primary masses $\\geq100$\\,M$_\\odot$. The fraction of\nin-cluster mergers increases rapidly with increasing cluster escape velocity,\nbeing nearly unity for $v_{\\rm esc}\\gtrsim 200$\\,km\\,s$^{-1}$. Cosmological\nmerger rate of DBHs from nuclear clusters varies\n$\\approx0.01-1$\\,Gpc$^{-3}$yr$^{-1}$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:33:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chattopadhyay","Debatri",""],["Stegmann","Jakob",""],["Antonini","Fabio",""],["Barber","Jordan",""],["Romero-Shaw","Isobel M.",""]]}
{"id":"2308.10885","submitter":"Federico Coro","authors":"Matteo Becchetti, Roberto Bonciani, Leandro Cieri, Federico Coro,\n  Federico Ripani","title":"Full top-quark mass dependence in diphoton production at NNLO in QCD","comments":"14 pages and 5 figures","journal-ref":null,"doi":null,"report-no":"IFIC/23-33, FTUV-23-0808.1917","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we consider the diphoton production in hadronic collisions at\nthe next-to-next-to-leading order (NNLO) in perturbative QCD, taking into\naccount for the first time the full top quark mass dependence up to two loops\n(full NNLO). We show selected numerical distributions, highlighting the\nkinematic regions where the massive corrections are more significant. We make\nuse of the recently computed two-loop massive amplitudes for diphoton\nproduction in the quark annihilation channel. The remaining massive\ncontributions at NNLO are also considered, and we comment on the weight of the\ndifferent types of contributions to the full and complete result.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:34:40 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Becchetti","Matteo",""],["Bonciani","Roberto",""],["Cieri","Leandro",""],["Coro","Federico",""],["Ripani","Federico",""]]}
{"id":"2308.10886","submitter":"Bingqing Cheng","authors":"Aleks Reinhardt, Pin Yu Chew, Bingqing Cheng","title":"A streamlined molecular-dynamics workflow for computing solubilities of\n  molecular and ionic crystals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mtrl-sci physics.chem-ph physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing the solubility of crystals in a solvent using atomistic simulations\nis notoriously challenging due to the complexities and convergence issues\nassociated with free-energy methods, as well as the slow equilibration in\ndirect-coexistence simulations. This paper introduces a molecular-dynamics\nworkflow that simplifies and robustly computes the solubility of molecular or\nionic crystals. This method is considerably more straightforward than the\nstate-of-the-art, as we have streamlined and optimised each step of the\nprocess. Specifically, we calculate the chemical potential of the crystal using\nthe gas-phase molecule as a reference state, and employ the S0 method to\ndetermine the concentration dependence of the chemical potential of the solute.\nWe use this workflow to predict the solubilities of sodium chloride in water,\nurea polymorphs in water, and paracetamol polymorphs in both water and ethanol.\nOur findings indicate that the predicted solubility is sensitive to the chosen\npotential energy surface. Furthermore, we note that the harmonic approximation\noften fails for both molecular crystals and gas molecules at or above room\ntemperature, and that the assumption of an ideal solution becomes less valid\nfor highly soluble substances.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:36:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Reinhardt","Aleks",""],["Chew","Pin Yu",""],["Cheng","Bingqing",""]]}
{"id":"2308.10887","submitter":"Andrei Vasin V.","authors":"Andrei Vasin","title":"A T(L) theorem for the Calder\\'{o}n--Zygmund operators in\n  BMO($\\mathbb{R}^d$)","comments":"12","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A variant of the global $T(1)$ criterion to characterize the bounded\nCalder\\'{o}n--Zygmund operators on BMO($\\mathbb{R}^d$) is proved. We apply it\nto the certain Calder\\'on commutators.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:41:21 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Vasin","Andrei",""]]}
{"id":"2308.10888","submitter":"Borja Balle","authors":"Leonard Berrada, Soham De, Judy Hanwen Shen, Jamie Hayes, Robert\n  Stanforth, David Stutz, Pushmeet Kohli, Samuel L. Smith, Borja Balle","title":"Unlocking Accuracy and Fairness in Differentially Private Image\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Privacy-preserving machine learning aims to train models on private data\nwithout leaking sensitive information. Differential privacy (DP) is considered\nthe gold standard framework for privacy-preserving training, as it provides\nformal privacy guarantees. However, compared to their non-private counterparts,\nmodels trained with DP often have significantly reduced accuracy. Private\nclassifiers are also believed to exhibit larger performance disparities across\nsubpopulations, raising fairness concerns. The poor performance of classifiers\ntrained with DP has prevented the widespread adoption of privacy preserving\nmachine learning in industry. Here we show that pre-trained foundation models\nfine-tuned with DP can achieve similar accuracy to non-private classifiers,\neven in the presence of significant distribution shifts between pre-training\ndata and downstream tasks. We achieve private accuracies within a few percent\nof the non-private state of the art across four datasets, including two medical\nimaging benchmarks. Furthermore, our private medical classifiers do not exhibit\nlarger performance disparities across demographic groups than non-private\nmodels. This milestone to make DP training a practical and reliable technology\nhas the potential to widely enable machine learning practitioners to train\nsafely on sensitive datasets while protecting individuals' privacy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:42:33 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Berrada","Leonard",""],["De","Soham",""],["Shen","Judy Hanwen",""],["Hayes","Jamie",""],["Stanforth","Robert",""],["Stutz","David",""],["Kohli","Pushmeet",""],["Smith","Samuel L.",""],["Balle","Borja",""]]}
{"id":"2308.10889","submitter":"Carl Mueller","authors":"Le Chen, Sefika Kuzgun, Carl Mueller, and Panqiu Xia","title":"On the radius of self-repellent fractional Brownian motion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the radius $R_T$ of a self-repellent fractional Brownian motion\n$\\left\\{B^H_t\\right\\}_{0\\le t\\le T}$ taking values in $\\mathbb{R}^d$. Our\nsharpest result is for $d=1$, where we find that with high probability,\n\\begin{equation*}\n  R_T \\asymp T^\\nu, \\quad \\text{with $\\nu=\\frac{2}{3}\\left(1+H\\right)$.}\n\\end{equation*} For $d>1$, we provide upper and lower bounds for the exponent\n$\\nu$, but these bounds do not match.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:43:55 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Chen","Le",""],["Kuzgun","Sefika",""],["Mueller","Carl",""],["Xia","Panqiu",""]]}
{"id":"2308.10890","submitter":"Alfio Bonanno","authors":"Alfio Bonanno, Daniele Malafarina, Antonio Panassiti","title":"Dust collapse in asymptotic safety: a path to regular black holes","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Regular black hole spacetimes are obtained from an effective Lagrangian for\nQuantum Einstein Gravity. The interior matter is modeled as a dust fluid, which\ninteracts with the geometry through a multiplicative coupling function denoted\nas $\\chi$. The specific functional form of $\\chi$ is deduced from\nAsymptotically Safe gravity, under the key assumption that the Reuter fixed\npoint remains minimally affected by the presence of matter. As a consequence\nthe gravitational coupling vanishes at high energies. The static exterior\ngeometry of the black hole is entirely determined by the junction conditions at\nthe boundary surface. Consequently, the resulting global spacetime geometry\nremains devoid of singularities at all times. This result offers a novel\nperspective on regular black holes in Asymptotically Safe gravity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:44:26 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Bonanno","Alfio",""],["Malafarina","Daniele",""],["Panassiti","Antonio",""]]}
{"id":"2308.10891","submitter":"Bekir Can L\\\"utf\\\"uo\\u{g}lu","authors":"A. Hocine, B. Hamil, F. Merabtine, B. C. L\\\"utf\\\"uo\\u{g}lu, M.\n  Benarous","title":"On Dunkl-Bose-Einstein Condensation in Harmonic Traps","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The use of the Dunkl derivative, which is defined by a combination of the\ndifference-differential and reflection operator, allows the classification of\nthe solutions according to even and odd solutions. Recently, we considered the\nDunkl formalism to investigate the Bose-Einstein condensation of an ideal Bose\ngas confined in a gravitational field. In this work, we address a similar\nproblem and examine an ideal Bose gas trapped by a three-dimensional harmonic\noscillator within the Dunkl formalism. To this end, we derive an analytic\nexpression for the critical temperature of the N particle system, discuss its\nvalue at large-N limit and finally derive and compare the ground state\npopulation with the usual case result. In addition, we explore two thermal\nquantities, namely the Dunkl-internal energy and the Dunkl-heat capacity\nfunctions. The Wigner parameter of the Dunkl formalism can be successfully used\nto obtain a better agreement between experimental and theoretical results.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:55:39 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Hocine","A.",""],["Hamil","B.",""],["Merabtine","F.",""],["L\u00fctf\u00fco\u011flu","B. C.",""],["Benarous","M.",""]]}
{"id":"2308.10892","submitter":"Colby Fronk","authors":"Colby Fronk and Jaewoong Yun and Prashant Singh and Linda Petzold","title":"Bayesian polynomial neural networks and polynomial neural ordinary\n  differential equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Symbolic regression with polynomial neural networks and polynomial neural\nordinary differential equations (ODEs) are two recent and powerful approaches\nfor equation recovery of many science and engineering problems. However, these\nmethods provide point estimates for the model parameters and are currently\nunable to accommodate noisy data. We address this challenge by developing and\nvalidating the following Bayesian inference methods: the Laplace approximation,\nMarkov Chain Monte Carlo (MCMC) sampling methods, and variational inference. We\nhave found the Laplace approximation to be the best method for this class of\nproblems. Our work can be easily extended to the broader class of symbolic\nneural networks to which the polynomial neural network belongs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 05:42:29 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 05:05:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fronk","Colby",""],["Yun","Jaewoong",""],["Singh","Prashant",""],["Petzold","Linda",""]]}
{"id":"2308.10893","submitter":"Yinzheng Zhong","authors":"Yinzheng Zhong and Alexei Lisitsa","title":"Online Transition-Based Feature Generation for Anomaly Detection in\n  Concurrent Data Streams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce the transition-based feature generator (TFGen)\ntechnique, which reads general activity data with attributes and generates\nstep-by-step generated data. The activity data may consist of network activity\nfrom packets, system calls from processes or classified activity from\nsurveillance cameras. TFGen processes data online and will generate data with\nencoded historical data for each incoming activity with high computational\nefficiency. The input activities may concurrently originate from distinct\ntraces or channels. The technique aims to address issues such as\ndomain-independent applicability, the ability to discover global process\nstructures, the encoding of time-series data, and online processing capability.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 19:29:44 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Zhong","Yinzheng",""],["Lisitsa","Alexei",""]]}
{"id":"2308.10894","submitter":"Hauke K\\\"ohn","authors":"Hauke Koehn, Andreas Just, Peter Berczik, Michael Tremmel","title":"Dynamics of supermassive black hole triples in the ROMULUS25\n  cosmological simulation","comments":"11 pages, 6 figures, 4 tables, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For a pair of supermassive black holes (SMBHs) in the remnant of a dual\ngalaxy merger, well-known models exist to describe their dynamical evolution\nuntil the final coalescence accompanied by the emission of a low-frequency\ngravitational wave (GW) signal. In this article, we investigate the dynamical\nevolution of three SMBH triple systems recovered from the ROMULUS25\ncosmological simulation to explore common dynamical evolution patterns and\nassess typical coalescence times. For this purpose, we construct initial\nconditions from the ROMULUS25 data and perform high-resolution gravitodynamical\n\\N-body simulations. We track the orbital evolution from the galactic inspiral\nto the formation of hard binaries at sub-parsec separation and use the observed\nhardening rates to project the time of coalescence. In all cases, the two\nheaviest black holes form an efficiently hardening binary that merges within\nfractions of the Hubble time. The lightest SMBH either gets ejected, forms a\nstable hierarchical triple system with the heavier binary, forms a hardening\nbinary with the previously merged binary's remnant, or remains on a wide\ngalactic orbit. The coalescence times of the lighter black holes are thus\nsignificantly longer than for the heavier binary, as they experience lower\ndynamical friction and stellar hardening rates. We observe the formation of\nhierarchical triples when the density profile of the galactic nucleus is\nsufficiently steep.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:55:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Koehn","Hauke",""],["Just","Andreas",""],["Berczik","Peter",""],["Tremmel","Michael",""]]}
{"id":"2308.10895","submitter":"Claudio Landim","authors":"Claudio Landim and Sonia Velasco","title":"Dynamic and static large deviations of a one dimensional SSEP in weak\n  contact with reservoirs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive a formula for the quasi-potential of one-dimensional symmetric\nexclusion process in weak contact with reservoirs. The interaction with the\nboundary is so weak that, in the diffusive scale, the density profile evolves\nas the one of the exclusion process with reflecting boundary conditions. In\norder to observe an evolution of the total mass, the process has to be observed\nin a longer time-scale, in which the density profile becomes immediately\nconstant.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:58:28 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Landim","Claudio",""],["Velasco","Sonia",""]]}
{"id":"2308.10896","submitter":"Markus Worchel","authors":"Markus Worchel and Marc Alexa","title":"Differentiable Shadow Mapping for Efficient Inverse Graphics","comments":"CVPR 2023, project page:\n  https://mworchel.github.io/differentiable-shadow-mapping","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show how shadows can be efficiently generated in differentiable rendering\nof triangle meshes. Our central observation is that pre-filtered shadow\nmapping, a technique for approximating shadows based on rendering from the\nperspective of a light, can be combined with existing differentiable\nrasterizers to yield differentiable visibility information. We demonstrate at\nseveral inverse graphics problems that differentiable shadow maps are orders of\nmagnitude faster than differentiable light transport simulation with similar\naccuracy -- while differentiable rasterization without shadows often fails to\nconverge.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:58:43 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Worchel","Markus",""],["Alexa","Marc",""]]}
{"id":"2308.10897","submitter":"Evonne Ng","authors":"Evonne Ng, Sanjay Subramanian, Dan Klein, Angjoo Kanazawa, Trevor\n  Darrell, Shiry Ginosar","title":"Can Language Models Learn to Listen?","comments":"ICCV 2023; Project page:\n  https://people.eecs.berkeley.edu/~evonne_ng/projects/text2listen/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a framework for generating appropriate facial responses from a\nlistener in dyadic social interactions based on the speaker's words. Given an\ninput transcription of the speaker's words with their timestamps, our approach\nautoregressively predicts a response of a listener: a sequence of listener\nfacial gestures, quantized using a VQ-VAE. Since gesture is a language\ncomponent, we propose treating the quantized atomic motion elements as\nadditional language token inputs to a transformer-based large language model.\nInitializing our transformer with the weights of a language model pre-trained\nonly on text results in significantly higher quality listener responses than\ntraining a transformer from scratch. We show that our generated listener motion\nis fluent and reflective of language semantics through quantitative metrics and\na qualitative user study. In our evaluation, we analyze the model's ability to\nutilize temporal and semantic aspects of spoken text. Project page:\nhttps://people.eecs.berkeley.edu/~evonne_ng/projects/text2listen/\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:02 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Ng","Evonne",""],["Subramanian","Sanjay",""],["Klein","Dan",""],["Kanazawa","Angjoo",""],["Darrell","Trevor",""],["Ginosar","Shiry",""]]}
{"id":"2308.10898","submitter":"Xueyi Liu","authors":"Xueyi Liu and Bin Wang and He Wang and Li Yi","title":"Few-Shot Physically-Aware Articulated Mesh Generation via Hierarchical\n  Deformation","comments":"ICCV 2023. Project Page: https://meowuu7.github.io/few-arti-obj-gen","journal-ref":"International Conference on Computer Vision (ICCV) 2023","doi":null,"report-no":null,"categories":"cs.CV cs.CG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We study the problem of few-shot physically-aware articulated mesh\ngeneration. By observing an articulated object dataset containing only a few\nexamples, we wish to learn a model that can generate diverse meshes with high\nvisual fidelity and physical validity. Previous mesh generative models either\nhave difficulties in depicting a diverse data space from only a few examples or\nfail to ensure physical validity of their samples. Regarding the above\nchallenges, we propose two key innovations, including 1) a hierarchical mesh\ndeformation-based generative model based upon the divide-and-conquer philosophy\nto alleviate the few-shot challenge by borrowing transferrable deformation\npatterns from large scale rigid meshes and 2) a physics-aware deformation\ncorrection scheme to encourage physically plausible generations. We conduct\nextensive experiments on 6 articulated categories to demonstrate the\nsuperiority of our method in generating articulated meshes with better\ndiversity, higher visual fidelity, and better physical validity over previous\nmethods in the few-shot setting. Further, we validate solid contributions of\nour two innovations in the ablation study. Project page with code is available\nat https://meowuu7.github.io/few-arti-obj-gen.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:07 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liu","Xueyi",""],["Wang","Bin",""],["Wang","He",""],["Yi","Li",""]]}
{"id":"2308.10899","submitter":"Tignting Liao","authors":"Tingting Liao, Hongwei Yi, Yuliang Xiu, Jiaxaing Tang, Yangyi Huang,\n  Justus Thies, Michael J. Black","title":"TADA! Text to Animatable Digital Avatars","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce TADA, a simple-yet-effective approach that takes textual\ndescriptions and produces expressive 3D avatars with high-quality geometry and\nlifelike textures, that can be animated and rendered with traditional graphics\npipelines. Existing text-based character generation methods are limited in\nterms of geometry and texture quality, and cannot be realistically animated due\nto inconsistent alignment between the geometry and the texture, particularly in\nthe face region. To overcome these limitations, TADA leverages the synergy of a\n2D diffusion model and an animatable parametric body model. Specifically, we\nderive an optimizable high-resolution body model from SMPL-X with 3D\ndisplacements and a texture map, and use hierarchical rendering with score\ndistillation sampling (SDS) to create high-quality, detailed, holistic 3D\navatars from text. To ensure alignment between the geometry and texture, we\nrender normals and RGB images of the generated character and exploit their\nlatent embeddings in the SDS training process. We further introduce various\nexpression parameters to deform the generated character during training,\nensuring that the semantics of our generated character remain consistent with\nthe original SMPL-X model, resulting in an animatable character. Comprehensive\nevaluations demonstrate that TADA significantly surpasses existing approaches\non both qualitative and quantitative measures. TADA enables creation of\nlarge-scale digital character assets that are ready for animation and\nrendering, while also being easily editable through natural language. The code\nwill be public for research purposes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:10 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Liao","Tingting",""],["Yi","Hongwei",""],["Xiu","Yuliang",""],["Tang","Jiaxaing",""],["Huang","Yangyi",""],["Thies","Justus",""],["Black","Michael J.",""]]}
{"id":"2308.10900","submitter":"Danial Langeroodi","authors":"Danial Langeroodi and Jens Hjorth and Zhoujian Zhang","title":"Little Red Dots or Brown Dwarfs? NIRSpec Discovery of Three Brown Dwarfs\n  Masquerading as NIRCam-Selected Highly-Reddened AGNs","comments":"Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cold, substellar objects such as brown dwarfs have long been recognized as\ncontaminants in color-selected samples of active galactic nuclei (AGNs). In\nparticular, their near- to mid-infrared colors (1--5 $\\mu$m) can closely\nresemble the V-shaped ($f_{\\lambda}$) spectra of highly-reddened accreting\nsupermassive black holes, the little red dots, especially at $6 < z < 7$.\nRecently, a NIRCam-selected sample of little red dots over 45 arcmin$^2$ has\nbeen followed-up with deep NIRSpec multi-object prism spectroscopy through the\nUNCOVER program. By investigating the acquired spectra, we identify three out\nof the 13 followed-up objects as T dwarfs with temperatures between 650 and\n1300 K and distances between 0.8 and 4.8 kpc. We identify the remaining 10\nobjects as extragalactic sources at $z_{\\rm spec} > 3$. Given that three of\nthese sources are the strongly lensed images of the same AGN (Abell2744-QSO1),\nwe derive a brown dwarf contamination fraction of 27\\% in this NIRCam-selection\nof little red dots. We find that in the near-infrared filters, brown dwarfs\nappear much bluer than the highly-reddened AGN, providing an avenue for\ndistinguishing the two and compiling cleaner samples of\nphotometrically-selected highly-reddened AGN.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:27 GMT"},{"version":"v2","created":"Tue, 22 Aug 2023 23:59:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Langeroodi","Danial",""],["Hjorth","Jens",""],["Zhang","Zhoujian",""]]}
{"id":"2308.10901","submitter":"Russell Mendonca","authors":"Russell Mendonca, Shikhar Bahl, Deepak Pathak","title":"Structured World Models from Human Videos","comments":"RSS 2023. Website at https://human-world-model.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We tackle the problem of learning complex, general behaviors directly in the\nreal world. We propose an approach for robots to efficiently learn manipulation\nskills using only a handful of real-world interaction trajectories from many\ndifferent settings. Inspired by the success of learning from large-scale\ndatasets in the fields of computer vision and natural language, our belief is\nthat in order to efficiently learn, a robot must be able to leverage\ninternet-scale, human video data. Humans interact with the world in many\ninteresting ways, which can allow a robot to not only build an understanding of\nuseful actions and affordances but also how these actions affect the world for\nmanipulation. Our approach builds a structured, human-centric action space\ngrounded in visual affordances learned from human videos. Further, we train a\nworld model on human videos and fine-tune on a small amount of robot\ninteraction data without any task supervision. We show that this approach of\naffordance-space world models enables different robots to learn various\nmanipulation skills in complex settings, in under 30 minutes of interaction.\nVideos can be found at https://human-world-model.github.io\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:32 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Mendonca","Russell",""],["Bahl","Shikhar",""],["Pathak","Deepak",""]]}
{"id":"2308.10902","submitter":"Keunhong Park","authors":"Keunhong Park, Philipp Henzler, Ben Mildenhall, Jonathan T. Barron,\n  Ricardo Martin-Brualla","title":"CamP: Camera Preconditioning for Neural Radiance Fields","comments":"SIGGRAPH Asia 2023, Project page: https://camp-nerf.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural Radiance Fields (NeRF) can be optimized to obtain high-fidelity 3D\nscene reconstructions of objects and large-scale scenes. However, NeRFs require\naccurate camera parameters as input -- inaccurate camera parameters result in\nblurry renderings. Extrinsic and intrinsic camera parameters are usually\nestimated using Structure-from-Motion (SfM) methods as a pre-processing step to\nNeRF, but these techniques rarely yield perfect estimates. Thus, prior works\nhave proposed jointly optimizing camera parameters alongside a NeRF, but these\nmethods are prone to local minima in challenging settings. In this work, we\nanalyze how different camera parameterizations affect this joint optimization\nproblem, and observe that standard parameterizations exhibit large differences\nin magnitude with respect to small perturbations, which can lead to an\nill-conditioned optimization problem. We propose using a proxy problem to\ncompute a whitening transform that eliminates the correlation between camera\nparameters and normalizes their effects, and we propose to use this transform\nas a preconditioner for the camera parameters during joint optimization. Our\npreconditioned camera optimization significantly improves reconstruction\nquality on scenes from the Mip-NeRF 360 dataset: we reduce error rates (RMSE)\nby 67% compared to state-of-the-art NeRF approaches that do not optimize for\ncameras like Zip-NeRF, and by 29% relative to state-of-the-art joint\noptimization approaches using the camera parameterization of SCNeRF. Our\napproach is easy to implement, does not significantly increase runtime, can be\napplied to a wide variety of camera parameterizations, and can\nstraightforwardly be incorporated into other NeRF-like models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:54 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 23:28:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Park","Keunhong",""],["Henzler","Philipp",""],["Mildenhall","Ben",""],["Barron","Jonathan T.",""],["Martin-Brualla","Ricardo",""]]}
{"id":"2308.10903","submitter":"Xue-Yang Song","authors":"Xue-Yang Song, Ya-Hui Zhang and T. Senthil","title":"Phase transitions out of quantum Hall states in moir\\'e TMD bilayers","comments":"17+3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the recent experimental breakthroughs in observing Fractional\nQuantum Anomalous Hall (FQAH) states in moir\\'e Transition Metal Dichalcogenide\n(TMD) bilayers, we propose and study various unconventional phase transitions\nbetween quantum Hall phases and Fermi liquids or charge ordered phases upon\ntuning the bandwidth. At filling $\\nu=-\\frac{2}{3}$, we describe a direct\ntransition between the FQAH state and a Charge Density Wave (CDW) insulator.\nThe critical theory resembles that of the familiar deconfined quantum critical\npoint(DQCP) but with an additional Chern-Simons term. At filling\n$\\nu=-\\frac{1}{2}$, we study the possibility of a continuous transition between\nthe composite Fermi liquid (CFL) and the Fermi liquid (FL) building on and\nrefining previous work by Barkeshli and McGreevy. Crucially we show that\ntranslation symmetry alone is enough to enable a second order CFL-FL\ntransition. We argue that there must be critical CDW fluctuations though\nneither phase has long range CDW order. We present experimental signatures the\nmost striking of which is a universal jump of both longitudinal and Hall\nresistivities at the critical point. With disorder, we argue that the CDW order\ngets pinned and the CFL-FL evolution happens through an intermediate\nelectrically insulating phase with mobile neutral fermions. A clean analog of\nthis insulating phase with long range CDW order and a neutral fermi surface can\npotentially also exist. We discuss the properties of this phase and the nature\nof its phase transitions. We also present a critical theory for the CFL to FL\ntransition at filling $\\nu=-\\frac{3}{4}$. Our work opens up a new avenue to\nrealize deconfined criticalities and fractionalized phases beyond familiar\nLandau level physics in the moir\\'e Chern band system.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:59:59 GMT"}],"update_date":"2023-08-22","authors_parsed":[["Song","Xue-Yang",""],["Zhang","Ya-Hui",""],["Senthil","T.",""]]}
{"id":"2308.10904","submitter":"Zuhair Al-Johar Dr.","authors":"Zuhair A. Al-Johar","title":"An alternative proof of Godel's first incompleteness theorem","comments":"5 pages, typos corrected, lemmas added, more uniform notation,\n  clarifying notes added, the proof is essentially the same","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This proof of Godel's first incompleteness theorem doesn't require\nomega-consistency, nor does it refer to codes of negated sentences as in\nRosser's. It begins from where Godel's usual proof ends, and stalks it till it\nends proving it.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 10:41:10 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 11:32:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Al-Johar","Zuhair A.",""]]}
{"id":"2308.10905","submitter":"Mingfei Guo","authors":"Mingfei Guo","title":"Analyzing Quantization in TVM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There has been many papers in academic literature on quantizing weight\ntensors in deep learning models to reduce inference latency and memory\nfootprint. TVM also has the ability to quantize weights and support low-bit\ncomputations. Although quantization is typically expected to improve inference\ntime, in TVM, the performance of 8-bit quantization does not meet the\nexpectations. Typically, when applying 8-bit quantization to a deep learning\nmodel, it is usually expected to achieve around 50% of the full-precision\ninference time. However, in this particular case, not only does the quantized\nversion fail to achieve the desired performance boost, but it actually performs\nworse, resulting in an inference time that is about 2 times as slow as the\nnon-quantized version. In this project, we thoroughly investigate the reasons\nbehind the underperformance and assess the compatibility and optimization\nopportunities of 8-bit quantization in TVM. We discuss the optimization of two\ndifferent types of tasks: computation-bound and memory-bound, and provide a\ndetailed comparison of various optimization techniques in TVM. Through the\nidentification of performance issues, we have successfully improved\nquantization by addressing a bug in graph building. Furthermore, we analyze\nmultiple optimization strategies to achieve the optimal quantization result.\nThe best experiment achieves 163.88% improvement compared with the TVM compiled\nbaseline in inference time for the compute-bound task and 194.98% for the\nmemory-bound task.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 07:39:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Guo","Mingfei",""]]}
{"id":"2308.10906","submitter":"Bowen Zhao","authors":"Daniel Pook-Kolb, Bowen Zhao, Lars Andersson, Badri Krishnan and\n  Shing-Tung Yau","title":"Properties of Quasi-local mass in binary black hole mergers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Identifying a general quasi-local notion of energy-momentum and angular\nmomentum would be an important advance in general relativity with potentially\nimportant consequences for mathematical and astrophysical studies in general\nrelativity. In this paper we study a promising approach to this problem first\nproposed by Wang and Yau in 2009 based on isometric embeddings of closed\nsurfaces in Minkowski space. We study the properties of the Wang-Yau\nquasi-local mass in high accuracy numerical simulations of the head-on\ncollisions of two non-spinning black holes within full general relativity. We\ndiscuss the behavior of the Wang-Yau quasi-local mass on constant expansion\nsurfaces and we compare its behavior with the irreducible mass. We investigate\nthe time evolution of the Wang-Yau Quasi-local mass in numerical examples. In\naddition we discuss mathematical subtleties in defining the Wang-Yau mass for\nmarginally trapped surfaces.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 10:31:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pook-Kolb","Daniel",""],["Zhao","Bowen",""],["Andersson","Lars",""],["Krishnan","Badri",""],["Yau","Shing-Tung",""]]}
{"id":"2308.10907","submitter":"Vivek Thumbigere Math","authors":"Himanshi Tanwar, Jeba Mercy Gnanasekaran, Devon Allison, Ling-shiang\n  Chuang, Xuesong He, Mario Aimetti, Giacomo Baima, Massimo Costalonga, Raymond\n  K. Cross, Cynthia Sears, Saurabh Mehandru, Judy Cho, Jean-Frederic Colombel,\n  Jean-Pierre Raufman, Vivek Thumbigere-Math","title":"Unraveling the Link between Periodontitis and Inflammatory Bowel\n  Disease: Challenges and Outlook","comments":"Total Words: 7,016 Figures: 3 Tables: 2 Reference: 341","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Periodontitis and Inflammatory Bowel Disease (IBD) are chronic inflammatory\nconditions, characterized by microbial dysbiosis and hyper-immunoinflammatory\nresponses. Growing evidence suggest an interconnection between periodontitis\nand IBD, implying a shift from the traditional concept of independent diseases\nto a complex, reciprocal cycle. This review outlines the evidence supporting an\nOral-Gut axis, marked by a higher prevalence of periodontitis in IBD patients\nand vice versa. The specific mechanisms linking periodontitis and IBD remain to\nbe fully elucidated, but emerging evidence points to the ectopic colonization\nof the gut by oral bacteria, which promote intestinal inflammation by\nactivating host immune responses. This review presents an in-depth examination\nof the interconnection between periodontitis and IBD, highlighting the shared\nmicrobiological and immunological pathways, and proposing a multi-hit\nhypothesis in the pathogenesis of periodontitis-mediated intestinal\ninflammation. Furthermore, the review underscores the critical need for a\ncollaborative approach between dentists and gastroenterologists to provide\nholistic oral-systemic healthcare.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 18:59:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tanwar","Himanshi",""],["Gnanasekaran","Jeba Mercy",""],["Allison","Devon",""],["Chuang","Ling-shiang",""],["He","Xuesong",""],["Aimetti","Mario",""],["Baima","Giacomo",""],["Costalonga","Massimo",""],["Cross","Raymond K.",""],["Sears","Cynthia",""],["Mehandru","Saurabh",""],["Cho","Judy",""],["Colombel","Jean-Frederic",""],["Raufman","Jean-Pierre",""],["Thumbigere-Math","Vivek",""]]}
{"id":"2308.10908","submitter":"Parag Saxena","authors":"Samar Wazir, Gautam Siddharth Kashyap, Parag Saxena","title":"MLOps: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Machine Learning (ML) has become a widely accepted method for\nsignificant progress that is rapidly evolving. Since it employs computational\nmethods to teach machines and produce acceptable answers. The significance of\nthe Machine Learning Operations (MLOps) methods, which can provide acceptable\nanswers for such problems, is examined in this study. To assist in the creation\nof software that is simple to use, the authors research MLOps methods. To\nchoose the best tool structure for certain projects, the authors also assess\nthe features and operability of various MLOps methods. A total of 22 papers\nwere assessed that attempted to apply the MLOps idea. Finally, the authors\nadmit the scarcity of fully effective MLOps methods based on which advancements\ncan self-regulate by limiting human engagement.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 19:24:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wazir","Samar",""],["Kashyap","Gautam Siddharth",""],["Saxena","Parag",""]]}
{"id":"2308.10909","submitter":"Joshua Attih","authors":"Joshua Attih","title":"Global Warming In Ghana's Major Cities Based on Statistical Analysis of\n  NASA's POWER Over 3-Decades","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Global warming's impact on high temperatures in various parts of the world\nhas raised concerns. This study investigates long-term temperature trends in\nfour major Ghanaian cities representing distinct climatic zones. Using NASA's\nPrediction of Worldwide Energy Resource (POWER) data, statistical analyses\nassess local climate warming and its implications. Linear regression trend\nanalysis and eXtreme Gradient Boosting (XGBoost) machine learning predict\ntemperature variations. Land Surface Temperature (LST) profile maps generated\nfrom the RSLab platform enhance accuracy. Results reveal local warming trends,\nparticularly in industrialized Accra. Demographic factors aren't significant.\nXGBoost model's low Root Mean Square Error (RMSE) scores demonstrate\neffectiveness in capturing temperature patterns. Wa unexpectedly has the\nhighest mean temperature. Estimated mean temperatures for mid-2023 are: Accra\n27.86{\\deg}C, Kumasi 27.15{\\deg}C, Kete-Krachi 29.39{\\deg}C, and Wa\n30.76{\\deg}C. These findings improve understanding of local climate warming for\npolicymakers and communities, aiding climate change strategies.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:23:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Attih","Joshua",""]]}
{"id":"2308.10910","submitter":"Yunlu Yan","authors":"Yunlu Yan, Chun-Mei Feng, Yuexiang Li, Rick Siow Mong Goh, Lei Zhu","title":"Federated Pseudo Modality Generation for Incomplete Multi-Modal MRI\n  Reconstruction","comments":"10 pages, 5 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While multi-modal learning has been widely used for MRI reconstruction, it\nrelies on paired multi-modal data which is difficult to acquire in real\nclinical scenarios. Especially in the federated setting, the common situation\nis that several medical institutions only have single-modal data, termed the\nmodality missing issue. Therefore, it is infeasible to deploy a standard\nfederated learning framework in such conditions. In this paper, we propose a\nnovel communication-efficient federated learning framework, namely Fed-PMG, to\naddress the missing modality challenge in federated multi-modal MRI\nreconstruction. Specifically, we utilize a pseudo modality generation mechanism\nto recover the missing modality for each single-modal client by sharing the\ndistribution information of the amplitude spectrum in frequency space. However,\nthe step of sharing the original amplitude spectrum leads to heavy\ncommunication costs. To reduce the communication cost, we introduce a\nclustering scheme to project the set of amplitude spectrum into finite cluster\ncentroids, and share them among the clients. With such an elaborate design, our\napproach can effectively complete the missing modality within an acceptable\ncommunication cost. Extensive experiments demonstrate that our proposed method\ncan attain similar performance with the ideal scenario, i.e., all clients have\nthe full set of modalities. The source code will be released.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 03:38:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yan","Yunlu",""],["Feng","Chun-Mei",""],["Li","Yuexiang",""],["Goh","Rick Siow Mong",""],["Zhu","Lei",""]]}
{"id":"2308.10911","submitter":"Chenwei Wang","authors":"Chenwei Wang, Siyi Luo, Jifang Pei, Yulin Huang, Yin Zhang, and Jianyu\n  Yang","title":"Crucial Feature Capture and Discrimination for Limited Training Data SAR\n  ATR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although deep learning-based methods have achieved excellent performance on\nSAR ATR, the fact that it is difficult to acquire and label a lot of SAR images\nmakes these methods, which originally performed well, perform weakly. This may\nbe because most of them consider the whole target images as input, but the\nresearches find that, under limited training data, the deep learning model\ncan't capture discriminative image regions in the whole images, rather focus on\nmore useless even harmful image regions for recognition. Therefore, the results\nare not satisfactory. In this paper, we design a SAR ATR framework under\nlimited training samples, which mainly consists of two branches and two\nmodules, global assisted branch and local enhanced branch, feature capture\nmodule and feature discrimination module. In every training process, the global\nassisted branch first finishes the initial recognition based on the whole\nimage. Based on the initial recognition results, the feature capture module\nautomatically searches and locks the crucial image regions for correct\nrecognition, which we named as the golden key of image. Then the local extract\nthe local features from the captured crucial image regions. Finally, the\noverall features and local features are input into the classifier and\ndynamically weighted using the learnable voting parameters to collaboratively\ncomplete the final recognition under limited training samples. The model\nsoundness experiments demonstrate the effectiveness of our method through the\nimprovement of feature distribution and recognition probability. The\nexperimental results and comparisons on MSTAR and OPENSAR show that our method\nhas achieved superior recognition performance.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:57:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Chenwei",""],["Luo","Siyi",""],["Pei","Jifang",""],["Huang","Yulin",""],["Zhang","Yin",""],["Yang","Jianyu",""]]}
{"id":"2308.10912","submitter":"Herv\\'e Zwirn","authors":"Herv\\'e Zwirn","title":"Explaining Emergence","comments":"13 pages, 15 figures, to appear in the forthcoming proceedings of the\n  UM6P Science Week 2023 Complexity Summit","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC cs.AI cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emergence is a pregnant property in various fields. It is the fact for a\nphenomenon to appear surprisingly and to be such that it seems at first sight\nthat it is not possible to predict its apparition. That is the reason why it\nhas often been said that emergence is a subjective property relative to the\nobserver. Some mathematical systems having very simple and deterministic rules\nnevertheless show emergent behavior. Studying these systems shed a new light on\nthe subject and allows to define a new concept, computational irreducibility,\nwhich deals with behaviors that even though they are totally deterministic\ncannot be predicted without simulating them. Computational irreducibility is\nthen a key for understanding emergent phenomena from an objective point of view\nthat does not need the mention of any observer.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 20:31:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zwirn","Herv\u00e9",""]]}
{"id":"2308.10913","submitter":"James Gornet","authors":"James Gornet and Matthew Thomson","title":"Automated mapping of virtual environments with visual predictive coding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.CV cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Humans construct internal cognitive maps of their environment directly from\nsensory inputs without access to a system of explicit coordinates or distance\nmeasurements. While machine learning algorithms like SLAM utilize specialized\nvisual inference procedures to identify visual features and construct spatial\nmaps from visual and odometry data, the general nature of cognitive maps in the\nbrain suggests a unified mapping algorithmic strategy that can generalize to\nauditory, tactile, and linguistic inputs. Here, we demonstrate that predictive\ncoding provides a natural and versatile neural network algorithm for\nconstructing spatial maps using sensory data. We introduce a framework in which\nan agent navigates a virtual environment while engaging in visual predictive\ncoding using a self-attention-equipped convolutional neural network. While\nlearning a next image prediction task, the agent automatically constructs an\ninternal representation of the environment that quantitatively reflects\ndistances. The internal map enables the agent to pinpoint its location relative\nto landmarks using only visual information.The predictive coding network\ngenerates a vectorized encoding of the environment that supports vector\nnavigation where individual latent space units delineate localized, overlapping\nneighborhoods in the environment. Broadly, our work introduces predictive\ncoding as a unified algorithmic framework for constructing cognitive maps that\ncan naturally extend to the mapping of auditory, sensorimotor, and linguistic\ninputs.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:29:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gornet","James",""],["Thomson","Matthew",""]]}
{"id":"2308.10914","submitter":"Christian Fonseca-Mora","authors":"Santiago Cambronero, David Campos, C. A. Fonseca-Mora, Dar\\'io Mena","title":"On the Supremum of a Family of Set Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of supremum of a family of set functions was introduced by M.\nVeraar and I. Yaroslavtsev (2016) for families of measures defined on a\nmeasurable space. We expand this concept to include families of set functions\nin a very general setting. The case of families of signed measures is widely\ndiscussed and exploited.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:31:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cambronero","Santiago",""],["Campos","David",""],["Fonseca-Mora","C. A.",""],["Mena","Dar\u00edo",""]]}
{"id":"2308.10915","submitter":"Peng Li","authors":"Peng Li, Zhiyi Chen, Xu Chu, Kexin Rong","title":"DiffPrep: Differentiable Data Preprocessing Pipeline Search for Learning\n  over Tabular Data","comments":"Published at SIGMOD 2023","journal-ref":"ACM SIGMOD 2023","doi":"10.1145/3589328","report-no":null,"categories":"cs.DB cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data preprocessing is a crucial step in the machine learning process that\ntransforms raw data into a more usable format for downstream ML models.\nHowever, it can be costly and time-consuming, often requiring the expertise of\ndomain experts. Existing automated machine learning (AutoML) frameworks claim\nto automate data preprocessing. However, they often use a restricted search\nspace of data preprocessing pipelines which limits the potential performance\ngains, and they are often too slow as they require training the ML model\nmultiple times. In this paper, we propose DiffPrep, a method that can\nautomatically and efficiently search for a data preprocessing pipeline for a\ngiven tabular dataset and a differentiable ML model such that the performance\nof the ML model is maximized. We formalize the problem of data preprocessing\npipeline search as a bi-level optimization problem. To solve this problem\nefficiently, we transform and relax the discrete, non-differential search space\ninto a continuous and differentiable one, which allows us to perform the\npipeline search using gradient descent with training the ML model only once.\nOur experiments show that DiffPrep achieves the best test accuracy on 15 out of\nthe 18 real-world datasets evaluated and improves the model's test accuracy by\nup to 6.6 percentage points.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 23:40:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Peng",""],["Chen","Zhiyi",""],["Chu","Xu",""],["Rong","Kexin",""]]}
{"id":"2308.10916","submitter":"Xingyi Yang","authors":"Xingyi Yang and Xinchao Wang","title":"Diffusion Model as Representation Learner","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion Probabilistic Models (DPMs) have recently demonstrated impressive\nresults on various generative tasks.Despite its promises, the learned\nrepresentations of pre-trained DPMs, however, have not been fully understood.\nIn this paper, we conduct an in-depth investigation of the representation power\nof DPMs, and propose a novel knowledge transfer method that leverages the\nknowledge acquired by generative DPMs for recognition tasks. Our study begins\nby examining the feature space of DPMs, revealing that DPMs are inherently\ndenoising autoencoders that balance the representation learning with\nregularizing model capacity. To this end, we introduce a novel knowledge\ntransfer paradigm named RepFusion. Our paradigm extracts representations at\ndifferent time steps from off-the-shelf DPMs and dynamically employs them as\nsupervision for student networks, in which the optimal time is determined\nthrough reinforcement learning. We evaluate our approach on several image\nclassification, semantic segmentation, and landmark detection benchmarks, and\ndemonstrate that it outperforms state-of-the-art methods. Our results uncover\nthe potential of DPMs as a powerful tool for representation learning and\nprovide insights into the usefulness of generative models beyond sample\ngeneration. The code is available at\n\\url{https://github.com/Adamdad/Repfusion}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 00:38:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yang","Xingyi",""],["Wang","Xinchao",""]]}
{"id":"2308.10917","submitter":"Liangrui Pan","authors":"Liangrui Pan, Dazheng Liu, Zhichao Feng, Wenjuan Liu, Shaoliang Peng","title":"PACS: Prediction and analysis of cancer subtypes from multi-omics data\n  based on a multi-head attention mechanism model","comments":"Submitted to BIBM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to the high heterogeneity and clinical characteristics of cancer, there\nare significant differences in multi-omic data and clinical characteristics\namong different cancer subtypes. Therefore, accurate classification of cancer\nsubtypes can help doctors choose the most appropriate treatment options,\nimprove treatment outcomes, and provide more accurate patient survival\npredictions. In this study, we propose a supervised multi-head attention\nmechanism model (SMA) to classify cancer subtypes successfully. The attention\nmechanism and feature sharing module of the SMA model can successfully learn\nthe global and local feature information of multi-omics data. Second, it\nenriches the parameters of the model by deeply fusing multi-head attention\nencoders from Siamese through the fusion module. Validated by extensive\nexperiments, the SMA model achieves the highest accuracy, F1 macroscopic, F1\nweighted, and accurate classification of cancer subtypes in simulated,\nsingle-cell, and cancer multiomics datasets compared to AE, CNN, and GNN-based\nmodels. Therefore, we contribute to future research on multiomics data using\nour attention-based approach.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:54:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pan","Liangrui",""],["Liu","Dazheng",""],["Feng","Zhichao",""],["Liu","Wenjuan",""],["Peng","Shaoliang",""]]}
{"id":"2308.10918","submitter":"Hwan Kim","authors":"Hwan Kim, Junghoon Kim, Byung Suk Lee, and Sungsu Lim","title":"Deep Semi-supervised Anomaly Detection with Metapath-based Context\n  Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph anomaly detection has attracted considerable attention in recent years.\nThis paper introduces a novel approach that leverages metapath-based\nsemi-supervised learning, addressing the limitations of previous methods. We\npresent a new framework, Metapath-based Semi-supervised Anomaly Detection\n(MSAD), incorporating GCN layers in both the encoder and decoder to efficiently\npropagate context information between abnormal and normal nodes. The design of\nmetapath-based context information and a specifically crafted anomaly community\nenhance the process of learning differences in structures and attributes, both\nglobally and locally. Through a comprehensive set of experiments conducted on\nseven real-world networks, this paper demonstrates the superiority of the MSAD\nmethod compared to state-of-the-art techniques. The promising results of this\nstudy pave the way for future investigations, focusing on the optimization and\nanalysis of metapath patterns to further enhance the effectiveness of anomaly\ndetection on attributed networks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:41:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Hwan",""],["Kim","Junghoon",""],["Lee","Byung Suk",""],["Lim","Sungsu",""]]}
{"id":"2308.10919","submitter":"Zuojian Pan","authors":"Zuojian Pan, Zhizhong Chen, Yiyong Chen, Haodong Zhang, Han Yang,\n  Jingxin Nie, Chuhan Deng, Boyan Dong, Daqi Wang, Yuchen Li, Weihua Chen, Fei\n  Jiao, Xiangning Kang, Chuanyu Jia, Zhiwen Liang, Qi Wang, Guoyi Zhang and Bo\n  Shen","title":"Effect of Grain Coalescence on Dislocation and Stress Evolution of GaN\n  Films Grown on Nanoscale Patterned Sapphire Substrates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two types of nucleation layers (NLs), including in-situ low-temperature grown\nGaN (LT-GaN) and ex-situ sputtered physical vapor deposition AlN (PVD-AlN), are\napplied on cone-shaped nanoscale patterned sapphire substrate (NPSS). The\ninitial growth process of GaN on these two NLs is comparably investigated by a\nseries of growth interruptions. The coalescence process of GaN grains is\nmodulated by adjusting the three-dimensional (3D) temperatures. The results\nindicate that higher 3D temperatures reduce the edge dislocation density while\nincreasing the residual compressive stress in GaN films. Compared to the LT-GaN\nNLs, the PVD-AlN NLs effectively resist Ostwald ripening and facilitate the\nuniform growth of GaN grains on NPSS. Furthermore, GaN films grown on NPSS with\nPVD-AlN NLs exhibit a reduction of over 50% in both screw and edge dislocation\ndensities compared to those grown on LT-GaN NLs. Additionally, PVD-AlN NLs\nresult in an increase of about 0.5 GPa in the residual compressive stress\nobserved in GaN films.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:50:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pan","Zuojian",""],["Chen","Zhizhong",""],["Chen","Yiyong",""],["Zhang","Haodong",""],["Yang","Han",""],["Nie","Jingxin",""],["Deng","Chuhan",""],["Dong","Boyan",""],["Wang","Daqi",""],["Li","Yuchen",""],["Chen","Weihua",""],["Jiao","Fei",""],["Kang","Xiangning",""],["Jia","Chuanyu",""],["Liang","Zhiwen",""],["Wang","Qi",""],["Zhang","Guoyi",""],["Shen","Bo",""]]}
{"id":"2308.10920","submitter":"Carlos Andres Agudelo Serna","authors":"Carlos Andres Agudelo Serna, Rachelle Bosua, Sean B. Maynard, Atif\n  Ahmad","title":"Addressing Knowledge Leakage Risk caused by the use of mobile devices in\n  Australian Organizations","comments":"Pages 14. arXiv admin note: text overlap with arXiv:1606.01450","journal-ref":"PACIS 2017 Proceedings. 224 http://aisel.aisnet.org/pacis2017/224","doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Information and knowledge leakage has become a significant security risk to\nAustralian organizations. Each security incident in Australian business cost an\naverage US$\\$$2.8 million. Furthermore, Australian organisations spend the\nsecond most worldwide (US$\\$$1.2 million each on average) on investigating and\nassessing information breaches. The leakage of sensitive organizational\ninformation occurs through different avenues, such as social media, cloud\ncomputing and mobile devices. In this study, we (1) analyze the knowledge\nleakage risk (KLR) caused by the use of mobile devices in knowledge-intensive\nAustralian organizations, (2) present a conceptual research model to explain\nthe determinants that influence KLR through the use of mobile devices grounded\nin the literature, (3) conduct interviews with security and knowledge managers\nto understand what strategies they use to mitigate KLR caused by the use of\nmobile devices and (4) use content analysis and the conceptual model to frame\nthe preliminary findings from the interviews. Keywords: Knowledge leakage,\nmobile devices, mobile contexts, knowledge leakage risk\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:03:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Serna","Carlos Andres Agudelo",""],["Bosua","Rachelle",""],["Maynard","Sean B.",""],["Ahmad","Atif",""]]}
{"id":"2308.10921","submitter":"Paulina Szymczak","authors":"Paulina Szymczak, Ewa Szczurek","title":"Artificial intelligence-driven antimicrobial peptide discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Antimicrobial peptides (AMPs) emerge as promising agents against\nantimicrobial resistance, providing an alternative to conventional antibiotics.\nArtificial intelligence (AI) revolutionized AMP discovery through both\ndiscrimination and generation approaches. The discriminators aid the\nidentification of promising candidates by predicting key peptide properties\nsuch as activity and toxicity, while the generators learn the distribution over\npeptides and enable sampling novel AMP candidates, either de novo, or as\nanalogues of a prototype peptide. Moreover, the controlled generation of AMPs\nwith desired properties is achieved by discriminator-guided filtering,\npositive-only learning, latent space sampling, as well as conditional and\noptimized generation. Here we review recent achievements in AI-driven AMP\ndiscovery, highlighting the most exciting directions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:02:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Szymczak","Paulina",""],["Szczurek","Ewa",""]]}
{"id":"2308.10922","submitter":"Mukul Singh","authors":"Mukul Singh, Jos\\'e Cambronero, Sumit Gulwani, Vu Le, Carina Negreanu,\n  Gust Verbruggen","title":"DataVinci: Learning Syntactic and Semantic String Repairs","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  String data is common in real-world datasets: 67.6% of values in a sample of\n1.8 million real Excel spreadsheets from the web were represented as text.\nSystems that successfully clean such string data can have a significant impact\non real users. While prior work has explored errors in string data, proposed\napproaches have often been limited to error detection or require that the user\nprovide annotations, examples, or constraints to fix the errors. Furthermore,\nthese systems have focused independently on syntactic errors or semantic errors\nin strings, but ignore that strings often contain both syntactic and semantic\nsubstrings. We introduce DataVinci, a fully unsupervised string data error\ndetection and repair system. DataVinci learns regular-expression-based patterns\nthat cover a majority of values in a column and reports values that do not\nsatisfy such patterns as data errors. DataVinci can automatically derive edits\nto the data error based on the majority patterns and constraints learned over\nother columns without the need for further user interaction. To handle strings\nwith both syntactic and semantic substrings, DataVinci uses an LLM to abstract\n(and re-concretize) portions of strings that are semantic prior to learning\nmajority patterns and deriving edits. Because not all data can result in\nmajority patterns, DataVinci leverages execution information from an existing\nprogram (which reads the target data) to identify and correct data repairs that\nwould not otherwise be identified. DataVinci outperforms 7 baselines on both\nerror detection and repair when evaluated on 4 existing and new benchmarks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:09:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Singh","Mukul",""],["Cambronero","Jos\u00e9",""],["Gulwani","Sumit",""],["Le","Vu",""],["Negreanu","Carina",""],["Verbruggen","Gust",""]]}
{"id":"2308.10923","submitter":"Kalyani Desikan","authors":"Machasri Manickam and Kalyani Desikan","title":"Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander\n  Code using Vertex-split of a Bipartite Graph","comments":"17 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The second largest eigenvalue of a graph is an important algebraic parameter\nwhich is related with the expansion, connectivity and randomness properties of\na graph. Expanders are highly connected sparse graphs. In coding theory,\nExpander codes are Error Correcting codes made up of bipartite expander graphs.\nIn this paper, first we prove the interlacing of the eigenvalues of the\nadjacency matrix of the bipartite graph with the eigenvalues of the bipartite\nquotient matrices of the corresponding graph matrices. Then we obtain bounds\nfor the second largest and second smallest eigenvalues. Since the graph is\nbipartite, the results for Laplacian will also hold for Signless Laplacian\nmatrix. We then introduce a new method called vertex-split of a bipartite graph\nto construct asymptotically good expander codes with expansion factor\n$\\frac{D}{2}<\\alpha < D$ and $\\epsilon<\\frac{1}{2}$ and prove a condition for\nthe vertex-split of a bipartite graph to be $k-$connected with respect to\n$\\lambda_{2}.$ Further, we prove that the vertex-split of $G$ is a bipartite\nexpander. Finally, we construct an asymptotically good expander code whose\nfactor graph is a graph obtained by the vertex-split of a bipartite graph.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:10:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Manickam","Machasri",""],["Desikan","Kalyani",""]]}
{"id":"2308.10924","submitter":"Jan Ambjorn","authors":"Jan Ambjorn and Yoshiyuki Watabiki","title":"Is the present acceleration of the Universe caused by merging with other\n  universes?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that by allowing our Universe to merge with other universes one is\nlead to modified Friedmann equations that explain the present accelerated\nexpansion of our Universe without the need of a cosmological constant.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:37:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ambjorn","Jan",""],["Watabiki","Yoshiyuki",""]]}
{"id":"2308.10925","submitter":"Chen Sun","authors":"Hyeonseok Seong, Chen Sun, Seokhoon Yun","title":"Axion Magnetic Resonance: A Novel Enhancement in Axion-Photon Conversion","comments":"13 pages, 5 figures, numerical code available at\n  https://github.com/ChenSun-Phys/axion-magnetic-resonance","journal-ref":null,"doi":null,"report-no":"DESY-23-118, LA-UR-23-29378, CTPU-PTC-23-39","categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We identify a new resonance, axion magnetic resonance (AMR), that can greatly\nenhance the conversion rate between axions and photons. A series of axion\nsearch experiments rely on converting them into photons inside a constant\nmagnetic field background. A common bottleneck of such experiments is the\nconversion amplitude being suppressed by the axion mass when $m_a \\gtrsim\n10^{-4}~$eV. We point out that a spatial or temporal variation in the magnetic\nfield can cancel the difference between the photon dispersion relation and that\nof the axion, hence greatly enhancing the conversion probability. We\ndemonstrate that the enhancement can be achieved by both a helical magnetic\nfield profile and a harmonic oscillation of the magnitude. Our approach can\nextend the projected ALPS II reach in the axion-photon coupling ($g_{a\\gamma}$)\nby two orders of magnitude at $m_a = 10^{-3}\\;\\mathrm{eV}$ with moderate\nassumptions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Seong","Hyeonseok",""],["Sun","Chen",""],["Yun","Seokhoon",""]]}
{"id":"2308.10926","submitter":"Philip Mansfield","authors":"Philip Mansfield, Elise Darragh-Ford, Yunchong Wang, Ethan O. Nadler,\n  Risa H. Wechsler","title":"Symfind: Addressing the Fragility of Subhalo Finders and Revealing the\n  Durability of Subhalos","comments":"45 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A major question in $\\Lambda$CDM is what this theory actually predicts for\nthe properties of subhalo populations. Subhalos are difficult to simulate and\nto find within simulations, and this propagates into uncertainty in theoretical\npredictions for satellite galaxies. We present Symfind, a new\nparticle-tracking-based subhalo finder, and demonstrate that it can track\nsubhalos to orders-of-magnitude lower masses than commonly used halo-finding\ntools, with a focus on Rockstar and consistent-trees. These longer survival\nmean that at a fixed peak subhalo mass, we find $\\approx 15\\%{-}40\\%$ more\nsubhalos within the virial radius, $R_\\textrm{vir}$, and $\\approx 35\\%-120\\%$\nmore subhalos within $R_\\textrm{vir}/4$ in the Symphony dark-matter-only\nsimulation suite. More subhalos are found as resolution is increased. We\nperform extensive numerical testing. In agreement with idealized simulations,\nwe show that the $v_{\\rm max}$ of subhalos is only resolved at high resolutions\n($n_\\textrm{peak}\\gtrsim3\\times 10^4$), but that mass loss itself can be\nresolved at much more modest particle counts ($n_\\textrm{peak}\\gtrsim4\\times\n10^3$). We show that Rockstar converges to false solutions for the mass\nfunction, radial distribution, and disruption masses of subhalos. We argue that\nour new method can trace resolved subhalos until the point of typical galaxy\ndisruption without invoking ``orphan'' modeling. We outline a concrete set of\nsteps for determining whether other subhalo finders meet the same criteria. We\npublicly release Symfind catalogs and particle data for the Symphony simulation\nsuite at \\url{http://web.stanford.edu/group/gfc/symphony}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mansfield","Philip",""],["Darragh-Ford","Elise",""],["Wang","Yunchong",""],["Nadler","Ethan O.",""],["Wechsler","Risa H.",""]]}
{"id":"2308.10927","submitter":"Noah Rogers","authors":"Noah S. J. Rogers, Claudia M. Scarlata, Evan D. Skillman, Nathan R.\n  Eggen, Anne E. Jaskot, Vihang Mehta, John M. Cannon","title":"HST UV Spectroscopy of the Dwarf Starburst Galaxy Pox 186","comments":"22 pages, 9 figures, accepted for publication in The Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Studying the galaxies responsible for reionization is often conducted through\nlocal reionization-era analogs; however, many of these local analogs are too\nmassive to be representative of the low-mass star-forming galaxies that are\nthought to play a dominant role in reionization. The local, low-mass dwarf\nstarburst galaxy Pox 186 is one such system with physical conditions\nrepresentative of a reionization-era starburst galaxy. We present deep\nultraviolet (UV) spectroscopy of Pox 186 to study its stellar population and\nionization conditions and to compare these conditions to other local starburst\ngalaxies. The new Cosmic Origins Spectrograph data are combined with archival\nobservations to cover $\\sim$1150-2000 A and allow for an assessment of Pox\n186's stellar population, the relative enrichment of C and O, and the escape of\nionizing photons. We detect significant Ly$\\alpha$ and low-ionization state\nabsorption features, indicative of previously undetected neutral gas in Pox\n186. The C/O relative abundance, log(C/O) = -0.62$\\pm$0.02, is consistent with\nother low-metallicity dwarf galaxies and suggests a comparable star formation\nhistory in these systems. We compare UV line ratios in Pox 186 to those of\ndwarf galaxies and photoionization models, and we find excellent agreement for\nthe ratios utilizing the intense C III], O III], and double-peaked C IV lines.\nHowever, the UV and optical He II emission is faint and distinguishes Pox 186\nfrom other local starburst dwarf galaxies. We explore mechanisms that could\nproduce faint He II, which have implications for the low-mass reionization-era\ngalaxies which may have similar ionization conditions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rogers","Noah S. J.",""],["Scarlata","Claudia M.",""],["Skillman","Evan D.",""],["Eggen","Nathan R.",""],["Jaskot","Anne E.",""],["Mehta","Vihang",""],["Cannon","John M.",""]]}
{"id":"2308.10928","submitter":"Matthew Sullivan","authors":"Hooman Davoudiasl, Matthew Sullivan","title":"Adagio for Thermal Relics","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A larger Planck scale during an early epoch leads to a smaller Hubble rate,\nwhich is the measure for efficiency of primordial processes. The resulting\nslower cosmic tempo can accommodate alternative cosmological histories. We\nconsider this possibility in the context of extra dimensional theories, which\ncan provide a natural setting for the scenario. If the fundamental scale of the\ntheory is not too far above the weak scale, to alleviate the ``hierarchy\nproblem,\" cosmological constraints imply that thermal relic dark matter would\nbe at the GeV scale, which may be disfavored by cosmic microwave background\nmeasurements. Such dark matter becomes viable again in our proposal, due to\nsmaller requisite annihilation cross section, further motivating ongoing low\nenergy accelerator-based searches. Quantum gravity signatures associated with\nthe extra dimensional setting can be probed at high energy colliders -- up to\n$\\sim 13$ TeV at the LHC or $\\sim 100$ TeV at FCC-hh. Searches for missing\nenergy signals of dark sector states, with masses $\\gtrsim 10$ GeV, can be\npursued at a future circular lepton collider.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Davoudiasl","Hooman",""],["Sullivan","Matthew",""]]}
{"id":"2308.10929","submitter":"Andrew Lucas","authors":"Chao Yin, Andrew Lucas","title":"Heisenberg-limited metrology with perturbing interactions","comments":"24+5 pages, 3+0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that it is possible to perform Heisenberg-limited metrology on\nGHZ-like states, in the presence of generic spatially local interactions during\nthe measurement process. An explicit protocol, which relies on measurements and\nfeedback based on polynomial-time classical computation, achieves the\nHeisenberg limit. In one dimension, matrix product state methods can be used to\nperform this classical calculation, while in higher dimensions the cluster\nexpansion underlies the efficient calculations. The latter approach is based on\nan efficient classical sampling algorithm for short-time quantum dynamics,\nwhich may be of independent interest.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yin","Chao",""],["Lucas","Andrew",""]]}
{"id":"2308.10930","submitter":"Aaron B. Pearlman","authors":"Aaron B. Pearlman, Paul Scholz, Suryarao Bethapudi, Jason W. T.\n  Hessels, Victoria M. Kaspi, Franz Kirsten, Kenzie Nimmo, Laura G. Spitler,\n  Emmanuel Fonseca, Bradley W. Meyers, Ingrid Stairs, Chia Min Tan, Mohit\n  Bhardwaj, Shami Chatterjee, Amanda M. Cook, Alice P. Curtin, Fengqiu Adam\n  Dong, Tarraneh Eftekhari, B. M. Gaensler, Tolga G\\\"uver, Jane Kaczmarek,\n  Calvin Leung, Kiyoshi W. Masui, Daniele Michilli, Thomas A. Prince, Ketan R.\n  Sand, Kaitlyn Shin, Kendrick M. Smith, Shriharsh P. Tendulkar","title":"Multiwavelength Constraints on the Origin of a Nearby Repeating Fast\n  Radio Burst Source in a Globular Cluster","comments":"58 pages, 10 figures, 7 tables, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since fast radio bursts (FRBs) were discovered, their precise origins have\nremained a mystery. Multiwavelength observations of nearby FRB sources provide\none of the best ways to make rapid progress in our understanding of the\nenigmatic FRB phenomenon. We present results from a sensitive, broadband\nmultiwavelength X-ray and radio observational campaign of FRB 20200120E, the\nclosest known extragalactic repeating FRB source. At a distance of 3.63 Mpc,\nFRB 20200120E resides in an exceptional location, within a ~10 Gyr-old globular\ncluster in the M81 galactic system. We place deep limits on both the persistent\nX-ray luminosity and prompt X-ray emission at the time of radio bursts from FRB\n20200120E, which we use to constrain possible progenitors for the source. We\ncompare our results to various classes of X-ray sources and transients. In\nparticular, we find that FRB 20200120E is unlikely to be associated with:\nultraluminous X-ray bursts (ULXBs), similar to those observed from objects of\nunknown origin in other extragalactic globular clusters; giant flares, like\nthose observed from Galactic and extragalactic magnetars; or most intermediate\nflares and very bright short X-ray bursts, similar to those seen from magnetars\nin the Milky Way. We show that FRB 20200120E is also unlikely to be powered by\na persistent or transient ultraluminous X-ray (ULX) source or a young,\nextragalactic pulsar embedded in a Crab-like nebula. We also provide new\nconstraints on the compatibility of FRB 20200120E with accretion-based FRB\nmodels involving X-ray binaries and models that require a synchrotron maser\nprocess from relativistic shocks to generate FRB emission. These results\nhighlight the power that multiwavelength observations of nearby FRBs can\nprovide for discriminating between potential FRB progenitor models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pearlman","Aaron B.",""],["Scholz","Paul",""],["Bethapudi","Suryarao",""],["Hessels","Jason W. T.",""],["Kaspi","Victoria M.",""],["Kirsten","Franz",""],["Nimmo","Kenzie",""],["Spitler","Laura G.",""],["Fonseca","Emmanuel",""],["Meyers","Bradley W.",""],["Stairs","Ingrid",""],["Tan","Chia Min",""],["Bhardwaj","Mohit",""],["Chatterjee","Shami",""],["Cook","Amanda M.",""],["Curtin","Alice P.",""],["Dong","Fengqiu Adam",""],["Eftekhari","Tarraneh",""],["Gaensler","B. M.",""],["G\u00fcver","Tolga",""],["Kaczmarek","Jane",""],["Leung","Calvin",""],["Masui","Kiyoshi W.",""],["Michilli","Daniele",""],["Prince","Thomas A.",""],["Sand","Ketan R.",""],["Shin","Kaitlyn",""],["Smith","Kendrick M.",""],["Tendulkar","Shriharsh P.",""]]}
{"id":"2308.10931","submitter":"Saarik Kalia","authors":"Itay M. Bloch and Saarik Kalia","title":"Curl up with a good $\\mathbf B$: Detecting ultralight dark matter with\n  differential magnetometry","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultralight dark matter (such as kinetically mixed dark-photon dark matter or\naxionlike dark matter) can source an oscillating magnetic-field signal at the\nEarth's surface, which can be measured by a synchronized array of ground-based\nmagnetometers. The global signal of ultralight dark matter can be robustly\npredicted for low masses, when the wavelength of the dark matter is larger than\nthe radius of the Earth, $\\lambda_\\mathrm{DM}\\gg R$. However, at higher masses,\nenvironmental effects, such as the Schumann resonances, can become relevant,\nmaking the global magnetic-field signal $\\mathbf B$ difficult to reliably\nmodel. In this work, we show that $\\nabla\\times\\mathbf B$ is robust to global\nenvironmental details, and instead only depends on the local dark matter\namplitude. We therefore propose to measure the local curl of the magnetic field\nat the Earth's surface, as a means for detecting ultralight dark matter with\n$\\lambda_\\mathrm{DM}\\lesssim R$. As this measurement requires vertical\ngradients, it can be done near a hill/mountain. Our measurement scheme not only\nallows for a robust prediction, but also acts as a background rejection scheme\nfor external noise sources. We show that our technique can be the most\nsensitive terrestrial probe of dark-photon dark matter for frequencies\n$10\\,\\mathrm{Hz}\\leq f_{A'}\\leq1\\,\\mathrm{kHz}$ (corresponding to masses\n$4\\times10^{-14}\\,\\mathrm{eV}\\leq m_{A'}\\leq4\\times10^{-12}\\,\\mathrm{eV}$). It\ncan also achieve sensitivities to axionlike dark matter comparabe to the CAST\nhelioscope, in the same frequency range.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bloch","Itay M.",""],["Kalia","Saarik",""]]}
{"id":"2308.10932","submitter":"Caitlin Casey","authors":"Caitlin M. Casey, Hollis B. Akins, Marko Shuntov, Olivier Ilbert,\n  Louise Paquereau, Maximilien Franco, Christopher C. Hayward, Steven L.\n  Finkelstein, Michael Boylan-Kolchin, Brant E. Robertson, Natalie Allen, Malte\n  Brinch, Olivia R. Cooper, Xuheng Ding, Nicole E. Drakos, Andreas L. Faisst,\n  Seiji Fujimoto, Steven Gillman, Santosh Harish, Michaela Hirschmann, Shuowen\n  Jin, Jeyhan S. Kartaltepe, Anton M. Koekemoer, Vasily Kokorev, Daizhong Liu,\n  Arianna S. Long, Georgios Magdis, Claudia Maraston, Crystal L. Martin, Henry\n  Joy McCracken, Jed McKinney, Bahram Mobasher, Jason Rhodes, R. Michael Rich,\n  David B. Sanders, John D. Silverman, Sune Toft, Aswin P. Vijayan, John R.\n  Weaver, Stephen M. Wilkins, Lilan Yang, Jorge A. Zavala","title":"COSMOS-Web: Intrinsically Luminous z$\\gtrsim$10 Galaxy Candidates Test\n  Early Stellar Mass Assembly","comments":"30 pages, 9 figures; ApJ submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report the discovery of 15 exceptionally luminous $10\\lesssim z\\lesssim14$\ncandidate galaxies discovered in the first 0.28 deg$^2$ of JWST/NIRCam imaging\nfrom the COSMOS-Web Survey. These sources span rest-frame UV magnitudes of\n$-20.5>M_{\\rm UV}>-22$, and thus constitute the most intrinsically luminous\n$z\\gtrsim10$ candidates identified by JWST to-date. Selected via NIRCam imaging\nwith Hubble ACS/F814W, deep ground-based observations corroborate their\ndetection and help significantly constrain their photometric redshifts. We\nanalyze their spectral energy distributions using multiple open-source codes\nand evaluate the probability of low-redshift solutions; we conclude that 12/15\n(80%) are likely genuine $z\\gtrsim10$ sources and 3/15 (20%) likely\nlow-redshift contaminants. Three of our $z\\sim12$ candidates push the limits of\nearly stellar mass assembly: they have estimated stellar masses\n$\\sim5\\times10^{9}\\,M_\\odot$, implying an effective stellar baryon fraction of\n$\\epsilon_{\\star}\\sim0.2-0.5$, where $\\epsilon_{\\star}\\equiv\nM_{\\star}/(f_{b}M_{halo})$. The assembly of such stellar reservoirs is made\npossible due to rapid, burst-driven star formation on timescales $<$100\\,Myr\nwhere the star-formation rate may far outpace the growth of the underlying dark\nmatter halos. This is supported by the similar volume densities inferred for\n$M_\\star\\sim10^{10}\\,M_\\odot$ galaxies relative to $M_\\star\\sim10^{9}\\,M_\\odot$\n-- both about $10^{-6}$ Mpc$^{-3}$ -- implying they live in halos of comparable\nmass. At such high redshifts, the duty cycle for starbursts would be of order\nunity, which could cause the observed change in the shape of the UVLF from a\ndouble powerlaw to Schechter at $z\\approx8$. Spectroscopic redshift\nconfirmation and ensuing constraints of their masses will be critical to\nunderstanding how, and if, such early massive galaxies push the limits of\ngalaxy formation in $\\Lambda$CDM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Casey","Caitlin M.",""],["Akins","Hollis B.",""],["Shuntov","Marko",""],["Ilbert","Olivier",""],["Paquereau","Louise",""],["Franco","Maximilien",""],["Hayward","Christopher C.",""],["Finkelstein","Steven L.",""],["Boylan-Kolchin","Michael",""],["Robertson","Brant E.",""],["Allen","Natalie",""],["Brinch","Malte",""],["Cooper","Olivia R.",""],["Ding","Xuheng",""],["Drakos","Nicole E.",""],["Faisst","Andreas L.",""],["Fujimoto","Seiji",""],["Gillman","Steven",""],["Harish","Santosh",""],["Hirschmann","Michaela",""],["Jin","Shuowen",""],["Kartaltepe","Jeyhan S.",""],["Koekemoer","Anton M.",""],["Kokorev","Vasily",""],["Liu","Daizhong",""],["Long","Arianna S.",""],["Magdis","Georgios",""],["Maraston","Claudia",""],["Martin","Crystal L.",""],["McCracken","Henry Joy",""],["McKinney","Jed",""],["Mobasher","Bahram",""],["Rhodes","Jason",""],["Rich","R. Michael",""],["Sanders","David B.",""],["Silverman","John D.",""],["Toft","Sune",""],["Vijayan","Aswin P.",""],["Weaver","John R.",""],["Wilkins","Stephen M.",""],["Yang","Lilan",""],["Zavala","Jorge A.",""]]}
{"id":"2308.10933","submitter":"Pietro Benetti Genolini","authors":"Pietro Benetti Genolini, Jerome P. Gauntlett, James Sparks","title":"Localizing Wrapped M5-branes and Gravitational Blocks","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider $d=2$, $\\mathcal{N}=(0,2)$ SCFTs that can arise from M5-branes\nwrapping four-dimensional, complex, toric manifolds and orbifolds. We use\nequivariant localization to compute the off-shell central charge of the dual\nsupergravity solutions, obtaining a result which can be written as a sum of\ngravitational blocks and precisely agrees with a field theory computation using\nanomaly polynomials and $c$-extremization.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Genolini","Pietro Benetti",""],["Gauntlett","Jerome P.",""],["Sparks","James",""]]}
{"id":"2308.10934","submitter":"Fabian Ballar-Trigueros","authors":"Fabian Ballar Trigueros, Tiago Mendes-Santos, Markus Heyl","title":"Mean-field theories are simple for neural quantum states","comments":"10 pages,3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The utilization of artificial neural networks for representing quantum\nmany-body wave functions has garnered significant attention, with enormous\nrecent progress for both ground states and non-equilibrium dynamics. However,\nquantifying state complexity within this neural quantum states framework\nremains elusive. In this study, we address this key open question from the\ncomplementary point of view: Which states are simple to represent with neural\nquantum states? Concretely, we show on a general level that ground states of\nmean-field theories with permutation symmetry only require a limited number of\nindependent neural network parameters. We analytically establish that, in the\nthermodynamic limit, convergence to the ground state of the fully-connected\ntransverse-field Ising model (TFIM), the mean-field Ising model, can be\nachieved with just one single parameter. Expanding our analysis, we explore the\nbehavior of the 1-parameter ansatz under breaking of the permutation symmetry.\nFor that purpose, we consider the TFIM with tunable long-range interactions,\ncharacterized by an interaction exponent $\\alpha$. We show analytically that\nthe 1-parameter ansatz for the neural quantum state still accurately captures\nthe ground state for a whole range of values for $0\\le \\alpha \\le 1$, implying\na mean-field description of the model in this regime.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Trigueros","Fabian Ballar",""],["Mendes-Santos","Tiago",""],["Heyl","Markus",""]]}
{"id":"2308.10935","submitter":"Rahul Sahay","authors":"Rahul Sahay, Stefan Divic, Daniel E. Parker, Tomohiro Soejima, Sajant\n  Anand, Johannes Hauschild, Monika Aidelsburger, Ashvin Vishwanath, Shubhayu\n  Chatterjee, Norman Y. Yao, Michael P. Zaletel","title":"Superconductivity in a Topological Lattice Model with Strong Repulsion","comments":"27 pages (with 8 figures) + 35 pages supplementary (with 14 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas cond-mat.supr-con quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The highly tunable nature of synthetic quantum materials -- both in the\nsolid-state and cold atom contexts -- invites examining which microscopic\ningredients aid in the realization of correlated phases of matter such as\nsuperconductors. Recent experimental advances in moir\\'e materials suggest that\nunifying the features of the Fermi-Hubbard model and quantum Hall systems\ncreates a fertile ground for the emergence of such phases. Here, we introduce a\nminimal 2D lattice model that incorporates exactly these features:\ntime-reversal symmetry, band topology, and strong repulsive interactions. By\nusing infinite cylinder density matrix renormalization group methods (cylinder\niDMRG), we investigate the ground state phase diagram of this model. We find\nthat it hosts an interaction-induced quantum spin Hall (QSH) insulator and\ndemonstrate that weakly hole-doping this state gives rise to a superconductor\nat a finite circumference, with indications that this behavior persists on\nlarger cylinders. At the aforementioned circumference, the superconducting\nphase is surprisingly robust to perturbations including additional repulsive\ninteractions in the pairing channel. By developing a technique to probe the\nsuperconducting gap function in iDMRG, we phenomenologically characterize the\nsuperconductor. Namely, we demonstrate that it is formed from the weak pairing\nof holes atop the QSH insulator. Furthermore, we determine the pairing symmetry\nof the superconductor, finding it to be $p$-wave -- reminiscent of the\nunconventional superconductivity reported in experiments on twisted bilayer\ngraphene (TBG). Motivated by this, we elucidate structural similarities and\ndifferences between our model and those of TBG in its chiral limit. Finally, to\nprovide a more direct experimental realization, we detail an implementation of\nour Hamiltonian in a system of cold fermionic alkaline-earth atoms in an\noptical lattice.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sahay","Rahul",""],["Divic","Stefan",""],["Parker","Daniel E.",""],["Soejima","Tomohiro",""],["Anand","Sajant",""],["Hauschild","Johannes",""],["Aidelsburger","Monika",""],["Vishwanath","Ashvin",""],["Chatterjee","Shubhayu",""],["Yao","Norman Y.",""],["Zaletel","Michael P.",""]]}
{"id":"2308.10936","submitter":"Genevieve Schroeder","authors":"Genevieve Schroeder (Northwestern/CIERA), Lauren Rhodes, Tanmoy\n  Laskar, Anya Nugent, Alicia Rouco Escorial, Jillian C. Rastinejad, Wen-fai\n  Fong, Alexander J. van der Horst, P\\'eter Veres, Kate D. Alexander, Alex\n  Andersson, Edo Berger, Peter K. Blanchard, Sarah Chastain, Lise Christensen,\n  Rob Fender, David A. Green, Paul Groot, Ian Heywood, Assaf Horesh, Luca Izzo,\n  Charles D. Kilpatrick, Elmar K\\\"ording, Amy Lien, Daniele B. Malesani,\n  Vanessa McBride, Kunal Mooley, Antonia Rowlinson, Huei Sears, Ben Stappers,\n  Nial Tanvir, Susanna D. Vergani, Ralph A.M.J. Wijers, David Williams-Baldwin,\n  and Patrick Woudt","title":"A Radio Flare in the Long-Lived Afterglow of the Distant Short GRB\n  210726A: Energy Injection or a Reverse Shock from Shell Collisions?","comments":"28 pages, 10 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the discovery of the radio afterglow of the short $\\gamma$-ray\nburst (GRB) 210726A, localized to a galaxy at a photometric redshift of $z\\sim\n2.4$. While radio observations commenced $\\lesssim 1~$day after the burst, no\nradio emission was detected until $\\sim11$~days. The radio afterglow\nsubsequently brightened by a factor of $\\sim 3$ in the span of a week, followed\nby a rapid decay (a ``radio flare''). We find that a forward shock afterglow\nmodel cannot self-consistently describe the multi-wavelength X-ray and radio\ndata, and underpredicts the flux of the radio flare by a factor of $\\approx 5$.\nWe find that the addition of substantial energy injection, which increases the\nisotropic kinetic energy of the burst by a factor of $\\approx 4$, or a reverse\nshock from a shell collision are viable solutions to match the broad-band\nbehavior. At $z\\sim 2.4$, GRB\\,210726A is among the highest redshift short GRBs\ndiscovered to date as well as the most luminous in radio and X-rays. Combining\nand comparing all previous radio afterglow observations of short GRBs, we find\nthat the majority of published radio searches conclude by $\\lesssim 10~$days\nafter the burst, potentially missing these late rising, luminous radio\nafterglows.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Schroeder","Genevieve","","Northwestern/CIERA"],["Rhodes","Lauren",""],["Laskar","Tanmoy",""],["Nugent","Anya",""],["Escorial","Alicia Rouco",""],["Rastinejad","Jillian C.",""],["Fong","Wen-fai",""],["van der Horst","Alexander J.",""],["Veres","P\u00e9ter",""],["Alexander","Kate D.",""],["Andersson","Alex",""],["Berger","Edo",""],["Blanchard","Peter K.",""],["Chastain","Sarah",""],["Christensen","Lise",""],["Fender","Rob",""],["Green","David A.",""],["Groot","Paul",""],["Heywood","Ian",""],["Horesh","Assaf",""],["Izzo","Luca",""],["Kilpatrick","Charles D.",""],["K\u00f6rding","Elmar",""],["Lien","Amy",""],["Malesani","Daniele B.",""],["McBride","Vanessa",""],["Mooley","Kunal",""],["Rowlinson","Antonia",""],["Sears","Huei",""],["Stappers","Ben",""],["Tanvir","Nial",""],["Vergani","Susanna D.",""],["Wijers","Ralph A. M. J.",""],["Williams-Baldwin","David",""],["Woudt","Patrick",""]]}
{"id":"2308.10937","submitter":"Dainis Dravins","authors":"Dainis Dravins (Lund), Hans-G\\\"unter Ludwig (Heidelberg)","title":"Solar Photospheric Spectrum Microvariability I. Theoretical searches for\n  proxies of radial-velocity jittering","comments":"18 pages, 20 figures, accepted for publication in Astronomy &\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extreme precision radial-velocity spectrometers enable extreme precision\nstellar spectroscopy. Searches for low-mass exoplanets around solar-type stars\nare limited by the physical variability in stellar spectra, such as the\nshort-term jittering of apparent radial velocities. To understand the physical\norigins of such jittering, the solar spectrum is assembled, as far as possible,\nfrom basic principles. Surface convection is modeled with time-dependent 3D\nhydrodynamics, followed by the computation of hyper-high resolution spectra\nduring numerous instances of the simulation sequences. The behavior of\ndifferent classes of photospheric absorption lines is monitored to identify\ncommonalities or differences between different classes of lines: weak or\nstrong, neutral or ionized, high- or low-excitation, atomic or molecular. For\nFe I and Fe II lines, the radial-velocity jittering over the small simulation\narea typically amounts to +-150 m/s, scaling to about 2 m/s for the full solar\ndisk. Most photospheric lines vary in phase but with different amplitudes among\ndifferent classes of lines. Radial-velocity excursions are greater for stronger\nand for ionized lines, decreasing at longer wavelengths. The differences\nbetween various line-groups are about one order of magnitude less than the full\njittering amplitudes. By matching very precisely measured radial velocities to\nthe characteristic jittering patterns between different line-groups should\nenable to identify and to remove a significant component of the stellar noise\noriginating in granulation. To verify the modeling toward such a filter,\npredictions of solar center-to-limb dependences of jittering amplitudes are\npresented for different classes of lines, testable with spatially resolving\nsolar telescopes connected to existing radial-velocity instruments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dravins","Dainis","","Lund"],["Ludwig","Hans-G\u00fcnter","","Heidelberg"]]}
{"id":"2308.10938","submitter":"Glenn Wagner","authors":"Glenn Wagner, Yves H. Kwan, Nick Bultinck, Steven H. Simon, S.A.\n  Parameswaran","title":"Coulomb-driven band unflattening suppresses $K$-phonon pairing in\n  moir\\'e graphene","comments":"8 pages, 2 figures (+16 pages, 8 figures supplement)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is a matter of current debate whether the gate-tunable superconductivity\nin twisted bilayer graphene is phonon-mediated or arises from electron-electron\ninteractions. The recent observation of the strong coupling of electrons to\nso-called $K$-phonon modes in angle-resolved photoemission spectroscopy\nexperiments has resuscitated early proposals that $K$-phonons drive\nsuperconductivity. We show that the bandwidth-enhancing effect of interactions\ndrastically weakens both the intrinsic susceptibility towards pairing as well\nas the screening of Coulomb repulsion that is essential for the phonon\nattraction to dominate at low temperature. This rules out purely\n$K$-phonon-mediated superconductivity with the observed transition temperature\nof $\\sim 1$ K. We conclude that the unflattening of bands by Coulomb\ninteractions challenges any purely phonon-driven pairing mechanism, and must be\naddressed by a successful theory of superconductivity in moir\\'e graphene.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wagner","Glenn",""],["Kwan","Yves H.",""],["Bultinck","Nick",""],["Simon","Steven H.",""],["Parameswaran","S. A.",""]]}
{"id":"2308.10939","submitter":"Hans Gl{\\o}ckner Giil","authors":"Hans Gl{\\o}ckner Giil and Jacob Linder","title":"Superconductor-altermagnet memory functionality without stray fields","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A novel class of antiferromagnets, dubbed altermagnets, exhibit a\nnon-relativistically spin-split band structure reminiscent of $d$-wave\nsuperconductors, despite the absence of net magnetization. This unique\ncharacteristic enables utilization in cryogenic stray-field-free memory\ndevices, offering the possibility of achieving high storage densities. In this\nLetter, we determine how a proximate altermagnet influences the critical\ntemperature $T_c$ of a conventional $s$-wave singlet superconductor.\nConsidering both a bilayer and trilayer, we show that such hybrid structures\nmay serve as stray-field free memory devices where the critical temperature is\ncontrolled by rotating the N\\'eel vector of one altermagnet, providing infinite\nmagnetoresistance. Furthermore, our study reveals that altermagnetism can\ncoexist with superconductivity up to a critical strength of the altermagnetic\norder as well as robustness of the altermagnetic influence on the conduction\nelectrons against non-magnetic impurities, ensuring the persistence of the\nproximity effect under realistic experimental conditions.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Giil","Hans Gl\u00f8ckner",""],["Linder","Jacob",""]]}
{"id":"2308.10940","submitter":"Rob Van Holstein","authors":"R. G. van Holstein, C. U. Keller, F. Snik, S. P. Bos","title":"Polarization-dependent beam shifts upon metallic reflection in\n  high-contrast imagers and telescopes","comments":"19 pages, 13 figures, 1 table, accepted for publication in Astronomy\n  & Astrophysics, forthcoming article","journal-ref":null,"doi":"10.1051/0004-6361/202243156","report-no":null,"categories":"astro-ph.IM astro-ph.EP physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  (Abridged) Context. To directly image rocky exoplanets in reflected\n(polarized) light, future space- and ground-based high-contrast imagers and\ntelescopes aim to reach extreme contrasts at close separations from the star.\nHowever, the achievable contrast will be limited by reflection-induced\npolarization aberrations. While polarization aberrations can be modeled\nnumerically, such computations provide little insight into the full range of\neffects, their origin and characteristics, and possible ways to mitigate them.\nAims. We aim to understand polarization aberrations produced by reflection off\nflat metallic mirrors at the fundamental level. Methods. We used polarization\nray tracing to numerically compute polarization aberrations and interpret the\nresults in terms of the polarization-dependent spatial and angular\nGoos-H\\\"anchen and Imbert-Federov shifts of the beam of light as described with\nclosed-form mathematical expressions in the physics literature. Results. We\nfind that all four beam shifts are fully reproduced by polarization ray tracing\nand study the origin, characteristics, sizes, and directions of the shifts. Of\nthe four beam shifts, only the spatial Goos-H\\\"anchen and Imbert-Federov shifts\nare relevant for high-contrast imagers and telescopes because these shifts are\nvisible in the focal plane and create a polarization structure in the PSF that\nreduces the performance of coronagraphs and the polarimetric speckle\nsuppression close to the star. Conclusions. The beam shifts in an optical\nsystem can be mitigated by keeping the f-numbers large and angles of incidence\nsmall. Most importantly, mirror coatings should not be optimized for maximum\nreflectivity, but should be designed to have a retardance close to 180{\\deg}.\nThe insights from our study can be applied to improve the performance of\ncurrent and future high-contrast imagers, especially those in space and on the\nELTs.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["van Holstein","R. G.",""],["Keller","C. U.",""],["Snik","F.",""],["Bos","S. P.",""]]}
{"id":"2308.10941","submitter":"Erin Rose Higgins","authors":"Erin R. Higgins, Jorick S. Vink, Raphael Hirschi, Alison M. Laird,\n  Gautham N. Sabhahit","title":"Stellar Wind Yields of Very Massive Stars","comments":"Accepted for publication in MNRAS. 14 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The most massive stars provide an essential source of recycled material for\nyoung clusters and galaxies. While very massive stars (VMS, M>100M) are\nrelatively rare compared to O stars, they lose disproportionately large amounts\nof mass already from the onset of core H-burning. VMS have optically thick\nwinds with elevated mass-loss rates in comparison to optically thin standard\nO-star winds. We compute wind yields and ejected masses on the main sequence,\nand we compare enhanced mass-loss rates to standard ones. We calculate solar\nmetallicity wind yields from MESA stellar evolution models in the range 50 -\n500M, including a large nuclear network of 92 isotopes, investigating not only\nthe CNO-cycle, but also the Ne-Na and Mg-Al cycles. VMS with enhanced winds\neject 5-10 times more H-processed elements (N, Ne, Na, Al) on the main sequence\nin comparison to standard winds, with possible consequences for observed\nanti-correlations, such as C-N and Na-O, in globular clusters. We find that for\nVMS 95% of the total wind yields is produced on the main sequence, while only\n~5% is supplied by the post-main sequence. This implies that VMS with enhanced\nwinds are the primary source of 26Al, contrasting previous works where\nclassical Wolf-Rayet winds had been suggested to be responsible for Galactic\n26Al enrichment. Finally, 200M stars eject 100 times more of each heavy element\nin their winds than 50M stars, and even when weighted by an IMF their wind\ncontribution is still an order of magnitude higher than that of 50M stars.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Higgins","Erin R.",""],["Vink","Jorick S.",""],["Hirschi","Raphael",""],["Laird","Alison M.",""],["Sabhahit","Gautham N.",""]]}
{"id":"2308.10942","submitter":"Xiaohui Liu","authors":"Xiao Lin Li, Xiaohui Liu, Feng Yuan and Hua Xing Zhu","title":"Illuminating Nucleon Gluon Interference via Calorimetric Asymmetry","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an innovative approach to the linearly polarized gluons confined\ninside the unpolarized nucleon in lepton-nucleon scattering. Our method\nanalyzes the correlation of energy flows at azimuthal separations $\\phi$. The\ninterference of the spinning gluon with both positive and negative helicities\ntranslates into a $\\cos(2\\phi)$ asymmetry imprinted on the detector. Unlike the\nconventional transverse momentum dependent (TMD) probes, the $\\cos(2\\phi)$\nasymmetry in this approach is preserved by rotational symmetry, holds to all\norders, and is free of radiation contamination, thus expected to provide the\nexquisite signature of the nucleon linearly polarized gluons.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Xiao Lin",""],["Liu","Xiaohui",""],["Yuan","Feng",""],["Zhu","Hua Xing",""]]}
{"id":"2308.10943","submitter":"Toby Brown","authors":"Toby Brown, Ian D. Roberts, Mallory Thorp, Sara L. Ellison, Nikki\n  Zabel, Christine D. Wilson, Yannick M. Bah\\'e, Dhruv Bisaria, Alberto D.\n  Bolatto, Alessandro Boselli, Aeree Chung, Luca Cortese, Barbara Catinella,\n  Timothy A. Davis, Mar\\'ia J. Jim\\'enez-Donaire, Claudia D.P. Lagos, Bumhyun\n  Lee, Laura C. Parker, Rory Smith, Kristine Spekkens, Adam R.H. Stevens,\n  Vicente Villanueva, Adam B. Watts","title":"VERTICO VII: Environmental quenching caused by suppression of molecular\n  gas content and star formation efficiency in Virgo Cluster galaxies","comments":"17 pages, 1 table, 5 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study how environment regulates the star formation cycle of 33 Virgo\nCluster satellite galaxies on 720 parsec scales. We present the first resolved\nstar-forming main sequence for cluster galaxies, dividing the sample based on\ntheir global HI properties and comparing to a control sample of field galaxies.\nHI-poor cluster galaxies have reduced star formation rate (SFR) surface\ndensities with respect to both HI-normal cluster and field galaxies (0.5 dex),\nsuggesting that mechanisms regulating the global HI content are responsible for\nquenching local star formation. We demonstrate that the observed quenching in\nHI-poor galaxies is caused by environmental processes such as ram pressure\nstripping (RPS) simultaneously reducing molecular gas surface density and star\nformation efficiency (SFE), compared to regions in HI-normal systems (by 0.38\nand 0.22 dex, respectively). We observe systematically elevated SFRs that are\ndriven by increased molecular gas surface densities at fixed stellar mass\nsurface density in the outskirts of early-stage RPS galaxies, while SFE remains\nunchanged with respect to the field sample. We quantify how RPS and starvation\naffect the star formation cycle of inner and outer galaxy discs as they are\nprocessed by the cluster. We show both are effective quenching mechanisms with\nthe key difference being that RPS acts upon the galaxy outskirts while\nstarvation regulates the star formation cycle throughout disc, including within\nthe truncation radius. For both processes, the quenching is caused by a\nsimultaneous reduction in molecular gas surface densities and SFE at fixed\nstellar mass surface density.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Brown","Toby",""],["Roberts","Ian D.",""],["Thorp","Mallory",""],["Ellison","Sara L.",""],["Zabel","Nikki",""],["Wilson","Christine D.",""],["Bah\u00e9","Yannick M.",""],["Bisaria","Dhruv",""],["Bolatto","Alberto D.",""],["Boselli","Alessandro",""],["Chung","Aeree",""],["Cortese","Luca",""],["Catinella","Barbara",""],["Davis","Timothy A.",""],["Jim\u00e9nez-Donaire","Mar\u00eda J.",""],["Lagos","Claudia D. P.",""],["Lee","Bumhyun",""],["Parker","Laura C.",""],["Smith","Rory",""],["Spekkens","Kristine",""],["Stevens","Adam R. H.",""],["Villanueva","Vicente",""],["Watts","Adam B.",""]]}
{"id":"2308.10944","submitter":"Henry Leung","authors":"Henry W. Leung, Jo Bovy","title":"Towards an astronomical foundation model for stars with a\n  Transformer-based model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rapid strides are currently being made in the field of artificial\nintelligence using Transformer-based models like Large Language Models (LLMs).\nThe potential of these methods for creating a single, large, versatile model in\nastronomy has not yet been explored. In this work, we propose a framework for\ndata-driven astronomy that uses the same core techniques and architecture as\nused by LLMs. Using a variety of observations and labels of stars as an\nexample, we build a Transformer-based model and train it in a self-supervised\nmanner with cross-survey data sets to perform a variety of inference tasks. In\nparticular, we demonstrate that a $\\textit{single}$ model can perform both\ndiscriminative and generative tasks even if the model was not trained or\nfine-tuned to do any specific task. For example, on the discriminative task of\nderiving stellar parameters from Gaia XP spectra, we achieve an accuracy of 47\nK in $T_\\mathrm{eff}$, 0.11 dex in $\\log{g}$, and 0.07 dex in $[\\mathrm{M/H}]$,\noutperforming an expert $\\texttt{XGBoost}$ model in the same setting. But the\nsame model can also generate XP spectra from stellar parameters, inpaint\nunobserved spectral regions, extract empirical stellar loci, and even determine\nthe interstellar extinction curve. Our framework demonstrates that building and\ntraining a $\\textit{single}$ foundation model without fine-tuning using data\nand parameters from multiple surveys to predict unmeasured observations and\nparameters is well within reach. Such \"Large Astronomy Models\" trained on large\nquantities of observational data will play a large role in the analysis of\ncurrent and future large surveys.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Leung","Henry W.",""],["Bovy","Jo",""]]}
{"id":"2308.10945","submitter":"Vyshnav Mohan","authors":"Vyshnav Mohan","title":"Krylov Complexity of Open Quantum Systems: From Hard Spheres to Black\n  Holes","comments":"25 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the complexity of quasi-static chaotic open quantum systems. As a\nprototypical example, we analytically compute the Krylov complexity of a slowly\nleaking hard-sphere gas using Berry's conjecture. We then connect it to the\nholographic complexity of a $d+1$-dimensional evaporating black hole using the\nComplexity=Volume proposal. We model the black hole spacetime by stitching\ntogether a sequence of static Schwarzschild patches across incoming negative\nenergy null shock waves. Under certain identification of parameters, we find\nthe late time complexity growth rate during each quasi-static equilibrium to be\nthe same in both systems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mohan","Vyshnav",""]]}
{"id":"2308.10946","submitter":"Antonio Enrique C\\'arcamo Hern\\'andez","authors":"A. E. C\\'arcamo Hern\\'andez, Diego Restrepo, Ivan Schmidt, \\'Oscar\n  Zapata","title":"Effective interactions for the SM fermion mass hierarchy and their\n  possible UV realization","comments":"16 pages, 6 captioned figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We built an extended 2HDM theory with a spontaneously broken $U(1) _{X}$\nglobal symmetry, where the tree level Universal Seesaw Mechanism generates the\nmass hierarchy of the Standard Model charged fermions and the Zee-Babu\nmechanism produces tiny active neutrino masses. The third family of SM charged\nfermions gets tree level masses from Yukawa interactions involving the Higgs\ndoublets $H_1$ (for the top quark) and $H_2$ (for the bottom quark and tau\nlepton). The model under consideration is consistent with SM fermion masses and\nmixings, with the muon and electron $g-2$ anomalies and successfully\naccommodates the constraints arising from charged lepton flavor violation and\nmeson oscillations. The proposed model predicts rates for charged lepton flavor\nviolating decays within the reach of forthcoming experiments.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hern\u00e1ndez","A. E. C\u00e1rcamo",""],["Restrepo","Diego",""],["Schmidt","Ivan",""],["Zapata","\u00d3scar",""]]}
{"id":"2308.10947","submitter":"Florian Ecker","authors":"Florian Ecker, Daniel Grumiller, Jelle Hartong, Alfredo P\\'erez,\n  Stefan Prohazka, Ricardo Troncoso","title":"Carroll black holes","comments":"58pp, 7 figs","journal-ref":null,"doi":null,"report-no":"TUW-23-03","categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite the absence of a lightcone structure, some solutions of Carroll\ngravity show black hole-like behaviour. We define Carroll black holes as\nsolutions of Carroll gravity that exhibit Carroll thermal properties and have a\nCarroll extremal surface, notions introduced in our work. The latter is a\nCarroll analogue of a Lorentzian extremal surface. As examples, we discuss the\nCarroll versions of Schwarzschild, Reissner-Nordstr\\\"om, and BTZ black holes\nand black hole solutions of generic 1+1 dimensional Carroll dilaton gravity,\nincluding Carroll JT and Carroll Witten black holes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ecker","Florian",""],["Grumiller","Daniel",""],["Hartong","Jelle",""],["P\u00e9rez","Alfredo",""],["Prohazka","Stefan",""],["Troncoso","Ricardo",""]]}
{"id":"2308.10948","submitter":"Soumavo Ghosh Dr.","authors":"Soumavo Ghosh, Paola Di Matteo","title":"Looking for a needle in a haystack : how to measure the length of a\n  stellar bar?","comments":"12 pages, 10 figures (including appendix), comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the challenges related to stellar bars is to determine accurately the\nlength of the bar in a disc galaxy. In past literature, a wide variety of\nmethods has been employed to measure the extent of a bar. However, a systematic\nstudy on determining the robustness and accuracy of different bar length\nestimators is still beyond our grasp. Here, we investigate the accuracy and the\ncorrelation (if any) between different bar length measurement methods while\nusing an $N$-body model of a barred galaxy where the bar evolves\nself-consistently in presence of a live dark matter halo. We investigate the\ntemporal evolution of the bar length, using different estimators (involving\nisophotal analysis of de-projected surface brightness distribution and Fourier\ndecomposition of surface density), and study their robustness and accuracy.\nFurther attempts have been made towards determining correlation between any two\nof these bar length estimators used here. In presence of spirals, the bar\nlength estimators which only consider the amplitudes of different Fourier\nmoments (and do not take into account the phase-angle of $m=2$ Fourier moment),\nsystematically overestimate the length of the bar. The strength dark-gaps\n(produced by bars) correlates strongly with the bar length in early rapid\ngrowth phase, and is only weakly anti-correlated during subsequent quiescent\nphase of bar evolution. However, the location of dark-gaps correlates only\nweakly with the bar length, hence can not be used as a robust proxy for\ndetermining the bar length. In addition, the bar length estimators, obtained\nusing isophotal analysis of de-projected surface brightness distribution,\nsystematically overestimate the bar length. The implications of bar length\nover(under)estimation in the context of determining fast/slow bars are further\ndiscussed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ghosh","Soumavo",""],["Di Matteo","Paola",""]]}
{"id":"2308.10949","submitter":"Hongguang Liu","authors":"Kristina Giesel, Hongguang Liu, Eric Rullit, Parampreet Singh, Stefan\n  Andreas Weigl","title":"Embedding generalized LTB models in polymerized spherically symmetric\n  spacetimes","comments":"31 pages,1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the existing works on the way (generalized) LTB models can be\nembedded into polymerized spherically symmetric models in several aspects. We\nre-examine such an embedding at the classical level and show that a suitable\nLTB condition can only be treated as a gauge fixing in the non-marginally bound\ncase, while in the marginally bound case it must be considered as an additional\nfirst class constraint. A novel aspect of our formalism, based on the effective\nequations of motion, is to derive compatible dynamics LTB conditions for\npolymerized models by using holonomy and inverse triad corrections\nsimultaneously, whereas in earlier work these were only considered separately.\nFurther, our formalism allows to derive compatible LTB conditions for a vast of\nclass of polymerized models available in the current literature. Within this\nbroader class of polymerizations there are effective models contained for which\nthe classical LTB condition is a compatible one. Our results show that there\nexist a class of effective models for which the dynamics decouples completely\nalong the radial direction. It turns out that this subsector is strongly linked\nto the property that in the temporally gauge fixed model, the algebra of the\ngeometric contribution to the Hamiltonian constraint and the spatial\ndiffeomorphism constraint is closed. We finally apply the formalism to existing\nmodels from the literature and compare our results to the existing ones.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Giesel","Kristina",""],["Liu","Hongguang",""],["Rullit","Eric",""],["Singh","Parampreet",""],["Weigl","Stefan Andreas",""]]}
{"id":"2308.10950","submitter":"Calum Gordon","authors":"Calum Gordon, Andrei Cuceu, Jon\\'as Chaves-Montero, Andreu\n  Font-Ribera, Alma Xochitl Gonz\\'alez-Morales, J. Aguilar, S. Ahlen, E.\n  Armengaud, S. Bailey, A. Bault, A. Brodzeller, D. Brooks, T. Claybaugh, R. de\n  la Cruz, K. Dawson, P. Doel, J. E. Forero-Romero, S. Gontcho A Gontcho, J.\n  Guy, H. K. Herrera-Alcantar, V. Ir\\v{s}i\\v{c}, N. G. Kara\\c{c}ayl{\\i}, D.\n  Kirkby, M. Landriau, L. Le Guillou, M. E. Levi, A. de la Macorra, M. Manera,\n  P. Martini, A. Meisner, R. Miquel, P. Montero-Camacho, A.\n  Mu\\~noz-Guti\\'errez, L. Napolitano, J. Nie, G. Niz, N. Palanque-Delabrouille,\n  W. J. Percival, M. Pieri, C. Poppett, F. Prada, I. P\\'erez-R\\`afols, C.\n  Ram\\'irez-P\\'erez, C. Ravoux, M. Rezaie, A. J. Ross, G. Rossi, E. Sanchez, D.\n  Schlegel, M. Schubnell, H. Seo, F. Sinigaglia, T. Tan, G. Tarl\\'e, M.\n  Walther, B. A. Weaver, C. Y\\`eche, Z. Zhou, H. Zou","title":"3D Correlations in the Lyman-$\\alpha$ Forest from Early DESI Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the first measurements of Lyman-$\\alpha$ (Ly$\\alpha$) forest\ncorrelations using early data from the Dark Energy Spectroscopic Instrument\n(DESI). We measure the auto-correlation of Ly$\\alpha$ absorption using 88,509\nquasars at $z>2$, and its cross-correlation with quasars using a further\n147,899 tracer quasars at $z\\gtrsim1.77$. Then, we fit these correlations using\na 13-parameter model based on linear perturbation theory and find that it\nprovides a good description of the data across a broad range of scales. We\ndetect the BAO peak with a signal-to-noise ratio of $3.8\\sigma$, and show that\nour measurements of the auto- and cross-correlations are fully-consistent with\nprevious measurements by the Extended Baryon Oscillation Spectroscopic Survey\n(eBOSS). Even though we only use here a small fraction of the final DESI\ndataset, our uncertainties are only a factor of 1.7 larger than those from the\nfinal eBOSS measurement. We validate the existing analysis methods of\nLy$\\alpha$ correlations in preparation for making a robust measurement of the\nBAO scale with the first year of DESI data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gordon","Calum",""],["Cuceu","Andrei",""],["Chaves-Montero","Jon\u00e1s",""],["Font-Ribera","Andreu",""],["Gonz\u00e1lez-Morales","Alma Xochitl",""],["Aguilar","J.",""],["Ahlen","S.",""],["Armengaud","E.",""],["Bailey","S.",""],["Bault","A.",""],["Brodzeller","A.",""],["Brooks","D.",""],["Claybaugh","T.",""],["de la Cruz","R.",""],["Dawson","K.",""],["Doel","P.",""],["Forero-Romero","J. E.",""],["Gontcho","S. Gontcho A",""],["Guy","J.",""],["Herrera-Alcantar","H. K.",""],["Ir\u0161i\u010d","V.",""],["Kara\u00e7ayl\u0131","N. G.",""],["Kirkby","D.",""],["Landriau","M.",""],["Guillou","L. Le",""],["Levi","M. E.",""],["de la Macorra","A.",""],["Manera","M.",""],["Martini","P.",""],["Meisner","A.",""],["Miquel","R.",""],["Montero-Camacho","P.",""],["Mu\u00f1oz-Guti\u00e9rrez","A.",""],["Napolitano","L.",""],["Nie","J.",""],["Niz","G.",""],["Palanque-Delabrouille","N.",""],["Percival","W. J.",""],["Pieri","M.",""],["Poppett","C.",""],["Prada","F.",""],["P\u00e9rez-R\u00e0fols","I.",""],["Ram\u00edrez-P\u00e9rez","C.",""],["Ravoux","C.",""],["Rezaie","M.",""],["Ross","A. J.",""],["Rossi","G.",""],["Sanchez","E.",""],["Schlegel","D.",""],["Schubnell","M.",""],["Seo","H.",""],["Sinigaglia","F.",""],["Tan","T.",""],["Tarl\u00e9","G.",""],["Walther","M.",""],["Weaver","B. A.",""],["Y\u00e8che","C.",""],["Zhou","Z.",""],["Zou","H.",""]]}
{"id":"2308.10951","submitter":"Lawrence Lee Jr","authors":"Lawrence Lee, Charles Bell, John Lawless, Emery Nibigira","title":"QCD Reference Frames and False Jet Individualism","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In collider physics, the properties of hadronic jets are often measured as a\nfunction of their lab-frame momenta. However, jet fragmentation must occur in\nthe particular rest frame of all color-connected particles. Since this frame\nneed not be the lab frame, the fragmentation of a jet depends on the properties\nof its sibling objects. This non-factorizability of jets has consequences for\njet techniques such as jet tagging, boosted boson measurements, and searches\nfor physics Beyond the Standard Model. In this paper, we will describe the\neffect and show its impact as predicted by simulation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lee","Lawrence",""],["Bell","Charles",""],["Lawless","John",""],["Nibigira","Emery",""]]}
{"id":"2308.10952","submitter":"Tony Mroczkowski","authors":"Tony Mroczkowski, Claudia Cicone, Matthias Reichert, Patricio\n  Gallardo, Hans Kaercher, Richard Hills, Daniel Bok, Erik Dahl, Pierre\n  Dubois-dit-Bonclaude, Aleksej Kiselev, Martin Timpe, Thomas Zimmerer, Simon\n  Dicker, Mike Macintosh, Pamela Klaassen, Michael Niemack","title":"Progress in the Design of the Atacama Large Aperture Submillimeter\n  Telescope","comments":"Accepted for the URSI GASS 2023, Sapporo, Japan, 19-26 August 2023. 4\n  pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Atacama Large Aperture Submillimeter Telescope (AtLAST) aims to be the\npremier next generation large diameter (50 meter) single dish observatory\ncapable of observations across the millimeter/submillimeter spectrum, from\n30~GHz to 1~THz. AtLAST will be sited in Chile at approximately 5100 meters\nabove sea level, high in the Atacama Desert near Llano de Chajnantor. The novel\nrocking-chair telescope design allows for a unprecedentedly wide field of view\n(FoV) of 1-2$^\\circ$ diameter, a large receiver cabin housing six major\ninstruments, and high structural stability during fast scanning operations (up\nto $\\sim 3^\\circ$ per second in azimuth). Here we describe the current status\nof, and expected outcomes for, the antenna design study, which will be\ncompleted in 2024.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mroczkowski","Tony",""],["Cicone","Claudia",""],["Reichert","Matthias",""],["Gallardo","Patricio",""],["Kaercher","Hans",""],["Hills","Richard",""],["Bok","Daniel",""],["Dahl","Erik",""],["Dubois-dit-Bonclaude","Pierre",""],["Kiselev","Aleksej",""],["Timpe","Martin",""],["Zimmerer","Thomas",""],["Dicker","Simon",""],["Macintosh","Mike",""],["Klaassen","Pamela",""],["Niemack","Michael",""]]}
{"id":"2308.10953","submitter":"Hongguang Liu","authors":"Kristina Giesel, Hongguang Liu, Parampreet Singh, Stefan Andreas Weigl","title":"Generalized analysis of a dust collapse in effective loop quantum\n  gravity: fate of shocks and covariance","comments":"25 pages,1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on modifications inspired from loop quantum gravity (LQG), spherically\nsymmetric models have recently been explored to understand the resolution of\nclassical singularities and the fate of the spacetime beyond. While such\nphenomenological studies have provided useful insights, questions remain on\nwhether such models exhibit some of the desired properties such as consistent\nLTB conditions, covariance and compatibility with the improved dynamics of loop\nquantum cosmology in the cosmological and LTB sectors. We provide a systematic\nprocedure to construct effective spherically symmetric models encoding LQG\nmodifications as a $1+1$ field theory models encoding these properties\nfollowing the analysis in our companion paper. As concrete examples of our\ngeneralized strategy we obtain and compare with different phenomenological\nmodels which have been investigated recently and demonstrate resolution of\nsingularity by quantum geometry effects via a bounce. These include models with\nareal gauge fixing, a polymerized vacuum solution, polymerized junction\nconditions and an Oppenheimer-Snyder dust collapse model. An important insight\nfrom our approach is that the dynamical equations care about the $\\det(e)$ part\nrather than the square root of the determinant of the spatial metric. As a\nresult, shock solutions which have been argued to exist in some models are\nfound to be absent even if one considers coordinate transformations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Giesel","Kristina",""],["Liu","Hongguang",""],["Singh","Parampreet",""],["Weigl","Stefan Andreas",""]]}
{"id":"2308.10954","submitter":"Louise Breuval","authors":"Adam G. Riess and Louise Breuval","title":"The Local Value of H$_0$","comments":"14 pages, 14 figures. Invited Review for IAU Symposium 376, Richard\n  de Grijs, Patricia Whitelock and Marcio Catelan, eds","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review the local determination of the Hubble constant, H$_0$, focusing on\nrecent measurements of a distance ladder constructed from geometry, Cepheid\nvariables and Type Ia supernovae (SNe Ia). We explain in some detail the\ncomponents of the ladder: (1) geometry from Milky Way parallaxes, masers in NGC\n4258 and detached eclipsing binaries in the Large Magellanic Cloud; (2)\nmeasurements of Cepheids with the Hubble Space Telescope (HST) in these anchors\nand in the hosts of 42 SNe Ia; and (3) SNe Ia in the Hubble flow. Great\nattention to negating systematic uncertainties through the use of differential\nmeasurements is reviewed. A wide array of tests are discussed. The measurements\nprovide a strong indication of a discrepancy between the local measure of H$_0$\nand its value predicted by $\\Lambda$CDM theory, calibrated by the cosmic\nmicrowave background ($Planck$), a decade-long challenge known as the `Hubble\nTension'. We present new measurements with the James Webb Space Telescope of\n$>$320 Cepheids on both rungs of the distance ladder, in a SN Ia host and the\ngeometric calibrator NGC 4258, showing reduced noise and good agreement with\nthe same as measured with HST. This provides strong evidence that systematic\nerrors in HST Cepheid photometry do not play a significant role in the present\nHubble Tension. Future measurements are expected to refine the local\ndetermination of the Hubble constant.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:00:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Riess","Adam G.",""],["Breuval","Louise",""]]}
{"id":"2308.10955","submitter":"Raz Slutsky","authors":"Joav Orovitz, Raz Slutsky, Itamar Vigdorovich","title":"The Space of Traces of the Free Group and Free Products of Matrix\n  Algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the space of traces of the free group is a Poulsen simplex,\ni.e., every trace is a pointwise limit of extremal traces. We prove that this\nfails for many virtually free groups. Using a similar strategy, we show that\nthe space of traces of the free product of matrix algebras\n$\\mathbf{M}_n(\\mathbb{C}) * \\mathbf{M}_n(\\mathbb{C})$ is a Poulsen simplex as\nwell, answering a question of Musat and R{\\o}rdam for $n \\geq 4$. Similar\nresults are shown for certain faces of the simplices above, most notably, for\nthe face of finite-dimensional traces.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:01:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Orovitz","Joav",""],["Slutsky","Raz",""],["Vigdorovich","Itamar",""]]}
{"id":"2308.10956","submitter":"Holger Metzler","authors":"Holger Metzler and Carlos A. Sierra","title":"Information content and maximum entropy of compartmental systems in\n  equilibrium","comments":"Code repository:\n  https://github.com/goujou/entropy_and_complexity_in_eq","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cond-mat.stat-mech math.DS math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although compartmental dynamical systems are used in many different areas of\nscience, model selection based on the maximum entropy principle (MaxEnt) is\nchallenging because of the lack of methods for quantifying the entropy for this\ntype of systems. Here, we take advantage of the interpretation of compartmental\nsystems as continuous-time Markov chains to obtain entropy measures that\nquantify model information content. In particular, we quantify the uncertainty\nof a single particle's path as it travels through the system as described by\npath entropy and entropy rates. Path entropy measures the uncertainty of the\nentire path of a traveling particle from its entry into the system until its\nexit, whereas entropy rates measure the average uncertainty of the\ninstantaneous future of a particle while it is in the system. We derive\nexplicit formulas for these two types of entropy for compartmental systems in\nequilibrium based on Shannon information entropy and show how they can be used\nto solve equifinality problems in the process of model selection by means of\nMaxEnt.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:02:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Metzler","Holger",""],["Sierra","Carlos A.",""]]}
{"id":"2308.10957","submitter":"Fulvio Gesmundo","authors":"Francesco Galuppi, Fulvio Gesmundo, Ettore Teixeira Turatti, Lorenzo\n  Venturello","title":"Characteristic polynomials and eigenvalues of tensors","comments":"25 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":"BCSim-2022-s04","categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We lay the geometric foundations for the study of the characteristic\npolynomial of tensors. For symmetric tensors of order $d \\geq 3$ and dimension\n$2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only\nfinitely many tensors share any given characteristic polynomial, unlike the\ncase of symmetric matrices and the case of non-symmetric tensors. We propose\nprecise conjectures for the dimension of the variety of tensors sharing the\nsame characteristic polynomial, in the symmetric and in the non-symmetric\nsetting.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:03:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Galuppi","Francesco",""],["Gesmundo","Fulvio",""],["Turatti","Ettore Teixeira",""],["Venturello","Lorenzo",""]]}
{"id":"2308.10958","submitter":"Francois Rheault","authors":"Etienne St-Onge, Kurt G Schilling, Francois Rheault","title":"BundleSeg: A versatile, reliable and reproducible approach to white\n  matter bundle segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This work presents BundleSeg, a reliable, reproducible, and fast method for\nextracting white matter pathways. The proposed method combines an iterative\nregistration procedure with a recently developed precise streamline search\nalgorithm that enables efficient segmentation of streamlines without the need\nfor tractogram clustering or simplifying assumptions. We show that BundleSeg\nachieves improved repeatability and reproducibility than state-of-the-art\nsegmentation methods, with significant speed improvements. The enhanced\nprecision and reduced variability in extracting white matter connections offer\na valuable tool for neuroinformatic studies, increasing the sensitivity and\nspecificity of tractography-based studies of white matter pathways.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:03:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["St-Onge","Etienne",""],["Schilling","Kurt G",""],["Rheault","Francois",""]]}
{"id":"2308.10959","submitter":"Sijin Wu","authors":"Sijin Wu, Dan Zhang, Teng Hu, Shikun Feng","title":"DocPrompt: Large-scale continue pretrain for zero-shot and few-shot\n  document question answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose Docprompt for document question answering tasks\nwith powerful zero-shot and few-shot performance. We proposed a novel weakly\nsupervised data generation method, a novel multl-stage training method and a\nnovel understanding model \\& generation model ensemble method. We achieved\nstate-of-the-art performance on 4 document question answering tasks. This\nmethod greatly improves the delivery efficiency and model performance of\ndocument question answering customer projects, reducing annotation costs and\nlabor costs. Our demo can be found at\nhttps://huggingface.co/spaces/PaddlePaddle/ERNIE-Layout.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:14:00 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 09:14:17 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wu","Sijin",""],["Zhang","Dan",""],["Hu","Teng",""],["Feng","Shikun",""]]}
{"id":"2308.10960","submitter":"Ronald Kriemann","authors":"Ronald Kriemann","title":"Hierarchical Lowrank Arithmetic with Binary Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With lowrank approximation the storage requirements for dense data are\nreduced down to linear complexity and with the addition of hierarchy this also\nworks for data without global lowrank properties. However, the lowrank factors\nitself are often still stored using double precision numbers. Newer approaches\nexploit the different IEEE754 floating point formats available nowadays in a\nmixed precision approach. However, these formats show a significant gap in\nstorage (and accuracy), e.g. between half, single and double precision. We\ntherefore look beyond these standard formats and use adaptive compression for\nstoring the lowrank and dense data and investigate how that affects the\narithmetic of such matrices.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:15:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kriemann","Ronald",""]]}
{"id":"2308.10961","submitter":"Conghao Zhou","authors":"Conghao Zhou, Jie Gao, Mushu Li, Xuemin Shen, Weihua Zhuang, Xu Li,\n  Weisen Shi","title":"AI-Assisted Slicing-Based Resource Management for Two-Tier Radio Access\n  Networks","comments":"Accepted by IEEE Transactions on Cognitive Communications and\n  Networking","journal-ref":null,"doi":"10.1109/TCCN.2023.3307929","report-no":null,"categories":"cs.NI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While network slicing has become a prevalent approach to service\ndifferentiation, radio access network (RAN) slicing remains challenging due to\nthe need of substantial adaptivity and flexibility to cope with the highly\ndynamic network environment in RANs. In this paper, we develop a slicing-based\nresource management framework for a two-tier RAN to support multiple services\nwith different quality of service (QoS) requirements. The developed framework\nfocuses on base station (BS) service coverage (SC) and interference management\nfor multiple slices, each of which corresponds to a service. New designs are\nintroduced in the spatial, temporal, and slice dimensions to cope with\nspatiotemporal variations in data traffic, balance adaptivity and overhead of\nresource management, and enhance flexibility in service differentiation. Based\non the proposed framework, an energy efficiency maximization problem is\nformulated, and an artificial intelligence (AI)-assisted approach is proposed\nto solve the problem. Specifically, a deep unsupervised learning-assisted\nalgorithm is proposed for searching the optimal SC of the BSs, and an\noptimization-based analytical solution is found for managing interference among\nBSs. Simulation results under different data traffic distributions demonstrate\nthat our proposed slicing-based resource management framework, empowered by the\nAI-assisted approach, outperforms the benchmark frameworks and achieves a\nclose-to-optimal performance in energy efficiency.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:15:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhou","Conghao",""],["Gao","Jie",""],["Li","Mushu",""],["Shen","Xuemin",""],["Zhuang","Weihua",""],["Li","Xu",""],["Shi","Weisen",""]]}
{"id":"2308.10962","submitter":"Adrian Boedtker Ghansah","authors":"Adrian B. Ghansah, Jeeseop Kim, Maegan Tucker, Aaron D. Ames","title":"Humanoid Robot Co-Design: Coupling Hardware Design with Gait Generation\n  via Hybrid Zero Dynamics","comments":"7 pages, 6 figures, accepted to CDC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Selecting robot design parameters can be challenging since these parameters\nare often coupled with the performance of the controller and, therefore, the\nresulting capabilities of the robot. This leads to a time-consuming and often\nexpensive process whereby one iterates between designing the robot and manually\nevaluating its capabilities. This is particularly challenging for bipedal\nrobots, where it can be difficult to evaluate the behavior of the system due to\nthe underlying nonlinear and hybrid dynamics. Thus, in an effort to streamline\nthe design process of bipedal robots, and maximize their performance, this\npaper presents a systematic framework for the co-design of humanoid robots and\ntheir associated walking gaits. To this end, we leverage the framework of\nhybrid zero dynamic (HZD) gait generation, which gives a formal approach to the\ngeneration of dynamic walking gaits. The key novelty of this paper is to\nconsider both virtual constraints associated with the actuators of the robot,\ncoupled with design virtual constraints that encode the associated parameters\nof the robot to be designed. These virtual constraints are combined in an HZD\noptimization problem which simultaneously determines the design parameters\nwhile finding a stable walking gait that minimizes a given cost function. The\nproposed approach is demonstrated through the design of a novel humanoid robot,\nADAM, wherein its thigh and shin are co-designed so as to yield energy\nefficient bipedal locomotion.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:15:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ghansah","Adrian B.",""],["Kim","Jeeseop",""],["Tucker","Maegan",""],["Ames","Aaron D.",""]]}
{"id":"2308.10963","submitter":"David Setton","authors":"David J. Setton, Gurtina Besla, Ekta Patel, Cameron Hummels, Yong\n  Zheng, Evan Schneider","title":"The Large Magellanic Cloud's $\\sim30$ Kiloparsec Bow Shock and its\n  Impact on the Circumgalactic Medium","comments":"Submitted to ApJ Letters, 5 figures and 1 table. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interaction between the supersonic motion of the Large Magellanic Cloud\n(LMC) and the Circumgalactic Medium (CGM) is expected to result in a bow shock\nthat leads the LMC's gaseous disk. In this letter, we use hydrodynamic\nsimulations of the LMC's recent infall to predict the extent of this shock and\nits effect on the Milky Way's (MW) CGM. The simulations clearly predict the\nexistence of an asymmetric shock with a present day stand-off radius of\n$\\sim6.7$ kpc and a transverse diameter of $\\sim30$ kpc. Over the past 500 Myr,\n$\\sim8\\%$ of the MW's CGM in the southern hemisphere should have interacted\nwith the shock front. This interaction may have had the effect of smoothing\nover inhomogeneities and increasing mixing in the MW CGM. We find observational\nevidence of the existence of the bow shock in recent $H\\alpha$ maps of the LMC,\nproviding a potential explanation for the envelope of ionized gas surrounding\nthe LMC. Furthermore, the interaction of the bow shock with the MW CGM may also\nexplain observations of ionized gas surrounding the Magellanic Stream. Using\nrecent orbital histories of MW satellites, we find that many satellites have\nlikely interacted with the LMC shock. Additionally, the dwarf galaxy Ret2 is\ncurrently sitting inside the shock, which may impact the interpretation of\nreported gamma ray excess in Ret2. This work highlights bow shocks associated\nwith infalling satellites are an under-explored, yet potentially very important\ndynamical mixing process in the circumgalactic and intracluster media.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:20:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Setton","David J.",""],["Besla","Gurtina",""],["Patel","Ekta",""],["Hummels","Cameron",""],["Zheng","Yong",""],["Schneider","Evan",""]]}
{"id":"2308.10964","submitter":"Jon M. Miller","authors":"J. M. Miller (Univ. of Michigan), B. Mockler (University of\n  California, Los Angeles, and Carnegie Observatories), E. Ramirez-Ruiz (Univ.\n  of California, Santa Cruz), P. A. Draghis (Univ. of Michigan), J. J. Drake\n  (Harvard-Smithsonian Center for Astrophysics), J. Raymond\n  (Harvard-Smithsonian Center for Astrophysics), M. T. Reynolds (Univ. of\n  Michigan, Ohio State University), X. Xiang (Univ. of Michigan), S.-B. Yun\n  (Univ. of Michigan), A. Zoghbi (Univ. of Maryland, NASA/GSFC)","title":"Evidence of a Massive Stellar Disruption in the X-ray Spectrum of\n  ASASSN-14li","comments":"Accepted for publication in ApJ Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proximity and duration of the tidal disruption event (TDE) ASASSN-14li\nled to the discovery of narrow, blue-shifted absorption lines in X-rays and UV.\nThe gas seen in X-ray absorption is consistent with bound material close to the\napocenter of elliptical orbital paths, or with a disk wind similar to those\nseen in Seyfert-1 active galactic nuclei. We present a new analysis of the\ndeepest high-resolution XMM-Newton and Chandra spectra of ASASSN-14li. Driven\nby the relative strengths of He-like and H-like charge states, the data require\n[N/C] > 2.4, in qualitative agreement with UV spectral results. Flows of the\nkind seen in the X-ray spectrum of ASASSN-14li were not clearly predicted in\nsimulations of TDEs; this left open the possibility that the observed\nabsorption might be tied to gas released in prior AGN activity. However, the\nabundance pattern revealed in this analysis points to a single star rather than\na standard AGN accretion flow comprised of myriad gas contributions. The\nsimplest explanation of the data is likely that a moderately massive star (M ~\n3 Msun) with significant CNO processing was disrupted. An alternative\nexplanation is that a lower mass star was disrupted that had previously been\nstripped of its envelope. We discuss the strengths and limitations of our\nanalysis and these interpretations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:23:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Miller","J. M.","","Univ. of Michigan"],["Mockler","B.","","University of\n  California, Los Angeles, and Carnegie Observatories"],["Ramirez-Ruiz","E.","","Univ.\n  of California, Santa Cruz"],["Draghis","P. A.","","Univ. of Michigan"],["Drake","J. J.","","Harvard-Smithsonian Center for Astrophysics"],["Raymond","J.","","Harvard-Smithsonian Center for Astrophysics"],["Reynolds","M. T.","","Univ. of\n  Michigan, Ohio State University"],["Xiang","X.","","Univ. of Michigan"],["Yun","S. -B.","","Univ. of Michigan"],["Zoghbi","A.","","Univ. of Maryland, NASA/GSFC"]]}
{"id":"2308.10965","submitter":"Paschal Amusuo","authors":"Paschal C. Amusuo (1), Ricardo Andr\\'es Calvo M\\'endez (2), Zhongwei\n  Xu (3), Aravind Machiry (1) and James C. Davis (1) ((1) Purdue University,\n  USA, (2) Universidad Nacional de Colombia, (3) Xi'an JiaoTong University)","title":"Systematically Detecting Packet Validation Vulnerabilities in Embedded\n  Network Stacks","comments":"12 pages, 3 figures, to be published in the 38th IEEE/ACM\n  International Conference on Automated Software Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Embedded Network Stacks (ENS) enable low-resource devices to communicate with\nthe outside world, facilitating the development of the Internet of Things and\nCyber-Physical Systems. Some defects in ENS are thus high-severity\ncybersecurity vulnerabilities: they are remotely triggerable and can impact the\nphysical world. While prior research has shed light on the characteristics of\ndefects in many classes of software systems, no study has described the\nproperties of ENS defects nor identified a systematic technique to expose them.\nThe most common automated approach to detecting ENS defects is feedback-driven\nrandomized dynamic analysis (\"fuzzing\"), a costly and unpredictable technique.\n  This paper provides the first systematic characterization of cybersecurity\nvulnerabilities in ENS. We analyzed 61 vulnerabilities across 6 open-source\nENS. Most of these ENS defects are concentrated in the transport and network\nlayers of the network stack, require reaching different states in the network\nprotocol, and can be triggered by only 1-2 modifications to a single packet. We\ntherefore propose a novel systematic testing framework that focuses on the\ntransport and network layers, uses seeds that cover a network protocol's\nstates, and systematically modifies packet fields. We evaluated this framework\non 4 ENS and replicated 12 of the 14 reported IP/TCP/UDP vulnerabilities. On\nrecent versions of these ENSs, it discovered 7 novel defects (6 assigned CVES)\nduring a bounded systematic test that covered all protocol states and made up\nto 3 modifications per packet. We found defects in 3 of the 4 ENS we tested\nthat had not been found by prior fuzzing research. Our results suggest that\nfuzzing should be deferred until after systematic testing is employed.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:23:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Amusuo","Paschal C.",""],["M\u00e9ndez","Ricardo Andr\u00e9s Calvo",""],["Xu","Zhongwei",""],["Machiry","Aravind",""],["Davis","James C.",""]]}
{"id":"2308.10966","submitter":"Rohan Chandra","authors":"Rohan Chandra, Vrushabh Zinage, Efstathios Bakolas, Joydeep Biswas,\n  Peter Stone","title":"Decentralized Multi-Robot Social Navigation in Constrained Environments\n  via Game-Theoretic Control Barrier Functions","comments":"arXiv admin note: text overlap with arXiv:2306.08815","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.GT cs.MA cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an approach to ensure safe and deadlock-free navigation for\ndecentralized multi-robot systems operating in constrained environments,\nincluding doorways and intersections. Although many solutions have been\nproposed to ensure safety, preventing deadlocks in a decentralized fashion with\nglobal consensus remains an open problem. We first formalize the objective as a\nnon-cooperative, non-communicative, partially observable multi-robot navigation\nproblem in constrained spaces with multiple conflicting agents, which we term\nas \\emph{social mini-games}. Our approach to ensuring liveness rests on two\nnovel insights: $(i)$ there exists a mixed-strategy Nash equilibrium that\nallows decentralized robots to perturb their state onto \\textit{liveness sets}\ni.e. states where robots are deadlock-free and $(ii)$ forward invariance of\nliveness sets can be achieved identical to how control barrier functions (CBFs)\nguarantee forward invariance of safety sets. We evaluate our approach in\nsimulation as well on physical robots using F$1/10$ robots, a Clearpath Jackal,\nas well as a Boston Dynamics Spot in a doorway and corridor intersection\nscenario. Compared to both fully decentralized and centralized approaches with\nand without deadlock resolution capabilities, we demonstrate that our approach\nresults in safer, more efficient, and smoother navigation, based on a\ncomprehensive set of metrics including success rate, collision rate, stop time,\nchange in velocity, path deviation, time-to-goal, and flow rate.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:23:53 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 07:36:59 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 03:01:59 GMT"},{"version":"v4","created":"Thu, 31 Aug 2023 04:23:52 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chandra","Rohan",""],["Zinage","Vrushabh",""],["Bakolas","Efstathios",""],["Biswas","Joydeep",""],["Stone","Peter",""]]}
{"id":"2308.10967","submitter":"Ladina Hausmann","authors":"Ladina Hausmann, Alexander Schmidhuber, Esteban Castro-Ruiz","title":"Measurement events relative to temporal quantum reference frames","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Page-Wootters formalism is a proposal for reconciling the\nbackground-dependent, quantum-mechanical notion of time with the background\nindependence of general relativity. However, there has been much discussion\nregarding the physical meaning of the framework. In this work, we compare two\nconsistent approaches to the Page-Wootters formalism to clarify the operational\nmeaning of evolution and measurements with respect to a quantum temporal\nreference frame. The so-called \"twirled observable\" approach implements\nmeasurements as operators that are invariant with respect to the Hamiltonian\nconstraint. The \"purified measurement\" approach instead models measurements\ndynamically by modifying the constraint itself. While both approaches agree in\nthe limit of ideal clocks, a natural generalization of the purified measurement\napproach to the case of non-ideal, finite-resource clocks yields a radically\ndifferent picture. We discuss the physical origin of this discrepancy and argue\nthat they describe operationally distinct situations. Moreover, we show that,\nfor non-ideal clocks, the purified measurement approach yields time non-local,\nnon-unitary evolution and implies a fundamental limitation to the operational\ndefinition of the temporal order of events. Nevertheless, unitarity and\ndefinite temporal order can be restored if we assume that time is discrete.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:26:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hausmann","Ladina",""],["Schmidhuber","Alexander",""],["Castro-Ruiz","Esteban",""]]}
{"id":"2308.10968","submitter":"Guoyao Shen","authors":"Guoyao Shen, Yancheng Zhu, Hernan Jara, Sean B. Andersson, Chad W.\n  Farris, Stephan Anderson, Xin Zhang","title":"MRI Field-transfer Reconstruction with Limited Data: Regularization by\n  Neural Style Transfer","comments":"30 pages, 8 figures, 2 tables, 1 algorithm chart","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent works have demonstrated success in MRI reconstruction using deep\nlearning-based models. However, most reported approaches require training on a\ntask-specific, large-scale dataset. Regularization by denoising (RED) is a\ngeneral pipeline which embeds a denoiser as a prior for image reconstruction.\nThe potential of RED has been demonstrated for multiple image-related tasks\nsuch as denoising, deblurring and super-resolution. In this work, we propose a\nregularization by neural style transfer (RNST) method to further leverage the\npriors from the neural transfer and denoising engine. This enables RNST to\nreconstruct a high-quality image from a noisy low-quality image with different\nimage styles and limited data. We validate RNST with clinical MRI scans from\n1.5T and 3T and show that RNST can significantly boost image quality. Our\nresults highlight the capability of the RNST framework for MRI reconstruction\nand the potential for reconstruction tasks with limited data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:26:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shen","Guoyao",""],["Zhu","Yancheng",""],["Jara","Hernan",""],["Andersson","Sean B.",""],["Farris","Chad W.",""],["Anderson","Stephan",""],["Zhang","Xin",""]]}
{"id":"2308.10969","submitter":"Chuqiao Lin Mr","authors":"Chuqiao Lin, Vir B. Bulchandani, Shivaji L. Sondhi","title":"Quantum tasks assisted by quantum noise","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a notion of expected utility for quantum tasks and discuss some\ngeneral conditions under which this is increased by the presence of quantum\nnoise in the underlying resource states. We apply the resulting formalism to\nthe specific problem of playing the parity game with ground states of the\nrandom transverse-field Ising model. This demonstrates a separation in the\nground-state phase diagram between regions where rational players will be\n``risk-seeking'' or ``risk-averse'', depending on whether they win the game\nmore or less often in the presence of disorder. The boundary between these\nregions depends non-universally on the correlation length of the disorder.\nStrikingly, we find that adding zero-mean, uncorrelated disorder to the\ntransverse fields can generate a weak quantum advantage that would not exist in\nthe absence of noise.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:29:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lin","Chuqiao",""],["Bulchandani","Vir B.",""],["Sondhi","Shivaji L.",""]]}
{"id":"2308.10970","submitter":"Panagiotis Promponas","authors":"Panagiotis Promponas, Tingjun Chen, Leandros Tassiulas","title":"Optimizing Sectorized Wireless Networks: Model, Analysis, and Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Future wireless networks need to support the increasing demands for high data\nrates and improved coverage. One promising solution is sectorization, where an\ninfrastructure node (e.g., a base station) is equipped with multiple sectors\nemploying directional communication. Although the concept of sectorization is\nnot new, it is critical to fully understand the potential of sectorized\nnetworks, such as the rate gain achieved when multiple sectors can be\nsimultaneously activated. In this paper, we focus on sectorized wireless\nnetworks, where sectorized infrastructure nodes with beam-steering capabilities\nform a multi-hop mesh network for data forwarding and routing. We present a\nsectorized node model and characterize the capacity region of these sectorized\nnetworks. We define the flow extension ratio and the corresponding\nsectorization gain, which quantitatively measure the performance gain\nintroduced by node sectorization as a function of the network flow. Our\nobjective is to find the optimal sectorization of each node that achieves the\nmaximum flow extension ratio, and thus the sectorization gain. Towards this\ngoal, we formulate the corresponding optimization problem and develop an\nefficient distributed algorithm that obtains the node sectorization under a\ngiven network flow with an approximation ratio of 2/3. Through extensive\nsimulations, we evaluate the sectorization gain and the performance of the\nproposed algorithm in various network scenarios with varying network flows. The\nsimulation results show that the approximate sectorization gain increases\nsublinearly as a function of the number of sectors per node.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:32:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Promponas","Panagiotis",""],["Chen","Tingjun",""],["Tassiulas","Leandros",""]]}
{"id":"2308.10971","submitter":"Frank L\\\"ubeck","authors":"Frank L\\\"ubeck","title":"Greatest common divisors of values of integer polynomials and an\n  application to maximal tori","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe how to compute for two polynomials $f(X), g(X) \\in \\mathbb{Z}[X]$\nwith integer coefficients the greatest common divisors of $f(z)$ and $g(z)$ for\nall integers $z \\in \\mathbb{Z}$. As an application we determine the structures\n(elementary divisors) of all maximal tori in exceptional groups of Lie type.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:32:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["L\u00fcbeck","Frank",""]]}
{"id":"2308.10972","submitter":"Christopher Corbally","authors":"Richard O. Gray, Christopher J. Corbally, Michael M. Briley, Adam\n  McKay, Forrest Sims, David Boyd, Christophe Boussin, Courtney E. McGahee,\n  Robert Buchheim, Gary Walker, David Iadevaia, David Cejudo Fernandez, Damien\n  Lemay, Jack Martin, Jim Grubb, Albert Stiewing, Joseph Daglen, Keith Shank,\n  Sydney Andrews, Nick Barnhardt, Rebekah Clark, Hunter Corman, Sabina Gomes,\n  Agastya Jonnalagadda, Theo McDaries, Ava Mills, Will Newsom, Andrew Slate and\n  Michael Watts","title":"TU Tau B: The Peculiar 'Eclipse' of a possible proto-Barium Giant","comments":"9 pages, 9 figures, 4 tables, a number of amateur observatories made\n  significant contributions to this research. Paper accepted for publication in\n  The Astronomical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  TU Tau (= HD 38218 = HIP 27135) is a binary system consisting of a C-N carbon\nstar primary and an A-type secondary. We report on new photometry and\nspectroscopy which tracked the recent disappearance of the A-star secondary.\nThe dimming of the A-star was gradual and irregular, with one or more brief\nbrightenings, implying the presence of nonhomogeneities in the carbon star\noutflow. We also present evidence that the A-star is actively accreting\ns-process enriched material from the carbon star and suggest that it will\ntherefore eventually evolve into a Barium giant. This is an important system as\nwell because the A-type star can serve as a probe of the outer atmosphere of\nthe carbon star.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:37:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gray","Richard O.",""],["Corbally","Christopher J.",""],["Briley","Michael M.",""],["McKay","Adam",""],["Sims","Forrest",""],["Boyd","David",""],["Boussin","Christophe",""],["McGahee","Courtney E.",""],["Buchheim","Robert",""],["Walker","Gary",""],["Iadevaia","David",""],["Fernandez","David Cejudo",""],["Lemay","Damien",""],["Martin","Jack",""],["Grubb","Jim",""],["Stiewing","Albert",""],["Daglen","Joseph",""],["Shank","Keith",""],["Andrews","Sydney",""],["Barnhardt","Nick",""],["Clark","Rebekah",""],["Corman","Hunter",""],["Gomes","Sabina",""],["Jonnalagadda","Agastya",""],["McDaries","Theo",""],["Mills","Ava",""],["Newsom","Will",""],["Slate","Andrew",""],["Watts","Michael",""]]}
{"id":"2308.10973","submitter":"Jarrod Haas","authors":"Jarrod Haas","title":"SupEuclid: Extremely Simple, High Quality OoD Detection with Supervised\n  Contrastive Learning and Euclidean Distance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Out-of-Distribution (OoD) detection has developed substantially in the past\nfew years, with available methods approaching, and in a few cases achieving,\nperfect data separation on standard benchmarks. These results generally involve\nlarge or complex models, pretraining, exposure to OoD examples or extra\nhyperparameter tuning. Remarkably, it is possible to achieve results that can\nexceed many of these state-of-the-art methods with a very simple method. We\ndemonstrate that ResNet18 trained with Supervised Contrastive Learning (SCL)\nproduces state-of-the-art results out-of-the-box on near and far OoD detection\nbenchmarks using only Euclidean distance as a scoring rule. This may obviate\nthe need in some cases for more sophisticated methods or larger models, and at\nthe very least provides a very strong, easy to use baseline for further\nexperimentation and analysis.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:41:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Haas","Jarrod",""]]}
{"id":"2308.10974","submitter":"Chuan Xiao","authors":"Xu Han, Zengqing Wu, Chuan Xiao","title":"\"Guinea Pig Trials\" Utilizing GPT: A Novel Smart Agent-Based Modeling\n  Approach for Studying Firm Competition and Collusion","comments":"To appear at Conference on Information Systems and Technology (CIST)\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CE cs.MA econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Firm competition and collusion involve complex dynamics, particularly when\nconsidering communication among firms. Such issues can be modeled as problems\nof complex systems, traditionally approached through experiments involving\nhuman subjects or agent-based modeling methods. We propose an innovative\nframework called Smart Agent-Based Modeling (SABM), wherein smart agents,\nsupported by GPT-4 technologies, represent firms, and interact with one\nanother. We conducted a controlled experiment to study firm price competition\nand collusion behaviors under various conditions. SABM is more cost-effective\nand flexible compared to conducting experiments with human subjects. Smart\nagents possess an extensive knowledge base for decision-making and exhibit\nhuman-like strategic abilities, surpassing traditional ABM agents. Furthermore,\nsmart agents can simulate human conversation and be personalized, making them\nideal for studying complex situations involving communication. Our results\ndemonstrate that, in the absence of communication, smart agents consistently\nreach tacit collusion, leading to prices converging at levels higher than the\nBertrand equilibrium price but lower than monopoly or cartel prices. When\ncommunication is allowed, smart agents achieve a higher-level collusion with\nprices close to cartel prices. Collusion forms more quickly with communication,\nwhile price convergence is smoother without it. These results indicate that\ncommunication enhances trust between firms, encouraging frequent small price\ndeviations to explore opportunities for a higher-level win-win situation and\nreducing the likelihood of triggering a price war. We also assigned different\npersonas to firms to analyze behavioral differences and tested variant models\nunder diverse market structures. The findings showcase the effectiveness and\nrobustness of SABM and provide intriguing insights into competition and\ncollusion.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:42:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Han","Xu",""],["Wu","Zengqing",""],["Xiao","Chuan",""]]}
{"id":"2308.10975","submitter":"Sudipta Mondal","authors":"Sudipta Mondal, Pritam Halder, Aditi Sen De","title":"Duality between imperfect resources and measurements for propagating\n  entanglement in networks","comments":"13 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a measurement-based entanglement propagation strategy for networks\nin which all nodes except two are initially occupied by a suitably chosen\nsingle-qubit system and the two nodes share a bipartite noisy entangled state.\nThe connections between the sites are established using unsharp two-qubit\nmeasurements. When only a single node performs measurements, we refer to it as\na unidirectional protocol while when both parts of the initial entangled states\nperform measurements, we call it a bidirectional scheme. When the measurement\noutcome is post-selected, we demonstrate that in the presence of a local\namplitude damping channel acting on a single site, entanglement shareability,\nas measured by the monogamy score, of the resulting state after measurement can\nbe higher for all values of the strength of the noise than that of the scenario\nwithout noise. We observe that irrespective of the channel, there exists a\nrange of unsharpness parameter where a higher monogamy score may be obtained\nstarting from the initial nonmaximally entangled states than from the initial\nmaximally entangled state. We report that the effect of noise on the average\nmonogamy score entered from the resource state may be reduced faster with the\nunidirectional protocol than with the bidirectional one.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:44:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mondal","Sudipta",""],["Halder","Pritam",""],["De","Aditi Sen",""]]}
{"id":"2308.10976","submitter":"Gabriel Andreas Dill","authors":"Francesco Campagna and Gabriel A. Dill","title":"Algebraic relations over finite fields that preserve the endomorphism\n  rings of CM $j$-invariants","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We characterise the integral affine plane curves over a finite field $k$ with\nthe property that all but finitely many of their $\\overline{k}$-points have\ncoordinates that are $j$-invariants of elliptic curves with isomorphic\nendomorphism rings. This settles a finite field variant of the Andr\\'e-Oort\nconjecture for $Y(1)^2_\\mathbb{C}$, which is a theorem of Andr\\'e. We use our\nresult to solve the modular support problem for function fields of positive\ncharacteristic.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:45:28 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Campagna","Francesco",""],["Dill","Gabriel A.",""]]}
{"id":"2308.10977","submitter":"Eric Rowland","authors":"Eric Rowland, Manon Stipulanti, Reem Yassawi","title":"Algebraic power series and their automatic complexity I: finite fields","comments":"29 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT cs.FL cs.SC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Christol's theorem states that a power series with coefficients in a finite\nfield is algebraic if and only if its coefficient sequence is automatic. A\nnatural question is how the size of a polynomial describing such a sequence\nrelates to the size of an automaton describing the same sequence. Bridy used\ntools from algebraic geometry to bound the size of the minimal automaton for a\nsequence, given its minimal polynomial. We produce a new proof of Bridy's bound\nby embedding algebraic sequences as diagonals of rational functions. Crucially\nfor our interests, our approach can be adapted to work not just over a finite\nfield but over the integers modulo $p^\\alpha$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:48:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rowland","Eric",""],["Stipulanti","Manon",""],["Yassawi","Reem",""]]}
{"id":"2308.10978","submitter":"Heather Blake","authors":"Zhanar Berikkyzy, Beth Bjorkman, Heather Smith Blake, Sogol\n  Jahanbekam, Lauren Keough, Kevin Moss, Danny Rorabaugh, and Songling Shan","title":"Triangle-degree and triangle-distinct graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of\n$v$ in $G$ is the number of triangles that contain $v$. While every graph has\nat least two vertices with the same degree, there are graphs in which every\nvertex has a distinct triangle-degree. In this paper, we construct an infinite\nfamily of graphs with this property. We also study the vertex degrees and size\nof graphs with this property.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:54:17 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:54:39 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Berikkyzy","Zhanar",""],["Bjorkman","Beth",""],["Blake","Heather Smith",""],["Jahanbekam","Sogol",""],["Keough","Lauren",""],["Moss","Kevin",""],["Rorabaugh","Danny",""],["Shan","Songling",""]]}
{"id":"2308.10979","submitter":"Tony Feng","authors":"Tony Feng, Zhiwei Yun, Wei Zhang","title":"Modularity of higher theta series I: cohomology of the generic fiber","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In a previous paper we constructed $\\textit{higher}$ theta series for unitary\ngroups over function fields, and conjectured their modularity properties. Here\nwe prove the generic modularity of the $\\ell$-adic realization of higher theta\nseries in cohomology. The proof debuts a new type of Fourier transform,\noccurring on the Borel-Moore homology of moduli spaces for shtuka-type objects,\nthat we call the $\\textit{arithmetic Fourier transform}$. Another novelty in\nthe argument is a $\\textit{sheaf-cycle correspondence}$ extending the classical\nsheaf-function correspondence, which facilitates the deployment of\nsheaf-theoretic methods to analyze algebraic cycles. Although the modularity\nproperty is a statement within classical algebraic geometry, the proof relies\non derived algebraic geometry, especially a nascent theory of $\\textit{derived\nFourier analysis}$ on derived vector bundles, which we develop.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:54:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Feng","Tony",""],["Yun","Zhiwei",""],["Zhang","Wei",""]]}
{"id":"2308.10980","submitter":"Evan Kirby","authors":"Evan N. Kirby (1), Alexander P. Ji (2), Mikhail Kovalev (3) ((1)\n  University of Notre Dame, (2) University of Chicago, (3) Yunnan\n  Observatories)","title":"r-process Abundance Patterns in the Globular Cluster M92","comments":"35 pages, 12 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Whereas light element abundance variations are a hallmark of globular\nclusters, there is little evidence for variation in neutron-capture elements. A\nsignificant exception is M15, which shows a star-to-star dispersion in\nneutron-capture abundances of at least one order of magnitude. The literature\ncontains evidence both for and against a neutron-capture dispersion in M92. We\nconducted an analysis of archival Keck/HIRES spectra of 35 stars in M92, 29 of\nwhich are giants, which we use exclusively for our conclusions. M92 conforms to\nthe light element abundance variations typical of massive clusters. Like other\nglobular clusters, its neutron-capture abundances were generated by the\nr-process. We confirm a star-to-star dispersion in the r-process. Unlike M15,\nthe dispersion is limited to \"first-generation\" (low Na, high Mg) stars, and\nthe dispersion is smaller for Sr, Y, and Zr than for Ba and the lanthanides.\nThis is the first detection of a relation between light element and\nneutron-capture abundances in a globular cluster. We propose that a source of\nthe main r-process polluted the cluster shortly before or concurrently with the\nfirst generation of star formation. The heavier r-process abundances were\ninhomogeneously distributed while the first-generation stars were forming. The\nsecond-generation stars formed after several crossing times (~0.8 Myr); hence,\nthe second generation shows no r-process dispersion. This scenario imposes a\nminimum temporal separation of 0.8 Myr between the first and second\ngenerations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:55:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kirby","Evan N.",""],["Ji","Alexander P.",""],["Kovalev","Mikhail",""]]}
{"id":"2308.10981","submitter":"Sania Asif","authors":"Sania Asif and Yao Wang","title":"BiHom-(pre-)Poisson conformal algebra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this study is to introduce the notion of BiHom-Poisson conformal\nalgebra, BiHom-pre-Poisson conformal algebra, and their related structures. We\nshow that we can construct many new BiHom-Poisson conformal algebras for a\ngiven BiHom-Poisson conformal algebra. Moreover, the tensor product of two\nBiHom-Poisson conformal algebras is also a BiHom-Poisson conformal algebra. We\nfurther describe the conformal bimodule and representation theory of\nBiHom-Poisson conformal algebra. In addition, we define BiHom-pre-Poisson\nconformal algebra as the combination of BiHom-preLie conformal algebra and\nBiHom-dendriform conformal algebra under some compatibility conditions. We also\ndemonstrate that how to construct BiHom-Poisson conformal algebra from\nBiHom-pre-Poisson conformal algebra and provide the representation theory for\nBiHom-pre-Poisson conformal algebra. Finally, a detailed description of\n$\\mathcal{O}$-operators and Rota-Baxter operators on BiHom-Poisson conformal\nalgebra is provided.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:55:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Asif","Sania",""],["Wang","Yao",""]]}
{"id":"2308.10982","submitter":"Lakshmi Pradeep Chitta","authors":"L. P. Chitta, S. K. Solanki, J. C. del Toro Iniesta, J. Woch, D.\n  Calchetti, A. Gandorfer, J. Hirzberger, F. Kahil, G. Valori, D. Orozco\n  Su\\'arez, H. Strecker, T. Appourchaux, R. Volkmer, H. Peter, S. Mandal, R.\n  Aznar Cuadrado, L. Teriaca, U. Sch\\\"uhle, D. Berghmans, C. Verbeeck, A. N.\n  Zhukov, E. R. Priest","title":"Fleeting small-scale surface magnetic fields build the quiet-Sun corona","comments":"Accepted for publication in The Astrophysical Journal Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Arch-like loop structures filled with million Kelvin hot plasma form the\nbuilding blocks of the quiet-Sun corona. Both high-resolution observations and\nmagnetoconvection simulations show the ubiquitous presence of magnetic fields\non the solar surface on small spatial scales of $\\sim$100\\,km. However, the\nquestion of how exactly these quiet-Sun coronal loops originate from the\nphotosphere and how the magnetic energy from the surface is channeled to heat\nthe overlying atmosphere is a long-standing puzzle. Here we report\nhigh-resolution photospheric magnetic field and coronal data acquired during\nthe second science perihelion of Solar Orbiter that reveal a highly dynamic\nmagnetic landscape underlying the observed quiet-Sun corona. We found that\ncoronal loops often connect to surface regions that harbor fleeting weaker,\nmixed-polarity magnetic field patches structured on small spatial scales, and\nthat coronal disturbances could emerge from these areas. We suggest that weaker\nmagnetic fields with fluxes as low as $10^{15}$\\,Mx and or those that evolve on\ntimescales less than 5\\,minutes, are crucial to understand the coronal\nstructuring and dynamics.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:57:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chitta","L. P.",""],["Solanki","S. K.",""],["Iniesta","J. C. del Toro",""],["Woch","J.",""],["Calchetti","D.",""],["Gandorfer","A.",""],["Hirzberger","J.",""],["Kahil","F.",""],["Valori","G.",""],["Su\u00e1rez","D. Orozco",""],["Strecker","H.",""],["Appourchaux","T.",""],["Volkmer","R.",""],["Peter","H.",""],["Mandal","S.",""],["Cuadrado","R. Aznar",""],["Teriaca","L.",""],["Sch\u00fchle","U.",""],["Berghmans","D.",""],["Verbeeck","C.",""],["Zhukov","A. N.",""],["Priest","E. R.",""]]}
{"id":"2308.10983","submitter":"Jo\\~ao Manuel da Silva Santos","authors":"J. M. da Silva Santos, K. Reardon, G. Cauzzi, T. Schad, V. Martinez\n  Pillet, A. Tritschler, F. W\\\"oger, R. Hofmann, J. Stauffer, and H. Uitenbroek","title":"Magnetic fields in solar plage regions: insights from high-sensitivity\n  spectropolarimetry","comments":"17 pages, 8 figures, accepted for publication in ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Plage regions are patches of concentrated magnetic field in the Sun's\natmosphere where hot coronal loops are rooted. While previous studies have shed\nlight on the properties of plage magnetic fields in the photosphere, there are\nstill challenges in measuring the overlying chromospheric magnetic fields,\nwhich are crucial to understanding the overall heating and dynamics. Here, we\nutilize high-sensitivity, spectropolarimetric data obtained by the four-meter\nDaniel K. Inouye Solar Telescope (DKIST) to investigate the dynamic environment\nand magnetic field stratification of an extended, decaying plage region. The\ndata show strong circular polarization signals in both plage cores and\nsurrounding fibrils. Notably, weak linear polarization signals clearly\ndifferentiate between plage patches and the fibril canopy, where they are\nrelatively stronger. Inversions of the Ca II 8542 $\\mathring{A}$ spectra show\nan imprint of the fibrils in the chromospheric magnetic field, with typical\nfield strength values ranging from $\\sim$ 200-300 G in fibrils. We confirm the\nweak correlation between field strength and cooling rates in the lower\nchromosphere. Additionally, we observe supersonic downflows and strong velocity\ngradients in the plage periphery, indicating dynamical processes occurring in\nthe chromosphere. These findings contribute to our understanding of the\nmagnetic field and dynamics within plages, emphasizing the need for further\nresearch to explore the expansion of magnetic fields with height and the\nthree-dimensional distribution of heating rates in the lower chromosphere.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:01:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Santos","J. M. da Silva",""],["Reardon","K.",""],["Cauzzi","G.",""],["Schad","T.",""],["Pillet","V. Martinez",""],["Tritschler","A.",""],["W\u00f6ger","F.",""],["Hofmann","R.",""],["Stauffer","J.",""],["Uitenbroek","H.",""]]}
{"id":"2308.10984","submitter":"Amar Kumar","authors":"Amar Kumar, Nima Fathi, Raghav Mehta, Brennan Nichyporuk, Jean-Pierre\n  R. Falet, Sotirios Tsaftaris, Tal Arbel","title":"Debiasing Counterfactuals In the Presence of Spurious Correlations","comments":"Accepted to the FAIMI (Fairness of AI in Medical Imaging) workshop at\n  MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning models can perform well in complex medical imaging\nclassification tasks, even when basing their conclusions on spurious\ncorrelations (i.e. confounders), should they be prevalent in the training\ndataset, rather than on the causal image markers of interest. This would\nthereby limit their ability to generalize across the population. Explainability\nbased on counterfactual image generation can be used to expose the confounders\nbut does not provide a strategy to mitigate the bias. In this work, we\nintroduce the first end-to-end training framework that integrates both (i)\npopular debiasing classifiers (e.g. distributionally robust optimization (DRO))\nto avoid latching onto the spurious correlations and (ii) counterfactual image\ngeneration to unveil generalizable imaging markers of relevance to the task.\nAdditionally, we propose a novel metric, Spurious Correlation Latching Score\n(SCLS), to quantify the extent of the classifier reliance on the spurious\ncorrelation as exposed by the counterfactual images. Through comprehensive\nexperiments on two public datasets (with the simulated and real visual\nartifacts), we demonstrate that the debiasing method: (i) learns generalizable\nmarkers across the population, and (ii) successfully ignores spurious\ncorrelations and focuses on the underlying disease pathology.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:01:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kumar","Amar",""],["Fathi","Nima",""],["Mehta","Raghav",""],["Nichyporuk","Brennan",""],["Falet","Jean-Pierre R.",""],["Tsaftaris","Sotirios",""],["Arbel","Tal",""]]}
{"id":"2308.10985","submitter":"Nidal Chamoun","authors":"N. Chamoun (HIAST) and E. I. Lashin (Ain Shams Univ. & CFP-Zewail\n  city)","title":"Textures of Neutrino Mass Matrix from $S_4$-flavor Symmetry","comments":"40 pages, pdflatex, 6 tables and 12 figures. arXiv admin note: text\n  overlap with arXiv:2208.10344","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a texture of neutrino mass matrix characterized by two constraints\nconsisting of one equality and another antiequality between two elements\ncorresponding to two pairs of the matrix entries. Amidst such textures, we\nlimit our study to three patterns which were realizable assuming an\n$S_4$-symmetry within type II-seesaw scenario. Three such cases were found and\nstudied: I ($M_{\\nu 22}=-M_{\\nu 33}$ \\& $M_{\\nu 11}=+M_{\\nu 23}$), II ($M_{\\nu\n11}=-M_{\\nu 33}$ \\& $M_{\\nu 22}=+M_{\\nu 13}$) and III ($M_{\\nu 11}=-M_{\\nu 22}$\n\\& $M_{\\nu 33}=+M_{\\nu 12}$). We specify the role of non-physical phases in the\ndefinition of the textures under study which were tested against experimental\nconstraints, and were found to accommodate data with both hierarchies allowed.\nHowever, switching off the non-physical phases allows only for inverted\nhierarchy, except for the texture III which allows also, albeit for a very\nnarrow parameter space region, for normal ordering. We present a complete\nphenomenological analysis of these three textures and justify analytically the\nresulting correlations. We detail the effect of the non-physical phases is\ndiluting/deforming several correlations, which otherwise would have been\n``clear\". Finally, we give theoretical realizations within seesaw type II\nscenarios for such textures.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:10:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chamoun","N.","","HIAST"],["Lashin","E. I.","","Ain Shams Univ. & CFP-Zewail\n  city"]]}
{"id":"2308.10986","submitter":"Sabir M. Gusein-Zade","authors":"Sabir M. Gusein-Zade, Ignacio Luengo, Alejandro Melle-Hern\\'andez","title":"Grothendieck ring of pairs of quasi-projective varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define a Grothendieck ring of pairs of complex quasi-projective varieties\n(that is a variety and a subvariety). We describe $\\lambda$-structures and a\npower structure on/over this ring. We show that the conjectual symmetric power\nof the projective line with several orbifold points described by A.Fonarev is\nconsistent with the symmetric power of this line with points as a pair of\nvarieties.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:12:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gusein-Zade","Sabir M.",""],["Luengo","Ignacio",""],["Melle-Hern\u00e1ndez","Alejandro",""]]}
{"id":"2308.10987","submitter":"Ori Saporta-Katz","authors":"Ori Saporta-Katz, Nadav Mantel, Rotem Liran, Vered Rom-Kedar, Hezi\n  Gildor","title":"Northbound Lagrangian Pathways of the Mediterranean Outflow Water and\n  the Mechanism of Time-Dependent Chaotic Advection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph nlin.CD physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Mediterranean Sea releases approximately 1Sv of water into the North\nAtlantic through the Gibraltar Straits, forming the saline Mediterranean\nOutflow Water (MOW). Its impact on large-scale flow and specifically its\nnorthbound Lagrangian pathways are widely debated, yet a comprehensive overview\nof MOW pathways over recent decades is lacking. We calculate and analyze\nsynthetic Lagrangian trajectories in 1980-2020 reanalysis velocity data. 16\\%\nof the MOW follow a direct northbound path to the sub-polar gyre, reaching a\n1000m depth crossing window at the southern tip of Rockall Ridge in about 10\nyears. Surprisingly, time-dependent chaotic advection, not steady currents,\ndrives over half of the northbound transport. Our results suggest a potential\n15-20yr predictability in the direct northbound transport, which points to an\nupcoming decrease of MOW northbound transport in the next couple of decades.\nAdditionally, monthly variability appears more significant than inter-annual\nvariability in mixing and spreading the MOW.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 10:00:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Saporta-Katz","Ori",""],["Mantel","Nadav",""],["Liran","Rotem",""],["Rom-Kedar","Vered",""],["Gildor","Hezi",""]]}
{"id":"2308.10988","submitter":"Adel Ammar","authors":"Adel Ammar","title":"ERA*: Enhanced Relaxed A* algorithm for Solving the Shortest Path\n  Problem in Regular Grid Maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper introduces a novel algorithm for solving the point-to-point\nshortest path problem in a static regular 8-neighbor connectivity (G8) grid.\nThis algorithm can be seen as a generalization of Hadlock algorithm to G8\ngrids, and is shown to be theoretically equivalent to the relaxed $A^*$\n($RA^*$) algorithm in terms of the provided solution's path length, but with\nsubstantial time and memory savings, due to a completely different computation\nstrategy, based on defining a set of lookup matrices. Through an experimental\nstudy on grid maps of various types and sizes (1290 runs on 43 maps), it is\nproven to be 2.25 times faster than $RA^*$ and 17 times faster than the\noriginal $A^*$, in average. Moreover, it is more memory-efficient, since it\ndoes not need to store a G score matrix.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:25:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ammar","Adel",""]]}
{"id":"2308.10989","submitter":"John Daniel","authors":"John Daniel, Zheng Sun, Xuejian Zhang, Yuanqiu Tan, Neil Dilley,\n  Zhihong Chen, Joerg Appenzeller","title":"Experimental demonstration of an integrated on-chip p-bit core utilizing\n  stochastic Magnetic Tunnel Junctions and 2D-MoS$_{2}$ FETs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cs.ET","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Probabilistic computing is a novel computing scheme that offers a more\nefficient approach than conventional CMOS-based logic in a variety of\napplications ranging from optimization to Bayesian inference, and invertible\nBoolean logic. The probabilistic-bit (or p-bit, the base unit of probabilistic\ncomputing) is a naturally fluctuating entity that requires tunable\nstochasticity; by coupling low-barrier stochastic Magnetic Tunnel Junctions\n(MTJs) with a transistor circuit, a compact implementation is achieved. In this\nwork, through integrating stochastic MTJs with 2D-MoS$_{2}$ FETs, the first\non-chip realization of a key p-bit building block displaying\nvoltage-controllable stochasticity is demonstrated. In addition, supported by\ncircuit simulations, this work provides a careful analysis of the three\ntransistor-one magnetic tunnel junction (3T-1MTJ) p-bit design, evaluating how\nthe characteristics of each component influence the overall p-bit output. This\nunderstanding of the interplay between the characteristics of the transistors\nand the MTJ is vital for the construction of a fully functioning p-bit, making\nthe design rules presented in this article key for future experimental\nimplementations of scaled on-chip p-bit networks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:16:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Daniel","John",""],["Sun","Zheng",""],["Zhang","Xuejian",""],["Tan","Yuanqiu",""],["Dilley","Neil",""],["Chen","Zhihong",""],["Appenzeller","Joerg",""]]}
{"id":"2308.10990","submitter":"Jie Liu","authors":"Jie Liu, Tao Zhang, Shuyu Sun","title":"Flashlight Search Medial Axis: A Pixel-Free Pore-Network Extraction\n  Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pore-network models (PNMs) have become an important tool in the study of\nfluid flow in porous media over the last few decades, and the accuracy of their\nresults highly depends on the extraction of pore networks. Traditional methods\nof pore-network extraction are based on pixels and require images with high\nquality. Here, a pixel-free method called the flashlight search medial axis\n(FSMA) algorithm is proposed for pore-network extraction in a continuous space.\nThe search domain in a two-dimensional space is a line, whereas a surface\ndomain is searched in a three-dimensional scenario. Thus, the FSMA algorithm\nfollows the dimensionality reduction idea; the medial axis can be identified\nusing only a few points instead of calculating every point in the void space.\nIn this way, computational complexity of this method is greatly reduced\ncompared to that of traditional pixel-based extraction methods, thus enabling\nlarge-scale pore-network extraction. Based on cases featuring two- and\nthree-dimensional porous media, the FSMA algorithm performs well regardless of\nthe topological structure of the pore network or the positions of the pore and\nthroat centers. This algorithm can also be used to examine both closed- and\nopen-boundary cases. Finally, the FSMA algorithm can search dead-end pores,\nwhich is of great significance in the study of multiphase flow in porous media.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 11:37:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Jie",""],["Zhang","Tao",""],["Sun","Shuyu",""]]}
{"id":"2308.10991","submitter":"Yoko Hirono","authors":"Wladislav Artsimovich, Yoko Hirono","title":"Improved mirror ball projection for more accurate merging of multiple\n  camera outputs and process monitoring","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using spherical mirrors in place of wide-angle cameras allows for\ncost-effective monitoring of manufacturing processes in hazardous environment,\nwhere a camera would normally not operate. This includes environments of high\nheat, vacuum and strong electromagnetic fields. Moreover, it allows the\nlayering of multiple camera types (e.g., color image, near-infrared,\nlong-wavelength infrared, ultraviolet) into a single wide-angle output, whilst\naccounting for the different camera placements and lenses used. Normally, the\ndifferent camera positions introduce a parallax shift between the images, but\nwith a spherical projection as produced by a spherical mirror, this parallax\nshift is reduced, depending on mirror size and distance to the monitoring\ntarget.\n  This paper introduces a variation of the 'mirror ball projection', that\naccounts for distortion produced by a perspective camera at the pole of the\nprojection. Finally, the efficacy of process monitoring via a mirror ball is\nevaluated.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 04:18:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Artsimovich","Wladislav",""],["Hirono","Yoko",""]]}
{"id":"2308.10992","submitter":"Viacheslav Klimenko","authors":"Viacheslav V. Klimenko, Varsha Kulkarni, David A. Wake, Suraj Poudel,\n  Matthew A. Bershady, Celine Peroux, Britt Lundgren","title":"The Baryonic Content of Galaxies Mapped by MaNGA and the Gas Around Them","comments":"Accepted for publication in ApJ, 49 pages, 36 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze the cool gas in and around 14 nearby galaxies (at $z$$<$0.1)\nmapped with the SDSS-IV MaNGA survey by measuring absorption lines produced by\ngas in spectra of background quasars/AGN at impact parameters of 0-25 effective\nradii from the galaxy center. Using HST/COS, we detect absorption at the galaxy\nredshift and measure or constrain column densities of neutral (H I, N I, O I,\nAr I), low-ionization (Si II, S II, C II, N II Fe II), and high-ionization (Si\nIII, Fe III, N V, O VI) species for 11 galaxies. We derive the ionization\nparameter and ionization-corrected metallicity using CLOUDY photo-ionization\nmodels. The H I column density ranges from $\\sim$$10^{13}$ to\n$\\sim$$10^{20}\\,{\\rm cm^{-2}}$ and decreases with impact parameter for $r \\ge\nR_{e}$. Galaxies with higher stellar mass have weaker H I absorption. Comparing\nabsorption velocities with MaNGA radial velocity maps of ionized gas line\nemissions in galactic disks, we find that the neutral gas seen in absorption\nco-rotates with the disk out to $\\sim$10 $R_{e}$. Sight lines with lower\nelevation angles show lower metallicities, consistent with the metallicity\ngradient in the disk derived from MaNGA maps. Higher elevation angle sight\nlines show higher ionization, lower H I-column density, super-solar\nmetallicity, and velocities consistent with the direction of galactic outflow.\nOur data offer the first detailed comparisons of CGM properties (kinematics and\nmetallicity) with extrapolations of detailed galaxy maps from integral field\nspectroscopy; similar studies for larger samples are needed to more fully\nunderstand how galaxies interact with their CGM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:17:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Klimenko","Viacheslav V.",""],["Kulkarni","Varsha",""],["Wake","David A.",""],["Poudel","Suraj",""],["Bershady","Matthew A.",""],["Peroux","Celine",""],["Lundgren","Britt",""]]}
{"id":"2308.10993","submitter":"Andrii Babii","authors":"Andrii Babii, Eric Ghysels, Jonas Striaukas","title":"Econometrics of Machine Learning Methods in Economic Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.AP stat.ME stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper surveys the recent advances in machine learning method for\neconomic forecasting. The survey covers the following topics: nowcasting,\ntextual data, panel and tensor data, high-dimensional Granger causality tests,\ntime series cross-validation, classification with economic losses.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:19:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Babii","Andrii",""],["Ghysels","Eric",""],["Striaukas","Jonas",""]]}
{"id":"2308.10994","submitter":"Mustaffa Hussain","authors":"Mustaffa Hussain, Saharsh Barve","title":"Switched auxiliary loss for robust training of transformer models for\n  histopathological image segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Functional tissue Units (FTUs) are cell population neighborhoods local to a\nparticular organ performing its main function. The FTUs provide crucial\ninformation to the pathologist in understanding the disease affecting a\nparticular organ by providing information at the cellular level. In our\nresearch, we have developed a model to segment multi-organ FTUs across 5 organs\nnamely: the kidney, large intestine, lung, prostate and spleen by utilizing the\nHuBMAP + HPA - Hacking the Human Body competition dataset. We propose adding\nshifted auxiliary loss for training models like the transformers to overcome\nthe diminishing gradient problem which poses a challenge towards optimal\ntraining of deep models. Overall, our model achieved a dice score of 0.793 on\nthe public dataset and 0.778 on the private dataset and shows a 1% improvement\nwith the use of the proposed method. The findings also bolster the use of\ntransformers models for dense prediction tasks in the field of medical image\nanalysis. The study assists in understanding the relationships between cell and\ntissue organization thereby providing a useful medium to look at the impact of\ncellular functions on human health.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:20:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hussain","Mustaffa",""],["Barve","Saharsh",""]]}
{"id":"2308.10995","submitter":"Shikha Verma","authors":"Shikha Verma, Kuldeep Srivastava, Akhilesh Tiwari, Shekhar Verma","title":"Deep Learning Techniques in Extreme Weather Events: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Extreme weather events pose significant challenges, thereby demanding\ntechniques for accurate analysis and precise forecasting to mitigate its\nimpact. In recent years, deep learning techniques have emerged as a promising\napproach for weather forecasting and understanding the dynamics of extreme\nweather events. This review aims to provide a comprehensive overview of the\nstate-of-the-art deep learning in the field. We explore the utilization of deep\nlearning architectures, across various aspects of weather prediction such as\nthunderstorm, lightning, precipitation, drought, heatwave, cold waves and\ntropical cyclones. We highlight the potential of deep learning, such as its\nability to capture complex patterns and non-linear relationships. Additionally,\nwe discuss the limitations of current approaches and highlight future\ndirections for advancements in the field of meteorology. The insights gained\nfrom this systematic review are crucial for the scientific community to make\ninformed decisions and mitigate the impacts of extreme weather events.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:15:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Verma","Shikha",""],["Srivastava","Kuldeep",""],["Tiwari","Akhilesh",""],["Verma","Shekhar",""]]}
{"id":"2308.10997","submitter":"Sadeep Jayasumana","authors":"Sadeep Jayasumana, Daniel Glasner, Srikumar Ramalingam, Andreas Veit,\n  Ayan Chakrabarti, Sanjiv Kumar","title":"SPEGTI: Structured Prediction for Efficient Generative Text-to-Image\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Modern text-to-image generation models produce high-quality images that are\nboth photorealistic and faithful to the text prompts. However, this quality\ncomes at significant computational cost: nearly all of these models are\niterative and require running inference multiple times with large models. This\niterative process is needed to ensure that different regions of the image are\nnot only aligned with the text prompt, but also compatible with each other. In\nthis work, we propose a light-weight approach to achieving this compatibility\nbetween different regions of an image, using a Markov Random Field (MRF) model.\nThis method is shown to work in conjunction with the recently proposed Muse\nmodel. The MRF encodes the compatibility among image tokens at different\nspatial locations and enables us to significantly reduce the required number of\nMuse prediction steps. Inference with the MRF is significantly cheaper, and its\nparameters can be quickly learned through back-propagation by modeling MRF\ninference as a differentiable neural-network layer. Our full model, SPEGTI,\nuses this proposed MRF model to speed up Muse by 1.5X with no loss in output\nimage quality.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 14:07:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jayasumana","Sadeep",""],["Glasner","Daniel",""],["Ramalingam","Srikumar",""],["Veit","Andreas",""],["Chakrabarti","Ayan",""],["Kumar","Sanjiv",""]]}
{"id":"2308.10999","submitter":"Mieczys{\\l}aw K{\\l}opotek","authors":"Mieczys{\\l}aw A. K{\\l}opotek and Bart{\\l}miej Starosta and S{\\l}awomir\n  T. Wierzcho\\'n","title":"Eigenvalue-based Incremental Spectral Clustering","comments":"14 tables, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our previous experiments demonstrated that subsets collections of (short)\ndocuments (with several hundred entries) share a common normalized in some way\neigenvalue spectrum of combinatorial Laplacian. Based on this insight, we\npropose a method of incremental spectral clustering. The method consists of the\nfollowing steps: (1) split the data into manageable subsets, (2) cluster each\nof the subsets, (3) merge clusters from different subsets based on the\neigenvalue spectrum similarity to form clusters of the entire set. This method\ncan be especially useful for clustering methods of complexity strongly\nincreasing with the size of the data sample,like in case of typical spectral\nclustering. Experiments were performed showing that in fact the clustering and\nmerging the subsets yields clusters close to clustering the entire dataset.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 13:42:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["K\u0142opotek","Mieczys\u0142aw A.",""],["Starosta","Bart\u0142miej",""],["Wierzcho\u0144","S\u0142awomir T.",""]]}
{"id":"2308.11001","submitter":"Shilpa Lakhanpal","authors":"Shilpa Lakhanpal, Ajay Gupta, Rajeev Agrawal","title":"Leveraging Explainable AI to Analyze Researchers' Aspect-Based Sentiment\n  about ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The groundbreaking invention of ChatGPT has triggered enormous discussion\namong users across all fields and domains. Among celebration around its various\nadvantages, questions have been raised with regards to its correctness and\nethics of its use. Efforts are already underway towards capturing user\nsentiments around it. But it begs the question as to how the research community\nis analyzing ChatGPT with regards to various aspects of its usage. It is this\nsentiment of the researchers that we analyze in our work. Since Aspect-Based\nSentiment Analysis has usually only been applied on a few datasets, it gives\nlimited success and that too only on short text data. We propose a methodology\nthat uses Explainable AI to facilitate such analysis on research data. Our\ntechnique presents valuable insights into extending the state of the art of\nAspect-Based Sentiment Analysis on newer datasets, where such analysis is not\nhampered by the length of the text data.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 07:44:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lakhanpal","Shilpa",""],["Gupta","Ajay",""],["Agrawal","Rajeev",""]]}
{"id":"2308.11002","submitter":"Sa\\v{s}a Novakovi\\'c","authors":"Sa\\v{s}a Novakovi\\'c","title":"A note on some polynomial-factorial diophantine equations","comments":"14 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all\ninteger solutions for the equation $n!=x^2-1$. It is conjectured that this\nequation has only three solutions, but up to now this is an open problem.\nOverholt observed that a weak form of Szpiro's-conjecture implies that\nBrocard's equation has finitely many integer solutions. More generally,\nassuming the ABC-conjecture, Luca showed that equations of the form $n!=P(x)$\nwhere $P(x)\\in\\mathbb{Z}[x]$ of degree $d\\geq 2$ have only finitely many\ninteger solutions with $n>0$. And if $P(x)$ is irreducible, Berend and Harmse\nproved unconditionally that $P(x)=n!$ has only finitely many integer solutions.\nIn this note we study diophantine equations of the form $g(x_1,...,x_r)=P(x)$\nwhere $P(x)\\in\\mathbb{Z}[x]$ of degree $d\\geq 2$ and $g(x_1,...,x_r)\\in\n\\mathbb{Z}[x_1,...,x_r]$ where for $x_i$ one may also plug in $A^{n}$ or the\nBhargava factorial $n!_S$. We want to understand when there are finitely many\nor infinitely many integer solutions. Moreover, we study diophantine equations\nof the form $g(x_1,...,x_r)=f(x,y)$ where $f(x,y)\\in\\mathbb{Z}[x,y]$ is a\nhomogeneous polynomial of degree $\\geq2$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:34:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Novakovi\u0107","Sa\u0161a",""]]}
{"id":"2308.11003","submitter":"Bertrand Rouet-Leduc","authors":"Bertrand Rouet-Leduc, Thomas Kerdreux, Alexandre Tuel, Claudia Hulbert","title":"Autonomous Detection of Methane Emissions in Multispectral Satellite\n  Data Using Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Methane is one of the most potent greenhouse gases, and its short atmospheric\nhalf-life makes it a prime target to rapidly curb global warming. However,\ncurrent methane emission monitoring techniques primarily rely on approximate\nemission factors or self-reporting, which have been shown to often dramatically\nunderestimate emissions. Although initially designed to monitor surface\nproperties, satellite multispectral data has recently emerged as a powerful\nmethod to analyze atmospheric content. However, the spectral resolution of\nmultispectral instruments is poor, and methane measurements are typically very\nnoisy. Methane data products are also sensitive to absorption by the surface\nand other atmospheric gases (water vapor in particular) and therefore provide\nnoisy maps of potential methane plumes, that typically require extensive human\nanalysis. Here, we show that the image recognition capabilities of deep\nlearning methods can be leveraged to automatize the detection of methane leaks\nin Sentinel-2 satellite multispectral data, with dramatically reduced false\npositive rates compared with state-of-the-art multispectral methane data\nproducts, and without the need for a priori knowledge of potential leak sites.\nOur proposed approach paves the way for the automated, high-definition and\nhigh-frequency monitoring of point-source methane emissions across the world.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:36:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rouet-Leduc","Bertrand",""],["Kerdreux","Thomas",""],["Tuel","Alexandre",""],["Hulbert","Claudia",""]]}
{"id":"2308.11004","submitter":"M. Ilyas","authors":"M. Ilyas and Kazuharu Bamba","title":"Traversable wormholes with static spherical symmetry and their stability\n  in higher-curvature gravity","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"FU-PCG-121","categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The solutions of traversable wormholes and their geometries are investigated\nin higher-curvature gravity with boundary terms for each case under the\npresence of anisotropic, isotropic and barotropic fluids in detail. For each\ncase, the effective energy-momentum tensor violates the null energy condition\nthroughout the wormhole throat. The null and weak energy conditions are also\nanalyzed for ordinary matters. The regions that physically viable wormhole\nsolutions can exist are explicitly shown. Furthermore, it is found that the\nrange of the viable regions exhibits an alternating pattern of expansion and\ncontraction. The present analyses can reveal the regions in which traversable\nwormholes can be constructed for anisotropic, isotropic and barotropic fluids\ncases with incorporating realistic matter contents, leading to fundamental\nphysics insights into the feasible construction of wormholes in\nhigher-curvature gravity with boundary term.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:10:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ilyas","M.",""],["Bamba","Kazuharu",""]]}
{"id":"2308.11005","submitter":"Sam Nelson","authors":"Jieon Kim and Sam Nelson","title":"Entropic Niebrzydowski Tribrackets","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the notion of entropic Niebrzydowski tribrackets or just\nentropic tribrackets, analogous to entropic (also known as abelian or medial )\nquandles and biquandles. We show that if X is a finite entropic tribracket then\nfor any tribracket T , the homset Hom(T, X) (and in particular, for any\noriented link L, the homset Hom(T (L), X)) also has the structure of an\nentropic tribracket. This operation yields a product on the category of\nentropic tribrackets; we compute the operation table for entropic tribrackets\nof small cardinality and prove a few results. We conjecture that this structure\ncan be used to distinguish links which have the same counting invariant with\nrespect to a chosen entropic coloring tribracket X.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:38:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Jieon",""],["Nelson","Sam",""]]}
{"id":"2308.11006","submitter":"Christopher Ormerod","authors":"Christopher Ormerod","title":"Using language models in the implicit automated assessment of\n  mathematical short answer items","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CY cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose a new way to assess certain short constructed responses to\nmathematics items. Our approach uses a pipeline that identifies the key values\nspecified by the student in their response. This allows us to determine the\ncorrectness of the response, as well as identify any misconceptions. The\ninformation from the value identification pipeline can then be used to provide\nfeedback to the teacher and student. The value identification pipeline consists\nof two fine-tuned language models. The first model determines if a value is\nimplicit in the student response. The second model identifies where in the\nresponse the key value is specified. We consider both a generic model that can\nbe used for any prompt and value, as well as models that are specific to each\nprompt and value. The value identification pipeline is a more accurate and\ninformative way to assess short constructed responses than traditional\nrubric-based scoring. It can be used to provide more targeted feedback to\nstudents, which can help them improve their understanding of mathematics.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:45:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ormerod","Christopher",""]]}
{"id":"2308.11007","submitter":"Guillermo Cabrera-Vives","authors":"Esteban Medina-Rosales, Guillermo Cabrera-Vives, and Christopher J.\n  Miller","title":"Mitigating Bias in Deep Learning: Training Unbiased Models on Biased\n  Data for the Morphological Classification of Galaxies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Galaxy morphologies and their relation with physical properties have been a\nrelevant subject of study in the past. Most galaxy morphology catalogs have\nbeen labelled by human annotators or by machine learning models trained on\nhuman labelled data. Human generated labels have been shown to contain biases\nin terms of the observational properties of the data, such as image resolution.\nThese biases are independent of the annotators, that is, are present even in\ncatalogs labelled by experts. In this work, we demonstrate that training deep\nlearning models on biased galaxy data produce biased models, meaning that the\nbiases in the training data are transferred to the predictions of the new\nmodels. We also propose a method to train deep learning models that considers\nthis inherent labelling bias, to obtain a de-biased model even when training on\nbiased data. We show that models trained using our deep de-biasing method are\ncapable of reducing the bias of human labelled datasets.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:46:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Medina-Rosales","Esteban",""],["Cabrera-Vives","Guillermo",""],["Miller","Christopher J.",""]]}
{"id":"2308.11008","submitter":"Togerchety Hitendra sarma","authors":"D.D.D.Suribabu, T.Hitendra Sarma, B.Eswar Reddy","title":"Approximating Clustering for Memory Management and request processing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Clustering is a crucial tool for analyzing data in virtually every scientific\nand engineering discipline. There are more scalable solutions framed to enable\ntime and space clustering for the future large-scale data analyses. As a\nresult, hardware and software innovations that can significantly improve data\nefficiency and performance of the data clustering techniques are necessary to\nmake the future large-scale data analysis practical. This paper proposes a\nnovel mechanism for computing bit-serial medians. We propose a novel method,\ntwo-parameter terms that enables in computation within the data arrays\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 11:39:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Suribabu","D. D. D.",""],["Sarma","T. Hitendra",""],["Reddy","B. Eswar",""]]}
{"id":"2308.11009","submitter":"Alexander Barg","authors":"Madhura Pathegama and Alexander Barg","title":"Smoothing of binary codes, uniform distributions, and applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The action of a noise operator on a code transforms it into a distribution on\nthe respective space. Some common examples from information theory include\nBernoulli noise acting on a code in the Hamming space and Gaussian noise acting\non a lattice in the Euclidean space. We aim to characterize the cases when the\noutput distribution is close to the uniform distribution on the space, as\nmeasured by R{\\'e}nyi divergence of order $\\alpha \\in [1,\\infty]$. A version of\nthis question is known as the channel resolvability problem in information\ntheory, and it has implications for security guarantees in wiretap channels,\nerror correction, discrepancy, worst-to-average case complexity reductions, and\nmany other problems.\n  Our work quantifies the requirements for asymptotic uniformity (perfect\nsmoothing) and identifies explicit code families that achieve it under the\naction of the Bernoulli and ball noise operators on the code. We derive\nexpressions for the minimum rate of codes required to attain asymptotically\nperfect smoothing. In proving our results, we leverage recent results from\nharmonic analysis of functions on the Hamming space. Another result pertains to\nthe use of code families in Wyner's transmission scheme on the binary wiretap\nchannel. We identify explicit families that guarantee strong secrecy when\napplied in this scheme, showing that nested Reed-Muller codes can transmit\nmessages reliably and securely over a binary symmetric wiretap channel with a\npositive rate. Finally, we establish a connection between smoothing and error\ncorrection in the binary symmetric channel.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:50:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pathegama","Madhura",""],["Barg","Alexander",""]]}
{"id":"2308.11010","submitter":"Fatemeh Mirmojarabian","authors":"Fatemeh Mirmojarabian, Saeed S. Jahromi, Jahanfar Abouie","title":"Valence-Bond Solid phases in the spin-$1/2$ Kekul{\\'e}-Heisenberg model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We map out the ground state phase diagram of the isotropic Kekul{\\'e}-Kitaev\nmodel on the honeycomb lattice in the presence of the Heisenberg exchange\ncouplings. Our study relies on large-scale tensor network simulations based on\ngraph-based projected entangled pair state (gPEPS) approach in the\nthermodynamic limit. We find that on top of the quantum spin liquid (QSL) and\nconventional magnetically ordered phases which are typical of the\nKitaev-Heisenberg model, the Kekul{\\'e}-Heisenberg phase diagram, hosts two\nplaquette valance bond solid (VBS) phases with vanishing magnetic order. While\nthe VBS phases preserve the symmetries of the original Hamiltonian, they differ\nmarkedly from the Kitaev spin liquid by having decorated plaquette ordering\nwhich is distinguished by a plaquette order parameter.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:50:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mirmojarabian","Fatemeh",""],["Jahromi","Saeed S.",""],["Abouie","Jahanfar",""]]}
{"id":"2308.11011","submitter":"Peng Zhou","authors":"Peng Zhou, Alexander J. Edwards, Frederick B. Mancoff, Sanjeev\n  Aggarwal, Stephen K. Heinrich-Barna, Joseph S. Friedman","title":"Neuromorphic Hebbian learning with magnetic tunnel junction synapses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neuromorphic computing aims to mimic both the function and structure of\nbiological neural networks to provide artificial intelligence with extreme\nefficiency. Conventional approaches store synaptic weights in non-volatile\nmemory devices with analog resistance states, permitting in-memory computation\nof neural network operations while avoiding the costs associated with\ntransferring synaptic weights from a memory array. However, the use of analog\nresistance states for storing weights in neuromorphic systems is impeded by\nstochastic writing, weights drifting over time through stochastic processes,\nand limited endurance that reduces the precision of synapse weights. Here we\npropose and experimentally demonstrate neuromorphic networks that provide\nhigh-accuracy inference thanks to the binary resistance states of magnetic\ntunnel junctions (MTJs), while leveraging the analog nature of their stochastic\nspin-transfer torque (STT) switching for unsupervised Hebbian learning. We\nperformed the first experimental demonstration of a neuromorphic network\ndirectly implemented with MTJ synapses, for both inference and\nspike-timing-dependent plasticity learning. We also demonstrated through\nsimulation that the proposed system for unsupervised Hebbian learning with\nstochastic STT-MTJ synapses can achieve competitive accuracies for MNIST\nhandwritten digit recognition. By appropriately applying neuromorphic\nprinciples through hardware-aware design, the proposed STT-MTJ neuromorphic\nlearning networks provide a pathway toward artificial intelligence hardware\nthat learns autonomously with extreme efficiency.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 19:58:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhou","Peng",""],["Edwards","Alexander J.",""],["Mancoff","Frederick B.",""],["Aggarwal","Sanjeev",""],["Heinrich-Barna","Stephen K.",""],["Friedman","Joseph S.",""]]}
{"id":"2308.11012","submitter":"Sergey Yakovlev L.","authors":"V. A. Gradusov, S. L. Yakovlev","title":"On scattering problem off the potential, decreasing as inverse square of\n  distance","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph math-ph math.MP nucl-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A solution of the scattering problem is obtained for the Schr\\\"odinger\nequation with the potential of induced dipole interaction, which decreases as\nthe inverse square of the distance. Such a potential arises in the collision of\nan incident charged particle with a complex of charged particles (for example,\nin the collision of electrons with atoms). For the wave function, an integral\nequation is constructed for an arbitrary value of the orbital momentum of\nrelative motion. By solving this equation, an exact integral representation for\nthe $K$-matrix of the problem is obtained in terms of the wave function. This\nrepresentation is used to analyze the behavior of the $K$-matrix at low\nenergies and to obtain comprehensive information on its threshold behavior for\nvarious values of the dipole momentum. The resulting solution is applied to\nstudy the behavior of the scattering cross sections in the electron, positron\nand antiproton system.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:00:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gradusov","V. A.",""],["Yakovlev","S. L.",""]]}
{"id":"2308.11013","submitter":"Jeong Min Lee","authors":"Jeong Min Lee and Milos Hauskrecht","title":"Personalized Event Prediction for Electronic Health Records","comments":"arXiv admin note: text overlap with arXiv:2104.01787","journal-ref":"Artificial Intelligence in Medicine, Volume 143, 2023, 102620,\n  ISSN 0933-3657","doi":"10.1016/j.artmed.2023.102620","report-no":null,"categories":"cs.LG cs.AI stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Clinical event sequences consist of hundreds of clinical events that\nrepresent records of patient care in time. Developing accurate predictive\nmodels of such sequences is of a great importance for supporting a variety of\nmodels for interpreting/classifying the current patient condition, or\npredicting adverse clinical events and outcomes, all aimed to improve patient\ncare. One important challenge of learning predictive models of clinical\nsequences is their patient-specific variability. Based on underlying clinical\nconditions, each patient's sequence may consist of different sets of clinical\nevents (observations, lab results, medications, procedures). Hence, simple\npopulation-wide models learned from event sequences for many different patients\nmay not accurately predict patient-specific dynamics of event sequences and\ntheir differences. To address the problem, we propose and investigate multiple\nnew event sequence prediction models and methods that let us better adjust the\nprediction for individual patients and their specific conditions. The methods\ndeveloped in this work pursue refinement of population-wide models to\nsubpopulations, self-adaptation, and a meta-level model switching that is able\nto adaptively select the model with the best chance to support the immediate\nprediction. We analyze and test the performance of these models on clinical\nevent sequences of patients in MIMIC-III database.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:03:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lee","Jeong Min",""],["Hauskrecht","Milos",""]]}
{"id":"2308.11014","submitter":"Andrey Bagrov","authors":"Fabio Salvati, Mikhail I. Katsnelson, Andrey A. Bagrov, Tom Westerhout","title":"Stability of a quantum skyrmion: projective measurements and the quantum\n  Zeno effect","comments":"7+eps pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic skyrmions are vortex-like quasiparticles characterized by long\nlifetime and remarkable topological properties. That makes them a promising\ncandidate for the role of information carriers in magnetic information storage\nand processing devices. Although considerable progress has been made in\nstudying skyrmions in classical systems, little is known about the quantum\ncase: quantum skyrmions cannot be directly observed by probing the local\nmagnetization of the system, and the notion of topological protection is\nelusive in the quantum realm. Here, we explore the potential robustness of\nquantum skyrmions in comparison to their classical counterparts. We\ntheoretically analyze the dynamics of a quantum skyrmion subject to local\nprojective measurements and demonstrate that the properties of the skyrmionic\nquantum state change very little upon external perturbations. We further show\nthat by performing repetitive measurements on a quantum skyrmion, it can be\ncompletely stabilized through an analog of the quantum Zeno effect.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:03:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Salvati","Fabio",""],["Katsnelson","Mikhail I.",""],["Bagrov","Andrey A.",""],["Westerhout","Tom",""]]}
{"id":"2308.11015","submitter":"Tze Ho Elden Tse","authors":"Tze Ho Elden Tse, Franziska Mueller, Zhengyang Shen, Danhang Tang,\n  Thabo Beeler, Mingsong Dou, Yinda Zhang, Sasa Petrovic, Hyung Jin Chang,\n  Jonathan Taylor, Bardia Doosti","title":"Spectral Graphormer: Spectral Graph-based Transformer for Egocentric\n  Two-Hand Reconstruction using Multi-View Color Images","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose a novel transformer-based framework that reconstructs two high\nfidelity hands from multi-view RGB images. Unlike existing hand pose estimation\nmethods, where one typically trains a deep network to regress hand model\nparameters from single RGB image, we consider a more challenging problem\nsetting where we directly regress the absolute root poses of two-hands with\nextended forearm at high resolution from egocentric view. As existing datasets\nare either infeasible for egocentric viewpoints or lack background variations,\nwe create a large-scale synthetic dataset with diverse scenarios and collect a\nreal dataset from multi-calibrated camera setup to verify our proposed\nmulti-view image feature fusion strategy. To make the reconstruction physically\nplausible, we propose two strategies: (i) a coarse-to-fine spectral graph\nconvolution decoder to smoothen the meshes during upsampling and (ii) an\noptimisation-based refinement stage at inference to prevent self-penetrations.\nThrough extensive quantitative and qualitative evaluations, we show that our\nframework is able to produce realistic two-hand reconstructions and demonstrate\nthe generalisation of synthetic-trained models to real data, as well as\nreal-time AR/VR applications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:07:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tse","Tze Ho Elden",""],["Mueller","Franziska",""],["Shen","Zhengyang",""],["Tang","Danhang",""],["Beeler","Thabo",""],["Dou","Mingsong",""],["Zhang","Yinda",""],["Petrovic","Sasa",""],["Chang","Hyung Jin",""],["Taylor","Jonathan",""],["Doosti","Bardia",""]]}
{"id":"2308.11016","submitter":"Rub\\'en Mart\\'inez-Avenda\\~no","authors":"Ad\\'an \\'Angeles-Romero and Rub\\'en A. Mart\\'inez Avenda\\~no","title":"The Forward and Backward Shift on the Hardy Space of a Tree","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we initiate the study of the forward and backward shifts on the\nHardy space of a tree and the little Hardy space of a tree. In particular, we\ninvestigate when these shifts are bounded, find the norm of the shifts if they\nare bounded, characterize the trees in which they are an isometry, compute the\nspectrum in some concrete examples, and completely determine when they are\nhypercyclic.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:12:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["\u00c1ngeles-Romero","Ad\u00e1n",""],["Avenda\u00f1o","Rub\u00e9n A. Mart\u00ednez",""]]}
{"id":"2308.11017","submitter":"Douglas Silva","authors":"Douglas F\\'elix da Silva, Li Hui, Paulo J. A. Sim\\~oes, Adriana Valio,\n  Joaquim C. E. R., Hugh S. Hudson, Paulo J. A. Simoes, Lyndsay Fletcher, Laura\n  A. Hayes, Iain G. Hannah","title":"Statistical analysis of the onset temperature of solar flares in\n  2010-2011","comments":"6 pages,7 figures","journal-ref":null,"doi":"10.1093/mnras/stad2244","report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the physical processes that trigger solar flares is paramount\nto help with forecasting space weather and mitigating the effects on our\ntechnological infrastructure. A previously unknown phenomenon was recently\nidentified in solar flares: the plasma temperature, derived from soft X-ray\n(SXR) data, at the onset of four flares, was revealed to be in the range 10-15\nMK, without evidence of gradual heating. To investigate how common the\nhot-onset phenomenon may be, we extend this investigation to solar flares of\nB1.2- X6.9 classes recorded by the X-ray Sensor (XRS) on-board the GOES-14 and\nGOES-15 satellites between 2010 and 2011. For this statistical study, we\nemployed the same methodology as in recent work, where the pre-flare SXR flux\nof each flare is obtained manually, and the temperature and emission measure\nvalues are obtained by the flux ratio of the two GOES/XRS channels using the\nstandard software. From 3224 events listed in the GOES flare catalog for\n2010-2011, we have selected and analyzed 745 events for which the flare\nheliographic location was provided in the list, to investigate center-to-limb\neffects of the hot-onset phenomenon. Our results show that 559 out of 745\nflares (75%) exhibit an onset temperature above 8.6 MK (the first quartile),\nwith respective log10 of the emission measure values between 46.0 - 47.25 cm-3,\nindicating that small amounts of plasma are quickly heated to high\ntemperatures. These results suggest that the hot-onset phenomenon is very\ncommon in solar flares.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:14:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["da Silva","Douglas F\u00e9lix",""],["Hui","Li",""],["Sim\u00f5es","Paulo J. A.",""],["Valio","Adriana",""],["R.","Joaquim C. E.",""],["Hudson","Hugh S.",""],["Simoes","Paulo J. A.",""],["Fletcher","Lyndsay",""],["Hayes","Laura A.",""],["Hannah","Iain G.",""]]}
{"id":"2308.11018","submitter":"Seok Won Kang","authors":"Seok Won Kang, Jegyeong Ryu, Suh In Kim, Youngsoo Kim, Yoon Young Kim","title":"Computational Synthesis of Wearable Robot Mechanisms: Application to\n  Hip-Joint Mechanisms","comments":"28 pages, 7 figures, Supplementary Materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since wearable linkage mechanisms could control the moment transmission from\nactuator(s) to wearers, they can help ensure that even low-cost wearable\nsystems provide advanced functionality tailored to users' needs. For example,\nif a hip mechanism transforms an input torque into a spatially-varying moment,\na wearer can get effective assistance both in the sagittal and frontal planes\nduring walking, even with an affordable single-actuator system. However, due to\nthe combinatorial nature of the linkage mechanism design space, the topologies\nof such nonlinear-moment-generating mechanisms are challenging to determine,\neven with significant computational resources and numerical data. Furthermore,\non-premise production development and interactive design are nearly impossible\nin conventional synthesis approaches. Here, we propose an innovative autonomous\ncomputational approach for synthesizing such wearable robot mechanisms,\neliminating the need for exhaustive searches or numerous data sets. Our method\ntransforms the synthesis problem into a gradient-based optimization problem\nwith sophisticated objective and constraint functions while ensuring the\ndesired degree of freedom, range of motion, and force transmission\ncharacteristics. To generate arbitrary mechanism topologies and dimensions, we\nemployed a unified ground model. By applying the proposed method for the design\nof hip joint mechanisms, the topologies and dimensions of non-series-type hip\njoint mechanisms were obtained. Biomechanical simulations validated its\nmulti-moment assistance capability, and its wearability was verified via\nprototype fabrication. The proposed design strategy can open a new way to\ndesign various wearable robot mechanisms, such as shoulders, knees, and ankles.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:14:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kang","Seok Won",""],["Ryu","Jegyeong",""],["Kim","Suh In",""],["Kim","Youngsoo",""],["Kim","Yoon Young",""]]}
{"id":"2308.11019","submitter":"Tim Sziburis","authors":"Tim Sziburis, Markus Nowak, Davide Brunelli","title":"Instance-based Learning with Prototype Reduction for Real-Time\n  Proportional Myocontrol: A Randomized User Study Demonstrating\n  Accuracy-preserving Data Reduction for Prosthetic Embedded Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG cs.RO cs.SY eess.SP eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This work presents the design, implementation and validation of learning\ntechniques based on the kNN scheme for gesture detection in prosthetic control.\nTo cope with high computational demands in instance-based prediction, methods\nof dataset reduction are evaluated considering real-time determinism to allow\nfor the reliable integration into battery-powered portable devices. The\ninfluence of parameterization and varying proportionality schemes is analyzed,\nutilizing an eight-channel-sEMG armband. Besides offline cross-validation\naccuracy, success rates in real-time pilot experiments (online target\nachievement tests) are determined. Based on the assessment of specific dataset\nreduction techniques' adequacy for embedded control applications regarding\naccuracy and timing behaviour, Decision Surface Mapping (DSM) proves itself\npromising when applying kNN on the reduced set. A randomized, double-blind user\nstudy was conducted to evaluate the respective methods (kNN and kNN with\nDSM-reduction) against Ridge Regression (RR) and RR with Random Fourier\nFeatures (RR-RFF). The kNN-based methods performed significantly better\n(p<0.0005) than the regression techniques. Between DSM-kNN and kNN, there was\nno statistically significant difference (significance level 0.05). This is\nremarkable in consideration of only one sample per class in the reduced set,\nthus yielding a reduction rate of over 99% while preserving success rate. The\nsame behaviour could be confirmed in an extended user study. With k=1, which\nturned out to be an excellent choice, the runtime complexity of both kNN (in\nevery prediction step) as well as DSM-kNN (in the training phase) becomes\nlinear concerning the number of original samples, favouring dependable wearable\nprosthesis applications.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:15:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sziburis","Tim",""],["Nowak","Markus",""],["Brunelli","Davide",""]]}
{"id":"2308.11020","submitter":"Koji Inoue","authors":"Koji Inoue, Divesh Lala, Keiko Ochi, Tatsuya Kawahara, Gabriel Skantze","title":"Towards Objective Evaluation of Socially-Situated Conversational Robots:\n  Assessing Human-Likeness through Multimodal User Behaviors","comments":"Accepted by 25th ACM International Conference on Multimodal\n  Interaction (ICMI '23), Late-Breaking Results","journal-ref":null,"doi":"10.1145/3610661.3617151","report-no":null,"categories":"cs.CL cs.HC cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper tackles the challenging task of evaluating socially situated\nconversational robots and presents a novel objective evaluation approach that\nrelies on multimodal user behaviors. In this study, our main focus is on\nassessing the human-likeness of the robot as the primary evaluation metric.\nWhile previous research often relied on subjective evaluations from users, our\napproach aims to evaluate the robot's human-likeness based on observable user\nbehaviors indirectly, thus enhancing objectivity and reproducibility. To begin,\nwe created an annotated dataset of human-likeness scores, utilizing user\nbehaviors found in an attentive listening dialogue corpus. We then conducted an\nanalysis to determine the correlation between multimodal user behaviors and\nhuman-likeness scores, demonstrating the feasibility of our proposed\nbehavior-based evaluation method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:21:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Inoue","Koji",""],["Lala","Divesh",""],["Ochi","Keiko",""],["Kawahara","Tatsuya",""],["Skantze","Gabriel",""]]}
{"id":"2308.11021","submitter":"Mihai Cristian P\\^irvu","authors":"Mihai Pirvu, Alina Marcu, Alexandra Dobrescu, Nabil Belbachir, Marius\n  Leordeanu","title":"Multi-Task Hypergraphs for Semi-supervised Learning using Earth\n  Observations","comments":"Accepted in ICCV 2023 Workshops","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There are many ways of interpreting the world and they are highly\ninterdependent. We exploit such complex dependencies and introduce a powerful\nmulti-task hypergraph, in which every node is a task and different paths\nthrough the hypergraph reaching a given task become unsupervised teachers, by\nforming ensembles that learn to generate reliable pseudolabels for that task.\nEach hyperedge is part of an ensemble teacher for a given task and it is also a\nstudent of the self-supervised hypergraph system. We apply our model to one of\nthe most important problems of our times, that of Earth Observation, which is\nhighly multi-task and it often suffers from missing ground-truth data. By\nperforming extensive experiments on the NASA NEO Dataset, spanning a period of\n22 years, we demonstrate the value of our multi-task semi-supervised approach,\nby consistent improvements over strong baselines and recent work. We also show\nthat the hypergraph can adapt unsupervised to gradual data distribution shifts\nand reliably recover, through its multi-task self-supervision process, the\nmissing data for several observational layers for up to seven years.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:22:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pirvu","Mihai",""],["Marcu","Alina",""],["Dobrescu","Alexandra",""],["Belbachir","Nabil",""],["Leordeanu","Marius",""]]}
{"id":"2308.11022","submitter":"Stevo Rackovic","authors":"Filipa Valdeira, Stevo Rackovi\\'c, Valeria Danalachi, Qiwei Han,\n  Cl\\'audia Soares","title":"Extreme Multilabel Classification for Specialist Doctor Recommendation\n  with Implicit Feedback and Limited Patient Metadata","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recommendation Systems (RS) are often used to address the issue of medical\ndoctor referrals. However, these systems require access to patient feedback and\nmedical records, which may not always be available in real-world scenarios. Our\nresearch focuses on medical referrals and aims to predict recommendations in\ndifferent specialties of physicians for both new patients and those with a\nconsultation history. We use Extreme Multilabel Classification (XML), commonly\nemployed in text-based classification tasks, to encode available features and\nexplore different scenarios. While its potential for recommendation tasks has\noften been suggested, this has not been thoroughly explored in the literature.\nMotivated by the doctor referral case, we show how to recast a traditional\nrecommender setting into a multilabel classification problem that current XML\nmethods can solve. Further, we propose a unified model leveraging patient\nhistory across different specialties. Compared to state-of-the-art RS using the\nsame features, our approach consistently improves standard recommendation\nmetrics up to approximately $10\\%$ for patients with a previous consultation\nhistory. For new patients, XML proves better at exploiting available features,\noutperforming the benchmark in favorable scenarios, with particular emphasis on\nrecall metrics. Thus, our approach brings us one step closer to creating more\neffective and personalized doctor referral systems. Additionally, it highlights\nXML as a promising alternative to current hybrid or content-based RS, while\nidentifying key aspects to take into account when using XML for recommendation\ntasks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:23:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Valdeira","Filipa",""],["Rackovi\u0107","Stevo",""],["Danalachi","Valeria",""],["Han","Qiwei",""],["Soares","Cl\u00e1udia",""]]}
{"id":"2308.11023","submitter":"Youngmin Seo","authors":"Young Min Seo, Karen Willacy, Umaa Rebbapragada","title":"Statistical Prediction of [CII] Observations by Constructing Probability\n  Density Functions using SOFIA, Herschel, and Spitzer Observations","comments":"7 figures","journal-ref":"Journal of Astronomical Instrumentation, 2023,\n  10.1142/S2251171723500071","doi":"10.1142/S2251171723500071","report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a statistical algorithm for predicting the [CII] emission from\nHerschel and Spitzer continuum images using probability density functions\nbetween the [CII] emission and continuum emission. The [CII] emission at 158\n$\\mu$m is a critical tracer in studying the life cycle of interstellar medium\nand galaxy evolution. Unfortunately, its frequency is in the far infrared\n(FIR), which is opaque through the troposphere and cannot be observed from the\nground except for highly red-shifted sources (z $\\gtrsim$ 2). Typically [CII]\nobservations of closer regions have been carried out using suborbital or space\nobservatories. Given the high cost of these facilities and limited time\navailability, it is important to have highly efficient observations/operations\nin terms of maximizing science returns. This requires accurate prediction of\nthe strength of emission lines and, therefore, the time required for their\nobservation. However, [CII] emission has been hard to predict due to a lack of\nstrong correlations with other observables. Here we adopt a new approach to\nmaking accurate predictions of [CII] emission by relating this emission\nsimultaneously to several tracers of dust emission in the same region. This is\ndone using a statistical methodology utilizing probability density functions\n(PDFs) among [CII] emission and Spitzer IRAC and Herschel PACS/SPIRE images.\nOur test result toward a star-forming region, RCW 120, demonstrates that our\nmethodology delivers high-quality predictions with less than 30\\% uncertainties\nover 80\\% of the entire observation area, which is more than sufficient to test\nobservation feasibility and maximize science return. The {\\it pickle} dump\nfiles storing the PDFs and trained neural network module are accessible upon\nrequest and will support future far-infrared missions, for example, GUSTO and\nFIR Probe.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:23:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Seo","Young Min",""],["Willacy","Karen",""],["Rebbapragada","Umaa",""]]}
{"id":"2308.11024","submitter":"Jo\\~ao Pedro Carvalho","authors":"Ilani Axelrod-Freed, Jo\\~ao Pedro Carvalho and Yuki Takahashi","title":"Quantitative Transversal Theorems in the Plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hadwiger's theorem is a variant of Helly-type theorems involving common\ntransversals to families of convex sets instead of common intersections. In\nthis paper, we obtain a quantitative version of Hadwiger's theorem on the\nplane: given an ordered family of pairwise disjoint and compact convex sets in\n$\\mathbb{R}^2$ and any real-valued monotone function on convex subsets of\n$\\mathbb{R}^2,$ if every three sets have a common transversal, respecting the\norder, such that the intersection of the sets with each half-plane defined by\nthe transversal are valued at least (or at most) some constant $\\alpha,$ then\nthe entire family has a common transversal with the same property. Unlike\nprevious generalizations of Hadwiger's theorem, we prove that disjointness is\nnecessary for the quantitative case. We also prove colorful versions of our\nresults.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:25:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Axelrod-Freed","Ilani",""],["Carvalho","Jo\u00e3o Pedro",""],["Takahashi","Yuki",""]]}
{"id":"2308.11025","submitter":"Sijia Jiang","authors":"Sijia Jiang, Jing Hua, Zhizhong Han","title":"Coordinate Quantized Neural Implicit Representations for Multi-view\n  Reconstruction","comments":"to be appeared at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, huge progress has been made on learning neural implicit\nrepresentations from multi-view images for 3D reconstruction. As an additional\ninput complementing coordinates, using sinusoidal functions as positional\nencodings plays a key role in revealing high frequency details with\ncoordinate-based neural networks. However, high frequency positional encodings\nmake the optimization unstable, which results in noisy reconstructions and\nartifacts in empty space. To resolve this issue in a general sense, we\nintroduce to learn neural implicit representations with quantized coordinates,\nwhich reduces the uncertainty and ambiguity in the field during optimization.\nInstead of continuous coordinates, we discretize continuous coordinates into\ndiscrete coordinates using nearest interpolation among quantized coordinates\nwhich are obtained by discretizing the field in an extremely high resolution.\nWe use discrete coordinates and their positional encodings to learn implicit\nfunctions through volume rendering. This significantly reduces the variations\nin the sample space, and triggers more multi-view consistency constraints on\nintersections of rays from different views, which enables to infer implicit\nfunction in a more effective way. Our quantized coordinates do not bring any\ncomputational burden, and can seamlessly work upon the latest methods. Our\nevaluations under the widely used benchmarks show our superiority over the\nstate-of-the-art. Our code is available at\nhttps://github.com/MachinePerceptionLab/CQ-NIR.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:27:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jiang","Sijia",""],["Hua","Jing",""],["Han","Zhizhong",""]]}
{"id":"2308.11026","submitter":"Trambak Banerjee","authors":"Trambak Banerjee, Bowen Gang and Jianliang He","title":"Harnessing The Collective Wisdom: Fusion Learning Using Decision\n  Sequences From Diverse Sources","comments":"29 pages and 10 figures. Under review at a journal","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning from the collective wisdom of crowds enhances the transparency of\nscientific findings by incorporating diverse perspectives into the\ndecision-making process. Synthesizing such collective wisdom is related to the\nstatistical notion of fusion learning from multiple data sources or studies.\nHowever, fusing inferences from diverse sources is challenging since\ncross-source heterogeneity and potential data-sharing complicate statistical\ninference. Moreover, studies may rely on disparate designs, employ widely\ndifferent modeling techniques for inferences, and prevailing data privacy norms\nmay forbid sharing even summary statistics across the studies for an overall\nanalysis. In this paper, we propose an Integrative Ranking and Thresholding\n(IRT) framework for fusion learning in multiple testing. IRT operates under the\nsetting where from each study a triplet is available: the vector of binary\naccept-reject decisions on the tested hypotheses, the study-specific False\nDiscovery Rate (FDR) level and the hypotheses tested by the study. Under this\nsetting, IRT constructs an aggregated, nonparametric, and discriminatory\nmeasure of evidence against each null hypotheses, which facilitates ranking the\nhypotheses in the order of their likelihood of being rejected. We show that IRT\nguarantees an overall FDR control under arbitrary dependence between the\nevidence measures as long as the studies control their respective FDR at the\ndesired levels. Furthermore, IRT synthesizes inferences from diverse studies\nirrespective of the underlying multiple testing algorithms employed by them.\nWhile the proofs of our theoretical statements are elementary, IRT is extremely\nflexible, and a comprehensive numerical study demonstrates that it is a\npowerful framework for pooling inferences.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:30:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Banerjee","Trambak",""],["Gang","Bowen",""],["He","Jianliang",""]]}
{"id":"2308.11027","submitter":"Zhuohang Li","authors":"Zhuohang Li, Chao Yan, Xinmeng Zhang, Gharib Gharibi, Zhijun Yin,\n  Xiaoqian Jiang, Bradley A. Malin","title":"Split Learning for Distributed Collaborative Training of Deep Learning\n  Models in Health Informatics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Deep learning continues to rapidly evolve and is now demonstrating remarkable\npotential for numerous medical prediction tasks. However, realizing deep\nlearning models that generalize across healthcare organizations is challenging.\nThis is due, in part, to the inherent siloed nature of these organizations and\npatient privacy requirements. To address this problem, we illustrate how split\nlearning can enable collaborative training of deep learning models across\ndisparate and privately maintained health datasets, while keeping the original\nrecords and model parameters private. We introduce a new privacy-preserving\ndistributed learning framework that offers a higher level of privacy compared\nto conventional federated learning. We use several biomedical imaging and\nelectronic health record (EHR) datasets to show that deep learning models\ntrained via split learning can achieve highly similar performance to their\ncentralized and federated counterparts while greatly improving computational\nefficiency and reducing privacy risks.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:30:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Zhuohang",""],["Yan","Chao",""],["Zhang","Xinmeng",""],["Gharibi","Gharib",""],["Yin","Zhijun",""],["Jiang","Xiaoqian",""],["Malin","Bradley A.",""]]}
{"id":"2308.11028","submitter":"Saeid Alikhani","authors":"Saeid Alikhani and Fatemeh Aghaei","title":"More on the $2$-restricted optimal pebbling number","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G=(V,E)$ be a simple graph. A function $f:V\\rightarrow \\mathbb{N}\\cup\n\\{0\\}$ is called a configuration of pebbles on the vertices of $G$ and the\nweight of $f$ is $w(f)=\\sum_{u\\in V}f(u)$ which is just the total number of\npebbles assigned to vertices. A pebbling step from a vertex $u$ to one of its\nneighbors $v$ reduces $f(u)$ by two and increases $f(v)$ by one. A pebbling\nconfiguration $f$ is said to be solvable if for every vertex $ v $, there\nexists a sequence (possibly empty) of pebbling moves that results in a pebble\non $v$. A pebbling configuration $f$ is a $t$-restricted pebbling configuration\n(abbreviated $t$RPC) if $f(v)\\leq t$ for all $v\\in V$. The $t$-restricted\noptimal pebbling number $\\pi_t^*(G)$ is the minimum weight of a solvable $t$RPC\non $G$. Chellali et.al. [Discrete Appl. Math. 221 (2017) 46-53] characterized\nconnected graphs $G$ having small $2$-restricted optimal pebbling numbers and\ncharacterization of graphs $G$ with $\\pi_2^*(G)=5$ stated as an open problem.\nIn this paper, we solve this problem. We improve the upper bound of the\n$2$-restricted optimal pebbling number of trees of order $n$. Also, we study\n$2$-restricted optimal pebbling number of some grid graphs, corona and\nneighborhood corona of two specific graphs.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:35:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Alikhani","Saeid",""],["Aghaei","Fatemeh",""]]}
{"id":"2308.11029","submitter":"Lin Yuan","authors":"Lin Yuan, Guoheng Huang, Fenghuan Li, Xiaochen Yuan, Chi-Man Pun, Guo\n  Zhong","title":"RBA-GCN: Relational Bilevel Aggregation Graph Convolutional Network for\n  Emotion Recognition","comments":null,"journal-ref":"IEEE/ACM Transactions on Audio, Speech, and Language Processing,\n  vol. 31, pp. 2325-2337,2023","doi":"10.1109/TASLP.2023.3284509","report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emotion recognition in conversation (ERC) has received increasing attention\nfrom researchers due to its wide range of applications.As conversation has a\nnatural graph structure,numerous approaches used to model ERC based on graph\nconvolutional networks (GCNs) have yielded significant results.However,the\naggregation approach of traditional GCNs suffers from the node information\nredundancy problem,leading to node discriminant information\nloss.Additionally,single-layer GCNs lack the capacity to capture long-range\ncontextual information from the graph. Furthermore,the majority of approaches\nare based on textual modality or stitching together different modalities,\nresulting in a weak ability to capture interactions between modalities. To\naddress these problems, we present the relational bilevel aggregation graph\nconvolutional network (RBA-GCN), which consists of three modules: the graph\ngeneration module (GGM), similarity-based cluster building module (SCBM) and\nbilevel aggregation module (BiAM). First, GGM constructs a novel graph to\nreduce the redundancy of target node information.Then,SCBM calculates the node\nsimilarity in the target node and its structural neighborhood, where noisy\ninformation with low similarity is filtered out to preserve the discriminant\ninformation of the node. Meanwhile, BiAM is a novel aggregation method that can\npreserve the information of nodes during the aggregation process. This module\ncan construct the interaction between different modalities and capture\nlong-range contextual information based on similarity clusters. On both the\nIEMOCAP and MELD datasets, the weighted average F1 score of RBA-GCN has a\n2.17$\\sim$5.21\\% improvement over that of the most advanced method.Our code is\navailable at https://github.com/luftmenscher/RBA-GCN and our article with the\nsame name has been published in IEEE/ACM Transactions on Audio,Speech,and\nLanguage Processing,vol.31,2023\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 11:29:12 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:36:30 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yuan","Lin",""],["Huang","Guoheng",""],["Li","Fenghuan",""],["Yuan","Xiaochen",""],["Pun","Chi-Man",""],["Zhong","Guo",""]]}
{"id":"2308.11030","submitter":"Haocong Luo","authors":"Haocong Luo, Yahya Can Tu\\u{g}rul, F. Nisa Bostanc{\\i}, Ataberk Olgun,\n  A. Giray Ya\\u{g}l{\\i}k\\c{c}{\\i}, and Onur Mutlu","title":"Ramulator 2.0: A Modern, Modular, and Extensible DRAM Simulator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present Ramulator 2.0, a highly modular and extensible DRAM simulator that\nenables rapid and agile implementation and evaluation of design changes in the\nmemory controller and DRAM to meet the increasing research effort in improving\nthe performance, security, and reliability of memory systems. Ramulator 2.0\nabstracts and models key components in a DRAM-based memory system and their\ninteractions into shared interfaces and independent implementations. Doing so\nenables easy modification and extension of the modeled functions of the memory\ncontroller and DRAM in Ramulator 2.0. The DRAM specification syntax of\nRamulator 2.0 is concise and human-readable, facilitating easy modifications\nand extensions. Ramulator 2.0 implements a library of reusable templated lambda\nfunctions to model the functionalities of DRAM commands to simplify the\nimplementation of new DRAM standards, including DDR5, LPDDR5, HBM3, and GDDR6.\nWe showcase Ramulator 2.0's modularity and extensibility by implementing and\nevaluating a wide variety of RowHammer mitigation techniques that require\ndifferent memory controller design changes. These techniques are added\nmodularly as separate implementations without changing any code in the baseline\nmemory controller implementation. Ramulator 2.0 is rigorously validated and\nmaintains a fast simulation speed compared to existing cycle-accurate DRAM\nsimulators. Ramulator 2.0 is open-sourced under the permissive MIT license at\nhttps://github.com/CMU-SAFARI/ramulator2\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:39:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Luo","Haocong",""],["Tu\u011frul","Yahya Can",""],["Bostanc\u0131","F. Nisa",""],["Olgun","Ataberk",""],["Ya\u011fl\u0131k\u00e7\u0131","A. Giray",""],["Mutlu","Onur",""]]}
{"id":"2308.11031","submitter":"Niseem Magdy","authors":"Niseem Magdy and Roy Lacey","title":"Exploring Rapidity-Even Dipolar Flow in Isobaric Collisions at RHIC","comments":"6 pages, 6 figures, submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Employing the AMPT transport model, we investigate the response of the\nrapidity-even dipolar flow ($\\mathrm{v^{even}_{1}}$) and its associated Global\nMomentum Conservation (GMC) parameter $\\mathrm{K}$ to structural disparities\nwithin $^{96}$Ru and $^{96}$Zr nuclei. We analyze \\RuRu and \\ZrZr collisions at\na center-of-mass energy of $\\sqrt{\\textit{s}_{NN}}$ = 200~GeV. Our analysis\ndemonstrates that the eccentricity $\\varepsilon_1$, $\\mathrm{v^{even}_{1}}$ and\n$\\mathrm{K}$ exhibit subtle yet discernible sensitivity to the input nuclear\nstructure distinctions between $^{96}$Ru and $^{96}$Zr isobars. This\nobservation suggests that measuring $v^{\\rm even}_{1}$ and the GMC parameter in\nthese isobaric collisions could serve as a means to fine-tune the comprehension\nof their nuclear structure disparities and offer insights to enhance the\ninitial condition assumptions of theoretical models.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:39:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Magdy","Niseem",""],["Lacey","Roy",""]]}
{"id":"2308.11032","submitter":"Prabh Simran Baweja","authors":"Prabh Simran Singh Baweja, Orathai Sangpetch, Akkarit Sangpetch","title":"AI For Fraud Awareness","comments":"Technical Report published at CMKL University in 2020","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In today's world, with the rise of numerous social platforms, it has become\nrelatively easy for anyone to spread false information and lure people into\ntraps. Fraudulent schemes and traps are growing rapidly in the investment\nworld. Due to this, countries and individuals face huge financial risks. We\npresent an awareness system with the use of machine learning and gamification\ntechniques to educate the people about investment scams and traps. Our system\napplies machine learning techniques to provide a personalized learning\nexperience to the user. The system chooses distinct game-design elements and\nscams from the knowledge pool crafted by domain experts for each individual.\nThe objective of the research project is to reduce inequalities in all\ncountries by educating investors via Active Learning. Our goal is to assist the\nregulators in assuring a conducive environment for a fair, efficient, and\ninclusive capital market. In the paper, we discuss the impact of the problem,\nprovide implementation details, and showcase the potentiality of the system\nthrough preliminary experiments and results.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 05:45:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Baweja","Prabh Simran Singh",""],["Sangpetch","Orathai",""],["Sangpetch","Akkarit",""]]}
{"id":"2308.11034","submitter":"Jiaqi Wen","authors":"Jiaqi Wen, Bogdan Gabrys, Katarzyna Musial","title":"Digital Twin-Oriented Complex Networked Systems based on Heterogeneous\n  node features and interaction rules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study proposes an extendable modelling framework for Digital\nTwin-Oriented Complex Networked Systems (DT-CNSs) with a goal of generating\nnetworks that faithfully represent real systems. Modelling process focuses on\n(i) features of nodes and (ii) interaction rules for creating connections that\nare built based on individual node's preferences. We conduct experiments on\nsimulation-based DT-CNSs that incorporate various features and rules about\nnetwork growth and different transmissibilities related to an epidemic spread\non these networks. We present a case study on disaster resilience of social\nnetworks given an epidemic outbreak by investigating the infection occurrence\nwithin specific time and social distance. The experimental results show how\ndifferent levels of the structural and dynamics complexities, concerned with\nfeature diversity and flexibility of interaction rules respectively, influence\nnetwork growth and epidemic spread. The analysis revealed that, to achieve\nmaximum disaster resilience, mitigation policies should be targeted at nodes\nwith preferred features as they have higher infection risks and should be the\nfocus of the epidemic control.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:54:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wen","Jiaqi",""],["Gabrys","Bogdan",""],["Musial","Katarzyna",""]]}
{"id":"2308.11035","submitter":"Aleczander Herczeg","authors":"Aleczander Herczeg and Jason Jackiewicz","title":"Inferring the Solar Meridional Circulation Flow Profile by Applying\n  Bayesian Methods to Time-distance Helioseismology","comments":"20 pages, 14 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mapping the large-scale subsurface plasma flow profile within the Sun has\nbeen attempted using various methods for several decades. One such flow in\nparticular is the meridional circulation, for which numerous studies have been\npublished. However, such studies often show disagreement in structure. In an\neffort to constrain the flow profile from the data, a Bayesian Markov chain\nMonte Carlo framework has been developed to take advantage of the advances in\ncomputing power that allow for the efficient exploration of high-dimensional\nparameter spaces. This study utilizes helioseismic travel-time difference data\ncovering a span of twenty-one years and a parametrized model of the meridional\ncirculation to find the most likely flow profiles. Tests were carried out on\nartificial data to determine the ability of this method to recover expected\nsolar-like flow profiles as well as a few extreme cases. We find the method\ncapable of recovering the input flows of both single- and double-cell flow\nstructures. Some inversion results indicate potential differences in meridional\ncirculation between the two solar cycles in terms of both magnitude and\nmorphology, in particular in the mid convection zone. Of these, the most likely\nsolutions show that solar cycle 23 has a large, single-celled profile, while\ncycle 24 shows weaker flows in general and hints towards a double-celled\nstructure.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:42:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Herczeg","Aleczander",""],["Jackiewicz","Jason",""]]}
{"id":"2308.11036","submitter":"M. White","authors":"M White (1), J Makara (1), S Ranpariya (1), L Pei (1), M Barba (1), J\n  Subedi (1), J Dong (1), B Hansen (1), A E T Akintola (1), (2), J Holzbauer\n  (1), J Ozelis (1), S Chandrasekaran (1), V Roger (1) ((1) Fermi National\n  Accelerator Laboratory, (2) STFC Daresbury Laboratory)","title":"Installation, commissioning, and testing of the HB650 CM at PIP2IT","comments":"2023 Cryogenic Engineering Conference and International Cryogenic\n  Materials Conference (CEC/ICMC)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-359-TD","categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Proton Improvement Plan-II (PIP-II) is a major upgrade to the Fermilab\naccelerator complex, featuring a new 800-MeV Superconducting Radio-Frequency\n(SRF) linear accelerator (LINAC) powering the accelerator complex to provide\nthe world's most intense high-energy neutrino beam. This paper describes the\nconversion of the PIP-II Injector Test Facility (PIP2IT) cryogenic system into\na test stand for PIP-II High-Beta 650 MHz (HB650) cryomodules at Fermilab's\nCryomodule Test Facility (CMTF). A description of the associated mechanical,\nelectrical, and controls modifications necessary for testing HB650 cryomodules\nare provided. The cooldown and warmup requirements, procedures and associated\ncontrols logic is described.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:49:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["White","M",""],["Makara","J",""],["Ranpariya","S",""],["Pei","L",""],["Barba","M",""],["Subedi","J",""],["Dong","J",""],["Hansen","B",""],["Akintola","A E T",""],["Holzbauer","J",""],["Ozelis","J",""],["Chandrasekaran","S",""],["Roger","V",""]]}
{"id":"2308.11037","submitter":"Chaegeun Song","authors":"Chaegeun Song, Bing Li","title":"On Exact Bayesian Credible Sets for Classification and Pattern\n  Recognition","comments":"16 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current definition of a Bayesian credible set cannot, in general, achieve\nan arbitrarily preassigned credible level. This drawback is particularly acute\nfor classification problems, where there are only a finite number of achievable\ncredible levels. As a result, there is as of today no general way to construct\nan exact credible set for classification. In this paper, we introduce a\ngeneralized credible set that can achieve any preassigned credible level. The\nkey insight is a simple connection between the Bayesian highest posterior\ndensity credible set and the Neyman--Pearson lemma, which, as far as we know,\nhasn't been noticed before. Using this connection, we introduce a randomized\ndecision rule to fill the gaps among the discrete credible levels. Accompanying\nthis methodology, we also develop the Steering Wheel Plot to represent the\ncredible set, which is useful in visualizing the uncertainty in classification.\nBy developing the exact credible set for discrete parameters, we make the\ntheory of Bayesian inference more complete.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:50:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Song","Chaegeun",""],["Li","Bing",""]]}
{"id":"2308.11038","submitter":"Muhammad Abdul Rahman","authors":"Muhammad Abdul Rahman and Muhammad Aamir Basheer and Zubair Khalid and\n  Muhammad Tahir and Momin Uppal","title":"Logistics Hub Location Optimization: A K-Means and P-Median Model Hybrid\n  Approach Using Road Network Distances","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Logistic hubs play a pivotal role in the last-mile delivery distance; even a\nslight increment in distance negatively impacts the business of the e-commerce\nindustry while also increasing its carbon footprint. The growth of this\nindustry, particularly after Covid-19, has further intensified the need for\noptimized allocation of resources in an urban environment. In this study, we\nuse a hybrid approach to optimize the placement of logistic hubs. The approach\nsequentially employs different techniques. Initially, delivery points are\nclustered using K-Means in relation to their spatial locations. The clustering\nmethod utilizes road network distances as opposed to Euclidean distances.\nNon-road network-based approaches have been avoided since they lead to\nerroneous and misleading results. Finally, hubs are located using the P-Median\nmethod. The P-Median method also incorporates the number of deliveries and\npopulation as weights. Real-world delivery data from Muller and Phipps (M&P) is\nused to demonstrate the effectiveness of the approach. Serving deliveries from\nthe optimal hub locations results in the saving of 815 (10%) meters per\ndelivery.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 10:28:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rahman","Muhammad Abdul",""],["Basheer","Muhammad Aamir",""],["Khalid","Zubair",""],["Tahir","Muhammad",""],["Uppal","Momin",""]]}
{"id":"2308.11039","submitter":"Gabriel Ballot","authors":"Gabriel Ballot, Vadim Malvone, Jean Leneutre, Youssef Laarouchi","title":"Capacity ATL","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Model checking strategic abilities was successfully developed and applied\nsince the early 2000s to ensure properties in Multi-Agent System. In this\npaper, we introduce the notion of capacities giving different abilities to an\nagent. This applies naturally to systems where multiple entities can play the\nsame role in the game, such as different client versions in protocol analysis,\ndifferent robots in heterogeneous fleets, different personality traits in\nsocial structure modeling, or different attacker profiles in a cybersecurity\nsetting. With the capacity of other agents being unknown at the beginning of\nthe game, the longstanding problems of imperfect information arise. Our\ncontribution is the following: (i) we define a new class of concurrent game\nstructures where the agents have different capacities that modify their action\nlist and (ii) we introduce a logic extending Alternating-time Temporal Logic to\nreason about these games.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 20:51:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ballot","Gabriel",""],["Malvone","Vadim",""],["Leneutre","Jean",""],["Laarouchi","Youssef",""]]}
{"id":"2308.11040","submitter":"Leda Gao","authors":"Leda Gao, Paul R. Anderson, Robert S. Link","title":"Backreaction and order reduction in initially contracting models of the\n  universe","comments":"58 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The semiclassical backreaction equations are solved in closed\nRobertson-Walker spacetimes containing a positive cosmological constant and a\nconformally coupled massive scalar field. Renormalization of the stress-energy\ntensor results in higher derivative terms that can lead to solutions that vary\non much shorter time scales than the solutions that would occur if the higher\nderivative terms were not present. These extra solutions can be eliminated\nthrough the use of order reduction. Four different methods of order reduction\nare investigated. These are first applied to the case when only conformally\ninvariant fields, with and without classical radiation, are present. Then they\nare applied to the massive conformally coupled scalar field. The effects of\ndifferent adiabatic vacuum states for the massive field are considered. It is\nfound that if enough particles are produced, then the Universe collapses to a\nfinal singularity. Otherwise it undergoes a bounce, but at a smaller value of\nthe scale factor (for the models considered) than occurs for the classical de\nSitter solution. The stress-energy tensor incorporates both particle production\nand vacuum polarization effects. An analysis of the energy density of the\nmassive field is done to determine when the contribution from the particles\ndominates.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:01:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Leda",""],["Anderson","Paul R.",""],["Link","Robert S.",""]]}
{"id":"2308.11041","submitter":"Matthew Ritch","authors":"Matthew Ritch and Charles Copley","title":"Bayesian Prevalence Estimation from Pooled and Individual Data","comments":"19 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME q-bio.QM stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pooled and individual disease testing are common methods for determining the\npopulation prevalences of diseases. Recently, researchers have used Monte Carlo\nMarkov Chain methods to estimate population prevalence from the combined\nstreams of these two types of testing data. We propose an analytical solution\nfor estimating population prevalence from combined individual and pooled binary\nsampling data. We also use simulated sampling data to characterize these\nposterior distributions under a variety of sampling conditions, including a\nrange of true prevalences, variable numbers of pooled and individual tests,\nvariable number of individual samples per pooled sample, and a range of values\nfor test sensitivity and specificity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:02:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ritch","Matthew",""],["Copley","Charles",""]]}
{"id":"2308.11042","submitter":"Amisha Srivastava","authors":"Xingyu Meng, Amisha Srivastava, Ayush Arunachalam, Avik Ray, Pedro\n  Henrique Silva, Rafail Psiakis, Yiorgos Makris, Kanad Basu","title":"Unlocking Hardware Security Assurance: The Potential of LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  System-on-Chips (SoCs) form the crux of modern computing systems. SoCs enable\nhigh-level integration through the utilization of multiple Intellectual\nProperty (IP) cores. However, the integration of multiple IP cores also\npresents unique challenges owing to their inherent vulnerabilities, thereby\ncompromising the security of the entire system. Hence, it is imperative to\nperform hardware security validation to address these concerns. The efficiency\nof this validation procedure is contingent on the quality of the SoC security\nproperties provided. However, generating security properties with traditional\napproaches often requires expert intervention and is limited to a few IPs,\nthereby resulting in a time-consuming and non-robust process. To address this\nissue, we, for the first time, propose a novel and automated Natural Language\nProcessing (NLP)-based Security Property Generator (NSPG). Specifically, our\napproach utilizes hardware documentation in order to propose the first hardware\nsecurity-specific language model, HS-BERT, for extracting security properties\ndedicated to hardware design. To evaluate our proposed technique, we trained\nthe HS-BERT model using sentences from RISC-V, OpenRISC, MIPS, OpenSPARC, and\nOpenTitan SoC documentation. When assessedb on five untrained OpenTitan\nhardware IP documents, NSPG was able to extract 326 security properties from\n1723 sentences. This, in turn, aided in identifying eight security bugs in the\nOpenTitan SoC design presented in the hardware hacking competition, Hack@DAC\n2022.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:05:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Meng","Xingyu",""],["Srivastava","Amisha",""],["Arunachalam","Ayush",""],["Ray","Avik",""],["Silva","Pedro Henrique",""],["Psiakis","Rafail",""],["Makris","Yiorgos",""],["Basu","Kanad",""]]}
{"id":"2308.11043","submitter":"Gautam Sreekumar","authors":"Gautam Sreekumar and Vishnu Naresh Boddeti","title":"Spurious Correlations and Where to Find Them","comments":"2nd Workshop on SCIS, ICML 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spurious correlations occur when a model learns unreliable features from the\ndata and are a well-known drawback of data-driven learning. Although there are\nseveral algorithms proposed to mitigate it, we are yet to jointly derive the\nindicators of spurious correlations. As a result, the solutions built upon\nstandalone hypotheses fail to beat simple ERM baselines. We collect some of the\ncommonly studied hypotheses behind the occurrence of spurious correlations and\ninvestigate their influence on standard ERM baselines using synthetic datasets\ngenerated from causal graphs. Subsequently, we observe patterns connecting\nthese hypotheses and model design choices.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:06:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sreekumar","Gautam",""],["Boddeti","Vishnu Naresh",""]]}
{"id":"2308.11044","submitter":"Anna Nickolaevna Morozovska","authors":"Eugene A. Eliseev, Anna N. Morozovska, Sergei V. Kalinin, and Dean R.\n  Evans","title":"Strain-Induced Polarization Enhancement in BaTiO$_3$ Core-Shell\n  Nanoparticles","comments":"34 pages, including 5 figures and 1 Appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite fascinating experimental results, the influence of defects and\nelastic strains on the physical state of nanosized ferroelectrics is still\npoorly explored theoretically. One of unresolved theoretical problems is the\nanalytical description of the strongly enhanced spontaneous polarization,\npiezoelectric response, and dielectric properties of ferroelectric oxide thin\nfilms and core-shell nanoparticles induced by elastic strains and stresses. In\nparticular, the 10-nm quasi-spherical BaTiO3 core-shell nanoparticles reveal a\ngiant spontaneous polarization up to 130 mu_C/cm2, where the physical origin is\na large Ti off-centering. The available theoretical description cannot explain\nthe giant spontaneous polarization observed in these spherical nanoparticles.\nThis work analyzes polar properties of BaTiO3 core-shell spherical\nnanoparticles using the Landau-Ginzburg-Devonshire approach, which considers\nthe nonlinear electrostriction coupling and large Vegard strains in the shell.\nWe reveal that a spontaneous polarization greater than 50 mu_C/cm2 can be\nstable in a (10-100) nm BaTiO3 core at room temperature, where a 5 nm\nparaelectric shell is stretched by (3-6)% due to Vegard strains, which\ncontribute to the elastic mismatch at the core-shell interface. The\npolarization value 50 mu_C/cm2 corresponds to high tetragonality ratios (1.02 -\n1.04), which is further increased up to 100 mu_C/cm2 by higher Vegard strains\nand/or intrinsic surface stresses leading to unphysically high tetragonality\nratios (1.08 - 1.16). The nonlinear electrostriction coupling and the elastic\nmismatch at the core-shell interface are key physical factors of the\nspontaneous polarization enhancement in the core. Doping with the\nhighly-polarized core-shell nanoparticles can be useful in optoelectronics and\nnonlinear optics, electric field enhancement, reduced switching voltages,\ncatalysis, and electrocaloric nanocoolers.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:08:14 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 23:10:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Eliseev","Eugene A.",""],["Morozovska","Anna N.",""],["Kalinin","Sergei V.",""],["Evans","Dean R.",""]]}
{"id":"2308.11045","submitter":"A Martinez","authors":"A Martinez (1), J Creus Prats (1), W Soyars (1), R Dhuley (1), B\n  Hansen (1), Y Jia (1), A Chakravarty (2), M Goyal (2), T Banaszkiewicz (3), P\n  Duda (3), M Stanclik (3) ((1) Fermi National Accelerator Laboratory, (2)\n  Bhabha Atomic Research Center Trombay, (3) Wroclaw University of Science and\n  Technology)","title":"Warm Compressor system Overview and status of the PIP-II cryogenic\n  system","comments":"2023 Cryogenic Engineering Conference and International Cryogenic\n  Materials Conference (CEC/ICMC)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-350-TD","categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Proton Improvement Plan-II (PIP-II) is a major upgrade to the Fermilab\naccelerator complex, featuring a new 800-MeV Superconducting Radio-Frequency\n(SRF) linear accelerator (Linac) powering the accelerator complex to provide\nthe world's most intense high-energy neutrino beam. The PIP-II Linac consists\nof 23 SRF cryomodules operating at 2 K, 5 K, and 40 K temperature levels\nsupplied by a single helium cryoplant providing 2.5 kW of cooling capacity at\n2.0 K. The PIP-II cryogenic system consists of two major systems: a helium\ncryogenic plant and a cryogenic distribution system. The cryogenic plant\nincludes a refrigerator cold box, a warm compressor system, and helium storage,\nrecovery, and purification systems. The cryogenic distribution system includes\na distribution box, intermediate transfer line, and a tunnel transfer line\nconsisting of modular bayonet cans which supply and return cryogens to the\ncryomodules. A turnaround can is located at the end of the Linac to turnaround\ncryogenic flows. This paper describes the layout, design, and current status of\nthe PIP-II cryogenic system.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:12:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Martinez","A",""],["Prats","J Creus",""],["Soyars","W",""],["Dhuley","R",""],["Hansen","B",""],["Jia","Y",""],["Chakravarty","A",""],["Goyal","M",""],["Banaszkiewicz","T",""],["Duda","P",""],["Stanclik","M",""]]}
{"id":"2308.11046","submitter":"Oleg Kechkin","authors":"Oleg V. Kechkin","title":"Kink in dual dilaton-axion theories with potential","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The representation in terms of Ernst's complex potential is used to describe\nand analyze dilaton-axion theories with potential. The set of such systems is\ndivided into pairs of dual systems with respect to the inversion of the Ernst\npotential. Using duality, a theory is constructed that is invariant with\nrespect to the nonlinear Ehlers transformation. For this theory, a soliton\nsolution is obtained that is dual to a dilaton kink in a system that is\ninvariant with respect to the axion shift transformation.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:13:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kechkin","Oleg V.",""]]}
{"id":"2308.11047","submitter":"Abhijeet Parida","authors":"Abhijeet Parida, Zhifan Jiang, Syed Muhammad Anwar, Nicholas Foreman,\n  Nicholas Stence, Michael J. Fisher, Roger J. Packer, Robert A. Avery, and\n  Marius George Linguraru","title":"Harmonization Across Imaging Locations(HAIL): One-Shot Learning for\n  Brain MRI","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  For machine learning-based prognosis and diagnosis of rare diseases, such as\npediatric brain tumors, it is necessary to gather medical imaging data from\nmultiple clinical sites that may use different devices and protocols. Deep\nlearning-driven harmonization of radiologic images relies on generative\nadversarial networks (GANs). However, GANs notoriously generate pseudo\nstructures that do not exist in the original training data, a phenomenon known\nas \"hallucination\". To prevent hallucination in medical imaging, such as\nmagnetic resonance images (MRI) of the brain, we propose a one-shot learning\nmethod where we utilize neural style transfer for harmonization. At test time,\nthe method uses one image from a clinical site to generate an image that\nmatches the intensity scale of the collaborating sites. Our approach combines\nlearning a feature extractor, neural style transfer, and adaptive instance\nnormalization. We further propose a novel strategy to evaluate the\neffectiveness of image harmonization approaches with evaluation metrics that\nboth measure image style harmonization and assess the preservation of\nanatomical structures. Experimental results demonstrate the effectiveness of\nour method in preserving patient anatomy while adjusting the image intensities\nto a new clinical site. Our general harmonization model can be used on unseen\ndata from new sites, making it a valuable tool for real-world medical\napplications and clinical trials.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:13:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Parida","Abhijeet",""],["Jiang","Zhifan",""],["Anwar","Syed Muhammad",""],["Foreman","Nicholas",""],["Stence","Nicholas",""],["Fisher","Michael J.",""],["Packer","Roger J.",""],["Avery","Robert A.",""],["Linguraru","Marius George",""]]}
{"id":"2308.11048","submitter":"Aditya Rajagopal","authors":"Aditya Rajagopal, Diederik Adriaan Vink, Jianyi Cheng, Yann Herklotz","title":"GSA to HDL: Towards principled generation of dynamically scheduled\n  circuits","comments":"Presented at the 19th International Summer School on Advanced\n  Computer Architecture and Compilation for High-performance Embedded Systems\n  (ACACES 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  High-level synthesis (HLS) refers to the automatic translation of a software\nprogram written in a high-level language into a hardware design. Modern HLS\ntools have moved away from the traditional approach of static (compile time)\nscheduling of operations to generating dynamic circuits that schedule\noperations at run time. Such circuits trade-off area utilisation for increased\ndynamism and throughput. However, existing lowering flows in dynamically\nscheduled HLS tools rely on conservative assumptions on their input program due\nto both the intermediate representations (IR) utilised as well as the lack of\nformal specifications on the translation into hardware. These assumptions cause\nsuboptimal hardware performance. In this work, we lift these assumptions by\nproposing a new and efficient abstraction for hardware mapping; namely h-GSA,\nan extension of the Gated Single Static Assignment (GSA) IR. Using this\nabstraction, we propose a lowering flow that transforms GSA into h-GSA and maps\nh-GSA into dynamically scheduled hardware circuits. We compare the schedules\ngenerated by our approach to those by the state-of-the-art dynamic-scheduling\nHLS tool, Dynamatic, and illustrate the potential performance improvement from\nhardware mapping using the proposed abstraction.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:19:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rajagopal","Aditya",""],["Vink","Diederik Adriaan",""],["Cheng","Jianyi",""],["Herklotz","Yann",""]]}
{"id":"2308.11049","submitter":"Saeed Fakhry","authors":"Saeed Fakhry","title":"Primordial Black Hole Merger Rate in $f(R)$ Gravity","comments":"17 pages, 11 figures, references added","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Primordial black holes (PBHs) are known as one of the potential candidates\nfor dark matter. They are expected to have formed due to the direct\ngravitational collapse of density fluctuations in the early Universe.\nTherefore, the study of the merger rate of PBHs in modified theories of gravity\ncan provide more detailed information about their abundance. In this work, we\ndelve into the calculation of the merger rate of PBHs within the theoretical\nframework of $f(R)$ gravity. Our analysis reveals an enhancement in the merger\nrate of PBHs compared to that obtained from general relativity (GR).\nAdditionally, modulating the field strength $f_{R0}$ induces shifts in the PBH\nmerger rate, presenting a potential observational signature of modified\ngravity. We also find that the total merger rate of PBHs will be consistent\nwith the merger rate of black holes estimated by the Laser Interferometer\nGravitational-Wave Observatory (LIGO)-Virgo-KAGRA detectors if $f_{PBH}\\gtrsim\n0.1$. While further improvements might be required, relative enhancement of the\nmerger rate of PBHs in the framework of $f(R)$ gravity and its consistency with\ngravitational wave data underscore the importance of employing modified\ntheories of gravity to examine diverse scenarios related to the formation of\nblack holes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:20:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fakhry","Saeed",""]]}
{"id":"2308.11050","submitter":"Nicholas Charles Landolfi","authors":"Nicholas C. Landolfi and Sanjay Lall","title":"Optimal Dorfman Group Testing For Symmetric Distributions","comments":"20 pages w/o references, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP math.PR stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study Dorfman's classical group testing protocol in a novel setting where\nindividual specimen statuses are modeled as exchangeable random variables. We\nare motivated by infectious disease screening. In that case, specimens which\narrive together for testing often originate from the same community and so\ntheir statuses may exhibit positive correlation. Dorfman's protocol screens a\npopulation of n specimens for a binary trait by partitioning it into\nnonoverlapping groups, testing these, and only individually retesting the\nspecimens of each positive group. The partition is chosen to minimize the\nexpected number of tests under a probabilistic model of specimen statuses. We\nrelax the typical assumption that these are independent and indentically\ndistributed and instead model them as exchangeable random variables. In this\ncase, their joint distribution is symmetric in the sense that it is invariant\nunder permutations. We give a characterization of such distributions in terms\nof a function q where q(h) is the marginal probability that any group of size h\ntests negative. We use this interpretable representation to show that the set\npartitioning problem arising in Dorfman's protocol can be reduced to an integer\npartitioning problem and efficiently solved. We apply these tools to an\nempirical dataset from the COVID-19 pandemic. The methodology helps explain the\nunexpectedly high empirical efficiency reported by the original investigators.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:29:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Landolfi","Nicholas C.",""],["Lall","Sanjay",""]]}
{"id":"2308.11051","submitter":"Mikkie Musser","authors":"Christopher D. Carone and Mikkie R. Musser","title":"Note on scattering in asymptotically nonlocal theories","comments":"16 pages LaTeX, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is possible to formulate theories with many Lee-Wick particles such that a\nlimit exists where the low-energy theory approaches the form of a ghost-free\nnonlocal theory. Such asymptotically nonlocal quantum field theories have a\nderived regulator scale that is hierarchically smaller than the lightest\nLee-Wick resonance; this has been studied previously in the case of\nasymptotically nonlocal scalar theories, Abelian and non-Abelian gauge\ntheories, and linearized gravity. Here we consider the dependence on\ncenter-of-mass energy of scattering cross sections in these theories. While\nLee-Wick resonances can be decoupled from the low-energy theory, scattering\namplitudes nonetheless reflect the emergent nonlocality at the scale where the\nquadratic divergences are regulated. This implies observable consequences in\ntheories designed to address the hierarchy problem, even when the Lee-Wick\nresonances are not directly accessible.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:30:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Carone","Christopher D.",""],["Musser","Mikkie R.",""]]}
{"id":"2308.11052","submitter":"M. Maruf","authors":"M. Maruf, Arka Daw, Amartya Dutta, Jie Bu, Anuj Karpatne","title":"Beyond Discriminative Regions: Saliency Maps as Alternatives to CAMs for\n  Weakly Supervised Semantic Segmentation","comments":"24 pages, 13 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, several Weakly Supervised Semantic Segmentation (WS3)\nmethods have been proposed that use class activation maps (CAMs) generated by a\nclassifier to produce pseudo-ground truths for training segmentation models.\nWhile CAMs are good at highlighting discriminative regions (DR) of an image,\nthey are known to disregard regions of the object that do not contribute to the\nclassifier's prediction, termed non-discriminative regions (NDR). In contrast,\nattribution methods such as saliency maps provide an alternative approach for\nassigning a score to every pixel based on its contribution to the\nclassification prediction. This paper provides a comprehensive comparison\nbetween saliencies and CAMs for WS3. Our study includes multiple perspectives\non understanding their similarities and dissimilarities. Moreover, we provide\nnew evaluation metrics that perform a comprehensive assessment of WS3\nperformance of alternative methods w.r.t. CAMs. We demonstrate the\neffectiveness of saliencies in addressing the limitation of CAMs through our\nempirical studies on benchmark datasets. Furthermore, we propose random\ncropping as a stochastic aggregation technique that improves the performance of\nsaliency, making it a strong alternative to CAM for WS3.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:30:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Maruf","M.",""],["Daw","Arka",""],["Dutta","Amartya",""],["Bu","Jie",""],["Karpatne","Anuj",""]]}
{"id":"2308.11053","submitter":"Hangting Chen","authors":"Hangting Chen, Jianwei Yu, Yi Luo, Rongzhi Gu, Weihua Li, Zhuocheng\n  Lu, Chao Weng","title":"Ultra Dual-Path Compression For Joint Echo Cancellation And Noise\n  Suppression","comments":"Accepted by Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Echo cancellation and noise reduction are essential for full-duplex\ncommunication, yet most existing neural networks have high computational costs\nand are inflexible in tuning model complexity. In this paper, we introduce\ntime-frequency dual-path compression to achieve a wide range of compression\nratios on computational cost. Specifically, for frequency compression,\ntrainable filters are used to replace manually designed filters for dimension\nreduction. For time compression, only using frame skipped prediction causes\nlarge performance degradation, which can be alleviated by a post-processing\nnetwork with full sequence modeling. We have found that under fixed compression\nratios, dual-path compression combining both the time and frequency methods\nwill give further performance improvement, covering compression ratios from 4x\nto 32x with little model size change. Moreover, the proposed models show\ncompetitive performance compared with fast FullSubNet and DeepFilterNet. A demo\npage can be found at\nhangtingchen.github.io/ultra_dual_path_compression.github.io/.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:36:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Hangting",""],["Yu","Jianwei",""],["Luo","Yi",""],["Gu","Rongzhi",""],["Li","Weihua",""],["Lu","Zhuocheng",""],["Weng","Chao",""]]}
{"id":"2308.11054","submitter":"Sufei Shi","authors":"Zhen Lian, Dongxue Chen, Yuze Meng, Xiaotong Chen, Ying Su, Rounak\n  Banerjee, Takashi Taniguchi, Kenji Watanabe, Sefaattin Tongay, Chuanwei\n  Zhang, Yong-Tao Cui, Su-Fei Shi","title":"Exciton Superposition across Moir\\'e States in a Semiconducting Moir\\'e\n  Superlattice","comments":null,"journal-ref":"Nature Communications 14, 5042 (2023)","doi":"10.1038/s41467-023-40783-z","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Moir\\'e superlattices of semiconducting transition metal dichalcogenides\n(TMDCs) enable unprecedented spatial control of electron wavefunctions in an\nartificial lattice with periodicities more than ten times larger than that of\natomic crystals, leading to emerging quantum states with fascinating electronic\nand optical properties. The breaking of translational symmetry further\nintroduces a new degree of freedom inside each moir\\'e unit cell: high symmetry\npoints of energy minima called moir\\'e sites, behaving as spatially separated\nquantum dots. The superposition of a quasiparticle wavefunction between\ndifferent moir\\'e sites will enable a new platform for quantum information\nprocessing but is hindered by the suppressed electron tunneling between moir\\'e\nsites. Here we demonstrate the superposition between two moir\\'e sites by\nconstructing an angle-aligned trilayer WSe2/monolayer WS2 moir\\'e\nheterojunction. The two moir\\'e sites with energy minimum allow the formation\nof two different interlayer excitons, with the hole residing in either moir\\'e\nsite of the first WSe2 layer interfacing the WS2 layer and the electron in the\nthird WSe2 layer. An external electric field can drive the hybridization of\neither of the interlayer excitons with the intralayer excitons in the third\nWSe2 layer, realizing the continuous tuning of interlayer exciton hopping\nbetween two moir\\'e sites. Therefore, a superposition of the two interlayer\nexcitons localized at different moir\\'e sites can be realized, which can be\nresolved in the electric-field-dependent optical reflectance spectra,\ndistinctly different from that of the natural trilayer WSe2 in which the\nmoir\\'e modulation is absent. Our study illustrates a strategy of harnessing\nthe new moir\\'e site degree of freedom for quantum information science, a new\ndirection of twistronics.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:39:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lian","Zhen",""],["Chen","Dongxue",""],["Meng","Yuze",""],["Chen","Xiaotong",""],["Su","Ying",""],["Banerjee","Rounak",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Tongay","Sefaattin",""],["Zhang","Chuanwei",""],["Cui","Yong-Tao",""],["Shi","Su-Fei",""]]}
{"id":"2308.11055","submitter":"Ritesh Patel","authors":"Ritesh Patel, Matthew J. West, Daniel B. Seaton, Phillip Hess, Tatiana\n  Niembro, Katharine K. Reeves","title":"The Closest View of a Fast Coronal Mass Ejection: How Faulty Assumptions\n  near Perihelion Lead to Unrealistic Interpretations of PSP/WISPR Observations","comments":"13 Pages, 6 Figures; Accepted in The Astrophysical Journal Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the closest view of a coronal mass ejection observed by the\nParker Solar Probe (PSP)/Wide-field Imager for {Parker} Solar PRobe (WISPR)\ninstrument on September 05, 2022, when PSP was traversing from a distance of\n15.3~to~13.5~R$_\\odot$ from the Sun. The CME leading edge and an arc-shaped\n{\\emph{concave-up} structure near the core} was tracked in WISPR~field of view\nusing the polar coordinate system, for the first time. Using the impact\ndistance on Thomson surface, we measured average speeds of CME leading edge and\nconcave-up structure as $\\approx$2500~$\\pm$~270\\,km\\,s$^{-1}$ and\n$\\approx$400~$\\pm$~70\\,km\\,s$^{-1}$ with a deceleration of\n$\\approx$20~m~s$^{-2}$ for the later. {The use of the plane-of-sky approach\nyielded an unrealistic speed of more than three times of this estimate.} We\nalso used single viewpoint STEREO/COR-2A images to fit the Graduated\nCylindrical Shell (GCS) model to the CME while incorporating the source region\nlocation from EUI of Solar Orbiter and estimated a 3D speed of\n$\\approx$2700\\,km\\,s$^{-1}$. We conclude that this CME exhibits the highest\nspeed during the ascending phase of solar cycle 25. This places it in the\ncategory of extreme speed CMEs, which account for only 0.15\\% of all CMEs\nlisted in the CDAW CME catalog.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:42:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Patel","Ritesh",""],["West","Matthew J.",""],["Seaton","Daniel B.",""],["Hess","Phillip",""],["Niembro","Tatiana",""],["Reeves","Katharine K.",""]]}
{"id":"2308.11056","submitter":"Hande Tun\\c{c}el G\\\"olpek","authors":"Hande Tuncel Golpek and Aysun Aytac","title":"Closeness and Residual Closeness of Harary Graphs","comments":"21 pages preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analysis of a network in terms of vulnerability is one of the most\nsignificant problems. Graph theory serves as a valuable tool for solving\ncomplex network problems, and there exist numerous graph-theoretic parameters\nto analyze the system's stability. Among these parameters, the closeness\nparameter stands out as one of the most commonly used vulnerability metric. Its\ndefinition has evolved over time to enhance ease of formulation and\napplicability to disconnected structures. Furthermore, based on the closeness\nparameter, residual closeness, which is a newer and more sensitive parameter\ncompared to other existing parameters, has been introduced as a new graph\nvulnerability index by Dangalchev. In this study, the outcomes of the closeness\nand residual closeness parameters in Harary Graphs have been examined. Harary\nGraphs are well-known constructs that are distinguished by having $n$ vertices\nthat are $k$-connected with the least possible number of edges.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:52:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Golpek","Hande Tuncel",""],["Aytac","Aysun",""]]}
{"id":"2308.11057","submitter":"R David Mayrhofer","authors":"R. David Mayrhofer and Andrey V. Chubukov","title":"Nonanalytic Corrections to the Landau Diamagnetic Susceptibility","comments":"21 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze potential non-analytic terms in the Landau diamagnetic\nsusceptibility, $\\chi_{dia}$, at a finite temperature $T$ and/or finite\nmagnetic field $H$. To do this, we express the diamagnetic susceptibility as\n$\\chi_{dia} = (e/c)^2 \\lim_{Q\\rightarrow0} \\Pi^{JJ}_\\perp (Q)/Q^2$, where\n$\\Pi^{JJ}_\\perp$ is the transverse component of the static current-current\ncorrelator, and evaluate $\\Pi^{JJ}_\\perp (Q)$ for a system of fermions with\nHubbard interaction to second order in Hubbard $U$ by combining self energy,\nMaki-Thompson, and Aslamazov-Larkin diagrams. We find that at $T=H=0$, the\nexpansion of $\\Pi^{JJ}_\\perp (Q)/Q^2$ in $U$ is regular, but at a finite $T$\nand/or $H$, it contains $U^2 T$ and/or $U^2 |H|$ terms. Similar terms have been\npreviously found for the paramagnetic Pauli susceptibility. We obtain the full\nexpression for the non-analytic $\\delta \\chi_{dia} (H,T)$ when both $T$ and $H$\nare finite, and show that the $H/T$ dependence is similar to that for the Pauli\nsusceptibility.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:55:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mayrhofer","R. David",""],["Chubukov","Andrey V.",""]]}
{"id":"2308.11058","submitter":"David Jekel","authors":"David Jekel","title":"Optimal transport for types and convex analysis for definable predicates\n  in tracial $\\mathrm{W}^*$-algebras","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.LO math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the connections between continuous model theory, free\nprobability, and optimal transport/convex analysis in the context of tracial\nvon Neumann algebras. In particular, we give an analog of Monge-Kantorovich\nduality for optimal couplings where the role of probability distributions on\n$\\mathbb{C}^n$ is played by model-theoretic types, the role of real-valued\ncontinuous functions is played by definable predicates, and the role of\ncontinuous function $\\mathbb{C}^n \\to \\mathbb{C}^n$ is played by definable\nfunctions. In the process, we also advance the understanding of definable\npredicates and definable functions by showing that all definable predicates can\nbe approximated by \"$C^1$ definable predicates\" whose gradients are definable\nfunctions. As a consequence, we show that every element in the definable\nclosure of $\\mathrm{W}^*(x_1,\\dots,x_n)$ can be expressed as a definable\nfunction of $(x_1,\\dots,x_n)$. We give several classes of examples showing that\ndefinable closure can be much larger than $\\mathrm{W}^*(x_1,\\dots,x_n)$ in\ngeneral.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:00:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jekel","David",""]]}
{"id":"2308.11059","submitter":"David Nesvorny","authors":"David Nesvorny, Pedro Bernardinelli, David Vokrouhlicky, Konstantin\n  Batygin","title":"Radial Distribution of Distant Trans-Neptunian Objects Points to Sun's\n  Formation in a Stellar Cluster","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Scattered Disk Objects (SDOs) are a population of trans-Neptunian bodies\nwith semimajor axes $50< a \\lesssim 1000$ au and perihelion distances $q\n\\gtrsim 30$ au. The detached SDOs with orbits beyond the reach of Neptune\n(roughly $q>35$~au) are of special interest here as an important constraint on\nthe early evolution of the outer Solar System. The semimajor axis profile of\ndetached SDOs at 50--500~au, as characterized from the Dark Energy Survey\n(DES), is radially extended, but previous dynamical models of Neptune's early\nmigration produce a relatively compact profile. This problem is most likely\nrelated to Sun's birth environment in a stellar cluster. We perform new\ndynamical simulations that account for cluster effects and show that the\norbital distribution of SDOs can be explained if a particularly close stellar\nencounter occurred early on (e.g., M dwarf with the mass $\\simeq 0.2$ $M_\\odot$\napproaching the Sun at $\\simeq 200$ au). For such an encounter to happen with a\nreasonably high probability the Sun must have formed in a stellar cluster with\n$\\eta T \\gtrsim 10^4$ Myr pc$^{-3}$, where $\\eta$ is the stellar number density\nand $T$ is the Sun's residence time in the cluster.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:02:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nesvorny","David",""],["Bernardinelli","Pedro",""],["Vokrouhlicky","David",""],["Batygin","Konstantin",""]]}
{"id":"2308.11060","submitter":"Petr Zavada","authors":"Petr Zavada and Karel P\\'i\\v{s}ka","title":"Kinematics of the Milky way from the statistical analysis of the Gaia\n  Data Release 3","comments":"15 pages, 12 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By analyzing data from the Gaia Space Observatory, we have obtained precise\nbasic characteristics of the collective motion of stars in a part of our\ngalaxy. Our research is based on a statistical analysis of the motion of\n$33~146~122$ selected stars at a distance $\\lesssim6$ kpc from the Sun. Up to\nthis distance, Gaia provides high statistics of stars with well-measured proper\nmotion and parallax needed to determine the corresponding transverse velocity\nwith sufficient precision. We obtained the velocity of the Sun $\\left(\nU_{\\odot},V_{\\odot},W_{\\odot}\\right) =(10.5\\pm1,22.5\\pm3,7.5\\pm0.5)$ km/s\nrelative to a set of nearby stars and the rotation velocity of the galaxy at\ndifferent radii. For the radius of the Sun's orbit, we obtained the velocity$\\\nV_{0}\\approx225$ km/s. We have shown that the various kinematic characteristics\nand distributions, which depend on the position in the galaxy, can be very well\ndescribed in the studied region by a simple Monte-Carlo simulation model based\non five parameters in the galactocentric reference frame. The optimal values of\nthese parameters were determined by comparison with the data.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:03:59 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 16:59:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zavada","Petr",""],["P\u00ed\u0161ka","Karel",""]]}
{"id":"2308.11061","submitter":"Paul M. Terwilliger","authors":"Kazumasa Nomura and Paul Terwilliger","title":"Spin models and distance-regular graphs of $q$-Racah type","comments":"48 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\Gamma$ denote a distance-regular graph, with vertex set $X$ and\ndiameter $D\\geq 3$. We assume that $\\Gamma$ is formally self-dual and $q$-Racah\ntype. We also assume that for each $x \\in X$ the subconstituent algebra\n$T=T(x)$ contains a certain central element $Z=Z(x)$. We use $Z$ to construct a\nspin model $\\sf W$ afforded by $\\Gamma$. We investigate the combinatorial\nimplications of $Z$. We reverse the logical direction and recover $Z$ from $\\sf\nW$. We finish with some open problems.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:11:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nomura","Kazumasa",""],["Terwilliger","Paul",""]]}
{"id":"2308.11062","submitter":"Shen Yan","authors":"Shen Yan, Xuehan Xiong, Arsha Nagrani, Anurag Arnab, Zhonghao Wang,\n  Weina Ge, David Ross, Cordelia Schmid","title":"UnLoc: A Unified Framework for Video Localization Tasks","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While large-scale image-text pretrained models such as CLIP have been used\nfor multiple video-level tasks on trimmed videos, their use for temporal\nlocalization in untrimmed videos is still a relatively unexplored task. We\ndesign a new approach for this called UnLoc, which uses pretrained image and\ntext towers, and feeds tokens to a video-text fusion model. The output of the\nfusion module are then used to construct a feature pyramid in which each level\nconnects to a head to predict a per-frame relevancy score and start/end time\ndisplacements. Unlike previous works, our architecture enables Moment\nRetrieval, Temporal Localization, and Action Segmentation with a single stage\nmodel, without the need for action proposals, motion based pretrained features\nor representation masking. Unlike specialized models, we achieve state of the\nart results on all three different localization tasks with a unified approach.\nCode will be available at: \\url{https://github.com/google-research/scenic}.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:15:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yan","Shen",""],["Xiong","Xuehan",""],["Nagrani","Arsha",""],["Arnab","Anurag",""],["Wang","Zhonghao",""],["Ge","Weina",""],["Ross","David",""],["Schmid","Cordelia",""]]}
{"id":"2308.11063","submitter":"Yanan Wu","authors":"Yanan Wu, Zhixiang Chi, Yang Wang, Songhe Feng","title":"MetaGCD: Learning to Continually Learn in Generalized Category Discovery","comments":"This paper has been accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we consider a real-world scenario where a model that is\ntrained on pre-defined classes continually encounters unlabeled data that\ncontains both known and novel classes. The goal is to continually discover\nnovel classes while maintaining the performance in known classes. We name the\nsetting Continual Generalized Category Discovery (C-GCD). Existing methods for\nnovel class discovery cannot directly handle the C-GCD setting due to some\nunrealistic assumptions, such as the unlabeled data only containing novel\nclasses. Furthermore, they fail to discover novel classes in a continual\nfashion. In this work, we lift all these assumptions and propose an approach,\ncalled MetaGCD, to learn how to incrementally discover with less forgetting.\nOur proposed method uses a meta-learning framework and leverages the offline\nlabeled data to simulate the testing incremental learning process. A\nmeta-objective is defined to revolve around two conflicting learning objectives\nto achieve novel class discovery without forgetting. Furthermore, a soft\nneighborhood-based contrastive network is proposed to discriminate uncorrelated\nimages while attracting correlated images. We build strong baselines and\nconduct extensive experiments on three widely used benchmarks to demonstrate\nthe superiority of our method.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:16:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wu","Yanan",""],["Chi","Zhixiang",""],["Wang","Yang",""],["Feng","Songhe",""]]}
{"id":"2308.11064","submitter":"Sean Howe","authors":"Sean Howe and Christian Klevdal","title":"Admissible pairs and $p$-adic Hodge structures II: The bi-analytic\n  Ax-Lindemann theorem","comments":"46 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We reinterpret and generalize the construction of local Shimura varieties and\ntheir non-minuscule analogs by viewing them as moduli spaces of admissible\npairs. Our main application is a bi-analytic Ax-Lindemann theorem comparing, in\nthe basic case, rigid analytic subvarieties for the two distinct analytic\nstructures induced by the Hodge and Hodge-Tate period maps and their lattice\nrefinements. The theorem implies, in particular, that the only bi-analytic\nsubdiamonds are special subvarieties, generalizing the bi-analytic\ncharacterization of special points given in Part I. These results suggest that\nthere is a purely local, $p$-adic theory of bi-analytic geometry that runs in\nparallel to the global, archimedean theory of bi-algebraic geometry arising in\nthe study of unlikely intersection and functional transcendence for Shimura\nvarieties and more general period domains for variations of Hodge structure.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:18:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Howe","Sean",""],["Klevdal","Christian",""]]}
{"id":"2308.11065","submitter":"Sean Howe","authors":"Sean Howe and Christian Klevdal","title":"Admissible pairs and $p$-adic Hodge structures I: Transcendence of the\n  de Rham lattice","comments":"54 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an algebraically closed non-archimedean extension $C/\\mathbb{Q}_p$, we\ndefine a Tannakian category of $p$-adic Hodge structures over $C$ that is a\nlocal, $p$-adic analog of the global, archimedean category of\n$\\mathbb{Q}$-Hodge structures in complex geometry. In this setting the\nfiltrations of classical Hodge theory must be enriched to lattices over a\ncomplete discrete valuation ring, Fontaine's integral de Rham period ring\n$B^+_\\mathrm{dR}$, and a pure $p$-adic Hodge structure is then a\n$\\mathbb{Q}_p$-vector space equipped with a $B^+_\\mathrm{dR}$-lattice\nsatisfying a natural condition analogous to the transversality of the complex\nHodge filtration with its conjugate. We show $p$-adic Hodge structures are\nequivalent to a full subcategory of basic objects in the category of admissible\npairs, a toy category of cohomological motives over $C$ that is equivalent to\nthe isogeny category of rigidified Breuil-Kisin-Fargues modules and closely\nrelated to Fontaine's $p$-adic Hodge theory over $p$-adic subfields. As an\napplication, we characterize basic admissible pairs with complex multiplication\nin terms of the transcendence of $p$-adic periods. This generalizes an earlier\nresult for one-dimensional formal groups and is an unconditional, local,\n$p$-adic analog of a global, archimedean characterization of CM motives over\n$\\mathbb{C}$ conditional on the standard conjectures, the Hodge conjecture, and\nthe Grothendieck period conjecture (known unconditionally for abelian varieties\nby work Cohen and Shiga and Wolfart).\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:19:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Howe","Sean",""],["Klevdal","Christian",""]]}
{"id":"2308.11066","submitter":"Songhui Yue","authors":"Songhui Yue, Xiaoyan Hong, and Randy K. Smith","title":"CSM-H-R: An Automatic Context Reasoning Framework for Interoperable\n  Intelligent Systems and Privacy Protection","comments":"11 pages, 8 figures, Keywords: Context Reasoning, Automation,\n  Intelligent Systems, Context Modeling, Context Dynamism, Privacy Protection,\n  Context Sharing, Interoperability, System Integration","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automation of High-Level Context (HLC) reasoning for intelligent systems at\nscale is imperative due to the unceasing accumulation of contextual data in the\nIoT era, the trend of the fusion of data from multi-sources, and the intrinsic\ncomplexity and dynamism of the context-based decision-making process. To\nmitigate this issue, we propose an automatic context reasoning framework\nCSM-H-R, which programmatically combines ontologies and states at runtime and\nthe model-storage phase for attaining the ability to recognize meaningful HLC,\nand the resulting data representation can be applied to different reasoning\ntechniques. Case studies are developed based on an intelligent elevator system\nin a smart campus setting. An implementation of the framework - a CSM Engine,\nand the experiments of translating the HLC reasoning into vector and matrix\ncomputing especially take care of the dynamic aspects of context and present\nthe potentiality of using advanced mathematical and probabilistic models to\nachieve the next level of automation in integrating intelligent systems;\nmeanwhile, privacy protection support is achieved by anonymization through\nlabel embedding and reducing information correlation. The code of this study is\navailable at: https://github.com/songhui01/CSM-H-R.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:21:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yue","Songhui",""],["Hong","Xiaoyan",""],["Smith","Randy K.",""]]}
{"id":"2308.11067","submitter":"Wajid Mannan Dr","authors":"Wajid H. Mannan","title":"A fake Klein bottle with bubble","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We resolve the question of the existence of a finite 2-complex with the same\nfundamental group and Euler characteristic as a Klein bottle with a bubble, but\nhomotopically distinct to it.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:24:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mannan","Wajid H.",""]]}
{"id":"2308.11068","submitter":"Guillermo Bern\\'ardez","authors":"Guillermo Bern\\'ardez, Lev Telyatnikov, Eduard Alarc\\'on, Albert\n  Cabellos-Aparicio, Pere Barlet-Ros, Pietro Li\\`o","title":"Topological Graph Signal Compression","comments":"9 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently emerged Topological Deep Learning (TDL) methods aim to extend\ncurrent Graph Neural Networks (GNN) by naturally processing higher-order\ninteractions, going beyond the pairwise relations and local neighborhoods\ndefined by graph representations. In this paper we propose a novel TDL-based\nmethod for compressing signals over graphs, consisting in two main steps:\nfirst, disjoint sets of higher-order structures are inferred based on the\noriginal signal --by clustering $N$ datapoints into $K\\ll N$ collections; then,\na topological-inspired message passing gets a compressed representation of the\nsignal within those multi-element sets. Our results show that our framework\nimproves both standard GNN and feed-forward architectures in compressing\ntemporal link-based signals from two real-word Internet Service Provider\nNetworks' datasets --from $30\\%$ up to $90\\%$ better reconstruction errors\nacross all evaluation scenarios--, suggesting that it better captures and\nexploits spatial and temporal correlations over the whole graph-based network\nstructure.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:26:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bern\u00e1rdez","Guillermo",""],["Telyatnikov","Lev",""],["Alarc\u00f3n","Eduard",""],["Cabellos-Aparicio","Albert",""],["Barlet-Ros","Pere",""],["Li\u00f2","Pietro",""]]}
{"id":"2308.11069","submitter":"Sabiou Inoua","authors":"Sabiou Inoua, Vernon Smith","title":"Classical Economics: Lost and Found","comments":null,"journal-ref":"The Independent Review, Volume 25, Number 1, Summer 2020","doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \"Economists miss the boat when they act as if Arrow and Debreu's general\nequilibrium model accurately describes markets in the real world of constant\nchange. In contrast, the classical view on the market mechanism offers a\nhelpful foundation on which to add modern insights about how markets create and\ncoordinate information.\"\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:27:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Inoua","Sabiou",""],["Smith","Vernon",""]]}
{"id":"2308.11070","submitter":"Ruiquan Huang","authors":"Xi Li, Songhe Wang, Ruiquan Huang, Mahanth Gowda, George Kesidis","title":"Temporal-Distributed Backdoor Attack Against Video Based Action\n  Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks (DNNs) have achieved tremendous success in various\napplications including video action recognition, yet remain vulnerable to\nbackdoor attacks (Trojans). The backdoor-compromised model will mis-classify to\nthe target class chosen by the attacker when a test instance (from a non-target\nclass) is embedded with a specific trigger, while maintaining high accuracy on\nattack-free instances. Although there are extensive studies on backdoor attacks\nagainst image data, the susceptibility of video-based systems under backdoor\nattacks remains largely unexplored. Current studies are direct extensions of\napproaches proposed for image data, e.g., the triggers are\n\\textbf{independently} embedded within the frames, which tend to be detectable\nby existing defenses. In this paper, we introduce a \\textit{simple} yet\n\\textit{effective} backdoor attack against video data. Our proposed attack,\nadding perturbations in a transformed domain, plants an \\textbf{imperceptible,\ntemporally distributed} trigger across the video frames, and is shown to be\nresilient to existing defensive strategies. The effectiveness of the proposed\nattack is demonstrated by extensive experiments with various well-known models\non two video recognition benchmarks, UCF101 and HMDB51, and a sign language\nrecognition benchmark, Greek Sign Language (GSL) dataset. We delve into the\nimpact of several influential factors on our proposed attack and identify an\nintriguing effect termed \"collateral damage\" through extensive studies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:31:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Xi",""],["Wang","Songhe",""],["Huang","Ruiquan",""],["Gowda","Mahanth",""],["Kesidis","George",""]]}
{"id":"2308.11071","submitter":"Tianmin Shu","authors":"Kunal Jha, Tuan Anh Le, Chuanyang Jin, Yen-Ling Kuo, Joshua B.\n  Tenenbaum, Tianmin Shu","title":"Neural Amortized Inference for Nested Multi-agent Reasoning","comments":"8 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.MA cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-agent interactions, such as communication, teaching, and bluffing,\noften rely on higher-order social inference, i.e., understanding how others\ninfer oneself. Such intricate reasoning can be effectively modeled through\nnested multi-agent reasoning. Nonetheless, the computational complexity\nescalates exponentially with each level of reasoning, posing a significant\nchallenge. However, humans effortlessly perform complex social inferences as\npart of their daily lives. To bridge the gap between human-like inference\ncapabilities and computational limitations, we propose a novel approach:\nleveraging neural networks to amortize high-order social inference, thereby\nexpediting nested multi-agent reasoning. We evaluate our method in two\nchallenging multi-agent interaction domains. The experimental results\ndemonstrate that our method is computationally efficient while exhibiting\nminimal degradation in accuracy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:40:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jha","Kunal",""],["Le","Tuan Anh",""],["Jin","Chuanyang",""],["Kuo","Yen-Ling",""],["Tenenbaum","Joshua B.",""],["Shu","Tianmin",""]]}
{"id":"2308.11072","submitter":"Joseph Fioresi","authors":"Joseph Fioresi, Ishan Rajendrakumar Dave, Mubarak Shah","title":"TeD-SPAD: Temporal Distinctiveness for Self-supervised\n  Privacy-preservation for video Anomaly Detection","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video anomaly detection (VAD) without human monitoring is a complex computer\nvision task that can have a positive impact on society if implemented\nsuccessfully. While recent advances have made significant progress in solving\nthis task, most existing approaches overlook a critical real-world concern:\nprivacy. With the increasing popularity of artificial intelligence\ntechnologies, it becomes crucial to implement proper AI ethics into their\ndevelopment. Privacy leakage in VAD allows models to pick up and amplify\nunnecessary biases related to people's personal information, which may lead to\nundesirable decision making. In this paper, we propose TeD-SPAD, a\nprivacy-aware video anomaly detection framework that destroys visual private\ninformation in a self-supervised manner. In particular, we propose the use of a\ntemporally-distinct triplet loss to promote temporally discriminative features,\nwhich complements current weakly-supervised VAD methods. Using TeD-SPAD, we\nachieve a positive trade-off between privacy protection and utility anomaly\ndetection performance on three popular weakly supervised VAD datasets:\nUCF-Crime, XD-Violence, and ShanghaiTech. Our proposed anonymization model\nreduces private attribute prediction by 32.25% while only reducing frame-level\nROC AUC on the UCF-Crime anomaly detection dataset by 3.69%. Project Page:\nhttps://joefioresi718.github.io/TeD-SPAD_webpage/\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:42:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fioresi","Joseph",""],["Dave","Ishan Rajendrakumar",""],["Shah","Mubarak",""]]}
{"id":"2308.11073","submitter":"Weiguo Pian","authors":"Weiguo Pian, Shentong Mo, Yunhui Guo, Yapeng Tian","title":"Audio-Visual Class-Incremental Learning","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce audio-visual class-incremental learning, a\nclass-incremental learning scenario for audio-visual video recognition. We\ndemonstrate that joint audio-visual modeling can improve class-incremental\nlearning, but current methods fail to preserve semantic similarity between\naudio and visual features as incremental step grows. Furthermore, we observe\nthat audio-visual correlations learned in previous tasks can be forgotten as\nincremental steps progress, leading to poor performance. To overcome these\nchallenges, we propose AV-CIL, which incorporates Dual-Audio-Visual Similarity\nConstraint (D-AVSC) to maintain both instance-aware and class-aware semantic\nsimilarity between audio-visual modalities and Visual Attention Distillation\n(VAD) to retain previously learned audio-guided visual attentive ability. We\ncreate three audio-visual class-incremental datasets, AVE-Class-Incremental\n(AVE-CI), Kinetics-Sounds-Class-Incremental (K-S-CI), and\nVGGSound100-Class-Incremental (VS100-CI) based on the AVE, Kinetics-Sounds, and\nVGGSound datasets, respectively. Our experiments on AVE-CI, K-S-CI, and\nVS100-CI demonstrate that AV-CIL significantly outperforms existing\nclass-incremental learning methods in audio-visual class-incremental learning.\nCode and data are available at: https://github.com/weiguoPian/AV-CIL_ICCV2023.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:43:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pian","Weiguo",""],["Mo","Shentong",""],["Guo","Yunhui",""],["Tian","Yapeng",""]]}
{"id":"2308.11074","submitter":"Martial Longla","authors":"Martial Longla","title":"New copula families and mixing properties","comments":"24pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterize absolutely continuous symmetric copulas with square\nintegrable densities in this paper. This characterization is used to create new\ncopula families, that are perturbations of the independence copula. The full\nstudy of mixing properties of Markov chains generated by these copula families\nis conducted. An extension that includes the Farlie-Gumbel-Morgenstern family\nof copulas is proposed. We propose some examples of copulas that generate\nnon-mixing Markov chains, but whose convex combinations generate $\\psi$-mixing\nMarkov chains. Some general results on $\\psi$-mixing are given. The Spearman's\ncorrelation $\\rho_S$ and Kendall's $\\tau$ are provided for the created copula\nfamilies. Some general remarks are provided for $\\rho_S$ and $\\tau$. A central\nlimit theorem is provided for parameter estimators in one example. A simulation\nstudy is conducted to support derived asymptotic distributions for some\nexamples.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:50:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Longla","Martial",""]]}
{"id":"2308.11075","submitter":"Kelsie Taylor","authors":"Kelsie Taylor","title":"A Deep Dive into the Connections Between the Renormalization Group and\n  Deep Learning in the Ising Model","comments":"103 pages, 87 figures, Senior Thesis, Advisors: Maria Spiropulu and\n  Joseph Lykken","journal-ref":null,"doi":"10.7907/ztpg-z092","report-no":null,"categories":"cond-mat.stat-mech cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The renormalization group (RG) is an essential technique in statistical\nphysics and quantum field theory, which considers scale-invariant properties of\nphysical theories and how these theories' parameters change with scaling. Deep\nlearning is a powerful computational technique that uses multi-layered neural\nnetworks to solve a myriad of complicated problems. Previous research suggests\nthe possibility that unsupervised deep learning may be a form of RG flow, by\nbeing a layer-by-layer coarse graining of the original data. We examined this\nconnection on a more rigorous basis for the simple example of Kadanoff block\nrenormalization of the 2D nearest-neighbor Ising model, with our deep learning\naccomplished via Restricted Boltzmann Machines (RBMs). We developed extensive\nrenormalization techniques for the 1D and 2D Ising model to provide a baseline\nfor comparison. For the 1D Ising model, we successfully used Adam optimization\non a correlation length loss function to learn the group flow, yielding results\nconsistent with the analytical model for infinite N. For the 2D Ising model, we\nsuccessfully generated Ising model samples using the Wolff algorithm, and\nperformed the group flow using a quasi-deterministic method, validating these\nresults by calculating the critical exponent \\nu. We then examined RBM learning\nof the Ising model layer by layer, finding a blocking structure in the learning\nthat is qualitatively similar to RG. Lastly, we directly compared the weights\nof each layer from the learning to Ising spin renormalization, but found\nquantitative inconsistencies for the simple case of nearest-neighbor Ising\nmodels.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:50:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Taylor","Kelsie",""]]}
{"id":"2308.11076","submitter":"Jacob Haqq-Misra","authors":"Jacob Haqq-Misra","title":"Constraints on Interstellar Sovereignty","comments":"Submitted to JBIS for the 8th Interstellar Symposium special issue","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.pop-ph physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human space exploration and settlement of other planets is becoming\nincreasingly technologically feasible, while mission concepts for remote and\ncrewed missions to nearby star systems continue to be developed. But the\nlong-term success of space settlement also requires extensions and advances in\nmodels of governance. This paper provides a synthesis of the physical factors\nthat will constrain the application of sovereignty in space as well as legal\nprecedent on Earth that likely applies to any crewed or uncrewed missions to\nother stellar systems. The Outer Space Treaty limits the territorial expansion\nof states into space, but the requirements for oversight of nongovernmental\nagencies and retention of property ownership enable the extension of state\njurisdiction into space. Pragmatic constraints from historical precedent on\nEarth suggest that new space treaties will be unlikely to succeed and new\nglobal space agencies may have limited jurisdiction over states, while hard\nconstraints of the space environment require adherence to technical\ncapabilities, political feasibility, and long-term sustainability. These\nfactors form a three-prong test for assessing the viability of interstellar\ngovernance models. This discussion of interstellar governance is intended to\nfurther the conversation about sovereignty in space prior to the first\nintentional launch of any interstellar spacecraft.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:52:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Haqq-Misra","Jacob",""]]}
{"id":"2308.11077","submitter":"Bing Tang","authors":"Zhengguo Tang, Heng Zhu, Hongchao Shi, Bing Tang","title":"Photoinduced topological phase transitions in Kitaev-Heisenberg\n  honeycomb ferromagnets with the Dzyaloshinskii-Moriya interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We theoretically study topological properties of Floquet magnon in a\nlaser-irradiated Kitaev-Heisenberg honeycomb ferromagnet with the\nDzyaloshinskii-Moriya interaction by means of the Floquet-Bloch theory. It is\nfound that the Kitaev-Heisenberg ferromagnet can reveal two topological phases\nwith different Chern numbers when it is irradiated by a circular-polarized\nlight laser. Our results show that the topological phase of the system can be\nswitched from one topological phase to another one via varying the light\nintensity. The intrinsic DMI plays a crucial role in the occurrence of\nphotoinduced topological phase transition. It is shown that the sign reversal\nof the thermal hall conductivity is an important indicator on photoinduced\ntopological phase transitions in the Kitaev-Heisenberg honeycomb ferromagnet.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:03:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tang","Zhengguo",""],["Zhu","Heng",""],["Shi","Hongchao",""],["Tang","Bing",""]]}
{"id":"2308.11078","submitter":"Mahdi Soleymani","authors":"Mahdi Soleymani, Qiang Liu, Hessam Mahdavifar, Laura Balzano","title":"Matrix Completion over Finite Fields: Bounds and Belief Propagation\n  Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the low rank matrix completion problem over finite fields. This\nproblem has been extensively studied in the domain of real/complex numbers,\nhowever, to the best of authors' knowledge, there exists merely one efficient\nalgorithm to tackle the problem in the binary field, due to Saunderson et al.\n[1]. In this paper, we improve upon the theoretical guarantees for the\nalgorithm provided in [1]. Furthermore, we formulate a new graphical model for\nthe matrix completion problem over the finite field of size $q$, $\\Bbb{F}_q$,\nand present a message passing (MP) based approach to solve this problem. The\nproposed algorithm is the first one for the considered matrix completion\nproblem over finite fields of arbitrary size. Our proposed method has a\nsignificantly lower computational complexity, reducing it from $O(n^{2r+3})$ in\n[1] down to $O(n^2)$ (where, the underlying matrix has dimension $n \\times n$\nand $r$ denotes its rank), while also improving the performance.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:09:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Soleymani","Mahdi",""],["Liu","Qiang",""],["Mahdavifar","Hessam",""],["Balzano","Laura",""]]}
{"id":"2308.11079","submitter":"Luke Ditria","authors":"Luke Ditria, Tom Drummond","title":"Long-Term Prediction of Natural Video Sequences with Robust Video\n  Predictors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting high dimensional video sequences is a curiously difficult problem.\nThe number of possible futures for a given video sequence grows exponentially\nover time due to uncertainty. This is especially evident when trying to predict\ncomplicated natural video scenes from a limited snapshot of the world. The\ninherent uncertainty accumulates the further into the future you predict making\nlong-term prediction very difficult. In this work we introduce a number of\nimprovements to existing work that aid in creating Robust Video Predictors\n(RoViPs). We show that with a combination of deep Perceptual and\nuncertainty-based reconstruction losses we are able to create high quality\nshort-term predictions. Attention-based skip connections are utilised to allow\nfor long range spatial movement of input features to further improve\nperformance. Finally, we show that by simply making the predictor robust to its\nown prediction errors, it is possible to produce very long, realistic natural\nvideo sequences using an iterated single-step prediction task.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:16:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ditria","Luke",""],["Drummond","Tom",""]]}
{"id":"2308.11080","submitter":"Reese Jones","authors":"Jan N. Fuhg, Nikolaos Bouklas, Reese E. Jones","title":"Stress representations for tensor basis neural networks: alternative\n  formulations to Finger-Rivlin-Ericksen","comments":"32 pages, 20 figures, 4 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data-driven constitutive modeling frameworks based on neural networks and\nclassical representation theorems have recently gained considerable attention\ndue to their ability to easily incorporate constitutive constraints and their\nexcellent generalization performance. In these models, the stress prediction\nfollows from a linear combination of invariant-dependent coefficient functions\nand known tensor basis generators. However, thus far the formulations have been\nlimited to stress representations based on the classical Rivlin and Ericksen\nform, while the performance of alternative representations has yet to be\ninvestigated. In this work, we survey a variety of tensor basis neural network\nmodels for modeling hyperelastic materials in a finite deformation context,\nincluding a number of so far unexplored formulations which use theoretically\nequivalent invariants and generators to Finger-Rivlin-Ericksen. Furthermore, we\ncompare potential-based and coefficient-based approaches, as well as different\ncalibration techniques. Nine variants are tested against both noisy and\nnoiseless datasets for three different materials. Theoretical and practical\ninsights into the performance of each formulation are given.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:28:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fuhg","Jan N.",""],["Bouklas","Nikolaos",""],["Jones","Reese E.",""]]}
{"id":"2308.11081","submitter":"Sepideh Mosaferi","authors":"Sepideh Mosaferi, Malay Ghosh, Shonosuke Sugasawa","title":"An Unbiased Predictor for Skewed Response Variable with Measurement\n  Error in Covariate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new small area predictor when the Fay-Herriot normal error\nmodel is fitted to a logarithmically transformed response variable, and the\ncovariate is measured with error. This framework has been previously studied by\nMosaferi et al. (2023). The empirical predictor given in their manuscript\ncannot perform uniformly better than the direct estimator. Our proposed\npredictor in this manuscript is unbiased and can perform uniformly better than\nthe one proposed in Mosaferi et al. (2023). We derive an approximation of the\nmean squared error (MSE) for the predictor. The prediction intervals based on\nthe MSE suffer from coverage problems. Thus, we propose a non-parametric\nbootstrap prediction interval which is more accurate. This problem is of great\ninterest in small area applications since statistical agencies and agricultural\nsurveys are often asked to produce estimates of right skewed variables with\ncovariates measured with errors. With Monte Carlo simulation studies and two\nCensus Bureau's data sets, we demonstrate the superiority of our proposed\nmethodology.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:30:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mosaferi","Sepideh",""],["Ghosh","Malay",""],["Sugasawa","Shonosuke",""]]}
{"id":"2308.11082","submitter":"Majd Soud","authors":"Majd Soud, Grischa Liebel and Mohammad Hamdaqa","title":"PrAIoritize: Learning to Prioritize Smart Contract Bugs and\n  Vulnerabilities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Smart contract vulnerabilities and bugs have become a key concern for\nsoftware engineers, as they can lead to significant financial losses,\nreputational damage, and legal issues. Therefore, prioritizing bug fixing for\nsmart contracts is critical to maintaining trust. Due to the lack of tracking\ntools, prioritizing smart contract-reported bugs is done manually, which is a\ntedious task, limits bug triaging, and needs specialized knowledge. Towards\nthis end, we propose PrAIoritize; an automated approach for predicting smart\ncontract bug priorities that assist software engineers in prioritizing highly\nurgent bug reports. PrAIoritize consists of two main phases: 1) automatic\nlabeling, which involves the automatic construction of a smart contract keyword\nlexicon and the automatic assignment of priority levels to unlabeled bug\nreports; 2) model construction, which involves feature engineering and designs\nlayers of feed-forward neural networks (FFNNs) and bidirectional long\nshort-term memory (BiLSTM) with multi-class classification to better capture\nthe features of the textual descriptions of bugs and predict their priority\nlevels. The model then is trained using smart contract bug reports collected\nfrom two data sources: open-source software (OSS) projects available on GitHub\nand NVD vulnerability database. Our evaluation demonstrates significant\nimprovement over state-of-the-art baselines and commonly used pre-trained\nmodels (e.g. BERT) for similar classification tasks, with 5.75%-35.29% increase\nin F-measure, precision, and recall.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:30:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Soud","Majd",""],["Liebel","Grischa",""],["Hamdaqa","Mohammad",""]]}
{"id":"2308.11083","submitter":"Dimitrios Los","authors":"Dimitrios Los, Thomas Sauerwald","title":"An Improved Drift Theorem for Balanced Allocations","comments":"This paper refines and extends the content on the drift theorem and\n  applications in arXiv:2203.13902. It consists of 38 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the balanced allocations framework, there are $m$ jobs (balls) to be\nallocated to $n$ servers (bins). The goal is to minimize the gap, the\ndifference between the maximum and the average load.\n  Peres, Talwar and Wieder (RSA 2015) used the hyperbolic cosine potential\nfunction to analyze a large family of allocation processes including the\n$(1+\\beta)$-process and graphical balanced allocations. The key ingredient was\nto prove that the potential drops in every step, i.e., a drift inequality.\n  In this work we improve the drift inequality so that (i) it is asymptotically\ntighter, (ii) it assumes weaker preconditions, (iii) it applies not only to\nprocesses allocating to more than one bin in a single step and (iv) to\nprocesses allocating a varying number of balls depending on the sampled bin.\nOur applications include the processes of (RSA 2015), but also several new\nprocesses, and we believe that our techniques may lead to further results in\nfuture work.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:35:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Los","Dimitrios",""],["Sauerwald","Thomas",""]]}
{"id":"2308.11084","submitter":"Xulong Zhang","authors":"Yimin Deng, Huaizhen Tang, Xulong Zhang, Jianzong Wang, Ning Cheng,\n  Jing Xiao","title":"PMVC: Data Augmentation-Based Prosody Modeling for Expressive Voice\n  Conversion","comments":"Accepted by the 31st ACM International Conference on Multimedia\n  (MM2023)","journal-ref":null,"doi":"10.1145/3581783.3613800","report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Voice conversion as the style transfer task applied to speech, refers to\nconverting one person's speech into a new speech that sounds like another\nperson's. Up to now, there has been a lot of research devoted to better\nimplementation of VC tasks. However, a good voice conversion model should not\nonly match the timbre information of the target speaker, but also expressive\ninformation such as prosody, pace, pause, etc. In this context, prosody\nmodeling is crucial for achieving expressive voice conversion that sounds\nnatural and convincing. Unfortunately, prosody modeling is important but\nchallenging, especially without text transcriptions. In this paper, we firstly\npropose a novel voice conversion framework named 'PMVC', which effectively\nseparates and models the content, timbre, and prosodic information from the\nspeech without text transcriptions. Specially, we introduce a new speech\naugmentation algorithm for robust prosody extraction. And building upon this,\nmask and predict mechanism is applied in the disentanglement of prosody and\ncontent information. The experimental results on the AIShell-3 corpus supports\nour improvement of naturalness and similarity of converted speech.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:37:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Deng","Yimin",""],["Tang","Huaizhen",""],["Zhang","Xulong",""],["Wang","Jianzong",""],["Cheng","Ning",""],["Xiao","Jing",""]]}
{"id":"2308.11085","submitter":"Emanuel de Lima","authors":"Emanuel F. de Lima","title":"Formation of deeply bound polar molecules combining pump-dump pulses\n  with infrared radiation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the formation of cold ground-state polar molecules in a low\nvibrational level by laser fields. Starting from a pair of cold colliding atoms\nof dissimilar species, we propose a strategy consisting of three steps. In the\nfirst step, a pump pulse induces the molecule formation by photoassociating the\natomic pair in a high or intermediate vibrational level of an excited\nelectronic molecular state. This step is followed by a dump pulse in an\nintermediate vibrational level of the ground state. In the last step, an\ninfrared chirped pulse induces downward transitions among the vibrational\nlevels of the ground electronic state, reaching the ground vibrational level.\nInitially, the strategy is constructed with fixed-shaped pulses. Subsequently,\nwe perform the calculations with optimized chirped pulses introducing an\noptimal control technique in which the optimization of the time-dependent\nfrequency is carried out in the time domain. The proposed scheme is an\nalternative to the use of two pairs of pump-dump pulses or to the direct\nphotoassociation and vibrational stabilization in the ground state.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:40:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["de Lima","Emanuel F.",""]]}
{"id":"2308.11086","submitter":"Daniel VandenHeuvel","authors":"Daniel J. VandenHeuvel and Pascal R. Buenzli and Matthew J. Simpson","title":"Pushing coarse-grained models beyond the continuum limit using equation\n  learning","comments":"42 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mathematical modelling of biological population dynamics often involves\nproposing high fidelity discrete agent-based models that capture stochasticity\nand individual-level processes. These models are often considered in\nconjunction with an approximate coarse-grained differential equation that\ncaptures population-level features only. These coarse-grained models are only\naccurate in certain asymptotic parameter regimes, such as enforcing that the\ntime scale of individual motility far exceeds the time scale of birth/death\nprocesses. When these coarse-grained models are accurate, the discrete model\nstill abides by conservation laws at the microscopic level, which implies that\nthere is some macroscopic conservation law that can describe the macroscopic\ndynamics. In this work, we introduce an equation learning framework to find\naccurate coarse-grained models when standard continuum limit approaches are\ninaccurate. We demonstrate our approach using a discrete mechanical model of\nepithelial tissues, considering a series of four case studies that illustrate\nhow we can learn macroscopic equations describing mechanical relaxation, cell\nproliferation, and the equation governing the dynamics of the free boundary of\nthe tissue. While our presentation focuses on this biological application, our\napproach is more broadly applicable across a range of scenarios where discrete\nmodels are approximated by approximate continuum-limit descriptions. All code\nand data to reproduce this work are available at\nhttps://github.com/DanielVandH/StepwiseEQL.jl.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:49:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["VandenHeuvel","Daniel J.",""],["Buenzli","Pascal R.",""],["Simpson","Matthew J.",""]]}
{"id":"2308.11087","submitter":"Jose Solano-Castellanos","authors":"Jose A. Solano-Castellanos, Won Kyung Do, and Monroe Kennedy III","title":"Embedded Object Detection and Mapping in Soft Materials Using Optical\n  Tactile Sensing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we present a methodology that uses an optical tactile sensor\nfor efficient tactile exploration of embedded objects within soft materials.\nThe methodology consists of an exploration phase, where a probabilistic\nestimate of the location of the embedded objects is built using a Bayesian\napproach. The exploration phase is then followed by a mapping phase which\nexploits the probabilistic map to reconstruct the underlying topography of the\nworkspace by sampling in more detail regions where there is expected to be\nembedded objects. To demonstrate the effectiveness of the method, we tested our\napproach on an experimental setup that consists of a series of quartz beads\nlocated underneath a polyethylene foam that prevents direct observation of the\nconfiguration and requires the use of tactile exploration to recover the\nlocation of the beads. We show the performance of our methodology using ten\ndifferent configurations of the beads where the proposed approach is able to\napproximate the underlying configuration. We benchmark our results against a\nrandom sampling policy.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:52:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Solano-Castellanos","Jose A.",""],["Do","Won Kyung",""],["Kennedy","Monroe","III"]]}
{"id":"2308.11088","submitter":"Han Lei","authors":"Lei Han, Chunyu Tu, Zhiwen Yu, Zhiyong Yu, Weihua Shan, Liang Wang,\n  and Bin Guo","title":"Collaborative Route Planning of UAVs, Workers and Cars for Crowdsensing\n  in Disaster Response","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficiently obtaining the up-to-date information in the disaster-stricken\narea is the key to successful disaster response. Unmanned aerial vehicles\n(UAVs), workers and cars can collaborate to accomplish sensing tasks, such as\ndata collection, in disaster-stricken areas. In this paper, we explicitly\naddress the route planning for a group of agents, including UAVs, workers, and\ncars, with the goal of maximizing the task completion rate. We propose\nMANF-RL-RP, a heterogeneous multi-agent route planning algorithm that\nincorporates several efficient designs, including global-local dual information\nprocessing and a tailored model structure for heterogeneous multi-agent\nsystems. Global-local dual information processing encompasses the extraction\nand dissemination of spatial features from global information, as well as the\npartitioning and filtering of local information from individual agents.\nRegarding the construction of the model structure for heterogeneous\nmulti-agent, we perform the following work. We design the same data structure\nto represent the states of different agents, prove the Markovian property of\nthe decision-making process of agents to simplify the model structure, and also\ndesign a reasonable reward function to train the model. Finally, we conducted\ndetailed experiments based on the rich simulation data. In comparison to the\nbaseline algorithms, namely Greedy-SC-RP and MANF-DNN-RP, MANF-RL-RP has\nexhibited a significant improvement in terms of task completion rate.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 23:54:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Han","Lei",""],["Tu","Chunyu",""],["Yu","Zhiwen",""],["Yu","Zhiyong",""],["Shan","Weihua",""],["Wang","Liang",""],["Guo","Bin",""]]}
{"id":"2308.11089","submitter":"Yi Shen","authors":"Yi Shen and Lin Chen","title":"The additivity of states uniquely determined by marginals","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pure states that can be uniquely determined among all (UDA) states by\ntheir marginals are essential to efficient quantum state tomography. We\ngeneralize the UDA states from the context of pure states to that of arbitrary\n(no matter pure or mixed) states, motivated by the efficient state tomography\nof low-rank states. We call the \\emph{additivity} of $k$-UDA states for three\ndifferent composite ways of tensor product, if the composite state of two\n$k$-UDA states is still uniquely determined by the $k$-partite marginals for\nthe corresponding type of tensor product. We show that the additivity holds if\none of the two initial states is pure, and present the conditions under which\nthe additivity holds for two mixed UDA states. One of the three composite ways\nof tensor product is also adopted to construct genuinely multipartite entangled\n(GME) states. Therefore, it is effective to construct multipartite $k$-UDA\nstate with genuine entanglement by uniting the additivity of $k$-UDA states and\nthe construction of GME states.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:06:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shen","Yi",""],["Chen","Lin",""]]}
{"id":"2308.11090","submitter":"Fran\\c{c}ois Hu","authors":"Philipp Ratz and Fran\\c{c}ois Hu and Arthur Charpentier","title":"Addressing Fairness and Explainability in Image Classification Using\n  Optimal Transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Algorithmic Fairness and the explainability of potentially unfair outcomes\nare crucial for establishing trust and accountability of Artificial\nIntelligence systems in domains such as healthcare and policing. Though\nsignificant advances have been made in each of the fields separately, achieving\nexplainability in fairness applications remains challenging, particularly so in\ndomains where deep neural networks are used. At the same time, ethical\ndata-mining has become ever more relevant, as it has been shown countless times\nthat fairness-unaware algorithms result in biased outcomes. Current approaches\nfocus on mitigating biases in the outcomes of the model, but few attempts have\nbeen made to try to explain \\emph{why} a model is biased. To bridge this gap,\nwe propose a comprehensive approach that leverages optimal transport theory to\nuncover the causes and implications of biased regions in images, which easily\nextends to tabular data as well. Through the use of Wasserstein barycenters, we\nobtain scores that are independent of a sensitive variable but keep their\nmarginal orderings. This step ensures predictive accuracy but also helps us to\nrecover the regions most associated with the generation of the biases. Our\nfindings hold significant implications for the development of trustworthy and\nunbiased AI systems, fostering transparency, accountability, and fairness in\ncritical decision-making scenarios across diverse domains.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:10:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ratz","Philipp",""],["Hu","Fran\u00e7ois",""],["Charpentier","Arthur",""]]}
{"id":"2308.11091","submitter":"Zhengxian Mei","authors":"A. Liam Fitzpatrick and Zhengxian Mei","title":"LSZ in Action: Extracting Form Factors from Correlators\n  Nonperturbatively in 2d $\\phi^4$ Theory","comments":"29 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we compute multiparticle form factors of local operators in 2d\n$\\phi^4$ theory using a recently proposed method [1] for efficiently\nimplementing the LSZ prescription with Hamiltonian Truncation methods, and we\nadopt Lightcone Conformal Truncation (LCT) in particular for our calculations.\nWe perform various checks of our results at weak and strong coupling, and\nelucidate the parametric behavior of truncation errors.\n  This opens up the possibility to compute S-matrix in various strongly coupled\nmodels using the LSZ method in LCT.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:16:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fitzpatrick","A. Liam",""],["Mei","Zhengxian",""]]}
{"id":"2308.11092","submitter":"Allen Shafter","authors":"William A. Burris, Allen W. Shafter, Kamil Hornoch","title":"Do the Outburst Properties of M31N 2008-12a Depend on the Time Since the\n  Previous Eruption?","comments":"5 pages, 1 figure, 1 table (data behind the figure); accepted for\n  publication in Research Notes of the AAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Photometric observations spanning the UV to the near IR during the nine most\nrecent eruptions (2014-2022) of the extragalactic nova M31N 2008-12a are\npresented and analyzed in order to explore whether the lightcurve properties\nfor a given eruption, specifically the peak magnitudes and fade rates, are\ncorrelated with the time interval since the previous eruption. No significant\ncorrelation between the pre-eruption interval and the rate of decline was\nfound, however it appears that the brightness at the peak of an outburst may be\npositively correlated with the time interval since the previous eruption.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:19:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Burris","William A.",""],["Shafter","Allen W.",""],["Hornoch","Kamil",""]]}
{"id":"2308.11093","submitter":"Thomas Kipf","authors":"Georg Heigold, Matthias Minderer, Alexey Gritsenko, Alex Bewley,\n  Daniel Keysers, Mario Lu\\v{c}i\\'c, Fisher Yu, Thomas Kipf","title":"Video OWL-ViT: Temporally-consistent open-world localization in video","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an architecture and a training recipe that adapts pre-trained\nopen-world image models to localization in videos. Understanding the open\nvisual world (without being constrained by fixed label spaces) is crucial for\nmany real-world vision tasks. Contrastive pre-training on large image-text\ndatasets has recently led to significant improvements for image-level tasks.\nFor more structured tasks involving object localization applying pre-trained\nmodels is more challenging. This is particularly true for video tasks, where\ntask-specific data is limited. We show successful transfer of open-world models\nby building on the OWL-ViT open-vocabulary detection model and adapting it to\nvideo by adding a transformer decoder. The decoder propagates object\nrepresentations recurrently through time by using the output tokens for one\nframe as the object queries for the next. Our model is end-to-end trainable on\nvideo data and enjoys improved temporal consistency compared to\ntracking-by-detection baselines, while retaining the open-world capabilities of\nthe backbone detector. We evaluate our model on the challenging TAO-OW\nbenchmark and demonstrate that open-world capabilities, learned from\nlarge-scale image-text pre-training, can be transferred successfully to\nopen-world localization across diverse videos.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:21:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Heigold","Georg",""],["Minderer","Matthias",""],["Gritsenko","Alexey",""],["Bewley","Alex",""],["Keysers","Daniel",""],["Lu\u010di\u0107","Mario",""],["Yu","Fisher",""],["Kipf","Thomas",""]]}
{"id":"2308.11094","submitter":"Peter Suranyi","authors":"Lauren Street, Peter Suranyi, and L.C.R. Wijewardhana","title":"WKB approximation to boson dark matter","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Galactic dark matter halos may be composed of ultralight axions (ULAs) ($m_a\n\\lesssim 1$ eV) with wave functions that satisfy nonlinear\nSchr\\\"{o}dinger-Poisson equations (SPA). We find eigenstates of SPA in WKB\napproximation. The expansion parameter of the WKB approximation is\n$\\delta=1/\\sqrt{S}$, where $S=2 M R G m_a^{2}$, with $M$ being the total mass,\n$R$ the radius of the halo, and $G$ the gravitational constant. $S\\gg 1$ for\nalmost all galaxies, even if the ULA mass is as small as $m_a=10^{-22} $ eV,\nmaking the leading order WKB approximation almost exact. As the level spacing\nof bound states is roughly proportional to $\\delta$, the number of states in\nthe gravitational well is huge. We do not see a reason why not all or most of\nthem contribute to the halo. Using an appropriate distribution function allows\nthe summation of states to construct the profile of the halo as a function of\nthe gravitational potential, which can be found solving the Poisson equation.\nUsing various energy distribution functions, we obtain results similar to those\nin simulations. Future plans include investigations of collapse through time\ndependent generalizations, and inclusion of self-interactions, which also\ninduce decay processes of the halo.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:24:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Street","Lauren",""],["Suranyi","Peter",""],["Wijewardhana","L. C. R.",""]]}
{"id":"2308.11095","submitter":"S Y Anushka Santhika Thenuwara PhD","authors":"Anushka Thenuwara and Andrei Sidorov","title":"Ramsey interferometry in three-level and five-level systems of $^{87}Rb$\n  Bose-Einstein condensates","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our work here presents the analytical expressions for a typical Ramsey\ninterferometric sequence for a three- and a five-level system. The analytical\nexpressions are derived starting from the first principals of unitary time\nevolution operators. We focus on the three- and five-level systems because we\npropose a novel Ramsey interferometer created by a trapped two-state\nBose-Einstein Condensate driven by dipole oscillations and gravitational sag.\nIt involves the $^{87}Rb$ atoms in states $\\vert F=2, m_F=+2 \\rangle$ $(\\vert\n+2 \\rangle)$ and $\\vert F=2, m_F=+1 \\rangle$ $(\\vert +1 \\rangle)$ of the $5\n^2S_{\\frac{1}{2}}$ ground state. Though the interferometer focusses on the\ntwo-levels, the experimental readouts involve all the five states in $F = 2$\nhyperfine manifold. Therefore, the analytical derivation was first tested for\nthree-levels and then expanded to five-levels. We developed the expressions for\nfive-levels for greater analytical accuracy of the experimental scenario. This\nwork provides a step-by-step outline for the derivation and methodology for the\nanalytical expressions. These analytical formulae denote the population\nvariation during Rabi and Ramsey oscillations for each state as well as the\noverall average for both the three- and five-level cases. The expressions are\nderived within the rotating wave approximation (RWA) under the equal Rabi\ncondition. Further, by following the derivation methodology, these analytical\nexpressions can be easily expanded for Ramsey sequences with unequal pulses,\nand Ramsey sequences with spin echo techniques.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:32:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Thenuwara","Anushka",""],["Sidorov","Andrei",""]]}
{"id":"2308.11096","submitter":"Devesh Tiwari","authors":"Daniel Silver, Tirthak Patel, William Cutler, Aditya Ranjan, Harshitta\n  Gandhi, Devesh Tiwari","title":"MosaiQ: Quantum Generative Adversarial Networks for Image Generation on\n  NISQ Computers","comments":"Accepted to appear at ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AR cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum machine learning and vision have come to the fore recently, with\nhardware advances enabling rapid advancement in the capabilities of quantum\nmachines. Recently, quantum image generation has been explored with many\npotential advantages over non-quantum techniques; however, previous techniques\nhave suffered from poor quality and robustness. To address these problems, we\nintroduce, MosaiQ, a high-quality quantum image generation GAN framework that\ncan be executed on today's Near-term Intermediate Scale Quantum (NISQ)\ncomputers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:40:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Silver","Daniel",""],["Patel","Tirthak",""],["Cutler","William",""],["Ranjan","Aditya",""],["Gandhi","Harshitta",""],["Tiwari","Devesh",""]]}
{"id":"2308.11097","submitter":"Taro Nakajima","authors":"Taro Nakajima, Masao Watanabe, Yasuhiro Inamura, Kazuki Matsui, Tomoki\n  Kanda, Tetsuya Nomoto, Kazuki Ohishi, Yukihiko Kawamura, Hiraku Saito, Hiromu\n  Tamatsukuri, Noriki Terada, and Yoshimitsu Kohama","title":"Stroboscopic Time-of-Flight Neutron Diffraction in Long Pulsed Magnetic\n  Fields","comments":"9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present proof-of-principle experiments of stroboscopic time-of-flight\n(TOF) neutron diffraction in long pulsed magnetic fields. By utilizing electric\ndouble-layer capacitors, we developed a long pulsed magnet for neutron\ndiffraction measurements, which generates pulsed magnetic fields with the full\nwidths at the half maximum of more than $10^2$ ms. The field variation is slow\nenough to be approximated as a steady field within the time scale of a\npolychromatic neutron pulse passing through a sample placed in a distance of\nthe order of $10^1$ m from the neutron source. This enables us to efficiently\nexplore the reciprocal space using a wide range of neutron wavelength in high\nmagnetic fields. We applied this technique to investigate field-induced\nmagnetic phases in the triangular lattice antiferromagnets\nCuFe$_{1-x}$Ga$_x$O$_2$ ($x=0, 0.035$).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:43:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nakajima","Taro",""],["Watanabe","Masao",""],["Inamura","Yasuhiro",""],["Matsui","Kazuki",""],["Kanda","Tomoki",""],["Nomoto","Tetsuya",""],["Ohishi","Kazuki",""],["Kawamura","Yukihiko",""],["Saito","Hiraku",""],["Tamatsukuri","Hiromu",""],["Terada","Noriki",""],["Kohama","Yoshimitsu",""]]}
{"id":"2308.11098","submitter":"Lirand\\\"e Pira","authors":"Lirand\\\"e Pira, Chris Ferrie","title":"Explicability and Inexplicability in the Interpretation of Quantum\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interpretability of artificial intelligence (AI) methods, particularly deep\nneural networks, is of great interest due to the widespread use of AI-backed\nsystems, which often have unexplainable behavior. The interpretability of such\nmodels is a crucial component of building trusted systems. Many methods exist\nto approach this problem, but they do not obviously generalize to the quantum\nsetting. Here we explore the interpretability of quantum neural networks using\nlocal model-agnostic interpretability measures of quantum and classical neural\nnetworks. We introduce the concept of the band of inexplicability, representing\nthe interpretable region in which data samples have no explanation, likely\nvictims of inherently random quantum measurements. We see this as a step toward\nunderstanding how to build responsible and accountable quantum AI models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:43:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pira","Lirand\u00eb",""],["Ferrie","Chris",""]]}
{"id":"2308.11099","submitter":"Ion Garate","authors":"Xinyuan Xu, David S\\'en\\'echal, Ion Garate","title":"Theory of a topological analogue of the magnetic bit","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In magnetic memories, the state of a ferromagnet is encoded in the\norientation of its magnetization. The energy of the system is minimized when\nthe magnetization is parallel or antiparallel to a preferred (easy) axis. These\ntwo stable directions define the logical bit. Under an external perturbation,\nthe direction of magnetization can be controllably reversed and thus the bit\nflipped. Here, we theoretically design a topological analogue of the magnetic\nbit in the Su-Schrieffer-Heeger (SSH)-Holstein model, where we show that a\ntransient external perturbation can lead to a permanent change in the\nelectronic band topology.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:46:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Xu","Xinyuan",""],["S\u00e9n\u00e9chal","David",""],["Garate","Ion",""]]}
{"id":"2308.11100","submitter":"Elsayed Mohammed","authors":"Elsayed Mohammed, Omar Mashaal and Hatem Abou-Zeid","title":"Using Early Exits for Fast Inference in Automatic Modulation\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic modulation classification (AMC) plays a critical role in wireless\ncommunications by autonomously classifying signals transmitted over the radio\nspectrum. Deep learning (DL) techniques are increasingly being used for AMC due\nto their ability to extract complex wireless signal features. However, DL\nmodels are computationally intensive and incur high inference latencies. This\npaper proposes the application of early exiting (EE) techniques for DL models\nused for AMC to accelerate inference. We present and analyze four early exiting\narchitectures and a customized multi-branch training algorithm for this\nproblem. Through extensive experimentation, we show that signals with moderate\nto high signal-to-noise ratios (SNRs) are easier to classify, do not require\ndeep architectures, and can therefore leverage the proposed EE architectures.\nOur experimental results demonstrate that EE techniques can significantly\nreduce the inference speed of deep neural networks without sacrificing\nclassification accuracy. We also thoroughly study the trade-off between\nclassification accuracy and inference time when using these architectures. To\nthe best of our knowledge, this work represents the first attempt to apply\nearly exiting methods to AMC, providing a foundation for future research in\nthis area.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:51:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mohammed","Elsayed",""],["Mashaal","Omar",""],["Abou-Zeid","Hatem",""]]}
{"id":"2308.11101","submitter":"Can-Li Song Dr","authors":"Li-Xuan Wei, Peng-Cheng Xiao, Fangsen Li, Li Wang, Bo-Yuan Deng,\n  Fang-Jun Cheng, Fa-Wei Zheng, Ning Hao, Ping Zhang, Xu-Cun Ma, Qi-Kun Xue,\n  Can-Li Song","title":"Discovery of smectic charge and pair-density-wave orders in topological\n  monolayer 1T$^\\prime$-MoTe$_2$","comments":"16 pages, 4 figures, Supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electronic liquid-crystal phases are observed in numerous strongly-correlated\nsystems including high-temperature superconductors. However, identifying these\nexotic phases and understanding their interplay with superconductivity in\ntopological materials remain challenging. Here we employ a cryogenic scanning\ntunneling microscopy to discover a smectic (stripe) charge order (CO) and a\nprimary pair-density-wave (PDW) in topological monolayer 1T$^\\prime$-MoTe$_2$.\nThe two orders are spatially modulated unidirectionally at the same wavevector,\nbut have a marked spatial phase difference of about 2$\\pi$/5. Importantly, the\nprimary PDW state features a two-gap superconductivity below the transition\ntemperature of 6.0 K and induces another unique particle-hole-symmetric CO at\ntwice the PDW wavevector. Combining these results and our density functional\ncalculations, we reveal that the two smectic orders are primarily driven by\nnesting behaviors between electron and hole pockets. Our findings establish\nmonolayer 1T$^\\prime$-MoTe$_2$ as a topological paradigm for exploring\nelectronic smecticity, which intertwines with multiple preexisting\nsymmetry-breaking states.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:54:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wei","Li-Xuan",""],["Xiao","Peng-Cheng",""],["Li","Fangsen",""],["Wang","Li",""],["Deng","Bo-Yuan",""],["Cheng","Fang-Jun",""],["Zheng","Fa-Wei",""],["Hao","Ning",""],["Zhang","Ping",""],["Ma","Xu-Cun",""],["Xue","Qi-Kun",""],["Song","Can-Li",""]]}
{"id":"2308.11102","submitter":"Shingo Taki","authors":"Kei Miura, Shingo Taki","title":"Quartic surfaces with a Galois point and Eisenstein K3 surfaces","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that a quartic surface with an inner Galois point has the structure\nof an Eisenstein $K3$ surface of type $(4, 3)$. Furthermore we prove that the\nquartic surface with 8 (the maximum number) inner Galois points has not only\nthis structure but also the structure of an Eisenstein $K3$ surface of type\n$(20, 1)$. In particular, it is isomorphic to Vinberg's $K3$ surface $X_{3}$\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:57:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Miura","Kei",""],["Taki","Shingo",""]]}
{"id":"2308.11103","submitter":"Joel Niklaus","authors":"Alex Nyffenegger, Matthias St\\\"urmer, Joel Niklaus","title":"Anonymity at Risk? Assessing Re-Identification Capabilities of Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Anonymity of both natural and legal persons in court rulings is a critical\naspect of privacy protection in the European Union and Switzerland. With the\nadvent of LLMs, concerns about large-scale re-identification of anonymized\npersons are growing. In accordance with the Federal Supreme Court of\nSwitzerland, we explore the potential of LLMs to re-identify individuals in\ncourt rulings by constructing a proof-of-concept using actual legal data from\nthe Swiss federal supreme court. Following the initial experiment, we\nconstructed an anonymized Wikipedia dataset as a more rigorous testing ground\nto further investigate the findings. With the introduction and application of\nthe new task of re-identifying people in texts, we also introduce new metrics\nto measure performance. We systematically analyze the factors that influence\nsuccessful re-identifications, identifying model size, input length, and\ninstruction tuning among the most critical determinants. Despite high\nre-identification rates on Wikipedia, even the best LLMs struggled with court\ndecisions. The complexity is attributed to the lack of test datasets, the\nnecessity for substantial training resources, and data sparsity in the\ninformation used for re-identification. In conclusion, this study demonstrates\nthat re-identification using LLMs may not be feasible for now, but as the\nproof-of-concept on Wikipedia showed, it might become possible in the future.\nWe hope that our system can help enhance the confidence in the security of\nanonymized decisions, thus leading to the courts being more confident to\npublish decisions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 00:57:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nyffenegger","Alex",""],["St\u00fcrmer","Matthias",""],["Niklaus","Joel",""]]}
{"id":"2308.11104","submitter":"Luyi Yang","authors":"Haochen Zhang, Zhixuan Bi, Zehua Zhai, Han Gao, Yuwei Liu, Meiling\n  Jin, Meng Ye, Xuanzhang Li, Haowen Liu, Yuegang Zhang, Xiang Li, Hairen Tan,\n  Yong Xu, Luyi Yang","title":"Revealing unusual bandgap shifts with temperature and bandgap\n  renormalization effect in phase-stabilized metal halide perovskites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hybrid organic-inorganic metal halide perovskites are emerging materials in\nphotovoltaics, whose bandgap is one of the most crucial parameters governing\ntheir light harvesting performance. Here we present temperature and\nphotocarrier density dependence of the bandgap in two phase-stabilized\nperovskite thin films (MA0.3FA0.7PbI3 and MA0.3FA0.7Pb0.5Sn0.5I3) using\nphotoluminescence and absorption spectroscopy. Contrasting bandgap shifts with\ntemperature are observed between the two perovskites. By utilizing X-ray\ndiffraction and in situ high pressure photoluminescence spectroscopy, we show\nthat the thermal expansion plays only a minor role on the large bandgap\nblueshift due to the enhanced structural stability in our samples. Our\nfirst-principles calculations further demonstrate the significant impact of\nthermally induced lattice distortions on the bandgap widening and reveal that\nthe anomalous trends are caused by the competition between the static and\ndynamic distortions. Additionally, both the bandgap renormalization and band\nfilling effects are directly observed for the first time in fluence-dependent\nphotoluminescence measurements and are employed to estimate the exciton\neffective mass. Our results provide new insights into the basic understanding\nof thermal and charge-accumulation effects on the band structure of hybrid\nperovskites.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:00:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Haochen",""],["Bi","Zhixuan",""],["Zhai","Zehua",""],["Gao","Han",""],["Liu","Yuwei",""],["Jin","Meiling",""],["Ye","Meng",""],["Li","Xuanzhang",""],["Liu","Haowen",""],["Zhang","Yuegang",""],["Li","Xiang",""],["Tan","Hairen",""],["Xu","Yong",""],["Yang","Luyi",""]]}
{"id":"2308.11105","submitter":"Tejasi Bhatnagar","authors":"Tejasi Bhatnagar and Yu Fu","title":"Abelian varieties with real multiplication: classification and isogeny\n  classes over finite fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we provide a classification of certain points on Hilbert\nmodular varieties over finite fields under a mild assumption on Newton polygon.\nFurthermore, we use this characterization to prove estimates for the size of\nisogeny classes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:01:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bhatnagar","Tejasi",""],["Fu","Yu",""]]}
{"id":"2308.11106","submitter":"Dongkwon Jin","authors":"Dongkwon Jin, Dahyun Kim, Chang-Su Kim","title":"Recursive Video Lane Detection","comments":"ICCV 2023 accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A novel algorithm to detect road lanes in videos, called recursive video lane\ndetector (RVLD), is proposed in this paper, which propagates the state of a\ncurrent frame recursively to the next frame. RVLD consists of an intra-frame\nlane detector (ILD) and a predictive lane detector (PLD). First, we design ILD\nto localize lanes in a still frame. Second, we develop PLD to exploit the\ninformation of the previous frame for lane detection in a current frame. To\nthis end, we estimate a motion field and warp the previous output to the\ncurrent frame. Using the warped information, we refine the feature map of the\ncurrent frame to detect lanes more reliably. Experimental results show that\nRVLD outperforms existing detectors on video lane datasets. Our codes are\navailable at https://github.com/dongkwonjin/RVLD.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:02:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jin","Dongkwon",""],["Kim","Dahyun",""],["Kim","Chang-Su",""]]}
{"id":"2308.11107","submitter":"Daigo Shoji","authors":"Daigo Shoji","title":"Classification of the lunar surface pattern by AI architectures: Does AI\n  see a rabbit in the Moon?","comments":"15 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In Asian countries, there is a tradition that a rabbit (the Moon rabbit)\nlives on the Moon. As the origin of this tradition, usually, two reasons are\nmentioned. One reason is that the color pattern of the lunar surface is similar\nto the shape of a rabbit. The other reason is that both the Moon and rabbit are\nsymbols of fertility because the Moon appears and disappears (i.e., waxing and\nwaning) cyclically, and rabbits bear children frequently. Considering the\nlatter reason, is the lunar surface color pattern not similar to a rabbit?\nHere, the similarity between rabbit and the lunar surface pattern was evaluated\nusing seven AI architectures. In the test by CLIP, assuming that people look at\nthe Moon in the early evening frequently, the lunar surface is more similar to\na rabbit than a face at low latitude regions, while it can be classified as\nface as latitude increases, which is consistent with that the oldest literature\nabout the Moon rabbit was written in India and that there is a culture of\nhuman's face in the Moon in Europe. Tested with ImageNet weights, ConvNeXt and\nCLIP sometimes classified the lunar surface pattern into rabbit with relatively\nhigh probabilities. Cultures are generated by our attitude to the environment.\nBoth dynamic and static similarities may be required to induce our imagination.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:05:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shoji","Daigo",""]]}
{"id":"2308.11108","submitter":"Jason Lynch","authors":"Surendra B. Anantharaman, Jason Lynch, Mariya Aleksich, Christopher E.\n  Stevens, Christopher Munley, Bongjun Choi, Sridhar Shenoy, Thomas Darlington,\n  Arka Majumdar, P. James Shuck, Joshua Hendrickson, J. Nathan Hohman, Deep\n  Jariwala","title":"Ultrastrong Light-Matter Coupling in 2D Metal-Chalcogenates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hybridization of excitons with photons to form hybrid quasiparticles,\nexciton-polaritons (EPs), has been widely investigated in a range of\nsemiconductor material systems coupled to photonic cavities. Self-hybridization\noccurs when the semiconductor itself can serve as the photonic cavity medium\nresulting in strongly-coupled EPs with Rabi splitting energies > 200 meV at\nroom temperatures which recently were observed in layered two-dimensional (2D)\nexcitonic materials. Here, we report an extreme version of this phenomenon, an\nultrastrong EP coupling, in a nascent, 2D excitonic system, the metal organic\nchalcogenate (MOCHA) compound named mithrene. The resulting self-hybridized EPs\nin mithrene crystals placed on Au substrates show Rabi Splitting in the\nultrastrong coupling range (> 600 meV) due to the strong oscillator strength of\nthe excitons concurrent with the large refractive indices of mithrene. We\nfurther show bright EP emission at room temperature as well as EP dispersions\nat low-temperatures. Importantly, we find lower EP emission linewidth narrowing\nto ~1 nm when mithrene crystals are placed in closed Fabry-Perot cavities. Our\nresults suggest that MOCHA materials are ideal for polaritonics in the deep\ngreen-blue part of the spectrum where strong excitonic materials with large\noptical constants are notably scarce.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:05:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Anantharaman","Surendra B.",""],["Lynch","Jason",""],["Aleksich","Mariya",""],["Stevens","Christopher E.",""],["Munley","Christopher",""],["Choi","Bongjun",""],["Shenoy","Sridhar",""],["Darlington","Thomas",""],["Majumdar","Arka",""],["Shuck","P. James",""],["Hendrickson","Joshua",""],["Hohman","J. Nathan",""],["Jariwala","Deep",""]]}
{"id":"2308.11109","submitter":"Maher Boudabra","authors":"Maher Boudabra, Binghao Wu","title":"A note on a deterministic property to obtain the long run behavior of\n  the range of a stochastic process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Brownian motion with drift is simply a process $V^{\\eta}_t$ of the form\n$V^{\\eta}_t=B_{t}+\\eta t$ where $B_{t}$ is a standard Brownian motion and\n$\\eta>0$ \\footnote{The case $\\eta<0$ is deducible by remarking\n$V^{-\\eta}(t)=-V^{\\eta}(t)$.} In \\cite{tanre2006range}, the authors considered\nthe drifted Brownian motion and studied the statistics of some related\nsequences defined by certain stopping times. In particular, they provided the\nlaw of the range $R_{t}(V^{\\eta})$ of $V^{\\eta}$ as well as its first range\nprocess $\\theta_{V^{\\eta}}(a)$. In particular, they investigated the asymptotic\ncomportment of $R_{t}(V^{\\eta})$ and $\\theta_{V^{\\eta}}(a)$. They proved that\nif $V_{t}^{\\eta}$ is a Brownian motion with a positive drift $\\eta$ then its\nrange $R_{t}(V^{\\eta})=\\sup_{0\\leq s\\leq t}V_{t}^{\\eta}-\\inf_{0\\leq s\\leq\nt}V_{t}^{\\eta}$ is asymptotically equivalent to $\\eta t$. In other words\n  \\begin{equation}\n\\frac{R_{t}(V^{\\eta})}{t}\\overset{a.e}{\\underset{t\\rightarrow\\infty}{\\longrightarrow}}\\eta.\\label{range}\n\\end{equation} In this paper, we show that (\\ref{range}) follows from a\nstriking deterministic property. More precisely, we show that the long run\nbehavior of the range of a deterministic continuous function is obtainable\nstraightaway from that of the function itself. Our result can be deemed as the\ncontinuous version of a similar one appeared in \\cite{mgrw}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:10:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Boudabra","Maher",""],["Wu","Binghao",""]]}
{"id":"2308.11110","submitter":"Natasha Fernandes","authors":"M\\'ario S. Alvim, Natasha Fernandes, Annabelle McIver, Carroll Morgan\n  and Gabriel H. Nunes","title":"A novel analysis of utility in privacy pipelines, using Kronecker\n  products and quantitative information flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We combine Kronecker products, and quantitative information flow, to give a\nnovel formal analysis for the fine-grained verification of utility in complex\nprivacy pipelines. The combination explains a surprising anomaly in the\nbehaviour of utility of privacy-preserving pipelines -- that sometimes a\nreduction in privacy results also in a decrease in utility. We use the standard\nmeasure of utility for Bayesian analysis, introduced by Ghosh at al., to\nproduce tractable and rigorous proofs of the fine-grained statistical behaviour\nleading to the anomaly. More generally, we offer the prospect of\nformal-analysis tools for utility that complement extant formal analyses of\nprivacy. We demonstrate our results on a number of common privacy-preserving\ndesigns.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:22:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Alvim","M\u00e1rio S.",""],["Fernandes","Natasha",""],["McIver","Annabelle",""],["Morgan","Carroll",""],["Nunes","Gabriel H.",""]]}
{"id":"2308.11111","submitter":"Ru Peng","authors":"Ru Peng, Qiuyang Duan, Haobo Wang, Jiachen Ma, Yanbo Jiang, Yongjun\n  Tu, Xiu Jiang, Junbo Zhao","title":"CAME: Contrastive Automated Model Evaluation","comments":"ICCV2023 main conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Automated Model Evaluation (AutoEval) framework entertains the\npossibility of evaluating a trained machine learning model without resorting to\na labeled testing set. Despite the promise and some decent results, the\nexisting AutoEval methods heavily rely on computing distribution shifts between\nthe unlabelled testing set and the training set. We believe this reliance on\nthe training set becomes another obstacle in shipping this technology to\nreal-world ML development. In this work, we propose Contrastive Automatic Model\nEvaluation (CAME), a novel AutoEval framework that is rid of involving training\nset in the loop. The core idea of CAME bases on a theoretical analysis which\nbonds the model performance with a contrastive loss. Further, with extensive\nempirical validation, we manage to set up a predictable relationship between\nthe two, simply by deducing on the unlabeled/unseen testing set. The resulting\nframework CAME establishes a new SOTA results for AutoEval by surpassing prior\nwork significantly.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:24:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Peng","Ru",""],["Duan","Qiuyang",""],["Wang","Haobo",""],["Ma","Jiachen",""],["Jiang","Yanbo",""],["Tu","Yongjun",""],["Jiang","Xiu",""],["Zhao","Junbo",""]]}
{"id":"2308.11112","submitter":"Hajime Suzuki Dr","authors":"Farina Riaz, Shahab Abdulla, Hajime Suzuki, Srinjoy Ganguly, Ravinesh\n  C. Deo and Susan Hopkins","title":"Development of a Novel Quantum Pre-processing Filter to Improve Image\n  Classification Accuracy of Neural Network Models","comments":"13 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a novel quantum pre-processing filter (QPF) to improve\nthe image classification accuracy of neural network (NN) models. A simple four\nqubit quantum circuit that uses Y rotation gates for encoding and two\ncontrolled NOT gates for creating correlation among the qubits is applied as a\nfeature extraction filter prior to passing data into the fully connected NN\narchitecture. By applying the QPF approach, the results show that the image\nclassification accuracy based on the MNIST (handwritten 10 digits) and the\nEMNIST (handwritten 47 class digits and letters) datasets can be improved, from\n92.5% to 95.4% and from 68.9% to 75.9%, respectively. These improvements were\nobtained without introducing extra model parameters or optimizations in the\nmachine learning process. However, tests performed on the developed QPF\napproach against a relatively complex GTSRB dataset with 43 distinct class\nreal-life traffic sign images showed a degradation in the classification\naccuracy. Considering this result, further research into the understanding and\nthe design of a more suitable quantum circuit approach for image classification\nneural networks could be explored utilizing the baseline method proposed in\nthis paper.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:27:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Riaz","Farina",""],["Abdulla","Shahab",""],["Suzuki","Hajime",""],["Ganguly","Srinjoy",""],["Deo","Ravinesh C.",""],["Hopkins","Susan",""]]}
{"id":"2308.11113","submitter":"Kazumasa Fujiwara","authors":"Kazumasa Fujiwara and Vladimir Georgiev","title":"Lifespan estimates for 1d damped wave equation with zero moment initial\n  data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this manuscript, a sharp lifespan estimate of solutions to semilinear\nclassical damped wave equation is investigated in one dimensional case when the\nFourier 0th moment of sum of initial position and speed is $0$. Especially, it\nis shown that the behavior of lifespan changes with $p=3/2$ with respect to the\nsize of the initial data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:35:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fujiwara","Kazumasa",""],["Georgiev","Vladimir",""]]}
{"id":"2308.11114","submitter":"Shifan Zhao","authors":"Zhining Wei, Shifan Zhao","title":"On M\\\"obius functions from automorphic forms and a generalized Sarnak's\n  conjecture","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider M\\\"obius functions associated with two types of\n$L$-functions: Rankin-Selberg $L$-functions of symmetric powers of distinct\nholomorphic cusp forms and $L$-functions of Maass cusp forms. We show that\nthese M\\\"obius functions are weakly orthogonal to bounded sequences. As a\ndirect corollary, a generalized Sarnak's conjecture holds for these two types\nof M\\\"obius functions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:38:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wei","Zhining",""],["Zhao","Shifan",""]]}
{"id":"2308.11115","submitter":"Xinsheng Tan","authors":"Yu Zhang, Yan-Qing Zhu, Jianwen Xu, Wen Zheng, Dong Lan, Giandomenico\n  Palumbo, Nathan Goldman, Shi-Liang Zhu, Xinsheng Tan, Z.D.Wang, Yang Yu","title":"Exploring Parity Magnetic Effects through Experimental Simulation with\n  Superconducting Qubits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present the successful realization of four-dimensional (4D) semimetal\nbands featuring tensor monopoles, achieved using superconducting quantum\ncircuits. Our experiment involves the creation of a highly tunable diamond\nenergy diagram with four coupled transmons, and the parametric modulation of\ntheir tunable couplers, effectively mapping momentum space to parameter space.\nThis approach enables us to establish a 4D Dirac-like Hamiltonian with fourfold\ndegenerate points. Moreover, we manipulate the energy of tensor monopoles by\nintroducing an additional pump microwave field, generating effective magnetic\nand pseudo-electric fields and simulating topological parity magnetic effects\nemerging from the parity anomaly. Utilizing non-adiabatic response methods, we\nmeasure the fractional second Chern number for a Dirac valley with a varying\nmass term, signifying a nontrivial topological phase transition connected to a\n5D Yang monopole. Our work lays the foundation for further investigations into\nhigher-dimensional topological states of matter and enriches our comprehension\nof topological phenomena.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:39:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Yu",""],["Zhu","Yan-Qing",""],["Xu","Jianwen",""],["Zheng","Wen",""],["Lan","Dong",""],["Palumbo","Giandomenico",""],["Goldman","Nathan",""],["Zhu","Shi-Liang",""],["Tan","Xinsheng",""],["Wang","Z. D.",""],["Yu","Yang",""]]}
{"id":"2308.11116","submitter":"Haesoo Chung","authors":"Haesoo Chung and Nam Ik Cho","title":"LAN-HDR: Luminance-based Alignment Network for High Dynamic Range Video\n  Reconstruction","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As demands for high-quality videos continue to rise, high-resolution and\nhigh-dynamic range (HDR) imaging techniques are drawing attention. To generate\nan HDR video from low dynamic range (LDR) images, one of the critical steps is\nthe motion compensation between LDR frames, for which most existing works\nemployed the optical flow algorithm. However, these methods suffer from flow\nestimation errors when saturation or complicated motions exist. In this paper,\nwe propose an end-to-end HDR video composition framework, which aligns LDR\nframes in the feature space and then merges aligned features into an HDR frame,\nwithout relying on pixel-domain optical flow. Specifically, we propose a\nluminance-based alignment network for HDR (LAN-HDR) consisting of an alignment\nmodule and a hallucination module. The alignment module aligns a frame to the\nadjacent reference by evaluating luminance-based attention, excluding color\ninformation. The hallucination module generates sharp details, especially for\nwashed-out areas due to saturation. The aligned and hallucinated features are\nthen blended adaptively to complement each other. Finally, we merge the\nfeatures to generate a final HDR frame. In training, we adopt a temporal loss,\nin addition to frame reconstruction losses, to enhance temporal consistency and\nthus reduce flickering. Extensive experiments demonstrate that our method\nperforms better or comparable to state-of-the-art methods on several\nbenchmarks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:43:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chung","Haesoo",""],["Cho","Nam Ik",""]]}
{"id":"2308.11117","submitter":"Linghao Wang","authors":"Linghao Wang, Zhen Liu, Peitian Ma, Qianli Ma","title":"Meta-Stock: Task-Difficulty-Adaptive Meta-learning for Sub-new Stock\n  Price Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sub-new stock price prediction, forecasting the price trends of stocks listed\nless than one year, is crucial for effective quantitative trading. While deep\nlearning methods have demonstrated effectiveness in predicting old stock\nprices, they require large training datasets unavailable for sub-new stocks. In\nthis paper, we propose Meta-Stock: a task-difficulty-adaptive meta-learning\napproach for sub-new stock price prediction. Leveraging prediction tasks\nformulated by old stocks, our meta-learning method aims to acquire the fast\ngeneralization ability that can be further adapted to sub-new stock price\nprediction tasks, thereby solving the data scarcity of sub-new stocks.\nMoreover, we enhance the meta-learning process by incorporating an adaptive\nlearning strategy sensitive to varying task difficulties. Through wavelet\ntransform, we extract high-frequency coefficients to manifest stock price\nvolatility. This allows the meta-learning model to assign gradient weights\nbased on volatility-quantified task difficulty. Extensive experiments on\ndatasets collected from three stock markets spanning twenty-two years prove\nthat our Meta-Stock significantly outperforms previous methods and manifests\nstrong applicability in real-world stock trading. Besides, we evaluate the\nreasonability of the task difficulty quantification and the effectiveness of\nthe adaptive learning strategy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:54:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Linghao",""],["Liu","Zhen",""],["Ma","Peitian",""],["Ma","Qianli",""]]}
{"id":"2308.11118","submitter":"Tristram Bogart","authors":"Tristram Bogart and Daniel Felipe Cu\\'ellar","title":"An Ehrhart theoretic approach to generalized Golomb rulers","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Golomb ruler is a sequence of integers whose pairwise differences, or\nequivalently pairwise sums, are all distinct. This definition has been\ngeneralized in various ways to allow for sums of h integers, or to allow up to\ng repetitions of a given sum or difference. Beck, Bogart, and Pham applied the\ntheory of inside-out polytopes of Beck and Zaslavsky to prove structural\nresults about the counting functions of Golomb rulers. We extend their approach\nto the various types of generalized Golomb rulers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:54:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bogart","Tristram",""],["Cu\u00e9llar","Daniel Felipe",""]]}
{"id":"2308.11119","submitter":"Masato Tamura","authors":"Masato Tamura","title":"Random Word Data Augmentation with CLIP for Zero-Shot Anomaly Detection","comments":"Accepted to BMVC2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel method that leverages a visual-language model,\nCLIP, as a data source for zero-shot anomaly detection. Tremendous efforts have\nbeen put towards developing anomaly detectors due to their potential industrial\napplications. Considering the difficulty in acquiring various anomalous samples\nfor training, most existing methods train models with only normal samples and\nmeasure discrepancies from the distribution of normal samples during inference,\nwhich requires training a model for each object category. The problem of this\ninefficient training requirement has been tackled by designing a CLIP-based\nanomaly detector that applies prompt-guided classification to each part of an\nimage in a sliding window manner. However, the method still suffers from the\nlabor of careful prompt ensembling with known object categories. To overcome\nthe issues above, we propose leveraging CLIP as a data source for training. Our\nmethod generates text embeddings with the text encoder in CLIP with typical\nprompts that include words of normal and anomaly. In addition to these words,\nwe insert several randomly generated words into prompts, which enables the\nencoder to generate a diverse set of normal and anomalous samples. Using the\ngenerated embeddings as training data, a feed-forward neural network learns to\nextract features of normal and anomaly from CLIP's embeddings, and as a result,\na category-agnostic anomaly detector can be obtained without any training\nimages. Experimental results demonstrate that our method achieves\nstate-of-the-art performance without laborious prompt ensembling in zero-shot\nsetups.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:55:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tamura","Masato",""]]}
{"id":"2308.11120","submitter":"Tariq Syed","authors":"Tariq Syed","title":"Some remarks on Spin orbits of unit vectors","comments":"16 pages; comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For $n \\in \\mathbb{N}$ and a commutative ring $R$ with $2 \\in R^{\\times}$,\nthe group $SL_n (R)$ acts on the set $Um_n (R)$ of unimodular vectors of length\n$n$ and $Spin_{2n}(R)$ acts on the set of unit vectors $U_{2n-1}(R)$. We give\nan example of a ring for which the comparison map $Um_n (R)/SL_n (R)\n\\rightarrow U_{2n-1}(R)/Spin_{2n}(R)$ fails to be bijective.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:55:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Syed","Tariq",""]]}
{"id":"2308.11121","submitter":"Yuanhang Liu","authors":"Yuanhang Liu, Weijia Wu, Donghui Yang, Jie Zhong","title":"Observability inequalities for the backward stochastic evolution\n  equations and their applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The present article delves into the investigation of observability\ninequalities pertaining to backward stochastic evolution equations. We employ a\ncombination of spectral inequalities, interpolation inequalities, and the\ntelegraph series method as our primary tools to directly establish\nobservability inequalities. Furthermore, we explore three specific equations as\napplication examples: a stochastic degenerate equation, a stochastic fourth\norder parabolic equation and a stochastic heat equation. It is noteworthy that\nthese equations can be rendered null controllability with only one control in\nthe drift term to each system.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:55:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Yuanhang",""],["Wu","Weijia",""],["Yang","Donghui",""],["Zhong","Jie",""]]}
{"id":"2308.11122","submitter":"Yu Fu","authors":"Yu Fu","title":"Families of isogenous elliptic curves ordered by height","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a family of products of elliptic curves over a rational curve over a\nnumber field $K$, we give a bound for the number of special fibers of height at\nmost $B$ such that the two factors are isogenous. We prove an upper bound that\ndepends on $K$, the family, and the height $B$. Moreover, if we slightly change\nthe definition of the height of the parametrizing family, we prove a uniform\nbound that depends only on the degree of the family, $K$, and the height $B$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 01:57:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fu","Yu",""]]}
{"id":"2308.11123","submitter":"Luke Ditria","authors":"Luke Ditria, Tom Drummond","title":"Hey That's Mine Imperceptible Watermarks are Preserved in Diffusion\n  Generated Outputs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative models have seen an explosion in popularity with the release of\nhuge generative Diffusion models like Midjourney and Stable Diffusion to the\npublic. Because of this new ease of access, questions surrounding the automated\ncollection of data and issues regarding content ownership have started to\nbuild. In this paper we present new work which aims to provide ways of\nprotecting content when shared to the public. We show that a generative\nDiffusion model trained on data that has been imperceptibly watermarked will\ngenerate new images with these watermarks present. We further show that if a\ngiven watermark is correlated with a certain feature of the training data, the\ngenerated images will also have this correlation. Using statistical tests we\nshow that we are able to determine whether a model has been trained on marked\ndata, and what data was marked. As a result our system offers a solution to\nprotect intellectual property when sharing content online.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:06:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ditria","Luke",""],["Drummond","Tom",""]]}
{"id":"2308.11124","submitter":"Pieter van Goor","authors":"Pieter van Goor, Tarek Hamel, Robert Mahony","title":"Constructive Equivariant Observer Design for Inertial Navigation","comments":"10 pages, 2 figures, to appear in Proceedings of IFAC World Congress\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inertial Navigation Systems (INS) are algorithms that fuse inertial\nmeasurements of angular velocity and specific acceleration with supplementary\nsensors including GNSS and magnetometers to estimate the position, velocity and\nattitude, or extended pose, of a vehicle. The industry-standard extended Kalman\nfilter (EKF) does not come with strong stability or robustness guarantees and\ncan be subject to catastrophic failure. This paper exploits a Lie group\nsymmetry of the INS dynamics to propose the first nonlinear observer for INS\nwith error dynamics that are almost-globally asymptotically and locally\nexponentially stable, independently of the chosen gains. The observer is aided\nonly by a GNSS measurement of position. As expected, the convergence guarantee\ndepends on persistence of excitation of the vehicle's specific acceleration in\nthe inertial frame. Simulation results demonstrate the observer's performance\nand its ability to converge from extreme errors in the initial state estimates.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:08:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["van Goor","Pieter",""],["Hamel","Tarek",""],["Mahony","Robert",""]]}
{"id":"2308.11125","submitter":"Denny Oliveira","authors":"Denny M. Oliveira","title":"Interplanetary Shock Data Base","comments":"2 Figures, 2 Listings, 2 Tables","journal-ref":null,"doi":"10.3389/fspas.2023.1240323","report-no":null,"categories":"physics.space-ph astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this manuscript, I provide an updated interplanetary shock data base I\npublished in previous works. This list has now 603 events. I also present and\ndescribe the data and methodologies used to compile this list. The main\ncontribution of this work is to provide an updated end accurate interplanetary\nshock data base for future space physics and space weather investigations. The\nlist has been uploaded to Zenodo, and a link is provided for accessing the data\nfiles. As for Frontiers requirements, the access of the list has kept to be\nrestricted during the review process. The list will be made public if/when the\nmanuscript is published.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:08:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Oliveira","Denny M.",""]]}
{"id":"2308.11126","submitter":"Guangyi Zhang","authors":"Guangyi Zhang, Qiyu Hu, Yunlong Cai, Guanding Yu","title":"Alleviating Distortion Accumulation in Multi-Hop Semantic Communication","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, semantic communication has been investigated to boost the\nperformance of end-to-end image transmission systems. However, existing\nsemantic approaches are generally based on deep learning and belong to lossy\ntransmission. Consequently, as the receiver continues to transmit received\nimages to another device, the distortion of images accumulates with each\ntransmission. Unfortunately, most recent advances overlook this issue and only\nconsider single-hop scenarios, where images are transmitted only once from a\ntransmitter to a receiver. In this letter, we propose a novel framework of a\nmulti-hop semantic communication system. To address the problem of distortion\naccumulation, we introduce a novel recursive training method for the encoder\nand decoder of semantic communication systems. Specifically, the received\nimages are recursively input into the encoder and decoder to retrain the\nsemantic communication system. This empowers the system to handle distorted\nreceived images and achieve higher performance. Our extensive simulation\nresults demonstrate that the proposed methods significantly alleviate\ndistortion accumulation in multi-hop semantic communication.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:12:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Guangyi",""],["Hu","Qiyu",""],["Cai","Yunlong",""],["Yu","Guanding",""]]}
{"id":"2308.11127","submitter":"Xuheng Cai","authors":"Xuheng Cai, Lianghao Xia, Xubin Ren, Chao Huang","title":"How Expressive are Graph Neural Networks in Recommendation?","comments":"32nd ACM International Conference on Information and Knowledge\n  Management (CIKM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph Neural Networks (GNNs) have demonstrated superior performance on\nvarious graph learning tasks, including recommendation, where they leverage\nuser-item collaborative filtering signals in graphs. However, theoretical\nformulations of their capability are scarce, despite their empirical\neffectiveness in state-of-the-art recommender models. Recently, research has\nexplored the expressiveness of GNNs in general, demonstrating that message\npassing GNNs are at most as powerful as the Weisfeiler-Lehman test, and that\nGNNs combined with random node initialization are universal. Nevertheless, the\nconcept of \"expressiveness\" for GNNs remains vaguely defined. Most existing\nworks adopt the graph isomorphism test as the metric of expressiveness, but\nthis graph-level task may not effectively assess a model's ability in\nrecommendation, where the objective is to distinguish nodes of different\ncloseness. In this paper, we provide a comprehensive theoretical analysis of\nthe expressiveness of GNNs in recommendation, considering three levels of\nexpressiveness metrics: graph isomorphism (graph-level), node automorphism\n(node-level), and topological closeness (link-level). We propose the\ntopological closeness metric to evaluate GNNs' ability to capture the\nstructural distance between nodes, which aligns closely with the objective of\nrecommendation. To validate the effectiveness of this new metric in evaluating\nrecommendation performance, we introduce a learning-less GNN algorithm that is\noptimal on the new metric and can be optimal on the node-level metric with\nsuitable modification. We conduct extensive experiments comparing the proposed\nalgorithm against various types of state-of-the-art GNN models to explore the\nexplainability of the new metric in the recommendation task. For\nreproducibility, implementation codes are available at\nhttps://github.com/HKUDS/GTE.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:17:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cai","Xuheng",""],["Xia","Lianghao",""],["Ren","Xubin",""],["Huang","Chao",""]]}
{"id":"2308.11128","submitter":"Daniel Cornejo","authors":"John C. Mantilla, Luiz C. C. M. Nagamine, Daniel Cornejo, Renato\n  Cohen, Wesley de Oliveira, Paulo Souza, Sebasti\\~ao W. da Silva, Fermin F.H.\n  Arag\\'on, Pedro L. Gastelois, Paulo C. Morais, Jos\\'e A.H. Coaquira","title":"Structural, morphological, and magnetic characterizations of\n  (FexMn1-x)2O3 nanocrystals: A comprehensive stoichiometric determination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Iron manganese trioxide (FexMn1-x)2O3 nanocrystals were synthesized by the\nsol-gel method. The 80 K Mossbauer spectrum was well-fitted using two doublets\nrepresenting the 8b and 24d crystallographic sites of the (FexMn1-x)2O3 phase\nand two weak extra sextets which were attributed to crystalline and amorphous\nhematite. Our findings showed formation of a bixbyite primary phase. The Raman\nspectrum exhibits six Raman active modes, typical of (Fe,Mn)2O3, and two extra\nRaman modes associated with the secondary hematite phase. X-ray photoelectron\nspectroscopy analysis confirmed the presence of oxygen vacancy onto the\n(FexMn1-x)2O3 particle surface, with varying oxidation states. X-band magnetic\nresonance data revealed a single broad resonance line in the whole temperature\nrange (3.8 K - 300 K). The temperature dependence of both resonance field and\nresonance linewidth shows a remarkable change in the range of 40 - 50 K, herein\ncredited to surface spin glass behavior. The model picture used assumes\n(FexMn1-x)2O3 nanoparticles with a core-shell structure. Results indicate that\nbelow about 50 K the spin system of shell reveals a paramagnetic to spin\nglass-like transition upon cooling, with a critical temperature estimated at 43\nK. In the higher temperature range, the superparamagnetic hematite (secondary)\nphase contributes remarkably to the temperature dependence of the resonance\nlinewidth. Zero-field-cooled (ZFC) and fieldcooled (FC) data show strong\nirreversibility and a peak in the ZFC curve at 33 K, attributed to a\nparamagnetic-ferrimagnetic transition of the main phase. Hysteresis curve at 5\nK shows a low coercive field of 4 kOe, with the magnetization not reaching\nsaturation at 70 kOe, suggesting the occurrence of a ferrimagnetic core with a\nmagnetic disorder at surface, characteristic of core-shell spin-glass-like\nbehavior.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:17:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mantilla","John C.",""],["Nagamine","Luiz C. C. M.",""],["Cornejo","Daniel",""],["Cohen","Renato",""],["de Oliveira","Wesley",""],["Souza","Paulo",""],["da Silva","Sebasti\u00e3o W.",""],["Arag\u00f3n","Fermin F. H.",""],["Gastelois","Pedro L.",""],["Morais","Paulo C.",""],["Coaquira","Jos\u00e9 A. H.",""]]}
{"id":"2308.11129","submitter":"Yuankai Luo","authors":"Yuankai Luo","title":"Transformers for Capturing Multi-level Graph Structure using\n  Hierarchical Distances","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph transformers need strong inductive biases to derive meaningful\nattention scores. Yet, current proposals rarely address methods capturing\nlonger ranges, hierarchical structures, or community structures, as they appear\nin various graphs such as molecules, social networks, and citation networks. In\nthis paper, we propose a hierarchy-distance structural encoding (HDSE), which\nmodels a hierarchical distance between the nodes in a graph focusing on its\nmulti-level, hierarchical nature. In particular, this yields a framework which\ncan be flexibly integrated with existing graph transformers, allowing for\nsimultaneous application with other positional representations. Through\nextensive experiments on 12 real-world datasets, we demonstrate that our HDSE\nmethod successfully enhances various types of baseline transformers, achieving\nstate-of-the-art empirical performances on 10 benchmark datasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:22:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Luo","Yuankai",""]]}
{"id":"2308.11130","submitter":"Yushuang Wu","authors":"Yushuang Wu, Xiao Li, Jinglu Wang, Xiaoguang Han, Shuguang Cui, Yan Lu","title":"Efficient View Synthesis with Neural Radiance Distribution Field","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent work on Neural Radiance Fields (NeRF) has demonstrated significant\nadvances in high-quality view synthesis. A major limitation of NeRF is its low\nrendering efficiency due to the need for multiple network forwardings to render\na single pixel. Existing methods to improve NeRF either reduce the number of\nrequired samples or optimize the implementation to accelerate the network\nforwarding. Despite these efforts, the problem of multiple sampling persists\ndue to the intrinsic representation of radiance fields. In contrast, Neural\nLight Fields (NeLF) reduce the computation cost of NeRF by querying only one\nsingle network forwarding per pixel. To achieve a close visual quality to NeRF,\nexisting NeLF methods require significantly larger network capacities which\nlimits their rendering efficiency in practice. In this work, we propose a new\nrepresentation called Neural Radiance Distribution Field (NeRDF) that targets\nefficient view synthesis in real-time. Specifically, we use a small network\nsimilar to NeRF while preserving the rendering speed with a single network\nforwarding per pixel as in NeLF. The key is to model the radiance distribution\nalong each ray with frequency basis and predict frequency weights using the\nnetwork. Pixel values are then computed via volume rendering on radiance\ndistributions. Experiments show that our proposed method offers a better\ntrade-off among speed, quality, and network size than existing methods: we\nachieve a ~254x speed-up over NeRF with similar network size, with only a\nmarginal performance decline. Our project page is at\nyushuang-wu.github.io/NeRDF.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:23:28 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wu","Yushuang",""],["Li","Xiao",""],["Wang","Jinglu",""],["Han","Xiaoguang",""],["Cui","Shuguang",""],["Lu","Yan",""]]}
{"id":"2308.11131","submitter":"Jianghao Lin","authors":"Jianghao Lin, Rong Shan, Chenxu Zhu, Kounianhua Du, Bo Chen, Shigang\n  Quan, Ruiming Tang, Yong Yu, Weinan Zhang","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential\n  Behavior Comprehension in Recommendation","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With large language models (LLMs) achieving remarkable breakthroughs in\nnatural language processing (NLP) domains, LLM-enhanced recommender systems\nhave received much attention and have been actively explored currently. In this\npaper, we focus on adapting and empowering a pure large language model for\nzero-shot and few-shot recommendation tasks. First and foremost, we identify\nand formulate the lifelong sequential behavior incomprehension problem for LLMs\nin recommendation domains, i.e., LLMs fail to extract useful information from a\ntextual context of long user behavior sequence, even if the length of context\nis far from reaching the context limitation of LLMs. To address such an issue\nand improve the recommendation performance of LLMs, we propose a novel\nframework, namely Retrieval-enhanced Large Language models (ReLLa) for\nrecommendation tasks in both zero-shot and few-shot settings. For zero-shot\nrecommendation, we perform semantic user behavior retrieval (SUBR) to improve\nthe data quality of testing samples, which greatly reduces the difficulty for\nLLMs to extract the essential knowledge from user behavior sequences. As for\nfew-shot recommendation, we further design retrieval-enhanced instruction\ntuning (ReiT) by adopting SUBR as a data augmentation technique for training\nsamples. Specifically, we develop a mixed training dataset consisting of both\nthe original data samples and their retrieval-enhanced counterparts. We conduct\nextensive experiments on a real-world public dataset (i.e., MovieLens-1M) to\ndemonstrate the superiority of ReLLa compared with existing baseline models, as\nwell as its capability for lifelong sequential behavior comprehension.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:25:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lin","Jianghao",""],["Shan","Rong",""],["Zhu","Chenxu",""],["Du","Kounianhua",""],["Chen","Bo",""],["Quan","Shigang",""],["Tang","Ruiming",""],["Yu","Yong",""],["Zhang","Weinan",""]]}
{"id":"2308.11132","submitter":"Yu Fu","authors":"Yu Fu","title":"Isogeny classes of non-simple abelian surfaces over finite fields","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $A=E \\times E_{ss}$ be an abelian surface over a finite field\n$\\mathbb{F}_{q}$, where $E$ is an ordinary elliptic curve and $E_{ss}$ is a\nsupersingular elliptic curve. We give a lower bound on the size of isomorphism\nclasses of principally polarized abelian surfaces defined over\n$\\mathbb{F}_{q^{n}}$ that are $\\overline{\\mathbb{F}}_{q}$-isogenous to $A$ by\nstudying classification of certain kind of finite group schemes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:26:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fu","Yu",""]]}
{"id":"2308.11133","submitter":"Daniel Sevcovic","authors":"Daniel Sevcovic, Cyril Izuchukwu Udeani","title":"Learning the solution operator of a nonlinear parabolic equation using\n  physics informed deep operator network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on addressing the challenges of solving analytically\nintractable differential equations that arise in scientific and engineering\nfields such as Hamilton-Jacobi-Bellman. Traditional numerical methods and\nneural network approaches for solving such equations often require independent\nsimulation or retraining when the underlying parameters change. To overcome\nthis, this study employs a physics-informed DeepONet (PI-DeepONet) to\napproximate the solution operator of a nonlinear parabolic equation.\nPI-DeepONet integrates known physics into a deep neural network, which learns\nthe solution of the PDE.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:27:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sevcovic","Daniel",""],["Udeani","Cyril Izuchukwu",""]]}
{"id":"2308.11134","submitter":"Francois Golse","authors":"Fran\\c{c}ois Golse","title":"Quantum Optimal Transport: Quantum Couplings and Many-Body Problems","comments":"81 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This text is a set of lecture notes for a 4.5-hour course given at the\nErd\\\"os Center (R\\'enyi Institute, Budapest) during the Summer School \"Optimal\nTransport on Quantum Structures\" (September 19th-23rd, 2023). Lecture I\nintroduces the quantum analogue of the Wasserstein distance of exponent $2$\ndefined in [F. Golse, C. Mouhot, T. Paul: Comm. Math. Phys. 343 (2016),\n165-205], and in [F. Golse, T. Paul: Arch. Ration. Mech. Anal. 223 (2017)\n57-94]. Lecture II discusses various applications of this quantum analogue of\nthe Wasserstein distance of exponent $2$, while Lecture III discusses several\nof its most important properties, such as the triangle inequality, and the\nKantorovich duality in the quantum setting, together with some of their\nimplications.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:28:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Golse","Fran\u00e7ois",""]]}
{"id":"2308.11135","submitter":"Hiroshi Okamoto","authors":"Hiroshi Okamoto, Iku Yoshimoto, Sota Kato, Budrul Ahsan, Shuji\n  Shinohara","title":"Testing the Power-Law Hypothesis of the Inter-Conflict Interval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The severity of war, measured by battle deaths, follows a power-law\ndistribution. Here, we demonstrate that power law also holds in the temporal\naspects of interstate conflicts. A critical quantity is the inter-conflict\ninterval (ICI), the interval between the end of a conflict in a dyad and the\nstart of the subsequent conflict in the same dyad. Using elaborate statistical\ntests, we confirmed that the ICI samples compiled from the history of\ninterstate conflicts from 1816 to 2014 followed a power-law distribution. We\npropose an information-theoretic model to account for the power-law properties\nof ICIs. The model predicts that a series of ICIs in each dyad is independently\ngenerated from an identical power-law distribution. This was confirmed by\nstatistical examination of the autocorrelation of the ICI series. Our findings\nhelp us understand the nature of wars between normal states, the significance\nof which has increased since the Russian invasion of Ukraine in 2022.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:31:28 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Okamoto","Hiroshi",""],["Yoshimoto","Iku",""],["Kato","Sota",""],["Ahsan","Budrul",""],["Shinohara","Shuji",""]]}
{"id":"2308.11136","submitter":"Simiao Zhang","authors":"Jitao Bai, Simiao Zhang, Zhonghao Chen","title":"Is There Any Social Principle for LLM-Based Agents?","comments":"3 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Focus on Large Language Model based agents should involve more than\n\"human-centered\" alignment or application. We argue that more attention should\nbe paid to the agent itself and discuss the potential of social sciences for\nagents.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:32:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bai","Jitao",""],["Zhang","Simiao",""],["Chen","Zhonghao",""]]}
{"id":"2308.11137","submitter":"Hojoon Lee","authors":"Hojoon Lee, Dongyoon Hwang, Kyushik Min, Jaegul Choo","title":"Towards Validating Long-Term User Feedbacks in Interactive\n  Recommendation Systems","comments":"Accepted to SIGIR'22","journal-ref":null,"doi":"10.1145/3477495.3531869","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interactive Recommender Systems (IRSs) have attracted a lot of attention, due\nto their ability to model interactive processes between users and recommender\nsystems. Numerous approaches have adopted Reinforcement Learning (RL)\nalgorithms, as these can directly maximize users' cumulative rewards. In IRS,\nresearchers commonly utilize publicly available review datasets to compare and\nevaluate algorithms. However, user feedback provided in public datasets merely\nincludes instant responses (e.g., a rating), with no inclusion of delayed\nresponses (e.g., the dwell time and the lifetime value). Thus, the question\nremains whether these review datasets are an appropriate choice to evaluate the\nlong-term effects of the IRS. In this work, we revisited experiments on IRS\nwith review datasets and compared RL-based models with a simple reward model\nthat greedily recommends the item with the highest one-step reward. Following\nextensive analysis, we can reveal three main findings: First, a simple greedy\nreward model consistently outperforms RL-based models in maximizing cumulative\nrewards. Second, applying higher weighting to long-term rewards leads to a\ndegradation of recommendation performance. Third, user feedbacks have mere\nlong-term effects on the benchmark datasets. Based on our findings, we conclude\nthat a dataset has to be carefully verified and that a simple greedy baseline\nshould be included for a proper evaluation of RL-based IRS approaches.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:34:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lee","Hojoon",""],["Hwang","Dongyoon",""],["Min","Kyushik",""],["Choo","Jaegul",""]]}
{"id":"2308.11138","submitter":"Chen Yang","authors":"Peiheng Gao, Ning Sun, Xuefeng Wang, Chen Yang, Ri\\v{c}ardas Zitikis","title":"NLP-based detection of systematic anomalies among the narratives of\n  consumer complaints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.CL q-fin.RM stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop an NLP-based procedure for detecting systematic nonmeritorious\nconsumer complaints, simply called systematic anomalies, among complaint\nnarratives. While classification algorithms are used to detect pronounced\nanomalies, in the case of smaller and frequent systematic anomalies, the\nalgorithms may falter due to a variety of reasons, including technical ones as\nwell as natural limitations of human analysts. Therefore, as the next step\nafter classification, we convert the complaint narratives into quantitative\ndata, which are then analyzed using an algorithm for detecting systematic\nanomalies. We illustrate the entire procedure using complaint narratives from\nthe Consumer Complaint Database of the Consumer Financial Protection Bureau.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:39:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Peiheng",""],["Sun","Ning",""],["Wang","Xuefeng",""],["Yang","Chen",""],["Zitikis","Ri\u010dardas",""]]}
{"id":"2308.11139","submitter":"Yan  Li","authors":"Yan Li, Alexander Shapiro","title":"Rectangularity and duality of distributionally robust Markov Decision\n  Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The main goal of this paper is to discuss several approaches to formulation\nof distributionally robust counterparts of Markov Decision Processes, where the\ntransition kernels are not specified exactly but rather are assumed to be\nelements of the corresponding ambiguity sets. The intent is to clarify some\nconnections between the game and static formulations of distributionally robust\nMDPs, and delineate the role of rectangularity associated with ambiguity sets\nin determining these connections.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:41:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Yan",""],["Shapiro","Alexander",""]]}
{"id":"2308.11140","submitter":"Haesoo Chung","authors":"Haesoo Chung and Nam Ik Cho","title":"High Dynamic Range Imaging of Dynamic Scenes with Saturation\n  Compensation but without Explicit Motion Compensation","comments":"WACV 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  High dynamic range (HDR) imaging is a highly challenging task since a large\namount of information is lost due to the limitations of camera sensors. For HDR\nimaging, some methods capture multiple low dynamic range (LDR) images with\naltering exposures to aggregate more information. However, these approaches\nintroduce ghosting artifacts when significant inter-frame motions are present.\nMoreover, although multi-exposure images are given, we have little information\nin severely over-exposed areas. Most existing methods focus on motion\ncompensation, i.e., alignment of multiple LDR shots to reduce the ghosting\nartifacts, but they still produce unsatisfying results. These methods also\nrather overlook the need to restore the saturated areas. In this paper, we\ngenerate well-aligned multi-exposure features by reformulating a motion\nalignment problem into a simple brightness adjustment problem. In addition, we\npropose a coarse-to-fine merging strategy with explicit saturation\ncompensation. The saturated areas are reconstructed with similar well-exposed\ncontent using adaptive contextual attention. We demonstrate that our method\noutperforms the state-of-the-art methods regarding qualitative and quantitative\nevaluations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:44:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chung","Haesoo",""],["Cho","Nam Ik",""]]}
{"id":"2308.11141","submitter":"Takao Morinari","authors":"Takao Morinari","title":"Time-reversal symmetry-breaking flux state in an organic Dirac fermion\n  system","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate symmetry breaking in the Dirac fermion phase of the organic\ncompound $\\alpha$-(BEDT-TTF)$_2$I$_3$ under pressure, where BEDT-TTF denotes\nbis(ethylenedithio)tetrathiafulvalene. The exchange interaction resulting from\ninter-molecule Coulomb repulsion leads to broken time-reversal symmetry and\nparticle-hole symmetry while preserving translational symmetry. The system\nbreaks time-reversal symmetry by creating fluxes in the unit cell. This\nsymmetry-broken state exhibits a large Nernst signal as well as thermopower. We\ncompute the Nernst signal and thermopower, demonstrating their consistency with\nexperimental results.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:50:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Morinari","Takao",""]]}
{"id":"2308.11142","submitter":"Haotian Xia","authors":"Rhys Tracy, Haotian Xia, Alex Rasla, Yuan-Fang Wang, Ambuj Singh","title":"Graph Encoding and Neural Network Approaches for Volleyball Analytics:\n  From Game Outcome to Individual Play Predictions","comments":"This paper is an extended version of the one accepted at the KDD 2023\n  Workshop on Data Science and AI for Sports (DSAI4Sports), entitled\n  'RallyGraph: Specialized Graph Encoding for Enhanced Volleyball'","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This research aims to improve the accuracy of complex volleyball predictions\nand provide more meaningful insights to coaches and players. We introduce a\nspecialized graph encoding technique to add additional contact-by-contact\nvolleyball context to an already available volleyball dataset without any\nadditional data gathering. We demonstrate the potential benefits of using graph\nneural networks (GNNs) on this enriched dataset for three different volleyball\nprediction tasks: rally outcome prediction, set location prediction, and hit\ntype prediction. We compare the performance of our graph-based models to\nbaseline models and analyze the results to better understand the underlying\nrelationships in a volleyball rally. Our results show that the use of GNNs with\nour graph encoding yields a much more advanced analysis of the data, which\nnoticeably improves prediction results overall. We also show that these\nbaseline tasks can be significantly improved with simple adjustments, such as\nremoving blocked hits. Lastly, we demonstrate the importance of choosing a\nmodel architecture that will better extract the important information for a\ncertain task. Overall, our study showcases the potential strengths and\nweaknesses of using graph encodings in sports data analytics and hopefully will\ninspire future improvements in machine learning strategies across sports and\napplications by using graphbased encodings.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:51:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tracy","Rhys",""],["Xia","Haotian",""],["Rasla","Alex",""],["Wang","Yuan-Fang",""],["Singh","Ambuj",""]]}
{"id":"2308.11143","submitter":"Chao Zhuang","authors":"Chao Zhuang, Kosuke Minami, Kota Shiba, Genki Yoshikawa","title":"Tailoring Stresses in Piezoresistive Microcantilevers for Enhanced\n  Surface Stress Sensing: Insights from Topology Optimization","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In assessing piezoresistive microcantilever sensitivity for surface stress\nsensing, the key is its capacity to translate surface stress into changes in\nresistance. This change hinges on the interplay between stresses and\npiezoresistivity. Traditional optimization has been constrained by rudimentary\n1D models, overlooking potentially superior designs. Addressing this, we\nemployed topology optimization to optimize Si(100) microcantilevers with a\np-type piezoresistor. This led to optimized designs with up to 30% enhanced\nsensitivity over conventional designs. A recurrent \"double-cantilever\"\nconfiguration emerged, which optimizes longitudinal stress and reduces\ntransverse stress at the piezoresistor, resulting in enhanced sensitivity. We\ndeveloped a simplified model to analyze stress distributions in these designs.\nBy adjusting geometrical features in this model, we identified ideal parameter\ncombinations for optimal stress distribution. Contrary to conventional designs\nfavoring short cantilevers, our findings redefine efficient surface stress\nsensing, paving the way for innovative sensor designs beyond the conventional\nrectangular cantilevers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:52:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhuang","Chao",""],["Minami","Kosuke",""],["Shiba","Kota",""],["Yoshikawa","Genki",""]]}
{"id":"2308.11144","submitter":"Pingyi Chen","authors":"Pingyi Chen, Chenglu Zhu, Zhongyi Shui, Jiatong Cai, Sunyi Zheng,\n  Shichuan Zhang, Lin Yang","title":"Exploring Unsupervised Cell Recognition with Prior Self-activation Maps","comments":"MICCAI 2023. arXiv admin note: substantial text overlap with\n  arXiv:2210.07862","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The success of supervised deep learning models on cell recognition tasks\nrelies on detailed annotations. Many previous works have managed to reduce the\ndependency on labels. However, considering the large number of cells contained\nin a patch, costly and inefficient labeling is still inevitable. To this end,\nwe explored label-free methods for cell recognition. Prior self-activation maps\n(PSM) are proposed to generate pseudo masks as training targets. To be\nspecific, an activation network is trained with self-supervised learning. The\ngradient information in the shallow layers of the network is aggregated to\ngenerate prior self-activation maps. Afterward, a semantic clustering module is\nthen introduced as a pipeline to transform PSMs to pixel-level semantic pseudo\nmasks for downstream tasks. We evaluated our method on two histological\ndatasets: MoNuSeg (cell segmentation) and BCData (multi-class cell detection).\nCompared with other fully-supervised and weakly-supervised methods, our method\ncan achieve competitive performance without any manual annotations. Our simple\nbut effective framework can also achieve multi-class cell detection which can\nnot be done by existing unsupervised methods. The results show the potential of\nPSMs that might inspire other research to deal with the hunger for labels in\nmedical area.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:54:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Pingyi",""],["Zhu","Chenglu",""],["Shui","Zhongyi",""],["Cai","Jiatong",""],["Zheng","Sunyi",""],["Zhang","Shichuan",""],["Yang","Lin",""]]}
{"id":"2308.11145","submitter":"Sho Ejiri","authors":"Sho Ejiri","title":"Splitting of algebraic fiber spaces with nef relative anti-canonical\n  divisor and decomposition of $F$-split varieties","comments":"46 pages, v2: Theorems 1.7 and 7.9 and Corollaries 1.13 and 7.16\n  added. Typos corrected","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we prove that an algebraic fiber space $f:X\\to Y$ over a\nperfect field $k$ of characteristic $p>0$ with nef relative anti-canonical\ndivisor $-K_{X/Y}$ splits into the product after taking the base change along a\nfinite cover of $Y$, if the geometric generic fiber has mild singularities and\nif one of the following conditions holds: (i) $k\\subseteq\\overline{\\mathbb\nF_p}$; (ii) $\\pi^{et}(Y)$ is finite; (iii) $-K_X$ is semi-ample and $Y$ is an\nabelian variety. As its application, we generalize Patakfalvi and Zdanowicz's\nBeauville-Bogomolov decomposition in positive characteristic to the case when\nthe anti-canonical divisor is numerically equivalent to a semi-ample divisor,\nwhich is applied to study the abundance conjecture in a new case and the\nfundamental group of an $F$-split variety with semi-ample anti-canonical\ndivisor. We also show that a variety over a finite field with nef\nanti-canonical divisor satisfying some conditions has a rational point.\nFurthermore, to show the splitting theorem, we generalize partially Popa and\nSchnell's global generation theorem and Viehweg's weak positivity theorem to\nthe case of generalized pairs in positive characteristic.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:58:51 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 23:49:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ejiri","Sho",""]]}
{"id":"2308.11146","submitter":"Adrian Dumitrescu","authors":"Adrian Dumitrescu and Andrzej Lingas","title":"Finding Small Complete Subgraphs Efficiently","comments":"14 pages, 1 figure. arXiv admin note: substantial text overlap with\n  arXiv:2105.01265","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  (I) We revisit the algorithmic problem of finding all triangles in a graph\n$G=(V,E)$ with $n$ vertices and $m$ edges. According to a result of Chiba and\nNishizeki (1985), this task can be achieved by a combinatorial algorithm\nrunning in $O(m \\alpha) = O(m^{3/2})$ time, where $\\alpha= \\alpha(G)$ is the\ngraph arboricity. We provide a new very simple combinatorial algorithm for\nfinding all triangles in a graph and show that is amenable to the same running\ntime analysis. We derive these worst-case bounds from first principles and with\nvery simple proofs that do not rely on classic results due to Nash-Williams\nfrom the 1960s.\n  (II) We extend our arguments to the problem of finding all small complete\nsubgraphs of a given fixed size. We show that the dependency on $m$ and\n$\\alpha$ in the running time $O(\\alpha^{\\ell-2} \\cdot m)$ of the algorithm of\nChiba and Nishizeki for listing all copies of $K_\\ell$, where $\\ell \\geq 3$, is\nasymptotically tight.\n  (III) We give improved arboricity-sensitive running times for counting and/or\ndetection of copies of $K_\\ell$, for small $\\ell \\geq 4$. A key ingredient in\nour algorithms is, once again, the algorithm of Chiba and Nishizeki. Our new\nalgorithms are faster than all previous algorithms in certain high-range\narboricity intervals for every $\\ell \\geq 7$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:03:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dumitrescu","Adrian",""],["Lingas","Andrzej",""]]}
{"id":"2308.11147","submitter":"Eric Palmerduca","authors":"Eric Palmerduca, Hong Qin","title":"Photon topology","comments":"54 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP physics.optics physics.plasm-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The topology of photons in vacuum is interesting because there are no photons\nwith $\\boldsymbol{k}=0$, creating a hole in momentum space. We show that while\nthe set of all photons forms a trivial vector bundle $\\gamma$ over this\nmomentum space, the $R$- and $L$-photons form topologically nontrivial\nsubbundles $\\gamma_\\pm$ with first Chern numbers $\\pm2$. In contrast, $\\gamma$\nhas no linearly polarized subbundles, and there is no Chern number associated\nwith linear polarizations. It is a known difficulty that the standard version\nof Wigner's little group method produces singular representations of the\nPoincar\\'{e} group for massless particles. By considering representations of\nthe Poincar\\'{e} group on vector bundles we obtain a version of Wigner's little\ngroup method for massless particles which avoids these singularities. We show\nthat any massless bundle representation of the Poincar\\'{e} group can be\ncanonically decomposed into irreducible bundle representations labeled by\nhelicity. This proves that the $R$- and $L$-photons are globally well-defined\nas particles and that the photon wave function can be uniquely split into $R$-\nand $L$-components. This formalism offers a method of quantizing the EM field\nwithout invoking discontinuous polarization vectors as in the traditional\nscheme. We also demonstrate that the spin-Chern number of photons is not a\npurely topological quantity. Lastly, there has been an extended debate on\nwhether photon angular momentum can be split into spin and orbital parts. Our\nwork explains the precise issues that prevent this splitting. Photons, as\nmassless irreducible bundle representations of the Poincar\\'{e} group, do not\nadmit a spin operator. Instead, the angular momentum associated with photons'\ninternal degree of freedom is described by a helicity-induced subalgebra, which\nis 3D and commuting, corresponding to the translational symmetry of $\\gamma$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:05:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Palmerduca","Eric",""],["Qin","Hong",""]]}
{"id":"2308.11148","submitter":"Junyi Lu","authors":"Junyi Lu, Lei Yu, Xiaojia Li, Li Yang, Chun Zuo","title":"LLaMA-Reviewer: Advancing Code Review Automation with Large Language\n  Models through Parameter-Efficient Fine-Tuning (Practical Experience Report)","comments":"Accepted to the 34th IEEE International Symposium on Software\n  Reliability Engineering (ISSRE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The automation of code review activities, a long-standing pursuit in software\nengineering, has been primarily addressed by numerous domain-specific\npre-trained models. Despite their success, these models frequently demand\nextensive resources for pre-training from scratch. In contrast, Large Language\nModels (LLMs) provide an intriguing alternative, given their remarkable\ncapabilities when supplemented with domain-specific knowledge. However, their\npotential for automating code review tasks remains largely unexplored.\n  In response to this research gap, we present LLaMA-Reviewer, an innovative\nframework that leverages the capabilities of LLaMA, a popular LLM, in the realm\nof code review. Mindful of resource constraints, this framework employs\nparameter-efficient fine-tuning (PEFT) methods, delivering high performance\nwhile using less than 1% of trainable parameters.\n  An extensive evaluation of LLaMA-Reviewer is conducted on two diverse,\npublicly available datasets. Notably, even with the smallest LLaMA base model\nconsisting of 6.7B parameters and a limited number of tuning epochs,\nLLaMA-Reviewer equals the performance of existing code-review-focused models.\n  The ablation experiments provide insights into the influence of various\nfine-tuning process components, including input representation, instruction\ntuning, and different PEFT methods. To foster continuous progress in this\nfield, the code and all PEFT-weight plugins have been made open-source.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:10:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Junyi",""],["Yu","Lei",""],["Li","Xiaojia",""],["Yang","Li",""],["Zuo","Chun",""]]}
{"id":"2308.11149","submitter":"Mostafa Sharifzadeh","authors":"Mostafa Sharifzadeh, Sobhan Goudarzi, An Tang, Habib Benali, and\n  Hassan Rivaz","title":"Phase Aberration Correction: A Deep Learning-Based Aberration to\n  Aberration Approach","comments":"arXiv admin note: text overlap with arXiv:2303.05747","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  One of the primary sources of suboptimal image quality in ultrasound imaging\nis phase aberration. It is caused by spatial changes in sound speed over a\nheterogeneous medium, which disturbs the transmitted waves and prevents\ncoherent summation of echo signals. Obtaining non-aberrated ground truths in\nreal-world scenarios can be extremely challenging, if not impossible. This\nchallenge hinders training of deep learning-based techniques' performance due\nto the presence of domain shift between simulated and experimental data. Here,\nfor the first time, we propose a deep learning-based method that does not\nrequire ground truth to correct the phase aberration problem, and as such, can\nbe directly trained on real data. We train a network wherein both the input and\ntarget output are randomly aberrated radio frequency (RF) data. Moreover, we\ndemonstrate that a conventional loss function such as mean square error is\ninadequate for training such a network to achieve optimal performance. Instead,\nwe propose an adaptive mixed loss function that employs both B-mode and RF\ndata, resulting in more efficient convergence and enhanced performance.\nFinally, we publicly release our dataset, including 161,701 single plane-wave\nimages (RF data). This dataset serves to mitigate the data scarcity problem in\nthe development of deep learning-based techniques for phase aberration\ncorrection.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:11:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sharifzadeh","Mostafa",""],["Goudarzi","Sobhan",""],["Tang","An",""],["Benali","Habib",""],["Rivaz","Hassan",""]]}
{"id":"2308.11150","submitter":"Linjie Liu","authors":"Shijia Hua, Zitong Hui, Linjie Liu","title":"Evolution of conditional cooperation in collective-risk social dilemma\n  with repeated group interactions","comments":"Accepted by Proceedings of the Royal Society B-Biological Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The evolution and long-term sustenance of cooperation has consistently piqued\nscholarly interest across the disciplines of evolutionary biology and social\nsciences. Previous theoretical and experimental studies on collective risk\nsocial dilemma games have revealed that the risk of collective failure will\naffect the evolution of cooperation. In the real world individuals usually\nadjust their decisions based on environmental factors such as risk intensity\nand cooperation level. However, it is still not well understood how such\nconditional behaviors affect the evolution of cooperation in repeated group\ninteractions scenario from a theoretical perspective. Here, we construct an\nevolutionary game model with repeated interactions, in which defectors decide\nwhether to cooperate in subsequent rounds of the game based on whether the risk\nexceeds their tolerance threshold and whether the number of cooperators exceeds\nthe collective goal in the early rounds of the game. We find that the\nintroduction of conditional cooperation strategy can effectively promote the\nemergence of cooperation, especially when the risk is low. In addition, the\nrisk threshold significantly affects the evolutionary outcomes, with a high\nrisk promoting the emergence of cooperation. Importantly, when the risk of\nfailure to reach collective goals exceeds a certain threshold, the timely\ntransition from a defective strategy to a cooperative strategy by conditional\ncooperators is beneficial for maintaining high-level cooperation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:12:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hua","Shijia",""],["Hui","Zitong",""],["Liu","Linjie",""]]}
{"id":"2308.11151","submitter":"Tarak Patra","authors":"Kumar Ayush, Pooja Sahu, Sk Musharaf Ali and Tarak K Patra","title":"Predicting Pair Correlation Functions of Glasses using Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Glasses offer a broad range of tunable thermophysical properties that are\nlinked to their compositions. However, it is challenging to establish a\nuniversal composition-property relation of glasses due to their enormous\ncomposition and chemical space. Here, we address this problem and develop a\nmetamodel of composition-atomistic structure relation of a class of glassy\nmaterial via a machine learning (ML) approach. Within this ML framework, an\nunsupervised deep learning technique, viz. convolutional neural network (CNN)\nautoencoder, and a regression algorithm, viz. random forest (RF), are\nintegrated into a fully automated pipeline to predict the spatial distribution\nof atoms in a glass. The RF regression model predicts the pair correlation\nfunction of a glass in a latent space. Subsequently, the decoder of the CNN\nconverts the latent space representation to the actual pair correlation\nfunction of the given glass. The atomistic structures of silicate (SiO2) and\nsodium borosilicate (NBS) based glasses with varying compositions and dopants\nare collected from molecular dynamics (MD) simulations to establish and\nvalidate this ML pipeline. The model is found to predict the atom pair\ncorrelation function for many unknown glasses very accurately. This method is\nvery generic and can accelerate the design, discovery, and fundamental\nunderstanding of composition-atomistic structure relations of glasses and other\nmaterials.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:13:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ayush","Kumar",""],["Sahu","Pooja",""],["Ali","Sk Musharaf",""],["Patra","Tarak K",""]]}
{"id":"2308.11152","submitter":"Flor Ortiz","authors":"Flor Ortiz, Nicolas Skatchkovsky, Eva Lagunas, Wallace A. Martins,\n  Geoffrey Eappen, Saed Daoud, Osvaldo Simeone, Bipin Rajendran and Symeon\n  Chatzinotas","title":"Energy-Efficient On-Board Radio Resource Management for Satellite\n  Communications via Neuromorphic Computing","comments":"currently under review at IEEE Transactions on Machine Learning in\n  Communications and Networking","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The latest satellite communication (SatCom) missions are characterized by a\nfully reconfigurable on-board software-defined payload, capable of adapting\nradio resources to the temporal and spatial variations of the system traffic.\nAs pure optimization-based solutions have shown to be computationally tedious\nand to lack flexibility, machine learning (ML)-based methods have emerged as\npromising alternatives. We investigate the application of energy-efficient\nbrain-inspired ML models for on-board radio resource management. Apart from\nsoftware simulation, we report extensive experimental results leveraging the\nrecently released Intel Loihi 2 chip. To benchmark the performance of the\nproposed model, we implement conventional convolutional neural networks (CNN)\non a Xilinx Versal VCK5000, and provide a detailed comparison of accuracy,\nprecision, recall, and energy efficiency for different traffic demands. Most\nnotably, for relevant workloads, spiking neural networks (SNNs) implemented on\nLoihi 2 yield higher accuracy, while reducing power consumption by more than\n100$\\times$ as compared to the CNN-based reference platform. Our findings point\nto the significant potential of neuromorphic computing and SNNs in supporting\non-board SatCom operations, paving the way for enhanced efficiency and\nsustainability in future SatCom systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:13:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ortiz","Flor",""],["Skatchkovsky","Nicolas",""],["Lagunas","Eva",""],["Martins","Wallace A.",""],["Eappen","Geoffrey",""],["Daoud","Saed",""],["Simeone","Osvaldo",""],["Rajendran","Bipin",""],["Chatzinotas","Symeon",""]]}
{"id":"2308.11153","submitter":"Phillip Kerger","authors":"Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro","title":"Information Complexity of Mixed-integer Convex Optimization","comments":"35 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the information complexity of mixed-integer convex\noptimization under different types of oracles. We establish new lower bounds\nfor the standard first-order oracle, improving upon the previous best known\nlower bound. This leaves only a lower order linear term (in the dimension) as\nthe gap between the lower and upper bounds. This is derived as a corollary of a\nmore fundamental ``transfer\" result that shows how lower bounds on information\ncomplexity of continuous convex optimization under different oracles can be\ntransferred to the mixed-integer setting in a black-box manner.\n  Further, we (to the best of our knowledge) initiate the study of, and obtain\nthe first set of results on, information complexity under oracles that only\nreveal \\emph{partial} first-order information, e.g., where one can only make a\nbinary query over the function value or subgradient at a given point. We give\nalgorithms for (mixed-integer) convex optimization that work under these less\ninformative oracles. We also give lower bounds showing that, for some of these\noracles, every algorithm requires more iterations to achieve a target error\ncompared to when complete first-order information is available. That is, these\noracles are provably less informative than full first-order oracles for the\npurpose of optimization.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:14:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Basu","Amitabh",""],["Jiang","Hongyi",""],["Kerger","Phillip",""],["Molinaro","Marco",""]]}
{"id":"2308.11154","submitter":"Xiucheng Wang","authors":"Xiucheng Wang, Hongzhi Guo","title":"Mobility-Aware Computation Offloading for Swarm Robotics using Deep\n  Reinforcement Learning","comments":null,"journal-ref":"2021 IEEE 18th Annual Consumer Communications & Networking\n  Conference (CCNC)","doi":"10.1109/CCNC49032.2021.9369456","report-no":null,"categories":"cs.RO cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Swarm robotics is envisioned to automate a large number of dirty, dangerous,\nand dull tasks. Robots have limited energy, computation capability, and\ncommunication resources. Therefore, current swarm robotics have a small number\nof robots, which can only provide limited spatio-temporal information. In this\npaper, we propose to leverage the mobile edge computing to alleviate the\ncomputation burden. We develop an effective solution based on a mobility-aware\ndeep reinforcement learning model at the edge server side for computing\nscheduling and resource. Our results show that the proposed approach can meet\ndelay requirements and guarantee computation precision by using minimum robot\nenergy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:20:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Xiucheng",""],["Guo","Hongzhi",""]]}
{"id":"2308.11155","submitter":"Junyu Liu","authors":"Zihan Pengmei, Yinan Shu, Junyu Liu","title":"xxMD: Benchmarking Neural Force Fields Using Extended Dynamics beyond\n  Equilibrium","comments":"19 pages, many figures. Data available at\n  https://github.com/zpengmei/xxMD","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI physics.chem-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural force fields (NFFs) have gained prominence in computational chemistry\nas surrogate models, superseding quantum-chemistry calculations in ab initio\nmolecular dynamics. The prevalent benchmark for NFFs has been the MD17 dataset\nand its subsequent extension. These datasets predominantly comprise geometries\nfrom the equilibrium region of the ground electronic state potential energy\nsurface, sampling from direct adiabatic dynamics. However, many chemical\nreactions entail significant molecular deformations, notably bond breaking. We\ndemonstrate the constrained distribution of internal coordinates and energies\nin the MD17 datasets, underscoring their inadequacy for representing systems\nundergoing chemical reactions. Addressing this sampling limitation, we\nintroduce the xxMD (Extended Excited-state Molecular Dynamics) dataset, derived\nfrom non-adiabatic dynamics. This dataset encompasses energies and forces\nascertained from both multireference wave function theory and density\nfunctional theory. Furthermore, its nuclear configuration spaces authentically\ndepict chemical reactions, making xxMD a more chemically relevant dataset. Our\nre-assessment of equivariant models on the xxMD datasets reveals notably higher\nmean absolute errors than those reported for MD17 and its variants. This\nobservation underscores the challenges faced in crafting a generalizable NFF\nmodel with extrapolation capability. Our proposed xxMD-CASSCF and xxMD-DFT\ndatasets are available at https://github.com/zpengmei/xxMD.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:23:36 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 20:55:07 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Pengmei","Zihan",""],["Shu","Yinan",""],["Liu","Junyu",""]]}
{"id":"2308.11156","submitter":"Toshiyuki Kodama","authors":"Toshiyuki Kodama, Nobuaki Kikuchi, Takahiro Chiba, Satoshi Okamoto,\n  Seigo Ohno, and Satoshi Tomita","title":"Observation of Current-induced Nonlinear Spin Polarization in Pt-Py\n  Bilayers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We experimentally observe nonlinear spin polarization in metallic bilayers of\nplatinum and permalloy by means of spin-torque ferromagnetic resonance (ST-FMR)\nwith the spin-Hall effects. The ST-FMR results under massive dc current\ninjection contain striking features, which are not caused by extrinsic Joule\nheating, but by intrinsic nonlinear spin polarization. The emergence of\nnonlinear spin polarization is consistent with observation of unidirectional\nspin-Hall magnetoresistance due to magnon generation/annihilation. Moreover,\nthe magnon generation (annihilation) leads to effective magnetization shrinkage\n(expansion) revealed by the ST-FMR measurements. The present study paves a way\nto spin-Hall effect based nonlinear spintronic devices as well as\n6th-generation mobile communication light sources.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:25:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kodama","Toshiyuki",""],["Kikuchi","Nobuaki",""],["Chiba","Takahiro",""],["Okamoto","Satoshi",""],["Ohno","Seigo",""],["Tomita","Satoshi",""]]}
{"id":"2308.11157","submitter":"Xiaoyan Cao","authors":"Xiaoyan Cao, Yiyao Zheng, Yao Yao, Huapeng Qin, Xiaoyu Cao, Shihui Guo","title":"TOPIC: A Parallel Association Paradigm for Multi-Object Tracking under\n  Complex Motions and Diverse Scenes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video data and algorithms have been driving advances in multi-object tracking\n(MOT). While existing MOT datasets focus on occlusion and appearance\nsimilarity, complex motion patterns are widespread yet overlooked. To address\nthis issue, we introduce a new dataset called BEE23 to highlight complex\nmotions. Identity association algorithms have long been the focus of MOT\nresearch. Existing trackers can be categorized into two association paradigms:\nsingle-feature paradigm (based on either motion or appearance feature) and\nserial paradigm (one feature serves as secondary while the other is primary).\nHowever, these paradigms are incapable of fully utilizing different features.\nIn this paper, we propose a parallel paradigm and present the Two rOund\nParallel matchIng meChanism (TOPIC) to implement it. The TOPIC leverages both\nmotion and appearance features and can adaptively select the preferable one as\nthe assignment metric based on motion level. Moreover, we provide an\nAttention-based Appearance Reconstruct Module (AARM) to reconstruct appearance\nfeature embeddings, thus enhancing the representation of appearance features.\nComprehensive experiments show that our approach achieves state-of-the-art\nperformance on four public datasets and BEE23. Notably, our proposed parallel\nparadigm surpasses the performance of existing association paradigms by a large\nmargin, e.g., reducing false negatives by 12% to 51% compared to the\nsingle-feature association paradigm. The introduced dataset and association\nparadigm in this work offers a fresh perspective for advancing the MOT field.\nThe source code and dataset are available at\nhttps://github.com/holmescao/TOPICTrack.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:30:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cao","Xiaoyan",""],["Zheng","Yiyao",""],["Yao","Yao",""],["Qin","Huapeng",""],["Cao","Xiaoyu",""],["Guo","Shihui",""]]}
{"id":"2308.11158","submitter":"Liang Chen","authors":"Liang Chen, Yong Zhang, Yibing Song, Anton van den Hengel, and\n  Lingqiao Liu","title":"Domain Generalization via Rationale Invariance","comments":"Accepted in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper offers a new perspective to ease the challenge of domain\ngeneralization, which involves maintaining robust results even in unseen\nenvironments. Our design focuses on the decision-making process in the final\nclassifier layer. Specifically, we propose treating the element-wise\ncontributions to the final results as the rationale for making a decision and\nrepresenting the rationale for each sample as a matrix. For a well-generalized\nmodel, we suggest the rationale matrices for samples belonging to the same\ncategory should be similar, indicating the model relies on domain-invariant\nclues to make decisions, thereby ensuring robust results. To implement this\nidea, we introduce a rationale invariance loss as a simple regularization\ntechnique, requiring only a few lines of code. Our experiments demonstrate that\nthe proposed approach achieves competitive results across various datasets,\ndespite its simplicity. Code is available at\n\\url{https://github.com/liangchen527/RIDG}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:31:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Liang",""],["Zhang","Yong",""],["Song","Yibing",""],["Hengel","Anton van den",""],["Liu","Lingqiao",""]]}
{"id":"2308.11159","submitter":"Dalong Zheng","authors":"Dalong Zheng, Zebin Wu, Jia Liu, Zhihui Wei","title":"SwinV2DNet: Pyramid and Self-Supervision Compounded Feature Learning for\n  Remote Sensing Images Change Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Among the current mainstream change detection networks, transformer is\ndeficient in the ability to capture accurate low-level details, while\nconvolutional neural network (CNN) is wanting in the capacity to understand\nglobal information and establish remote spatial relationships. Meanwhile, both\nof the widely used early fusion and late fusion frameworks are not able to well\nlearn complete change features. Therefore, based on swin transformer V2 (Swin\nV2) and VGG16, we propose an end-to-end compounded dense network SwinV2DNet to\ninherit the advantages of both transformer and CNN and overcome the\nshortcomings of existing networks in feature learning. Firstly, it captures the\nchange relationship features through the densely connected Swin V2 backbone,\nand provides the low-level pre-changed and post-changed features through a CNN\nbranch. Based on these three change features, we accomplish accurate change\ndetection results. Secondly, combined with transformer and CNN, we propose\nmixed feature pyramid (MFP) which provides inter-layer interaction information\nand intra-layer multi-scale information for complete feature learning. MFP is a\nplug and play module which is experimentally proven to be also effective in\nother change detection networks. Further more, we impose a self-supervision\nstrategy to guide a new CNN branch, which solves the untrainable problem of the\nCNN branch and provides the semantic change information for the features of\nencoder. The state-of-the-art (SOTA) change detection scores and fine-grained\nchange maps were obtained compared with other advanced methods on four commonly\nused public remote sensing datasets. The code is available at\nhttps://github.com/DalongZ/SwinV2DNet.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:31:52 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zheng","Dalong",""],["Wu","Zebin",""],["Liu","Jia",""],["Wei","Zhihui",""]]}
{"id":"2308.11160","submitter":"Pin Chen","authors":"Liang Gu, Yang Liu, Pin Chen, Haiyou Huang, Ning Chen, Yang Li, Yutong\n  Lu and Yanjing Su","title":"Predicting Transition Temperature of Superconductors with Graph Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting high temperature superconductors has long been a great challenge.\nThe difficulty lies in how to predict the transition temperature (Tc) of\nsuperconductors. Although recent progress in material informatics has led to a\nnumber of machine learning models predicting Tc, prevailing models have not\nshown adequate generalization ability and physical rationality to find new high\ntemperature superconductors, yet. In this work, a bond sensitive graph neural\nnetwork (BSGNN) was developed to predict the Tc of various superconductors. In\nBSGNN, communicative message passing and graph attention methods were utilized\nto enhance the model's ability to process bonding and interaction information\nin the crystal lattice, which is crucial for the superconductivity.\nConsequently, our results revealed the relevance between chemical bond\nattributes and Tc. It indicates that shorter bond length is favored by high Tc.\nMeanwhile, some specific chemical elements that have relatively large van der\nWaals radius is favored by high Tc. It gives a convenient guidance for\nsearching high temperature superconductors in materials database, by ruling out\nthe materials that could never have high Tc.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:34:18 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 02:17:11 GMT"},{"version":"v3","created":"Thu, 24 Aug 2023 02:40:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gu","Liang",""],["Liu","Yang",""],["Chen","Pin",""],["Huang","Haiyou",""],["Chen","Ning",""],["Li","Yang",""],["Lu","Yutong",""],["Su","Yanjing",""]]}
{"id":"2308.11161","submitter":"Thanh Dat Nguyen","authors":"Thanh-Dat Nguyen, Yang Zhou, Xuan Bach D. Le, Patanamon (Pick)\n  Thongtanunam, David Lo","title":"Adversarial Attacks on Code Models with Discriminative Graph Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pre-trained language models of code are now widely used in various software\nengineering tasks such as code generation, code completion, vulnerability\ndetection, etc. This, in turn, poses security and reliability risks to these\nmodels. One of the important threats is \\textit{adversarial attacks}, which can\nlead to erroneous predictions and largely affect model performance on\ndownstream tasks. Current adversarial attacks on code models usually adopt\nfixed sets of program transformations, such as variable renaming and dead code\ninsertion, leading to limited attack effectiveness. To address the\naforementioned challenges, we propose a novel adversarial attack framework,\nGraphCodeAttack, to better evaluate the robustness of code models. Given a\ntarget code model, GraphCodeAttack automatically mines important code patterns,\nwhich can influence the model's decisions, to perturb the structure of input\ncode to the model. To do so, GraphCodeAttack uses a set of input source codes\nto probe the model's outputs and identifies the \\textit{discriminative} ASTs\npatterns that can influence the model decisions. GraphCodeAttack then selects\nappropriate AST patterns, concretizes the selected patterns as attacks, and\ninserts them as dead code into the model's input program. To effectively\nsynthesize attacks from AST patterns, GraphCodeAttack uses a separate\npre-trained code model to fill in the ASTs with concrete code snippets. We\nevaluate the robustness of two popular code models (e.g., CodeBERT and\nGraphCodeBERT) against our proposed approach on three tasks: Authorship\nAttribution, Vulnerability Prediction, and Clone Detection. The experimental\nresults suggest that our proposed approach significantly outperforms\nstate-of-the-art approaches in attacking code models such as CARROT and ALERT.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:40:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nguyen","Thanh-Dat","","Pick"],["Zhou","Yang","","Pick"],["Le","Xuan Bach D.","","Pick"],["Patanamon","","","Pick"],["Thongtanunam","",""],["Lo","David",""]]}
{"id":"2308.11162","submitter":"Hamid Tizhoosh","authors":"Abubakr Shafique, Ricardo Gonzalez, Liron Pantanowitz, Puay Hoon Tan,\n  Alberto Machado, Ian A Cree, and Hamid R. Tizhoosh","title":"A Preliminary Investigation into Search and Matching for Tumour\n  Discrimination in WHO Breast Taxonomy Using Deep Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Breast cancer is one of the most common cancers affecting women worldwide.\nThey include a group of malignant neoplasms with a variety of biological,\nclinical, and histopathological characteristics. There are more than 35\ndifferent histological forms of breast lesions that can be classified and\ndiagnosed histologically according to cell morphology, growth, and architecture\npatterns. Recently, deep learning, in the field of artificial intelligence, has\ndrawn a lot of attention for the computerized representation of medical images.\nSearchable digital atlases can provide pathologists with patch matching tools\nallowing them to search among evidently diagnosed and treated archival cases, a\ntechnology that may be regarded as computational second opinion. In this study,\nwe indexed and analyzed the WHO breast taxonomy (Classification of Tumours 5th\nEd.) spanning 35 tumour types. We visualized all tumour types using deep\nfeatures extracted from a state-of-the-art deep learning model, pre-trained on\nmillions of diagnostic histopathology images from the TCGA repository.\nFurthermore, we test the concept of a digital \"atlas\" as a reference for search\nand matching with rare test cases. The patch similarity search within the WHO\nbreast taxonomy data reached over 88% accuracy when validating through\n\"majority vote\" and more than 91% accuracy when validating using top-n tumour\ntypes. These results show for the first time that complex relationships among\ncommon and rare breast lesions can be investigated using an indexed digital\narchive.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:40:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shafique","Abubakr",""],["Gonzalez","Ricardo",""],["Pantanowitz","Liron",""],["Tan","Puay Hoon",""],["Machado","Alberto",""],["Cree","Ian A",""],["Tizhoosh","Hamid R.",""]]}
{"id":"2308.11163","submitter":"Noriaki Kawaguchi","authors":"Noriaki Kawaguchi","title":"S-limit shadowing and a global description of Li-Yorke type chaos","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any continuous self-map of a compact metric space, we extend a partition\nof each chain component with respect to a chain proximal relation to a\n$G_\\delta$-partition of the phase space. Under the assumption of s-limit\nshadowing, we use this partition to give a global description of Li-Yorke type\nchaos corresponding to several Furstenberg families.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:44:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kawaguchi","Noriaki",""]]}
{"id":"2308.11164","submitter":"Yiding Lu","authors":"Yiding Lu, Yijie Lin, Mouxing Yang, Dezhong Peng, Peng Hu, Xi Peng","title":"Decoupled Contrastive Multi-view Clustering with High-order Random Walks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent, some robust contrastive multi-view clustering (MvC) methods have\nbeen proposed, which construct data pairs from neighborhoods to alleviate the\nfalse negative issue, i.e., some intra-cluster samples are wrongly treated as\nnegative pairs. Although promising performance has been achieved by these\nmethods, the false negative issue is still far from addressed and the false\npositive issue emerges because all in- and out-of-neighborhood samples are\nsimply treated as positive and negative, respectively. To address the issues,\nwe propose a novel robust method, dubbed decoupled contrastive multi-view\nclustering with high-order random walks (DIVIDE). In brief, DIVIDE leverages\nrandom walks to progressively identify data pairs in a global instead of local\nmanner. As a result, DIVIDE could identify in-neighborhood negatives and\nout-of-neighborhood positives. Moreover, DIVIDE embraces a novel MvC\narchitecture to perform inter- and intra-view contrastive learning in different\nembedding spaces, thus boosting clustering performance and embracing the\nrobustness against missing views. To verify the efficacy of DIVIDE, we carry\nout extensive experiments on four benchmark datasets comparing with nine\nstate-of-the-art MvC methods in both complete and incomplete MvC settings.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:45:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Yiding",""],["Lin","Yijie",""],["Yang","Mouxing",""],["Peng","Dezhong",""],["Hu","Peng",""],["Peng","Xi",""]]}
{"id":"2308.11165","submitter":"Risheng Liu","authors":"Di Wang, Jinyuan Liu, Long Ma, Risheng Liu, Xin Fan","title":"Improving Misaligned Multi-modality Image Fusion with One-stage\n  Progressive Dense Registration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Misalignments between multi-modality images pose challenges in image fusion,\nmanifesting as structural distortions and edge ghosts. Existing efforts\ncommonly resort to registering first and fusing later, typically employing two\ncascaded stages for registration,i.e., coarse registration and fine\nregistration. Both stages directly estimate the respective target deformation\nfields. In this paper, we argue that the separated two-stage registration is\nnot compact, and the direct estimation of the target deformation fields is not\naccurate enough. To address these challenges, we propose a Cross-modality\nMulti-scale Progressive Dense Registration (C-MPDR) scheme, which accomplishes\nthe coarse-to-fine registration exclusively using a one-stage optimization,\nthus improving the fusion performance of misaligned multi-modality images.\nSpecifically, two pivotal components are involved, a dense Deformation Field\nFusion (DFF) module and a Progressive Feature Fine (PFF) module. The DFF\naggregates the predicted multi-scale deformation sub-fields at the current\nscale, while the PFF progressively refines the remaining misaligned features.\nBoth work together to accurately estimate the final deformation fields. In\naddition, we develop a Transformer-Conv-based Fusion (TCF) subnetwork that\nconsiders local and long-range feature dependencies, allowing us to capture\nmore informative features from the registered infrared and visible images for\nthe generation of high-quality fused images. Extensive experimental analysis\ndemonstrates the superiority of the proposed method in the fusion of misaligned\ncross-modality images.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:46:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Di",""],["Liu","Jinyuan",""],["Ma","Long",""],["Liu","Risheng",""],["Fan","Xin",""]]}
{"id":"2308.11166","submitter":"Zongyi Xu","authors":"Zongyi Xu, Bo Yuan, Shanshan Zhao, Qianni Zhang, Xinbo Gao","title":"Hierarchical Point-based Active Learning for Semi-supervised Point Cloud\n  Semantic Segmentation","comments":"International Conference on Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Impressive performance on point cloud semantic segmentation has been achieved\nby fully-supervised methods with large amounts of labelled data. As it is\nlabour-intensive to acquire large-scale point cloud data with point-wise\nlabels, many attempts have been made to explore learning 3D point cloud\nsegmentation with limited annotations. Active learning is one of the effective\nstrategies to achieve this purpose but is still under-explored. The most recent\nmethods of this kind measure the uncertainty of each pre-divided region for\nmanual labelling but they suffer from redundant information and require\nadditional efforts for region division. This paper aims at addressing this\nissue by developing a hierarchical point-based active learning strategy.\nSpecifically, we measure the uncertainty for each point by a hierarchical\nminimum margin uncertainty module which considers the contextual information at\nmultiple levels. Then, a feature-distance suppression strategy is designed to\nselect important and representative points for manual labelling. Besides, to\nbetter exploit the unlabelled data, we build a semi-supervised segmentation\nframework based on our active strategy. Extensive experiments on the S3DIS and\nScanNetV2 datasets demonstrate that the proposed framework achieves 96.5% and\n100% performance of fully-supervised baseline with only 0.07% and 0.1% training\ndata, respectively, outperforming the state-of-the-art weakly-supervised and\nactive learning methods. The code will be available at\nhttps://github.com/SmiletoE/HPAL.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:52:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Xu","Zongyi",""],["Yuan","Bo",""],["Zhao","Shanshan",""],["Zhang","Qianni",""],["Gao","Xinbo",""]]}
{"id":"2308.11167","submitter":"Kapil Panda","authors":"Kapil Panda, Anirudh Mazumder","title":"Predicting Dosage of Immunosuppressant Drugs After Kidney\n  Transplantation Using Machine Learning","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While kidney transplants are seen as the best treatment option for patients\nwith end-stage renal disease and kidney failure, the organ's health depends on\nthe dosage of immunosuppressant drugs post-transplantation. Due to the dosage\nvariance based on each patient's unique physiology, nephrologists face numerous\ndifficulties when determining the precise dosage needed for each patient.\nTherefore, in this research we aim to devise a machine learning algorithm to\nforecast the dosage of immunosuppressant drugs needed for different patients\nafter kidney transplantation. Utilizing a random forest algorithm, the devised\nmodel is able to achieve accurate measurements for patient drug dosages.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:52:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Panda","Kapil",""],["Mazumder","Anirudh",""]]}
{"id":"2308.11168","submitter":"Xiaolin Wang","authors":"Zhonggen Su, Xiaolin Wang","title":"Discretized Normal Approximation of Sums of Locally Dependent Random\n  Variables via Stein's Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\{X_{i}, i\\in J\\}$ be a family of locally dependent non-negative\ninteger-valued random variables with finite expectation and variance. We\nconsider the sum $W=\\sum_{i\\in J}X_i$ and establish general error upper bounds\nfor the total variation distance $d_{TV}(W, Y^{d})$, where $Y^{d}$ is the\ndiscretized normal distribution. The major ingredient of the proof is to\napproximate $W$ by a three-parametric intermediate random variable $M$ based on\nStein's method. As applications, we study in detail four well-known examples,\nwhich are counting vertices of all edges point inward, birthday problem,\ncounting monochromatic edges in uniformly colored graphs, and triangles in the\nErd\\H{o}s-R\\'{e}nyi random graph. Through delicate analysis and computations we\nobtain sharper upper error bounds than existing results.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:54:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Su","Zhonggen",""],["Wang","Xiaolin",""]]}
{"id":"2308.11169","submitter":"Kapil Panda","authors":"Kapil Panda, Anirudh Mazumder","title":"Blockchain-Powered Supply Chain Management for Kidney Organ Preservation","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to the shortage of available kidney organs for transplants, handling\nevery donor kidney with utmost care is crucial to preserve the organ's health,\nespecially during the organ supply chain where kidneys are prone to\ndeterioration during transportation. Therefore, this research proposes a\nblockchain platform to aid in managing kidneys in the supply chain. This\nframework establishes a secure system that meticulously tracks the organ's\nlocation and handling, safeguarding the health from donor to recipient.\nAdditionally, a machine-learning algorithm is embedded to monitor organ health\nin real-time against various metrics for prompt detection of possible kidney\ndamage.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:56:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Panda","Kapil",""],["Mazumder","Anirudh",""]]}
{"id":"2308.11170","submitter":"Ilyas Bayramov","authors":"Ilyas Bayramov","title":"Fourier decay, Green's kernel and Schottky groups","comments":"Changed the name, completed the proof of results announced in\n  previous versions","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, I would like to discuss an approach to the construction of\nGreen's function on algebraic surfaces, indicated by Manin, towards the\ncomputation of the Green's function on surfaces using Schottky uniformization.\nWe shall see that the exact geometric interpretation of the formula mentioned\nthere is obscure, and try to remedy the situation by investigating convergence\nof deformations of that formula.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:56:36 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 18:27:24 GMT"},{"version":"v3","created":"Sat, 26 Aug 2023 02:01:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bayramov","Ilyas",""]]}
{"id":"2308.11171","submitter":"Yuchong Sun","authors":"Yuchong Sun, Bei Liu, Xu Chen, Ruihua Song, Jianlong Fu","title":"ViCo: Engaging Video Comment Generation with Human Preference Rewards","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Engaging video comments play an important role in video social media, as they\nare the carrier of feelings, thoughts, or humor of the audience. Preliminary\nworks have made initial exploration for video comment generation by adopting\ncaption-style encoder-decoder models. However, comment generation presents some\nunique challenges distinct from caption generation, which makes these methods\nsomewhat less effective at generating engaging comments. In contrast to the\nobjective and descriptive nature of captions, comments tend to be inherently\nsubjective, making it hard to quantify and evaluate the engagement of comments.\nFurthermore, the scarcity of truly engaging comments brings difficulty to\ncollecting enough high-quality training examples. In this paper, we propose\nViCo with three novel designs to tackle the above challenges for generating\nengaging Video Comments. Firstly, to quantify the engagement of comments, we\nutilize the number of \"likes\" each comment receives as a proxy of human\npreference after an appropriate debiasing procedure. Secondly, to automatically\nevaluate the engagement of comments, we train a reward model to align its\njudgment to the above proxy. Our user studies indicate that this reward model\neffectively aligns with human judgments. Lastly, to alleviate the scarcity of\nhigh-quality comments, an initial generator is trained on readily available but\nnoisy data to generate comments. Then the reward model is employed to offer\nfeedback on the generated comments, thus optimizing the initial generator. To\nfacilitate the research of video commenting, we collect a large video\ncomment-dataset (ViCo-20k) with rich metadata from a popular video website.\nExperiments on ViCo-20k show that the comments generated by our ViCo model\nexhibit the best performance in terms of both quantitative and qualitative\nresults, particularly when engagement is considered.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:01:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sun","Yuchong",""],["Liu","Bei",""],["Chen","Xu",""],["Song","Ruihua",""],["Fu","Jianlong",""]]}
{"id":"2308.11172","submitter":"Yuya Haraguchi","authors":"Yuya Haraguchi, Daisuke Nishio-Hamane and Hiroko Aruga Katori","title":"Magnetic ordering in the $J_{\\rm eff}$ = 0 Nickelate NiRh$_2$O$_4$\n  prepared via a solid-state metathesis","comments":"7 pages, 5 figures, accepted in Physical Review Materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In spinel-type nickelate NiRh$_2$O$_4$, magnetic ordering is observed upon\nthe sample synthesized via kinetically controlled low-temperature solid-state\nmetathesis, as opposed to previously-reported samples obtained through\nconventional solid-state reaction. Our findings are based on a combination of\nbulk susceptibility and specific heat measurements that disclose a N$\\'e$el\ntransition temperature of $T_N$ = 45 K in this material, which might feature\nspin-orbit entanglement in the tetragonally-coordinated $d^8$ Mott insulators.\nThe emergence of magnetic ordering upon alteration of the synthesis route\nindicates that the suppression of magnetic ordering in the previous sample was\nrooted in the cation-mixing assisted by the entropy gain that results from\nhigh-temperature reactions. Furthermore, the $J_{\\rm eff}$ = 0 physics, instead\nof solely the spin-only $S = 1$, describes the observed enhancement of\neffective magnetic moment well. Overseeing all observations and speculations,\nwe propose that the possible mechanism responsible for the emergent magnetic\norderings in NiRh$_2$O$_4$ is the condensation of $J_{\\rm eff}$ = 0 exciton,\ndriven by the interplay of the tetragonal crystal field and superexchange\ninteractions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:01:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Haraguchi","Yuya",""],["Nishio-Hamane","Daisuke",""],["Katori","Hiroko Aruga",""]]}
{"id":"2308.11173","submitter":"Gilberto Boaretto","authors":"Gilberto Boaretto and Marcelo C. Medeiros","title":"Forecasting inflation using disaggregates and machine learning","comments":"44 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper examines the effectiveness of several forecasting methods for\npredicting inflation, focusing on aggregating disaggregated forecasts - also\nknown in the literature as the bottom-up approach. Taking the Brazilian case as\nan application, we consider different disaggregation levels for inflation and\nemploy a range of traditional time series techniques as well as linear and\nnonlinear machine learning (ML) models to deal with a larger number of\npredictors. For many forecast horizons, the aggregation of disaggregated\nforecasts performs just as well survey-based expectations and models that\ngenerate forecasts using the aggregate directly. Overall, ML methods outperform\ntraditional time series models in predictive accuracy, with outstanding\nperformance in forecasting disaggregates. Our results reinforce the benefits of\nusing models in a data-rich environment for inflation forecasting, including\naggregating disaggregated forecasts from ML techniques, mainly during volatile\nperiods. Starting from the COVID-19 pandemic, the random forest model based on\nboth aggregate and disaggregated inflation achieves remarkable predictive\nperformance at intermediate and longer horizons.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:01:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Boaretto","Gilberto",""],["Medeiros","Marcelo C.",""]]}
{"id":"2308.11174","submitter":"James Bonifacio","authors":"James Bonifacio and Dalimil Mazac and Sridip Pal","title":"Spectral Bounds on Hyperbolic 3-Manifolds: Associativity and the Trace\n  Formula","comments":"v1: 61 pages + appendices and references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP hep-th math-ph math.GT math.MP math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We constrain the low-energy spectra of Laplace operators on closed hyperbolic\nmanifolds and orbifolds in three dimensions, including the standard\nLaplace-Beltrami operator on functions and the Laplacian on powers of the\ncotangent bundle. Our approach employs linear programming techniques to derive\nrigorous bounds by leveraging two types of spectral identities. The first type,\ninspired by the conformal bootstrap, arises from the consistency of the\nspectral decomposition of the product of Laplace eigensections, and involves\nthe Laplacian spectra as well as integrals of triple products of eigensections.\nWe formulate these conditions in the language of representation theory of\n$\\mathrm{PSL}_2(\\mathbb{C})$ and use them to prove upper bounds on the first\nand second Laplacian eigenvalues. The second type of spectral identities\nfollows from the Selberg trace formula. We use them to find upper bounds on the\nspectral gap of the Laplace-Beltrami operator on hyperbolic 3-orbifolds, as\nwell as on the systole length of hyperbolic 3-manifolds, as a function of the\nvolume. Further, we prove that the spectral gap $\\lambda_1$ of the\nLaplace-Beltrami operator on all closed hyperbolic 3-manifolds satisfies\n$\\lambda_1 < 47.32$. Along the way, we use the trace formula to estimate the\nlow-energy spectra of a large set of example orbifolds and compare them with\nour general bounds, finding that the bounds are nearly sharp in several cases.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:02:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bonifacio","James",""],["Mazac","Dalimil",""],["Pal","Sridip",""]]}
{"id":"2308.11175","submitter":"Jinpeng Wang","authors":"Jinpeng Wang, Ziyun Zeng, Yunxiao Wang, Yuting Wang, Xingyu Lu,\n  Tianxiang Li, Jun Yuan, Rui Zhang, Hai-Tao Zheng, Shu-Tao Xia","title":"MISSRec: Pre-training and Transferring Multi-modal Interest-aware\n  Sequence Representation for Recommendation","comments":"Accepted to ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3611967","report-no":null,"categories":"cs.IR cs.AI cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of sequential recommendation (SR) is to predict a user's potential\ninterested items based on her/his historical interaction sequences. Most\nexisting sequential recommenders are developed based on ID features, which,\ndespite their widespread use, often underperform with sparse IDs and struggle\nwith the cold-start problem. Besides, inconsistent ID mappings hinder the\nmodel's transferability, isolating similar recommendation domains that could\nhave been co-optimized. This paper aims to address these issues by exploring\nthe potential of multi-modal information in learning robust and generalizable\nsequence representations. We propose MISSRec, a multi-modal pre-training and\ntransfer learning framework for SR. On the user side, we design a\nTransformer-based encoder-decoder model, where the contextual encoder learns to\ncapture the sequence-level multi-modal synergy while a novel interest-aware\ndecoder is developed to grasp item-modality-interest relations for better\nsequence representation. On the candidate item side, we adopt a dynamic fusion\nmodule to produce user-adaptive item representation, providing more precise\nmatching between users and items. We pre-train the model with contrastive\nlearning objectives and fine-tune it in an efficient manner. Extensive\nexperiments demonstrate the effectiveness and flexibility of MISSRec, promising\nan practical solution for real-world recommendation scenarios.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:06:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Jinpeng",""],["Zeng","Ziyun",""],["Wang","Yunxiao",""],["Wang","Yuting",""],["Lu","Xingyu",""],["Li","Tianxiang",""],["Yuan","Jun",""],["Zhang","Rui",""],["Zheng","Hai-Tao",""],["Xia","Shu-Tao",""]]}
{"id":"2308.11176","submitter":"Katharina Huber","authors":"Katharina T. Huber, Leo van Iersel, Vincent Moulton, Guillaume Scholz","title":"Is this network proper forest-based?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In evolutionary biology, networks are becoming increasingly used to represent\nevolutionary histories for species that have undergone non-treelike or\nreticulate evolution. Such networks are essentially directed acyclic graphs\nwith a leaf set that corresponds to a collection of species, and in which\nnon-leaf vertices with indegree 1 correspond to speciation events and vertices\nwith indegree greater than 1 correspond to reticulate events such as gene\ntransfer. Recently forest-based networks have been introduced, which are\nessentially (multi-rooted) networks that can be formed by adding some arcs to a\ncollection of phylogenetic trees (or phylogenetic forest), where each arc is\nadded in such a way that its ends always lie in two different trees in the\nforest. In this paper, we consider the complexity of deciding whether or not a\ngiven network is proper forest-based, that is, whether it can be formed by\nadding arcs to some underlying phylogenetic forest which contains the same\nnumber of trees as there are roots in the network. More specifically, we show\nthat it can be decided in polynomial time whether or not a binary, tree-child\nnetwork with $m \\ge 2$ roots is proper forest-based in case $m=2$, but that\nthis problem is NP-complete for $m\\ge 3$. We also give a fixed parameter\ntractable (FPT) algorithm for deciding whether or not a network in which every\nvertex has indegree at most 2 is proper forest-based. A key element in proving\nour results is a new characterization for when a network with $m$ roots is\nproper forest-based which is given in terms of the existence of certain\n$m$-colorings of the vertices of the network.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:07:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Huber","Katharina T.",""],["van Iersel","Leo",""],["Moulton","Vincent",""],["Scholz","Guillaume",""]]}
{"id":"2308.11177","submitter":"Setti Thirupathaiah Dr","authors":"Achintya Low, Susanta Ghosh, Soumya Ghorai, and Setti Thirupathaiah","title":"Effect of Electron-Phonon Scattering on the Anomalous Hall Conductivity\n  of Fe$_3$Sn: A Kagome Ferromagnetic Metal","comments":"8 pages and 4 figures, accepted in Phys. Rev. B","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on magnetic and magnetotransport studies of a Kagome ferromagnetic\nmetal, Fe$_3$Sn. Our studies reveal a large anomalous Hall conductivity\n($\\sigma_{zx}$) in this system, mainly contributed by temperature independent\nintrinsic Hall conductivity ($\\sigma^{int}_{zx}$=485$\\pm$60 S/cm) and\ntemperature dependent extrinsic Hall conductivity ($\\sigma^{ext}_{zx}$) due to\nskew-scattering. Although $\\sigma^{ext}_{zx}$ value is large and almost\nequivalent to the intrinsic Hall conductivity at low temperatures, it\ndrastically decreases with increasing temperature, following the relation\n$\\sigma^{ext}_{zx}=\\frac{\\sigma_{zx0}^{ext}}{(aT+1)^2}$, under the influence of\nelectron-phonon scattering. The presence of electron-phonon scattering in this\nsystem is also confirmed by the linear dependence of longitudinal electrical\nresistivity at higher temperatures [$\\rho(T)\\propto T$]. We further find that\nFe$_3$Sn is a soft ferromagnet with an easy-axis of magnetization lying in the\n$\\it{ab}$ plane of the crystal with magnetocrystalline anisotropy energy\ndensity as large as 1.02 $\\times$ 10$^6$\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:08:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Low","Achintya",""],["Ghosh","Susanta",""],["Ghorai","Soumya",""],["Thirupathaiah","Setti",""]]}
{"id":"2308.11178","submitter":"Cheng Zhang","authors":"Xing Wang and Cheng Zhang","title":"Sharp local $L^p$ estimates for the Hermite eigenfunctions","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.CA math.MP math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the concentration of eigenfunctions for the Hermite operator\n$-\\Delta+|x|^2$ in $\\mathbb{R}^n$ by establishing new $L^p$ bounds over balls.\nCompared to Koch-Tataru's global estimates, these new estimates demonstrate\nlocal improvements for a certain range of $p$. The sharpness of these local\nestimates can be verified by examples with various types of concentrations.\nMoreover, we prove that the sharp $L^p$ bounds of the Hermite eigenfunctions\nover the unit ball $\\{|x|\\le 1\\}$ coincide with Sogge's $L^p$ bounds for the\nLaplace eigenfunctions on compact manifolds, up to a scaling factor\n$\\lambda^{-\\frac12}$. This phenomenon suggests that the Hermite eigenfunctions\nlocally resemble the rescaled Laplace eigenfunctions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:09:44 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 02:37:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Xing",""],["Zhang","Cheng",""]]}
{"id":"2308.11179","submitter":"Ibtihaj Ahmad","authors":"Ibtihaj Ahmad, Syed Muhammad Israr, Zain Ul Islam","title":"A three in one bottom-up framework for simultaneous semantic\n  segmentation, instance segmentation and classification of multi-organ nuclei\n  in digital cancer histology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Simultaneous segmentation and classification of nuclei in digital histology\nplay an essential role in computer-assisted cancer diagnosis; however, it\nremains challenging. The highest achieved binary and multi-class Panoptic\nQuality (PQ) remains as low as 0.68 bPQ and 0.49 mPQ, respectively. It is due\nto the higher staining variability, variability across the tissue, rough\nclinical conditions, overlapping nuclei, and nuclear class imbalance. The\ngeneric deep-learning methods usually rely on end-to-end models, which fail to\naddress these problems associated explicitly with digital histology. In our\nprevious work, DAN-NucNet, we resolved these issues for semantic segmentation\nwith an end-to-end model. This work extends our previous model to simultaneous\ninstance segmentation and classification. We introduce additional decoder heads\nwith independent weighted losses, which produce semantic segmentation, edge\nproposals, and classification maps. We use the outputs from the three-head\nmodel to apply post-processing to produce the final segmentation and\nclassification. Our multi-stage approach utilizes edge proposals and semantic\nsegmentations compared to direct segmentation and classification strategies\nfollowed by most state-of-the-art methods. Due to this, we demonstrate a\nsignificant performance improvement in producing high-quality instance\nsegmentation and nuclei classification. We have achieved a 0.841 Dice score for\nsemantic segmentation, 0.713 bPQ scores for instance segmentation, and 0.633\nmPQ for nuclei classification. Our proposed framework is generalized across 19\ntypes of tissues. Furthermore, the framework is less complex compared to the\nstate-of-the-art.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:10:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ahmad","Ibtihaj",""],["Israr","Syed Muhammad",""],["Islam","Zain Ul",""]]}
{"id":"2308.11180","submitter":"Suyoung Lee","authors":"Suyoung Lee, Sangjae Lee, Saegyeol Jung, Jiwon Jung, Donghan Kim,\n  Yeonjae Lee, Byeongjun Seok, Jaeyoung Kim, Byeong Gyu Park, Libor\n  \\v{S}mejkal, Chang-Jong Kang, and Changyoung Kim","title":"Broken Kramers' degeneracy in altermagnetic MnTe","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Altermagnetism is a newly identified fundamental class of magnetism with\nvanishing net magnetization and time-reversal symmetry broken electronic\nstructure. Probing the unusual electronic structure with nonrelativistic spin\nsplitting would be a direct experimental verification of altermagnetic phase.\nBy combining high-quality film growth and $in~situ$ angle-resolved\nphotoemission spectroscopy, we report the electronic structure of an\naltermagnetic candidate, $\\alpha$-MnTe. Temperature dependent study reveals the\nlifting of Kramers{\\textquoteright} degeneracy accompanied by a magnetic phase\ntransition at $T_N=267\\text{ K}$ with spin splitting of up to $370\\text{ meV}$,\nproviding direct spectroscopic evidence for altermagnetism in MnTe.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:12:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lee","Suyoung",""],["Lee","Sangjae",""],["Jung","Saegyeol",""],["Jung","Jiwon",""],["Kim","Donghan",""],["Lee","Yeonjae",""],["Seok","Byeongjun",""],["Kim","Jaeyoung",""],["Park","Byeong Gyu",""],["\u0160mejkal","Libor",""],["Kang","Chang-Jong",""],["Kim","Changyoung",""]]}
{"id":"2308.11181","submitter":"Li He","authors":"Li He, Baixi Jiao, Yuxi Liu","title":"Temporal Interaction -- Bridging Time and Experience in Human-Computer\n  Interaction","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Traditional static user interfaces (UI) have given way to dynamic systems\nthat can intelligently adapt to and respond to users' changing needs. Temporal\ninteraction is an emerging field in human-computer interaction (HCI), which\nrefers to the study and design of UI that are capable of adapting and\nresponding to the user's changing behavioral and emotional states. By\ncomprehending and incorporating the temporal component of user interactions, it\nfocuses on developing dynamic and individualized user experiences. This idea\nplaces a strong emphasis on the value of adjusting to user behavior and\nemotions in order to create a more unique and interesting user experience. The\npotential of temporal interaction to alter user interface design is highlighted\nby this paper's examination of its capacity to adjust to user behavior and\nreact to emotional states. Designers can create interfaces that respond to the\nchanging demands, emotions, and behaviors of users by utilizing temporal\ninteractions. This produces interfaces that are not only highly functional but\nalso form an emotional connection with the users.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:16:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Li",""],["Jiao","Baixi",""],["Liu","Yuxi",""]]}
{"id":"2308.11182","submitter":"Di Zhang","authors":"Di Zhang, Zhuyu Wang, Fangzhou Liu, Peiyun Yi, Linfa Peng, Yuan Chen,\n  Li Wei, Hao Li","title":"Unraveling the pH-Dependent Oxygen Reduction Performance on Single-Atom\n  Catalysts: From Single- to Dual-Sabatier Optima","comments":"24 pages, 5 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  M-N-C single-atom catalysts (SACs) have emerged as a potential substitute for\nthe costly platinum-group catalysts in oxygen reduction reaction (ORR).\nHowever, several critical aspects of M-N-C SACs in ORR remain poorly\nunderstood, including their pH-dependent activity, selectivity for 2- or\n4-electron transfer pathways, and the identification of the rate-determining\nsteps. Herein, analyzing >100 M-N-C structures and >2000 sets of energetics, we\nunveil for the first time a pH-dependent evolution in ORR activity volcanos\nfrom a single-peak in alkaline media to a double-peak in acids. We found that\nthis pH-dependent behavior in M-N-C catalysts fundamentally stems from their\nmoderate dipole moments and polarizability for O* and HOO* adsorbates, as well\nas unique scaling relations among ORR adsorbates. To validate our theoretical\ndiscovery, we synthesized a series of molecular M-N-C catalysts, each\ncharacterized by well-defined atomic coordination environments. Impressively,\nthe experiments matched our theoretical predictions on kinetic current, Tafel\nslope, and turnover frequency in both acidic and alkaline environments. These\nnew insights also refine the famous Sabatier principle by emphasizing the need\nto avoid an \"acid trap\" while designing M-N-C catalysts for ORR or any other\npH-dependent electrochemical applications.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:18:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Di",""],["Wang","Zhuyu",""],["Liu","Fangzhou",""],["Yi","Peiyun",""],["Peng","Linfa",""],["Chen","Yuan",""],["Wei","Li",""],["Li","Hao",""]]}
{"id":"2308.11183","submitter":"Setti Thirupathaiah Dr","authors":"Susanta Ghosh, Achintya Low, Soumya Ghorai, Kalyan Mandal, and Setti\n  Thirupathaiah","title":"Tuning of Electrical, Magnetic, and Topological Properties of Magnetic\n  Weyl Semimetal Mn$_{3+x}$Ge by Fe doping","comments":"16 pages and 5 figures, accepted in Journal of Physics: Condensed\n  Matter","journal-ref":null,"doi":"10.1088/1361-648X/acf262","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the tuning of electrical, magnetic, and topological properties\nof the magnetic Weyl semimetal (Mn$_{3+x}$Ge) by Fe doping at the Mn site,\nMn$_{(3+x)-\\delta}$Fe$_{\\delta}$Ge ($\\delta$=0, 0.30, and 0.62). Fe doping\nsignificantly changes the electrical and magnetic properties of Mn$_{3+x}$Ge.\nThe resistivity of the parent compound displays metallic behavior, the system\nwith $\\delta$=0.30 of Fe doping exhibits semiconducting or bad-metallic\nbehavior, and the system with $\\delta$=0.62 of Fe doping demonstrates a\nmetal-insulator transition at around 100 K. Further, we observe that the Fe\ndoping increases in-plane ferromagnetism, magnetocrystalline anisotropy, and\ninduces a spin-glass state at low temperatures. Surprisingly, topological Hall\nstate has been noticed at a Fe doping of $\\delta$=0.30 that is not found in the\nparent compound or with $\\delta$=0.62 of Fe doping. In addition, spontaneous\nanomalous Hall effect observed in the parent system is significantly reduced\nwith increasing Fe doping concentration.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:19:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ghosh","Susanta",""],["Low","Achintya",""],["Ghorai","Soumya",""],["Mandal","Kalyan",""],["Thirupathaiah","Setti",""]]}
{"id":"2308.11184","submitter":"Yufu Wang","authors":"Yufu Wang, Kostas Daniilidis","title":"ReFit: Recurrent Fitting Network for 3D Human Recovery","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Recurrent Fitting (ReFit), a neural network architecture for\nsingle-image, parametric 3D human reconstruction. ReFit learns a\nfeedback-update loop that mirrors the strategy of solving an inverse problem\nthrough optimization. At each iterative step, it reprojects keypoints from the\nhuman model to feature maps to query feedback, and uses a recurrent-based\nupdater to adjust the model to fit the image better. Because ReFit encodes\nstrong knowledge of the inverse problem, it is faster to train than previous\nregression models. At the same time, ReFit improves state-of-the-art\nperformance on standard benchmarks. Moreover, ReFit applies to other\noptimization settings, such as multi-view fitting and single-view shape\nfitting. Project website: https://yufu-wang.github.io/refit_humans/\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:20:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Yufu",""],["Daniilidis","Kostas",""]]}
{"id":"2308.11185","submitter":"Xinyu Li","authors":"Najmeh Sadoughi, Xinyu Li, Avijit Vajpayee, David Fan, Bing Shuai,\n  Hector Santos-Villalobos, Vimal Bhat, Rohith MV","title":"MEGA: Multimodal Alignment Aggregation and Distillation For Cinematic\n  Video Segmentation","comments":"ICCV 2023 accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previous research has studied the task of segmenting cinematic videos into\nscenes and into narrative acts. However, these studies have overlooked the\nessential task of multimodal alignment and fusion for effectively and\nefficiently processing long-form videos (>60min). In this paper, we introduce\nMultimodal alignmEnt aGgregation and distillAtion (MEGA) for cinematic\nlong-video segmentation. MEGA tackles the challenge by leveraging multiple\nmedia modalities. The method coarsely aligns inputs of variable lengths and\ndifferent modalities with alignment positional encoding. To maintain temporal\nsynchronization while reducing computation, we further introduce an enhanced\nbottleneck fusion layer which uses temporal alignment. Additionally, MEGA\nemploys a novel contrastive loss to synchronize and transfer labels across\nmodalities, enabling act segmentation from labeled synopsis sentences on video\nshots. Our experimental results show that MEGA outperforms state-of-the-art\nmethods on MovieNet dataset for scene segmentation (with an Average Precision\nimprovement of +1.19%) and on TRIPOD dataset for act segmentation (with a Total\nAgreement improvement of +5.51%)\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:23:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sadoughi","Najmeh",""],["Li","Xinyu",""],["Vajpayee","Avijit",""],["Fan","David",""],["Shuai","Bing",""],["Santos-Villalobos","Hector",""],["Bhat","Vimal",""],["MV","Rohith",""]]}
{"id":"2308.11186","submitter":"Teng Wang","authors":"Baoshuo Kan, Teng Wang, Wenpeng Lu, Xiantong Zhen, Weili Guan, Feng\n  Zheng","title":"Knowledge-Aware Prompt Tuning for Generalizable Vision-Language Models","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pre-trained vision-language models, e.g., CLIP, working with manually\ndesigned prompts have demonstrated great capacity of transfer learning.\nRecently, learnable prompts achieve state-of-the-art performance, which however\nare prone to overfit to seen classes, failing to generalize to unseen classes.\nIn this paper, we propose a Knowledge-Aware Prompt Tuning (KAPT) framework for\nvision-language models. Our approach takes inspiration from human intelligence\nin which external knowledge is usually incorporated into recognizing novel\ncategories of objects. Specifically, we design two complementary types of\nknowledge-aware prompts for the text encoder to leverage the distinctive\ncharacteristics of category-related external knowledge. The discrete prompt\nextracts the key information from descriptions of an object category, and the\nlearned continuous prompt captures overall contexts. We further design an\nadaptation head for the visual encoder to aggregate salient attentive visual\ncues, which establishes discriminative and task-aware visual representations.\nWe conduct extensive experiments on 11 widely-used benchmark datasets and the\nresults verify the effectiveness in few-shot image classification, especially\nin generalizing to unseen categories. Compared with the state-of-the-art CoCoOp\nmethod, KAPT exhibits favorable performance and achieves an absolute gain of\n3.22% on new classes and 2.57% in terms of harmonic mean.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:24:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kan","Baoshuo",""],["Wang","Teng",""],["Lu","Wenpeng",""],["Zhen","Xiantong",""],["Guan","Weili",""],["Zheng","Feng",""]]}
{"id":"2308.11187","submitter":"Hao Jin","authors":"Hao Jin, Minghui Lian, Shicheng Qiu, Xuxu Han, Xizhi Zhao, Long Yang,\n  Zhiyi Zhang, Haoran Xie, Kouichi Konno and Shaojun Hu","title":"A Semi-automatic Oriental Ink Painting Framework for Robotic Drawing\n  from 3D Models","comments":"12 pages, this manuscript is an extended version of our paper\n  accepted by IEEE RA-L","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Creating visually pleasing stylized ink paintings from 3D models is a\nchallenge in robotic manipulation. We propose a semi-automatic framework that\ncan extract expressive strokes from 3D models and draw them in oriental ink\npainting styles by using a robotic arm. The framework consists of a simulation\nstage and a robotic drawing stage. In the simulation stage, geometrical\ncontours were automatically extracted from a certain viewpoint and a neural\nnetwork was employed to create simplified contours. Then, expressive digital\nstrokes were generated after interactive editing according to user's aesthetic\nunderstanding. In the robotic drawing stage, an optimization method was\npresented for drawing smooth and physically consistent strokes to the digital\nstrokes, and two oriental ink painting styles termed as Noutan (shade) and\nKasure (scratchiness) were applied to the strokes by robotic control of a\nbrush's translation, dipping and scraping. Unlike existing methods that\nconcentrate on generating paintings from 2D images, our framework has the\nadvantage of rendering stylized ink paintings from 3D models by using a\nconsumer-grade robotic arm. We evaluate the proposed framework by taking 3\nstandard models and a user-defined model as examples. The results show that our\nframework is able to draw visually pleasing oriental ink paintings with\nexpressive strokes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:35:28 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 04:56:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jin","Hao",""],["Lian","Minghui",""],["Qiu","Shicheng",""],["Han","Xuxu",""],["Zhao","Xizhi",""],["Yang","Long",""],["Zhang","Zhiyi",""],["Xie","Haoran",""],["Konno","Kouichi",""],["Hu","Shaojun",""]]}
{"id":"2308.11188","submitter":"Siyao Liu","authors":"Siyao Liu and Yong Wang","title":"A note on modular forms and generalized anomaly cancellation formulas 2","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In [7], Liu and Wang generalized the Han-Liu-Zhang cancellation formulas to\nthe (a, b) type cancellation formulas. In this note, we prove some another (a,\nb) type cancellation formulas for even-dimensional Riemannian manifolds. And by\ntransgression, we obtain some characteristic forms with modularity properties\non odd-dimensional manifolds.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:49:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Siyao",""],["Wang","Yong",""]]}
{"id":"2308.11189","submitter":"Nathaniel Ezra Zheng Lee","authors":"Noel Ngu, Nathaniel Lee, Paulo Shakarian","title":"Diversity Measures: Domain-Independent Proxies for Failure in Language\n  Model Queries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Error prediction in large language models often relies on domain-specific\ninformation. In this paper, we present measures for quantification of error in\nthe response of a large language model based on the diversity of responses to a\ngiven prompt - hence independent of the underlying application. We describe how\nthree such measures - based on entropy, Gini impurity, and centroid distance -\ncan be employed. We perform a suite of experiments on multiple datasets and\ntemperature settings to demonstrate that these measures strongly correlate with\nthe probability of failure. Additionally, we present empirical results\ndemonstrating how these measures can be applied to few-shot prompting,\nchain-of-thought reasoning, and error detection.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:49:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ngu","Noel",""],["Lee","Nathaniel",""],["Shakarian","Paulo",""]]}
{"id":"2308.11190","submitter":"Bivudutta Mishra Dr.","authors":"Rahul Bhagat, S.A. Narawade, B. Mishra, S.K. Tripathy","title":"Constrained cosmological model in $f(Q,T)$ gravity with non-linear\n  non-metricity","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $f(Q,T)$ cosmological model has emerged as a promising framework for\nunderstanding various aspects of cosmic evolution. In this study, we focused on\nobtaining the constraints of the free parameters in the non-linear form of\nnon-metricity in $f(Q,T)$ gravity using the $Hubble$, $Pantheon$, and $BAO$\ndatasets. To determine the best-fit values for the model parameters and the\nequation of state (EoS) parameter, we employed an MCMC analysis. By examining\nthe error bar plots, we observed that both the model curve and the $\\Lambda$CDM\ncurve successfully passed through the range obtained from the datasets.\nAdditionally, we studied the state finder diagnostics and energy conditions to\ngain insights into the properties of the model. Furthermore, we conducted an\nanalysis using the $Om(z)$ diagnostic, which provides a null test for the\nvalidity of the $\\Lambda$CDM model.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:51:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bhagat","Rahul",""],["Narawade","S. A.",""],["Mishra","B.",""],["Tripathy","S. K.",""]]}
{"id":"2308.11191","submitter":"Abhinandan .","authors":"Abhinandan","title":"Crystalline representations and Wach modules in the imperfect residue\n  field case","comments":"Comments always welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an absolutely unramified field extension $L/\\mathbb{Q}_p$ with imperfect\nresidue field, we develop the notion of Wach modules in the setting of\n$(\\varphi,\\Gamma)$-modules for $L$. Our main result establishes a categorical\nequivalence between lattices inside crystalline representations of the absolute\nGalois group of $L$ and integral Wach modules. Moreover, we provide a direct\nrelation between a rational Wach module equipped with the Nygaard filtration\nand the filtered $\\varphi$-module of its associated crystalline representation\nin the imperfect residue field case.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:52:19 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Abhinandan","",""]]}
{"id":"2308.11192","submitter":"Srinjoy Das","authors":"Srinjoy Das, Lawrence Rauchwerger","title":"Automatic Task Parallelization of Dataflow Graphs in ML/DL models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Several methods exist today to accelerate Machine Learning(ML) or\nDeep-Learning(DL) model performance for training and inference. However, modern\ntechniques that rely on various graph and operator parallelism methodologies\nrely on search space optimizations which are costly in terms of power and\nhardware usage. Especially in the case of inference, when the batch size is 1\nand execution is on CPUs or for power-constrained edge devices, current\ntechniques can become costly, complicated or inapplicable. To ameliorate this,\nwe present a Critical-Path-based Linear Clustering approach to exploit inherent\nparallel paths in ML dataflow graphs. Our task parallelization approach further\noptimizes the structure of graphs via cloning and prunes them via constant\npropagation and dead-code elimination. Contrary to other work, we generate\nreadable and executable parallel Pytorch+Python code from input ML models in\nONNX format via a new tool that we have built called {\\bf Ramiel}. This allows\nus to benefit from other downstream acceleration techniques like intra-op\nparallelism and potentially pipeline parallelism. Our preliminary results on\nseveral ML graphs demonstrate up to 1.9$\\times$ speedup over serial execution\nand outperform some of the current mechanisms in both compile and runtimes.\nLastly, our methods are lightweight and fast enough so that they can be used\neffectively for power and resource-constrained devices, while still enabling\ndownstream optimizations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:54:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Das","Srinjoy",""],["Rauchwerger","Lawrence",""]]}
{"id":"2308.11193","submitter":"Nathan Garland","authors":"Malte Hildebrandt, Robert E Robson, Nathan A Garland","title":"Semi-empirical analysis of leptons in gases in crossed electric and\n  magnetic fields, Part II: Transverse compression of muon beams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.atom-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This article employs fluid equations to analyse muon beams in gases subject\nto crossed electric and magnetic fields, focussing in particular on a scheme\nproposed by D. Taqqu in 2006, whereby transverse compression of the beam is\nachieved by creating a density gradient in the gas. A general criterion for\nmaximising beam compression, derived from first principles, is then applied to\ndetermine optimal experimental conditions for {\\mu ^ +} in helium gas. Although\nthe calculations require input of transport data for ({\\mu ^ +}, He), which are\ngenerally unavailable, this issue is circumvented by \"aliasing\" ({\\mu ^ +}, He)\nwith (H{^ +}, He), for which transport coefficient data are available.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:55:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hildebrandt","Malte",""],["Robson","Robert E",""],["Garland","Nathan A",""]]}
{"id":"2308.11194","submitter":"Maya Varma","authors":"Maya Varma, Jean-Benoit Delbrouck, Sarah Hooper, Akshay Chaudhari,\n  Curtis Langlotz","title":"ViLLA: Fine-Grained Vision-Language Representation Learning from\n  Real-World Data","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vision-language models (VLMs), such as CLIP and ALIGN, are generally trained\non datasets consisting of image-caption pairs obtained from the web. However,\nreal-world multimodal datasets, such as healthcare data, are significantly more\ncomplex: each image (e.g. X-ray) is often paired with text (e.g. physician\nreport) that describes many distinct attributes occurring in fine-grained\nregions of the image. We refer to these samples as exhibiting high pairwise\ncomplexity, since each image-text pair can be decomposed into a large number of\nregion-attribute pairings. The extent to which VLMs can capture fine-grained\nrelationships between image regions and textual attributes when trained on such\ndata has not been previously evaluated. The first key contribution of this work\nis to demonstrate through systematic evaluations that as the pairwise\ncomplexity of the training dataset increases, standard VLMs struggle to learn\nregion-attribute relationships, exhibiting performance degradations of up to\n37% on retrieval tasks. In order to address this issue, we introduce ViLLA as\nour second key contribution. ViLLA, which is trained to capture fine-grained\nregion-attribute relationships from complex datasets, involves two components:\n(a) a lightweight, self-supervised mapping model to decompose image-text\nsamples into region-attribute pairs, and (b) a contrastive VLM to learn\nrepresentations from generated region-attribute pairs. We demonstrate with\nexperiments across four domains (synthetic, product, medical, and natural\nimages) that ViLLA outperforms comparable VLMs on fine-grained reasoning tasks,\nsuch as zero-shot object detection (up to 3.6 AP50 points on COCO and 0.6 mAP\npoints on LVIS) and retrieval (up to 14.2 R-Precision points).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:03:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Varma","Maya",""],["Delbrouck","Jean-Benoit",""],["Hooper","Sarah",""],["Chaudhari","Akshay",""],["Langlotz","Curtis",""]]}
{"id":"2308.11195","submitter":"Yi-Zhuang You","authors":"Da-Chuan Lu, Miao Li, Zhao-Yi Zeng, Wanda Hou, Juven Wang, Fan Yang,\n  Yi-Zhuang You","title":"Superconductivity from Doping Symmetric Mass Generation Insulators:\n  Application to La$_3$Ni$_2$O$_7$ under Pressure","comments":"11 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the bilayer nickelates as a platform to realize the symmetric\nmass generation (SMG) insulator, a featureless Mott insulator that arises due\nto the Lieb-Schultz-Mattis (LSM) anomaly cancellation in bilayer spin-1/2\nlattice systems. Through a single-orbital bilayer square lattice model\ninvolving intralayer hopping $t$ and interlayer superexchange interaction $J$,\nwe demonstrate the emergence of high-temperature superconductivity (SC) upon\ndoping the SMG insulator. The SC phase features $s$-wave interlayer\nspin-singlet pairing and exhibits a crossover between the BCS and BEC limits by\ntuning the $J/t$ ratio. We estimate the SC transition temperature $T_c$ from\nboth the weak and strong coupling limits at the mean-field level. Our findings\noffer insights into the experimentally observed decrease in $T_c$ with pressure\nand the strange metal behavior above $T_c$. Additionally, we propose that both\nNi $3d_{z^2}$ and $3d_{x^2-y^2}$ orbitals can exhibit superconductivity in\nLa$_3$Ni$_2$O$_7$ under pressure, but their $T_c$ should vary in opposite ways\nunder doping. This characteristic difference suggests a potential experimental\npathway to identify which electronic orbital plays the principal role in the\nformation of superconductivity in this system.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:03:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Da-Chuan",""],["Li","Miao",""],["Zeng","Zhao-Yi",""],["Hou","Wanda",""],["Wang","Juven",""],["Yang","Fan",""],["You","Yi-Zhuang",""]]}
{"id":"2308.11196","submitter":"Stefan Heinen","authors":"Stefan Heinen and Danish Khan and Guido Falk von Rudorff and\n  Konstantin Karandashev and Daniel Jose Arismendi Arrieta and Alastair J. A.\n  Price and Surajit Nandi and Arghya Bhowmik and Kersti Hermansson and O.\n  Anatole von Lilienfeld","title":"Reducing Training Data Needs with Minimal Multilevel Machine Learning\n  (M3L)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  For many machine learning applications in science, data acquisition, not\ntraining, is the bottleneck even when avoiding experiments and relying on\ncomputation and simulation. Correspondingly, and in order to reduce cost and\ncarbon footprint, training data efficiency is key. We introduce minimal\nmultilevel machine learning (M3L) which optimizes training data set sizes using\na loss function at multiple levels of reference data in order to minimize a\ncombination of prediction error with overall training data acquisition costs\n(as measured by computational wall-times). Numerical evidence has been obtained\nfor calculated atomization energies and electron affinities of thousands of\norganic molecules at various levels of theory including HF, MP2, DLPNO-CCSD(T),\nDFHFCABS, PNOMP2F12, and PNOCCSD(T)F12, and treating tens with basis sets TZ,\ncc-pVTZ, and AVTZ-F12. Our M3L benchmarks for reaching chemical accuracy in\ndistinct chemical compound sub-spaces indicate substantial computational cost\nreductions by factors of $\\sim$ 1.01, 1.1, 3.8, 13.8 and 25.8 when compared to\nheuristic sub-optimal multilevel machine learning (M2L) for the data sets QM7b,\nQM9$^\\mathrm{LCCSD(T)}$, EGP, QM9$^\\mathrm{CCSD(T)}_\\mathrm{AE}$, and\nQM9$^\\mathrm{CCSD(T)}_\\mathrm{EA}$, respectively. Furthermore, we use M2L to\ninvestigate the performance for 76 density functionals when used within\nmultilevel learning and building on the following levels drawn from the\nhierarchy of Jacobs Ladder:~LDA, GGA, mGGA, and hybrid functionals. Within M2L\nand the molecules considered, mGGAs do not provide any noticeable advantage\nover GGAs. Among the functionals considered and in combination with LDA, the\nthree on average top performing GGA and Hybrid levels for atomization energies\non QM9 using M3L correspond respectively to PW91, KT2, B97D, and $\\tau$-HCTH,\nB3LYP$\\ast$(VWN5), TPSSH.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:13:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Heinen","Stefan",""],["Khan","Danish",""],["von Rudorff","Guido Falk",""],["Karandashev","Konstantin",""],["Arrieta","Daniel Jose Arismendi",""],["Price","Alastair J. A.",""],["Nandi","Surajit",""],["Bhowmik","Arghya",""],["Hermansson","Kersti",""],["von Lilienfeld","O. Anatole",""]]}
{"id":"2308.11197","submitter":"Hamzeh Ghasemzadeh","authors":"Hamzeh Ghasemzadeh, Robert E. Hillman, Daryush D. Mehta","title":"Toward Generalizable Machine Learning Models in Speech, Language, and\n  Hearing Sciences: Sample Size Estimation and Reducing Overfitting","comments":"Under review at JSLHR","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This study's first purpose is to provide quantitative evidence that would\nincentivize researchers to instead use the more robust method of nested\ncross-validation. The second purpose is to present methods and MATLAB codes for\ndoing power analysis for ML-based analysis during the design of a study. Monte\nCarlo simulations were used to quantify the interactions between the employed\ncross-validation method, the discriminative power of features, the\ndimensionality of the feature space, and the dimensionality of the model. Four\ndifferent cross-validations (single holdout, 10-fold, train-validation-test,\nand nested 10-fold) were compared based on the statistical power and\nstatistical confidence of the ML models. Distributions of the null and\nalternative hypotheses were used to determine the minimum required sample size\nfor obtaining a statistically significant outcome ({\\alpha}=0.05,\n1-\\b{eta}=0.8). Statistical confidence of the model was defined as the\nprobability of correct features being selected and hence being included in the\nfinal model. Our analysis showed that the model generated based on the single\nholdout method had very low statistical power and statistical confidence and\nthat it significantly overestimated the accuracy. Conversely, the nested\n10-fold cross-validation resulted in the highest statistical confidence and the\nhighest statistical power, while providing an unbiased estimate of the\naccuracy. The required sample size with a single holdout could be 50% higher\nthan what would be needed if nested cross-validation were used. Confidence in\nthe model based on nested cross-validation was as much as four times higher\nthan the confidence in the single holdout-based model. A computational model,\nMATLAB codes, and lookup tables are provided to assist researchers with\nestimating the sample size during the design of their future studies.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:14:42 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 02:07:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ghasemzadeh","Hamzeh",""],["Hillman","Robert E.",""],["Mehta","Daryush D.",""]]}
{"id":"2308.11198","submitter":"Wentian Qu","authors":"Wentian Qu, Zhaopeng Cui, Yinda Zhang, Chenyu Meng, Cuixia Ma,\n  Xiaoming Deng, Hongan Wang","title":"Novel-view Synthesis and Pose Estimation for Hand-Object Interaction\n  from Sparse Views","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hand-object interaction understanding and the barely addressed novel view\nsynthesis are highly desired in the immersive communication, whereas it is\nchallenging due to the high deformation of hand and heavy occlusions between\nhand and object. In this paper, we propose a neural rendering and pose\nestimation system for hand-object interaction from sparse views, which can also\nenable 3D hand-object interaction editing. We share the inspiration from recent\nscene understanding work that shows a scene specific model built beforehand can\nsignificantly improve and unblock vision tasks especially when inputs are\nsparse, and extend it to the dynamic hand-object interaction scenario and\npropose to solve the problem in two stages. We first learn the shape and\nappearance prior knowledge of hands and objects separately with the neural\nrepresentation at the offline stage. During the online stage, we design a\nrendering-based joint model fitting framework to understand the dynamic\nhand-object interaction with the pre-built hand and object models as well as\ninteraction priors, which thereby overcomes penetration and separation issues\nbetween hand and object and also enables novel view synthesis. In order to get\nstable contact during the hand-object interaction process in a sequence, we\npropose a stable contact loss to make the contact region to be consistent.\nExperiments demonstrate that our method outperforms the state-of-the-art\nmethods. Code and dataset are available in project webpage\nhttps://iscas3dv.github.io/HO-NeRF.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:17:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Qu","Wentian",""],["Cui","Zhaopeng",""],["Zhang","Yinda",""],["Meng","Chenyu",""],["Ma","Cuixia",""],["Deng","Xiaoming",""],["Wang","Hongan",""]]}
{"id":"2308.11199","submitter":"Donghoon Han","authors":"Donghoon Han, Seunghyeon Seo, Donghyeon Jeon, Jiho Jang, Chaerin Kong\n  and Nojun Kwak","title":"ConcatPlexer: Additional Dim1 Batching for Faster ViTs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transformers have demonstrated tremendous success not only in the natural\nlanguage processing (NLP) domain but also the field of computer vision,\nigniting various creative approaches and applications. Yet, the superior\nperformance and modeling flexibility of transformers came with a severe\nincrease in computation costs, and hence several works have proposed methods to\nreduce this burden. Inspired by a cost-cutting method originally proposed for\nlanguage models, Data Multiplexing (DataMUX), we propose a novel approach for\nefficient visual recognition that employs additional dim1 batching (i.e.,\nconcatenation) that greatly improves the throughput with little compromise in\nthe accuracy. We first introduce a naive adaptation of DataMux for vision\nmodels, Image Multiplexer, and devise novel components to overcome its\nweaknesses, rendering our final model, ConcatPlexer, at the sweet spot between\ninference speed and accuracy. The ConcatPlexer was trained on ImageNet1K and\nCIFAR100 dataset and it achieved 23.5% less GFLOPs than ViT-B/16 with 69.5% and\n83.4% validation accuracy, respectively.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:21:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Han","Donghoon",""],["Seo","Seunghyeon",""],["Jeon","Donghyeon",""],["Jang","Jiho",""],["Kong","Chaerin",""],["Kwak","Nojun",""]]}
{"id":"2308.11200","submitter":"Shengsheng Lin","authors":"Shengsheng Lin, Weiwei Lin, Wentai Wu, Feiyu Zhao, Ruichao Mo, Haotong\n  Zhang","title":"SegRNN: Segment Recurrent Neural Network for Long-Term Time Series\n  Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  RNN-based methods have faced challenges in the Long-term Time Series\nForecasting (LTSF) domain when dealing with excessively long look-back windows\nand forecast horizons. Consequently, the dominance in this domain has shifted\ntowards Transformer, MLP, and CNN approaches. The substantial number of\nrecurrent iterations are the fundamental reasons behind the limitations of RNNs\nin LTSF. To address these issues, we propose two novel strategies to reduce the\nnumber of iterations in RNNs for LTSF tasks: Segment-wise Iterations and\nParallel Multi-step Forecasting (PMF). RNNs that combine these strategies,\nnamely SegRNN, significantly reduce the required recurrent iterations for LTSF,\nresulting in notable improvements in forecast accuracy and inference speed.\nExtensive experiments demonstrate that SegRNN not only outperforms SOTA\nTransformer-based models but also reduces runtime and memory usage by more than\n78%. These achievements provide strong evidence that RNNs continue to excel in\nLTSF tasks and encourage further exploration of this domain with more RNN-based\napproaches. The source code is coming soon.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:23:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lin","Shengsheng",""],["Lin","Weiwei",""],["Wu","Wentai",""],["Zhao","Feiyu",""],["Mo","Ruichao",""],["Zhang","Haotong",""]]}
{"id":"2308.11201","submitter":"Wenbo Xu","authors":"Wenbo Xu, Huaxi Huang, Ming Cheng, Litao Yu, Qiang Wu, Jian Zhang","title":"Masked Cross-image Encoding for Few-shot Segmentation","comments":"conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Few-shot segmentation (FSS) is a dense prediction task that aims to infer the\npixel-wise labels of unseen classes using only a limited number of annotated\nimages. The key challenge in FSS is to classify the labels of query pixels\nusing class prototypes learned from the few labeled support exemplars. Prior\napproaches to FSS have typically focused on learning class-wise descriptors\nindependently from support images, thereby ignoring the rich contextual\ninformation and mutual dependencies among support-query features. To address\nthis limitation, we propose a joint learning method termed Masked Cross-Image\nEncoding (MCE), which is designed to capture common visual properties that\ndescribe object details and to learn bidirectional inter-image dependencies\nthat enhance feature interaction. MCE is more than a visual representation\nenrichment module; it also considers cross-image mutual dependencies and\nimplicit guidance. Experiments on FSS benchmarks PASCAL-$5^i$ and COCO-$20^i$\ndemonstrate the advanced meta-learning ability of the proposed method.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:36:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Xu","Wenbo",""],["Huang","Huaxi",""],["Cheng","Ming",""],["Yu","Litao",""],["Wu","Qiang",""],["Zhang","Jian",""]]}
{"id":"2308.11202","submitter":"Kapil Panda","authors":"Kapil Panda","title":"Analysis of Optimal Portfolio Management Using Hierarchical Clustering","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Portfolio optimization is a task that investors use to determine the best\nallocations for their investments, and fund managers implement computational\nmodels to help guide their decisions. While one of the most common portfolio\noptimization models in the industry is the Markowitz Model, practitioners\nrecognize limitations in its framework that lead to suboptimal out-of-sample\nperformance and unrealistic allocations. In this study, I refine the Markowitz\nModel by incorporating machine learning to improve portfolio performance. By\nusing a hierarchical clustering-based approach, I am able to enhance portfolio\nperformance on a risk-adjusted basis compared to the Markowitz Model, across\nvarious market factors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:37:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Panda","Kapil",""]]}
{"id":"2308.11203","submitter":"Jack Thompson","authors":"Serena Dipierro, Giorgio Poggesi, Jack Thompson, Enrico Valdinoci","title":"Quantitative stability for overdetermined nonlocal problems with\n  parallel surfaces and investigation of the stability exponents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we analyze the stability of the parallel surface problem for\nsemilinear equations driven by the fractional Laplacian. We prove a\nquantitative stability result that goes beyond that previously obtained in\n[Cir+23].\n  Moreover, we discuss in detail several techniques and challenges in obtaining\nthe optimal exponent in this stability result. In particular, this includes an\nupper bound on the exponent via an explicit computation involving a family of\nellipsoids. We also sharply investigate a technique that was proposed in\n[Cir+18] to obtain the optimal stability exponent in the quantitative estimate\nfor the nonlocal Alexandrov's soap bubble theorem, obtaining accurate estimates\nto be compared with a new, explicit example.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:40:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dipierro","Serena",""],["Poggesi","Giorgio",""],["Thompson","Jack",""],["Valdinoci","Enrico",""]]}
{"id":"2308.11204","submitter":"Zihang Liu","authors":"Zihang Liu, Le Yu, Tongyu Zhu, Leiei Sun","title":"A Simple Framework for Multi-mode Spatial-Temporal Data Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatial-temporal data modeling aims to mine the underlying spatial\nrelationships and temporal dependencies of objects in a system. However, most\nexisting methods focus on the modeling of spatial-temporal data in a single\nmode, lacking the understanding of multiple modes. Though very few methods have\nbeen presented to learn the multi-mode relationships recently, they are built\non complicated components with higher model complexities. In this paper, we\npropose a simple framework for multi-mode spatial-temporal data modeling to\nbring both effectiveness and efficiency together. Specifically, we design a\ngeneral cross-mode spatial relationships learning component to adaptively\nestablish connections between multiple modes and propagate information along\nthe learned connections. Moreover, we employ multi-layer perceptrons to capture\nthe temporal dependencies and channel correlations, which are conceptually and\ntechnically succinct. Experiments on three real-world datasets show that our\nmodel can consistently outperform the baselines with lower space and time\ncomplexity, opening up a promising direction for modeling spatial-temporal\ndata. The generalizability of the cross-mode spatial relationships learning\nmodule is also validated.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:41:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Zihang",""],["Yu","Le",""],["Zhu","Tongyu",""],["Sun","Leiei",""]]}
{"id":"2308.11205","submitter":"Gaurav Bhardwaj","authors":"Gaurav Bhardwaj, Bapi Chatterjee, Abhinav Sharma, Sathya Peri and\n  Siddharth Nayak","title":"Learned Lock-free Search Data Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-blocking search data structures offer scalability with a progress\nguarantee on high-performance multi-core architectures. In the recent past,\n\"learned queries\" have gained remarkable attention. It refers to predicting the\nrank of a key computed by machine learning models trained to infer the\ncumulative distribution function of an ordered dataset. A line of works\nexhibits the superiority of learned queries over classical query algorithms.\nYet, to our knowledge, no existing non-blocking search data structure employs\nthem. In this paper, we introduce \\textbf{Kanva}, a framework for learned\nnon-blocking search. Kanva has an intuitive yet non-trivial design: traverse\ndown a shallow hierarchy of lightweight linear models to reach the\n\"non-blocking bins,\" which are dynamic ordered search structures. The proposed\napproach significantly outperforms the current state-of-the-art -- non-blocking\ninterpolation search trees and elimination (a,b) trees -- in many workload and\ndata distributions. Kanva is provably linearizable.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:42:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bhardwaj","Gaurav",""],["Chatterjee","Bapi",""],["Sharma","Abhinav",""],["Peri","Sathya",""],["Nayak","Siddharth",""]]}
{"id":"2308.11206","submitter":"Xujie Zhang","authors":"Xujie Zhang, Binbin Yang, Michael C. Kampffmeyer, Wenqing Zhang,\n  Shiyue Zhang, Guansong Lu, Liang Lin, Hang Xu, Xiaodan Liang","title":"DiffCloth: Diffusion Based Garment Synthesis and Manipulation via\n  Structural Cross-modal Semantic Alignment","comments":"accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cross-modal garment synthesis and manipulation will significantly benefit the\nway fashion designers generate garments and modify their designs via flexible\nlinguistic interfaces.Current approaches follow the general text-to-image\nparadigm and mine cross-modal relations via simple cross-attention modules,\nneglecting the structural correspondence between visual and textual\nrepresentations in the fashion design domain. In this work, we instead\nintroduce DiffCloth, a diffusion-based pipeline for cross-modal garment\nsynthesis and manipulation, which empowers diffusion models with flexible\ncompositionality in the fashion domain by structurally aligning the cross-modal\nsemantics. Specifically, we formulate the part-level cross-modal alignment as a\nbipartite matching problem between the linguistic Attribute-Phrases (AP) and\nthe visual garment parts which are obtained via constituency parsing and\nsemantic segmentation, respectively. To mitigate the issue of attribute\nconfusion, we further propose a semantic-bundled cross-attention to preserve\nthe spatial structure similarities between the attention maps of attribute\nadjectives and part nouns in each AP. Moreover, DiffCloth allows for\nmanipulation of the generated results by simply replacing APs in the text\nprompts. The manipulation-irrelevant regions are recognized by blended masks\nobtained from the bundled attention maps of the APs and kept unchanged.\nExtensive experiments on the CM-Fashion benchmark demonstrate that DiffCloth\nboth yields state-of-the-art garment synthesis results by leveraging the\ninherent structural information and supports flexible manipulation with region\nconsistency.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:43:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Xujie",""],["Yang","Binbin",""],["Kampffmeyer","Michael C.",""],["Zhang","Wenqing",""],["Zhang","Shiyue",""],["Lu","Guansong",""],["Lin","Liang",""],["Xu","Hang",""],["Liang","Xiaodan",""]]}
{"id":"2308.11207","submitter":"Muzi Hong","authors":"Muzi Hong, Ryusuke Jinno","title":"Quartic Gradient Flow","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"RESCEU-16/23","categories":"hep-ph astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Saddle-point configurations, such as the Euclidean bounce and sphalerons, are\nknown to be difficult to find numerically. In this Letter we study a new\nmethod, Quartic Gradient Flow, to search for such configurations. The central\nidea is to introduce a gradient-flow-like equation in such a way that all the\nfluctuations around the saddle-point have eigenvalues that are square of the\neigenvalues of the original quadratic operator. We illustrate how the method\nworks for the Euclidean bounce and sphalerons.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:45:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hong","Muzi",""],["Jinno","Ryusuke",""]]}
{"id":"2308.11208","submitter":"Fedor Kovalev","authors":"Fedor Kovalev and Ilya Shadrivov","title":"Parametric metasurfaces for electromagnetic wave amplification","comments":"The following article has been submitted to Applied Physics Letters.\n  After it is published, it will be found at https://pubs.aip.org/aip/apl","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study parametric amplification of electromagnetic waves by metasurfaces.\nWe design a variable capacitor-loaded metasurface that is able to amplify\nincident electromagnetic waves. We analyze various regimes of operation of the\nsystem and find that we can achieve a significant gain (over 10 dB) in just one\nlayer of such structure, and this gain can be controlled by the parametric\nmodulation. We study the instability threshold for this system and show that a\nsimple theoretical model agrees well with the results of full numerical\nsimulations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:45:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kovalev","Fedor",""],["Shadrivov","Ilya",""]]}
{"id":"2308.11209","submitter":"Anupama Mampage","authors":"Anupama Mampage, Shanika Karunasekera, Rajkumar Buyya","title":"A Deep Reinforcement Learning based Algorithm for Time and Cost\n  Optimized Scaling of Serverless Applications","comments":"15 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Serverless computing has gained a strong traction in the cloud computing\ncommunity in recent years. Among the many benefits of this novel computing\nmodel, the rapid auto-scaling capability of user applications takes prominence.\nHowever, the offer of adhoc scaling of user deployments at function level\nintroduces many complications to serverless systems. The added delay and\nfailures in function request executions caused by the time consumed for\ndynamically creating new resources to suit function workloads, known as the\ncold-start delay, is one such very prevalent shortcoming. Maintaining idle\nresource pools to alleviate this issue often results in wasted resources from\nthe cloud provider perspective. Existing solutions to address this limitation\nmostly focus on predicting and understanding function load levels in order to\nproactively create required resources. Although these solutions improve\nfunction performance, the lack of understanding on the overall system\ncharacteristics in making these scaling decisions often leads to the\nsub-optimal usage of system resources. Further, the multi-tenant nature of\nserverless systems requires a scalable solution adaptable for multiple\nco-existing applications, a limitation seen in most current solutions. In this\npaper, we introduce a novel multi-agent Deep Reinforcement Learning based\nintelligent solution for both horizontal and vertical scaling of function\nresources, based on a comprehensive understanding on both function and system\nrequirements. Our solution elevates function performance reducing cold starts,\nwhile also offering the flexibility for optimizing resource maintenance cost to\nthe service providers. Experiments conducted considering varying workload\nscenarios show improvements of up to 23% and 34% in terms of application\nlatency and request failures, while also saving up to 45% in infrastructure\ncost for the service providers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:45:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mampage","Anupama",""],["Karunasekera","Shanika",""],["Buyya","Rajkumar",""]]}
{"id":"2308.11210","submitter":"Dooyoung Kim","authors":"Dooyoung Kim, Woontack Woo","title":"Edge-Centric Space Rescaling with Redirected Walking for Dissimilar\n  Physical-Virtual Space Registration","comments":"This paper has been accepted as a paper for the 2023 ISMAR conference\n  (2023/10/16-2023/10/20) 10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a novel space-rescaling technique for registering dissimilar\nphysical-virtual spaces by utilizing the effects of adjusting physical space\nwith redirected walking. Achieving a seamless immersive Virtual Reality (VR)\nexperience requires overcoming the spatial heterogeneities between the physical\nand virtual spaces and accurately aligning the VR environment with the user's\ntracked physical space. However, existing space-matching algorithms that rely\non one-to-one scale mapping are inadequate when dealing with highly dissimilar\nphysical and virtual spaces, and redirected walking controllers could not\nutilize basic geometric information from physical space in the virtual space\ndue to coordinate distortion. To address these issues, we apply relative\ntranslation gains to partitioned space grids based on the main interactable\nobject's edge, which enables space-adaptive modification effects of physical\nspace without coordinate distortion. Our evaluation results demonstrate the\neffectiveness of our algorithm in aligning the main object's edge, surface, and\nwall, as well as securing the largest registered area compared to alternative\nmethods under all conditions. These findings can be used to create an immersive\nplay area for VR content where users can receive passive feedback from the\nplane and edge in their physical environment.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:47:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Dooyoung",""],["Woo","Woontack",""]]}
{"id":"2308.11211","submitter":"Dawei Li","authors":"Kun Liu, Yutian Lei, Dawei Li","title":"Simultaneous 3D Construction and Imaging of Plant Cells Using Plasmonic\n  Nanoprobe Assisted Multimodal Nonlinear Optical Microscopy","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Nonlinear optical (NLO) imaging has emerged as a promising plant cell imaging\ntechnique due to its large optical penetration, inherent 3D spatial resolution,\nand reduced photodamage, meanwhile exogenous nanoprobes are usually needed for\nnon-signal target cell analysis. Here, we report in-vivo, simultaneous 3D\nlabeling and imaging of potato cell structures using plasmonic\nnanoprobe-assisted multimodal NLO microscopy. Experimental results show that\nthe complete cell structure could be imaged by the combination of\nsecond-harmonic generation (SHG) and two-photon luminescence (TPL) when noble\nmetal silver or gold ions are added. In contrast, without noble metal ion\nsolution, no NLO signals from the cell wall could be acquired. The mechanism\ncan be attributed to noble metal nanoprobes with strong nonlinear optical\nresponses formed along the cell walls via a femtosecond laser scan. During the\nSHG-TPL imaging process, noble metal ions that cross the cell wall could be\nrapidly reduced to plasmonic nanoparticles by fs laser and selectively anchored\nonto both sides of the cell wall, thereby leading to simultaneous 3D labeling\nand imaging of potato cells. Compared with traditional labeling technique that\nneeds in-vitro nanoprobe fabrication and cell labeling, our approach allows for\none-step, in-vivo labeling of plant cells, thus providing a rapid,\ncost-effective way for cellular structure construction and imaging.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:48:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Kun",""],["Lei","Yutian",""],["Li","Dawei",""]]}
{"id":"2308.11212","submitter":"Latifah Hanum","authors":"Latifah Hanum, Nanang Susyanto and Dwi Ertiningsih","title":"Mathematical Model of the Impact of Chemotherapy and Anti-Angiogenic\n  Therapy on Drug Resistance in Glioma Growth","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS q-bio.TO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research presents a mathematical model of glioma growth dynamics with\ndrug resistance, capturing interactions among five cell populations: glial\ncells, sensitive glioma cells, resistant glioma cells, endothelial cells, and\nneuron cells, along with two therapy agent populations: chemotherapy and\nanti-angiogenic therapy. Glioma is a malignant tumor originating from glial\ncells, undergoes chemotherapy-induced mutations, leading to drug-resistant\nglioma cells. This not only impacts glioma cells but also normal cells.\nCombining chemotherapy and anti-angiogenic therapy, the model employs a Holling\ntype II response function, considering optimal dosages for treatment\noptimization. Through analysis, three equilibrium are identified: two stable\nand one unstable equilibrium points. Numerical simulations, employing phase\nportraits and trajectory diagrams, illustrate the combined therapies impact on\nglioma cells. In summary, this concise model explores glioma dynamics and drug\nresistance, offering insights into the efficacy of combined therapies, crucial\nfor optimizing glioma treatment.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:55:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hanum","Latifah",""],["Susyanto","Nanang",""],["Ertiningsih","Dwi",""]]}
{"id":"2308.11213","submitter":"Xinzhou Su","authors":"Xinzhou Su, Kaiheng Zou, Huibin Zhou, Hao Song, Yingning Wang, Ruoyu\n  Zeng, Zile Jiang, Yuxiang Duan, Maxim Karpov, Tobias J. Kippenberg, Moshe\n  Tur, Demetrios N. Christodoulides, and Alan E. Willner","title":"Temporally and Longitudinally Tailored Dynamic Space-Time Wave Packets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In general, space-time wave packets with correlations between transverse\nspatial fields and temporal frequency spectra can lead to unique spatiotemporal\ndynamics, thus enabling control of the instantaneous light properties. However,\nspatiotemporal dynamics generated in previous approaches manifest themselves at\na given propagation distance yet not arbitrarily tailored longitudinally. Here,\nwe propose and demonstrate a new versatile class of judiciously synthesized\nwave packets whose spatiotemporal evolution can be arbitrarily engineered to\ntake place at various predesigned distances along the longitudinal propagation\npath. Spatiotemporal synthesis is achieved by introducing a 2-dimensional\nspectrum comprising both temporal and longitudinal wavenumbers associated with\nspecific transverse Bessel-Gaussian fields. The resulting spectra are then\nemployed to produce wave packets evolving in both time and axial distance - in\nfull accord with the theoretical analysis. In this respect, various light\ndegrees of freedom can be independently manipulated, such as intensity,\npolarization, and transverse spatial distribution (e.g., orbital angular\nmomentum). Through a temporal-longitudinal frequency comb spectrum, we simulate\nthe synthesis of the aforementioned wave packet properties, indicating a\ndecrease in relative error compared to the desired phenomena as more spectral\ncomponents are incorporated. Additionally, we experimentally demonstrate\ntailorable spatiotemporal fields carrying time- and longitudinal-varying\norbital angular momentum, such that the local topological charge evolves every\n~1 ps in the time domain and 10 cm axially. We believe that our space-time wave\npackets can significantly expand the exploration of spatiotemporal dynamics in\nthe longitudinal dimension, and potentially enable novel applications in\nultrafast microscopy, light-matter interactions, and nonlinear optics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:55:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Su","Xinzhou",""],["Zou","Kaiheng",""],["Zhou","Huibin",""],["Song","Hao",""],["Wang","Yingning",""],["Zeng","Ruoyu",""],["Jiang","Zile",""],["Duan","Yuxiang",""],["Karpov","Maxim",""],["Kippenberg","Tobias J.",""],["Tur","Moshe",""],["Christodoulides","Demetrios N.",""],["Willner","Alan E.",""]]}
{"id":"2308.11214","submitter":"Jeff R Hammond","authors":"Jeff R. Hammond, Lisandro Dalcin, Erik Schnetter, Marc P\\'erache,\n  Jean-Baptiste Besnard, Jed Brown, Gonzalo Brito Gadeschi, Joseph Schuchart,\n  Simon Byrne and Hui Zhou","title":"MPI Application Binary Interface Standardization","comments":null,"journal-ref":null,"doi":"10.1145/3615318.3615319","report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  MPI is the most widely used interface for high-performance computing (HPC)\nworkloads. Its success lies in its embrace of libraries and ability to evolve\nwhile maintaining backward compatibility for older codes, enabling them to run\non new architectures for many years. In this paper, we propose a new level of\nMPI compatibility: a standard Application Binary Interface (ABI). We review the\nhistory of MPI implementation ABIs, identify the constraints from the MPI\nstandard and ISO C, and summarize recent efforts to develop a standard ABI for\nMPI. We provide the current proposal from the MPI Forum's ABI working group,\nwhich has been prototyped both within MPICH and as an independent abstraction\nlayer called Mukautuva. We also list several use cases that would benefit from\nthe definition of an ABI while outlining the remaining constraints.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:57:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hammond","Jeff R.",""],["Dalcin","Lisandro",""],["Schnetter","Erik",""],["P\u00e9rache","Marc",""],["Besnard","Jean-Baptiste",""],["Brown","Jed",""],["Gadeschi","Gonzalo Brito",""],["Schuchart","Joseph",""],["Byrne","Simon",""],["Zhou","Hui",""]]}
{"id":"2308.11215","submitter":"Soham Sen","authors":"Sukanta Bhattacharyya, Soham Sen, and Sunandan Gangopadhyay","title":"Resonant detectors of gravitational wave in the linear and quadratic\n  generalized uncertainty principle framework","comments":"19 pages LATEX. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we consider a resonant bar detector of gravitational wave in\nthe generalized uncertainty principle (GUP) framework with linear and quadratic\nmomentum uncertainties. The phonon modes in these detectors vibrate due to the\ninteraction with the incoming gravitational wave. In this uncertainty principle\nframework, we calculate the resonant frequencies and transition rates induced\nby the incoming gravitational waves on these detectors. We observe that the\nenergy eigenstates and the eigenvalues get modified by the GUP parameters. We\nalso observe non-vanishing transition probabilities between two adjacent energy\nlevels due to the existence of the linear order momentum correction in the\ngeneralized uncertainty relation which was not present in the quadratic GUP\nanalysis [\\href{http://dx.doi.org/10.1088/1361-6382/abac45}{Class. Quantum\nGrav. 37 (2020) 195006}]. We finally obtain bounds on the dimensionless GUP\nparameters using the form of the transition rates obtained during this\nanalysis.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:00:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bhattacharyya","Sukanta",""],["Sen","Soham",""],["Gangopadhyay","Sunandan",""]]}
{"id":"2308.11216","submitter":"Christine Allen-Blanchette","authors":"Christine Allen-Blanchette","title":"Hamiltonian GAN","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A growing body of work leverages the Hamiltonian formalism as an inductive\nbias for physically plausible neural network based video generation. The\nstructure of the Hamiltonian ensures conservation of a learned quantity (e.g.,\nenergy) and imposes a phase-space interpretation on the low-dimensional\nmanifold underlying the input video. While this interpretation has the\npotential to facilitate the integration of learned representations in\ndownstream tasks, existing methods are limited in their applicability as they\nrequire a structural prior for the configuration space at design time. In this\nwork, we present a GAN-based video generation pipeline with a learned\nconfiguration space map and Hamiltonian neural network motion model, to learn a\nrepresentation of the configuration space from data. We train our model with a\nphysics-inspired cyclic-coordinate loss function which encourages a minimal\nrepresentation of the configuration space and improves interpretability. We\ndemonstrate the efficacy and advantages of our approach on the Hamiltonian\nDynamics Suite Toy Physics dataset.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:03:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Allen-Blanchette","Christine",""]]}
{"id":"2308.11217","submitter":"Zhaoxiang Hou","authors":"Zengxiang Li and Zhaoxiang Hou and Hui Liu and Ying Wang and Tongzhi\n  Li and Longfei Xie and Chao Shi and Chengyi Yang and Weishan Zhang and Zelei\n  Liu and Liang Xu","title":"Federated Learning in Big Model Era: Domain-Specific Multimodal Large\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal data, which can comprehensively perceive and recognize the\nphysical world, has become an essential path towards general artificial\nintelligence. However, multimodal large models trained on public datasets often\nunderperform in specific industrial domains. This paper proposes a multimodal\nfederated learning framework that enables multiple enterprises to utilize\nprivate domain data to collaboratively train large models for vertical domains,\nachieving intelligent services across scenarios. The authors discuss in-depth\nthe strategic transformation of federated learning in terms of intelligence\nfoundation and objectives in the era of big model, as well as the new\nchallenges faced in heterogeneous data, model aggregation, performance and cost\ntrade-off, data privacy, and incentive mechanism. The paper elaborates a case\nstudy of leading enterprises contributing multimodal data and expert knowledge\nto city safety operation management , including distributed deployment and\nefficient coordination of the federated learning platform, technical\ninnovations on data quality improvement based on large model capabilities and\nefficient joint fine-tuning approaches. Preliminary experiments show that\nenterprises can enhance and accumulate intelligent capabilities through\nmultimodal model federated learning, thereby jointly creating an smart city\nmodel that provides high-quality intelligent services covering energy\ninfrastructure safety, residential community security, and urban operation\nmanagement. The established federated learning cooperation ecosystem is\nexpected to further aggregate industry, academia, and research resources,\nrealize large models in multiple vertical domains, and promote the large-scale\nindustrial application of artificial intelligence and cutting-edge research on\nmultimodal federated learning.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:05:11 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 06:17:21 GMT"},{"version":"v3","created":"Thu, 24 Aug 2023 06:24:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Zengxiang",""],["Hou","Zhaoxiang",""],["Liu","Hui",""],["Wang","Ying",""],["Li","Tongzhi",""],["Xie","Longfei",""],["Shi","Chao",""],["Yang","Chengyi",""],["Zhang","Weishan",""],["Liu","Zelei",""],["Xu","Liang",""]]}
{"id":"2308.11218","submitter":"Daniel Kessler","authors":"Daniel Kessler and Elizaveta Levina","title":"Computational Inference for Directions in Canonical Correlation Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Canonical Correlation Analysis (CCA) is a method for analyzing pairs of\nrandom vectors; it learns a sequence of paired linear transformations such that\nthe resultant canonical variates are maximally correlated within pairs while\nuncorrelated across pairs. CCA outputs both canonical correlations as well as\nthe canonical directions which define the transformations. While inference for\ncanonical correlations is well developed, conducting inference for canonical\ndirections is more challenging and not well-studied, but is key to\ninterpretability. We propose a computational bootstrap method (combootcca) for\ninference on CCA directions. We conduct thorough simulation studies that range\nfrom simple and well-controlled to complex but realistic and validate the\nstatistical properties of combootcca while comparing it to several competitors.\nWe also apply the combootcca method to a brain imaging dataset and discover\nlinked patterns in brain connectivity and behavioral scores.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:09:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kessler","Daniel",""],["Levina","Elizaveta",""]]}
{"id":"2308.11219","submitter":"Yu Ye","authors":"Shiqi Yang, Xiaolong Xu, Bo Han, Pingfan Gu, Roger Guzman, Yiwen Song,\n  Zhongchong Lin, Peng Gao, Wu Zhou, Jinbo Yang, Zuxin Chen and Yu Ye","title":"Controlling the 2D magnetism of CrBr$_3$ by van der Waals stacking\n  engineering","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The manipulation of two-dimensional (2D) magnetic order is of significant\nimportance to facilitate future 2D magnets for low-power and high-speed\nspintronic devices. Van der Waals stacking engineering makes promises for\ncontrollable magnetism via interlayer magnetic coupling. However, directly\nexamining the stacking order changes accompanying magnetic order transitions at\nthe atomic scale and preparing device-ready 2D magnets with controllable\nmagnetic orders remain elusive. Here, we demonstrate effective control of\ninterlayer stacking in exfoliated CrBr$_3$ via thermally assisted strain\nengineering. The stable interlayer ferromagnetic (FM), antiferromagnetic (AFM),\nand FM-AFM coexistent ground states confirmed by the magnetic circular\ndichroism measurements are realized. Combined with the first-principles\ncalculations, the atomically-resolved imaging technique reveals the correlation\nbetween magnetic order and interlay stacking order in the CrBr$_3$ flakes\nunambiguously. A tunable exchange bias effect is obtained in the mixed phase of\nFM and AFM states. This work will introduce new magnetic properties by\ncontrolling the stacking order, and sequence of 2D magnets, providing ample\nopportunities for their application in spintronic devices.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:09:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yang","Shiqi",""],["Xu","Xiaolong",""],["Han","Bo",""],["Gu","Pingfan",""],["Guzman","Roger",""],["Song","Yiwen",""],["Lin","Zhongchong",""],["Gao","Peng",""],["Zhou","Wu",""],["Yang","Jinbo",""],["Chen","Zuxin",""],["Ye","Yu",""]]}
{"id":"2308.11220","submitter":"Lucia Morris","authors":"Lucia Morris, Tori Qiu, Nikhil Raghuraman","title":"Federated Learning on Patient Data for Privacy-Protecting Polycystic\n  Ovary Syndrome Treatment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The field of women's endocrinology has trailed behind data-driven medical\nsolutions, largely due to concerns over the privacy of patient data. Valuable\ndatapoints about hormone levels or menstrual cycling could expose patients who\nsuffer from comorbidities or terminate a pregnancy, violating their privacy. We\nexplore the application of Federated Learning (FL) to predict the optimal drug\nfor patients with polycystic ovary syndrome (PCOS). PCOS is a serious hormonal\ndisorder impacting millions of women worldwide, yet it's poorly understood and\nits research is stunted by a lack of patient data. We demonstrate that a\nvariety of FL approaches succeed on a synthetic PCOS patient dataset. Our\nproposed FL models are a tool to access massive quantities of diverse data and\nidentify the most effective treatment option while providing PCOS patients with\nprivacy guarantees.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:21:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Morris","Lucia",""],["Qiu","Tori",""],["Raghuraman","Nikhil",""]]}
{"id":"2308.11221","submitter":"Dongyu Bai","authors":"Dongyu Bai, Yihan Nie, Jing Shang, Minghao Liu, Yang Yang, Haifei\n  Zhan, Liangzhi Kou and Yuantong Gu","title":"Ferroelectric Domain and Switching Dynamics in Curved In2Se3: First\n  Principle and Deep Learning Molecular Dynamics Simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Complex strain status can exist in 2D materials during their synthesis\nprocess, resulting in significant impacts on the physical and chemical\nproperties. Despite their prevalence in experiments, their influence on the\nmaterial properties and the corresponding mechanism are often understudied due\nto the lack of effective simulation methods. In this work, we investigated the\neffects of bending, rippling, and bubbling on the ferroelectric domains in\nIn2Se3 monolayer by density functional theory (DFT) and deep learning molecular\ndynamics (DLMD) simulations. The analysis of the tube model shows that bending\ndeformation imparts asymmetry into the system, and the polarization direction\ntends to orient towards the tensile side, which has a lower energy state than\nthe opposite polarization direction. The energy barrier for polarization\nswitching can be reduced by compressive strain according DFT results. The\ndynamics of the polarization switching is investigated by the DLMD simulations.\nThe influence of curvature and temperature on the switching time follows the\nArrhenius-style function. For the complex strain status in the rippling and\nbubbling model, the lifetime of the local transient polarization is analyzed by\nthe autocorrelation function, and the size of the stable polarization domain is\nidentified. Local curvature and temperature can influence the local\npolarization dynamics following the proposed Arrhenius-style equation. Through\ncross-scale simulations, this study demonstrates the capability of\ndeep-learning potentials in simulating polarization for ferroelectric\nmaterials. It further reveals the potential to manipulate local polarization in\nferroelectric materials through strain engineering.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:27:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bai","Dongyu",""],["Nie","Yihan",""],["Shang","Jing",""],["Liu","Minghao",""],["Yang","Yang",""],["Zhan","Haifei",""],["Kou","Liangzhi",""],["Gu","Yuantong",""]]}
{"id":"2308.11222","submitter":"Lu Tianhang","authors":"Tianhang Lu and Han Xian and Qizhi Fang","title":"Approximate Core Allocations for Edge Cover Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the approximate core for edge cover games, which are cooperative\ngames stemming from edge cover problems. In these games, each player controls a\nvertex on a network $G = (V, E; w)$, and the cost of a coalition $S\\subseteq V$\nis equivalent to the minimum weight of edge covers in the subgraph induced by\n$S$. We prove that the 3/4-core of edge cover games is always non-empty and can\nbe computed in polynomial time by using linear program duality approach. This\nratio is the best possible, as it represents the integrality gap of the natural\nLP for edge cover problems. Moreover, our analysis reveals that the ratio of\napproximate core corresponds with the length of the shortest odd cycle of\nunderlying graphs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:27:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Tianhang",""],["Xian","Han",""],["Fang","Qizhi",""]]}
{"id":"2308.11223","submitter":"Francesco Pittaluga","authors":"Francesco Pittaluga and Bingbing Zhuang","title":"LDP-Feat: Image Features with Local Differential Privacy","comments":"11 pages, 4 figures, to be published in International Conference on\n  Computer Vision (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern computer vision services often require users to share raw feature\ndescriptors with an untrusted server. This presents an inherent privacy risk,\nas raw descriptors may be used to recover the source images from which they\nwere extracted. To address this issue, researchers recently proposed\nprivatizing image features by embedding them within an affine subspace\ncontaining the original feature as well as adversarial feature samples. In this\npaper, we propose two novel inversion attacks to show that it is possible to\n(approximately) recover the original image features from these embeddings,\nallowing us to recover privacy-critical image content. In light of such\nsuccesses and the lack of theoretical privacy guarantees afforded by existing\nvisual privacy methods, we further propose the first method to privatize image\nfeatures via local differential privacy, which, unlike prior approaches,\nprovides a guaranteed bound for privacy leakage regardless of the strength of\nthe attacks. In addition, our method yields strong performance in visual\nlocalization as a downstream task while enjoying the privacy guarantee.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:28:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pittaluga","Francesco",""],["Zhuang","Bingbing",""]]}
{"id":"2308.11224","submitter":"Chang Liu","authors":"Chang Liu, Bo Wu","title":"Evaluating Large Language Models on Graphs: Performance Insights and\n  Comparative Analysis","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have garnered considerable interest within both\nacademic and industrial. Yet, the application of LLMs to graph data remains\nunder-explored. In this study, we evaluate the capabilities of four LLMs in\naddressing several analytical problems with graph data. We employ four distinct\nevaluation metrics: Comprehension, Correctness, Fidelity, and Rectification.\nOur results show that: 1) LLMs effectively comprehend graph data in natural\nlanguage and reason with graph topology. 2) GPT models can generate logical and\ncoherent results, outperforming alternatives in correctness. 3) All examined\nLLMs face challenges in structural reasoning, with techniques like zero-shot\nchain-of-thought and few-shot prompting showing diminished efficacy. 4) GPT\nmodels often produce erroneous answers in multi-answer tasks, raising concerns\nin fidelity. 5) GPT models exhibit elevated confidence in their outputs,\npotentially hindering their rectification capacities. Notably, GPT-4 has\ndemonstrated the capacity to rectify responses from GPT-3.5-turbo and its own\nprevious iterations. The code is available at:\nhttps://github.com/Ayame1006/LLMtoGraph.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:32:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Chang",""],["Wu","Bo",""]]}
{"id":"2308.11225","submitter":"Anes Bendimerad","authors":"Anes Bendimerad, Youcef Remil, Romain Mathonat, Mehdi Kaytoue","title":"On-Premise AIOps Infrastructure for a Software Editor SME: An Experience\n  Report","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information Technology has become a critical component in various industries,\nleading to an increased focus on software maintenance and monitoring. With the\ncomplexities of modern software systems, traditional maintenance approaches\nhave become insufficient. The concept of AIOps has emerged to enhance\npredictive maintenance using Big Data and Machine Learning capabilities.\nHowever, exploiting AIOps requires addressing several challenges related to the\ncomplexity of data and incident management. Commercial solutions exist, but\nthey may not be suitable for certain companies due to high costs, data\ngovernance issues, and limitations in covering private software. This paper\ninvestigates the feasibility of implementing on-premise AIOps solutions by\nleveraging open-source tools. We introduce a comprehensive AIOps infrastructure\nthat we have successfully deployed in our company, and we provide the rationale\nbehind different choices that we made to build its various components.\nParticularly, we provide insights into our approach and criteria for selecting\na data management system and we explain its integration. Our experience can be\nbeneficial for companies seeking to internally manage their software\nmaintenance processes with a modern AIOps approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:47:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bendimerad","Anes",""],["Remil","Youcef",""],["Mathonat","Romain",""],["Kaytoue","Mehdi",""]]}
{"id":"2308.11226","submitter":"Eric Kulanthaivelu","authors":"Eric Kulanthaivelu (UR UFRDE, CEMOI)","title":"The growth effects of tropical cyclones in the U.S.: new evidence from\n  state to county level","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tropical cyclones have always been a concern for public authorities in the\nU.S., with a season lasting nearly half of the year. Using longitudinal data on\neconomic growth and exposure to tropical cyclones, we provide new comprehensive\nanalyses of these disasters' growth impact in U.S. states and counties. While\nwe find that results remain insignificant with country-wide samples, this study\nshows that the effects can be, instead, significant at regional level. In fact,\na specific analysis of Florida State stresses significant short-term negative\neffects, both at county and state levels. At this stage, this study calls for\nan in-depth investigation of the underlying mechanisms leading to such growth\ndepletion but already pins down the important heterogeneity in the effects of a\ncatastrophe on growth patterns within a country.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:52:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kulanthaivelu","Eric","","UR UFRDE, CEMOI"]]}
{"id":"2308.11227","submitter":"Luca Asselle","authors":"L. Asselle and M. Starostka","title":"A note on the Morse homology for a class of functionals in Banach spaces\n  involving the $p$-Laplacian","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we show how to construct Morse homology for an explicit class\nof functionals involving the $p$-Laplacian. The natural domain of definition of\nsuch functionals is the Banach space $W^{1,2p}_0(\\Omega)$, where $p>n/2$ and\n$\\Omega \\subset \\mathbb R^n$ is a bounded domain with sufficiently smooth\nboundary. As $W^{1,2p}_0(\\Omega)$ is not isomorphic to its dual space, critical\npoints of such functionals cannot be non-degenerate in the usual sense, and\nhence in the construction of Morse homology we only require that the second\ndifferential at each critical point be injective. Our result upgrades a result\nof Cingolani and Vannella, where critical groups for an analogous class of\nfunctionals are computed, and provides in this special case a positive answer\nto Smale's suggestion that injectivity of the second differential should be\nenough for Morse theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:52:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Asselle","L.",""],["Starostka","M.",""]]}
{"id":"2308.11228","submitter":"Dan Solodar","authors":"Dan Solodar and Itzik Klein","title":"VIO-DualProNet: Visual-Inertial Odometry with Learning Based Process\n  Noise Covariance","comments":"10 pages, 15 figures, bib file","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual-inertial odometry (VIO) is a vital technique used in robotics,\naugmented reality, and autonomous vehicles. It combines visual and inertial\nmeasurements to accurately estimate position and orientation. Existing VIO\nmethods assume a fixed noise covariance for the inertial uncertainty. However,\naccurately determining in real-time the noise variance of the inertial sensors\npresents a significant challenge as the uncertainty changes throughout the\noperation leading to suboptimal performance and reduced accuracy. To circumvent\nthis, we propose VIO-DualProNet, a novel approach that utilizes deep learning\nmethods to dynamically estimate the inertial noise uncertainty in real-time. By\ndesigning and training a deep neural network to predict inertial noise\nuncertainty using only inertial sensor measurements, and integrating it into\nthe VINS-Mono algorithm, we demonstrate a substantial improvement in accuracy\nand robustness, enhancing VIO performance and potentially benefiting other\nVIO-based systems for precise localization and mapping across diverse\nconditions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:54:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Solodar","Dan",""],["Klein","Itzik",""]]}
{"id":"2308.11229","submitter":"Claudio De Persis","authors":"C. De Persis, D. Gadginmath, F. Pasqualetti, P. Tesi","title":"Data-Driven Feedback Linearization with Complete Dictionaries","comments":"Submitted for peer review on 29 March 2023. To appear in the\n  Proceedings of the 62nd IEEE Conference on Decision and Control, 13-15\n  December 2023, Singapore","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the feedback linearization problem, and contribute with a new\nmethod that can learn the linearizing controller from a library (a dictionary)\nof candidate functions. When the dynamics of the system are known, the method\nboils down to solving a set of linear equations. Remarkably, the same idea\nextends to the case in which the dynamics of the system are unknown and a\nlinearizing controller must be found using experimental data. In particular, we\nderive a simple condition (checkable from data) to assess when the\nlinearization property holds over the entire state space of interest and not\njust on the dataset used to determine the solution. We also discuss important\nresearch directions on this topic.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 06:56:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["De Persis","C.",""],["Gadginmath","D.",""],["Pasqualetti","F.",""],["Tesi","P.",""]]}
{"id":"2308.11230","submitter":"Yasushi Kawase","authors":"Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto\n  Yokoo","title":"Towards Optimal Subsidy Bounds for Envy-freeable Allocations","comments":"14pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the fair division of indivisible items with subsidies among $n$\nagents, where the absolute marginal valuation of each item is at most one.\nUnder monotone valuations (where each item is a good), Brustle et al. (2020)\ndemonstrated that a maximum subsidy of $2(n-1)$ and a total subsidy of\n$2(n-1)^2$ are sufficient to guarantee the existence of an envy-freeable\nallocation. In this paper, we improve upon these bounds, even in a wider model.\nNamely, we show that, given an EF1 allocation, we can compute in polynomial\ntime an envy-free allocation with a subsidy of at most $n-1$ per agent and a\ntotal subsidy of at most $n(n-1)/2$. Moreover, we present further improved\nbounds for monotone valuations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:05:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kawase","Yasushi",""],["Makino","Kazuhisa",""],["Sumita","Hanna",""],["Tamura","Akihisa",""],["Yokoo","Makoto",""]]}
{"id":"2308.11231","submitter":"Tao Wang","authors":"Tao Wang, Bing-cheng He, Chun-xiao Zhou, Dong-kang Li and Lorenzo\n  Fortunato","title":"Emerging $\\gamma$-softness in $^{196}$Pt in the SU3-IBM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, it has been argued that a new $\\gamma$-soft rotational spectrum\nemerges in the interacting boson model with SU(3) higher-order interactions,\nopening up new approaches to understand the $\\gamma$-softness in realistic\nnuclei. In a previous paper, $\\gamma$-softness with degeneracy of the ground\nand quasi-$\\gamma$ bands is observed, which displays a O(5) partial dynamical\nsymmetry. In this paper, another special point connected with the middle\ndegenerate point is discussed, which is found to be related with the properties\nof $^{196}$Pt. This emergent $\\gamma$-softness has also been shown to be\nimportant for understanding the prolate-oblate asymmetric shape phase\ntransition. The low-lying spectra, $B(E2)$ values and quadrupole moments in\n$^{196}$Pt are discussed showing that the new model can account for several\nobserved features.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:09:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Tao",""],["He","Bing-cheng",""],["Zhou","Chun-xiao",""],["Li","Dong-kang",""],["Fortunato","Lorenzo",""]]}
{"id":"2308.11232","submitter":"Ragnar Fleischmann","authors":"King Hang Mok, Ragnar Fleischmann","title":"Branched flows in active random walks and the formation of ant trail\n  patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Branched flow governs the transition from ballistic to diffusive motion of\nwaves and conservative particle flows in spatially correlated random or complex\nenvironments. It occurs in many physical systems from micrometer to\ninterstellar scales. In living matter systems, however, this transport regime\nis usually suppressed by dissipation and noise. In this article we demonstrate\nthat, nonetheless, noisy active random walks, characterizing many living\nsystems like foraging animals, and chemotactic bacteria, can show a regime of\nbranched flow. To this aim we model the dynamics of trail forming ants and use\nit to derive a scaling theory of branched flows in active random walks in\nrandom bias fields in the presence of noise. We also show how trail patterns,\nformed by the interaction of ants by depositing pheromones along their\ntrajectories, can be understood as a consequence of branched flow.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:14:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mok","King Hang",""],["Fleischmann","Ragnar",""]]}
{"id":"2308.11233","submitter":"Tommaso Apicella","authors":"Tommaso Apicella, Alessio Xompero, Edoardo Ragusa, Riccardo Berta,\n  Andrea Cavallaro, Paolo Gastaldo","title":"Affordance segmentation of hand-occluded containers from exocentric\n  images","comments":"Paper accepted to Workshop on Assistive Computer Vision and Robotics\n  (ACVR) in International Conference on Computer Vision (ICCV) 2023; 10 pages,\n  4 figures, 2 tables. Data, code, and trained models are available at\n  https://apicis.github.io/projects/acanet.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual affordance segmentation identifies the surfaces of an object an agent\ncan interact with. Common challenges for the identification of affordances are\nthe variety of the geometry and physical properties of these surfaces as well\nas occlusions. In this paper, we focus on occlusions of an object that is\nhand-held by a person manipulating it. To address this challenge, we propose an\naffordance segmentation model that uses auxiliary branches to process the\nobject and hand regions separately. The proposed model learns affordance\nfeatures under hand-occlusion by weighting the feature map through hand and\nobject segmentation. To train the model, we annotated the visual affordances of\nan existing dataset with mixed-reality images of hand-held containers in\nthird-person (exocentric) images. Experiments on both real and mixed-reality\nimages show that our model achieves better affordance segmentation and\ngeneralisation than existing models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:14:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Apicella","Tommaso",""],["Xompero","Alessio",""],["Ragusa","Edoardo",""],["Berta","Riccardo",""],["Cavallaro","Andrea",""],["Gastaldo","Paolo",""]]}
{"id":"2308.11234","submitter":"Zhe Chen","authors":"Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey","title":"Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that\nasks us to compute collision-free paths for a team of agents, all moving across\na shared map. Although many works appear on this topic, all current algorithms\nstruggle as the number of agents grows. The principal reason is that existing\napproaches typically plan free-flow optimal paths, which creates congestion. To\ntackle this issue we propose a new approach for MAPF where agents are guided to\ntheir destination by following congestion-avoiding paths. We evaluate the idea\nin two large-scale settings: one-shot MAPF, where each agent has a single\ndestination, and lifelong MAPF, where agents are continuously assigned new\ntasks. For one-shot MAPF we show that our approach substantially improves\nsolution quality. For Lifelong MAPF we report large improvements in overall\nthroughput.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:17:39 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 03:13:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Zhe",""],["Harabor","Daniel",""],["Li","Jiaoyang",""],["Stuckey","Peter J.",""]]}
{"id":"2308.11235","submitter":"Zhenzhe Gao","authors":"Zhenzhe Gao, Zhaoxia Yin, Hongjian Zhan, Heng Yin, Yue Lu","title":"Adaptive White-Box Watermarking with Self-Mutual Check Parameters in\n  Deep Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Artificial Intelligence (AI) has found wide application, but also poses risks\ndue to unintentional or malicious tampering during deployment. Regular checks\nare therefore necessary to detect and prevent such risks. Fragile watermarking\nis a technique used to identify tampering in AI models. However, previous\nmethods have faced challenges including risks of omission, additional\ninformation transmission, and inability to locate tampering precisely. In this\npaper, we propose a method for detecting tampered parameters and bits, which\ncan be used to detect, locate, and restore parameters that have been tampered\nwith. We also propose an adaptive embedding method that maximizes information\ncapacity while maintaining model accuracy. Our approach was tested on multiple\nneural networks subjected to attacks that modified weight parameters, and our\nresults demonstrate that our method achieved great recovery performance when\nthe modification rate was below 20%. Furthermore, for models where watermarking\nsignificantly affected accuracy, we utilized an adaptive bit technique to\nrecover more than 15% of the accuracy loss of the model.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:21:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Zhenzhe",""],["Yin","Zhaoxia",""],["Zhan","Hongjian",""],["Yin","Heng",""],["Lu","Yue",""]]}
{"id":"2308.11236","submitter":"Bilel Benjdira Dr.","authors":"Bilel Benjdira, Anis Koubaa, Anas M. Ali","title":"ROSGPT_Vision: Commanding Robots Using Only Language Models' Prompts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we argue that the next generation of robots can be commanded\nusing only Language Models' prompts. Every prompt interrogates separately a\nspecific Robotic Modality via its Modality Language Model (MLM). A central Task\nModality mediates the whole communication to execute the robotic mission via a\nLarge Language Model (LLM). This paper gives this new robotic design pattern\nthe name of: Prompting Robotic Modalities (PRM). Moreover, this paper applies\nthis PRM design pattern in building a new robotic framework named\nROSGPT_Vision. ROSGPT_Vision allows the execution of a robotic task using only\ntwo prompts: a Visual and an LLM prompt. The Visual Prompt extracts, in natural\nlanguage, the visual semantic features related to the task under consideration\n(Visual Robotic Modality). Meanwhile, the LLM Prompt regulates the robotic\nreaction to the visual description (Task Modality). The framework automates all\nthe mechanisms behind these two prompts. The framework enables the robot to\naddress complex real-world scenarios by processing visual data, making informed\ndecisions, and carrying out actions automatically. The framework comprises one\ngeneric vision module and two independent ROS nodes. As a test application, we\nused ROSGPT_Vision to develop CarMate, which monitors the driver's distraction\non the roads and makes real-time vocal notifications to the driver. We showed\nhow ROSGPT_Vision significantly reduced the development cost compared to\ntraditional methods. We demonstrated how to improve the quality of the\napplication by optimizing the prompting strategies, without delving into\ntechnical details. ROSGPT_Vision is shared with the community (link:\nhttps://github.com/bilel-bj/ROSGPT_Vision) to advance robotic research in this\ndirection and to build more robotic frameworks that implement the PRM design\npattern and enables controlling robots using only prompts.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:21:24 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:31:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Benjdira","Bilel",""],["Koubaa","Anis",""],["Ali","Anas M.",""]]}
{"id":"2308.11237","submitter":"Chao Ni","authors":"Chao Ni, Xin Yin, Kaiwen Yang, Dehai Zhao, Zhenchang Xing and Xin Xia","title":"Distinguishing Look-Alike Innocent and Vulnerable Code by Subtle\n  Semantic Representation Learning and Explanation","comments":"Accepted By FSE'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Though many deep learning (DL)-based vulnerability detection approaches have\nbeen proposed and indeed achieved remarkable performance, they still have\nlimitations in the generalization as well as the practical usage. More\nprecisely, existing DL-based approaches (1) perform negatively on prediction\ntasks among functions that are lexically similar but have contrary semantics;\n(2) provide no intuitive developer-oriented explanations to the detected\nresults. In this paper, we propose a novel approach named SVulD, a\nfunction-level Subtle semantic embedding for Vulnerability Detection along with\nintuitive explanations, to alleviate the above limitations. Specifically, SVulD\nfirstly trains a model to learn distinguishing semantic representations of\nfunctions regardless of their lexical similarity. Then, for the detected\nvulnerable functions, SVulD provides natural language explanations (e.g., root\ncause) of results to help developers intuitively understand the\nvulnerabilities. To evaluate the effectiveness of SVulD, we conduct large-scale\nexperiments on a widely used practical vulnerability dataset and compare it\nwith four state-of-the-art (SOTA) approaches by considering five performance\nmeasures. The experimental results indicate that SVulD outperforms all SOTAs\nwith a substantial improvement (i.e., 23.5%-68.0% in terms of F1-score,\n15.9%-134.8% in terms of PR-AUC and 7.4%-64.4% in terms of Accuracy). Besides,\nwe conduct a user-case study to evaluate the usefulness of SVulD for developers\non understanding the vulnerable code and the participants' feedback\ndemonstrates that SVulD is helpful for development practice.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:23:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ni","Chao",""],["Yin","Xin",""],["Yang","Kaiwen",""],["Zhao","Dehai",""],["Xing","Zhenchang",""],["Xia","Xin",""]]}
{"id":"2308.11238","submitter":"Ruodu Wang","authors":"Haiyan Liu, Bin Wang, Ruodu Wang, Sheng Chao Zhuang","title":"Distorted optimal transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC econ.TH math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classic optimal transport theory is built on minimizing the expected cost\nbetween two given distributions. We propose the framework of distorted optimal\ntransport by minimizing a distorted expected cost. This new formulation is\nmotivated by concrete problems in decision theory, robust optimization, and\nrisk management, and it has many distinct features compared to the classic\ntheory. We choose simple cost functions and study different distortion\nfunctions and their implications on the optimal transport plan. We show that on\nthe real line, the comonotonic coupling is optimal for the distorted optimal\ntransport problem when the distortion function is convex and the cost function\nis submodular and monotone. Some forms of duality and uniqueness results are\nprovided. For inverse-S-shaped distortion functions and linear cost, we obtain\nthe unique form of optimal coupling for all marginal distributions, which turns\nout to have an interesting ``first comonotonic, then counter-monotonic\"\ndependence structure; for S-shaped distortion functions a similar structure is\nobtained. Our results highlight several challenges and features in distorted\noptimal transport, offering a new mathematical bridge between the fields of\nprobability, decision theory, and risk management.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:25:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Haiyan",""],["Wang","Bin",""],["Wang","Ruodu",""],["Zhuang","Sheng Chao",""]]}
{"id":"2308.11239","submitter":"Silky Singh","authors":"Silky Singh and Shripad Deshmukh and Mausoom Sarkar and Balaji\n  Krishnamurthy","title":"LOCATE: Self-supervised Object Discovery via Flow-guided Graph-cut and\n  Bootstrapped Self-training","comments":"Accepted to the British Machine Vision Conference (BMVC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Learning object segmentation in image and video datasets without human\nsupervision is a challenging problem. Humans easily identify moving salient\nobjects in videos using the gestalt principle of common fate, which suggests\nthat what moves together belongs together. Building upon this idea, we propose\na self-supervised object discovery approach that leverages motion and\nappearance information to produce high-quality object segmentation masks.\nSpecifically, we redesign the traditional graph cut on images to include motion\ninformation in a linear combination with appearance information to produce edge\nweights. Remarkably, this step produces object segmentation masks comparable to\nthe current state-of-the-art on multiple benchmarks. To further improve\nperformance, we bootstrap a segmentation network trained on these preliminary\nmasks as pseudo-ground truths to learn from its own outputs via self-training.\nWe demonstrate the effectiveness of our approach, named LOCATE, on multiple\nstandard video object segmentation, image saliency detection, and object\nsegmentation benchmarks, achieving results on par with and, in many cases\nsurpassing state-of-the-art methods. We also demonstrate the transferability of\nour approach to novel domains through a qualitative study on in-the-wild\nimages. Additionally, we present extensive ablation analysis to support our\ndesign choices and highlight the contribution of each component of our proposed\nmethod.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:27:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Singh","Silky",""],["Deshmukh","Shripad",""],["Sarkar","Mausoom",""],["Krishnamurthy","Balaji",""]]}
{"id":"2308.11240","submitter":"Rameshwar Pratap","authors":"Rameshwar Pratap and Raghav Kulkarni","title":"Minwise-Independent Permutations with Insertion and Deletion of Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In their seminal work, Broder \\textit{et. al.}~\\citep{BroderCFM98} introduces\nthe $\\mathrm{minHash}$ algorithm that computes a low-dimensional sketch of\nhigh-dimensional binary data that closely approximates pairwise Jaccard\nsimilarity. Since its invention, $\\mathrm{minHash}$ has been commonly used by\npractitioners in various big data applications. Further, the data is dynamic in\nmany real-life scenarios, and their feature sets evolve over time. We consider\nthe case when features are dynamically inserted and deleted in the dataset. We\nnote that a naive solution to this problem is to repeatedly recompute\n$\\mathrm{minHash}$ with respect to the updated dimension. However, this is an\nexpensive task as it requires generating fresh random permutations. To the best\nof our knowledge, no systematic study of $\\mathrm{minHash}$ is recorded in the\ncontext of dynamic insertion and deletion of features. In this work, we\ninitiate this study and suggest algorithms that make the $\\mathrm{minHash}$\nsketches adaptable to the dynamic insertion and deletion of features. We show a\nrigorous theoretical analysis of our algorithms and complement it with\nextensive experiments on several real-world datasets. Empirically we observe a\nsignificant speed-up in the running time while simultaneously offering\ncomparable performance with respect to running $\\mathrm{minHash}$ from scratch.\nOur proposal is efficient, accurate, and easy to implement in practice.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:27:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pratap","Rameshwar",""],["Kulkarni","Raghav",""]]}
{"id":"2308.11241","submitter":"Harunori Kawano","authors":"Harunori Kawano and Sota Shimizu","title":"An Effective Transformer-based Contextual Model and Temporal Gate\n  Pooling for Speaker Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wav2vec2 has achieved success in applying Transformer architecture and\nself-supervised learning to speech recognition. Recently, these have come to be\nused not only for speech recognition but also for the entire speech processing.\nThis paper introduces an effective end-to-end speaker identification model\napplied Transformer-based contextual model. We explored the relationship\nbetween the parameters and the performance in order to discern the structure of\nan effective model. Furthermore, we propose a pooling method, Temporal Gate\nPooling, with powerful learning ability for speaker identification. We applied\nConformer as encoder and BEST-RQ for pre-training and conducted an evaluation\nutilizing the speaker identification of VoxCeleb1. The proposed method has\nachieved an accuracy of 85.9% with 28.5M parameters, demonstrating comparable\nprecision to wav2vec2 with 317.7M parameters. Code is available at\nhttps://github.com/HarunoriKawano/speaker-identification-with-tgp.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:34:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kawano","Harunori",""],["Shimizu","Sota",""]]}
{"id":"2308.11242","submitter":"Hriday Bavle Dr","authors":"Hriday Bavle, Jose Luis Sanchez-Lopez, Javier Civera, Holger Voos","title":"Faster Optimization in S-Graphs Exploiting Hierarchy","comments":"4 pages, 3 figures, IROS 2023 Workshop Paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  3D scene graphs hierarchically represent the environment appropriately\norganizing different environmental entities in various layers. Our previous\nwork on situational graphs extends the concept of 3D scene graph to SLAM by\ntightly coupling the robot poses with the scene graph entities, achieving\nstate-of-the-art results. Though, one of the limitations of S-Graphs is\nscalability in really large environments due to the increased graph size over\ntime, increasing the computational complexity.\n  To overcome this limitation in this work we present an initial research of an\nimproved version of S-Graphs exploiting the hierarchy to reduce the graph size\nby marginalizing redundant robot poses and their connections to the\nobservations of the same structural entities. Firstly, we propose the\ngeneration and optimization of room-local graphs encompassing all graph\nentities within a room-like structure. These room-local graphs are used to\ncompress the S-Graphs marginalizing the redundant robot keyframes within the\ngiven room. We then perform windowed local optimization of the compressed graph\nat regular time-distance intervals. A global optimization of the compressed\ngraph is performed every time a loop closure is detected. We show similar\naccuracy compared to the baseline while showing a 39.81% reduction in the\ncomputation time with respect to the baseline.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:35:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bavle","Hriday",""],["Sanchez-Lopez","Jose Luis",""],["Civera","Javier",""],["Voos","Holger",""]]}
{"id":"2308.11243","submitter":"Oskar Pro\\'sniak","authors":"Wojciech De Roeck, Fran\\c{c}ois Huveneers, Oskar A. Pro\\'sniak","title":"Long persistence of localization in a disordered anharmonic chain beyond\n  the atomic limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish rigorous bounds on dissipative transport in the disordered\nKlein-Gordon chain with quartic on-site potential, governed by a parameter\n$\\lambda$. At $\\lambda = 0$, the chain is harmonic and transport is fully\nsuppressed by Anderson localization. For the anharmonic system at $\\lambda >\n0$, our results show that dissipative effects set in on time scales that grow\nfaster than any polynomial in $1/\\lambda$, as $\\lambda\\to 0$. From a technical\nperspective, the main novelty of our work is that we do not restrict ourselves\nto the atomic limit, i.e. we develop perturbation theory around the harmonic\nsystem with a fixed hopping strength between near oscillators. This allows us\nto compare our mathematical results with previous numerical work and contribute\nto the resolution of an ongoing debate in the physics community, as we explain\nin a companion paper arXiv:2308.10572.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:35:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["De Roeck","Wojciech",""],["Huveneers","Fran\u00e7ois",""],["Pro\u015bniak","Oskar A.",""]]}
{"id":"2308.11244","submitter":"Ombretta Strafforello","authors":"Ombretta Strafforello, Klamer Schutte, Jan van Gemert","title":"Are current long-term video understanding datasets long-term?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many real-world applications, from sport analysis to surveillance, benefit\nfrom automatic long-term action recognition. In the current deep learning\nparadigm for automatic action recognition, it is imperative that models are\ntrained and tested on datasets and tasks that evaluate if such models actually\nlearn and reason over long-term information. In this work, we propose a method\nto evaluate how suitable a video dataset is to evaluate models for long-term\naction recognition. To this end, we define a long-term action as excluding all\nthe videos that can be correctly recognized using solely short-term\ninformation. We test this definition on existing long-term classification tasks\non three popular real-world datasets, namely Breakfast, CrossTask and LVU, to\ndetermine if these datasets are truly evaluating long-term recognition. Our\nstudy reveals that these datasets can be effectively solved using shortcuts\nbased on short-term information. Following this finding, we encourage long-term\naction recognition researchers to make use of datasets that need long-term\ninformation to be solved.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:39:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Strafforello","Ombretta",""],["Schutte","Klamer",""],["van Gemert","Jan",""]]}
{"id":"2308.11245","submitter":"Philippe Grandcl\\'ement","authors":"Philippe Grandcl\\'ement","title":"Fully consistent rotating black holes in the cubic Galileon theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Configurations of rotating black holes in the cubic Galileon theory are\ncomputed by means of spectral methods. The equations are written in the 3+1\nformalism and the coordinates are based on the maximal slicing condition and\nthe spatial harmonic gauge. The black holes are described as apparent horizons\nin equilibrium. It enables the first fully consistent computation of rotating\nblack holes in this theory. Several quantities are extracted from the\nsolutions. In particular, the vanishing of the mass is confirmed. A link is\nmade between that and the fact that the solutions do not obey the zeroth-law of\nblack hole thermodynamics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:41:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Grandcl\u00e9ment","Philippe",""]]}
{"id":"2308.11246","submitter":"Adam Bednorz","authors":"Tomasz Bia{\\l}ecki, Tomasz Rybotycki, Josep Batle, Adam Bednorz","title":"Quantum dimension witness with a single repeated operation","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a simple null test of a dimension of a quantum system, using a\nsingle repeated operation in the method of delays, assuming that each instance\nis identical and independent. The test is well-suited to current feasible\nquantum technologies, with programmed gates. We also analyze weaker versions of\nthe test, assuming unitary or almost unitary operations and derive expressions\nfor the statistical error.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:42:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bia\u0142ecki","Tomasz",""],["Rybotycki","Tomasz",""],["Batle","Josep",""],["Bednorz","Adam",""]]}
{"id":"2308.11247","submitter":"Eduardo Fernandes Montesuma","authors":"Eduardo Fernandes Montesuma, Michela Mulas, Fred Ngol\\`e Mboula,\n  Francesco Corona, Antoine Souloumiac","title":"Multi-Source Domain Adaptation for Cross-Domain Fault Diagnosis of\n  Chemical Processes","comments":"18 pages,15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fault diagnosis is an essential component in process supervision. Indeed, it\ndetermines which kind of fault has occurred, given that it has been previously\ndetected, allowing for appropriate intervention. Automatic fault diagnosis\nsystems use machine learning for predicting the fault type from sensor\nreadings. Nonetheless, these models are sensible to changes in the data\ndistributions, which may be caused by changes in the monitored process, such as\nchanges in the mode of operation. This scenario is known as Cross-Domain Fault\nDiagnosis (CDFD). We provide an extensive comparison of single and multi-source\nunsupervised domain adaptation (SSDA and MSDA respectively) algorithms for\nCDFD. We study these methods in the context of the Tennessee-Eastmann Process,\na widely used benchmark in the chemical industry. We show that using multiple\ndomains during training has a positive effect, even when no adaptation is\nemployed. As such, the MSDA baseline improves over the SSDA baseline\nclassification accuracy by 23% on average. In addition, under the\nmultiple-sources scenario, we improve classification accuracy of the no\nadaptation setting by 8.4% on average.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:43:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Montesuma","Eduardo Fernandes",""],["Mulas","Michela",""],["Mboula","Fred Ngol\u00e8",""],["Corona","Francesco",""],["Souloumiac","Antoine",""]]}
{"id":"2308.11248","submitter":"Hidetoshi Taya","authors":"Hidetoshi Taya, Charlie Ironside","title":"Kramers-Kr\\\"onig approach to the electric permittivity of the vacuum in\n  a strong constant electric field","comments":"25 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"hep-ph hep-th physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the electric permittivity of the QED vacuum in the presence of a\nstrong constant electric field, motivated by the analogy between the\ndynamically-assisted Schwinger effect in strong-field QED and the Franz-Keldysh\neffect in semiconductor physics. We develop a linear-response theory based on\nthe non-equilibrium in-in formalism and the Furry-picture perturbation theory,\nwith which and also utilizing the Kramers-Kr\\\"onig relation, we calculate the\nelectric permittivity without assuming weak fields and low-frequency probes. We\ndiscover that the electric permittivity exhibits characteristic oscillating\ndependence on the probe frequency, which directly reflects the change of the\nQED-vacuum structure by the strong field. We also establish a quantitative\ncorrespondence between the electric permittivity and the number of\nelectron-positron pairs produced by the dynamically-assisted Schwinger effect.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:44:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Taya","Hidetoshi",""],["Ironside","Charlie",""]]}
{"id":"2308.11249","submitter":"Ombretta Strafforello","authors":"Ombretta Strafforello, Xin Liu, Klamer Schutte, Jan van Gemert","title":"Video BagNet: short temporal receptive fields increase robustness in\n  long-term action recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previous work on long-term video action recognition relies on deep\n3D-convolutional models that have a large temporal receptive field (RF). We\nargue that these models are not always the best choice for temporal modeling in\nvideos. A large temporal receptive field allows the model to encode the exact\nsub-action order of a video, which causes a performance decrease when testing\nvideos have a different sub-action order. In this work, we investigate whether\nwe can improve the model robustness to the sub-action order by shrinking the\ntemporal receptive field of action recognition models. For this, we design\nVideo BagNet, a variant of the 3D ResNet-50 model with the temporal receptive\nfield size limited to 1, 9, 17 or 33 frames. We analyze Video BagNet on\nsynthetic and real-world video datasets and experimentally compare models with\nvarying temporal receptive fields. We find that short receptive fields are\nrobust to sub-action order changes, while larger temporal receptive fields are\nsensitive to the sub-action order.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:44:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Strafforello","Ombretta",""],["Liu","Xin",""],["Schutte","Klamer",""],["van Gemert","Jan",""]]}
{"id":"2308.11250","submitter":"Dong Sung Yoon","authors":"Ho Yun Jung, Ja Kyung Koo, Dong Hwa Shin and Dong Sung Yoon","title":"Class fields arising from the form class groups of order O and level N","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $K$ be an imaginary quadratic field and $\\mathcal{O}$ be an order in $K$.\nWe construct class fields associated with form class groups which are\nisomorphic to certain $\\mathcal{O}$-ideal class groups in terms of the theory\nof canonical models due to Shimura. By utilizing these form class groups, we\nfirst derive a congruence relation on special values of a modular function of\nhigher level as an analogue of Kronecker's congruence relation. Furthermore, as\nan application of such class fields, for a positive integer $n$ we examine\nprimes of the form $x^2+ny^2$ with some additional conditions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:47:59 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 05:15:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jung","Ho Yun",""],["Koo","Ja Kyung",""],["Shin","Dong Hwa",""],["Yoon","Dong Sung",""]]}
{"id":"2308.11251","submitter":"Kai-Bao Chen","authors":"K.B. Chen, J.P. Ma, X.B. Tong","title":"Twist-3 Contributions in Semi-Inclusive DIS in the Target Fragmentation\n  Region","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the complete results up to twist-3 for hadron production in the\ntarget fragmentation region of semi-inclusive deep inelastic scattering with a\npolarized lepton beam and polarized nucleon target. The non-perturbative\neffects are factorized into fracture functions. The calculation up to twist-3\nis non-trivial since one has to keep gauge invariance. By applying collinear\nexpansion, we show that the hadronic tensor can be expressed by gauge-invariant\nfracture functions. We also present the results for the structure functions and\nazimuthal asymmetries.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:48:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","K. B.",""],["Ma","J. P.",""],["Tong","X. B.",""]]}
{"id":"2308.11252","submitter":"Ivan Duchemin","authors":"David Amblard, Xavier Blase, Ivan Duchemin","title":"Many-body $GW$ calculations with very large scale polarizable\n  environments made affordable: a fully ab initio QM/QM approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a many-body $GW$ formalism for quantum subsystems embedded in\ndiscrete polarizable environments containing up to several hundred thousand\natoms described at a fully ab initio random phase approximation level. Our\napproach is based on a fragment approximation in the construction of the\nGreen's function and independent-electron susceptibilities. Further, the\nenvironing fragments susceptibility matrices are reduced to a minimal but\naccurate representation preserving low order polarizability tensors through a\nconstrained minimization scheme. This approach dramatically reduces the cost\nassociated with inverting the Dyson equation for the screened Coulomb potential\n$W$, while preserving the description of short to long-range screening effects.\nThe efficiency and accuracy of the present scheme is exemplified in the\nparadigmatic cases of fullerene bulk, surface, subsurface, and slabs with\nvarying number of layers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:48:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Amblard","David",""],["Blase","Xavier",""],["Duchemin","Ivan",""]]}
{"id":"2308.11253","submitter":"Mario Santilli","authors":"Mario Santilli","title":"Finite total curvature and soap bubbles with almost constant\n  higher-order mean curvature","comments":"23 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given $ n \\geq 2 $ and $ k \\in \\{2, \\ldots , n\\} $, we study the asymptotic\nbehaviour of sequences of bounded $C^2$-domains of finite total curvature in $\n\\mathbb{R}^{n+1} $ converging in volume and perimeter, and with the $ k $-th\nmean curvature functions converging in $ L^1 $ to a constant. Under natural\nmean convexity hypothesis, and assuming an $ L^\\infty $-control on the mean\ncurvature outside a set of vanishing area, we prove that finite unions of\nmutually tangent balls are the only possible limits. This is the first result\nwhere such a uniqueness is proved without assuming uniform bounds on the\nexterior or interior touching balls.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:52:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Santilli","Mario",""]]}
{"id":"2308.11254","submitter":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a","authors":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a, Micha{\\l} Grochowski","title":"A survey on bias in machine learning research","comments":"Submitted to journal. arXiv admin note: substantial text overlap with\n  arXiv:2308.09464","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current research on bias in machine learning often focuses on fairness, while\noverlooking the roots or causes of bias. However, bias was originally defined\nas a \"systematic error,\" often caused by humans at different stages of the\nresearch process. This article aims to bridge the gap between past literature\non bias in research by providing taxonomy for potential sources of bias and\nerrors in data and models. The paper focus on bias in machine learning\npipelines. Survey analyses over forty potential sources of bias in the machine\nlearning (ML) pipeline, providing clear examples for each. By understanding the\nsources and consequences of bias in machine learning, better methods can be\ndeveloped for its detecting and mitigating, leading to fairer, more\ntransparent, and more accurate ML models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:56:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Miko\u0142ajczyk-Bare\u0142a","Agnieszka",""],["Grochowski","Micha\u0142",""]]}
{"id":"2308.11255","submitter":"elise grosjean","authors":"Elise Grosjean, Bernd Simeon, Christina Surulescu","title":"A mathematical model for meniscus cartilage regeneration","comments":"GAMM2023, May 2023, Dresden (GERMANY), Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA q-bio.TO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a continuous model for meniscus cartilage regeneration triggered\nby two populations of cells migrating and (de)differentiating within an\nartificial scaffold with a known structure. The described biological processes\nare influenced by a fluid flow and therewith induced deformations of the\nscaffold. Numerical simulations are done for the corresponding dynamics within\na bioreactor which was designed for performing the biological experiments.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:58:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Grosjean","Elise",""],["Simeon","Bernd",""],["Surulescu","Christina",""]]}
{"id":"2308.11256","submitter":"Linjian Meng","authors":"Linjian Meng, Zhenxing Ge, Wenbin Li, Bo An, Yang Gao","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  No-regret algorithms are popular for learning Nash equilibrium (NE) in\ntwo-player zero-sum normal-form games (NFGs) and extensive-form games (EFGs).\nMany recent works consider the last-iterate convergence no-regret algorithms.\nAmong them, the two most famous algorithms are Optimistic Gradient Descent\nAscent (OGDA) and Optimistic Multiplicative Weight Update (OMWU). However, OGDA\nhas high per-iteration complexity. OMWU exhibits a lower per-iteration\ncomplexity but poorer empirical performance, and its convergence holds only\nwhen NE is unique. Recent works propose a Reward Transformation (RT) framework\nfor MWU, which removes the uniqueness condition and achieves competitive\nperformance with OMWU. Unfortunately, RT-based algorithms perform worse than\nOGDA under the same number of iterations, and their convergence guarantee is\nbased on the continuous-time feedback assumption, which does not hold in most\nscenarios. To address these issues, we provide a closer analysis of the RT\nframework, which holds for both continuous and discrete-time feedback. We\ndemonstrate that the essence of the RT framework is to transform the problem of\nlearning NE in the original game into a series of strongly convex-concave\noptimization problems (SCCPs). We show that the bottleneck of RT-based\nalgorithms is the speed of solving SCCPs. To improve the their empirical\nperformance, we design a novel transformation method to enable the SCCPs can be\nsolved by Regret Matching+ (RM+), a no-regret algorithm with better empirical\nperformance, resulting in Reward Transformation RM+ (RTRM+). RTRM+ enjoys\nlast-iterate convergence under the discrete-time feedback setting. Using the\ncounterfactual regret decomposition framework, we propose Reward Transformation\nCFR+ (RTCFR+) to extend RTRM+ to EFGs. Experimental results show that our\nalgorithms significantly outperform existing last-iterate convergence\nalgorithms and RM+ (CFR+).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:59:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Meng","Linjian",""],["Ge","Zhenxing",""],["Li","Wenbin",""],["An","Bo",""],["Gao","Yang",""]]}
{"id":"2308.11257","submitter":"Yingyao Wang","authors":"Yingyao Wang, Yongwei Zhou, Chaoqun Duan, Junwei Bao, Tiejun Zhao","title":"HopPG: Self-Iterative Program Generation for Multi-Hop Question\n  Answering over Heterogeneous Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The semantic parsing-based method is an important research branch for\nknowledge-based question answering. It usually generates executable programs\nlean upon the question and then conduct them to reason answers over a knowledge\nbase. Benefit from this inherent mechanism, it has advantages in the\nperformance and the interpretability. However,traditional semantic parsing\nmethods usually generate a complete program before executing it, which\nstruggles with multi-hop question answering over heterogeneous knowledge.\nFirstly,a complete multi-hop program relies on multiple heterogeneous\nsupporting facts, and it is difficult for models to receive these facts\nsimultaneously. Secondly,these methods ignore the interaction information\nbetween the previous-hop execution result and the current-hop program\ngeneration. To alleviate these challenges, we propose a self-iterative\nframework for multi-hop program generation (HopPG) over heterogeneous\nknowledge, which leverages the previous-hop execution results to retrieve\nsupporting facts and generate subsequent programs iteratively. We evaluate our\nmodel on MMQA-T^2. The experimental results show that HopPG outperforms\nexisting semantic-parsing-based baselines, especially on the multi-hop\nquestions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:00:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Yingyao",""],["Zhou","Yongwei",""],["Duan","Chaoqun",""],["Bao","Junwei",""],["Zhao","Tiejun",""]]}
{"id":"2308.11258","submitter":"Stefano Zacchiroli","authors":"Jes\\'us M. Gonz\\'alez-Barahona (URJC), Sergio Montes-Leon (URJC),\n  Gregorio Robles (URJC), Stefano Zacchiroli (IP Paris, LTCI)","title":"The Software Heritage License Dataset (2022 Edition)","comments":null,"journal-ref":"Empirical Software Engineering, In press","doi":"10.1007/s10664-023-10377-w","report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context: When software is released publicly, it is common to include with it\neither the full text of the license or licenses under which it is published, or\na detailed reference to them. Therefore public licenses, including FOSS (free,\nopen source software) licenses, are usually publicly available in source code\nrepositories.Objective: To compile a dataset containing as many documents as\npossible that contain the text of software licenses, or references to the\nlicense terms. Once compiled, characterize the dataset so that it can be used\nfor further research, or practical purposes related to license analysis.Method:\nRetrieve from Software Heritage-the largest publicly available archive of FOSS\nsource code-all versions of all files whose names are commonly used to convey\nlicensing terms. All retrieved documents will be characterized in various ways,\nusing automated and manual analyses.Results: The dataset consists of 6.9\nmillion unique license files. Additional metadata about shipped license files\nis also provided, making the dataset ready to use in various contexts,\nincluding: file length measures, MIME type, SPDX license (detected using\nScanCode), and oldest appearance. The results of a manual analysis of 8102\ndocuments is also included, providing a ground truth for further analysis. The\ndataset is released as open data as an archive file containing all deduplicated\nlicense files, plus several portable CSV files with metadata, referencing files\nvia cryptographic checksums.Conclusions: Thanks to the extensive coverage of\nSoftware Heritage, the dataset presented in this paper covers a very large\nfraction of all software licenses for public code. We have assembled a large\nbody of software licenses, characterized it quantitatively and qualitatively,\nand validated that it is mostly composed of licensing information and includes\nalmost all known license texts. The dataset can be used to conduct empirical\nstudies on open source licensing, training of automated license classifiers,\nnatural language processing (NLP) analyses of legal texts, as well as\nhistorical and phylogenetic studies on FOSS licensing. It can also be used in\npractice to improve tools detecting licenses in source code.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:01:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gonz\u00e1lez-Barahona","Jes\u00fas M.","","URJC"],["Montes-Leon","Sergio","","URJC"],["Robles","Gregorio","","URJC"],["Zacchiroli","Stefano","","IP Paris, LTCI"]]}
{"id":"2308.11259","submitter":"Olivier Couronne","authors":"Olivier Couronn\\'e (MODAL'X)","title":"An update on lower bounds for the critical values of oriented\n  percolation models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain new lower bounds on the critical points for various models of\noriented percolation. The method is to provide a stochastic domination of the\npercolation processes by multitype Galton-Watson trees. This can be apply to\nthe classical bond and site oriented percolation on Z^2 , but also on other\nlattices such as inhomogeneous ones, and on dimension three.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:02:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Couronn\u00e9","Olivier","","MODAL'X"]]}
{"id":"2308.11260","submitter":"Arantxa Urdangarin Iztueta","authors":"A. Urdangarin, T. Goicoa, T. Kneib, M.D. Ugarte","title":"A one-step spatial+ approach to mitigate spatial confounding in\n  multivariate spatial areal models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ecological spatial areal models encounter the well-known and challenging\nproblem of spatial confounding. This issue makes it arduous to distinguish\nbetween the impacts of observed covariates and spatial random effects. Despite\nprevious research and various proposed methods to tackle this problem, finding\na definitive solution remains elusive. In this paper, we propose a one-step\nversion of the spatial+ approach that involves dividing the covariate into two\ncomponents. One component captures large-scale spatial dependence, while the\nother accounts for short-scale dependence. This approach eliminates the need to\nseparately fit spatial models for the covariates. We apply this method to\nanalyze two forms of crimes against women, namely rapes and dowry deaths, in\nUttar Pradesh, India, exploring their relationship with socio-demographic\ncovariates. To evaluate the performance of the new approach, we conduct\nextensive simulation studies under different spatial confounding scenarios. The\nresults demonstrate that the proposed method provides reliable estimates of\nfixed effects and posterior correlations between different responses.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:03:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Urdangarin","A.",""],["Goicoa","T.",""],["Kneib","T.",""],["Ugarte","M. D.",""]]}
{"id":"2308.11261","submitter":"Sadegh Aliakbarian","authors":"Sadegh Aliakbarian, Fatemeh Saleh, David Collier, Pashmina Cameron,\n  Darren Cosker","title":"HMD-NeMo: Online 3D Avatar Motion Generation From Sparse Observations","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generating both plausible and accurate full body avatar motion is the key to\nthe quality of immersive experiences in mixed reality scenarios. Head-Mounted\nDevices (HMDs) typically only provide a few input signals, such as head and\nhands 6-DoF. Recently, different approaches achieved impressive performance in\ngenerating full body motion given only head and hands signal. However, to the\nbest of our knowledge, all existing approaches rely on full hand visibility.\nWhile this is the case when, e.g., using motion controllers, a considerable\nproportion of mixed reality experiences do not involve motion controllers and\ninstead rely on egocentric hand tracking. This introduces the challenge of\npartial hand visibility owing to the restricted field of view of the HMD. In\nthis paper, we propose the first unified approach, HMD-NeMo, that addresses\nplausible and accurate full body motion generation even when the hands may be\nonly partially visible. HMD-NeMo is a lightweight neural network that predicts\nthe full body motion in an online and real-time fashion. At the heart of\nHMD-NeMo is the spatio-temporal encoder with novel temporally adaptable mask\ntokens that encourage plausible motion in the absence of hand observations. We\nperform extensive analysis of the impact of different components in HMD-NeMo\nand introduce a new state-of-the-art on AMASS dataset through our evaluation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:07:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Aliakbarian","Sadegh",""],["Saleh","Fatemeh",""],["Collier","David",""],["Cameron","Pashmina",""],["Cosker","Darren",""]]}
{"id":"2308.11262","submitter":"Tim Palmer","authors":"Tim Palmer","title":"Superdeterminism Without Conspiracy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superdeterminism -- where the Measurement-Independence assumption in Bell's\nTheorem is violated -- is typically treated with derision as it appears to\nimply contrived conspiratorial correlations between properties $\\lambda$ of\nparticles being measured, and nominally accurate measurement settings $x$ and\n$y$. Based on an analysis of Pearlean interventions needed to determine whether\n$x$ and $y$ are free variables, we show that whilst conspiracy implies\nsuperdeterminism, superdeterminism does not imply conspiracy. In conspiratorial\nsuperdeterminism these interventions are consistent with physical theory; in\nnon-conspiratorial superdeterminism they are inconsistent. A non-conspiratorial\nlocally-causal superdeterministic model is developed, based in part on the\ngeneric properties of chaotic attractors and in part on an arbitrarily fine\ndiscretisation of complex Hilbert Space. Here the required interventions are\ninconsistent with rational-number constraints on exact measurement settings $X$\nand $Y$. In this model, hidden variables $\\lambda$ are defined as the\ninformation, over and above the freely chosen determinants of $x$ and $y$,\nwhich determine $X$ and $Y$. These rationality constraints limit the freedom to\nvary $x$ and $y$ keeping $\\lambda$ fixed. These constraints disappear with any\ncoarse-graining of $\\lambda$ and hence $X$. We show how quantum mechanics might\nbe `gloriously explained and derived' as the singular continuum limit of a\nsuperdeterministic discretisation of Hilbert Space. We argue that the real\nmessage behind Bell's Theorem is the need to develop more holistic theories of\nfundamental physics -- notably gravitational physics -- some ideas for moving\nin this direction are discussed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:09:22 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 08:43:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Palmer","Tim",""]]}
{"id":"2308.11263","submitter":"Mohammadreza Doostmohammadian","authors":"Mohammadreza Doostmohammadian","title":"Distributed Energy Resource Management: All-Time Resource-Demand\n  Feasibility, Delay-Tolerance, Nonlinearity, and Beyond","comments":"IEEE LCSS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we propose distributed and networked energy management\nscenarios to optimize the production and reservation of energy among a set of\ndistributed energy nodes. In other words, the idea is to optimally allocate the\ngenerated and reserved powers based on nodes' local cost gradient information\nwhile meeting the demand energy. One main concern is the all-time (or anytime)\nresource-demand feasibility, implying that at all iterations of the scheduling\nalgorithm, the balance between the produced power and demand plus reserved\npower must hold. The other concern is to design algorithms to tolerate\ncommunication time-delays and changes in the network. Further, one can\nincorporate possible model nonlinearity in the algorithm to address both\ninherent (e.g., saturation and quantization) and purposefully-added (e.g.,\nsignum-based) nonlinearities in the model. The proposed optimal allocation\nalgorithm addresses all the above concerns, while it benefits from possible\nfeatures of the distributed (or networked) solutions such as\nno-single-node-of-failure and distributed information processing. We show both\nthe all-time feasibility of the proposed scheme and its convergence under\ncertain bound on the step-rate using Lyapunov-type proofs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:09:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Doostmohammadian","Mohammadreza",""]]}
{"id":"2308.11264","submitter":"Oncay Yasa PhD","authors":"Oncay Yasa, Fikru M. Tiruneh, Miriam Filippi, Aiste Balciunaite,\n  Robert K. Katzschmann","title":"Perforated red blood cells enable compressible and injectable hydrogels\n  as therapeutic vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogels engineered for medical use within the human body need to be\ndelivered in a minimally invasive fashion without altering their biochemical\nand mechanical properties to maximize their therapeutic outcomes. In this\nregard, key strategies applied for creating such medical hydrogels include\nformulating precursor solutions that can be crosslinked in situ with physical\nor chemical cues following their delivery or forming macroporous hydrogels at\nsub-zero temperatures via cryogelation prior to their delivery. Here, we\npresent a new class of injectable composite materials with shape recovery\nability. The shape recovery is derived from the physical properties of red\nblood cells (RBCs) that are first modified via hypotonic swelling and then\nintegrated into the hydrogel scaffolds before polymerization. The RBCs'\nhypotonic swelling induces the formation of nanometer-sized pores on their cell\nmembranes, which enable fast liquid release under compression. The resulting\nbiocomposite hydrogel scaffolds display high deformability and shape-recovery\nability. The scaffolds can repeatedly compress up to ~87% of their original\nvolumes during injection and subsequent retraction through syringe needles of\ndifferent sizes; this cycle of injection and retraction can be repeated up to\nten times without causing any substantial mechanical damage to the scaffolds.\nOur biocomposite material system and fabrication approach for injectable\nmaterials will be foundational for the minimally invasive delivery of\ndrug-loaded scaffolds, tissue-engineered constructs, and personalized medical\nplatforms that could be administered to the human body with conventional\nneedle-syringe systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:12:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yasa","Oncay",""],["Tiruneh","Fikru M.",""],["Filippi","Miriam",""],["Balciunaite","Aiste",""],["Katzschmann","Robert K.",""]]}
{"id":"2308.11265","submitter":"Wojciech \\.Zu{\\l}awi\\'nski","authors":"Wojciech \\.Zu{\\l}awi\\'nski, Aleksandra Grzesiek, Rados{\\l}aw Zimroz,\n  Agnieszka Wy{\\l}oma\\'nska","title":"Identification and validation of periodic autoregressive model with\n  additive noise: finite-variance case","comments":"17 pages, 6 figures","journal-ref":"Journal of Computational and Applied Mathematics 427 (2023),\n  115131","doi":"10.1016/j.cam.2023.115131","report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we address the problem of modeling data with periodic\nautoregressive (PAR) time series and additive noise. In most cases, the data\nare processed assuming a noise-free model (i.e., without additive noise), which\nis not a realistic assumption in real life. The first two steps in PAR model\nidentification are order selection and period estimation, so the main focus is\non these issues. Finally, the model should be validated, so a procedure for\nanalyzing the residuals, which are considered here as multidimensional vectors,\nis proposed. Both order and period selection, as well as model validation, are\naddressed by using the characteristic function (CF) of the residual series. The\nCF is used to obtain the probability density function, which is utilized in the\ninformation criterion and for residuals distribution testing. To complete the\nPAR model analysis, the procedure for estimating the coefficients is necessary.\nHowever, this issue is only mentioned here as it is a separate task (under\nconsideration in parallel). The presented methodology can be considered as the\ngeneral framework for analyzing data with periodically non-stationary\ncharacteristics disturbed by finite-variance external noise. The original\ncontribution is in the selection of the optimal model order and period\nidentification, as well as the analysis of residuals. All these findings have\nbeen inspired by our previous work on machine condition monitoring that used\nPAR modeling\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:12:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["\u017bu\u0142awi\u0144ski","Wojciech",""],["Grzesiek","Aleksandra",""],["Zimroz","Rados\u0142aw",""],["Wy\u0142oma\u0144ska","Agnieszka",""]]}
{"id":"2308.11266","submitter":"O.S.K.S. Sastri","authors":"O. S. K. S. Sastri, Arushi Sharma and Ayushi Awasthi","title":"Constructing Inverse Scattering Potentials for {\\alpha}-{\\alpha} System\n  using Reference Potential Approach","comments":"10 pages, 4 figures, 2 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: An accurate way to incorporate long range Coulomb interaction\nalongside short-range nuclear interaction has been a challenge for theoretical\nphysicists. Purpose: In this paper, we propose a methodology based on the\nreference potential approach for constructing inverse potentials of alpha-alpha\nscattering. Methods: Two smoothly joined Morse potentials, regular for\nshort-range nuclear interaction and inverted for long range Coulomb, are used\nin tandem as a reference potential in the phase function method to obtain the\nscattering phase shifts for the S, D and G states of alpha-alpha scattering.\nThe model parameters are optimized by choosing to minimize the mean absolute\npercentage error between the obtained and experimental scattering phase shift\nvalues. Results: The constructed inverse potentials for S, D and G states have\nresulted in mean absolute percentage errors of 0.8, 0.5, and 0.4 respectively.\nThe obtained resonances for D and G states closely match the experimental ones.\nConclusion: The reference potential approach using a combination of smoothly\njoined Morse functions is successful in accurately accounting for the Coulomb\ninteraction between charged particles in nuclear scattering studies.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:13:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sastri","O. S. K. S.",""],["Sharma","Arushi",""],["Awasthi","Ayushi",""]]}
{"id":"2308.11267","submitter":"David Mark Bossens","authors":"David M. Bossens","title":"Robust Lagrangian and Adversarial Policy Gradient for Robust Constrained\n  Markov Decision Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The robust constrained Markov decision process (RCMDP) is a recent\ntask-modelling framework for reinforcement learning that incorporates\nbehavioural constraints and that provides robustness to errors in the\ntransition dynamics model through the use of an uncertainty set. Simulating\nRCMDPs requires computing the worst-case dynamics based on value estimates for\neach state, an approach which has previously been used in the Robust\nConstrained Policy Gradient (RCPG). Highlighting potential downsides of RCPG\nsuch as not robustifying the full constrained objective and the lack of\nincremental learning, this paper introduces two algorithms, called RCPG with\nRobust Lagrangian and Adversarial RCPG. RCPG with Robust Lagrangian modifies\nRCPG by taking the worst-case dynamics based on the Lagrangian rather than\neither the value or the constraint. Adversarial RCPG also formulates the\nworst-case dynamics based on the Lagrangian but learns this directly and\nincrementally as an adversarial policy through gradient descent rather than\nindirectly and abruptly through constrained optimisation on a sorted value\nlist. A theoretical analysis first derives the Lagrangian policy gradient for\nthe policy optimisation of both proposed algorithms and then the adversarial\npolicy gradient to learn the adversary for Adversarial RCPG. Empirical\nexperiments injecting perturbations in inventory management and safe navigation\ntasks demonstrate the competitive performance of both algorithms compared to\ntraditional RCPG variants as well as non-robust and non-constrained ablations.\nIn particular, Adversarial RCPG ranks among the top two performing algorithms\non all tests.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:24:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bossens","David M.",""]]}
{"id":"2308.11268","submitter":"Shih-Hao Lu","authors":"Shih-Hao Lu, Char-Dir Chung, Wei-Chang Chen, and Ping-Feng Tsou","title":"Orthogonal Constant-Amplitude Sequence Families for System Parameter\n  Identification in Spectrally Compact OFDM","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In rectangularly-pulsed orthogonal frequency division multiplexing (OFDM)\nsystems, constant-amplitude (CA) sequences are desirable to construct\npreamble/pilot waveforms to facilitate system parameter identification (SPI).\nOrthogonal CA sequences are generally preferred in various SPI applications\nlike random-access channel identification. However, the number of conventional\northogonal CA sequences (e.g., Zadoff-Chu sequences) that can be adopted in\ncellular communication without causing sequence identification ambiguity is\ninsufficient. Such insufficiency causes heavy performance degradation for SPI\nrequiring a large number of identification sequences. Moreover,\nrectangularly-pulsed OFDM preamble/pilot waveforms carrying conventional CA\nsequences suffer from large power spectral sidelobes and thus exhibit low\nspectral compactness. This paper is thus motivated to develop several order-I\nCA sequence families which contain more orthogonal CA sequences while endowing\nthe corresponding OFDM preamble/pilot waveforms with fast-decaying spectral\nsidelobes. Since more orthogonal sequences are provided, the developed order-I\nCA sequence families can enhance the performance characteristics in SPI\nrequiring a large number of identification sequences over multipath channels\nexhibiting short-delay channel profiles, while composing spectrally compact\nOFDM preamble/pilot waveforms.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:25:28 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lu","Shih-Hao",""],["Chung","Char-Dir",""],["Chen","Wei-Chang",""],["Tsou","Ping-Feng",""]]}
{"id":"2308.11269","submitter":"Larry Huynh","authors":"Larry Huynh, Jin Hong, Ajmal Mian, Hajime Suzuki, Yanqiu Wu, Seyit\n  Camtepe","title":"Quantum-Inspired Machine Learning: a Survey","comments":"56 pages, 13 figures, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum-inspired Machine Learning (QiML) is a burgeoning field, receiving\nglobal attention from researchers for its potential to leverage principles of\nquantum mechanics within classical computational frameworks. However, current\nreview literature often presents a superficial exploration of QiML, focusing\ninstead on the broader Quantum Machine Learning (QML) field. In response to\nthis gap, this survey provides an integrated and comprehensive examination of\nQiML, exploring QiML's diverse research domains including tensor network\nsimulations, dequantized algorithms, and others, showcasing recent\nadvancements, practical applications, and illuminating potential future\nresearch avenues. Further, a concrete definition of QiML is established by\nanalyzing various prior interpretations of the term and their inherent\nambiguities. As QiML continues to evolve, we anticipate a wealth of future\ndevelopments drawing from quantum mechanics, quantum computing, and classical\nmachine learning, enriching the field further. This survey serves as a guide\nfor researchers and practitioners alike, providing a holistic understanding of\nQiML's current landscape and future directions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:29:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Huynh","Larry",""],["Hong","Jin",""],["Mian","Ajmal",""],["Suzuki","Hajime",""],["Wu","Yanqiu",""],["Camtepe","Seyit",""]]}
{"id":"2308.11270","submitter":"Xiaopeng Zhao professor","authors":"Yao Qi, Duo Chen, Yongbo Li, Chao Sun, Qingyu Hai, Miao Shi, Honggang\n  Chen, Xiaopeng Zhao","title":"Green-light p-n Junction Particle Inhomogeneous Phase Enhancement of\n  MgB2 Smart Meta-Superconductor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Improving the critical temperature (TC), critical magnetic field (HC), and\ncritical current (JC) of superconducting materials has always been one of the\nmost significant challenges in the field of superconductivity, but progress has\nbeen slow over the years. Based on the concept of injecting energy to enhance\nelectron pairing states, in this study, we have employed a solid-state\nsintering method to fabricate a series of smart meta-superconductors (SMSCs)\nconsisting of p-n junction nanostructures with a wavelength of 550 nm, doped\nwithin an MgB2 matrix. Experimental results demonstrate that compared to pure\nMgB2 samples, the critical transition temperature (TC) has increased by 1.2 K,\nthe critical current (JC) has increased by 52.8%, and the Meissner effect (HC)\nshows significant improvement in its diamagnetic properties. This phenomenon of\nenhanced superconducting performance can be explained by the coupling between\nsuperconducting electrons and evanescent waves.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:37:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Qi","Yao",""],["Chen","Duo",""],["Li","Yongbo",""],["Sun","Chao",""],["Hai","Qingyu",""],["Shi","Miao",""],["Chen","Honggang",""],["Zhao","Xiaopeng",""]]}
{"id":"2308.11271","submitter":"Can Wang","authors":"Can Wang, Feng Chen, Mingde Ding, and Zekun Lu","title":"Radiative Magnetohydrodynamic Simulation of the Confined Eruption of a\n  Magnetic Flux Rope: Unveiling the Driving and Constraining Forces","comments":"17 pages, 10 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse the forces that control the dynamic evolution of a flux rope\neruption in a three-dimensional (3D) radiative magnetohydrodynamic (RMHD)\nsimulation. The confined eruption of the flux rope gives rise to a C8.5 flare.\nThe flux rope rises slowly with an almost constant velocity of a few km/s in\nthe early stage, when the gravity and Lorentz force are nearly counterbalanced.\nAfter the flux rope rises to the height at which the decay index of the\nexternal poloidal field satisfies the torus instability criterion, the\nsignificantly enhanced Lorentz force breaks the force balance and drives rapid\nacceleration of the flux rope. Fast magnetic reconnection is immediately\ninduced within the current sheet under the erupting flux rope, which provides a\nstrong positive feedback to the eruption. The eruption is eventually confined\ndue to the tension force from the strong external toroidal field. Our results\nsuggest that the gravity of plasma plays an important role in sustaining the\nquasi-static evolution of the pre-eruptive flux rope. The Lorentz force, which\nis contributed from both the ideal magnetohydrodynamic (MHD) instability and\nmagnetic reconnection, dominates the dynamic evolution during the eruption\nprocess.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:39:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Can",""],["Chen","Feng",""],["Ding","Mingde",""],["Lu","Zekun",""]]}
{"id":"2308.11272","submitter":"Seungyul Han","authors":"Yonghyeon Jo, Sunwoo Lee, Junghyuk Yum, Seungyul Han","title":"FoX: Formation-aware exploration in multi-agent reinforcement learning","comments":"7 pages main, 5 pages appendix with reference. 10 figures, submitted\n  for AAAI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, deep multi-agent reinforcement learning (MARL) has gained\nsignificant popularity due to its success in various cooperative multi-agent\ntasks. However, exploration still remains a challenging problem in MARL due to\nthe partial observability of the agents and the exploration space that can grow\nexponentially as the number of agents increases. Firstly, in order to address\nthe scalability issue of the exploration space, we define a formation-based\nequivalence relation on the exploration space and aim to reduce the search\nspace by exploring only meaningful states in different formations. Then, we\npropose a novel formation-aware exploration (FoX) framework that encourages\npartially observable agents to visit the states in diverse formations by\nguiding them to be well aware of their current formation solely based on their\nown observations. Numerical results show that the proposed FoX framework\nsignificantly outperforms the state-of-the-art MARL algorithms on Google\nResearch Football (GRF) and sparse Starcraft II multi-agent challenge (SMAC)\ntasks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:39:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jo","Yonghyeon",""],["Lee","Sunwoo",""],["Yum","Junghyuk",""],["Han","Seungyul",""]]}
{"id":"2308.11273","submitter":"Mario Raciti","authors":"Mario Raciti and Giampaolo Bella","title":"Up-to-date Threat Modelling for Soft Privacy on Smart Cars","comments":"Accepted in 7th International Workshop on SECurity and Privacy\n  Requirements Engineering (SECPRE 2023). arXiv admin note: substantial text\n  overlap with arXiv:2306.04222","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Physical persons playing the role of car drivers consume data that is sourced\nfrom the Internet and, at the same time, themselves act as sources of relevant\ndata. It follows that citizens' privacy is potentially at risk while they\ndrive, hence the need to model privacy threats in this application domain. This\npaper addresses the privacy threats by updating a recent threat-modelling\nmethodology and by tailoring it specifically to the soft privacy target\nproperty, which ensures citizens' full control on their personal data. The\nmethodology now features the sources of documentation as an explicit variable\nthat is to be considered. It is demonstrated by including a new version of the\nde-facto standard LINDDUN methodology as well as an additional source by ENISA\nwhich is found to be relevant to soft privacy. The main findings are a set of\n23 domain-independent threats, 43 domain-specific assets and 525\ndomain-dependent threats for the target property in the automotive domain.\nWhile these exceed their previous versions, their main value is to offer\nself-evident support to at least two arguments. One is that LINDDUN has evolved\nmuch the way our original methodology already advocated because a few of our\npreviously suggested extensions are no longer outstanding. The other one is\nthat ENISA's treatment of privacy aboard smart cars should be extended\nconsiderably because our 525 threats fall in the same scope.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:40:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Raciti","Mario",""],["Bella","Giampaolo",""]]}
{"id":"2308.11274","submitter":"Barbara Kaltenbacher","authors":"Barbara Kaltenbacher, Amjad Tuffaha","title":"Well-posedness of a Nonlinear Acoustics -- Structure Interaction Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish local-in-time and global in time well-posedness for small data,\nfor a coupled system of nonlinear acoustic structure interactions. The model\nconsists of the nonlinear Westervelt equation on a bounded domain with non\nhomogeneous boundary conditions, coupled with a 4th order linear equation\ndefined on a lower dimensional interface occupying part of the boundary of the\ndomain, with transmission boundary conditions matching acoustic velocities and\nacoustic pressures. While the well-posedness of the Westervelt model has been\nwell studied in the literature, there has been no works on the literature on\nthe coupled structure acoustic interaction model involving the Westervelt\nequation. Another contribution of this work, is a novel variational weak\nformulation of the linearized system and a consideration of various boundary\nconditions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:40:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kaltenbacher","Barbara",""],["Tuffaha","Amjad",""]]}
{"id":"2308.11275","submitter":"Lingfang Wang","authors":"Lingfang Wang, Ying Li, Qiao Li, Xin Cheng, and Mingde Ding","title":"Spectral Features of the Solar Transition Region and Chromospheric Lines\n  at Flare Ribbons Observed with IRIS","comments":"26 pages, 13 figures, accepted for publication in ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the spectral features of the Si IV 1402.77 \\AA, C II 1334.53\n\\AA, and Mg II h or k lines, formed in the layers from the transition region to\nthe chromosphere, in three two-ribbon flares (with X-, M-, and C-class)\nobserved with IRIS. All the three lines show significant redshifts within the\nmain flare ribbons, which mainly originate from the chromospheric condensation\nduring the flares. The average redshift velocities of the Si IV line within the\nmain ribbons are 56.6, 25.6, and 10.5 km s$^{-1}$ for the X-, M-, and C-class\nflares, respectively, which show a decreasing tendency with the flare class.\nThe C II and Mg II lines show a similar tendency but with smaller velocities\ncompared to the Si IV line. Additionally, the Mg II h or k line shows a\nblue-wing enhancement in the three flares in particular at the flare ribbon\nfronts, which is supposed to be caused by an upflow in the upper chromosphere\ndue to the heating of the atmosphere. Moreover, the Mg II h or k line exhibits\na central reversal at the flare ribbons, but turns to pure emission shortly\nafter 1--4 minutes. Correspondingly, the C II line also shows a central\nreversal but in a smaller region. However, for the Si IV line, the central\nreversal is only found in the X-class flare, but not in the other two flares.\nAs usual, the central reversal of these lines can be caused by the opacity\neffect. This implies that in addition to the optically thick lines (C II and Mg\nII lines), the Si IV line can become optically thick in a strong flare, which\nis likely related to the nonthermal electron beam heating.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:42:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Lingfang",""],["Li","Ying",""],["Li","Qiao",""],["Cheng","Xin",""],["Ding","Mingde",""]]}
{"id":"2308.11276","submitter":"Shansong Liu","authors":"Shansong Liu, Atin Sakkeer Hussain, Chenshuo Sun, Ying Shan","title":"Music Understanding LLaMA: Advancing Text-to-Music Generation with\n  Question Answering and Captioning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.CL cs.MM eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-to-music generation (T2M-Gen) faces a major obstacle due to the scarcity\nof large-scale publicly available music datasets with natural language\ncaptions. To address this, we propose the Music Understanding LLaMA (MU-LLaMA),\ncapable of answering music-related questions and generating captions for music\nfiles. Our model utilizes audio representations from a pretrained MERT model to\nextract music features. However, obtaining a suitable dataset for training the\nMU-LLaMA model remains challenging, as existing publicly accessible audio\nquestion answering datasets lack the necessary depth for open-ended music\nquestion answering. To fill this gap, we present a methodology for generating\nquestion-answer pairs from existing audio captioning datasets and introduce the\nMusicQA Dataset designed for answering open-ended music-related questions. The\nexperiments demonstrate that the proposed MU-LLaMA model, trained on our\ndesigned MusicQA dataset, achieves outstanding performance in both music\nquestion answering and music caption generation across various metrics,\noutperforming current state-of-the-art (SOTA) models in both fields and\noffering a promising advancement in the T2M-Gen research field.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:43:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Shansong",""],["Hussain","Atin Sakkeer",""],["Sun","Chenshuo",""],["Shan","Ying",""]]}
{"id":"2308.11277","submitter":"Hubert Mara","authors":"Ernst St\\\"otzner, Timo Homburg and Hubert Mara","title":"CNN based Cuneiform Sign Detection Learned from Annotated 3D Renderings\n  and Mapped Photographs with Illumination Augmentation","comments":"This paper was accepted to ICCV23 and includes the DOI for an Open\n  Access Dataset with annotated cuneiform script","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Motivated by the challenges of the Digital Ancient Near Eastern Studies\n(DANES) community, we develop digital tools for processing cuneiform script\nbeing a 3D script imprinted into clay tablets used for more than three\nmillennia and at least eight major languages. It consists of thousands of\ncharacters that have changed over time and space. Photographs are the most\ncommon representations usable for machine learning, while ink drawings are\nprone to interpretation. Best suited 3D datasets that are becoming available.\nWe created and used the HeiCuBeDa and MaiCuBeDa datasets, which consist of\naround 500 annotated tablets. For our novel OCR-like approach to mixed image\ndata, we provide an additional mapping tool for transferring annotations\nbetween 3D renderings and photographs. Our sign localization uses a RepPoints\ndetector to predict the locations of characters as bounding boxes. We use image\ndata from GigaMesh's MSII (curvature, see https://gigamesh.eu) based rendering,\nPhong-shaded 3D models, and photographs as well as illumination augmentation.\nThe results show that using rendered 3D images for sign detection performs\nbetter than other work on photographs. In addition, our approach gives\nreasonably good results for photographs only, while it is best used for mixed\ndatasets. More importantly, the Phong renderings, and especially the MSII\nrenderings, improve the results on photographs, which is the largest dataset on\na global scale.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:46:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["St\u00f6tzner","Ernst",""],["Homburg","Timo",""],["Mara","Hubert",""]]}
{"id":"2308.11278","submitter":"Kevin Wilson Dr","authors":"S. Faye Williamson, Svetlana V. Tishkovskaya and Kevin J. Wilson","title":"Hybrid sample size calculations for cluster randomised trials using\n  assurance","comments":"21 pages, 4 figures and 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sample size determination for cluster randomised trials (CRTs) is challenging\nas it requires robust estimation of the intra-cluster correlation coefficient\n(ICC). Typically, the sample size is chosen to provide a certain level of power\nto reject the null hypothesis in a hypothesis test. This relies on the minimal\nclinically important difference (MCID) and estimates for the standard\ndeviation, ICC and possibly the coefficient of variation of the cluster size.\nVarying these parameters can have a strong effect on the sample size. In\nparticular, it is sensitive to small differences in the ICC. A relevant ICC\nestimate is often not available, or the available estimate is imprecise. If the\nICC used is far from the unknown true value, this can lead to trials which are\nsubstantially over- or under-powered. We propose a hybrid approach using\nBayesian assurance to find the sample size for a CRT with a frequentist\nanalysis. Assurance is an alternative to power which incorporates uncertainty\non parameters through a prior distribution. We suggest specifying prior\ndistributions for the standard deviation, ICC and coefficient of variation of\nthe cluster size, while still utilising the MCID. We illustrate the approach\nthrough the design of a CRT in post-stroke incontinence. We show assurance can\nbe used to find a sample size based on an elicited prior distribution for the\nICC, when a power calculation discards all information in the prior except a\nsingle point estimate. Results show that this approach can avoid misspecifying\nsample sizes when prior medians for the ICC are very similar but prior\ndistributions exhibit quite different behaviour. Assurance provides an\nunderstanding of the probability of success of a trial given an MCID and can be\nused to produce sample sizes which are robust to parameter uncertainty. This is\nespecially useful when there is difficulty obtaining reliable parameter\nestimates.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:47:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Williamson","S. Faye",""],["Tishkovskaya","Svetlana V.",""],["Wilson","Kevin J.",""]]}
{"id":"2308.11279","submitter":"Jonas Jansen","authors":"Gabriele Br\\\"ull, Bastian Hilder, Jonas Jansen","title":"Thermocapillary Thin Films: Periodic Steady States and Film Rupture","comments":"32 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP nlin.PS physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study stationary, periodic solutions to the thermocapillary thin-film\nmodel\n  \\begin{equation*}\n  \\partial_t h + \\partial_x \\Bigl(h^3(\\partial_x^3 h - g\\partial_x h) +\nM\\frac{h^2}{(1+h)^2}\\partial_xh\\Bigr) = 0,\\quad t>0,\\ x\\in \\mathbb{R},\n  \\end{equation*} which can be derived from the B\\'enard-Marangoni problem via\na lubrication approximation. When the Marangoni number $M$ increases beyond a\ncritical value $M^*$, the constant solution becomes spectrally unstable via a\n(conserved) long-wave instability and periodic stationary solutions bifurcate.\nFor a fixed period, we find that these solutions lie on a global bifurcation\ncurve of stationary, periodic solutions with a fixed wave number and mass.\nFurthermore, we show that the stationary periodic solutions on the global\nbifurcation branch converge to a weak stationary periodic solution which\nexhibits film rupture. The proofs rely on a Hamiltonian formulation of the\nstationary problem and the use of analytic global bifurcation theory. Finally,\nwe show the instability of the bifurcating solutions close to the bifurcation\npoint and give a formal derivation of the amplitude equation governing the\ndynamics close to the onset of instability.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:49:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Br\u00fcll","Gabriele",""],["Hilder","Bastian",""],["Jansen","Jonas",""]]}
{"id":"2308.11280","submitter":"Zaiyi Shen","authors":"Zaiyi Shen, Juho S. Lintuvuori","title":"Collective Flows Drive Cavitation in Spinner Monolayers","comments":null,"journal-ref":"Physical Review Letters 130 (18), 188202 (2023)","doi":"10.1103/PhysRevLett.130.188202","report-no":null,"categories":"physics.flu-dyn cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hydrodynamic interactions can give rise to a collective motion of rotating\nparticles. This, in turn, can lead to coherent fluid flows. Using large scale\nhydrodynamic simulations, we study the coupling between these two in spinner\nmonolayers at weakly inertial regime. We observe an instability, where the\ninitially uniform particle layer separates into particle void and particle rich\nareas. The particle void region corresponds to a fluid vortex, and it is driven\nby a surrounding spinner edge current. We show that the instability originates\nfrom a hydrodynamic lift force between the particle and fluid flows. The\ncavitation can be tuned by the strength of the collective flows. It is\nsuppressed when the spinners are confined by a no-slip surface, and multiple\ncavity and oscillating cavity states are observed when the particle\nconcentration is reduced.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:50:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shen","Zaiyi",""],["Lintuvuori","Juho S.",""]]}
{"id":"2308.11281","submitter":"Eyal Hanania","authors":"Eyal Hanania, Ilya Volovik, Lilach Barkat, Israel Cohen and Moti\n  Freiman","title":"PCMC-T1: Free-breathing myocardial T1 mapping with\n  Physically-Constrained Motion Correction","comments":"Accepted to MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  T1 mapping is a quantitative magnetic resonance imaging (qMRI) technique that\nhas emerged as a valuable tool in the diagnosis of diffuse myocardial diseases.\nHowever, prevailing approaches have relied heavily on breath-hold sequences to\neliminate respiratory motion artifacts. This limitation hinders accessibility\nand effectiveness for patients who cannot tolerate breath-holding. Image\nregistration can be used to enable free-breathing T1 mapping. Yet, inherent\nintensity differences between the different time points make the registration\ntask challenging. We introduce PCMC-T1, a physically-constrained deep-learning\nmodel for motion correction in free-breathing T1 mapping. We incorporate the\nsignal decay model into the network architecture to encourage\nphysically-plausible deformations along the longitudinal relaxation axis. We\ncompared PCMC-T1 to baseline deep-learning-based image registration approaches\nusing a 5-fold experimental setup on a publicly available dataset of 210\npatients. PCMC-T1 demonstrated superior model fitting quality (R2: 0.955) and\nachieved the highest clinical impact (clinical score: 3.93) compared to\nbaseline methods (0.941, 0.946 and 3.34, 3.62 respectively). Anatomical\nalignment results were comparable (Dice score: 0.9835 vs. 0.984, 0.988). Our\ncode and trained models are available at https://github.com/eyalhana/PCMC-T1.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:50:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hanania","Eyal",""],["Volovik","Ilya",""],["Barkat","Lilach",""],["Cohen","Israel",""],["Freiman","Moti",""]]}
{"id":"2308.11282","submitter":"Marcello Porta","authors":"Marcello Porta, Vieri Mastropietro, Alessandro Giuliani","title":"Response functions of many-body condensed matter systems","comments":"27 pages. Article commissioned by the Encyclopedia of Mathematical\n  Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.str-el math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss rigorous results about the response functions of gapped and\ngapless interacting fermionic lattice models, relevant for the study of\ntransport in condensed matter physics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:50:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Porta","Marcello",""],["Mastropietro","Vieri",""],["Giuliani","Alessandro",""]]}
{"id":"2308.11283","submitter":"Alex Massarenti","authors":"Michele Bolognesi, Alex Massarenti, Elena Poma","title":"Cox rings of blow-ups of multiprojective spaces","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AC math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X^{1,n}_r$ be the blow-up of $\\mathbb{P}^1\\times\\mathbb{P}^n$ in $r$\ngeneral points. We describe the Mori cone of $X^{1,n}_r$ for $r\\leq n+2$ and\nfor $r = n+3$ when $n\\leq 4$. Furthermore, we prove that $X^{1,n}_{n+1}$ is log\nFano and give an explicit presentation for its Cox ring.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:50:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bolognesi","Michele",""],["Massarenti","Alex",""],["Poma","Elena",""]]}
{"id":"2308.11284","submitter":"Mingxuan Xiao","authors":"Mingxuan Xiao, Yan Xiao, Hai Dong, Shunhui Ji, Pengcheng Zhang","title":"LEAP: Efficient and Automated Test Method for NLP Software","comments":"Accepted at ASE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The widespread adoption of DNNs in NLP software has highlighted the need for\nrobustness. Researchers proposed various automatic testing techniques for\nadversarial test cases. However, existing methods suffer from two limitations:\nweak error-discovering capabilities, with success rates ranging from 0% to\n24.6% for BERT-based NLP software, and time inefficiency, taking 177.8s to\n205.28s per test case, making them challenging for time-constrained scenarios.\nTo address these issues, this paper proposes LEAP, an automated test method\nthat uses LEvy flight-based Adaptive Particle swarm optimization integrated\nwith textual features to generate adversarial test cases. Specifically, we\nadopt Levy flight for population initialization to increase the diversity of\ngenerated test cases. We also design an inertial weight adaptive update\noperator to improve the efficiency of LEAP's global optimization of\nhigh-dimensional text examples and a mutation operator based on the greedy\nstrategy to reduce the search time. We conducted a series of experiments to\nvalidate LEAP's ability to test NLP software and found that the average success\nrate of LEAP in generating adversarial test cases is 79.1%, which is 6.1%\nhigher than the next best approach (PSOattack). While ensuring high success\nrates, LEAP significantly reduces time overhead by up to 147.6s compared to\nother heuristic-based methods. Additionally, the experimental results\ndemonstrate that LEAP can generate more transferable test cases and\nsignificantly enhance the robustness of DNN-based systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:51:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Xiao","Mingxuan",""],["Xiao","Yan",""],["Dong","Hai",""],["Ji","Shunhui",""],["Zhang","Pengcheng",""]]}
{"id":"2308.11285","submitter":"Daniela Gaul","authors":"Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Arne Schulz,\n  Michael Stiglmayr","title":"A Tight Formulation for the Dial-a-Ride Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ridepooling services play an increasingly important role in modern\ntransportation systems. With soaring demand and growing fleet sizes, the\nunderlying route planning problems become increasingly challenging. In this\ncontext, we consider the dial-a-ride problem (DARP): Given a set of\ntransportation requests with pick-up and delivery locations, passenger numbers,\ntime windows, and maximum ride times, an optimal routing for a fleet of\nvehicles, including an optimized passenger assignment, needs to be determined.\nWe present tight mixed-integer linear programming (MILP) formulations for the\nDARP by combining two state-of-the-art models into novel\nlocation-augmented-event-based formulations. Strong valid inequalities and\nlower and upper bounding techniques are derived to further improve the\nformulations. We then demonstrate the theoretical and computational superiority\nof the new model: First, the formulation is tight in the sense that, if time\nwindows shrink to a single point in time, the linear programming relaxation\nyields integer (and hence optimal) solutions. Second, extensive numerical\nexperiments on benchmark instances show that computational times are on average\nreduced by 49.7% compared to state-of-the-art event-based approaches.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:53:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gaul","Daniela",""],["Klamroth","Kathrin",""],["Pfeiffer","Christian",""],["Schulz","Arne",""],["Stiglmayr","Michael",""]]}
{"id":"2308.11286","submitter":"Manuel Hauke","authors":"Lorenz Fr\\\"uhwirth, Manuel Hauke","title":"On Birkhoff sums that satisfy no temporal distributional limit theorem\n  for almost every irrational","comments":"14 pages, 1 figure, all comments are appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.NT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Dolgpoyat and Sarig showed that for any piecewise smooth function $f:\n\\mathbb{T} \\to \\mathbb{R}$ and almost every pair $(\\alpha,x_0) \\in \\mathbb{T}\n\\times \\mathbb{T}$, $S_N(f,\\alpha,x_0) := \\sum_{n =1}^{N} f(n\\alpha + x_0)$\nfails to fulfill a temporal distributional limit theorem. In this article, we\nshow that the two-dimensional average is in fact not needed: For almost every\n$\\alpha \\in \\mathbb{T}$ and all $x_0 \\in \\mathbb{T}$, $S_N(f,\\alpha,x_0)$ does\nnot satisfy a temporal distributional limit theorem, regardless of centering\nand scaling. The obtained results additionally lead to progress in a question\nposed by Dolgopyat and Sarig.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:54:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fr\u00fchwirth","Lorenz",""],["Hauke","Manuel",""]]}
{"id":"2308.11287","submitter":"Rui Pan","authors":"Tianchen Gao, Yan Zhang, Rui Pan, and Hansheng Wang","title":"Large-scale Multi-layer Academic Networks Derived from Statistical\n  Publications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The utilization of multi-layer network structures now enables the explanation\nof complex systems in nature from multiple perspectives. Multi-layer academic\nnetworks capture diverse relationships among academic entities, facilitating\nthe study of academic development and the prediction of future directions.\nHowever, there are currently few academic network datasets that simultaneously\nconsider multi-layer academic networks; often, they only include a single\nlayer. In this study, we provide a large-scale multi-layer academic network\ndataset, namely, LMANStat, which includes collaboration, co-institution,\ncitation, co-citation, journal citation, author citation, author-paper and\nkeyword co-occurrence networks. Furthermore, each layer of the multi-layer\nacademic network is dynamic. Additionally, we expand the attributes of nodes,\nsuch as authors' research interests, productivity, region and institution.\nSupported by this dataset, it is possible to study the development and\nevolution of statistical disciplines from multiple perspectives. This dataset\nalso provides fertile ground for studying complex systems with multi-layer\nstructures.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:56:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Tianchen",""],["Zhang","Yan",""],["Pan","Rui",""],["Wang","Hansheng",""]]}
{"id":"2308.11288","submitter":"Dain Kim","authors":"Dain Kim, Jinhyeok Park, Dongwoo Kim","title":"Test Time Embedding Normalization for Popularity Bias Mitigation","comments":"5 pages, CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3615281","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Popularity bias is a widespread problem in the field of recommender systems,\nwhere popular items tend to dominate recommendation results. In this work, we\npropose 'Test Time Embedding Normalization' as a simple yet effective strategy\nfor mitigating popularity bias, which surpasses the performance of the previous\nmitigation approaches by a significant margin. Our approach utilizes the\nnormalized item embedding during the inference stage to control the influence\nof embedding magnitude, which is highly correlated with item popularity.\nThrough extensive experiments, we show that our method combined with the\nsampled softmax loss effectively reduces popularity bias compare to previous\napproaches for bias mitigation. We further investigate the relationship between\nuser and item embeddings and find that the angular similarity between\nembeddings distinguishes preferable and non-preferable items regardless of\ntheir popularity. The analysis explains the mechanism behind the success of our\napproach in eliminating the impact of popularity bias. Our code is available at\nhttps://github.com/ml-postech/TTEN.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:57:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kim","Dain",""],["Park","Jinhyeok",""],["Kim","Dongwoo",""]]}
{"id":"2308.11289","submitter":"Xinrui Li","authors":"Xinrui Li, Zhenjun Dong, Yong Zeng, Shi Jin, Rui Zhang","title":"Multi-User Modular XL-MIMO Communications: Near-Field Beam Focusing\n  Pattern and User Grouping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate multi-user modular extremely large-scale\nmultiple-input multiple-output (XL-MIMO) communication systems, where modular\nextremely large-scale uniform linear array (XL-ULA) is deployed at the base\nstation (BS) to serve multiple single-antenna users. By exploiting the unique\nmodular array architecture and considering the potential near-field\npropagation, we develop sub-array based uniform spherical wave (USW) models for\ndistinct versus common angles of arrival/departure (AoAs/AoDs) with respect to\ndifferent sub-arrays/modules, respectively. Under such USW models, we analyze\nthe beam focusing patterns at the near-field observation location by using\nnear-field beamforming. The analysis reveals that compared to the conventional\nXL-MIMO with collocated antenna elements, modular XL-MIMO can provide better\nspatial resolution by benefiting from its larger array aperture. However, it\nalso incurs undesired grating lobes due to the large inter-module separation.\nMoreover, it is found that for multi-user modular XL-MIMO communications, the\nachievable signal-to-interference-plus-noise ratio (SINR) for users may be\ndegraded by the grating lobes of the beam focusing pattern. To address this\nissue, an efficient user grouping method is proposed for multi-user\ntransmission scheduling, so that users located within the grating lobes of each\nother are not allocated to the same time-frequency resource block (RB) for\ntheir communications. Numerical results are presented to verify the\neffectiveness of the proposed user grouping method, as well as the superior\nperformance of modular XL-MIMO over its collocated counterpart with densely\ndistributed users.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:07:38 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 01:37:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Xinrui",""],["Dong","Zhenjun",""],["Zeng","Yong",""],["Jin","Shi",""],["Zhang","Rui",""]]}
{"id":"2308.11290","submitter":"Yuxuan Du","authors":"Yuxuan Du, Yibo Yang, Tongliang Liu, Zhouchen Lin, Bernard Ghanem,\n  Dacheng Tao","title":"ShadowNet for Data-Centric Quantum System Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the dynamics of large quantum systems is hindered by the curse\nof dimensionality. Statistical learning offers new possibilities in this regime\nby neural-network protocols and classical shadows, while both methods have\nlimitations: the former is plagued by the predictive uncertainty and the latter\nlacks the generalization ability. Here we propose a data-centric learning\nparadigm combining the strength of these two approaches to facilitate diverse\nquantum system learning (QSL) tasks. Particularly, our paradigm utilizes\nclassical shadows along with other easily obtainable information of quantum\nsystems to create the training dataset, which is then learnt by neural networks\nto unveil the underlying mapping rule of the explored QSL problem. Capitalizing\non the generalization power of neural networks, this paradigm can be trained\noffline and excel at predicting previously unseen systems at the inference\nstage, even with few state copies. Besides, it inherits the characteristic of\nclassical shadows, enabling memory-efficient storage and faithful prediction.\nThese features underscore the immense potential of the proposed data-centric\napproach in discovering novel and large-scale quantum systems. For\nconcreteness, we present the instantiation of our paradigm in quantum state\ntomography and direct fidelity estimation tasks and conduct numerical analysis\nup to 60 qubits. Our work showcases the profound prospects of data-centric\nartificial intelligence to advance QSL in a faithful and generalizable manner.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:11:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Du","Yuxuan",""],["Yang","Yibo",""],["Liu","Tongliang",""],["Lin","Zhouchen",""],["Ghanem","Bernard",""],["Tao","Dacheng",""]]}
{"id":"2308.11291","submitter":"Salim Khazem","authors":"Salim Khazem, Jeremy Fix, C\\'edric Pradalier","title":"Improving Knot Prediction in Wood Logs with Longitudinal Feature\n  Propagation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The quality of a wood log in the wood industry depends heavily on the\npresence of both outer and inner defects, including inner knots that are a\nresult of the growth of tree branches. Today, locating the inner knots require\nthe use of expensive equipment such as X-ray scanners. In this paper, we\naddress the task of predicting the location of inner defects from the outer\nshape of the logs. The dataset is built by extracting both the contours and the\nknots with X-ray measurements. We propose to solve this binary segmentation\ntask by leveraging convolutional recurrent neural networks. Once the neural\nnetwork is trained, inference can be performed from the outer shape measured\nwith cheap devices such as laser profilers. We demonstrate the effectiveness of\nour approach on fir and spruce tree species and perform ablation on the\nrecurrence to demonstrate its importance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:12:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Khazem","Salim",""],["Fix","Jeremy",""],["Pradalier","C\u00e9dric",""]]}
{"id":"2308.11292","submitter":"Raffael Hagger","authors":"Robert Fulsche and Raffael Hagger","title":"Quantum harmonic analysis for polyanalytic Fock spaces","comments":"37 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop the quantum harmonic analysis framework in the reducible setting\nand apply our findings to polyanalytic Fock spaces. In particular, we explain\nsome phenomena observed in arXiv:2201.10230 and answer a few related open\nquestions. For instance, we show that there exists a symbol such that the\ncorresponding Toeplitz operator is unitary on the analytic Fock space but\nvanishes completely on one of the true polyanalytic Fock spaces. This follows\ndirectly from an explicit characterization of the kernel of the Toeplitz\nquantization, which we derive using quantum harmonic analysis. Moreover, we\nshow that the Berezin transform is injective on the set of of Toeplitz\noperators. Finally, we provide several characterizations of the\n$\\mathcal{C}_1$-algebra in terms of integral kernel estimates and essential\ncommutants.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:13:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fulsche","Robert",""],["Hagger","Raffael",""]]}
{"id":"2308.11293","submitter":"Wojciech \\.Zu{\\l}awi\\'nski","authors":"Prashant Giri, Aleksandra Grzesiek, Wojciech \\.Zu{\\l}awi\\'nski, S.\n  Sundar, Agnieszka Wy{\\l}oma\\'nska","title":"The modified Yule-Walker method for multidimensional infinite-variance\n  periodic autoregressive model of order 1","comments":"31 pages, 17 figures","journal-ref":"Journal of the Korean Statistical Society 52 (2023), 462-493","doi":"10.1007/s42952-022-00191-3","report-no":null,"categories":"stat.ME math.PR math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The time series with periodic behavior, such as the periodic autoregressive\n(PAR) models belonging to the class of the periodically correlated processes,\nare present in various real applications. In the literature, such processes\nwere considered in different directions, especially with the\nGaussian-distributed noise. However, in most of the applications, the\nassumption of the finite-variance distribution seems to be too simplified.\nThus, one can consider the extensions of the classical PAR model where the\nnon-Gaussian distribution is applied. In particular, the Gaussian distribution\ncan be replaced by the infinite-variance distribution, e.g. by the\n$\\alpha-$stable distribution. In this paper, we focus on the multidimensional\n$\\alpha-$stable PAR time series models. For such models, we propose a new\nestimation method based on the Yule-Walker equations. However, since for the\ninfinite-variance case the covariance does not exist, thus it is replaced by\nanother measure, namely the covariation. In this paper we propose to apply two\nestimators of the covariation measure. The first one is based on moment\nrepresentation (moment-based) while the second one - on the spectral measure\nrepresentation (spectral-based). The validity of the new approaches are\nverified using the Monte Carlo simulations in different contexts, including the\nsample size and the index of stability of the noise. Moreover, we compare the\nmoment-based covariation-based method with spectral-based covariation-based\ntechnique. Finally, the real data analysis is presented.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:14:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Giri","Prashant",""],["Grzesiek","Aleksandra",""],["\u017bu\u0142awi\u0144ski","Wojciech",""],["Sundar","S.",""],["Wy\u0142oma\u0144ska","Agnieszka",""]]}
{"id":"2308.11294","submitter":"Xingyue Pu","authors":"Xingyue Pu, Stephen Roberts, Xiaowen Dong, and Stefan Zohren","title":"Network Momentum across Asset Classes","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.LG eess.SP q-fin.TR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the concept of network momentum, a novel trading signal\nderived from momentum spillover across assets. Initially observed within the\nconfines of pairwise economic and fundamental ties, such as the stock-bond\nconnection of the same company and stocks linked through supply-demand chains,\nmomentum spillover implies a propagation of momentum risk premium from one\nasset to another. The similarity of momentum risk premium, exemplified by\nco-movement patterns, has been spotted across multiple asset classes including\ncommodities, equities, bonds and currencies. However, studying the network\neffect of momentum spillover across these classes has been challenging due to a\nlack of readily available common characteristics or economic ties beyond the\ncompany level. In this paper, we explore the interconnections of momentum\nfeatures across a diverse range of 64 continuous future contracts spanning\nthese four classes. We utilise a linear and interpretable graph learning model\nwith minimal assumptions to reveal the intricacies of the momentum spillover\nnetwork. By leveraging the learned networks, we construct a network momentum\nstrategy that exhibits a Sharpe ratio of 1.5 and an annual return of 22%, after\nvolatility scaling, from 2000 to 2022. This paper pioneers the examination of\nmomentum spillover across multiple asset classes using only pricing data,\npresents a multi-asset investment strategy based on network momentum, and\nunderscores the effectiveness of this strategy through robust empirical\nanalysis.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:15:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pu","Xingyue",""],["Roberts","Stephen",""],["Dong","Xiaowen",""],["Zohren","Stefan",""]]}
{"id":"2308.11295","submitter":"Elizaveta Kostenok","authors":"Elizaveta Kostenok, Daniil Cherniavskii, Alexey Zaytsev","title":"Uncertainty Estimation of Transformers' Predictions via Topological\n  Analysis of the Attention Matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Determining the degree of confidence of deep learning model in its prediction\nis an open problem in the field of natural language processing. Most of the\nclassical methods for uncertainty estimation are quite weak for text\nclassification models. We set the task of obtaining an uncertainty estimate for\nneural networks based on the Transformer architecture. A key feature of such\nmo-dels is the attention mechanism, which supports the information flow between\nthe hidden representations of tokens in the neural network. We explore the\nformed relationships between internal representations using Topological Data\nAnalysis methods and utilize them to predict model's confidence. In this paper,\nwe propose a method for uncertainty estimation based on the topological\nproperties of the attention mechanism and compare it with classical methods. As\na result, the proposed algorithm surpasses the existing methods in quality and\nopens up a new area of application of the attention mechanism, but requires the\nselection of topological features.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:17:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kostenok","Elizaveta",""],["Cherniavskii","Daniil",""],["Zaytsev","Alexey",""]]}
{"id":"2308.11296","submitter":"Shitong Wu","authors":"Lingyi Chen, Shitong Wu, Wenhao Ye, Huihui Wu, Hao Wu, Wenyi Zhang, Bo\n  Bai and Yining Sun","title":"Information Bottleneck Revisited: Posterior Probability Perspective with\n  Optimal Transport","comments":"ISIT 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Information bottleneck (IB) is a paradigm to extract information in one\ntarget random variable from another relevant random variable, which has aroused\ngreat interest due to its potential to explain deep neural networks in terms of\ninformation compression and prediction. Despite its great importance, finding\nthe optimal bottleneck variable involves a difficult nonconvex optimization\nproblem due to the nonconvexity of mutual information constraint. The\nBlahut-Arimoto algorithm and its variants provide an approach by considering\nits Lagrangian with fixed Lagrange multiplier. However, only the strictly\nconcave IB curve can be fully obtained by the BA algorithm, which strongly\nlimits its application in machine learning and related fields, as strict\nconcavity cannot be guaranteed in those problems. To overcome the above\ndifficulty, we derive an entropy regularized optimal transport (OT) model for\nIB problem from a posterior probability perspective. Correspondingly, we use\nthe alternating optimization procedure and generalize the Sinkhorn algorithm to\nsolve the above OT model. The effectiveness and efficiency of our approach are\ndemonstrated via numerical experiments.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:18:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Lingyi",""],["Wu","Shitong",""],["Ye","Wenhao",""],["Wu","Huihui",""],["Wu","Hao",""],["Zhang","Wenyi",""],["Bai","Bo",""],["Sun","Yining",""]]}
{"id":"2308.11297","submitter":"Wang Long-Jun","authors":"Zi-Rui Chen and Long-Jun Wang","title":"Stellar weak-interaction rates for $rp$-process waiting-point nuclei\n  from projected shell model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We propose a projected shell model (PSM) for description of stellar\nweak-interaction rates between even-even and odd-odd nuclei with extended\nconfiguration space where up to six-quasiparticle (qp) configurations are\nincluded, and the stellar weak-interaction rates for eight $rp$-process\nwaiting-point (WP) nuclei, $^{64}$Ge, $^{68}$Se, $^{72}$Kr, $^{76}$Sr,\n$^{80}$Zr, $^{84}$Mo, $^{88}$Ru and $^{92}$Pd, are calculated and analyzed for\nthe first time within the model. Higher-order qp configurations are found to\naffect the underlying Gamow-Teller strength distributions and the corresponding\nstellar weak-interaction rates. Under $rp$-process environments with high\ntemperatures and densities, on one hand, thermal population of excited states\nof parent nuclei tends to decrease the stellar $\\beta^+$ decay rates. On the\nother hand, the possibility of electron capture (EC) tends to provide\nincreasing contribution to the rates with temperature and density. The\neffective half-lives of WP nuclei under the $rp$-process peak condition are\npredicted to be reduced as compared with the terrestrial case, especially for\n$^{64}$Ge and $^{68}$Se.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:19:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Zi-Rui",""],["Wang","Long-Jun",""]]}
{"id":"2308.11298","submitter":"Zeyu Zhang","authors":"Biao Wu, Yutong Xie, Zeyu Zhang, Jinchao Ge, Kaspar Yaxley, Suzan\n  Bahadir, Qi Wu, Yifan Liu, Minh-Son To","title":"BHSD: A 3D Multi-Class Brain Hemorrhage Segmentation Dataset","comments":"Accepted by MLMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Intracranial hemorrhage (ICH) is a pathological condition characterized by\nbleeding inside the skull or brain, which can be attributed to various factors.\nIdentifying, localizing and quantifying ICH has important clinical\nimplications, in a bleed-dependent manner. While deep learning techniques are\nwidely used in medical image segmentation and have been applied to the ICH\nsegmentation task, existing public ICH datasets do not support the multi-class\nsegmentation problem. To address this, we develop the Brain Hemorrhage\nSegmentation Dataset (BHSD), which provides a 3D multi-class ICH dataset\ncontaining 192 volumes with pixel-level annotations and 2200 volumes with\nslice-level annotations across five categories of ICH. To demonstrate the\nutility of the dataset, we formulate a series of supervised and semi-supervised\nICH segmentation tasks. We provide experimental results with state-of-the-art\nmodels as reference benchmarks for further model developments and evaluations\non this dataset.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:20:55 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 05:44:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wu","Biao",""],["Xie","Yutong",""],["Zhang","Zeyu",""],["Ge","Jinchao",""],["Yaxley","Kaspar",""],["Bahadir","Suzan",""],["Wu","Qi",""],["Liu","Yifan",""],["To","Minh-Son",""]]}
{"id":"2308.11299","submitter":"Wang Long-Jun","authors":"Fan Gao and Zi-Rui Chen and Long-Jun Wang","title":"Nuclear $\\beta$ spectrum from projected shell model (I): allowed\n  one-to-one transition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Nuclear $\\beta$ spectrum and the corresponding (anti-)neutrino spectrum play\nimportant roles in many aspects of nuclear astrophysics, particle physics,\nnuclear industry and nuclear data. In this work we propose a projected shell\nmodel (PSM) to calculate the level energies as well as the reduced one-body\ntransition density (ROBTD) by the Pfaffian algorithm for nuclear $\\beta$\ndecays. The calculated level energies and ROBTD are inputed to the Beta\nSpectrum Generator (BSG) code to study the high precision $\\beta$ spectrum of\nallowed one-to-one transitions. When experimental level energies are adopted,\nthe calculated $\\beta$ spectrum by ROBTD of the PSM deviates from the one by\nthe extreme simple particle evaluation of the BSG by up to $10\\%$, reflecting\nthe importance of nuclear many-body correlations. When calculated level\nenergies are adopted, the calculated $\\beta$ spectrum shows sensitive\ndependence on the reliability of calculated level energies. The developed\nmethod for ROBTD by the PSM will also be useful for study of the\nfirst-forbidden transitions, the isovector spin monopole resonance etc. in a\nstraightforward way.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:25:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Fan",""],["Chen","Zi-Rui",""],["Wang","Long-Jun",""]]}
{"id":"2308.11300","submitter":"Thomas O'Connell","authors":"Thomas P. O'Connell, Tyler Bonnen, Yoni Friedman, Ayush Tewari, Josh\n  B. Tenenbaum, Vincent Sitzmann, Nancy Kanwisher","title":"Approaching human 3D shape perception with neurally mappable models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Humans effortlessly infer the 3D shape of objects. What computations underlie\nthis ability? Although various computational models have been proposed, none of\nthem capture the human ability to match object shape across viewpoints. Here,\nwe ask whether and how this gap might be closed. We begin with a relatively\nnovel class of computational models, 3D neural fields, which encapsulate the\nbasic principles of classic analysis-by-synthesis in a deep neural network\n(DNN). First, we find that a 3D Light Field Network (3D-LFN) supports 3D\nmatching judgments well aligned to humans for within-category comparisons,\nadversarially-defined comparisons that accentuate the 3D failure cases of\nstandard DNN models, and adversarially-defined comparisons for algorithmically\ngenerated shapes with no category structure. We then investigate the source of\nthe 3D-LFN's ability to achieve human-aligned performance through a series of\ncomputational experiments. Exposure to multiple viewpoints of objects during\ntraining and a multi-view learning objective are the primary factors behind\nmodel-human alignment; even conventional DNN architectures come much closer to\nhuman behavior when trained with multi-view objectives. Finally, we find that\nwhile the models trained with multi-view learning objectives are able to\npartially generalize to new object categories, they fall short of human\nalignment. This work provides a foundation for understanding human shape\ninferences within neurally mappable computational architectures and highlights\nimportant questions for future work.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:29:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["O'Connell","Thomas P.",""],["Bonnen","Tyler",""],["Friedman","Yoni",""],["Tewari","Ayush",""],["Tenenbaum","Josh B.",""],["Sitzmann","Vincent",""],["Kanwisher","Nancy",""]]}
{"id":"2308.11301","submitter":"Pallabi Manna Dr","authors":"Santanu Mandal, Pallabi Manna","title":"Intersection subgroup graph with forbidden subgraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by\nAnderson et al. \\cite{anderson}) is the simple graph $\\Gamma_{S}(G)$ whose\nvertices are those non-trivial subgroups say $H$ of $G$ with $H\\cap K=\\{e\\}$\nfor some non-trivial subgroup $K$ of $G$; two distinct vertices $H$ and $K$ are\nadjacent if and only if $H\\cap K=\\{e\\}$, where $e$ is the identity element of\n$G$. In this communication, we explore the groups whose intersection subgroup\ngraph belongs to several significant graph classes including cluster graphs,\nperfect graphs, cographs, chordal graphs, bipartite graphs, triangle-free and\nclaw-fee graphs. We categorize each nilpotent group $G$ so that $\\Gamma_S(G)$\nbelongs to the above classes. We entirely classify the simple group of Lie type\nwhose intersection subgroup graph is a cograph. Moreover, we deduce that\n$\\Gamma_{S}(G)$ is neither a cograph nor a chordal graph if $G$ is a\ntorsion-free nilpotent group.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:29:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mandal","Santanu",""],["Manna","Pallabi",""]]}
{"id":"2308.11302","submitter":"Quentin Gallea","authors":"Quentin Gallea","title":"From Mundane to Meaningful: AI's Influence on Work Dynamics -- evidence\n  from ChatGPT and Stack Overflow","comments":"17 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN cs.AI q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper illustrates how generative AI could give opportunities for big\nproductivity gains but also opens up questions about the impact of these new\npowerful technologies on the way we work and share knowledge. More\nspecifically, we explore how ChatGPT changed a fundamental aspect of coding:\nproblem-solving. To do so, we exploit the effect of the sudden release of\nChatGPT on the 30th of November 2022 on the usage of the largest online\ncommunity for coders: Stack Overflow. Using quasi-experimental methods\n(Difference-in-Difference), we find a significant drop in the number of\nquestions. In addition, the questions are better documented after the release\nof ChatGPT. Finally, we find evidence that the remaining questions are more\ncomplex. These findings suggest not only productivity gains but also a\nfundamental change in the way we work where routine inquiries are solved by AI\nallowing humans to focus on more complex tasks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:30:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gallea","Quentin",""]]}
{"id":"2308.11303","submitter":"Christopher Patrick","authors":"Christopher E. Patrick, Yixuan Huang, Laura H. Lewis and Julie B.\n  Staunton","title":"Theory of defect-induced crystal field perturbations in rare earth\n  magnets","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a theory describing the single-ion anisotropy of rare earth (RE)\nmagnets in the presence of point defects. Taking the RE-lean 1:12 magnet class\nas a prototype, we use first-principles calculations to show how the\nintroduction of Ti substitutions into SmFe$_{12}$ perturbs the crystal field,\ngenerating new coefficients due to the lower symmetry of the RE environment. We\nthen demonstrate that these perturbations can be described extremely\nefficiently using a screened point charge model. We provide analytical\nexpressions for the anisotropy energy which can be straightforwardly\nimplemented in atomistic spin dynamics simulations, meaning that such\nsimulations can be carried out for an arbitrary arrangement of point defects.\nThe significant crystal field perturbations calculated here demonstrate that a\nsample which is single-phase from a structural point of view can nonetheless\nhave a dramatically varying anisotropy profile at the atomistic level if there\nis compositional disorder, which may influence localized magnetic objects like\ndomain walls or skyrmions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:31:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Patrick","Christopher E.",""],["Huang","Yixuan",""],["Lewis","Laura H.",""],["Staunton","Julie B.",""]]}
{"id":"2308.11304","submitter":"David Ne\\v{c}as","authors":"David Ne\\v{c}as","title":"Self-consistent autocorrelation for finite-area bias correction in\n  roughness measurement","comments":"18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scan line levelling, a ubiquitous and often necessary step in AFM data\nprocessing, can cause a severe bias on measured roughness parameters such as\nmean square roughness or correlation length. This work exploits the observation\nthat the bias of autocorrelation function (ACF) is expressed in terms of the\nfunction itself, permitting a self-consistent formulation of the problem. Using\nthis formulation, two correction approaches are proposed, both with the aim to\nobtain convenient formulae which can be applied to practical correction. The\nfirst modifies standard analytical models of ACF to incorporate, in\nexpectation, the bias and thus match the bias of the data the models are used\nto fit. The second inverts the relation between true and estimated ACF to\nrealise a model-free correction.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:32:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ne\u010das","David",""]]}
{"id":"2308.11305","submitter":"Pavlo O. Dral","authors":"Lina Zhang, Yi-Fan Hou, Fuchun Ge, Pavlo O. Dral","title":"Energy-conserving molecular dynamics is not energy conserving","comments":null,"journal-ref":null,"doi":"10.1039/D3CP03515H","report-no":null,"categories":"physics.chem-ph physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Molecular dynamics (MD) is a widely-used tool for simulating the molecular\nand materials properties. It is a common wisdom that molecular dynamics\nsimulations should obey physical laws and, hence, lots of effort is put into\nensuring that molecular dynamics simulations are energy conserving. The\nemergence of machine learning (ML) potentials for MD leads to a growing\nrealization that monitoring conservation of energy during simulations is of low\nutility because the dynamics is often unphysically dissociative. Other ML\nmethods for MD are not based on a potential and provide only forces or\ntrajectories which are reasonable but not necessarily energy-conserving. Here\nwe propose to clearly distinguish between the simulation-energy and true-energy\nconservation and highlight that the simulations should focus on decreasing the\ndegree of true-energy non-conservation. We introduce very simple, new criteria\nfor evaluating the quality of molecular dynamics estimating the degree of\ntrue-energy non-conservation and we demonstrate their practical utility on an\nexample of infrared spectra simulations. These criteria are more important and\nintuitive than simply evaluating the quality of the ML potential energies and\nforces as is commonly done and can be applied universally, e.g., even for\ntrajectories with unknown or discontinuous potential energy. Such an approach\nintroduces new standards for evaluating MD by focusing on the true-energy\nconservation and can help in developing more accurate methods for simulating\nmolecular and materials properties.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:34:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Lina",""],["Hou","Yi-Fan",""],["Ge","Fuchun",""],["Dral","Pavlo O.",""]]}
{"id":"2308.11306","submitter":"Galina L. Klimchitskaya","authors":"Galina L. Klimchitskaya, Constantine C. Korikov, Vladimir M.\n  Mostepanenko and Oleg Yu. Tsybin","title":"Nonequilibrium Casimir-Polder Interaction Between Nanoparticles and\n  Substrates Coated with Gapped Graphene","comments":"20 pages, 7 figures","journal-ref":"Symmetry, v.15, N8, 1580 (2023)","doi":"10.3390/sym15081580","report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The out-of-thermal-equilibrium Casimir-Polder force between nanoparticles and\ndielectric substrates coated with gapped graphene is considered in the\nframework of the Dirac model using the formalism of the polarization tensor.\nThis is an example of physical phenomena violating the time-reversal symmetry.\nAfter presenting the main points of the used formalism, we calculate two\ncontributions to the Casimir-Polder force acting on a nanoparticle on the\nsource side of a fused silica glass substrate coated with gapped graphene,\nwhich is either cooler or hotter than the environment. The total nonequilibrium\nforce magnitudes are computed as a function of separation for different values\nof the energy gap and compared with those from an uncoated plate and with the\nequilibrium force in the presence of graphene coating. According to our\nresults, the presence of a substrate increases the magnitude of the\nnonequlibrium force. The force magnitude becomes larger with higher and smaller\nwith lower temperature of the graphene-coated substrate as compared to the\nequilibrium force at the environmental temperature. It is shown that with\nincreasing energy gap the magnitude of the nonequilibrium force becomes\nsmaller, and the graphene coating makes a lesser impact on the force acting on\na nanoparticle from the uncoated substrate. Possible applications of the\nobtained results are discussed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:35:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Klimchitskaya","Galina L.",""],["Korikov","Constantine C.",""],["Mostepanenko","Vladimir M.",""],["Tsybin","Oleg Yu.",""]]}
{"id":"2308.11307","submitter":"Qizheng He","authors":"Qizheng He and Zhean Xu","title":"Simple and Faster Algorithms for Knapsack","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we obtain a number of new simple pseudo-polynomial time\nalgorithms on the well-known knapsack problem, focusing on the running time\ndependency on the number of items $n$, the maximum item weight\n$w_\\mathrm{max}$, and the maximum item profit $p_\\mathrm{max}$. Our results\ninclude:\n  - An $\\widetilde{O}(n^{3/2}\\cdot \\min\\{w_\\mathrm{max},p_\\mathrm{max}\\})$-time\nrandomized algorithm for 0-1 knapsack, improving the previous\n$\\widetilde{O}(\\min\\{n w_\\mathrm{max} p_\\mathrm{max}^{2/3},n p_\\mathrm{max}\nw_\\mathrm{max}^{2/3}\\})$ [Bringmann and Cassis, ESA'23] for the small $n$ case.\n  - An $\\widetilde{O}(n+\\min\\{w_\\mathrm{max},p_\\mathrm{max}\\}^{5/2})$-time\nrandomized algorithm for bounded knapsack, improving the previous\n$O(n+\\min\\{w_\\mathrm{max}^3,p_\\mathrm{max}^3\\})$ [Polak, Rohwedder and\nWegrzyck, ICALP'21].\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:36:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Qizheng",""],["Xu","Zhean",""]]}
{"id":"2308.11308","submitter":"Irina Heinz","authors":"Irina Heinz, Adam R. Mills, Jason R. Petta and Guido Burkard","title":"Analysis and mitigation of residual exchange coupling in linear spin\n  qubit arrays","comments":"15 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent advancements of quantum computing utilizing spin qubits, it has\nbeen demonstrated that this platform possesses the potential for implementing\ntwo-qubit gates with fidelities exceeding 99.5%. However, as with other qubit\nplatforms, it is not feasible to completely turn qubit couplings off. This\nstudy aims to investigate the impact of coherent error matrices in gate set\ntomography by employing a double quantum dot. We evaluate the infidelity caused\nby residual exchange between spins and compare various mitigation approaches,\nincluding the use of adjusted timing through simple drives, considering\ndifferent parameter settings in the presence of charge noise. Furthermore, we\nextend our analysis to larger arrays of exchange-coupled spin qubits to provide\nan estimation of the expected fidelity. In particular, we demonstrate the\ninfluence of residual exchange on a single-qubit $Y$ gate and the native\ntwo-qubit SWAP gate in a linear chain. Our findings emphasize the significance\nof accounting for residual exchange when scaling up spin qubit devices and\nhighlight the tradeoff between the effects of charge noise and residual\nexchange in mitigation techniques.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:37:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Heinz","Irina",""],["Mills","Adam R.",""],["Petta","Jason R.",""],["Burkard","Guido",""]]}
{"id":"2308.11309","submitter":"Maur\\'icio Moreira-Soares","authors":"Maur\\'icio Moreira-Soares, Eduardo Mossmann, Rui D. M. Travasso and\n  Jos\\'e Rafael Bordin","title":"TrajPy: empowering feature engineering for trajectory analysis across\n  domains","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM physics.bio-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Trajectories, sequentially measured quantities that form a path, are an\nimportant presence in many different fields, from hadronic beams in physics to\nelectrocardiograms in medicine. Trajectory anal-ysis requires the\nquantification and classification of curves either using statistical\ndescriptors or physics-based features. To date, there is no extensive and\nuser-friendly package for trajectory anal-ysis available, despite its\nimportance and potential application across domains. We developed a free\nopen-source python package named TrajPy as a complementary tool to empower\ntrajectory analysis. The package showcases a friendly graphic user interface\nand provides a set of physical descriptors that help characterizing these\nintricate structures. In combina-tion with image analysis, it was already\nsuccessfully applied to the study of mitochondrial motility in neuroblastoma\ncell lines and to the analysis of in silico models for cell migration. The\nTrajPy package was developed in Python 3 and released under the GNU GPL-3\nlicense. Easy installation is available through PyPi and the development source\ncode can be found in the repository https://github.com/ocbe-uio/TrajPy/. The\npackage release is automatically archived under the DOI 10.5281/zenodo.3656044.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:37:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Moreira-Soares","Maur\u00edcio",""],["Mossmann","Eduardo",""],["Travasso","Rui D. M.",""],["Bordin","Jos\u00e9 Rafael",""]]}
{"id":"2308.11310","submitter":"Marcin Marculewicz","authors":"Marcin Marculewicz, Mouyuan Sun, Jianfeng Wu, and Zhixiang Zhang","title":"The disk reverberation mapping of X-ray weak quasars: a case study of\n  SDSS J153913.47+395423.4","comments":"10 pages, 4 figures, accepted for publication in the Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The widely adopted ``lamppost'' thermal reprocessing model, in which the\nvariable UV/optical emission is a result of the accretion disk reprocessing of\nthe highly fluctuating X-ray emission, can be tested by measuring inter-band\ntime lags in quasars spanning a range of X-ray power. This work reports the\ninter-band time lag in an apparently X-ray weak quasar, SDSS\nJ153913.47+395423.4. A significant cross-correlation with a time delay of $\\sim\n33$ days (observed-frame) is detected in the Zwicky Transient Facility (ZTF)\n$g$ and $r$ light curves of SDSS J153913.47+395423.4. The observed X-ray power\nseems to be too weak to account for the observed inter-band cross-correlation\nwith time delay. Hence the X-ray weak quasar SDSS J153913.47+395423.4 is either\nintrinsically X-ray normal (but observationally X-ray weak), or the X-ray\nemission is not the only mechanism to drive UV/optical variability. In the\nformer case, the required X-ray power is at least 19 times stronger than\nobserved, which requires either an exceptionally anisotropic corona or\nCompton-thick obscuration. Alternatively, the Corona-heated Accretion disk\nReprocessing (CHAR) or the EUV torus models may account for the observed time\nlags.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:40:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Marculewicz","Marcin",""],["Sun","Mouyuan",""],["Wu","Jianfeng",""],["Zhang","Zhixiang",""]]}
{"id":"2308.11311","submitter":"Pavlo O. Dral","authors":"Fuchun Ge, Lina Zhang, Yi-Fan Hou, Yuxinxin Chen, Arif Ullah, Pavlo O.\n  Dral","title":"Four-Dimensional-Spacetime Atomistic Artificial Intelligence Models","comments":null,"journal-ref":null,"doi":"10.1021/acs.jpclett.3c01592","report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We demonstrate that AI can learn atomistic systems in the four-dimensional\n(4D) spacetime. For this, we introduce the 4D-spacetime GICnet model which for\nthe given initial conditions - nuclear positions and velocities at time zero -\ncan predict nuclear positions and velocities as a continuous function of time\nup to the distant future. Such models of molecules can be unrolled in the time\ndimension to yield long-time high-resolution molecular dynamics trajectories\nwith high efficiency and accuracy. 4D-spacetime models can make predictions for\ndifferent times in any order and do not need a stepwise evaluation of forces\nand integration of the equations of motions at discretized time steps, which is\na major advance over the traditional, cost-inefficient molecular dynamics.\nThese models can be used to speed up dynamics, simulate vibrational spectra,\nand obtain deeper insight into nuclear motions as we demonstrate for a series\nof organic molecules.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:40:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ge","Fuchun",""],["Zhang","Lina",""],["Hou","Yi-Fan",""],["Chen","Yuxinxin",""],["Ullah","Arif",""],["Dral","Pavlo O.",""]]}
{"id":"2308.11312","submitter":"Dong Wen Mr.","authors":"Dong Wen, Tao Li, Chenglong Li, Pengye Xia, Hui Yang, Zhigang Sun","title":"Octopus: A Heterogeneous In-network Computing Accelerator Enabling Deep\n  Learning for network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning (DL) for network models have achieved excellent performance in\nthe field and are becoming a promising component in future intelligent network\nsystem. Programmable in-network computing device has great potential to deploy\nDL for network models, however, existing device cannot afford to run a DL\nmodel. The main challenges of data-plane supporting DL-based network models lie\nin computing power, task granularity, model generality and feature extracting.\n  To address above problems, we propose Octopus: a heterogeneous in-network\ncomputing accelerator enabling DL for network models. A feature extractor is\ndesigned for fast and efficient feature extracting. Vector accelerator and\nsystolic array work in a heterogeneous collaborative way, offering\nlow-latency-highthroughput general computing ability for packet-and-flow-based\ntasks. Octopus also contains on-chip memory fabric for storage and connecting,\nand Risc-V core for global controlling. The proposed Octopus accelerator design\nis implemented on FPGA. Functionality and performance of Octopus are validated\nin several use-cases, achieving performance of 31Mpkt/s feature extracting,\n207ns packet-based computing latency, and 90kflow/s flow-based computing\nthroughput.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:42:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wen","Dong",""],["Li","Tao",""],["Li","Chenglong",""],["Xia","Pengye",""],["Yang","Hui",""],["Sun","Zhigang",""]]}
{"id":"2308.11313","submitter":"Mathieu Lamoureux","authors":"Mathieu Lamoureux (1) and Gwenha\\\"el de Wasseige (1) ((1) Centre for\n  Cosmology, Particle Physics and Phenomenology - CP3, Universit\\'e Catholique\n  de Louvain, B-1348 Louvain-la-Neuve, Belgium)","title":"Identification of time-correlated neutrino clusters in populations of\n  astrophysical transient sources","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  8 pages, 4 figures","journal-ref":null,"doi":"10.22323/1.444.1507","report-no":"PoS-ICRC2023-1507","categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The detection of astrophysical neutrinos from transient sources can help to\nunderstand the origin of the neutrino diffuse flux and to constrain the\nunderlying production mechanisms. In particular, proton-neutron collisions may\nproduce GeV neutrinos. However, at these energies, neutrino data from large\nwater Cherenkov telescopes, like KM3NeT and IceCube, are dominated by the\nwell-known atmospheric neutrino flux. It is then necessary to identify a\nsub-dominant component due to an astrophysical emission based on time\ncorrelation across messengers. The contribution covers several methods to\nsearch for such a signal in short time windows centered on observed transient\nsources, including a novel approach based on the distribution of time\ndifferences. Their performance is compared in the context of subpopulations of\nastrophysical sources that may show prompt or delayed neutrino emissions. The\noutlook for the usage of such techniques in actual analyses is also presented.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:48:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lamoureux","Mathieu",""],["de Wasseige","Gwenha\u00ebl",""]]}
{"id":"2308.11314","submitter":"Christian Wald","authors":"Christian Wald, Gabriele Steidl","title":"A Study of Particle Motion in the Presence of Clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The motivation for this study came from the task of analysing the kinetic\nbehavior of single molecules in a living cell based on Single Molecule\nLocalization Microscopy. Given measurements of both the motion of clusters and\nmolecules, the main task consists in detecting if a molecule belongs to a\ncluster. While the exact size of the clusters is usually unknown, upper bounds\nare available. In this study, we simulate the cluster movement by a Brownian\nmotion and those of the particles by a Gaussian mixture model with two modes\ndepending on the position of the particle within or outside a cluster. We\npropose various variational models to detect if a particle lies within a\ncluster based on the Wasserstein and maximum mean discrepancy distances between\nmeasures. We compare the performance of the proposed models for simulated data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:49:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wald","Christian",""],["Steidl","Gabriele",""]]}
{"id":"2308.11315","submitter":"Xi Tong","authors":"Sadra Jazayeri, S\\'ebastien Renaux-Petel, Xi Tong, Denis Werth and\n  Yuhang Zhu","title":"Parity Violation from Emergent Non-Locality During Inflation","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.CO gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parity violation in the early universe holds great promise for uncovering new\nphysics. In particular, the primordial scalar four-point correlation function\nis allowed to develop a parity-violating component when massive spinning\nparticles coupled to a helical chemical potential are present during inflation.\nIn this paper, we explore the rich physics of such a parity-violating\ntrispectrum in the presence of a reduced speed of sound for the Goldstone boson\nof broken time translations. We show that this signal can be significantly\nlarge while remaining under perturbative control, offering promising\nobservational prospects for future cosmological surveys. In the limit of a\nreduced sound speed, the dynamics admits an effective non-local description\norganized as a time-derivative expansion. This reveals that parity violation\narises due to emergent non-locality in the single-field effective theory. At\nleading order, this effective theory yields a compact trispectrum template,\nwritten in terms of elementary functions. We then conduct a comprehensive\nanalysis of the kinematic dependence of this parity-violating trispectrum and\nreveal new features. In addition to the low-speed collider resonance, we find a\nnew class of signals lying in the internal soft-limit of the correlator. This\nsignal is characterized by an oscillatory pattern periodic in the momentum\nratio, with a frequency determined by the speed of sound and the chemical\npotential, making it drastically distinct from the conventional cosmological\ncollider signal.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:49:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jazayeri","Sadra",""],["Renaux-Petel","S\u00e9bastien",""],["Tong","Xi",""],["Werth","Denis",""],["Zhu","Yuhang",""]]}
{"id":"2308.11316","submitter":"Attila Lengyel","authors":"Tom Edixhoven, Attila Lengyel, Jan van Gemert","title":"Using and Abusing Equivariance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper we show how Group Equivariant Convolutional Neural Networks use\nsubsampling to learn to break equivariance to their symmetries. We focus on 2D\nrotations and reflections and investigate the impact of broken equivariance on\nnetwork performance. We show that a change in the input dimension of a network\nas small as a single pixel can be enough for commonly used architectures to\nbecome approximately equivariant, rather than exactly. We investigate the\nimpact of networks not being exactly equivariant and find that approximately\nequivariant networks generalise significantly worse to unseen symmetries\ncompared to their exactly equivariant counterparts. However, when the\nsymmetries in the training data are not identical to the symmetries of the\nnetwork, we find that approximately equivariant networks are able to relax\ntheir own equivariant constraints, causing them to match or outperform exactly\nequivariant networks on common benchmark datasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:49:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Edixhoven","Tom",""],["Lengyel","Attila",""],["van Gemert","Jan",""]]}
{"id":"2308.11317","submitter":"Raj Prince","authors":"Raj Prince, Anuvab Banerjee, Ajay Sharma, Avik Kumar das, Alok C.\n  Gupta, and Debanjan Bose","title":"Quasi-periodic oscillation detected in $\\gamma$-rays in blazar PKS\n  0346-27","comments":"7 pages, 4 figures, Accepted for publication in A&A, in Press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a variability study of the blazar PKS 0346-27 from December 2018\nto January 2022 in its archival $\\gamma$-ray observation by Fermi-LAT. We use\nthe Lomb-Scargle periodogram and the weighted wavelet transform methods in\norder to detect the presence of periodicity/quasi-periodicity and localize this\nfeature in time and frequency space. The significance of the periodicity\nfeature has been estimated using the Monte-Carlo simulation approach. We have\nalso determined the global significance of the periodicity to test the\nrobustness of our claim. To explore the most probable scenario, we modeled the\nlight curve with both a straight jet and a curved jet model. We detect a\nperiodicity feature of $\\sim$ 100 days duration for the entire period of\nobservation with a statistical significance of $3\\sigma$, which amounts to a\n99.7\\% confidence level. The global significance of this feature is found to be\n96.96\\%. Based on the Akaike Information Criteria, the most probable\nexplanation is that the observed emission is enhanced due to the helical motion\nof a blob within a curved jet. The origin of this QPO is very likely a region\nof enhanced emission moving helically inside a curved jet. This work presents\nstrong evidence for jet curvature in the source and an independent (albeit a\nlittle serendipitous) procedure to estimate the curvature in blazar jets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:50:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Prince","Raj",""],["Banerjee","Anuvab",""],["Sharma","Ajay",""],["das","Avik Kumar",""],["Gupta","Alok C.",""],["Bose","Debanjan",""]]}
{"id":"2308.11318","submitter":"Silke Buehler-Paschen","authors":"Diana M. Kirschbaum, Monika Lu\\v{z}nik, Gwenvredig Le Roy, Silke\n  Paschen","title":"How to identify and characterize strongly correlated topological\n  semimetals","comments":"22 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  How strong correlations and topology interplay is a topic of great current\ninterest. In this perspective paper, we focus on correlation-driven gapless\nphases. We take the time-reversal symmetric Weyl semimetal as an example\nbecause it is expected to have clear (albeit nonquantized) topological\nsignatures in the Hall response and because the first strongly correlated\nrepresentative, the noncentrosymmetric Weyl-Kondo semimetal Ce$_3$Bi$_4$Pd$_3$,\nhas recently been discovered. We summarize its key characteristics and use them\nto construct a prototype Weyl-Kondo semimetal temperature-magnetic field phase\ndiagram. This allows for a substantiated assessment of other Weyl-Kondo\nsemimetal candidate materials. We also put forward scaling plots of the\nintrinsic Berry-curvature-induced Hall response vs the inverse Weyl velocity --\na measure of correlation strength, and vs the inverse charge carrier\nconcentration -- a measure of the proximity of Weyl nodes to the Fermi level.\nThey suggest that the topological Hall response is maximized by strong\ncorrelations and small carrier concentrations. We hope that our work will guide\nthe search for new Weyl-Kondo semimetals and correlated topological semimetals\nin general, and also trigger new theoretical work.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:51:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kirschbaum","Diana M.",""],["Lu\u017enik","Monika",""],["Roy","Gwenvredig Le",""],["Paschen","Silke",""]]}
{"id":"2308.11319","submitter":"Evgeni Bezus","authors":"Artem I. Kashapov, Leonid L. Doskolovich, Evgeni A. Bezus, Dmitry A.\n  Bykov and Victor A. Soifer","title":"On-chip spatiotemporal optical vortex generation using an integrated\n  metal-dielectric resonator","comments":"14 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We theoretically demonstrate the possibility of generating a spatiotemporal\noptical vortex (STOV) beam in a dielectric slab waveguide. The STOV is\ngenerated upon reflection of a spatiotemporal optical pulse from an integrated\nmetal-dielectric structure consisting of metal strips \"buried\" in the\nwaveguide. For describing the interaction of the incident pulse with the\nintegrated structure, we derive its \"vectorial\" spatiotemporal transfer\nfunction (TF) describing the transformation of the electromagnetic field\ncomponents of the incident pulse. We show that if the TF of the structure\ncorresponds to the TF of a spatiotemporal differentiator with a $\\pi/2$ phase\ndifference between the terms describing temporal and spatial differentiation,\nthen the envelope of the reflected pulse will contain an STOV in all nonzero\ncomponents of the electromagnetic field. The obtained theoretical results are\nin good agreement with the results of rigorous numerical simulation of the STOV\ngeneration using a three-strip metal-dielectric integrated structure. We\nbelieve that the presented results pave the way for the research and\napplication of STOV beams in the on-chip geometry.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:51:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kashapov","Artem I.",""],["Doskolovich","Leonid L.",""],["Bezus","Evgeni A.",""],["Bykov","Dmitry A.",""],["Soifer","Victor A.",""]]}
{"id":"2308.11320","submitter":"Mohsen Razavi","authors":"Shradhanjali Sahu, Ahmed Lawey, and Mohsen Razavi","title":"Continuous Variable Quantum Key Distribution in Multiple-Input\n  Multiple-Output Settings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate quantum key distribution (QKD) in optical\nmultiple-input-multiple-output (MIMO) settings. Such settings can prove useful\nin dealing with harsh channel conditions as in, e.g., satellite-based QKD. We\nstudy a $2\\times2$ setting for continuous variable (CV) QKD with Gaussian\nencoding and heterodyne detection and reverse reconciliation. We present our\nkey rate analysis for this system and compare it with single-mode and\nmultiplexed CV QKD scenarios. We show that we can achieve multiplexing gain\nusing multiple transmitters and receivers even if there is some crosstalk\nbetween the two channels. In certain cases, when there is nonzero correlated\nexcess noise in the two received signals, we can even surpass the multiplexing\ngain.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:52:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sahu","Shradhanjali",""],["Lawey","Ahmed",""],["Razavi","Mohsen",""]]}
{"id":"2308.11321","submitter":"Jiuyu Liu","authors":"Jiuyu Liu and Yi Ma and Rahim Tafazolli","title":"Alternative Normalized-Preconditioning for Scalable Iterative Large-MIMO\n  Detection","comments":"Accepted by IEEE GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Signal detection in large multiple-input multiple-output (large-MIMO) systems\npresents greater challenges compared to conventional massive-MIMO for two\nprimary reasons. First, large-MIMO systems lack favorable propagation\nconditions as they do not require a substantially greater number of service\nantennas relative to user antennas. Second, the wireless channel may exhibit\nspatial non-stationarity when an extremely large aperture array (ELAA) is\ndeployed in a large-MIMO system. In this paper, we propose a scalable iterative\nlarge-MIMO detector named ANPID, which simultaneously delivers 1) close to\nmaximum-likelihood detection performance, 2) low computational-complexity\n(i.e., square-order of transmit antennas), 3) fast convergence, and 4)\nrobustness to the spatial non-stationarity in ELAA channels. ANPID incorporates\na damping demodulation step into stationary iterative (SI) methods and\nalternates between two distinct demodulated SI methods. Simulation results\ndemonstrate that ANPID fulfills all the four features concurrently and\noutperforms existing low-complexity MIMO detectors, especially in highly-loaded\nlarge MIMO systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:52:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Jiuyu",""],["Ma","Yi",""],["Tafazolli","Rahim",""]]}
{"id":"2308.11322","submitter":"Xin Li","authors":"Xin Li, Yuqing Huang, Zhenyu He, Yaowei Wang, Huchuan Lu, Ming-Hsuan\n  Yang","title":"CiteTracker: Correlating Image and Text for Visual Tracking","comments":"accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing visual tracking methods typically take an image patch as the\nreference of the target to perform tracking. However, a single image patch\ncannot provide a complete and precise concept of the target object as images\nare limited in their ability to abstract and can be ambiguous, which makes it\ndifficult to track targets with drastic variations. In this paper, we propose\nthe CiteTracker to enhance target modeling and inference in visual tracking by\nconnecting images and text. Specifically, we develop a text generation module\nto convert the target image patch into a descriptive text containing its class\nand attribute information, providing a comprehensive reference point for the\ntarget. In addition, a dynamic description module is designed to adapt to\ntarget variations for more effective target representation. We then associate\nthe target description and the search image using an attention-based\ncorrelation module to generate the correlated features for target state\nreference. Extensive experiments on five diverse datasets are conducted to\nevaluate the proposed algorithm and the favorable performance against the\nstate-of-the-art methods demonstrates the effectiveness of the proposed\ntracking method.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:53:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Xin",""],["Huang","Yuqing",""],["He","Zhenyu",""],["Wang","Yaowei",""],["Lu","Huchuan",""],["Yang","Ming-Hsuan",""]]}
{"id":"2308.11323","submitter":"Gast\\'on Creci","authors":"Gast\\'on Creci, Tanja Hinderer and Jan Steinhoff","title":"Tidal properties of neutron stars in scalar-tensor theories of gravity","comments":"v1, 40 pages, 27 figures, feedback is welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A major science goal of gravitational-wave (GW) observations is to probe the\nnature of gravity and constrain modifications to General Relativity. An\nestablished class of modified gravity theories are scalar-tensor models, which\nintroduce an extra scalar degree of freedom. This affects the internal\nstructure of neutron stars (NSs), as well as their dynamics and GWs in binary\nsystems, where distinct novel features can arise from the appearance of scalar\ncondensates in parts of the parameter space. To improve the robustness of the\nanalyses of such GW events requires advances in modeling\ninternal-structure-dependent phenomena in scalar-tensor theories. We develop an\neffective description of potentially scalarized NSs on large scales, where\ninformation about the interior is encoded in characteristic Love numbers or\nequivalently tidal deformabilities. We demonstrate that three independent tidal\ndeformabilities are needed to characterize the configurations: a scalar,\ntensor, and a novel 'mixed' parameter, and develop the general methodology to\ncompute these quantities. We also present case studies for different NS\nequations of state and scalar properties and provide the mapping between the\ndeformabilities in different frames often used for calculations. Our results\nhave direct applications for future GW tests of gravity and studies of\npotential degeneracies with other uncertain physics such as the equation of\nstate or presence of dark matter in NS binary systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:55:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Creci","Gast\u00f3n",""],["Hinderer","Tanja",""],["Steinhoff","Jan",""]]}
{"id":"2308.11324","submitter":"Luca Buoninfante","authors":"Luca Buoninfante","title":"Massless and Partially Massless Limits in Quadratic Gravity","comments":"34 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the context of perturbative quantum field theory, the addition of\nquadratic-curvature invariants to the Einstein-Hilbert action makes it possible\nto achieve strict renormalizability in four dimensions. The additional terms\n$R^2$ and $C_{\\mu\\nu\\rho\\sigma} C^{\\mu\\nu\\rho\\sigma}$ are multiplied by\ndimensionless coefficients that are related to the masses of the extra\ngravitational degrees of freedom and to the interaction couplings. The aim of\nthis paper is to study the limit of the theory in which the Weyl-squared\ncoefficient tends to infinity. Remarkably, the result of this limit turns out\nto be sensitive to the presence of a cosmological constant: when the latter is\nzero we have a massless limit for the spin-2 ghost, while when the cosmological\nconstant is different from zero we obtain a partially massless limit. We show\nthat the renormalizability property and the ghost-like nature of the massive\nspin-$2$ field ensure that the two limits do not hit strong couplings, unlike\nstandard ghost-free theories of massive gravity. In particular, in the\npartially massless limit the interactions mediated by the spin-$2$ sector\nvanish. We argue that our results can be useful for understanding the\nhigh-energy limit of Quadratic Gravity.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:56:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Buoninfante","Luca",""]]}
{"id":"2308.11325","submitter":"Miguel Dovale \\'Alvarez","authors":"Victor Huarcaya, Miguel Dovale \\'Alvarez, Daniel Penkert, Stefano\n  Gozzo, Pablo Mart\\'inez Cano, Kohei Yamamoto, Juan Jos\\'e Esteban Delgado,\n  Moritz Mehmet, Karsten Danzmann, Gerhard Heinzel","title":"$2\\cdot 10^{-13}$ fractional laser frequency stability with a 7-cm\n  unequal-arm Mach-Zehnder interferometer","comments":"9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To achieve sub-picometer sensitivities in the millihertz band, laser\ninterferometric inertial sensors rely on some form of reduction of the laser\nfrequency noise, typically by locking the laser to a stable frequency\nreference, such as the narrow-linewidth resonance of an ultra-stable optical\ncavity or an atomic or molecular transition. In this paper we report on a\ncompact laser frequency stabilization technique based on an unequal-arm\nMach-Zehnder interferometer that is sub-nanometer stable at $10\\,\\mu$Hz,\nsub-picometer at $0.5\\,$mHz, and reaches a noise floor of\n$7\\,\\mathrm{fm}/\\!\\sqrt{\\mathrm{Hz}}$ at 1 Hz. The interferometer is used in\nconjunction with a DC servo to stabilize the frequency of a laser down to a\nfractional instability below $4 \\times 10^{-13}$ at averaging times from 0.1 to\n100 seconds. The technique offers a wide operating range, does not rely on\ncomplex lock acquisition procedures, and can be readily integrated as part of\nthe optical bench in future gravity missions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:58:37 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 10:11:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huarcaya","Victor",""],["\u00c1lvarez","Miguel Dovale",""],["Penkert","Daniel",""],["Gozzo","Stefano",""],["Cano","Pablo Mart\u00ednez",""],["Yamamoto","Kohei",""],["Delgado","Juan Jos\u00e9 Esteban",""],["Mehmet","Moritz",""],["Danzmann","Karsten",""],["Heinzel","Gerhard",""]]}
{"id":"2308.11326","submitter":"Diana Vaman","authors":"Yuchen Du and Diana Vaman","title":"Tree-level Graviton Scattering in the Worldline Formalism","comments":"63 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the worldline formalism to study tree-level scattering processes\ninvolving gravitons. A massless spin 2 particle is described by an $N=4$\nsupersymmetric worldline action which is also $O(4)$ symmetric. More generally,\n$N=2S$ supersymmetric worldline actions exhibiting $O(N)$ symmetry describe\nfree spin $S$ particles. Recently a BRST approach was used to construct the\non-shell background graviton emission vertex from a graviton worldline.\nNonetheless, an action describing the coupling of higher spin ($S\\geq 2$)\nparticles with generic background gravity is unknown. In this paper, we found\nthat in order to reproduce Einstein's general relativity 3-point graviton\nvertex, interpreted as the emission of an off-shell graviton from the\nworldline, the coupling to background gravity must break the $O(4)$ symmetry to\n$O(2) \\times O(2)$. In addition to this symmetry-breaking feature, we also\nfound that the coefficient $\\beta$ of the worldline action counterterm $\\beta\nR$ differs from previous results in the literature. By comparing the linearized\ngraviton and photon emission vertex operators from different worldlines, we\nnoticed that they obey a squaring relation. For MHV (Maximal Helicity\nViolating) amplitudes, these squaring relations among the linearized vertex\noperators directly result in double-copy-like relations between the scattering\namplitudes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:59:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Du","Yuchen",""],["Vaman","Diana",""]]}
{"id":"2308.11327","submitter":"Bingqing Zhang","authors":"Bingqing Zhang, Sen Wang, Yifan Liu, Brano Kusy, Xue Li and Jiajun Liu","title":"Object Detection Difficulty: Suppressing Over-aggregation for Faster and\n  Better Video Object Detection","comments":"11 pages, 6 figures, accepted by ACM MM2023","journal-ref":null,"doi":"10.1145/3581783.3612090","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current video object detection (VOD) models often encounter issues with\nover-aggregation due to redundant aggregation strategies, which perform feature\naggregation on every frame. This results in suboptimal performance and\nincreased computational complexity. In this work, we propose an image-level\nObject Detection Difficulty (ODD) metric to quantify the difficulty of\ndetecting objects in a given image. The derived ODD scores can be used in the\nVOD process to mitigate over-aggregation. Specifically, we train an ODD\npredictor as an auxiliary head of a still-image object detector to compute the\nODD score for each image based on the discrepancies between detection results\nand ground-truth bounding boxes. The ODD score enhances the VOD system in two\nways: 1) it enables the VOD system to select superior global reference frames,\nthereby improving overall accuracy; and 2) it serves as an indicator in the\nnewly designed ODD Scheduler to eliminate the aggregation of frames that are\neasy to detect, thus accelerating the VOD process. Comprehensive experiments\ndemonstrate that, when utilized for selecting global reference frames, ODD-VOD\nconsistently enhances the accuracy of Global-frame-based VOD models. When\nemployed for acceleration, ODD-VOD consistently improves the frames per second\n(FPS) by an average of 73.3% across 8 different VOD models without sacrificing\naccuracy. When combined, ODD-VOD attains state-of-the-art performance when\ncompeting with many VOD methods in both accuracy and speed. Our work represents\na significant advancement towards making VOD more practical for real-world\napplications.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:59:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Bingqing",""],["Wang","Sen",""],["Liu","Yifan",""],["Kusy","Brano",""],["Li","Xue",""],["Liu","Jiajun",""]]}
{"id":"2308.11328","submitter":"Felicitas H\\\"ormann","authors":"Felicitas H\\\"ormann and Hannes Bartz","title":"Fast Gao-like Decoding of Horizontally Interleaved Linearized\n  Reed-Solomon Codes","comments":"21 pages, 1 figure, published in the proceedings of CBCrypto 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Both horizontal interleaving as well as the sum-rank metric are currently\nattractive topics in the field of code-based cryptography, as they could\nmitigate the problem of large key sizes. In contrast to vertical interleaving,\nwhere codewords are stacked vertically, each codeword of a horizontally\n$s$-interleaved code is the horizontal concatenation of $s$ codewords of $s$\ncomponent codes. In the case of horizontally interleaved linearized\nReed-Solomon (HILRS) codes, these component codes are chosen to be linearized\nReed-Solomon (LRS) codes.\n  We provide a Gao-like decoder for HILRS codes that is inspired by the\nrespective works for non-interleaved Reed-Solomon and Gabidulin codes. By\napplying techniques from the theory of minimal approximant bases, we achieve a\ncomplexity of $\\tilde{\\mathcal{O}}(s^{2.373} n^{1.635})$ operations in\n$\\mathbb{F}_{q^m}$, where $\\tilde{\\mathcal{O}}(\\cdot)$ neglects logarithmic\nfactors, $s$ is the interleaving order and $n$ denotes the length of the\ncomponent codes. For reasonably small interleaving order $s \\ll n$, this is\nsubquadratic in the component-code length $n$ and improves over the only known\nsyndrome-based decoder for HILRS codes with quadratic complexity. Moreover, it\ncloses the performance gap to vertically interleaved LRS codes for which a\ndecoder of complexity $\\tilde{\\mathcal{O}}(s^{2.373} n^{1.635})$ is already\nknown.\n  We can decode beyond the unique-decoding radius and handle errors of sum-rank\nweight up to $\\frac{s}{s + 1} (n - k)$ for component-code dimension $k$. We\nalso give an upper bound on the failure probability in the zero-derivation\nsetting and validate its tightness via Monte Carlo simulations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:59:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["H\u00f6rmann","Felicitas",""],["Bartz","Hannes",""]]}
{"id":"2308.11329","submitter":"Chuer Chen","authors":"Chuer Chen, Nan Cao, Jiani Hou, Yi Guo, Yulei Zhang, Yang Shi","title":"MusicJam: Visualizing Music Insights via Generated Narrative\n  Illustrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visualizing the insights of the invisible music is able to bring listeners an\nenjoyable and immersive listening experience, and therefore has attracted much\nattention in the field of information visualization. Over the past decades,\nvarious music visualization techniques have been introduced. However, most of\nthem are manually designed by following the visual encoding rules, thus shown\nin form of a graphical visual representation whose visual encoding schema is\nusually taking effort to understand. Recently, some researchers use figures or\nillustrations to represent music moods, lyrics, and musical features, which are\nmore intuitive and attractive. However, in these techniques, the figures are\nusually pre-selected or statically generated, so they cannot precisely convey\ninsights of different pieces of music. To address this issue, in this paper, we\nintroduce MusicJam, a music visualization system that is able to generate\nnarrative illustrations to represent the insight of the input music. The system\nleverages a novel generation model designed based on GPT-2 to generate\nmeaningful lyrics given the input music and then employs the stable diffusion\nmodel to transform the lyrics into coherent illustrations. Finally, the\ngenerated results are synchronized and rendered as an MP4 video accompanied by\nthe input music. We evaluated the proposed lyric generation model by comparing\nit to the baseline models and conducted a user study to estimate the quality of\nthe generated illustrations and the final music videos. The results showed the\npower of our technique.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:03:42 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 08:17:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Chuer",""],["Cao","Nan",""],["Hou","Jiani",""],["Guo","Yi",""],["Zhang","Yulei",""],["Shi","Yang",""]]}
{"id":"2308.11330","submitter":"Nabin Kumar Sahu","authors":"Nabin Kumar Sahu and Vishesh Rajput","title":"Dynamical Representation of Frames in Tensor Product of Hardy Spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamical Sampling of frames and tensor products are important topics in\nharmonic analysis. This paper combines the concepts of dynamical sampling of\nframes and the Carleson condition in the tensor product of Hardy spaces.\nInitially we discuss the preservation of the frame property under the tensor\nproduct on the Hilbert spaces. Then we discuss the iterative representation of\nframes in tensor product of Hardy spaces. The key ingredient of this paper is\nthe so-called Carleson condition on the sequence $\\{ \\lambda_k\n\\}_{k=1}^{\\infty} \\otimes\\{ \\gamma_l \\}_{l=1}^{\\infty} $ in the open unit disc\n$\\mathbb{D}_1 \\otimes \\mathbb{D}_2$. Our proof is motivated by the result of\nShapiro and Shields.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:04:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sahu","Nabin Kumar",""],["Rajput","Vishesh",""]]}
{"id":"2308.11331","submitter":"Xinchi Deng","authors":"Xinchi Deng, Han Shi, Runhui Huang, Changlin Li, Hang Xu, Jianhua Han,\n  James Kwok, Shen Zhao, Wei Zhang, Xiaodan Liang","title":"GrowCLIP: Data-aware Automatic Model Growing for Large-scale Contrastive\n  Language-Image Pre-training","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-modal pre-training has shown impressive performance on a wide range of\ndownstream tasks, benefiting from massive image-text pairs collected from the\nInternet. In practice, online data are growing constantly, highlighting the\nimportance of the ability of pre-trained model to learn from data that is\ncontinuously growing. Existing works on cross-modal pre-training mainly focus\non training a network with fixed architecture. However, it is impractical to\nlimit the model capacity when considering the continuously growing nature of\npre-training data in real-world applications. On the other hand, it is\nimportant to utilize the knowledge in the current model to obtain efficient\ntraining and better performance. To address the above issues, in this paper, we\npropose GrowCLIP, a data-driven automatic model growing algorithm for\ncontrastive language-image pre-training with continuous image-text pairs as\ninput. Specially, we adopt a dynamic growth space and seek out the optimal\narchitecture at each growth step to adapt to online learning scenarios. And the\nshared encoder is proposed in our growth space to enhance the degree of\ncross-modal fusion. Besides, we explore the effect of growth in different\ndimensions, which could provide future references for the design of cross-modal\nmodel architecture. Finally, we employ parameter inheriting with momentum (PIM)\nto maintain the previous knowledge and address the issue of the local minimum\ndilemma. Compared with the existing methods, GrowCLIP improves 2.3% average\ntop-1 accuracy on zero-shot image classification of 9 downstream tasks. As for\nzero-shot image retrieval, GrowCLIP can improve 1.2% for top-1 image-to-text\nrecall on Flickr30K dataset.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:07:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Deng","Xinchi",""],["Shi","Han",""],["Huang","Runhui",""],["Li","Changlin",""],["Xu","Hang",""],["Han","Jianhua",""],["Kwok","James",""],["Zhao","Shen",""],["Zhang","Wei",""],["Liang","Xiaodan",""]]}
{"id":"2308.11332","submitter":"Matthias Wagener","authors":"Matthias Wagener, Andriette Bekker, Mohammad Arashi, and Antonio Punzo","title":"Uncovering a generalised gamma distribution: from shape to\n  interpretation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce the flexible interpretable gamma (FIG)\ndistribution which has been derived by Weibullisation of the body-tail\ngeneralised normal distribution. The parameters of the FIG have been verified\ngraphically and mathematically as having interpretable roles in controlling the\nleft-tail, body, and right-tail shape. The generalised gamma (GG) distribution\nhas become a staple model for positive data in statistics due to its\ninterpretable parameters and tractable equations. Although there are many\ngeneralised forms of the GG which can provide better fit to data, none of them\nextend the GG so that the parameters are interpretable. Additionally, we\npresent some mathematical characteristics and prove the identifiability of the\nFIG parameters. Finally, we apply the FIG model to hand grip strength and\ninsurance loss data to assess its flexibility relative to existing models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:12:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wagener","Matthias",""],["Bekker","Andriette",""],["Arashi","Mohammad",""],["Punzo","Antonio",""]]}
{"id":"2308.11333","submitter":"Ming Hu","authors":"Yanxin Yang, Ming Hu, Yue Cao, Jun Xia, Yihao Huang, Yang Liu,\n  Mingsong Chen","title":"Protect Federated Learning Against Backdoor Attacks via Data-Free\n  Trigger Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a distributed machine learning paradigm, Federated Learning (FL) enables\nlarge-scale clients to collaboratively train a model without sharing their raw\ndata. However, due to the lack of data auditing for untrusted clients, FL is\nvulnerable to poisoning attacks, especially backdoor attacks. By using poisoned\ndata for local training or directly changing the model parameters, attackers\ncan easily inject backdoors into the model, which can trigger the model to make\nmisclassification of targeted patterns in images. To address these issues, we\npropose a novel data-free trigger-generation-based defense approach based on\nthe two characteristics of backdoor attacks: i) triggers are learned faster\nthan normal knowledge, and ii) trigger patterns have a greater effect on image\nclassification than normal class patterns. Our approach generates the images\nwith newly learned knowledge by identifying the differences between the old and\nnew global models, and filters trigger images by evaluating the effect of these\ngenerated images. By using these trigger images, our approach eliminates\npoisoned models to ensure the updated global model is benign. Comprehensive\nexperiments demonstrate that our approach can defend against almost all the\nexisting types of backdoor attacks and outperform all the seven\nstate-of-the-art defense methods with both IID and non-IID scenarios.\nEspecially, our approach can successfully defend against the backdoor attack\neven when 80\\% of the clients are malicious.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:16:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yang","Yanxin",""],["Hu","Ming",""],["Cao","Yue",""],["Xia","Jun",""],["Huang","Yihao",""],["Liu","Yang",""],["Chen","Mingsong",""]]}
{"id":"2308.11334","submitter":"Erjing Luo","authors":"Erjing Luo, Haitong Huang, Cheng Liu, Guoyu Li, Bing Yang, Ying Wang,\n  Huawei Li, Xiaowei Li","title":"DeepBurning-MixQ: An Open Source Mixed-Precision Neural Network\n  Accelerator Design Framework for FPGAs","comments":"Accepted by 2023 IEEE/ACM International Conference on Computer-Aided\n  Design (ICCAD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mixed-precision neural networks (MPNNs) that enable the use of just enough\ndata width for a deep learning task promise significant advantages of both\ninference accuracy and computing overhead. FPGAs with fine-grained\nreconfiguration capability can adapt the processing with distinct data width\nand models, and hence, can theoretically unleash the potential of MPNNs.\nNevertheless, commodity DPUs on FPGAs mostly emphasize generality and have\nlimited support for MPNNs especially the ones with lower data width. In\naddition, primitive DSPs in FPGAs usually have much larger data width than that\nis required by MPNNs and haven't been sufficiently co-explored with MPNNs yet.\nTo this end, we propose an open source MPNN accelerator design framework\nspecifically tailored for FPGAs. In this framework, we have a systematic\nDSP-packing algorithm to pack multiple lower data width MACs in a single\nprimitive DSP and enable efficient implementation of MPNNs. Meanwhile, we take\nDSP packing efficiency into consideration with MPNN quantization within a\nunified neural network architecture search (NAS) framework such that it can be\naware of the DSP overhead during quantization and optimize the MPNN performance\nand accuracy concurrently. Finally, we have the optimized MPNN fine-tuned to a\nfully pipelined neural network accelerator template based on HLS and make best\nuse of available resources for higher performance. Our experiments reveal the\nresulting accelerators produced by the proposed framework can achieve\noverwhelming advantages in terms of performance, resource utilization, and\ninference accuracy for MPNNs when compared with both handcrafted counterparts\nand prior hardware-aware neural network accelerators on FPGAs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:17:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Luo","Erjing",""],["Huang","Haitong",""],["Liu","Cheng",""],["Li","Guoyu",""],["Yang","Bing",""],["Wang","Ying",""],["Li","Huawei",""],["Li","Xiaowei",""]]}
{"id":"2308.11335","submitter":"Xingyu Zhou","authors":"Xingyu Zhou, Jing Zhang, Chao-Kai Wen, Shi Jin, and Shuangfeng Han","title":"Graph Neural Network-Enhanced Expectation Propagation Algorithm for MIMO\n  Turbo Receivers","comments":"15 pages, 12 figures, 2 tables. This paper has been accepted for\n  publication by the IEEE Transactions on Signal Processing. Copyright may be\n  transferred without notice, after which this version may no longer be\n  accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks (NNs) are considered a powerful tool for balancing the\nperformance and complexity of multiple-input multiple-output (MIMO) receivers\ndue to their accurate feature extraction, high parallelism, and excellent\ninference ability. Graph NNs (GNNs) have recently demonstrated outstanding\ncapability in learning enhanced message passing rules and have shown success in\novercoming the drawback of inaccurate Gaussian approximation of expectation\npropagation (EP)-based MIMO detectors. However, the application of the\nGNN-enhanced EP detector to MIMO turbo receivers is underexplored and\nnon-trivial due to the requirement of extrinsic information for iterative\nprocessing. This paper proposes a GNN-enhanced EP algorithm for MIMO turbo\nreceivers, which realizes the turbo principle of generating extrinsic\ninformation from the MIMO detector through a specially designed training\nprocedure. Additionally, an edge pruning strategy is designed to eliminate\nredundant connections in the original fully connected model of the GNN\nutilizing the correlation information inherently from the EP algorithm. Edge\npruning reduces the computational cost dramatically and enables the network to\nfocus more attention on the weights that are vital for performance. Simulation\nresults and complexity analysis indicate that the proposed MIMO turbo receiver\noutperforms the EP turbo approaches by over 1 dB at the bit error rate of\n$10^{-5}$, exhibits performance equivalent to state-of-the-art receivers with\n2.5 times shorter running time, and adapts to various scenarios.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:24:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhou","Xingyu",""],["Zhang","Jing",""],["Wen","Chao-Kai",""],["Jin","Shi",""],["Han","Shuangfeng",""]]}
{"id":"2308.11336","submitter":"Xiaocong Chen","authors":"Xiaocong Chen, Siyu Wang, Julian McAuley, Dietmar Jannach and Lina Yao","title":"On the Opportunities and Challenges of Offline Reinforcement Learning\n  for Recommender Systems","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reinforcement learning serves as a potent tool for modeling dynamic user\ninterests within recommender systems, garnering increasing research attention\nof late. However, a significant drawback persists: its poor data efficiency,\nstemming from its interactive nature. The training of reinforcement\nlearning-based recommender systems demands expensive online interactions to\namass adequate trajectories, essential for agents to learn user preferences.\nThis inefficiency renders reinforcement learning-based recommender systems a\nformidable undertaking, necessitating the exploration of potential solutions.\nRecent strides in offline reinforcement learning present a new perspective.\nOffline reinforcement learning empowers agents to glean insights from offline\ndatasets and deploy learned policies in online settings. Given that recommender\nsystems possess extensive offline datasets, the framework of offline\nreinforcement learning aligns seamlessly. Despite being a burgeoning field,\nworks centered on recommender systems utilizing offline reinforcement learning\nremain limited. This survey aims to introduce and delve into offline\nreinforcement learning within recommender systems, offering an inclusive review\nof existing literature in this domain. Furthermore, we strive to underscore\nprevalent challenges, opportunities, and future pathways, poised to propel\nresearch in this evolving field.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:28:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Xiaocong",""],["Wang","Siyu",""],["McAuley","Julian",""],["Jannach","Dietmar",""],["Yao","Lina",""]]}
{"id":"2308.11337","submitter":"\\\"Unal Ege Gaznepo\\u{g}lu","authors":"\\\"Unal Ege Gaznepoglu, Nils Peters","title":"Evaluation of the Speech Resynthesis Capabilities of the VoicePrivacy\n  Challenge Baseline B1","comments":"Accepted to 3rd Symposium on Security and Privacy of Speech\n  Communication","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Speaker anonymization systems continue to improve their ability to obfuscate\nthe original speaker characteristics in a speech signal, but often create\nprocessing artifacts and unnatural sounding voices as a tradeoff. Many of those\nsystems stem from the VoicePrivacy Challenge (VPC) Baseline B1, using a neural\nvocoder to synthesize speech from an F0, x-vectors and bottleneck\nfeatures-based speech representation. Inspired by this, we investigate the\nreproduction capabilities of the aforementioned baseline, to assess how\nsuccessful the shared methodology is in synthesizing human-like speech. We use\nfour objective metrics to measure speech quality, waveform similarity, and F0\nsimilarity. Our findings indicate that both the speech representation and the\nvocoder introduces artifacts, causing an unnatural perception. A MUSHRA-like\nlistening test on 18 subjects corroborate our findings, motivating further\nresearch on the analysis and synthesis components of the VPC Baseline B1.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:32:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gaznepoglu","\u00dcnal Ege",""],["Peters","Nils",""]]}
{"id":"2308.11338","submitter":"Olivier Poch","authors":"Olivier Poch, Antoine Pommerol, Nicolas Fray, Bastian Gundlach","title":"Laboratory Experiments to Understand Comets","comments":"36 pages, 13 figures, Chapter accepted for publication on February\n  24th 2023, now in press for the book Comets III, edited by K. Meech, M.\n  Combi, D. Bockelee-Morvan, S. Raymond and M. Zolensky, University of Arizona\n  Press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order to understand the origin and evolution of comets, one must decipher\nthe processes that formed and processed cometary ice and dust. Cometary\nmaterials have diverse physical and chemical properties and are mixed in\nvarious ways. Laboratory experiments are capable of producing simple to complex\nanalogues of comet-like materials, measuring their properties, and simulating\nthe processes by which their compositions and structures may evolve. The\nresults of laboratory experiments are essential for the interpretations of\ncomet observations and complement theoretical models. They are also necessary\nfor planning future missions to comets. This chapter presents an overview of\npast and ongoing laboratory experiments exploring how comets were formed and\ntransformed, from the nucleus interior and surface, to the coma. Throughout\nthese sections, the pending questions are highlighted, and the perspectives and\nprospects for future experiments are discussed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:33:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Poch","Olivier",""],["Pommerol","Antoine",""],["Fray","Nicolas",""],["Gundlach","Bastian",""]]}
{"id":"2308.11339","submitter":"Siyi Hu","authors":"Ceyao Zhang, Kaijie Yang, Siyi Hu, Zihao Wang, Guanghe Li, Yihang Sun,\n  Cheng Zhang, Zhaowei Zhang, Anji Liu, Song-Chun Zhu, Xiaojun Chang, Junge\n  Zhang, Feng Yin, Yitao Liang, Yaodong Yang","title":"ProAgent: Building Proactive Cooperative AI with Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building AIs with adaptive behaviors in human-AI cooperation stands as a\npivotal focus in AGI research. Current methods for developing cooperative\nagents predominantly rely on learning-based methods, where policy\ngeneralization heavily hinges on past interactions with specific teammates.\nThese approaches constrain the agent's capacity to recalibrate its strategy\nwhen confronted with novel teammates. We propose \\textbf{ProAgent}, a novel\nframework that harnesses large language models (LLMs) to fashion a\n\\textit{pro}active \\textit{agent} empowered with the ability to anticipate\nteammates' forthcoming decisions and formulate enhanced plans for itself.\nProAgent excels at cooperative reasoning with the capacity to dynamically adapt\nits behavior to enhance collaborative efforts with teammates. Moreover, the\nProAgent framework exhibits a high degree of modularity and interpretability,\nfacilitating seamless integration to address a wide array of coordination\nscenarios. Experimental evaluations conducted within the framework of\n\\textit{Overcook-AI} unveil the remarkable performance superiority of ProAgent,\noutperforming five methods based on self-play and population-based training in\ncooperation with AI agents. Further, when cooperating with human proxy models,\nits performance exhibits an average improvement exceeding 10\\% compared to the\ncurrent state-of-the-art, COLE. The advancement was consistently observed\nacross diverse scenarios involving interactions with both AI agents of varying\ncharacteristics and human counterparts. These findings inspire future research\nfor human-robot collaborations. For a hands-on demonstration, please visit\n\\url{https://pku-proagent.github.io}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:36:56 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 01:50:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Ceyao",""],["Yang","Kaijie",""],["Hu","Siyi",""],["Wang","Zihao",""],["Li","Guanghe",""],["Sun","Yihang",""],["Zhang","Cheng",""],["Zhang","Zhaowei",""],["Liu","Anji",""],["Zhu","Song-Chun",""],["Chang","Xiaojun",""],["Zhang","Junge",""],["Yin","Feng",""],["Liang","Yitao",""],["Yang","Yaodong",""]]}
{"id":"2308.11340","submitter":"Silvia Liberata Ullo","authors":"Francesca Razzano and Mariapia Rita Iandolo and Chiara Zarro and G. S.\n  Yogesh and Silvia Liberata Ullo","title":"Integration of Sentinel-1 and Sentinel-2 data for Earth surface\n  classification using Machine Learning algorithms implemented on Google Earth\n  Engine","comments":"4 pages, 7 figures, IEEE InGARSS conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this study, Synthetic Aperture Radar (SAR) and optical data are both\nconsidered for Earth surface classification. Specifically, the integration of\nSentinel-1 (S-1) and Sentinel-2 (S-2) data is carried out through supervised\nMachine Learning (ML) algorithms implemented on the Google Earth Engine (GEE)\nplatform for the classification of a particular region of interest. Achieved\nresults demonstrate how in this case radar and optical remote detection provide\ncomplementary information, benefiting surface cover classification and\ngenerally leading to increased mapping accuracy. In addition, this paper works\nin the direction of proving the emerging role of GEE as an effective\ncloud-based tool for handling large amounts of satellite data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:44:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Razzano","Francesca",""],["Iandolo","Mariapia Rita",""],["Zarro","Chiara",""],["Yogesh","G. S.",""],["Ullo","Silvia Liberata",""]]}
{"id":"2308.11341","submitter":"Marco Evangelisti","authors":"David Gracia, Sara Lafuerza, Javier Blasco, Marco Evangelisti","title":"The electrocaloric effect of lead-free\n  Ba$_{1-y}$Ca$_y$Ti$_{1-x}$Hf$_x$O$_3$ from direct and indirect measurements","comments":"30 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the dielectric and electrocaloric properties of\nBa$_{1-y}$Ca$_y$Ti$_{1-x}$Hf$_x$O$_3$ for compositions $0.12<x<0.18$ and\n$y=0.06$, as well as $x=0.15$ and $0<y<0.15$, synthesized by the conventional\nsolid-state reaction method. The addition of Hf/Ca broadens the\nferroelectric-paraelectric phase transition, while moving it toward room\ntemperature. Two interferroelectric transitions are seen to converge, together\nwith the ferroelectric-paraelectric phase transition, at ca. 335 K for\n$0.12<x_c<0.135$ and $y=0.06$. Consistently with the dielectric properties, the\nelectrocaloric effect maximizes closer to room temperature with increasing\nHf/Ca substitutions, which promote larger temperature spans. The electrocaloric\nresponsivity gradually decreases from 0.2 to 0.1 K$~$mm$~$kV$^{-1}$ with the\naddition of Hf/Ca. A homemade quasi-adiabatic calorimeter is employed to\nmeasure \"directly\" the electrocaloric data, which are also calculated from\npolarization-versus-electric-field cycles using \"indirect\" standard procedures.\nThe comparison between measured and calculated values highlights the importance\nof having access to direct methods for a reliable determination of the\nelectrocaloric effect.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:47:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gracia","David",""],["Lafuerza","Sara",""],["Blasco","Javier",""],["Evangelisti","Marco",""]]}
{"id":"2308.11342","submitter":"Gabriele Umbriaco Dr.","authors":"G. Umbriaco, A. Bianchini, A. Pizzella, A. Siviero, G. Coran, P.\n  Ochner, M. Montalto, M. Bazzicalupo, P. Colasanto","title":"Margherita Hack's Astrophysics at the Asiago Astrophysical Observatory","comments":"Conference paper \"HACK100: Past, Present and Future of Astrophysical\n  Spectroscopy\", International Conference, Trieste, 6-10 June 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Margherita Hack observed with the Galileo telescope at the Asiago\nAstrophysical Observatory from September 1951 to March 1954. Using the\nspectroscopic facilities of the observatory, Margherita contributed to the\nstellar study of novae, symbiotic stars, and peculiar stars. In the 80th\nanniversary of the Asiago Astrophysical Observatory and the 100th year of\nMargherita, we found her observations in the Asiago Photographic Plate Archive\nand we remade some Margherita's observations with the current capabilities of\nAsiago telescopes. We present here a summary of the early studies carried out\nby Margherita with the Galileo telescope. We underline the importance of\nmaintaining a well-organised plate archive to allow historical and scientifi c\nstudies.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:47:38 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:29:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Umbriaco","G.",""],["Bianchini","A.",""],["Pizzella","A.",""],["Siviero","A.",""],["Coran","G.",""],["Ochner","P.",""],["Montalto","M.",""],["Bazzicalupo","M.",""],["Colasanto","P.",""]]}
{"id":"2308.11343","submitter":"Liangwei Dong","authors":"Liangwei Dong, Mingjing Fan, and Boris A. Malomed","title":"Stable higher-charge vortex solitons in the cubic-quintic medium with a\n  ring potential","comments":"5 pages, 5 figures, to be published in Optics Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We put forward a model for trapping stable optical vortex solitons (VSs) with\nhigh topological charges $m$. The cubic-quintic nonlinear medium with an\nimprinted ring-shaped modulation of the refractive index is shown to support\ntwo branches of VSs, which are controlled by the radius, width and depth of the\nmodulation profile. While the lower-branch VSs are unstable in their nearly\nwhole existence domain, the upper branch is completely stable. Vortex solitons\nwith $m\\leq 12$ obey the anti-Vakhitov-Kolokolov stability criterion. The\nresults suggest possibilities for the creation of stable narrow optical VSs\nwith a low power, carrying higher vorticities.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:49:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dong","Liangwei",""],["Fan","Mingjing",""],["Malomed","Boris A.",""]]}
{"id":"2308.11344","submitter":"Gareth Parkinson","authors":"Lena Puntscher, Panukorn Sombut, Chunlei Wang, Manuel Ulreich, Jiri\n  Pavelec, Ali Rafsanjani-Abbasi, Matthias Meier, Adam Lagin, Martin Setvin,\n  Ulrike Diebold, Cesare Franchini, Michael Schmid and Gareth S. Parkinson","title":"A Multi-Technique Study of C2H4 Adsorption on Fe3O4(001)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The adsorption/desorption of ethene (C2H4), also commonly known as ethylene,\non Fe3O4(001) was studied under ultrahigh vacuum conditions using temperature\nprogrammed desorption (TPD), scanning tunneling microscopy, x-ray photoelectron\nspectroscopy, and density functional theory (DFT) based computations. To\ninterpret the TPD data, we have employed a new analysis method based on\nequilibrium thermodynamics. C2H4 adsorbs intact at all coverages and interacts\nmost strongly with surface defects such as antiphase domain boundaries and Fe\nadatoms. On the regular surface, C2H4 binds atop surface Fe sites up to a\ncoverage of 2 molecules per (rt2xrt2)R45{\\deg} unit cell, with every second Fe\noccupied. A desorption energy of 0.36 eV is determined by analysis of the TPD\nspectra at this coverage, which is approximately 0.1-0.2 eV lower than the\nvalue calculated by DFT + U with van der Waals corrections. Additional\nmolecules are accommodated in between the Fe rows. These are stabilized by\nattractive interactions with the molecules adsorbed at Fe sites. The total\ncapacity of the surface for C2H4 adsorption is found to be close to 4 molecules\nper (rt2xrt2)R45{\\deg} unit cell.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:49:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Puntscher","Lena",""],["Sombut","Panukorn",""],["Wang","Chunlei",""],["Ulreich","Manuel",""],["Pavelec","Jiri",""],["Rafsanjani-Abbasi","Ali",""],["Meier","Matthias",""],["Lagin","Adam",""],["Setvin","Martin",""],["Diebold","Ulrike",""],["Franchini","Cesare",""],["Schmid","Michael",""],["Parkinson","Gareth S.",""]]}
{"id":"2308.11345","submitter":"Yogesh Joshi Dr.","authors":"Yogesh C. Joshi, Alaxendra Panchal","title":"Investigation of orbital period changes in 9 contact binaries","comments":"Proceeding paper of the 3rd Belgo-Indian Network for Astronomy and\n  Astrophysics (BINA) workshop, Accepted for publication in the Bulletin of\n  Li\\`{e}ge Royal Society of Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the results for orbital period analysis of 9 contact binaries\n(CBs). The photometric data analyzed in this work is collected using ARIES 1-m\nand 1.3-m telescopes as well as many ground and space-based photometric\nsurveys. The precise orbital periods of the binary systems are studied using\nthe long temporal baseline of data acquired over the last 12-15 years. The\nchanges in the times of minimum brightness are calculated using (O-C) diagram.\nOut of these 9 CBs, four systems show no change in the orbital period with time\nwhile the remaining five systems show non-linear (O-C) variations with time. We\nderive mass transfer rates for these five CBs which suggests mass is being\ntransferred from secondary to primary components in three systems while it is\nfrom primary to secondary components in the other two systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:49:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Joshi","Yogesh C.",""],["Panchal","Alaxendra",""]]}
{"id":"2308.11346","submitter":"Yogesh Joshi Dr.","authors":"Alaxender Panchal, Yogesh C. Joshi","title":"Characterization of Eclipsing Binary System EPIC 211982753","comments":"Proceeding paper of the 3rd Belgo-Indian Network for Astronomy and\n  Astrophysics (BINA) workshop, Accepted for publication in the Bulletin of\n  Li\\`{e}ge Royal Society of Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the physical parameters of an eclipsing binary system EPIC\n211982753 derived through photometric and radial velocity data modeling. We\nmake use of photometric data from NASA's K2 mission, ASAS-SN, and 1.3-m\nDevasthal Fast Optical Telescope (DFOT) while spectroscopic data have been\nacquired from the HERMES spectrograph at the 1.2-m Mercator telescope. The\nlinear ephemeris for the system is updated using the K2 mission data. The\nsynthetic light curve and radial velocity curves are generated with the help of\neclipsing binary modeling package PHOEBE 1.0. The masses of primary and\nsecondary components are determined as 1.64 $\\pm$0.02 and 1.55 $\\pm$0.01\n$M_{\\odot}$, respectively. The radius for primary and secondary components are\nestimated as 1.73 $\\pm$0.02 and 1.47 $\\pm$0.02 $R_{\\odot}$, respectively. The\ndistance of the system is calculated as 238 $\\pm$ 4 pc. The eclipsing binary is\nfound to be a total eclipsing system with a high mass ratio of q=0.94.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:49:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Panchal","Alaxender",""],["Joshi","Yogesh C.",""]]}
{"id":"2308.11347","submitter":"Xiao Shen","authors":"Xiao Shen","title":"Independence property of the Busemann function in exactly solvable KPZ\n  models","comments":"21 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the independence property of the Busemann function across multiple\ndirections in both the corner growth model and the inverse gamma polymer. In\nthe context of the corner growth model, our result states that disjoint\nBusemann increments in different directions along a down-right path are\nindependent, provided that the corresponding semi-infinite geodesics have\nnonempty intersections almost surely. The proof for the independence utilizes\nthe queueing representation of the Busemann process developed by\nSepp\\\"al\\\"ainen et al. As an application, our independence result yields a\nnear-optimal probability upper bound (missing by a logarithmic factor) for the\nrare event where the endpoint of a point-to-line inverse gamma polymer is close\nto the diagonal.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:50:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shen","Xiao",""]]}
{"id":"2308.11348","submitter":"Xing Chen","authors":"Xing Chen, Yijun Liu, Zhaogeng Liu, Hechang Chen, Hengshuai Yao, Yi\n  Chang","title":"Careful at Estimation and Bold at Exploration","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exploration strategies in continuous action space are often heuristic due to\nthe infinite actions, and these kinds of methods cannot derive a general\nconclusion. In prior work, it has been shown that policy-based exploration is\nbeneficial for continuous action space in deterministic policy reinforcement\nlearning(DPRL). However, policy-based exploration in DPRL has two prominent\nissues: aimless exploration and policy divergence, and the policy gradient for\nexploration is only sometimes helpful due to inaccurate estimation. Based on\nthe double-Q function framework, we introduce a novel exploration strategy to\nmitigate these issues, separate from the policy gradient. We first propose the\ngreedy Q softmax update schema for Q value update. The expected Q value is\nderived by weighted summing the conservative Q value over actions, and the\nweight is the corresponding greedy Q value. Greedy Q takes the maximum value of\nthe two Q functions, and conservative Q takes the minimum value of the two\ndifferent Q functions. For practicality, this theoretical basis is then\nextended to allow us to combine action exploration with the Q value update,\nexcept for the premise that we have a surrogate policy that behaves like this\nexploration policy. In practice, we construct such an exploration policy with a\nfew sampled actions, and to meet the premise, we learn such a surrogate policy\nby minimizing the KL divergence between the target policy and the exploration\npolicy constructed by the conservative Q. We evaluate our method on the Mujoco\nbenchmark and demonstrate superior performance compared to previous\nstate-of-the-art methods across various environments, particularly in the most\ncomplex Humanoid environment.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:52:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Xing",""],["Liu","Yijun",""],["Liu","Zhaogeng",""],["Chen","Hechang",""],["Yao","Hengshuai",""],["Chang","Yi",""]]}
{"id":"2308.11349","submitter":"Xu Zhang","authors":"Xu Zhang, Lei Chen","title":"MulMarker: a GPT-assisted comprehensive framework for identifying\n  potential multi-gene prognostic signatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM q-bio.BM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prognostic signatures play an important role in clinical research, offering\ninsights into the potential health outcomes of patients and guiding therapeutic\ndecisions. Although single-gene prognostic biomarkers are valuable, multi-gene\nprognostic signatures offer deeper insights into disease progression. In this\npaper, we propose MulMarker, a framework that harnesses large language models\n(LLMs, such as GPT) to identify and evaluate multi-gene prognostic signatures\nacross various diseases. MulMarker comprises three core modules: a GPT-driven\nchatbot for addressing user queries, a module for identifying multi-gene\nprognostic signatures, and a module for generating tailored reports. Using\nMulMarker, we identified a cell cycle-related prognostic signature that\nconsists of CCNA1/2, CCNB1/2/3, CCNC, CCND1/2/3, CCNE1/2, CCNF, CCNG1/2, and\nCCNH. When stratifying patients based on the prognostic signature, we found\nthat patients in the low-risk group have a higher survival rate than those in\nthe high-risk group. Overall, MulMarker offers an approach to the\nidentification and validation of potential multi-gene prognostic signatures. By\nemploying GPT to address user queries and generate tailored reports, it\nunderscores the potential of integrating cutting-edge Artificial Intelligence\n(AI) solutions into prognostic research. We release the code of MulMarker at\nhttps://github.com/Tina9/MulMarker.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:54:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Xu",""],["Chen","Lei",""]]}
{"id":"2308.11350","submitter":"Helmut L\\\"anger","authors":"Ivan Chajda and Helmut L\\\"anger","title":"The intuitionistic-like logic based on a poset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of the present paper is to show that the concept of intuitionistic\nlogic based on a Heyting algebra can be generalized in such a way that it is\nformalized by means of a bounded poset. In this case it is not assumed that the\nposet is relatively pseudocomplemented. The considered logical connectives\nnegation, implication or even conjunction are not operations in this poset but\nso-called operators since they assign to given entries not necessarily an\nelement of the poset as a result but a subset of mutually incomparable elements\nwith maximal possible truth values. We show that these operators for negation\nand implication can be characterized by several simple conditions formulated in\nthe language of posets together with the operator of taking the lower cone.\nMoreover, our implication and conjunction form an adjoint pair. We call these\nconnectives \"unsharp\" or \"inexact\" in accordance with the existing literature.\nWe also introduce the concept of a deductive system of a bounded poset with\nimplication and prove that it induces an equivalence relation satisfying a\ncertain substitution property with respect to implication. Moreover, the\nrestriction of this equivalence on the base set is uniquely determined by its\nkernel, i.e. the class containing the top element.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:58:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chajda","Ivan",""],["L\u00e4nger","Helmut",""]]}
{"id":"2308.11351","submitter":"Tao Chen","authors":"Tao Chen, Ze Lin, Hui Li, Jiayi Ji, Yiyi Zhou, Guanbin Li and Rongrong\n  Ji","title":"M3PS: End-to-End Multi-Grained Multi-Modal Attribute-Aware Product\n  Summarization in E-commerce","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given the long textual product information and the product image, Multi-Modal\nProduct Summarization (MMPS) aims to attract customers' interest and increase\ntheir desire to purchase by highlighting product characteristics with a short\ntextual summary. Existing MMPS methods have achieved promising performance.\nNevertheless, there still exist several problems: 1) lack end-to-end product\nsummarization, 2) lack multi-grained multi-modal modeling, and 3) lack\nmulti-modal attribute modeling. To address these issues, we propose an\nend-to-end multi-grained multi-modal attribute-aware product summarization\nmethod (M3PS) for generating high-quality product summaries in e-commerce. M3PS\njointly models product attributes and generates product summaries. Meanwhile,\nwe design several multi-grained multi-modal tasks to better guide the\nmulti-modal learning of M3PS. Furthermore, we model product attributes based on\nboth text and image modalities so that multi-modal product characteristics can\nbe manifested in the generated summaries. Extensive experiments on a real\nlarge-scale Chinese e-commence dataset demonstrate that our model outperforms\nstate-of-the-art product summarization methods w.r.t. several summarization\nmetrics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:00:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Tao",""],["Lin","Ze",""],["Li","Hui",""],["Ji","Jiayi",""],["Zhou","Yiyi",""],["Li","Guanbin",""],["Ji","Rongrong",""]]}
{"id":"2308.11352","submitter":"Sushil Kumar Dr.","authors":"Sushil Kumar, Rakesh Kumar Pandey, Pratima Rai","title":"Sharp bounds on Coefficient functionals of certain Sakaguchi functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine sharp bounds on some Hankel determinants involving initial\ncoefficients, inverse coefficients, and logarithmic inverse coefficients for\ntwo subclasses of Sakaguchi functions which are associated with the right half\nof the lemniscate of Bernoulli and the exponential function. Further, we\ncompute sharp bounds on the second Hermitian-Toeplitz determinants involving\nlogarithmic coefficients and logarithmic inverse coefficients. We also discuss\ninvariant property for the obtained estimates with respect to various\ncoefficients.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:02:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kumar","Sushil",""],["Pandey","Rakesh Kumar",""],["Rai","Pratima",""]]}
{"id":"2308.11353","submitter":"Francesca Tripaldi","authors":"Erlend Grong and Francesca Tripaldi","title":"Filtered complexes and cohomologically equivalent subcomplexes","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inspired by Rumin's work on a subcomplex in sub-Riemannian manifolds which is\ncohomologically equivalent to the de Rham complex, we present a more general\nconstruction that produces subcomplexes from any filtered cochain complex of\nfinite depth and still computes the cohomology of the original filtered\ncomplex. A priori these subcomplexes depend not only on the filtration itself,\nbut also on the choice of additional structures. However, we show that the\nconstruction only depends on the given filtration up to isomorphism. Finally,\nwe show how such subcomplexes relate to spectral sequences, a cohomological\nmachinery that arises naturally when considering a filtered complex.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:05:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Grong","Erlend",""],["Tripaldi","Francesca",""]]}
{"id":"2308.11354","submitter":"Gustavo Canas","authors":"Nelson Villalba, Crist\\'obal Melo, Sebasti\\'an Ayala, Christopher\n  Mancilla, Wladimir Valenzuela, Miguel Figueroa, Erik Baradit, Riu Lin, Ming\n  Tang, Stephen P. Walborn, Gustavo Lima, Gabriel Saavedra, Gustavo Ca\\~nas","title":"Transmission of optical communication signals through ring core fiber\n  using perfect vortex beams","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Orbital angular momentum can be used to implement high capacity data\ntransmission systems that can be applied for classical and quantum\ncommunications. Here we experimentally study the generation and transmission\nproperties of the so-called perfect vortex beams and the Laguerre-Gaussian\nbeams in ring-core optical fibers. Our results show that when using a single\npreparation stage, the perfect vortex beams present less ring-radius variation\nthat allows coupling of higher optical power into a ring core fiber. These\nresults lead to lower power requirements to establish fiber-based\ncommunications links using orbital angular momentum and set the stage for\nfuture implementations of high-dimensional quantum communication over space\ndivision multiplexing fibers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:10:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Villalba","Nelson",""],["Melo","Crist\u00f3bal",""],["Ayala","Sebasti\u00e1n",""],["Mancilla","Christopher",""],["Valenzuela","Wladimir",""],["Figueroa","Miguel",""],["Baradit","Erik",""],["Lin","Riu",""],["Tang","Ming",""],["Walborn","Stephen P.",""],["Lima","Gustavo",""],["Saavedra","Gabriel",""],["Ca\u00f1as","Gustavo",""]]}
{"id":"2308.11355","submitter":"Qingchao Yu","authors":"Bin Dong, Xuhua He, Pengfei Jin, Felix Schremmer, Qingchao Yu","title":"Machine learning assisted exploration for affine Deligne-Lusztig\n  varieties","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG cs.LG math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel, interdisciplinary study that leverages a Machine\nLearning (ML) assisted framework to explore the geometry of affine\nDeligne-Lusztig varieties (ADLV). The primary objective is to investigate the\nnonemptiness pattern, dimension and enumeration of irreducible components of\nADLV. Our proposed framework demonstrates a recursive pipeline of data\ngeneration, model training, pattern analysis, and human examination, presenting\nan intricate interplay between ML and pure mathematical research. Notably, our\ndata-generation process is nuanced, emphasizing the selection of meaningful\nsubsets and appropriate feature sets. We demonstrate that this framework has a\npotential to accelerate pure mathematical research, leading to the discovery of\nnew conjectures and promising research directions that could otherwise take\nsignificant time to uncover. We rediscover the virtual dimension formula and\nprovide a full mathematical proof of a newly identified problem concerning a\ncertain lower bound of dimension. Furthermore, we extend an open invitation to\nthe readers by providing the source code for computing ADLV and the ML models,\npromoting further explorations. This paper concludes by sharing valuable\nexperiences and highlighting lessons learned from this collaboration.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:12:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dong","Bin",""],["He","Xuhua",""],["Jin","Pengfei",""],["Schremmer","Felix",""],["Yu","Qingchao",""]]}
{"id":"2308.11356","submitter":"Rong Li","authors":"Shijie Li, Rong Li, Juergen Gall","title":"Semantic RGB-D Image Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collecting diverse sets of training images for RGB-D semantic image\nsegmentation is not always possible. In particular, when robots need to operate\nin privacy-sensitive areas like homes, the collection is often limited to a\nsmall set of locations. As a consequence, the annotated images lack diversity\nin appearance and approaches for RGB-D semantic image segmentation tend to\noverfit the training data. In this paper, we thus introduce semantic RGB-D\nimage synthesis to address this problem. It requires synthesising a\nrealistic-looking RGB-D image for a given semantic label map. Current\napproaches, however, are uni-modal and cannot cope with multi-modal data.\nIndeed, we show that extending uni-modal approaches to multi-modal data does\nnot perform well. In this paper, we therefore propose a generator for\nmulti-modal data that separates modal-independent information of the semantic\nlayout from the modal-dependent information that is needed to generate an RGB\nand a depth image, respectively. Furthermore, we propose a discriminator that\nensures semantic consistency between the label maps and the generated images\nand perceptual similarity between the real and generated images. Our\ncomprehensive experiments demonstrate that the proposed method outperforms\nprevious uni-modal methods by a large margin and that the accuracy of an\napproach for RGB-D semantic segmentation can be significantly improved by\nmixing real and generated images during training.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:16:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Shijie",""],["Li","Rong",""],["Gall","Juergen",""]]}
{"id":"2308.11357","submitter":"Anurag Roy","authors":"Anurag Roy, Vinay Kumar Verma, Sravan Voonna, Kripabandhu Ghosh,\n  Saptarshi Ghosh, Abir Das","title":"Exemplar-Free Continual Transformer with Convolutions","comments":"Accepted in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Continual Learning (CL) involves training a machine learning model in a\nsequential manner to learn new information while retaining previously learned\ntasks without the presence of previous training data. Although there has been\nsignificant interest in CL, most recent CL approaches in computer vision have\nfocused on convolutional architectures only. However, with the recent success\nof vision transformers, there is a need to explore their potential for CL.\nAlthough there have been some recent CL approaches for vision transformers,\nthey either store training instances of previous tasks or require a task\nidentifier during test time, which can be limiting. This paper proposes a new\nexemplar-free approach for class/task incremental learning called ConTraCon,\nwhich does not require task-id to be explicitly present during inference and\navoids the need for storing previous training instances. The proposed approach\nleverages the transformer architecture and involves re-weighting the key,\nquery, and value weights of the multi-head self-attention layers of a\ntransformer trained on a similar task. The re-weighting is done using\nconvolution, which enables the approach to maintain low parameter requirements\nper task. Additionally, an image augmentation-based entropic task\nidentification approach is used to predict tasks without requiring task-ids\nduring inference. Experiments on four benchmark datasets demonstrate that the\nproposed approach outperforms several competitive approaches while requiring\nfewer parameters.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:17:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Roy","Anurag",""],["Verma","Vinay Kumar",""],["Voonna","Sravan",""],["Ghosh","Kripabandhu",""],["Ghosh","Saptarshi",""],["Das","Abir",""]]}
{"id":"2308.11358","submitter":"Emad Bahrami","authors":"Emad Bahrami, Gianpiero Francesca, Juergen Gall","title":"How Much Temporal Long-Term Context is Needed for Action Segmentation?","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modeling long-term context in videos is crucial for many fine-grained tasks\nincluding temporal action segmentation. An interesting question that is still\nopen is how much long-term temporal context is needed for optimal performance.\nWhile transformers can model the long-term context of a video, this becomes\ncomputationally prohibitive for long videos. Recent works on temporal action\nsegmentation thus combine temporal convolutional networks with self-attentions\nthat are computed only for a local temporal window. While these approaches show\ngood results, their performance is limited by their inability to capture the\nfull context of a video. In this work, we try to answer how much long-term\ntemporal context is required for temporal action segmentation by introducing a\ntransformer-based model that leverages sparse attention to capture the full\ncontext of a video. We compare our model with the current state of the art on\nthree datasets for temporal action segmentation, namely 50Salads, Breakfast,\nand Assembly101. Our experiments show that modeling the full context of a video\nis necessary to obtain the best performance for temporal action segmentation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:20:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bahrami","Emad",""],["Francesca","Gianpiero",""],["Gall","Juergen",""]]}
{"id":"2308.11359","submitter":"Nadav Harel","authors":"Nadav Harel and Tirza Routtenberg","title":"Non-Bayesian Post-Model-Selection Estimation as Estimation Under Model\n  Misspecification","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In many parameter estimation problems, the exact model is unknown and is\nassumed to belong to a set of candidate models. In such cases, a predetermined\ndata-based selection rule selects a parametric model from a set of candidates\nbefore the parameter estimation. The existing framework for estimation under\nmodel misspecification does not account for the selection process that led to\nthe misspecified model. Moreover, in post-model-selection estimation, there are\nmultiple candidate models chosen based on the observations, making the\ninterpretation of the assumed model in the misspecified setting non-trivial. In\nthis work, we present three interpretations to address the problem of\nnon-Bayesian post-model-selection estimation as an estimation under model\nmisspecification problem: the naive interpretation, the normalized\ninterpretation, and the selective inference interpretation, and discuss their\nproperties. For each of these interpretations, we developed the corresponding\nmisspecified maximum likelihood estimator and the misspecified\nCram$\\acute{\\text{e}}$r-Rao-type lower bound. The relations between the\nestimators and the performance bounds, as well as their properties, are\ndiscussed. Finally, we demonstrate the performance of the proposed estimators\nand bounds via simulations of estimation after channel selection. We show that\nthe proposed performance bounds are more informative than the oracle\nCram$\\acute{\\text{e}}$r-Rao Bound (CRB), where the third interpretation\n(selective inference) results in the lowest mean-squared-error (MSE) among the\nestimators.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:21:52 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Harel","Nadav",""],["Routtenberg","Tirza",""]]}
{"id":"2308.11360","submitter":"Tom De Medts","authors":"Tom De Medts, Mathias Stout","title":"Matsuo algebras in characteristic 2","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend the theory of Matsuo algebras, which are certain non-associative\nalgebras related to 3-transposition groups, to characteristic 2. Instead of\nidempotent elements associated to points in the corresponding Fischer space,\nour algebras are now generated by nilpotent elements associated to lines. For\nmany 3-transposition groups, this still gives rise to a\n$\\mathbb{Z}/2\\mathbb{Z}$-graded fusion law, and we provide a complete\nclassification of when this occurs.\n  In one particular small case, arising from the 3-transposition group\n$\\operatorname{Sym}(4)$, the fusion law is even stronger, and the resulting\nMiyamoto group is an algebraic group $\\mathbb{G}_a^2 \\rtimes \\mathbb{G}_m$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:22:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["De Medts","Tom",""],["Stout","Mathias",""]]}
{"id":"2308.11361","submitter":"Ismael Ribeiro De Assis","authors":"Ismael Ribeiro de Assis, Ingrid Mertig, B\\\"orge G\\\"obel","title":"Skyrmion motion in magnetic anisotropy gradients: Acceleration caused by\n  deformation","comments":"Marie Sk{\\l}odowska-Curie Actions, H2020-MSCA-ITN-2020; Project\n  acronym SPEAR; Grant Agreement No. 955671","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic skyrmions are nano-sized topologically non-trivial spin textures\nthat can be moved by external stimuli such as spin currents and internal\nstimuli such as spatial gradients of a material parameter. Since the total\nenergy of a skyrmion depends linearly on most of these parameters, like the\nperpendicular magnetic anisotropy, the exchange constant, or the\nDzyaloshinskii-Moriya interaction strength, a skyrmion will move uniformly in a\nweak parameter gradient. In this paper, we show that the linear behavior\nchanges once the gradients are strong enough so that the magnetic profile of a\nskyrmion is significantly altered throughout the propagation. In that case, the\nskyrmion experiences acceleration and moves along a curved trajectory.\nFurthermore, we show that when spin-orbit torques and material parameter\ngradients trigger a skyrmion motion, it can move on a straight path along the\ncurrent or gradient direction. We discuss the significance of suppressing the\nskyrmion Hall effect for spintronic and neuromorphic applications of skyrmions.\nLastly, we extend our discussion and compare it to a gradient generated by the\nDzyaloshinskii-Moriya interaction.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:30:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["de Assis","Ismael Ribeiro",""],["Mertig","Ingrid",""],["G\u00f6bel","B\u00f6rge",""]]}
{"id":"2308.11362","submitter":"Shuo Xiao","authors":"Shuo Xiao, Ya-Qing Liu, Ke Gong, Zheng-Hua An, Shao-Lin Xiong,\n  Xin-Qiao Li, Xiang-Yang Wen, Wen-Xi Peng, Da-Li Zhang, You-Li Tuo, Shi-Jie\n  Zheng, Li-Ming Song, Ping Wang, Xiao-Yun Zhao, Yue Huang, Xiang Ma, Xiao-Jing\n  Liu, Rui Qiao, Yan-Bing Xu, Sheng Yang, Fan Zhang, Yue Wang, Yan-Qiu Zhang,\n  Wang-Chen Xue, Jia-Cong Liu, Chao Zheng, Chen-Wei Wang, Wen-Jun Tan, Ce Cai,\n  Qi-Bin Yi, Peng Zhang, Xi-Hong Luo, Jiao-Jiao Yang, Qi-Jun Zhi, Ai-Jun Dong,\n  Shi-Jun Dang, Lun-Hua Shang, Shuang-Nan Zhang","title":"Calibration of the Timing Performance of GECAM-C","comments":"submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  As a new member of the Gravitational wave high-energy Electromagnetic\nCounterpart All-sky Monitor (GECAM) after GECAM-A and GECAM-B, GECAM-C\n(originally called HEBS), which was launched on board the SATech-01 satellite\non July 27, 2022, aims to monitor and localize X-ray and gamma-ray transients\nfrom $\\sim$ 6 keV to 6 MeV. GECAM-C utilizes a similar design to GECAM but\noperates in a more complex orbital environment. In this work, we utilize the\nsecondary particles simultaneously produced by the cosmic-ray events on orbit\nand recorded by multiple detectors, to calibrate the relative timing accuracy\nbetween all detectors of GECAM-C. We find the result is 0.1 $\\mu \\rm s$, which\nis the highest time resolution among all GRB detectors ever flown and very\nhelpful in timing analyses such as minimum variable timescale and spectral\nlags, as well as in time delay localization. Besides, we calibrate the absolute\ntime accuracy using the one-year Crab pulsar data observed by GECAM-C and\nFermi/GBM, as well as GECAM-C and GECAM-B. The results are $2.02\\pm 2.26\\ \\mu\n\\rm s$ and $5.82\\pm 3.59\\ \\mu \\rm s$, respectively. Finally, we investigate the\nspectral lag between the different energy bands of Crab pulsar observed by\nGECAM and GBM, which is $\\sim -0.2\\ {\\rm \\mu s\\ keV^{-1}}$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:33:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Xiao","Shuo",""],["Liu","Ya-Qing",""],["Gong","Ke",""],["An","Zheng-Hua",""],["Xiong","Shao-Lin",""],["Li","Xin-Qiao",""],["Wen","Xiang-Yang",""],["Peng","Wen-Xi",""],["Zhang","Da-Li",""],["Tuo","You-Li",""],["Zheng","Shi-Jie",""],["Song","Li-Ming",""],["Wang","Ping",""],["Zhao","Xiao-Yun",""],["Huang","Yue",""],["Ma","Xiang",""],["Liu","Xiao-Jing",""],["Qiao","Rui",""],["Xu","Yan-Bing",""],["Yang","Sheng",""],["Zhang","Fan",""],["Wang","Yue",""],["Zhang","Yan-Qiu",""],["Xue","Wang-Chen",""],["Liu","Jia-Cong",""],["Zheng","Chao",""],["Wang","Chen-Wei",""],["Tan","Wen-Jun",""],["Cai","Ce",""],["Yi","Qi-Bin",""],["Zhang","Peng",""],["Luo","Xi-Hong",""],["Yang","Jiao-Jiao",""],["Zhi","Qi-Jun",""],["Dong","Ai-Jun",""],["Dang","Shi-Jun",""],["Shang","Lun-Hua",""],["Zhang","Shuang-Nan",""]]}
{"id":"2308.11363","submitter":"Martin Minchev","authors":"Martin Minchev and Mladen Savov","title":"Bivariate Bernstein-gamma functions, potential measures, and asymptotics\n  of exponential functionals of L\\'evy processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $\\xi$ be a L\\'{e}vy process and $I_\\xi(t):=\\int_{0}^te^{-\\xi_s}\\mathrm{d}\ns$, $t\\geq 0,$ be the exponential functional of L\\'{e}vy processes on\ndeterministic horizon. Given that $\\lim_{t\\to \\infty}\\xi_t=-\\infty$ we evaluate\nfor general functions $F$ an upper bound on the rate of decay of\n$\\mathbb{E}\\left(F(I_\\xi(t))\\right)$ based on an explicit integral criterion.\nWhen $\\mathbb{E}\\left(\\xi_1\\right)\\in\\left(-\\infty,0\\right)$ and\n$\\mathbb{P}\\left(\\xi_1>t\\right)$ is regularly varying of index $\\alpha>1$ at\ninfinity, we show that the law of $I_\\xi(t)$, suitably normed and rescaled,\nconverges weakly to a probability measure stemming from a new generalisation of\nthe product factorisation of classical exponential functionals. These results\nsubstantially improve upon the existing literature and are obtained via a novel\ncombination between Mellin inversion of the Laplace transform of\n$\\mathbb{E}\\left(I^{-a}_{\\xi}(t)\\mathbf{1}_{\\left\\{I_{\\xi}(t)\\leq\nx\\right\\}}\\right)$, $a\\in (0,1)$, $x\\in(0,\\infty],$ and Tauberian theory\naugmented for integer-valued $\\alpha$ by a suitable application of the\none-large jump principle in the context of the de Haan theory. The methodology\nrests upon the representation of the aforementioned Mellin transform in terms\nof the recently introduced bivariate Bernstein-gamma functions for which we\ndevelop the following new results of independent interest (for general $\\xi$):\nwe link these functions to the $q$-potentials of $\\xi$; we show that their\nderivatives at zero are finite upon the finiteness of the aforementioned\nintegral criterion; we offer neat estimates of those derivatives along complex\nlines. These results are useful in various applications of the exponential\nfunctionals themselves and in different contexts where properties of bivariate\nBernstein-gamma functions are needed. $\\xi$ need not be non-lattice.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:36:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Minchev","Martin",""],["Savov","Mladen",""]]}
{"id":"2308.11364","submitter":"Hao Dong","authors":"Hao Dong, Xiaofei Guan, Yufeng Nie","title":"Higher-order multi-scale method for high-accuracy nonlinear\n  thermo-mechanical simulation of heterogeneous shells","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present work, we consider multi-scale computation and convergence for\nnonlinear time-dependent thermo-mechanical equations of inhomogeneous shells\npossessing temperature-dependent material properties and orthogonal periodic\nconfigurations. The first contribution is that a novel higher-order macro-micro\ncoupled computational model is rigorously devised via multi-scale asymptotic\ntechnique and Taylor series approach for high-accuracy simulation of\nheterogeneous shells. Benefitting from the higher-order corrected terms, the\nhigher-order multi-scale computational model keeps the conservation of local\nenergy and momentum for nonlinear thermo-mechanical simulation. Moreover, a\nglobal error estimation with explicit rate of higher-order multi-scale\nsolutions is first derived in the energy norm sense. Furthermore, an efficient\nspace-time numerical algorithm with off-line and on-line stages is presented in\ndetail. Adequate numerical experiments are conducted to confirm the competitive\nadvantages of the presented multi-scale approach, exhibiting not only the\nexceptional numerical accuracy, but also the less computational expense for\nheterogeneous shells.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:38:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dong","Hao",""],["Guan","Xiaofei",""],["Nie","Yufeng",""]]}
{"id":"2308.11365","submitter":"Alperen Kalay","authors":"Alperen Kalay, Bahri Batuhan Bilecen, Mustafa Ayazoglu","title":"Towards Clip-Free Quantized Super-Resolution Networks: How to Tame\n  Representative Images","comments":"BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Super-resolution (SR) networks have been investigated for a while, with their\nmobile and lightweight versions gaining noticeable popularity recently.\nQuantization, the procedure of decreasing the precision of network parameters\n(mostly FP32 to INT8), is also utilized in SR networks for establishing mobile\ncompatibility. This study focuses on a very important but mostly overlooked\npost-training quantization (PTQ) step: representative dataset (RD), which\nadjusts the quantization range for PTQ. We propose a novel pipeline (clip-free\nquantization pipeline, CFQP) backed up with extensive experimental\njustifications to cleverly augment RD images by only using outputs of the FP32\nmodel. Using the proposed pipeline for RD, we can successfully eliminate\nunwanted clipped activation layers, which nearly all mobile SR methods utilize\nto make the model more robust to PTQ in return for a large overhead in runtime.\nRemoving clipped activations with our method significantly benefits overall\nincreased stability, decreased inference runtime up to 54% on some SR models,\nbetter visual quality results compared to INT8 clipped models - and outperforms\neven some FP32 non-quantized models, both in runtime and visual quality,\nwithout the need for retraining with clipped activation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:41:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kalay","Alperen",""],["Bilecen","Bahri Batuhan",""],["Ayazoglu","Mustafa",""]]}
{"id":"2308.11366","submitter":"Maria Axenovich","authors":"Maria Axenovich","title":"A class of graphs of zero Tur\\'an density in a hypercube","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A graph is cubical if it is a subgraph of a hypercube. For a cubical graph\n$H$ and a hypercube $Q_n$, $ex(Q_n, H)$ is the largest number of edges in an\n$H$-free subgraph of $Q_n$. If $ex(Q_n, H)$ is at least a positive proportion\nof the number of edges in $Q_n$, $H$ is said to have a positive Tur\\'an density\nin a hypercube or simply a positive Tur\\'an density; otherwise it has a zero\nTur\\'an density. Determining $ex(Q_n, H)$ and even identifying whether $H$ has\na positive or a zero Tur\\'an density remains a widely open question for general\n$H$. By relating extremal numbers in a hypercube and certain corresponding\nhypergraphs, Conlon found a large class of cubical graphs, ones having\nso-called partite representation, that have a zero Tur\\'an density. He raised a\nquestion whether this gives a characterisation, i.e., whether a cubical graph\nhas zero Tur\\'an density if and only if it has partite representation. Here, we\nshow that, as suspected by Conlon, this is not the case. We give an example of\na class of cubical graphs which have no partite representation, but on the\nother hand, have a zero Tur\\'an density. In addition, we show that any graph\nwhose every block has partite representation has a zero Tur\\'an density in a\nhypercube.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:43:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Axenovich","Maria",""]]}
{"id":"2308.11367","submitter":"Viktor K\\\"onye","authors":"Viktor K\\\"onye, Kyrylo Ochkan, Anastasiia Chyzhykova, Jan Carl Budich,\n  Jeroen van den Brink, Ion Cosma Fulga, and Joseph Dufouleur","title":"Non-Hermitian topological ohmmeter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Measuring large electrical resistances forms an essential part of common\napplications such as insulation testing, but suffers from a fundamental\nproblem: the larger the resistance, the less sensitive a canonical ohmmeter is.\nHere we develop a conceptually different electronic sensor by exploiting the\ntopological properties of non-Hermitian matrices, whose eigenvalues can show an\nexponential sensitivity to perturbations. The ohmmeter is realized in an\nmulti-terminal, linear electric circuit with a non-Hermitian conductance\nmatrix, where the target resistance plays the role of the perturbation. We\ninject multiple currents and measure a single voltage in order to directly\nobtain the value of the resistance. The relative accuracy of the device\nincreases exponentially with the number of terminals, and for large resistances\noutperforms a standard measurement by over an order of magnitude. Our work\npaves the way towards leveraging non-Hermitian conductance matrices in\nhigh-precision sensing.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:46:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["K\u00f6nye","Viktor",""],["Ochkan","Kyrylo",""],["Chyzhykova","Anastasiia",""],["Budich","Jan Carl",""],["Brink","Jeroen van den",""],["Fulga","Ion Cosma",""],["Dufouleur","Joseph",""]]}
{"id":"2308.11368","submitter":"Jose Carrasco","authors":"Jose Carrasco, Marc Langer, Antoine Neven, Barbara Kraus","title":"Gaining confidence on the correct realization of arbitrary quantum\n  computations","comments":"17 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present verification protocols to gain confidence in the correct\nperformance of the realization of an arbitrary universal quantum computation.\nThe derivation of the protocols is based on the fact that matchgate\ncomputations, which are classically efficiently simulable, become universal if\nsupplemented with additional resources. We combine tools from weak simulation,\nrandomized compiling, and classical statistics to derive verification circuits.\nThese circuits have the property that (i) they strongly resemble the original\ncircuit and (ii) cannot only be classically efficiently simulated in the ideal,\ni.e. error free, scenario, but also in the realistic situation where errors are\npresent. In fact, in one of the protocols we apply exactly the same circuit as\nin the original computation, however, to a slightly modified input state.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:47:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Carrasco","Jose",""],["Langer","Marc",""],["Neven","Antoine",""],["Kraus","Barbara",""]]}
{"id":"2308.11369","submitter":"Ning Gao","authors":"Ning Gao, Bernard Hohmann, Gerhard Neumann","title":"Enhancing Interpretable Object Abstraction via Clustering-based Slot\n  Initialization","comments":null,"journal-ref":"The 34th British Machine Vision Conference (BMVC), 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Object-centric representations using slots have shown the advances towards\nefficient, flexible and interpretable abstraction from low-level perceptual\nfeatures in a compositional scene. Current approaches randomize the initial\nstate of slots followed by an iterative refinement. As we show in this paper,\nthe random slot initialization significantly affects the accuracy of the final\nslot prediction. Moreover, current approaches require a predetermined number of\nslots from prior knowledge of the data, which limits the applicability in the\nreal world. In our work, we initialize the slot representations with clustering\nalgorithms conditioned on the perceptual input features. This requires an\nadditional layer in the architecture to initialize the slots given the\nidentified clusters. We design permutation invariant and permutation\nequivariant versions of this layer to enable the exchangeable slot\nrepresentations after clustering. Additionally, we employ mean-shift clustering\nto automatically identify the number of slots for a given scene. We evaluate\nour method on object discovery and novel view synthesis tasks with various\ndatasets. The results show that our method outperforms prior works\nconsistently, especially for complex scenes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:48:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gao","Ning",""],["Hohmann","Bernard",""],["Neumann","Gerhard",""]]}
{"id":"2308.11370","submitter":"He Jiachun","authors":"Jia-Chun He, Xiao-Na Sun, Jie-Shuang Wang, Frank M. Rieger, Ruo-Yu\n  Liu, En-Wei Liang","title":"Studying X-ray spectra from large-scale jets of FR II radio galaxies:\n  application of shear particle acceleration","comments":"14 pages, 4 figures, 6 table, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shear particle acceleration is a promising candidate for the origin of\nextended high-energy emission in extra-galactic jets. In this paper, we explore\nthe applicability of a shear model to 24 X-ray knots in the large-scale jets of\nFR II radio galaxies, and study the jet properties by modeling the\nmulti-wavelength spectral energy distributions (SEDs) in a leptonic framework\nincluding synchrotron and inverse Compton - CMB processes. In order to improve\nspectral modelling, we analyze Fermi-LAT data for five sources and reanalyzed\narchival data of Chandra on 15 knots, exploring the radio to X-ray connection.\nWe show that the X-ray SEDs of these knots can be satisfactorily modelled by\nsynchrotron radiation from a second, shear-accelerated electron population\nreaching multi-TeV energies. The inferred flow speeds are compatible with\nlarge-scale jets being mildly relativistic. We explore two different shear flow\nprofiles (i.e., linearly decreasing and power-law) and find that the required\nspine speeds differ only slightly, supporting the notion that for higher flow\nspeeds the variations in particle spectral indices are less dependent on the\npresumed velocity profile. The derived magnetic field strengths are in the\nrange of a few to ten microGauss, and the required power in non-thermal\nparticles typically well below the Eddington constraint. Finally, the inferred\nparameters are used to constrain the potential of FR II jets as possible UHECR\naccelerators.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:49:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Jia-Chun",""],["Sun","Xiao-Na",""],["Wang","Jie-Shuang",""],["Rieger","Frank M.",""],["Liu","Ruo-Yu",""],["Liang","En-Wei",""]]}
{"id":"2308.11371","submitter":"Pablo Antolin","authors":"Thibaut Hirschler, Robin Bouclier, Pablo Antolin, Annalisa Buffa","title":"Reduced Order Modeling based Inexact FETI-DP solver for lattice\n  structures","comments":"30 pages, 12 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.CE cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses the overwhelming computational resources needed with\nstandard numerical approaches to simulate architected materials. Those\nmultiscale heterogeneous lattice structures gain intensive interest in\nconjunction with the improvement of additive manufacturing as they offer, among\nmany others, excellent stiffness-to-weight ratios. We develop here a dedicated\nHPC solver that benefits from the specific nature of the underlying problem in\norder to drastically reduce the computational costs (memory and time) for the\nfull fine-scale analysis of lattice structures. Our purpose is to take\nadvantage of the natural domain decomposition into cells and, even more\nimportantly, of the geometrical and mechanical similarities among cells. Our\nsolver consists in a so-called inexact FETI-DP method where the local,\ncell-wise operators and solutions are approximated with reduced order modeling\ntechniques. Instead of considering independently every cell, we end up with\nonly few principal local problems to solve and make use of the corresponding\nprincipal cell-wise operators to approximate all the others. It results in a\nscalable algorithm that saves numerous local factorizations. Our solver is\napplied for the isogeometric analysis of lattices built by spline composition,\nwhich offers the opportunity to compute the reduced basis with macro-scale\ndata, thereby making our method also multiscale and matrix-free. The solver is\ntested against various 2D and 3D analyses. It shows major gains with respect to\nblack-box solvers; in particular, problems of several millions of degrees of\nfreedom can be solved with a simple computer within few minutes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:53:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hirschler","Thibaut",""],["Bouclier","Robin",""],["Antolin","Pablo",""],["Buffa","Annalisa",""]]}
{"id":"2308.11372","submitter":"Rowan Batzofin Mr","authors":"Rowan Batzofin (1), Pierre Cristofari (2), Kathrin Egberts (1) and\n  Constantin Steppa (1) ((1) University of Potsdam, (2) Observatoire de Paris\n  PSL Research University)","title":"The population of Galactic supernova remnants in the TeV range","comments":"8 pages, 5 figures, Proceedings for the 38th International Cosmic Ray\n  Conference (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.0617","report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  SNRs are likely to be significant sources of Galactic cosmic rays up to the\nknee. They produce gamma rays in the very-high-energy (E>100 GeV) range mainly\nvia two mechanisms: hadronic interactions of accelerated protons with the\ninterstellar medium and leptonic interactions of accelerated electrons with\nsoft photons. Observations with current instruments have lead to the detection\nof about a dozen SNRs in VHE gamma rays and future instruments will help\nsignificantly increase this number. Yet, the details of particle acceleration\nat SNRs, and of the mechanisms producing VHE gamma-ray at SNRs remain poorly\nunderstood: What is the spectrum of accelerated particles? What is the\nefficiency of particle acceleration? Is the gamma-ray emission dominated by\nhadronic or leptonic origin?\n  To address these questions, we simulate the population of SNRs in the\ngamma-ray domain, and confront it to the current population of TeV SNRs. This\nmethod allows us to investigate several crucial aspects of particle\nacceleration at SNRs, such as the level of magnetic field around SNR shocks or\nscanning the parameter space of the accelerated particles (spectral index,\nelectron to proton ratio and the acceleration efficiency of the shock) with the\npossibility to constrain some of the parameters.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:54:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Batzofin","Rowan",""],["Cristofari","Pierre",""],["Egberts","Kathrin",""],["Steppa","Constantin",""]]}
{"id":"2308.11373","submitter":"Meng Guo","authors":"Zesen Liu, Meng Guo and Zhongkui Li","title":"Tackling the Curse of Dimensionality in Large-scale Multi-agent LTL Task\n  Planning via Poset Product","comments":"9 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Linear Temporal Logic (LTL) formulas have been used to describe complex tasks\nfor multi-agent systems, with both spatial and temporal constraints. However,\nsince the planning complexity grows exponentially with the number of agents and\nthe length of the task formula, existing applications are mostly limited to\nsmall artificial cases. To address this issue, a new planning algorithm is\nproposed for task formulas specified as sc-LTL formulas. It avoids two common\nbottlenecks in the model-checking-based planning methods, i.e., (i) the direct\ntranslation of the complete task formula to the associated B\\\"uchi automaton;\nand (ii) the synchronized product between the B\\\"uchi automaton and the\ntransition models of all agents. In particular, each conjuncted sub-formula is\nfirst converted to the associated R-posets as an abstraction of the temporal\ndependencies among the subtasks. Then, an efficient algorithm is proposed to\ncompute the product of these R-posets, which retains their dependencies and\nresolves potential conflicts. Furthermore, the proposed approach is applied to\ndynamic scenes where new tasks are generated online. It is capable of deriving\nthe first valid plan with a polynomial time and memory complexity w.r.t. the\nsystem size and the formula length. Our method can plan for task formulas with\na length of more than 60 and a system with more than 35 agents, while most\nexisting methods fail at the formula length of 20. The proposed method is\nvalidated on large fleets of service robots in both simulation and hardware\nexperiments.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:56:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Zesen",""],["Guo","Meng",""],["Li","Zhongkui",""]]}
{"id":"2308.11374","submitter":"Hongtao Zhang","authors":"Jixian Wang and Hongtao Zhang and Ram Tiwari","title":"Weighting Based Approaches to Borrowing Historical Controls for Indirect\n  comparison for Time-to-Event Data with a Cure Fraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To use historical controls for indirect comparison with single-arm trials,\nthe population difference between data sources should be adjusted to reduce\nconfounding bias. The adjustment is more difficult for time-to-event data with\na cure fraction. We propose different adjustment approaches based on pseudo\nobservations and calibration weighting by entropy balancing. We show a simple\nway to obtain the pseudo observations for the cure rate and propose a simple\nweighted estimator based on them. Estimation of the survival function in\npresence of a cure fraction is also considered. Simulations are conducted to\nexamine the proposed approaches. An application to a breast cancer study is\npresented.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:58:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Jixian",""],["Zhang","Hongtao",""],["Tiwari","Ram",""]]}
{"id":"2308.11375","submitter":"Klaus Broelemann","authors":"Ann-Kristin Becker, Oana Dumitrasc, Klaus Broelemann","title":"Interpretable Distribution-Invariant Fairness Measures for Continuous\n  Scores","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Measures of algorithmic fairness are usually discussed in the context of\nbinary decisions. We extend the approach to continuous scores. So far,\nROC-based measures have mainly been suggested for this purpose. Other existing\nmethods depend heavily on the distribution of scores, are unsuitable for\nranking tasks, or their effect sizes are not interpretable. Here, we propose a\ndistributionally invariant version of fairness measures for continuous scores\nwith a reasonable interpretation based on the Wasserstein distance. Our\nmeasures are easily computable and well suited for quantifying and interpreting\nthe strength of group disparities as well as for comparing biases across\ndifferent models, datasets, or time points. We derive a link between the\ndifferent families of existing fairness measures for scores and show that the\nproposed distributionally invariant fairness measures outperform ROC-based\nfairness measures because they are more explicit and can quantify significant\nbiases that ROC-based fairness measures miss. Finally, we demonstrate their\neffectiveness through experiments on the most commonly used fairness benchmark\ndatasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:01:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Becker","Ann-Kristin",""],["Dumitrasc","Oana",""],["Broelemann","Klaus",""]]}
{"id":"2308.11376","submitter":"Shaheer Ullah Saeed","authors":"Weixi Yi, Vasilis Stavrinides, Zachary M.C. Baum, Qianye Yang, Dean C.\n  Barratt, Matthew J. Clarkson, Yipeng Hu, Shaheer U. Saeed","title":"Boundary-RL: Reinforcement Learning for Weakly-Supervised Prostate\n  Segmentation in TRUS Images","comments":"Accepted to MICCAI Workshop MLMI 2023 (14th International Conference\n  on Machine Learning in Medical Imaging)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose Boundary-RL, a novel weakly supervised segmentation method that\nutilises only patch-level labels for training. We envision the segmentation as\na boundary detection problem, rather than a pixel-level classification as in\nprevious works. This outlook on segmentation may allow for boundary delineation\nunder challenging scenarios such as where noise artefacts may be present within\nthe region-of-interest (ROI) boundaries, where traditional pixel-level\nclassification-based weakly supervised methods may not be able to effectively\nsegment the ROI. Particularly of interest, ultrasound images, where intensity\nvalues represent acoustic impedance differences between boundaries, may also\nbenefit from the boundary delineation approach. Our method uses reinforcement\nlearning to train a controller function to localise boundaries of ROIs using a\nreward derived from a pre-trained boundary-presence classifier. The classifier\nindicates when an object boundary is encountered within a patch, as the\ncontroller modifies the patch location in a sequential Markov decision process.\nThe classifier itself is trained using only binary patch-level labels of object\npresence, which are the only labels used during training of the entire boundary\ndelineation framework, and serves as a weak signal to inform the boundary\ndelineation. The use of a controller function ensures that a sliding window\nover the entire image is not necessary. It also prevents possible\nfalse-positive or -negative cases by minimising number of patches passed to the\nboundary-presence classifier. We evaluate our proposed approach for a\nclinically relevant task of prostate gland segmentation on trans-rectal\nultrasound images. We show improved performance compared to other tested weakly\nsupervised methods, using the same labels e.g., multiple instance learning.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:02:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yi","Weixi",""],["Stavrinides","Vasilis",""],["Baum","Zachary M. C.",""],["Yang","Qianye",""],["Barratt","Dean C.",""],["Clarkson","Matthew J.",""],["Hu","Yipeng",""],["Saeed","Shaheer U.",""]]}
{"id":"2308.11377","submitter":"Igor V. Volovich","authors":"Igor Volovich","title":"Cosmological Constant and Maximum of Entropy for de Sitter Space","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  There are at least two cosmological constants calling for explanation. The\nfirst one describes the quasi-de Sitter inflation in the early universe, and\nthe second describes the current acceleration of the universe associated with\ndark energy. An approach to the computation of the inflationary cosmological\nconstant in the early universe is proposed. The tunneling and no-boundary\nproposals suggest that the ground state of the early universe is the de Sitter\nspace. In this paper it is argued that the radius of the de Sitter space, i.e.\nthe cosmological constant, can be computed using the principle of maximum\nentropy. The universe emerges from ``nothing\" that corresponds to a minimum of\nentropy. The entropy reaches its maximal value for the 4-dimensional de Sitter\nspace with the inflationary cosmological constant\n$\\Lambda=3\\pi\\,\\exp\\{-\\psi(3/2)\\}$, where $\\psi$ is the digamma function,\n$\\Lambda\\approx 9.087$ in Planck units.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:02:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Volovich","Igor",""]]}
{"id":"2308.11378","submitter":"Florian Oschmann","authors":"\\v{S}\\'arka Ne\\v{c}asov\\'a, Florian Oschmann","title":"A collision result for both non-Newtonian and heat conducting Newtonian\n  compressible fluids","comments":"12 pages, no figures, comments welcome. arXiv admin note: text\n  overlap with arXiv:2210.04698","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize the known collision results for a solid in a 3D compressible\nNewtonian fluid to compressible non-Newtonian ones, and to Newtonian fluids\nwith temperature depending viscosities.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:05:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ne\u010dasov\u00e1","\u0160\u00e1rka",""],["Oschmann","Florian",""]]}
{"id":"2308.11379","submitter":"Ittay Eyal","authors":"Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern","title":"Colordag: An Incentive-Compatible Blockchain","comments":"To be published in DISC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Colordag, a blockchain protocol where following the prescribed\nstrategy is, with high probability, a best response as long as all miners have\nless than 1/2 of the mining power. We prove the correctness of Colordag even if\nthere is an extremely powerful adversary who knows future actions of the\nscheduler: specifically, when agents will generate blocks and when messages\nwill arrive. The state-of-the-art protocol, Fruitchain, is an epsilon-Nash\nequilibrium as long as all miners have less than 1/2 of the mining power.\nHowever, there is a simple deviation that guarantees that deviators are never\nworse off than they would be by following Fruitchain, and can sometimes do\nbetter. Thus, agents are motivated to deviate. Colordag implements a solution\nconcept that we call epsilon-sure Nash equilibrium and does not suffer from\nthis problem. Because it is an epsilon-sure Nash equilibrium, Colordag is an\nepsilon Nash equilibrium and with probability (1 - epsilon) is a best response.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:08:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Abraham","Ittai",""],["Dolev","Danny",""],["Eyal","Ittay",""],["Halpern","Joseph Y.",""]]}
{"id":"2308.11380","submitter":"Thai Binh Nguyen","authors":"Thai-Binh Nguyen and Alexander Waibel","title":"Convoifilter: A case study of doing cocktail party speech recognition","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents an end-to-end model designed to improve automatic speech\nrecognition (ASR) for a particular speaker in a crowded, noisy environment. The\nmodel utilizes a single-channel speech enhancement module that isolates the\nspeaker's voice from background noise, along with an ASR module. Through this\napproach, the model is able to decrease the word error rate (WER) of ASR from\n80% to 26.4%. Typically, these two components are adjusted independently due to\nvariations in data requirements. However, speech enhancement can create\nanomalies that decrease ASR efficiency. By implementing a joint fine-tuning\nstrategy, the model can reduce the WER from 26.4% in separate tuning to 14.5%\nin joint tuning.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:09:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nguyen","Thai-Binh",""],["Waibel","Alexander",""]]}
{"id":"2308.11381","submitter":"Zichen Yu","authors":"Zichen Yu, Quanli Liu, Wei Wang, Liyong Zhang, Xiaoguang Zhao","title":"DALNet: A Rail Detection Network Based on Dynamic Anchor Line","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rail detection is one of the key factors for intelligent train. In the paper,\nmotivated by the anchor line-based lane detection methods, we propose a rail\ndetection network called DALNet based on dynamic anchor line. Aiming to solve\nthe problem that the predefined anchor line is image agnostic, we design a\nnovel dynamic anchor line mechanism. It utilizes a dynamic anchor line\ngenerator to dynamically generate an appropriate anchor line for each rail\ninstance based on the position and shape of the rails in the input image. These\ndynamically generated anchor lines can be considered as better position\nreferences to accurately localize the rails than the predefined anchor lines.\nIn addition, we present a challenging urban rail detection dataset DL-Rail with\nhigh-quality annotations and scenario diversity. DL-Rail contains 7000 pairs of\nimages and annotations along with scene tags, and it is expected to encourage\nthe development of rail detection. We extensively compare DALNet with many\ncompetitive lane methods. The results show that our DALNet achieves\nstate-of-the-art performance on our DL-Rail rail detection dataset and the\npopular Tusimple and LLAMAS lane detection benchmarks. The code will be\nreleased at https://github.com/Yzichen/mmLaneDet.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:12:59 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 00:34:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yu","Zichen",""],["Liu","Quanli",""],["Wang","Wei",""],["Zhang","Liyong",""],["Zhao","Xiaoguang",""]]}
{"id":"2308.11382","submitter":"Pablo Dorta-Gonzalez","authors":"Sara M. Gonz\\'alez-Betancor and Pablo Dorta-Gonz\\'alez","title":"Does society show differential attention to researchers based on gender\n  and field?","comments":"23 pages, 5 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While not all researchers prioritize social impact, it is undeniably a\ncrucial aspect that adds significance to their work. The objective of this\npaper is to explore potential gender differences in the social attention paid\nto researchers and to examine their association with specific fields of study.\nTo achieve this goal, the paper analyzes four dimensions of social influence\nand examines three measures of social attention to researchers. The dimensions\nare media influence (mentions in mainstream news), political influence\n(mentions in public policy reports), social media influence (mentions in\nTwitter), and educational influence (mentions in Wikipedia). The measures of\nsocial attention to researchers are: proportion of publications with social\nmentions (social attention orientation), mentions per publication (level of\nsocial attention), and mentions per mentioned publication (intensity of social\nattention). By analyzing the rankings of authors -- for the four dimensions\nwith the three measures in the 22 research fields of the Web of Science\ndatabase -- and by using Spearman correlation coefficients, we conclude that:\n1) significant differences are observed between fields; 2) the dimensions\ncapture different and independent aspects of the social impact. Finally, we use\nnon-parametric means comparison tests to detect gender bias in social\nattention. We conclude that for most fields and dimensions with enough non-zero\naltmetrics data, gender differences in social attention are not predominant,\nbut are still present and vary across fields.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:17:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gonz\u00e1lez-Betancor","Sara M.",""],["Dorta-Gonz\u00e1lez","Pablo",""]]}
{"id":"2308.11383","submitter":"Xavier Fern\\'andez-Real","authors":"Xavier Fern\\'andez-Real, Xavier Ros-Oton","title":"Schauder and Cordes-Nirenberg estimates for nonlocal elliptic equations\n  with singular kernels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study integro-differential elliptic equations (of order $2s$) with\nvariable coefficients, and prove the natural and most general Schauder-type\nestimates that can hold in this setting, both in divergence and non-divergence\nform. Furthermore, we also establish H\\\"older estimates for general elliptic\nequations with no regularity assumption on $x$, including for the first time\noperators like $\\sum_{i=1}^n(-\\partial^2_{\\textbf{v}_i(x)})^s$, provided that\nthe coefficients have ``small oscillation''.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:19:19 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fern\u00e1ndez-Real","Xavier",""],["Ros-Oton","Xavier",""]]}
{"id":"2308.11384","submitter":"Sourav Bhattacharya","authors":"Sourav Bhattacharya and Moutushi Dutta Choudhury","title":"Non-perturbative $\\langle \\phi \\rangle$, $\\langle \\phi^2 \\rangle$ and\n  the dynamically generated scalar mass with Yukawa interaction in the\n  inflationary de Sitter spacetime","comments":"v1; 34pp, 10 figues","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a massless minimally coupled self interacting quantum scalar\nfield coupled to fermion via the Yukawa interaction, in the inflationary de\nSitter background. The fermion is also taken to be massless and the scalar\npotential is taken to be a hybrid, $V(\\phi)= \\lambda \\phi^4/4!+ \\beta\n\\phi^3/3!$ ($\\lambda >0$). The chief physical motivation behind this choice of\n$V(\\phi)$ corresponds to, apart from its boundedness from below property, the\nfact that shape wise $V(\\phi)$ has qualitative similarity with standard\ninflationary classical slow roll potentials. Also, its vacuum expectation value\ncan be negative, suggesting some screening of the inflationary cosmological\nconstant. We choose that $\\langle \\phi \\rangle\\sim 0$ at early times with\nrespect to the Bunch-Davies vacuum, so that perturbation theory is valid\ninitially. We consider the equations satisfied by $\\langle \\phi (t) \\rangle$\nand $\\langle \\phi^2(t) \\rangle$, constructed from the coarse grained equation\nof motion for the slowly rolling $\\phi$. We then compute the vacuum expectation\nvalues of various relevant operators using the in-in formalism up to three\nloop, in terms of the leading powers of the secular logarithms. For a closed\nfermion loop, we have restricted ourselves here to only the local contribution.\nThese large logarithms are then resummed by constructing suitable\nnon-perturbative equations to compute $\\langle \\phi \\rangle$ and $\\langle\n\\phi^2 \\rangle$. $\\langle \\phi \\rangle$ turns out to be at least approximately\nan order of magnitude less compared to the minimum of the classical potentail,\n$-3\\beta/\\lambda$, owing to the strong quantum fluctuations. For $\\langle\n\\phi^2 \\rangle$, we have computed the dynamically generated scalar mass at late\ntimes, by taking the appropriate purely local constributions. Variations of\nthese quantities with respect to different couplings have also been presented.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:22:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bhattacharya","Sourav",""],["Choudhury","Moutushi Dutta",""]]}
{"id":"2308.11385","submitter":"Jakob Piribauer","authors":"Julie Parreaux, Jakob Piribauer, Christel Baier","title":"Counterfactual Causality for Reachability and Safety based on Distance\n  Functions","comments":"This is the extended version of a paper accepted for publication at\n  GandALF 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Investigations of causality in operational systems aim at providing\nhuman-understandable explanations of why a system behaves as it does. There is,\nin particular, a demand to explain what went wrong on a given counterexample\nexecution that shows that a system does not satisfy a given specification. To\nthis end, this paper investigates a notion of counterfactual causality in\ntransition systems based on Stalnaker's and Lewis' semantics of counterfactuals\nin terms of most similar possible worlds and introduces a novel corresponding\nnotion of counterfactual causality in two-player games. Using distance\nfunctions between paths in transition systems, this notion defines whether\nreaching a certain set of states is a cause for the violation of a reachability\nor safety property. Similarly, using distance functions between memoryless\nstrategies in reachability and safety games, it is defined whether reaching a\nset of states is a cause for the fact that a given strategy for the player\nunder investigation is losing. The contribution of the paper is two-fold: In\ntransition systems, it is shown that counterfactual causality can be checked in\npolynomial time for three prominent distance functions between paths. In\ntwo-player games, the introduced notion of counterfactual causality is shown to\nbe checkable in polynomial time for two natural distance functions between\nmemoryless strategies. Further, a notion of explanation that can be extracted\nfrom a counterfactual cause and that pinpoints changes to be made to the given\nstrategy in order to transform it into a winning strategy is defined. For the\ntwo distance functions under consideration, the problem to decide whether such\nan explanation imposes only minimal necessary changes to the given strategy\nwith respect to the used distance function turns out to be coNP-complete and\nnot to be solvable in polynomial time if P is not equal to NP, respectively.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:23:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Parreaux","Julie",""],["Piribauer","Jakob",""],["Baier","Christel",""]]}
{"id":"2308.11386","submitter":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a","authors":"Agnieszka Miko{\\l}ajczyk-Bare{\\l}a, Maria Ferlin, Micha{\\l} Grochowski","title":"Targeted Data Augmentation for bias mitigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The development of fair and ethical AI systems requires careful consideration\nof bias mitigation, an area often overlooked or ignored. In this study, we\nintroduce a novel and efficient approach for addressing biases called Targeted\nData Augmentation (TDA), which leverages classical data augmentation techniques\nto tackle the pressing issue of bias in data and models. Unlike the laborious\ntask of removing biases, our method proposes to insert biases instead,\nresulting in improved performance. To identify biases, we annotated two diverse\ndatasets: a dataset of clinical skin lesions and a dataset of male and female\nfaces. These bias annotations are published for the first time in this study,\nproviding a valuable resource for future research. Through Counterfactual Bias\nInsertion, we discovered that biases associated with the frame, ruler, and\nglasses had a significant impact on models. By randomly introducing biases\nduring training, we mitigated these biases and achieved a substantial decrease\nin bias measures, ranging from two-fold to more than 50-fold, while maintaining\na negligible increase in the error rate.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:25:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Miko\u0142ajczyk-Bare\u0142a","Agnieszka",""],["Ferlin","Maria",""],["Grochowski","Micha\u0142",""]]}
{"id":"2308.11387","submitter":"James Callan","authors":"James Callan and Justyna Petke","title":"Multi-Objective Improvement of Android Applications","comments":"32 pages, 8 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-functional properties, such as runtime or memory use, are important to\nmobile app users and developers, as they affect user experience. Previous work\non automated improvement of non-functional properties in mobile apps failed to\naddress the inherent trade-offs between such properties. We propose a practical\napproach and the first open-source tool, GIDroid (2023), for multi-objective\nautomated improvement of Android apps. In particular, we use Genetic\nimprovement, a search-based technique that navigates the space of software\nvariants to find improved software. We use a simulation-based testing framework\nto greatly improve the speed of search. GIDroid contains three state-of-the-art\nmulti-objective algorithms, and two new mutation operators, which cache the\nresults of method calls. Genetic improvement relies on testing to validate\npatches. Previous work showed that tests in open-source Android applications\nare scarce. We thus wrote tests for 21 versions of 7 Android apps, creating a\nnew benchmark for performance improvements. We used GIDroid to improve versions\nof mobile apps where developers had previously found improvements to runtime,\nmemory, and bandwidth use. Our technique automatically re-discovers 64% of\nexisting improvements. We then applied our approach to current versions of\nsoftware in which there were no known improvements. We were able to improve\nexecution time by up to 35%, and memory use by up to 33% in these apps.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:26:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Callan","James",""],["Petke","Justyna",""]]}
{"id":"2308.11388","submitter":"Mingxiang Li","authors":"Mingxiang Li, Juncheng Wei","title":"Higher order Bol's inequality and its applications","comments":"22 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assuming that the conformal metric $g=e^{2u}|dx|^2$ on $\\mathbb{R}^n$ is\nnormal, our focus lies in investigating the following conjecture: if the\nQ-curvature of such a manifold is bounded from above by $(n-1)!$, then the\nvolume is sharply bounded from below by the volume of the standard n-sphere. In\nspecific instances, such as when $u$ is radially symmetric or when the\nQ-curvature is represented by a polynomial, we provide a positive response to\nthis conjecture, although the general case remains unresolved. Intriguingly,\nunder the normal and radially symmetric assumptions, we establish that the\nvolume is bounded from above by the volume of the standard n-sphere when the\nQ-curvature is bounded from below by $(n-1)!$, thereby addressing a certain\nopen problem raised by Hyder-Martinazzi (2021, JDE).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:27:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Mingxiang",""],["Wei","Juncheng",""]]}
{"id":"2308.11389","submitter":"Pietro Gori","authors":"Rebeca V\\'etil, Cl\\'ement Abi-Nader, Alexandre B\\^one, Marie-Pierre\n  Vullierme, Marc-Michel Roh\\'e, Pietro Gori, Isabelle Bloch","title":"Non-Redundant Combination of Hand-Crafted and Deep Learning Radiomics:\n  Application to the Early Detection of Pancreatic Cancer","comments":"CaPTion workshop MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the problem of learning Deep Learning Radiomics (DLR) that are not\nredundant with Hand-Crafted Radiomics (HCR). To do so, we extract DLR features\nusing a VAE while enforcing their independence with HCR features by minimizing\ntheir mutual information. The resulting DLR features can be combined with\nhand-crafted ones and leveraged by a classifier to predict early markers of\ncancer. We illustrate our method on four early markers of pancreatic cancer and\nvalidate it on a large independent test set. Our results highlight the value of\ncombining non-redundant DLR and HCR features, as evidenced by an improvement in\nthe Area Under the Curve compared to baseline methods that do not address\nredundancy or solely rely on HCR features.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:28:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["V\u00e9til","Rebeca",""],["Abi-Nader","Cl\u00e9ment",""],["B\u00f4ne","Alexandre",""],["Vullierme","Marie-Pierre",""],["Roh\u00e9","Marc-Michel",""],["Gori","Pietro",""],["Bloch","Isabelle",""]]}
{"id":"2308.11390","submitter":"Hao Dong","authors":"Hao Dong, Junzhi Cui","title":"Statistical higher-order multi-scale method for nonlinear\n  thermo-mechanical simulation of random composite materials with\n  temperature-dependent properties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic multi-scale modeling and simulation for nonlinear\nthermo-mechanical problems of composite materials with complicated random\nmicrostructures remains a challenging issue. In this paper, we develop a novel\nstatistical higher-order multi-scale (SHOMS) method for nonlinear\nthermo-mechanical simulation of random composite materials, which is designed\nto overcome limitations of prohibitive computation involving the macro-scale\nand micro-scale. By virtue of statistical multi-scale asymptotic analysis and\nTaylor series method, the SHOMS computational model is rigorously derived for\naccurately analyzing nonlinear thermo-mechanical responses of random composite\nmaterials both in the macro-scale and micro-scale. Moreover, the local error\nanalysis of SHOMS solutions in the point-wise sense clearly illustrates the\ncrucial indispensability of establishing the higher-order asymptotic corrected\nterms in SHOMS computational model for keeping the conservation of local energy\nand momentum. Then, the corresponding space-time multi-scale numerical\nalgorithm with off-line and on-line stages is designed to efficiently simulate\nnonlinear thermo-mechanical behaviors of random composite materials. Finally,\nextensive numerical experiments are presented to gauge the efficiency and\naccuracy of the proposed SHOMS approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:28:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Dong","Hao",""],["Cui","Junzhi",""]]}
{"id":"2308.11391","submitter":"Kathrin B\\\"ockmann","authors":"K. B\\\"ockmann, M. Br\\\"uggen, V. Heesen, A. Basu, S. P. O'Sullivan, I.\n  Heywood, M. Jarvis, A. Scaife, J. Stil, R. Taylor, N. J. Adams, R. A. A.\n  Bowler, M. N. Tudorache","title":"Probing magnetic fields in the circumgalactic medium using polarization\n  data from MIGHTEE","comments":"11 pages, 8 figures, accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The detection and study of magnetic fields surrounding galaxies is important\nto understand galaxy evolution since magnetic fields are tracers for dynamical\nprocesses in the circumgalactic medium (CGM) and can have a significant impact\non the evolution of the CGM. The Faraday rotation measure (RM) of the polarized\nlight of background radio sources passing through the magnetized CGM of\nintervening galaxies can be used as a tracer for the strength and extent of\nmagnetic fields around galaxies. We use rotation measures observed by the\nMIGHTEE-POL (MeerKAT International GHz Tiered Extragalactic Exploration\nPOLarisation) survey by MeerKAT in the XMM-LSS and COSMOS fields to investigate\nthe RM around foreground star-forming galaxies. We use spectroscopic catalogs\nof star-forming and blue cloud galaxies to measure the RM of MIGHTEE-POL\nsources as a function of the impact parameter from the intervening galaxy. We\nthen repeat this procedure using a deeper galaxy catalog with photometric\nredshifts. For the spectroscopic star-forming sample we find a\nredshift-corrected |RM| excess of 5.6 +/- 2.3 rad m-2 which corresponds to a\n2.5 sigma significance around galaxies with a median redshift of z = 0.46 for\nimpact parameters below 130 kpc only selecting the intervenor with the smallest\nimpact parameter. Making use of a photometric galaxy catalog and taking into\naccount all intervenors with Mg < -13.6 mag, the signal disappears. We find no\nindication for a correlation between redshift and RM, nor do we find a\nconnection between the total number of intervenors to the total |RM| . We have\npresented tentative evidence that the CGM of star-forming galaxies is permeated\nby coherent magnetic fields within the virial radius. We conclude that mostly\nbright, star-forming galaxies with impact parameters less than 130 kpc\nsignificantly contribute to the RM of the background radio source.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:30:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["B\u00f6ckmann","K.",""],["Br\u00fcggen","M.",""],["Heesen","V.",""],["Basu","A.",""],["O'Sullivan","S. P.",""],["Heywood","I.",""],["Jarvis","M.",""],["Scaife","A.",""],["Stil","J.",""],["Taylor","R.",""],["Adams","N. J.",""],["Bowler","R. A. A.",""],["Tudorache","M. N.",""]]}
{"id":"2308.11392","submitter":"Marco Martorano","authors":"Marco Martorano, Arjen van der Wel, Eric F. Bell, Marijn Franx,\n  Katherine E. Whitaker, Angelos Nersesian, Sedona H. Price, Maarten Baes,\n  Katherine A. Suess, Erica J. Nelson, Tim B. Miller, Rachel Bezanson, Gabriel\n  Brammer","title":"Rest-Frame Near-Infrared Radial Light Profiles up to z=3 from\n  JWST/NIRCam: Wavelength Dependence of the S\\'ersic Index","comments":"15 pages, 7 figures, Submitted to ApJ. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the wavelength dependence of radial light profiles based on\nS\\'ersic index $n$ measurements of 1067 galaxies with M$_*\\geq$\n10$^{9.5}$M$_\\odot$ and in the redshift range $0.5 < z < 3$. The sample and\nrest-frame optical light profiles are drawn from CANDELS$+$3D-HST; rest-frame\nnear-infrared light profiles are inferred from CEERS JWST/NIRCam imaging. $n$\nshows only weak dependence on wavelength, regardless of redshift, galaxy mass\nand type: on average, star-forming galaxies have $n = 1-1.5$ and quiescent\ngalaxies have $n = 3-4$ in the rest-frame optical and near-infrared. The strong\ncorrelation at all wavelengths between $n$ and star-formation activity implies\na physical connection between the radial stellar mass profile and\nstar-formation activity. The main caveat is that the current sample is too\nsmall to discern trends for the most massive galaxies (M$_* > 10^{11}M_\\odot$).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:31:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Martorano","Marco",""],["van der Wel","Arjen",""],["Bell","Eric F.",""],["Franx","Marijn",""],["Whitaker","Katherine E.",""],["Nersesian","Angelos",""],["Price","Sedona H.",""],["Baes","Maarten",""],["Suess","Katherine A.",""],["Nelson","Erica J.",""],["Miller","Tim B.",""],["Bezanson","Rachel",""],["Brammer","Gabriel",""]]}
{"id":"2308.11393","submitter":"Ilya Molchanov","authors":"Andrii Ilienko, Ilya Molchanov, Riccardo Turin","title":"Strong limit theorems for empirical halfspace depth trimmed regions","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.MG math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study empirical variants of the halfspace (Tukey) depth of a probability\nmeasure $\\mu$, which are obtained by replacing $\\mu$ with the corresponding\nweighted empirical measure. We prove analogues of the Marcinkiewicz--Zygmund\nstrong law of large numbers and of the law of the iterated logarithm in terms\nof set inclusions and for the Hausdorff distance between the theoretical and\nempirical variants of depth trimmed regions. In the special case of $\\mu$ being\nthe uniform distribution on a convex body $K$, the depth trimmed regions are\nconvex floating bodies of $K$, and we obtain strong limit theorems for their\nempirical estimators.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:32:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ilienko","Andrii",""],["Molchanov","Ilya",""],["Turin","Riccardo",""]]}
{"id":"2308.11394","submitter":"Laetitia Delrez","authors":"L. Delrez, A. Leleu, A. Brandeker, M. Gillon, M. J. Hooton, A. Collier\n  Cameron, A. Deline, A. Fortier, D. Queloz, A. Bonfanti, V. Van Grootel, T. G.\n  Wilson, J. A. Egger, Y. Alibert, R. Alonso, G. Anglada, J. Asquier, T.\n  B\\'arczy, D. Barrado y Navascues, S. C. C. Barros, W. Baumjohann, M. Beck, T.\n  Beck, W. Benz, N. Billot, X. Bonfils, L. Borsato, C. Broeg, M. Buder, J.\n  Cabrera, V. Cessa, S. Charnoz, Sz. Csizmadia, P. E. Cubillos, M. B. Davies,\n  M. Deleuil, O. D. S. Demangeon, B.-O. Demory, D. Ehrenreich, A. Erikson, L.\n  Fossati, M. Fridlund, D. Gandolfi, M. G\\\"udel, J. Hasiba, S. Hoyer, K. G.\n  Isaak, J. M. Jenkins, L. L. Kiss, J. Laskar, D. W. Latham, A. Lecavelier des\n  Etangs, M. Lendl, C. Lovis, R. Luque, D. Magrin, P. F. L. Maxted, C.\n  Mordasini, V. Nascimbeni, G. Olofsson, R. Ottensamer, I. Pagano, E. Pall\\'e,\n  G. Peter, G. Piotto, D. Pollacco, R. Ragazzoni, N. Rando, H. Rauer, I. Ribas,\n  G. Ricker, N. C. Santos, G. Scandariato, S. Seager, D. S\\'egransan, A. E.\n  Simon, A. M. S. Smith, S. G. Sousa, M. Steller, Gy. M. Szab\\'o, N. Thomas, S.\n  Udry, R. Vanderspek, J. Venturini, V. Viotto, N. A. Walton, J. N. Winn","title":"Refining the properties of the TOI-178 system with CHEOPS and TESS","comments":"20 pages, 5 figures, 9 tables. Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The TOI-178 system consists of a nearby late K-dwarf transited by six planets\nin the super-Earth to mini-Neptune regime, with orbital periods between 1.9 and\n20.7 days. All planets but the innermost one form a chain of Laplace\nresonances. Mass estimates derived from a preliminary radial velocity (RV)\ndataset suggest that the planetary densities do not decrease in a monotonic way\nwith the orbital distance to the star, contrary to what one would expect based\non simple formation and evolution models. To improve the characterisation of\nthis key system and prepare for future studies (in particular with JWST), we\nperform a detailed photometric study based on 40 new CHEOPS visits, one new\nTESS sector, as well as previously published CHEOPS, TESS, and NGTS data. First\nwe perform a global analysis of the 100 transits contained in our data to\nrefine the transit parameters of the six planets and study their transit timing\nvariations (TTVs). We then use our extensive dataset to place constraints on\nthe radii and orbital periods of potential additional transiting planets in the\nsystem. Our analysis significantly refines the transit parameters of the six\nplanets, most notably their radii, for which we now obtain relative precisions\n$\\lesssim$3%, with the exception of the smallest planet $b$ for which the\nprecision is 5.1%. Combined with the RV mass estimates, the measured TTVs allow\nus to constrain the eccentricities of planets $c$ to $g$, which are found to be\nall below 0.02, as expected from stability requirements. Taken alone, the TTVs\nalso suggest a higher mass for planet $d$ than the one estimated from the RVs,\nwhich had been found to yield a surprisingly low density for this planet.\nHowever, the masses derived from the current TTV dataset are very\nprior-dependent and further observations, over a longer temporal baseline, are\nneeded to deepen our understanding of this iconic planetary system.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:35:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Delrez","L.",""],["Leleu","A.",""],["Brandeker","A.",""],["Gillon","M.",""],["Hooton","M. J.",""],["Cameron","A. Collier",""],["Deline","A.",""],["Fortier","A.",""],["Queloz","D.",""],["Bonfanti","A.",""],["Van Grootel","V.",""],["Wilson","T. G.",""],["Egger","J. A.",""],["Alibert","Y.",""],["Alonso","R.",""],["Anglada","G.",""],["Asquier","J.",""],["B\u00e1rczy","T.",""],["Navascues","D. Barrado y",""],["Barros","S. C. C.",""],["Baumjohann","W.",""],["Beck","M.",""],["Beck","T.",""],["Benz","W.",""],["Billot","N.",""],["Bonfils","X.",""],["Borsato","L.",""],["Broeg","C.",""],["Buder","M.",""],["Cabrera","J.",""],["Cessa","V.",""],["Charnoz","S.",""],["Csizmadia","Sz.",""],["Cubillos","P. E.",""],["Davies","M. B.",""],["Deleuil","M.",""],["Demangeon","O. D. S.",""],["Demory","B. -O.",""],["Ehrenreich","D.",""],["Erikson","A.",""],["Fossati","L.",""],["Fridlund","M.",""],["Gandolfi","D.",""],["G\u00fcdel","M.",""],["Hasiba","J.",""],["Hoyer","S.",""],["Isaak","K. G.",""],["Jenkins","J. M.",""],["Kiss","L. L.",""],["Laskar","J.",""],["Latham","D. W.",""],["Etangs","A. Lecavelier des",""],["Lendl","M.",""],["Lovis","C.",""],["Luque","R.",""],["Magrin","D.",""],["Maxted","P. F. L.",""],["Mordasini","C.",""],["Nascimbeni","V.",""],["Olofsson","G.",""],["Ottensamer","R.",""],["Pagano","I.",""],["Pall\u00e9","E.",""],["Peter","G.",""],["Piotto","G.",""],["Pollacco","D.",""],["Ragazzoni","R.",""],["Rando","N.",""],["Rauer","H.",""],["Ribas","I.",""],["Ricker","G.",""],["Santos","N. C.",""],["Scandariato","G.",""],["Seager","S.",""],["S\u00e9gransan","D.",""],["Simon","A. E.",""],["Smith","A. M. S.",""],["Sousa","S. G.",""],["Steller","M.",""],["Szab\u00f3","Gy. M.",""],["Thomas","N.",""],["Udry","S.",""],["Vanderspek","R.",""],["Venturini","J.",""],["Viotto","V.",""],["Walton","N. A.",""],["Winn","J. N.",""]]}
{"id":"2308.11395","submitter":"Shyamali Mitra","authors":"Aadarsh G. Goenka, Shyamali Mitra, Mrinal K. Naskar, Nibaran Das","title":"ULGss: A Strategy to construct a Library of Universal Logic Gates for\n  $N$-variable Boolean Logic beyond NAND and NOR","comments":"8 pages 10 tables 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In literature, NAND and NOR are two logic gates that display functional\ncompleteness, hence regarded as Universal gates. So, the present effort is\nfocused on exploring a library of universal gates in binary that are still\nunexplored in literature along with a broad and systematic approach to classify\nthe logic connectives. The study shows that the number of Universal Gates in\nany logic system grows exponentially with the number of input variables $N$. It\nis revealed that there are $56$ Universal gates in binary for $N=3$. It is\nshown that the ratio of the count of Universal gates to the total number of\nLogic gates is $\\approx $ $\\frac{1}{4}$ or 0.25. Adding constants $0,1$ allow\nfor the creation of $4$ additional (for $N=2$) and $169$ additional Universal\nGates (for $N=3$). In this article, the mathematical and logical underpinnings\nof the concept of universal logic gates are presented, along with a search\nstrategy $ULG_{SS}$ exploring multiple paths leading to their identification. A\nfast-track approach has been introduced that uses the hexadecimal\nrepresentation of a logic gate to quickly ascertain its attribute.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:36:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Goenka","Aadarsh G.",""],["Mitra","Shyamali",""],["Naskar","Mrinal K.",""],["Das","Nibaran",""]]}
{"id":"2308.11396","submitter":"Kaiwen Ning","authors":"Zibin Zheng, Kaiwen Ning, Jiachi Chen, Yanlin Wang, Wenqing Chen,\n  Lianghong Guo and Weicheng Wang","title":"Towards an Understanding of Large Language Models in Software\n  Engineering Tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have drawn widespread attention and research due\nto their astounding performance in tasks such as text generation and reasoning.\nDerivative products, like ChatGPT, have been extensively deployed and highly\nsought after. Meanwhile, the evaluation and optimization of LLMs in software\nengineering tasks, such as code generation, have become a research focus.\nHowever, there is still a lack of systematic research on the application and\nevaluation of LLMs in the field of software engineering. Therefore, this paper\nis the first to comprehensively investigate and collate the research and\nproducts combining LLMs with software engineering, aiming to answer two\nquestions: (1) What are the current integrations of LLMs with software\nengineering? (2) Can LLMs effectively handle software engineering tasks? To\nfind the answers, we have collected related literature as extensively as\npossible from seven mainstream databases, and selected 123 papers for analysis.\nWe have categorized these papers in detail and reviewed the current research\nstatus of LLMs from the perspective of seven major software engineering tasks,\nhoping this will help researchers better grasp the research trends and address\nthe issues when applying LLMs. Meanwhile, we have also organized and presented\npapers with evaluation content to reveal the performance and effectiveness of\nLLMs in various software engineering tasks, providing guidance for researchers\nand developers to optimize.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:37:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zheng","Zibin",""],["Ning","Kaiwen",""],["Chen","Jiachi",""],["Wang","Yanlin",""],["Chen","Wenqing",""],["Guo","Lianghong",""],["Wang","Weicheng",""]]}
{"id":"2308.11397","submitter":"Weitong Wang","authors":"Weitong Wang","title":"Ordering of number fields and distribution of class groups: abelian\n  extensions","comments":"Any comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When p divides the ordering of Galois group, the distribution of the Sylow\np-subgroup of Cl(K) is closely related to the problem of counting fields with\ncertain specifications. Moreover, different orderings of number fields affect\nthe answers of such questions in a nontrivial way. So, in this paper, we set up\nan invariant of number fields with parameters, and consider field counting\nproblems with specifications while the parameters change as a variable. The\ncase of abelian extensions shows that, roughly speaking, the result of counting\nabelian fields is a function of the invariant with parameters.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:37:59 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:58:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Weitong",""]]}
{"id":"2308.11398","submitter":"Pavel Strunz","authors":"Pavel Strunz","title":"Interior solution of azimuthally symmetric case of Laplace equation in\n  orthogonal similar oblate spheroidal coordinates","comments":"36 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph astro-ph.EP astro-ph.GA math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Curvilinear coordinate systems distinct from the rectangular Cartesian\ncoordinate system are particularly valuable in the field calculations as they\nfacilitate the expression of boundary conditions of differential equations in a\nreasonably simple way when the coordinate surfaces fit the physical boundaries\nof the problem. The recently finalized orthogonal similar oblate spheroidal\n(SOS) coordinate system can be particularly useful for a physical processes\ndescription inside or in the vicinity of the bodies with the geometry of an\noblate spheroid. Such shape is aproximating well objects investigated within\nastrophysics. The solution of the azimuthally symmetric case of the Laplace\nequation was found for the interior space in the orthogonal SOS coordinates. In\nthe frame of the derivation of the harmonic functions, the Laplace equation was\nseparated by a special separation procedure. A generalized Legendre equation\nwas introduced as the equation for the angular part of the separated Laplace\nequation. The harmonic functions were determined as relations involving\ngeneralized Legendre functions of the first and of the second kind. Several\nlower-degree functions are reported. Recursion formula facilitating\ndetermination of the higher-degree harmonic functions was found. The general\nsolution of the azimuthally symmetric Laplace equation for the interior space\nin the SOS coordinates is reported.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:38:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Strunz","Pavel",""]]}
{"id":"2308.11399","submitter":"Antti K\\\"aenm\\\"aki","authors":"Bal\\'azs B\\'ar\\'any, Antti K\\\"aenm\\\"aki, Aleksi Py\\\"or\\\"al\\\"a, Meng Wu","title":"Scaling limits of self-conformal measures","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that any self-conformal measure $\\mu$ on $\\mathbb{R}$ is uniformly\nscaling and generates an ergodic fractal distribution. This generalizes\nexisting results by removing the need for any separation condition. We also\nobtain applications to the prevalence of normal numbers in self-conformal sets,\nthe resonance between self-conformal measures on the line, and projections of\nself-affine measures on carpets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:39:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["B\u00e1r\u00e1ny","Bal\u00e1zs",""],["K\u00e4enm\u00e4ki","Antti",""],["Py\u00f6r\u00e4l\u00e4","Aleksi",""],["Wu","Meng",""]]}
{"id":"2308.11400","submitter":"Maryam Khosravian","authors":"Maryam Khosravian, Rouven Koch, and Jose L. Lado","title":"Hamiltonian learning with real-space impurity tomography in topological\n  moire superconductors","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extracting Hamiltonian parameters from available experimental data is a\nchallenge in quantum materials. In particular, real-space spectroscopy methods\nsuch as scanning tunneling spectroscopy allow probing electronic states with\natomic resolution, yet even in those instances extracting effective Hamiltonian\nis an open challenge. Here we show that impurity states in modulated systems\nprovide a promising approach to extracting non-trivial Hamiltonian parameters\nof a quantum material. We show that by combining the real-space spectroscopy of\ndifferent impurity locations in a moire topological superconductor, modulations\nof exchange and superconducting parameters can be inferred via machine\nlearning. We demonstrate our strategy with a physically-inspired harmonic\nexpansion combined with a fully-connected neural network that we benchmark\nagainst a conventional convolutional architecture. We show that while both\napproaches allow extracting exchange modulations, only the former approach\nallows inferring the features of the superconducting order. Our results\ndemonstrate the potential of machine learning methods to extract Hamiltonian\nparameters by real-space impurity spectroscopy as local probes of a topological\nstate.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:41:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Khosravian","Maryam",""],["Koch","Rouven",""],["Lado","Jose L.",""]]}
{"id":"2308.11401","submitter":"Matthias Pfretzschner","authors":"Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter","title":"Parameterized Complexity of Simultaneous Planarity","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given $k$ input graphs $G_1, \\dots ,G_k$, where each pair $G_i$, $G_j$ with\n$i \\neq j$ shares the same graph $G$, the problem Simultaneous Embedding With\nFixed Edges (SEFE) asks whether there exists a planar drawing for each input\ngraph such that all drawings coincide on $G$. While SEFE is still open for the\ncase of two input graphs, the problem is NP-complete for $k \\geq 3$ [Schaefer,\nJGAA 13]. In this work, we explore the parameterized complexity of SEFE. We\nshow that SEFE is FPT with respect to $k$ plus the vertex cover number or the\nfeedback edge set number of the the union graph $G^\\cup = G_1 \\cup \\dots \\cup\nG_k$. Regarding the shared graph $G$, we show that SEFE is NP-complete, even if\n$G$ is a tree with maximum degree 4. Together with a known NP-hardness\nreduction [Angelini et al., TCS 15], this allows us to conclude that several\nparameters of $G$, including the maximum degree, the maximum number of degree-1\nneighbors, the vertex cover number, and the number of cutvertices are\nintractable. We also settle the tractability of all pairs of these parameters.\nWe give FPT algorithms for the vertex cover number plus either of the first two\nparameters and for the number of cutvertices plus the maximum degree, whereas\nwe prove all remaining combinations to be intractable.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:42:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fink","Simon D.",""],["Pfretzschner","Matthias",""],["Rutter","Ignaz",""]]}
{"id":"2308.11402","submitter":"Rui Ding","authors":"Fuhui Zhou, Rui Ding, Qihui Wu, Derrick Wing Kwan Ng, Kai-Kit Wong,\n  and Naofal Al-Dhahir","title":"A Partially Observable Deep Multi-Agent Active Inference Framework for\n  Resource Allocation in 6G and Beyond Wireless Communications Networks","comments":"Some technical errors occured in the manuscript","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Resource allocation is of crucial importance in wireless communications.\nHowever, it is extremely challenging to design efficient resource allocation\nschemes for future wireless communication networks since the formulated\nresource allocation problems are generally non-convex and consist of various\ncoupled variables. Moreover, the dynamic changes of practical wireless\ncommunication environment and user service requirements thirst for efficient\nreal-time resource allocation. To tackle these issues, a novel partially\nobservable deep multi-agent active inference (PODMAI) framework is proposed for\nrealizing intelligent resource allocation. A belief based learning method is\nexploited for updating the policy by minimizing the variational free energy. A\ndecentralized training with a decentralized execution multi-agent strategy is\ndesigned to overcome the limitations of the partially observable state\ninformation. Exploited the proposed framework, an intelligent spectrum\nallocation and trajectory optimization scheme is developed for a spectrum\nsharing unmanned aerial vehicle (UAV) network with dynamic transmission rate\nrequirements as an example. Simulation results demonstrate that our proposed\nframework can significantly improve the sum transmission rate of the secondary\nnetwork compared to various benchmark schemes. Moreover, the convergence speed\nof the proposed PODMAI is significantly improved compared with the conventional\nreinforcement learning framework. Overall, our proposed framework can enrich\nthe intelligent resource allocation frameworks and pave the way for realizing\nreal-time resource allocation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:50:00 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 07:53:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Fuhui",""],["Ding","Rui",""],["Wu","Qihui",""],["Ng","Derrick Wing Kwan",""],["Wong","Kai-Kit",""],["Al-Dhahir","Naofal",""]]}
{"id":"2308.11403","submitter":"Ann-Kathrin Perrevoort","authors":"Ann-Kathrin Perrevoort (for the Mu3e Collaboration)","title":"Searching for Charged Lepton Flavour Violation with Mu3e","comments":"6 pages, 5 figures, proceedings of the 23rd International Workshop on\n  Neutrinos from Accelerators (NuFACT 2022)","journal-ref":"Physical Sciences Forum. 2023; 8(1):30","doi":"10.3390/psf2023008030","report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The observation of lepton flavour violation (LFV) in the charged lepton\nsector would be an unambiguous sign of physics beyond the Standard Model (BSM),\nand thus, it is the channel of choice for many BSM searches. LFV searches in\nmuon decays in particular benefit from the fact that muons can be easily\nproduced at high rates. There is a global effort to search for LFV at\nhigh-intensity muon sources to which the upcoming Mu3e experiment at the Paul\nScherrer Institute (PSI) will contribute. The Mu3e Collaboration aims to\nperform a background-free search for the LFV decay $\\mu^+\\to e^+e^-e^+$ with an\nunprecedented sensitivity in the order of $10^{-15}$ in the first phase of\noperation and $10^{-16}$ in the final phase - an improvement over the preceding\nSINDRUM experiment by four orders of magnitude. The high muon stopping rates\nand low momenta of the decay electrons make high demands on momentum and time\nresolution and on the data acquisition. The innovative experimental concept is\nbased on a tracking detector built from novel ultra-thin silicon pixel sensors\nand scintillating fibres and tiles as well as online event reconstruction and\nfiltering in real time.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:50:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Perrevoort","Ann-Kathrin","","for the Mu3e Collaboration"]]}
{"id":"2308.11404","submitter":"Margareta Wagner","authors":"Hao Chen, Matthias A. Blatnik, Christian L. Ritterhoff, Igor\n  Sokolovi\\'c, Francesca Mirabella, Giada Franceschi, Michele Riva, Michael\n  Schmid, Jan \\v{C}echal, Bernd Meyer, Ulrike Diebold, and Margareta Wagner","title":"Water Structures Reveal Local Hydrophobicity on the In2O3(111) Surface","comments":null,"journal-ref":"ACS Nano 16, 2022, 21163-21173","doi":"10.1021/acsnano.2c09115","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Clean oxide surfaces are generally hydrophilic. Water molecules anchor at\nundercoordinated surface metal atoms that act as Lewis-acid sites, and they are\nstabilized by H bonds to undercoordinated surface oxygens. The large unit cell\nof In2O3(111) provides surface atoms in various configurations, which leads to\nchemical heterogeneity and a local deviation from this general rule.\nExperiments (TPD, XPS, ncAFM) agree quantitatively with DFT calculations and\nshow a series of distinct phases. The first three water molecules dissociate at\none specific area of the unit cell and desorb above room temperature. The next\nthree adsorb as molecules in the adjacent region. Three more water molecules\nrearrange this structure and an additional nine pile up above the OH groups.\nDespite offering undercoordinated In and O sites, the rest of the unit cell is\nunfavorable for adsorption and remains water-free. The first water layer thus\nshows ordering into nanoscopic 3D water clusters separated by hydrophobic\npockets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:51:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Hao",""],["Blatnik","Matthias A.",""],["Ritterhoff","Christian L.",""],["Sokolovi\u0107","Igor",""],["Mirabella","Francesca",""],["Franceschi","Giada",""],["Riva","Michele",""],["Schmid","Michael",""],["\u010cechal","Jan",""],["Meyer","Bernd",""],["Diebold","Ulrike",""],["Wagner","Margareta",""]]}
{"id":"2308.11405","submitter":"Shahid Shah","authors":"Shifa Showkat, Zahid Bashir Dar and Shahid Mehraj Shah","title":"Achievable Sum-rate of variants of QAM over Gaussian Multiple Access\n  Channel with and without security","comments":"11 Figures, two tables. Accepted for publication in IEEE\n  International Conference on Signal Processing and Computer Vision (SPCV-2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of next generation wireless systems (5G/6G and beyond) at the\nphysical layer is primarily driven by the choice of digital modulation\ntechniques that are bandwidth and power efficient, while maintaining high data\nrates. Achievable rates for Gaussian input and some finite constellations\n(BPSK/QPSK/QAM) are well studied in the literature. However, new variants of\nQuadrature Amplitude Modulation (QAM) such as Cross-QAM (XQAM), Star-QAM\n(S-QAM), Amplitude and phase shift keying (APSK), and Hexagonal Quadrature\nAmplitude Modulation (H-QAM) are not studied in the context of achievable rates\nfor meeting the demand of high data rates. In this paper, we study achievable\nrate region for different variants of M-QAM like Cross-QAM, H-QAM, Star-QAM and\nAPSK. We also compute mutual information corresponding to the sum rate of\nGaussian Multiple Access Channel (G-MAC), for hybrid constellation scheme,\ne.g., user 1 transmits using Star-QAM and user 2 by H-QAM. From the results, it\nis observed that S-QAM gives the maximum sum-rate when users transmit same\nconstellations. Also, it has been found that when hybrid constellation is used,\nthe combination of Star-QAM \\& H-QAM gives the maximum rate. In the next part\nof the paper, we consider a scenario wherein an adversary is also present at\nthe receiver side and is trying to decode the information. We model this\nscenario as Gaussian Multiple Access Wiretap Channel (G-MAW-WT). We then\ncompute the achievable secrecy sum rate of two user G-MAC-WT with discrete\ninputs from different variants of QAM (viz, X-QAM, H-QAM and S-QAM).It has been\nfound that at higher values of SNR, S-QAM gives better values of SSR than the\nother variants. For hybrid inputs of QAM, at lower values of SNR, combination\nof APSK and S-QAM gives better results and at higher values of SNR, combination\nof HQAM and APSK gives greater value of SSR.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:53:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Showkat","Shifa",""],["Dar","Zahid Bashir",""],["Shah","Shahid Mehraj",""]]}
{"id":"2308.11406","submitter":"Alexey Zaytsev","authors":"Alexey Zaytsev, Alex Natekin, Evgeni Vorsin, Valerii Smirnov, Georgii\n  Smirnov, Oleg Sidorshin, Alexander Senin, Alexander Dudin, Dmitry Berestnev","title":"Designing an attack-defense game: how to increase robustness of\n  financial transaction models via a competition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR q-fin.ST","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Given the escalating risks of malicious attacks in the finance sector and the\nconsequential severe damage, a thorough understanding of adversarial strategies\nand robust defense mechanisms for machine learning models is critical. The\nthreat becomes even more severe with the increased adoption in banks more\naccurate, but potentially fragile neural networks. We aim to investigate the\ncurrent state and dynamics of adversarial attacks and defenses for neural\nnetwork models that use sequential financial data as the input.\n  To achieve this goal, we have designed a competition that allows realistic\nand detailed investigation of problems in modern financial transaction data.\nThe participants compete directly against each other, so possible attacks and\ndefenses are examined in close-to-real-life conditions. Our main contributions\nare the analysis of the competition dynamics that answers the questions on how\nimportant it is to conceal a model from malicious users, how long does it take\nto break it, and what techniques one should use to make it more robust, and\nintroduction additional way to attack models or increase their robustness.\n  Our analysis continues with a meta-study on the used approaches with their\npower, numerical experiments, and accompanied ablations studies. We show that\nthe developed attacks and defenses outperform existing alternatives from the\nliterature while being practical in terms of execution, proving the validity of\nthe competition as a tool for uncovering vulnerabilities of machine learning\nmodels and mitigating them in various domains.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:53:09 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:00:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zaytsev","Alexey",""],["Natekin","Alex",""],["Vorsin","Evgeni",""],["Smirnov","Valerii",""],["Smirnov","Georgii",""],["Sidorshin","Oleg",""],["Senin","Alexander",""],["Dudin","Alexander",""],["Berestnev","Dmitry",""]]}
{"id":"2308.11407","submitter":"Pinjun Zheng","authors":"Pinjun Zheng, Xing Liu, Tarig Ballal, and Tareq Y. Al-Naffouri","title":"Attitude Determination in Urban Canyons: A Synergy between GNSS and 5G\n  Observations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers the attitude determination problem based on the global\nnavigation satellite system (GNSS) and fifth-generation (5G) measurement fusion\nto address the shortcomings of standalone GNSS and 5G techniques in deep urban\nregions. The tight fusion of the GNSS and the 5G observations results in a\nunique hybrid integer- and orthonormality-constrained optimization problem. To\nsolve this problem, we propose an estimation method consisting of the steps of\nfloat solution computation, ambiguity resolution, and fixed solution\ncomputation. Numerical results reveal that the proposed method can effectively\nimprove the attitude determination accuracy and reliability compared to either\nthe pure GNSS solution or the pure 5G solution.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:53:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zheng","Pinjun",""],["Liu","Xing",""],["Ballal","Tarig",""],["Al-Naffouri","Tareq Y.",""]]}
{"id":"2308.11408","submitter":"Giuseppe Vecchio","authors":"Giuseppe Vecchio, Renato Sortino, Simone Palazzo, Concetto Spampinato","title":"MatFuse: Controllable Material Generation with Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Creating high quality and realistic materials in computer graphics is a\nchallenging and time-consuming task, which requires great expertise. In this\npaper, we present MatFuse, a novel unified approach that harnesses the\ngenerative power of diffusion models (DM) to simplify the creation of SVBRDF\nmaps. Our DM-based pipeline integrates multiple sources of conditioning, such\nas color palettes, sketches, and pictures, enabling fine-grained control and\nflexibility in material synthesis. This design allows for the combination of\ndiverse information sources (e.g., sketch + image embedding), enhancing\ncreative possibilities in line with the principle of compositionality. We\ndemonstrate the generative capabilities of the proposed method under various\nconditioning settings; on the SVBRDF estimation task, we show that our method\nyields performance comparable to state-of-the-art approaches, both\nqualitatively and quantitatively.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:54:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Vecchio","Giuseppe",""],["Sortino","Renato",""],["Palazzo","Simone",""],["Spampinato","Concetto",""]]}
{"id":"2308.11409","submitter":"Yongling Zhao","authors":"Yuhan Jiang, Yongling Zhao, Jan Carmeliet, Bingchuan Nie, Feng Xu","title":"Critical transitions on route to chaos of natural convection on a heated\n  horizontal circular surface","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The transition route and bifurcations of the buoyant flow developing on a\nheated circular horizontal surface are elaborated using direct numerical\nsimulations and direct stability analysis. A series of bifurcations, as a\nfunction of Rayleigh numbers (Ra) ranging from $10^1$ to $6\\times10^7$, are\nfound on the route to the chaos of the flow at $Pr=7$. When $Ra<1.0\\times10^3$,\nthe buoyant flow above the heated horizontal surface is dominated by\nconduction, because of which distinct thermal boundary layer and plume are not\npresent. At $Ra=1.1\\times10^6$, a Hopf bifurcation occurs, resulting in the\nflow transition from a steady state to a periodic puffing state. As Ra\nincreases further, the flow enters a periodic rotating state at\n$Ra=1.9\\times10^6$, which is a unique state that was rarely discussed in the\nliterature. These critical transitions, leaving from a steady state and\nsubsequently entering a series of periodic states (puffing, rotating, flapping\nand doubling) and finally leading to chaos, are diagnosed using spectral\nanalysis and two-dimensional Fourier Transform (2DFT). Moreover, direct\nstability analysis is conducted by introducing random numerical perturbations\ninto the boundary condition of the surface heating. We find that when the state\nof a flow is in the vicinity of bifurcation points (e.g., $Ra=2.0\\times10^6$),\nthe flow is conditionally unstable to perturbations, and it can bifurcate from\nthe rotating state to the flapping state in advance. However, for relatively\nstable flow states, such as at $Ra=1.5\\times10^6$, the flow remains its\nperiodic puffing state even though it is being perturbed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:54:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jiang","Yuhan",""],["Zhao","Yongling",""],["Carmeliet","Jan",""],["Nie","Bingchuan",""],["Xu","Feng",""]]}
{"id":"2308.11410","submitter":"Adeela Afzal","authors":"Adeela Afzal, Maria Mehmood, Mansoor Ur Rehman, Qaiser Shafi","title":"Supersymmetric hybrid inflation and metastable cosmic strings in\n  $SU(4)_c \\times SU(2)_L \\times U(1)_R$","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a realistic supersymmetric model for superheavy metastable\ncosmic strings (CSs) that can be investigated in the current pulsar timing\narray (PTA) experiments. We consider shifted $\\mu$ hybrid inflation in which\nthe symmetry breaking $SU(4)_c \\times SU(2)_L \\times U(1)_R\\rightarrow\nSU(3)_c\\times SU(2)_L \\times U(1)_{B-L}\\times U(1)_R$ proceeds along an\ninflationary trajectory such that the topologically unstable primordial\nmonopoles are inflated away. The breaking of $U(1)_{B-L} \\times U(1)_R\n\\rightarrow U(1)_Y$ after inflation ends yields the metastable CSs that\ngenerate the stochastic gravitational wave background (SGWB) which is\nconsistent with the current PTA data set. The scalar spectral index $n_s$ and\nthe tensor to scalar ratio $r$ are also compatible with Planck 2018. We briefly\ndiscuss both reheating and leptogenesis in this model.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:56:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Afzal","Adeela",""],["Mehmood","Maria",""],["Rehman","Mansoor Ur",""],["Shafi","Qaiser",""]]}
{"id":"2308.11411","submitter":"Hongyin Zhu","authors":"Hongyin Zhu","title":"Extracting Relational Triples Based on Graph Recursive Neural Network\n  via Dynamic Feedback Forest Algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extracting relational triples (subject, predicate, object) from text enables\nthe transformation of unstructured text data into structured knowledge. The\nnamed entity recognition (NER) and the relation extraction (RE) are two\nfoundational subtasks in this knowledge generation pipeline. The integration of\nsubtasks poses a considerable challenge due to their disparate nature. This\npaper presents a novel approach that converts the triple extraction task into a\ngraph labeling problem, capitalizing on the structural information of\ndependency parsing and graph recursive neural networks (GRNNs). To integrate\nsubtasks, this paper proposes a dynamic feedback forest algorithm that connects\nthe representations of subtasks by inference operations during model training.\nExperimental results demonstrate the effectiveness of the proposed method.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:00:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhu","Hongyin",""]]}
{"id":"2308.11412","submitter":"Federico Ripani","authors":"Matteo Becchetti, Roberto Bonciani, Leandro Cieri, Federico Coro,\n  Federico Ripani","title":"Two-loop form factors for diphoton production in quark annihilation\n  channel with heavy quark mass dependence","comments":"23 pages, 5 figures","journal-ref":null,"doi":null,"report-no":"IFIC/23-32, FTUV-23-0808.6381","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the computation of the two-loop form factors for diphoton\nproduction in the quark annihilation channel. These quantities are relevant for\nthe NNLO QCD corrections to diphoton production at LHC recently presented in\narXiv:2308.10885. The computation is performed retaining full dependence on the\nmass of the heavy quark in the loops. The master integrals are evaluated by\nmeans of differential equations which are solved exploiting the generalised\npower series technique.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:00:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Becchetti","Matteo",""],["Bonciani","Roberto",""],["Cieri","Leandro",""],["Coro","Federico",""],["Ripani","Federico",""]]}
{"id":"2308.11413","submitter":"Mikhail Borovoi","authors":"Mikhail Borovoi, Bogdan Adrian Dina, and Willem A. de Graaf","title":"Real non-degenerate two-step nilpotent Lie algebras of dimension eight","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.AG math.RA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify the non-degenerate two-step nilpotent Lie algebras of dimension 8\nover the field of real numbers, using known results over complex numbers. We\nwrite explicit structure constants for these real Lie algebras.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:01:23 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 05:18:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Borovoi","Mikhail",""],["Dina","Bogdan Adrian",""],["de Graaf","Willem A.",""]]}
{"id":"2308.11414","submitter":"Chen Jialin","authors":"Jialin Chen, Jiangfan Wang, Yi-feng Yang","title":"Pair density wave, unconventional superconductivity, and non-Fermi\n  liquid quantum critical phase in frustrated Kondo lattice","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the recent discovery of an intermediate quantum critical phase\nbetween the antiferromagnetic order and the Fermi liquid in the frustrated\nKondo lattice CePdAl, we study here a Kondo-Heisenberg chain with frustrated\n$J_1$-$J_2$ XXZ interactions among local spins using the density matrix\nrenormalization group method. Our simulations reveal a global phase diagram\nwith rich ground states including the antiferromagnetic order, the\nvalence-bond-solid and bond-order-wave orders, the pair density wave state, the\nuniform superconducting state, and the Luttinger liquid state. We show that\nboth the pair density wave and uniform superconductivity belong to the family\nof Luther-Emery liquids and may arise from pair instability of an intermediate\nquantum critical phase with medium Fermi volume in the presence of strong\nquantum fluctuations, while the Luttinger liquid has a large Fermi volume. This\nsuggests a deep connection between the pair density wave, the unconventional\nsuperconductivity, and the non-Fermi liquid quantum critical phase.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:01:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Jialin",""],["Wang","Jiangfan",""],["Yang","Yi-feng",""]]}
{"id":"2308.11415","submitter":"Sandra Vianna","authors":"Mateus Rattes Lima da Motta, Gabriel Bi\\'e Alves, Antonio Zelaquett\n  Khoury, Sandra Sampaio Vianna","title":"Poincar\\'e sphere symmetries in four-wave mixing with orbital angular\n  momentum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore a degenerate four-wave mixing process induced by transversely\nstructured light beams in a rubidium vapor cell. In particular, we consider the\nnonlinear interaction driven by optical modes contained in the orbital angular\nmomentum Poincar\\'e sphere, which can be parametrized in terms of a polar and\nan azimuthal angle. In this context we investigate the transfer of spatial\nstructure to two distinct four-wave mixing signals, possessing different\npropagation directions in space. We show that under usual assumptions, the\noutput fields can also be described by modes belonging to Poincar\\'e spheres,\nand that the angles describing the input and output modes are related according\nto well-defined rules. Our experimental results show good agreement with the\ncalculations, which predict intricate field structures and a transition of the\nFWM transverse profile between the near- and far-field regions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:01:42 GMT"}],"update_date":"2023-08-23","authors_parsed":[["da Motta","Mateus Rattes Lima",""],["Alves","Gabriel Bi\u00e9",""],["Khoury","Antonio Zelaquett",""],["Vianna","Sandra Sampaio",""]]}
{"id":"2308.11416","submitter":"Kirill Simonov","authors":"Robert Ganian, Liana Khazaliya, Kirill Simonov","title":"Consistency-Checking Problems: A Gateway to Parameterized Sample\n  Complexity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, Brand, Ganian and Simonov introduced a parameterized refinement of\nthe classical PAC-learning sample complexity framework. A crucial outcome of\ntheir investigation is that for a very wide range of learning problems, there\nis a direct and provable correspondence between fixed-parameter\nPAC-learnability (in the sample complexity setting) and the fixed-parameter\ntractability of a corresponding \"consistency checking\" search problem (in the\nsetting of computational complexity). The latter can be seen as generalizations\nof classical search problems where instead of receiving a single instance, one\nreceives multiple yes- and no-examples and is tasked with finding a solution\nwhich is consistent with the provided examples.\n  Apart from a few initial results, consistency checking problems are almost\nentirely unexplored from a parameterized complexity perspective. In this\narticle, we provide an overview of these problems and their connection to\nparameterized sample complexity, with the primary aim of facilitating further\nresearch in this direction. Afterwards, we establish the fixed-parameter\n(in)-tractability for some of the arguably most natural consistency checking\nproblems on graphs, and show that their complexity-theoretic behavior is\nsurprisingly very different from that of classical decision problems. Our new\nresults cover consistency checking variants of problems as diverse as (k-)Path,\nMatching, 2-Coloring, Independent Set and Dominating Set, among others.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:02:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ganian","Robert",""],["Khazaliya","Liana",""],["Simonov","Kirill",""]]}
{"id":"2308.11417","submitter":"Chandan Yeshwanth","authors":"Chandan Yeshwanth, Yueh-Cheng Liu, Matthias Nie{\\ss}ner, Angela Dai","title":"ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenes","comments":"ICCV 2023. Video: https://youtu.be/E6P9e2r6M8I , Project page:\n  https://cy94.github.io/scannetpp/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present ScanNet++, a large-scale dataset that couples together capture of\nhigh-quality and commodity-level geometry and color of indoor scenes. Each\nscene is captured with a high-end laser scanner at sub-millimeter resolution,\nalong with registered 33-megapixel images from a DSLR camera, and RGB-D streams\nfrom an iPhone. Scene reconstructions are further annotated with an open\nvocabulary of semantics, with label-ambiguous scenarios explicitly annotated\nfor comprehensive semantic understanding. ScanNet++ enables a new real-world\nbenchmark for novel view synthesis, both from high-quality RGB capture, and\nimportantly also from commodity-level images, in addition to a new benchmark\nfor 3D semantic scene understanding that comprehensively encapsulates diverse\nand ambiguous semantic labeling scenarios. Currently, ScanNet++ contains 460\nscenes, 280,000 captured DSLR images, and over 3.7M iPhone RGBD frames.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:02:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yeshwanth","Chandan",""],["Liu","Yueh-Cheng",""],["Nie\u00dfner","Matthias",""],["Dai","Angela",""]]}
{"id":"2308.11418","submitter":"Jia-Rui Guo","authors":"Jia-rui Guo","title":"Relations Between Partition Functions of with Various Gauge Fields from\n  Double Copy Relations in AdS/CFT Correspondence","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we use double copy relation to obtain AdS on-shell gravity\ncoupling to tensor instead of scalar field, giving more complex structures,\nwhich leads to an relation between AdS on-shell gauge field and gauge field in\nCFT. This also provide a comparison from the strong-weak correspondence, which\ncould be applied in matter with QCD and QED fields and their thermodynamics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:03:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Guo","Jia-rui",""]]}
{"id":"2308.11419","submitter":"Jiani Liu","authors":"Jiani Liu, Ce Zhu, Zhen Long, and Yipeng Liu","title":"Tensor Regression","comments":"187 pages, 32 figures, 10 tables","journal-ref":"Foundations and Trends in Machine Learning: Vol. 14: No. 4, pp\n  379-565 (2021)","doi":"10.1561/2200000087.","report-no":null,"categories":"stat.ML cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Regression analysis is a key area of interest in the field of data analysis\nand machine learning which is devoted to exploring the dependencies between\nvariables, often using vectors. The emergence of high dimensional data in\ntechnologies such as neuroimaging, computer vision, climatology and social\nnetworks, has brought challenges to traditional data representation methods.\nTensors, as high dimensional extensions of vectors, are considered as natural\nrepresentations of high dimensional data. In this book, the authors provide a\nsystematic study and analysis of tensor-based regression models and their\napplications in recent years. It groups and illustrates the existing\ntensor-based regression methods and covers the basics, core ideas, and\ntheoretical characteristics of most tensor-based regression methods. In\naddition, readers can learn how to use existing tensor-based regression methods\nto solve specific regression tasks with multiway data, what datasets can be\nselected, and what software packages are available to start related work as\nsoon as possible. Tensor Regression is the first thorough overview of the\nfundamentals, motivations, popular algorithms, strategies for efficient\nimplementation, related applications, available datasets, and software\nresources for tensor-based regression analysis. It is essential reading for all\nstudents, researchers and practitioners of working on high dimensional data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:04:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Jiani",""],["Zhu","Ce",""],["Long","Zhen",""],["Liu","Yipeng",""]]}
{"id":"2308.11420","submitter":"Yuanzhang Xiao","authors":"YuanzhangXiao and ChaithanyaBandi and Ermin Wei","title":"Supply Function Equilibrium in Networked Electricity Markets","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study deregulated power markets with strategic power suppliers. In\nderegulated markets, each supplier submits its supply function (i.e., the\namount of electricity it is willing to produce at various prices) to the\nindependent system operator (ISO), who based on the submitted supply functions,\ndispatches the suppliers to clear the market with minimal total generation\ncost. If all suppliers reported their true marginal cost functions as supply\nfunctions, the market outcome would be efficient (i.e., the total generation\ncost is minimized). However, when suppliers are strategic and aim to maximize\ntheir own profits, the reported supply functions are not necessarily the true\nmarginal cost functions, and the resulting market outcome may be inefficient.\nThe efficiency loss depends crucially on the topology of the underlying\ntransmission network. This paper provides an analytical upper bound of the\nefficiency loss due to strategic suppliers, and proves that the bound is tight\nunder a large class of transmission networks (i.e., weakly cyclic networks).\nOur upper bound sheds light on how the efficiency loss depends on the\ntransmission network topology (e.g., the degrees of nodes, the admittances and\nflow limits of transmission lines).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:06:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["YuanzhangXiao","",""],["ChaithanyaBandi","",""],["Wei","Ermin",""]]}
{"id":"2308.11421","submitter":"Alexander Wong","authors":"Alexander Wong, Saad Abbasi, Saeejith Nair","title":"TurboViT: Generating Fast Vision Transformers via Generative\n  Architecture Search","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision transformers have shown unprecedented levels of performance in\ntackling various visual perception tasks in recent years. However, the\narchitectural and computational complexity of such network architectures have\nmade them challenging to deploy in real-world applications with\nhigh-throughput, low-memory requirements. As such, there has been significant\nresearch recently on the design of efficient vision transformer architectures.\nIn this study, we explore the generation of fast vision transformer\narchitecture designs via generative architecture search (GAS) to achieve a\nstrong balance between accuracy and architectural and computational efficiency.\nThrough this generative architecture search process, we create TurboViT, a\nhighly efficient hierarchical vision transformer architecture design that is\ngenerated around mask unit attention and Q-pooling design patterns. The\nresulting TurboViT architecture design achieves significantly lower\narchitectural computational complexity (>2.47$\\times$ smaller than FasterViT-0\nwhile achieving same accuracy) and computational complexity (>3.4$\\times$ fewer\nFLOPs and 0.9% higher accuracy than MobileViT2-2.0) when compared to 10 other\nstate-of-the-art efficient vision transformer network architecture designs\nwithin a similar range of accuracy on the ImageNet-1K dataset. Furthermore,\nTurboViT demonstrated strong inference latency and throughput in both\nlow-latency and batch processing scenarios (>3.21$\\times$ lower latency and\n>3.18$\\times$ higher throughput compared to FasterViT-0 for low-latency\nscenario). These promising results demonstrate the efficacy of leveraging\ngenerative architecture search for generating efficient transformer\narchitecture designs for high-throughput scenarios.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:08:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wong","Alexander",""],["Abbasi","Saad",""],["Nair","Saeejith",""]]}
{"id":"2308.11422","submitter":"Mingwei Liu","authors":"Mingwei Liu, Yanjun Yang, Yiling Lou, Xin Peng, Zhong Zhou, Xueying\n  Du, Tianyong Yang","title":"Recommending Analogical APIs via Knowledge Graph Embedding","comments":"Accepted by FSE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Library migration, which re-implements the same software behavior by using a\ndifferent library instead of using the current one, has been widely observed in\nsoftware evolution. One essential part of library migration is to find an\nanalogical API that could provide the same functionality as current ones.\nHowever, given the large number of libraries/APIs, manually finding an\nanalogical API could be very time-consuming and error-prone. Researchers have\ndeveloped multiple automated analogical API recommendation techniques.\nDocumentation-based methods have particularly attracted significant interest.\nDespite their potential, these methods have limitations, such as a lack of\ncomprehensive semantic understanding in documentation and scalability\nchallenges. In this work, we propose KGE4AR, a novel documentation-based\napproach that leverages knowledge graph (KG) embedding to recommend analogical\nAPIs during library migration. Specifically, KGE4AR proposes a novel unified\nAPI KG to comprehensively and structurally represent three types of knowledge\nin documentation, which can better capture the high-level semantics. Moreover,\nKGE4AR then proposes to embed the unified API KG into vectors, enabling more\neffective and scalable similarity calculation. We build KGE4AR' s unified API\nKG for 35,773 Java libraries and assess it in two API recommendation scenarios:\nwith and without target libraries. Our results show that KGE4AR substantially\noutperforms state-of-the-art documentation-based techniques in both evaluation\nscenarios in terms of all metrics (e.g., 47.1%-143.0% and 11.7%-80.6% MRR\nimprovements in each scenario). Additionally, we explore KGE4AR' s scalability,\nconfirming its effective scaling with the growing number of libraries.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:12:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Mingwei",""],["Yang","Yanjun",""],["Lou","Yiling",""],["Peng","Xin",""],["Zhou","Zhong",""],["Du","Xueying",""],["Yang","Tianyong",""]]}
{"id":"2308.11423","submitter":"Margareta Wagner","authors":"Margareta Wagner, Fabio Calcinelli, Andreas Jeindl, Michael Schmid,\n  Oliver T. Hofmann, Ulrike Diebold","title":"Adsorption configurations of Co-phthalocyanine on In2O3(111)","comments":null,"journal-ref":"Surface Science 722, 2022, 122065","doi":"10.1016/j.susc.2022.122065","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Indium oxide offers optical transparency paired with electric conductivity, a\ncombination required in many optoelectronic applications. The most-stable\nIn2O3(111) surface has a large unit cell (1.43 nm lattice constant). It\ncontains a mixture of both bulk-like and undercoordinated O and In atoms and\nprovides an ideal playground to explore the interaction of surfaces with\norganic molecules of similar size as the unit cell. Non-contact atomic force\nmicroscopy (nc-AFM), scanning tunneling microscopy (STM), and density\nfunctional theory (DFT) were used to study the adsorption of Co-phthalocyanine\n(CoPc) on In2O3(111). Isolated CoPc molecules adsorb at two adsorption sites in\na 7:3 ratio. The Co atom sits either on top of a surface oxygen ('F\nconfiguration') or indium atom ('S configuration'). This subtle change in\nadsorption site induces bending of the molecules, which is reflected in their\nelectronic structure. According to DFT the lowest unoccupied molecular orbital\nof the undistorted gas-phase CoPc remains mostly unaffected in the F\nconfiguration but is filled by one electron in S configuration. At coverages up\nto one CoPc molecule per substrate unit cell, a mixture of domains with\nmolecules in F and S configuration are found. Molecules at F sites first\ncondense into a F-(2x2) structure and finally rearrange into a F-(1x1) symmetry\nwith partially overlapping molecules, while S-sited molecules only assume a\nS-(1x1) superstructure.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:12:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wagner","Margareta",""],["Calcinelli","Fabio",""],["Jeindl","Andreas",""],["Schmid","Michael",""],["Hofmann","Oliver T.",""],["Diebold","Ulrike",""]]}
{"id":"2308.11424","submitter":"Makayla Lewis","authors":"Makayla Lewis","title":"AIxArtist: A First-Person Tale of Interacting with Artificial\n  Intelligence to Escape Creative Block","comments":"1st International Workshop on Explainable AI for the Arts (XAIxArts),\n  ACM Creativity and Cognition (C&C) 2023. Online, 6 pages.\n  https://xaixarts.github.io","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The future of the arts and artificial intelligence (AI) is promising as\ntechnology advances. As the use of AI in design becomes more widespread, art\npractice may not be a human-only art form and could instead become a digitally\nintegrated experience. With enhanced creativity and collaboration, arts and AI\ncould work together towards creating artistic outputs that are visually\nappealing and meet the needs of the artist and viewer. While it is uncertain\nhow far the integration will go, arts and AI will likely influence one another.\nThis workshop pictorial puts forward first-person research that shares\ninteractions between an HCI researcher and AI as they try to escape the\ncreative block. The pictorial paper explores two questions: How can AI support\nartists' creativity, and what does it mean to be explainable in this context?\nHIs, ChatGPT and Midjourney were engaged; the result was a series of\nreflections that require further discussion and explorations in the XAIxArts\ncommunity: Transparency of attribution, the creation process, ethics of asking,\nand inspiration vs copying.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:15:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lewis","Makayla",""]]}
{"id":"2308.11425","submitter":"Lei Zhang","authors":"Chen Wan and Lei Zhang","title":"A Conjecture for Multiplicities of Strongly Tempered Spherical Varieties","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we form a conjecture about the multiplicities of all the\nstrongly tempered spherical varieties without Type N root for tempered\nrepresentations. This generalizes the epsilon dichotomy conjectures of\nGan-Gross-Prasad and Wan-Zhang.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:17:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wan","Chen",""],["Zhang","Lei",""]]}
{"id":"2308.11426","submitter":"Georg Madsen","authors":"N. Unglert, J. Carrete, L. B. P\\'artay, G. K. H. Madsen","title":"Neural-Network Force Field Backed Nested Sampling: Study of the Silicon\n  p-T Phase Diagram","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nested sampling is a promising method for calculating phase diagrams of\nmaterials, however, the computational cost limits its applicability if\nab-initio accuracy is required. In the present work, we report on the efficient\nuse of a neural-network force field in conjunction with the nested-sampling\nalgorithm. We train our force fields on a recently reported database of silicon\nstructures and demonstrate our approach on the low-pressure region of the\nsilicon pressure-temperature phase diagram between 0 and \\SI{16}{GPa}. The\nsimulated phase diagram shows a good agreement with experimental results,\nclosely reproducing the melting line. Furthermore, all of the experimentally\nstable structures within the investigated pressure range are also observed in\nour simulations. We point out the importance of the choice of\nexchange-correlation functional for the training data and show how the meta-GGA\nr2SCAN plays a pivotal role in achieving accurate thermodynamic behaviour using\nnested-sampling. We furthermore perform a detailed analysis of the exploration\nof the potential energy surface and highlight the critical role of a diverse\ntraining data set.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:17:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Unglert","N.",""],["Carrete","J.",""],["P\u00e1rtay","L. B.",""],["Madsen","G. K. H.",""]]}
{"id":"2308.11427","submitter":"Tatiana Gateva-Ivanova","authors":"Tatiana Gateva-Ivanova and Shahn Majid","title":"Quadratic algebras associated to permutation idempotent solutions of the\n  YBE","comments":"35 pages 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the quadratic algebras $A(K,X,r)$ associated to a class of strictly\nbraided but idempotent set-theoretic solutions $(X,r)$ of the Yang-Baxter or\nbraid relations. In the invertible case, these algebras would be analogues of\nbraided-symmetric algebras or `quantum affine spaces' but due to $r$ being\nidempotent they have very different properties. We show that all algebras\n$A(K,X,r)$ for $r$ of a certain permutation idempotent type are isomorphic for\na given $n=|X|$, leading to canonical algebras $A(K,n)$. We study the\nproperties of these both via Veronese subalgebras and Segre products and in\nterms of noncommutative differential geometry.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:17:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gateva-Ivanova","Tatiana",""],["Majid","Shahn",""]]}
{"id":"2308.11428","submitter":"Nishtha Srivastava","authors":"Wei Li, Megha Chakraborty, Claudia Quinteros Cartaya, Jonas koehler,\n  Johannes Faber, Georg Ruempker, Nishtha Srivastava","title":"SAIPy: A Python Package for single station Earthquake Monitoring using\n  Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Seismology has witnessed significant advancements in recent years with the\napplication of deep learning methods to address a broad range of problems.\nThese techniques have demonstrated their remarkable ability to effectively\nextract statistical properties from extensive datasets, surpassing the\ncapabilities of traditional approaches to an extent. In this study, we present\nSAIPy, an open source Python package specifically developed for fast data\nprocessing by implementing deep learning. SAIPy offers solutions for multiple\nseismological tasks, including earthquake detection, magnitude estimation,\nseismic phase picking, and polarity identification. We introduce upgraded\nversions of previously published models such as CREIMERT capable of identifying\nearthquakes with an accuracy above 99.8 percent and a root mean squared error\nof 0.38 unit in magnitude estimation. These upgraded models outperform state of\nthe art approaches like the Vision Transformer network. SAIPy provides an API\nthat simplifies the integration of these advanced models, including CREIMERT,\nDynaPickerv2, and PolarCAP, along with benchmark datasets. The package has the\npotential to be used for real time earthquake monitoring to enable timely\nactions to mitigate the impact of seismic events. Ongoing development efforts\naim to enhance the performance of SAIPy and incorporate additional features\nthat enhance exploration efforts, and it also would be interesting to approach\nthe retraining of the whole package as a multi-task learning problem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:21:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Li","Wei",""],["Chakraborty","Megha",""],["Cartaya","Claudia Quinteros",""],["koehler","Jonas",""],["Faber","Johannes",""],["Ruempker","Georg",""],["Srivastava","Nishtha",""]]}
{"id":"2308.11429","submitter":"Fatemeh Davoodi","authors":"Fatemeh Davoodi, Nahid Talebi","title":"Topological Plasmonic Ring Resonator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological plasmonic provides a new insight for the manipulation of light.\nAnalogous to exotic nature of topological edge states in topological photonics,\ntopological plasmonic combines concepts from topology and plasmonics. By\nutilizing topological protection, plasmons can be made to propagate without\nsignificant scattering or decay, even in the presence of defects or disorder.\nHerein, we present a study on the design, characterization, and manipulation of\ntopological plasmonic chains of discs based on the Su-Schrieffer-Heeger model\nmade into a ring resonator. The investigation focuses on exploring the unique\nproperties of these resonators and their potential to support topologically\nprotected edge modes, within the continuum of rotationally symmetric optical\nmodes of a ring. To observe the topological edge modes in rotationally\nsymmetric chains, we employ a symmetry-breaking excitation technique based on\nelectron beams. It analyzes the influence of parameters such as dimerization\nand loop numbers on the presence of topological modes. Additionally, we explore\nthe manipulation of electron impact positions to control the direction of\npropagation and selectively excite specific bulk or edge modes. The findings\ncontribute to a deeper understanding of topological effects by numerically\ninvestigating their design principles and exploring techniques to manipulate\ntopological edge modes. The insights gained from this study have implications\nfor the development of nanoscale plasmonic systems with customized\nfunctionalities, potentially impacting areas such as nanophotonics and quantum\ninformation processing.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:24:23 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 09:22:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Davoodi","Fatemeh",""],["Talebi","Nahid",""]]}
{"id":"2308.11430","submitter":"Sierra Grant","authors":"Sierra L. Grant, Lucas M. Stapper, Michiel R. Hogerheijde, Ewine F.\n  van Dishoeck, Sean Brittain, and Miguel Vioque","title":"The $\\dot{M}$--$M_{\\rm{disk}}$ relationship for Herbig Ae/Be stars: a\n  lifetime problem for disks with low masses?","comments":"16 pages, 3 figures, accepted to AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accretion of material from protoplanetary disks onto their central stars\nis a fundamental process in the evolution of these systems and a key diagnostic\nin constraining the disk lifetime. We analyze the relationship between the\nstellar accretion rate and the disk mass in 32 intermediate-mass Herbig Ae/Be\nsystems and compare them to their lower-mass counterparts, T Tauri stars. We\nfind that the $\\dot{M}$--$M_{\\rm{disk}}$ relationship for Herbig Ae/Be stars is\nlargely flat at $\\sim$10$^{-7}$ M$_{\\odot}$ yr$^{-1}$ across over three orders\nof magnitude in dust mass. While most of the sample follows the T Tauri trend,\na subset of objects with high accretion rates and low dust masses are\nidentified. These outliers (12 out of 32 sources) have an inferred disk\nlifetime of less than 0.01 Myr and are dominated by objects with low infrared\nexcess. This outlier sample is likely identified in part by the bias in\nclassifying Herbig Ae/Be stars, which requires evidence of accretion that can\nonly be reliably measured above a rate of $\\sim$10$^{-9}$ M$_{\\odot}$ yr$^{-1}$\nfor these spectral types. If the disk masses are not underestimated and the\naccretion rates are not overestimated, this implies that these disks may be on\nthe verge of dispersal, which may be due to efficient radial drift of material\nor outer disk depletion by photoevaporation and/or truncation by companions.\nThis outlier sample likely represents a small subset of the larger young,\nintermediate-mass stellar population, the majority of which would have already\nstopped accreting and cleared their disks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:24:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Grant","Sierra L.",""],["Stapper","Lucas M.",""],["Hogerheijde","Michiel R.",""],["van Dishoeck","Ewine F.",""],["Brittain","Sean",""],["Vioque","Miguel",""]]}
{"id":"2308.11431","submitter":"John Hoang","authors":"J. Hoang, D. A. Williams","title":"Generating airshower images for the VERITAS telescopes with conditional\n  Generative Adversarial Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  VERITAS (Very Energetic Radiation Imaging Telescope Array System) is the\ncurrent-generation array comprising four 12-meter optical ground-based Imaging\nAtmospheric Cherenkov Telescopes (IACTs). Its primary goal is to indirectly\nobserve gamma-ray emissions from the most violent astrophysical sources in the\nuniverse. Recent advancements in Machine Learning (ML) have sparked interest in\nutilizing neural networks (NNs) to directly infer properties from IACT images.\nHowever, the current training data for these NNs is generated through\ncomputationally expensive Monte Carlo (MC) simulation methods. This study\npresents a simulation method that employs conditional Generative Adversarial\nNetworks (cGANs) to synthesize additional VERITAS data to facilitate training\nfuture NNs. In this test-of-concept study, we condition the GANs on five\nclasses of simulated camera images consisting of circular muon showers and\ngamma-ray shower images in the first, second, third, and fourth quadrants of\nthe camera. Our results demonstrate that by casting training data as time\nseries, cGANs can 1) replicate shower morphologies based on the input class\nvectors and 2) generalize additional signals through interpolation in both the\nclass and latent spaces. Leveraging GPUs strength, our method can synthesize\nnovel signals at an impressive speed, generating over $10^6$ shower events in\nless than a minute.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:29:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hoang","J.",""],["Williams","D. A.",""]]}
{"id":"2308.11432","submitter":"Xu Chen","authors":"Lei Wang and Chen Ma and Xueyang Feng and Zeyu Zhang and Hao Yang and\n  Jingsen Zhang and Zhiyuan Chen and Jiakai Tang and Xu Chen and Yankai Lin and\n  Wayne Xin Zhao and Zhewei Wei and Ji-Rong Wen","title":"A Survey on Large Language Model based Autonomous Agents","comments":"32 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous agents have long been a prominent research topic in the academic\ncommunity. Previous research in this field often focuses on training agents\nwith limited knowledge within isolated environments, which diverges\nsignificantly from the human learning processes, and thus makes the agents hard\nto achieve human-like decisions. Recently, through the acquisition of vast\namounts of web knowledge, large language models (LLMs) have demonstrated\nremarkable potential in achieving human-level intelligence. This has sparked an\nupsurge in studies investigating autonomous agents based on LLMs. To harness\nthe full potential of LLMs, researchers have devised diverse agent\narchitectures tailored to different applications. In this paper, we present a\ncomprehensive survey of these studies, delivering a systematic review of the\nfield of autonomous agents from a holistic perspective. More specifically, our\nfocus lies in the construction of LLM-based agents, for which we propose a\nunified framework that encompasses a majority of the previous work.\nAdditionally, we provide a summary of the various applications of LLM-based AI\nagents in the domains of social science, natural science, and engineering.\nLastly, we discuss the commonly employed evaluation strategies for LLM-based AI\nagents. Based on the previous studies, we also present several challenges and\nfuture directions in this field. To keep track of this field and continuously\nupdate our survey, we maintain a repository for the related references at\nhttps://github.com/Paitesanshi/LLM-Agent-Survey.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:30:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Lei",""],["Ma","Chen",""],["Feng","Xueyang",""],["Zhang","Zeyu",""],["Yang","Hao",""],["Zhang","Jingsen",""],["Chen","Zhiyuan",""],["Tang","Jiakai",""],["Chen","Xu",""],["Lin","Yankai",""],["Zhao","Wayne Xin",""],["Wei","Zhewei",""],["Wen","Ji-Rong",""]]}
{"id":"2308.11433","submitter":"Dorian Martino","authors":"Dorian Martino","title":"A duality theorem for a four dimensional Willmore energy","comments":"49 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove an analog of Bryant's duality theorem for a four dimensional\nWillmore energy $\\mathcal{E}_{GR}$ obtained by Graham-Reichert and Zhang. We\nshow that for an immersion $\\Phi$ from a four dimensional compact manifold\nwithout boundary $\\Sigma$ into $\\mathbb{R}^5$, the energy\n$\\mathcal{E}_{GR}(\\Phi)$ is equal to two energies on its conformal Gauss map\n$Y$. One defined only in terms of the image of $Y$, which is the analog of the\narea functional for Willmore surfaces, and an other one defined on maps from\n$\\Sigma$ into the De Sitter space $\\mathbb{S}^{5,1}$, which is the analog of\nthe Dirichlet energy for Willmore surfaces. We prove that even when restricted\nto immersions of a given topological manifold $\\Sigma^4$, $\\mathcal{E}_{GR}$ is\nnever bounded from below on the set of immersions from $\\Sigma$ into\n$\\mathbb{R}^5$. We exhibit a second conformally invariant energy\n$\\mathcal{E}_P$ which is bounded from below and whose construction is closer to\nthe two dimensional Willmore energy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:31:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Martino","Dorian",""]]}
{"id":"2308.11434","submitter":"Zeinab Akhlaghi","authors":"Asamin Khaefi, Zeinab Akhlaghi and Behrooz Khosravi","title":"On the subgroup regular set in Cayley graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  A subset $C$ of the vertex set of a graph $\\Gamma$ is said to be\n$(a,b)$-regular if $C$ induces an $a$-regular subgraph and every vertex outside\n$C$ is adjacent to exactly $b$ vertices in $C$. In particular, if $C$ is an\n$(a,b)$-regular set of some Cayley graph on a finite group $G$, then $C$ is\ncalled an $(a,b)$-regular set of $G$ and a $(0,1)$-regular set is called a\nperfect code of $G$. In [Wang, Xia and Zhou, Regular sets in Cayley graphs, J.\nAlgebr. Comb., 2022] it is proved that if $H$ is a normal subgroup of $G$, then\n$H$ is a perfect code of $G$ if and only if it is an $(a,b)$-regular set of\n$G$, for each $0\\leq a\\leq|H|-1$ and $0\\leq b\\leq|H|$ with $\\gcd(2,|H|-1)\\mid\na$. In this paper, we generalize this result and show that a subgroup $H$ of\n$G$ is a perfect code of $G$ if and only if it is an $(a,b)$-regular set of\n$G$, for each $0\\leq a\\leq|H|-1$ and $0\\leq b\\leq|H|$ such that $\\gcd(2,|H|-1)$\ndivides $a$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:35:33 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 20:50:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Khaefi","Asamin",""],["Akhlaghi","Zeinab",""],["Khosravi","Behrooz",""]]}
{"id":"2308.11435","submitter":"Pierre-Cyril Aubin-Frankowski","authors":"Pierre-Cyril Aubin-Frankowski and Alain Bensoussan","title":"Reproducing kernel approach to linear quadratic mean field control\n  problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Mean-field control problems have received continuous interest over the last\ndecade. Despite being more intricate than in classical optimal control, the\nlinear-quadratic setting can still be tackled through Riccati equations.\nRemarkably, we demonstrate that another significant attribute extends to the\nmean-field case: the existence of an intrinsic reproducing kernel Hilbert space\nassociated with the problem. Our findings reveal that this Hilbert space not\nonly encompasses deterministic controlled push-forward mappings but can also\nrepresent of stochastic dynamics. Specifically, incorporating Brownian noise\naffects the deterministic kernel through a conditional expectation, to make the\ntrajectories adapted. Introducing reproducing kernels allows us to rewrite the\nmean-field control problem as optimizing over a Hilbert space of trajectories\nrather than controls. This framework even accommodates nonlinear terminal\ncosts, without resorting to adjoint processes or Pontryagin's maximum\nprinciple, further highlighting the versatility of the proposed methodology.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:36:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Aubin-Frankowski","Pierre-Cyril",""],["Bensoussan","Alain",""]]}
{"id":"2308.11436","submitter":"Israel Martinez-Castellanos","authors":"Israel Martinez-Castellanos, Savitri Gallego, Chien-You Huang, Chris\n  Karwin, Carolyn Kierans, Jan Peter Lommler, Saurabh Mittal, Michela Negro,\n  Eliza Neights, Sean N. Pike, Yong Sheng, Thomas Siegert, Hiroki Yoneda,\n  Andreas Zoglauer, John A. Tomsick, Steven E. Boggs, Dieter Hartmann, Marco\n  Ajello, Eric Burns, Chris Fryer, Alexander Lowell, Julien Malzac, Jarred\n  Roberts, Pascal Saint-Hilaire, Albert Shih, Clio Sleator, Tadayuki Takahashi,\n  Fabrizio Tavecchio, Eric Wulf, Jacqueline Beechert, Hannah Gulick, Alyson\n  Joens, Hadar Lazar, Juan Carlos Martinez Oliveros, Shigeki Matsumoto, Tom\n  Melia, Mark Amman, Dhruv Bal, Peter von Ballmoos, Hugh Bates, Markus\n  B\\\"ottcher, Andrea Bulgarelli, Elisabetta Cavazzuti, Hsiang-Kuang Chang,\n  Claire Chen, Che-Yen Chu, Alex Ciabattoni, Luigi Costamante, Lente Dreyer,\n  Valentina Fioretti, Francesco Fenu, Giancarlo Ghirlanda, Eric Grove, Pierre\n  Jean, Nikita Khatiya, J\\\"urgen Kn\\\"odlseder, Martin Krause, Mark Leising,\n  Tiffany R. Lewis, Lea Marcotulli, Samer Al Nussirat, Kazuhiro Nakazawa, Uwe\n  Oberlack, David Palmore, Gabriele Panebianco, Nicolo Parmiggiani, Tyler\n  Parsotan, Field Rogers, Hester Schutte, Alan P. Smale, Jacob Smith, Aaron\n  Trigg, Tonia Venters, Yu Watanabe, Haocheng Zhang","title":"The cosipy library: COSI's high-level analysis software","comments":null,"journal-ref":"Martinez, Israel. The cosipy library: COSI's high-level analysis\n  software. PoS ICRC2023 (2023) 444-858","doi":"10.22323/1.444.0858","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Compton Spectrometer and Imager (COSI) is a selected Small Explorer\n(SMEX) mission launching in 2027. It consists of a large field-of-view Compton\ntelescope that will probe with increased sensitivity the under-explored MeV\ngamma-ray sky (0.2-5 MeV). We will present the current status of cosipy, a\nPython library that will perform spectral and polarization fits, image\ndeconvolution, and all high-level analysis tasks required by COSI's broad\nscience goals: uncovering the origin of the Galactic positrons, mapping the\nsites of Galactic nucleosynthesis, improving our models of the jet and emission\nmechanism of gamma-ray bursts (GRBs) and active galactic nuclei (AGNs), and\ndetecting and localizing gravitational wave and neutrino sources. The cosipy\nlibrary builds on the experience gained during the COSI balloon campaigns and\nwill bring the analysis of data in the Compton regime to a modern open-source\nlikelihood-based code, capable of performing coherent joint fits with other\ninstruments using the Multi-Mission Maximum Likelihood framework (3ML). In this\ncontribution, we will also discuss our plans to receive feedback from the\ncommunity by having yearly software releases accompanied by publicly-available\ndata challenges.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:38:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Martinez-Castellanos","Israel",""],["Gallego","Savitri",""],["Huang","Chien-You",""],["Karwin","Chris",""],["Kierans","Carolyn",""],["Lommler","Jan Peter",""],["Mittal","Saurabh",""],["Negro","Michela",""],["Neights","Eliza",""],["Pike","Sean N.",""],["Sheng","Yong",""],["Siegert","Thomas",""],["Yoneda","Hiroki",""],["Zoglauer","Andreas",""],["Tomsick","John A.",""],["Boggs","Steven E.",""],["Hartmann","Dieter",""],["Ajello","Marco",""],["Burns","Eric",""],["Fryer","Chris",""],["Lowell","Alexander",""],["Malzac","Julien",""],["Roberts","Jarred",""],["Saint-Hilaire","Pascal",""],["Shih","Albert",""],["Sleator","Clio",""],["Takahashi","Tadayuki",""],["Tavecchio","Fabrizio",""],["Wulf","Eric",""],["Beechert","Jacqueline",""],["Gulick","Hannah",""],["Joens","Alyson",""],["Lazar","Hadar",""],["Oliveros","Juan Carlos Martinez",""],["Matsumoto","Shigeki",""],["Melia","Tom",""],["Amman","Mark",""],["Bal","Dhruv",""],["von Ballmoos","Peter",""],["Bates","Hugh",""],["B\u00f6ttcher","Markus",""],["Bulgarelli","Andrea",""],["Cavazzuti","Elisabetta",""],["Chang","Hsiang-Kuang",""],["Chen","Claire",""],["Chu","Che-Yen",""],["Ciabattoni","Alex",""],["Costamante","Luigi",""],["Dreyer","Lente",""],["Fioretti","Valentina",""],["Fenu","Francesco",""],["Ghirlanda","Giancarlo",""],["Grove","Eric",""],["Jean","Pierre",""],["Khatiya","Nikita",""],["Kn\u00f6dlseder","J\u00fcrgen",""],["Krause","Martin",""],["Leising","Mark",""],["Lewis","Tiffany R.",""],["Marcotulli","Lea",""],["Nussirat","Samer Al",""],["Nakazawa","Kazuhiro",""],["Oberlack","Uwe",""],["Palmore","David",""],["Panebianco","Gabriele",""],["Parmiggiani","Nicolo",""],["Parsotan","Tyler",""],["Rogers","Field",""],["Schutte","Hester",""],["Smale","Alan P.",""],["Smith","Jacob",""],["Trigg","Aaron",""],["Venters","Tonia",""],["Watanabe","Yu",""],["Zhang","Haocheng",""]]}
{"id":"2308.11437","submitter":"Margareta Wagner","authors":"Margareta Wagner, Bernd Meyer, Martin Setvin, Michael Schmid, Ulrike\n  Diebold","title":"Direct assessment of the proton affinity of individual surface hydroxyls\n  with non-contact atomic force microscopy","comments":null,"journal-ref":"Nature 592, 2021, 722-725","doi":"10.1038/s41586-021-03432-3","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The state of protonation/deprotonation of surfaces has far-ranging\nimplications in all areas of chemistry: from acid-base catalysis$^1$ and the\nelectro- and photocatalytic splitting of water$^2$, to the behavior of\nminerals$^3$ and biochemistry$^4$. The acidity of a molecule or a surface site\nis described by its proton affinity (PA) and pK$_\\mathrm{a}$ value (the\nnegative logarithm of the equilibrium constant of the proton transfer reaction\nin solution). For solids, in contrast to molecules, the acidity of individual\nsites is difficult to assess. For mineral surfaces such as oxides they are\nestimated by semi-empirical concepts such as bond-order valence sums$^5$, and\nalso increasingly modeled with first-principles molecular dynamics\nsimulations$^{6,7}$. Currently such predictions cannot be tested - the\nexperimental measures used for comparison are typically average quantities\nintegrated over the whole surface or, in some cases, individual crystal\nfacets$^8$, such as the point of zero charge (pzc)$^9$. Here we assess\nindividual hydroxyls on In$_2$O$_3$(111), a model oxide with four different\ntypes of surface oxygen atoms, and probe the strength of their hydrogen bond\nwith the tip of a non-contact atomic force microscope (AFM). The force curves\nare in quantitative agreement with density-functional theory (DFT)\ncalculations. By relating the results to known proton affinities and\npK$_\\mathrm{a}$ values of gas-phase molecules, we provide a direct measure of\nproton affinity distributions at the atomic scale.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:39:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wagner","Margareta",""],["Meyer","Bernd",""],["Setvin","Martin",""],["Schmid","Michael",""],["Diebold","Ulrike",""]]}
{"id":"2308.11438","submitter":"Masafumi Niwano","authors":"Masafumi Niwano, Katsuhiro L. Murata, Naohiro Ito, Yoichi Yatsu,\n  Nobuyuki Kawai","title":"Optical and X-ray variations during 5 outbursts of Aql X-1 in 3.6 years\n  from 2016","comments":"9 pages, 10 figures, 3 tables, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyzed optical/X-ray quasi-simultaneous light curves of Aql X-1,\nobtained by MAXI (Monitor of All-sky X-ray Image), ZTF (Zwicky Transient\nFacility) and LCO (Las Cumbres Observatory) in about 3.6 years from 2016, for\nunderstanding electromagnetic radiation mechanisms during its outbursts. As a\nresult, we confirmed that 5 outbursts had detected in the epoch, and that 3\noutbursts underwent the X-ray state transition across Low-Hard, In-Transition,\nand High-Soft state while remaining 2 outbursts stayed in the Low-Hard state.\nWe found that the optical spectral energy distribution in the High-Soft state\nis consistent with a simplified irradiated disk model, and that the optical\ncolor/magnitude variation can be explained by variations in the X-ray\nluminosity and the disk geometrical thickness.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:41:33 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 01:23:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Niwano","Masafumi",""],["Murata","Katsuhiro L.",""],["Ito","Naohiro",""],["Yatsu","Yoichi",""],["Kawai","Nobuyuki",""]]}
{"id":"2308.11439","submitter":"Rinku Maji","authors":"Rinku Maji, Wan-Il Park","title":"Supersymmetric $U(1)_{B-L}$ flat direction and NANOGrav 15 year data","comments":"8 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that, when connected with monopoles, the \\textit{flat} $D$-flat\ndirection breaking the local $U(1)_{B-L}$ symmetry as an extension of the\nminimal supersymmetric standard model can be responsible for the signal of a\nstochastic gravitational wave background recently reported by NANOGrav\ncollaborations, while naturally satisfying constraints at high frequency band.\nThanks to the flatness of the direction, a phase of thermal inflation arises\nnaturally. The reheating temperature is quite low, and suppresses signals at\nfrequencies higher than the characteristic frequency set by the reheating\ntemperature. Notably, forthcoming spaced-based experiments such as LISA can\nprobe the cutoff frequency, providing an indirect clue of the scale of soft\nSUSY-breaking mass parameter.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:41:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Maji","Rinku",""],["Park","Wan-Il",""]]}
{"id":"2308.11440","submitter":"Soubarna Banik","authors":"Soubarna Banik, Edvard Avagyan, Alejandro Mendoza Gracia, Alois Knoll","title":"PoseGraphNet++: Enriching 3D Human Pose with Orientation Estimation","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing kinematic skeleton-based 3D human pose estimation methods only\npredict joint positions. Although this is sufficient to compute the yaw and\npitch of the bone rotations, the roll around the axis of the bones remains\nunresolved by these methods. In this paper, we propose a novel 2D-to-3D lifting\nGraph Convolution Network named PoseGraphNet++ to predict the complete human\npose including the joint positions and the bone orientations. We employ node\nand edge convolutions to utilize the joint and bone features. Our model is\nevaluated on multiple benchmark datasets, and its performance is either on par\nwith or better than the state-of-the-art in terms of both position and rotation\nmetrics. Through extensive ablation studies, we show that PoseGraphNet++\nbenefits from exploiting the mutual relationship between the joints and the\nbones.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:42:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Banik","Soubarna",""],["Avagyan","Edvard",""],["Gracia","Alejandro Mendoza",""],["Knoll","Alois",""]]}
{"id":"2308.11441","submitter":"Junsheng Zhou","authors":"Junsheng Zhou, Baorui Ma, Shujuan Li, Yu-Shen Liu, Zhizhong Han","title":"Learning a More Continuous Zero Level Set in Unsigned Distance Fields\n  through Level Set Projection","comments":"To appear at ICCV2023. Code is available at\n  https://github.com/junshengzhou/LevelSetUDF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Latest methods represent shapes with open surfaces using unsigned distance\nfunctions (UDFs). They train neural networks to learn UDFs and reconstruct\nsurfaces with the gradients around the zero level set of the UDF. However, the\ndifferential networks struggle from learning the zero level set where the UDF\nis not differentiable, which leads to large errors on unsigned distances and\ngradients around the zero level set, resulting in highly fragmented and\ndiscontinuous surfaces. To resolve this problem, we propose to learn a more\ncontinuous zero level set in UDFs with level set projections. Our insight is to\nguide the learning of zero level set using the rest non-zero level sets via a\nprojection procedure. Our idea is inspired from the observations that the\nnon-zero level sets are much smoother and more continuous than the zero level\nset. We pull the non-zero level sets onto the zero level set with gradient\nconstraints which align gradients over different level sets and correct\nunsigned distance errors on the zero level set, leading to a smoother and more\ncontinuous unsigned distance field. We conduct comprehensive experiments in\nsurface reconstruction for point clouds, real scans or depth maps, and further\nexplore the performance in unsupervised point cloud upsampling and unsupervised\npoint normal estimation with the learned UDF, which demonstrate our non-trivial\nimprovements over the state-of-the-art methods. Code is available at\nhttps://github.com/junshengzhou/LevelSetUDF .\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:45:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhou","Junsheng",""],["Ma","Baorui",""],["Li","Shujuan",""],["Liu","Yu-Shen",""],["Han","Zhizhong",""]]}
{"id":"2308.11442","submitter":"Nitish Shukla","authors":"Nitish Shukla","title":"SDeMorph: Towards Better Facial De-morphing from Single Morph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Face Recognition Systems (FRS) are vulnerable to morph attacks. A face morph\nis created by combining multiple identities with the intention to fool FRS and\nmaking it match the morph with multiple identities. Current Morph Attack\nDetection (MAD) can detect the morph but are unable to recover the identities\nused to create the morph with satisfactory outcomes. Existing work in\nde-morphing is mostly reference-based, i.e. they require the availability of\none identity to recover the other. Sudipta et al. \\cite{ref9} proposed a\nreference-free de-morphing technique but the visual realism of outputs produced\nwere feeble. In this work, we propose SDeMorph (Stably Diffused De-morpher), a\nnovel de-morphing method that is reference-free and recovers the identities of\nbona fides. Our method produces feature-rich outputs that are of significantly\nhigh quality in terms of definition and facial fidelity. Our method utilizes\nDenoising Diffusion Probabilistic Models (DDPM) by destroying the input morphed\nsignal and then reconstructing it back using a branched-UNet. Experiments on\nASML, FRLL-FaceMorph, FRLL-MorDIFF, and SMDD datasets support the effectiveness\nof the proposed method.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:46:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shukla","Nitish",""]]}
{"id":"2308.11443","submitter":"Xiaojun Jia","authors":"Xiaojun Jia, Yuefeng Chen, Xiaofeng Mao, Ranjie Duan, Jindong Gu, Rong\n  Zhang, Hui Xue and Xiaochun Cao","title":"Revisiting and Exploring Efficient Fast Adversarial Training via LAW:\n  Lipschitz Regularization and Auto Weight Averaging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fast Adversarial Training (FAT) not only improves the model robustness but\nalso reduces the training cost of standard adversarial training. However, fast\nadversarial training often suffers from Catastrophic Overfitting (CO), which\nresults in poor robustness performance. Catastrophic Overfitting describes the\nphenomenon of a sudden and significant decrease in robust accuracy during the\ntraining of fast adversarial training. Many effective techniques have been\ndeveloped to prevent Catastrophic Overfitting and improve the model robustness\nfrom different perspectives. However, these techniques adopt inconsistent\ntraining settings and require different training costs, i.e, training time and\nmemory costs, leading to unfair comparisons. In this paper, we conduct a\ncomprehensive study of over 10 fast adversarial training methods in terms of\nadversarial robustness and training costs. We revisit the effectiveness and\nefficiency of fast adversarial training techniques in preventing Catastrophic\nOverfitting from the perspective of model local nonlinearity and propose an\neffective Lipschitz regularization method for fast adversarial training.\nFurthermore, we explore the effect of data augmentation and weight averaging in\nfast adversarial training and propose a simple yet effective auto weight\naveraging method to improve robustness further. By assembling these techniques,\nwe propose a FGSM-based fast adversarial training method equipped with\nLipschitz regularization and Auto Weight averaging, abbreviated as FGSM-LAW.\nExperimental evaluations on four benchmark databases demonstrate the\nsuperiority of the proposed method over state-of-the-art fast adversarial\ntraining methods and the advanced standard adversarial training methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:50:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jia","Xiaojun",""],["Chen","Yuefeng",""],["Mao","Xiaofeng",""],["Duan","Ranjie",""],["Gu","Jindong",""],["Zhang","Rong",""],["Xue","Hui",""],["Cao","Xiaochun",""]]}
{"id":"2308.11444","submitter":"Jaehyun Kim","authors":"Seungwon Choi, Wonseok Kang, Jiseong Chung, Jaehyun Kim, Tae-wan Kim","title":"Adaptive Graduated Non-Convexity for Pose Graph Optimization","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel approach to robust pose graph optimization based on\nGraduated Non-Convexity (GNC). Unlike traditional GNC-based methods, the\nproposed approach employs an adaptive shape function using B-spline to optimize\nthe shape of the robust kernel. This aims to reduce GNC iterations, boosting\ncomputational speed without compromising accuracy. When integrated with the\nopen-source riSAM algorithm, the method demonstrates enhanced efficiency across\ndiverse datasets. Accompanying open-source code aims to encourage further\nresearch in this area. https://github.com/SNU-DLLAB/AGNC-PGO\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:51:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Choi","Seungwon",""],["Kang","Wonseok",""],["Chung","Jiseong",""],["Kim","Jaehyun",""],["Kim","Tae-wan",""]]}
{"id":"2308.11445","submitter":"Vinicius Casteluber Laass","authors":"Daciberg Lima Gon\\c{c}alves, Vinicius Casteluber Laass, Weslem\n  Liberato Silva","title":"The Borsuk-Ulam property for homotopy classes on bundles, parametrized\n  braids groups and applications for surfaces bundles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $M$ and $N$ be fiber bundles over the same base $B$, where $M$ is endowed\nwith a free involution $\\tau$ over $B$. A homotopy class $\\delta \\in [M,N]_{B}$\n(over $B$) is said to have the Borsuk-Ulam property with respect to $\\tau$ if\nfor every fiber-preserving map $f\\colon M \\to N$ over $B$ which represents\n$\\delta$ there exists a point $x \\in M$ such that $f(\\tau(x)) = f(x)$. In the\ncases that $B$ is a $K(\\pi ,1)$-space and the fibers of the projections $M \\to\nB$ and $N \\to B$ are $K(\\pi,1)$ closed surfaces $S_M$ and $S_N$, respectively,\nwe show that the problem of decide if a homotopy class of a fiber-preserving\nmap $f\\colon M \\to N$ over $B$ has the Borsuk-Ulam property is equivalent of an\nalgebraic problem involving the fundamental groups of $M$, the orbit space of\n$M$ by $\\tau$ and a type of generalized braid groups of $N$ that we call\nparametrized braid groups. As an application, we determine the homotopy classes\nof self fiber-preserving maps of some 2-torus bundles over $\\mathbb{S}^1$ that\nsatisfy the Borsuk-Ulam property with respect to certain involutions $\\tau$\nover $\\mathbb{S}^1$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:53:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gon\u00e7alves","Daciberg Lima",""],["Laass","Vinicius Casteluber",""],["Silva","Weslem Liberato",""]]}
{"id":"2308.11446","submitter":"Mateusz Krzyzi\\'nski","authors":"Katarzyna Kobyli\\'nska, Mateusz Krzyzi\\'nski, Rafa{\\l} Machowicz,\n  Mariusz Adamek, Przemys{\\l}aw Biecek","title":"Exploration of Rashomon Set Assists Explanations for Medical Data","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The machine learning modeling process conventionally culminates in selecting\na single model that maximizes a selected performance metric. However, this\napproach leads to abandoning a more profound analysis of slightly inferior\nmodels. Particularly in medical and healthcare studies, where the objective\nextends beyond predictions to valuable insight generation, relying solely on\nperformance metrics can result in misleading or incomplete conclusions. This\nproblem is particularly pertinent when dealing with a set of models with\nperformance close to maximum one, known as $\\textit{Rashomon set}$. Such a set\ncan be numerous and may contain models describing the data in a different way,\nwhich calls for comprehensive analysis. This paper introduces a novel process\nto explore Rashomon set models, extending the conventional modeling approach.\nThe cornerstone is the identification of the most different models within the\nRashomon set, facilitated by the introduced $\\texttt{Rashomon_DETECT}$\nalgorithm. This algorithm compares profiles illustrating prediction\ndependencies on variable values generated by eXplainable Artificial\nIntelligence (XAI) techniques. To quantify differences in variable effects\namong models, we introduce the Profile Disparity Index (PDI) based on measures\nfrom functional data analysis. To illustrate the effectiveness of our approach,\nwe showcase its application in predicting survival among hemophagocytic\nlymphohistiocytosis (HLH) patients - a foundational case study. Additionally,\nwe benchmark our approach on other medical data sets, demonstrating its\nversatility and utility in various contexts.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:53:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kobyli\u0144ska","Katarzyna",""],["Krzyzi\u0144ski","Mateusz",""],["Machowicz","Rafa\u0142",""],["Adamek","Mariusz",""],["Biecek","Przemys\u0142aw",""]]}
{"id":"2308.11447","submitter":"Xueyi Liu","authors":"Xueyi Liu, Rui Hou, Yanglei Gan, Da Luo, Changlin Li, Xiaojun Shi and\n  Qiao Liu","title":"Aspect-oriented Opinion Alignment Network for Aspect-Based Sentiment\n  Classification","comments":"8 pages, 5 figure, ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aspect-based sentiment classification is a crucial problem in fine-grained\nsentiment analysis, which aims to predict the sentiment polarity of the given\naspect according to its context. Previous works have made remarkable progress\nin leveraging attention mechanism to extract opinion words for different\naspects. However, a persistent challenge is the effective management of\nsemantic mismatches, which stem from attention mechanisms that fall short in\nadequately aligning opinions words with their corresponding aspect in\nmulti-aspect sentences. To address this issue, we propose a novel\nAspect-oriented Opinion Alignment Network (AOAN) to capture the contextual\nassociation between opinion words and the corresponding aspect. Specifically,\nwe first introduce a neighboring span enhanced module which highlights various\ncompositions of neighboring words and given aspects. In addition, we design a\nmulti-perspective attention mechanism that align relevant opinion information\nwith respect to the given aspect. Extensive experiments on three benchmark\ndatasets demonstrate that our model achieves state-of-the-art results. The\nsource code is available at https://github.com/AONE-NLP/ABSA-AOAN.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:55:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Xueyi",""],["Hou","Rui",""],["Gan","Yanglei",""],["Luo","Da",""],["Li","Changlin",""],["Shi","Xiaojun",""],["Liu","Qiao",""]]}
{"id":"2308.11448","submitter":"Jiantao Wu","authors":"Jiantao Wu and Shentong Mo and Muhammad Awais and Sara Atito and\n  Zhenhua Feng and Josef Kittler","title":"Masked Momentum Contrastive Learning for Zero-shot Semantic\n  Understanding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Self-supervised pretraining (SSP) has emerged as a popular technique in\nmachine learning, enabling the extraction of meaningful feature representations\nwithout labelled data. In the realm of computer vision, pretrained vision\ntransformers (ViTs) have played a pivotal role in advancing transfer learning.\nNonetheless, the escalating cost of finetuning these large models has posed a\nchallenge due to the explosion of model size. This study endeavours to evaluate\nthe effectiveness of pure self-supervised learning (SSL) techniques in computer\nvision tasks, obviating the need for finetuning, with the intention of\nemulating human-like capabilities in generalisation and recognition of unseen\nobjects. To this end, we propose an evaluation protocol for zero-shot\nsegmentation based on a prompting patch. Given a point on the target object as\na prompt, the algorithm calculates the similarity map between the selected\npatch and other patches, upon that, a simple thresholding is applied to segment\nthe target. Another evaluation is intra-object and inter-object similarity to\ngauge discriminatory ability of SSP ViTs. Insights from zero-shot segmentation\nfrom prompting and discriminatory abilities of SSP led to the design of a\nsimple SSP approach, termed MMC. This approaches combines Masked image\nmodelling for encouraging similarity of local features, Momentum based\nself-distillation for transferring semantics from global to local features, and\nglobal Contrast for promoting semantics of global features, to enhance\ndiscriminative representations of SSP ViTs. Consequently, our proposed method\nsignificantly reduces the overlap of intra-object and inter-object\nsimilarities, thereby facilitating effective object segmentation within an\nimage. Our experiments reveal that MMC delivers top-tier results in zero-shot\nsemantic segmentation across various datasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:55:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wu","Jiantao",""],["Mo","Shentong",""],["Awais","Muhammad",""],["Atito","Sara",""],["Feng","Zhenhua",""],["Kittler","Josef",""]]}
{"id":"2308.11449","submitter":"Junlong Lyu","authors":"Junlong Lyu, Zhitang Chen, Shoubo Feng","title":"Convergence guarantee for consistency models","comments":"20 pages, 1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.AI cs.NA math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide the first convergence guarantees for the Consistency Models (CMs),\na newly emerging type of one-step generative models that can generate\ncomparable samples to those generated by Diffusion Models. Our main result is\nthat, under the basic assumptions on score-matching errors, consistency errors\nand smoothness of the data distribution, CMs can efficiently sample from any\nrealistic data distribution in one step with small $W_2$ error. Our results (1)\nhold for $L^2$-accurate score and consistency assumption (rather than\n$L^\\infty$-accurate); (2) do note require strong assumptions on the data\ndistribution such as log-Sobelev inequality; (3) scale polynomially in all\nparameters; and (4) match the state-of-the-art convergence guarantee for\nscore-based generative models (SGMs). We also provide the result that the\nMultistep Consistency Sampling procedure can further reduce the error comparing\nto one step sampling, which support the original statement of \"Consistency\nModels, Yang Song 2023\". Our result further imply a TV error guarantee when\ntake some Langevin-based modifications to the output distributions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:57:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lyu","Junlong",""],["Chen","Zhitang",""],["Feng","Shoubo",""]]}
{"id":"2308.11450","submitter":"Xucheng Wang","authors":"Dan Zeng, Mingliang Zou, Xucheng Wang, Shuiwang Li","title":"Towards Discriminative Representations with Contrastive Instances for\n  Real-Time UAV Tracking","comments":"arXiv admin note: substantial text overlap with arXiv:2308.10262","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Maintaining high efficiency and high precision are two fundamental challenges\nin UAV tracking due to the constraints of computing resources, battery\ncapacity, and UAV maximum load. Discriminative correlation filters (DCF)-based\ntrackers can yield high efficiency on a single CPU but with inferior precision.\nLightweight Deep learning (DL)-based trackers can achieve a good balance\nbetween efficiency and precision but performance gains are limited by the\ncompression rate. High compression rate often leads to poor discriminative\nrepresentations. To this end, this paper aims to enhance the discriminative\npower of feature representations from a new feature-learning perspective.\nSpecifically, we attempt to learn more disciminative representations with\ncontrastive instances for UAV tracking in a simple yet effective manner, which\nnot only requires no manual annotations but also allows for developing and\ndeploying a lightweight model. We are the first to explore contrastive learning\nfor UAV tracking. Extensive experiments on four UAV benchmarks, including\nUAV123@10fps, DTB70, UAVDT and VisDrone2018, show that the proposed DRCI\ntracker significantly outperforms state-of-the-art UAV tracking methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:58:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zeng","Dan",""],["Zou","Mingliang",""],["Wang","Xucheng",""],["Li","Shuiwang",""]]}
{"id":"2308.11451","submitter":"Shirin Afzal","authors":"Shirin Afzal, Tyler J. Zimmerling, Mahdi Rizvandi, Majid Taghavi,\n  Taras Hrushevskyi, Manpreet Kaur, Vien Van, and Shabir Barzanjeh","title":"Bright quantum photon sources from a topological Floquet resonance","comments":"20 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Entanglement, a fundamental concept in quantum mechanics, plays a crucial\nrole as a valuable resource in quantum technologies. The practical\nimplementation of entangled photon sources encounters obstacles arising from\nimperfections and defects inherent in physical systems and microchips,\nresulting in a loss or degradation of entanglement. The topological photonic\ninsulators, however, have emerged as promising candidates, demonstrating an\nexceptional capability to resist defect-induced scattering, thus enabling the\ndevelopment of robust entangled sources. Despite their inherent advantages,\nbuilding bright and programmable topologically protected entangled sources\nremains challenging due to intricate device designs and weak material\nnonlinearity. Here we present an advancement in entanglement generation\nachieved through a non-magnetic and tunable resonance-based anomalous Floquet\ninsulator, utilizing an optical spontaneous four-wave mixing process. Our\nexperiment demonstrates a substantial enhancement in entangled photon pair\ngeneration compared to devices reliant solely on topological edge states and\noutperforming trivial photonic devices in spectral resilience. This work marks\na step forward in the pursuit of defect-robust and bright entangled sources\nthat can open avenues for the exploration of cascaded quantum devices and the\nengineering of quantum states. Our result could lead to the development of\nresilient quantum sources with potential applications in quantum technologies.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:59:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Afzal","Shirin",""],["Zimmerling","Tyler J.",""],["Rizvandi","Mahdi",""],["Taghavi","Majid",""],["Hrushevskyi","Taras",""],["Kaur","Manpreet",""],["Van","Vien",""],["Barzanjeh","Shabir",""]]}
{"id":"2308.11452","submitter":"Ioannis Sarafis","authors":"Valasia Vlachopoulou, Ioannis Sarafis, Alexandros Papadopoulos","title":"Food Image Classification and Segmentation with Attention-based Multiple\n  Instance Learning","comments":"Accepted for presentation at 18th International Workshop on Semantic\n  and Social Media Adaptation & Personalization (SMAP 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The demand for accurate food quantification has increased in the recent\nyears, driven by the needs of applications in dietary monitoring. At the same\ntime, computer vision approaches have exhibited great potential in automating\ntasks within the food domain. Traditionally, the development of machine\nlearning models for these problems relies on training data sets with\npixel-level class annotations. However, this approach introduces challenges\narising from data collection and ground truth generation that quickly become\ncostly and error-prone since they must be performed in multiple settings and\nfor thousands of classes. To overcome these challenges, the paper presents a\nweakly supervised methodology for training food image classification and\nsemantic segmentation models without relying on pixel-level annotations. The\nproposed methodology is based on a multiple instance learning approach in\ncombination with an attention-based mechanism. At test time, the models are\nused for classification and, concurrently, the attention mechanism generates\nsemantic heat maps which are used for food class segmentation. In the paper, we\nconduct experiments on two meta-classes within the FoodSeg103 data set to\nverify the feasibility of the proposed approach and we explore the functioning\nproperties of the attention mechanism.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:59:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Vlachopoulou","Valasia",""],["Sarafis","Ioannis",""],["Papadopoulos","Alexandros",""]]}
{"id":"2308.11453","submitter":"Yu-Long Zhou","authors":"Ling-Bing He, Ning Jiang and Yu-long Zhou","title":"Quantitative global well-posedness of Boltzmann-Bose-Einstein equation\n  and incompressible Navier-Stokes-Fourier limit","comments":"42 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In the diffusive scaling and in the whole space, we prove the global\nwell-posedness of the scaled Boltzmann-Bose-Einstein (briefly, BBE) equation\nwith high temperature in the low regularity space $H^2_xL^2$. In particular, we\nquantify the fluctuation around the Bose-Einstein equilibrium\n$\\mathcal{M}_{\\lambda,T}(v)$ with respect to the parameters $\\lambda$ and\ntemperature $T$. Furthermore, the estimate for the diffusively scaled BBE\nequation is uniform to the Knudsen number $\\epsilon$. As a consequence, we\nrigorously justify the hydrodynamic limit to the incompressible\nNavier-Stokes-Fourier equations. This is the first rigorous fluid limit result\nfor BBE.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:02:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["He","Ling-Bing",""],["Jiang","Ning",""],["Zhou","Yu-long",""]]}
{"id":"2308.11454","submitter":"Feng-Ren Fan","authors":"Feng-Ren Fan, Cong Xiao, and Wang Yao","title":"Altermagnetic Orbital Chern Insulator in Twisted MoTe$_{2}$","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In twisted MoTe$_{2}$, latest transport measurement has reported observation\nof quantum anomalous Hall effect at hole filling $\\nu=-1$, which undergoes a\ntopological phase transition to a trivial ferromagnet as layer hybridization\ngets suppressed by interlayer bias $D$. Here we show that this underlies the\nexistence of an orbital Chern insulating state with gate ($D$) switchable sign\nin an altermagnetic spin background at hole filling $\\nu=-2$. From\nmomentum-space Hartree Fock calculations, we find this state has a topological\nphase diagram complementary to that of the $\\nu=-1$ one: by sweeping $D$ from\npositive to negative, the Chern number of this $\\nu=-2$ state can be switched\nbetween $+1$, $0$, and $-1$, accompanied by a sign change of a sizable orbital\nmagnetization. In range of $D$ where this altermagnet is the ground state, the\norbital magnetization allows magnetic field initialization of the spin\naltermagnetic order and the Chern number.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:02:20 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fan","Feng-Ren",""],["Xiao","Cong",""],["Yao","Wang",""]]}
{"id":"2308.11455","submitter":"Tobias Uelwer","authors":"Tobias Uelwer, Jan Robine, Stefan Sylvius Wagner, Marc H\\\"oftmann,\n  Eric Upschulte, Sebastian Konietzny, Maike Behrendt, Stefan Harmeling","title":"A Survey on Self-Supervised Representation Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI eess.IV stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning meaningful representations is at the heart of many tasks in the\nfield of modern machine learning. Recently, a lot of methods were introduced\nthat allow learning of image representations without supervision. These\nrepresentations can then be used in downstream tasks like classification or\nobject detection. The quality of these representations is close to supervised\nlearning, while no labeled images are needed. This survey paper provides a\ncomprehensive review of these methods in a unified notation, points out\nsimilarities and differences of these methods, and proposes a taxonomy which\nsets these methods in relation to each other. Furthermore, our survey\nsummarizes the most-recent experimental results reported in the literature in\nform of a meta-study. Our survey is intended as a starting point for\nresearchers and practitioners who want to dive into the field of representation\nlearning.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:05:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Uelwer","Tobias",""],["Robine","Jan",""],["Wagner","Stefan Sylvius",""],["H\u00f6ftmann","Marc",""],["Upschulte","Eric",""],["Konietzny","Sebastian",""],["Behrendt","Maike",""],["Harmeling","Stefan",""]]}
{"id":"2308.11456","submitter":"Peter Udo Diehl","authors":"Peter Udo Diehl, Hannes Zilly, Felix Sattler, Yosef Singer, Kevin\n  Kepp, Mark Berry, Henning Hasemann, Marlene Zippel, M\\\"uge Kaya, Paul\n  Meyer-Rachner, Annett Pudszuhn, Veit M. Hofmann, Matthias Vormann, Elias\n  Sprengel","title":"Deep learning-based denoising streamed from mobile phones improves\n  speech-in-noise understanding for hearing aid users","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The hearing loss of almost half a billion people is commonly treated with\nhearing aids. However, current hearing aids often do not work well in\nreal-world noisy environments. We present a deep learning based denoising\nsystem that runs in real time on iPhone 7 and Samsung Galaxy S10 (25ms\nalgorithmic latency). The denoised audio is streamed to the hearing aid,\nresulting in a total delay of around 75ms. In tests with hearing aid users\nhaving moderate to severe hearing loss, our denoising system improves audio\nacross three tests: 1) listening for subjective audio ratings, 2) listening for\nobjective speech intelligibility, and 3) live conversations in a noisy\nenvironment for subjective ratings. Subjective ratings increase by more than\n40%, for both the listening test and the live conversation compared to a fitted\nhearing aid as a baseline. Speech reception thresholds, measuring speech\nunderstanding in noise, improve by 1.6 dB SRT. Ours is the first denoising\nsystem that is implemented on a mobile device, streamed directly to users'\nhearing aids using only a single channel as audio input while improving user\nsatisfaction on all tested aspects, including speech intelligibility. This\nincludes overall preference of the denoised and streamed signal over the\nhearing aid, thereby accepting the higher latency for the significant\nimprovement in speech understanding.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:05:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Diehl","Peter Udo",""],["Zilly","Hannes",""],["Sattler","Felix",""],["Singer","Yosef",""],["Kepp","Kevin",""],["Berry","Mark",""],["Hasemann","Henning",""],["Zippel","Marlene",""],["Kaya","M\u00fcge",""],["Meyer-Rachner","Paul",""],["Pudszuhn","Annett",""],["Hofmann","Veit M.",""],["Vormann","Matthias",""],["Sprengel","Elias",""]]}
{"id":"2308.11457","submitter":"Greg\\'orio Silva Neto","authors":"Greg\\'orio Silva Neto and Vanessa Silva","title":"Ruled surfaces as translating solitons of the inverse mean curvature\n  flow in the three-dimensional Lorentz-Minkowski space","comments":"22 pages, 4 figures. Final version","journal-ref":"Published in the Journal of Mathematical Analysis and\n  Applications, Volume 528, Issue 2, 2023","doi":"10.1016/j.jmaa.2023.127550","report-no":null,"categories":"math.DG math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we classify the nondegenerate ruled surfaces in the\nthree-dimensional Lorentz-Minkowski space that are translating solitons for the\ninverse mean curvature flow. In particular, we prove the existence of\nnon-cylindrical ruled translating solitons, which contrast with the Euclidean\nsetting.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:06:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Neto","Greg\u00f3rio Silva",""],["Silva","Vanessa",""]]}
{"id":"2308.11458","submitter":"Oliver Pescott","authors":"Oliver L. Pescott, Robin J. Boyd, Gary D. Powney, Gavin B. Stewart","title":"Towards a unified approach to formal risk of bias assessments for causal\n  and descriptive inference","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Statistics is sometimes described as the science of reasoning under\nuncertainty. Statistical models provide one view of this uncertainty, but what\nis frequently neglected is the invisible portion of uncertainty: that assumed\nnot to exist once a model has been fitted to some data. Systematic errors, i.e.\nbias, in data relative to some model and inferential goal can seriously\nundermine research conclusions, and qualitative and quantitative techniques\nhave been created across several disciplines to quantify and generally appraise\nsuch potential biases. Perhaps best known are so-called risk of bias assessment\ninstruments used to investigate the likely quality of randomised controlled\ntrials in medical research. However, the logic of assessing the risks caused by\nvarious types of systematic error to statistical arguments applies far more\nwidely. This logic applies even when statistical adjustment strategies for\npotential biases are used, as these frequently make assumptions (e.g. data\nmissing at random) that can never be guaranteed in finite samples. Mounting\nconcern about such situations can be seen in the increasing calls for greater\nconsideration of biases caused by nonprobability sampling in descriptive\ninference (i.e. survey sampling), and the statistical generalisability of\nin-sample causal effect estimates in causal inference; both of which relate to\nthe consideration of model-based and wider uncertainty when presenting research\nconclusions from models. Given that model-based adjustments are never perfect,\nwe argue that qualitative risk of bias reporting frameworks for both\ndescriptive and causal inferential arguments should be further developed and\nmade mandatory by journals and funders. It is only through clear statements of\nthe limits to statistical arguments that consumers of research can fully judge\ntheir value for any specific application.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:08:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pescott","Oliver L.",""],["Boyd","Robin J.",""],["Powney","Gary D.",""],["Stewart","Gavin B.",""]]}
{"id":"2308.11459","submitter":"Zhe-Yu Jeff Ou","authors":"Xuan Tang, Yunxiao Zhang, Xueshi Guo, Liang Cui, Xiaoying Li, Z. Y. Ou","title":"Phase Dependent Hanbury-Brown and Twiss effect","comments":"5 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hanbury-Brown and Twiss (HBT) effect is the foundation for stellar intensity\ninterferometry. However, it is a phase insensitive two-photon interference\neffect. In this paper, we extend the HBT interferometer by mixing two\nphase-coherent input fields with coherent auxiliary fields before intensity\ncorrelation measurement and achieve phase sensitive two-photon interference so\nas to measure the complete complex second-order coherence function of the input\nfields. This practical scheme paves the way for synthetic aperture imaging for\nastronomical applications in optical regime. Pulsed input fields is also tested\nfor potential remote sensing and ranging applications. We discuss the condition\nto implement recently proposed entanglement-based telescopy scheme with the\nmore realistic cw broadband anti-bunched light fields.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:11:45 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tang","Xuan",""],["Zhang","Yunxiao",""],["Guo","Xueshi",""],["Cui","Liang",""],["Li","Xiaoying",""],["Ou","Z. Y.",""]]}
{"id":"2308.11460","submitter":"Aaron Levin","authors":"Gordon Heier and Aaron Levin","title":"A Schmidt-Nochka Theorem for closed subschemes in subgeneral position","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In previous work, the authors established a generalized version of Schmidt's\nsubspace theorem for closed subschemes in general position in terms of Seshadri\nconstants. We extend our theorem to weighted sums involving closed subschemes\nin subgeneral position, providing a joint generalization of Schmidt's theorem\nwith seminal inequalities of Nochka. A key aspect of the proof is the use of a\nlower bound for Seshadri constants of intersections from algebraic geometry, as\nwell as a generalized Chebyshev inequality. As an application, we extend\ninequalities of Nochka and Ru-Wong from hyperplanes in $m$-subgeneral position\nto hypersurfaces in $m$-subgeneral position in projective space, proving a\nsharp result in dimensions $2$ and $3$, and coming within a factor of $3/2$ of\na sharp inequality in all dimensions. We state analogous results in Nevanlinna\ntheory generalizing the Second Main Theorem and Nochka's theorem (Cartan's\nconjecture).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:11:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Heier","Gordon",""],["Levin","Aaron",""]]}
{"id":"2308.11461","submitter":"Marc Uetz","authors":"Puck te Rietmole and Marc Uetz","title":"Sequencing Stochastic Jobs with a Single Sample","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper revisits the well known single machine scheduling problem to\nminimize total weighted completion times. The twist is that job sizes are\nstochastic from unknown distributions, and the scheduler has access to only a\nsingle sample from each of the distributions. For this restricted information\nregime, we analyze the simplest and probably only reasonable scheduling\nalgorithm, namely to schedule by ordering the jobs by weight over sampled\nprocessing times. In general, this algorithm can be tricked by adversarial\ninput distributions, performing in expectation arbitrarily worse even in\ncomparison to choosing a random schedule. The paper suggests notions to capture\nthe idea that this algorithm, on reasonable inputs, should exhibit a provably\ngood expected performance. Specifically, we identify three natural classes of\ninput distributions, such that for these classes, the algorithm performs better\nthan random on any input.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:13:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Rietmole","Puck te",""],["Uetz","Marc",""]]}
{"id":"2308.11462","submitter":"Neel Guha","authors":"Neel Guha, Julian Nyarko, Daniel E. Ho, Christopher R\\'e, Adam\n  Chilton, Aditya Narayana, Alex Chohlas-Wood, Austin Peters, Brandon Waldon,\n  Daniel N. Rockmore, Diego Zambrano, Dmitry Talisman, Enam Hoque, Faiz Surani,\n  Frank Fagan, Galit Sarfaty, Gregory M. Dickinson, Haggai Porat, Jason\n  Hegland, Jessica Wu, Joe Nudell, Joel Niklaus, John Nay, Jonathan H. Choi,\n  Kevin Tobia, Margaret Hagan, Megan Ma, Michael Livermore, Nikon Rasumov-Rahe,\n  Nils Holzenberger, Noam Kolt, Peter Henderson, Sean Rehaag, Sharad Goel,\n  Shang Gao, Spencer Williams, Sunny Gandhi, Tom Zur, Varun Iyer, and Zehua Li","title":"LegalBench: A Collaboratively Built Benchmark for Measuring Legal\n  Reasoning in Large Language Models","comments":"143 pages, 79 tables, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The advent of large language models (LLMs) and their adoption by the legal\ncommunity has given rise to the question: what types of legal reasoning can\nLLMs perform? To enable greater study of this question, we present LegalBench:\na collaboratively constructed legal reasoning benchmark consisting of 162 tasks\ncovering six different types of legal reasoning. LegalBench was built through\nan interdisciplinary process, in which we collected tasks designed and\nhand-crafted by legal professionals. Because these subject matter experts took\na leading role in construction, tasks either measure legal reasoning\ncapabilities that are practically useful, or measure reasoning skills that\nlawyers find interesting. To enable cross-disciplinary conversations about LLMs\nin the law, we additionally show how popular legal frameworks for describing\nlegal reasoning -- which distinguish between its many forms -- correspond to\nLegalBench tasks, thus giving lawyers and LLM developers a common vocabulary.\nThis paper describes LegalBench, presents an empirical evaluation of 20\nopen-source and commercial LLMs, and illustrates the types of research\nexplorations LegalBench enables.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 22:08:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Guha","Neel",""],["Nyarko","Julian",""],["Ho","Daniel E.",""],["R\u00e9","Christopher",""],["Chilton","Adam",""],["Narayana","Aditya",""],["Chohlas-Wood","Alex",""],["Peters","Austin",""],["Waldon","Brandon",""],["Rockmore","Daniel N.",""],["Zambrano","Diego",""],["Talisman","Dmitry",""],["Hoque","Enam",""],["Surani","Faiz",""],["Fagan","Frank",""],["Sarfaty","Galit",""],["Dickinson","Gregory M.",""],["Porat","Haggai",""],["Hegland","Jason",""],["Wu","Jessica",""],["Nudell","Joe",""],["Niklaus","Joel",""],["Nay","John",""],["Choi","Jonathan H.",""],["Tobia","Kevin",""],["Hagan","Margaret",""],["Ma","Megan",""],["Livermore","Michael",""],["Rasumov-Rahe","Nikon",""],["Holzenberger","Nils",""],["Kolt","Noam",""],["Henderson","Peter",""],["Rehaag","Sean",""],["Goel","Sharad",""],["Gao","Shang",""],["Williams","Spencer",""],["Gandhi","Sunny",""],["Zur","Tom",""],["Iyer","Varun",""],["Li","Zehua",""]]}
{"id":"2308.11463","submitter":"Toon Van De Maele","authors":"Toon Van de Maele, Bart Dhoedt, Tim Verbelen, Giovanni Pezzulo","title":"Bridging Cognitive Maps: a Hierarchical Active Inference Model of\n  Spatial Alternation Tasks and the Hippocampal-Prefrontal Circuit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cognitive problem-solving benefits from cognitive maps aiding navigation and\nplanning. Previous studies revealed that cognitive maps for physical space\nnavigation involve hippocampal (HC) allocentric codes, while cognitive maps for\nabstract task space engage medial prefrontal cortex (mPFC) task-specific codes.\nSolving challenging cognitive tasks requires integrating these two types of\nmaps. This is exemplified by spatial alternation tasks in multi-corridor\nsettings, where animals like rodents are rewarded upon executing an alternation\npattern in maze corridors. Existing studies demonstrated the HC - mPFC\ncircuit's engagement in spatial alternation tasks and that its disruption\nimpairs task performance. Yet, a comprehensive theory explaining how this\ncircuit integrates task-related and spatial information is lacking. We advance\na novel hierarchical active inference model clarifying how the HC - mPFC\ncircuit enables the resolution of spatial alternation tasks, by merging\nphysical and task-space cognitive maps. Through a series of simulations, we\ndemonstrate that the model's dual layers acquire effective cognitive maps for\nnavigation within physical (HC map) and task (mPFC map) spaces, using a\nbiologically-inspired approach: a clone-structured cognitive graph. The model\nsolves spatial alternation tasks through reciprocal interactions between the\ntwo layers. Importantly, disrupting inter-layer communication impairs difficult\ndecisions, consistent with empirical findings. The same model showcases the\nability to switch between multiple alternation rules. However, inhibiting\nmessage transmission between the two layers results in perseverative behavior,\nconsistent with empirical findings. In summary, our model provides a\nmechanistic account of how the HC - mPFC circuit supports spatial alternation\ntasks and how its disruption impairs task performance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:21:33 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Van de Maele","Toon",""],["Dhoedt","Bart",""],["Verbelen","Tim",""],["Pezzulo","Giovanni",""]]}
{"id":"2308.11464","submitter":"Yun-Hin Chan","authors":"Yun-Hin Chan, Rui Zhou, Running Zhao, Zhihan Jiang, Edith C.-H. Ngai","title":"Internal Cross-layer Gradients for Extending Homogeneity to\n  Heterogeneity in Federated Learning","comments":"Preprint. Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) inevitably confronts the challenge of system\nheterogeneity in practical scenarios. To enhance the capabilities of most\nmodel-homogeneous FL methods in handling system heterogeneity, we propose a\ntraining scheme that can extend their capabilities to cope with this challenge.\nIn this paper, we commence our study with a detailed exploration of homogeneous\nand heterogeneous FL settings and discover three key observations: (1) a\npositive correlation between client performance and layer similarities, (2)\nhigher similarities in the shallow layers in contrast to the deep layers, and\n(3) the smoother gradients distributions indicate the higher layer\nsimilarities. Building upon these observations, we propose InCo Aggregation\nthat leverags internal cross-layer gradients, a mixture of gradients from\nshallow and deep layers within a server model, to augment the similarity in the\ndeep layers without requiring additional communication between clients.\nFurthermore, our methods can be tailored to accommodate model-homogeneous FL\nmethods such as FedAvg, FedProx, FedNova, Scaffold, and MOON, to expand their\ncapabilities to handle the system heterogeneity. Copious experimental results\nvalidate the effectiveness of InCo Aggregation, spotlighting internal\ncross-layer gradients as a promising avenue to enhance the performance in\nheterogenous FL.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:23:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chan","Yun-Hin",""],["Zhou","Rui",""],["Zhao","Running",""],["Jiang","Zhihan",""],["Ngai","Edith C. -H.",""]]}
{"id":"2308.11465","submitter":"Shashank Kumar Roy","authors":"Shashank Kumar Roy and Amit Apte","title":"Computation of covariant lyapunov vectors using data assimilation","comments":"20 pages, 9 figures and no tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computing Lyapunov vectors from partial and noisy observations is a\nchallenging problem. We propose a method using data assimilation to approximate\nthe Lyapunov vectors using the estimate of the underlying trajectory obtained\nfrom the filter mean. We then extensively study the sensitivity of these\napproximate Lyapunov vectors and the corresponding Oseledets' subspaces to the\nperturbations in the underlying true trajectory. We demonstrate that this\nsensitivity is consistent with and helps explain the errors in the approximate\nLyapunov vectors from the estimated trajectory of the filter. Using the idea of\nprincipal angles, we demonstrate that the Oseledets' subspaces defined by the\nLVs computed from the approximate trajectory are less sensitive than the\nindividual vectors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:24:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Roy","Shashank Kumar",""],["Apte","Amit",""]]}
{"id":"2308.11466","submitter":"Paul-Ambroise Duquenne","authors":"Paul-Ambroise Duquenne, Holger Schwenk, Beno\\^it Sagot","title":"SONAR: Sentence-Level Multimodal and Language-Agnostic Representations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce SONAR, a new multilingual and multimodal fixed-size sentence\nembedding space. Our single text encoder, covering 200 languages, substantially\noutperforms existing sentence embeddings such as LASER3 and LabSE on the xsim\nand xsim++ multilingual similarity search tasks. Speech segments can be\nembedded in the same SONAR embedding space using language-specific speech\nencoders trained in a teacher-student setting on speech transcription data. Our\nencoders outperform existing speech encoders on similarity search tasks. We\nalso provide a text decoder for 200 languages, which allows us to perform\ntext-to-text and speech-to-text machine translation, including for zero-shot\nlanguage and modality combinations. Our text-to-text results are competitive\ncompared to the state-of-the-art NLLB~1B model, despite the fixed-size\nbottleneck representation. Our zero-shot speech-to-text translation results\ncompare favorably with strong supervised baselines such as Whisper.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:25:15 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 10:46:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Duquenne","Paul-Ambroise",""],["Schwenk","Holger",""],["Sagot","Beno\u00eet",""]]}
{"id":"2308.11467","submitter":"Abbas  Nasrollah Nejad","authors":"Marcos Jardim, Abbas Nasrollah Nejad and Aron Simis","title":"The Bourbaki Degree of Plane Projective Curves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bourbaki sequences and Bourbaki ideals have been studied by several authors\nsince its inception sixty years ago circa. Generic Bourbaki sequences have been\nthoroughly examined by the senior author with B. Ulrich and W. Vasconcelos, but\ndue to their nature, no numerical invariant was immediately available.\nRecently, J. Herzog, S. Kumashiro, and D. Stamate introduced the {\\em Bourbaki\nnumber} in the category of graded modules as the shifted degree of a Bourbaki\nideal corresponding to submodules generated in degree at least the maximal\ndegree of a minimal generator of the given module. The present work introduces\nthe{\\em Bourbaki degree} as the algebraic multiplicity of a Bourbaki ideal\ncorresponding to choices of minimal generators of minimal degree. The main\nintent is a study of plane curve singularities via this new numerical\ninvariant. Accordingly, quite naturally, the focus is on the case where the\nstanding graded module is the first syzygy module of the gradient ideal of a\nreduced form $f\\in k[x,y,z]$ -- i.e., the main component of the module of\nlogarithmic derivations of the corresponding curve. The overall goal of this\nproject is to allow for a facet of classification of projective plane curves\nbased on the behavior of this new numerical invariant, with emphasis on results\nabout its lower and upper bounds.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:27:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jardim","Marcos",""],["Nejad","Abbas Nasrollah",""],["Simis","Aron",""]]}
{"id":"2308.11468","submitter":"Silvia Liberata Ullo","authors":"Mariapia Rita Iandolo and Francesca Razzano and Chiara Zarro and G. S.\n  Yogesh and Silvia Liberata Ullo","title":"Multitemporal analysis in Google Earth Engine for detecting urban\n  changes using optical data and machine learning algorithms","comments":"4 pages, 6 figures, 2023 InGARSS Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The aim of this work is to perform a multitemporal analysis using the Google\nEarth Engine (GEE) platform for the detection of changes in urban areas using\noptical data and specific machine learning (ML) algorithms. As a case study,\nCairo City has been identified, in Egypt country, as one of the five most\npopulous megacities of the last decade in the world. Classification and change\ndetection analysis of the region of interest (ROI) have been carried out from\nJuly 2013 to July 2021. Results demonstrate the validity of the proposed method\nin identifying changed and unchanged urban areas over the selected period.\nFurthermore, this work aims to evidence the growing significance of GEE as an\nefficient cloud-based solution for managing large quantities of satellite data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:29:19 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Iandolo","Mariapia Rita",""],["Razzano","Francesca",""],["Zarro","Chiara",""],["Yogesh","G. S.",""],["Ullo","Silvia Liberata",""]]}
{"id":"2308.11469","submitter":"Gon\\c{c}alo dos Reis Dr.","authors":"Francisco Bernal and Xingyuan Chen and Goncalo dos Reis","title":"An iterative method for Helmholtz boundary value problems arising in\n  wave propagation","comments":"21 pages, 6 Figures, 1 table,","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The complex Helmholtz equation $(\\Delta + k^2)u=f$ (where $k\\in{\\mathbb\nR},u(\\cdot),f(\\cdot)\\in{\\mathbb C}$) is a mainstay of computational wave\nsimulation. Despite its apparent simplicity, efficient numerical methods are\nchallenging to design and, in some applications, regarded as an open problem.\nTwo sources of difficulty are the large number of degrees of freedom and the\nindefiniteness of the matrices arising after discretisation. Seeking to meet\nthem within the novel framework of probabilistic domain decomposition, we set\nout to rewrite the Helmholtz equation into a form amenable to the Feynman-Kac\nformula for elliptic boundary value problems. We consider two typical\nscenarios, the scattering of a plane wave and the propagation inside a cavity,\nand recast them as a sequence of Poisson equations. By means of stochastic\narguments, we find a sufficient and simulatable condition for the convergence\nof the iterations. Upon discretisation a necessary condition for convergence\ncan be derived by adding up the iterates using the harmonic series for the\nmatrix inverse -- we illustrate the procedure in the case of finite\ndifferences.\n  From a practical point of view, our results are ultimately of limited scope.\nNonetheless, this unexpected -- even paradoxical -- new direction of attack on\nthe Helmholtz equation proposed by this work offers a fresh perspective on this\nclassical and difficult problem. Our results show that there indeed exists a\npredictable range $k<k_{max}$ in which this new ansatz works with $k_{max}$\nbeing far below the challenging situation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:31:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bernal","Francisco",""],["Chen","Xingyuan",""],["Reis","Goncalo dos",""]]}
{"id":"2308.11470","submitter":"Carlo Heissenberg","authors":"Carlo Heissenberg","title":"Angular Momentum Loss Due to Spin-Orbit Effects in the Post-Minkowskian\n  Expansion","comments":"11 pages + references. arXiv admin note: text overlap with\n  arXiv:2210.15689","journal-ref":null,"doi":null,"report-no":"UUITP-22/23","categories":"hep-th gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculate the spin-orbit corrections to the loss of angular momentum in a\ntwo-body scattering at third Post-Minkowskian order, $\\mathcal O(G^3)$, from\nscattering amplitudes using the eikonal operator. These results include effects\nlinear in spin, are valid for generic spin orientations and are presented in a\nmanifestly Poincar\\'e covariant way. We include both radiative losses, by means\nof the leading-order gravitational waveform, and static losses by means of the\nappropriate $-i0$ prescription in the leading soft graviton theorem, finding\nagreement with known results in the Post-Newtonian limit.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:36:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Heissenberg","Carlo",""]]}
{"id":"2308.11471","submitter":"Ricardo de Azambuja","authors":"Haechan Mark Bong and Rongge Zhang and Ricardo de Azambuja and\n  Giovanni Beltrame","title":"Dynamic Open Vocabulary Enhanced Safe-landing with Intelligence\n  (DOVESEI)","comments":"Submitted to IROS 2023 The Last-Mile Robotics Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This work targets what we consider to be the foundational step for urban\nairborne robots, a safe landing. Our attention is directed toward what we deem\nthe most crucial aspect of the safe landing perception stack: segmentation. We\npresent a streamlined reactive UAV system that employs visual servoing by\nharnessing the capabilities of open vocabulary image segmentation. This\napproach can adapt to various scenarios with minimal adjustments, bypassing the\nnecessity for extensive data accumulation for refining internal models, thanks\nto its open vocabulary methodology. Given the limitations imposed by local\nauthorities, our primary focus centers on operations originating from altitudes\nof 100 meters. This choice is deliberate, as numerous preceding works have\ndealt with altitudes up to 30 meters, aligning with the capabilities of small\nstereo cameras. Consequently, we leave the remaining 20m to be navigated using\nconventional 3D path planning methods. Utilizing monocular cameras and image\nsegmentation, our findings demonstrate the system's capability to successfully\nexecute landing maneuvers at altitudes as low as 20 meters. However, this\napproach is vulnerable to intermittent and occasionally abrupt fluctuations in\nthe segmentation between frames in a video stream. To address this challenge,\nwe enhance the image segmentation output by introducing what we call a dynamic\nfocus: a masking mechanism that self adjusts according to the current landing\nstage. This dynamic focus guides the control system to avoid regions beyond the\ndrone's safety radius projected onto the ground, thus mitigating the problems\nwith fluctuations. Through the implementation of this supplementary layer, our\nexperiments have reached improvements in the landing success rate of almost\ntenfold when compared to global segmentation. All the source code is open\nsource and available online (github.com/MISTLab/DOVESEI).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:36:59 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 00:17:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bong","Haechan Mark",""],["Zhang","Rongge",""],["de Azambuja","Ricardo",""],["Beltrame","Giovanni",""]]}
{"id":"2308.11472","submitter":"Patrick Cameron","authors":"Patrick Cameron, Baptiste Courme, Daniele Faccio, Hugo Defienne","title":"Quantum-assisted Adaptive Optics for Microscopy","comments":"Main manuscript: 11 pages, 5 figures. Supplemental information: 14\n  pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adaptive optics (AO) has revolutionized imaging in applications ranging from\nastronomy to microscopy by enabling the correction of optical aberrations. In\nlabel-free microscopes, however, conventional AO methods are limited due to the\nabsence of guidestar and the need to select an optimization metric specific to\nthe type of sample and imaging process being used. Here, we propose a\nquantum-assisted AO approach that exploits correlations between entangled\nphotons to directly access and correct the point spread function (PSF) of the\nimaging system. This guidestar-free method is independent of the specimen and\nimaging modality. We demonstrate the imaging of biological samples in the\npresence of aberrations using a bright-field imaging setup operating with a\nsource of spatially-entangled photon pairs. We show that our approach performs\nbetter than conventional AO in correcting certain types of aberrations,\nparticularly in cases involving significant defocus. Our work improves AO for\nlabel-free microscopy, and could play a major role in the development of\nquantum microscopes, in which optical aberrations can counteract the advantages\nof using entangled photons and undermine their practical use.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:37:30 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cameron","Patrick",""],["Courme","Baptiste",""],["Faccio","Daniele",""],["Defienne","Hugo",""]]}
{"id":"2308.11473","submitter":"Yiwen Chen","authors":"Yiwen Chen, Chi Zhang, Xiaofeng Yang, Zhongang Cai, Gang Yu, Lei Yang,\n  Guosheng Lin","title":"IT3D: Improved Text-to-3D Generation with Explicit View Synthesis","comments":"Project Page: https://github.com/buaacyw/IT3D-text-to-3D","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent strides in Text-to-3D techniques have been propelled by distilling\nknowledge from powerful large text-to-image diffusion models (LDMs).\nNonetheless, existing Text-to-3D approaches often grapple with challenges such\nas over-saturation, inadequate detailing, and unrealistic outputs. This study\npresents a novel strategy that leverages explicitly synthesized multi-view\nimages to address these issues. Our approach involves the utilization of\nimage-to-image pipelines, empowered by LDMs, to generate posed high-quality\nimages based on the renderings of coarse 3D models. Although the generated\nimages mostly alleviate the aforementioned issues, challenges such as view\ninconsistency and significant content variance persist due to the inherent\ngenerative nature of large diffusion models, posing extensive difficulties in\nleveraging these images effectively. To overcome this hurdle, we advocate\nintegrating a discriminator alongside a novel Diffusion-GAN dual training\nstrategy to guide the training of 3D models. For the incorporated\ndiscriminator, the synthesized multi-view images are considered real data,\nwhile the renderings of the optimized 3D models function as fake data. We\nconduct a comprehensive set of experiments that demonstrate the effectiveness\nof our method over baseline approaches.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:39:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Yiwen",""],["Zhang","Chi",""],["Yang","Xiaofeng",""],["Cai","Zhongang",""],["Yu","Gang",""],["Yang","Lei",""],["Lin","Guosheng",""]]}
{"id":"2308.11474","submitter":"Xiaojie Sun","authors":"Xiaojie Sun, Keping Bi, Jiafeng Guo, Xinyu Ma, Fan Yixing, Hongyu\n  Shan, Qishen Zhang, Zhongyi Liu","title":"Pre-training with Aspect-Content Text Mutual Prediction for Multi-Aspect\n  Dense Retrieval","comments":"accepted by cikm2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Grounded on pre-trained language models (PLMs), dense retrieval has been\nstudied extensively on plain text. In contrast, there has been little research\non retrieving data with multiple aspects using dense models. In the scenarios\nsuch as product search, the aspect information plays an essential role in\nrelevance matching, e.g., category: Electronics, Computers, and Pet Supplies. A\ncommon way of leveraging aspect information for multi-aspect retrieval is to\nintroduce an auxiliary classification objective, i.e., using item contents to\npredict the annotated value IDs of item aspects. However, by learning the value\nembeddings from scratch, this approach may not capture the various semantic\nsimilarities between the values sufficiently. To address this limitation, we\nleverage the aspect information as text strings rather than class IDs during\npre-training so that their semantic similarities can be naturally captured in\nthe PLMs. To facilitate effective retrieval with the aspect strings, we propose\nmutual prediction objectives between the text of the item aspect and content.\nIn this way, our model makes more sufficient use of aspect information than\nconducting undifferentiated masked language modeling (MLM) on the concatenated\ntext of aspects and content. Extensive experiments on two real-world datasets\n(product and mini-program search) show that our approach can outperform\ncompetitive baselines both treating aspect values as classes and conducting the\nsame MLM for aspect and content strings. Code and related dataset will be\navailable at the URL \\footnote{https://github.com/sunxiaojie99/ATTEMPT}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:42:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sun","Xiaojie",""],["Bi","Keping",""],["Guo","Jiafeng",""],["Ma","Xinyu",""],["Yixing","Fan",""],["Shan","Hongyu",""],["Zhang","Qishen",""],["Liu","Zhongyi",""]]}
{"id":"2308.11475","submitter":"Richard Weaver","authors":"SangMin Lee and Richard L Weaver","title":"On Slow Dynamic Elasticity at short times","comments":"10 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has been reported that slow dynamic nonlinear elastic relaxations, widely\nthought to proceed in proportion to the logarithm of time since mechanical\nconditioning ceases, recover at a diminished rate at early times, with a time\nof transition that varies with the grain size of the material. Here we recount\nnew observations at short times, in the single bead system, in cement paste and\nin sandstone and mortar. Notwithstanding the limits imposed by finite duration\nring down such that the effective instant of conditioning cessation is\nimprecise, and the corresponding ambiguity as to the time that relaxation\nbegins, we find no reliable sign of such a transition, even in samples of large\ngrain size mortar similar to those described elsewhere as having clear and late\ncutoffs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:42:52 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lee","SangMin",""],["Weaver","Richard L",""]]}
{"id":"2308.11476","submitter":"Luis Anchordoqui","authors":"Luis A. Anchordoqui, Ignatios Antoniadis, Karim Benakli, Jules Cunat,\n  and Dieter Lust","title":"Searching for neutrino-modulino oscillations at the Forward Physics\n  Facility","comments":"6 pages revtex, 2 figures","journal-ref":null,"doi":null,"report-no":"MPP-2023-169; LMU-ASC 29/23","categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We make use of swampland conjectures to explore the phenomenology of\nneutrino-modulino mixing in regions of the parameter space that are within the\nsensitivity of experiments at the CERN's Forward Physics Facility (FPF). We\nadopt the working assumption of Dirac mass terms which couple left- and\nright-handed neutrinos. We further assume that the 3 right-handed neutrinos are\n0-modes of bulk 5-dimensional states in the dark dimension, a novel scenario\nwhich has a compact space with characteristic length-scale in the micron range\nthat produces a natural suppression of the 4-dimensional Yukawa couplings,\nyielding naturally light Dirac neutrinos. We formulate a specific realization\nof models with high-scale supersymmetry breaking that can host a rather heavy\ngravitino ($m_{3/2} \\sim 250$ TeV) and a modulino with mass scale ($m_4 \\sim\n50$ eV) within the FPF discovery reach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:42:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Anchordoqui","Luis A.",""],["Antoniadis","Ignatios",""],["Benakli","Karim",""],["Cunat","Jules",""],["Lust","Dieter",""]]}
{"id":"2308.11477","submitter":"Krunal Kishor Patel","authors":"Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi","title":"Revisiting column-generation-based matheuristic for learning\n  classification trees","comments":"Submitted to Computers and Operations Research journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Decision trees are highly interpretable models for solving classification\nproblems in machine learning (ML). The standard ML algorithms for training\ndecision trees are fast but generate suboptimal trees in terms of accuracy.\nOther discrete optimization models in the literature address the optimality\nproblem but only work well on relatively small datasets. \\cite{firat2020column}\nproposed a column-generation-based heuristic approach for learning decision\ntrees. This approach improves scalability and can work with large datasets. In\nthis paper, we describe improvements to this column generation approach. First,\nwe modify the subproblem model to significantly reduce the number of\nsubproblems in multiclass classification instances. Next, we show that the\ndata-dependent constraints in the master problem are implied, and use them as\ncutting planes. Furthermore, we describe a separation model to generate data\npoints for which the linear programming relaxation solution violates their\ncorresponding constraints. We conclude by presenting computational results that\nshow that these modifications result in better scalability.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:43:36 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Patel","Krunal Kishor",""],["Desaulniers","Guy",""],["Lodi","Andrea",""]]}
{"id":"2308.11478","submitter":"Lorenzo Terenzi","authors":"Lorenzo Terenzi, Marco Hutter","title":"Towards Autonomous Excavation Planning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Excavation plans are crucial in construction projects, dictating the dirt\ndisposal strategy and excavation sequence based on the final geometry and\nmachinery available. While most construction processes rely heavily on coarse\nsequence planning and local execution planning driven by human expertise and\nintuition, fully automated planning tools are notably absent from the industry.\nThis paper introduces a fully autonomous excavation planning system. Initially,\nthe site is mapped, followed by user selection of the desired excavation\ngeometry. The system then invokes a global planner to determine the sequence of\nposes for the excavator, ensuring complete site coverage. For each pose, a\nlocal excavation planner decides how to move the soil around the machine, and a\ndigging planner subsequently dictates the sequence of digging trajectories to\ncomplete a patch. We showcased our system by autonomously excavating the\nlargest pit documented so far, achieving an average digging cycle time of\nroughly 30 seconds, comparable to the one of a human operator.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:44:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Terenzi","Lorenzo",""],["Hutter","Marco",""]]}
{"id":"2308.11479","submitter":"Caitlin Beattie","authors":"Caitlin Beattie (for the ALICE Collaboration)","title":"Charged-particle jet spectra in event-shape engineered Pb--Pb collisions\n  at $\\sqrt{s_{\\rm NN}}$ = 5.02 TeV with ALICE","comments":"Proceedings of the 11th International Conference on Hard and\n  Electromagnetic Probes of High-Energy Nuclear Collisions, March 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The path-length dependence of jet quenching can help to constrain different\njet quenching mechanisms in heavy-ion collisions. However, measuring an\nexplicit value for this dependence has proven challenging. Traditional\napproaches, which consider anisotropic jet suppression arising from geometric\nasymmetries, have successfully measured a non-zero azimuthal dependence of jet\nmodification with respect to the event-plane angle of the collision. While such\nsignals improve our qualitative understanding of this topic, extraction of an\nexplicit dependence from these results is limited by fluctuations in the\ninitial state and jet--medium interactions. A new approach to characterize the\ngeometry of the collision is to use event-shape engineering, a technique that\nclassifies events within a centrality class according to their elliptical\nanisotropies. By doing so, we gain an improved knowledge of the initial-state\nmedium, consequently enabling better constraints on the average path length\ntraversed by the jet. In these proceedings, new results of jet spectra from\nevent-shape-engineered collisions at ALICE will be presented.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:47:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Beattie","Caitlin","","for the ALICE Collaboration"]]}
{"id":"2308.11480","submitter":"Charles Guille-Escuret","authors":"Charles Guille-Escuret and Pierre-Andr\\'e No\\\"el and Ioannis\n  Mitliagkas and David Vazquez and Joao Monteiro","title":"Expecting The Unexpected: Towards Broad Out-Of-Distribution Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Improving the reliability of deployed machine learning systems often involves\ndeveloping methods to detect out-of-distribution (OOD) inputs. However,\nexisting research often narrowly focuses on samples from classes that are\nabsent from the training set, neglecting other types of plausible distribution\nshifts. This limitation reduces the applicability of these methods in\nreal-world scenarios, where systems encounter a wide variety of anomalous\ninputs. In this study, we categorize five distinct types of distribution shifts\nand critically evaluate the performance of recent OOD detection methods on each\nof them. We publicly release our benchmark under the name BROAD (Benchmarking\nResilience Over Anomaly Diversity). Our findings reveal that while these\nmethods excel in detecting unknown classes, their performance is inconsistent\nwhen encountering other types of distribution shifts. In other words, they only\nreliably detect unexpected inputs that they have been specifically designed to\nexpect. As a first step toward broad OOD detection, we learn a generative model\nof existing detection scores with a Gaussian mixture. By doing so, we present\nan ensemble approach that offers a more consistent and comprehensive solution\nfor broad OOD detection, demonstrating superior performance compared to\nexisting methods. Our code to download BROAD and reproduce our experiments is\npublicly available.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:52:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Guille-Escuret","Charles",""],["No\u00ebl","Pierre-Andr\u00e9",""],["Mitliagkas","Ioannis",""],["Vazquez","David",""],["Monteiro","Joao",""]]}
{"id":"2308.11481","submitter":"Charles Sackett","authors":"M. Beydler, E. R. Moan, Z. Luo, Z. Chu, and C. A. Sackett","title":"Guided-Wave Sagnac Atom Interferometer with Large Area and Multiple\n  Orbits","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe a matter-wave Sagnac interferometer using Bose condensed atoms\nconfined in a time-orbiting potential trap. Compared to our previous\nimplementation [Moan et al., Phys. Rev. Lett. 124, 120403 (2020)], our new\napparatus provides better thermal stability, improved optical access, and\nreduced trap anharmonicity. The trapping field can be adjusted to compensate\nfor small tilts of the apparatus in gravity. These features enable operation\nwith an effective Sagnac area of 4 mm2 per orbit, and we observe interference\nwith 25% visibility after two orbits at a total interrogation time of 0.6 s.\nLong-term measurements indicate a phase stability of 0.2 rad or better.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:53:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Beydler","M.",""],["Moan","E. R.",""],["Luo","Z.",""],["Chu","Z.",""],["Sackett","C. A.",""]]}
{"id":"2308.11482","submitter":"Lixiang Yang","authors":"Lixiang Yang","title":"On Polymer Statistical Mechanics: From Gaussian Distribution to\n  Maxwell-Boltzmann Distribution to Fermi-Dirac Distribution","comments":"3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.mtrl-sci math-ph math.MP quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Macroscopic mechanical properties of polymers are determined by their\nmicroscopic molecular chain distribution. Due to randomness of these molecular\nchains, probability theory has been used to find their micro-states and energy\ndistribution. In this paper, aided by central limit theorem and mixed Bayes\nrule, we showed that entropy elasticity based on Gaussian distribution is\nquestionable. By releasing freely jointed chain assumption, we found that there\nis energy redistribution when each bond of a molecular chain changes its\nlength. Therefore, we have to change Gaussian distribution used in polymer\nelasticity to Maxwell-Boltzmann distribution. Since Maxwell-Boltzmann\ndistribution is only a good energy description for gas molecules, we found a\nmathematical path to change Maxwell-Boltzmann distribution to Fermi-Dirac\ndistribution based on molecular chain structures. Because a molecular chain can\nbe viewed as many monomers glued by covalent electrons, Fermi-Dirac\ndistribution describes the probability of covalent electron occupancy in\nmicro-states for solids such as polymers. Mathematical form of Fermi-Dirac\ndistribution is logistic function. Mathematical simplicity and beauty of\nFermi-Dirac distribution make many hard mechanics problems easy to understand.\nGeneralized logistic function or Fermi-Dirac distribution function was able to\nunderstand many polymer mechanics problems such as viscoelasticity [1],\nviscoplasticity [2], shear band and necking [3], and ultrasonic bonding [4].\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:54:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yang","Lixiang",""]]}
{"id":"2308.11483","submitter":"Pouya Pezeshkpour","authors":"Pouya Pezeshkpour, Estevam Hruschka","title":"Large Language Models Sensitivity to The Order of Options in\n  Multiple-Choice Questions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have demonstrated remarkable capabilities in\nvarious NLP tasks. However, previous works have shown these models are\nsensitive towards prompt wording, and few-shot demonstrations and their order,\nposing challenges to fair assessment of these models. As these models become\nmore powerful, it becomes imperative to understand and address these\nlimitations. In this paper, we focus on LLMs robustness on the task of\nmultiple-choice questions -- commonly adopted task to study reasoning and\nfact-retrieving capability of LLMs. Investigating the sensitivity of LLMs\ntowards the order of options in multiple-choice questions, we demonstrate a\nconsiderable performance gap of approximately 13% to 75% in LLMs on different\nbenchmarks, when answer options are reordered, even when using demonstrations\nin a few-shot setting. Through a detailed analysis, we conjecture that this\nsensitivity arises when LLMs are uncertain about the prediction between the\ntop-2/3 choices, and specific options placements may favor certain prediction\nbetween those top choices depending on the question caused by positional bias.\nWe also identify patterns in top-2 choices that amplify or mitigate the model's\nbias toward option placement. We found that for amplifying bias, the optimal\nstrategy involves positioning the top two choices as the first and last\noptions. Conversely, to mitigate bias, we recommend placing these choices among\nthe adjacent options. To validate our conjecture, we conduct various\nexperiments and adopt two approaches to calibrate LLMs' predictions, leading to\nup to 8 percentage points improvement across different models and benchmarks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:54:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pezeshkpour","Pouya",""],["Hruschka","Estevam",""]]}
{"id":"2308.11484","submitter":"Caroline Malin-Mayor","authors":"Caroline Malin-Mayor, Vida Adeli, Andrea Sabo, Sergey Noritsyn,\n  Carolina Gorodetsky, Alfonso Fasano, Andrea Iaboni, Babak Taati","title":"Pose2Gait: Extracting Gait Features from Monocular Video of Individuals\n  with Dementia","comments":"14 pages, 3 figures. Code is available at\n  https://github.com/TaatiTeam/pose2gait_public . To be published at the\n  Ambient Intelligence for Health Care Workshop at MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video-based ambient monitoring of gait for older adults with dementia has the\npotential to detect negative changes in health and allow clinicians and\ncaregivers to intervene early to prevent falls or hospitalizations. Computer\nvision-based pose tracking models can process video data automatically and\nextract joint locations; however, publicly available models are not optimized\nfor gait analysis on older adults or clinical populations. In this work we\ntrain a deep neural network to map from a two dimensional pose sequence,\nextracted from a video of an individual walking down a hallway toward a\nwall-mounted camera, to a set of three-dimensional spatiotemporal gait features\naveraged over the walking sequence. The data of individuals with dementia used\nin this work was captured at two sites using a wall-mounted system to collect\nthe video and depth information used to train and evaluate our model. Our\nPose2Gait model is able to extract velocity and step length values from the\nvideo that are correlated with the features from the depth camera, with\nSpearman's correlation coefficients of .83 and .60 respectively, showing that\nthree dimensional spatiotemporal features can be predicted from monocular\nvideo. Future work remains to improve the accuracy of other features, such as\nstep time and step width, and test the utility of the predicted values for\ndetecting meaningful changes in gait during longitudinal ambient monitoring.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:59:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Malin-Mayor","Caroline",""],["Adeli","Vida",""],["Sabo","Andrea",""],["Noritsyn","Sergey",""],["Gorodetsky","Carolina",""],["Fasano","Alfonso",""],["Iaboni","Andrea",""],["Taati","Babak",""]]}
{"id":"2308.11485","submitter":"Tiberio Uricchio","authors":"Alberto Baldrati, Marco Bertini, Tiberio Uricchio, Alberto del Bimbo","title":"Composed Image Retrieval using Contrastive Learning and Task-oriented\n  CLIP-based Features","comments":"Accepted in ACM Transactions on Multimedia Computing Communications\n  and Applications (TOMM)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a query composed of a reference image and a relative caption, the\nComposed Image Retrieval goal is to retrieve images visually similar to the\nreference one that integrates the modifications expressed by the caption. Given\nthat recent research has demonstrated the efficacy of large-scale vision and\nlanguage pre-trained (VLP) models in various tasks, we rely on features from\nthe OpenAI CLIP model to tackle the considered task. We initially perform a\ntask-oriented fine-tuning of both CLIP encoders using the element-wise sum of\nvisual and textual features. Then, in the second stage, we train a Combiner\nnetwork that learns to combine the image-text features integrating the bimodal\ninformation and providing combined features used to perform the retrieval. We\nuse contrastive learning in both stages of training. Starting from the bare\nCLIP features as a baseline, experimental results show that the task-oriented\nfine-tuning and the carefully crafted Combiner network are highly effective and\noutperform more complex state-of-the-art approaches on FashionIQ and CIRR, two\npopular and challenging datasets for composed image retrieval. Code and\npre-trained models are available at https://github.com/ABaldrati/CLIP4Cir\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:03:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Baldrati","Alberto",""],["Bertini","Marco",""],["Uricchio","Tiberio",""],["del Bimbo","Alberto",""]]}
{"id":"2308.11486","submitter":"Nicola Vassena","authors":"Nicola Vassena, Peter F. Stadler","title":"Unstable Cores are the source of instability in chemical reaction\n  networks","comments":"47 pages. Main text pp 1-14, Supplementary Information pp 15-47. 8\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In biochemical networks, complex dynamical features such as superlinear\ngrowth and oscillations are classically considered a consequence of\nautocatalysis. For the large class of parameter-rich kinetic models, which\nincludes Generalized Mass Action kinetics and Michaelis-Menten kinetics, we\nshow that certain submatrices of the stoichiometric matrix, so-called unstable\ncores, are sufficient for a reaction network to admit instability and\npotentially give rise to such complex dynamical behavior. The determinant of\nthe submatrix distinguishes unstable-positive feedbacks, with a single\nreal-positive eigenvalue, and unstable-negative feedbacks without real-positive\neigenvalues. Autocatalytic cores turn out to be exactly the unstable-positive\nfeedbacks that are Metzler matrices. Thus there are sources of dynamical\ninstability in chemical networks that are unrelated to autocatalysis. We use\nsuch intuition to design non-autocatalytic biochemical networks with\nsuperlinear growth and oscillations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:06:05 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Vassena","Nicola",""],["Stadler","Peter F.",""]]}
{"id":"2308.11487","submitter":"Jilong Wang","authors":"Jilong Wang, Saihui Hou, Yan Huang, Chunshui Cao, Xu Liu, Yongzhen\n  Huang, Liang Wang","title":"Free Lunch for Gait Recognition: A Novel Relation Descriptor","comments":"Add new figures and fix some typos","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Gait recognition is to seek correct matches for query individuals by their\nunique walking patterns. However, current methods focus solely on extracting\nindividual-specific features, overlooking inter-personal relationships. In this\npaper, we propose a novel $\\textbf{Relation Descriptor}$ that captures not only\nindividual features but also relations between test gaits and pre-selected\nanchored gaits. Specifically, we reinterpret classifier weights as anchored\ngaits and compute similarity scores between test features and these anchors,\nwhich re-expresses individual gait features into a similarity relation\ndistribution. In essence, the relation descriptor offers a holistic perspective\nthat leverages the collective knowledge stored within the classifier's weights,\nemphasizing meaningful patterns and enhancing robustness. Despite its\npotential, relation descriptor poses dimensionality challenges since its\ndimension depends on the training set's identity count. To address this, we\npropose the Farthest Anchored-gait Selection to identify the most\ndiscriminative anchored gaits and an Orthogonal Regularization to increase\ndiversity within anchored gaits. Compared to individual-specific features\nextracted from the backbone, our relation descriptor can boost the performances\nnearly without any extra costs. We evaluate the effectiveness of our method on\nthe popular GREW, Gait3D, CASIA-B, and OU-MVLP, showing that our method\nconsistently outperforms the baselines and achieves state-of-the-art\nperformances.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:06:14 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 17:42:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Jilong",""],["Hou","Saihui",""],["Huang","Yan",""],["Cao","Chunshui",""],["Liu","Xu",""],["Huang","Yongzhen",""],["Wang","Liang",""]]}
{"id":"2308.11488","submitter":"Dibyadip Chatterjee","authors":"Dibyadip Chatterjee, Fadime Sener, Shugao Ma, Angela Yao","title":"Opening the Vocabulary of Egocentric Actions","comments":"20 pages, 7 figures; https://dibschat.github.io/openvocab-egoAR/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human actions in egocentric videos are often hand-object interactions\ncomposed from a verb (performed by the hand) applied to an object. Despite\ntheir extensive scaling up, egocentric datasets still face two limitations -\nsparsity of action compositions and a closed set of interacting objects. This\npaper proposes a novel open vocabulary action recognition task. Given a set of\nverbs and objects observed during training, the goal is to generalize the verbs\nto an open vocabulary of actions with seen and novel objects. To this end, we\ndecouple the verb and object predictions via an object-agnostic verb encoder\nand a prompt-based object encoder. The prompting leverages CLIP representations\nto predict an open vocabulary of interacting objects. We create open vocabulary\nbenchmarks on the EPIC-KITCHENS-100 and Assembly101 datasets; whereas\nclosed-action methods fail to generalize, our proposed method is effective. In\naddition, our object encoder significantly outperforms existing open-vocabulary\nvisual recognition methods in recognizing novel interacting objects.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:08:02 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chatterjee","Dibyadip",""],["Sener","Fadime",""],["Ma","Shugao",""],["Yao","Angela",""]]}
{"id":"2308.11489","submitter":"Qitong Wang","authors":"Qitong Wang, Long Zhao, Liangzhe Yuan, Ting Liu, Xi Peng","title":"Learning from Semantic Alignment between Unpaired Multiviews for\n  Egocentric Video Recognition","comments":"Proceedings of IEEE International Conference on Computer Vision\n  (ICCV) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We are concerned with a challenging scenario in unpaired multiview video\nlearning. In this case, the model aims to learn comprehensive multiview\nrepresentations while the cross-view semantic information exhibits variations.\nWe propose Semantics-based Unpaired Multiview Learning (SUM-L) to tackle this\nunpaired multiview learning problem. The key idea is to build cross-view\npseudo-pairs and do view-invariant alignment by leveraging the semantic\ninformation of videos. To facilitate the data efficiency of multiview learning,\nwe further perform video-text alignment for first-person and third-person\nvideos, to fully leverage the semantic knowledge to improve video\nrepresentations. Extensive experiments on multiple benchmark datasets verify\nthe effectiveness of our framework. Our method also outperforms multiple\nexisting view-alignment methods, under the more challenging scenario than\ntypical paired or unpaired multimodal or multiview learning. Our code is\navailable at https://github.com/wqtwjt1996/SUM-L.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:10:42 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 16:16:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Qitong",""],["Zhao","Long",""],["Yuan","Liangzhe",""],["Liu","Ting",""],["Peng","Xi",""]]}
{"id":"2308.11490","submitter":"Rafael Rivera Soto","authors":"Andrew Wang, Cristina Aggazzotti, Rebecca Kotula, Rafael Rivera Soto,\n  Marcus Bishop, Nicholas Andrews","title":"Can Authorship Representation Learning Capture Stylistic Features?","comments":"appearing at TACL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatically disentangling an author's style from the content of their\nwriting is a longstanding and possibly insurmountable problem in computational\nlinguistics. At the same time, the availability of large text corpora furnished\nwith author labels has recently enabled learning authorship representations in\na purely data-driven manner for authorship attribution, a task that ostensibly\ndepends to a greater extent on encoding writing style than encoding content.\nHowever, success on this surrogate task does not ensure that such\nrepresentations capture writing style since authorship could also be correlated\nwith other latent variables, such as topic. In an effort to better understand\nthe nature of the information these representations convey, and specifically to\nvalidate the hypothesis that they chiefly encode writing style, we\nsystematically probe these representations through a series of targeted\nexperiments. The results of these experiments suggest that representations\nlearned for the surrogate authorship prediction task are indeed sensitive to\nwriting style. As a consequence, authorship representations may be expected to\nbe robust to certain kinds of data shift, such as topic drift over time.\nAdditionally, our findings may open the door to downstream applications that\nrequire stylistic representations, such as style transfer.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:10:45 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 20:52:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Andrew",""],["Aggazzotti","Cristina",""],["Kotula","Rebecca",""],["Soto","Rafael Rivera",""],["Bishop","Marcus",""],["Andrews","Nicholas",""]]}
{"id":"2308.11491","submitter":"Katharina Schuh","authors":"Nawaf Bou-Rabee, Katharina Schuh","title":"Nonlinear Hamiltonian Monte Carlo & its Particle Approximation","comments":"40 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a nonlinear (in the sense of McKean) generalization of Hamiltonian\nMonte Carlo (HMC) termed nonlinear HMC (nHMC) capable of sampling from\nnonlinear probability measures of mean-field type. When the underlying\nconfinement potential is $K$-strongly convex and $L$-gradient Lipschitz, and\nthe underlying interaction potential is gradient Lipschitz, nHMC can produce an\n$\\varepsilon$-accurate approximation of a $d$-dimensional nonlinear probability\nmeasure in $L^1$-Wasserstein distance using $O((L/K) \\log(1/\\varepsilon))$\nsteps. Owing to a uniform-in-steps propagation of chaos phenomenon, and without\nfurther regularity assumptions, unadjusted HMC with randomized time integration\nfor the corresponding particle approximation can achieve $\\varepsilon$-accuracy\nin $L^1$-Wasserstein distance using $O( (L/K)^{5/3} (d/K)^{4/3}\n(1/\\varepsilon)^{8/3} \\log(1/\\varepsilon) )$ gradient evaluations. These\nmixing/complexity upper bounds are a specific case of more general results\ndeveloped in the paper for a larger class of non-logconcave, nonlinear\nprobability measures of mean-field type.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:12:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bou-Rabee","Nawaf",""],["Schuh","Katharina",""]]}
{"id":"2308.11492","submitter":"Yusheng Wang","authors":"Yusheng Wang, Yidong Lou, Weiwei Song, Bing Zhan, Feihuang Xia and\n  Qigeng Duan","title":"A LiDAR-Inertial SLAM Tightly-Coupled with Dropout-Tolerant GNSS Fusion\n  for Autonomous Mine Service Vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-modal sensor integration has become a crucial prerequisite for the\nreal-world navigation systems. Recent studies have reported successful\ndeployment of such system in many fields. However, it is still challenging for\nnavigation tasks in mine scenes due to satellite signal dropouts, degraded\nperception, and observation degeneracy. To solve this problem, we propose a\nLiDAR-inertial odometry method in this paper, utilizing both Kalman filter and\ngraph optimization. The front-end consists of multiple parallel running\nLiDAR-inertial odometries, where the laser points, IMU, and wheel odometer\ninformation are tightly fused in an error-state Kalman filter. Instead of the\ncommonly used feature points, we employ surface elements for registration. The\nback-end construct a pose graph and jointly optimize the pose estimation\nresults from inertial, LiDAR odometry, and global navigation satellite system\n(GNSS). Since the vehicle has a long operation time inside the tunnel, the\nlargely accumulated drift may be not fully by the GNSS measurements. We hereby\nleverage a loop closure based re-initialization process to achieve full\nalignment. In addition, the system robustness is improved through handling data\nloss, stream consistency, and estimation error. The experimental results show\nthat our system has a good tolerance to the long-period degeneracy with the\ncooperation different LiDARs and surfel registration, achieving meter-level\naccuracy even for tens of minutes running during GNSS dropouts.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:14:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Yusheng",""],["Lou","Yidong",""],["Song","Weiwei",""],["Zhan","Bing",""],["Xia","Feihuang",""],["Duan","Qigeng",""]]}
{"id":"2308.11493","submitter":"Enrichetta Iodice","authors":"Enrichetta Iodice, Michael Hilker, Goran Doll, Marco Mirabile, Chiara\n  Buttitta, Johanna Hartke, Steffen Mieske, Michele Cantiello, Giuseppe D'Ago,\n  Duncan A. Forbes, Marco Gullieuszik, Marina Rejkuba, Marilena Spavone, Chiara\n  Spiniello, Magda Arnaboldi, Enrico M. Corsini, Laura Greggio, Jesus\n  Falc\\'on-Barroso, Katja Fahrion, Jacopo Fritz, Antonio La Marca, Maurizio\n  Paolillo, Maria Angela Raj, Roberto Rampazzo, Marc Sarzi, and Giulio Capasso","title":"Looking into the faintEst WIth MUSE (LEWIS): on the nature of\n  ultra-diffuse galaxies in the Hydra-I cluster.I. Project description and\n  preliminary results","comments":"Accepted for publication in Astronomy and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Looking into the faintEst WIth MUSE (LEWIS) is an ESO large observing\nprogramme aimed at obtaining the first homogeneous integral-field spectroscopic\nsurvey of 30 extremely low-surface brightness (LSB) galaxies in the Hydra I\ncluster of galaxies, with MUSE at ESO-VLT. The majority of LSB galaxies in the\nsample (22 in total) are ultra-diffuse galaxies (UDGs). The distribution of\nsystemic velocities Vsys ranges between 2317 km/s and 5198 km/s and is centred\non the mean velocity of Hydra I (Vsys = 3683 $\\pm$ 46 km/s). Considering the\nmean velocity and the velocity dispersion of the cluster, 17 out of 20 targets\nare confirmed cluster members. To assess the quality of the data and\ndemonstrate the feasibility of the science goals, we report the preliminary\nresults obtained for one of the sample galaxies, UDG11. For this target, we\nderived the stellar kinematics, including the 2-dimensional maps of\nline-of-sight velocity and velocity dispersion, constrained age and\nmetallicity, and studied the globular cluster (GC) population hosted by the\nUDG. Results are compared with the available measurements for UDGs and dwarf\ngalaxies in literature. By fitting the stacked spectrum inside one effective\nradius, we find that UDG11 has a velocity dispersion $\\sigma = 20 \\pm 8$ km/s,\nit is old ($10\\pm1$ Gyr), metal-poor ([M/H]=-1.17$\\pm$0.11 dex) and has a total\ndynamical mass-to-light ratio M$/L_V\\sim 14$, comparable to those observed for\nclassical dwarf galaxies. The spatially resolved stellar kinematics maps\nsuggest that UDG11 does not show a significant velocity gradient along either\nmajor or minor photometric axes. We find two GCs kinematically associated with\nUDG11. The estimated total number of GCs in UDG11, corrected for the\nspectroscopic completeness limit, is $N_{GC}= 5.9^{+2.2}_ {-1.8}$, which\ncorresponds to a GC specific frequency of $S_N = 8.4^{+3.2}_{-2.7}$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:16:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Iodice","Enrichetta",""],["Hilker","Michael",""],["Doll","Goran",""],["Mirabile","Marco",""],["Buttitta","Chiara",""],["Hartke","Johanna",""],["Mieske","Steffen",""],["Cantiello","Michele",""],["D'Ago","Giuseppe",""],["Forbes","Duncan A.",""],["Gullieuszik","Marco",""],["Rejkuba","Marina",""],["Spavone","Marilena",""],["Spiniello","Chiara",""],["Arnaboldi","Magda",""],["Corsini","Enrico M.",""],["Greggio","Laura",""],["Falc\u00f3n-Barroso","Jesus",""],["Fahrion","Katja",""],["Fritz","Jacopo",""],["La Marca","Antonio",""],["Paolillo","Maurizio",""],["Raj","Maria Angela",""],["Rampazzo","Roberto",""],["Sarzi","Marc",""],["Capasso","Giulio",""]]}
{"id":"2308.11494","submitter":"Hajime Sotani","authors":"Hajime Sotani and Toru Kojo","title":"Universality in quasinormal modes of neutron stars with quark-hadron\n  crossover","comments":"Accepted for publication in RPD","journal-ref":null,"doi":null,"report-no":"RIKEN-iTHEMS-Report-23","categories":"astro-ph.HE nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We examine the gravitational wave frequencies of the fundamental ($f$-) and\n1st pressure ($p_1$-) modes excited in the neutron star models constructed with\nthe quark-hadron crossover (QHC) type equations of state (EOS). We find that\nthe $f$-mode frequencies with QHC EOS basically are smaller and the $p_1$-mode\nfrequencies with QHC EOS are larger than those with hadronic EOS, focusing on\nthe neutron star model with a fixed mass. We also find that the universality in\nthe $f$-mode frequencies multiplied by the stellar mass as a function of the\nstellar compactness or as a function of the dimensionless tidal deformability,\nwhich is derived with various hadronic EOSs, can keep even with QHC EOS. That\nis, using these universal relations, one cannot distinguish QHC EOS from\nhadronic EOSs. Instead, using the relations one can extract the stellar radii\nwhose evolution from low to high mass neutron stars can differentiate QHC from\nhadronic EOSs. On the other hand, we find that the $p_1$-mode frequencies\nmultiplied by the stellar mass with QHC EOS significantly deviate in a certain\nmass range from the corresponding empirical relations derived with various\nhadronic EOSs, with which one may distinguish QHC EOS from hadronic EOSs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:16:56 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Sotani","Hajime",""],["Kojo","Toru",""]]}
{"id":"2308.11495","submitter":"Kelvin Man Yiu Leung","authors":"Kelvin M. Leung, David R. Thompson, Jouni Susiluoto, Jayanth\n  Jagalur-Mohan, Amy Braverman, Youssef Marzouk","title":"Evaluating the accuracy of Gaussian approximations in VSWIR imaging\n  spectroscopy retrievals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The joint retrieval of surface reflectances and atmospheric parameters in\nVSWIR imaging spectroscopy is a computationally challenging high-dimensional\nproblem. Using NASA's Surface Biology and Geology mission as the motivational\ncontext, the uncertainty associated with the retrievals is crucial for further\napplication of the retrieved results for environmental applications. Although\nMarkov chain Monte Carlo (MCMC) is a Bayesian method ideal for uncertainty\nquantification, the full-dimensional implementation of MCMC for the retrieval\nis computationally intractable.\n  In this work, we developed a block Metropolis MCMC algorithm for the\nhigh-dimensional VSWIR surface reflectance retrieval that leverages the\nstructure of the forward radiative transfer model to enable tractable fully\nBayesian computation. We use the posterior distribution from this MCMC\nalgorithm to assess the limitations of optimal estimation, the state-of-the-art\nBayesian algorithm in operational retrievals which is more computationally\nefficient but uses a Gaussian approximation to characterize the posterior.\nAnalyzing the differences in the posterior computed by each method, the MCMC\nalgorithm was shown to give more physically sensible results and reveals the\nnon-Gaussian structure of the posterior, specifically in the atmospheric\naerosol optical depth parameter and the low-wavelength surface reflectances.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:17:33 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 00:37:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Leung","Kelvin M.",""],["Thompson","David R.",""],["Susiluoto","Jouni",""],["Jagalur-Mohan","Jayanth",""],["Braverman","Amy",""],["Marzouk","Youssef",""]]}
{"id":"2308.11496","submitter":"Duncan Forbes","authors":"Duncan Forbes, Jonah Gannon, Enrichetta Iodice, Michael Hilker, Goran\n  Doll, Chiara Buttitta, Antonio La Marca, Magda Arnaboldi, Michele Cantiello,\n  G. D'Ago, Jesus Falcon Barroso, Laura Greggio, Marco Gullieuszik, Johanna\n  Hartke, Steffen Mieske, Marco Mirabile, Roberto Rampazzo, Marina Rejkuba,\n  Marilena Spavone, Chiara Spiniello and Giulio Capasso","title":"Ultra diffuse galaxies in the Hydra I cluster from the LEWIS Project:\n  Phase-Space distribution and globular cluster richness","comments":"6 pages, 2 figures, MNRAS, 525, 93","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although ultra diffuse galaxies (UDGs) are found in large numbers in clusters\nof galaxies, the role of the cluster environment in shaping their low surface\nbrightness and large sizes is still uncertain. Here we examine a sample of UDGs\nin the Hydra I cluster (D = 51 Mpc) with new radial velocities obtained as part\nof the LEWIS (Looking into the faintest with MUSE) project using VLT/MUSE data.\nUsing a phase-space, or infall diagnostic, diagram we compare the UDGs to other\nknown galaxies in the Hydra I cluster and to UDGs in other clusters. The UDGs,\nalong with the bulk of regular Hydra I galaxies, have low relative velocities\nand are located near the cluster core, and thus consistent with very early\ninfall into the cluster. Combining with literature data, we do not find the\nexpected trend of GC-rich UDGs associated with earlier infall times. This\nresult suggests that quenching mechanisms other than cluster infall should be\nfurther considered, e.g. quenching by strong feedback or in cosmic sheets and\nfilaments. Tidal stripping of GCs in the cluster environment also warrants\nfurther modelling.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:18:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Forbes","Duncan",""],["Gannon","Jonah",""],["Iodice","Enrichetta",""],["Hilker","Michael",""],["Doll","Goran",""],["Buttitta","Chiara",""],["La Marca","Antonio",""],["Arnaboldi","Magda",""],["Cantiello","Michele",""],["D'Ago","G.",""],["Barroso","Jesus Falcon",""],["Greggio","Laura",""],["Gullieuszik","Marco",""],["Hartke","Johanna",""],["Mieske","Steffen",""],["Mirabile","Marco",""],["Rampazzo","Roberto",""],["Rejkuba","Marina",""],["Spavone","Marilena",""],["Spiniello","Chiara",""],["Capasso","Giulio",""]]}
{"id":"2308.11497","submitter":"Kristof Schmieden","authors":"Kristof Schmieden, Matthias Schott","title":"The Global Network of Cavities to Search for Gravitational Waves\n  (GravNet): A novel scheme to hunt gravitational waves signatures from the\n  early universe","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.IM hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The idea of searching for gravitational waves using cavities in strong\nmagnetic fields has recently received significant attention. Specifically,\ndiscussions focus on cavities with relatively small volumes, which are\ncurrently employed in the search for axions. In this context, we propose a\nnovel experimental scheme that enables the detection of gravitational waves in\nthe GHz regime, which could originate, for example, from primordial black hole\nmergers. The scheme is based on synchronous measurements of cavity signals from\nmultiple devices operating in magnetic fields at distant locations. While\ngravitational wave signatures might be detectable in individual cavities,\ndistinguishing them from noise is highly challenging. By analyzing the\ncorrelation among signals from several, possibly geographically separated\ncavities, it is not only possible to significantly enhance the signal-to-noise\nratio but also to investigate the source of those gravitational wave\nsignatures. In the context of this proposal, a first demonstration experiment\nwith one superconducting cavity is currently conducted, which is the basis of\nthe proposed data-analysis approaches. On this basis the prospects of GravNet\n(Global Network of Cavities to Search for Gravitational Waves) are outlined in\nthe paper.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:19:16 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Schmieden","Kristof",""],["Schott","Matthias",""]]}
{"id":"2308.11498","submitter":"Daria Tatsii","authors":"Daria Tatsii, Silvia Bucci, Taraprasad Bhowmick, Johannes Guettler,\n  Lucie Bakels, Gholamhossein Bagheri, Andreas Stohl","title":"Shape matters: long-range transport of microplastic fibers in the\n  atmosphere","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deposition of giant microplastic particles from the atmosphere has been\nobserved in the most remote places on Earth. However, their deposition patterns\nare difficult to reproduce using current atmospheric transport models. These\nmodels usually treat particles as perfect spheres, whereas the real shapes of\nmicroplastic particles are often far from spherical. Such particles experience\nlower settling velocities compared to volume-equivalent spheres, leading to\nlonger atmospheric transport. Here, we present novel laboratory experiments on\nthe gravitational settling of microplastic fibers in air and find that their\nsettling velocities are reduced by up to 76% compared to spheres of the same\nvolume. An atmospheric transport model constrained with the experimental data\nshows that shape-corrected settling velocities significantly increase the\nhorizontal and vertical transport of particles. Our model results show that\nmicroplastic fibers of about 1 mm length emitted in populated areas can reach\nextremely remote regions of the globe, including the High Arctic, which is not\nthe case for spheres. We also calculate that fibers with lengths of up to 100\n{\\mu}m settle slowly enough to be lifted high into the stratosphere, where\ndegradation by ultraviolet radiation may release chlorine and bromine, thus\npotentially damaging the stratospheric ozone layer. These findings suggest that\nthe growing environmental burden and still increasing emissions of plastics\npose multiple threats to life on Earth.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:19:38 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 12:41:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tatsii","Daria",""],["Bucci","Silvia",""],["Bhowmick","Taraprasad",""],["Guettler","Johannes",""],["Bakels","Lucie",""],["Bagheri","Gholamhossein",""],["Stohl","Andreas",""]]}
{"id":"2308.11499","submitter":"Benjamin Harmsen","authors":"Benjamin Harmsen, Eric F. Bell, Richard D'Souza, Antonela Monachesi,\n  Roelof S. de Jong, Adam Smercina, In Sung Jang, Benne W. Holwerda","title":"Constraining the assembly time of the stellar haloes of nearby Milky\n  Way-mass galaxies through AGB populations","comments":"20 Pages, 10 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The star formation histories (SFHs) of galactic stellar haloes offer crucial\ninsights into the merger history of the galaxy and the effects of those mergers\non their hosts. Such measurements have revealed that while the Milky Way's most\nimportant merger was 8-10 Gyr ago, M31's largest merger was more recent, within\nthe last few Gyr. Unfortunately, the required halo SFH measurements are\nextremely observationally expensive outside of the Local Group. Here we use\nasymptotic giant branch (AGB) stars brighter than the tip of the red giant\nbranch (RGB) to constrain stellar halo SFHs. Both stellar population models and\narchival datasets show that the AGB/RGB ratio constrains the time before which\n90% of the stars formed, $t_{90}$. We find AGB stars in the haloes of three\nhighly-inclined roughly Milky Way-mass galaxies with resolved star measurements\nfrom the Hubble Space Telescope; this population is most prominent in the\nstellar haloes of NGC 253 and NGC 891, suggesting that their stellar haloes\ncontain stars born at relatively late times, with inferred $t_{90}\\sim\n6\\pm1.5$Gyr. This ratio also varies from region to region, tending towards\nhigher values along the major axis and in tidal streams or shells. By combining\nour measurements with previous constraints, we find a tentative anticorrelation\nbetween halo age and stellar halo mass, a trend that exists in models of galaxy\nformation but has never been elucidated before, i.e, the largest stellar haloes\nof Milky-Way mass galaxies were assembled more recently.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:20:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Harmsen","Benjamin",""],["Bell","Eric F.",""],["D'Souza","Richard",""],["Monachesi","Antonela",""],["de Jong","Roelof S.",""],["Smercina","Adam",""],["Jang","In Sung",""],["Holwerda","Benne W.",""]]}
{"id":"2308.11500","submitter":"Pawe{\\l} Ra\\'zny","authors":"Pawe{\\l} Ra\\'zny","title":"A Spectral Sequence for locally free isometric Lie group actions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a spectral sequence for free isometric Lie algebra actions (and\nconsequently locally free isometric Lie group actions) which relates the de\nRham cohomology of the manifold with the Lie algebra cohomology and basic\ncohomology (intuitively the cohomology of the orbit space). In the process of\ndeveloping this sequence we introduce a new description of the de Rham\ncohomology of manifolds with such actions which appears to be well suited to\nthis and similar problems. Finally, we provide some simple applications\ngeneralizing the Wang long exact sequence to Lie algebra actions of low\ncodimension.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:20:14 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ra\u017any","Pawe\u0142",""]]}
{"id":"2308.11501","submitter":"Yusheng Wang","authors":"Yusheng Wang, Weiwei Song, Yi Zhang, Fei Huang, Zhiyong Tu, Ruoying\n  Li, Shimin Zhang, and Yidong Lou","title":"Four years of multi-modal odometry and mapping on the rail vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precise, seamless, and efficient train localization as well as long-term\nrailway environment monitoring is the essential property towards reliability,\navailability, maintainability, and safety (RAMS) engineering for railroad\nsystems. Simultaneous localization and mapping (SLAM) is right at the core of\nsolving the two problems concurrently. In this end, we propose a\nhigh-performance and versatile multi-modal framework in this paper, targeted\nfor the odometry and mapping task for various rail vehicles. Our system is\nbuilt atop an inertial-centric state estimator that tightly couples light\ndetection and ranging (LiDAR), visual, optionally satellite navigation and\nmap-based localization information with the convenience and extendibility of\nloosely coupled methods. The inertial sensors IMU and wheel encoder are treated\nas the primary sensor, which achieves the observations from subsystems to\nconstrain the accelerometer and gyroscope biases. Compared to point-only\nLiDAR-inertial methods, our approach leverages more geometry information by\nintroducing both track plane and electric power pillars into state estimation.\nThe Visual-inertial subsystem also utilizes the environmental structure\ninformation by employing both lines and points. Besides, the method is capable\nof handling sensor failures by automatic reconfiguration bypassing failure\nmodules. Our proposed method has been extensively tested in the long-during\nrailway environments over four years, including general-speed, high-speed and\nmetro, both passenger and freight traffic are investigated. Further, we aim to\nshare, in an open way, the experience, problems, and successes of our group\nwith the robotics community so that those that work in such environments can\navoid these errors. In this view, we open source some of the datasets to\nbenefit the research community.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:20:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Yusheng",""],["Song","Weiwei",""],["Zhang","Yi",""],["Huang","Fei",""],["Tu","Zhiyong",""],["Li","Ruoying",""],["Zhang","Shimin",""],["Lou","Yidong",""]]}
{"id":"2308.11502","submitter":"Rune Haugseng","authors":"Hongyi Chu and Rune Haugseng","title":"Enriched homotopy-coherent structures","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a general notion of enrichment for homotopy-coherent algebraic\nstructures described by Segal conditions, using the framework of \"algebraic\npatterns\" developed in our previous work. This recovers several known examples\nof enriched structures, including enriched $\\infty$-categories, enriched\n$\\infty$-operads, and enriched $\\infty$-properads. As new examples we discuss\nenriched modular $\\infty$-operads, enriched $n$-fold $\\infty$-categories, and a\nnon-iterative definition of enriched $(\\infty,n)$-categories.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:24:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chu","Hongyi",""],["Haugseng","Rune",""]]}
{"id":"2308.11503","submitter":"Ziad Aldirany","authors":"Ziad Aldirany, R\\'egis Cottereau, Marc Laforest, Serge Prudhomme","title":"Multi-level Neural Networks for Accurate Solutions of Boundary-Value\n  Problems","comments":"34 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The solution to partial differential equations using deep learning approaches\nhas shown promising results for several classes of initial and boundary-value\nproblems. However, their ability to surpass, particularly in terms of accuracy,\nclassical discretization methods such as the finite element methods, remains a\nsignificant challenge. Deep learning methods usually struggle to reliably\ndecrease the error in their approximate solution. A new methodology to better\ncontrol the error for deep learning methods is presented here. The main idea\nconsists in computing an initial approximation to the problem using a simple\nneural network and in estimating, in an iterative manner, a correction by\nsolving the problem for the residual error with a new network of increasing\ncomplexity. This sequential reduction of the residual of the partial\ndifferential equation allows one to decrease the solution error, which, in some\ncases, can be reduced to machine precision. The underlying explanation is that\nthe method is able to capture at each level smaller scales of the solution\nusing a new network. Numerical examples in 1D and 2D are presented to\ndemonstrate the effectiveness of the proposed approach. This approach applies\nnot only to physics informed neural networks but to other neural network\nsolvers based on weak or strong formulations of the residual.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:24:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Aldirany","Ziad",""],["Cottereau","R\u00e9gis",""],["Laforest","Marc",""],["Prudhomme","Serge",""]]}
{"id":"2308.11504","submitter":"George Zograf Dr","authors":"George Zograf, Alexander Yu. Polyakov, Maria Bancerek, Tomasz\n  Antosiewicz, Betul Kucukoz, Timur Shegai","title":"Combining ultrahigh index with exceptional nonlinearity in resonant\n  transition metal dichalcogenide nanodisks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Second-order nonlinearity in solids gives rise to a plethora of unique\nphysical phenomena ranging from piezoelectricity and optical rectification to\noptical parametric amplification, spontaneous parametric down-conversion, and\nthe generation of entangled photon pairs. Monolayer transition metal\ndichalcogenides (TMDs), such as MoS$_2$, exhibit one of the highest known\nsecond-order nonlinear coefficients. However, the monolayer nature of these\nmaterials prevents the fabrication of resonant objects exclusively from the\nmaterial itself, necessitating the use of external structures to achieve\noptical enhancement of nonlinear processes. Here, we exploit the 3R phase of a\nmolybdenum disulfide multilayer for resonant nonlinear nanophotonics. The lack\nof inversion symmetry, even in the bulk of the material, provides a combination\nof a massive second-order susceptibility, an extremely high and anisotropic\nrefractive index in the near-infrared region ($n>$~4.5), and low absorption\nlosses, making 3R-MoS$_2$ highly attractive for nonlinear nanophotonics. We\ndemonstrate this by fabricating 3R-MoS$_2$ nanodisks of various radii, which\nsupport resonant anapole states, and observing substantial ($>$ 100-fold)\nenhancement of second-harmonic generation in a single resonant nanodisk\ncompared to an unpatterned flake of the same thickness. The enhancement is\nmaximized at the spectral overlap between the anapole state of the disk and the\nmaterial resonance of the second-order susceptibility. Our approach unveils a\npowerful tool for enhancing the entire spectrum of optical second-order\nnonlinear processes in nanostructured van der Waals materials, thereby paving\nthe way for nonlinear and quantum high-index TMD-nanophotonics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:25:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zograf","George",""],["Polyakov","Alexander Yu.",""],["Bancerek","Maria",""],["Antosiewicz","Tomasz",""],["Kucukoz","Betul",""],["Shegai","Timur",""]]}
{"id":"2308.11505","submitter":"Benjamin Ab\\'ecassis","authors":"Debora Monego, Sarit Dutta, Doron Grossman, Marion Krapez, Pierre\n  Bauer, Austin Hubley, J\\'er\\'emie Margueritat, Benoit Mahler, Asaph\n  Widmer-Cooper and Benjamin Ab\\'ecassis","title":"Ligand-Induced Incompatible Curvatures Control Ultrathin Nanoplatelet\n  Polymorphism and Chirality","comments":"16 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability of thin materials to shape-shift is a common occurrence that\nleads to dynamic pattern formation and function in natural and man-made\nstructures. However, harnessing this concept to design inorganic structures at\nthe nanoscale rationally has remained far from reach due to a lack of\nfundamental understanding of the essential physical components. Here, we show\nthat the interaction between organic ligands and the nanocrystal surface is\nresponsible for the full range of chiral shapes seen in colloidal\nnanoplatelets. The adsorption of ligands results in incompatible curvatures on\nthe top and bottom surfaces of NPL, causing them to deform into helico\\\"ids,\nhelical ribbons, or tubes depending on the lateral dimensions and\ncrystallographic orientation of the NPL. We demonstrate that nanoplatelets\nbelong to the broad class of geometrically frustrated assemblies and exhibit\none of their hallmark features: a transition between helico\\\"ids and helical\nribbons at a critical width. The effective curvature $\\bar{\\kappa}$ is the\nsingle aggregate parameter that encodes the details of the ligand/surface\ninteraction, determining the nanoplatelets' geometry for a given width and\ncrystallographic orientation. The conceptual framework described here will aid\nthe rational design of dynamic, chiral nanostructures with high fundamental and\npractical relevance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:27:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Monego","Debora",""],["Dutta","Sarit",""],["Grossman","Doron",""],["Krapez","Marion",""],["Bauer","Pierre",""],["Hubley","Austin",""],["Margueritat","J\u00e9r\u00e9mie",""],["Mahler","Benoit",""],["Widmer-Cooper","Asaph",""],["Ab\u00e9cassis","Benjamin",""]]}
{"id":"2308.11506","submitter":"Xin Duan","authors":"Xin Duan, Yan Yang, Liyuan Pan, Xiabi Liu","title":"LCCo: Lending CLIP to Co-Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies co-segmenting the common semantic object in a set of\nimages. Existing works either rely on carefully engineered networks to mine the\nimplicit semantic information in visual features or require extra data (i.e.,\nclassification labels) for training. In this paper, we leverage the contrastive\nlanguage-image pre-training framework (CLIP) for the task. With a backbone\nsegmentation network that independently processes each image from the set, we\nintroduce semantics from CLIP into the backbone features, refining them in a\ncoarse-to-fine manner with three key modules: i) an image set feature\ncorrespondence module, encoding global consistent semantic information of the\nimage set; ii) a CLIP interaction module, using CLIP-mined common semantics of\nthe image set to refine the backbone feature; iii) a CLIP regularization\nmodule, drawing CLIP towards this co-segmentation task, identifying the best\nCLIP semantic and using it to regularize the backbone feature. Experiments on\nfour standard co-segmentation benchmark datasets show that the performance of\nour method outperforms state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:27:52 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Duan","Xin",""],["Yang","Yan",""],["Pan","Liyuan",""],["Liu","Xiabi",""]]}
{"id":"2308.11507","submitter":"Ce Zhang","authors":"Yi Zhang, Ce Zhang, Xueting Hu, Zhihai He","title":"Unsupervised Prototype Adapter for Vision-Language Models","comments":"Accepted by PRCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, large-scale pre-trained vision-language models (e.g. CLIP and\nALIGN) have demonstrated remarkable effectiveness in acquiring transferable\nvisual representations. To leverage the valuable knowledge encoded within these\nmodels for downstream tasks, several fine-tuning approaches, including prompt\ntuning methods and adapter-based methods, have been developed to adapt\nvision-language models effectively with supervision. However, these methods\nrely on the availability of annotated samples, which can be labor-intensive and\ntime-consuming to acquire, thus limiting scalability. To address this issue, in\nthis work, we design an unsupervised fine-tuning approach for vision-language\nmodels called Unsupervised Prototype Adapter (UP-Adapter). Specifically, for\nthe unannotated target datasets, we leverage the text-image aligning capability\nof CLIP to automatically select the most confident samples for each class.\nUtilizing these selected samples, we generate class prototypes, which serve as\nthe initialization for the learnable prototype model. After fine-tuning, the\nprototype model prediction is combined with the original CLIP's prediction by a\nresidual connection to perform downstream recognition tasks. Our extensive\nexperimental results on image recognition and domain generalization show that\nthe proposed unsupervised method outperforms 8-shot CoOp, 8-shot Tip-Adapter,\nand also the state-of-the-art UPL method by large margins.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:28:49 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 00:07:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Yi",""],["Zhang","Ce",""],["Hu","Xueting",""],["He","Zhihai",""]]}
{"id":"2308.11508","submitter":"Zhijun Qiao","authors":"Mingxuan Zhu, Zhenteng Zeng, Zaihong Jiang, Baoqiang Xia, Zhijun Qiao","title":"Rogue peakon, well-posedness, ill-posedness and blow-up phenomenon for\n  an integrable Camassa-Holm type equation","comments":"23 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we study an integrable Camassa-Holm (CH) type equation with\nquadratic nonlinearity. The CH type equation is shown integrable through a Lax\npair, and particularly the equation is found to possess a new kind of peaked\nsoliton (peakon) solution - called {\\sf rogue peakon}, that is given in a\nrational form with some logarithmic function, but not a regular traveling wave.\nWe also provide multi-rogue peakon solutions. Furthermore, we discuss the local\nwell-posedness of the solution in the Besov space $B_{p,r}^{s}$ with $1\\leq\np,r\\leq\\infty$, $s>\\max \\left\\{1+1/p,3/2\\right\\}$ or $B_{2,1}^{3/2}$, and then\nprove the ill-posedness of the solution in $B_{2,\\infty}^{3/2}$. Moreover, we\nestablish the global existence and blow-up phenomenon of the solution, which\nis, if $m_0(x)=u_0-u_{0xx}\\geq(\\not\\equiv) 0$, then the corresponding solution\nexists globally, meanwhile, if $m_0(x)\\leq(\\not\\equiv) 0$, then the\ncorresponding solution blows up in a finite time.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:29:38 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 19:21:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Mingxuan",""],["Zeng","Zhenteng",""],["Jiang","Zaihong",""],["Xia","Baoqiang",""],["Qiao","Zhijun",""]]}
{"id":"2308.11509","submitter":"Lixiong Qin","authors":"Lixiong Qin, Mei Wang, Chao Deng, Ke Wang, Xi Chen, Jiani Hu, Weihong\n  Deng","title":"SwinFace: A Multi-task Transformer for Face Recognition, Expression\n  Recognition, Age Estimation and Attribute Estimation","comments":null,"journal-ref":null,"doi":"10.1109/TCSVT.2023.3304724","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, vision transformers have been introduced into face\nrecognition and analysis and have achieved performance breakthroughs. However,\nmost previous methods generally train a single model or an ensemble of models\nto perform the desired task, which ignores the synergy among different tasks\nand fails to achieve improved prediction accuracy, increased data efficiency,\nand reduced training time. This paper presents a multi-purpose algorithm for\nsimultaneous face recognition, facial expression recognition, age estimation,\nand face attribute estimation (40 attributes including gender) based on a\nsingle Swin Transformer. Our design, the SwinFace, consists of a single shared\nbackbone together with a subnet for each set of related tasks. To address the\nconflicts among multiple tasks and meet the different demands of tasks, a\nMulti-Level Channel Attention (MLCA) module is integrated into each\ntask-specific analysis subnet, which can adaptively select the features from\noptimal levels and channels to perform the desired tasks. Extensive experiments\nshow that the proposed model has a better understanding of the face and\nachieves excellent performance for all tasks. Especially, it achieves 90.97%\naccuracy on RAF-DB and 0.22 $\\epsilon$-error on CLAP2015, which are\nstate-of-the-art results on facial expression recognition and age estimation\nrespectively. The code and models will be made publicly available at\nhttps://github.com/lxq1000/SwinFace.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:38:39 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Qin","Lixiong",""],["Wang","Mei",""],["Deng","Chao",""],["Wang","Ke",""],["Chen","Xi",""],["Hu","Jiani",""],["Deng","Weihong",""]]}
{"id":"2308.11510","submitter":"Alireza Zolanvari","authors":"Alireza Zolanvari and Ashish Cherukuri","title":"Iterative risk-constrained model predictive control: A data-driven\n  distributionally robust approach","comments":"14 pages, 5 figures. arXiv admin note: substantial text overlap with\n  arXiv:2111.12977","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes an iterative distributionally robust model predictive\ncontrol (MPC) scheme to solve a risk-constrained infinite-horizon optimal\ncontrol problem. In each iteration, the algorithm generates a trajectory from\nthe starting point to the target equilibrium state with the aim of respecting\nrisk constraints with high probability (that encodes safe operation of the\nsystem) and improving the cost of the trajectory as compared to previous\niterations. At the end of each iteration, the visited states and observed\nsamples of the uncertainty are stored and accumulated with the previous\nobservations. For each iteration, the states stored previously are considered\nas terminal constraints of the MPC scheme, and samples obtained thus far are\nused to construct distributionally robust risk constraints. As iterations\nprogress, more data is obtained and the environment is explored progressively\nto ensure better safety and cost optimality. We prove that the MPC scheme in\neach iteration is recursively feasible and the resulting trajectories converge\nasymptotically to the target while ensuring safety with high probability.\n  We identify conditions under which the cost-to-go reduces as iterations\nprogress. For systems with locally one-step reachable target, we specify\nscenarios that ensure finite-time convergence of iterations. We provide\ncomputationally tractable reformulations of the risk constraints for total\nvariation and Wasserstein distance-based ambiguity sets. A simulation example\nillustrates the application of our results in finding a risk-constrained path\nfor two mobile robots facing an uncertain obstacle.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:39:22 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zolanvari","Alireza",""],["Cherukuri","Ashish",""]]}
{"id":"2308.11511","submitter":"Adri\\'an Csisz\\'arik","authors":"Adri\\'an Csisz\\'arik, Melinda F. Kiss, P\\'eter K\\H{o}r\\\"osi-Szab\\'o,\n  M\\'arton Muntag, Gergely Papp, D\\'aniel Varga","title":"Mode Combinability: Exploring Convex Combinations of Permutation Aligned\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore element-wise convex combinations of two permutation-aligned neural\nnetwork parameter vectors $\\Theta_A$ and $\\Theta_B$ of size $d$. We conduct\nextensive experiments by examining various distributions of such model\ncombinations parametrized by elements of the hypercube $[0,1]^{d}$ and its\nvicinity. Our findings reveal that broad regions of the hypercube form surfaces\nof low loss values, indicating that the notion of linear mode connectivity\nextends to a more general phenomenon which we call mode combinability. We also\nmake several novel observations regarding linear mode connectivity and model\nre-basin. We demonstrate a transitivity property: two models re-based to a\ncommon third model are also linear mode connected, and a robustness property:\neven with significant perturbations of the neuron matchings the resulting\ncombinations continue to form a working model. Moreover, we analyze the\nfunctional and weight similarity of model combinations and show that such\ncombinations are non-vacuous in the sense that there are significant functional\ndifferences between the resulting models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:39:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Csisz\u00e1rik","Adri\u00e1n",""],["Kiss","Melinda F.",""],["K\u0151r\u00f6si-Szab\u00f3","P\u00e9ter",""],["Muntag","M\u00e1rton",""],["Papp","Gergely",""],["Varga","D\u00e1niel",""]]}
{"id":"2308.11512","submitter":"Yinqiong Cai","authors":"Yinqiong Cai, Keping Bi, Yixing Fan, Jiafeng Guo, Wei Chen, Xueqi\n  Cheng","title":"L^2R: Lifelong Learning for First-stage Retrieval with\n  Backward-Compatible Representations","comments":"accepted by CIKM2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  First-stage retrieval is a critical task that aims to retrieve relevant\ndocument candidates from a large-scale collection. While existing retrieval\nmodels have achieved impressive performance, they are mostly studied on static\ndata sets, ignoring that in the real-world, the data on the Web is continuously\ngrowing with potential distribution drift. Consequently, retrievers trained on\nstatic old data may not suit new-coming data well and inevitably produce\nsub-optimal results. In this work, we study lifelong learning for first-stage\nretrieval, especially focusing on the setting where the emerging documents are\nunlabeled since relevance annotation is expensive and may not keep up with data\nemergence. Under this setting, we aim to develop model updating with two goals:\n(1) to effectively adapt to the evolving distribution with the unlabeled\nnew-coming data, and (2) to avoid re-inferring all embeddings of old documents\nto efficiently update the index each time the model is updated.\n  We first formalize the task and then propose a novel Lifelong Learning method\nfor the first-stage Retrieval, namely L^2R. L^2R adopts the typical memory\nmechanism for lifelong learning, and incorporates two crucial components: (1)\nselecting diverse support negatives for model training and memory updating for\neffective model adaptation, and (2) a ranking alignment objective to ensure the\nbackward-compatibility of representations to save the cost of index rebuilding\nwithout hurting the model performance. For evaluation, we construct two new\nbenchmarks from LoTTE and Multi-CPR datasets to simulate the document\ndistribution drift in realistic retrieval scenarios. Extensive experiments show\nthat L^2R significantly outperforms competitive lifelong learning baselines.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:39:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Cai","Yinqiong",""],["Bi","Keping",""],["Fan","Yixing",""],["Guo","Jiafeng",""],["Chen","Wei",""],["Cheng","Xueqi",""]]}
{"id":"2308.11513","submitter":"Gianluca Mancusi","authors":"Gianluca Mancusi, Aniello Panariello, Angelo Porrello, Matteo Fabbri,\n  Simone Calderara, Rita Cucchiara","title":"TrackFlow: Multi-Object Tracking with Normalizing Flows","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The field of multi-object tracking has recently seen a renewed interest in\nthe good old schema of tracking-by-detection, as its simplicity and strong\npriors spare it from the complex design and painful babysitting of\ntracking-by-attention approaches. In view of this, we aim at extending\ntracking-by-detection to multi-modal settings, where a comprehensive cost has\nto be computed from heterogeneous information e.g., 2D motion cues, visual\nappearance, and pose estimates. More precisely, we follow a case study where a\nrough estimate of 3D information is also available and must be merged with\nother traditional metrics (e.g., the IoU). To achieve that, recent approaches\nresort to either simple rules or complex heuristics to balance the contribution\nof each cost. However, i) they require careful tuning of tailored\nhyperparameters on a hold-out set, and ii) they imply these costs to be\nindependent, which does not hold in reality. We address these issues by\nbuilding upon an elegant probabilistic formulation, which considers the cost of\na candidate association as the negative log-likelihood yielded by a deep\ndensity estimator, trained to model the conditional joint probability\ndistribution of correct associations. Our experiments, conducted on both\nsimulated and real benchmarks, show that our approach consistently enhances the\nperformance of several tracking-by-detection algorithms.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:40:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mancusi","Gianluca",""],["Panariello","Aniello",""],["Porrello","Angelo",""],["Fabbri","Matteo",""],["Calderara","Simone",""],["Cucchiara","Rita",""]]}
{"id":"2308.11514","submitter":"Gustav Mogull","authors":"Gustav Uhre Jakobsen, Gustav Mogull, Jan Plefka, Benjamin Sauer","title":"Dissipative scattering of spinning black holes at fourth\n  post-Minkowskian order","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"HU-EP-23/47-RTG","categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the radiation reacted momentum impulse $\\Delta p_i^\\mu$, spin kick\n$\\Delta S_i^\\mu$, and scattering angle $\\theta$ between two scattered spinning\nmassive bodies (black holes or neutron stars) using the $\\mathcal{N}=1$\nsupersymmetric worldline quantum field theory formalism up to fourth\npost-Minkowskian (4PM) order. Our calculation confirms the state-of-the-art\nnon-spinning results, and extends them to include spin-orbit effects. Advanced\nmulti-loop Feynman integral technology including differential equations and the\nmethod of regions are applied and extended to deal with the retarded\npropagators arising in a causal description of the scattering dynamics. From\nthese results we determine a complete set of radiative fluxes at sub-leading PM\norder: the 4PM radiated four-momentum and, via linear response, the 3PM\nradiated angular momentum, both again including spin-orbit effects.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:41:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jakobsen","Gustav Uhre",""],["Mogull","Gustav",""],["Plefka","Jan",""],["Sauer","Benjamin",""]]}
{"id":"2308.11515","submitter":"Oanh Nguyen","authors":"Hoi H. Nguyen and Oanh Nguyen","title":"Hole radii for the Kac polynomials and derivatives","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Kac polynomial $$f_n(x) = \\sum_{i=0}^{n} \\xi_i x^i$$ with independent\ncoefficients of variance 1 is one of the most studied models of random\npolynomials.\n  It is well-known that the empirical measure of the roots converges to the\nuniform measure on the unit disk. On the other hand, at any point on the unit\ndisk, there is a hole in which there are no roots, with high probability. In a\nbeautiful work \\cite{michelen2020real}, Michelen showed that the holes at $\\pm\n1$ are of order $1/n$. We show that in fact, all the hole radii are of the same\norder. The same phenomenon is established for the derivatives of the Kac\npolynomial as well.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:41:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Nguyen","Hoi H.",""],["Nguyen","Oanh",""]]}
{"id":"2308.11516","submitter":"Wei Fan","authors":"Wei Fan and Huipeng Zhang","title":"Non-perturbative instanton effects in the quartic and the sextic\n  double-well potential by the numerical bootstrap approach","comments":"18 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently the non-perturbative numerical bootstrap method is rapidly\ndeveloping, especially its application in nonlinear quantum mechanics,\nmany-body physics, lattice models and matrix models. Here we use this numerical\nbootstrap to study the non-perturbative instanton effects in symmetric\ndouble-well potentials, using an efficient implementation of the algorithm\nproposed recently by Aikawa, Morita and Yoshimura. The ground state level\nsplitting, caused by instantons, is computed for the quartic and the sextic\ncase, where the coupling constant $g$ characterizes the strength of instanton\neffects. Inspired by well-known perturbative results that is only valid at\nlarge $g$ value under the dilute-gas limit, a qualitative formula is proposed\nfor the ground state level splitting across all values of $g$, which agrees\nwell with the bootstrap data. It has the expected behavior at both large value\n$|g|\\to \\infty$ and small value $|g|\\to 0$, so it describes both the 'weak' and\nthe 'strong' regimes of instanton effects. This qualitative formula is\nnon-perturbative and can not be obtained by loop summation alone. It is beyond\nthe dilute-gas approximation, and might be from a renormalization-group-like\nprocedure or other undiscovered analytic methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:45:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fan","Wei",""],["Zhang","Huipeng",""]]}
{"id":"2308.11517","submitter":"Mark Kempton","authors":"Nolan Ison, Mark Kempton, Franklin Kenter","title":"Zero Forcing on 2-connected Outerplanar Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine upper and lower bounds on the zero forcing number of 2-connected\nouterplanar graphs in terms of the structure of the weak dual. We show that the\nupper bound is always at most half the number of vertices of the graph. This\nwork generalizes work of Hern\\'andez, Ranilla and Ranilla-Cortina who proved a\nsimilar result for maximal outerplanar graphs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:45:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ison","Nolan",""],["Kempton","Mark",""],["Kenter","Franklin",""]]}
{"id":"2308.11518","submitter":"Amirhossein Reisizadeh","authors":"Amirhossein Reisizadeh, Khashayar Gatmiry, Asuman Ozdaglar","title":"EM for Mixture of Linear Regression with Clustered Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Modern data-driven and distributed learning frameworks deal with diverse\nmassive data generated by clients spread across heterogeneous environments.\nIndeed, data heterogeneity is a major bottleneck in scaling up many distributed\nlearning paradigms. In many settings however, heterogeneous data may be\ngenerated in clusters with shared structures, as is the case in several\napplications such as federated learning where a common latent variable governs\nthe distribution of all the samples generated by a client. It is therefore\nnatural to ask how the underlying clustered structures in distributed data can\nbe exploited to improve learning schemes. In this paper, we tackle this\nquestion in the special case of estimating $d$-dimensional parameters of a\ntwo-component mixture of linear regressions problem where each of $m$ nodes\ngenerates $n$ samples with a shared latent variable. We employ the well-known\nExpectation-Maximization (EM) method to estimate the maximum likelihood\nparameters from $m$ batches of dependent samples each containing $n$\nmeasurements. Discarding the clustered structure in the mixture model, EM is\nknown to require $O(\\log(mn/d))$ iterations to reach the statistical accuracy\nof $O(\\sqrt{d/(mn)})$. In contrast, we show that if initialized properly, EM on\nthe structured data requires only $O(1)$ iterations to reach the same\nstatistical accuracy, as long as $m$ grows up as $e^{o(n)}$. Our analysis\nestablishes and combines novel asymptotic optimization and generalization\nguarantees for population and empirical EM with dependent samples, which may be\nof independent interest.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:47:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Reisizadeh","Amirhossein",""],["Gatmiry","Khashayar",""],["Ozdaglar","Asuman",""]]}
{"id":"2308.11519","submitter":"Anusuya Krishnan Baby","authors":"Anusuya Krishnan","title":"Optimizing Multi-Class Text Classification: A Diverse Stacking Ensemble\n  Framework Utilizing Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Customer reviews play a crucial role in assessing customer satisfaction,\ngathering feedback, and driving improvements for businesses. Analyzing these\nreviews provides valuable insights into customer sentiments, including\ncompliments, comments, and suggestions. Text classification techniques enable\nbusinesses to categorize customer reviews into distinct categories,\nfacilitating a better understanding of customer feedback. However, challenges\nsuch as overfitting and bias limit the effectiveness of a single classifier in\nensuring optimal prediction. This study proposes a novel approach to address\nthese challenges by introducing a stacking ensemble-based multi-text\nclassification method that leverages transformer models. By combining multiple\nsingle transformers, including BERT, ELECTRA, and DistilBERT, as base-level\nclassifiers, and a meta-level classifier based on RoBERTa, an optimal\npredictive model is generated. The proposed stacking ensemble-based multi-text\nclassification method aims to enhance the accuracy and robustness of customer\nreview analysis. Experimental evaluations conducted on a real-world customer\nreview dataset demonstrate the effectiveness and superiority of the proposed\napproach over traditional single classifier models. The stacking ensemble-based\nmulti-text classification method using transformers proves to be a promising\nsolution for businesses seeking to extract valuable insights from customer\nreviews and make data-driven decisions to enhance customer satisfaction and\ndrive continuous improvement.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:29:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Krishnan","Anusuya",""]]}
{"id":"2308.11520","submitter":"Anusuya Krishnan Baby","authors":"Anusuya Krishnan","title":"Exploring the Power of Topic Modeling Techniques in Analyzing Customer\n  Reviews: A Comparative Analysis","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The exponential growth of online social network platforms and applications\nhas led to a staggering volume of user-generated textual content, including\ncomments and reviews. Consequently, users often face difficulties in extracting\nvaluable insights or relevant information from such content. To address this\nchallenge, machine learning and natural language processing algorithms have\nbeen deployed to analyze the vast amount of textual data available online. In\nrecent years, topic modeling techniques have gained significant popularity in\nthis domain. In this study, we comprehensively examine and compare five\nfrequently used topic modeling methods specifically applied to customer\nreviews. The methods under investigation are latent semantic analysis (LSA),\nlatent Dirichlet allocation (LDA), non-negative matrix factorization (NMF),\npachinko allocation model (PAM), Top2Vec, and BERTopic. By practically\ndemonstrating their benefits in detecting important topics, we aim to highlight\ntheir efficacy in real-world scenarios. To evaluate the performance of these\ntopic modeling methods, we carefully select two textual datasets. The\nevaluation is based on standard statistical evaluation metrics such as topic\ncoherence score. Our findings reveal that BERTopic consistently yield more\nmeaningful extracted topics and achieve favorable results.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 08:18:04 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Krishnan","Anusuya",""]]}
{"id":"2308.11521","submitter":"Zhenhua Wang","authors":"Zhenhua Wang, Wei Xie, Kai Chen, Baosheng Wang, Zhiwen Gui, Enze Wang","title":"Self-Deception: Reverse Penetrating the Semantic Firewall of Large\n  Language Models","comments":"Serious errors were found in the experiment, which may lead to the\n  overturning of the overall conclusions of the paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs), such as ChatGPT, have emerged with astonishing\ncapabilities approaching artificial general intelligence. While providing\nconvenience for various societal needs, LLMs have also lowered the cost of\ngenerating harmful content. Consequently, LLM developers have deployed\nsemantic-level defenses to recognize and reject prompts that may lead to\ninappropriate content. Unfortunately, these defenses are not foolproof, and\nsome attackers have crafted \"jailbreak\" prompts that temporarily hypnotize the\nLLM into forgetting content defense rules and answering any improper questions.\nTo date, there is no clear explanation of the principles behind these\nsemantic-level attacks and defenses in both industry and academia.\n  This paper investigates the LLM jailbreak problem and proposes an automatic\njailbreak method for the first time. We propose the concept of a semantic\nfirewall and provide three technical implementation approaches. Inspired by the\nattack that penetrates traditional firewalls through reverse tunnels, we\nintroduce a \"self-deception\" attack that can bypass the semantic firewall by\ninducing LLM to generate prompts that facilitate jailbreak. We generated a\ntotal of 2,520 attack payloads in six languages (English, Russian, French,\nSpanish, Chinese, and Arabic) across seven virtual scenarios, targeting the\nthree most common types of violations: violence, hate, and pornography. The\nexperiment was conducted on two models, namely the GPT-3.5-Turbo and GPT-4. The\nsuccess rates on the two models were 86.2% and 67%, while the failure rates\nwere 4.7% and 2.2%, respectively. This highlighted the effectiveness of the\nproposed attack method. All experimental code and raw data will be released as\nopen-source to inspire future research. We believe that manipulating AI\nbehavior through carefully crafted prompts will become an important research\ndirection in the future.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 09:04:36 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 00:25:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Zhenhua",""],["Xie","Wei",""],["Chen","Kai",""],["Wang","Baosheng",""],["Gui","Zhiwen",""],["Wang","Enze",""]]}
{"id":"2308.11522","submitter":"Jonas Kantic","authors":"Jonas Kantic and Fabian C. Legl and Walter Stechele and Jakob Hermann","title":"ReLiCADA -- Reservoir Computing using Linear Cellular Automata Design\n  Algorithm","comments":"19 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a novel algorithm to optimize the design of\nReservoir Computing using Cellular Automata models for time series\napplications. Besides selecting the models' hyperparameters, the proposed\nalgorithm particularly solves the open problem of linear Cellular Automaton\nrule selection. The selection method pre-selects only a few promising candidate\nrules out of an exponentially growing rule space. When applied to relevant\nbenchmark datasets, the selected rules achieve low errors, with the best rules\nbeing among the top 5% of the overall rule space. The algorithm was developed\nbased on mathematical analysis of linear Cellular Automaton properties and is\nbacked by almost one million experiments, adding up to a computational runtime\nof nearly one year. Comparisons to other state-of-the-art time series models\nshow that the proposed Reservoir Computing using Cellular Automata models have\nlower computational complexity, at the same time, achieve lower errors. Hence,\nour approach reduces the time needed for training and hyperparameter\noptimization by up to several orders of magnitude.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:52:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kantic","Jonas",""],["Legl","Fabian C.",""],["Stechele","Walter",""],["Hermann","Jakob",""]]}
{"id":"2308.11523","submitter":"Akifumi Sako","authors":"Harald Grosse and Akifumi Sako","title":"Integrability of $\\Phi^4$ Matrix Model as $N$-body Harmonic Oscillator\n  System","comments":"16 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a Hermitian matrix model with a kinetic term given by $ Tr (H \\Phi^2\n)$, where $H$ is a positive definite Hermitian matrix, similar as in the\nKontsevich Matrix model, but with its potential $\\Phi^3$ replaced by $\\Phi^4$.\nWe show that its partition function solves an integrable Schr\\\"odinger-type\nequation for a non-interacting $N$-body Harmonic oscillator system.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:54:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Grosse","Harald",""],["Sako","Akifumi",""]]}
{"id":"2308.11524","submitter":"Alain J. Brizard","authors":"Alain J. Brizard","title":"Comment on \"Modification of Lie's transform perturbation theory for\n  charged particle motion in a magnetic field''","comments":"3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A recent paper by L.~Zheng [Phys. Plasmas, 30, 042515 (2023)] presented a\ncritical analysis of standard Lie-transform perturbation theory and suggested\nthat its application to the problem of charged-particle motion in a magnetic\nfield suffered from ordering inconsistencies. In the present Comment, we\nsuggest that this criticism is unjustified and that standard Lie-transform\nperturbation theory does not need to be modified in its application to\nguiding-center theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:54:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Brizard","Alain J.",""]]}
{"id":"2308.11525","submitter":"Maurizio Quadrio","authors":"Daniele Massaro, Fulvio Martinelli, Peter J. Schmid and Maurizio\n  Quadrio","title":"Linear stability of Poiseuille flow over a steady spanwise Stokes layer","comments":"Under consideration by PRF","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The temporal linear stability of plane Poiseuille flow modified by spanwise\nforcing applied at the walls is considered. The forcing consists of a\nstationary streamwise distribution of spanwise velocity that generates a steady\ntransversal Stokes layer, known to reduce skin-friction drag in a turbulent\nflow with little energetic cost. A large numerical study is carried out, where\nthe effects of both the physical and the discretization parameters are\nthoroughly explored, for three representative subcritical values of the\nReynolds number Re. Results show that the spanwise Stokes layer significantly\naffects the linear stability of the system. For example, at Re=2000 the wall\nforcing is found to more than double the negative real part of the least-stable\neigenvalue, and to decrease by nearly a factor of four the maximum transient\ngrowth of perturbation energy. These observations are Re-dependent and further\nimprove at higher $Re$. Comments on the physical implications of the obtained\nresults are provided, suggesting that spanwise forcing might be effective to\nobtain at the same time a delayed transition to turbulence and a reduced\nturbulent friction.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:54:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Massaro","Daniele",""],["Martinelli","Fulvio",""],["Schmid","Peter J.",""],["Quadrio","Maurizio",""]]}
{"id":"2308.11526","submitter":"Pranjal Gupta","authors":"Pranjal Gupta and Harshit Kumar and Debanjana Kar and Karan Bhukar and\n  Pooja Aggarwal and Prateeti Mohapatra","title":"Learning Representations on Logs for AIOps","comments":"11 pages, 2023 IEEE 16th International Conference on Cloud Computing\n  (CLOUD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  AI for IT Operations (AIOps) is a powerful platform that Site Reliability\nEngineers (SREs) use to automate and streamline operational workflows with\nminimal human intervention. Automated log analysis is a critical task in AIOps\nas it provides key insights for SREs to identify and address ongoing faults.\nTasks such as log format detection, log classification, and log parsing are key\ncomponents of automated log analysis. Most of these tasks require supervised\nlearning; however, there are multiple challenges due to limited labelled log\ndata and the diverse nature of log data. Large Language Models (LLMs) such as\nBERT and GPT3 are trained using self-supervision on a vast amount of unlabeled\ndata. These models provide generalized representations that can be effectively\nused for various downstream tasks with limited labelled data. Motivated by the\nsuccess of LLMs in specific domains like science and biology, this paper\nintroduces a LLM for log data which is trained on public and proprietary log\ndata. The results of our experiments demonstrate that the proposed LLM\noutperforms existing models on multiple downstream tasks. In summary, AIOps\npowered by LLMs offers an efficient and effective solution for automating log\nanalysis tasks and enabling SREs to focus on higher-level tasks. Our proposed\nLLM, trained on public and proprietary log data, offers superior performance on\nmultiple downstream tasks, making it a valuable addition to the AIOps platform.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:34:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gupta","Pranjal",""],["Kumar","Harshit",""],["Kar","Debanjana",""],["Bhukar","Karan",""],["Aggarwal","Pooja",""],["Mohapatra","Prateeti",""]]}
{"id":"2308.11527","submitter":"Kav\\'e Salamatian","authors":"Dong Wang, Kav\\'e Salamatian, Yunqing Xia, Weiwei Deng, Qi Zhiang","title":"BERT4CTR: An Efficient Framework to Combine Pre-trained Language Model\n  with Non-textual Features for CTR Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although deep pre-trained language models have shown promising benefit in a\nlarge set of industrial scenarios, including Click-Through-Rate (CTR)\nprediction, how to integrate pre-trained language models that handle only\ntextual signals into a prediction pipeline with non-textual features is\nchallenging.\n  Up to now two directions have been explored to integrate multi-modal inputs\nin fine-tuning of pre-trained language models. One consists of fusing the\noutcome of language models and non-textual features through an aggregation\nlayer, resulting into ensemble framework, where the cross-information between\ntextual and non-textual inputs are only learned in the aggregation layer. The\nsecond one consists of splitting non-textual features into fine-grained\nfragments and transforming the fragments to new tokens combined with textual\nones, so that they can be fed directly to transformer layers in language\nmodels. However, this approach increases the complexity of the learning and\ninference because of the numerous additional tokens.\n  To address these limitations, we propose in this work a novel framework\nBERT4CTR, with the Uni-Attention mechanism that can benefit from the\ninteractions between non-textual and textual features while maintaining low\ntime-costs in training and inference through a dimensionality reduction.\nComprehensive experiments on both public and commercial data demonstrate that\nBERT4CTR can outperform significantly the state-of-the-art frameworks to handle\nmulti-modal inputs and be applicable to CTR prediction.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 08:25:54 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Dong",""],["Salamatian","Kav\u00e9",""],["Xia","Yunqing",""],["Deng","Weiwei",""],["Zhiang","Qi",""]]}
{"id":"2308.11529","submitter":"Gabe Schoenbach","authors":"Moon Duchin and Gabe Schoenbach","title":"Redistricting for Proportionality","comments":null,"journal-ref":"The Forum, vol. 20, no. 3-4, 2022, pp. 371-393","doi":"10.1515/for-2022-2064","report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  American democracy is currently heavily reliant on plurality in single-member\ndistricts, or PSMD, as a system of election. But public perceptions of fairness\nare often keyed to partisan proportionality, or the degree of congruence\nbetween each party's share of the the vote and its share of representation.\nPSMD has not tended to secure proportional outcomes historically, partially due\nto gerrymandering, where line-drawers intentionally extract more advantage for\ntheir side. But it is now increasingly clear that even blind PSMD is frequently\ndisproportional, and in unpredictable ways that depend on local political\ngeography. In this paper we consider whether it is feasible to bring PSMD into\nalignment with a proportionality norm by targeting proportional outcomes in the\ndesign and selection of districts. We do this mainly through a close\nexamination of the \"Freedom to Vote Test,\" a redistricting reform proposed in\ndraft legislation in 2021. We find that applying the test with a\nproportionality target makes for sound policy: it performs well in legal\nbattleground states and has a workable exception to handle edge cases where\nproportionality is out of reach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:56:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Duchin","Moon",""],["Schoenbach","Gabe",""]]}
{"id":"2308.11530","submitter":"Hualei Wang","authors":"Hualei Wang, Jianguo Mao, Zhifang Guo, Jiarui Wan, Hong Liu, Xiangdong\n  Wang","title":"Furnishing Sound Event Detection with Language Model Abilities","comments":"8 pages,2 figures,published to AAAI","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the ability of language models (LMs) has attracted increasing\nattention in visual cross-modality. In this paper, we further explore the\ngeneration capacity of LMs for sound event detection (SED), beyond the visual\ndomain. Specifically, we propose an elegant method that aligns audio features\nand text features to accomplish sound event classification and temporal\nlocation. The framework consists of an acoustic encoder, a contrastive module\nthat align the corresponding representations of the text and audio, and a\ndecoupled language decoder that generates temporal and event sequences from the\naudio characteristic. Compared with conventional works that require complicated\nprocessing and barely utilize limited audio features, our model is more concise\nand comprehensive since language model directly leverage its semantic\ncapabilities to generate the sequences. We investigate different decoupling\nmodules to demonstrate the effectiveness for timestamps capture and event\nclassification. Evaluation results show that the proposed method achieves\naccurate sequences of sound event detection.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:59:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wang","Hualei",""],["Mao","Jianguo",""],["Guo","Zhifang",""],["Wan","Jiarui",""],["Liu","Hong",""],["Wang","Xiangdong",""]]}
{"id":"2308.11531","submitter":"Claire Barale","authors":"Claire Barale","title":"Empowering Refugee Claimants and their Lawyers: Using Machine Learning\n  to Examine Decision-Making in Refugee Law","comments":"19th International Conference on Artificial Intelligence and Law -\n  ICAIL 2023, Doctoral Consortium. arXiv admin note: substantial text overlap\n  with arXiv:2305.15533","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Our project aims at helping and supporting stakeholders in refugee status\nadjudications, such as lawyers, judges, governing bodies, and claimants, in\norder to make better decisions through data-driven intelligence and increase\nthe understanding and transparency of the refugee application process for all\ninvolved parties. This PhD project has two primary objectives: (1) to retrieve\npast cases, and (2) to analyze legal decision-making processes on a dataset of\nCanadian cases. In this paper, we present the current state of our work, which\nincludes a completed experiment on part (1) and ongoing efforts related to part\n(2). We believe that NLP-based solutions are well-suited to address these\nchallenges, and we investigate the feasibility of automating all steps\ninvolved. In addition, we introduce a novel benchmark for future NLP research\nin refugee law. Our methodology aims to be inclusive to all end-users and\nstakeholders, with expected benefits including reduced time-to-decision, fairer\nand more transparent outcomes, and improved decision quality.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:59:21 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Barale","Claire",""]]}
{"id":"2308.11532","submitter":"Augusto Montisci","authors":"Augusto Montisci","title":"A free from local minima algorithm for training regressive MLP neural\n  networks","comments":"9 pages, 4 figures, theoretical work","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article an innovative method for training regressive MLP networks is\npresented, which is not subject to local minima. The Error-Back-Propagation\nalgorithm, proposed by William-Hinton-Rummelhart, has had the merit of\nfavouring the development of machine learning techniques, which has permeated\nevery branch of research and technology since the mid-1980s. This extraordinary\nsuccess is largely due to the black-box approach, but this same factor was also\nseen as a limitation, as soon more challenging problems were approached. One of\nthe most critical aspects of the training algorithms was that of local minima\nof the loss function, typically the mean squared error of the output on the\ntraining set. In fact, as the most popular training algorithms are driven by\nthe derivatives of the loss function, there is no possibility to evaluate if a\nreached minimum is local or global. The algorithm presented in this paper\navoids the problem of local minima, as the training is based on the properties\nof the distribution of the training set, or better on its image internal to the\nneural network. The performance of the algorithm is shown for a well-known\nbenchmark.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:59:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Montisci","Augusto",""]]}
{"id":"2308.11533","submitter":"Brock Klippenstein Mr.","authors":"Rapha\\\"el Clou\\^atre, Brock Klippenstein, Richard Mika\\\"el Slevinsky","title":"Lifting Sylvester equations: singular value decay for non-normal\n  coefficients","comments":"17 pagers, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We aim to find conditions on two Hilbert space operators $A$ and $B$ under\nwhich the expression $AX-XB$ having low rank forces the operator $X$ itself to\nadmit a good low rank approximation. It is known that this can be achieved when\n$A$ and $B$ are normal and have well-separated spectra. In this paper, we relax\nthis normality condition, using the idea of operator dilations. The basic\nproblem then becomes the lifting of Sylvester equations, which is reminiscent\nof the classical commutant lifting theorem and its variations. Our approach\nalso allows us to show that the (factored) alternating direction implicit\nmethod for solving Sylvester equaftions $AX-XB=C$ does not require too many\niterations, even without requiring $A$ to be normal.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:59:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Clou\u00e2tre","Rapha\u00ebl",""],["Klippenstein","Brock",""],["Slevinsky","Richard Mika\u00ebl",""]]}
{"id":"2308.11534","submitter":"Chuyi Kong","authors":"Chuyi Kong, Yaxin Fan, Xiang Wan, Feng Jiang, Benyou Wang","title":"Large Language Model as a User Simulator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The unparalleled performance of closed-sourced ChatGPT has sparked efforts\ntowards its democratization, with notable strides made by leveraging real user\nand ChatGPT conversations, as evidenced by Vicuna. However, while current\nendeavors like Baize and UltraChat aim to auto-generate conversational data due\nto challenges in gathering human participation, they primarily rely on ChatGPT\nto simulate human behaviors based on directives rather than genuine human\nlearning. This results in a limited scope, diminished diversity, and an absence\nof genuine multi-round conversational dynamics. To address the above issues, we\ninnovatively target human questions extracted from genuine human-machine\nconversations as a learning goal and train a user simulator, UserGPT, to\nproduce a high-quality human-centric synthetic conversation dataset, RealChat.\nSubsequently, this dataset trains our assistant model, ReaLM. Experimentally,\nReaLM outpaces baseline models in both Vicuna-Bench and MT-Bench by pairwise\ncomparison when considering equivalent training set sizes, and manual\nevaluation also shows that our model is highly competitive. Impressively, when\nfine-tuned with the latest LLaMA 2 model, ReaLM secured a leading score of 6.33\nin the MT-Bench, outshining the contemporary same-scale models, including the\nLLaMA-2-7B-chat model. Further in-depth analysis demonstrates the scalability\nand transferability of our approach. A preliminary exploration into the\ninterplay between training set data quality and resultant model performance is\nalso undertaken, laying a robust groundwork for future investigations. The code\nis available at https://github.com/FreedomIntelligence/ReaLM.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 06:51:56 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 14:33:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kong","Chuyi",""],["Fan","Yaxin",""],["Wan","Xiang",""],["Jiang","Feng",""],["Wang","Benyou",""]]}
{"id":"2308.11535","submitter":"Akshat Pandey","authors":"Akshat Pandey","title":"Geodesic congruences in acoustic spacetimes and the role of Raychaudhuri\n  equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It has been known that the propagation of sound in fluids can be used to\nmodel acoustic spacetimes. These acoustic spacetimes offer analogue models for\ngravity. We use the Raychaudhuri equation to study the propagation of sound in\nthese fluids, which, via the Eikonal approximation, correspond to null geodesic\ncongruences in the acoustic spacetimes. We explore this within the acoustic\nanalogues of black holes and cosmological spacetimes. The robustness of the\nRaychaudhuri equation and the limits of the acoustic analogue are emphasised.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 18:59:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pandey","Akshat",""]]}
{"id":"2308.11536","submitter":"Corey Lunsford","authors":"Corey Lunsford","title":"Lax Matrices & Clusters for Type A & C Q-Deformed Open Toda Chain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At the turn of the century, Etingof and Sevostyanov independently constructed\na family of quantum integrable systems, quantizing the open Toda chain\nassociated to a simple Lie group $G$. The elements of this family are\nparameterized by Coxeter words of the corresponding Weyl group. Twenty years\nlater, in the works of Finkelberg, Gonin, and Tsymbaliuk, this was generalized\nto a family of quantum Toda chains parameterized by pairs of Coxeter words. In\nthis paper, we show that this family is actually a single cluster integrable\nsystem written in different clusters associated to cyclic double Coxeter words.\nFurthermore, if we restrict the action of Hamiltonians to its positive\nrepresentation, these systems become unitary equivalent.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:04:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Lunsford","Corey",""]]}
{"id":"2308.11537","submitter":"Samuele Garda","authors":"Samuele Garda, Leon Weber-Genzel, Robert Martin, Ulf Leser","title":"BELB: a Biomedical Entity Linking Benchmark","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Biomedical entity linking (BEL) is the task of grounding entity mentions to a\nknowledge base. It plays a vital role in information extraction pipelines for\nthe life sciences literature. We review recent work in the field and find that,\nas the task is absent from existing benchmarks for biomedical text mining,\ndifferent studies adopt different experimental setups making comparisons based\non published numbers problematic. Furthermore, neural systems are tested\nprimarily on instances linked to the broad coverage knowledge base UMLS,\nleaving their performance to more specialized ones, e.g. genes or variants,\nunderstudied. We therefore developed BELB, a Biomedical Entity Linking\nBenchmark, providing access in a unified format to 11 corpora linked to 7\nknowledge bases and spanning six entity types: gene, disease, chemical,\nspecies, cell line and variant. BELB greatly reduces preprocessing overhead in\ntesting BEL systems on multiple corpora offering a standardized testbed for\nreproducible experiments. Using BELB we perform an extensive evaluation of six\nrule-based entity-specific systems and three recent neural approaches\nleveraging pre-trained language models. Our results reveal a mixed picture\nshowing that neural approaches fail to perform consistently across entity\ntypes, highlighting the need of further studies towards entity-agnostic models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:05:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Garda","Samuele",""],["Weber-Genzel","Leon",""],["Martin","Robert",""],["Leser","Ulf",""]]}
{"id":"2308.11538","submitter":"Dmitrii Pavlov","authors":"Eliana Duarte, Dmitrii Pavlov, Maximilian Wiesmann","title":"Algebraic Geometry of Quantum Graphical Models","comments":"20 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Algebro-geometric methods have proven to be very successful in the study of\ngraphical models in statistics. In this paper we introduce the foundations to\ncarry out a similar study of their quantum counterparts. These quantum\ngraphical models are families of quantum states satisfying certain locality or\ncorrelation conditions encoded by a graph. We lay out several ways to associate\nan algebraic variety to a quantum graphical model. The classical graphical\nmodels can be recovered from most of these varieties by restricting to quantum\nstates represented by diagonal matrices. We study fundamental properties of\nthese varieties and provide algorithms to compute their defining equations.\nMoreover, we study quantum information projections to quantum exponential\nfamilies defined by graphs and prove a quantum analogue of Birch's Theorem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:07:07 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Duarte","Eliana",""],["Pavlov","Dmitrii",""],["Wiesmann","Maximilian",""]]}
{"id":"2308.11539","submitter":"Sarah Arpin","authors":"Sarah Arpin, James Clements, Pierrick Dartois, Jonathan Komada\n  Eriksen, P\\'eter Kutas, Benjamin Wesolowski","title":"Finding Orientations of Supersingular Elliptic Curves and Quaternion\n  Orders","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Orientations of supersingular elliptic curves encode the information of an\nendomorphism of the curve. Computing the full endomorphism ring is a known hard\nproblem, so one might consider how hard it is to find one such orientation. We\nprove that access to an oracle which tells if an elliptic curve is\n$\\mathfrak{O}$-orientable for a fixed imaginary quadratic order $\\mathfrak{O}$\nprovides non-trivial information towards computing an endomorphism\ncorresponding to the $\\mathfrak{O}$-orientation. We provide explicit algorithms\nand in-depth complexity analysis.\n  We also consider the question in terms of quaternion algebras. We provide\nalgorithms which compute an embedding of a fixed imaginary quadratic order into\na maximal order of the quaternion algebra ramified at $p$ and $\\infty$. We\nprovide code implementations in Sagemath which is efficient for finding\nembeddings of imaginary quadratic orders of discriminants up to $O(p)$, even\nfor cryptographically sized $p$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:11:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Arpin","Sarah",""],["Clements","James",""],["Dartois","Pierrick",""],["Eriksen","Jonathan Komada",""],["Kutas","P\u00e9ter",""],["Wesolowski","Benjamin",""]]}
{"id":"2308.11540","submitter":"Shu Kanazawa","authors":"Shu Kanazawa, Khanh Duy Trinh","title":"Central limit theorem for linear eigenvalue statistics of the adjacency\n  matrices of random simplicial complexes","comments":"30 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the adjacency matrix of the Linial-Meshulam complex model, which is\na higher-dimensional generalization of the Erd\\H{o}s-R\\'enyi graph model.\nRecently, Knowles and Rosenthal proved that the empirical spectral distribution\nof the adjacency matrix is asymptotically given by Wigner's semicircle law in a\ndiluted regime. In this article, we prove a central limit theorem for the\nlinear eigenvalue statistics for test functions of polynomial growth that is of\nclass $C^{2}$ on a closed interval. The proof is based on higher-dimensional\ncombinatorial enumerations and concentration properties of random symmetric\nmatrices. Furthermore, when the test function is a polynomial function, we\nobtain the explicit formula for the variance of the limiting Gaussian\ndistribution.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:12:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kanazawa","Shu",""],["Trinh","Khanh Duy",""]]}
{"id":"2308.11541","submitter":"Claire Barale","authors":"Claire Barale","title":"Refugee status determination: how cooperation with machine learning\n  tools can lead to more justice","comments":"Scottish Law and Innovation Network (SCOTLIN) 2022, Early Career\n  Scholars Symposium","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Previous research on refugee status adjudications has shown that prediction\nof the outcome of an application can be derived from very few features with\nsatisfactory accuracy. Recent research work has achieved between 70 and 90%\naccuracy using text analytics on various legal fields among which refugee\nstatus determination. Some studies report predictions derived from the judge\nidentity only. Additionally most features used for prediction are\nnon-substantive and external features ranging from news reports, date and time\nof the hearing or weather. On the other hand, literature shows that noise is\nubiquitous in human judgments and significantly affects the outcome of\ndecisions. It has been demonstrated that noise is a significant factor\nimpacting legal decisions. We use the term \"noise\" in the sense described by D.\nKahneman, as a measure of how human beings are unavoidably influenced by\nexternal factors when making a decision. In the context of refugee status\ndetermination, it means for instance that two judges would take different\ndecisions when presented with the same application. This article explores ways\nthat machine learning can help reduce noise in refugee law decision making. We\nare not suggesting that this proposed methodology should be exclusive from\nother approaches to improve decisions such as training of decision makers,\nskills acquisition or judgment aggregation, but rather that it is a path worth\nexploring. We investigate how artificial intelligence and specifically\ndata-driven applications can be used to benefit all parties involved in refugee\nstatus adjudications. We specifically look at decisions taken in Canada and in\nthe United States. Our research aims at reducing arbitrariness and unfairness\nthat derive from noisy decisions, based on the assumption that if two cases or\napplications are alike they should be treated in the same way and induce the\nsame outcome.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:16:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Barale","Claire",""]]}
{"id":"2308.11542","submitter":"Yan-Cong Chen","authors":"Yan-Cong Chen","title":"Magical or magnetic? Less commonly taught facts about real-world\n  permanent magnets and their diverse interactions with objects","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.pop-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Permanent magnets are fascinating. They generate magnetic field and act as\nthe key component in compasses, motors, speakers for practical applications.\nThey are also made into magnetic toys for entertainment and education with\nmagical magnetic tricks. Some of these tricks fueled the recent upsurge for\nmagnetic-responsive objects including but not limited to a LK-99 mixture. A\nlack of full consideration of the magnetic interactions seems to be the reason\nwhy some tricks like \"half levitation\" is misinterpreted, and the situation is\nnot really rectified in the following replications and discussions. Here I\nwould like to go through some less commonly taught facts about real-world\npermanent magnets starting from the nonuniformity to their combined effects\nwith other factors. Based on these facts, I will also break down the situation\nof some examples of how permanent magnets diversely interact even with ordinary\nobjects, as one may have seen from recent sources. I believe this discussion is\nuseful both in an informative and educational way, helping those who want to\nthink deeper about magnetic mechanism beyond a simple attract/repel\nterminology.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:18:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chen","Yan-Cong",""]]}
{"id":"2308.11543","submitter":"Gayle Geschwind","authors":"Gayle Geschwind, Michael Vignal, H.J. Lewandowski","title":"Representational differences in how students compare measurements","comments":"4 pages, 2 figures, to be published in PERC Conference Proceedings\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Measurement uncertainty plays a critical role in the process of experimental\nphysics. It is useful to be able to assess student proficiency around the topic\nto iteratively improve instruction and student learning. For the topic of\nmeasurement uncertainty, we developed an assessment tool called the Survey of\nPhysics Reasoning on Uncertainty Concepts in Experiments (SPRUCE), which aims\nto assess students' knowledge, and use of, a variety of concepts related to\nmeasurement uncertainty. This assessment includes two isomorphic questions\nfocused on comparing two measurements with uncertainty. One is presented\nnumerically and the other pictorially. Despite the questions probing identical\nconcepts, students answer them in different ways, indicating that they rely on\ndistinct modes of representation to make sense of measurement uncertainty and\ncomparisons. Specifically, students score much higher on the pictorially\nrepresented item, which suggests possible instructional changes to leverage\nstudents' use of representations while working with concepts of measurement\nuncertainty.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:20:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Geschwind","Gayle",""],["Vignal","Michael",""],["Lewandowski","H. J.",""]]}
{"id":"2308.11544","submitter":"Sergey Gusev","authors":"Sergey V. Gusev","title":"Varieties of aperiodic monoids with commuting idempotents whose\n  subvariety lattice is distributive","comments":"75 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We completely classify all varieties of aperiodic monoids with commuting\nidempotents whose subvariety lattice is distributive.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:21:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gusev","Sergey V.",""]]}
{"id":"2308.11545","submitter":"Thang Pham","authors":"Thang Pham, Kate Reidy, Joachim D. Thomsen, Baoming Wang, Nishant\n  Deshmukh, Michael A. Filler and Frances M. Ross","title":"Salt-assisted vapor-liquid-solid growth of one-dimensional van der Waals\n  materials","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have combined the benefits of two catalytic growth phenomena to form\nnanostructures of transition metal trichalcogenides (TMTs), materials that are\nchallenging to grow in a nanostructured form by conventional techniques, as\nrequired to exploit their exotic physics. Our growth strategy combines the\nbenefits of vapor-liquid-solid (VLS) growth in controlling dimension and growth\nlocation, and salt-assisted growth for fast growth at moderate temperatures.\nThis salt-assisted VLS growth is enabled through use of a catalyst that\nincludes Au and an alkali metal halide. We demonstrate high yields of NbS3 1D\nnanostructures with sub-ten nanometer diameter, tens of micrometers length, and\ndistinct 1D morphologies consisting of nanowires and nanoribbons with [010] and\n[100] growth orientations, respectively. We present strategies to control the\ngrowth location, size, and morphology. We extend the growth method to\nsynthesize other TMTs, NbSe3 and TiS3, as nanowires. Finally, we discuss the\ngrowth mechanism based on the relationships we measure between the materials\ncharacteristics (growth orientation, morphology and dimensions) and the growth\nconditions (catalyst volume and growth time). Our study introduces\nopportunities to expand the library of emerging 1D vdW materials and their\nheterostructures with controllable nanoscale dimensions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:22:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pham","Thang",""],["Reidy","Kate",""],["Thomsen","Joachim D.",""],["Wang","Baoming",""],["Deshmukh","Nishant",""],["Filler","Michael A.",""],["Ross","Frances M.",""]]}
{"id":"2308.11546","submitter":"Apurva Patil","authors":"Apurva Patil, Yujing Zhou, David Fridovich-Keil, Takashi Tanaka","title":"Risk-Minimizing Two-Player Zero-Sum Stochastic Differential Game via\n  Path Integral Control","comments":"8 pages, 4 figures, CDC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses a continuous-time risk-minimizing two-player zero-sum\nstochastic differential game (SDG), in which each player aims to minimize its\nprobability of failure. Failure occurs in the event when the state of the game\nenters into predefined undesirable domains, and one player's failure is the\nother's success. We derive a sufficient condition for this game to have a\nsaddle-point equilibrium and show that it can be solved via a\nHamilton-Jacobi-Isaacs (HJI) partial differential equation (PDE) with Dirichlet\nboundary condition. Under certain assumptions on the system dynamics and cost\nfunction, we establish the existence and uniqueness of the saddle-point of the\ngame. We provide explicit expressions for the saddle-point policies which can\nbe numerically evaluated using path integral control. This allows us to solve\nthe game online via Monte Carlo sampling of system trajectories. We implement\nour control synthesis framework on two classes of risk-minimizing zero-sum\nSDGs: a disturbance attenuation problem and a pursuit-evasion game. Simulation\nstudies are presented to validate the proposed control synthesis framework.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:24:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Patil","Apurva",""],["Zhou","Yujing",""],["Fridovich-Keil","David",""],["Tanaka","Takashi",""]]}
{"id":"2308.11547","submitter":"Douglas Natelson","authors":"Shusen Liao, Yunxuan Zhu, Qian Ye, Stephen Sanders, Jiawei Yang,\n  Alessandro Alabastri, Douglas Natelson","title":"Quantifying efficiency of remote excitation for surface enhanced Raman\n  spectroscopy in molecular junctions","comments":"20 pages, 4 figures, plus 19 pages, 11 figures supporting information","journal-ref":"J. Phys. Chem. Lett. 14, 7574-7580 (2023)","doi":"10.1021/acs.jpclett.3c01948","report-no":null,"categories":"cond-mat.mes-hall physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Surface-enhanced Raman spectroscopy (SERS) is enabled by local surface\nplasmon resonances (LSPRs) in metallic nanogaps. When SERS is excited by direct\nillumination of the nanogap, the background heating of lattice and electrons\ncan prevent further manipulation of the molecules. To overcome this issue, we\nreport SERS in electromigrated gold molecular junctions excited remotely:\nsurface plasmon polaritons (SPPs) are excited at nearby gratings, propagate to\nthe junction, and couple to the local nanogap plasmon modes. Like direct\nexcitation, remote excitation of the nanogap can generate both SERS emission\nand an open-circuit photovoltage (OCPV). We compare SERS intensity and OCPV in\nboth direct and remote illumination configurations. SERS spectra obtained by\nremote excitation are much more stable than those obtained through direct\nexcitation when photon count rates are comparable. By statistical analysis of\n33 devices, coupling efficiency of remote excitation is calculated to be around\n10%, consistent with the simulated energy flow.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:24:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liao","Shusen",""],["Zhu","Yunxuan",""],["Ye","Qian",""],["Sanders","Stephen",""],["Yang","Jiawei",""],["Alabastri","Alessandro",""],["Natelson","Douglas",""]]}
{"id":"2308.11548","submitter":"Daniil Karzanov","authors":"Daniil Karzanov","title":"Modelling Structural Breaks In Stock Price Time Series Using Stochastic\n  Differential Equations","comments":"4 pages, 3 Figures, Conference. Intel. pp 4-7.\n  http://agora.guru.ru/display.php?conf=hpc2021&page=item005&l=1","journal-ref":"Conference on Mathematical Modeling and Supercomputer\n  Technologies, 2021","doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper studies the effect of quarterly earnings reports on the stock\nprice. The profitability of the stock is modelled by geometric Brownian\ndiffusion and the Constant Elasticity of Variance model. We fit several\nvariations of stochastic differential equations to the pre-and after-report\nperiod using the Maximum Likelihood Estimation and Grid Search of parameters\nmethod. By examining the change in the model parameters after reports'\npublication, the study reveals that the reports have enough evidence to be a\nstructural breakpoint, meaning that all the forecast models exploited are not\napplicable for forecasting and should be refitted shortly.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:26:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Karzanov","Daniil",""]]}
{"id":"2308.11549","submitter":"Cassidy Buhler","authors":"Cassidy K. Buhler and Hande Y. Benson","title":"Decision-Making for Land Conservation: A Derivative-Free Optimization\n  Framework with Nonlinear Inputs","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Protected areas (PAs) are designated spaces where human activities are\nrestricted to preserve critical habitats. Decision-makers are challenged with\nbalancing a trade-off of financial feasibility with ecological benefit when\nestablishing PAs. Given the long-term ramifications of these decisions and the\nconstantly shifting environment, it is crucial that PAs are carefully selected\nwith long-term viability in mind.\n  Using AI tools like simulation and optimization is common for designating\nPAs, but current decision models are primarily linear. In this paper, we\npropose a derivative-free optimization framework paired with a nonlinear\ncomponent, population viability analysis (PVA). Formulated as a mixed integer\nnonlinear programming (MINLP) problem, our model allows for linear and\nnonlinear inputs. Connectivity, competition, crowding, and other similar\nconcerns are handled by the PVA software, rather than expressed as constraints\nof the optimization model. In addition, we present numerical results that serve\nas a proof of concept, showing our models yield PAs with similar expected risk\nto that of preserving every parcel in a habitat, but at a significantly lower\ncost.\n  The overall goal is to promote interdisciplinary work by providing a new\nmathematical programming tool for conservationists that allows for nonlinear\ninputs and can be paired with existing ecological software.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:30:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Buhler","Cassidy K.",""],["Benson","Hande Y.",""]]}
{"id":"2308.11550","submitter":"Margareta Wagner","authors":"Margareta Wagner, Jakob Hofinger, Martin Setv\\'in, Lynn A. Boatner,\n  Michael Schmid, and Ulrike Diebold","title":"The prototypical organic-oxide interface: intra-molecular resolution of\n  sexiphenyl on In$_2$O$_3$(111)","comments":null,"journal-ref":"ACS Applied Materials & Interfaces 10, 2018, 14175-14182","doi":"10.1021/acsami.8b02177","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The performance of an organic-semiconductor device is critically determined\nby the geometric alignment, orientation, and ordering of the organic molecules.\nWhile an organic multilayer eventually adopts the crystal structure of the\norganic material, the alignment and configuration at the interface with the\nsubstrate/electrode material is essential for charge injection into the organic\nlayer. This work focuses on the prototypical organic semiconductor\npara-sexiphenyl (6P) adsorbed on In$_2$O$_3$(111), the thermodynamically most\nstable surface of the material that the most common transparent conducting\noxide, indium tin oxide (ITO) is based on. The onset of nucleation and\nformation of the first monolayer are followed with atomically-resolved scanning\ntunneling microscopy (STM) and non-contact atomic force microscopy (nc-AFM).\nAnnealing to 200$^\\circ$C provides sufficient thermal energy for the molecules\nto orient themselves along the high-symmetry directions of the surface, leading\nto a single adsorption site. The AFM data suggests a twisted adsorption\ngeometry. With increasing coverage, the 6P molecules first form a loose network\nwith poor long-range order. Eventually the molecules re-orient and form an\nordered monolayer. This first monolayer has a densely packed, well-ordered\n(2$\\times$1) structure with one 6P per In$_2$O$_3$(111) substrate unit cell,\ni.e., a molecular density of 5.64$\\times$10$^{13}$ cm$^{-2}$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:31:27 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wagner","Margareta",""],["Hofinger","Jakob",""],["Setv\u00edn","Martin",""],["Boatner","Lynn A.",""],["Schmid","Michael",""],["Diebold","Ulrike",""]]}
{"id":"2308.11551","submitter":"Gengyuan Zhang","authors":"Gengyuan Zhang, Jisen Ren, Jindong Gu, Volker Tresp","title":"Multi-event Video-Text Retrieval","comments":"accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Video-Text Retrieval (VTR) is a crucial multi-modal task in an era of massive\nvideo-text data on the Internet. A plethora of work characterized by using a\ntwo-stream Vision-Language model architecture that learns a joint\nrepresentation of video-text pairs has become a prominent approach for the VTR\ntask. However, these models operate under the assumption of bijective\nvideo-text correspondences and neglect a more practical scenario where video\ncontent usually encompasses multiple events, while texts like user queries or\nwebpage metadata tend to be specific and correspond to single events. This\nestablishes a gap between the previous training objective and real-world\napplications, leading to the potential performance degradation of earlier\nmodels during inference. In this study, we introduce the Multi-event Video-Text\nRetrieval (MeVTR) task, addressing scenarios in which each video contains\nmultiple different events, as a niche scenario of the conventional Video-Text\nRetrieval Task. We present a simple model, Me-Retriever, which incorporates key\nevent video representation and a new MeVTR loss for the MeVTR task.\nComprehensive experiments show that this straightforward framework outperforms\nother models in the Video-to-Text and Text-to-Video tasks, effectively\nestablishing a robust baseline for the MeVTR task. We believe this work serves\nas a strong foundation for future studies. Code is available at\nhttps://github.com/gengyuanmax/MeVTR.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:32:46 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Gengyuan",""],["Ren","Jisen",""],["Gu","Jindong",""],["Tresp","Volker",""]]}
{"id":"2308.11552","submitter":"Samuzal Barua","authors":"Samuzal Barua, Oluwashina K. Adegoke, Ranjeev Misra, Pramod Pawar, V.\n  Jithesh, Biman J. Medhi","title":"A Search for X-ray/UV Correlation in the Reflection-Dominated Seyfert 1\n  Galaxy Mrk 1044","comments":"Accepted for Publication in APJ, 13 pages, 11 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Correlated variability between coronal X-rays and disc optical/UV photons\nprovides a very useful diagnostic of the interplay between the different\nregions around an active galactic nucleus (AGN) and how they interact. AGN that\nreveal strong X-ray reflection in their spectra should normally exhibit\noptical/UV to X-ray correlation consistent with reprocessing -- where the\noptical/UV emission lag behind the X-rays. While such correlated delay has been\nseen in some sources, it has been absent in others. \\rm{Mrk~1044} is one such\nsource that has been known to reveal strong X-ray reflection in its spectra. In\nour analysis of three long \\textit{XMM-Newton} and several \\textit{Swift}\nobservations of the source, we found no strong evidence for correlation between\nits UV and X-ray lightcurves both on short and long time scales. Among other\nplausible causes for the non-detection, we posit that higher X-ray variability\nthan UV and strong general relativistic effects close to the black hole may\nalso be responsible. We also present results from the spectral analysis based\non \\textit{XMM-Newton} and \\textit{NuSTAR} observations, which show the strong\nsoft X-ray excess and iron K$\\alpha$ line in the 0.3--50 keV spectrum that can\nbe described by relativistic reflection.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:33:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Barua","Samuzal",""],["Adegoke","Oluwashina K.",""],["Misra","Ranjeev",""],["Pawar","Pramod",""],["Jithesh","V.",""],["Medhi","Biman J.",""]]}
{"id":"2308.11553","submitter":"Alaska Subedi","authors":"Alaska Subedi","title":"Order-by-disorder charge density wave condensation at\n  $\\mathbf{\\textit{q} =(\\frac{1}{3},\\frac{1}{3},\\frac{1}{3})}$ in kagome metal\n  ScV$_6$Sn$_6$","comments":"Fix a typo; 6 pages, 2 figures, 2 tables; crystal structure\n  information are given in ancillary files","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent discovery of a charge density wave order at the wave vector $P$\n$(\\frac{1}{3},\\frac{1}{3},\\frac{1}{3})$ in the kagome metal ScV$_6$Sn$_6$ has\ncreated a mystery because subsequent theoretical and experimental studies show\na dominant phonon instability instead at another wave vector $H$\n$(\\frac{1}{3},\\frac{1}{3},\\frac{1}{2})$. In this paper, I use first principles\ntotal energy calculations to map out the landscape of the structural\ndistortions due to the unstable phonon modes at $H$, $L$\n$(\\frac{1}{2},0,\\frac{1}{2})$, and $P$ present in this material. In agreement\nwith previous results, I find that the distortions due to the $H$ instability\ncause the largest gain in energy relative to the parent structure, followed in\norder by the $L$ and $P$ instabilities. However, only two distinct structure\noccur due to this instability, which are separated by 6 meV/f.u. The\ninstability at $L$ results in three distinct structures separated in energy by\n5 meV/f.u. In contrast, six different distorted structures are stabilized due\nto the instability at $P$, and they all lie within 2 meV/f.u.\\ of each other.\nHence, despite a lower energy gain, the condensation at $P$ could be favorable\ndue to a larger entropy gain associated with the fluctuations within a manifold\nwith larger multiplicity via the order-by-disorder mechanism.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:34:19 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 11:11:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Subedi","Alaska",""]]}
{"id":"2308.11554","submitter":"Miguel Beneitez","authors":"Miguel Beneitez, Jacob Page, Yves Dubief, Rich R. Kerswell","title":"Multistability of elasto-inertial two-dimensional channel flow","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Elasto-inertial turbulence (EIT) is a recently discovered two-dimensional\nchaotic flow state observed in dilute polymer solutions. It has been\nhypothesised that the dynamical origins of EIT are linked to a center-mode\ninstability, whose nonlinear evolution leads to a travelling wave with an\n'arrowhead' structure in the polymer conformation, a structure also observed\ninstantaneously in simulations of EIT. In this work we conduct a suite of\ntwo-dimensional direct numerical simulations spanning a wide range of polymeric\nflow parameters to examine the possible dynamical connection between the\narrowhead and EIT. Our calculations reveal (up to) four co-existent attractors:\nthe laminar state and a steady arrowhead, along with EIT and a 'chaotic\narrowhead'. The steady arrowhead is stable for all parameters considered here,\nwhile the final pair of (chaotic) flow states are visually very similar and can\nbe distinguished only by the presence of a weak polymer arrowhead structure in\nthe 'chaotic arrowhead' regime. Analysis of energy transfers between the flow\nand the polymer indicates that both chaotic regimes are maintained by an\nidentical near-wall mechanism and that the weak arrowhead does not play a role.\nOur results suggest that the arrowhead is a benign flow structure that is\ndisconnected from the self-sustaining mechanics of EIT.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:34:48 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Beneitez","Miguel",""],["Page","Jacob",""],["Dubief","Yves",""],["Kerswell","Rich R.",""]]}
{"id":"2308.11555","submitter":"Simon Becker","authors":"Simon Becker, Maciej Zworski","title":"From the chiral model of TBG to the Bistritzer--MacDonald model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph cond-mat.mes-hall cond-mat.str-el math.AP math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyse the splitting of exact flat bands in the chiral model of the\ntwisted bilayer graphene (TBG) when the $AA'/BB'$ coupling of the full\nBistritzer--MacDonald model is taken into account. The first-order perturbation\ncaused by the $AA'/BB'$ potential the same for both bands and satisfies\ninteresting symmetries, in particular it vanishes on the line defined by the\n$K$ points. The splitting of the flat bands is governed by the quadratic term\nwhich vanishes at the $K$ points.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:36:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Becker","Simon",""],["Zworski","Maciej",""]]}
{"id":"2308.11556","submitter":"Jeremy Lovejoy","authors":"Kathrin Bringmann and Jeremy Lovejoy","title":"Odd unimodal sequeneces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study odd unimodal and odd strongly unimodal sequences. We\nuse $q$-series methods to find several fundamental generating functions.\nEmploying the Euler--Maclaurin summation formula we obtain the asymptotic main\nterm for both types of sequences. We also find families of congruences modulo\n$4$ for the number of odd strongly unimodal sequences.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:37:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bringmann","Kathrin",""],["Lovejoy","Jeremy",""]]}
{"id":"2308.11557","submitter":"Shengbang Fang","authors":"Shengbang Fang, Tai D. Nguyen, Matthew C. Stamm","title":"Open Set Synthetic Image Source Attribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  AI-generated images have become increasingly realistic and have garnered\nsignificant public attention. While synthetic images are intriguing due to\ntheir realism, they also pose an important misinformation threat. To address\nthis new threat, researchers have developed multiple algorithms to detect\nsynthetic images and identify their source generators. However, most existing\nsource attribution techniques are designed to operate in a closed-set scenario,\ni.e. they can only be used to discriminate between known image generators. By\ncontrast, new image-generation techniques are rapidly emerging. To contend with\nthis, there is a great need for open-set source attribution techniques that can\nidentify when synthetic images have originated from new, unseen generators. To\naddress this problem, we propose a new metric learning-based approach. Our\ntechnique works by learning transferrable embeddings capable of discriminating\nbetween generators, even when they are not seen during training. An image is\nfirst assigned to a candidate generator, then is accepted or rejected based on\nits distance in the embedding space from known generators' learned reference\npoints. Importantly, we identify that initializing our source attribution\nembedding network by pretraining it on image camera identification can improve\nour embeddings' transferability. Through a series of experiments, we\ndemonstrate our approach's ability to attribute the source of synthetic images\nin open-set scenarios.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:37:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Fang","Shengbang",""],["Nguyen","Tai D.",""],["Stamm","Matthew C.",""]]}
{"id":"2308.11558","submitter":"Gunjan Kumar","authors":"Diptarka Chakraborty, Sourav Chakraborty, Gunjan Kumar","title":"Tight Lower Bound on Equivalence Testing in Conditional Sampling Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CC cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the equivalence testing problem where the goal is to determine if\nthe given two unknown distributions on $[n]$ are equal or $\\epsilon$-far in the\ntotal variation distance in the conditional sampling model (CFGM, SICOMP16;\nCRS, SICOMP15) wherein a tester can get a sample from the distribution\nconditioned on any subset. Equivalence testing is a central problem in\ndistribution testing, and there has been a plethora of work on this topic in\nvarious sampling models.\n  Despite significant efforts over the years, there remains a gap in the\ncurrent best-known upper bound of $\\tilde{O}(\\log \\log n)$ [FJOPS, COLT 2015]\nand lower bound of $\\Omega(\\sqrt{\\log \\log n})$[ACK, RANDOM 2015, Theory of\nComputing 2018].\n  Closing this gap has been repeatedly posed as an open problem (listed as\nproblems 66 and 87 at sublinear.info). In this paper, we completely resolve the\nquery complexity of this problem by showing a lower bound of\n$\\tilde{\\Omega}(\\log \\log n)$. For that purpose, we develop a novel and generic\nproof technique that enables us to break the $\\sqrt{\\log \\log n}$ barrier, not\nonly for the equivalence testing problem but also for other distribution\ntesting problems, such as uniblock property.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:38:17 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Chakraborty","Diptarka",""],["Chakraborty","Sourav",""],["Kumar","Gunjan",""]]}
{"id":"2308.11559","submitter":"Federico Butori","authors":"Federico Butori and Francesco Grotto and Eliseo Luongo and Leonardo\n  Roveri","title":"Existence of Invariant Measures for Stochastic Inviscid Multi-Layer\n  Quasi-Geostrophic Equations","comments":"Corrected typo in the title","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.AP math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider an inviscid 3-layer quasi-geostrophic model with stochastic\nforcing in a 2D bounded domain. After establishing well-posedness of such\nsystem under natural regularity assumptions on the initial condition and the\n(additive) noise, we prove the existence of an invariant measure supported on\nbounded functions by means of the Krylov-Bogoliubov approach developed by\nFerrario and Bessaih (Comm. Math. Phys. 377, 2020).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:42:45 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 17:49:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Butori","Federico",""],["Grotto","Francesco",""],["Luongo","Eliseo",""],["Roveri","Leonardo",""]]}
{"id":"2308.11560","submitter":"Sergey Volkov","authors":"Sergey Volkov","title":"Calculation of lepton magnetic moments in quantum electrodynamics: a\n  justification of the flexible divergence elimination method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The flexible method of reduction to finite integrals, briefly described in\nearlier publications of the author, is described in detail. The method is\nsuitable for the calculation of all quantum electrodynamical contributions to\nthe magnetic moments of leptons. It includes mass-dependent contributions. The\nmethod removes all divergences (UV, IR and mixed) point-by-point in Feynman\nparametric space without any usage of limit-like regularizations. It yields a\nfinite integral for each individual Feynman graph. The subtraction procedure is\nbased on the use of linear operators applied to the Feynman amplitudes of\nUV-divergent subgraphs; a placement of all terms in the same Feynman parametric\nspace is implied. The final result is simply the sum of the individual graph\ncontributions; no residual renormalization is required. The method also allows\nus to split the total contribution into the contributions of small\ngauge-invariant classes. The procedure offers a great freedom in the choice of\nthe linear operators. This freedom can be used for improving the computation\nspeed and for a reliability check. The mechanism of divergence elimination is\nexplained, as well as the equivalence of the method and the on-shell\nrenormalization. For illustrative purposes, all 4-loop contributions to the\nanomalous magnetic moments of the electron and muon are given for each small\ngauge-invariant class, as well as their comparison with previously known\nresults. This also includes the contributions that depend on the ratios of the\ntau-lepton mass to the electron and muon mass.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:43:38 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 10:18:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Volkov","Sergey",""]]}
{"id":"2308.11561","submitter":"Yifei Su","authors":"Yifei Su, Dong An, Yuan Xu, Kehan Chen, Yan Huang","title":"Target-Grounded Graph-Aware Transformer for Aerial Vision-and-Dialog\n  Navigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report details the methods of the winning entry of the AVDN Challenge in\nICCV CLVL 2023. The competition addresses the Aerial Navigation from Dialog\nHistory (ANDH) task, which requires a drone agent to associate dialog history\nwith aerial observations to reach the destination. For better cross-modal\ngrounding abilities of the drone agent, we propose a Target-Grounded\nGraph-Aware Transformer (TG-GAT) framework. Concretely, TG-GAT first leverages\na graph-aware transformer to capture spatiotemporal dependency, which benefits\nnavigation state tracking and robust action planning. In addition,an auxiliary\nvisual grounding task is devised to boost the agent's awareness of referred\nlandmarks. Moreover, a hybrid augmentation strategy based on large language\nmodels is utilized to mitigate data scarcity limitations. Our TG-GAT framework\nwon the AVDN Challenge, with 2.2% and 3.0% absolute improvements over the\nbaseline on SPL and SR metrics, respectively. The code is available at\nhttps://github.com/yifeisu/TG-GAT.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:45:35 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 05:53:43 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 13:57:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Su","Yifei",""],["An","Dong",""],["Xu","Yuan",""],["Chen","Kehan",""],["Huang","Yan",""]]}
{"id":"2308.11562","submitter":"Egor Ushakov","authors":"Egor Ushakov, Anton Naumov, Vladislav Fomberg, Polina Vishnyakova,\n  Aleksandra Asaturova, Alina Badlaeva, Anna Tregubova, Evgeny Karpulevich,\n  Gennady Sukhikh, Timur Fatkhudinov","title":"EndoNet: model for automatic calculation of H-score on histological\n  slides","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  H-score is a semi-quantitative method used to assess the presence and\ndistribution of proteins in tissue samples by combining the intensity of\nstaining and percentage of stained nuclei. It is widely used but time-consuming\nand can be limited in accuracy and precision. Computer-aided methods may help\novercome these limitations and improve the efficiency of pathologists'\nworkflows. In this work, we developed a model EndoNet for automatic calculation\nof H-score on histological slides. Our proposed method uses neural networks and\nconsists of two main parts. The first is a detection model which predicts\nkeypoints of centers of nuclei. The second is a H-score module which calculates\nthe value of the H-score using mean pixel values of predicted keypoints. Our\nmodel was trained and validated on 1780 annotated tiles with a shape of 100x100\n$\\mu m$ and performed 0.77 mAP on a test dataset. Moreover, the model can be\nadjusted to a specific specialist or whole laboratory to reproduce the manner\nof calculating the H-score. Thus, EndoNet is effective and robust in the\nanalysis of histology slides, which can improve and significantly accelerate\nthe work of pathologists.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:45:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Ushakov","Egor",""],["Naumov","Anton",""],["Fomberg","Vladislav",""],["Vishnyakova","Polina",""],["Asaturova","Aleksandra",""],["Badlaeva","Alina",""],["Tregubova","Anna",""],["Karpulevich","Evgeny",""],["Sukhikh","Gennady",""],["Fatkhudinov","Timur",""]]}
{"id":"2308.11563","submitter":"Silvana Deilen","authors":"Silvana Deilen, Sergio Hern\\'andez Garrido, Ekaterina\n  Lapshinova-Koltunski, Christiane Maa{\\ss}","title":"Using ChatGPT as a CAT tool in Easy Language translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This study sets out to investigate the feasibility of using ChatGPT to\ntranslate citizen-oriented administrative texts into German Easy Language, a\nsimplified, controlled language variety that is adapted to the needs of people\nwith reading impairments. We use ChatGPT to translate selected texts from\nwebsites of German public authorities using two strategies, i.e. linguistic and\nholistic. We analyse the quality of the generated texts based on different\ncriteria, such as correctness, readability, and syntactic complexity. The\nresults indicated that the generated texts are easier than the standard texts,\nbut that they still do not fully meet the established Easy Language standards.\nAdditionally, the content is not always rendered correctly.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:59:31 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Deilen","Silvana",""],["Garrido","Sergio Hern\u00e1ndez",""],["Lapshinova-Koltunski","Ekaterina",""],["Maa\u00df","Christiane",""]]}
{"id":"2308.11564","submitter":"Joshu\\'e Hel\\'i Ricalde Guerrero","authors":"Daniel Hern\\'andez-Hern\\'andez and Joshu\\'e Hel\\'i Ricalde-Guerrero","title":"Conditional McKean-Vlasov Differential Equations with Common Poissonian\n  Noise: Propagation of Chaos","comments":"24 pages, 0 figures, submitted to Electronic Journal of Probability","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A model for the evolution of a large population interacting system is\nconsidered in which a marked Poisson processes influences their evolution,\ntogether with a Brownian motion. Mean field McKean-Vlasov limits of such system\nare formulated studying first both systems individually. Letting the population\nsize growing to infinite, the weak convergence of the solutions of such systems\nis proved; in other words, propagation of chaos of such systems is obtained.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:04:25 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Hern\u00e1ndez-Hern\u00e1ndez","Daniel",""],["Ricalde-Guerrero","Joshu\u00e9 Hel\u00ed",""]]}
{"id":"2308.11565","submitter":"Piotr Bozek","authors":"Rupam Samanta and Piotr Bozek","title":"Momentum dependent measures of correlations between mean transverse\n  momentum and harmonic flow in heavy ion collisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The correlation between the mean transverse momentum and the harmonic flow\ncoefficients is an observable which is of great interest, it is sensitive to\nshape fluctuations in the initial state of a relativistic nuclear collision.\nThe measurement of that correlation coefficient in central collisions allows\none to infer on the intrinsic deformation and structure of the colliding\nnuclei. We propose to study the momentum dependent covariance and correlation\ncoefficient between the mean transverse momentum and the harmonic flow in a\ngiven transverse momentum bin. Two possible constructions of such observable\nare provided and predictions are obtained from a viscous hydrodynamic model. We\nfind that such momentum dependent correlation coefficient between the mean\ntransverse momentum and the harmonic flow shows a very strong and nontrivial\nmomentum dependence. We also explore the effect of granularity (nucleon width)\nin the initial state on this momentum dependent correlation coefficient. In\nparticular, this momentum dependence could be used to constrain the size of\nsmall scale fluctuations in the initial state.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:06:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Samanta","Rupam",""],["Bozek","Piotr",""]]}
{"id":"2308.11566","submitter":"John Voight","authors":"John Voight","title":"Kneser's method of neighbors","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a landmark paper published in 1957, Kneser introduced a method for\nenumerating classes in the genus of a definite, integral quadratic form. This\nmethod has been deeply influential, on account of its theoretical importance as\nwell as its practicality. In this survey, we exhibit Kneser's method of\nneighbors and indicate some of its applications in number theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:08:38 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Voight","John",""]]}
{"id":"2308.11567","submitter":"Arthur Pellegrino","authors":"Arthur Pellegrino, N Alex Cayco-Gajic, Angus Chadwick","title":"Low Tensor Rank Learning of Neural Dynamics","comments":"The last two authors contributed equally","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.LG cs.NE math.DS stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning relies on coordinated synaptic changes in recurrently connected\npopulations of neurons. Therefore, understanding the collective evolution of\nsynaptic connectivity over learning is a key challenge in neuroscience and\nmachine learning. In particular, recent work has shown that the weight matrices\nof task-trained RNNs are typically low rank, but how this low rank structure\nunfolds over learning is unknown. To address this, we investigate the rank of\nthe 3-tensor formed by the weight matrices throughout learning. By fitting RNNs\nof varying rank to large-scale neural recordings during a motor learning task,\nwe find that the inferred weights are low-tensor-rank and therefore evolve over\na fixed low-dimensional subspace throughout the entire course of learning. We\nnext validate the observation of low-tensor-rank learning on an RNN trained to\nsolve the same task by performing a low-tensor-rank decomposition directly on\nthe ground truth weights, and by showing that the method we applied to the data\nfaithfully recovers this low rank structure. Finally, we present a set of\nmathematical results bounding the matrix and tensor ranks of gradient descent\nlearning dynamics which show that low-tensor-rank weights emerge naturally in\nRNNs trained to solve low-dimensional tasks. Taken together, our findings\nprovide novel constraints on the evolution of population connectivity over\nlearning in both biological and artificial neural networks, and enable reverse\nengineering of learning-induced changes in recurrent network dynamics from\nlarge-scale neural recordings.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:08:47 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pellegrino","Arthur",""],["Cayco-Gajic","N Alex",""],["Chadwick","Angus",""]]}
{"id":"2308.11568","submitter":"Guhnoo Yun","authors":"Guhnoo Yun, Juhan Yoo, Kijung Kim, Jeongho Lee, Dong Hwan Kim","title":"SPANet: Frequency-balancing Token Mixer using Spectral Pooling\n  Aggregation Modulation","comments":"Accepted paper at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent studies show that self-attentions behave like low-pass filters (as\nopposed to convolutions) and enhancing their high-pass filtering capability\nimproves model performance. Contrary to this idea, we investigate existing\nconvolution-based models with spectral analysis and observe that improving the\nlow-pass filtering in convolution operations also leads to performance\nimprovement. To account for this observation, we hypothesize that utilizing\noptimal token mixers that capture balanced representations of both high- and\nlow-frequency components can enhance the performance of models. We verify this\nby decomposing visual features into the frequency domain and combining them in\na balanced manner. To handle this, we replace the balancing problem with a mask\nfiltering problem in the frequency domain. Then, we introduce a novel\ntoken-mixer named SPAM and leverage it to derive a MetaFormer model termed as\nSPANet. Experimental results show that the proposed method provides a way to\nachieve this balance, and the balanced representations of both high- and\nlow-frequency components can improve the performance of models on multiple\ncomputer vision tasks. Our code is available at\n$\\href{https://doranlyong.github.io/projects/spanet/}{\\text{https://doranlyong.github.io/projects/spanet/}}$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:14:19 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yun","Guhnoo",""],["Yoo","Juhan",""],["Kim","Kijung",""],["Lee","Jeongho",""],["Kim","Dong Hwan",""]]}
{"id":"2308.11569","submitter":"Robin Delabays","authors":"Glory M. Givi, Robin Delabays, Matthieu Jacquemet, and Philippe\n  Jacquod","title":"On the Robustness of Democratic Electoral Processes to Computational\n  Propaganda","comments":"Main text: 26 pages, 6 figures. Supplementary information: 14 pages,\n  9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is growing evidence of systematic attempts to influence democratic\nelections by controlled and digitally organized dissemination of fake news.\nThis raises the question of the intrinsic robustness of democratic electoral\nprocesses against external influences. Particularly interesting is to identify\nthe social characteristics of a voter population that renders it more resilient\nagainst opinion manipulation. Equally important is to determine which of the\nexisting democratic electoral systems is more robust to external influences.\nHere we construct a mathematical electoral model to address these two\nquestions. We find that electorates are more resilient against opinion\nmanipulations (i) if they are less polarized and (ii) when voters interact more\nwith each other, regardless of their opinion differences, and that (iii)\nelectoral systems based on proportional representation are generally the most\nrobust. Our model qualitatively captures the volatility of the US House of\nRepresentatives elections. We take this as a solid validation of our approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:19:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Givi","Glory M.",""],["Delabays","Robin",""],["Jacquemet","Matthieu",""],["Jacquod","Philippe",""]]}
{"id":"2308.11570","submitter":"J. E. Paguyo","authors":"Santiago Arenas-Velilla, Octavio Arizmendi, J. E. Paguyo","title":"Central limit theorem for crossings in randomly embedded graphs","comments":"18 pages, 5 figures. This is a merger of arXiv:2104.01134 and\n  arXiv:2205.03995","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the number of crossings in a random embedding of a graph, $G$,\nwith vertices in convex position. We give explicit formulas for the mean and\nvariance of the number of crossings as a function of various subgraph counts of\n$G$. Using Stein's method and size-bias coupling, we prove an upper bound on\nthe Kolmogorov distance between the distribution of the number of crossings and\na standard normal random variable. As an application, we establish central\nlimit theorems, along with convergence rates, for the number of crossings in\nrandom matchings, path graphs, cycle graphs, and the disjoint union of\ntriangles.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:21:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Arenas-Velilla","Santiago",""],["Arizmendi","Octavio",""],["Paguyo","J. E.",""]]}
{"id":"2308.11571","submitter":"Carlos Am\\'endola","authors":"Carlos Am\\'endola, Francesco Galuppi, \\'Angel David R\\'ios Ortiz,\n  Pierpaola Santarsiero, Tim Seynnaeve","title":"Decomposing Tensor Spaces via Path Signatures","comments":"22 pages","journal-ref":null,"doi":null,"report-no":"BCSim-2022-s04","categories":"math.RT math.AG math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The signature of a path is a sequence of tensors whose entries are iterated\nintegrals, playing a key role in stochastic analysis and applications. The set\nof all signature tensors at a particular level gives rise to the universal\nsignature variety. We show that the parametrization of this variety induces a\nnatural decomposition of the tensor space via representation theory, and\nconnect this to the study of path invariants. We also examine the question of\ndetermining what is the tensor rank of a signature tensor.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:21:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Am\u00e9ndola","Carlos",""],["Galuppi","Francesco",""],["Ortiz","\u00c1ngel David R\u00edos",""],["Santarsiero","Pierpaola",""],["Seynnaeve","Tim",""]]}
{"id":"2308.11572","submitter":"Mojtaba Jazaeri","authors":"Mojtaba Jazaeri","title":"Neumaier Cayley graphs","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Neumaier graph is a non-complete edge-regular graph with the property that\nit has a regular clique. In this paper, we study Neumaier Cayley graphs. We\ngive a necessary and sufficient condition under which a Neumaier Cayley graph\nis a strongly regular Neumaier Cayley graph. We also characterize Neumaier\nCayley graphs with small valency at most $10$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:22:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jazaeri","Mojtaba",""]]}
{"id":"2308.11573","submitter":"Zhijian Qiao","authors":"Zhijian Qiao, Zehuan Yu, Binqian Jiang, Huan Yin, and Shaojie Shen","title":"G3Reg: Pyramid Graph-based Global Registration using Gaussian Ellipsoid\n  Model","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study introduces a novel framework, G3Reg, for fast and robust global\nregistration of LiDAR point clouds. In contrast to conventional complex\nkeypoints and descriptors, we extract fundamental geometric primitives\nincluding planes, clusters, and lines (PCL) from the raw point cloud to obtain\nlow-level semantic segments. Each segment is formulated as a unified Gaussian\nEllipsoid Model (GEM) by employing a probability ellipsoid to ensure the ground\ntruth centers are encompassed with a certain degree of probability. Utilizing\nthese GEMs, we then present a distrust-and-verify scheme based on a Pyramid\nCompatibility Graph for Global Registration (PAGOR). Specifically, we establish\nan upper bound, which can be traversed based on the confidence level for\ncompatibility testing to construct the pyramid graph. Gradually, we solve\nmultiple maximum cliques (MAC) for each level of the graph, generating numerous\ntransformation candidates. In the verification phase, we adopt a precise and\nefficient metric for point cloud alignment quality, founded on geometric\nprimitives, to identify the optimal candidate. The performance of the algorithm\nis extensively validated on three publicly available datasets and a\nself-collected multi-session dataset, without changing any parameter settings\nin the experimental evaluation. The results exhibit superior robustness and\nreal-time performance of the G3Reg framework compared to state-of-the-art\nmethods. Furthermore, we demonstrate the potential for integrating individual\nGEM and PAGOR components into other algorithmic frameworks to enhance their\nefficacy. To advance further research and promote community understanding, we\nhave publicly shared the source code.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:23:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Qiao","Zhijian",""],["Yu","Zehuan",""],["Jiang","Binqian",""],["Yin","Huan",""],["Shen","Shaojie",""]]}
{"id":"2308.11574","submitter":"Sunul Oh","authors":"Sunul Oh","title":"Hyperbolic Dehn filling, volume, and transcendentality","comments":"36 pages, 8 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $M$ be a 1-cusped hyperbolic 3-manifold. In this paper, we investigate\nthe behavior of the number $N_M(v)$ of Dehn fillings of $M$ with a given volume\n$v$. Our study focuses on 236 manifolds with cusp shapes characterized by\nrational real parts. We establish necessary conditions for Dehn fillings that\nshare the same complex volume or exhibit conjugate complex volume differences.\nAdditionally, we demonstrate the transcendental nature of the Neumann-Zagier\nvolume formula, proving that the growth of $N_M$ is slower than any power of\nits filling coefficient.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:24:10 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Oh","Sunul",""]]}
{"id":"2308.11575","submitter":"Vladimir Zolotarev","authors":"Vladimir A. Zolotarev","title":"Inverse spectral problem for a third-order differential operator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inverse spectral problem for a self-adjoint differential operator, which is\nthe sum of the operator of the third derivative on a finite interval and of the\noperator of multiplication by a real function (potential), is solved. Closed\nsystem of integral linear equations is obtained. Via solution to this system,\nthe potential is calculated. It is shown that the main parameters of the\nobtained system of equations are expressed via spectral data of the initial\noperator. It is established that the potential is unambiguously defined by the\nfour spectra.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:24:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zolotarev","Vladimir A.",""]]}
{"id":"2308.11576","submitter":"Alessandro Sfondrini","authors":"Alberto Brollo and Dennis le Plat and Alessandro Sfondrini and Ryo\n  Suzuki","title":"More on the tensionless limit of pure-Ramond-Ramond AdS3/CFT2","comments":"82 pages, many figures and tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent letter we presented the equations which describe tensionless\nlimit of the excited-state spectrum for strings on $AdS_3\\times S^3\\times T^4$\nsupported by Ramond-Ramond flux, and their numerical solution. In this paper,\nwe give a detailed account of the derivation of these equations from the mirror\nTBA equations proposed by Frolov and Sfondrini, discussing the\ncontour-deformation trick which we used to obtain excited-state equations and\nthe tensionless limit. We also comment at length on the algorithm for the\nnumerical solution of the equations in the tensionless limit, and present a\nnumber of explicit numerical results, as well as comment on their\ninterpretation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:27:43 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Brollo","Alberto",""],["Plat","Dennis le",""],["Sfondrini","Alessandro",""],["Suzuki","Ryo",""]]}
{"id":"2308.11577","submitter":"Matthew A. Lim","authors":"Alessandro Gavardi, Matthew A. Lim, Simone Alioli, Frank Tackmann","title":"NNLO+PS $W^+W^-$ production using jet veto resummation at NNLL$'$","comments":"39 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a novel event generator for the process $p \\> p \\to \\ell^- \\>\n\\bar{\\nu}_\\ell \\> \\ell'^+ \\> \\nu_{\\ell'}$, which matches fixed-order\npredictions at next-to-next-to-leading order in the strong coupling to a parton\nshower program. The matching is achieved using the GENEVA method, in this case\nexploiting a resummed calculation for the hardest jet transverse momentum at\nnext-to-next-to-leading logarithmic accuracy obtained via soft-collinear\neffective theory and implemented in the C++ library SCETlib. This choice of\nresolution variable ensures that the introduction of a jet veto, commonly used\nby experimental analyses to reject multi-jet background events, does not result\nin the appearance of unmitigated large logarithms for low veto scales before\nshowering. After validating our partonic results against publicly available\nfixed order and resummed calculations, we compare our predictions to\nmeasurements taken at the ATLAS and CMS experiments, finding good agreement.\nThis is the first NNLO+PS accurate event generator to use the hardest jet\ntransverse momentum as a resolution variable.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:27:53 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gavardi","Alessandro",""],["Lim","Matthew A.",""],["Alioli","Simone",""],["Tackmann","Frank",""]]}
{"id":"2308.11578","submitter":"Zixing Zhang","authors":"Zixing Zhang, Liyizhe Peng, Tao Pang, Jing Han, Huan Zhao, Bjorn W.\n  Schuller","title":"Refashioning Emotion Recognition Modelling: The Advent of Generalised\n  Large Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  After the inception of emotion recognition or affective computing, it has\nincreasingly become an active research topic due to its broad applications.\nOver the past couple of decades, emotion recognition models have gradually\nmigrated from statistically shallow models to neural network-based deep models,\nwhich can significantly boost the performance of emotion recognition models and\nconsistently achieve the best results on different benchmarks. Therefore, in\nrecent years, deep models have always been considered the first option for\nemotion recognition. However, the debut of large language models (LLMs), such\nas ChatGPT, has remarkably astonished the world due to their emerged\ncapabilities of zero/few-shot learning, in-context learning, chain-of-thought,\nand others that are never shown in previous deep models. In the present paper,\nwe comprehensively investigate how the LLMs perform in emotion recognition in\nterms of diverse aspects, including in-context learning, few-short learning,\naccuracy, generalisation, and explanation. Moreover, we offer some insights and\npose other potential challenges, hoping to ignite broader discussions about\nenhancing emotion recognition in the new era of advanced and generalised large\nmodels.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:14:32 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhang","Zixing",""],["Peng","Liyizhe",""],["Pang","Tao",""],["Han","Jing",""],["Zhao","Huan",""],["Schuller","Bjorn W.",""]]}
{"id":"2308.11579","submitter":"Lakhdar Remaki","authors":"Lakhdar Remaki","title":"An alternative to SVM Method for Data Classification","comments":"15 pages and 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Support vector machine (SVM), is a popular kernel method for data\nclassification that demonstrated its efficiency for a large range of practical\napplications. The method suffers, however, from some weaknesses including; time\nprocessing, risk of failure of the optimization process for high dimension\ncases, generalization to multi-classes, unbalanced classes, and dynamic\nclassification. In this paper an alternative method is proposed having a\nsimilar performance, with a sensitive improvement of the aforementioned\nshortcomings. The new method is based on a minimum distance to optimal\nsubspaces containing the mapped original classes.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:09:01 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Remaki","Lakhdar",""]]}
{"id":"2308.11580","submitter":"Jose Morales Escalante","authors":"Jose A. Morales Escalante","title":"NIPG-DG schemes for transformed master equations modeling open quantum\n  systems","comments":"21 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.NA math.NA quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents a numerical analysis of a master equation modeling the\ninteraction of a system with a noisy environment in the particular context of\nopen quantum systems. It is shown that our transformed master equation has a\nreduced computational cost in comparison to a Wigner-Fokker-Planck model of the\nsame system for the general case of any potential. Specifics of a NIPG-DG\nnumerical scheme adequate for the convection-diffusion system obtained are then\npresented. This will let us solve computationally the transformed system of\ninterest modeling our open quantum system. A benchmark problem, the case of a\nharmonic potential, is then presented, for which the numerical results are\ncompared against the analytical steady-state solution of this problem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:28:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Escalante","Jose A. Morales",""]]}
{"id":"2308.11581","submitter":"Fabio Zoccolan","authors":"Yoshihito Kazashi, Fabio Nobile, and Fabio Zoccolan","title":"Dynamically Orthogonal Approximation for Stochastic Differential\n  Equations","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we set the mathematical foundations of the Dynamical Low Rank\nApproximation (DLRA) method for high-dimensional stochastic differential\nequations. DLRA aims at approximating the solution as a linear combination of a\nsmall number of basis vectors with random coefficients (low rank format) with\nthe peculiarity that both the basis vectors and the random coefficients vary in\ntime. While the formulation and properties of DLRA are now well understood for\nrandom/parametric equations, the same cannot be said for SDEs and this work\naims to fill this gap. We start by rigorously formulating a Dynamically\nOrthogonal (DO) approximation (an instance of DLRA successfully used in\napplications) for SDEs, which we then generalize to define a parametrization\nindependent DLRA for SDEs. We show local well-posedness of the DO equations and\ntheir equivalence with the DLRA formulation. We also characterize the explosion\ntime of the DO solution by a loss of linear independence of the random\ncoefficients defining the solution expansion and give sufficient conditions for\nglobal existence.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:30:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kazashi","Yoshihito",""],["Nobile","Fabio",""],["Zoccolan","Fabio",""]]}
{"id":"2308.11582","submitter":"Daniel Mitsutani","authors":"Daniel Mitsutani, Jonathan DeWitt","title":"Coexistence of measures with simple Lyapunov spectrum for fiber-bunched\n  cocycles","comments":"31 pages, 1 figure; comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that if a H\\\"older continuous fiber-bunched cocycle $\\hat{A}$ over\nan invertible hyperbolic transitive shift $\\hat{\\Sigma}$ satisfies an\nappropriate strong irreducibility condition on Grassmannians, then\n$\\hat{\\Sigma}$ admits an ergodic measure $\\hat{\\mu}$ with full support and\nproduct structure with simple Lyapunov spectrum if and only if any other\nergodic measure with full support and product structure also has simple\nLyapunov spectrum.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:31:03 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mitsutani","Daniel",""],["DeWitt","Jonathan",""]]}
{"id":"2308.11583","submitter":"Surajit Biswas","authors":"Nabamita Banerjee, Arindam Bhattacharjee, Surajit Biswas, Arpita\n  Mitra, Debangshu Mukherjee","title":"$W(0,b)$ algebra and the dual theory of 3D asymptotically flat higher\n  spin gravity","comments":"27+5 pages; 3 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  BMS algebra in three spacetime dimensions can be deformed into a two\nparameter family of algebra known as $W(a,b)$ algebra. For $a=0$, we show that\nother than $W(0,-1)$, no other $W(0,b)$ algebra admits a non-degenerate\nbilinear and thus one can not have a Chern-Simons gauge theory formulation with\nthem. However, they may appear in a three-dimensional gravity description,\nwhere we also need to have a spin 2 generator, that comes from the $(a=0,b=-1)$\nsector. In the present work, we have demonstrated that the asymptotic symmetry\nalgebra of a spin 3 gravity theory on flat spacetime has both the $W(0,-1)$ and\n$W(0,-2)$ algebras as subalgebras. We have also constructed a dual boundary\nfield theory for this higher spin gravity theory by using the\nChern-Simons/Wess-Zumino-Witten correspondence.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:32:24 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Banerjee","Nabamita",""],["Bhattacharjee","Arindam",""],["Biswas","Surajit",""],["Mitra","Arpita",""],["Mukherjee","Debangshu",""]]}
{"id":"2308.11584","submitter":"Zhonghua Zheng","authors":"Zhonghua Zheng, Lizi Liao, Yang Deng, Liqiang Nie","title":"Building Emotional Support Chatbots in the Era of LLMs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integration of emotional support into various conversational scenarios\npresents profound societal benefits, such as social interactions, mental health\ncounseling, and customer service. However, there are unsolved challenges that\nhinder real-world applications in this field, including limited data\navailability and the absence of well-accepted model training paradigms. This\nwork endeavors to navigate these challenges by harnessing the capabilities of\nLarge Language Models (LLMs). We introduce an innovative methodology that\nsynthesizes human insights with the computational prowess of LLMs to curate an\nextensive emotional support dialogue dataset. Our approach is initiated with a\nmeticulously designed set of dialogues spanning diverse scenarios as generative\nseeds. By utilizing the in-context learning potential of ChatGPT, we\nrecursively generate an ExTensible Emotional Support dialogue dataset, named\nExTES. Following this, we deploy advanced tuning techniques on the LLaMA model,\nexamining the impact of diverse training strategies, ultimately yielding an LLM\nmeticulously optimized for emotional support interactions. An exhaustive\nassessment of the resultant model showcases its proficiency in offering\nemotional support, marking a pivotal step in the realm of emotional support\nbots and paving the way for subsequent research and implementations.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 10:49:18 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zheng","Zhonghua",""],["Liao","Lizi",""],["Deng","Yang",""],["Nie","Liqiang",""]]}
{"id":"2308.11585","submitter":"Yosuke Miyanishi","authors":"Yosuke Miyanishi, Minh Le Nguyen","title":"Causal Intersectionality and Dual Form of Gradient Descent for\n  Multimodal Analysis: a Case Study on Hateful Memes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the wake of the explosive growth of machine learning (ML) usage,\nparticularly within the context of emerging Large Language Models (LLMs),\ncomprehending the semantic significance rooted in their internal workings is\ncrucial. While causal analyses focus on defining semantics and its\nquantification, the gradient-based approach is central to explainable AI (XAI),\ntackling the interpretation of the black box. By synergizing these approaches,\nthe exploration of how a model's internal mechanisms illuminate its causal\neffect has become integral for evidence-based decision-making. A parallel line\nof research has revealed that intersectionality - the combinatory impact of\nmultiple demographics of an individual - can be structured in the form of an\nAveraged Treatment Effect (ATE). Initially, this study illustrates that the\nhateful memes detection problem can be formulated as an ATE, assisted by the\nprinciples of intersectionality, and that a modality-wise summarization of\ngradient-based attention attribution scores can delineate the distinct\nbehaviors of three Transformerbased models concerning ATE. Subsequently, we\nshow that the latest LLM LLaMA2 has the ability to disentangle the\nintersectional nature of memes detection in an in-context learning setting,\nwith their mechanistic properties elucidated via meta-gradient, a secondary\nform of gradient. In conclusion, this research contributes to the ongoing\ndialogue surrounding XAI and the multifaceted nature of ML models.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 13:14:15 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Miyanishi","Yosuke",""],["Nguyen","Minh Le",""]]}
{"id":"2308.11586","submitter":"Max Arnott","authors":"Max Arnott and Niels Jakob Laustsen","title":"Uniqueness of algebra norm on quotients of the algebra of bounded\n  operators on a Banach space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that for each of the following Banach spaces~$X$, the quotient\nalgebra $\\mathscr{B}(X)/\\mathscr{I}$ has a unique algebra norm for every closed\nideal $\\mathscr{I}$ of $\\mathscr{B}(X)\\colon$\n  - $X= \\bigl(\\bigoplus_{n\\in\\N}\\ell_2^n\\bigr)_{c_0}$\\quad and its dual,\\quad\n$X= \\bigl(\\bigoplus_{n\\in\\N}\\ell_2^n\\bigr)_{\\ell_1}$,\n  - $X= \\bigl(\\bigoplus_{n\\in\\N}\\ell_2^n\\bigr)_{c_0}\\oplus c_0(\\Gamma)$\\quad\nand its dual, \\quad $X=\n\\bigl(\\bigoplus_{n\\in\\N}\\ell_2^n\\bigr)_{\\ell_1}\\oplus\\ell_1(\\Gamma)$,\\quad for\nan uncountable cardinal number~$\\Gamma$,\n  - $X = C_0(K_{\\mathcal{A}})$, the Banach space of continuous functions\nvanishing at infinity on the locally compact Mr\\'{o}wka space~$K_{\\mathcal{A}}$\ninduced by an uncountable, almost disjoint family~$\\mathcal{A}$ of infinite\nsubsets of~$\\mathbb{N}$, constructed such that $C_0(K_{\\mathcal{A}})$ admits\n\"few operators\".\n  Equivalently, this result states that every homomorphism\nfrom~$\\mathscr{B}(X)$ into a Banach algebra is continuous and has closed range.\nThe key step in our proof is to show that the identity operator on a suitably\nchosen Banach space factors through every operator in\n$\\mathscr{B}(X)\\setminus\\mathscr{I}$ with control over the norms of the\noperators used in the factorization. These quantitative factorization results\nmay be of independent interest.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:34:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Arnott","Max",""],["Laustsen","Niels Jakob",""]]}
{"id":"2308.11587","submitter":"John Machacek","authors":"John Machacek","title":"Graph-like Scheduling Problems and Property B","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Breuer and Klivans defined a diverse class of scheduling problems in terms of\nBoolean formulas with atomic clauses that are inequalities. We consider what we\ncall graph-like scheduling problems. These are Boolean formulas that are\nconjunctions of disjunctions of atomic clauses $(x_i \\neq x_j)$. These problems\ngeneralize proper coloring in graphs and hypergraphs. We focus on the existence\nof a solution with all $x_i$ taking the value of $0$ or $1$ (i.e. problems\nanalogous to the bipartite case). When a graph-like scheduling problem has such\na solution, we say it has property B just as is done for $2$-colorable\nhypergraphs. We define the notion of a $\\lambda$-uniform graph-like scheduling\nproblem for any integer partition $\\lambda$. Some bounds are attained for the\nsize of the smallest $\\lambda$-uniform graph-like scheduling problems without\nproperty B. We make use of both random and constructive methods to obtain\nbounds. Just as in the case of hypergraphs finding tight bounds remains an open\nproblem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:35:13 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Machacek","John",""]]}
{"id":"2308.11588","submitter":"Cynthia Trendafilova","authors":"Cynthia Trendafilova","title":"The Impact of Cross-Covariances Between the CMB and Reconstructed\n  Lensing Power","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weak gravitational lensing of the Cosmic Microwave Background (CMB) changes\nCMB statistics in a nontrivial way, allowing for reconstruction of the lensing\npotential and the use of these reconstructed maps in determining cosmological\nparameters that affect the formation of intervening large-scale structures.\nAlthough in principle there are correlations between the primary CMB and the\nreconstructed lensing potential due to the lensing procedure itself, in\npractice CMB analyses treat these as negligible when combining these band\npowers in likelihoods. In this paper we quantify explicitly the impact on\nparameter constraints due to these cross-covariances between the lensed CMB and\nreconstructed lensing power, and we compare to the effect of including all\nlensing-induced non-Gaussian covariances, which have previously shown to impact\nparameter constraints on the order of 10%. We perform our analysis for a range\nof experimental setups, scanning over instrumental noise levels of 0.5 to 10.0\n$\\mu$K-arcmin in temperature assuming fully polarized detectors, and using a\nfixed beam size of 1.4 arcmin. When the correlations between the lensed CMB and\nlensing power are neglected, we find that forecasted constraints shift by at\nmost 3% of the error bar for a 6-parameter $\\Lambda$CDM model, and for the\nnoise levels considered in this paper. For some of the $\\Lambda$CDM extensions\nconsidered here, however, these correlations have a nontrivial impact, in some\ncases more than 10% of the error bar, even for current experimental noise\nlevels.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:36:00 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Trendafilova","Cynthia",""]]}
{"id":"2308.11589","submitter":"Panji Arisaputra","authors":"Panji Arisaputra, Amalia Zahra","title":"Indonesian Automatic Speech Recognition with XLSR-53","comments":null,"journal-ref":null,"doi":"10.18280/isi.270614","report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This study focuses on the development of Indonesian Automatic Speech\nRecognition (ASR) using the XLSR-53 pre-trained model, the XLSR stands for\ncross-lingual speech representations. The use of this XLSR-53 pre-trained model\nis to significantly reduce the amount of training data in non-English languages\nrequired to achieve a competitive Word Error Rate (WER). The total amount of\ndata used in this study is 24 hours, 18 minutes, and 1 second: (1) TITML-IDN 14\nhours and 31 minutes; (2) Magic Data 3 hours and 33 minutes; and (3) Common\nVoice 6 hours, 14 minutes, and 1 second. With a WER of 20%, the model built in\nthis study can compete with similar models using the Common Voice dataset split\ntest. WER can be decreased by around 8% using a language model, resulted in WER\nfrom 20% to 12%. Thus, the results of this study have succeeded in perfecting\nprevious research in contributing to the creation of a better Indonesian ASR\nwith a smaller amount of data.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 09:59:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Arisaputra","Panji",""],["Zahra","Amalia",""]]}
{"id":"2308.11590","submitter":"Priya Shukla","authors":"Priya Shukla, Vandana Kushwaha, G C Nandi","title":"Vision-Based Intelligent Robot Grasping Using Sparse Neural Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the modern era of Deep Learning, network parameters play a vital role in\nmodels efficiency but it has its own limitations like extensive computations\nand memory requirements, which may not be suitable for real time intelligent\nrobot grasping tasks. Current research focuses on how the model efficiency can\nbe maintained by introducing sparsity but without compromising accuracy of the\nmodel in the robot grasping domain. More specifically, in this research two\nlight-weighted neural networks have been introduced, namely Sparse-GRConvNet\nand Sparse-GINNet, which leverage sparsity in the robotic grasping domain for\ngrasp pose generation by integrating the Edge-PopUp algorithm. This algorithm\nfacilitates the identification of the top K% of edges by considering their\nrespective score values. Both the Sparse-GRConvNet and Sparse-GINNet models are\ndesigned to generate high-quality grasp poses in real-time at every pixel\nlocation, enabling robots to effectively manipulate unfamiliar objects. We\nextensively trained our models using two benchmark datasets: Cornell Grasping\nDataset (CGD) and Jacquard Grasping Dataset (JGD). Both Sparse-GRConvNet and\nSparse-GINNet models outperform the current state-of-the-art methods in terms\nof performance, achieving an impressive accuracy of 97.75% with only 10% of the\nweight of GR-ConvNet and 50% of the weight of GI-NNet, respectively, on CGD.\nAdditionally, Sparse-GRConvNet achieve an accuracy of 85.77% with 30% of the\nweight of GR-ConvNet and Sparse-GINNet achieve an accuracy of 81.11% with 10%\nof the weight of GI-NNet on JGD. To validate the performance of our proposed\nmodels, we conducted extensive experiments using the Anukul (Baxter) hardware\ncobot.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:36:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Shukla","Priya",""],["Kushwaha","Vandana",""],["Nandi","G C",""]]}
{"id":"2308.11591","submitter":"Nikhil Yadav","authors":"Nathan Zhong and Nikhil Yadav","title":"What's Race Got to do with it? Predicting Youth Depression Across Racial\n  Groups Using Machine and Deep Learning","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Depression is a common yet serious mental disorder that affects millions of\nU.S. high schoolers every year. Still, accurate diagnosis and early detection\nremain significant challenges. In the field of public health, research shows\nthat neural networks produce promising results in identifying other diseases\nsuch as cancer and HIV. This study proposes a similar approach, utilizing\nmachine learning (ML) and artificial neural network (ANN) models to classify\ndepression in a student. Additionally, the study highlights the differences in\nrelevant factors for race subgroups and advocates the need for more extensive\nand diverse datasets. The models train on nationwide Youth Risk Behavior\nSurveillance System (YRBSS) survey data, in which the most relevant factors of\ndepression are found with statistical analysis. The survey data is a structured\ndataset with 15000 entries including three race subsets each consisting of 900\nentries. For classification, the research problem is modeled as a supervised\nlearning binary classification problem. Factors relevant to depression for\ndifferent racial subgroups are also identified. The ML and ANN models are\ntrained on the entire dataset followed by different race subsets to classify\nwhether an individual has depression. The ANN model achieves the highest F1\nscore of 82.90% while the best-performing machine learning model, support\nvector machines (SVM), achieves a score of 81.90%. This study reveals that\ndifferent parameters are more valuable for modeling depression across diverse\nracial groups and furthers research regarding American youth depression.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:59:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Zhong","Nathan",""],["Yadav","Nikhil",""]]}
{"id":"2308.11592","submitter":"Hao Feng Mr.","authors":"Hao Feng, Zijian Wang, Jingqun Tang, Jinghui Lu, Wengang Zhou,\n  Houqiang Li, Can Huang","title":"UniDoc: A Universal Large Multimodal Model for Simultaneous Text\n  Detection, Recognition, Spotting and Understanding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the era of Large Language Models (LLMs), tremendous strides have been made\nin the field of multimodal understanding. However, existing advanced algorithms\nare limited to effectively utilizing the immense representation capabilities\nand rich world knowledge inherent to these large pre-trained models, and the\nbeneficial connections among tasks within the context of text-rich scenarios\nhave not been sufficiently explored. In this work, we introduce UniDoc, a novel\nmultimodal model equipped with text detection and recognition capabilities,\nwhich are deficient in existing approaches. Moreover, UniDoc capitalizes on the\nbeneficial interactions among tasks to enhance the performance of each\nindividual task. To implement UniDoc, we perform unified multimodal instruct\ntuning on the contributed large-scale instruction following datasets.\nQuantitative and qualitative experimental results show that UniDoc sets\nstate-of-the-art scores across multiple challenging benchmarks. To the best of\nour knowledge, this is the first large multimodal model capable of simultaneous\ntext detection, recognition, spotting, and understanding.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:32:34 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Feng","Hao",""],["Wang","Zijian",""],["Tang","Jingqun",""],["Lu","Jinghui",""],["Zhou","Wengang",""],["Li","Houqiang",""],["Huang","Can",""]]}
{"id":"2308.11593","submitter":"Zhou Tang","authors":"Zhou Tang and Ted Westling","title":"Nonparametric Assessment of Variable Selection and Ranking Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Selecting from or ranking a set of candidates variables in terms of their\ncapacity for predicting an outcome of interest is an important task in many\nscientific fields. A variety of methods for variable selection and ranking have\nbeen proposed in the literature. In practice, it can be challenging to know\nwhich method is most appropriate for a given dataset. In this article, we\npropose methods of comparing variable selection and ranking algorithms. We\nfirst introduce measures of the quality of variable selection and ranking\nalgorithms. We then define estimators of our proposed measures, and establish\nasymptotic results for our estimators in the regime where the dimension of the\ncovariates is fixed as the sample size grows. We use our results to conduct\nlarge-sample inference for our measures, and we propose a computationally\nefficient partial bootstrap procedure to potentially improve finite-sample\ninference. We assess the properties of our proposed methods using numerical\nstudies, and we illustrate our methods with an analysis of data for predicting\nwine quality from its physicochemical properties.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:37:35 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Tang","Zhou",""],["Westling","Ted",""]]}
{"id":"2308.11594","submitter":"Jinwuk Seok","authors":"Jinwuk Seok, and Changsik Cho","title":"Quantization-based Optimization with Perspective of Quantum Mechanics","comments":"Preprint for ICTC conference (First Revision)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Statistical and stochastic analysis based on thermodynamics has been the main\nanalysis framework for stochastic global optimization. Recently, appearing\nquantum annealing or quantum tunneling algorithm for global optimization, we\nrequire a new researching framework for global optimization algorithms. In this\npaper, we provide the analysis for quantization-based optimization based on the\nSchr\\\"odinger equation to reveal what property in quantum mechanics enables\nglobal optimization. We present that the tunneling effect derived by the\nSchr\\\"odinger equation in quantization-based optimization enables to escape of\na local minimum. Additionally, we confirm that this tunneling effect is the\nsame property included in quantum mechanics-based global optimization.\nExperiments with standard multi-modal benchmark functions represent that the\nproposed analysis is valid.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 05:03:31 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 06:48:29 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Seok","Jinwuk",""],["Cho","Changsik",""]]}
{"id":"2308.11595","submitter":"Mostafa Bousder Dr.","authors":"M. Bousder, A.Riadsolh, M El Belkacemi and H. Ez-Zahraouy","title":"Cosmic acceleration in Lovelock quantum gravity","comments":"18 pages, 2 figures","journal-ref":"Volume 458, Part 1, November 2023, 169441","doi":"10.1016/j.aop.2023.169441","report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces novel solutions for inflation and late-time cosmic\nacceleration within the framework of quantum Lovelock gravity, utilizing\nFriedmann equations. Furthermore, we demonstrate the hypergeometric states of\ncosmic acceleration through the Schr\\\"{o}dinger stationary equation. A physical\ninterpretation is proposed, whereby the rescaled Lovelock couplings represent a\ntopological mass that characterizes the Lovelock branch. This research holds\nthe potential for an extension into the quantum description. Predictions for\nthe spectral tilt and tensor-to-scalar ratio are depicted through plotted\ncurves. By utilizing the rescaled Hubble parameter, the spectral index is\ndetermined in terms of the number of e-folds.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:23:29 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bousder","M.",""],["Riadsolh","A.",""],["Belkacemi","M El",""],["Ez-Zahraouy","H.",""]]}
{"id":"2308.11596","submitter":"Marta R. Costa-Juss\\`a","authors":"Seamless Communication, Lo\\\"ic Barrault, Yu-An Chung, Mariano Cora\n  Meglioli, David Dale, Ning Dong, Paul-Ambroise Duquenne, Hady Elsahar, Hongyu\n  Gong, Kevin Heffernan, John Hoffman, Christopher Klaiber, Pengwei Li, Daniel\n  Licht, Jean Maillard, Alice Rakotoarison, Kaushik Ram Sadagopan, Guillaume\n  Wenzek, Ethan Ye, Bapi Akula, Peng-Jen Chen, Naji El Hachem, Brian Ellis,\n  Gabriel Mejia Gonzalez, Justin Haaheim, Prangthip Hansanti, Russ Howes,\n  Bernie Huang, Min-Jae Hwang, Hirofumi Inaguma, Somya Jain, Elahe Kalbassi,\n  Amanda Kallet, Ilia Kulikov, Janice Lam, Daniel Li, Xutai Ma, Ruslan\n  Mavlyutov, Benjamin Peloquin, Mohamed Ramadan, Abinesh Ramakrishnan, Anna\n  Sun, Kevin Tran, Tuan Tran, Igor Tufanov, Vish Vogeti, Carleigh Wood, Yilin\n  Yang, Bokai Yu, Pierre Andrews, Can Balioglu, Marta R. Costa-juss\\`a, Onur\n  Celebi, Maha Elbayad, Cynthia Gao, Francisco Guzm\\'an, Justine Kao, Ann Lee,\n  Alexandre Mourachko, Juan Pino, Sravya Popuri, Christophe Ropers, Safiyyah\n  Saleem, Holger Schwenk, Paden Tomasello, Changhan Wang, Jeff Wang, Skyler\n  Wang","title":"SeamlessM4T-Massively Multilingual & Multimodal Machine Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  What does it take to create the Babel Fish, a tool that can help individuals\ntranslate speech between any two languages? While recent breakthroughs in\ntext-based models have pushed machine translation coverage beyond 200\nlanguages, unified speech-to-speech translation models have yet to achieve\nsimilar strides. More specifically, conventional speech-to-speech translation\nsystems rely on cascaded systems that perform translation progressively,\nputting high-performing unified systems out of reach. To address these gaps, we\nintroduce SeamlessM4T, a single model that supports speech-to-speech\ntranslation, speech-to-text translation, text-to-speech translation,\ntext-to-text translation, and automatic speech recognition for up to 100\nlanguages. To build this, we used 1 million hours of open speech audio data to\nlearn self-supervised speech representations with w2v-BERT 2.0. Subsequently,\nwe created a multimodal corpus of automatically aligned speech translations.\nFiltered and combined with human-labeled and pseudo-labeled data, we developed\nthe first multilingual system capable of translating from and into English for\nboth speech and text. On FLEURS, SeamlessM4T sets a new standard for\ntranslations into multiple target languages, achieving an improvement of 20%\nBLEU over the previous SOTA in direct speech-to-text translation. Compared to\nstrong cascaded models, SeamlessM4T improves the quality of into-English\ntranslation by 1.3 BLEU points in speech-to-text and by 2.6 ASR-BLEU points in\nspeech-to-speech. Tested for robustness, our system performs better against\nbackground noises and speaker variations in speech-to-text tasks compared to\nthe current SOTA model. Critically, we evaluated SeamlessM4T on gender bias and\nadded toxicity to assess translation safety. Finally, all contributions in this\nwork are open-sourced and accessible at\nhttps://github.com/facebookresearch/seamless_communication\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:44:18 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 21:02:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Communication","Seamless",""],["Barrault","Lo\u00efc",""],["Chung","Yu-An",""],["Meglioli","Mariano Cora",""],["Dale","David",""],["Dong","Ning",""],["Duquenne","Paul-Ambroise",""],["Elsahar","Hady",""],["Gong","Hongyu",""],["Heffernan","Kevin",""],["Hoffman","John",""],["Klaiber","Christopher",""],["Li","Pengwei",""],["Licht","Daniel",""],["Maillard","Jean",""],["Rakotoarison","Alice",""],["Sadagopan","Kaushik Ram",""],["Wenzek","Guillaume",""],["Ye","Ethan",""],["Akula","Bapi",""],["Chen","Peng-Jen",""],["Hachem","Naji El",""],["Ellis","Brian",""],["Gonzalez","Gabriel Mejia",""],["Haaheim","Justin",""],["Hansanti","Prangthip",""],["Howes","Russ",""],["Huang","Bernie",""],["Hwang","Min-Jae",""],["Inaguma","Hirofumi",""],["Jain","Somya",""],["Kalbassi","Elahe",""],["Kallet","Amanda",""],["Kulikov","Ilia",""],["Lam","Janice",""],["Li","Daniel",""],["Ma","Xutai",""],["Mavlyutov","Ruslan",""],["Peloquin","Benjamin",""],["Ramadan","Mohamed",""],["Ramakrishnan","Abinesh",""],["Sun","Anna",""],["Tran","Kevin",""],["Tran","Tuan",""],["Tufanov","Igor",""],["Vogeti","Vish",""],["Wood","Carleigh",""],["Yang","Yilin",""],["Yu","Bokai",""],["Andrews","Pierre",""],["Balioglu","Can",""],["Costa-juss\u00e0","Marta R.",""],["Celebi","Onur",""],["Elbayad","Maha",""],["Gao","Cynthia",""],["Guzm\u00e1n","Francisco",""],["Kao","Justine",""],["Lee","Ann",""],["Mourachko","Alexandre",""],["Pino","Juan",""],["Popuri","Sravya",""],["Ropers","Christophe",""],["Saleem","Safiyyah",""],["Schwenk","Holger",""],["Tomasello","Paden",""],["Wang","Changhan",""],["Wang","Jeff",""],["Wang","Skyler",""]]}
{"id":"2308.11597","submitter":"Conrad Kosowsky","authors":"Conrad Kosowsky","title":"Nash Equilibrium Existence without Convexity","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, I prove the existence of a pure-strategy Nash equilibrium for\na large class of games with nonconvex strategy spaces. Specifically, if each\nplayer's strategies form a compact, connected Euclidean neighborhood retract\nand if all best-response correspondences are null-homotopic, then the game has\na pure-strategy Nash equilibrium. As an application, I show how this result can\nprove the fundamental theorem of algebra.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:46:40 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Kosowsky","Conrad",""]]}
{"id":"2308.11598","submitter":"Anton Klimovsky","authors":"Andreas Greven, Frank den Hollander, Anton Klimovsky, Anita Winter","title":"The grapheme-valued Wright-Fisher diffusion with mutation","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In [Athreya, den Hollander, R\\\"ollin; 2021, arXiv:1908.06241] models from\npopulation genetics were used to define stochastic dynamics in the space of\ngraphons arising as continuum limits of dense graphs. In the present paper we\nexhibit an example of a simple neutral population genetics model for which this\ndynamics is a Markovian diffusion that can be characterised as the solution of\na martingale problem. In particular, we consider a Markov chain in the space of\nfinite graphs that resembles a Moran model with resampling and mutation. We\nencode the finite graphs as graphemes, which can be represented as a triple\nconsisting of a vertex set, an adjacency matrix and a sampling measure. We\nequip the space of graphons with convergence of sample subgraph densities and\nshow that the grapheme-valued Markov chain converges to a grapheme-valued\ndiffusion as the number of vertices goes to infinity. We show that the\ngrapheme-valued diffusion has a stationary distribution that is linked to the\nPoisson-Dirichlet distribution. In a companion paper [Greven, den Hollander,\nKlimovsky, Winter; 2023], we build up a general theory for obtaining\ngrapheme-valued diffusions via genealogies of models in population genetics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:46:50 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Greven","Andreas",""],["Hollander","Frank den",""],["Klimovsky","Anton",""],["Winter","Anita",""]]}
{"id":"2308.11599","submitter":"Kabish Wisal","authors":"Kabish Wisal, Chun-Wei Chen, Hui Cao and A. Douglas Stone","title":"Theory of Transverse Mode Instability in Fiber Amplifiers with Multimode\n  Excitations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transverse Mode Instability (TMI) which results from dynamic nonlinear\nthermo-optical scattering is the primary limitation to power scaling in\nhigh-power fiber lasers and amplifiers. It has been proposed that TMI can be\nsuppressed by exciting multiple modes in a highly multimode fiber. We derive a\nsemi-analytic frequency-domain theory of the threshold for the onset of TMI\nunder arbitrary multimode input excitation for general fiber geometries. We\nshow that TMI results from exponential growth of noise in all the modes at\ndownshifted frequencies due to the thermo-optical coupling. The noise growth\nrate in each mode is given by the sum of signal powers in various modes\nweighted by pairwise thermo-optical coupling coefficients. We calculate\nthermo-optical coupling coefficients for all $\\sim$$10^4$ pairs of modes in a\nstandard circular multimode fiber and show that modes with large transverse\nspatial frequency mismatch are weakly coupled resulting in a banded coupling\nmatrix. This short-range behavior is due to the diffusive nature of the heat\npropagation which mediates the coupling and leads to a lower noise growth rate\nupon multimode excitation compared to single mode, resulting in significant TMI\nsuppression. We find that the TMI threshold increases linearly with the number\nof modes that are excited, leading to more than an order of magnitude increase\nin the TMI threshold in a 82-mode fiber amplifier. Using our theory, we also\ncalculate TMI threshold in fibers with non-circular geometries upon multimode\nexcitation and show the linear scaling of TMI threshold to be a universal\nproperty of different fibers.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:47:08 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Wisal","Kabish",""],["Chen","Chun-Wei",""],["Cao","Hui",""],["Stone","A. Douglas",""]]}
{"id":"2308.11600","submitter":"Thomas Kosch","authors":"Pascal Knierim, Thomas Kosch","title":"Towards Universal Interaction for Extended Reality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extended Reality (XR) is a rapidly growing field offering unique immersive\nexperiences, social networking, learning, and collaboration opportunities. The\ncontinuous advancements in XR technology and industry efforts are gradually\nmoving this technology toward end consumers. However, a universal\none-size-fits-all solution for seamless XR interaction still needs to be\ndiscovered. Currently, we face a diverse landscape of interaction modalities\nthat depend on the environment, user preferences, task, and device\ncapabilities. Commercially available input methods like handheld controllers,\nhand gestures, voice commands, and combinations of those need universal\nflexibility and expressiveness. Additionally, hybrid user interfaces, such as\nsmartwatches and smartphones as ubiquitous input and output devices, expand\nthis interaction design space. In this position paper, we discuss the idea of a\nuniversal interaction concept for XR. We present challenges and opportunities\nfor implementing hybrid user interfaces, emphasizing Environment, Task, and\nUser. We explore the potential to enhance user experiences, interaction\ncapabilities, and the development of seamless and efficient XR interaction\nmethods. We examine challenges and aim to stimulate a discussion on the design\nof generic, universal interfaces for XR.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:47:09 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Knierim","Pascal",""],["Kosch","Thomas",""]]}
{"id":"2308.11601","submitter":"Surya Narayanan Hari","authors":"Surya Narayanan Hari, Matt Thomson","title":"Tryage: Real-time, intelligent Routing of User Prompts to Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The introduction of the transformer architecture and the self-attention\nmechanism has led to an explosive production of language models trained on\nspecific downstream tasks and data domains. With over 200, 000 models in the\nHugging Face ecosystem, users grapple with selecting and optimizing models to\nsuit multifaceted workflows and data domains while addressing computational,\nsecurity, and recency concerns. There is an urgent need for machine learning\nframeworks that can eliminate the burden of model selection and customization\nand unleash the incredible power of the vast emerging model library for end\nusers. Here, we propose a context-aware routing system, Tryage, that leverages\na language model router for optimal selection of expert models from a model\nlibrary based on analysis of individual input prompts. Inspired by the thalamic\nrouter in the brain, Tryage employs a perceptive router to predict down-stream\nmodel performance on prompts and, then, makes a routing decision using an\nobjective function that integrates performance predictions with user goals and\nconstraints that are incorporated through flags (e.g., model size, model\nrecency). Tryage allows users to explore a Pareto front and automatically\ntrade-off between task accuracy and secondary goals including minimization of\nmodel size, recency, security, verbosity, and readability. Across heterogeneous\ndata sets that include code, text, clinical data, and patents, the Tryage\nframework surpasses Gorilla and GPT3.5 turbo in dynamic model selection\nidentifying the optimal model with an accuracy of 50.9% , compared to 23.6% by\nGPT 3.5 Turbo and 10.8% by Gorilla. Conceptually, Tryage demonstrates how\nrouting models can be applied to program and control the behavior of\nmulti-model LLM systems to maximize efficient use of the expanding and evolving\nlanguage model ecosystem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:48:24 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 17:34:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hari","Surya Narayanan",""],["Thomson","Matt",""]]}
{"id":"2308.11602","submitter":"Baian Liu","authors":"Baian Liu","title":"Extremal factorization lengths of elements in commutative, cancellative\n  semigroups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a numerical semigroup $S := \\langle n_1, \\dots, n_k \\rangle$ with minimal\ngenerators $n_1 < \\cdots < n_k$, Barron, O'Neill, and Pelayo showed that\n$L(s+n_1) = L(s) + 1$ and $\\ell(s+n_k) = \\ell(s) + 1$ for all sufficiently\nlarge $s \\in S$, where $L(s)$ and $\\ell(s)$ are the longest and shortest\nfactorization lengths of $s \\in S$, respectively. For some numerical\nsemigroups, $L(s+n_1) = L(s) + 1$ for all $s \\in S$ or $\\ell(s+n_k) = \\ell(s) +\n1$ for all $s \\in S$. In a general commutative, cancellative semigroup $S$, it\nis also possible to have $L(s+m) = L(s) + 1$ for some atom $m$ and all $s \\in\nS$ or to have $\\ell(s+m) = \\ell(s) + 1$ for some atom $m$ and all $s \\in S$. We\ndetermine necessary and sufficient conditions for these two phenomena. We then\ngeneralize the notions of Kunz posets and Kunz polytopes. Each integer point on\na Kunz polytope corresponds to a commutative, cancellative semigroup. We\ndetermine which integer points on a given Kunz polytope correspond to semigroup\nin which $L(s+m) = L(s) + 1$ for all $s$ and similarly which integer points\nyield semigroups for which $\\ell(s+m) = \\ell(s) + 1$ for all $s$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:48:59 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Liu","Baian",""]]}
{"id":"2308.11603","submitter":"Lawk Mineh","authors":"Lawk Mineh, Davide Spriano","title":"Separability in Morse local-to-global groups","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that in a Morse local-to-global group where stable subgroups are\nseparable, the product of any stable subgroups is separable. As an application,\nwe show that the product of stable subgroups in virtually special groups is\nseparable.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:49:06 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mineh","Lawk",""],["Spriano","Davide",""]]}
{"id":"2308.11604","submitter":"Matin Mortaheb","authors":"Matin Mortaheb, Mohammad A. Amir Khojastepour, Srimat T. Chakradhar,\n  Sennur Ulukus","title":"Semantic Multi-Resolution Communications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning based joint source-channel coding (JSCC) has demonstrated\nsignificant advancements in data reconstruction compared to separate\nsource-channel coding (SSCC). This superiority arises from the suboptimality of\nSSCC when dealing with finite block-length data. Moreover, SSCC falls short in\nreconstructing data in a multi-user and/or multi-resolution fashion, as it only\ntries to satisfy the worst channel and/or the highest quality data. To overcome\nthese limitations, we propose a novel deep learning multi-resolution JSCC\nframework inspired by the concept of multi-task learning (MTL). This proposed\nframework excels at encoding data for different resolutions through\nhierarchical layers and effectively decodes it by leveraging both current and\npast layers of encoded data. Moreover, this framework holds great potential for\nsemantic communication, where the objective extends beyond data reconstruction\nto preserving specific semantic attributes throughout the communication\nprocess. These semantic features could be crucial elements such as class\nlabels, essential for classification tasks, or other key attributes that\nrequire preservation. Within this framework, each level of encoded data can be\ncarefully designed to retain specific data semantics. As a result, the\nprecision of a semantic classifier can be progressively enhanced across\nsuccessive layers, emphasizing the preservation of targeted semantics\nthroughout the encoding and decoding stages. We conduct experiments on MNIST\nand CIFAR10 dataset. The experiment with both datasets illustrates that our\nproposed method is capable of surpassing the SSCC method in reconstructing data\nwith different resolutions, enabling the extraction of semantic features with\nheightened confidence in successive layers. This capability is particularly\nadvantageous for prioritizing and preserving more crucial semantic features\nwithin the datasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:52:44 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Mortaheb","Matin",""],["Khojastepour","Mohammad A. Amir",""],["Chakradhar","Srimat T.",""],["Ulukus","Sennur",""]]}
{"id":"2308.11605","submitter":"Mainak Singha","authors":"Mainak Singha, Ankit Jha, Biplab Banerjee","title":"GOPro: Generate and Optimize Prompts in CLIP using Self-Supervised\n  Learning","comments":"Accepted at BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale foundation models, such as CLIP, have demonstrated remarkable\nsuccess in visual recognition tasks by embedding images in a semantically rich\nspace. Self-supervised learning (SSL) has also shown promise in improving\nvisual recognition by learning invariant features. However, the combination of\nCLIP with SSL is found to face challenges due to the multi-task framework that\nblends CLIP's contrastive loss and SSL's loss, including difficulties with loss\nweighting and inconsistency among different views of images in CLIP's output\nspace. To overcome these challenges, we propose a prompt learning-based model\ncalled GOPro, which is a unified framework that ensures similarity between\nvarious augmented views of input images in a shared image-text embedding space,\nusing a pair of learnable image and text projectors atop CLIP, to promote\ninvariance and generalizability. To automatically learn such prompts, we\nleverage the visual content and style primitives extracted from pre-trained\nCLIP and adapt them to the target task. In addition to CLIP's cross-domain\ncontrastive loss, we introduce a visual contrastive loss and a novel prompt\nconsistency loss, considering the different views of the images. GOPro is\ntrained end-to-end on all three loss objectives, combining the strengths of\nCLIP and SSL in a principled manner. Empirical evaluations demonstrate that\nGOPro outperforms the state-of-the-art prompting techniques on three\nchallenging domain generalization tasks across multiple benchmarks by a\nsignificant margin. Our code is available at\nhttps://github.com/mainaksingha01/GOPro.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:53:26 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Singha","Mainak",""],["Jha","Ankit",""],["Banerjee","Biplab",""]]}
{"id":"2308.11606","submitter":"Emanuele Bugliarello","authors":"Emanuele Bugliarello, Hernan Moraldo, Ruben Villegas, Mohammad\n  Babaeizadeh, Mohammad Taghi Saffar, Han Zhang, Dumitru Erhan, Vittorio\n  Ferrari, Pieter-Jan Kindermans, Paul Voigtlaender","title":"StoryBench: A Multifaceted Benchmark for Continuous Story Visualization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generating video stories from text prompts is a complex task. In addition to\nhaving high visual quality, videos need to realistically adhere to a sequence\nof text prompts whilst being consistent throughout the frames. Creating a\nbenchmark for video generation requires data annotated over time, which\ncontrasts with the single caption used often in video datasets. To fill this\ngap, we collect comprehensive human annotations on three existing datasets, and\nintroduce StoryBench: a new, challenging multi-task benchmark to reliably\nevaluate forthcoming text-to-video models. Our benchmark includes three video\ngeneration tasks of increasing difficulty: action execution, where the next\naction must be generated starting from a conditioning video; story\ncontinuation, where a sequence of actions must be executed starting from a\nconditioning video; and story generation, where a video must be generated from\nonly text prompts. We evaluate small yet strong text-to-video baselines, and\nshow the benefits of training on story-like data algorithmically generated from\nexisting video captions. Finally, we establish guidelines for human evaluation\nof video stories, and reaffirm the need of better automatic metrics for video\ngeneration. StoryBench aims at encouraging future research efforts in this\nexciting new area.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:53:55 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Bugliarello","Emanuele",""],["Moraldo","Hernan",""],["Villegas","Ruben",""],["Babaeizadeh","Mohammad",""],["Saffar","Mohammad Taghi",""],["Zhang","Han",""],["Erhan","Dumitru",""],["Ferrari","Vittorio",""],["Kindermans","Pieter-Jan",""],["Voigtlaender","Paul",""]]}
{"id":"2308.11607","submitter":"Kuan-Chih Huang","authors":"Kuan-Chih Huang, Ming-Hsuan Yang, Yi-Hsuan Tsai","title":"Delving into Motion-Aware Matching for Monocular 3D Object Tracking","comments":"Accepted by ICCV 2023. Code is available at\n  https://github.com/kuanchihhuang/MoMA-M3T","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances of monocular 3D object detection facilitate the 3D\nmulti-object tracking task based on low-cost camera sensors. In this paper, we\nfind that the motion cue of objects along different time frames is critical in\n3D multi-object tracking, which is less explored in existing monocular-based\napproaches. In this paper, we propose a motion-aware framework for monocular 3D\nMOT. To this end, we propose MoMA-M3T, a framework that mainly consists of\nthree motion-aware components. First, we represent the possible movement of an\nobject related to all object tracklets in the feature space as its motion\nfeatures. Then, we further model the historical object tracklet along the time\nframe in a spatial-temporal perspective via a motion transformer. Finally, we\npropose a motion-aware matching module to associate historical object tracklets\nand current observations as final tracking results. We conduct extensive\nexperiments on the nuScenes and KITTI datasets to demonstrate that our MoMA-M3T\nachieves competitive performance against state-of-the-art methods. Moreover,\nthe proposed tracker is flexible and can be easily plugged into existing\nimage-based 3D object detectors without re-training. Code and models are\navailable at https://github.com/kuanchihhuang/MoMA-M3T.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:53:58 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Huang","Kuan-Chih",""],["Yang","Ming-Hsuan",""],["Tsai","Yi-Hsuan",""]]}
{"id":"2308.11608","submitter":"Zhaodi Pan","authors":"Z. Pan, F. Bianchini, W. L. K. Wu, P. A. R. Ade, Z. Ahmed, E. Anderes,\n  A. J. Anderson, B. Ansarinejad, M. Archipley, K. Aylor, L. Balkenhol, P. S.\n  Barry, R. Basu Thakur, K. Benabed, A. N. Bender, B. A. Benson, L. E. Bleem,\n  F. R. Bouchet, L. Bryant, K. Byrum, E. Camphuis, J. E. Carlstrom, F. W.\n  Carter, T. W. Cecil, C. L. Chang, P. Chaubal, G. Chen, P. M. Chichura, H.-M.\n  Cho, T.-L. Chou, J.-F. Cliche, A. Coerver, T. M. Crawford, A. Cukierman, C.\n  Daley, T. de Haan, E. V. Denison, K. R. Dibert, J. Ding, M. A. Dobbs, A.\n  Doussot, D. Dutcher, W. Everett, C. Feng, K. R. Ferguson, K. Fichman, A.\n  Foster, J. Fu, S. Galli, A. E. Gambrel, R. W. Gardner, F. Ge, N.\n  Goeckner-Wald, R. Gualtieri, F. Guidi, S. Guns, N. Gupta, N. W. Halverson, A.\n  H. Harke-Hosemann, N. L. Harrington, J. W. Henning, G. C. Hilton, E. Hivon,\n  G. P. Holder, W. L. Holzapfel, J. C. Hood, D. Howe, N. Huang, K. D. Irwin, O.\n  Jeong, M. Jonas, A. Jones, F. K\\'eruzor\\'e, T. S. Khaire, L. Knox, A. M.\n  Kofman, M. Korman, D. L. Kubik, S. Kuhlmann, C.-L. Kuo, A. T. Lee, E. M.\n  Leitch, K. Levy, A. E. Lowitz, C. Lu, A. Maniyar, F. Menanteau, S. S. Meyer,\n  D. Michalik, M. Millea, J. Montgomery, A. Nadolski, Y. Nakato, T. Natoli, H.\n  Nguyen, G. I. Noble, V. Novosad, Y. Omori, S. Padin, P. Paschos, J. Pearson,\n  C. M. Posada, K. Prabhu, W. Quan, S. Raghunathan, M. Rahimi, A. Rahlin, C. L.\n  Reichardt, D. Riebel, B. Riedel, J. E. Ruhl, J. T. Sayre, E. Schiappucci, E.\n  Shirokoff, G. Smecher, J. A. Sobrin, A. A. Stark, J. Stephen, K. T. Story, A.\n  Suzuki, S. Takakura, C. Tandoi, K. L. Thompson, B. Thorne, C. Trendafilova,\n  C. Tucker, C. Umilta, L. R. Vale, K. Vanderlinde, J. D. Vieira, G. Wang, N.\n  Whitehorn, V. Yefremenko, K. W. Yoon, M. R. Young, J. A. Zebrowski","title":"A Measurement of Gravitational Lensing of the Cosmic Microwave\n  Background Using SPT-3G 2018 Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a measurement of gravitational lensing over 1500 deg$^2$ of the\nSouthern sky using SPT-3G temperature data at 95 and 150 GHz taken in 2018. The\nlensing amplitude relative to a fiducial Planck 2018 $\\Lambda$CDM cosmology is\nfound to be $1.020\\pm0.060$, excluding instrumental and astrophysical\nsystematic uncertainties. We conduct extensive systematic and null tests to\ncheck the robustness of the lensing measurements, and report a minimum-variance\ncombined lensing power spectrum over angular multipoles of $50<L<2000$, which\nwe use to constrain cosmological models. When analyzed alone and jointly with\nprimary cosmic microwave background (CMB) spectra within the $\\Lambda$CDM\nmodel, our lensing amplitude measurements are consistent with measurements from\nSPT-SZ, SPTpol, ACT, and Planck. Incorporating loose priors on the baryon\ndensity and other parameters including uncertainties on a foreground bias\ntemplate, we obtain a $1\\sigma$ constraint on $\\sigma_8 \\Omega_{\\rm\nm}^{0.25}=0.595 \\pm 0.026$ using the SPT-3G 2018 lensing data alone, where\n$\\sigma_8$ is a common measure of the amplitude of structure today and\n$\\Omega_{\\rm m}$ is the matter density parameter. Combining SPT-3G 2018 lensing\nmeasurements with baryon acoustic oscillation (BAO) data, we derive parameter\nconstraints of $\\sigma_8 = 0.810 \\pm 0.033$, $S_8 \\equiv \\sigma_8(\\Omega_{\\rm\nm}/0.3)^{0.5}= 0.836 \\pm 0.039$, and Hubble constant $H_0 =68.8^{+1.3}_{-1.6}$\nkm s$^{-1}$ Mpc$^{-1}$. Using CMB anisotropy and lensing measurements from\nSPT-3G only, we provide independent constraints on the spatial curvature of\n$\\Omega_{K} = 0.014^{+0.023}_{-0.026}$ (95% C.L.) and the dark energy density\nof $\\Omega_\\Lambda = 0.722^{+0.031}_{-0.026}$ (68% C.L.). When combining SPT-3G\nlensing data with SPT-3G CMB anisotropy and BAO data, we find an upper limit on\nthe sum of the neutrino masses of $\\sum m_{\\nu}< 0.30$ eV (95% C.L.).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:54:49 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Pan","Z.",""],["Bianchini","F.",""],["Wu","W. L. K.",""],["Ade","P. A. R.",""],["Ahmed","Z.",""],["Anderes","E.",""],["Anderson","A. J.",""],["Ansarinejad","B.",""],["Archipley","M.",""],["Aylor","K.",""],["Balkenhol","L.",""],["Barry","P. S.",""],["Thakur","R. Basu",""],["Benabed","K.",""],["Bender","A. N.",""],["Benson","B. A.",""],["Bleem","L. E.",""],["Bouchet","F. R.",""],["Bryant","L.",""],["Byrum","K.",""],["Camphuis","E.",""],["Carlstrom","J. E.",""],["Carter","F. W.",""],["Cecil","T. W.",""],["Chang","C. L.",""],["Chaubal","P.",""],["Chen","G.",""],["Chichura","P. M.",""],["Cho","H. -M.",""],["Chou","T. -L.",""],["Cliche","J. -F.",""],["Coerver","A.",""],["Crawford","T. M.",""],["Cukierman","A.",""],["Daley","C.",""],["de Haan","T.",""],["Denison","E. V.",""],["Dibert","K. R.",""],["Ding","J.",""],["Dobbs","M. A.",""],["Doussot","A.",""],["Dutcher","D.",""],["Everett","W.",""],["Feng","C.",""],["Ferguson","K. R.",""],["Fichman","K.",""],["Foster","A.",""],["Fu","J.",""],["Galli","S.",""],["Gambrel","A. E.",""],["Gardner","R. W.",""],["Ge","F.",""],["Goeckner-Wald","N.",""],["Gualtieri","R.",""],["Guidi","F.",""],["Guns","S.",""],["Gupta","N.",""],["Halverson","N. W.",""],["Harke-Hosemann","A. H.",""],["Harrington","N. L.",""],["Henning","J. W.",""],["Hilton","G. C.",""],["Hivon","E.",""],["Holder","G. P.",""],["Holzapfel","W. L.",""],["Hood","J. C.",""],["Howe","D.",""],["Huang","N.",""],["Irwin","K. D.",""],["Jeong","O.",""],["Jonas","M.",""],["Jones","A.",""],["K\u00e9ruzor\u00e9","F.",""],["Khaire","T. S.",""],["Knox","L.",""],["Kofman","A. M.",""],["Korman","M.",""],["Kubik","D. L.",""],["Kuhlmann","S.",""],["Kuo","C. -L.",""],["Lee","A. T.",""],["Leitch","E. M.",""],["Levy","K.",""],["Lowitz","A. E.",""],["Lu","C.",""],["Maniyar","A.",""],["Menanteau","F.",""],["Meyer","S. S.",""],["Michalik","D.",""],["Millea","M.",""],["Montgomery","J.",""],["Nadolski","A.",""],["Nakato","Y.",""],["Natoli","T.",""],["Nguyen","H.",""],["Noble","G. I.",""],["Novosad","V.",""],["Omori","Y.",""],["Padin","S.",""],["Paschos","P.",""],["Pearson","J.",""],["Posada","C. M.",""],["Prabhu","K.",""],["Quan","W.",""],["Raghunathan","S.",""],["Rahimi","M.",""],["Rahlin","A.",""],["Reichardt","C. L.",""],["Riebel","D.",""],["Riedel","B.",""],["Ruhl","J. E.",""],["Sayre","J. T.",""],["Schiappucci","E.",""],["Shirokoff","E.",""],["Smecher","G.",""],["Sobrin","J. A.",""],["Stark","A. A.",""],["Stephen","J.",""],["Story","K. T.",""],["Suzuki","A.",""],["Takakura","S.",""],["Tandoi","C.",""],["Thompson","K. L.",""],["Thorne","B.",""],["Trendafilova","C.",""],["Tucker","C.",""],["Umilta","C.",""],["Vale","L. R.",""],["Vanderlinde","K.",""],["Vieira","J. D.",""],["Wang","G.",""],["Whitehorn","N.",""],["Yefremenko","V.",""],["Yoon","K. W.",""],["Young","M. R.",""],["Zebrowski","J. A.",""]]}
{"id":"2308.11609","submitter":"Seiji Fujimoto","authors":"Seiji Fujimoto, Bingjie Wang, John Weaver, Vasily Kokorev, Hakim Atek,\n  Rachel Bezanson, Ivo Labbe, Gabriel Brammer, Jenny E. Greene, Iryna\n  Chemerynska, Pratika Dayal, Anna de Graaff, Lukas J. Furtak, Pascal A. Oesch,\n  David J. Setton, Sedona H. Price, Tim B. Miller, Christina C. Williams,\n  Katherine E. Whitaker, Adi Zitrin, Sam E. Cutler, Joel Leja, Richard Pan, Dan\n  Coe, Pieter van Dokkum, Robert Feldmann, Yoshinobu Fudamoto, Andy D.\n  Goulding, Gourav Khullar, Danilo Marchesini, Michael Maseda, Themiya\n  Nanayakkara, Erica J. Nelson, Renske Smit, Mauro Stefanon, and Andrea Weibel","title":"UNCOVER: A NIRSpec Census of Lensed Galaxies at z=8.50-13.08 Probing a\n  High AGN Fraction and Ionized Bubbles in the Shadow","comments":"27 pages, 11 figures, 4 tables, submitted to ApJ (See also\n  arXiv:2308.11610)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present JWST NIRSpec prism spectroscopy of gravitationally lensed galaxies\nat $z\\gtrsim9$ found behind the massive galaxy cluster Abell 2744 in the\nUNCOVER Cycle 1 Treasury Program. We confirm the source redshift via emission\nlines and/or the Ly$\\alpha$ break feature for ten galaxies at z=8.50-13.08 down\nto $M_{\\rm UV}=-17.3$. We achieve a high confirmation rate of 100\\% for $z>9$\ncandidates reported in Atek et al. (2023). Using six sources with multiple\nemission line detections, we find that the offset of the redshift estimates\nbetween the lines and the Ly$\\alpha$ break alone with prism can be as large as\n$\\pm0.2$, raising caution in designing future follow-up spectroscopy for the\nbreak-only sources. With spec-$z$ confirmed sources in UNCOVER and the\nliterature, we derive lower limits on the rest-frame ultraviolet (UV)\nluminosity function (LF) at $z\\simeq9$-12 and find these lower limits to be\nconsistent with recent photometric measurements. We identify at least two\nunambiguous and several possible active galactic nucleus (AGN) systems based on\nX-ray emission, broad line (BL) H$\\beta$, high ionization line (e.g., NIV]1487,\nCIV1549) detections, and excess in UVLF. This requires the AGN LFs at $z\\simeq$\n9-10 to be comparable or even higher than the X-ray AGN LF estimated at\n$z\\sim6$ and indicates a plausible cause of the high abundance of $z>9$\ngalaxies claimed in recent photometric studies may be AGNs. One UV-luminous\nsource is confirmed at the same redshift as a dusty BL AGN at $z=8.50$ with a\nphysical separation of 380 kpc in the source plane. These two sources show\nblueward Ly$\\alpha$ line or continuum emission, suggesting that they reside in\nthe same ionized bubble with a radius of $7.69\\pm0.18$ pMpc. Our results imply\nthat AGNs have a non-negligible contribution to cosmic reionization.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:54:56 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:55:29 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 17:11:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fujimoto","Seiji",""],["Wang","Bingjie",""],["Weaver","John",""],["Kokorev","Vasily",""],["Atek","Hakim",""],["Bezanson","Rachel",""],["Labbe","Ivo",""],["Brammer","Gabriel",""],["Greene","Jenny E.",""],["Chemerynska","Iryna",""],["Dayal","Pratika",""],["de Graaff","Anna",""],["Furtak","Lukas J.",""],["Oesch","Pascal A.",""],["Setton","David J.",""],["Price","Sedona H.",""],["Miller","Tim B.",""],["Williams","Christina C.",""],["Whitaker","Katherine E.",""],["Zitrin","Adi",""],["Cutler","Sam E.",""],["Leja","Joel",""],["Pan","Richard",""],["Coe","Dan",""],["van Dokkum","Pieter",""],["Feldmann","Robert",""],["Fudamoto","Yoshinobu",""],["Goulding","Andy D.",""],["Khullar","Gourav",""],["Marchesini","Danilo",""],["Maseda","Michael",""],["Nanayakkara","Themiya",""],["Nelson","Erica J.",""],["Smit","Renske",""],["Stefanon","Mauro",""],["Weibel","Andrea",""]]}
{"id":"2308.11610","submitter":"Vasily Kokorev","authors":"Vasily Kokorev, Seiji Fujimoto, Ivo Labbe, Jenny E. Greene, Rachel\n  Bezanson, Pratika Dayal, Erica J. Nelson, Hakim Atek, Gabriel Brammer, Karina\n  I. Caputi, Iryna Chemerynska, Sam E. Cutler, Robert Feldmann, Yoshinobu\n  Fudamoto, Lukas J. Furtak, Andy D. Goulding, Anna de Graaff, Joel Leja,\n  Danilo Marchesini, Tim B. Miller, Themiya Nanayakkara, Pascal Oesch, Richard\n  Pan, Sedona H. Price, David J. Setton, Renske Smit, Mauro Stefanon, Bingjie\n  Wang, John R. Weaver, Katherine E. Whitaker, Christina C. Williams, Adi\n  Zitrin","title":"UNCOVER: A NIRSpec Identification of a Broad Line AGN at z = 8.50","comments":"14 pages, 6 figures, 2 tables. Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep observations with JWST have revealed an emerging population of red\npoint-like sources that could provide a link between the postulated\nsupermassive black hole seeds and observed quasars. In this work we present a\nJWST/NIRSpec spectrum from the JWST Cycle 1 UNCOVER Treasury survey, of a\nmassive accreting black hole at $z=8.50$, displaying a clear broad-line\ncomponent as inferred from the H$\\beta$ line with FWHM = $3439\\pm413$ km\ns$^{-1}$, typical of the broad line region of an active galactic nucleus (AGN).\nThe AGN nature of this object is further supported by high ionization, as\ninferred from emission lines, and a point-source morphology. We compute the\nblack hole mass of log$_{10}(M_{\\rm BH}/M_\\odot)=8.17\\pm0.42$, and a bolometric\nluminosity of $L_{\\rm bol}\\sim6.6\\times10^{45}$ erg s$^{-1}$. These values\nimply that our object is accreting at $\\sim 40\\%$ of the Eddington limit.\nDetailed modeling of the spectral energy distribution in the optical and\nnear-infrared, together with constraints from ALMA, indicate an upper limit on\nthe stellar mass of log$_{10}(M_{\\rm *}/M_\\odot)<8.7$, which would lead to an\nunprecedented ratio of black hole to host mass of at least $\\sim 30 \\%$. This\nis orders of magnitude higher compared to the local QSOs, but is consistent\nwith recent AGN studies at high redshift with JWST. This finding suggests that\na non-negligible fraction of supermassive black holes either started out from\nmassive seeds and/or grew at a super-Eddington rate at high redshift. Given the\npredicted number densities of high-$z$ faint AGN, future NIRSpec observations\nof larger samples will allow us to further investigate the galaxy-black hole\nco-evolution in the early Universe.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:55:02 GMT"},{"version":"v2","created":"Wed, 23 Aug 2023 08:51:37 GMT"},{"version":"v3","created":"Fri, 25 Aug 2023 17:43:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kokorev","Vasily",""],["Fujimoto","Seiji",""],["Labbe","Ivo",""],["Greene","Jenny E.",""],["Bezanson","Rachel",""],["Dayal","Pratika",""],["Nelson","Erica J.",""],["Atek","Hakim",""],["Brammer","Gabriel",""],["Caputi","Karina I.",""],["Chemerynska","Iryna",""],["Cutler","Sam E.",""],["Feldmann","Robert",""],["Fudamoto","Yoshinobu",""],["Furtak","Lukas J.",""],["Goulding","Andy D.",""],["de Graaff","Anna",""],["Leja","Joel",""],["Marchesini","Danilo",""],["Miller","Tim B.",""],["Nanayakkara","Themiya",""],["Oesch","Pascal",""],["Pan","Richard",""],["Price","Sedona H.",""],["Setton","David J.",""],["Smit","Renske",""],["Stefanon","Mauro",""],["Wang","Bingjie",""],["Weaver","John R.",""],["Whitaker","Katherine E.",""],["Williams","Christina C.",""],["Zitrin","Adi",""]]}
{"id":"2308.11611","submitter":"David T. Nguyen","authors":"David T. Nguyen","title":"A translation of N.M. Katz's \"Exponential Sums\"","comments":"arXiv admin comment: This version has been removed by arXiv\n  administrators as the submitter did not have the rights to agree to the\n  license at the time of submission","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  These notes are devoted to the theory of exponential sums over finite fields.\nThe first chapter recalls some of the number-theoretic interest of such sums.\nThe second chapter discusses the $L$-functions attached to such sums, the \"Weil\nconjectures\" for these $L$-functions as established by Deligne, andthe\nconsequences for the exponential sums themselves. The third chapter is devoted\nto the cohomological interpretation of exponential sums and of their associated\n$L$-functions. These first three chapters are largely of an expository nature.\n  The main results are found in chapters four and five. Chapter four is devoted\nto theorems of uniformity \"for almost all $p$\" for the cohomological structure\nof quite general exponential sums. Chapter five is devoted to a precise\nanalysis of the cohomological structure of certain specific classes of\nexponential sums for which the associated algebro-geometric situation is\nespecially attractive.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 18:18:40 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Nguyen","David T.",""]]}
{"id":"2308.11612","submitter":"Gino Isidori","authors":"Gino Isidori","title":"Flavor physics beyond the Standard Model and the Kobayashi-Maskawa\n  legacy","comments":"17 pages, based on the talk given at the KM50 Symposium (KEK,\n  February 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Kobayashi-Maskawa (KM) hypothesis about the existence of a third\ngeneration of quarks represents a cornerstone of the Standard Model (SM). Fifty\nyears after this seminal paper, flavor physics continues to represent a\nprivileged observatory on physics occurring at high energy scales. In this\npaper I first review this statement using general effective-theory arguments,\nhighlighting some interesting modern lessons from the KM paper. I then discuss\nsome novel extensions of the SM based on the concept of flavor deconstruction:\nthe hypothesis that gauge interactions are manifestly flavor non universal in\nthe ultraviolet. The phenomenological consequences of this class of models are\nalso briefly illustrated.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:56:12 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Isidori","Gino",""]]}
{"id":"2308.11613","submitter":"Alexey Pokrovskiy","authors":"Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy, Benny\n  Sudakov","title":"Ascending Subgraph Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A typical theme for many well-known decomposition problems is to show that\nsome obvious necessary conditions for decomposing a graph $G$ into copies $H_1,\n\\ldots, H_m$ are also sufficient. One such problem was posed in 1987, by Alavi,\nBoals, Chartrand, Erd\\H{o}s, and Oellerman. They conjectured that the edges of\nevery graph with $\\binom{m+1}2$ edges can be decomposed into subgraphs $H_1,\n\\dots, H_m$ such that each $H_i$ has $i$ edges and is isomorphic to a subgraph\nof $H_{i+1}$. In this paper we prove this conjecture for sufficiently large\n$m$.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:58:11 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Katsamaktsis","Kyriakos",""],["Letzter","Shoham",""],["Pokrovskiy","Alexey",""],["Sudakov","Benny",""]]}
{"id":"2308.11614","submitter":"Ruoshi Jiang","authors":"Ruoshi Jiang, Jinning Hou, Zhiyu Fan, Zi-Jian Lang and Wei Ku","title":"Pressure driven screening of Ni spin results in cuprate-like high-$T_c$\n  superconductivity in La$_3$Ni$_2$O$_7$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Beyond 14GPa of pressure, bi-layered La$_3$Ni$_2$O$_7$ was recently found to\ndevelop strong superconductivity above the liquid nitrogen boiling temperature.\nAn immediate essential question is the pressure-induced qualitative change of\nelectronic structure that enables the exciting high-temperature\nsuperconductivity. We investigate this timely question via a numerical\nmulti-scale derivation of effective many-body physics. At the atomic scale, we\nfirst clarify that the system has a strong charge transfer nature with\nitinerant carriers residing mainly in the in-plane oxygen between spin-1\nNi$^{2+}$ ions. We then elucidate in eV- and sub-eV-scale the key physical\neffect of the applied pressure: It induces a cuprate-like electronic structure\nthrough partially screening the Ni spin from 1 to 1/2. This suggests a\nhigh-temperature superconductivity in La$_3$Ni$_2$O$_7$ with microscopic\nmechanism and ($d$-wave) symmetry similar to that in the cuprates.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:58:23 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Jiang","Ruoshi",""],["Hou","Jinning",""],["Fan","Zhiyu",""],["Lang","Zi-Jian",""],["Ku","Wei",""]]}
{"id":"2308.11615","submitter":"Benjamin Lev","authors":"Kangning Yang, Yicheng Zhang, Kuan-Yu Li, Kuan-Yu Lin, Sarang\n  Gopalakrishnan, Marcos Rigol, Benjamin L. Lev","title":"Phantom energy of a quenched, prethermal quantum many-body scar state","comments":"5 pages, 4 figures with 15-page supplement including 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Strongly interacting quantum systems can exhibit emergent excitations that\ndiffer qualitatively from their microscopic degrees of freedom. Here we study\nan emergent phenomenon that is intrinsic to such systems far from equilibrium:\nNamely, the transmutation of attractive interactions into repulsive\ninteractions. We initialize an attractively interacting Bose gas in a highly\nexcited and correlated nonthermal state, quench the confining potential, and\nmeasure how the kinetic and total energies evolve after the quench. Although\nthe bare interactions are attractive, the low-energy degrees of freedom evolve\nas if they repel each other: Thus, their kinetic energy paradoxically decreases\nas the gas is compressed. We quantify the missing ``phantom'' energy by\nbenchmarking our experimental results against generalized hydrodynamics (GHD)\ncalculations. We present evidence that the missing kinetic energy is stored in\nvery high-momentum modes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:37 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Yang","Kangning",""],["Zhang","Yicheng",""],["Li","Kuan-Yu",""],["Lin","Kuan-Yu",""],["Gopalakrishnan","Sarang",""],["Rigol","Marcos",""],["Lev","Benjamin L.",""]]}
{"id":"2308.11616","submitter":"Andi Gu","authors":"Andi Gu, Hong-Ye Hu, Di Luo, Taylor L. Patti, Nicholas C. Rubin,\n  Susanne F. Yelin","title":"Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"MIT-CTP/5583","categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a comprehensive approach to quantum simulations at both zero and\nfinite temperatures, employing a quantum information theoretic perspective and\nutilizing the Clifford + $k$Rz transformations. We introduce the \"quantum magic\nladder\", a natural hierarchy formed by systematically augmenting Clifford\ntransformations with the addition of Rz gates. These classically simulable\nsimilarity transformations allow us to reduce the quantumness of our system,\nconserving vital quantum resources. This reduction in quantumness is essential,\nas it simplifies the Hamiltonian and shortens physical circuit-depth,\novercoming constraints imposed by limited error correction. We improve the\nperformance of both digital and analog quantum computers on ground state and\nfinite temperature molecular simulations, not only outperforming the\nHartree-Fock solution, but also achieving consistent improvements as we ascend\nthe quantum magic ladder. By facilitating more efficient quantum simulations,\nour approach enables near-term and early fault-tolerant quantum computers to\naddress novel challenges in quantum chemistry.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:41 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Gu","Andi",""],["Hu","Hong-Ye",""],["Luo","Di",""],["Patti","Taylor L.",""],["Rubin","Nicholas C.",""],["Yelin","Susanne F.",""]]}
{"id":"2308.11617","submitter":"Omid Taheri","authors":"Omid Taheri, Yi Zhou, Dimitrios Tzionas, Yang Zhou, Duygu Ceylan,\n  Soren Pirk, Michael J. Black","title":"GRIP: Generating Interaction Poses Using Latent Consistency and Spatial\n  Cues","comments":"The project has been started during Omid Taheri's internship at Adobe\n  and as a collaboration with the Max Planck Institute for Intelligent Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hands are dexterous and highly versatile manipulators that are central to how\nhumans interact with objects and their environment. Consequently, modeling\nrealistic hand-object interactions, including the subtle motion of individual\nfingers, is critical for applications in computer graphics, computer vision,\nand mixed reality. Prior work on capturing and modeling humans interacting with\nobjects in 3D focuses on the body and object motion, often ignoring hand pose.\nIn contrast, we introduce GRIP, a learning-based method that takes, as input,\nthe 3D motion of the body and the object, and synthesizes realistic motion for\nboth hands before, during, and after object interaction. As a preliminary step\nbefore synthesizing the hand motion, we first use a network, ANet, to denoise\nthe arm motion. Then, we leverage the spatio-temporal relationship between the\nbody and the object to extract two types of novel temporal interaction cues,\nand use them in a two-stage inference pipeline to generate the hand motion. In\nthe first stage, we introduce a new approach to enforce motion temporal\nconsistency in the latent space (LTC), and generate consistent interaction\nmotions. In the second stage, GRIP generates refined hand poses to avoid\nhand-object penetrations. Given sequences of noisy body and object motion, GRIP\nupgrades them to include hand-object interaction. Quantitative experiments and\nperceptual studies demonstrate that GRIP outperforms baseline methods and\ngeneralizes to unseen objects and motions from different motion-capture\ndatasets.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:51 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Taheri","Omid",""],["Zhou","Yi",""],["Tzionas","Dimitrios",""],["Zhou","Yang",""],["Ceylan","Duygu",""],["Pirk","Soren",""],["Black","Michael J.",""]]}
{"id":"2308.11618","submitter":"Adam Smercina","authors":"Adam Smercina, Julianne J. Dalcanton, Benjamin F. Williams, Meredith\n  J. Durbin, Margaret Lazzarini, Eric F. Bell, Yumi Choi, Andrew Dolphin,\n  Karoline Gilbert, Puragra Guhathakurta, Eric W. Koch, Hans-Walter Rix, Erik\n  Rosolowsky, Anil Seth, Evan D. Skillman, Daniel R. Weisz","title":"The Panchromatic Hubble Andromeda Treasury: Triangulum Extended Region\n  (PHATTER). V. The Structure of M33 in Resolved Stellar Populations","comments":"31 pages, 17 figures, 5 tables, Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a detailed analysis of the the structure of the Local Group\nflocculent spiral galaxy M33, as measured using the Panchromatic Hubble\nAndromeda Treasury Triangulum Extended Region (PHATTER) survey. Leveraging the\nmultiwavelength coverage of PHATTER, we find that the oldest populations are\ndominated by a smooth exponential disk with two distinct spiral arms and a\nclassical central bar $-$ completely distinct from what is seen in broadband\noptical imaging, and the first-ever confirmation of a bar in M33. We estimate a\nbar extent of $\\sim$1 kpc. The two spiral arms are asymmetric in orientation\nand strength, and likely represent the innermost impact of the recent tidal\ninteraction responsible for M33's warp at larger scales. The flocculent\nmulti-armed morphology for which M33 is known is only visible in the young\nupper main sequence population, which closely tracks the morphology of the ISM.\nWe investigate the stability of M33's disk, finding $Q{\\sim}1$ over the\nmajority of the disk. We fit multiple components to the old stellar density\ndistribution and find that, when considering recent stellar kinematics, M33's\nbulk structure favors the inclusion of an accreted halo component, modeled as a\nbroken power-law. The best-fit halo model has an outer power-law index of $-$3\nand accurately describes observational evidence of M33's stellar halo from both\nresolved stellar spectroscopy in the disk and its stellar populations at large\nradius. Integrating this profile yields a total halo stellar mass of\n${\\sim}5{\\times}10^8\\ M_{\\odot}$, giving a total stellar halo mass fraction of\n16%, most of which resides in the innermost 2.5 kpc.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:57 GMT"}],"update_date":"2023-08-23","authors_parsed":[["Smercina","Adam",""],["Dalcanton","Julianne J.",""],["Williams","Benjamin F.",""],["Durbin","Meredith J.",""],["Lazzarini","Margaret",""],["Bell","Eric F.",""],["Choi","Yumi",""],["Dolphin","Andrew",""],["Gilbert","Karoline",""],["Guhathakurta","Puragra",""],["Koch","Eric W.",""],["Rix","Hans-Walter",""],["Rosolowsky","Erik",""],["Seth","Anil",""],["Skillman","Evan D.",""],["Weisz","Daniel R.",""]]}
{"id":"2308.11624","submitter":"Kain Lu Low","authors":"Guangxi Fan, Kain Lu Low","title":"Revolutionizing TCAD Simulations with Universal Device Encoding and\n  Graph Attention Networks","comments":"32 pages, 13 figures and 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An innovative methodology that leverages artificial intelligence (AI) and\ngraph representation for semiconductor device encoding in TCAD device\nsimulation is proposed. A graph-based universal encoding scheme is presented\nthat not only considers material-level and device-level embeddings, but also\nintroduces a novel spatial relationship embedding inspired by interpolation\noperations typically used in finite element meshing. Universal physical laws\nfrom device simulations are leveraged for comprehensive data-driven modeling,\nwhich encompasses surrogate Poisson emulation and current-voltage (IV)\nprediction based on drift-diffusion model. Both are achieved using a novel\ngraph attention network, referred to as RelGAT. Comprehensive technical details\nbased on the device simulator Sentaurus TCAD are presented, empowering\nresearchers to adopt the proposed AI-driven Electronic Design Automation (EDA)\nsolution at the device level.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 05:58:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fan","Guangxi",""],["Low","Kain Lu",""]]}
{"id":"2308.11625","submitter":"Skyler Simmons","authors":"Skyler Simmons","title":"The Octahedral Collision-Based Periodic Orbit in the Three-Dimensional\n  Six-Body Problem","comments":"26 pages, 7 figures. arXiv admin note: substantial text overlap with\n  arXiv:2110.06174","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a highly-symmetric periodic orbit of six bodies in three\ndimensions. In this orbit, binary collisions occur at the origin in a regular\nperiodic fashion, rotating between pairs of bodies located on the coordinate\naxes. Regularization of the collisions in the orbit is achieved by an extension\nof the Levi-Civita method. Initial conditions for the orbit are found\nnumerically. In contrast to an earlier periodic collision-based orbit in three\ndimensions, this orbit is shown to be unstable.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 01:10:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Simmons","Skyler",""]]}
{"id":"2308.11626","submitter":"Guang Ping He","authors":"Guang Ping He","title":"Comment on \"Masking quantum information is impossible\"","comments":"2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The no-masking theorem (Phys. Rev. Lett. 120, 230501 (2018)) claims that\narbitrary quantum states cannot be masked. Based on this result, the authors\nfurther suggested that qubit commitment is not possible. Here we show that this\nconnection does not hold in general.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 21:55:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["He","Guang Ping",""]]}
{"id":"2308.11627","submitter":"Dengfeng Liu","authors":"Yiwen Xu, Dengfeng Liu, Liangtao Huang, Zhiquan Lin, Tiesong Zhao, and\n  Sam Kwong","title":"Non-Intrusive Electric Load Monitoring Approach Based on Current Feature\n  Visualization for Smart Energy Management","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.CV cs.SY eess.IV eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The state-of-the-art smart city has been calling for an economic but\nefficient energy management over large-scale network, especially for the\nelectric power system. It is a critical issue to monitor, analyze and control\nelectric loads of all users in system. In this paper, we employ the popular\ncomputer vision techniques of AI to design a non-invasive load monitoring\nmethod for smart electric energy management. First of all, we utilize both\nsignal transforms (including wavelet transform and discrete Fourier transform)\nand Gramian Angular Field (GAF) methods to map one-dimensional current signals\nonto two-dimensional color feature images. Second, we propose to recognize all\nelectric loads from color feature images using a U-shape deep neural network\nwith multi-scale feature extraction and attention mechanism. Third, we design\nour method as a cloud-based, non-invasive monitoring of all users, thereby\nsaving energy cost during electric power system control. Experimental results\non both public and our private datasets have demonstrated our method achieves\nsuperior performances than its peers, and thus supports efficient energy\nmanagement over large-scale Internet of Things (IoT).\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 04:52:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Yiwen",""],["Liu","Dengfeng",""],["Huang","Liangtao",""],["Lin","Zhiquan",""],["Zhao","Tiesong",""],["Kwong","Sam",""]]}
{"id":"2308.11628","submitter":"Thomas Heston","authors":"Thomas F. Heston","title":"Prompt Engineering For Students of Medicine and Their Teachers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  \"Prompt Engineering for Students of Medicine and Their Teachers\" brings the\nprinciples of prompt engineering for large language models such as ChatGPT and\nGoogle Bard to medical education. This book contains a comprehensive guide to\nprompt engineering to help both teachers and students improve education in the\nmedical field. Just as prompt engineering is critical in getting good\ninformation out of an AI, it is also critical to get students to think and\nunderstand more deeply. The principles of prompt engineering that we have\nlearned from AI systems have the potential to simultaneously revolutionize\nlearning in the healthcare field. The book analyzes from multiple angles the\nanatomy of a good prompt for both AI models and students. The different types\nof prompts are examined, showing how each style has unique characteristics and\napplications. The principles of prompt engineering, applied properly, are\ndemonstrated to be effective in teaching across the diverse fields of anatomy,\nphysiology, pathology, pharmacology, and clinical skills. Just like ChatGPT and\nsimilar large language AI models, students need clear and detailed prompting in\norder for them to fully understand a topic. Using identical principles, a\nprompt that gets good information from an AI will also cause a student to think\nmore deeply and accurately. The process of prompt engineering facilitates this\nprocess. Because each chapter contains multiple examples and key takeaways, it\nis a practical guide for implementing prompt engineering in the learning\nprocess. It provides a hands-on approach to ensure readers can immediately\napply the concepts they learn\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 20:47:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Heston","Thomas F.",""]]}
{"id":"2308.11629","submitter":"Yunfei Zhang","authors":"Yunfei Zhang, Mario Ilic, Klaus Bogenberger","title":"Autonomous Vehicles as a Sensor: Simulating Data Collection Process","comments":"15 pages, 11 figures, the 2024 TRB Annual Meeting","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Urban traffic state estimation is pivotal in furnishing precise and reliable\ninsights into traffic flow characteristics, thereby enabling efficient traffic\nmanagement. Traditional traffic estimation methodologies have predominantly\nhinged on labor-intensive and costly techniques such as loop detectors and\nfloating car data. Nevertheless, the relentless progression in autonomous\ndriving technology has catalyzed an increasing interest in capitalizing on the\nextensive potential of on-board sensor data, giving rise to a novel concept\nknown as \"Autonomous Vehicles as a Sensor\" (AVaaS). This paper innovatively\nrefines the AVaaS concept by simulating the data collection process. We take\nreal-world sensor attributes into account and employ more accurate estimation\ntechniques based on the on-board sensor data. Such data can facilitate the\nestimation of high-resolution, link-level traffic states and, more extensively,\nonline cluster- and network-level traffic states. We substantiate the viability\nof the AVaaS concept through a case study conducted using a real-world traffic\nsimulation in Ingolstadt, Germany. The results attest to the ability of AVaaS\nin estimating both microscopic (link-level) and macroscopic (cluster- and\nnetwork-level) traffic states, thereby highlighting the immense potential of\nthe AVaaS concept in effecting precise and reliable traffic state estimation\nand also further applications.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:57:44 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 12:57:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhang","Yunfei",""],["Ilic","Mario",""],["Bogenberger","Klaus",""]]}
{"id":"2308.11630","submitter":"Francesco Da Ros","authors":"Ali Cem, Ognjen Jovanovic, Siqi Yan, Yunhong Ding, Darko Zibar, and\n  Francesco Da Ros","title":"Addressing Data Scarcity in Optical Matrix Multiplier Modeling Using\n  Transfer Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present and experimentally evaluate using transfer learning to address\nexperimental data scarcity when training neural network (NN) models for\nMach-Zehnder interferometer mesh-based optical matrix multipliers. Our approach\ninvolves pre-training the model using synthetic data generated from a less\naccurate analytical model and fine-tuning with experimental data. Our\ninvestigation demonstrates that this method yields significant reductions in\nmodeling errors compared to using an analytical model, or a standalone NN model\nwhen training data is limited. Utilizing regularization techniques and ensemble\naveraging, we achieve < 1 dB root-mean-square error on the matrix weights\nimplemented by a photonic chip while using only 25% of the available data.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 07:33:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cem","Ali",""],["Jovanovic","Ognjen",""],["Yan","Siqi",""],["Ding","Yunhong",""],["Zibar","Darko",""],["Da Ros","Francesco",""]]}
{"id":"2308.11631","submitter":"Duo Zhang","authors":"Duo Zhang","title":"Deep learning-based flow disaggregation for hydropower plant management","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  High temporal resolution data is a vital resource for hydropower plant\nmanagement. Currently, only daily resolution data are available for most of\nNorwegian hydropower plant, however, to achieve more accurate management,\nsub-daily resolution data are often required. To deal with the wide absence of\nsub-daily data, time series disaggregation is a potential tool. In this study,\nwe proposed a time series disaggregation model based on deep learning, the\nmodel is tested using flow data from a Norwegian flow station, to disaggregate\nthe daily flow into hourly flow. Preliminary results show some promising\naspects for the proposed model.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 10:52:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Duo",""]]}
{"id":"2308.11632","submitter":"Abhishek Chauhan","authors":"Malvika Kanojia, Prerna Kamani, Gautam Siddharth Kashyap, Shafaq Naz,\n  Samar Wazir, Abhishek Chauhan","title":"Alternative Agriculture Land-Use Transformation Pathways by\n  Partial-Equilibrium Agricultural Sector Model: A Mathematical Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Humanity's progress in combating hunger, poverty, and child mortality is\nmarred by escalating environmental degradation due to rising greenhouse gas\nemissions and climate change impacts. Despite positive developments, ecosystems\nare suffering globally. Regional strategies for mitigating and adapting to\nclimate change must be viewed from a global perspective. The 2015 UN\nSustainable Development Goals reflect the challenge of balancing social and\nenvironmental aspects for sustainable development. Agriculture, vital for food\nproduction, also threatens Earth systems. A study examines the interplay of\nland-use impacts, modeling crop and livestock trade, and their effects on\nclimate, biodiversity, water, and land using a Partial-Equilibrium Agricultural\nSector Model. Different scenarios involving taxing externalities related to\nEarth processes were tested. Results show synergies in reducing emissions,\nbiodiversity loss, water use, and phosphorus pollution, driven by shifts in\ncrop management. Nitrogen application and deforestation scenarios exhibit\nweaker synergies and more conflicts. The study offers insights into SDG\ninteractions and the potential for sustainable farming.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 10:12:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kanojia","Malvika",""],["Kamani","Prerna",""],["Kashyap","Gautam Siddharth",""],["Naz","Shafaq",""],["Wazir","Samar",""],["Chauhan","Abhishek",""]]}
{"id":"2308.11633","submitter":"Brandon Sheffield","authors":"Brandon Sheffield, Frank E. Bobe III, Bradley Marchand, Matthew S.\n  Emigh","title":"Advances in Self-Supervised Learning for Synthetic Aperture Sonar Data\n  Processing, Classification, and Pattern Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synthetic Aperture Sonar (SAS) imaging has become a crucial technology for\nunderwater exploration because of its unique ability to maintain resolution at\nincreasing ranges, a characteristic absent in conventional sonar techniques.\nHowever, the effective application of deep learning to SAS data processing is\noften limited due to the scarcity of labeled data. To address this challenge,\nthis paper proposes MoCo-SAS that leverages self-supervised learning (SSL) for\nSAS data processing, classification, and pattern recognition. The experimental\nresults demonstrate that MoCo-SAS significantly outperforms traditional\nsupervised learning methods, as evidenced by significant improvements observed\nin terms of the F1-score. These findings highlight the potential of SSL in\nadvancing the state-of-the-art in SAS data processing, offering promising\navenues for enhanced underwater object detection and classification.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 20:59:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sheffield","Brandon",""],["Bobe","Frank E.","III"],["Marchand","Bradley",""],["Emigh","Matthew S.",""]]}
{"id":"2308.11634","submitter":"Anna Zamojska-Dzienio","authors":"A.B. Romanowska, J.D.H. Smith, and A. Zamojska-Dzienio","title":"Barycentric algebra and convex polygon coordinates","comments":"62 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Barycentric coordinates provide solutions to the problem of expressing an\nelement of a compact convex set as a convex combination of a finite number of\nextreme points of the set. Various approaches to this problem have arisen, in\nvarious contexts. The most general solution, namely the Gibbs coordinates based\non entropy maximization, actually work in the broader setting of barycentric\nalgebras, which constitute semilattice-ordered systems of convex sets. These\ncoordinates involve exponential functions. For convex polytopes, Wachspress\ncoordinates offer solutions which only involve rational functions. The current\npaper focuses primarily on convex polygons in the plane. After summarizing the\nGibbs and Wachspress coordinates, we identify where they agree, and provide\ncomparisons between them when they do not. Within a general formalism for\nanalyzing coordinate systems, we then introduce a direct sparse geometric\napproach based on chordal decompositions of polygons, along with a symmetrized\nversion which creates what we call cartographic coordinates. We present\ncomparisons between cartographic coordinates based on distinct chordal\ndecompositions, and comparisons of cartographic coordinates with Gibbs and\nWachspress coordinates.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 08:34:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Romanowska","A. B.",""],["Smith","J. D. H.",""],["Zamojska-Dzienio","A.",""]]}
{"id":"2308.11635","submitter":"Zhen Liang Jane","authors":"Weishan Ye, Zhiguo Zhang, Min Zhang, Fei Teng, Li Zhang, Linling Li,\n  Gan Huang, Jianhong Wang, Dong Ni, and Zhen Liang","title":"Semi-Supervised Dual-Stream Self-Attentive Adversarial Graph Contrastive\n  Learning for Cross-Subject EEG-based Emotion Recognition","comments":"arXiv admin note: text overlap with arXiv:2304.06496","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.HC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electroencephalography (EEG) is an objective tool for emotion recognition\nwith promising applications. However, the scarcity of labeled data remains a\nmajor challenge in this field, limiting the widespread use of EEG-based emotion\nrecognition. In this paper, a semi-supervised Dual-stream Self-Attentive\nAdversarial Graph Contrastive learning framework (termed as DS-AGC) is proposed\nto tackle the challenge of limited labeled data in cross-subject EEG-based\nemotion recognition. The DS-AGC framework includes two parallel streams for\nextracting non-structural and structural EEG features. The non-structural\nstream incorporates a semi-supervised multi-domain adaptation method to\nalleviate distribution discrepancy among labeled source domain, unlabeled\nsource domain, and unknown target domain. The structural stream develops a\ngraph contrastive learning method to extract effective graph-based feature\nrepresentation from multiple EEG channels in a semi-supervised manner. Further,\na self-attentive fusion module is developed for feature fusion, sample\nselection, and emotion recognition, which highlights EEG features more relevant\nto emotions and data samples in the labeled source domain that are closer to\nthe target domain. Extensive experiments conducted on two benchmark databases\n(SEED and SEED-IV) using a semi-supervised cross-subject leave-one-subject-out\ncross-validation evaluation scheme show that the proposed model outperforms\nexisting methods under different incomplete label conditions (with an average\nimprovement of 5.83% on SEED and 6.99% on SEED-IV), demonstrating its\neffectiveness in addressing the label scarcity problem in cross-subject\nEEG-based emotion recognition.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 23:54:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ye","Weishan",""],["Zhang","Zhiguo",""],["Zhang","Min",""],["Teng","Fei",""],["Zhang","Li",""],["Li","Linling",""],["Huang","Gan",""],["Wang","Jianhong",""],["Ni","Dong",""],["Liang","Zhen",""]]}
{"id":"2308.11636","submitter":"Rui Liu","authors":"Rui Liu, Yuanyuan Chen, Anran Li, Yi Ding, Han Yu, Cuntai Guan","title":"Aggregating Intrinsic Information to Enhance BCI Performance through\n  Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.DC cs.LG cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Insufficient data is a long-standing challenge for Brain-Computer Interface\n(BCI) to build a high-performance deep learning model. Though numerous research\ngroups and institutes collect a multitude of EEG datasets for the same BCI\ntask, sharing EEG data from multiple sites is still challenging due to the\nheterogeneity of devices. The significance of this challenge cannot be\noverstated, given the critical role of data diversity in fostering model\nrobustness. However, existing works rarely discuss this issue, predominantly\ncentering their attention on model training within a single dataset, often in\nthe context of inter-subject or inter-session settings. In this work, we\npropose a hierarchical personalized Federated Learning EEG decoding (FLEEG)\nframework to surmount this challenge. This innovative framework heralds a new\nlearning paradigm for BCI, enabling datasets with disparate data formats to\ncollaborate in the model training process. Each client is assigned a specific\ndataset and trains a hierarchical personalized model to manage diverse data\nformats and facilitate information exchange. Meanwhile, the server coordinates\nthe training procedure to harness knowledge gleaned from all datasets, thus\nelevating overall performance. The framework has been evaluated in Motor\nImagery (MI) classification with nine EEG datasets collected by different\ndevices but implementing the same MI task. Results demonstrate that the\nproposed frame can boost classification performance up to 16.7% by enabling\nknowledge sharing between multiple datasets, especially for smaller datasets.\nVisualization results also indicate that the proposed framework can empower the\nlocal models to put a stable focus on task-related areas, yielding better\nperformance. To the best of our knowledge, this is the first end-to-end\nsolution to address this important challenge.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 08:59:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Rui",""],["Chen","Yuanyuan",""],["Li","Anran",""],["Ding","Yi",""],["Yu","Han",""],["Guan","Cuntai",""]]}
{"id":"2308.11637","submitter":"Olga Holtz","authors":"Olga V. Holtz","title":"Classical values of Zeta, as simple as possible but not simpler","comments":"10 page, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This short note for non-experts means to demystify the tasks of evaluating\nthe Riemann Zeta Function at nonnegative integers and at even natural numbers,\nboth initially performed by Leonhard Euler. Treading in the footsteps of G. H.\nHardy and others, I re-examine Euler's work on the functional equation for the\nZeta function, and explain how both the functional equation and all `classical'\ninteger values can be obtained in one sweep using only Euler's favorite method\nof generating functions. As a counter-point, I also present an even simpler\nargument essentially due to Bernhard Riemann, which however requires Cauchy's\nresidue theorem, a result not yet available to Euler. As a final point, I\nendeavor to clarify how these two methods are organically linked and can be\ntaught as an intuitive gateway into the world of Zeta functionology.\n","versions":[{"version":"v1","created":"Mon, 14 Aug 2023 09:56:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Holtz","Olga V.",""]]}
{"id":"2308.11638","submitter":"Reza Arablouei","authors":"Timothy Tadj, Reza Arablouei, Volkan Dedeoglu","title":"IoT Data Trust Evaluation via Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Various approaches based on supervised or unsupervised machine learning (ML)\nhave been proposed for evaluating IoT data trust. However, assessing their\nreal-world efficacy is hard mainly due to the lack of related\npublicly-available datasets that can be used for benchmarking. Since obtaining\nsuch datasets is challenging, we propose a data synthesis method, called random\nwalk infilling (RWI), to augment IoT time-series datasets by synthesizing\nuntrustworthy data from existing trustworthy data. Thus, RWI enables us to\ncreate labeled datasets that can be used to develop and validate ML models for\nIoT data trust evaluation. We also extract new features from IoT time-series\nsensor data that effectively capture its auto-correlation as well as its\ncross-correlation with the data of the neighboring (peer) sensors. These\nfeatures can be used to learn ML models for recognizing the trustworthiness of\nIoT sensor data. Equipped with our synthesized ground-truth-labeled datasets\nand informative correlation-based feature, we conduct extensive experiments to\ncritically examine various approaches to evaluating IoT data trust via ML. The\nresults reveal that commonly used ML-based approaches to IoT data trust\nevaluation, which rely on unsupervised cluster analysis to assign trust labels\nto unlabeled data, perform poorly. This poor performance can be attributed to\nthe underlying unsubstantiated assumption that clustering provides reliable\nlabels for data trust, a premise that is found to be untenable. The results\nalso show that the ML models learned from datasets augmented via RWI while\nusing the proposed features generalize well to unseen data and outperform\nexisting related approaches. Moreover, we observe that a semi-supervised ML\napproach that requires only about 10% of the data labeled offers competitive\nperformance while being practically more appealing compared to the\nfully-supervised approaches.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 05:44:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tadj","Timothy",""],["Arablouei","Reza",""],["Dedeoglu","Volkan",""]]}
{"id":"2308.11639","submitter":"Sungho Suh","authors":"Tae Yeob Kang, Haebom Lee, Sungho Suh","title":"In situ Fault Diagnosis of Indium Tin Oxide Electrodes by Processing\n  S-Parameter Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the field of optoelectronics, indium tin oxide (ITO) electrodes play a\ncrucial role in various applications, such as displays, sensors, and solar\ncells. Effective fault detection and diagnosis of the ITO electrodes are\nessential to ensure the performance and reliability of the devices. However,\ntraditional visual inspection is challenging with transparent ITO electrodes,\nand existing fault detection methods have limitations in determining the root\ncauses of the defects, often requiring destructive evaluations. In this study,\nan in situ fault diagnosis method is proposed using scattering parameter\n(S-parameter) signal processing, offering early detection, high diagnostic\naccuracy, noise robustness, and root cause analysis. A comprehensive\nS-parameter pattern database is obtained according to defect states. Deep\nlearning (DL) approaches, including multilayer perceptron (MLP), convolutional\nneural network (CNN), and transformer, are then used to simultaneously analyze\nthe cause and severity of defects. Notably, it is demonstrated that the\ndiagnostic performance under additive noise levels can be significantly\nenhanced by combining different channels of the S-parameters as input to the\nlearning algorithms, as confirmed through the t-distributed stochastic neighbor\nembedding (t-SNE) dimension reduction visualization.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 08:33:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kang","Tae Yeob",""],["Lee","Haebom",""],["Suh","Sungho",""]]}
{"id":"2308.11640","submitter":"Rachel Newton","authors":"Christopher Frei, Daniel Loughran and Rachel Newton","title":"The Hasse norm principle for abelian extensions -- corrigendum","comments":"25 pages, corrigendum to arXiv:1508.02518. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The proofs of Theorem 1.1 and Theorem 1.5(2) in the authors' paper 'The Hasse\nnorm principle for abelian extensions' are incorrect. We point out the mistakes\nand provide correct proofs, using techniques of the original paper.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:13:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Frei","Christopher",""],["Loughran","Daniel",""],["Newton","Rachel",""]]}
{"id":"2308.11641","submitter":"Annibal Figueiredo","authors":"Rodrigo R. Silva, Annibal Figueiredo","title":"Synge's dynamic problem for two isolated point charges. A new method to\n  find global solutions for Functional Differential Equations System","comments":"32 pages, 10 Figures, 2 Tables, Preprint Article","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.DS math.MP physics.class-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Synge's problem consists in to determine the dynamics of two point electrical\ncharges interacting through their electromagnetic fields, without to take into\naccount the radiation terms due to the self-forces in each charge. We discuss\nhow this problem is related to the question on to establish initial conditions\nfor the electromagnetic fields that are compatible with the two point charges\nsystem isolation, that is, the charges are free from the action of external\nforces. This problem stems from the existence of inter-temporal constraints for\nthe charges trajectories, which implies that the relativistic Newton equations\nfor the charges is not a system of ODEs, but rather a system of Functional\nDifferential Equations (FDEs). We developed a new method to obtain global\nsolutions that satisfies this system of FDEs and a given initial condition for\nthe charges positions and velocities. This method allows the construction of a\nrecursive numerical algorithm that only use integration methods for ODEs\nsystems. Finally, we apply this algorithm to obtain numerical approximations\nfor the quasi-circular solutions that are predicted in Synge's problem.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 13:46:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Silva","Rodrigo R.",""],["Figueiredo","Annibal",""]]}
{"id":"2308.11642","submitter":"Yuvaraj Govindarajulu","authors":"Yuvaraj Govindarajulu and Raja Rajeshwari Raj Kumar","title":"Gesture Recognition based on Long-Short Term Memory Cells using\n  Smartphone IMUs","comments":"Proceedings of Fachpraktikum Interaktive Systeme (FIS 18), FIS 18,\n  Summer 2018, University of Stuttgart, Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the last few decades, Smartphone technology has seen significant\nimprovements. Enhancements specific to built-in Inertial Measurement Units\n(IMUs) and other dedicated sensors of the smartphones(which are often available\nas default) such as- Accelerometer, Gyroscope, Magnetometer, Fingerprint\nreader, Proximity and Ambient light sensors have made devices smarter and the\ninteraction seamless. Gesture recognition using these smart phones have been\nexperimented with many techniques. In this solution, a Recurrent Neural Network\n(RNN) approach, LSTM (Long-Short Term Memory Cells) has been used to classify\nten different gestures based on data from Accelerometer and Gyroscope.\nSelection of sensor data (Accelerometer and Gyroscope) was based on the ones\nthat provided maximum information regarding the movement and orientation of the\nphone. Various models were experimented in this project, the results of which\nare presented in the later sections. Furthermore, the properties and\ncharacteristics of the collected data were studied and a set of improvements\nhave been suggested in the future work section.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 15:37:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Govindarajulu","Yuvaraj",""],["Kumar","Raja Rajeshwari Raj",""]]}
{"id":"2308.11643","submitter":"James Clarke","authors":"James M. Clarke, Maryam Mehrnezhad, Ehsan Toreini","title":"Invisible, Unreadable, and Inaudible Cookie Notices: An Evaluation of\n  Cookie Notices for Users with Visual Impairments","comments":"36 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the accessibility of cookie notices on websites for\nusers with visual impairments (VI) via a set of system studies on top UK\nwebsites (n=46) and a user study (n=100). We use a set of methods and\ntools--including accessibility testing tools, text-only browsers, and screen\nreaders, to perform our system studies. Our results demonstrate that the\nmajority of cookie notices on these websites have some form of accessibility\nissues including contrast issues, not having headings, and not being read aloud\nimmediately when the page is loaded. We discuss how such practises impact the\nuser experience and privacy and provide a set of recommendations for multiple\nstakeholders for more accessible websites and better privacy practises for\nusers with VIs. To complement our technical contribution we conduct a user\nstudy and finding that people with VIs generally have a negative view of cookie\nnotices and believe our recommendations could help their online experience. We\nalso find a disparity in how users wish to respond to cookie notices as apposed\nto how they do in reality.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 20:06:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Clarke","James M.",""],["Mehrnezhad","Maryam",""],["Toreini","Ehsan",""]]}
{"id":"2308.11644","submitter":"Han Chen","authors":"Yang Yu, Han Chen","title":"Synergistic Signal Denoising for Multimodal Time Series of Structure\n  Vibration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Structural Health Monitoring (SHM) plays an indispensable role in ensuring\nthe longevity and safety of infrastructure. With the rapid growth of sensor\ntechnology, the volume of data generated from various structures has seen an\nunprecedented surge, bringing forth challenges in efficient analysis and\ninterpretation. This paper introduces a novel deep learning algorithm tailored\nfor the complexities inherent in multimodal vibration signals prevalent in SHM.\nBy amalgamating convolutional and recurrent architectures, the algorithm\nadeptly captures both localized and prolonged structural behaviors. The pivotal\nintegration of attention mechanisms further enhances the model's capability,\nallowing it to discern and prioritize salient structural responses from\nextraneous noise. Our results showcase significant improvements in predictive\naccuracy, early damage detection, and adaptability across multiple SHM\nscenarios. In light of the critical nature of SHM, the proposed approach not\nonly offers a robust analytical tool but also paves the way for more\ntransparent and interpretable AI-driven SHM solutions. Future prospects include\nreal-time processing, integration with external environmental factors, and a\ndeeper emphasis on model interpretability.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 00:41:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yu","Yang",""],["Chen","Han",""]]}
{"id":"2308.11645","submitter":"George Chen","authors":"Xiaobin Shen, Jonathan Elmer, George H. Chen","title":"Neurological Prognostication of Post-Cardiac-Arrest Coma Patients Using\n  EEG Data: A Dynamic Survival Analysis Framework with Competing Risks","comments":"Machine Learning for Healthcare conference (MLHC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Patients resuscitated from cardiac arrest who enter a coma are at high risk\nof death. Forecasting neurological outcomes of these patients (the task of\nneurological prognostication) could help with treatment decisions. In this\npaper, we propose, to the best of our knowledge, the first dynamic framework\nfor neurological prognostication of post-cardiac-arrest comatose patients using\nEEG data: our framework makes predictions for a patient over time as more EEG\ndata become available, and different training patients' available EEG time\nseries could vary in length. Predictions are phrased in terms of either\ntime-to-event outcomes (time-to-awakening or time-to-death) or as the patient's\nprobability of awakening or of dying across multiple time horizons. Our\nframework uses any dynamic survival analysis model that supports competing\nrisks in the form of estimating patient-level cumulative incidence functions.\nWe consider three competing risks as to what happens first to a patient:\nawakening, being withdrawn from life-sustaining therapies (and thus\ndeterministically dying), or dying (by other causes). We demonstrate our\nframework by benchmarking three existing dynamic survival analysis models that\nsupport competing risks on a real dataset of 922 patients. Our main\nexperimental findings are that: (1) the classical Fine and Gray model which\nonly uses a patient's static features and summary statistics from the patient's\nlatest hour's worth of EEG data is highly competitive, achieving accuracy\nscores as high as the recently developed Dynamic-DeepHit model that uses\nsubstantially more of the patient's EEG data; and (2) in an ablation study, we\nshow that our choice of modeling three competing risks results in a model that\nis at least as accurate while learning more information than simpler models\n(using two competing risks or a standard survival analysis setup with no\ncompeting risks).\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:46:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shen","Xiaobin",""],["Elmer","Jonathan",""],["Chen","George H.",""]]}
{"id":"2308.11646","submitter":"Xinting Liao","authors":"Xinting Liao, Chaochao Chen, Weiming Liu, Pengyang Zhou, Huabin Zhu,\n  Shuheng Shen, Weiqiang Wang, Mengling Hu, Yanchao Tan, and Xiaolin Zheng","title":"Joint Local Relational Augmentation and Global Nash Equilibrium for\n  Federated Learning with Non-IID Data","comments":"To appear in ACM International Conference on Multimedia (ACM MM23)","journal-ref":null,"doi":"10.1145/3581783.3612178","report-no":null,"categories":"cs.LG cs.AI cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) is a distributed machine learning paradigm that needs\ncollaboration between a server and a series of clients with decentralized data.\nTo make FL effective in real-world applications, existing work devotes to\nimproving the modeling of decentralized data with non-independent and identical\ndistributions (non-IID). In non-IID settings, there are intra-client\ninconsistency that comes from the imbalanced data modeling, and inter-client\ninconsistency among heterogeneous client distributions, which not only hinders\nsufficient representation of the minority data, but also brings discrepant\nmodel deviations. However, previous work overlooks to tackle the above two\ncoupling inconsistencies together. In this work, we propose FedRANE, which\nconsists of two main modules, i.e., local relational augmentation (LRA) and\nglobal Nash equilibrium (GNE), to resolve intra- and inter-client inconsistency\nsimultaneously. Specifically, in each client, LRA mines the similarity\nrelations among different data samples and enhances the minority sample\nrepresentations with their neighbors using attentive message passing. In\nserver, GNE reaches an agreement among inconsistent and discrepant model\ndeviations from clients to server, which encourages the global model to update\nin the direction of global optimum without breaking down the clients\noptimization toward their local optimums. We conduct extensive experiments on\nfour benchmark datasets to show the superiority of FedRANE in enhancing the\nperformance of FL with non-IID data.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 06:17:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liao","Xinting",""],["Chen","Chaochao",""],["Liu","Weiming",""],["Zhou","Pengyang",""],["Zhu","Huabin",""],["Shen","Shuheng",""],["Wang","Weiqiang",""],["Hu","Mengling",""],["Tan","Yanchao",""],["Zheng","Xiaolin",""]]}
{"id":"2308.11647","submitter":"Giacomo Oliveri","authors":"Giacomo Oliveri, Francesco Zardi, and Andrea Massa","title":"Optically-Transparent EM Skins for Outdoor-to-Indoor mm-Wave Wireless\n  Communications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optically-transparent opportunistic electromagnetic skins (OTO-EMSs) are\nproposed to enable outdoor-to-indoor (O2I) millimiter-wave (mmW) wireless\ncommunications with existing windows/glass-panels. More in detail, static\npassive EMSs consisting of optically-transparent conducting patterned layers\nattached to standard glass-panels are designed. Towards this end, both the\nphase coverage and the optical transparency of a meshed copper-based meta-atom\nprinted on a non-dedicated insulated glass substrate are optimized.\nSuccessively, the feasibility of OTO-EMSs able to support mmW high-efficiency\nO2I transmissions along non-Snell refraction directions is numerically\ndemonstrated.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 07:47:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Oliveri","Giacomo",""],["Zardi","Francesco",""],["Massa","Andrea",""]]}
{"id":"2308.11648","submitter":"Zhaofeng Ge","authors":"Zhao-Feng Ge and Yu-Qi Chen","title":"A Regularized $(XP)^2$ Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate a dynamic model described by the classical Hamiltonian\n$H(x,p)=(x^2+a^2)(p^2+a^2)$ , where $a^2>0$, in classical, semi-classical, and\nquantum mechanics.In the high-energy $E$ limit, the phase path resembles that\nof the $(XP)^2$ model. However, the non-zero value of $a$ acts as a regulator,\nremoving the singularities that appear in the region where $x, p \\sim 0$ ,\nresulting in a discrete spectrum characterized by a logarithmic increase in\nstate density. Classical solutions are described by elliptic functions, with\nthe period being determined by elliptic integrals. We present three different\nforms of quantized Hamiltonians, and reformulate them into the standard Schr\\\"\nodinger equation with $\\cosh 2x$-like potentials. Numerical evaluations of the\nspectra for these forms are carried out and reveal minor differences in energy\nlevels. Among them, one interesting form possesses Hamiltonian in the Schr\\\"\nodinger equation that is identical to its classical version. In such scenarios,\nthe eigenvalue equations can be expressed as the vanishing of the Mathieu\nfunctions' value at $i\\infty$ points, and furthermore, the Mathieu functions\ncan be represented as the wave functions.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 01:34:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ge","Zhao-Feng",""],["Chen","Yu-Qi",""]]}
{"id":"2308.11649","submitter":"Benjamin Kenwright","authors":"Benjamin Kenwright","title":"Exploring the Power of Creative AI Tools and Game-Based Methodologies\n  for Interactive Web-Based Programming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, the fields of artificial intelligence and web-based\nprogramming have seen tremendous advancements, enabling developers to create\ndynamic and interactive websites and applications. At the forefront of these\nadvancements, creative AI tools and game-based methodologies have emerged as\npotent instruments, promising enhanced user experiences and increased\nengagement in educational environments. This chapter explores the potential of\nthese tools and methodologies for interactive web-based programming, examining\ntheir benefits, limitations, and real-world applications. We examine the\nchallenges and ethical considerations that arise when integrating these\ntechnologies into web development, such as privacy concerns and the potential\nfor bias in AI-generated content. Through this exploration, we aim to provide\ninsights into the exciting possibilities that creative AI tools and game-based\nmethodologies offer for the future of web-based programming.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 20:01:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kenwright","Benjamin",""]]}
{"id":"2308.11650","submitter":"Noah Bray-Ali","authors":"Noah Bray-Ali","title":"Standard Model Muon Magnetic Dipole Moment","comments":"Five pages, three tables, prepared for 6th Plenary Workshop of the\n  Muon g-2 Theory Initiative","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The most recent high-precision determination of the hadronic leading order\ncontribution to the muon magnetic dipole moment within the Standard Model of\nparticle physics has revealed a five standard deviation discrepancy with the\nprevious determination with the highest precision. A systematic effect of the\nluminous volume created during the measurements leading to the determinations\nseems to be the source of the discrepancy. Correcting for the luminous volume\neffect allows a consistent determination of the Standard Model muon magnetic\ndipole moment with precision that is comparable to the latest world average\nfrom muon spin precession experiments.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 06:54:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bray-Ali","Noah",""]]}
{"id":"2308.11651","submitter":"Tiehang Duan","authors":"Tiehang Duan, Zhenyi Wang, Gianfranco Doretto, Fang Li, Cui Tao,\n  Donald Adjeroh","title":"Distributionally Robust Cross Subject EEG Decoding","comments":"ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, deep learning has shown to be effective for Electroencephalography\n(EEG) decoding tasks. Yet, its performance can be negatively influenced by two\nkey factors: 1) the high variance and different types of corruption that are\ninherent in the signal, 2) the EEG datasets are usually relatively small given\nthe acquisition cost, annotation cost and amount of effort needed. Data\naugmentation approaches for alleviation of this problem have been empirically\nstudied, with augmentation operations on spatial domain, time domain or\nfrequency domain handcrafted based on expertise of domain knowledge. In this\nwork, we propose a principled approach to perform dynamic evolution on the data\nfor improvement of decoding robustness. The approach is based on\ndistributionally robust optimization and achieves robustness by optimizing on a\nfamily of evolved data distributions instead of the single training data\ndistribution. We derived a general data evolution framework based on\nWasserstein gradient flow (WGF) and provides two different forms of evolution\nwithin the framework. Intuitively, the evolution process helps the EEG decoder\nto learn more robust and diverse features. It is worth mentioning that the\nproposed approach can be readily integrated with other data augmentation\napproaches for further improvements. We performed extensive experiments on the\nproposed approach and tested its performance on different types of corrupted\nEEG signals. The model significantly outperforms competitive baselines on\nchallenging decoding scenarios.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 11:31:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Duan","Tiehang",""],["Wang","Zhenyi",""],["Doretto","Gianfranco",""],["Li","Fang",""],["Tao","Cui",""],["Adjeroh","Donald",""]]}
{"id":"2308.11652","submitter":"Jiaqi Yin","authors":"Jiaqi Yin and Cunxi Yu","title":"Accelerating Exact Combinatorial Optimization via RL-based\n  Initialization -- A Case Study in Scheduling","comments":"International Conference on Computer-Aided Design 2023 (ICCAD)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Scheduling on dataflow graphs (also known as computation graphs) is an\nNP-hard problem. The traditional exact methods are limited by runtime\ncomplexity, while reinforcement learning (RL) and heuristic-based approaches\nstruggle with determinism and solution quality. This research aims to develop\nan innovative approach that employs machine learning (ML) for addressing\ncombinatorial optimization problems, using scheduling as a case study. The goal\nis to provide guarantees in optimality and determinism while maintaining the\nruntime cost of heuristic methods. Specifically, we introduce a novel two-phase\nRL-to-ILP scheduling framework, which includes three steps: 1) RL solver acts\nas coarse-grain scheduler, 2) solution relaxation and 3) exact solving via ILP.\nOur framework demonstrates the same scheduling performance compared with using\nexact scheduling methods while achieving up to 128 $\\times$ speed improvements.\nThis was conducted on actual EdgeTPU platforms, utilizing ImageNet DNN\ncomputation graphs as input. Additionally, the framework offers improved\non-chip inference runtime and acceleration compared to the commercially\navailable EdgeTPU compiler.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:52:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yin","Jiaqi",""],["Yu","Cunxi",""]]}
{"id":"2308.11653","submitter":"German Kalbermann","authors":"G. K\\\"albermann (Soil and Water dept.(Emeritus), Faculty of\n  Agriculture, Rehovot, Israel)","title":"A theorem for the normalization of continuous spectrum stationary states","comments":"4 printed pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A simple analytic formula developed here greatly simplifies the calculation\nof the normalization of continuous spectrum stationary states of the\none-dimensional Schr\\\"odinger equation.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:06:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["K\u00e4lbermann","G.","","Soil and Water dept."]]}
{"id":"2308.11654","submitter":"Bingxin Wang","authors":"Bingxin Wang, Xiaowen Fu, Yuan Lan, Luchan Zhang, and Yang Xiang","title":"Large Transformers are Better EEG Learners","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pre-trained large transformer models have achieved remarkable performance in\nthe fields of natural language processing and computer vision. Since the\nmagnitude of available labeled electroencephalogram (EEG) data is much lower\nthan that of text and image data, it is difficult for transformer models\npre-trained from EEG to be developed as large as GPT-4 100T to fully unleash\nthe potential of this architecture. In this paper, we show that transformers\npre-trained from images as well as text can be directly fine-tuned for\nEEG-based prediction tasks. We design AdaCE, plug-and-play Adapters for\nConverting EEG data into image as well as text forms, to fine-tune pre-trained\nvision and language transformers. The proposed AdaCE module is highly effective\nfor fine-tuning pre-trained transformers while achieving state-of-the-art\nperformance on diverse EEG-based prediction tasks. For example, AdaCE on the\npre-trained Swin-Transformer achieves 99.6%, an absolute improvement of 9.2%,\non the EEG-decoding task of human activity recognition (UCI HAR). Furthermore,\nwe empirically show that applying the proposed AdaCE to fine-tune larger\npre-trained models can achieve better performance on EEG-based predicting\ntasks, indicating the potential of our adapters for even larger transformers.\nThe plug-and-play AdaCE module can be applied to fine-tuning most of the\npopular pre-trained transformers on many other time-series data with multiple\nchannels, not limited to EEG data and the models we use. Our code will be\navailable at https://github.com/wangbxj1234/AdaCE.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 12:54:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Bingxin",""],["Fu","Xiaowen",""],["Lan","Yuan",""],["Zhang","Luchan",""],["Xiang","Yang",""]]}
{"id":"2308.11655","submitter":"Mehmet Onur Fen","authors":"Mehmet Onur Fen, Fatma Tokmak Fen","title":"Period-Doubling Route to Chaos and Intermittency in a Hybrid R\\\"ossler\n  Model","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A R\\\"ossler model perturbed with a piecewise constant function is\ninvestigated. The perturbation function used in the model is constructed by\nmeans of the logistic map. In the absence of the perturbation the system is\nassumed to possess two equilibrium points one of which is linearly stable. The\noccurrences of period-doubling cascade and intermittency are numerically\ninvestigated. Extensions of the aforementioned phenomena among coupled\nR\\\"ossler systems are also shown. Our results reveal that discontinuous\nperturbations are capable of generating continuous chaos.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 21:14:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fen","Mehmet Onur",""],["Fen","Fatma Tokmak",""]]}
{"id":"2308.11656","submitter":"Igor Carrara","authors":"Igor Carrara (UCA, CRISAM), Th\\'eodore Papadopoulo (UCA, CRISAM)","title":"Pseudo-online framework for BCI evaluation: A MOABB perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objective: BCI (Brain-Computer Interface) technology operates in three modes:\nonline, offline, and pseudo-online. In the online mode, real-time EEG data is\nconstantly analyzed. In offline mode, the signal is acquired and processed\nafterwards. The pseudo-online mode processes collected data as if they were\nreceived in real-time. The main difference is that the offline mode often\nanalyzes the whole data, while the online and pseudo-online modes only analyze\ndata in short time windows. Offline analysis is usually done with asynchronous\nBCIs, which restricts analysis to predefined time windows. Asynchronous BCI,\ncompatible with online and pseudo-online modes, allows flexible mental activity\nduration. Offline processing tends to be more accurate, while online analysis\nis better for therapeutic applications. Pseudo-online implementation\napproximates online processing without real-time constraints. Many BCI studies\nbeing offline introduce biases compared to real-life scenarios, impacting\nclassification algorithm performance. Approach: The objective of this research\npaper is therefore to extend the current MOABB framework, operating in offline\nmode, so as to allow a comparison of different algorithms in a pseudo-online\nsetting with the use of a technology based on overlapping sliding windows. To\ndo this will require the introduction of a idle state event in the dataset that\ntakes into account all different possibilities that are not task thinking. To\nvalidate the performance of the algorithms we will use the normalized Matthews\nCorrelation Coefficient (nMCC) and the Information Transfer Rate (ITR). Main\nresults: We analyzed the state-of-the-art algorithms of the last 15 years over\nseveral Motor Imagery (MI) datasets composed by several subjects, showing the\ndifferences between the two approaches from a statistical point of view.\nSignificance: The ability to analyze the performance of different algorithms in\noffline and pseudo-online modes will allow the BCI community to obtain more\naccurate and comprehensive reports regarding the performance of classification\nalgorithms.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 09:22:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Carrara","Igor","","UCA, CRISAM"],["Papadopoulo","Th\u00e9odore","","UCA, CRISAM"]]}
{"id":"2308.11657","submitter":"Andrei Korol V","authors":"German Rojas-Lorenzo and Jesus Rubayo-Soneira and Maykel\n  Marquez-Mijares and Andrei V. Korol and Andrey V. Solov'yov","title":"Multiple scattering of 855 MeV electrons in amorphous and crystalline\n  silicon: simulations versus experiment","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph physics.acc-ph physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The angular distribution function of multiple scattering experienced by 855\nMeV electrons passing through an amorphous silicon plate and an oriented\nsilicon crystal has been studied by means of relativistic molecular dynamics\nsimulations using two types of the potentials that describe electron-atom\ninteraction. The differences in the angular distributions of the beam particles\nin both media are analysed. The results obtained are compared to the\nexperimental data and to the results of Monte Carlo simulations.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 10:51:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rojas-Lorenzo","German",""],["Rubayo-Soneira","Jesus",""],["Marquez-Mijares","Maykel",""],["Korol","Andrei V.",""],["Solov'yov","Andrey V.",""]]}
{"id":"2308.11658","submitter":"Yi Zhang","authors":"Yi Zhang, Haiyan Fan, Yujie Zhang, Lixin Ran, Dexin Ye and Xudong Chen","title":"Analytical Method for Metasurface-Based Cloaking Under Arbitrary Oblique\n  Illumination","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of antennas can severely deteriorate in the presence of\nadjacent electrically-large scatterers. In this work, we use a conducting\nhollow cylinder to shield the scatterer. The cylinder is shelled with single\nlayer dielectric and electromagnetic metasurface. The scattering field analysis\nwith respect to the surface impedance is derived. By optimizing the anisotropic\nimpedance distribution, the scattering cross-section can be effectively\nreduced. The proposed method is valid for both TMz, TEz and non-TM/TE incident\nfield. The accuracy and effectiveness of the method are verified by four\ncloaking scenarios in microwave regime. We demonstrate that with the surface\nimpedance obtained by our method, a metasurface is designed with physical\nsubwavelength structure. We also show a cloaking scenario under magnetic dipole\nradiation, which is closer to the case of a realistic antenna. This method can\nbe further applied to cloaking tasks in terahertz and optical regimes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 12:01:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Yi",""],["Fan","Haiyan",""],["Zhang","Yujie",""],["Ran","Lixin",""],["Ye","Dexin",""],["Chen","Xudong",""]]}
{"id":"2308.11659","submitter":"Bavo D.C. Campo","authors":"Bavo D.C. Campo and Katrien Antonio","title":"An engine to simulate insurance fraud network data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.AP stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traditionally, the detection of fraudulent insurance claims relies on\nbusiness rules and expert judgement which makes it a time-consuming and\nexpensive process (\\'Oskarsd\\'ottir et al., 2022). Consequently, researchers\nhave been examining ways to develop efficient and accurate analytic strategies\nto flag suspicious claims. Feeding learning methods with features engineered\nfrom the social network of parties involved in a claim is a particularly\npromising strategy (see for example Van Vlasselaer et al. (2016); Tumminello et\nal. (2023)). When developing a fraud detection model, however, we are\nconfronted with several challenges. The uncommon nature of fraud, for example,\ncreates a high class imbalance which complicates the development of well\nperforming analytic classification models. In addition, only a small number of\nclaims are investigated and get a label, which results in a large corpus of\nunlabeled data. Yet another challenge is the lack of publicly available data.\nThis hinders not only the development of new methods, but also the validation\nof existing techniques. We therefore design a simulation machine that is\nengineered to create synthetic data with a network structure and available\ncovariates similar to the real life insurance fraud data set analyzed in\n\\'Oskarsd\\'ottir et al. (2022). Further, the user has control over several\ndata-generating mechanisms. We can specify the total number of policyholders\nand parties, the desired level of imbalance and the (effect size of the)\nfeatures in the fraud generating model. As such, the simulation engine enables\nresearchers and practitioners to examine several methodological challenges as\nwell as to test their (development strategy of) insurance fraud detection\nmodels in a range of different settings. Moreover, large synthetic data sets\ncan be generated to evaluate the predictive performance of (advanced) machine\nlearning techniques.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 13:14:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Campo","Bavo D. C.",""],["Antonio","Katrien",""]]}
{"id":"2308.11660","submitter":"Chacko V M","authors":"K. K. Anakha and V. M. Chacko","title":"Type I-Type II Mixture Censoring Scheme for Lifetime Data Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Type-I and Type-II censoring schemes are the most prominent and commonly\nused censoring schemes in practice. In this work, a mixture of Type-I and Type-\nII censoring schemes, named the Type I-Type II mixture censoring scheme, has\nbeen introduced. Different censoring schemes have been discussed, along with\ntheir benefits and drawbacks. For the proposed censoring scheme, we analyze the\ndata under the assumption that failure times of experimental units follow the\nWeibull distribution. The computational formulas for the expected number of\nfailures and the expected failure time are provided. Maximum likelihood\nestimation and Bayesian estimation are used to estimate the model parameters.\nOn the basis of thorough Monte Carlo simulations, the investigated inferential\napproaches are evaluated. Finally, a numerical example is provided to\ndemonstrate the method of inference discussed here.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:47:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Anakha","K. K.",""],["Chacko","V. M.",""]]}
{"id":"2308.11661","submitter":"Jesus Fuentes","authors":"Jes\\'us Fuentes","title":"Quantum Fuzzy Orbits","comments":"This manuscript has been conceived as a rectification to the\n  discussion initially published by the author in Ref. [1]","journal-ref":null,"doi":"10.1038/s41598-020-79309-8","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This manuscript surveys quantum operations under the influence of harmonic\nmagnetic fields subject to time variations. The author scrutinises the dynamic\ninterplay of these fields and canonical variables, leading to effects such as\nsqueezing, looping effects, and parametric resonances. The time evolution of\nobservables tethered to a time-dependent quadratic Hamiltonian is examined. The\nresults of this inquiry offer contributions to the quantum control theory.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:42:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fuentes","Jes\u00fas",""]]}
{"id":"2308.11662","submitter":"Chongyan Chen","authors":"Chongyan Chen, Samreen Anjum, Danna Gurari","title":"VQA Therapy: Exploring Answer Differences by Visually Grounding Answers","comments":"IEEE/CVF International Conference on Computer Vision","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual question answering is a task of predicting the answer to a question\nabout an image. Given that different people can provide different answers to a\nvisual question, we aim to better understand why with answer groundings. We\nintroduce the first dataset that visually grounds each unique answer to each\nvisual question, which we call VQAAnswerTherapy. We then propose two novel\nproblems of predicting whether a visual question has a single answer grounding\nand localizing all answer groundings. We benchmark modern algorithms for these\nnovel problems to show where they succeed and struggle. The dataset and\nevaluation server can be found publicly at\nhttps://vizwiz.org/tasks-and-datasets/vqa-answer-therapy/.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:57:21 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 23:58:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Chongyan",""],["Anjum","Samreen",""],["Gurari","Danna",""]]}
{"id":"2308.11663","submitter":"Vinothkumar L","authors":"Vinothkumar Latchoumanane, Murugan Varadhan, Andrea\n  Semani\\v{c}ov\\'a-Fe\\v{n}ov\\v{c}\\'ikov\\'a","title":"A new class of disconnected antimagic graphs","comments":"12 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A graph $G$ is antimagic if there exists a bijection $f$ from $E(G)$ to\n$\\left\\{1,2, \\dots,|E(G)|\\right\\}$ such that the vertex sums for all vertices\nof $G$ are distinct, where the vertex sum is defined as the sum of the labels\nof all incident edges.\n  Hartsfield and Ringel conjectured that every connected graph other than $K_2$\nadmits an antimagic labeling. It is still a challenging problem to address\nantimagicness in the case of disconnected graphs. In this paper, we study\nantimagicness for the disconnected graph that is constructed as the direct\nproduct of a star and a path.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:41:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Latchoumanane","Vinothkumar",""],["Varadhan","Murugan",""],["Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1","Andrea",""]]}
{"id":"2308.11664","submitter":"Yi Fang","authors":"Fang Yi (1 and 2), Yuan Haibo (1 and 2), Zhang Ruoyi (1 and 2), Gao\n  Jian (1 and 2) and Xu Shuai (1 and 2) ((1) Institute for Frontiers in\n  Astronomy and Astrophysics, Beijing Normal University, (2) Department of\n  Astronomy, Beijing Normal University)","title":"Empirical extinction coefficients for the Swift-UVOT\n  optical-through-ultraviolet passbands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We calculated empirical reddening and extinction coefficients with respect to\nthe dust reddening map of Schlegel et al. for the Swift-UVOT passbands, using\nthe 'star pair' method and photometric data from the UVOT Serendipitous Source\nCatalogue and spectroscopic data from LAMOST Data Release 7 and 2MASS. The\nreddening coefficients for the UVW2-UVM2, UVM2-UVW1, UVW1-U, U-B, and B-V\ncolors are -1.39, 2.08, 0.78, 0.72, and 0.84, respectively.The extinction\ncoefficients for the UVW2, UVM2, UVW1, U, B, and V bands are 5.60, 6.99, 4.91,\n4.13, 3.41 and 2.57, respectively. The numbers are consistent with predictions\nby the Fitzpatrick's extinction law of R(V)=3.0. Temperature-dependent\nvariations of the coefficients are found and discussed, particularly for the\nultraviolet passbands. We recommend using the new reddening and extinction\ncoefficients in future when dereddening the Swift-UVOT data.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 03:01:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yi","Fang","","1 and 2"],["Haibo","Yuan","","1 and 2"],["Ruoyi","Zhang","","1 and 2"],["Jian","Gao","","1 and 2"],["Shuai","Xu","","1 and 2"]]}
{"id":"2308.11665","submitter":"Cole Mathis","authors":"OoLEN (Origin of Life Early-career Network), Silke Asche, Carla\n  Bautista, David Boulesteix, Alexandre Champagne-Ruel, Cole Mathis, Omer\n  Markovitch, Zhen Peng, Alyssa Adams, Avinash Vicholous Dass, Arnaud Buch,\n  Eloi Camprubi, Enrico Sandro Colizzi, Stephanie Col\\'on-Santos, Hannah\n  Dromiack, Valentina Erastova, Amanda Garcia, Ghjuvan Grimaud, Aaron Halpern,\n  Stuart A Harrison, Se\\'an F. Jordan, Tony Z Jia, Amit Kahana, Artemy\n  Kolchinsky, Odin Moron-Garcia, Ryo Mizuuchi, Jingbo Nan, Yuliia Orlova, Ben\n  K. D. Pearce, Klaus Paschek, Martina Preiner, Silvana Pinna, Eduardo\n  Rodr\\'iguez-Rom\\'an, Loraine Schwander, Siddhant Sharma, Harrison B. Smith,\n  Andrey Vieira, Joana C. Xavier","title":"What it takes to solve the Origin(s) of Life: An integrated review of\n  techniques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the origin(s) of life (OoL) is a fundamental challenge for\nscience in the 21st century. Research on OoL spans many disciplines, including\nchemistry, physics, biology, planetary sciences, computer science, mathematics\nand philosophy. The sheer number of different scientific perspectives relevant\nto the problem has resulted in the coexistence of diverse tools, techniques,\ndata, and software in OoL studies. This has made communication between the\ndisciplines relevant to the OoL extremely difficult because the interpretation\nof data, analyses, or standards of evidence can vary dramatically. Here, we\nhope to bridge this wide field of study by providing common ground via the\nconsolidation of tools and techniques rather than positing a unifying view on\nhow life emerges. We review the common tools and techniques that have been used\nsignificantly in OoL studies in recent years. In particular, we aim to identify\nwhich information is most relevant for comparing and integrating the results of\nexperimental analyses into mathematical and computational models. This review\naims to provide a baseline expectation and understanding of technical aspects\nof origins research, rather than being a primer on any particular topic. As\nsuch, it spans broadly -- from analytical chemistry to mathematical models --\nand highlights areas of future work that will benefit from a multidisciplinary\napproach to tackling the mystery of life's origin. Ultimately, we hope to\nempower a new generation of OoL scientists by reviewing how they can\ninvestigate life's origin, rather than dictating how to think about the\nproblem.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:46:19 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 23:12:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["OoLEN","","","Origin of Life Early-career Network"],["Asche","Silke",""],["Bautista","Carla",""],["Boulesteix","David",""],["Champagne-Ruel","Alexandre",""],["Mathis","Cole",""],["Markovitch","Omer",""],["Peng","Zhen",""],["Adams","Alyssa",""],["Dass","Avinash Vicholous",""],["Buch","Arnaud",""],["Camprubi","Eloi",""],["Colizzi","Enrico Sandro",""],["Col\u00f3n-Santos","Stephanie",""],["Dromiack","Hannah",""],["Erastova","Valentina",""],["Garcia","Amanda",""],["Grimaud","Ghjuvan",""],["Halpern","Aaron",""],["Harrison","Stuart A",""],["Jordan","Se\u00e1n F.",""],["Jia","Tony Z",""],["Kahana","Amit",""],["Kolchinsky","Artemy",""],["Moron-Garcia","Odin",""],["Mizuuchi","Ryo",""],["Nan","Jingbo",""],["Orlova","Yuliia",""],["Pearce","Ben K. D.",""],["Paschek","Klaus",""],["Preiner","Martina",""],["Pinna","Silvana",""],["Rodr\u00edguez-Rom\u00e1n","Eduardo",""],["Schwander","Loraine",""],["Sharma","Siddhant",""],["Smith","Harrison B.",""],["Vieira","Andrey",""],["Xavier","Joana C.",""]]}
{"id":"2308.11666","submitter":"Cheng Ma","authors":"Cheng Ma, Gyorgy Korniss, Boleslaw K. Szymanski, Jianxi Gao","title":"Generalized dimension reduction approach for heterogeneous networked\n  systems with time-delay","comments":"26 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cs.MA physics.comp-ph q-bio.PE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Networks of interconnected agents are essential to study complex networked\nsystems' state evolution, stability, resilience, and control. Nevertheless, the\nhigh dimensionality and nonlinear dynamics are vital factors preventing us from\ntheoretically analyzing them. Recently, the dimension-reduction approaches\nreduced the system's size by mapping the original system to a one-dimensional\nsystem such that only one effective representative can capture its macroscopic\ndynamics. However, the approaches dramatically fail as the network becomes\nheterogeneous and has multiple community structures. Here, we bridge the gap by\ndeveloping a generalized dimension reduction approach, which enables us to map\nthe original system to a $m$-dimensional system that consists of $m$\ninteracting components. Notably, by validating it on various dynamical models,\nthis approach accurately predicts the original system state and the tipping\npoint, if any. Furthermore, the numerical results demonstrate that this\napproach approximates the system evolution and identifies the critical points\nfor complex networks with time delay.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 04:49:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ma","Cheng",""],["Korniss","Gyorgy",""],["Szymanski","Boleslaw K.",""],["Gao","Jianxi",""]]}
{"id":"2308.11667","submitter":"Thomas Gomez","authors":"Thomas Gomez, Mark Zammit, Igor Bray, Christopher Fontes, Jackson\n  White","title":"Enhancements of Electron-Atom Collisions due to Pauli Repulsion in\n  Neutron-Star Magnetic Fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR physics.atom-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Neutron star surfaces and atmospheres are unique environments that sustain\nthe largest-known magnetic fields in the universe. Our knowledge of neutron\nstar material properties, including the composition and equation of state,\nremains highly unconstrained. Electron-atom collisions are integral to\ntheoretical thermal conduction and spectral emission models that describe\nneutron star surfaces. The theory of scattering in magnetic fields was\ndeveloped in the 1970s, but focused only on bare nuclei scattering. In this\nwork, we present a quantum treatment of atom-electron collisions in magnetic\nfields; of significant importance is the inclusion of Pauli repulsion arising\nfrom two interacting electrons. We find strange behaviors not seen in\ncollisions without a magnetic field. In high magnetic fields, Pauli repulsion\ncan lead to orders of magnitude enhancements of collision cross sections.\nAdditionally, the elastic collision cross sections that involve the ground\nstate become comparable to those involving excited states, and states with\nlarge orbits have the largest contribution to the collisions. We anticipate\nsignificant changes to transport properties and spectral line broadening in\nneutron star surfaces and atmospheres, which will aid in spectral diagnostics\nof these extreme environments.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 05:24:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gomez","Thomas",""],["Zammit","Mark",""],["Bray","Igor",""],["Fontes","Christopher",""],["White","Jackson",""]]}
{"id":"2308.11668","submitter":"Antoine Naegel","authors":"Antoine Na\\\"egel, Magalie Viallon, Jabrane Karkouri, Thomas Troalen,\n  Pierre Croisille, H\\'el\\`ene Ratiney","title":"Validation of apparent intra-and extra-myocellular lipid content\n  indicator using spiral spectroscopic imaging at 3T","comments":null,"journal-ref":"Annual meeting ESMRMB, ESMRMB, Oct 2023, Basel, Switzerland","doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a fast and simple method based on spiral MRSI for mapping\nthe IMCL and EMCL apparent content, which is a challenging task and it compares\nthis indicator to classical quantification results in muscles of interest.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:52:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Na\u00ebgel","Antoine",""],["Viallon","Magalie",""],["Karkouri","Jabrane",""],["Troalen","Thomas",""],["Croisille","Pierre",""],["Ratiney","H\u00e9l\u00e8ne",""]]}
{"id":"2308.11669","submitter":"Junghoon Kim","authors":"Junghoon Kim, Yeonjun In, Kanghoon Yoon, Junmo Lee, Chanyoung Park","title":"Class Label-aware Graph Anomaly Detection","comments":"CIKM 2023 (short paper)","journal-ref":null,"doi":"10.1145/3583780.3615249","report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised GAD methods assume the lack of anomaly labels, i.e., whether a\nnode is anomalous or not. One common observation we made from previous\nunsupervised methods is that they not only assume the absence of such anomaly\nlabels, but also the absence of class labels (the class a node belongs to used\nin a general node classification task). In this work, we study the utility of\nclass labels for unsupervised GAD; in particular, how they enhance the\ndetection of structural anomalies. To this end, we propose a Class Label-aware\nGraph Anomaly Detection framework (CLAD) that utilizes a limited amount of\nlabeled nodes to enhance the performance of unsupervised GAD. Extensive\nexperiments on ten datasets demonstrate the superior performance of CLAD in\ncomparison to existing unsupervised GAD methods, even in the absence of\nground-truth class label information. The source code for CLAD is available at\n\\url{https://github.com/jhkim611/CLAD}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:46:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kim","Junghoon",""],["In","Yeonjun",""],["Yoon","Kanghoon",""],["Lee","Junmo",""],["Park","Chanyoung",""]]}
{"id":"2308.11670","submitter":"Volker Turau","authors":"Nisal Hemadasa Manikku Badu and Marcus Venzke and Volker Turau and\n  Yanqiu Huang","title":"Machine Learning-based Positioning using Multivariate Time Series\n  Classification for Factory Environments","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Indoor Positioning Systems (IPS) gained importance in many industrial\napplications. State-of-the-art solutions heavily rely on external\ninfrastructures and are subject to potential privacy compromises, external\ninformation requirements, and assumptions, that make it unfavorable for\nenvironments demanding privacy and prolonged functionality. In certain\nenvironments deploying supplementary infrastructures for indoor positioning\ncould be infeasible and expensive. Recent developments in machine learning (ML)\noffer solutions to address these limitations relying only on the data from\nonboard sensors of IoT devices. However, it is unclear which model fits best\nconsidering the resource constraints of IoT devices. This paper presents a\nmachine learning-based indoor positioning system, using motion and ambient\nsensors, to localize a moving entity in privacy concerned factory environments.\nThe problem is formulated as a multivariate time series classification (MTSC)\nand a comparative analysis of different machine learning models is conducted in\norder to address it. We introduce a novel time series dataset emulating the\nassembly lines of a factory. This dataset is utilized to assess and compare the\nselected models in terms of accuracy, memory footprint and inference speed. The\nresults illustrate that all evaluated models can achieve accuracies above 80 %.\nCNN-1D shows the most balanced performance, followed by MLP. DT was found to\nhave the lowest memory footprint and inference latency, indicating its\npotential for a deployment in real-world scenarios.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:07:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Badu","Nisal Hemadasa Manikku",""],["Venzke","Marcus",""],["Turau","Volker",""],["Huang","Yanqiu",""]]}
{"id":"2308.11671","submitter":"Jacob Deasy","authors":"Jacob Deasy, Ron Schwessinger, Ferran Gonzalez, Stephen Young, Kim\n  Branson","title":"Generalising sequence models for epigenome predictions with tissue and\n  assay embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Sequence modelling approaches for epigenetic profile prediction have recently\nexpanded in terms of sequence length, model size, and profile diversity.\nHowever, current models cannot infer on many experimentally feasible tissue and\nassay pairs due to poor usage of contextual information, limiting $\\textit{in\nsilico}$ understanding of regulatory genomics. We demonstrate that strong\ncorrelation can be achieved across a large range of experimental conditions by\nintegrating tissue and assay embeddings into a Contextualised Genomic Network\n(CGN). In contrast to previous approaches, we enhance long-range sequence\nembeddings with contextual information in the input space, rather than\nexpanding the output space. We exhibit the efficacy of our approach across a\nbroad set of epigenetic profiles and provide the first insights into the effect\nof genetic variants on epigenetic sequence model training. Our general approach\nto context integration exceeds state of the art in multiple settings while\nemploying a more rigorous validation procedure.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:34:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Deasy","Jacob",""],["Schwessinger","Ron",""],["Gonzalez","Ferran",""],["Young","Stephen",""],["Branson","Kim",""]]}
{"id":"2308.11672","submitter":"Florence Bockting","authors":"Florence Bockting, Stefan T. Radev, Paul-Christian B\\\"urkner","title":"Simulation-Based Prior Knowledge Elicitation for Parametric Bayesian\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A central characteristic of Bayesian statistics is the ability to\nconsistently incorporate prior knowledge into various modeling processes. In\nthis paper, we focus on translating domain expert knowledge into corresponding\nprior distributions over model parameters, a process known as prior\nelicitation. Expert knowledge can manifest itself in diverse formats, including\ninformation about raw data, summary statistics, or model parameters. A major\nchallenge for existing elicitation methods is how to effectively utilize all of\nthese different formats in order to formulate prior distributions that align\nwith the expert's expectations, regardless of the model structure. To address\nthese challenges, we develop a simulation-based elicitation method that can\nlearn the hyperparameters of potentially any parametric prior distribution from\na wide spectrum of expert knowledge using stochastic gradient descent. We\nvalidate the effectiveness and robustness of our elicitation method in four\nrepresentative case studies covering linear models, generalized linear models,\nand hierarchical models. Our results support the claim that our method is\nlargely independent of the underlying model structure and adaptable to various\nelicitation techniques, including quantile-based, moment-based, and\nhistogram-based methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 10:43:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bockting","Florence",""],["Radev","Stefan T.",""],["B\u00fcrkner","Paul-Christian",""]]}
{"id":"2308.11673","submitter":"Daketi Yatin","authors":"Dhruv Limbani, Daketi Yatin, Nitish Chaturvedi, Vaishnavi Moorthy,\n  Pushpalatha M, Harichandana BSS, Sumit Kumar","title":"WEARS: Wearable Emotion AI with Real-time Sensor data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Emotion prediction is the field of study to understand human emotions.\nExisting methods focus on modalities like text, audio, facial expressions,\netc., which could be private to the user. Emotion can be derived from the\nsubject's psychological data as well. Various approaches that employ\ncombinations of physiological sensors for emotion recognition have been\nproposed. Yet, not all sensors are simple to use and handy for individuals in\ntheir daily lives. Thus, we propose a system to predict user emotion using\nsmartwatch sensors. We design a framework to collect ground truth in real-time\nutilizing a mix of English and regional language-based videos to invoke\nemotions in participants and collect the data. Further, we modeled the problem\nas binary classification due to the limited dataset size and experimented with\nmultiple machine-learning models. We also did an ablation study to understand\nthe impact of features including Heart Rate, Accelerometer, and Gyroscope\nsensor data on mood. From the experimental results, Multi-Layer Perceptron has\nshown a maximum accuracy of 93.75 percent for pleasant-unpleasant (high/low\nvalence classification) moods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:03:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Limbani","Dhruv",""],["Yatin","Daketi",""],["Chaturvedi","Nitish",""],["Moorthy","Vaishnavi",""],["M","Pushpalatha",""],["BSS","Harichandana",""],["Kumar","Sumit",""]]}
{"id":"2308.11674","submitter":"Jean-Yves Ollitrault","authors":"Jean-Yves Ollitrault","title":"Measures of azimuthal anisotropy in high-energy collisions","comments":"15 pages, 11 figures. Prepared for the topical issue of EPJA on\n  \"Intersection of low-energy nuclear structure and high-energy nuclear\n  collisions\"","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex hep-ex hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Azimuthal anisotropy is a key observation made in ultrarelativistic heavy-ion\ncollisions. This phenomenon has played a crucial role in the development of the\nfield over the last two decades. In addition to its interest for studying the\nquark-gluon plasma, which was the original motivation, it is sensitive to the\nproperties of incoming nuclei, in particular to the nuclear deformation and to\nthe nuclear skin. The azimuthal anisotropy is therefore of crucial importance\nwhen relating low-energy nuclear structure to high-energy nuclear collisions.\nThis article is an elementary introduction to the various observables used in\norder to characterize azimuthal anisotropy, which go under the names of\n$v_2\\{2\\}$, $v_3\\{2\\}$, $v_2\\{4\\}$, etc. The intended audience is primarily\nphysicists working in the field of nuclear structure.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 11:17:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ollitrault","Jean-Yves",""]]}
{"id":"2308.11675","submitter":"Manish Ramaswamy","authors":"Manish Ramaswamy","title":"Flying Capacitor Cell Equalization for Li-ion Automotive Battery Stacks","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The automotive industry is fast evolving to Li-ion chemistries, which have\nmore favorable power, energy density, and efficiency. To meet the demands of\ngreater electric ranges, parallel strings of batteries are required to increase\nthe overall system capacity. Differences in chemical characteristics, internal\nresistance, and operating conditions can cause variations in remaining cell\ncapacity, decreasing the total battery storage capacity over time, shortening\nthe battery lifetime and eventually damaging the cells. Cell equalization tries\nto restore all the cells in the pack to an equal state of charge in order to\nprolong the battery lifetime and to ensure safe battery operations. This work\npresents an active charge equalization scheme with a flying capacitor to\nshuttle charge between the unbalanced cells in a parallel battery pack. The\ntheoretical framework is accompanied by MATLAB simulations on a twelve cell\npack in series/parallel configuration supporting the validity of the chosen\napproach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 12:42:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ramaswamy","Manish",""]]}
{"id":"2308.11676","submitter":"Yonghe Zhao","authors":"Yonghe Zhao, Shuai Fu, Huiyan Sun","title":"A Study on the Impact of Non-confounding Covariates on the Inferential\n  Performance of Methods based on the Potential Outcome Framework","comments":"12 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Potential Outcome Framework (POF) plays a prominent role in the field of\ncausal inference. Most causal inference models based on the POF (CIMs-B-POF)\nare designed for eliminating confounding bias and default to an underlying\nassumption of Confounding Covariates. This assumption posits that the\ncovariates consist solely of confounders. However, the assumption of\nConfounding Covariates is challenging to maintain in practice, particularly\nwhen dealing with high-dimensional covariates. While certain methods have been\nproposed to differentiate the distinct components of covariates prior to\nconducting causal inference, the consequences of treating non-confounding\ncovariates as confounders remain unclear. This ambiguity poses a potential risk\nwhen applying the CIMs-B-POF in practical scenarios. In this paper, we present\na unified graphical framework for the CIMs-B-POF, which greatly enhances the\ncomprehension of these models' underlying principles. Using this graphical\nframework, we quantitatively analyze the extent to which the inference\nperformance of CIMs-B-POF is influenced when incorporating various types of\nnon-confounding covariates, such as instrumental variables, mediators,\ncolliders, and adjustment variables. The key findings are: in the task of\neliminating confounding bias, the optimal scenario is for the covariates to\nexclusively encompass confounders; in the subsequent task of inferring\ncounterfactual outcomes, the adjustment variables contribute to more accurate\ninferences. Furthermore, extensive experiments conducted on synthetic datasets\nconsistently validate these theoretical conclusions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:18:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhao","Yonghe",""],["Fu","Shuai",""],["Sun","Huiyan",""]]}
{"id":"2308.11677","submitter":"Gr\\'egoire Petit","authors":"Gr\\'egoire Petit, Michael Soumm, Eva Feillet, Adrian Popescu, Bertrand\n  Delezoide, David Picard, C\\'eline Hudelot","title":"An Analysis of Initial Training Strategies for Exemplar-Free\n  Class-Incremental Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Class-Incremental Learning (CIL) aims to build classification models from\ndata streams. At each step of the CIL process, new classes must be integrated\ninto the model. Due to catastrophic forgetting, CIL is particularly challenging\nwhen examples from past classes cannot be stored, the case on which we focus\nhere. To date, most approaches are based exclusively on the target dataset of\nthe CIL process. However, the use of models pre-trained in a self-supervised\nway on large amounts of data has recently gained momentum. The initial model of\nthe CIL process may only use the first batch of the target dataset, or also use\npre-trained weights obtained on an auxiliary dataset. The choice between these\ntwo initial learning strategies can significantly influence the performance of\nthe incremental learning model, but has not yet been studied in depth.\nPerformance is also influenced by the choice of the CIL algorithm, the neural\narchitecture, the nature of the target task, the distribution of classes in the\nstream and the number of examples available for learning. We conduct a\ncomprehensive experimental study to assess the roles of these factors. We\npresent a statistical analysis framework that quantifies the relative\ncontribution of each factor to incremental performance. Our main finding is\nthat the initial training strategy is the dominant factor influencing the\naverage incremental accuracy, but that the choice of CIL algorithm is more\nimportant in preventing forgetting. Based on this analysis, we propose\npractical recommendations for choosing the right initial training strategy for\na given incremental learning use case. These recommendations are intended to\nfacilitate the practical deployment of incremental learning.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:06:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Petit","Gr\u00e9goire",""],["Soumm","Michael",""],["Feillet","Eva",""],["Popescu","Adrian",""],["Delezoide","Bertrand",""],["Picard","David",""],["Hudelot","C\u00e9line",""]]}
{"id":"2308.11678","submitter":"Dung Le dr.","authors":"Dung Le","title":"A priori Bound of Solutions to a Class of Elliptic/Parabolic Cross\n  Diffusion Systems of $m$ Equations on Two/Three Dimensional Domains.\n  Existence on thin domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish several bounds for solutions to elliptic/parabolic\ncross-diffusion systems of $m$ equations ($m\\ge2$) on 2d/3d domains $\\Og$. We\nsettle the existence and global existence problems in these cases and also\nprovide new counter-examples for the case of general dimensions. Most\nimportantly, we prove that when $m=N=3$, the thinness of $\\Og$ in $\\RR^3$ is\nsufficient and necessary. When $m$ is arbitrary and $N=3$, we establish global\nexistence results for nonlinear cross-diffusion systems (the case of the scalar\nsemilinear equation was considered in the literature but the classical methods\ndo not seem to be applicable here).\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:14:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Le","Dung",""]]}
{"id":"2308.11679","submitter":"Greg\\'orio Silva Neto","authors":"Greg\\'orio Silva Neto and Vanessa Silva","title":"Classification of ruled surfaces as homothetic self-similar solutions of\n  the inverse mean curvature flow in the Lorentz-Minkowski 3-space","comments":"26 pages, 6 figures. Final version, to appear in the Bulletin of the\n  Brazilian Mathematical Society, New Series. arXiv admin note: substantial\n  text overlap with arXiv:2308.11457","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we classify the nondegenerate ruled surfaces in the\nthree-dimensional Lorentz-Minkowski space that are homothetic self-similar\nsolutions for the inverse mean curvature flow. This classification shows the\nexistence of two classes of non-cylindrical homothetic solitons: one with\nlightlike rulings and another one with non-lightlike rulings.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:17:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Neto","Greg\u00f3rio Silva",""],["Silva","Vanessa",""]]}
{"id":"2308.11680","submitter":"Alan Goldman","authors":"P. Das, A. Kreyssig, G. S. Tucker, A. Podlesnyak, Feng Ye, Masaaki\n  Matsuda, T. Kong, S. L. Bud'ko, P. C. Canfield, R. Flint, P. P. Orth, T.\n  Yamada, R. J. McQueeney and A. I. Goldman","title":"Short-range magnetic correlations in quasicrystalline i-Tb-Cd","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on elastic and inelastic neutron scattering from single-grain\nisotopically-enriched samples to elucidate the local magnetic correlations\nbetween Tb$^{3+}$ moments in quasicrystalline i-Tb-Cd. The inelastic neutron\nscattering measurements of the CEF excitations demonstrated that the Tb$^{3+}$\nmoments are directed primarily along the local five-fold axes of the Tsai-type\ncluster as was found for the TbCd6 approximant phase. Based on the inelastic\nmeasurements, we consider of a simple Ising-type model for the moment\nconfigurations on a single Tb$^{3+}$ icosahedron and enumerate the lowest\nenergy moment configurations. We then calculate the diffuse scattering from\nthese configurations and compare with the experimental magnetic diffuse\nscattering measurements to identify the most likely single cluster moment\nconfigurations and find reasonable agreement between the broad features\nobserved in our scattering simulations. We further consider the role of\nhigher-order (longer range) intercluster correlations for the magnetic\nscattering.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:37:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Das","P.",""],["Kreyssig","A.",""],["Tucker","G. S.",""],["Podlesnyak","A.",""],["Ye","Feng",""],["Matsuda","Masaaki",""],["Kong","T.",""],["Bud'ko","S. L.",""],["Canfield","P. C.",""],["Flint","R.",""],["Orth","P. P.",""],["Yamada","T.",""],["McQueeney","R. J.",""],["Goldman","A. I.",""]]}
{"id":"2308.11681","submitter":"Peng Wu","authors":"Peng Wu, Xuerong Zhou, Guansong Pang, Lingru Zhou, Qingsen Yan, Peng\n  Wang, Yanning Zhang","title":"VadCLIP: Adapting Vision-Language Models for Weakly Supervised Video\n  Anomaly Detection","comments":"Submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent contrastive language-image pre-training (CLIP) model has shown\ngreat success in a wide range of image-level tasks, revealing remarkable\nability for learning powerful visual representations with rich semantics. An\nopen and worthwhile problem is efficiently adapting such a strong model to the\nvideo domain and designing a robust video anomaly detector. In this work, we\npropose VadCLIP, a new paradigm for weakly supervised video anomaly detection\n(WSVAD) by leveraging the frozen CLIP model directly without any pre-training\nand fine-tuning process. Unlike current works that directly feed extracted\nfeatures into the weakly supervised classifier for frame-level binary\nclassification, VadCLIP makes full use of fine-grained associations between\nvision and language on the strength of CLIP and involves dual branch. One\nbranch simply utilizes visual features for coarse-grained binary\nclassification, while the other fully leverages the fine-grained language-image\nalignment. With the benefit of dual branch, VadCLIP achieves both\ncoarse-grained and fine-grained video anomaly detection by transferring\npre-trained knowledge from CLIP to WSVAD task. We conduct extensive experiments\non two commonly-used benchmarks, demonstrating that VadCLIP achieves the best\nperformance on both coarse-grained and fine-grained WSVAD, surpassing the\nstate-of-the-art methods by a large margin. Specifically, VadCLIP achieves\n84.51% AP and 88.02% AUC on XD-Violence and UCF-Crime, respectively. Code and\nfeatures will be released to facilitate future VAD research.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:58:36 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 06:55:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Peng",""],["Zhou","Xuerong",""],["Pang","Guansong",""],["Zhou","Lingru",""],["Yan","Qingsen",""],["Wang","Peng",""],["Zhang","Yanning",""]]}
{"id":"2308.11682","submitter":"Sunil Kumar Tripathy Dr.","authors":"S K Tripathy, A Sendha, S K Pradhan, Z. Naik and B. Mishra","title":"Cosmological Model with Cosmic transit behaviour in Brans-Dicke Theory","comments":"13 pages, accepted version of Gravitation and Cosmology","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have constructed a dark energy cosmological model in the framework of\ngeneralized Brans Dicke theory (GBD) with a self-interacting potential. The\nsource of dark energy is considered through a unified dark fluid (UDF)\ncharacterized by a linear equation of state (EoS). A time varying deceleration\nparameter simulating the cosmic transit behaviour has been introduced to get\nthe dynamical behaviour of the model. The $H(z)$ data have been explored to\nconstrain the model parameters and to study the dynamical aspects of the\nBrans-Dicke parameter and the scalar field.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:03:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tripathy","S K",""],["Sendha","A",""],["Pradhan","S K",""],["Naik","Z.",""],["Mishra","B.",""]]}
{"id":"2308.11683","submitter":"Arash Eshghi","authors":"Arash Eshghi, Arash Ashrafzadeh","title":"Learning to generate and corr- uh I mean repair language in real-time","comments":"Proceedings of the workshop on the Semantics and Pragmatics of\n  Dialogue, SemDial, Maribor, Slovenia (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In conversation, speakers produce language incrementally, word by word, while\ncontinuously monitoring the appropriateness of their own contribution in the\ndynamically unfolding context of the conversation; and this often leads them to\nrepair their own utterance on the fly. This real-time language processing\ncapacity is furthermore crucial to the development of fluent and natural\nconversational AI. In this paper, we use a previously learned Dynamic Syntax\ngrammar and the CHILDES corpus to develop, train and evaluate a probabilistic\nmodel for incremental generation where input to the model is a purely semantic\ngeneration goal concept in Type Theory with Records (TTR). We show that the\nmodel's output exactly matches the gold candidate in 78% of cases with a\nROUGE-l score of 0.86. We further do a zero-shot evaluation of the ability of\nthe same model to generate self-repairs when the generation goal changes\nmid-utterance. Automatic evaluation shows that the model can generate\nself-repairs correctly in 85% of cases. A small human evaluation confirms the\nnaturalness and grammaticality of the generated self-repairs. Overall, these\nresults further highlight the generalisation power of grammar-based models and\nlay the foundations for more controllable, and naturally interactive\nconversational AI systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:09:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Eshghi","Arash",""],["Ashrafzadeh","Arash",""]]}
{"id":"2308.11684","submitter":"Despoina Chatzakou","authors":"Despoina Chatzakou, Juan Soler-Company, Theodora Tsikrika, Leo Wanner,\n  Stefanos Vrochidis, Ioannis Kompatsiaris","title":"User Identity Linkage in Social Media Using Linguistic and Social\n  Interaction Features","comments":null,"journal-ref":null,"doi":"10.1145/3394231.3397920","report-no":null,"categories":"cs.SI cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Social media users often hold several accounts in their effort to multiply\nthe spread of their thoughts, ideas, and viewpoints. In the particular case of\nobjectionable content, users tend to create multiple accounts to bypass the\ncombating measures enforced by social media platforms and thus retain their\nonline identity even if some of their accounts are suspended. User identity\nlinkage aims to reveal social media accounts likely to belong to the same\nnatural person so as to prevent the spread of abusive/illegal activities. To\nthis end, this work proposes a machine learning-based detection model, which\nuses multiple attributes of users' online activity in order to identify whether\ntwo or more virtual identities belong to the same real natural person. The\nmodels efficacy is demonstrated on two cases on abusive and terrorism-related\nTwitter content.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:10:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chatzakou","Despoina",""],["Soler-Company","Juan",""],["Tsikrika","Theodora",""],["Wanner","Leo",""],["Vrochidis","Stefanos",""],["Kompatsiaris","Ioannis",""]]}
{"id":"2308.11685","submitter":"Jonas Jalowy","authors":"Brian C. Hall, Ching-Wei Ho, Jonas Jalowy, Zakhar Kabluchko","title":"Zeros of random polynomials undergoing the heat flow","comments":"56 pages with 9 Figures (and an animated figure in\n  \"poly_heat_flow_animated.pdf\" of the supplementary files). Comments always\n  welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.AP math.CA math.DS math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the evolution of the empirical distribution of the complex\nroots of high-degree random polynomials, when the polynomial undergoes the heat\nflow. In one prominent example of Weyl polynomials, the limiting zero\ndistribution evolves from the circular law into the elliptic law until it\ncollapses to the Wigner semicircle law, as was recently conjectured for\ncharacteristic polynomials of random matrices by Hall and Ho, 2022. Moreover,\nfor a general family of random polynomials with independent coefficients and\nisotropic limiting distribution of zeros, we determine the zero distribution of\nthe heat-evolved polynomials in terms of its logarithmic potential.\nFurthermore, we explicitly identify two critical time thresholds, at which\nsingularities develop and at which the limiting distribution collapses to the\nsemicircle law. Under mild conditions, we provide a complete characterization\nof the limiting distribution of heat-evolved random polynomials as a\npush-forward of the initial distribution under a transport map. Finally, we\ndiscuss the results from the perspectives of (partial) differential equations\n(in particular Hamilton--Jacobi equation and Burgers' equation), free\nprobability and optimal transport. The theory is accompanied by explicit\nexamples, simulations and conjectures.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:23:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hall","Brian C.",""],["Ho","Ching-Wei",""],["Jalowy","Jonas",""],["Kabluchko","Zakhar",""]]}
{"id":"2308.11686","submitter":"Matthias Kaminski","authors":"Markus A. G. Amano, Casey Cartwright, Matthias Kaminski, Jackson Wu","title":"Relativistic Hydrodynamics under Rotation: Prospects & Limitations from\n  a Holographic Perspective","comments":"38 pages, 14 figures, 10 tables, 5 appendices, ancillary data files","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The AdS/CFT correspondence, or holography, has provided numerous important\ninsights into the behavior of strongly-coupled many-body systems. Crucially, it\nhas provided a testing ground for the construction of new effective field\ntheories, especially those in the low frequency, long wavelength limit known as\nhydrodynamics. In this article we continue the study of strongly-coupled\nrotating fluids using holography and hydrodynamics. We provide an overview of\nrecent developments arising from the study of simply spinning Myers-Perry black\nholes. We review techniques to obtain hydrodynamic and non-hydrodynamic modes,\ndescribe how branch point singularities in the complex frequency and momentum\nspace limit the radius of convergence of the hydrodynamic gradient expansion,\nand outline the relation of pole-skipping in the linear response functions to\nearly time chaotic behavior.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:28:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Amano","Markus A. G.",""],["Cartwright","Casey",""],["Kaminski","Matthias",""],["Wu","Jackson",""]]}
{"id":"2308.11687","submitter":"Jakob Oldenburg","authors":"Cristina Caraci, Jakob Oldenburg, Benjamin Schlein","title":"Quantum Fluctuations of Many-Body Dynamics around the Gross-Pitaevskii\n  Equation","comments":"58 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the evolution of a gas of $N$ bosons in the three-dimensional\nGross-Pitaevskii regime (in which particles are initially trapped in a volume\nof order one and interact through a repulsive potential with scattering length\nof the order $1/N$). We construct a quasi-free approximation of the many-body\ndynamics, whose distance to the solution of the Schr\\\"odinger equation\nconverges to zero, as $N \\to \\infty$, in the $L^2 (\\mathbb{R}^{3N})$-norm. To\nachieve this goal, we let the Bose-Einstein condensate evolve according to a\ntime-dependent Gross-Pitaevskii equation. After factoring out the microscopic\ncorrelation structure, the evolution of the orthogonal excitations of the\ncondensate is governed instead by a Bogoliubov dynamics, with a time-dependent\ngenerator quadratic in creation and annihilation operators. As an application,\nwe show a central limit theorem for fluctuations of bounded observables around\ntheir expectation with respect to the Gross-Pitaevskii dynamics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 15:40:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Caraci","Cristina",""],["Oldenburg","Jakob",""],["Schlein","Benjamin",""]]}
{"id":"2308.11688","submitter":"Barry Simon","authors":"Michael Barnsley, Bruno Nachtergaele, Barry Simon","title":"Remembrances of Derek William Robinson (25 June 1935 - 31 August 2021)","comments":"This arXiv submission is posted primarily to make available some\n  additional material to what we prepared for the Derek Memorial article\n  published in the Notices of the AMS","journal-ref":"Notices A.M.S 70 (2023), 1252-1267","doi":null,"report-no":null,"categories":"math.HO math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This arXiv submission is posted primarily to make available some additional\nmaterial to what we prepared for the Derek Memorial article published in the\nNotices of the AMS. We start (with the permission of the AMS) with the text of\nour submission close to the final published version (which you can get online.\nAfter that we include some autobiographical notes that Derek dictated to Louisa\nBarnsley (whom we thank) during his final illness. Finally some unpublished\nnotes Derek wrote on the history of his seminal monographs with Bratelli. We\nthank Marion Robinson for permission and encouragement to post these items.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:19:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Barnsley","Michael",""],["Nachtergaele","Bruno",""],["Simon","Barry",""]]}
{"id":"2308.11689","submitter":"Patricia Cahn","authors":"Patricia Cahn, Gordana Matic, and Benjamin Ruppik","title":"Algorithms for Computing Invariants of Trisected Branched Covers","comments":"43 pages, 20 figures, 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give diagrammatic algorithms for computing the group trisection, homology\ngroups, and intersection form of a closed, orientable, smooth 4-manifold,\npresented as a branched cover of a bridge-trisected surface in\n$\\mathbb{S}^{4}$. The algorithm takes as input a tri-plane diagram, labelled\nwith permutations according to the Wirtinger relations. We apply our algorithm\nto several examples, including dihedral and cyclic covers of spun knots, cyclic\ncovers of Suciu's ribbon knots with the trefoil knot group, and an infinite\nfamily of irregular covers of the Stevedore disk double. As an application, we\ngive a fully automated algorithm for computing Kjuchukova's homotopy-ribbon\nobstruction for a $p$-colorable knot, given an extension of that coloring over\na ribbon surface in the 4-ball.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:33:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cahn","Patricia",""],["Matic","Gordana",""],["Ruppik","Benjamin",""]]}
{"id":"2308.11690","submitter":"Ian Cohen","authors":"Ian J. Cohen, Chris Arridge, Abigail Azari, Chris Bard, George Clark,\n  Frank Crary, Shannon Curry, Peter Delamere, Ryan M. Dewey, Gina A. DiBraccio,\n  Chuanfei Dong, Alexander Drozdov, Austin Egert, Rachael Filwett, Jasper\n  Halekas, Alexa Halford, Andr\\'ea Hughes, Katherine Garcia-Sage, Matina\n  Gkioulidou, Charlotte Goetz, Cesare Grava, Michael Hirsch, Hans Leo F.\n  Huybrighs, Peter Kollmann, Laurent Lamy, Wen Li, Michael Liemohn, Robert\n  Marshal, Adam Masters, R. T. James McAteer, Karan Molaverdikhani, Agnit\n  Mukhopadhyay, Romina Nikoukar, Larry Paxton, Leonardo H. Regoli, Elias\n  Roussos, Nick Schneider, Ali Sulaiman, Y. Sun, Jamey Szalay","title":"The case for studying other planetary magnetospheres and atmospheres in\n  Heliophysics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP physics.space-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Heliophysics is the field that \"studies the nature of the Sun, and how it\ninfluences the very nature of space - and, in turn, the atmospheres of\nplanetary bodies and the technology that exists there.\" However, NASA's\nHeliophysics Division tends to limit study of planetary magnetospheres and\natmospheres to only those of Earth. This leaves exploration and understanding\nof space plasma physics at other worlds to the purview of the Planetary Science\nand Astrophysics Divisions. This is detrimental to the study of space plasma\nphysics in general since, although some cross-divisional funding opportunities\ndo exist, vital elements of space plasma physics can be best addressed by\nextending the expertise of Heliophysics scientists to other stellar and\nplanetary magnetospheres. However, the diverse worlds within the solar system\nprovide crucial environmental conditions that are not replicated at Earth but\ncan provide deep insight into fundamental space plasma physics processes.\nStudying planetary systems with Heliophysics objectives, comprehensive\ninstrumentation, and new grant opportunities for analysis and modeling would\nenable a novel understanding of fundamental and universal processes of space\nplasma physics. As such, the Heliophysics community should be prepared to\nconsider, prioritize, and fund dedicated Heliophysics efforts to planetary\ntargets to specifically study space physics and aeronomy objectives.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:33:26 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 18:26:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cohen","Ian J.",""],["Arridge","Chris",""],["Azari","Abigail",""],["Bard","Chris",""],["Clark","George",""],["Crary","Frank",""],["Curry","Shannon",""],["Delamere","Peter",""],["Dewey","Ryan M.",""],["DiBraccio","Gina A.",""],["Dong","Chuanfei",""],["Drozdov","Alexander",""],["Egert","Austin",""],["Filwett","Rachael",""],["Halekas","Jasper",""],["Halford","Alexa",""],["Hughes","Andr\u00e9a",""],["Garcia-Sage","Katherine",""],["Gkioulidou","Matina",""],["Goetz","Charlotte",""],["Grava","Cesare",""],["Hirsch","Michael",""],["Huybrighs","Hans Leo F.",""],["Kollmann","Peter",""],["Lamy","Laurent",""],["Li","Wen",""],["Liemohn","Michael",""],["Marshal","Robert",""],["Masters","Adam",""],["McAteer","R. T. James",""],["Molaverdikhani","Karan",""],["Mukhopadhyay","Agnit",""],["Nikoukar","Romina",""],["Paxton","Larry",""],["Regoli","Leonardo H.",""],["Roussos","Elias",""],["Schneider","Nick",""],["Sulaiman","Ali",""],["Sun","Y.",""],["Szalay","Jamey",""]]}
{"id":"2308.11691","submitter":"Jingwei Zuo","authors":"George Arvanitakis, Jingwei Zuo, Mthandazo Ndhlovu and Hakim Hacid","title":"Practical Insights on Incremental Learning of New Human Physical\n  Activity on the Edge","comments":"Accepted by DSAA 2023 (Industrial Track)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Edge Machine Learning (Edge ML), which shifts computational intelligence from\ncloud-based systems to edge devices, is attracting significant interest due to\nits evident benefits including reduced latency, enhanced data privacy, and\ndecreased connectivity reliance. While these advantages are compelling, they\nintroduce unique challenges absent in traditional cloud-based approaches. In\nthis paper, we delve into the intricacies of Edge-based learning, examining the\ninterdependencies among: (i) constrained data storage on Edge devices, (ii)\nlimited computational power for training, and (iii) the number of learning\nclasses. Through experiments conducted using our MAGNETO system, that focused\non learning human activities via data collected from mobile sensors, we\nhighlight these challenges and offer valuable perspectives on Edge ML.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:40:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Arvanitakis","George",""],["Zuo","Jingwei",""],["Ndhlovu","Mthandazo",""],["Hacid","Hakim",""]]}
{"id":"2308.11692","submitter":"Laurentiu Rodina","authors":"Li-Yuan Chiang, Tzu-Chen Huang, Yu-tin Huang, Wei Li, Laurentiu\n  Rodina, He-Chen Weng","title":"The Geometry of the Modular Bootstrap","comments":"25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the geometry behind the modular bootstrap and its image in the\nspace of Taylor coefficients of the torus partition function. In the first\npart, we identify the geometry as an intersection of planes with the convex\nhull of moment curves on $R^+{\\otimes}\\mathbb{Z}$, with boundaries\ncharacterized by the total positivity of generalized Hankel matrices. We phrase\nthe Hankel constraints as a semi-definite program, which has several\nadvantages, such as constant computation time with increasing central charge.\nWe derive bounds on the gap, twist-gap, and the space of Taylor coefficients\nthemselves. We find that if the gap is above $\\Delta^*_{gap}$, where\n$\\frac{c{-}1}{12}<\\Delta^*_{gap}< \\frac{c}{12}$, all coefficients become\nbounded on both sides and kinks develop in the space. In the second part, we\npropose an analytic method of imposing the integrality condition for the\ndegeneracy number in the spinless bootstrap, which leads to a non-convex\ngeometry. We find that even at very low derivative order this condition rules\nout regions otherwise allowed by bootstraps at high derivative order.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:52:18 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chiang","Li-Yuan",""],["Huang","Tzu-Chen",""],["Huang","Yu-tin",""],["Li","Wei",""],["Rodina","Laurentiu",""],["Weng","He-Chen",""]]}
{"id":"2308.11693","submitter":"Sylvain Prolhac","authors":"Sylvain Prolhac","title":"Probability of a single current","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Riemann surface associated with counting the current between two states\nof an underlying Markov process is hyperelliptic. We explore the consequences\nof this property for the time-dependent probability of that current for generic\nMarkov processes. When the system is prepared in its stationary state, the\nrelevant meromorphic differential is in particular fully characterized by the\nprecise identification of all its poles and zeroes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:04:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Prolhac","Sylvain",""]]}
{"id":"2308.11694","submitter":"Petar Orli\\'c","authors":"Maarten Derickx, Petar Orli\\'c","title":"Modular curves $X_0(N)$ with infinitely many quartic points","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We determine all modular curves $X_0(N)$ with infinitely many quartic points.\nTo do this, we define a pairing that induces a quadratic form representing all\npossible degrees of a morphism from $X_0(N)$ to a positive rank elliptic curve.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:11:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Derickx","Maarten",""],["Orli\u0107","Petar",""]]}
{"id":"2308.11695","submitter":"Dr. Sudhaker Upadhyay","authors":"Jyotish Kumar, Sudhaker Upadhyay and Himanshu Kumar Sudhanshu","title":"Small Black String Thermodynamics","comments":"12 pages, 6 captioned figures, published in Physica Scripta","journal-ref":"Phys. Scr. 98 (2023) 095306","doi":"10.1088/1402-4896/aceec3","report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a cylindrically symmetric solution for the field equations of\nEinstein-Hilbert action with a negative cosmological constant in four\ndimensions. The small statistical fluctuation in the equilibrium thermodynamics\nof the black string solution is investigated. The small black string under the\ninfluence of small statistical fluctuation also follows the first law of\nthermodynamics. The behaviour of equation of states for black string changes\nsignificantly due to the fluctuation. The fluctuation causes instability to the\nsmall-sized black string only. Assuming the black string is fluid, the\ncompressibility of the black string is inversely proportional to the\nfluctuation parameter.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:27:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kumar","Jyotish",""],["Upadhyay","Sudhaker",""],["Sudhanshu","Himanshu Kumar",""]]}
{"id":"2308.11696","submitter":"Leshem Choshen","authors":"Yotam Perlitz, Elron Bandel, Ariel Gera, Ofir Arviv, Liat Ein-Dor,\n  Eyal Shnarch, Noam Slonim, Michal Shmueli-Scheuer, Leshem Choshen","title":"Efficient Benchmarking (of Language Models)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing versatility of language models LMs has given rise to a new\nclass of benchmarks that comprehensively assess a broad range of capabilities.\nSuch benchmarks are associated with massive computational costs reaching\nthousands of GPU hours per model. However the efficiency aspect of these\nevaluation efforts had raised little discussion in the literature. In this work\nwe present the problem of Efficient Benchmarking namely intelligently reducing\nthe computation costs of LM evaluation without compromising reliability. Using\nthe HELM benchmark as a test case we investigate how different benchmark design\nchoices affect the computation-reliability tradeoff. We propose to evaluate the\nreliability of such decisions by using a new measure Decision Impact on\nReliability DIoR for short. We find for example that the current leader on HELM\nmay change by merely removing a low-ranked model from the benchmark and observe\nthat a handful of examples suffice to obtain the correct benchmark ranking.\nConversely a slightly different choice of HELM scenarios varies ranking widely.\nBased on our findings we outline a set of concrete recommendations for more\nefficient benchmark design and utilization practices leading to dramatic cost\nsavings with minimal loss of benchmark reliability often reducing computation\nby x100 or more.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Perlitz","Yotam",""],["Bandel","Elron",""],["Gera","Ariel",""],["Arviv","Ofir",""],["Ein-Dor","Liat",""],["Shnarch","Eyal",""],["Slonim","Noam",""],["Shmueli-Scheuer","Michal",""],["Choshen","Leshem",""]]}
{"id":"2308.11697","submitter":"Brian Shotwell","authors":"Julian J. Dukes, Brian Shotwell","title":"A family of repulsive neutral conductor geometries via abstract vector\n  spaces","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently it was shown that it is possible for a neutral, isolated conductor\nto repel a point charge (or, a point dipole). Here we prove this fact using\ngeneral properties of vectors and operators in an inner-product space. We find\nthat a family of neutral, isolated conducting surface geometries, whose shape\nlies somewhere between a hemispherical bowl and an ovoid, will repel a point\ncharge. In addition, we find another family of surfaces (with a different\nshape) that will repel a point dipole. The latter geometry can lead to Casimir\nrepulsion.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dukes","Julian J.",""],["Shotwell","Brian",""]]}
{"id":"2308.11698","submitter":"Tales Rick Perche","authors":"T. Rick Perche, Jos\\'e Polo-G\\'omez, Bruno de S. L. Torres, Eduardo\n  Mart\\'in-Mart\\'inez","title":"Particle Detectors from Localized Quantum Field Theories","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a fully relativistic model for localized probes in quantum field\ntheory. Furthermore, we show that it is possible to obtain particle detector\nmodels from localized quantum field theories that interact with a free quantum\nfield. In particular, a particle detector model is obtained when one traces out\nover inaccessible degrees of freedom of the localized field. This gives rise to\na particle detector model, that is, a quantum degree of freedom that couples to\na free field theory in an extended region of spacetime. Moreover, we show that\nthe predictions of traditional particle detector models and fully relativistic\nlocalized fields completely coincide to leading order in perturbation theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Perche","T. Rick",""],["Polo-G\u00f3mez","Jos\u00e9",""],["Torres","Bruno de S. L.",""],["Mart\u00edn-Mart\u00ednez","Eduardo",""]]}
{"id":"2308.11699","submitter":"Abygail Waggoner","authors":"Abygail R. Waggoner, L. Ilsedore Cleeves, Ryan A. Loomis, Yuri Aikawa,\n  Jaehan Bae, Jennifer B. Bergner, Alice S. Booth, Jenny K. Calahan, Gianni\n  Cataldi, Charles J. Law, Romane Le Gal, Feng Long, Karin I. \\\"Oberg, Richard\n  Teague, and David J. Wilner","title":"MAPS: Constraining Serendipitous Time Variability in Protoplanetary Disk\n  Molecular Ion Emission","comments":"Accepted for publication in ApJ, 18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Theoretical models and observations suggest that the abundances of molecular\nions in protoplanetary disks should be highly sensitive to the variable\nionization conditions set by the young central star. We present a search for\ntemporal flux variability of HCO+ J=1-0, which was observed as a part of the\nMolecules with ALMA at Planet-forming Scales (MAPS) ALMA Large Program. We\nsplit out and imaged the line and continuum data for each individual day the\nfive sources were observed (HD 163296, AS 209, GM Aur, MWC 480, and IM Lup,\nwith between 3 to 6 unique visits per source). Significant enhancement\n(>3\\sigma) was not observed, but we find variations in the spectral profiles in\nall five disks. Variations in AS 209, GM Aur, and HD 163296 are tentatively\nattributed to variations in HCO+ flux, while variations in IM Lup and MWC 480\nare most likely introduced by differences in the \\textit{uv} coverage, which\nimpact the amount of recovered flux during imaging. The tentative detections\nand low degree of variability are consistent with expectations of X-ray flare\ndriven HCO+ variability, which requires relatively large flares to enhance the\nHCO+ rotational emission at significant (>20%) levels. These findings also\ndemonstrate the need for dedicated monitoring campaigns with high signal to\nnoise ratios to fully characterize X-ray flare driven chemistry.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Waggoner","Abygail R.",""],["Cleeves","L. Ilsedore",""],["Loomis","Ryan A.",""],["Aikawa","Yuri",""],["Bae","Jaehan",""],["Bergner","Jennifer B.",""],["Booth","Alice S.",""],["Calahan","Jenny K.",""],["Cataldi","Gianni",""],["Law","Charles J.",""],["Gal","Romane Le",""],["Long","Feng",""],["\u00d6berg","Karin I.",""],["Teague","Richard",""],["Wilner","David J.",""]]}
{"id":"2308.11700","submitter":"Ian Pang","authors":"Ian Pang, John Andrew Raine, David Shih","title":"SuperCalo: Calorimeter shower super-resolution","comments":"15 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det cs.LG hep-ex hep-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Calorimeter shower simulation is a major bottleneck in the Large Hadron\nCollider computational pipeline. There have been recent efforts to employ\ndeep-generative surrogate models to overcome this challenge. However, many of\nbest performing models have training and generation times that do not scale\nwell to high-dimensional calorimeter showers. In this work, we introduce\nSuperCalo, a flow-based super-resolution model, and demonstrate that\nhigh-dimensional fine-grained calorimeter showers can be quickly upsampled from\ncoarse-grained showers. This novel approach presents a way to reduce\ncomputational cost, memory requirements and generation time associated with\nfast calorimeter simulation models. Additionally, we show that the showers\nupsampled by SuperCalo possess a high degree of variation. This allows a large\nnumber of high-dimensional calorimeter showers to be upsampled from much fewer\ncoarse showers with high-fidelity, which results in additional reduction in\ngeneration time.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pang","Ian",""],["Raine","John Andrew",""],["Shih","David",""]]}
{"id":"2308.11701","submitter":"Jerome P. Gauntlett","authors":"Pietro Benetti Genolini, Jerome P. Gauntlett and James Sparks","title":"Equivariant localization for AdS/CFT","comments":"60 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explain how equivariant localization may be applied to AdS/CFT to compute\nvarious BPS observables in gravity, such as central charges and conformal\ndimensions of chiral primary operators, without solving the supergravity\nequations. The key ingredient is that supersymmetric AdS solutions with an\nR-symmetry are equipped with a set of equivariantly closed forms. These may in\nturn be used to impose flux quantization and compute observables for\nsupergravity solutions, using only topological information and the\nBerline--Vergne--Atiyah--Bott fixed point formula. We illustrate the formalism\nby considering $AdS_5\\times M_6$ and $AdS_3\\times M_8$ solutions of $D=11$\nsupergravity. As well as recovering results for many classes of well-known\nsupergravity solutions, without using any knowledge of their explicit form, we\nalso compute central charges for which explicit supergravity solutions have not\nbeen constructed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Genolini","Pietro Benetti",""],["Gauntlett","Jerome P.",""],["Sparks","James",""]]}
{"id":"2308.11702","submitter":"Indranil Halder","authors":"Indranil Halder, Daniel L. Jafferis","title":"Double winding condensate CFT","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We conjecture a two-dimensional conformal field theory built out of a linear\ndilaton and a compact $\\beta\\gamma$ system deformed by winding condensates on\neach of the compact cycles. In particular, explicit expressions of the residues\nof the correlation functions are provided. As a worldsheet theory, it describes\na stringy black hole in AdS$_3$ (supported by the Kalb-Ramond flux) at the\nHawking-Page temperature. It is expected to be connected to the\nHorowitz-Polchinski-like solution near the Hagedorn temperature of thermal\nAdS$_3$ and Euclidean BTZ blackhole as we vary the temperature.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Halder","Indranil",""],["Jafferis","Daniel L.",""]]}
{"id":"2308.11703","submitter":"Susanne Westhoff","authors":"Sebastian Bruggisser, Lara Grabitz, Susanne Westhoff","title":"Global Analysis of the ALP Effective Theory","comments":"29 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We perform a global fit of the effective Lagrangian for axion-like particles\n(ALPs) to data. By combining LHC observables from top physics, dijet and\ndi-boson production with electroweak precision observables, we resolve the full\nparameter space of ALPs with flavor-universal couplings. Using the\nrenormalization group to evolve the effective ALP couplings to low energies\nallows us to investigate the impact of flavor observables on the global\nanalysis. We show that resonance searches in $B\\to K$ meson decays\nsignificantly enhance the sensitivity to ALPs with sub-GeV masses. The lifetime\nof the ALP plays a crucial role in resolving the multi-dimensional parameter\nspace with searches for prompt, displaced and invisible ALP decays. Our\nanalysis points out the differences in probing an effective theory with new\nlight particles, compared to scenarios with only non-resonant effects of heavy\nparticles at low energies, as in the Standard Model Effective Field Theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bruggisser","Sebastian",""],["Grabitz","Lara",""],["Westhoff","Susanne",""]]}
{"id":"2308.11704","submitter":"Chethan Krishnan","authors":"Suman Das, Sumit K. Garg, Chethan Krishnan, Arnab Kundu","title":"What is the Simplest Linear Ramp?","comments":"16 pages, many plots, v2: minor corrections, references","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss conditions under which a deterministic sequence of real numbers,\ninterpreted as the set of eigenvalues of a Hamiltonian, can exhibit features\nusually associated to random matrix spectra. A key diagnostic is the spectral\nform factor (SFF) -- a linear ramp in the SFF is often viewed as a signature of\nrandom matrix behavior. Based on various explicit examples, we observe\nconditions for linear and power law ramps to arise in deterministic spectra. We\nnote that a very simple spectrum with a linear ramp is $E_n \\sim \\log n$.\nDespite the presence of ramps, these sequences do $not$ exhibit conventional\nlevel repulsion, demonstrating that the lore about their concurrence needs\nrefinement. However, when a small noise correction is added to the spectrum,\nthey lead to clear level repulsion as well as the (linear) ramp. We note some\nremarkable features of logarithmic spectra, apart from their linear ramps: they\nare closely related to normal modes of black hole stretched horizons, and their\npartition function with argument $s=\\beta+it$ is the Riemann zeta function\n$\\zeta(s)$. An immediate consequence is that the spectral form factor is simply\n$\\sim |\\zeta(it)|^2$. Our observation that log spectra have a linear ramp, is\nclosely related to the Lindel\\\"of hypothesis on the growth of the zeta\nfunction. With elementary numerics, we check that the slope of a best fit line\nthrough $|\\zeta(it)|^2$ on a log-log plot is indeed $1$, to the fourth decimal.\nWe also note that truncating the Riemann zeta function sum at a finite integer\n$N$ causes the would-be-eternal ramp to end on a plateau.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:01 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:40:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Das","Suman",""],["Garg","Sumit K.",""],["Krishnan","Chethan",""],["Kundu","Arnab",""]]}
{"id":"2308.11705","submitter":"Jonathan Steiner","authors":"Stefan Antusch, Kevin Hinze, Shaikh Saad, Jonathan Steiner","title":"A Generalised Missing Partner Mechanism for SU(5) GUT Inflation","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalise the Missing Partner Mechanism to split the electron-like states\nfrom the coloured ones of vectorlike SU(5) 10-plets without fine-tuning.\nTogether with the extra light weak doublets from the Double Missing Partner\nMechanism (DMPM), this realises gauge coupling unification in the presence of a\nlight weak triplet and colour octet, the characteristic light relics from the\nadjoint in SU(5) GUT Inflation models. Additionally, we show how the vectorlike\n10-plets may generate realistic fermion masses while the DMPM ensures that\ndimension five nucleon decay is suppressed. A discovery of the light relic\nstates at future colliders would provide a \"smoking gun\" signal of the\nscenario.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Antusch","Stefan",""],["Hinze","Kevin",""],["Saad","Shaikh",""],["Steiner","Jonathan",""]]}
{"id":"2308.11706","submitter":"Clay C\\'ordova","authors":"Clay Cordova, Po-Shen Hsin, Carolyn Zhang","title":"Anomalies of Non-Invertible Symmetries in (3+1)d","comments":"57 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomalies of global symmetries are important tools for understanding the\ndynamics of quantum systems. We investigate anomalies of non-invertible\nsymmetries in 3+1d using 4+1d bulk topological quantum field theories given by\nAbelian two-form gauge theories, with a 0-form permutation symmetry. Gauging\nthe 0-form symmetry gives the 4+1d \"inflow\" symmetry topological field theory\nfor the non-invertible symmetry. We find a two levels of anomalies: (1) the\nbulk may fail to have an appropriate set of loop excitations which can condense\nto trivialize the boundary dynamics, and (2) the \"Frobenius-Schur indicator\" of\nthe non-invertible symmetry (generalizing the Frobenius-Schur indicator of 1+1d\nfusion categories) may be incompatible with trivial boundary dynamics. As a\nconsequence we derive conditions for non-invertible symmetries in 3+1d to be\ncompatible with symmetric gapped phases, and invertible gapped phases. Along\nthe way, we see that the defects characterizing $\\mathbb{Z}_{4}$ ordinary\nsymmetry host worldvolume theories with time-reversal symmetry $\\mathsf{T}$\nobeying the algebra $\\mathsf{T}^{2}=C$ or $\\mathsf{T}^{2}=(-1)^{F}C,$ with $C$\na unitary charge conjugation symmetry. We classify the anomalies of this\nsymmetry algebra in 2+1d and further use these ideas to construct 2+1d\ntopological orders with non-invertible time-reversal symmetry that permutes\nanyons. As a concrete realization of our general discussion, we construct new\nlattice Hamiltonian models in 3+1d with non-invertible symmetry, and constrain\ntheir dynamics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cordova","Clay",""],["Hsin","Po-Shen",""],["Zhang","Carolyn",""]]}
{"id":"2308.11707","submitter":"Francesco Benini","authors":"Andrea Antinucci, Francesco Benini, Christian Copetti, Giovanni\n  Galati, Giovanni Rizi","title":"Anomalies of non-invertible self-duality symmetries: fractionalization\n  and gauging","comments":"50 pages + appendices, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study anomalies of non-invertible duality symmetries in both 2d and 4d,\nemploying the tool of the Symmetry TFT. In the 2d case we rephrase the known\nobstruction theory for the Tambara-Yamagami fusion category in a way easily\ngeneralizable to higher dimensions. In both cases we find two obstructions to\ngauging duality defects. The first obstruction requires the existence of a\nduality-invariant Lagrangian algebra in a certain Dijkgraaf-Witten theory in\none dimension more. In particular, intrinsically non-invertible (a.k.a. group\ntheoretical) duality symmetries are necessarily anomalous. The second\nobstruction requires the vanishing of a pure anomaly for the invertible duality\nsymmetry. This however depends on further data. In 2d this is specified by a\nchoice of equivariantization for the duality-invariant Lagrangian algebra. We\npropose and verify that this is equivalent to a choice of symmetry\nfractionalization for the invertible duality symmetry. The latter formulation\nhas a natural generalization to 4d and allows us to give a compact\ncharacterization of the anomaly. We comment on various possible applications of\nour results to self-dual theories.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Antinucci","Andrea",""],["Benini","Francesco",""],["Copetti","Christian",""],["Galati","Giovanni",""],["Rizi","Giovanni",""]]}
{"id":"2308.11708","submitter":"Christopher K. Long MSc.","authors":"Christopher K. Long, Kieran Dalton, Crispin H. W. Barnes, David R. M.\n  Arvidsson-Shukur, Normann Mertig","title":"Layering and subpool exploration for adaptive Variational Quantum\n  Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise","comments":"19 + (21) pages, 16 + (4) figs, comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Adaptive variational quantum eigensolvers (ADAPT-VQEs) are promising\ncandidates for simulations of strongly correlated systems on near-term quantum\nhardware. To further improve the noise resilience of these algorithms, recent\nefforts have been directed towards compactifying, or layering, their ansatz\ncircuits. Here, we broaden the understanding of the algorithmic layering\nprocess in three ways. First, we investigate the non-commutation relations\nbetween the different elements that are used to build ADAPT-VQE ans\\\"atze.\nDoing so, we develop a framework for studying and developing layering\nalgorithms, which produce shallower circuits. Second, based on this framework,\nwe develop a new subroutine that can reduce the number of quantum-processor\ncalls by optimizing the selection procedure with which a variational quantum\nalgorithm appends ansatz elements. Third, we provide a thorough numerical\ninvestigation of the noise-resilience improvement available via layering the\ncircuits of ADAPT-VQE algorithms. We find that layering leads to an improved\nnoise resilience with respect to amplitude-damping and dephasing noise, which,\nin general, affect idling and non-idling qubits alike. With respect to\ndepolarizing noise, which tends to affect only actively manipulated qubits, we\nobserve no advantage of layering.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Long","Christopher K.",""],["Dalton","Kieran",""],["Barnes","Crispin H. W.",""],["Arvidsson-Shukur","David R. M.",""],["Mertig","Normann",""]]}
{"id":"2308.11709","submitter":"Laura Keating","authors":"Laura C. Keating, Ewald Puchwein, James S. Bolton, Martin G. Haehnelt,\n  Girish Kulkarni","title":"Investigating the characteristic shape and scatter of intergalactic\n  damping wings during reionization","comments":"5 pages, 4 figures. Submitted to MNRAS Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ly$\\alpha$ damping wings in the spectra of bright objects at high redshift\nare a useful probe of the ionization state of the intergalactic medium during\nthe reionization epoch. It has recently been noted that, despite the\ninhomogeneous nature of reionization, these damping wings have a characteristic\nshape which is a strong function of the volume-weighted average neutral\nhydrogen fraction of the intergalactic medium. We present here a closer\nexamination of this finding using a simulation of patchy reionization from the\nSherwood-Relics simulation suite. We show that the characteristic shape and\nscatter of the damping wings are determined by the average neutral hydrogen\ndensity along the line of sight, weighted by its contribution to the optical\ndepth producing the damping wing. We find that there is a redshift dependence\nin the characteristic shape due to the expansion of the Universe. Finally, we\nshow that it is possible to differentiate between the shapes of damping wings\nin galaxies and young (or faint) quasars at different points in the\nreionization history at large velocity offsets from the point where the\ntransmission first reaches zero.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Keating","Laura C.",""],["Puchwein","Ewald",""],["Bolton","James S.",""],["Haehnelt","Martin G.",""],["Kulkarni","Girish",""]]}
{"id":"2308.11710","submitter":"David D. Awschalom","authors":"Masaya Fukami, Jonathan C. Marcks, Denis R. Candido, Leah R. Weiss,\n  Benjamin Soloway, Sean E. Sullivan, Nazar Delegan, F. Joseph Heremans,\n  Michael E. Flatt\\'e, and David D. Awschalom","title":"Magnon-mediated qubit coupling determined via dissipation measurements","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Controlled interaction between localized and delocalized solid-state spin\nsystems offers a compelling platform for on-chip quantum information processing\nwith quantum spintronics. Hybrid quantum systems (HQSs) of localized\nnitrogen-vacancy (NV) centers in diamond and delocalized magnon modes in\nferrimagnets-systems with naturally commensurate energies-have recently\nattracted significant attention, especially for interconnecting isolated spin\nqubits at length-scales far beyond those set by the dipolar coupling. However,\ndespite extensive theoretical efforts, there is a lack of experimental\ncharacterization of the magnon-mediated interaction between NV centers, which\nis necessary to develop such hybrid quantum architectures. Here, we\nexperimentally determine the magnon-mediated NV-NV coupling from the\nmagnon-induced self-energy of NV centers. Our results are quantitatively\nconsistent with a model in which the NV center is coupled to magnons by dipolar\ninteractions. This work provides a versatile tool to characterize HQSs in the\nabsence of strong coupling, informing future efforts to engineer entangled\nsolid-state systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fukami","Masaya",""],["Marcks","Jonathan C.",""],["Candido","Denis R.",""],["Weiss","Leah R.",""],["Soloway","Benjamin",""],["Sullivan","Sean E.",""],["Delegan","Nazar",""],["Heremans","F. Joseph",""],["Flatt\u00e9","Michael E.",""],["Awschalom","David D.",""]]}
{"id":"2308.11711","submitter":"Dominik Werner Wolf","authors":"Dominik Werner Wolf and Markus Ulrich and Nikhil Kapoor","title":"Sensitivity analysis of AI-based algorithms for autonomous driving on\n  optical wavefront aberrations induced by the windshield","comments":"Accepted at the IEEE ICCV 2023 - BRAVO workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous driving perception techniques are typically based on supervised\nmachine learning models that are trained on real-world street data. A typical\ntraining process involves capturing images with a single car model and\nwindshield configuration. However, deploying these trained models on different\ncar types can lead to a domain shift, which can potentially hurt the neural\nnetworks performance and violate working ADAS requirements. To address this\nissue, this paper investigates the domain shift problem further by evaluating\nthe sensitivity of two perception models to different windshield\nconfigurations. This is done by evaluating the dependencies between neural\nnetwork benchmark metrics and optical merit functions by applying a Fourier\noptics based threat model. Our results show that there is a performance gap\nintroduced by windshields and existing optical metrics used for posing\nrequirements might not be sufficient.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 17:01:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wolf","Dominik Werner",""],["Ulrich","Markus",""],["Kapoor","Nikhil",""]]}
{"id":"2308.11712","submitter":"Maciek Wielgus","authors":"Maciek Wielgus, Sara Issaoun, Ivan Marti-Vidal, Razieh Emami, Monika\n  Moscibrodzka, Christiaan D. Brinkerink, Ciriaco Goddi, and Ed Fomalont","title":"The internal Faraday screen of Sagittarius A*","comments":"submitted to A&A, comments very welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on 85-101 GHz light curves of the Galactic Center supermassive\nblack hole, Sagittarius A* (Sgr A*), observed in April 2017 with the Atacama\nLarge Millimeter/submillimeter Array (ALMA). This study of high-cadence\nfull-Stokes data provides new measurements of the fractional linear\npolarization at a 1-2% level resolved in 4 s time segments, and stringent upper\nlimits on the fractional circular polarization at 0.3%. We compare these\nfindings to ALMA light curves of Sgr A* at 212-230 GHz observed three days\nlater, characterizing a steep depolarization of the source at frequencies below\nabout 150 GHz. We obtain time-dependent rotation measure (RM) measurements,\nwith the mean RM at 85-101 GHz being a factor of two lower than that at 212-230\nGHz. Together with the rapid temporal variability of the RM and its different\nstatistical characteristics in both frequency bands, these results indicate\nthat the Faraday screen in Sgr A* is largely of internal character, with about\nhalf of the Faraday rotation taking place inside the inner 10 gravitational\nradii, contrary to the common external Faraday screen assumption. We then\ndemonstrate how this observation can be reconciled with theoretical models of\nradiatively inefficient accretion flows for a reasonable set of physical\nparameters. Comparisons with numerical general relativistic magnetohydrodynamic\nsimulations suggest that the innermost part of the accretion flow in Sgr A* is\nmuch less variable than what these models predict, in particular, the observed\nmagnetic field structure appears to be coherent and persistent.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:01:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wielgus","Maciek",""],["Issaoun","Sara",""],["Marti-Vidal","Ivan",""],["Emami","Razieh",""],["Moscibrodzka","Monika",""],["Brinkerink","Christiaan D.",""],["Goddi","Ciriaco",""],["Fomalont","Ed",""]]}
{"id":"2308.11713","submitter":"Oscar Garcia-Montero","authors":"Oscar Garcia-Montero, Hannah Elfner and S\\\"oren Schlichting","title":"The McDIPPER: A novel saturation-based 3+1D initial state model for\n  Heavy Ion Collisions","comments":"18 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new 3D resolved model for the initial state of ultrarelativistic\nheavy-ion collisions, based on the $k_\\perp$-factorized Color Glass Condensate\nhybrid approach. The McDIPPER framework responds to the need for a\nrapidity-resolved initial-state Monte Carlo event generator which can deposit\nthe relevant conserved charges (energy, charge and baryon densities) both in\nthe midrapidity and forward/backward regions of the collision. This\nevent-by-event generator computes the gluon and (anti-) quark phase-space\ndensities using the IP-Sat model, from where the relevant conserved charges can\nbe computed directly. In the present work we have included the leading order\ncontributions to the light flavor parton densities. As a feature, the model can\nbe systematically improved in the future by adding next-to-leading order\ncalculations (in the CGC hybrid framework), and extended to lower energies by\nincluding sub-eikonal corrections the channels included. We present relevant\nobservables, such as the eccentricities and flow decorrelation, as tests of\nthis new approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:01:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Garcia-Montero","Oscar",""],["Elfner","Hannah",""],["Schlichting","S\u00f6ren",""]]}
{"id":"2308.11714","submitter":"Gabriele Cugno","authors":"Gabriele Cugno, Yifan Zhou, Thanawuth Thanathibodee, Per\n  Calissendorff, Michael R. Meyer, Suzan Edwards, Jaehan Bae, Myriam Benisty,\n  Edwin Bergin, Matthew De Furio, Stefano Facchini, Jared R. Males, Laird M.\n  Close, Richard D. Teague, Olivier Guyon, Sebastiaan Y. Haffert, Alexander D.\n  Hedglen, Maggie Kautz, Andr\\'es Izquierdo, Joseph D. Long, Jennifer Lumbres,\n  Avalon L. McLeod, Logan A. Pearce, Lauren Schatz, and Kyle Van Gorkom","title":"MagAO-X and HST high-contrast imaging of the AS209 disk at H$\\alpha$","comments":"13 pages, 5 figures, accepted for publication in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The detection of emission lines associated with accretion processes is a\ndirect method for studying how and where gas giant planets form, how young\nplanets interact with their natal protoplanetary disk and how volatile delivery\nto their atmosphere takes place. H$\\alpha$ ($\\lambda=0.656\\,\\mu$m) is expected\nto be the strongest accretion line observable from the ground with adaptive\noptics systems, and is therefore the target of specific high-contrast imaging\ncampaigns. We present MagAO-X and HST data obtained to search for H$\\alpha$\nemission from the previously detected protoplanet candidate orbiting AS209,\nidentified through ALMA observations. No signal was detected at the location of\nthe candidate, and we provide limits on its accretion. Our data would have\ndetected an H$\\alpha$ emission with $F_\\mathrm{H\\alpha}>2.5\\pm0.3\n\\times10^{-16}$ erg s$^{-1}$ cm$^{-2}$, a factor 6.5 lower than the HST flux\nmeasured for PDS70b (Zhou et al., 2021). The flux limit indicates that if the\nprotoplanet is currently accreting it is likely that local extinction from\ncircumstellar and circumplanetary material strongly attenuates its emission at\noptical wavelengths. In addition, the data reveal the first image of the jet\nnorth of the star as expected from previous detections of forbidden lines.\nFinally, this work demonstrates that current ground-based observations with\nextreme adaptive optics systems can be more sensitive than space-based\nobservations, paving the way to the hunt for small planets in reflected light\nwith extremely large telescopes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:02:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cugno","Gabriele",""],["Zhou","Yifan",""],["Thanathibodee","Thanawuth",""],["Calissendorff","Per",""],["Meyer","Michael R.",""],["Edwards","Suzan",""],["Bae","Jaehan",""],["Benisty","Myriam",""],["Bergin","Edwin",""],["De Furio","Matthew",""],["Facchini","Stefano",""],["Males","Jared R.",""],["Close","Laird M.",""],["Teague","Richard D.",""],["Guyon","Olivier",""],["Haffert","Sebastiaan Y.",""],["Hedglen","Alexander D.",""],["Kautz","Maggie",""],["Izquierdo","Andr\u00e9s",""],["Long","Joseph D.",""],["Lumbres","Jennifer",""],["McLeod","Avalon L.",""],["Pearce","Logan A.",""],["Schatz","Lauren",""],["Van Gorkom","Kyle",""]]}
{"id":"2308.11715","submitter":"Andrew Fitzpatrick","authors":"A. Liam Fitzpatrick and Nathan Benjamin","title":"Higher $d$ Eisenstein Series and a Duality-Invariant Distance Measure","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Petersson inner product is a natural inner product on the space of\nmodular invariant functions. We describe an algebraic procedure for evaluating\nthe inner product between two modular functions in the case where at least one\nof them is the partition function of a Narain CFT with target-space dimension\n$c$. We apply this procedure to obtain a formula, written as a convergent sum\nover elementary functions, for the Eisenstein series $E_s(G,B)$ of a general\npoint in Narain moduli space. We also discuss the utility of the Petersson\ninner product as a distance measure on the space of 2d CFTs, and apply our\nprocedure to evaluate this distance in various examples.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:03:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fitzpatrick","A. Liam",""],["Benjamin","Nathan",""]]}
{"id":"2308.11716","submitter":"David Berenstein","authors":"David Berenstein, Hiroki Kawai","title":"Integrable Spin Chains from large-$N$ QCD at strong coupling","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a spin chain for a confining string that arises at first order in\ndegenerate perturbation from the strong-coupling expansion of the\nKogut-Susskind Hamiltonian on a square lattice in the leading large $N$\nexpansion. We show some subsectors are integrable and that with a relaxed\nconstraint related to zigzag symmetry, the full spin chain is integrable in\narbitrary dimensions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:04:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Berenstein","David",""],["Kawai","Hiroki",""]]}
{"id":"2308.11717","submitter":"Jin Koda","authors":"Jin Koda and Jonathan Tan","title":"On the Lifetime of Molecular Clouds with the \"Tuning-Fork\" Analysis","comments":"Submitted to ApJ, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The \"tuning-fork\" (TF) analysis of CO and Halpha emission has been used to\nestimate the lifetimes of molecular clouds in nearby galaxies. With simple\nmodel calculations, we show that this analysis does not necessarily estimate\ncloud lifetimes, but instead captures a duration of the cloud evolutionary\ncycle, from dormant to star forming, and then back to a dormant phase. We adopt\na hypothetical setup in which molecular clouds (e.g., traced in CO) live\nforever and form stars (e.g., HII regions) at some frequency, which then drift\naway from the clouds. The TF analysis still returns a timescale for the\nimmortal clouds. This model requires drifting motion to separate the newborn\nstars from the clouds, and we discuss its origin. We also discuss the physical\norigin of the characteristic spatial separation term in the TF analysis and a\nbias due to systematic error in the determination of the reference timescale.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:04:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Koda","Jin",""],["Tan","Jonathan",""]]}
{"id":"2308.11718","submitter":"Dillon Snyder","authors":"Dillon Snyder","title":"Products of $p$-Adic Valuation Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of prime divisibility plays a crucial role in number theory. The\n$p$-adic valuation of a number is the highest power of a prime, $p$, that\ndivides that number. Using this valuation, we construct $p$-adic valuation\ntrees to visually represent the valuations of a sequence. We investigate how\nnodes split on trees generated by linear functions with rational coefficients,\nas well as those formed from a product of linear or lower degree polynomials.\nWe describe the infinite branches of these polynomial trees and the valuations\nof their terminating nodes.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:07:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Snyder","Dillon",""]]}
{"id":"2308.11719","submitter":"Suvikranth Gera","authors":"Suvikranth Gera, Poulami Dutta Roy","title":"Black holes in degenerate Einstein Gauss-Bonnet gravity: Can QNMs\n  distinguish them from GR?","comments":"31 pages, 15 figures , 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this study, for the first time, we analyse the quasinormal modes of black\nholes occurring within the framework of degenerate gravity. We investigate the\nproperties of the asymptotically flat spacetimes introduced recently in [JCAP\n02(2022)02] that satisfy degenerate Einstein Gauss-Bonnet(dEGB) action and\nbelong to a much larger class of solutions which include cosmological constant.\nThis solution has two distinct branches akin to Einstein Gauss-Bonnet(EBG)\ngravity. However, unlike the EBG solutions, both the branches of dEGB are\nwell-defined asymptotically. The negative branches from both theories can be\nidentified for the asymptotically flat case. We observe black holes for\nspecific ranges of the Gauss-Bonnet coupling parameter and perform a stability\nanalysis by calculating the quasinormal modes (QNMs) under scalar wave\npropagation. Finally, the ringdown spectrums of our black holes are compared\nwith their GR counterparts.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:09:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gera","Suvikranth",""],["Roy","Poulami Dutta",""]]}
{"id":"2308.11720","submitter":"Yerong Li","authors":"Yerong Li, Roxana Girju","title":"Advancing Relation Extraction through Language Probing with Exemplars\n  from Set Co-Expansion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Relation Extraction (RE) is a pivotal task in automatically extracting\nstructured information from unstructured text. In this paper, we present a\nmulti-faceted approach that integrates representative examples and through\nco-set expansion. The primary goal of our method is to enhance relation\nclassification accuracy and mitigating confusion between contrastive classes.\n  Our approach begins by seeding each relationship class with representative\nexamples. Subsequently, our co-set expansion algorithm enriches training\nobjectives by incorporating similarity measures between target pairs and\nrepresentative pairs from the target class. Moreover, the co-set expansion\nprocess involves a class ranking procedure that takes into account exemplars\nfrom contrastive classes. Contextual details encompassing relation mentions are\nharnessed via context-free Hearst patterns to ascertain contextual similarity.\n  Empirical evaluation demonstrates the efficacy of our co-set expansion\napproach, resulting in a significant enhancement of relation classification\nperformance. Our method achieves an observed margin of at least 1 percent\nimprovement in accuracy in most settings, on top of existing fine-tuning\napproaches. To further refine our approach, we conduct an in-depth analysis\nthat focuses on tuning contrastive examples. This strategic selection and\ntuning effectively reduce confusion between classes sharing similarities,\nleading to a more precise classification process.\n  Experimental results underscore the effectiveness of our proposed framework\nfor relation extraction. The synergy between co-set expansion and context-aware\nprompt tuning substantially contributes to improved classification accuracy.\nFurthermore, the reduction in confusion between contrastive classes through\ncontrastive examples tuning validates the robustness and reliability of our\nmethod.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 00:56:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Yerong",""],["Girju","Roxana",""]]}
{"id":"2308.11721","submitter":"Kate Donahue","authors":"Kate Donahue, Kostas Kollias, Sreenivas Gollapudi","title":"When Are Two Lists Better than One?: Benefits and Harms in Joint\n  Decision-making","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Historically, much of machine learning research has focused on the\nperformance of the algorithm alone, but recently more attention has been\nfocused on optimizing joint human-algorithm performance. Here, we analyze a\nspecific type of human-algorithm collaboration where the algorithm has access\nto a set of $n$ items, and presents a subset of size $k$ to the human, who\nselects a final item from among those $k$. This scenario could model content\nrecommendation, route planning, or any type of labeling task. Because both the\nhuman and algorithm have imperfect, noisy information about the true ordering\nof items, the key question is: which value of $k$ maximizes the probability\nthat the best item will be ultimately selected? For $k=1$, performance is\noptimized by the algorithm acting alone, and for $k=n$ it is optimized by the\nhuman acting alone. Surprisingly, we show that for multiple of noise models, it\nis optimal to set $k \\in [2, n-1]$ - that is, there are strict benefits to\ncollaborating, even when the human and algorithm have equal accuracy\nseparately. We demonstrate this theoretically for the Mallows model and\nexperimentally for the Random Utilities models of noisy permutations. However,\nwe show this pattern is reversed when the human is anchored on the algorithm's\npresented ordering - the joint system always has strictly worse performance. We\nextend these results to the case where the human and algorithm differ in their\naccuracy levels, showing that there always exist regimes where a more accurate\nagent would strictly benefit from collaborating with a less accurate one, but\nthese regimes are asymmetric between the human and the algorithm's accuracy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:16:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Donahue","Kate",""],["Kollias","Kostas",""],["Gollapudi","Sreenivas",""]]}
{"id":"2308.11722","submitter":"Akanksha Bhardwaj","authors":"Akanksha Bhardwaj, Christoph Englert, Dorival Gon\\c{c}alves, and\n  Alberto Navarro","title":"Non-linear top-Higgs CP violation","comments":"10 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Searches for additional sources of CP violation at the Large Hadron Collider\nare a central part of the Higgs physics programme beyond the Standard Model.\nStudies employing so-called signed observables that track CP violation through\npurpose-built asymmetries bolster efforts based on Higgs boson rate analyses\nunder clear assumptions. A possibility, which is so far unexplored at the LHC,\nis a significant non-linear realisation of CP-violation, which is naturally\ndescribed in non-linear Higgs Effective Field Theory (HEFT). We perform an\nanalysis of the HL-LHC potential to constrain such interactions considering a\nlarge range of single and double Higgs production processes, including\ndifferential information where this is statistically and theoretically\npossible. A particular emphasis of our work is distinguishing expected\ncorrelations in the Standard Model Effective Field Theory from those attainable\nin HEFT.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:24:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bhardwaj","Akanksha",""],["Englert","Christoph",""],["Gon\u00e7alves","Dorival",""],["Navarro","Alberto",""]]}
{"id":"2308.11723","submitter":"Clarke Esmerian","authors":"Clarke J. Esmerian and Nickolay Y. Gnedin","title":"Modeling Dust Production, Growth, and Destruction in Reionization-Era\n  Galaxies with the CROC Simulations II: Predicting the Dust Content of\n  High-Redshift Galaxies","comments":"Submitted to ApJ, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We model the interstellar dust content of the reionization era with a suite\nof cosmological, fluid-dynamical simulations of galaxies with stellar masses\nranging from $\\sim 10^5 - 10^9 M_{\\odot}$ in the first $1.2$ billion years of\nthe universe. We use a post-processing method that accounts for dust creation\nand destruction processes, allowing us to systematically vary the parameters of\nthese processes to test whether dust-dependent observable quantities of\ngalaxies at these epochs could be useful for placing constraints on dust\nphysics. We then forward model observable properties of these galaxies to\ncompare to existing data. We find that we are unable to simultaneously match\nexisting observational constraints with any one set of model parameters.\nSpecifically, the models which predict the largest dust masses $D/Z \\gtrsim\n0.1$ at $z = 5$ -- because of high assumed production yields and/or efficient\ngrowth via accretion in the interstellar medium -- are preferred by constraints\non total dust mass and infrared luminosities, but these models produce far too\nmuch extinction in the ultraviolet, preventing them from matching observations\nof $\\beta_{\\rm UV}$. To investigate this discrepancy, we analyze the relative\nspatial distribution of stars and dust as probed by infrared (IR) and\nultraviolet (UV) emission, which appear to exhibit overly symmetric\nmorphologies compared to existing data, likely due to the limitations of the\nstellar feedback model used in the simulations. Our results indicate that the\nobservable properties of the dust distribution in high redshift galaxies are a\nparticularly strong test of stellar feedback.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:27:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Esmerian","Clarke J.",""],["Gnedin","Nickolay Y.",""]]}
{"id":"2308.11724","submitter":"Rostyslav Hnatyshyn","authors":"Rostyslav Hnatyshyn, Jieqiong Zhao, Danny Perez, James Ahrens, Ross\n  Maciejewski","title":"MolSieve: A Progressive Visual Analytics System for Molecular Dynamics\n  Simulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.GR cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Molecular Dynamics (MD) simulations are ubiquitous in cutting-edge\nphysio-chemical research. They provide critical insights into how a physical\nsystem evolves over time given a model of interatomic interactions.\nUnderstanding a system's evolution is key to selecting the best candidates for\nnew drugs, materials for manufacturing, and countless other practical\napplications. With today's technology, these simulations can encompass millions\nof unit transitions between discrete molecular structures, spanning up to\nseveral milliseconds of real time. Attempting to perform a brute-force analysis\nwith data-sets of this size is not only computationally impractical, but would\nnot shed light on the physically-relevant features of the data. Moreover, there\nis a need to analyze simulation ensembles in order to compare similar processes\nin differing environments. These problems call for an approach that is\nanalytically transparent, computationally efficient, and flexible enough to\nhandle the variety found in materials based research. In order to address these\nproblems, we introduce MolSieve, a progressive visual analytics system that\nenables the comparison of multiple long-duration simulations. Using MolSieve,\nanalysts are able to quickly identify and compare regions of interest within\nimmense simulations through its combination of control charts, data-reduction\ntechniques, and highly informative visual components. A simple programming\ninterface is provided which allows experts to fit MolSieve to their needs. To\ndemonstrate the efficacy of our approach, we present two case studies of\nMolSieve and report on findings from domain collaborators.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:30:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hnatyshyn","Rostyslav",""],["Zhao","Jieqiong",""],["Perez","Danny",""],["Ahrens","James",""],["Maciejewski","Ross",""]]}
{"id":"2308.11725","submitter":"Swati Thakur","authors":"Swati Thakur (1), Soni Devi (1), Sanjeet S. Kaintura (1), Katyayni\n  Tiwari (1) and Pushpendra P. Singh (1) ((1) Department of Physics, Indian\n  Institute of Technology Ropar, Rupnagar - 140 001, Punjab, India)","title":"Spectroscopic performance evaluation and modeling of a low background\n  HPGe detector using GEANT4","comments":"17 pages, 24 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low background gamma spectrometry employing HPGe detectors is a sensitive\ntechnique for measuring low-level radioactivity in environmental applications,\nmaterial screening, and for rare decay searches. This work presents\nspectroscopic performance evaluation and modelling of a low background\nmeasurement setup developed at IIT Ropar in Punjab, India, to measure trace\nnatural radioactive elements, with a particular interest in studying low-level\nradioactivity in soil and/or rock samples to generate specific inputs for low\nbackground experiments. The performance test and characterization of a low\nbackground cryocooled HPGe detector with relative efficiency of $\\sim$33% have\nbeen carried out. An effective detector model has been developed using GEANT4\nMonte Carlo simulation to determine the response of the detector over an energy\nrange of 80.9-1408 keV and compared with the experimental performance of the\ndetector. The response of the detector obtained using Monte Carlo simulations\nagrees reasonably well within 93% level of confidence, indicating only 7%\ndeviation in the comparison. The present setup offers improved detection limits\nof primordial radionuclides (U/Th and K) to measure radioactive contamination\nin environmental matrices, which has been used elsewhere [1].\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:34:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Thakur","Swati",""],["Devi","Soni",""],["Kaintura","Sanjeet S.",""],["Tiwari","Katyayni",""],["Singh","Pushpendra P.",""]]}
{"id":"2308.11726","submitter":"Florian B\\\"ar","authors":"Florian R. B\\\"ar and Malcolm P. Kennett","title":"Out-of-Equilibrium Dynamics in the Two-Component Bose-Hubbard Model","comments":"28 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the out-of-equilibrium dynamics of the Bose-Hubbard model for\ntwo-component bosons using a strong-coupling approach within the\nclosed-time-path formalism and develop an effective theory for the action of\nthis problem. We obtain equations of motion for the superfluid order parameters\nof both boson species for both the superfluid and Mott-insulating phases and\nstudy these in the low-frequency, long-wavelength limit during a quantum quench\nfor various initial conditions. We find that an additional degree of freedom\nfor bosons leads to a richer phase diagram and out-of-equilibrium dynamics than\nthe single-component situation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:34:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["B\u00e4r","Florian R.",""],["Kennett","Malcolm P.",""]]}
{"id":"2308.11727","submitter":"Jonathan Sapirstein","authors":"J. Sapirstein, K.T. Cheng","title":"Simplified partial wave expansion of the Lamb shift","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A method for calculating the self energy part of the Lamb shift is revisited.\nWhen the electron propagator in an external field is represented as an\nexpansion in partial waves, the original method converges relatively slowly,\nrequiring the calculation of dozens of partial waves. Here we show an improved\nmethod in which accurate results can be obtained using a much smaller number of\npartial waves. The method is illustrated for the ground states of hydrogenlike\nand lithiumlike boron, and the possibility of high accuracy calculations on\nlower Z hydrogenic ions is discussed.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:36:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sapirstein","J.",""],["Cheng","K. T.",""]]}
{"id":"2308.11728","submitter":"Xiaofan Zhou","authors":"Xiaofan Zhou","title":"Invariant representation learning for sequential recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sequential recommendation involves automatically recommending the next item\nto users based on their historical item sequence. While most prior research\nemploys RNN or transformer methods to glean information from the item\nsequence-generating probabilities for each user-item pair and recommending the\ntop items, these approaches often overlook the challenge posed by spurious\nrelationships. This paper specifically addresses these spurious relations. We\nintroduce a novel sequential recommendation framework named Irl4Rec. This\nframework harnesses invariant learning and employs a new objective that factors\nin the relationship between spurious variables and adjustment variables during\nmodel training. This approach aids in identifying spurious relations.\nComparative analyses reveal that our framework outperforms three typical\nmethods, underscoring the effectiveness of our model. Moreover, an ablation\nstudy further demonstrates the critical role our model plays in detecting\nspurious relations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:39:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhou","Xiaofan",""]]}
{"id":"2308.11729","submitter":"Martin Houde","authors":"Katie Brown, Mohammed A. Chamma, Fereshteh Rajabi, Aishwarya Kumar,\n  Hosein Rajabi, and Martin Houde","title":"Validating the Sub-Burst Slope Law: A Comprehensive Multi-Source\n  Spectro-Temporal Analysis of Repeating Fast Radio Bursts","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We conduct a comprehensive spectro-temporal analysis of repeating Fast Radio\nBursts (FRBs) utilizing nine distinct sources, the largest sample to date. Our\ndata set includes 175 sub-bursts and 31 multi-component bursts from 11 data\nsets, with centre frequencies ranging from 149-7144 MHz and durations spanning\nfrom 73 \\mu s-13 ms. Our findings are consistent with the predictions of the\nTriggered Relativistic Dynamical Model (TRDM) of FRB emission. We affirm the\npredicted quadratic relationship between sub-burst slope and frequency, as well\nas a linear dependence of bandwidth on frequency that is consistent with\nmildly-relativistic Doppler broadening of narrow-band emission. Most\nimportantly, we confirm the sub-burst slope law, a predicted inverse\nrelationship between sub-burst slope and duration, to hold consistently across\ndifferent sources. Remarkably, we also discover that the drift rates of\nmulti-component bursts follow the same law as the sub-burst slopes, an\nunexplained result that warrants further investigation. These findings not only\nsupport the TRDM as a viable framework for explaining several aspects of FRB\nemission, but also provide new insights into the complex spectro-temporal\nproperties of FRBs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:41:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Brown","Katie",""],["Chamma","Mohammed A.",""],["Rajabi","Fereshteh",""],["Kumar","Aishwarya",""],["Rajabi","Hosein",""],["Houde","Martin",""]]}
{"id":"2308.11730","submitter":"Yu Wang","authors":"Yu Wang, Nedim Lipka, Ryan A. Rossi, Alexa Siu, Ruiyi Zhang, Tyler\n  Derr","title":"Knowledge Graph Prompting for Multi-Document Question Answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 'pre-train, prompt, predict' paradigm of large language models (LLMs) has\nachieved remarkable success in open-domain question answering (OD-QA). However,\nfew works explore this paradigm in the scenario of multi-document question\nanswering (MD-QA), a task demanding a thorough understanding of the logical\nassociations among the contents and structures of different documents. To fill\nthis crucial gap, we propose a Knowledge Graph Prompting (KGP) method to\nformulate the right context in prompting LLMs for MD-QA, which consists of a\ngraph construction module and a graph traversal module. For graph construction,\nwe create a knowledge graph (KG) over multiple documents with nodes symbolizing\npassages or document structures (e.g., pages/tables), and edges denoting the\nsemantic/lexical similarity between passages or intra-document structural\nrelations. For graph traversal, we design an LM-guided graph traverser that\nnavigates across nodes and gathers supporting passages assisting LLMs in MD-QA.\nThe constructed graph serves as the global ruler that regulates the\ntransitional space among passages and reduces retrieval latency. Concurrently,\nthe LM-guided traverser acts as a local navigator that gathers pertinent\ncontext to progressively approach the question and guarantee retrieval quality.\nExtensive experiments underscore the efficacy of KGP for MD-QA, signifying the\npotential of leveraging graphs in enhancing the prompt design for LLMs. Our\ncode is at https://github.com/YuWVandy/KG-LLM-MDQA.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:41:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Yu",""],["Lipka","Nedim",""],["Rossi","Ryan A.",""],["Siu","Alexa",""],["Zhang","Ruiyi",""],["Derr","Tyler",""]]}
{"id":"2308.11731","submitter":"Gabriel Ng","authors":"Gabriel Ng","title":"Taylor Morphisms","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study generalised Taylor morphisms, functors which construct differential\nring homomorphisms from ring homomorphisms in a uniform way, analogous to the\nTaylor expansion for smooth functions. We generalise the construction of the\ntwisted Taylor morphism by Le\\'on S\\'anchez and Tressl to arbitrary\ndifferential rings by `twisting' the ring of Hurwitz series, and prove that\nthis results in a functor which is the right adjoint to a certain forgetful\nfunctor. We therefore give a concrete characterisation of all generalised\nTaylor morphisms over all differential rings with finitely many commuting\nderivations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:42:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ng","Gabriel",""]]}
{"id":"2308.11732","submitter":"Andrea Atzori","authors":"Andrea Atzori, Gianni Fenu, Mirko Marras","title":"(Un)fair Exposure in Deep Face Rankings at a Distance","comments":"Accepted as a full paper at IJCB 2023 Special Session \"Long-Range\n  Biometrics Challenges\": 2023 International Joint Conference on Biometrics","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Law enforcement regularly faces the challenge of ranking suspects from their\nfacial images. Deep face models aid this process but frequently introduce\nbiases that disproportionately affect certain demographic segments. While bias\ninvestigation is common in domains like job candidate ranking, the field of\nforensic face rankings remains underexplored. In this paper, we propose a novel\nexperimental framework, encompassing six state-of-the-art face encoders and two\npublic data sets, designed to scrutinize the extent to which demographic groups\nsuffer from biases in exposure in the context of forensic face rankings.\nThrough comprehensive experiments that cover both re-identification and\nidentification tasks, we show that exposure biases within this domain are far\nfrom being countered, demanding attention towards establishing ad-hoc policies\nand corrective measures. The source code is available at\nhttps://github.com/atzoriandrea/ijcb2023-unfair-face-rankings\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:43:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Atzori","Andrea",""],["Fenu","Gianni",""],["Marras","Mirko",""]]}
{"id":"2308.11733","submitter":"Igor Sfiligoi","authors":"Igor Sfiligoi, Frank W\\\"urthwein, Jeff Dost, Brian Lin and David\n  Schultz","title":"Demand-driven provisioning of Kubernetes-like resources in OSG","comments":"6 pages, 3 figures, Submitted to Proceedings of CHEP23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The OSG-operated Open Science Pool is an HTCondor-based virtual cluster that\naggregates resources from compute clusters provided by several organizations.\nMost of the resources are not owned by OSG, so demand-based dynamic\nprovisioning is important for maximizing usage without incurring excessive\nwaste. OSG has long relied on GlideinWMS for most of its resource provisioning\nneeds but is limited to resources that provide a Grid-compliant Compute\nEntrypoint. To work around this limitation, the OSG Software Team has developed\na glidein container that resource providers could use to directly contribute to\nthe OSPool. The problem of that approach is that it is not demand-driven,\nrelegating it to backfill scenarios only. To address this limitation, a\ndemand-driven direct provisioner of Kubernetes resources has been developed and\nsuccessfully used on the NRP. The setup still relies on the OSG-maintained\nbackfill container image but automates the provisioning matchmaking and\nsuccessive requests. That provisioner has also been extended to support\nLancium, a green computing cloud provider with a Kubernetes-like proprietary\ninterface. The provisioner logic has been intentionally kept very simple,\nmaking this extension a low-cost project. Both NRP and Lancium resources have\nbeen provisioned exclusively using this mechanism for many months.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:44:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sfiligoi","Igor",""],["W\u00fcrthwein","Frank",""],["Dost","Jeff",""],["Lin","Brian",""],["Schultz","David",""]]}
{"id":"2308.11734","submitter":"Luiz Fernando Afra Brito","authors":"Luiz Fernando Afra Brito and Marcelo Keese Albertini and Bruno Augusto\n  Nassif Traven\\c{c}olo and Gonzalo Navarro","title":"Dynamic Compact Data Structure for Temporal Reachability with Unsorted\n  Contact Insertions","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Temporal graphs represent interactions between entities over time. Deciding\nwhether entities can reach each other through temporal paths is useful for\nvarious applications such as in communication networks and epidemiology.\nPrevious works have studied the scenario in which addition of new interactions\ncan happen at any point in time. A known strategy maintains, incrementally, a\nTimed Transitive Closure by using a dynamic data structure composed of $O(n^2)$\nbinary search trees containing non-nested time intervals. However, space usage\nfor storing these trees grows rapidly as more interactions are inserted. In\nthis paper, we present a compact data structures that represent each tree as\ntwo dynamic bit-vectors. In our experiments, we observed that our data\nstructure improves space usage while having similar time performance for\nincremental updates when comparing with the previous strategy in temporally\ndense temporal graphs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:46:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Brito","Luiz Fernando Afra",""],["Albertini","Marcelo Keese",""],["Traven\u00e7olo","Bruno Augusto Nassif",""],["Navarro","Gonzalo",""]]}
{"id":"2308.11735","submitter":"Tal Rubin","authors":"T. Rubin, J. M. Rax and N. J. Fisch","title":"Guiding center motion for particles in a ponderomotive magnetostatic end\n  plug","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Hamiltonian dynamics of a single particle in a rotating plasma column,\ninteracting with an magnetic multipole is perturbatively solved for up to\nsecond order, using the method of Lie transformations. First, the exact\nHamiltonian is expressed in terms of canonical action-angle variables, and then\nan approximate integrable Hamiltonian is introduced, using another set of\nactions and angles.\n  The perturbation introduces an effective ponderomotive potential, which to\nleading order is positive. At the second order, the pseudopotential consists of\na sum of terms of the Miller form, and can have either sign. Additionally at\nsecond order, the ponderomotive interaction introduces a modification to the\nparticle effective mass, when considering the motion along the column axis.\n  It is found that particles can be axially confined by the ponderomotive\npotentials, but acquire radial excursions which scale as the confining\npotential. The radial excursions of the particle along its trajectory are\ninvestigated, and a condition for the minimal rotation speed is derived, in\norder for particles to remain radially confined.\n  Last, we comment on the changes to the aforementioned solution to the\npseudopotintials and particle trajectory in the case of resonant motion, that\nis, a motion which has the same periodicity as the perturbation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:54:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rubin","T.",""],["Rax","J. M.",""],["Fisch","N. J.",""]]}
{"id":"2308.11736","submitter":"Ashutosh Marwah","authors":"Ashutosh Marwah and Fr\\'ed\\'eric Dupuis","title":"Smooth min-entropy lower bounds for approximation chains","comments":"comments welcome; sections on approximate EAT and source correlation\n  can be read independently; total number of pages= 83, pages 55-78 are\n  appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a state $\\rho_{A_1^n B}$, we call a sequence of states $(\\sigma_{A_1^k\nB}^{(k)})_{k=1}^n$ an approximation chain if for every $1 \\leq k \\leq n$,\n$\\rho_{A_1^k B} \\approx_\\epsilon \\sigma_{A_1^k B}^{(k)}$. In general, it is not\npossible to lower bound the smooth min-entropy of such a $\\rho_{A_1^n B}$, in\nterms of the entropies of $\\sigma_{A_1^k B}^{(k)}$ without incurring very large\npenalty factors. In this paper, we study such approximation chains under\nadditional assumptions. We begin by proving a simple entropic triangle\ninequality, which allows us to bound the smooth min-entropy of a state in terms\nof the R\\'enyi entropy of an arbitrary auxiliary state while taking into\naccount the smooth max-relative entropy between the two. Using this triangle\ninequality, we create lower bounds for the smooth min-entropy of a state in\nterms of the entropies of its approximation chain in various scenarios. In\nparticular, utilising this approach, we prove an approximate version of entropy\naccumulation and also provide a solution to the source correlation problem in\nquantum key distribution.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:55:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Marwah","Ashutosh",""],["Dupuis","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.11737","submitter":"Jiacong Xu","authors":"Jiacong Xu, Yi Zhang, Jiawei Peng, Wufei Ma, Artur Jesslen, Pengliang\n  Ji, Qixin Hu, Jiehua Zhang, Qihao Liu, Jiahao Wang, Wei Ji, Chen Wang,\n  Xiaoding Yuan, Prakhar Kaushik, Guofeng Zhang, Jie Liu, Yushan Xie, Yawen\n  Cui, Alan Yuille, Adam Kortylewski","title":"Animal3D: A Comprehensive Dataset of 3D Animal Pose and Shape","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurately estimating the 3D pose and shape is an essential step towards\nunderstanding animal behavior, and can potentially benefit many downstream\napplications, such as wildlife conservation. However, research in this area is\nheld back by the lack of a comprehensive and diverse dataset with high-quality\n3D pose and shape annotations. In this paper, we propose Animal3D, the first\ncomprehensive dataset for mammal animal 3D pose and shape estimation. Animal3D\nconsists of 3379 images collected from 40 mammal species, high-quality\nannotations of 26 keypoints, and importantly the pose and shape parameters of\nthe SMAL model. All annotations were labeled and checked manually in a\nmulti-stage process to ensure highest quality results. Based on the Animal3D\ndataset, we benchmark representative shape and pose estimation models at: (1)\nsupervised learning from only the Animal3D data, (2) synthetic to real transfer\nfrom synthetically generated images, and (3) fine-tuning human pose and shape\nestimation models. Our experimental results demonstrate that predicting the 3D\nshape and pose of animals across species remains a very challenging task,\ndespite significant advances in human pose estimation. Our results further\ndemonstrate that synthetic pre-training is a viable strategy to boost the model\nperformance. Overall, Animal3D opens new directions for facilitating future\nresearch in animal 3D pose and shape estimation, and is publicly available.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:57:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Jiacong",""],["Zhang","Yi",""],["Peng","Jiawei",""],["Ma","Wufei",""],["Jesslen","Artur",""],["Ji","Pengliang",""],["Hu","Qixin",""],["Zhang","Jiehua",""],["Liu","Qihao",""],["Wang","Jiahao",""],["Ji","Wei",""],["Wang","Chen",""],["Yuan","Xiaoding",""],["Kaushik","Prakhar",""],["Zhang","Guofeng",""],["Liu","Jie",""],["Xie","Yushan",""],["Cui","Yawen",""],["Yuille","Alan",""],["Kortylewski","Adam",""]]}
{"id":"2308.11738","submitter":"Sagar Malhotra","authors":"Sagar Malhotra, Davide Bizzaro, and Luciano Serafini","title":"Lifted Inference beyond First-Order Logic","comments":"arXiv admin note: text overlap with arXiv:2302.09830","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic\ninference in statistical relational learning models. As WFOMC is known to be\nintractable in general ($\\#$P-complete), logical fragments that admit\npolynomial time WFOMC are of significant interest. Such fragments are called\ndomain liftable. Recent works have shown that the two-variable fragment of\nfirst order logic extended with counting quantifiers ($\\mathrm{C^2}$) is\ndomain-liftable. However, many properties of real-world data, like acyclicity\nin citation networks and connectivity in social networks, cannot be modeled in\n$\\mathrm{C^2}$, or first order logic in general. In this work, we expand the\ndomain liftability of $\\mathrm{C^2}$ with multiple such properties. We show\nthat any $\\mathrm{C^2}$ sentence remains domain liftable when one of its\nrelations is restricted to represent a directed acyclic graph, a connected\ngraph, a tree (resp. a directed tree) or a forest (resp. a directed forest).\nAll our results rely on a novel and general methodology of \"counting by\nsplitting\". Besides their application to probabilistic inference, our results\nprovide a general framework for counting combinatorial structures. We expand a\nvast array of previous results in discrete mathematics literature on directed\nacyclic graphs, phylogenetic networks, etc.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:58:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Malhotra","Sagar",""],["Bizzaro","Davide",""],["Serafini","Luciano",""]]}
{"id":"2308.11739","submitter":"Federico Escudero PhD","authors":"Federico Escudero, Juan Sebasti\\'an Ardenghi","title":"Coulomb drag in metallic twisted bilayer graphene","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Strongly correlated phases in twisted bilayer graphene (TBG) typically arise\nas transitions from a state in which the system behaves as a normal metal. In\nsuch metallic regime, electron-electron interactions usually only play a\nsubleading role in transport measurements, compared to the dominant scattering\nmechanism. Here, we propose and theoretically study an exception to this based\non a Coulomb drag setup between two metallic TBG, separated so that they only\ncouple through many-body interactions. We find that by solely varying the twist\nangle equally in both TBG, the drag resistivity exhibits a unique maximum as\nthe system crossovers from a degenerate to a nondegenerate regime. When the\ntwist angles in each TBG differ, we find an anomalous drag resistivity\ncharacterized by the appearance of multiple peaks. We show that this behavior\ncan be related to the dependence of the rectification function on the twist\nangle.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:01:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Escudero","Federico",""],["Ardenghi","Juan Sebasti\u00e1n",""]]}
{"id":"2308.11740","submitter":"Alessandro Reineri","authors":"Alessandro Reineri (1), Silvia Zorzetti (1), Tanay Roy (1), Xinyuan\n  You (1) ((1) Fermi National Accelerator Laboratory)","title":"Exploration of superconducting multi-mode cavity architectures for\n  quantum computing","comments":"2023 Intl Conf on Quantum Computing and Engineering (QCE23)","journal-ref":null,"doi":null,"report-no":"FERMILAB-CONF-23-405-SQMS","categories":"physics.app-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Superconducting radio-frequency (SRF) cavities coupled to transmon circuits\nhave proven to be a promising platform for building high-coherence quantum\ninformation processors. An essential aspect of this realization involves\ndesigning high quality factor three-dimensional superconducting cavities to\nextend the lifetime of quantum systems. To increase the computational\ncapability of this architecture, we are exploring a multimode approach. This\npaper presents the design optimization process of a multi-cell SRF cavity to\nperform quantum computation based on an existing design developed in the scope\nof particle accelerator technology. We perform parametric electromagnetic\nsimulations to evaluate and optimize the design. In particular, we focus on the\nanalysis of the interaction between a nonlinear superconducting circuit known\nas the transmon and the cavity. This parametric design optimization is\nstructured to serve as a blueprint for future studies on similar systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:02:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Reineri","Alessandro","","Fermi National Accelerator Laboratory"],["Zorzetti","Silvia","","Fermi National Accelerator Laboratory"],["Roy","Tanay","","Fermi National Accelerator Laboratory"],["You","Xinyuan","","Fermi National Accelerator Laboratory"]]}
{"id":"2308.11741","submitter":"Rodrigo Andrade e Silva","authors":"Rodrigo Andrade e Silva","title":"Quantization of causal diamonds in (2+1)-dimensional gravity -- Part I:\n  Classical reduction","comments":"126 pages, 14 figures. Part II (Quantization and the Quantum) to\n  appear soon","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop the non-perturbative reduced phase space quantization of causal\ndiamonds in (2+1)-dimensional gravity with a nonpositive cosmological constant.\nIn this Part I we focus on the classical reduction process, and the description\nof the reduced phase space, while in Part II we discuss the quantization of the\nphase space and quantum aspects of the causal diamonds. The system is defined\nas the domain of dependence of a spacelike topological disk with fixed boundary\nmetric. By solving the constraints in a constant-mean-curvature time gauge and\nremoving all the spatial gauge redundancy, we find that the phase space is the\ncotangent bundle of Diff^+(S^1)/PSL(2,R), i.e., the group of\norientation-preserving diffeomorphisms of the circle modulo the projective\nspecial linear subgroup. Classically, the states correspond to causal diamonds\nembedded in AdS_3 (or Mink_3 if $\\Lambda = 0$), with fixed corner length, and\nwhose Cauchy surfaces have the topology of a disc.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:02:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Silva","Rodrigo Andrade e",""]]}
{"id":"2308.11742","submitter":"Aditya Pillai","authors":"Aditya Pillai and Mohit Singh","title":"Linear Programming based Reductions for Multiple Visit TSP and Vehicle\n  Routing Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple TSP ($\\mathrm{mTSP}$) is a important variant of $\\mathrm{TSP}$ where\na set of $k$ salesperson together visit a set of $n$ cities. The\n$\\mathrm{mTSP}$ problem has applications to many real life applications such as\nvehicle routing. Rothkopf introduced another variant of $\\mathrm{TSP}$ called\nmany-visits TSP ($\\mathrm{MV\\mbox{-}TSP}$) where a request $r(v)\\in\n\\mathbb{Z}_+$ is given for each city $v$ and a single salesperson needs to\nvisit each city $r(v)$ times and return back to his starting point. A\ncombination of $\\mathrm{mTSP}$ and $\\mathrm{MV\\mbox{-}TSP}$ called many-visits\nmultiple TSP $(\\mathrm{MV\\mbox{-}mTSP})$ was studied by B\\'erczi, Mnich, and\nVincze where the authors give approximation algorithms for various variants of\n$\\mathrm{MV\\mbox{-}mTSP}$.\n  In this work, we show a simple linear programming (LP) based reduction that\nconverts a $\\mathrm{mTSP}$ LP-based algorithm to a LP-based algorithm for\n$\\mathrm{MV\\mbox{-}mTSP}$ with the same approximation factor. We apply this\nreduction to improve or match the current best approximation factors of several\nvariants of the $\\mathrm{MV\\mbox{-}mTSP}$. Our reduction shows that the\naddition of visit requests $r(v)$ to $\\mathrm{mTSP}$ does $\\textit{not}$ make\nthe problem harder to approximate even when $r(v)$ is exponential in number of\nvertices.\n  To apply our reduction, we either use existing LP-based algorithms for\n$\\mathrm{mTSP}$ variants or show that several existing combinatorial algorithms\nfor $\\mathrm{mTSP}$ variants can be interpreted as LP-based algorithms. This\nallows us to apply our reduction to these combinatorial algorithms as well\nachieving the improved guarantees.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:05:25 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pillai","Aditya",""],["Singh","Mohit",""]]}
{"id":"2308.11743","submitter":"Leonardo Felipe Toso","authors":"Han Wang, Leonardo F. Toso, Aritra Mitra, and James Anderson","title":"Model-free Learning with Heterogeneous Dynamical Systems: A Federated\n  LQR Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a model-free federated linear quadratic regulator (LQR) problem\nwhere M agents with unknown, distinct yet similar dynamics collaboratively\nlearn an optimal policy to minimize an average quadratic cost while keeping\ntheir data private. To exploit the similarity of the agents' dynamics, we\npropose to use federated learning (FL) to allow the agents to periodically\ncommunicate with a central server to train policies by leveraging a larger\ndataset from all the agents. With this setup, we seek to understand the\nfollowing questions: (i) Is the learned common policy stabilizing for all\nagents? (ii) How close is the learned common policy to each agent's own optimal\npolicy? (iii) Can each agent learn its own optimal policy faster by leveraging\ndata from all agents? To answer these questions, we propose a federated and\nmodel-free algorithm named FedLQR. Our analysis overcomes numerous technical\nchallenges, such as heterogeneity in the agents' dynamics, multiple local\nupdates, and stability concerns. We show that FedLQR produces a common policy\nthat, at each iteration, is stabilizing for all agents. We provide bounds on\nthe distance between the common policy and each agent's local optimal policy.\nFurthermore, we prove that when learning each agent's optimal policy, FedLQR\nachieves a sample complexity reduction proportional to the number of agents M\nin a low-heterogeneity regime, compared to the single-agent setting.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:09:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Han",""],["Toso","Leonardo F.",""],["Mitra","Aritra",""],["Anderson","James",""]]}
{"id":"2308.11744","submitter":"Abhishek Aich","authors":"Abhishek Aich, Samuel Schulter, Amit K. Roy-Chowdhury, Manmohan\n  Chandraker, Yumin Suh","title":"Efficient Controllable Multi-Task Architectures","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We aim to train a multi-task model such that users can adjust the desired\ncompute budget and relative importance of task performances after deployment,\nwithout retraining. This enables optimizing performance for dynamically varying\nuser needs, without heavy computational overhead to train and save models for\nvarious scenarios. To this end, we propose a multi-task model consisting of a\nshared encoder and task-specific decoders where both encoder and decoder\nchannel widths are slimmable. Our key idea is to control the task importance by\nvarying the capacities of task-specific decoders, while controlling the total\ncomputational cost by jointly adjusting the encoder capacity. This improves\noverall accuracy by allowing a stronger encoder for a given budget, increases\ncontrol over computational cost, and delivers high-quality slimmed\nsub-architectures based on user's constraints. Our training strategy involves a\nnovel 'Configuration-Invariant Knowledge Distillation' loss that enforces\nbackbone representations to be invariant under different runtime width\nconfigurations to enhance accuracy. Further, we present a simple but effective\nsearch algorithm that translates user constraints to runtime width\nconfigurations of both the shared encoder and task decoders, for sampling the\nsub-architectures. The key rule for the search algorithm is to provide a larger\ncomputational budget to the higher preferred task decoder, while searching a\nshared encoder configuration that enhances the overall MTL performance. Various\nexperiments on three multi-task benchmarks (PASCALContext, NYUDv2, and\nCIFAR100-MTL) with diverse backbone architectures demonstrate the advantage of\nour approach. For example, our method shows a higher controllability by ~33.5%\nin the NYUD-v2 dataset over prior methods, while incurring much less compute\ncost.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:09:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aich","Abhishek",""],["Schulter","Samuel",""],["Roy-Chowdhury","Amit K.",""],["Chandraker","Manmohan",""],["Suh","Yumin",""]]}
{"id":"2308.11745","submitter":"William Green","authors":"M. Burak Erdogan, Michael Goldberg, William R. Green","title":"Dispersive estimates for higher order Schr\\\"odinger operators with\n  scaling-critical potentials","comments":"25 pages, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a family of dispersive estimates for the higher order Schr\\\"odinger\nequation $iu_t=(-\\Delta)^mu +Vu$ for $m\\in \\mathbb N$ with $m>1$ and $2m<n<4m$.\nHere $V$ is a real-valued potential belonging to the closure of $C_0$ functions\nwith respect to the generalized Kato norm, which has critical scaling. Under\nstandard assumptions on the spectrum, we show that $e^{-itH}P_{ac}(H)$\nsatisfies a $|t|^{-\\frac{n}{2m}}$ bound mapping $L^1$ to $L^\\infty$ by adapting\na Wiener inversion theorem. We further show the lack of positive resonances for\nthe operator $(-\\Delta)^m +V$ and a family of dispersive estimates for\noperators of the form $|H|^{\\beta-\\frac{n}{2m}}e^{-itH}P_{ac}(H)$ for\n$0<\\beta\\leq \\frac{n}{2}$. The results apply in both even and odd dimensions in\nthe allowed range.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:10:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Erdogan","M. Burak",""],["Goldberg","Michael",""],["Green","William R.",""]]}
{"id":"2308.11746","submitter":"Ivica \\v{Z}ivkovi\\'c Dr","authors":"M. G. Gonzalez and V. Noculak and A. Sharma and V. Favre and J-R. Soh\n  and A. Magrez and R. Bewley and H. O. Jeschke and J. Reuther and H. M.\n  R{\\o}nnow and Y. Iqbal and I. \\v{Z}ivkovi\\'c","title":"Dynamics of K$_2$Ni$_2$(SO$_4$)$_3$ governed by proximity to a 3D spin\n  liquid model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum spin liquids (QSLs) have become a key area of research in magnetism\ndue to their remarkable properties, such as long-range entanglement, fractional\nexcitations, pinch-point singularities, and topologically protected phenomena.\nIn recent years, the search for QSLs has expanded into the three-dimensional\nworld, where promising features have been found in materials that form\npyrochlore and hyper-kagome lattices, despite the suppression of quantum\nfluctuations due to high dimensionality. One such material is the $S = 1$\nK$_2$Ni$_2$(SO$_4$)$_3$ compound, which belongs to the langbeinite family\nconsisting of two interconnected trillium lattices. Although magnetically\nordered, K$_2$Ni$_2$(SO$_4$)$_3$ has been found to exhibit a highly dynamical\nand correlated state which can be driven into a pure quantum spin liquid under\nmagnetic fields of only $B \\simeq 4$~T. In this article, we combine inelastic\nneutron scattering measurements with pseudo-fermion functional renormalization\ngroup (PFFRG) and classical Monte Carlo (cMC) calculations to study the\nmagnetic properties of K$_2$Ni$_2$(SO$_4$)$_3$, revealing a high level of\nagreement between the experiment and theory. We further reveal the origin of\nthe dynamical state in K$_2$Ni$_2$(SO$_4$)$_3$ by studying a larger set of\nexchange parameters, uncovering an `island of liquidity' around a focal point\ngiven by a magnetic network composed of tetrahedra on a trillium lattice.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:11:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gonzalez","M. G.",""],["Noculak","V.",""],["Sharma","A.",""],["Favre","V.",""],["Soh","J-R.",""],["Magrez","A.",""],["Bewley","R.",""],["Jeschke","H. O.",""],["Reuther","J.",""],["R\u00f8nnow","H. M.",""],["Iqbal","Y.",""],["\u017divkovi\u0107","I.",""]]}
{"id":"2308.11747","submitter":"Michael Unterkalmsteiner","authors":"Elizabeth Bjarnason, Michael Unterkalmsteiner, Markus Borg, Emelie\n  Engstr\\\"om","title":"A multi-case study of agile requirements engineering and the use of test\n  cases as requirements","comments":null,"journal-ref":"Inf. Softw. Technol. 77: 61-79 (2016)","doi":"10.1016/j.infsof.2016.03.008","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Context: It is an enigma that agile projects can succeed 'without\nrequirements' when weak requirements engineering is a known cause for project\nfailures. While agile development projects often manage well without extensive\nrequirements test cases are commonly viewed as requirements and detailed\nrequirements are documented as test cases. Objective: We have investigated this\nagile practice of using test cases as requirements to understand how test cases\ncan support the main requirements activities, and how this practice varies.\nMethod: We performed an iterative case study at three companies and collected\ndata through 14 interviews and two focus groups. Results: The use of test cases\nas requirements poses both benefits and challenges when eliciting, validating,\nverifying, and managing requirements, and when used as a documented agreement.\nWe have identified five variants of the test-cases-as-requirements practice,\nnamely de facto, behaviour-driven, story-test driven, stand-alone strict and\nstand-alone manual for which the application of the practice varies concerning\nthe time frame of requirements documentation, the requirements format, the\nextent to which the test cases are a machine executable specification and the\nuse of tools which provide specific support for the practice of using test\ncases as requirements. Conclusions: The findings provide empirical insight into\nhow agile development projects manage and communicate requirements. The\nidentified variants of the practice of using test cases as requirements can be\nused to perform in-depth investigations into agile requirements engineering.\nPractitioners can use the provided recommendations as a guide in designing and\nimproving their agile requirements practices based on project characteristics\nsuch as number of stakeholders and rate of change.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:13:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bjarnason","Elizabeth",""],["Unterkalmsteiner","Michael",""],["Borg","Markus",""],["Engstr\u00f6m","Emelie",""]]}
{"id":"2308.11748","submitter":"Dongjin Choi","authors":"Dongjin Choi, Andy Xiang, Ozgur Ozturk, Deep Shrestha, Barry Drake,\n  Hamid Haidarian, Faizan Javed, Haesun Park","title":"Patient Clustering via Integrated Profiling of Clinical and Digital Data","comments":"Accepted for the Short Paper track of CIKM'23, October 21-25, 2023,\n  Birmingham, United Kingdom","journal-ref":null,"doi":"10.1145/3583780.3615262","report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel profile-based patient clustering model designed for\nclinical data in healthcare. By utilizing a method grounded on constrained\nlow-rank approximation, our model takes advantage of patients' clinical data\nand digital interaction data, including browsing and search, to construct\npatient profiles. As a result of the method, nonnegative embedding vectors are\ngenerated, serving as a low-dimensional representation of the patients. Our\nmodel was assessed using real-world patient data from a healthcare web portal,\nwith a comprehensive evaluation approach which considered clustering and\nrecommendation capabilities. In comparison to other baselines, our approach\ndemonstrated superior performance in terms of clustering coherence and\nrecommendation accuracy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:25:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Choi","Dongjin",""],["Xiang","Andy",""],["Ozturk","Ozgur",""],["Shrestha","Deep",""],["Drake","Barry",""],["Haidarian","Hamid",""],["Javed","Faizan",""],["Park","Haesun",""]]}
{"id":"2308.11749","submitter":"Ranveig Flatab{\\o} PhD","authors":"Ranveig Flatab{\\o}, Sabrina D. Eder, Thomas Reisinger, Gianangelo\n  Bracco, Peter Baltzer, Bj\\\"orn Samelin and Bodil Holst","title":"Reflection imaging with a helium zone plate microscope","comments":"20 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Neutral helium atom microscopy is a novel microscopy technique that offers\nstrictly surface-sensitive, non-destructive imaging. Several experiments have\nbeen published in recent years where images are obtained by scanning a helium\nbeam spot across a surface and recording the variation in scattered intensity\nat a fixed total scattering angle $\\theta_{sd}$ and fixed incident angle\n$\\theta_{i}$ relative to the overall surface normal. These experiments used a\nspot obtained by collimating the beam (referred to as helium pinhole\nmicroscopy). Alternatively, a beam spot can be created by focusing the beam\nwith an atom optical element. However up till now imaging with a focused helium\nbeam (referred to as helium zone plate microscopy) has only been demonstrated\nin transmission. Here we present the first reflection images obtained with a\nfocused helium beam. Images are obtained with a spot size (FWHM) down to 4.7\n$\\mu$m $\\pm$ 0.5 $\\mu$m, and we demonstrate focusing down to a spot size of\nabout 1 $\\mu$m. Furthermore, we present the first experiments measuring the\nscattering distribution from a focused helium beam spot. The experiments are\ndone by varying the incoming beam angle $\\theta_{i}$ while keeping the\nbeam-detector angle $\\theta_{sd}$ and the point where the beam spot hits the\nsurface fixed - in essence, a microscopy scale realization of a standard helium\natom scattering experiment. Our experiments are done using an electron\nbombardment detector with adjustable signal accumulation, developed\nparticularly for helium microscopy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:25:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Flatab\u00f8","Ranveig",""],["Eder","Sabrina D.",""],["Reisinger","Thomas",""],["Bracco","Gianangelo",""],["Baltzer","Peter",""],["Samelin","Bj\u00f6rn",""],["Holst","Bodil",""]]}
{"id":"2308.11750","submitter":"Michael Unterkalmsteiner","authors":"Michael Unterkalmsteiner, Tony Gorschek, Robert Feldt, Niklas Lavesson","title":"Large-scale information retrieval in software engineering -- an\n  experience report from industrial application","comments":null,"journal-ref":"Empir. Softw. Eng. 21(6): 2324-2365 (2016)","doi":"10.1007/s10664-015-9410-8","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Software Engineering activities are information intensive. Research proposes\nInformation Retrieval (IR) techniques to support engineers in their daily\ntasks, such as establishing and maintaining traceability links, fault\nidentification, and software maintenance. We describe an engineering task, test\ncase selection, and illustrate our problem analysis and solution discovery\nprocess. The objective of the study is to gain an understanding of to what\nextent IR techniques (one potential solution) can be applied to test case\nselection and provide decision support in a large-scale, industrial setting. We\nanalyze, in the context of the studied company, how test case selection is\nperformed and design a series of experiments evaluating the performance of\ndifferent IR techniques. Each experiment provides lessons learned from\nimplementation, execution, and results, feeding to its successor. The three\nexperiments led to the following observations: 1) there is a lack of research\non scalable parameter optimization of IR techniques for software engineering\nproblems; 2) scaling IR techniques to industry data is challenging, in\nparticular for latent semantic analysis; 3) the IR context poses constraints on\nthe empirical evaluation of IR techniques, requiring more research on\ndeveloping valid statistical approaches. We believe that our experiences in\nconducting a series of IR experiments with industry grade data are valuable for\npeer researchers so that they can avoid the pitfalls that we have encountered.\nFurthermore, we identified challenges that need to be addressed in order to\nbridge the gap between laboratory IR experiments and real applications of IR in\nthe industry.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:30:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""],["Feldt","Robert",""],["Lavesson","Niklas",""]]}
{"id":"2308.11751","submitter":"Henk Dijkstra","authors":"Henk A. Dijkstra and Rene M. van Westen","title":"The effect of model freshwater flux biases on the multi-stable regime of\n  the AMOC","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that global climate models (GCMs) have substantial biases in the\nsurface freshwater flux which forces the ocean component of these models. Using\nnumerical bifurcation analyses on a global ocean model, we study here the\neffect of a specific freshwater flux bias on the multiple equilibrium regime of\nthe Atlantic Meridional Overturning Circulation (AMOC). We find that a\n(positive) freshwater flux bias over the Indian Ocean shifts the multiple\nequilibrium regime to larger values of North Atlantic freshwater input but\nhardly affects the associated hysteresis width. The magnitude of this shift\ndepends on the way the anomalous North Atlantic freshwater flux is compensated.\nWe explain the changes in bifurcation diagrams using the freshwater balance\nover the Atlantic basin. The results suggest that state-of-the-art GCMs may\nhave an AMOC multiple equilibrium regime, but that it is located in a parameter\nregime that is considered unrealistic and hence is not explored.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:36:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dijkstra","Henk A.",""],["van Westen","Rene M.",""]]}
{"id":"2308.11752","submitter":"David Schwein","authors":"Peter Dillery and David Schwein","title":"Rigid inner forms and the Bernstein decomposition for $L$-parameters","comments":"46 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aubert, Moussaoui, and Solleveld have constructed an analogue for\n$L$-parameters of the supercuspidal support map, described the fibers of this\nmap as twisted group algebras, and conjectured a compatibility, using the local\nLanglands conjectures, with the ABPS conjecture. We explain how to modify their\narguments to fit Kaletha's framework of rigid inner forms. To prove a certain\ncompatibility with twisting we redevelop some of their theory of the\ngeneralized Springer correspondence for disconnected reductive groups, showing\nthat the support map of this theory is formally analogous to the supercuspidal\nsupport map.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:48:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dillery","Peter",""],["Schwein","David",""]]}
{"id":"2308.11753","submitter":"Geoff Vooys","authors":"Dorette Pronk and Geoff Vooys","title":"Equivariant Tangent Categories","comments":"42 Pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we show that if $G$ is a smooth algebraic group and if $X$ is a\nleft $G$-variety then under mild technical assumptions regarding a\npre-equivariant pseudofunctor $F:\\mathbf{SfResl}_G(X)^{\\operatorname{op}} \\to\n\\mathfrak{Cat}$ on $X$ there is a tangent structure on the equivariant category\n$F_G(X)$ which is induced by equivariant descent through tangent categories\nover each principal $G$-resolution. In particular this allows us to describe a\nnotion of equivariant tangent schemes over the variety $X$ and also give a\ngeneral condition when the category of pseudocones\n$\\mathsf{Bicat}(\\mathscr{C}^{\\operatorname{op}},\\mathfrak{Cat})(1,F)$ has a\ntangent structure induced by local tangent structures that the pseudofunctor\n$F$ picks out. We also prove in both these cases that our constructions are\nfunctorial.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:49:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pronk","Dorette",""],["Vooys","Geoff",""]]}
{"id":"2308.11754","submitter":"Mahmoud Nazzal","authors":"Mahmoud Nazzal, Issa Khalil, Abdallah Khreishah, NhatHai Phan, and Yao\n  Ma","title":"Multi-Instance Adversarial Attack on GNN-Based Malicious Domain\n  Detection","comments":"To Appear in the 45th IEEE Symposium on Security and Privacy (IEEE\n  S\\&P 2024), May 20-23, 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Malicious domain detection (MDD) is an open security challenge that aims to\ndetect if an Internet domain is associated with cyber-attacks. Among many\napproaches to this problem, graph neural networks (GNNs) are deemed highly\neffective. GNN-based MDD uses DNS logs to represent Internet domains as nodes\nin a maliciousness graph (DMG) and trains a GNN to infer their maliciousness by\nleveraging identified malicious domains. Since this method relies on accessible\nDNS logs to construct DMGs, it exposes a vulnerability for adversaries to\nmanipulate their domain nodes' features and connections within DMGs. Existing\nresearch mainly concentrates on threat models that manipulate individual\nattacker nodes. However, adversaries commonly generate multiple domains to\nachieve their goals economically and avoid detection. Their objective is to\nevade discovery across as many domains as feasible. In this work, we call the\nattack that manipulates several nodes in the DMG concurrently a multi-instance\nevasion attack. We present theoretical and empirical evidence that the existing\nsingle-instance evasion techniques for are inadequate to launch multi-instance\nevasion attacks against GNN-based MDDs. Therefore, we introduce MintA, an\ninference-time multi-instance adversarial attack on GNN-based MDDs. MintA\nenhances node and neighborhood evasiveness through optimized perturbations and\noperates successfully with only black-box access to the target model,\neliminating the need for knowledge about the model's specifics or non-adversary\nnodes. We formulate an optimization challenge for MintA, achieving an\napproximate solution. Evaluating MintA on a leading GNN-based MDD technique\nwith real-world data showcases an attack success rate exceeding 80%. These\nfindings act as a warning for security experts, underscoring GNN-based MDDs'\nsusceptibility to practical attacks that can undermine their effectiveness and\nbenefits.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:51:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nazzal","Mahmoud",""],["Khalil","Issa",""],["Khreishah","Abdallah",""],["Phan","NhatHai",""],["Ma","Yao",""]]}
{"id":"2308.11755","submitter":"Raj Korpan","authors":"Raj Korpan","title":"VBMO: Voting-Based Multi-Objective Path Planning","comments":"First International Workshop on Search and Planning with Complex\n  Objectives (WoSePCO) at IJCAI'2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper presents VBMO, the Voting-Based Multi-Objective path planning\nalgorithm, that generates optimal single-objective plans, evaluates each of\nthem with respect to the other objectives, and selects one with a voting\nmechanism. VBMO does not use hand-tuned weights, consider the multiple\nobjectives at every step of search, or use an evolutionary algorithm. Instead,\nit considers how a plan that is optimal in one objective may perform well with\nrespect to others. VBMO incorporates three voting mechanisms: range, Borda, and\ncombined approval. Extensive evaluation in diverse and complex environments\ndemonstrates the algorithm's ability to efficiently produce plans that satisfy\nmultiple objectives.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:51:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Korpan","Raj",""]]}
{"id":"2308.11756","submitter":"Angel Rincon","authors":"Angel Rincon and Gabriel G\\'omez","title":"Quasinormal modes and shadow in Einstein Maxwell power-Yang-Mills black\n  hole","comments":"18 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the present paper, we investigate the quasinormal modes of an\nEinstein-Maxwell power-Yang-Mills black hole in four dimensions, considering a\nspecific value of the power parameter $p = 1/2$. This particular case\nrepresents a black hole with both Abelian and Non-Abelian charges and is\nasymptotically non-flat. We begin by deriving the effective potential for a\nneutral massless particle using the aforementioned black hole solution.\nSubsequently, employing the sixth-order WKB approximation method, we calculate\nthe (scalar) quasinormal modes. Our numerical analysis indicates that these\nmodes are stable within the considered parameter range. This result is also\nconfirmed using the eikonal approximation. Furthermore, we calculate the shadow\nradius for this class of black hole and derive constraints on the electric and\nYang-Mills charges ($Q,Q_{\\rm YM}$) by using imaging observational data for Sgr\nA${^\\star}$, provided by the Event Horizon Telescope Collaboration. We observe\nthat as the electric charge $Q$ increases, the allowed range shifts towards\nnegative values of $Q_{\\rm YM}$. For instance, for the maximum value $Q\\approx\n1.1$ obtained, the allowed range becomes $-0.171 \\lesssim Q_{\\rm YM} \\lesssim\n-0.087$ consistent with KECK and VLTI data, while still retaining a\nnon-vanishing horizon.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:57:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rincon","Angel",""],["G\u00f3mez","Gabriel",""]]}
{"id":"2308.11757","submitter":"Benjamin Riggan","authors":"Kshitij Nikhal, Benjamin S. Riggan","title":"Weakly Supervised Face and Whole Body Recognition in Turbulent\n  Environments","comments":"IJCB 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Face and person recognition have recently achieved remarkable success under\nchallenging scenarios, such as off-pose and cross-spectrum matching. However,\nlong-range recognition systems are often hindered by atmospheric turbulence,\nleading to spatially and temporally varying distortions in the image. Current\nsolutions rely on generative models to reconstruct a turbulent-free image, but\noften preserve photo-realism instead of discriminative features that are\nessential for recognition. This can be attributed to the lack of large-scale\ndatasets of turbulent and pristine paired images, necessary for optimal\nreconstruction. To address this issue, we propose a new weakly supervised\nframework that employs a parameter-efficient self-attention module to generate\ndomain agnostic representations, aligning turbulent and pristine images into a\ncommon subspace. Additionally, we introduce a new tilt map estimator that\npredicts geometric distortions observed in turbulent images. This estimate is\nused to re-rank gallery matches, resulting in up to 13.86\\% improvement in\nrank-1 accuracy. Our method does not require synthesizing turbulent-free images\nor ground-truth paired images, and requires significantly fewer annotated\nsamples, enabling more practical and rapid utility of increasingly large\ndatasets. We analyze our framework using two datasets -- Long-Range Face\nIdentification Dataset (LRFID) and BRIAR Government Collection 1 (BGC1) --\nachieving enhanced discriminability under varying turbulence and standoff\ndistance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:58:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nikhal","Kshitij",""],["Riggan","Benjamin S.",""]]}
{"id":"2308.11758","submitter":"Simone Faro","authors":"Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola","title":"Quantum Circuits for Fixed Substring Matching Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum computation represents a computational paradigm whose distinctive\nattributes confer the ability to devise algorithms with asymptotic performance\nlevels significantly superior to those achievable via classical computation.\nRecent strides have been taken to apply this computational framework in\ntackling and resolving various issues related to text processing. The resultant\nsolutions demonstrate marked advantages over their classical counterparts. This\nstudy employs quantum computation to efficaciously surmount text processing\nchallenges, particularly those involving string comparison. The focus is on the\nalignment of fixed-length substrings within two input strings. Specifically,\ngiven two input strings, $x$ and $y$, both of length $n$, and a value $d \\leq\nn$, we want to verify the following conditions: the existence of a common\nprefix of length $d$, the presence of a common substring of length $d$\nbeginning at position $j$ (with $0 \\leq j < n$) and, the presence of any common\nsubstring of length $d$ beginning in both strings at the same position. Such\nproblems find applications as sub-procedures in a variety of problems\nconcerning text processing and sequence analysis. Notably, our approach\nfurnishes polylogarithmic solutions, a stark contrast to the linear complexity\ninherent in the best classical alternatives.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:58:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cantone","Domenico",""],["Faro","Simone",""],["Pavone","Arianna",""],["Viola","Caterina",""]]}
{"id":"2308.11759","submitter":"Peter Lindstrom","authors":"Victor A. P. Magri and Peter Lindstrom","title":"A General Framework for Progressive Data Compression and Retrieval","comments":"To be published in Proceedings of IEEE VIS 2023, IEEE Transactions on\n  Visualization and Computer Graphics","journal-ref":null,"doi":null,"report-no":"LLNL-JRNL-852463","categories":"cs.DB cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In scientific simulations, observations, and experiments, the cost of\ntransferring data to and from disk and across networks has become a significant\nbottleneck that particularly impacts subsequent data analysis and\nvisualization. To address this challenge, compression techniques have been\nwidely adopted. However, traditional lossy compression approaches often require\nsetting error tolerances conservatively to respect the numerical sensitivities\nof a wide variety of post hoc data analyses, some of which may not even be\nknown a priori. Progressive data compression and retrieval has emerged as a\nsolution, allowing for the adaptive handling of compressed data according to\nthe needs of a given post-processing task. However, few analysis algorithms\nnatively support progressive data processing, and adapting compression\ntechniques, file formats, client/server frameworks, and APIs to support\nprogressivity can be challenging. This work presents a general framework that\nsupports progressive-precision data queries independently of the underlying\ndata compressor or number representation. Our approach is based on a\nmultiple-component representation that successively, with each new component,\nreduces the error between the original and compressed field, allowing each\nfield in the progressive sequence to be expressed as a partial sum of\ncomponents. We have implemented our approach on top of four popular scientific\ndata compressors and have evaluated its behavior on several real-world data\nsets from the SDRBench collection. Numerical results indicate that our\nframework is effective in terms of accuracy compared to each of the standalone\ncompressors it builds upon. In addition, (de)compression time is proportional\nto the number and granularity of components. Finally, our framework allows for\nfully lossless compression using lossy compressors when a sufficient number of\ncomponents are employed.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 21:43:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Magri","Victor A. P.",""],["Lindstrom","Peter",""]]}
{"id":"2308.11760","submitter":"Changxin Ding","authors":"Matthew Baker, Changxin Ding, Xu Zhuang","title":"The Jacobian of a Sixth-Root-of-Unity Matroid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Jacobian group (also called the sandpile group, Picard group, or critical\ngroup) of a graph or, more generally, of a regular matroid has been well\nstudied. Sixth-root-of-unity matroids, also called complex unimodular matroids,\nare generalizations of regular matroids. This paper provides a definition, and\nestablishes some basic properties, of the Jacobian group of a\nsixth-root-of-unity matroid.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:07:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Baker","Matthew",""],["Ding","Changxin",""],["Zhuang","Xu",""]]}
{"id":"2308.11761","submitter":"Xintao Wang","authors":"Xintao Wang, Qianwen Yang, Yongting Qiu, Jiaqing Liang, Qianyu He,\n  Zhouhong Gu, Yanghua Xiao, Wei Wang","title":"KnowledGPT: Enhancing Large Language Models with Retrieval and Storage\n  Access on Knowledge Bases","comments":"21 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have demonstrated impressive impact in the field\nof natural language processing, but they still struggle with several issues\nregarding, such as completeness, timeliness, faithfulness and adaptability.\nWhile recent efforts have focuses on connecting LLMs with external knowledge\nsources, the integration of knowledge bases (KBs) remains understudied and\nfaces several challenges. In this paper, we introduce KnowledGPT, a\ncomprehensive framework to bridge LLMs with various knowledge bases,\nfacilitating both the retrieval and storage of knowledge. The retrieval process\nemploys the program of thought prompting, which generates search language for\nKBs in code format with pre-defined functions for KB operations. Besides\nretrieval, KnowledGPT offers the capability to store knowledge in a\npersonalized KB, catering to individual user demands. With extensive\nexperiments, we show that by integrating LLMs with KBs, KnowledGPT properly\nanswers a broader range of questions requiring world knowledge compared with\nvanilla LLMs, utilizing both knowledge existing in widely-known KBs and\nextracted into personalized KBs.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 13:07:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Xintao",""],["Yang","Qianwen",""],["Qiu","Yongting",""],["Liang","Jiaqing",""],["He","Qianyu",""],["Gu","Zhouhong",""],["Xiao","Yanghua",""],["Wang","Wei",""]]}
{"id":"2308.11762","submitter":"Orzion Levy","authors":"Orzion Levy, Itzik Klein","title":"INS/DVL Fusion with DVL Based Acceleration Measurements","comments":"10 pages, 1 diagram, 1 image, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous underwater vehicles (AUVs) are increasingly used in many\napplications such as oceanographic surveys, mapping, and inspection of\nunderwater structures. To successfully complete those tasks, a Doppler velocity\nlog (DVL) and an inertial navigation system (INS) are utilized to determine the\nAUV navigation solution. In such fusion, DVL velocity measurement is used to\nupdate the navigation states. In this paper, we propose calculating the AUV\nacceleration vector based on past DVL measurements and using it as an\nadditional update to increase the system's accuracy. Simulations and sea\nexperiments were conducted to demonstrate the efficiency of our approach. The\nresults indicate that the proposed method exhibits rapid convergence and\nsignificantly improves the overall performance compared to the baseline INS and\nDVL fusion approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:08:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Levy","Orzion",""],["Klein","Itzik",""]]}
{"id":"2308.11763","submitter":"Fernando A N Santos","authors":"Danillo Barros de Souza, Jonatas T. S. da Cunha, Rodrigo A. Moreira,\n  Fernando A. N. Santos and Serafim Rodrigues","title":"An efficient set-theoretic algorithm for high-order Forman-Ricci\n  curvature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an cs.DM cs.PF math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Differential geometric approaches are ubiquitous in several fields of\nmathematics, physics and engineering, and their discretizations enable the\ndevelopment of network-based mathematical and computational frameworks, which\nare essential for large-scale data science. The Forman-Ricci curvature (FRC) -\na statistical measure based on Riemannian geometry and designed for networks -\nis known for its high capacity for extracting geometric information from\ncomplex networks. However, extracting information from dense networks is still\nchallenging due to the combinatorial explosion of high-order network\nstructures. Motivated by this challenge we sought a set-theoretic\nrepresentation theory for high-order network cells and FRC, as well as their\nassociated concepts and properties, which together provide an alternative and\nefficient formulation for computing high-order FRC in complex networks. We\nprovide a pseudo-code, a software implementation coined FastForman, as well as\na benchmark comparison with alternative implementations. Crucially, our\nrepresentation theory reveals previous computational bottlenecks and also\naccelerates the computation of FRC. As a consequence, our findings open new\nresearch possibilities in complex systems where higher-order geometric\ncomputations are required.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:09:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["de Souza","Danillo Barros",""],["da Cunha","Jonatas T. S.",""],["Moreira","Rodrigo A.",""],["Santos","Fernando A. N.",""],["Rodrigues","Serafim",""]]}
{"id":"2308.11764","submitter":"Mohamed Elaraby","authors":"Mohamed Elaraby, Mengyin Lu, Jacob Dunn, Xueying Zhang, Yu Wang,\n  Shizhu Liu","title":"Halo: Estimation and Reduction of Hallucinations in Open-Source Weak\n  Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Large Language Models (LLMs) have revolutionized Natural Language Processing\n(NLP). Although convenient for research and practical applications, open-source\nLLMs with fewer parameters often suffer from severe hallucinations compared to\ntheir larger counterparts. This paper focuses on measuring and reducing\nhallucinations in BLOOM 7B, a representative of such weaker open-source LLMs\nthat are publicly available for research and commercial applications. We\nintroduce HaloCheck, a lightweight BlackBox knowledge-free framework designed\nto quantify the severity of hallucinations in LLMs. Additionally, we explore\ntechniques like knowledge injection and teacher-student approaches to alleviate\nhallucinations in low-parameter LLMs. Our experiments effectively demonstrate\nthe reduction of hallucinations in challenging domains for these LLMs.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:12:49 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:57:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Elaraby","Mohamed",""],["Lu","Mengyin",""],["Dunn","Jacob",""],["Zhang","Xueying",""],["Wang","Yu",""],["Liu","Shizhu",""]]}
{"id":"2308.11765","submitter":"Oleg I. Reinov","authors":"Oleg I. Reinov","title":"Trace, determinant and eigenvalues of nuclear operators","comments":"24 pages, in Russian","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown how the results in the theory of determinants and traces as well\nas in the theory of quasi-normed tensor products can be applied for getting new\ntheorems on distribution of eigenvalues of nuclear operators in Banach spaces\nand on coincidence of spectral and nuclear traces such operators. As examples,\nit is considered the new classes of operators -- generalized nuclear operators\nof Lorentz--Laprest\\'e $N_{(r,s),p}.$\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:13:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Reinov","Oleg I.",""]]}
{"id":"2308.11766","submitter":"Peitao Liu","authors":"Jiaxi Liu, Tianye Yu, Jiangxu Li, Jiantao Wang, Junwen Lai, Yan Sun,\n  Xing-Qiu Chen, and Peitao Liu","title":"Symmetry breaking induced insulating electronic state in\n  Pb$_{9}$Cu(PO$_4$)$_6$O","comments":"19 pages, 9 figures (including Supplementary Material)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recent experimental claim of room-temperature ambient-pressure\nsuperconductivity in a Cu-doped lead-apatite (LK-99) has ignited substantial\nresearch interest in both experimental and theoretical domains. Previous\ndensity functional theory (DFT) calculations with the inclusion of an on-site\nHubbard interaction $U$ consistently predict the presence of flat bands\ncrossing the Fermi level. This is in contrast to DFT plus dynamical mean field\ntheory calculations, which reveal the Mott insulating behavior for the\nstoichiometric Pb$_{9}$Cu(PO$_4$)$_6$O compound. Nevertheless, the existing\ncalculations are all based on the $P6_3/m$ structure, which is argued to be not\nthe ground-state structure. Here, we revisit the electronic structure of\nPb$_{9}$Cu(PO$_4$)$_6$O with the energetically more favorable $P\\bar{3}$\nstructure, fully taking into account electronic symmetry breaking. We examine\nall possible configurations for Cu substituting the Pb sites. Our results show\nthat the doped Cu atoms exhibit a preference for substituting the Pb2 sites\nthan the Pb1 sites. In both cases, the calculated substitutional formation\nenergies are large, indicating the difficulty in incorporating Cu at the Pb\nsites. We find that most of structures with Cu at the Pb2 site tend to be\ninsulating, while the structures with both two Cu atoms at the Pb1 sites\n(except one configuration) are predicted to be metallic by DFT+$U$\ncalculations. However, when accounting for the electronic symmetry breaking,\nsome Cu-doped configurations previously predicted to be metallic (including the\nstructure studied in previous DFT+$U$ calculations) become insulating. Our work\nhighlights the importance of symmetry breaking in obtaining correct electronic\nstate for Pb$_{9}$Cu(PO$_4$)$_6$O, thereby reconciling previous DFT+$U$ and\nDFT+DMFT calculations.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:08:43 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 01:13:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Jiaxi",""],["Yu","Tianye",""],["Li","Jiangxu",""],["Wang","Jiantao",""],["Lai","Junwen",""],["Sun","Yan",""],["Chen","Xing-Qiu",""],["Liu","Peitao",""]]}
{"id":"2308.11767","submitter":"Ahmed Abdeen Hamed Ph.D","authors":"Ahmed Abdeen Hamed and Xindong Wu","title":"Improving Detection of ChatGPT-Generated Fake Science Using Real\n  Publication Text: Introducing xFakeBibs a Supervised-Learning Network\n  Algorithm","comments":"14 pages, 6 figures, 4 tables, 2 algorithms","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  ChatGPT is becoming a new reality. In this paper, we show how to distinguish\nChatGPT-generated publications from counterparts produced by scientists. Using\na newly designed supervised Machine Learning algorithm, we demonstrate how to\ndetect machine-generated publications from those produced by scientists. The\nalgorithm was trained using 100 real publication abstracts, followed by a\n10-fold calibration approach to establish a lower-upper bound range of\nacceptance. In the comparison with ChatGPT content, it was evident that ChatGPT\ncontributed merely 23\\% of the bigram content, which is less than 50\\% of any\nof the other 10 calibrating folds. This analysis highlights a significant\ndisparity in technical terms where ChatGPT fell short of matching real science.\nWhen categorizing the individual articles, the xFakeBibs algorithm accurately\nidentified 98 out of 100 publications as fake, with 2 articles incorrectly\nclassified as real publications. Though this work introduced an algorithmic\napproach that detected the ChatGPT-generated fake science with a high degree of\naccuracy, it remains challenging to detect all fake records. This work is\nindeed a step in the right direction to counter fake science and\nmisinformation.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 23:22:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hamed","Ahmed Abdeen",""],["Wu","Xindong",""]]}
{"id":"2308.11768","submitter":"Jian Wang","authors":"Pinyuan Wang, Xiaoqi Liu, Jun Ge, Chengcheng Ji, Haoran Ji, Yanzhao\n  Liu, Yiwen Ai, Gaoxing Ma, Shichao Qi, Jian Wang","title":"Ferromagnetic and insulating behavior in both half magnetic levitation\n  and non-levitation LK-99 like samples","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Finding materials exhibiting superconductivity at room temperature has long\nbeen one of the ultimate goals in physics and material science. Recently,\nroom-temperature superconducting properties have been claimed in a copper\nsubstituted lead phosphate apatite (Pb$_{10-x}$Cu$_x$(PO$_4$)$_6$O, or called\nLK-99) [1-3]. Using a similar approach, we have prepared LK-99 like samples and\nconfirmed the half-levitation behaviors in some small specimens under the\ninfluence of a magnet at room temperature. To examine the magnetic properties\nof our samples, we have performed systematic magnetization measurements on the\nas-grown LK-99-like samples, including the half-levitated and non-levitated\nsamples. The magnetization measurements show the coexistence of\nsoft-ferromagnetic and diamagnetic signals in both half-levitated and\nnon-levitated samples. The electrical transport measurements on the as-grown\nLK-99-like samples including both half-levitated and non-levitated samples show\nan insulating behavior characterized by the increasing resistivity with the\ndecreasing temperature.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 03:53:38 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 13:06:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Pinyuan",""],["Liu","Xiaoqi",""],["Ge","Jun",""],["Ji","Chengcheng",""],["Ji","Haoran",""],["Liu","Yanzhao",""],["Ai","Yiwen",""],["Ma","Gaoxing",""],["Qi","Shichao",""],["Wang","Jian",""]]}
{"id":"2308.11769","submitter":"Jisi Pan","authors":"Ji-Hai Pan, Jisi Pan","title":"Investigation of the mass spectra of singly heavy baryons $\\Sigma_{Q}$,\n  $\\Xi^{\\prime}_{Q}$ and $\\Omega_{Q}$$(Q=c, d)$ in Regge trajectory model","comments":"31 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, the LHCb observed that two new very narrow excited states\n$\\Omega_{c}^{0}$ decays into $\\Xi^{+}_{c}K^{-}$ with masses of about $3185$ MeV\nand $3327$ MeV, but their parity quantum numbers have not been determined. In\nthis paper, we exploited the quark-diquark model and the linear Regge\ntrajectory model, combined with the perturbation treatment method to analyze\nand study the mass spectra of the discovered experimental data for the singly\nheavy baryons $\\Sigma_{c}/\\Sigma_{b}$, $\\Xi^{\\prime}_{c}/\\Xi^{\\prime}_{b}$ and\n$\\Omega_{c}/\\Omega_{b}$, and then we further predict the mass spectra of\nseveral unobserved the baryons $\\Sigma_{c}/\\Sigma_{b}$,\n$\\Xi^{\\prime}_{c}/\\Xi^{\\prime}_{b}$ and $\\Omega_{c}/\\Omega_{b}$. In the case of\nthe baryons $\\Omega_{c}(3185)^{0}$ and $\\Omega_{c}(3327)^{0}$, we determine the\n$\\Omega_{c}(3185)^{0}$ is $2S$ state and the $\\Omega_{c}(3327)^{0}$ is $1D$\nstate with the parity quantum number $J^{P}=1/2^{+}$ and $J^{P}=3/2^{+}$,\nrespectively. An overall good agreement of the obtained predictions with\navailable experimental data is found.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 03:56:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pan","Ji-Hai",""],["Pan","Jisi",""]]}
{"id":"2308.11770","submitter":"Abhik Kumar Sanyal Dr.","authors":"Dalia Saha, Jyoti Prasad Saha and Abhik Kumar Sanyal","title":"Inflation and cosmological evolution with $F(R,G)$ gravity theory","comments":"34 pages, 1 figure","journal-ref":"International Journal of Geometric Methods in Modern Physics\n  (2023) 2350213 (48 pages), World Scientific Publishing Company","doi":"10.1142/S0219887823502134","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the last decade Planck PR4 data together with ground-based experimental\ndata such as, BK18, BAO and CMB lensing, tightened constraint of the tensor to\nscalar ratio, starting form $r < 0.14$ to $r < 0.032$, while the spectral index\nlies within the range $0.9631 < n_s < 0.9705$. Viability of modified gravity\ntheories, proposed as alternatives to the dark-energy issue, should therefore\nbe tested in the light of such new result. Here, we explore $F(R,G)$ gravity\ntheory in regard of the early universe and have shown that, it is not\ncompatible with newly released constraints on $r$ and $n_s$ simultaneously.\nFurther, it also fails to produce a feasible radiation dominated era. It\ntherefore questions the justification of using the model for resolving the\ncosmic puzzle.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:43:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Saha","Dalia",""],["Saha","Jyoti Prasad",""],["Sanyal","Abhik Kumar",""]]}
{"id":"2308.11771","submitter":"Chang Gao","authors":"Qinyu Chen, Zuowen Wang, Shih-Chii Liu, Chang Gao","title":"3ET: Efficient Event-based Eye Tracking using a Change-Based ConvLSTM\n  Network","comments":"To be published at the 2023 IEEE Biomedical Circuits and Systems\n  (BioCAS) Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a sparse Change-Based Convolutional Long Short-Term\nMemory (CB-ConvLSTM) model for event-based eye tracking, key for\nnext-generation wearable healthcare technology such as AR/VR headsets. We\nleverage the benefits of retina-inspired event cameras, namely their\nlow-latency response and sparse output event stream, over traditional\nframe-based cameras. Our CB-ConvLSTM architecture efficiently extracts\nspatio-temporal features for pupil tracking from the event stream,\noutperforming conventional CNN structures. Utilizing a delta-encoded recurrent\npath enhancing activation sparsity, CB-ConvLSTM reduces arithmetic operations\nby approximately 4.7$\\times$ without losing accuracy when tested on a\n\\texttt{v2e}-generated event dataset of labeled pupils. This increase in\nefficiency makes it ideal for real-time eye tracking in resource-constrained\ndevices. The project code and dataset are openly available at\n\\url{https://github.com/qinche106/cb-convlstm-eyetracking}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:24:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Qinyu",""],["Wang","Zuowen",""],["Liu","Shih-Chii",""],["Gao","Chang",""]]}
{"id":"2308.11772","submitter":"Sobhan Sounda","authors":"Sobhan Sounda and Dibyendu jana","title":"Derivation of Conservation Laws in 2nd order Quantum-Correlation Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper extends the foundational concept to second-order quantum\ncorrelation tensors, representing intensity-intensity correlations.As their\napplication in diverse optical field experiments gaining importance, we\ninvestigate conserved quantities such as energy, linear and angular momentum\nand illuminate the dynamic nature of quantum correlations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:27:35 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 12:31:08 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sounda","Sobhan",""],["jana","Dibyendu",""]]}
{"id":"2308.11773","submitter":"Yuezhou Zhang","authors":"Yuezhou Zhang, Amos A Folarin, Judith Dineley, Pauline Conde, Valeria\n  de Angel, Shaoxiong Sun, Yatharth Ranjan, Zulqarnain Rashid, Callum Stewart,\n  Petroula Laiou, Heet Sankesara, Linglong Qian, Faith Matcham, Katie M White,\n  Carolin Oetzmann, Femke Lamers, Sara Siddi, Sara Simblett, Bj\\\"orn W.\n  Schuller, Srinivasan Vairavan, Til Wykes, Josep Maria Haro, Brenda WJH\n  Penninx, Vaibhav A Narayan, Matthew Hotopf, Richard JB Dobson, Nicholas\n  Cummins, RADAR-CNS consortium","title":"Identifying depression-related topics in smartphone-collected\n  free-response speech recordings using an automatic speech recognition system\n  and a deep learning topic model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CY cs.SD eess.AS q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Language use has been shown to correlate with depression, but large-scale\nvalidation is needed. Traditional methods like clinic studies are expensive.\nSo, natural language processing has been employed on social media to predict\ndepression, but limitations remain-lack of validated labels, biased user\nsamples, and no context. Our study identified 29 topics in 3919\nsmartphone-collected speech recordings from 265 participants using the Whisper\ntool and BERTopic model. Six topics with a median PHQ-8 greater than or equal\nto 10 were regarded as risk topics for depression: No Expectations, Sleep,\nMental Therapy, Haircut, Studying, and Coursework. To elucidate the topic\nemergence and associations with depression, we compared behavioral (from\nwearables) and linguistic characteristics across identified topics. The\ncorrelation between topic shifts and changes in depression severity over time\nwas also investigated, indicating the importance of longitudinally monitoring\nlanguage use. We also tested the BERTopic model on a similar smaller dataset\n(356 speech recordings from 57 participants), obtaining some consistent\nresults. In summary, our findings demonstrate specific speech topics may\nindicate depression severity. The presented data-driven workflow provides a\npractical approach to collecting and analyzing large-scale speech data from\nreal-world settings for digital health research.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:30:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Yuezhou",""],["Folarin","Amos A",""],["Dineley","Judith",""],["Conde","Pauline",""],["de Angel","Valeria",""],["Sun","Shaoxiong",""],["Ranjan","Yatharth",""],["Rashid","Zulqarnain",""],["Stewart","Callum",""],["Laiou","Petroula",""],["Sankesara","Heet",""],["Qian","Linglong",""],["Matcham","Faith",""],["White","Katie M",""],["Oetzmann","Carolin",""],["Lamers","Femke",""],["Siddi","Sara",""],["Simblett","Sara",""],["Schuller","Bj\u00f6rn W.",""],["Vairavan","Srinivasan",""],["Wykes","Til",""],["Haro","Josep Maria",""],["Penninx","Brenda WJH",""],["Narayan","Vaibhav A",""],["Hotopf","Matthew",""],["Dobson","Richard JB",""],["Cummins","Nicholas",""],["consortium","RADAR-CNS",""]]}
{"id":"2308.11774","submitter":"Ange Lou","authors":"Ange Lou, Yamin Li, Xing Yao, Yike Zhang and Jack Noble","title":"SAMSNeRF: Segment Anything Model (SAM) Guides Dynamic Surgical Scene\n  Reconstruction by Neural Radiance Field (NeRF)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The accurate reconstruction of surgical scenes from surgical videos is\ncritical for various applications, including intraoperative navigation and\nimage-guided robotic surgery automation. However, previous approaches, mainly\nrelying on depth estimation, have limited effectiveness in reconstructing\nsurgical scenes with moving surgical tools. To address this limitation and\nprovide accurate 3D position prediction for surgical tools in all frames, we\npropose a novel approach called SAMSNeRF that combines Segment Anything Model\n(SAM) and Neural Radiance Field (NeRF) techniques. Our approach generates\naccurate segmentation masks of surgical tools using SAM, which guides the\nrefinement of the dynamic surgical scene reconstruction by NeRF. Our\nexperimental results on public endoscopy surgical videos demonstrate that our\napproach successfully reconstructs high-fidelity dynamic surgical scenes and\naccurately reflects the spatial information of surgical tools. Our proposed\napproach can significantly enhance surgical navigation and automation by\nproviding surgeons with accurate 3D position information of surgical tools\nduring surgery.The source code will be released soon.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:31:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lou","Ange",""],["Li","Yamin",""],["Yao","Xing",""],["Zhang","Yike",""],["Noble","Jack",""]]}
{"id":"2308.11775","submitter":"Ruma Dutta Dr.","authors":"R. Dutta, Aurel Stan","title":"Conformal folding Dynamics of Amyloid $\\beta$-$\\tau$ Oligomer in\n  Neuronal Dysfunction","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph physics.med-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work, we develop model for neuronal degeneration based on polymer\nchain folding dynamics and their connectivity in various scale. In the first\nphase, we just developed the model and numerical simulation need to be complete\nin order to complete the mathematical development of the disease progression.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:32:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dutta","R.",""],["Stan","Aurel",""]]}
{"id":"2308.11776","submitter":"Ange Lou","authors":"Ange Lou and Jack Noble","title":"WS-SfMLearner: Self-supervised Monocular Depth and Ego-motion Estimation\n  on Surgical Videos with Unknown Camera Parameters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Depth estimation in surgical video plays a crucial role in many image-guided\nsurgery procedures. However, it is difficult and time consuming to create depth\nmap ground truth datasets in surgical videos due in part to inconsistent\nbrightness and noise in the surgical scene. Therefore, building an accurate and\nrobust self-supervised depth and camera ego-motion estimation system is gaining\nmore attention from the computer vision community. Although several\nself-supervision methods alleviate the need for ground truth depth maps and\nposes, they still need known camera intrinsic parameters, which are often\nmissing or not recorded. Moreover, the camera intrinsic prediction methods in\nexisting works depend heavily on the quality of datasets. In this work, we\naimed to build a self-supervised depth and ego-motion estimation system which\ncan predict not only accurate depth maps and camera pose, but also camera\nintrinsic parameters. We proposed a cost-volume-based supervision manner to\ngive the system auxiliary supervision for camera parameters prediction. The\nexperimental results showed that the proposed method improved the accuracy of\nestimated camera parameters, ego-motion, and depth estimation.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:35:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lou","Ange",""],["Noble","Jack",""]]}
{"id":"2308.11777","submitter":"Anshuman Chaube","authors":"A. Chaube, A.J. Novak, H. Yuan, E. Merzari, D.R. Shaver, P.F. Fischer,\n  C.S. Brooks","title":"A Preliminary Fluid-Structure Coupling of NekRS and MOOSE via Cardinal","comments":"The International Conference on Mathematics and Computational Methods\n  Applied to Nuclear Science and Engineering, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fluid-Structure Interaction (FSI) is a significant phenomenon in most nuclear\nreactors, causing effects such as Flow-Induced Vibration (FIV) and\nthermally-driven Core-Radial Expansion (CRE). We demonstrate that Cardinal, an\nopen-source coupling of NekRS and OpenMC to MOOSE, can be used for modelling\nFSI by coupling the Tensor Mechanics Module from the Multiphysics Object\nOriented Simulation Environment (MOOSE) to NekRS's Arbitrary\nLagrangian-Eulerian (ALE) solver. The solid mechanics-thermal hydraulics\ncoupling is implemented using efficient in-memory coupling and data transfers.\nWe provide a preliminary demonstration of these capabilities with a 3-D FSI\nbenchmark for an elastic block in crossflow.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:35:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chaube","A.",""],["Novak","A. J.",""],["Yuan","H.",""],["Merzari","E.",""],["Shaver","D. R.",""],["Fischer","P. F.",""],["Brooks","C. S.",""]]}
{"id":"2308.11778","submitter":"Guojun Zhang","authors":"Sobhan Hemati, Guojun Zhang, Amir Estiri, Xi Chen","title":"Understanding Hessian Alignment for Domain Generalization","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Out-of-distribution (OOD) generalization is a critical ability for deep\nlearning models in many real-world scenarios including healthcare and\nautonomous vehicles. Recently, different techniques have been proposed to\nimprove OOD generalization. Among these methods, gradient-based regularizers\nhave shown promising performance compared with other competitors. Despite this\nsuccess, our understanding of the role of Hessian and gradient alignment in\ndomain generalization is still limited. To address this shortcoming, we analyze\nthe role of the classifier's head Hessian matrix and gradient in domain\ngeneralization using recent OOD theory of transferability. Theoretically, we\nshow that spectral norm between the classifier's head Hessian matrices across\ndomains is an upper bound of the transfer measure, a notion of distance between\ntarget and source domains. Furthermore, we analyze all the attributes that get\naligned when we encourage similarity between Hessians and gradients. Our\nanalysis explains the success of many regularizers like CORAL, IRM, V-REx,\nFish, IGA, and Fishr as they regularize part of the classifier's head Hessian\nand/or gradient. Finally, we propose two simple yet effective methods to match\nthe classifier's head Hessians and gradients in an efficient way, based on the\nHessian Gradient Product (HGP) and Hutchinson's method (Hutchinson), and\nwithout directly calculating Hessians. We validate the OOD generalization\nability of proposed methods in different scenarios, including transferability,\nsevere correlation shift, label shift and diversity shift. Our results show\nthat Hessian alignment methods achieve promising performance on various OOD\nbenchmarks. The code is available at\n\\url{https://github.com/huawei-noah/Federated-Learning/tree/main/HessianAlignment}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:36:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hemati","Sobhan",""],["Zhang","Guojun",""],["Estiri","Amir",""],["Chen","Xi",""]]}
{"id":"2308.11779","submitter":"Nat Gopalswamy","authors":"Nat Gopalswamy, Anshu Kumari, and Pertti A. M\\\"akel\\\"a","title":"Type III Radio Bursts from Solar Eruptions and their Connection to GLE\n  and SGRE Events","comments":"3 pages, 4 figures, to appear in the Proceedings of the URSI GASS\n  2023, Sapporo, Japan, 19 to 26 August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the close similarity of coronal mass ejection (CME) properties\nin ground level enhancement (GLE) in solar energetic particle (SEP) events and\nsustained gamma ray emission (SGRE) from the Sun as indicated by low frequency\ntype III radio bursts observed in the interplanetary medium. The complex type\nIII bursts have an average 1 MHz duration of 36 and 34 min in the SGRE and GLE\nevents, respectively. Similarly, the CMEs underlying SGRE and GLE have average\nspace speeds of 1866 and 2084 km/s, respectively. These are larger than the\ncorresponding values (32 min, 1407 km/s) for a control sample of type III\nbursts associated with frontside halo CMEs with sky plane speed exceeding 800\nkm/s. These results are consistent with the idea that energetic CME driven\nshocks accelerate particles to very high energies that are responsible for GLE\nand SGRE events.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:38:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gopalswamy","Nat",""],["Kumari","Anshu",""],["M\u00e4kel\u00e4","Pertti A.",""]]}
{"id":"2308.11780","submitter":"Anindya S. Das","authors":"Anindya Sundar Das, Aravind Ajay, Sriparna Saha and Monowar Bhuyan","title":"Few-shot Anomaly Detection in Text with Deviation Learning","comments":"Accepted in ICONIP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Most current methods for detecting anomalies in text concentrate on\nconstructing models solely relying on unlabeled data. These models operate on\nthe presumption that no labeled anomalous examples are available, which\nprevents them from utilizing prior knowledge of anomalies that are typically\npresent in small numbers in many real-world applications. Furthermore, these\nmodels prioritize learning feature embeddings rather than optimizing anomaly\nscores directly, which could lead to suboptimal anomaly scoring and inefficient\nuse of data during the learning process. In this paper, we introduce FATE, a\ndeep few-shot learning-based framework that leverages limited anomaly examples\nand learns anomaly scores explicitly in an end-to-end method using deviation\nlearning. In this approach, the anomaly scores of normal examples are adjusted\nto closely resemble reference scores obtained from a prior distribution.\nConversely, anomaly samples are forced to have anomalous scores that\nconsiderably deviate from the reference score in the upper tail of the prior.\nAdditionally, our model is optimized to learn the distinct behavior of\nanomalies by utilizing a multi-head self-attention layer and multiple instance\nlearning approaches. Comprehensive experiments on several benchmark datasets\ndemonstrate that our proposed approach attains a new level of state-of-the-art\nperformance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:40:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Das","Anindya Sundar",""],["Ajay","Aravind",""],["Saha","Sriparna",""],["Bhuyan","Monowar",""]]}
{"id":"2308.11781","submitter":"Anirban Mukherjee","authors":"Anirban Mukherjee and Hannah H. Chang","title":"Addressing Dynamic and Sparse Qualitative Data: A Hilbert Space\n  Embedding of Categorical Variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel framework for incorporating qualitative data into\nquantitative models for causal estimation. Previous methods use categorical\nvariables derived from qualitative data to build quantitative models. However,\nthis approach can lead to data-sparse categories and yield inconsistent\n(asymptotically biased) and imprecise (finite sample biased) estimates if the\nqualitative information is dynamic and intricate. We use functional analysis to\ncreate a more nuanced and flexible framework. We embed the observed categories\ninto a latent Baire space and introduce a continuous linear map -- a Hilbert\nspace embedding -- from the Baire space of categories to a Reproducing Kernel\nHilbert Space (RKHS) of representation functions. Through the Riesz\nrepresentation theorem, we establish that the canonical treatment of\ncategorical variables in causal models can be transformed into an identified\nstructure in the RKHS. Transfer learning acts as a catalyst to streamline\nestimation -- embeddings from traditional models are paired with the kernel\ntrick to form the Hilbert space embedding. We validate our model through\ncomprehensive simulation evidence and demonstrate its relevance in a real-world\nstudy that contrasts theoretical predictions from economics and psychology in\nan e-commerce marketplace. The results confirm the superior performance of our\nmodel, particularly in scenarios where qualitative information is nuanced and\ncomplex.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:40:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mukherjee","Anirban",""],["Chang","Hannah H.",""]]}
{"id":"2308.11782","submitter":"Mahdi Manavi","authors":"Mahdi Manavi, Yunpeng Zhang, Guoning Chen","title":"Resource Allocation in Cloud Computing Using Genetic Algorithm and\n  Neural Network","comments":"IEEE Smart Cloud 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Cloud computing is one of the most used distributed systems for data\nprocessing and data storage. Due to the continuous increase in the size of the\ndata processed by cloud computing, scheduling multiple tasks to maintain\nefficiency while reducing idle becomes more and more challenging. Efficient\ncloud-based scheduling is also highly sought by modern transportation systems\nto improve their security. In this paper, we propose a hybrid algorithm that\nleverages genetic algorithms and neural networks to improve scheduling. Our\nmethod classifies tasks with the Neural Network Task Classification (N2TC) and\nsends the selected tasks to the Genetic Algorithm Task Assignment (GATA) to\nallocate resources. It is fairness aware to prevent starvation and considers\nthe execution time, response time, cost, and system efficiency. Evaluations\nshow that our approach outperforms the state-of-the-art method by 3.2% at\nexecution time, 13.3% in costs, and 12.1% at response time.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:41:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Manavi","Mahdi",""],["Zhang","Yunpeng",""],["Chen","Guoning",""]]}
{"id":"2308.11783","submitter":"Ron Ferens","authors":"Yoli Shavit, Ron Ferens, Yosi Keller","title":"Coarse-to-Fine Multi-Scene Pose Regression with Transformers","comments":"Accepted to IEEE Transactions on Pattern Analysis and Machine\n  Intelligence (TPAMI). arXiv admin note: substantial text overlap with\n  arXiv:2103.11468","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Absolute camera pose regressors estimate the position and orientation of a\ncamera given the captured image alone. Typically, a convolutional backbone with\na multi-layer perceptron (MLP) head is trained using images and pose labels to\nembed a single reference scene at a time. Recently, this scheme was extended to\nlearn multiple scenes by replacing the MLP head with a set of fully connected\nlayers. In this work, we propose to learn multi-scene absolute camera pose\nregression with Transformers, where encoders are used to aggregate activation\nmaps with self-attention and decoders transform latent features and scenes\nencoding into pose predictions. This allows our model to focus on general\nfeatures that are informative for localization, while embedding multiple scenes\nin parallel. We extend our previous MS-Transformer approach\n\\cite{shavit2021learning} by introducing a mixed classification-regression\narchitecture that improves the localization accuracy. Our method is evaluated\non commonly benchmark indoor and outdoor datasets and has been shown to exceed\nboth multi-scene and state-of-the-art single-scene absolute pose regressors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:43:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shavit","Yoli",""],["Ferens","Ron",""],["Keller","Yosi",""]]}
{"id":"2308.11784","submitter":"Efstratios Tsoukanis","authors":"Radu Balan, Efstratios Tsoukanis","title":"G-Invariant Representations using Coorbits: Bi-Lipschitz Properties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider a real vector space $\\mathcal{V}$ and a finite group $G$ acting\nunitary on $\\mathcal{V}$. We study the general problem of constructing a stable\nembedding, whose domain is the quotient of the vector space modulo the group\naction, and whose target space is an Euclidean space. First, we construct an\nembedding $\\Psi$, which is well defined and injective in the quotient vector\nspace. Then, we show that for the map $\\Psi$ injectivity implies stability. The\nembedding scheme we introduce is based on taking a fixed subset out of sorted\norbit $\\downarrow\\langle{U_gw_i},{x}\\rangle_{g \\in G}$, where $w_{i}$ are\nappropriate vectors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:47:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Balan","Radu",""],["Tsoukanis","Efstratios",""]]}
{"id":"2308.11785","submitter":"Raffi Khatchadourian","authors":"Raffi Khatchadourian, Tatiana Castro V\\'elez, Mehdi Bagherzadeh, Nan\n  Jia, Anita Raja","title":"Towards Safe Automated Refactoring of Imperative Deep Learning Programs\n  to Graph Execution","comments":"International Conference on Automated Software Engineering, ASE '23,\n  Kirchberg, Luxembourg, September 2023. IEEE/ACM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.PL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Efficiency is essential to support responsiveness w.r.t. ever-growing\ndatasets, especially for Deep Learning (DL) systems. DL frameworks have\ntraditionally embraced deferred execution-style DL code -- supporting symbolic,\ngraph-based Deep Neural Network (DNN) computation. While scalable, such\ndevelopment tends to produce code that is error-prone, non-intuitive, and\ndifficult to debug. Consequently, more natural, less error-prone imperative DL\nframeworks encouraging eager execution have emerged at the expense of run-time\nperformance. Though hybrid approaches aim for the \"best of both worlds,\" using\nthem effectively requires subtle considerations to make code amenable to safe,\naccurate, and efficient graph execution -- avoiding performance bottlenecks and\nsemantically inequivalent results. We present our ongoing work on an automated\nrefactoring approach that assists developers in specifying whether and how\ntheir otherwise eagerly-executed imperative DL code could be reliably and\nefficiently executed as graphs at run-time in a semantics-preserving fashion.\nThe approach, based on a novel tensor analysis specifically for imperative DL\ncode, consists of refactoring preconditions for automatically determining when\nit is safe and potentially advantageous to migrate imperative DL code to graph\nexecution and modifying decorator parameters or eagerly executing code already\nrunning as graphs. The approach is being implemented as a PyDev Eclipse IDE\nplug-in and uses the WALA Ariadne analysis framework. We discuss our ongoing\nwork towards optimizing imperative DL code to its full potential.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:50:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Khatchadourian","Raffi",""],["V\u00e9lez","Tatiana Castro",""],["Bagherzadeh","Mehdi",""],["Jia","Nan",""],["Raja","Anita",""]]}
{"id":"2308.11786","submitter":"Samuel Westby","authors":"Samuel Westby, Richard J. Radke, Christoph Riedl, Brooke Foucault\n  Welles","title":"Building Better Human-Agent Teams: Tradeoffs in Helpfulness and\n  Humanness in Voice","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We manipulate the helpfulness and voice type of a voice-only agent teammate\nto examine subjective and objective outcomes in twenty teams with one agent and\nat least three humans during a problem solving task. Our results show that\nagent helpfulness, but not the humanness of the agent's voice, significantly\nalters perceptions of agent intelligence and trust in agent teammates, as well\nas affects team performance. Additionally, we find that the humanness of an\nagent's voice negatively interacts with agent helpfulness to flip its effect on\nperceived anthropomorphism and perceived animacy. This means human teammates\ninterpret the agent's contributions differently depending on its vocal type.\nThese findings suggest that function matters more than form when designing\nagents for effective human-agent teams and help to explain contradictory\nfindings in the literature. Practitioners should be aware of the interactive\neffects of voice and helpfulness on subjective outcomes such as perceived\nanthropomorphism and animacy.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:51:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Westby","Samuel",""],["Radke","Richard J.",""],["Riedl","Christoph",""],["Welles","Brooke Foucault",""]]}
{"id":"2308.11787","submitter":"Abdoulatif Ciss\\'e","authors":"Abdoulatif Cisse, Xenophon Evangelopoulos, Sam Carruthers, Vladimir V.\n  Gusev, Andrew I. Cooper","title":"HypBO: Expert-Guided Chemist-in-the-Loop Bayesian Search for New\n  Materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robotics and automation offer massive accelerations for solving intractable,\nmultivariate scientific problems such as materials discovery, but the available\nsearch spaces can be dauntingly large. Bayesian optimization (BO) has emerged\nas a popular sample-efficient optimization engine, thriving in tasks where no\nanalytic form of the target function/property is known. Here we exploit expert\nhuman knowledge in the form of hypotheses to direct Bayesian searches more\nquickly to promising regions of chemical space. Previous methods have used\nunderlying distributions derived from existing experimental measurements, which\nis unfeasible for new, unexplored scientific tasks. Also, such distributions\ncannot capture intricate hypotheses. Our proposed method, which we call HypBO,\nuses expert human hypotheses to generate an improved seed of samples.\nUnpromising seeds are automatically discounted, while promising seeds are used\nto augment the surrogate model data, thus achieving better-informed sampling.\nThis process continues in a global versus local search fashion, organized in a\nbilevel optimization framework. We validate the performance of our method on a\nrange of synthetic functions and demonstrate its practical utility on a real\nchemical design task where the use of expert hypotheses accelerates the search\nperformance significantly.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:59:21 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 13:24:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cisse","Abdoulatif",""],["Evangelopoulos","Xenophon",""],["Carruthers","Sam",""],["Gusev","Vladimir V.",""],["Cooper","Andrew I.",""]]}
{"id":"2308.11788","submitter":"Carlos Soto","authors":"Carlos Soto, Shinjae Yoo","title":"An extensible point-based method for data chart value detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an extensible method for identifying semantic points to reverse\nengineer (i.e. extract the values of) data charts, particularly those in\nscientific articles. Our method uses a point proposal network (akin to region\nproposal networks for object detection) to directly predict the position of\npoints of interest in a chart, and it is readily extensible to multiple chart\ntypes and chart elements. We focus on complex bar charts in the scientific\nliterature, on which our model is able to detect salient points with an\naccuracy of 0.8705 F1 (@1.5-cell max deviation); it achieves 0.9810 F1 on\nsynthetically-generated charts similar to those used in prior works. We also\nexplore training exclusively on synthetic data with novel augmentations,\nreaching surprisingly competent performance in this way (0.6621 F1) on real\ncharts with widely varying appearance, and we further demonstrate our unchanged\nmethod applied directly to synthetic pie charts (0.8343 F1). Datasets, trained\nmodels, and evaluation code are available at\nhttps://github.com/BNLNLP/PPN_model.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:03:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Soto","Carlos",""],["Yoo","Shinjae",""]]}
{"id":"2308.11789","submitter":"Eleftherios Kirkinis","authors":"E. Kirkinis and M. Olvera de la Cruz","title":"Taylor halos and Taylor spears in odd viscous liquids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A body placed in a rigidly-rotating fluid becomes circumscribed by a\nfictitious cylinder with generators parallel to the axis of rotation, a Taylor\ncolumn. Slowly-moving liquid impinging on the body will swerve around the\ncylinder. Thus, Taylor columns may form when a breeze impinges on a mountain or\nwhen slowly-moving oceanic water impinges on a seamount, both due to the\nEarth's rotation. Here we show that classical non-rotating liquids endowed with\nan odd or Hall coefficient of viscosity, exhibiting nondissipative behavior,\nalso give rise to Taylor column structures resembling halos or spears. Steady\nthree-dimensional flow of such a liquid becomes effectively two dimensional,\nswirling around the Taylor column imitating its rigidly-rotating counterparts.\nFormation of Taylor halos and spears is attributed to the propagation of data\nalong characteristics that may be parallel or oblique to a center axis,\nrespectively.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:07:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kirkinis","E.",""],["de la Cruz","M. Olvera",""]]}
{"id":"2308.11790","submitter":"Zaheer Ahmad","authors":"Zaheer Ahmad, Alexander Kozhanov","title":"Impact of plasma potential and plasma sheath composition on the InN\n  PAMOCVD growth kinetics and structural properties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present the effect of various growth parameters of PA-MOCVD\non the plasma potential. The impact of varying plasma potential on the growth\nand structural properties of the InN films, and how the growth process and film\nproperties will be affected if an external DC bias perturbs the plasma\npotential.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:11:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ahmad","Zaheer",""],["Kozhanov","Alexander",""]]}
{"id":"2308.11791","submitter":"Tryphon Georgiou","authors":"Anqi Dong, Tryphon T. Georgiou, and Allen Tannenbaum","title":"Data Assimilation for Sign-indefinite Priors: A generalization of\n  Sinkhorn's algorithm","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.SY eess.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this work is to develop a framework to calibrate signed\ndatasets so as to be consistent with specified marginals by suitably extending\nthe Schr\\\"odinger-Fortet-Sinkhorn paradigm. Specifically, we seek to revise\nsign-indefinite multi-dimensional arrays in a way that the updated values agree\nwith specified marginals. Our approach follows the rationale in Schr\\\"odinger's\nproblem, aimed at updating a \"prior\" probability measure to agree with marginal\ndistributions. The celebrated Sinkhorn's algorithm (established earlier by R.\\\nFortet) that solves Schr\\\"odinger's problem found early applications in\ncalibrating contingency tables in statistics and, more recently, multi-marginal\nproblems in machine learning and optimal transport. Herein, we postulate a\nsign-indefinite prior in the form of a multi-dimensional array, and propose an\noptimization problem to suitably update this prior to ensure consistency with\ngiven marginals. The resulting algorithm generalizes the Sinkhorn algorithm in\nthat it amounts to iterative scaling of the entries of the array along\ndifferent coordinate directions. The scaling is multiplicative but also, in\ncontrast to Sinkhorn, inverse-multiplicative depending on the sign of the\nentries. Our algorithm reduces to the classical Sinkhorn algorithm when the\nentries of the prior are positive.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:13:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dong","Anqi",""],["Georgiou","Tryphon T.",""],["Tannenbaum","Allen",""]]}
{"id":"2308.11792","submitter":"Dominik Scheinert","authors":"Dominik Scheinert, Philipp Wiesner, Thorsten Wittkopp, Lauritz\n  Thamsen, Jonathan Will, and Odej Kao","title":"Karasu: A Collaborative Approach to Efficient Cluster Configuration for\n  Big Data Analytics","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Selecting the right resources for big data analytics jobs is hard because of\nthe wide variety of configuration options like machine type and cluster size.\nAs poor choices can have a significant impact on resource efficiency, cost, and\nenergy usage, automated approaches are gaining popularity. Most existing\nmethods rely on profiling recurring workloads to find near-optimal solutions\nover time. Due to the cold-start problem, this often leads to lengthy and\ncostly profiling phases. However, big data analytics jobs across users can\nshare many common properties: they often operate on similar infrastructure,\nusing similar algorithms implemented in similar frameworks. The potential in\nsharing aggregated profiling runs to collaboratively address the cold start\nproblem is largely unexplored.\n  We present Karasu, an approach to more efficient resource configuration\nprofiling that promotes data sharing among users working with similar\ninfrastructures, frameworks, algorithms, or datasets. Karasu trains lightweight\nperformance models using aggregated runtime information of collaborators and\ncombines them into an ensemble method to exploit inherent knowledge of the\nconfiguration search space. Moreover, Karasu allows the optimization of\nmultiple objectives simultaneously. Our evaluation is based on performance data\nfrom diverse workload executions in a public cloud environment. We show that\nKarasu is able to significantly boost existing methods in terms of performance,\nsearch time, and cost, even when few comparable profiling runs are available\nthat share only partial common characteristics with the target job.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:14:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Scheinert","Dominik",""],["Wiesner","Philipp",""],["Wittkopp","Thorsten",""],["Thamsen","Lauritz",""],["Will","Jonathan",""],["Kao","Odej",""]]}
{"id":"2308.11793","submitter":"Wenyan Cong","authors":"Wenyan Cong, Hanxue Liang, Peihao Wang, Zhiwen Fan, Tianlong Chen,\n  Mukund Varma, Yi Wang, Zhangyang Wang","title":"Enhancing NeRF akin to Enhancing LLMs: Generalizable NeRF Transformer\n  with Mixture-of-View-Experts","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-scene generalizable NeRF models, which can directly synthesize novel\nviews of unseen scenes, have become a new spotlight of the NeRF field. Several\nexisting attempts rely on increasingly end-to-end \"neuralized\" architectures,\ni.e., replacing scene representation and/or rendering modules with performant\nneural networks such as transformers, and turning novel view synthesis into a\nfeed-forward inference pipeline. While those feedforward \"neuralized\"\narchitectures still do not fit diverse scenes well out of the box, we propose\nto bridge them with the powerful Mixture-of-Experts (MoE) idea from large\nlanguage models (LLMs), which has demonstrated superior generalization ability\nby balancing between larger overall model capacity and flexible per-instance\nspecialization. Starting from a recent generalizable NeRF architecture called\nGNT, we first demonstrate that MoE can be neatly plugged in to enhance the\nmodel. We further customize a shared permanent expert and a geometry-aware\nconsistency loss to enforce cross-scene consistency and spatial smoothness\nrespectively, which are essential for generalizable view synthesis. Our\nproposed model, dubbed GNT with Mixture-of-View-Experts (GNT-MOVE), has\nexperimentally shown state-of-the-art results when transferring to unseen\nscenes, indicating remarkably better cross-scene generalization in both\nzero-shot and few-shot settings. Our codes are available at\nhttps://github.com/VITA-Group/GNT-MOVE.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:18:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cong","Wenyan",""],["Liang","Hanxue",""],["Wang","Peihao",""],["Fan","Zhiwen",""],["Chen","Tianlong",""],["Varma","Mukund",""],["Wang","Yi",""],["Wang","Zhangyang",""]]}
{"id":"2308.11794","submitter":"Dante Lauretta","authors":"Dante S. Lauretta, Harold C. Connolly Jr, Jeffrey N. Grossman, Anjani\n  T. Polit, and the OSIRIS-REx Sample Analysis Team","title":"OSIRIS-REx Sample Analysis Plan -- Revision 3.0","comments":"274 pages","journal-ref":null,"doi":null,"report-no":"UA-PLN 4.5.4-001","categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Origins, Spectral Interpretation, Resource Identification, and Security\nRegolith Explorer (OSIRIS-REx) spacecraft arrived at its target, near-Earth\nasteroid 101955 Bennu, in December 2018. After one year of operating in\nproximity, the team selected a primary site for sample collection. In October\n2020, the spacecraft descended to the surface of Bennu and collected a sample.\nThe spacecraft departed Bennu in May 2021 and will return the sample to Earth\nin September 2023. The analysis of the returned sample will produce key data to\ndetermine the history of this B-type asteroid and that of its components and\nprecursor objects. The main goal of the OSIRIS-REx Sample Analysis Plan is to\nprovide a framework for the Sample Analysis Team to meet the Level 1 mission\nrequirement to analyze the returned sample to determine presolar history,\nformation age, nebular and parent-body alteration history, relation to known\nmeteorites, organic history, space weathering, resurfacing history, and energy\nbalance in the regolith of Bennu. To achieve this goal, this plan establishes a\nhypothesis-driven framework for coordinated sample analyses, defines the\nanalytical instrumentation and techniques to be applied to the returned sample,\nprovides guidance on the analysis strategy for baseline, overguide, and\nthreshold amounts of returned sample, including a rare or unique lithology,\ndescribes the data storage, management, retrieval, and archiving system,\nestablishes a protocol for the implementation of a micro-geographical\ninformation system to facilitate co-registration and coordinated analysis of\nsample science data, outlines the plans for Sample Analysis Readiness Testing,\nand provides guidance for the transfer of samples from curation to the Sample\nAnalysis Team.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:23:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lauretta","Dante S.",""],["Connolly","Harold C.","Jr"],["Grossman","Jeffrey N.",""],["Polit","Anjani T.",""],["Team","the OSIRIS-REx Sample Analysis",""]]}
{"id":"2308.11795","submitter":"Alicia Herrero","authors":"Roberto Dale, Alicia Herrero, Juan Antonio Morales-Lladosa","title":"Vector Field Dynamics: Field Equations and Energy Tensor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Relativistic field theory for a vector field on a curved space-time is\nconsidered assuming that the Lagrangian field density is quadratic and contains\nfield derivatives of first order at most. By applying standard variational\ncalculus, the general Euler-Lagrange equations for the field are derived and\nthe existence of a conserved current is achieved. The field equations are also\nanalyzed from an eikonal-like point of view. The Hilbert energy-momentum tensor\nof the field is also derived and the influence of each one of the irreducible\npieces appearing in the Lagrangian is studied. Particular values of the free\nparameters allow to retrieve known results.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:28:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dale","Roberto",""],["Herrero","Alicia",""],["Morales-Lladosa","Juan Antonio",""]]}
{"id":"2308.11796","submitter":"Mohammadreza Salehi Dehnavi","authors":"Mohammadreza Salehi, Efstratios Gavves, Cees G. M. Snoek, Yuki M.\n  Asano","title":"Time Does Tell: Self-Supervised Time-Tuning of Dense Image\n  Representations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spatially dense self-supervised learning is a rapidly growing problem domain\nwith promising applications for unsupervised segmentation and pretraining for\ndense downstream tasks. Despite the abundance of temporal data in the form of\nvideos, this information-rich source has been largely overlooked. Our paper\naims to address this gap by proposing a novel approach that incorporates\ntemporal consistency in dense self-supervised learning. While methods designed\nsolely for images face difficulties in achieving even the same performance on\nvideos, our method improves not only the representation quality for videos-but\nalso images. Our approach, which we call time-tuning, starts from\nimage-pretrained models and fine-tunes them with a novel self-supervised\ntemporal-alignment clustering loss on unlabeled videos. This effectively\nfacilitates the transfer of high-level information from videos to image\nrepresentations. Time-tuning improves the state-of-the-art by 8-10% for\nunsupervised semantic segmentation on videos and matches it for images. We\nbelieve this method paves the way for further self-supervised scaling by\nleveraging the abundant availability of videos. The implementation can be found\nhere : https://github.com/SMSD75/Timetuning\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:28:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Salehi","Mohammadreza",""],["Gavves","Efstratios",""],["Snoek","Cees G. M.",""],["Asano","Yuki M.",""]]}
{"id":"2308.11797","submitter":"Jian Zhu","authors":"Jian Zhu, Mingkai Sheng, Mingda Ke, Zhangmin Huang, Jingfei Chang","title":"CLIP Multi-modal Hashing: A new baseline CLIPMH","comments":"submit to ICASSP2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The multi-modal hashing method is widely used in multimedia retrieval. It can\nfuse multi-source data to generate binary hash code. However, the current\nmulti-modal methods have the problem of low retrieval accuracy. The reason is\nthat the individual backbone networks have limited feature expression\ncapabilities and are not jointly pre-trained on large-scale unsupervised\nmulti-modal data. To solve this problem, we propose a new baseline CLIP\nMulti-modal Hashing (CLIPMH) method. It uses CLIP model to extract text and\nimage features, and then fuse to generate hash code. CLIP improves the\nexpressiveness of each modal feature. In this way, it can greatly improve the\nretrieval performance of multi-modal hashing methods. In comparison to\nstate-of-the-art unsupervised and supervised multi-modal hashing methods,\nexperiments reveal that the proposed CLIPMH can significantly enhance\nperformance (Maximum increase of 8.38%). CLIP also has great advantages over\nthe text and visual backbone networks commonly used before.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:29:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhu","Jian",""],["Sheng","Mingkai",""],["Ke","Mingda",""],["Huang","Zhangmin",""],["Chang","Jingfei",""]]}
{"id":"2308.11798","submitter":"Noel Richardson","authors":"Megan J. Peatt, Noel D. Richardson, Peredur M. Williams, Nicole\n  Karnath, Victor I. Shenavrin, Ryan M. Lau, Anthony F. J. Moffat, and Gerd\n  Weigelt","title":"FORCASTing the spectroscopic dust properties of the WC+O binary WR137\n  with SOFIA","comments":"13 pages, accepted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  WR 137 (HD 192641) is a binary system consisting of a carbon-rich Wolf-Rayet\nstar and an Oe companion star in a 13-year orbit. Near periastron, the winds of\nthe two stars collide and form carbonaceous dust. We obtained three\nmid-infrared grism spectra of the system with SOFIA and FORCAST during the last\nyear of SOFIA's operations in July 2021, February 2021, and May 2022 (Cycle 9).\nWithin these spectra, we have identified several wind lines from He I, He II, C\nIII, and C IV that are emitted from the Wolf-Rayet wind as well as a weak\nemission feature around 6.3-6.4 $\\mu$m that may have shifted its peak flux from\n6.29 to 6.41$\\mu$m through this time period. The weak feature grew as the\ncontinuum dust emission grew while the WR emission appeared to decline due to\nlower contrast with the continuum. Furthermore, we observe that the peak of the\nfeature shifts to redder wavelengths during the observations. We compare this\nfeature to the UIR feature and other emission lines identified in dusty WC\nbinaries. For WR 137, we speculate that mixing of the winds in the system with\nthe Oe star's disk is important for starting the dust formation and that it is\nless important as dust formation continues. Previous infrared photometry shows\n\"mini-eruptions\" of dust production which could then be explained with\nvariations of the Oe star disk.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:35:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Peatt","Megan J.",""],["Richardson","Noel D.",""],["Williams","Peredur M.",""],["Karnath","Nicole",""],["Shenavrin","Victor I.",""],["Lau","Ryan M.",""],["Moffat","Anthony F. J.",""],["Weigelt","Gerd",""]]}
{"id":"2308.11799","submitter":"Yu-Ping Wang","authors":"Hare Krishna, Yu-Ping Wang","title":"Celestial holography from Chiral strings","comments":"28 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we studied the relationship between celestial holography and\nchiral strings. Chiral strings differ from the usual string theory by a change\nof boundary conditions on the string propagators. It is shown that chiral\nstrings would reproduce graviton amplitudes and could serve as an alternative\ndescription of Einstein's gravity. Celestial holography is a proposed duality\nbetween gravity in asymptotically flat space-time and a CFT living on its\nconformal boundary. Since both are CFT descriptions of gravity, we investigate\nthe potential connection between these two formalisms. In this paper, we find\nthat both the energetic as well as conformal soft theorems could be derived\nfrom the OPEs of vertex operators of chiral strings. All operators in the CCFT\ncan be described by Mellin transforming the vertex operators in the chiral\nstring theories, and the OPE coefficients of CCFT can also be obtained from the\nworld-sheet description.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:42:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Krishna","Hare",""],["Wang","Yu-Ping",""]]}
{"id":"2308.11800","submitter":"Nicolas Michael M\\\"uller","authors":"Nicolas M. M\\\"uller, Philip Sperl, Konstantin B\\\"ottinger","title":"Complex-valued neural networks for voice anti-spoofing","comments":"Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current anti-spoofing and audio deepfake detection systems use either\nmagnitude spectrogram-based features (such as CQT or Melspectrograms) or raw\naudio processed through convolution or sinc-layers. Both methods have\ndrawbacks: magnitude spectrograms discard phase information, which affects\naudio naturalness, and raw-feature-based models cannot use traditional\nexplainable AI methods. This paper proposes a new approach that combines the\nbenefits of both methods by using complex-valued neural networks to process the\ncomplex-valued, CQT frequency-domain representation of the input audio. This\nmethod retains phase information and allows for explainable AI methods. Results\nshow that this approach outperforms previous methods on the \"In-the-Wild\"\nanti-spoofing dataset and enables interpretation of the results through\nexplainable AI. Ablation studies confirm that the model has learned to use\nphase information to detect voice spoofing.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:49:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["M\u00fcller","Nicolas M.",""],["Sperl","Philip",""],["B\u00f6ttinger","Konstantin",""]]}
{"id":"2308.11801","submitter":"Christopher Angelini","authors":"Christopher Angelini, Nidhal Bouaynaya, and Ghulam Rasool","title":"Variational Density Propagation Continual Learning","comments":"6 pages, 13th Int'l Symposium on Image and Signal Processing and\n  Analysis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Neural Networks (DNNs) deployed to the real world are regularly subject\nto out-of-distribution (OoD) data, various types of noise, and shifting\nconceptual objectives. This paper proposes a framework for adapting to data\ndistribution drift modeled by benchmark Continual Learning datasets. We develop\nand evaluate a method of Continual Learning that leverages uncertainty\nquantification from Bayesian Inference to mitigate catastrophic forgetting. We\nexpand on previous approaches by removing the need for Monte Carlo sampling of\nthe model weights to sample the predictive distribution. We optimize a\nclosed-form Evidence Lower Bound (ELBO) objective approximating the predictive\ndistribution by propagating the first two moments of a distribution, i.e. mean\nand covariance, through all network layers. Catastrophic forgetting is\nmitigated by using the closed-form ELBO to approximate the Minimum Description\nLength (MDL) Principle, inherently penalizing changes in the model likelihood\nby minimizing the KL Divergence between the variational posterior for the\ncurrent task and the previous task's variational posterior acting as the prior.\nLeveraging the approximation of the MDL principle, we aim to initially learn a\nsparse variational posterior and then minimize additional model complexity\nlearned for subsequent tasks. Our approach is evaluated for the task\nincremental learning scenario using density propagated versions of\nfully-connected and convolutional neural networks across multiple sequential\nbenchmark datasets with varying task sequence lengths. Ultimately, this\nprocedure produces a minimally complex network over a series of tasks\nmitigating catastrophic forgetting.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:51:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Angelini","Christopher",""],["Bouaynaya","Nidhal",""],["Rasool","Ghulam",""]]}
{"id":"2308.11802","submitter":"Jonathan Engel","authors":"Qunqun Liu, Jonathan Engel, Nobuo Hinohara, and Markus Kortelainen","title":"Effects of Quasiparticle-Vibration Coupling on Gamow-Teller Strength and\n  $\\beta$ Decay with the Skyrme Proton-Neutron Finite-Amplitude Method","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We adapt the proton-neutron finite-amplitude method, which in its original\nform is an efficient implementation of the Skyrme quasiparticle random phase\napproximation, to include the coupling of quasiparticles to like-particle\nphonons. The approach allows us to add beyond-QRPA correlations to computations\nof Gamow-Teller strength and $\\beta$-decay rates in deformed nuclei for the\nfirst time. We test the approach in several deformed isotopes for which\nmeasured strength distributions are available. The additional correlations\ndramatically improve agreement with the data, and will lead to improved global\n$\\beta$-decay rates.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:52:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Qunqun",""],["Engel","Jonathan",""],["Hinohara","Nobuo",""],["Kortelainen","Markus",""]]}
{"id":"2308.11803","submitter":"Chia-Jung Hsu","authors":"Chia-Jung Hsu, Jonathan C. Tan, Jonathan Holdship, Duo, Xu, Serena\n  Viti, Benjamin Wu, and Brandt Gaches","title":"GMC Collisions As Triggers of Star Formation. IX. Chemical Evolution","comments":"32 pages, 30 figures, 2 tables, submitted to MNRAS, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Collisions between giant molecular clouds (GMCs) have been proposed as a\nmechanism to trigger massive star and star cluster formation. To investigate\nthe astrochemical signatures of such collisions, we carry out 3D\nmagnetohydrodynamics simulations of colliding and non-colliding clouds exposed\nto a variety of cosmic ray ionization rates (CRIRs), $\\zeta$, following\nchemical evolution including gas and ice-phase components. At the GMC scale,\ncarbon starts mostly in $\\rm{C^+}$, but then transitions into C, CO, followed\nby ice-phase CO and $\\rm{CH_3OH}$ as dense, cooler filaments, clumps and cores\nform from the clouds. The oxygen budget is dominated by O, CO and water ice. In\ndense regions, we explore the gas phase CO depletion factor, $f_D$, that\nmeasures the extent of its freeze-out onto dust grains, including dependence on\nCRIR and observables of mass surface density and temperature. We also identify\ndense clumps and analyze their physical and chemical properties, including\nafter synthetic line emission modeling, investigating metrics used in studies\nof infrared dark clouds (IRDCs), especially abundances of CO, $\\rm HCO^+$ and\n$\\rm N_2H^+$. For the colliding case, we find clumps have typical densities of\n$n_{\\rm H}\\sim10^5\\:{\\rm{cm}}^{-3}$ and temperatures of $\\sim20\\:$K, while\nthose in non-colliding GMCs are cooler. Depending on $\\zeta$ and GMC dynamical\nhistory, we find CO depletion factors of up to $f_D\\sim10$, and abundances of\nHCO$^+\\sim 10^{-9}$ to $10^{-8}$ and $\\rm{N_2H^+}\\sim10^{-11}$ to $10^{-10}$.\nComparison with observed IRDC clumps indicates a preference for low CRIRs\n($\\sim10^{-18}\\:{\\rm{s}}^{-1}$) and a more quiescent (non-colliding), cooler\nand evolved chemodynamical history. We discuss the general implications of our\nresults and their caveats for interpretation of molecular cloud observations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:53:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hsu","Chia-Jung",""],["Tan","Jonathan C.",""],["Holdship","Jonathan",""],["Duo","",""],["Xu","",""],["Viti","Serena",""],["Wu","Benjamin",""],["Gaches","Brandt",""]]}
{"id":"2308.11804","submitter":"Eugene Bagdasaryan","authors":"Eugene Bagdasaryan, Vitaly Shmatikov","title":"Ceci n'est pas une pomme: Adversarial Illusions in Multi-Modal\n  Embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal encoders map images, sounds, texts, videos, etc. into a single\nembedding space, aligning representations across modalities (e.g., associate an\nimage of a dog with a barking sound). We show that multi-modal embeddings can\nbe vulnerable to an attack we call \"adversarial illusions.\" Given an input in\nany modality, an adversary can perturb it so as to make its embedding close to\nthat of an arbitrary, adversary-chosen input in another modality. Illusions\nthus enable the adversary to align any image with any text, any text with any\nsound, etc.\n  Adversarial illusions exploit proximity in the embedding space and are thus\nagnostic to downstream tasks. Using ImageBind embeddings, we demonstrate how\nadversarially aligned inputs, generated without knowledge of specific\ndownstream tasks, mislead image generation, text generation, and zero-shot\nclassification.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:57:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bagdasaryan","Eugene",""],["Shmatikov","Vitaly",""]]}
{"id":"2308.11805","submitter":"Matthew Stuart","authors":"Matthew Stuart and Cindy Yu and David A. Hennessy","title":"The Impact of Stocks on Correlations of Crop Yields and Prices and on\n  Revenue Insurance Premiums using Semiparametric Quantile Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Crop yields and harvest prices are often considered to be negatively\ncorrelated, thus acting as a natural risk management hedge through stabilizing\nrevenues. Storage theory gives reason to believe that the correlation is an\nincreasing function of stocks carried over from previous years.\nStock-conditioned second moments have implications for price movements during\nshortages and for hedging needs, while spatially varying yield-price\ncorrelation structures have implications for who benefits from commodity\nsupport policies. In this paper, we propose to use semi-parametric quantile\nregression (SQR) with penalized B-splines to estimate a stock-conditioned joint\ndistribution of yield and price. The proposed method, validated through a\ncomprehensive simulation study, enables sampling from the true joint\ndistribution using SQR. Then it is applied to approximate stock-conditioned\ncorrelation and revenue insurance premium for both corn and soybeans in the\nUnited States. For both crops, Cornbelt core regions have more negative\ncorrelations than do peripheral regions. We find strong evidence that\ncorrelation becomes less negative as stocks increase. We also show that\nconditioning on stocks is important when calculating actuarially fair revenue\ninsurance premiums. In particular, revenue insurance premiums in the Cornbelt\ncore will be biased upward if the model for calculating premiums does not allow\ncorrelation to vary with stocks available. The stock-dependent correlation can\nbe viewed as a form of tail dependence that, if unacknowledged, leads to\nmispricing of revenue insurance products.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 21:58:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Stuart","Matthew",""],["Yu","Cindy",""],["Hennessy","David A.",""]]}
{"id":"2308.11806","submitter":"Marios-Nektarios Stamatopoulos","authors":"Marios-Nektarios Stamatopoulos, Avijit Banerjee and George\n  Nikolakopoulos","title":"Flexible Multi-DoF Aerial 3D Printing Supported with Automated Optimal\n  Chunking","comments":"This paper has been accepted for publication at 2023 IEEE/RSJ\n  International Conference on Intelligent Robots and Systems (IROS 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The future of 3D printing utilizing unmanned aerial vehicles (UAVs) presents\na promising capability to revolutionize manufacturing and to enable the\ncreation of large-scale structures in remote and hard- to-reach areas e.g. in\nother planetary systems. Nevertheless, the limited payload capacity of UAVs and\nthe complexity in the 3D printing of large objects pose significant challenges.\nIn this article we propose a novel chunk-based framework for distributed 3D\nprinting using UAVs that sets the basis for a fully collaborative aerial 3D\nprinting of challenging structures. The presented framework, through a novel\nproposed optimisation process, is able to divide the 3D model to be printed\ninto small, manageable chunks and to assign them to a UAV for partial printing\nof the assigned chunk, in a fully autonomous approach. Thus, we establish the\nalgorithms for chunk division, allocation, and printing, and we also introduce\na novel algorithm that efficiently partitions the mesh into planar chunks,\nwhile accounting for the inter-connectivity constraints of the chunks. The\nefficiency of the proposed framework is demonstrated through multiple physics\nbased simulations in Gazebo, where a CAD construction mesh is printed via\nmultiple UAVs carrying materials whose volume is proportionate to a fraction of\nthe total mesh volume.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:18:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Stamatopoulos","Marios-Nektarios",""],["Banerjee","Avijit",""],["Nikolakopoulos","George",""]]}
{"id":"2308.11807","submitter":"Yun Zhu","authors":"Yun Zhu, Yinxiao Liu, Felix Stahlberg, Shankar Kumar, Yu-hui Chen,\n  Liangchen Luo, Lei Shu, Renjie Liu, Jindong Chen, Lei Meng","title":"Towards an On-device Agent for Text Rewriting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have demonstrated impressive capabilities for\ntext rewriting. Nonetheless, the large sizes of these models make them\nimpractical for on-device inference, which would otherwise allow for enhanced\nprivacy and economical inference. Creating a smaller yet potent language model\nfor text rewriting presents a formidable challenge because it requires\nbalancing the need for a small size with the need to retain the emergent\ncapabilities of the LLM, that requires costly data collection. To address the\nabove challenge, we introduce a new instruction tuning approach for building a\nmobile-centric text rewriting model. Our strategies enable the generation of\nhigh quality training data without any human labeling. In addition, we propose\na heuristic reinforcement learning framework which substantially enhances\nperformance without requiring preference data. To further bridge the\nperformance gap with the larger server-side model, we propose an effective\napproach that combines the mobile rewrite agent with the server model using a\ncascade. To tailor the text rewriting tasks to mobile scenarios, we introduce\nMessageRewriteEval, a benchmark that focuses on text rewriting for messages\nthrough natural language instructions. Through empirical experiments, we\ndemonstrate that our on-device model surpasses the current state-of-the-art\nLLMs in text rewriting while maintaining a significantly reduced model size.\nNotably, we show that our proposed cascading approach improves model\nperformance.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:18:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhu","Yun",""],["Liu","Yinxiao",""],["Stahlberg","Felix",""],["Kumar","Shankar",""],["Chen","Yu-hui",""],["Luo","Liangchen",""],["Shu","Lei",""],["Liu","Renjie",""],["Chen","Jindong",""],["Meng","Lei",""]]}
{"id":"2308.11808","submitter":"Bryan Curtis","authors":"Antwan Clark, Bryan A. Curtis, Edinah K. Gnang, Leslie Hogben","title":"Apportionable matrices and gracefully labelled graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  To apportion a complex matrix means to apply a similarity so that all entries\nof the resulting matrix have the same magnitude. We initiate the study of\napportionment, both by unitary matrix similarity and general matrix similarity.\nThere are connections between apportionment and classical graph decomposition\nproblems, including graceful labelings of graphs, Hadamard matrices, and\nequiangluar lines, and potential applications to instantaneous uniform mixing\nin quantum walks. The connection between apportionment and graceful labelings\nallows the construction of apportionable matrices from trees and a\ngeneralization of the well-known Eigenvalue Interlacing Inequalities. It is\nshown that every rank one matrix can be apportioned by a unitary similarity,\nbut there are $2\\times 2$ matrices that cannot be apportioned. A necessary\ncondition for a matrix to be apportioned by unitary matrix is established. This\ncondition is used to construct a set of matrices with nonzero Lebesgue measure\nthat are not apportionable by a unitary matrix.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:20:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Clark","Antwan",""],["Curtis","Bryan A.",""],["Gnang","Edinah K.",""],["Hogben","Leslie",""]]}
{"id":"2308.11809","submitter":"Shirui Chen","authors":"Shirui Chen, Linxin Preston Jiang, Rajesh P. N. Rao, Eric Shea-Brown","title":"Expressive probabilistic sampling in recurrent neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In sampling-based Bayesian models of brain function, neural activities are\nassumed to be samples from probability distributions that the brain uses for\nprobabilistic computation. However, a comprehensive understanding of how\nmechanistic models of neural dynamics can sample from arbitrary distributions\nis still lacking. We use tools from functional analysis and stochastic\ndifferential equations to explore the minimum architectural requirements for\n$\\textit{recurrent}$ neural circuits to sample from complex distributions. We\nfirst consider the traditional sampling model consisting of a network of\nneurons whose outputs directly represent the samples (sampler-only network). We\nargue that synaptic current and firing-rate dynamics in the traditional model\nhave limited capacity to sample from a complex probability distribution. We\nshow that the firing rate dynamics of a recurrent neural circuit with a\nseparate set of output units can sample from an arbitrary probability\ndistribution. We call such circuits reservoir-sampler networks (RSNs). We\npropose an efficient training procedure based on denoising score matching that\nfinds recurrent and output weights such that the RSN implements Langevin\nsampling. We empirically demonstrate our model's ability to sample from several\ncomplex data distributions using the proposed neural dynamics and discuss its\napplicability to developing the next generation of sampling-based brain models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:20:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Shirui",""],["Jiang","Linxin Preston",""],["Rao","Rajesh P. N.",""],["Shea-Brown","Eric",""]]}
{"id":"2308.11810","submitter":"Chuchuan Hong","authors":"Chuchuan Hong, Ikjun Hong, Yuxi Jiang, Justus C. Ndukaife","title":"Plasmonic dielectric antennas for hybrid optical nanotweezing and\n  optothermoelectric manipulation of single nanosized extracellular vesicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an experimental demonstration of near-field optical trapping and\ndynamic manipulation of a single extracellular vesicle using a plasmonic\ndielectric nanoantenna that supports an optical anapole state. The optical\nanapole is a non-radiating optical state generated by the destructive\ninterference between electric and toroidal dipoles in the far-field. To enhance\nthe trapping capabilities, we employ a plasmonic mirror to enhance the anapole\nstate. By harnessing the enhanced electromagnetic hotspot resulting from the\nmirror-enhanced anapole state, we achieve a high trapping potential of\napproximately 3.5 KbT. The dynamic manipulation of the vesicle is achieved by\ninducing a thermoelectric field in the presence of an ionic surfactant and the\nresulting plasmonic heating. Specifically, we introduce cetyltrimethylammonium\nchloride (CTAC) as the ionic surfactant and utilize the local heating generated\nby the plasmonic reflector to create a thermoelectric field. This enables\nactive transport, stable trapping, and dynamic manipulation of a single\nextracellular vesicle. Moreover, the thermoelectric field contributes to an\nincrease in the overall trapping potential.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:24:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hong","Chuchuan",""],["Hong","Ikjun",""],["Jiang","Yuxi",""],["Ndukaife","Justus C.",""]]}
{"id":"2308.11811","submitter":"Kishan Mishra","authors":"Kishan K. Mishra, Aijaz H. Lone, Srikant Srinivasan, Hossein\n  Fariborzi, Gianluca Setti","title":"Magnetic Skyrmion: From Fundamental Physics to Pioneering Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Skyrmionic devices exhibit energy-efficient and high-integration data storage\nand computing capabilities due to their small size, topological protection, and\nlow drive current requirements. So, to realize these devices, an extensive\nstudy, from fundamental physics to practical applications, becomes essential.\nIn this article, we present an exhaustive review of the advancements in\nunderstanding the fundamental physics behind magnetic skyrmions and the novel\ndata storage and computing technologies based on them. We begin with an\nin-depth discussion of fundamental concepts such as topological protection,\nstability, statics and dynamics essential for understanding skyrmions,\nhenceforth the foundation of skyrmion technologies. For the realization of\nCMOS-compatible skyrmion functional devices, the writing and reading of the\nskyrmions are crucial. We discuss the developments in different writing schemes\nsuch as STT, SOT, and VCMA. The reading of skyrmions is predominantly achieved\nvia two mechanisms: the Magnetoresistive Tunnel Junction (MTJ) TMR effect and\ntopological resistivity (THE). So, a thorough investigation into the Skyrmion\nHall Effect, topological properties, and emergent fields is also provided,\nconcluding the discussion on skyrmion reading developments. Based on the\nwriting and reading schemes, we discuss the applications of the skyrmions in\nconventional logic, unconventional logic, memory applications, and neuromorphic\ncomputing in particular. Subsequently, we present an overview of the potential\nof skyrmion-hosting Majorana Zero Modes (MZMs) in the emerging Topological\nQuantum Computation and helicity-dependent skyrmion qubits.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:25:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mishra","Kishan K.",""],["Lone","Aijaz H.",""],["Srinivasan","Srikant",""],["Fariborzi","Hossein",""],["Setti","Gianluca",""]]}
{"id":"2308.11812","submitter":"Michael Cretignier","authors":"M. Cretignier, X. Dumusque, S. Aigrain, F. Pepe","title":"YARARA V2: Reaching sub m/s precision over a decade using PCA on\n  line-by-line RVs","comments":"22 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Context. The detection of Earth-like planets with the radial-velocity (RV)\nmethod is extremely challenging today due to the presence of non-Doppler\nsignatures such as stellar activity and instrumental signals that mimic and\nhide the signals of exoplanets. In a previous paper, we presented the YARARA\npipeline, which implements corrections for telluric absorption, stellar\nactivity and instrumental systematics at the spectral level, then extracts\nline-by-line (LBL) RVs with significantly better precision than standard\npipelines. Aims. In this paper, we demonstrate that further gains in RVs\nprecision can be achieved by performing Principal Component Analysis (PCA)\ndecomposition on the LBL RVs. Methods. The mean-insensitive nature of PCA means\nthat it is unaffected by true Doppler shifts, and thus can be used to isolate\nand correct nuisance signals other than planets. Results. We analysed the data\nof 20 intensively observed HARPS targets by applying our PCA approach on the\nLBL RVs obtained by YARARA. The first principal components show similarities\nacross most of the stars and correspond to newly identified instrumental\nsystematics, which we can now correct for. For several targets, this results in\nan unprecedented RV root-mean-square of around 90 cm/s over the full lifetime\nof HARPS. We use the corrected RVs to confirm a previously published 120-day\nsignal around 61Vir, and to detect a Super-Earth candidate (K = 60 +/- 6 cm/s,\nm sin i = 6.6 +/- 0.7 Earth mass) around the G6V star HD20794, which spends\npart of its 600-day orbit within the habitable zone of the host star.\nConclusions. This study highlights the potential of LBL PCA to identify and\ncorrect hitherto unknown, long-term instrumental effects and thereby extend the\nsensitivity of existing and future instruments towards the Earth analogue\nregime.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:26:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cretignier","M.",""],["Dumusque","X.",""],["Aigrain","S.",""],["Pepe","F.",""]]}
{"id":"2308.11813","submitter":"Andrea Poiatti","authors":"Helmut Abels, Harald Garcke, Andrea Poiatti","title":"Mathematical Analysis of a Diffuse Interface Model for Multi-Phase Flows\n  of Incompressible Viscous Fluids with Different Densities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We analyze a diffuse interface model for multi-phase flows of $N$\nincompressible, viscous Newtonian fluids with different densities. In the case\nof a bounded and sufficiently smooth domain existence of weak solutions in two\nand three space dimensions and a singular free energy density is shown.\nMoreover, in two space dimensions global well-posedness for sufficiently\nregular initial data is proven. In three space dimension well-posedness locally\nin time is shown as well as regularization for large times in the absence of\nexterior forces. In both cases convergence to stationary solutions as time\ntends to infinity is proved.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:32:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Abels","Helmut",""],["Garcke","Harald",""],["Poiatti","Andrea",""]]}
{"id":"2308.11814","submitter":"Pierre Lermusiaux","authors":"Ellery Rajagopal, Anantha N.S. Babu, Tony Ryu, Patrick J. Haley Jr.,\n  Chris Mirabito, Pierre F.J. Lermusiaux","title":"Evaluation of Deep Neural Operator Models toward Ocean Forecasting","comments":"Rajagopal, E., A.N.S. Babu, T. Ryu, P.J. Haley, Jr., C. Mirabito, and\n  P.F.J. Lermusiaux, 2023. Evaluation of Deep Neural Operator Models toward\n  Ocean Forecasting. In OCEANS' 23 IEEE/MTS Gulf Coast, 25-28 September 2023,\n  in press","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CE physics.ao-ph physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Data-driven, deep-learning modeling frameworks have been recently developed\nfor forecasting time series data. Such machine learning models may be useful in\nmultiple domains including the atmospheric and oceanic ones, and in general,\nthe larger fluids community. The present work investigates the possible\neffectiveness of such deep neural operator models for reproducing and\npredicting classic fluid flows and simulations of realistic ocean dynamics. We\nfirst briefly evaluate the capabilities of such deep neural operator models\nwhen trained on a simulated two-dimensional fluid flow past a cylinder. We then\ninvestigate their application to forecasting ocean surface circulation in the\nMiddle Atlantic Bight and Massachusetts Bay, learning from high-resolution\ndata-assimilative simulations employed for real sea experiments. We confirm\nthat trained deep neural operator models are capable of predicting idealized\nperiodic eddy shedding. For realistic ocean surface flows and our preliminary\nstudy, they can predict several of the features and show some skill, providing\npotential for future research and applications.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:38:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rajagopal","Ellery",""],["Babu","Anantha N. S.",""],["Ryu","Tony",""],["Haley","Patrick J.","Jr."],["Mirabito","Chris",""],["Lermusiaux","Pierre F. J.",""]]}
{"id":"2308.11815","submitter":"Sunil Chebolu","authors":"Sunil K. Chebolu and Keir Lockridge","title":"Fuchs' problem for endomorphisms of abelian groups","comments":"13 pages, Accepted for publication in the Journal of Algebra","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  L\\'{a}szl\\'{o} Fuchs posed the following question: which abelian groups arise\nas the group of units in a ring? In this paper, we investigate a related\nquestion: for such realizable groups $G$, when is there a ring $R$ with unit\ngroup $G$ such that every group endomorphism of $G$ is induced by a ring\nendomorphism of $R$? We answer this question for four common classes of groups:\ntorsion-free abelian groups, groups of odd order, torsion abelian groups, and\nfinitely generated abelian groups.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:39:16 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 19:46:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chebolu","Sunil K.",""],["Lockridge","Keir",""]]}
{"id":"2308.11816","submitter":"Matthew McDermott","authors":"Matthew J. McDermott, Brennan C. McBride, Corlyn Regier, Gia Thinh\n  Tran, Yu Chen, Adam A. Corrao, Max C. Gallant, Gabrielle E. Kamm, Christopher\n  J. Bartel, Karena W. Chapman, Peter G. Khalifah, Gerbrand Ceder, James R.\n  Neilson, Kristin A. Persson","title":"Assessing Thermodynamic Selectivity of Solid-State Reactions for the\n  Predictive Synthesis of Inorganic Materials","comments":"50 pages, 7 figures. The first two authors contributed equally to\n  this work","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synthesis is a major challenge in the discovery of new inorganic materials.\nThere is currently limited theoretical rationale for planning optimal\nsolid-state synthesis procedures that selectively yield desired targets with\nminimal impurities. Using an interface reaction model, we propose two\nselectivity metrics -- primary and secondary competition -- to measure the\nfavorability of target and impurity phase formation in solid-state reactions.\nWe first apply these metrics to assess the selectivity of 3,520 solid-state\nsynthesis recipes extracted from the scientific literature, comparing the\nthermodynamic optimality of various approaches to popular targets (e.g.,\nLiMn$_2$O$_4$, LiFePO$_4$) under our framework. Secondly, we implement these\nmetrics in a data-driven synthesis planning workflow and test its use in\nsuggesting synthetic routes to barium titanate (BaTiO$_3$). From an 18-element\nchemical reaction network created with first-principles materials thermodynamic\ndata from the Materials Project, we identify 82,985 synthesis reactions for\nBaTiO$_3$ and select nine to test experimentally, characterizing their reaction\npathways using ex post facto synchrotron powder X-ray diffraction over a wide\nrange of temperatures. Analysis of experimental results indicates that our\nproposed selectivity metrics correlate with observed target and impurity\nformation. We identify two favorably predicted reactions with unconventional\nBaS/BaCl$_2$ and Na$_2$TiO$_3$ precursors that yield BaTiO$_3$ more rapidly and\nwith fewer impurities than conventional solid-state approaches. Altogether, our\nframework serves as a foundation for the predictive synthesis of inorganic\nmaterials, facilitating the optimization of existing synthesis approaches and\nthe design of syntheses to novel materials, including those that cannot be\neasily made from conventional \"off-the-shelf\" precursors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:40:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["McDermott","Matthew J.",""],["McBride","Brennan C.",""],["Regier","Corlyn",""],["Tran","Gia Thinh",""],["Chen","Yu",""],["Corrao","Adam A.",""],["Gallant","Max C.",""],["Kamm","Gabrielle E.",""],["Bartel","Christopher J.",""],["Chapman","Karena W.",""],["Khalifah","Peter G.",""],["Ceder","Gerbrand",""],["Neilson","James R.",""],["Persson","Kristin A.",""]]}
{"id":"2308.11817","submitter":"Md Abu Sayed","authors":"Md Abu Sayed, Ahmed H. Anwar, Christopher Kiekintveld, and Charles\n  Kamhoua","title":"Honeypot Allocation for Cyber Deception in Dynamic Tactical Networks: A\n  Game Theoretic Approach","comments":"This paper accepted in 14th International Conference on Decision and\n  Game Theory for Security, GameSec 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Honeypots play a crucial role in implementing various cyber deception\ntechniques as they possess the capability to divert attackers away from\nvaluable assets. Careful strategic placement of honeypots in networks should\nconsider not only network aspects but also attackers' preferences. The\nallocation of honeypots in tactical networks under network mobility is of great\ninterest. To achieve this objective, we present a game-theoretic approach that\ngenerates optimal honeypot allocation strategies within an attack/defense\nscenario. Our proposed approach takes into consideration the changes in network\nconnectivity. In particular, we introduce a two-player dynamic game model that\nexplicitly incorporates the future state evolution resulting from changes in\nnetwork connectivity. The defender's objective is twofold: to maximize the\nlikelihood of the attacker hitting a honeypot and to minimize the cost\nassociated with deception and reconfiguration due to changes in network\ntopology. We present an iterative algorithm to find Nash equilibrium strategies\nand analyze the scalability of the algorithm. Finally, we validate our approach\nand present numerical results based on simulations, demonstrating that our game\nmodel successfully enhances network security. Additionally, we have proposed\nadditional enhancements to improve the scalability of the proposed approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:41:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sayed","Md Abu",""],["Anwar","Ahmed H.",""],["Kiekintveld","Christopher",""],["Kamhoua","Charles",""]]}
{"id":"2308.11818","submitter":"Archie J. Huang","authors":"Archie J. Huang, Animesh Biswas, Shaurya Agarwal","title":"Incorporating Nonlocal Traffic Flow Model in Physics-informed Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This research contributes to the advancement of traffic state estimation\nmethods by leveraging the benefits of the nonlocal LWR model within a\nphysics-informed deep learning framework. The classical LWR model, while\nuseful, falls short of accurately representing real-world traffic flows. The\nnonlocal LWR model addresses this limitation by considering the speed as a\nweighted mean of the downstream traffic density. In this paper, we propose a\nnovel PIDL framework that incorporates the nonlocal LWR model. We introduce\nboth fixed-length and variable-length kernels and develop the required\nmathematics. The proposed PIDL framework undergoes a comprehensive evaluation,\nincluding various convolutional kernels and look-ahead windows, using data from\nthe NGSIM and CitySim datasets. The results demonstrate improvements over the\nbaseline PIDL approach using the local LWR model. The findings highlight the\npotential of the proposed approach to enhance the accuracy and reliability of\ntraffic state estimation, enabling more effective traffic management\nstrategies.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:41:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Archie J.",""],["Biswas","Animesh",""],["Agarwal","Shaurya",""]]}
{"id":"2308.11819","submitter":"Zheng Liu","authors":"Zheng Liu, Xiaohan Li and Philip Yu","title":"Mitigating Health Disparity on Biased Electronic Health Records via\n  Deconfounder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The fairness issue of clinical data modeling, especially on Electronic Health\nRecords (EHRs), is of utmost importance due to EHR's complex latent structure\nand potential selection bias. It is frequently necessary to mitigate health\ndisparity while keeping the model's overall accuracy in practice. However,\ntraditional methods often encounter the trade-off between accuracy and\nfairness, as they fail to capture the underlying factors beyond observed data.\nTo tackle this challenge, we propose a novel model called Fair Longitudinal\nMedical Deconfounder (FLMD) that aims to achieve both fairness and accuracy in\nlongitudinal Electronic Health Records (EHR) modeling. Drawing inspiration from\nthe deconfounder theory, FLMD employs a two-stage training process. In the\nfirst stage, FLMD captures unobserved confounders for each encounter, which\neffectively represents underlying medical factors beyond observed EHR, such as\npatient genotypes and lifestyle habits. This unobserved confounder is crucial\nfor addressing the accuracy/fairness dilemma. In the second stage, FLMD\ncombines the learned latent representation with other relevant features to make\npredictions. By incorporating appropriate fairness criteria, such as\ncounterfactual fairness, FLMD ensures that it maintains high prediction\naccuracy while simultaneously minimizing health disparities. We conducted\ncomprehensive experiments on two real-world EHR datasets to demonstrate the\neffectiveness of FLMD. Apart from the comparison of baseline methods and FLMD\nvariants in terms of fairness and accuracy, we assessed the performance of all\nmodels on disturbed/imbalanced and synthetic datasets to showcase the\nsuperiority of FLMD across different settings and provide valuable insights\ninto its capabilities.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:43:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Zheng",""],["Li","Xiaohan",""],["Yu","Philip",""]]}
{"id":"2308.11820","submitter":"Cole Graham","authors":"Alexander Dunlap and Cole Graham","title":"Uniqueness and root-Lipschitz regularity for a degenerate heat equation","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider nonnegative solutions of the quasilinear heat equation\n$\\partial_t u = \\tfrac{1}{2} u \\partial_x^2 u$ in one dimension. Our solutions\nmay vanish and may be unbounded. The equation is then degenerate, and weak\nsolutions are generally nonunique. We introduce a notion of strong solution\nthat ensures uniqueness. For suitable initial data, we prove a lower bound on\nthe time for which a strong solution $u$ exists and $\\sqrt{u}$ remains globally\nLipschitz in space. In a companion paper, we show that this condition is\nimportant in the study of two-dimensional nonlinear stochastic heat equations.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:54:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dunlap","Alexander",""],["Graham","Cole",""]]}
{"id":"2308.11821","submitter":"Jacinto Ulloa","authors":"Jacinto Ulloa, Geert Degrande, Jos\\'e E. Andrade, Stijn Fran\\c{c}ois","title":"Multi-temporal decomposition for elastoplastic ratcheting solids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cond-mat.mtrl-sci cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a multi-temporal formulation for simulating elastoplastic\nsolids under cyclic loading. We leverage the proper generalized decomposition\n(PGD) to decompose the displacements into multiple time scales, separating the\nspatial and intra-cyclic dependence from the inter-cyclic variation. In\ncontrast with the standard incremental approach, which solves the (non-linear\nand computationally intensive) mechanical balance equations at every time step,\nthe proposed PGD approach allows the mechanical balance equations to be solved\nexclusively for the small-time intra-cyclic response, while the large-time\ninter-cyclic response is described by simple scalar algebraic equations.\nNumerical simulations exhibiting complex cyclic responses, including a 2D\nproblem and an application to a monopile foundation, demonstrate that PGD\nsolutions with a limited number of space-time degrees of freedom may be\nobtained numerically, only requiring a few modes to accurately capture the\nreference response.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:01:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ulloa","Jacinto",""],["Degrande","Geert",""],["Andrade","Jos\u00e9 E.",""],["Fran\u00e7ois","Stijn",""]]}
{"id":"2308.11822","submitter":"Yizhen Yuan","authors":"Yizhen Yuan (1), Rui Kong (3), Shenghao Xie (4), Yuanchun Li (1 and\n  2), Yunxin Liu (1 and 2) ((1) Institute for AI Industry Research (AIR),\n  Tsinghua University, Beijing, China, (2) Shanghai AI Laboratory, Shanghai,\n  China, (3) Shanghai Jiao Tong University, Shanghai, China, (4) Wuhan\n  University, Wuhan, China)","title":"PatchBackdoor: Backdoor Attack against Deep Neural Networks without\n  Model Modification","comments":"accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612032","report-no":null,"categories":"cs.LG cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Backdoor attack is a major threat to deep learning systems in safety-critical\nscenarios, which aims to trigger misbehavior of neural network models under\nattacker-controlled conditions. However, most backdoor attacks have to modify\nthe neural network models through training with poisoned data and/or direct\nmodel editing, which leads to a common but false belief that backdoor attack\ncan be easily avoided by properly protecting the model. In this paper, we show\nthat backdoor attacks can be achieved without any model modification. Instead\nof injecting backdoor logic into the training data or the model, we propose to\nplace a carefully-designed patch (namely backdoor patch) in front of the\ncamera, which is fed into the model together with the input images. The patch\ncan be trained to behave normally at most of the time, while producing wrong\nprediction when the input image contains an attacker-controlled trigger object.\nOur main techniques include an effective training method to generate the\nbackdoor patch and a digital-physical transformation modeling method to enhance\nthe feasibility of the patch in real deployments. Extensive experiments show\nthat PatchBackdoor can be applied to common deep learning models (VGG,\nMobileNet, ResNet) with an attack success rate of 93% to 99% on classification\ntasks. Moreover, we implement PatchBackdoor in real-world scenarios and show\nthat the attack is still threatening.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:02:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yuan","Yizhen","","1 and\n  2"],["Kong","Rui","","1 and\n  2"],["Xie","Shenghao","","1 and\n  2"],["Li","Yuanchun","","1 and\n  2"],["Liu","Yunxin","","1 and 2"]]}
{"id":"2308.11823","submitter":"Xiao Liang","authors":"Yu-Tong Zhou, Zheng-Wei Zhou, Xiao Liang","title":"Backflow Corrections of Green's Functions: Benchmarks on the\n  Two-dimensional Fermi-Hubbard-type Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The quantum many-body problem is an important topic in condensed matter\nphysics. To efficiently solve the problem, several methods have been developped\nto improve the representation ability of wave-functions. For the\nFermi-Hubbard-type model, the ground energy contains one-body and two-body\ncorrelations. In contrast to the wave-function, the Green function directly\nrepresents the spatio-temporal correlations between multiple sites. In this\nwork, we propose a backflow correction of the one-body Green function to\nimprove the ability to capture correlations. Our method is benchmarked on the\nspinless $t-V$ model with open boundary conditions and on the Fermi-Hubbard\nmodel with periodic and cylindrical boudary conditions, both on rectangular\nlattices. The energies achieved by our method are competitive with or even\nlower than those achieved by state-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:03:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhou","Yu-Tong",""],["Zhou","Zheng-Wei",""],["Liang","Xiao",""]]}
{"id":"2308.11824","submitter":"Amin Nejatbakhsh","authors":"Amin Nejatbakhsh, Isabel Garon, Alex H Williams","title":"Estimating Noise Correlations in Neural Populations with Wishart\n  Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The signaling capacity of a neural population depends on the scale and\norientation of its covariance across trials. Estimating this \"noise\" covariance\nis challenging and is thought to require a large number of stereotyped trials.\nNew approaches are therefore needed to interrogate the structure of neural\nnoise across rich, naturalistic behaviors and sensory experiences, with few\ntrials per condition. Here, we exploit the fact that conditions are smoothly\nparameterized in many experiments, and leverage Wishart process models to pool\nstatistical power from trials in neighboring conditions. We demonstrate that\nthese models performs favorably on experimental data from mouse visual cortex\nand monkey motor cortex relative to standard covariance estimators. Moreover,\nthey produce smooth estimates of covariance as a function of stimulus\nparameters, enabling estimates of noise correlations in entirely unseen\nconditions as well as continuous estimates of Fisher information -- a commonly\nused measure of signal fidelity. Together, our results suggest that Wishart\nprocesses are broadly applicable tools for quantification and uncertainty\nestimation of noise correlations in trial-limited regimes, paving the way\ntowards understanding the role of noise in complex neural computations and\nbehavior.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:06:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nejatbakhsh","Amin",""],["Garon","Isabel",""],["Williams","Alex H",""]]}
{"id":"2308.11825","submitter":"Hongwu Peng","authors":"Xi Xie, Hongwu Peng, Amit Hasan, Shaoyi Huang, Jiahui Zhao, Haowen\n  Fang, Wei Zhang, Tong Geng, Omer Khan, and Caiwen Ding","title":"Accel-GCN: High-Performance GPU Accelerator Design for Graph Convolution\n  Networks","comments":"ICCAD 2023 accepted publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Convolutional Networks (GCNs) are pivotal in extracting latent\ninformation from graph data across various domains, yet their acceleration on\nmainstream GPUs is challenged by workload imbalance and memory access\nirregularity. To address these challenges, we present Accel-GCN, a GPU\naccelerator architecture for GCNs. The design of Accel-GCN encompasses: (i) a\nlightweight degree sorting stage to group nodes with similar degree; (ii) a\nblock-level partition strategy that dynamically adjusts warp workload sizes,\nenhancing shared memory locality and workload balance, and reducing metadata\noverhead compared to designs like GNNAdvisor; (iii) a combined warp strategy\nthat improves memory coalescing and computational parallelism in the column\ndimension of dense matrices.\n  Utilizing these principles, we formulated a kernel for sparse matrix\nmultiplication (SpMM) in GCNs that employs block-level partitioning and\ncombined warp strategy. This approach augments performance and multi-level\nmemory efficiency and optimizes memory bandwidth by exploiting memory\ncoalescing and alignment. Evaluation of Accel-GCN across 18 benchmark graphs\nreveals that it outperforms cuSPARSE, GNNAdvisor, and graph-BLAST by factors of\n1.17 times, 1.86 times, and 2.94 times respectively. The results underscore\nAccel-GCN as an effective solution for enhancing GCN computational efficiency.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:12:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xie","Xi",""],["Peng","Hongwu",""],["Hasan","Amit",""],["Huang","Shaoyi",""],["Zhao","Jiahui",""],["Fang","Haowen",""],["Zhang","Wei",""],["Geng","Tong",""],["Khan","Omer",""],["Ding","Caiwen",""]]}
{"id":"2308.11826","submitter":"Ilijas Farah","authors":"Ilijas Farah, Jeffrey Marshall-Milne","title":"Chain Conditions and the Axiom of Choice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Within the framework of Zermelo-Fraenkel set theory without the Axiom of\nChoice, we establish equivalents to the assertion \"the union of a countable\ncollection of finite sets is countable\" in the context of metric spaces,\nprobability theory, and Hilbert spaces. The categorical principle underlying\nthese equivalences is identified.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:15:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Farah","Ilijas",""],["Marshall-Milne","Jeffrey",""]]}
{"id":"2308.11827","submitter":"Saba Rahimi","authors":"Saba Rahimi, Tucker Balch, Manuela Veloso","title":"Exploring the Effectiveness of GPT Models in Test-Taking: A Case Study\n  of the Driver's License Knowledge Test","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models such as Open AI's Generative Pre-trained Transformer\n(GPT) models are proficient at answering questions, but their knowledge is\nconfined to the information present in their training data. This limitation\nrenders them ineffective when confronted with questions about recent\ndevelopments or non-public documents. Our research proposes a method that\nenables GPT models to answer questions by employing context from an information\nsource not previously included in their training data. The methodology includes\npreprocessing of contextual information, the embedding of contexts and queries,\nconstructing prompt through the integration of context embeddings, and\ngenerating answers using GPT models. We applied this method in a controlled\ntest scenario using the California Driver's Handbook as the information source.\nThe GPT-3 model achieved a 96% passing score on a set of 50 sample driving\nknowledge test questions. In contrast, without context, the model's passing\nscore fell to 82%. However, the model still fails to answer some questions\ncorrectly even with providing library of context, highlighting room for\nimprovement. The research also examined the impact of prompt length and context\nformat, on the model's performance. Overall, the study provides insights into\nthe limitations and potential improvements for GPT models in question-answering\ntasks.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:18:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rahimi","Saba",""],["Balch","Tucker",""],["Veloso","Manuela",""]]}
{"id":"2308.11828","submitter":"Emma Kroell","authors":"Emma Kroell and Sebastian Jaimungal and Silvana M. Pesenti","title":"Optimal Robust Reinsurance with Multiple Insurers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.RM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a reinsurer who faces multiple sources of model uncertainty. The\nreinsurer offers contracts to $n$ insurers whose claims follow different\ncompound Poisson processes. As the reinsurer is uncertain about the insurers'\nclaim severity distributions and frequencies, they design reinsurance contracts\nthat maximise their expected wealth subject to an entropy penalty. Insurers\nmeanwhile seek to maximise their expected utility without ambiguity. We solve\nthis continuous-time Stackelberg game for general reinsurance contracts and\nfind that the reinsurer prices under a distortion of the barycentre of the\ninsurers' models. We apply our results to proportional reinsurance and\nexcess-of-loss reinsurance contracts, and illustrate the solutions numerically.\nFurthermore, we solve the related problem where the reinsurer maximises, still\nunder ambiguity, their expected utility and compare the solutions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:24:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kroell","Emma",""],["Jaimungal","Sebastian",""],["Pesenti","Silvana M.",""]]}
{"id":"2308.11829","submitter":"Ido Kaminer","authors":"Rotem Elimelech, Ofir David, Carlos De la Cruz Mengual, Rotem Kalisch,\n  Wolfgang Berndt, Michael Shalyt, Mark Silberstein, Yaron Hadad, and Ido\n  Kaminer","title":"Algorithm-assisted discovery of an intrinsic order among mathematical\n  constants","comments":"21 pages, 6 figures, and 1 table; with 9 appendix sections totaling\n  12 pages, 1 figure, and 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DC math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent decades, a growing number of discoveries in fields of mathematics\nhave been assisted by computer algorithms, primarily for exploring large\nparameter spaces that humans would take too long to investigate. As computers\nand algorithms become more powerful, an intriguing possibility arises - the\ninterplay between human intuition and computer algorithms can lead to\ndiscoveries of novel mathematical concepts that would otherwise remain elusive.\nTo realize this perspective, we have developed a massively parallel computer\nalgorithm that discovers an unprecedented number of continued fraction formulas\nfor fundamental mathematical constants. The sheer number of formulas discovered\nby the algorithm unveils a novel mathematical structure that we call the\nconservative matrix field. Such matrix fields (1) unify thousands of existing\nformulas, (2) generate infinitely many new formulas, and most importantly, (3)\nlead to unexpected relations between different mathematical constants,\nincluding multiple integer values of the Riemann zeta function. Conservative\nmatrix fields also enable new mathematical proofs of irrationality. In\nparticular, we can use them to generalize the celebrated proof by Ap\\'ery for\nthe irrationality of $\\zeta(3)$. Utilizing thousands of personal computers\nworldwide, our computer-supported research strategy demonstrates the power of\nexperimental mathematics, highlighting the prospects of large-scale\ncomputational approaches to tackle longstanding open problems and discover\nunexpected connections across diverse fields of science.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:27:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Elimelech","Rotem",""],["David","Ofir",""],["Mengual","Carlos De la Cruz",""],["Kalisch","Rotem",""],["Berndt","Wolfgang",""],["Shalyt","Michael",""],["Silberstein","Mark",""],["Hadad","Yaron",""],["Kaminer","Ido",""]]}
{"id":"2308.11830","submitter":"Mostafa Sharifzadeh","authors":"Mostafa Sharifzadeh, Habib Benali, and Hassan Rivaz","title":"Frequency-Space Prediction Filtering for Phase Aberration Correction in\n  Plane-Wave Ultrasound","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ultrasound imaging often suffers from image degradation stemming from phase\naberration, which represents a significant contributing factor to the overall\nimage degradation in ultrasound imaging. Frequency-space prediction filtering\nor FXPF is a technique that has been applied within focused ultrasound imaging\nto alleviate the phase aberration effect. It presupposes the existence of an\nautoregressive (AR) model across the signals received at the transducer\nelements and removes any components that do not conform to the established\nmodel. In this study, we illustrate the challenge of applying this technique to\nplane-wave imaging, where, at shallower depths, signals from more distant\nelements lose relevance, and a fewer number of elements contribute to image\nreconstruction. While the number of contributing signals varies, adopting a\nfixed-order AR model across all depths, results in suboptimal performance. To\naddress this challenge, we propose an AR model with an adaptive order and\nquantify its effectiveness using contrast and generalized contrast-to-noise\nratio metrics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:29:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sharifzadeh","Mostafa",""],["Benali","Habib",""],["Rivaz","Hassan",""]]}
{"id":"2308.11831","submitter":"Jesse Madnick","authors":"Benjamin Aslan, Spiro Karigiannis, Jesse Madnick","title":"Calibrated Geometry in Hyperkahler Cones, 3-Sasakian Manifolds, and\n  Twistor Spaces","comments":"55 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We systematically study calibrated geometry in hyperkahler cones $C^{4n+4}$,\ntheir 3-Sasakian links $M^{4n+3}$, and the corresponding twistor spaces\n$Z^{4n+2}$, emphasizing the relationships between submanifold geometries in\nvarious spaces. In the process, we prove that every $(4n+2)$-dimensional\ntwistor space $Z$ admits a canonical $\\mathrm{Sp}(n)\\mathrm{U}(1)$-structure,\ni.e., an $S^1$-family of 3-forms with comass one satisfying an algebraic\ncondition.\n  As an application, we obtain new characterizations of complex Lagrangian and\ncomplex isotropic cones in hyperkahler cones, generalizing a result of\nEjiri-Tsukada. We also generalize a theorem of Storm on submanifolds of twistor\nspaces that are Lagrangian with respect to both the Kahler-Einstein and\nnearly-Kahler structures.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:33:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aslan","Benjamin",""],["Karigiannis","Spiro",""],["Madnick","Jesse",""]]}
{"id":"2308.11832","submitter":"Ewain Gwynne","authors":"Morris Ang, Ewain Gwynne","title":"Supercritical Liouville quantum gravity and CLE$_4$","comments":"35 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish the first relationship between Schramm-Loewner evolution (SLE)\nand Liouville quantum gravity (LQG) in the supercritical (a.k.a. strongly\ncoupled) phase, which corresponds to central charge values $\\mathbf c_{\\mathrm\nL} \\in (1,25)$ or equivalently to complex values of $\\gamma$ with $|\\gamma|=2$.\nMore precisely, we introduce a canonical supercritical LQG surface with the\ntopology of the disk. We then show that for each $\\mathbf c_{\\mathrm L} \\in\n(1,25)$ there is a coupling of this LQG surface with a conformal loop ensemble\nwith parameter $\\kappa=4$ (CLE$_4$) wherein the LQG surfaces parametrized by\nthe regions enclosed by the CLE$_4$ loops are conditionally independent\nsupercritical LQG disks given their boundary lengths. In this coupling, the\nCLE$_4$ is neither determined by nor independent from the LQG. Guided by our\ncoupling result, we exhibit a combinatorially natural family of loop-decorated\nrandom planar maps whose scaling limit we conjecture to be the supercritical\nLQG disk coupled to CLE$_4$. We include a substantial list of open problems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:43:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ang","Morris",""],["Gwynne","Ewain",""]]}
{"id":"2308.11833","submitter":"Mostafa Sharifzadeh","authors":"Mostafa Sharifzadeh, Habib Benali, and Hassan Rivaz","title":"Robust RF Data Normalization for Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Radio frequency (RF) data contain richer information compared to other data\ntypes, such as envelope or B-mode, and employing RF data for training deep\nneural networks has attracted growing interest in ultrasound image processing.\nHowever, RF data is highly fluctuating and additionally has a high dynamic\nrange. Most previous studies in the literature have relied on conventional data\nnormalization, which has been adopted within the computer vision community. We\ndemonstrate the inadequacy of those techniques for normalizing RF data and\npropose that individual standardization of each image substantially enhances\nthe performance of deep neural networks by utilizing the data more efficiently.\nWe compare conventional and proposed normalizations in a phase aberration\ncorrection task and illustrate how the former enhances the generality of\ntrained models.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:45:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sharifzadeh","Mostafa",""],["Benali","Habib",""],["Rivaz","Hassan",""]]}
{"id":"2308.11834","submitter":"Tosin Ige","authors":"Tosin Ige, Christopher Kiekintveld","title":"Performance Comparison and Implementation of Bayesian Variants for\n  Network Intrusion Detection","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bayesian classifiers perform well when each of the features is completely\nindependent of the other which is not always valid in real world application.\nThe aim of this study is to implement and compare the performances of each\nvariant of Bayesian classifier (Multinomial, Bernoulli, and Gaussian) on\nanomaly detection in network intrusion, and to investigate whether there is any\nassociation between each variant assumption and their performance. Our\ninvestigation showed that each variant of Bayesian algorithm blindly follows\nits assumption regardless of feature property, and that the assumption is the\nsingle most important factor that influences their accuracy. Experimental\nresults show that Bernoulli has accuracy of 69.9% test (71% train), Multinomial\nhas accuracy of 31.2% test (31.2% train), while Gaussian has accuracy of 81.69%\ntest (82.84% train). Going deeper, we investigated and found that each Naive\nBayes variants performances and accuracy is largely due to each classifier\nassumption, Gaussian classifier performed best on anomaly detection due to its\nassumption that features follow normal distributions which are continuous,\nwhile multinomial classifier have a dismal performance as it simply assumes\ndiscreet and multinomial distribution.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:46:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ige","Tosin",""],["Kiekintveld","Christopher",""]]}
{"id":"2308.11835","submitter":"Ewain Gwynne","authors":"Morris Ang, Ewain Gwynne","title":"Critical Liouville quantum gravity and CLE$_4$","comments":"19 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider a critical ($\\gamma=2$) Liouville quantum gravity (LQG) disk\ntogether with an independent conformal loop ensemble (CLE) with parameter\n$\\kappa=4$. We show that the critical LQG surfaces parametrized by the regions\nenclosed by the CLE$_4$ loops are conditionally independent critical LQG disks\ngiven the LQG lengths of the loops. We also show that the joint law of the LQG\nlengths of the loops is described in terms of the jumps of a certain\n$3/2$-stable process. Our proofs are via a limiting argument based on the\nanalogous statements for $\\gamma \\in (\\sqrt{8/3},2)$ and $\\kappa = \\gamma^2 \\in\n(8/3,4)$ which were proven by Miller, Sheffield, and Werner (2020). Our results\nare used in the construction of a coupling of supercritical LQG with CLE$_4$ in\nanother paper by the same authors.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:48:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ang","Morris",""],["Gwynne","Ewain",""]]}
{"id":"2308.11836","submitter":"Davood Karimi","authors":"Yihan Wu, Lana Vasung, Camilo Calixto, Ali Gholipour, Davood Karimi","title":"Characterizing normal perinatal development of the human brain\n  structural connectivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Early brain development is characterized by the formation of a highly\norganized structural connectome. The interconnected nature of this connectome\nunderlies the brain's cognitive abilities and influences its response to\ndiseases and environmental factors. Hence, quantitative assessment of\nstructural connectivity in the perinatal stage is useful for studying normal\nand abnormal neurodevelopment. However, estimation of the connectome from\ndiffusion MRI data involves complex computations. For the perinatal period,\nthese computations are further challenged by the rapid brain development and\nimaging difficulties. Combined with high inter-subject variability, these\nfactors make it difficult to chart the normal development of the structural\nconnectome. As a result, there is a lack of reliable normative baselines of\nstructural connectivity metrics at this critical stage in brain development. In\nthis study, we developed a computational framework, based on spatio-temporal\naveraging, for determining such baselines. We used this framework to analyze\nthe structural connectivity between 33 and 44 postmenstrual weeks using data\nfrom 166 subjects. Our results unveiled clear and strong trends in the\ndevelopment of structural connectivity in perinatal stage. Connection weighting\nbased on fractional anisotropy and neurite density produced the most consistent\nresults. We observed increases in global and local efficiency, a decrease in\ncharacteristic path length, and widespread strengthening of the connections\nwithin and across brain lobes and hemispheres. We also observed asymmetry\npatterns that were consistent between different connection weighting\napproaches. The new computational method and results are useful for assessing\nnormal and abnormal development of the structural connectome early in life.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 23:49:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wu","Yihan",""],["Vasung","Lana",""],["Calixto","Camilo",""],["Gholipour","Ali",""],["Karimi","Davood",""]]}
{"id":"2308.11837","submitter":"Jun Hashimoto","authors":"Jun Hashimoto, Hauyu Baobab Liu, Ruobing Dong, Beibei Liu, Takayuki\n  Muto, Yuka Terada","title":"Centimeter-sized Grains in the Compact Dust Ring around Very Low Mass\n  Star CIDA 1","comments":"14 pages, 5 figures, accepted in AJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examined the grain size in the dust ring encircling the 0.19~$M_\\sun$ T\nTauri star CIDA 1 using the Karl G. Jansky Very Large Array (JVLA) at multiple\ncentimeter wavelengths, with a spatial resolution of 0$\\farcs$2--0$\\farcs$9. We\ndetected distinct partial-ring structures at these wavelengths around CIDA~1.\nBased on spatial distributions and spectral indexes, we determined that these\ncentimeter emissions originated from dust, rather than free-free or synchrotron\nemissions. To estimate the maximum grain size ($a_{\\rm max}$) within the ring,\nwe compared the observed spectral energy distribution (SED) with SEDs\ncalculated for different $a_{\\rm max}$ values using radiative transfer\ncalculations. Our findings indicate an $a_{\\rm max}$ value of approximately\n2.5~cm in the ring, assuming the dust opacity can be approximated by the DSHARP\nmodels. These results suggest that grain growth took place within the CIDA~1\nring, potentially facilitating more efficient planet formation through pebble\naccretion scenarios involving centimeter-sized pebbles.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:09:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hashimoto","Jun",""],["Liu","Hauyu Baobab",""],["Dong","Ruobing",""],["Liu","Beibei",""],["Muto","Takayuki",""],["Terada","Yuka",""]]}
{"id":"2308.11838","submitter":"Linwei Tao","authors":"Linwei Tao, Younan Zhu, Haolan Guo, Minjing Dong, Chang Xu","title":"A Benchmark Study on Calibration","comments":"39 pages, 35 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks are increasingly utilized in various machine learning\ntasks. However, as these models grow in complexity, they often face calibration\nissues, despite enhanced prediction accuracy. Many studies have endeavored to\nimprove calibration performance through data preprocessing, the use of specific\nloss functions, and training frameworks. Yet, investigations into calibration\nproperties have been somewhat overlooked. Our study leverages the Neural\nArchitecture Search (NAS) search space, offering an exhaustive model\narchitecture space for thorough calibration properties exploration. We\nspecifically create a model calibration dataset. This dataset evaluates 90\nbin-based and 12 additional calibration measurements across 117,702 unique\nneural networks within the widely employed NATS-Bench search space. Our\nanalysis aims to answer several longstanding questions in the field, using our\nproposed dataset: (i) Can model calibration be generalized across different\ntasks? (ii) Can robustness be used as a calibration measurement? (iii) How\nreliable are calibration metrics? (iv) Does a post-hoc calibration method\naffect all models uniformly? (v) How does calibration interact with accuracy?\n(vi) What is the impact of bin size on calibration measurement? (vii) Which\narchitectural designs are beneficial for calibration? Additionally, our study\nbridges an existing gap by exploring calibration within NAS. By providing this\ndataset, we enable further research into NAS calibration. As far as we are\naware, our research represents the first large-scale investigation into\ncalibration properties and the premier study of calibration issues within NAS.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:10:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tao","Linwei",""],["Zhu","Younan",""],["Guo","Haolan",""],["Dong","Minjing",""],["Xu","Chang",""]]}
{"id":"2308.11839","submitter":"Min-Won Seo","authors":"Min-Won Seo and Solmaz S. Kia","title":"Bayesian Learning for Dynamic Target Localization with Human-provided\n  Spatial Information","comments":"Submitted to IEEE Robotics and Automation Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers a human-autonomy collaborative sensor data fusion for\ndynamic target localization in a Bayesian framework. To compensate for the\nshortcomings of an autonomous tracking system, we propose to collect spatial\nsensing information from human operators who visually monitor the target and\ncan provide target localization information in the form of free sketches\nencircling the area where the target is located. Our focus in this paper is to\nconstruct an adaptive probabilistic model for human-provided inputs where the\nadaption terms capture the level of reliability of the human inputs. The next\ncontribution of this paper is a novel joint Bayesian learning method to fuse\nhuman and autonomous sensor inputs in a manner that the dynamic changes in\nhuman detection reliability are also captured and accounted for. A unique\naspect of this Bayesian modeling framework is its analytical closed-form update\nequations, endowing our method with significant computational efficiency.\nSimulations demonstrate our results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:13:45 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:32:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Seo","Min-Won",""],["Kia","Solmaz S.",""]]}
{"id":"2308.11840","submitter":"Pedro David Carneiro Neto","authors":"Pedro C. Neto, Eduarda Caldeira, Jaime S. Cardoso, Ana F. Sequeira","title":"Compressed Models Decompress Race Biases: What Quantized Models Forget\n  for Fair Face Recognition","comments":"Accepted for Oral at BIOSIG 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the ever-growing complexity of deep learning models for face\nrecognition, it becomes hard to deploy these systems in real life. Researchers\nhave two options: 1) use smaller models; 2) compress their current models.\nSince the usage of smaller models might lead to concerning biases, compression\ngains relevance. However, compressing might be also responsible for an increase\nin the bias of the final model. We investigate the overall performance, the\nperformance on each ethnicity subgroup and the racial bias of a\nState-of-the-Art quantization approach when used with synthetic and real data.\nThis analysis provides a few more details on potential benefits of performing\nquantization with synthetic data, for instance, the reduction of biases on the\nmajority of test scenarios. We tested five distinct architectures and three\ndifferent training datasets. The models were evaluated on a fourth dataset\nwhich was collected to infer and compare the performance of face recognition\nmodels on different ethnicity.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:17:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Neto","Pedro C.",""],["Caldeira","Eduarda",""],["Cardoso","Jaime S.",""],["Sequeira","Ana F.",""]]}
{"id":"2308.11841","submitter":"Di Chai","authors":"Di Chai, Leye Wang, Liu Yang, Junxue Zhang, Kai Chen, and Qiang Yang","title":"A Survey for Federated Learning Evaluations: Goals and Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Evaluation is a systematic approach to assessing how well a system achieves\nits intended purpose. Federated learning (FL) is a novel paradigm for\nprivacy-preserving machine learning that allows multiple parties to\ncollaboratively train models without sharing sensitive data. However,\nevaluating FL is challenging due to its interdisciplinary nature and diverse\ngoals, such as utility, efficiency, and security. In this survey, we first\nreview the major evaluation goals adopted in the existing studies and then\nexplore the evaluation metrics used for each goal. We also introduce FedEval,\nan open-source platform that provides a standardized and comprehensive\nevaluation framework for FL algorithms in terms of their utility, efficiency,\nand security. Finally, we discuss several challenges and future research\ndirections for FL evaluation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:17:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chai","Di",""],["Wang","Leye",""],["Yang","Liu",""],["Zhang","Junxue",""],["Chen","Kai",""],["Yang","Qiang",""]]}
{"id":"2308.11842","submitter":"Qi Zhang","authors":"Dingyang Chen, Qi Zhang","title":"${\\rm E}(3)$-Equivariant Actor-Critic Methods for Cooperative\n  Multi-Agent Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Identification and analysis of symmetrical patterns in the natural world have\nled to significant discoveries across various scientific fields, such as the\nformulation of gravitational laws in physics and advancements in the study of\nchemical structures. In this paper, we focus on exploiting Euclidean symmetries\ninherent in certain cooperative multi-agent reinforcement learning (MARL)\nproblems and prevalent in many applications. We begin by formally\ncharacterizing a subclass of Markov games with a general notion of symmetries\nthat admits the existence of symmetric optimal values and policies. Motivated\nby these properties, we design neural network architectures with symmetric\nconstraints embedded as an inductive bias for multi-agent actor-critic methods.\nThis inductive bias results in superior performance in various cooperative MARL\nbenchmarks and impressive generalization capabilities such as zero-shot\nlearning and transfer learning in unseen scenarios with repeated symmetric\npatterns. The code is available at: https://github.com/dchen48/E3AC.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:18:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Dingyang",""],["Zhang","Qi",""]]}
{"id":"2308.11843","submitter":"Hugh Sullivan","authors":"H.~T.~Sullivan and J.~H.~Cole","title":"A link between shape dependent lifetimes and thermal escape in quantum\n  dots and rings","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the optical emission characteristics of semiconductor\nnanostructures is important when determing their device applicability. The\nemission depends on the material and its geometry, but also depends on other\nprocesses such as thermal escape from the nanostructure. Although it is widely\naccepted that scattering involving longitudinal optical phonons is the key\nprocess in thermal escape, it remains unclear why some quantum structures\nthermally emit excitons and other single charge carriers. To investigate this\nphenomena we theoretically determine the energy levels and temperature-lifetime\nrelationships of quantum dots and rings. We find that replicating the observed\ntemperature dependence of the exciton lifetime requires both an eigenspectrum\nand a thermal escape mechanism which are geometry dependent. This suggests that\ngeometry may be a significant factor in determining the dominant thermal escape\nprocess in quantum structures.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:23:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["~Sullivan","H. ~T.",""],["~Cole","J. ~H.",""]]}
{"id":"2308.11844","submitter":"Wajid Mannan Dr","authors":"Wajid H. Mannan","title":"Low dimensional algebraic complexes over integral group rings","comments":"PhD Thesis (2006). Material corrected and expanded: C1: AG&T 9\n  (2009), 3, 1399-1411| Math. Proc. Camb. Phil. Soc. Vol. 146 (2009), 3,\n  671-673| HHA Vol. 10 (2008), 2, 135-137| HHA Vol. 9 (2007), 2, 445-449| C2:\n  AG&T 7 (2007), 1, 517-528| AG&T. 13 (2013), 6, 3287-3304| C3: Bull. LMS 40\n  (2008), 4, 664-674| C4: HHA Vol. 19 (2017), 1, 171-179","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The realization problem asks: When does an algebraic complex arise, up to\nhomotopy, from a geometric complex? In the case of 2- dimensional algebraic\ncomplexes, this is equivalent to the D2 problem, which asks when homological\nmethods can distinguish between 2 and 3 dimensional complexes.\n  We approach the realization problem (and hence the D2 problem) by classifying\nall possible algebraic 2- complexes and showing that they are realized. We show\nthat if a dihedral group has order 2n, then the algebraic complexes over it are\nparametrized by their second homology groups, which we refer to as algebraic\nsecond homotopy groups. A cancellation theorem of Swan ([11]), then allows us\nto solve the realization problem for the group D8. Let X be a finite geometric\n2- complex. Standard isomorphisms and Schanuel's lemma imply that the stable\nclass of pi_2(X) is determined by pi_1(X). We show how pi_3(X) may be\ncalculated similarly. Specifically,we show that as a module over the\nfundamental group, pi_3(X) is the symmetric part of the module pi_2(X) otimes\npi_2(X). As a consequence, we are able to show that when the order of pi_1(X)\nis odd, the stable class of pi_3(X) is also determined by pi_1(X).\n  Given a closed, connected, orientable 5- dimensional manifold, with finite\nfundamental group, we may represent it, up to homotopy equivalence, by an\nalgebraic complex. Poincare duality induces a homotopy equivalence between this\nalgebraic complex and its dual. We consider how similar this homotopy\nequivalence may be made to the identity, (through appropriate choice of\nalgebraic complex). We show that it can be taken to be the identity on 4 of the\n6 terms of the chain complex. However a homological obstruction prevents it\nfrom being the identity.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:33:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mannan","Wajid H.",""]]}
{"id":"2308.11845","submitter":"Yue Gao","authors":"Yue Gao, Ilia Shumailov, Kassem Fawaz","title":"SEA: Shareable and Explainable Attribution for Query-based Black-box\n  Attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Machine Learning (ML) systems are vulnerable to adversarial examples,\nparticularly those from query-based black-box attacks. Despite various efforts\nto detect and prevent such attacks, there is a need for a more comprehensive\napproach to logging, analyzing, and sharing evidence of attacks. While classic\nsecurity benefits from well-established forensics and intelligence sharing,\nMachine Learning is yet to find a way to profile its attackers and share\ninformation about them. In response, this paper introduces SEA, a novel ML\nsecurity system to characterize black-box attacks on ML systems for forensic\npurposes and to facilitate human-explainable intelligence sharing. SEA\nleverages the Hidden Markov Models framework to attribute the observed query\nsequence to known attacks. It thus understands the attack's progression rather\nthan just focusing on the final adversarial examples. Our evaluations reveal\nthat SEA is effective at attack attribution, even on their second occurrence,\nand is robust to adaptive strategies designed to evade forensics analysis.\nInterestingly, SEA's explanations of the attack behavior allow us even to\nfingerprint specific minor implementation bugs in attack libraries. For\nexample, we discover that the SignOPT and Square attacks implementation in ART\nv1.14 sends over 50% specific zero difference queries. We thoroughly evaluate\nSEA on a variety of settings and demonstrate that it can recognize the same\nattack's second occurrence with 90+% Top-1 and 95+% Top-3 accuracy.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:49:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gao","Yue",""],["Shumailov","Ilia",""],["Fawaz","Kassem",""]]}
{"id":"2308.11846","submitter":"Xu Zhiping","authors":"Yingjie Zhao and Zhiping Xu","title":"A Data-Driven Approach to Morphogenesis under Structural Instability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS q-bio.QM stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Morphological development into evolutionary patterns under structural\ninstability is ubiquitous in living systems and often of vital importance for\nengineering structures. Here we propose a data-driven approach to understand\nand predict their spatiotemporal complexities. A machine-learning framework is\nproposed based on the physical modeling of morphogenesis triggered by internal\nor external forcing. Digital libraries of structural patterns are constructed\nfrom the simulation data, which are then used to recognize the abnormalities,\npredict their development, and assist in risk assessment and prognosis. The\ncapabilities to identify the key bifurcation characteristics and predict the\nhistory-dependent development from the global and local features are\ndemonstrated by examples of brain growth and aerospace structural design, which\noffer guidelines for disease diagnosis/prognosis and instability-tolerant\ndesign.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:51:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhao","Yingjie",""],["Xu","Zhiping",""]]}
{"id":"2308.11847","submitter":"Sean Monahan","authors":"Sean Monahan, Matthew Satriano","title":"Approximating rational points on horospherical varieties","comments":"20 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $X$ be a smooth projective split horospherical variety over a number\nfield $k$ and $x\\in X(k)$. Contingent on Vojta's conjecture, we construct a\ncurve $C$ through $x$ such that (in a precise sense) rational points on $C$\napproximate $x$ better than any Zariski dense sequence of rational points. This\nproves a weakening of a conjecture of McKinnon in the horospherical case. Our\nresults make use of the minimal model program and apply as well to\n$\\mathbb{Q}$-factorial horospherical varieties with terminal singularities.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:54:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Monahan","Sean",""],["Satriano","Matthew",""]]}
{"id":"2308.11848","submitter":"Diego Gonzalez","authors":"Diego Gonzalez, Jorge Ch\\'avez-Carlos, Jorge G. Hirsch, J. David\n  Vergara","title":"Parameter space geometry of the quartic oscillator and the double well\n  potential: Classical and quantum description","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute both analytically and numerically the geometry of the parameter\nspace of the anharmonic oscillator employing the quantum metric tensor and its\nscalar curvature. A novel semiclassical treatment based on a Fourier\ndecomposition allows to construct classical analogues of the quantum metric\ntensor and of the expectation values of the transition matrix elements. A\ndetailed comparison is presented between exact quantum numerical results, a\nperturbative quantum description and the semiclassical analysis. They are shown\nto coincide for both positive and negative quadratic potentials, where the\npotential displays a double well. Although the perturbative method is unable to\ndescribe the region where the quartic potential vanishes, it is remarkable that\nboth the perturbative and semiclassical formalisms recognize the negative\noscillator parameter at which the ground state starts to be delocalized in two\nwells.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:55:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gonzalez","Diego",""],["Ch\u00e1vez-Carlos","Jorge",""],["Hirsch","Jorge G.",""],["Vergara","J. David",""]]}
{"id":"2308.11849","submitter":"Enze Liu","authors":"Enze Liu, Zhiyuan Lin, Judith Y.T. Wang, Hong Chen","title":"A deep reinforcement learning approach for real-time demand-responsive\n  railway rescheduling to mitigate station overcrowding using mobile data","comments":"36 pages,16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AI cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time railway rescheduling is a timely and flexible technique to\nautomatically alter the operation schedule in response to time-varying\nconditions. Current research lacks data-driven approaches that capture\nreal-time passenger mobility during railway disruptions, relying mostly on\nOD-based data and model-based methods for estimating demands of trains.\nMeanwhile, the schedule-updating principles for a long-term disruption overlook\nthe uneven distribution of demand over time. To fill this gap, this paper\nproposes a demand-responsive approach by inferring real-world passenger\nmobility from mobile data (MD) to facilitate real-time rescheduling. Unlike\nnetwork-level approaches, this paper focuses on a heavy-demand station upstream\nof the disrupted area. The objective is to reschedule all trains on multiple\nroutes passing through this target station, which have been affected by a\nsevere emergency event such as a natural disaster. Particular attention should\nbe given to avoiding the accumulation of overcrowded passengers at this\nstation, to prevent additional accidents arising from overcrowding. This\nresearch addresses the challenges associated with this scenario, including the\ndynamics of arriving and leaving of passengers, station overcrowding, rolling\nstock shortage, open-ended disruption duration, integrated rescheduling on\nmultiple routes, and delays due to detours. A deep reinforcement learning (DRL)\nframework is proposed to determine the optimal rescheduled timetable, route\nstops, and rolling stock allocation, while considering real-time demand\nsatisfaction, station overcrowding, train capacity utilization, and headway\nsafety.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:55:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Enze",""],["Lin","Zhiyuan",""],["Wang","Judith Y. T.",""],["Chen","Hong",""]]}
{"id":"2308.11850","submitter":"Alexander Dunlap","authors":"Alexander Dunlap and Cole Graham","title":"The 2D nonlinear stochastic heat equation: pointwise statistics and the\n  decoupling function","comments":"82 pages; 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a two-dimensional stochastic heat equation with Gaussian noise of\ncorrelation length $\\rho^{1/2} \\ll 1$ and strength\n$\\sigma(v)/\\sqrt{\\log\\rho^{-1}}$ depending nonlinearly on the solution $v$. The\nfirst author and Gu showed that, if $\\operatorname{Lip}(\\sigma)$ lies below a\ncritical value, the one-point statistics of $v$ converge in distribution as\n$\\rho\\to 0$ to the law of a random variable expressed in terms of a\nforward-backward stochastic differential equation (FBSDE). In this paper, we\nshow (for a slightly different smoothing mechanism) that this result can hold\neven when $\\operatorname{Lip}(\\sigma)$ exceeds the critical value. More\nprecisely, the FBSDE characterizes the limiting one-point statistics of the\nSPDE so long as the square root of the decoupling function of the FBSDE remains\nLipschitz. In addition, we extend the results to coupled systems of SPDEs and\nprovide a quantitative rate of convergence.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 00:59:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dunlap","Alexander",""],["Graham","Cole",""]]}
{"id":"2308.11851","submitter":"Md Istiak Khan","authors":"Md Istiak Khan, Zhenyang Xiao, Sadhvikas J. Addamane, David Burghoff","title":"Frequency combs in optically-injected terahertz ring quantum cascade\n  lasers","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum cascade lasers (QCLs) have emerged as promising candidates for\ngenerating chip-scale frequency combs in mid-infrared and terahertz\nwavelengths. In this work, we demonstrate frequency comb formation in ring\nterahertz QCLs using the injection of light from a distributed feedback (DFB)\nlaser. The DFB design frequency is chosen to match the modes of the ring cavity\n(near 3.3 THz), and light from the DFB is injected into the ring QCL via a bus\nwaveguide. By controlling the power and frequency of the optical injection, we\nshow experimentally and theoretically that combs can be selectively formed and\ncontrolled in the ring cavity. The potential for soliton generation and\nefficient power extraction through the bus waveguide presents exciting\nopportunities for integrating this technology in compact comb designs.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:00:57 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 05:12:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khan","Md Istiak",""],["Xiao","Zhenyang",""],["Addamane","Sadhvikas J.",""],["Burghoff","David",""]]}
{"id":"2308.11852","submitter":"Christopher Tuffley","authors":"Wayne Burrows, Christopher Tuffley","title":"The rack congruence condition and half congruences in racks","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Racks and quandles are algebraic structures with a single binary operation\nthat is right self-distributive and right invertible, and additionally\nidempotent in the case of quandles. The invertibility condition is equivalent\nto the existence of a second binary operation that acts as a right inverse to\nthe first, so that racks and quandles may also be viewed as algebraic\nstructures with a pair of (dependent) binary operations.\n  When forming a quotient rack or quandle it's necessary to take this\ntwo-operation view, and define a congruence as an equivalence relation on the\nrack or quandle that respects both operations. However, in defining a\ncongruence some authors have omitted the condition on the inverse operation,\nand defined a congruence as an equivalence relation respecting the primary\noperation only. We show that while respecting the primary operation is\nsufficient in the case of finite racks and quandles, it is not in general\nsufficient in the infinite case. We do this by constructing explicit examples\nof \"half congruences\": equivalence relations that respect exactly one of the\ntwo operations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:03:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Burrows","Wayne",""],["Tuffley","Christopher",""]]}
{"id":"2308.11853","submitter":"Masaki Kando","authors":"K. Huang, Z. Jin, N. Nakanii. T. Hosokai, M. Kando","title":"Numerical study on femtosecond electro-optical spatial decoding of\n  transition radiation from laser wakefield accelerated electron bunches","comments":"22 pages, 21 figures, submitted to Physical Review Accelerators and\n  Beams","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This numerical study is focused on electro-optic (EO) spatial decoding of\ntransition radiation (TR) produced by a relativistic electron bunch passing\nthrough a metal foil. The calculations included the imaging of polychromatic\ntransition radiation from an electron bunch and the process of EO spatial\ndecoding. From an experimental perspective, a careful examination of the\ncalculation approach of the data analysis is essential. Therefore, to\nthoroughly understand the process of signal generation and examine the\npossibility of adopting a less time-consuming treatment, comparative studies\nwere conducted on detailed and simplified models of both transition radiation\nimaging and EO signal generation. All calculations are defined in SI units for\nthe convenience of experimental measurements. For TR imaging, the results\nsuggest that the simplified analytical model is sufficient to perform\npolychromatic calculations with considerable accuracy. For EO spatial decoding,\nwe discussed the process of EO signal generation using 1D and 2D models. We\nfound that the 1D model was sufficient for rapid data analysis. Furthermore,\nthe temporal energy chirp was demonstrated to have a minimal impact on the\nshape of the EO signal. Because both the transverse and longitudinal profiles\ncan be calculated with arbitrary distributions, this numerical study can\nfacilitate measurements of 3D electron charge density profiles in both laser\nwakefield acceleration and conventional accelerator research.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:06:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","K.",""],["Jin","Z.",""],["Hosokai","N. Nakanii. T.",""],["Kando","M.",""]]}
{"id":"2308.11854","submitter":"Anmol Chaure","authors":"Anmol Chaure, Ashok Kumar Behera, Sudip Bhattacharya","title":"Finding the Perfect Fit: Applying Regression Models to ClimateBench v1.0","comments":null,"journal-ref":"International Journal of Computer Applications 185(29):31-39,\n  August 2023","doi":"10.5120/ijca2023923042","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Climate projections using data driven machine learning models acting as\nemulators, is one of the prevailing areas of research to enable policy makers\nmake informed decisions. Use of machine learning emulators as surrogates for\ncomputationally heavy GCM simulators reduces time and carbon footprints. In\nthis direction, ClimateBench [1] is a recently curated benchmarking dataset for\nevaluating the performance of machine learning emulators designed for climate\ndata. Recent studies have reported that despite being considered fundamental,\nregression models offer several advantages pertaining to climate emulations. In\nparticular, by leveraging the kernel trick, regression models can capture\ncomplex relationships and improve their predictive capabilities. This study\nfocuses on evaluating non-linear regression models using the aforementioned\ndataset. Specifically, we compare the emulation capabilities of three\nnon-linear regression models. Among them, Gaussian Process Regressor\ndemonstrates the best-in-class performance against standard evaluation metrics\nused for climate field emulation studies. However, Gaussian Process Regression\nsuffers from being computational resource hungry in terms of space and time\ncomplexity. Alternatively, Support Vector and Kernel Ridge models also deliver\ncompetitive results and but there are certain trade-offs to be addressed.\nAdditionally, we are actively investigating the performance of composite\nkernels and techniques such as variational inference to further enhance the\nperformance of the regression models and effectively model complex non-linear\npatterns, including phenomena like precipitation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:08:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chaure","Anmol",""],["Behera","Ashok Kumar",""],["Bhattacharya","Sudip",""]]}
{"id":"2308.11855","submitter":"John F. Dobson","authors":"John F. Dobson and Alberto Ambroselli","title":"MBD+C: how to incorporate metallic character into atom-based dispersion\n  energy schemes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The dispersion component of the van der Waals (vdW) interaction in\nlow-dimensional metals is known to exhibit anomalous \"Type-C non-additivity\"\n[Int. J. Quantum Chem. 114, 1157 (2014)]. This causes dispersion energy\nbehavior, at asymptotically large separations, that is missed by popular\natom-based schemes for dispersion energy calculations. For example, the\ndispersion interaction energy between parallel metallic nanotubes at separation\n$D$ falls off aymptotically as approximately $D^{-2}$, whereas current\natom-based schemes predict $D^{-5}$ asymptotically. To date it has not been\nclear whether current atom-based theories also give the dispersion interaction\ninaccurately at smaller separations for low-dimensional metals.\n  Here we introduce a new theory that we term \"MBD+C\" . It permits inclusion of\nType C effects efficiently within atom-based dispersion energy schemes such as\nMany Body Dispersion (MBD) and Universal MBD (uMBD). This allows us to\ninvestigate asymptotic, intermediate and near-contact regimes with equal\naccuracy. (The large contact energy of intimate metallic bonding is not\nprimarily governed by dispersion energy and is described well by semi-local\ndensity functional theory.) Here we apply a simplified version,\"nn-MBD+C\", of\nour new theory to calculate the dispersion interaction for three\nlow-dimensional metallic systems: parallel metallic chains of gold atoms,\nparallel Li-doped graphene sheets; and parallel (4,4) armchair carbon\nnanotubes. In addition to giving the correct asymptotic behavior, the new\ntheory seamlessly gives the dispersion energy down to near-contact geometry,\nwhere it is similar to MBD but can give up to 15% more dispersion energy than\ncurrent MBD schemes, in the systems studied so far. This percentage increases\nwith separation until nn-MBD+C dominates MBD at asymptotic separations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:09:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dobson","John F.",""],["Ambroselli","Alberto",""]]}
{"id":"2308.11856","submitter":"Sara Heshmatian","authors":"Sara Heshmatian, Alexander Trounev","title":"Thermal quench of a dynamical QCD model in an external electric field","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we investigate the thermal equilibration of the holographic\nQCD model dual to the Einstein-Maxwell-Dilaton (EMD) gravity in the presence of\nan external electric field. The model captures the QCD features at finite\ntemperature and finite chemical potential in both confinement and deconfinement\nphases and could be considered a good candidate to study the dynamics of the\nstrongly interacting system in out-of-equilibrium conditions. For this purpose,\nwe examine the instability imposed by an external electric field using the\nAdS/CFT dictionary and study the electric current flow and its relaxation for\nthis holographic model in the presence of constant and time-dependent electric\nfields. We study the effects of temperature, electric field strength, and\nchemical potential on the stationary state. Additionally, we investigate the\nbehavior of the equilibration time and its rescaled value for the\ntime-dependent case. Finally, we compare our results to those from other\nholographic models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:11:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Heshmatian","Sara",""],["Trounev","Alexander",""]]}
{"id":"2308.11857","submitter":"Ziyu Zhou","authors":"Zihao Wang, Yiming Huang, Ziyu Zhou","title":"CoC-GAN: Employing Context Cluster for Unveiling a New Pathway in Image\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image generation tasks are traditionally undertaken using Convolutional\nNeural Networks (CNN) or Transformer architectures for feature aggregating and\ndispatching. Despite the frequent application of convolution and attention\nstructures, these structures are not fundamentally required to solve the\nproblem of instability and the lack of interpretability in image generation. In\nthis paper, we propose a unique image generation process premised on the\nperspective of converting images into a set of point clouds. In other words, we\ninterpret an image as a set of points. As such, our methodology leverages\nsimple clustering methods named Context Clustering (CoC) to generate images\nfrom unordered point sets, which defies the convention of using convolution or\nattention mechanisms. Hence, we exclusively depend on this clustering\ntechnique, combined with the multi-layer perceptron (MLP) in a generative\nmodel. Furthermore, we implement the integration of a module termed the 'Point\nIncreaser' for the model. This module is just an MLP tasked with generating\nadditional points for clustering, which are subsequently integrated within the\nparadigm of the Generative Adversarial Network (GAN). We introduce this model\nwith the novel structure as the Context Clustering Generative Adversarial\nNetwork (CoC-GAN), which offers a distinctive viewpoint in the domain of\nfeature aggregating and dispatching. Empirical evaluations affirm that our\nCoC-GAN, devoid of convolution and attention mechanisms, exhibits outstanding\nperformance. Its interpretability, endowed by the CoC module, also allows for\nvisualization in our experiments. The promising results underscore the\nfeasibility of our method and thus warrant future investigations of applying\nContext Clustering to more novel and interpretable image generation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:19:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Zihao",""],["Huang","Yiming",""],["Zhou","Ziyu",""]]}
{"id":"2308.11858","submitter":"Orsola Capovilla-Searle","authors":"Orsola Capovilla-Searle, James Hughes, and Daping Weng","title":"Augmentations, Fillings, and Clusters for 2-Bridge Links","comments":"39 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We produce the first examples relating non-orientable exact Lagrangian\nfillings of Legendrian links to cluster theory, showing that the ungraded\naugmentation variety of certain max-tb representatives of Legendrian $2$-bridge\nlinks is isomorphic to a product of $A_n$-type cluster varieties. As part of\nthis construction, we describe a surjective map from the set of (possibly\nnon-orientable) exact Lagrangian fillings to cluster seeds, producing a product\nof Catalan numbers of distinct fillings. We also relate the ruling\nstratification of the ungraded augmentation variety to Lam and Speyer's\nanticlique stratification of acyclic cluster varieties, showing that the two\ncoincide in this context. As a corollary, we apply a result of Rutherford to\nshow that the cluster-theoretic stratification encodes the information of the\nlowest $a$-degree term of the Kauffman polynomial of the smooth isotopy class\nof the $2$-bridge links we study.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:24:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Capovilla-Searle","Orsola",""],["Hughes","James",""],["Weng","Daping",""]]}
{"id":"2308.11859","submitter":"Purnima Kamath","authors":"Purnima Kamath, Chitralekha Gupta, Lonce Wyse, Suranga Nanayakkara","title":"Example-Based Framework for Perceptually Guided Audio Texture Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Generative models for synthesizing audio textures explicitly encode\ncontrollability by conditioning the model with labelled data. While datasets\nfor audio textures can be easily recorded in-the-wild, semantically labeling\nthem is expensive, time-consuming, and prone to errors due to human annotator\nsubjectivity. Thus, to control generation, there is a need to automatically\ninfer user-defined perceptual factors of variation in the latent space of a\ngenerative model while modelling unlabeled textures. In this paper, we propose\nan example-based framework to determine vectors to guide texture generation\nbased on user-defined semantic attributes. By synthesizing a few synthetic\nexamples to indicate the presence or absence of a semantic attribute, we can\ninfer the guidance vectors in the latent space of a generative model to control\nthat attribute during generation. Our results show that our method is capable\nof finding perceptually relevant and deterministic guidance vectors for\ncontrollable generation for both discrete as well as continuous textures.\nFurthermore, we demonstrate the application of this method to other tasks such\nas selective semantic attribute transfer.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:29:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kamath","Purnima",""],["Gupta","Chitralekha",""],["Wyse","Lonce",""],["Nanayakkara","Suranga",""]]}
{"id":"2308.11860","submitter":"Masatoshi Suzuki","authors":"Masatoshi Suzuki","title":"Analytic theories around the simplest screw","comments":"34 pages. This article is a kind of survey and does not contain new\n  results","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present several analytic theories and their relations to each other\nrelated to screw functions, taking the screw function of the simplest screw\nline as an example. Note that this article does not contain any new results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:32:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Suzuki","Masatoshi",""]]}
{"id":"2308.11861","submitter":"Zhicheng Shi","authors":"Zhi-Cheng Shi, Jun-Tong Ding, Ye-Hong Chen, Jie Song, Yan Xia, X. X.\n  Yi, and Franco Nori","title":"Supervised Learning for Robust Quantum Control in Composite-Pulse\n  Systems","comments":"17 pages, 14 figures, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we develop a supervised learning model for implementing robust\nquantum control in composite-pulse systems, where the training parameters can\nbe either phases, detunings, or Rabi frequencies. This model exhibits great\nresistance to all kinds of systematic errors, including single, multiple, and\ntime-varying errors. We propose a modified gradient descent algorithm for\nadapting the training of phase parameters, and show that different sampling\nmethods result in different robust performances. In particular, there is a\ntradeoff between high-fidelity and robustness for a given number of training\nparameters, and both of them can be simultaneously enhanced by increasing the\nnumber of training parameters (pulses). For its applications, we demonstrate\nthat the current model can be used for achieving high-fidelity arbitrary\nsuperposition states and universal quantum gates in a robust manner. This work\nprovides a highly efficient learning model for fault-tolerant quantum\ncomputation by training various physical parameters.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:37:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shi","Zhi-Cheng",""],["Ding","Jun-Tong",""],["Chen","Ye-Hong",""],["Song","Jie",""],["Xia","Yan",""],["Yi","X. X.",""],["Nori","Franco",""]]}
{"id":"2308.11862","submitter":"M. Mehdi Kholoosi","authors":"M. Mehdi Kholoosi, M. Ali Babar, Cemal Yilmaz","title":"Empirical Analysis of Software Vulnerabilities Causing Timing Side\n  Channels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Timing attacks are considered one of the most damaging side-channel attacks.\nThese attacks exploit timing fluctuations caused by certain operations to\ndisclose confidential information to an attacker. For instance, in asymmetric\nencryption, operations such as multiplication and division can cause\ntime-varying execution times that can be ill-treated to obtain an encryption\nkey. Whilst several efforts have been devoted to exploring the various aspects\nof timing attacks, particularly in cryptography, little attention has been paid\nto empirically studying the timing attack-related vulnerabilities in\nnon-cryptographic software. By inspecting these software vulnerabilities, this\nstudy aims to gain an evidence-based understanding of weaknesses in\nnon-cryptographic software that may help timing attacks succeed. We used\nqualitative and quantitative research approaches to systematically study the\ntiming attack-related vulnerabilities reported in the National Vulnerability\nDatabase (NVD) from March 2003 to December 2022. Our analysis was focused on\nthe modifications made to the code for patching the identified vulnerabilities.\nWe found that a majority of the timing attack-related vulnerabilities were\nintroduced due to not following known secure coding practices. The findings of\nthis study are expected to help the software security community gain\nevidence-based information about the nature and causes of the vulnerabilities\nrelated to timing attacks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:38:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kholoosi","M. Mehdi",""],["Babar","M. Ali",""],["Yilmaz","Cemal",""]]}
{"id":"2308.11863","submitter":"Antoine Nzeyimana","authors":"Antoine Nzeyimana","title":"KinSPEAK: Improving speech recognition for Kinyarwanda via\n  semi-supervised learning methods","comments":"9 pages, 2 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Despite recent availability of large transcribed Kinyarwanda speech data,\nachieving robust speech recognition for Kinyarwanda is still challenging. In\nthis work, we show that using self-supervised pre-training, following a simple\ncurriculum schedule during fine-tuning and using semi-supervised learning to\nleverage large unlabelled speech data significantly improve speech recognition\nperformance for Kinyarwanda. Our approach focuses on using public domain data\nonly. A new studio-quality speech dataset is collected from a public website,\nthen used to train a clean baseline model. The clean baseline model is then\nused to rank examples from a more diverse and noisy public dataset, defining a\nsimple curriculum training schedule. Finally, we apply semi-supervised learning\nto label and learn from large unlabelled data in four successive generations.\nOur final model achieves 3.2% word error rate (WER) on the new dataset and\n15.9% WER on Mozilla Common Voice benchmark, which is state-of-the-art to the\nbest of our knowledge. Our experiments also indicate that using syllabic rather\nthan character-based tokenization results in better speech recognition\nperformance for Kinyarwanda.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:44:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nzeyimana","Antoine",""]]}
{"id":"2308.11864","submitter":"Yongqiang Wang","authors":"Yongqiang Wang, Feng Liang, Haisheng Fu, Jie Liang, Haipeng Qin,\n  Junzhe Liang","title":"Enhanced Residual SwinV2 Transformer for Learned Image Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the deep learning technology has been successfully applied in the\nfield of image compression, leading to superior rate-distortion performance.\nHowever, a challenge of many learning-based approaches is that they often\nachieve better performance via sacrificing complexity, which making practical\ndeployment difficult. To alleviate this issue, in this paper, we propose an\neffective and efficient learned image compression framework based on an\nenhanced residual Swinv2 transformer. To enhance the nonlinear representation\nof images in our framework, we use a feature enhancement module that consists\nof three consecutive convolutional layers. In the subsequent coding and hyper\ncoding steps, we utilize a SwinV2 transformer-based attention mechanism to\nprocess the input image. The SwinV2 model can help to reduce model complexity\nwhile maintaining high performance. Experimental results show that the proposed\nmethod achieves comparable performance compared to some recent learned image\ncompression methods on Kodak and Tecnick datasets, and outperforms some\ntraditional codecs including VVC. In particular, our method achieves comparable\nresults while reducing model complexity by 56% compared to these recent\nmethods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:50:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Yongqiang",""],["Liang","Feng",""],["Fu","Haisheng",""],["Liang","Jie",""],["Qin","Haipeng",""],["Liang","Junzhe",""]]}
{"id":"2308.11865","submitter":"Alexandre Sainterme","authors":"A.P. Sainterme and C.R. Sovinec","title":"Resistive Hose modes in Tokamak Runaway Electron Beams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beams of energetic runaway electrons are generated during disruptions in\ntokamaks, and fluid models are used to study their effects on macroscale\ndynamics. Linear computations of a massless, runaway electron beam coupled to\nMHD plasma show that resistive hose instabilities grow faster than tearing\nmodes at large resistivity. Eigenvalue results with reduced models of the\nresistive hose instability are compared with results from the full MHD and beam\nsystem, showing that the resistive hose decouples from any plasma response. An\nestimate of plasma temperature at which growth of the resistive hose dominates\ntearing for post-disruption DIII-D plasma parameters is in a physically\nrelevant regime\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:56:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sainterme","A. P.",""],["Sovinec","C. R.",""]]}
{"id":"2308.11866","submitter":"Xuning Zhao","authors":"Xuning Zhao, Wentao Ma, Junqin Chen, Gaoming Xiang, Pei Zhong, Kevin\n  Wang","title":"Long-Pulse Laser-Induced Cavitation: A Race Between Advection and Phase\n  Transition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vapor bubbles generated by long-pulsed laser often have complex non-spherical\nshapes that reflect some characteristics (e.g., direction, width) of the laser\nbeam. The transition between two commonly observed shapes - namely, a rounded\npear-like shape and an elongated conical shape - is studied using a new\ncomputational model that combines compressible multiphase fluid dynamics with\nlaser radiation and phase transition. Two laboratory experiments are simulated,\nin which Holmium:YAG and Thulium fiber lasers are used separately to generate\nbubbles of different shapes. In both cases, the bubble morphology predicted by\nthe simulation agrees reasonably well with the experimental measurement. The\nsimulated laser radiance, temperature, velocity, and pressure fields are\nanalyzed to explain bubble dynamics and energy transmission. It is found that\ndue to the lasting energy input (i.e. long-pulsed laser), the vapor bubble's\ndynamics is driven not only by advection, but also by the continuation of\nvaporization. Notably, vaporization lasts less than 1 microsecond in the case\nof the pear-shaped bubble, versus more than 50 microseconds for the elongated\nbubble. It is hypothesized that the bubble's shape is the result of a\ncompetition. When the speed of advection is higher than that of vaporization,\nthe bubble tends to grow spherically. Otherwise, it elongates along the laser\nbeam direction. To clarify and test this hypothesis, the two speeds are defined\nanalytically using a simplified model, then estimated for the experiments using\nsimulation results. The results support the hypothesis. They also suggest that\na higher laser absorption coefficient and a narrower beam facilitate bubble\nelongation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:01:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhao","Xuning",""],["Ma","Wentao",""],["Chen","Junqin",""],["Xiang","Gaoming",""],["Zhong","Pei",""],["Wang","Kevin",""]]}
{"id":"2308.11867","submitter":"Pandu Wisesa","authors":"Pandu Wisesa, Meng Li, Matthew T. Curnan, Jeong Woo Han, Judith C.\n  Yang, and Wissam A. Saidi","title":"Atomic scale understanding of initial Cu-Ni oxidation from\n  machine-learning accelerated first-principles simulations and in situ TEM\n  experiments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The development of accurate methods for determining how alloy surfaces\nspontaneously restructure under reactive and corrosive environments is a key,\nlong-standing, grand challenge in materials science. Current oxidation models,\nsuch as Cabrera-Mott, are based on macroscopic empirical knowledge that lacks\nfundamental insight at the atomic level. Using machine learning-accelerated\ndensity functional theory with in situ environmental transmission electron\nmicroscopy (ETEM), we examine the interplay between surface reconstructions and\npreferential segregation tendencies of CuNi(100) surfaces under oxidation\nconditions. Our modeling approach based on molecular dynamics and grand\ncanonical Monte Carlo simulations shows that oxygen-induced Ni segregation in\nCuNi alloy favors Cu(100)-O c(2x2) reconstruction and destabilizes the\nCu(100)-O missing row reconstruction. The underpinnings of these stabilization\ntendencies are rationalized based on the similar atomic coordination and bond\nlengths in NiO rock salt and Cu(100)-O c(2x2) structures. In situ ETEM\nexperiments show Ni segregation followed by NiO nucleation and growth in\nregions without MRR, with secondary nucleation and growth of Cu2O in MRR\nregions. This further corroborates the simulated surface oxidation and\nsegregation modelling outcomes. Our findings are general and are expected to\nextend to other alloy systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:02:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wisesa","Pandu",""],["Li","Meng",""],["Curnan","Matthew T.",""],["Han","Jeong Woo",""],["Yang","Judith C.",""],["Saidi","Wissam A.",""]]}
{"id":"2308.11868","submitter":"Jos\\'e Antonio Perusqu\\'ia Cort\\'es","authors":"Jos\\'e A. Perusqu\\'ia, Mario Diaz, Rams\\'es H. Mena","title":"On a Divergence-Based Prior Analysis of Stick-Breaking Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nonparametric view of Bayesian inference has transformed statistics and\nmany of its applications. The canonical Dirichlet process and other more\ngeneral families of nonparametric priors have served as a gateway to solve\nfrontier uncertainty quantification problems of large, or infinite, nature.\nThis success has been greatly due to available constructions and\nrepresentations of such distributions, which in turn have lead to a variety of\nsampling schemes. Undoubtedly, the two most useful constructions are the one\nbased on normalization of homogeneous completely random measures and that based\non stick-breaking processes, as well as various particular cases. Understanding\ntheir distributional features and how different random probability measures\ncompare among themselves is a key ingredient for their proper application. In\nthis paper, we explore the prior discrepancy, through a divergence-based\nanalysis, of extreme classes of stick-breaking processes. Specifically, we\ninvestigate the random Kullback-Leibler divergences between the Dirichlet\nprocess and the geometric process, as well as some of their moments.\nFurthermore, we also perform the analysis within the general exchangeable\nstick-breaking class of nonparametric priors, leading to appealing results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:12:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Perusqu\u00eda","Jos\u00e9 A.",""],["Diaz","Mario",""],["Mena","Rams\u00e9s H.",""]]}
{"id":"2308.11869","submitter":"Noah Graham","authors":"Noah Graham","title":"Electromagnetic Casimir-Polder Interaction for a Conducting Cone","comments":"8 pages, 3 .eps figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using the formulation of the electromagnetic Green's function of a perfectly\nconducting cone in terms of analytically continued angular momentum, we compute\nthe Casimir-Polder interaction energy of the cone with a polarizable particle.\nWe introduce this formalism by first reviewing the analogous approach for a\nperfectly conducting wedge, and then demonstrate the calculation through\nnumerical evaluation of the resulting integrals.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:15:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Graham","Noah",""]]}
{"id":"2308.11870","submitter":"Zhihao Wang","authors":"Shixing Huang, Zhihao Wang, Junyuan Ouyang, Haoyao Chen","title":"Multi-object Detection, Tracking and Prediction in Rugged Dynamic\n  Environments","comments":"6 Pages, 8 figures, submitted to ROBIO2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-object tracking (MOT) has important applications in monitoring,\nlogistics, and other fields. This paper develops a real-time multi-object\ntracking and prediction system in rugged environments. A 3D object detection\nalgorithm based on Lidar-camera fusion is designed to detect the target\nobjects. Based on the Hungarian algorithm, this paper designs a 3D multi-object\ntracking algorithm with an adaptive threshold to realize the stable matching\nand tracking of the objects. We combine Memory Augmented Neural Networks (MANN)\nand Kalman filter to achieve 3D trajectory prediction on rugged terrains.\nBesides, we realize a new dynamic SLAM by using the results of multi-object\ntracking to remove dynamic points for better SLAM performance and static map.\nTo verify the effectiveness of the proposed multi-object tracking and\nprediction system, several simulations and physical experiments are conducted.\nThe results show that the proposed system can track dynamic objects and provide\nfuture trajectory and a more clean static map in real-time.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:20:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Shixing",""],["Wang","Zhihao",""],["Ouyang","Junyuan",""],["Chen","Haoyao",""]]}
{"id":"2308.11871","submitter":"Wajid Mannan Dr","authors":"Wajid H. Mannan","title":"Homotopy types of truncated projective resolutions","comments":"Paper, published in peer-reviewed journal in 2007","journal-ref":"Homology, Homotopy and Applications Vol. 9 (2007), No. 2, pp.\n  445-449","doi":"10.4310/HHA.2007.v9.n2.a16","report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We work over an arbitrary ring R. Given two truncated projective resolutions\nof equal length for the same module we consider their underlying chain\ncomplexes. We show they may be stabilized by projective modules to obtain a\npair of complexes of the same homotopy type.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:23:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mannan","Wajid H.",""]]}
{"id":"2308.11872","submitter":"Amir Sarlak","authors":"Hassan Shabani-Solt and Amir Sarlak","title":"On the rational parametric solution of diagonal quartic varieties","comments":"To appear in Mathematica Slovaca","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we will exhibit a rational parametric solution for the\nDiophantine equations of diagonal quartic varieties. Our approach is based on\nutilizing the Calabi-Yau varieties including elliptic curves and diagonal\nquartic surfaces.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:31:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shabani-Solt","Hassan",""],["Sarlak","Amir",""]]}
{"id":"2308.11873","submitter":"Hammond Pearce","authors":"Andrew Taylor and Alexandra Vassar and Jake Renzella and Hammond\n  Pearce","title":"Integrating Large Language Models into the Debugging C Compiler for\n  generating contextual error explanations","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.LG cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a method for Large Language Models (LLM) to produce\nenhanced compiler error explanations, in simple language, within our Debugging\nC Compiler (DCC). It is well documented that compiler error messages have been\nknown to present a barrier for novices learning how to program. Although our\ninitial use of DCC in introductory programming (CS1) has been instrumental in\nteaching C to novice programmers by providing safeguards to commonly occurring\nerrors and translating the usually cryptic compiler error messages at both\ncompile- and run-time, we proposed that incorporating LLM-generated\nexplanations would further enhance the learning experience for novice\nprogrammers. Through an expert evaluation, we observed that LLM-generated\nexplanations for compiler errors were conceptually accurate in 90% of\ncompile-time errors, and 75% of run-time errors. Additionally, the new DCC-help\ntool has been increasingly adopted by students, with an average of 1047 unique\nruns per week, demonstrating a promising initial assessment of using LLMs to\ncomplement compiler output to enhance programming education for beginners. We\nrelease our tool as open-source to the community.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:36:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Taylor","Andrew",""],["Vassar","Alexandra",""],["Renzella","Jake",""],["Pearce","Hammond",""]]}
{"id":"2308.11874","submitter":"Pan Du","authors":"Pan Du, Suyun Zhao, Zisen Sheng, Cuiping Li, Hong Chen","title":"Semi-Supervised Learning via Weight-aware Distillation under Class\n  Distribution Mismatch","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semi-Supervised Learning (SSL) under class distribution mismatch aims to\ntackle a challenging problem wherein unlabeled data contain lots of unknown\ncategories unseen in the labeled ones. In such mismatch scenarios, traditional\nSSL suffers severe performance damage due to the harmful invasion of the\ninstances with unknown categories into the target classifier. In this study, by\nstrict mathematical reasoning, we reveal that the SSL error under class\ndistribution mismatch is composed of pseudo-labeling error and invasion error,\nboth of which jointly bound the SSL population risk. To alleviate the SSL\nerror, we propose a robust SSL framework called Weight-Aware Distillation (WAD)\nthat, by weights, selectively transfers knowledge beneficial to the target task\nfrom unsupervised contrastive representation to the target classifier.\nSpecifically, WAD captures adaptive weights and high-quality pseudo labels to\ntarget instances by exploring point mutual information (PMI) in representation\nspace to maximize the role of unlabeled data and filter unknown categories.\nTheoretically, we prove that WAD has a tight upper bound of population risk\nunder class distribution mismatch. Experimentally, extensive results\ndemonstrate that WAD outperforms five state-of-the-art SSL approaches and one\nstandard baseline on two benchmark datasets, CIFAR10 and CIFAR100, and an\nartificial cross-dataset. The code is available at\nhttps://github.com/RUC-DWBI-ML/research/tree/main/WAD-master.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:37:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Du","Pan",""],["Zhao","Suyun",""],["Sheng","Zisen",""],["Li","Cuiping",""],["Chen","Hong",""]]}
{"id":"2308.11875","submitter":"Zhiheng Li","authors":"Zhiheng Li, Yu Lin, Yubo Cui, Shuo Li, Zheng Fang","title":"Motion-to-Matching: A Mixed Paradigm for 3D Single Object Tracking","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D single object tracking with LiDAR points is an important task in the\ncomputer vision field. Previous methods usually adopt the matching-based or\nmotion-centric paradigms to estimate the current target status. However, the\nformer is sensitive to the similar distractors and the sparseness of point\ncloud due to relying on appearance matching, while the latter usually focuses\non short-term motion clues (eg. two frames) and ignores the long-term motion\npattern of target. To address these issues, we propose a mixed paradigm with\ntwo stages, named MTM-Tracker, which combines motion modeling with feature\nmatching into a single network. Specifically, in the first stage, we exploit\nthe continuous historical boxes as motion prior and propose an encoder-decoder\nstructure to locate target coarsely. Then, in the second stage, we introduce a\nfeature interaction module to extract motion-aware features from consecutive\npoint clouds and match them to refine target movement as well as regress other\ntarget states. Extensive experiments validate that our paradigm achieves\ncompetitive performance on large-scale datasets (70.9% in KITTI and 51.70% in\nNuScenes). The code will be open soon at\nhttps://github.com/LeoZhiheng/MTM-Tracker.git.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:40:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Zhiheng",""],["Lin","Yu",""],["Cui","Yubo",""],["Li","Shuo",""],["Fang","Zheng",""]]}
{"id":"2308.11876","submitter":"Matthew Tam","authors":"Yura Malitsky and Matthew K. Tam","title":"A First-Order Algorithm for Decentralised Min-Max Problems","comments":"15 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we consider a connected network of finitely many agents working\ncooperatively to solve a min-max problem with convex-concave structure. We\npropose a decentralised first-order algorithm which can be viewed as a\nnon-trivial combination of two algorithms: PG-EXTRA for decentralised\nminimisation problems and the forward reflected backward method for\n(non-distributed) min-max problems. In each iteration of our algorithm, each\nagent computes the gradient of the smooth component of its local objective\nfunction as well as the proximal operator of its nonsmooth component, following\nby a round of communication with its neighbours. Our analysis shows that the\nsequence generated by the method converges under standard assumptions with\nnon-decaying stepsize.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:45:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Malitsky","Yura",""],["Tam","Matthew K.",""]]}
{"id":"2308.11877","submitter":"Yash Patel","authors":"Yash Patel, Tirth Shah, Mrinal Kanti Dhar, Taiyu Zhang, Jeffrey\n  Niezgoda, Sandeep Gopalakrishnan, and Zeyun Yu","title":"Integrated Image and Location Analysis for Wound Classification: A Deep\n  Learning Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The global burden of acute and chronic wounds presents a compelling case for\nenhancing wound classification methods, a vital step in diagnosing and\ndetermining optimal treatments. Recognizing this need, we introduce an\ninnovative multi-modal network based on a deep convolutional neural network for\ncategorizing wounds into four categories: diabetic, pressure, surgical, and\nvenous ulcers. Our multi-modal network uses wound images and their\ncorresponding body locations for more precise classification. A unique aspect\nof our methodology is incorporating a body map system that facilitates accurate\nwound location tagging, improving upon traditional wound image classification\ntechniques. A distinctive feature of our approach is the integration of models\nsuch as VGG16, ResNet152, and EfficientNet within a novel architecture. This\narchitecture includes elements like spatial and channel-wise\nSqueeze-and-Excitation modules, Axial Attention, and an Adaptive Gated\nMulti-Layer Perceptron, providing a robust foundation for classification. Our\nmulti-modal network was trained and evaluated on two distinct datasets\ncomprising relevant images and corresponding location information. Notably, our\nproposed network outperformed traditional methods, reaching an accuracy range\nof 74.79% to 100% for Region of Interest (ROI) without location\nclassifications, 73.98% to 100% for ROI with location classifications, and\n78.10% to 100% for whole image classifications. This marks a significant\nenhancement over previously reported performance metrics in the literature. Our\nresults indicate the potential of our multi-modal network as an effective\ndecision-support tool for wound image classification, paving the way for its\napplication in various clinical contexts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:49:22 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 03:38:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Patel","Yash",""],["Shah","Tirth",""],["Dhar","Mrinal Kanti",""],["Zhang","Taiyu",""],["Niezgoda","Jeffrey",""],["Gopalakrishnan","Sandeep",""],["Yu","Zeyun",""]]}
{"id":"2308.11878","submitter":"Vinicius Carid\\'a","authors":"Celio Larcher, Marcos Piau, Paulo Finardi, Pedro Gengo, Piero\n  Esposito, Vinicius Carid\\'a","title":"Cabrita: closing the gap for foreign languages","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The strategy of training the model from scratch in a specific language or\ndomain serves two essential purposes: i) enhancing performance in the\nparticular linguistic or domain context, and ii) ensuring effective\ntokenization. The main limitation inherent to this approach lies in the\nassociated cost, which can reach six to seven-digit dollar values, depending on\nthe model size and the number of parameters involved.\n  The main solution to overcome the cost challenge is to rely on available\npre-trained models, which, despite recent advancements such as the LLaMA and\nLLaMA-2 models, still demonstrate inefficiency for certain specific domain\nproblems or prove ineffective in scenarios involving conversational memory\nresources, given the large number of tokens required to represent text.\n  To overcome this issue, we present a methodology named Cabrita, which, as our\nresearch demonstrates, successfully addresses the performance and efficient\ntokenization problem, all at an affordable cost. We believe that this\nmethodology can be applied to any transformer-like architecture model. To\nvalidate the study, we conducted continuous pre-training exclusively using\nPortuguese text on a 3-billion-parameter model known as OpenLLaMA, resulting in\na model named openCabrita 3B. The openCabrita 3B also features a new tokenizer\nthat results in a significant reduction in the number of tokens required to\nrepresent the text. In our assessment, for few-shot learning tasks, we achieved\nsimilar results with this 3B model compared to a traditional continuous\npre-training approach as well as to 7B models English pre-trained models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:49:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Larcher","Celio",""],["Piau","Marcos",""],["Finardi","Paulo",""],["Gengo","Pedro",""],["Esposito","Piero",""],["Carid\u00e1","Vinicius",""]]}
{"id":"2308.11879","submitter":"Wei-Hong Liang","authors":"Hai-Peng~Li, Gong-Jie~Zhang, Wei-Hong~Liang, E.~Oset","title":"Theoretical interpretation of the $\\Xi(1620)$ and $\\Xi(1690)$ resonances\n  seen in $\\Xi_c^+ \\to \\Xi^- \\pi^+ \\pi^+$ decay","comments":"15 pages, 8 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the Belle reaction $\\Xi_c^+ \\to \\Xi^- \\pi^+ \\pi^+$ reaction looking\nat the mass distribution of $\\pi^+ \\Xi$, where clear signals for the\n$\\Xi(1620)$ and $\\Xi(1690)$ resonances are seen. These two resonances are\ngenerated dynamically from the interaction in coupled channels of $\\pi \\Xi,\n\\bar K \\Lambda, \\bar K \\Sigma$ and $\\eta \\Xi$ within the chiral unitary\napproach. Yet, the weak decay process at the quark level, together with the\nhadronization to produce pairs of mesons, does not produce the $\\pi \\pi \\Xi$\nfinal state. In order to produce this state one must make transitions from the\n$\\bar K \\Lambda, \\bar K \\Sigma$ and $\\eta \\Xi$ components to $\\pi \\Xi$, and\nthis interaction is what produces the resonances. So, the reaction offers a\ngood test for the molecular picture of these resonances. Adding the\ncontribution of the $\\Xi^*(1530)$ and some background we are able to get a good\nreproduction of the mass distribution showing the signatures of the two\nresonances as found in the experiment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:54:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hai-Peng~Li","",""],["Gong-Jie~Zhang","",""],["Wei-Hong~Liang","",""],["~Oset","E.",""]]}
{"id":"2308.11880","submitter":"Cody Simons","authors":"Cody Simons, Dripta S. Raychaudhuri, Sk Miraj Ahmed, Suya You,\n  Konstantinos Karydis, Amit K. Roy-Chowdhury","title":"SUMMIT: Source-Free Adaptation of Uni-Modal Models to Multi-Modal\n  Targets","comments":"12 pages, 5 figures, 9 tables, ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scene understanding using multi-modal data is necessary in many applications,\ne.g., autonomous navigation. To achieve this in a variety of situations,\nexisting models must be able to adapt to shifting data distributions without\narduous data annotation. Current approaches assume that the source data is\navailable during adaptation and that the source consists of paired multi-modal\ndata. Both these assumptions may be problematic for many applications. Source\ndata may not be available due to privacy, security, or economic concerns.\nAssuming the existence of paired multi-modal data for training also entails\nsignificant data collection costs and fails to take advantage of widely\navailable freely distributed pre-trained uni-modal models. In this work, we\nrelax both of these assumptions by addressing the problem of adapting a set of\nmodels trained independently on uni-modal data to a target domain consisting of\nunlabeled multi-modal data, without having access to the original source\ndataset. Our proposed approach solves this problem through a switching\nframework which automatically chooses between two complementary methods of\ncross-modal pseudo-label fusion -- agreement filtering and entropy weighting --\nbased on the estimated domain gap. We demonstrate our work on the semantic\nsegmentation problem. Experiments across seven challenging adaptation scenarios\nverify the efficacy of our approach, achieving results comparable to, and in\nsome cases outperforming, methods which assume access to source data. Our\nmethod achieves an improvement in mIoU of up to 12% over competing baselines.\nOur code is publicly available at https://github.com/csimo005/SUMMIT.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:57:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Simons","Cody",""],["Raychaudhuri","Dripta S.",""],["Ahmed","Sk Miraj",""],["You","Suya",""],["Karydis","Konstantinos",""],["Roy-Chowdhury","Amit K.",""]]}
{"id":"2308.11881","submitter":"Ali Haisam Muhammad Rafid","authors":"Ali Haisam Muhammad Rafid, Adrian Sandu","title":"Adversarial Training Using Feedback Loops","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep neural networks (DNN) have found wide applicability in numerous fields\ndue to their ability to accurately learn very complex input-output relations.\nDespite their accuracy and extensive use, DNNs are highly susceptible to\nadversarial attacks due to limited generalizability. For future progress in the\nfield, it is essential to build DNNs that are robust to any kind of\nperturbations to the data points. In the past, many techniques have been\nproposed to robustify DNNs using first-order derivative information of the\nnetwork.\n  This paper proposes a new robustification approach based on control theory. A\nneural network architecture that incorporates feedback control, named Feedback\nNeural Networks, is proposed. The controller is itself a neural network, which\nis trained using regular and adversarial data such as to stabilize the system\noutputs. The novel adversarial training approach based on the feedback control\narchitecture is called Feedback Looped Adversarial Training (FLAT). Numerical\nresults on standard test problems empirically show that our FLAT method is more\neffective than the state-of-the-art to guard against adversarial attacks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:58:02 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 03:16:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rafid","Ali Haisam Muhammad",""],["Sandu","Adrian",""]]}
{"id":"2308.11882","submitter":"Ying Chen","authors":"Ying Chen, Xi Liu, Zhenhua Chai, Baochang Shi","title":"The macroscopic finite-difference scheme and modified equations of the\n  general propagation multiple-relaxation-time lattice Boltzmann model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we first present the general propagation\nmultiple-relaxation-time lattice Boltzmann (GPMRT-LB) model and obtain the\ncorresponding macroscopic finite-difference (GPMFD) scheme on conservative\nmoments. Then based on the Maxwell iteration method, we conduct the analysis on\nthe truncation errors and modified equations (MEs) of the GPMRT-LB model and\nGPMFD scheme at both diffusive and acoustic scalings. For the nonlinear\nanisotropic convection-diffusion equation (NACDE) and Navier-Stokes equations\n(NSEs), we also derive the first- and second-order MEs of the GPMRT-LB model\nand GPMFD scheme. In particular, for the one-dimensional convection-diffusion\nequation (CDE) with the constant velocity and diffusion coefficient, we can\ndevelop a fourth-order GPMRT-LB (F-GPMRT-LB) model and the corresponding\nfourth-order GPMFD (F-GPMFD) scheme at the diffusive scaling. Finally, two\nbenchmark problems, Gauss hill problem and Poiseuille flow in two-dimensional\nspace, are used to test the GPMRT-LB model and GPMFD scheme, and it is found\nthat the numerical results are not only in good agreement with corresponding\nanalytical solutions, but also have a second-order convergence rate in space.\nAdditionally, a numerical study on one-dimensional CDE also demonstrates that\nthe F-GPMRT-LB model and F-GPMFD scheme can achieve a fourth-order accuracy in\nspace, which is consistent with our theoretical analysis.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 02:59:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Ying",""],["Liu","Xi",""],["Chai","Zhenhua",""],["Shi","Baochang",""]]}
{"id":"2308.11883","submitter":"Shao-Wen Wei","authors":"Shao-Wen Wei, Yu-Xiao Liu","title":"Aschenbach effect and circular orbits in static and spherically\n  symmetric black hole backgrounds","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Aschenbach effect, the increasing behavior of the angular velocity of a\ntimelike circular orbit with its radius coordinate, is found to extensively\nexist in rapidly spinning black holes to a zero-angular-momentum observer. It\nalso has potential observation in the high-frequency quasi-periodic\noscillations of X-ray flux. However, observing such effect remains to be a\nchallenge in static and spherically symmetric black hole backgrounds. In this\npaper, we mainly focus on such issue. Starting with the geodesics, we\nanalytically study the underlying properties of the timelike circular orbits,\nand show the conditions under which the Aschenbach effect survives. We then\napply it to three characteristic black holes exhibiting different features. The\nresults state that this effect is absent for both the Schwarzschild and\nReissner-Nordstr\\\"{o}m black holes. While, for the dyonic black hole in\nquasi-topological electromagnetics, there indeed exists the Aschenbach effect.\nThis provides a first example that such effect exists in a non-spinning black\nhole background. Moreover, it also uncovers an intriguing property for\nunderstanding the black holes in nonlinear electrodynamics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:02:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wei","Shao-Wen",""],["Liu","Yu-Xiao",""]]}
{"id":"2308.11884","submitter":"Fabian Suchanek","authors":"Fabian Suchanek, Mehwish Alam, Thomas Bonald, Pierre-Henri Paris,\n  Jules Soria","title":"Integrating the Wikidata Taxonomy into YAGO","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wikidata is one of the largest public general-purpose Knowledge Bases (KBs).\nYet, due to its collaborative nature, its schema and taxonomy have become\nconvoluted. For the YAGO 4 KB, we combined Wikidata with the ontology from\nSchema.org, which reduced and cleaned up the taxonomy and constraints and made\nit possible to run automated reasoners on the data. However, it also cut away\nlarge parts of the Wikidata taxonomy. In this paper, we present our effort to\nmerge the entire Wikidata taxonomy into the YAGO KB as much as possible. We pay\nparticular attention to logical constraints and a careful distinction of\nclasses and instances. Our work creates YAGO 4.5, which adds a rich layer of\ninformative classes to YAGO, while at the same time keeping the KB logically\nconsistent.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:03:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Suchanek","Fabian",""],["Alam","Mehwish",""],["Bonald","Thomas",""],["Paris","Pierre-Henri",""],["Soria","Jules",""]]}
{"id":"2308.11885","submitter":"Justin Feng","authors":"Justin C. Feng","title":"Smooth metrics can hide thin shells","comments":"2 pages, Class. Quantum Grav. in press","journal-ref":null,"doi":"10.1088/1361-6382/acf2de","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note, I consider a class of metric tensors with smooth components\nthat naively appear to describe dynamical wormholes with vanishing spacetime\ncurvature. I point out that the smoothness of the metric tensor components is\ndeceptive, and that in general relativity, such metrics must be sourced by\nexotic thin shells.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:04:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Feng","Justin C.",""]]}
{"id":"2308.11886","submitter":"Shao-Wen Wei","authors":"Shao-Wen Wei, Yu-Xiao Liu","title":"Thermodynamic Nature of Black Holes in Coexistence Region","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Studying the system state of coexistence regions has important applications\nin revealing detailed microscopic interactions between different phases.\nHowever, the thermodynamic nature in the coexistence black hole regions has\nbeen neglected in previous studies. In this work, we introduce two new ratio\nparameters to investigate these coexistence states. The first parameter\nmeasures the ratio of the horizon radii of the statured coexistence small and\nlarge black holes. Of particular interest, we demonstrate that it can serve as\nan order parameter to characterize the first-order phase transition.\nFurthermore, combining with the ratio of the ratio of the small black hole\nmolecule number to the total molecule number, each black hole state in the\ncoexistence region is uniquely determined via these two introduced parameters\nbounded between 0 and 1. These results are quite significant in analytical\nstudy of black hole phase transition and uncover the thermodynamical\nmicroscopic nature of black hole in the coexistence regions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:19:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wei","Shao-Wen",""],["Liu","Yu-Xiao",""]]}
{"id":"2308.11887","submitter":"Haojia Lin","authors":"Haojia Lin, Yongdong Luo, Xiawu Zheng, Lijiang Li, Fei Chao, Taisong\n  Jin, Donghao Luo, Chengjie Wang, Yan Wang, Liujuan Cao","title":"A Unified Framework for 3D Point Cloud Visual Grounding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D point cloud visual grounding plays a critical role in 3D scene\ncomprehension, encompassing 3D referring expression comprehension (3DREC) and\nsegmentation (3DRES). We argue that 3DREC and 3DRES should be unified in one\nframework, which is also a natural progression in the community. To explain,\n3DREC can help 3DRES locate the referent, while 3DRES can also facilitate 3DREC\nvia more finegrained language-visual alignment. To achieve this, this paper\ntakes the initiative step to integrate 3DREC and 3DRES into a unified\nframework, termed 3D Referring Transformer (3DRefTR). Its key idea is to build\nupon a mature 3DREC model and leverage ready query embeddings and visual tokens\nfrom the 3DREC model to construct a dedicated mask branch. Specially, we\npropose Superpoint Mask Branch, which serves a dual purpose: i) By leveraging\nthe heterogeneous CPU-GPU parallelism, while the GPU is occupied generating\nvisual tokens, the CPU concurrently produces superpoints, equivalently\naccomplishing the upsampling computation; ii) By harnessing on the inherent\nassociation between the superpoints and point cloud, it eliminates the heavy\ncomputational overhead on the high-resolution visual features for upsampling.\nThis elegant design enables 3DRefTR to achieve both well-performing 3DRES and\n3DREC capacities with only a 6% additional latency compared to the original\n3DREC model. Empirical evaluations affirm the superiority of 3DRefTR.\nSpecifically, on the ScanRefer dataset, 3DRefTR surpasses the state-of-the-art\n3DRES method by 12.43% in mIoU and improves upon the SOTA 3DREC method by 0.6%\nAcc@0.25IoU.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:20:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lin","Haojia",""],["Luo","Yongdong",""],["Zheng","Xiawu",""],["Li","Lijiang",""],["Chao","Fei",""],["Jin","Taisong",""],["Luo","Donghao",""],["Wang","Chengjie",""],["Wang","Yan",""],["Cao","Liujuan",""]]}
{"id":"2308.11888","submitter":"Suk Sien Tie","authors":"Suk Sien Tie, Joseph F. Hennawi, Feige Wang, Silvia Onorato, Jinyi\n  Yang, Eduardo Ba\\~nados, Frederick B. Davies, Jose O\\~norbe","title":"First measurement of the Mg II forest correlation function in the Epoch\n  of Reionization","comments":"Submitted to MNRAS; 23 pages, 21 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the process of producing the roughly three ionizing photons per atom\nrequired to reionize the IGM, the same massive stars explode and eject metals\ninto their surroundings. While the overly sensitive Lya transition makes\nGunn-Peterson absorption of background quasar light an ineffective probe of\nreionization at z > 6, strong low-ionization transitions like the MgII doublet\nwill give rise to a detectable \"metal-line forest\", if metals pollute the\nneutral IGM. We measure the auto-correlation of the MgII forest transmission\nusing a sample of ten ground based z >= 6.80 quasar spectra probing the\nredshift range 5.96 < z_MgII < 7.42 (z_MgII,median = 6.47). The correlation\nfunction exhibits strong small-scale clustering and a pronounced peak at the\ndoublet velocity (768 km/s) arising from strong absorbers in the CGM of\ngalaxies. After these strong absorbers are identified and masked the signal is\nconsistent with noise. Our measurements are compared to a suite of models\ngenerated by combining a large hydrodynamical simulation with a semi-numerical\nreionization topology, assuming a simple uniform enrichment model. We obtain a\n95% credibility upper limit of [Mg/H] < -3.73 at z_MgII,median = 6.47, assuming\nuninformative priors on [Mg/H] and the IGM neutral fraction x_HI. Splitting the\ndata into low-z (5.96 < z_MgII < 6.47; z_MgII,median = 6.235) and high-z (6.47\n< z_MgII < 7.42; z_MgII,median = 6.72) subsamples again yields null-detections\nand 95% upper limits of [Mg/H] < -3.75 and [Mg/H] < -3.45, respectively. These\nfirst measurements set the stage for an approved JWST Cycle 2 program (GO 3526)\ntargeting a similar number of quasars that will be an order of magnitude more\nsensitive, making the Mgii forest an emerging powerful tool to deliver\nprecision constraints on the reionization and enrichment history of the\nUniverse.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:22:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tie","Suk Sien",""],["Hennawi","Joseph F.",""],["Wang","Feige",""],["Onorato","Silvia",""],["Yang","Jinyi",""],["Ba\u00f1ados","Eduardo",""],["Davies","Frederick B.",""],["O\u00f1orbe","Jose",""]]}
{"id":"2308.11889","submitter":"Jos\\'e Luis Ponte Bejarano Jos\\'e Luis","authors":"Alexis Rodriguez Carranza, Jose Luis Ponte Bejarano and Juan Carlos\n  Ponte Bejarano","title":"Internal exact controllability for nagdhi shell","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work we study the exponential stability of the energy associated with\na Naghdi shell model with localized internal dissipation. Using several tools\nfrom Riemannian Geometry we show the well possedness of the model, via\nsemigroup theory, and obtain observability inequalities which allows to prove\nthe exponential decay of the total energy. As a consequence then we use Russell\nPrinciple for obtain exact controllability.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:23:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Carranza","Alexis Rodriguez",""],["Bejarano","Jose Luis Ponte",""],["Bejarano","Juan Carlos Ponte",""]]}
{"id":"2308.11890","submitter":"Ziqi Chen","authors":"Ziqi Chen, Bo Peng, Srinivasan Parthasarathy, Xia Ning","title":"Shape-conditioned 3D Molecule Generation via Equivariant Diffusion\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.BM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Ligand-based drug design aims to identify novel drug candidates of similar\nshapes with known active molecules. In this paper, we formulated an in silico\nshape-conditioned molecule generation problem to generate 3D molecule\nstructures conditioned on the shape of a given molecule. To address this\nproblem, we developed a translation- and rotation-equivariant shape-guided\ngenerative model ShapeMol. ShapeMol consists of an equivariant shape encoder\nthat maps molecular surface shapes into latent embeddings, and an equivariant\ndiffusion model that generates 3D molecules based on these embeddings.\nExperimental results show that ShapeMol can generate novel, diverse, drug-like\nmolecules that retain 3D molecular shapes similar to the given shape condition.\nThese results demonstrate the potential of ShapeMol in designing drug\ncandidates of desired 3D shapes binding to protein target pockets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:23:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Ziqi",""],["Peng","Bo",""],["Parthasarathy","Srinivasan",""],["Ning","Xia",""]]}
{"id":"2308.11891","submitter":"Hengyuan Zhang","authors":"Hengyuan Zhang, Peng Chang, Zongcheng Ji","title":"Bridging the Gap: Deciphering Tabular Data Using Large Language Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the realm of natural language processing, the understanding of tabular\ndata has perpetually stood as a focal point of scholarly inquiry. The emergence\nof expansive language models, exemplified by the likes of ChatGPT, has ushered\nin a wave of endeavors wherein researchers aim to harness these models for\ntasks related to table-based question answering. Central to our investigative\npursuits is the elucidation of methodologies that amplify the aptitude of such\nlarge language models in discerning both the structural intricacies and\ninherent content of tables, ultimately facilitating their capacity to provide\ninformed responses to pertinent queries. To this end, we have architected a\ndistinctive module dedicated to the serialization of tables for seamless\nintegration with expansive language models. Additionally, we've instituted a\ncorrective mechanism within the model to rectify potential inaccuracies.\nExperimental results indicate that, although our proposed method trails the\nSOTA by approximately 11.7% in overall metrics, it surpasses the SOTA by about\n1.2% in tests on specific datasets. This research marks the first application\nof large language models to table-based question answering tasks, enhancing the\nmodel's comprehension of both table structures and content.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:38:21 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 14:07:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Hengyuan",""],["Chang","Peng",""],["Ji","Zongcheng",""]]}
{"id":"2308.11892","submitter":"Matthias Cremon","authors":"Matthias A. Cremon, Jacques Franc, Francois P. Hamon","title":"Constrained Pressure-Temperature Residual (CPTR) Preconditioner\n  Performance for Large-Scale Thermal CO2 Injection Simulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work studies the performance of a novel preconditioner, designed for\nthermal reservoir simulation cases and recently introduced in Roy et al. (2020)\nand Cremon et al. (2020), on large-scale thermal CO2 injection cases. For\nCarbon Capture and Sequestration (CCS) projects, injecting CO2 under\nsupercritical conditions is typically tens of degrees colder than the reservoir\ntemperature. Thermal effects can have a significant impact on the simulation\nresults, but they also add many challenges for the solvers. More specifically,\nthe usual combination of an iterative linear solver (such as GMRES) and the\nConstrained Pressure Residual (CPR) physics-based block-preconditioner is known\nto perform rather poorly or fail to converge when thermal effects play a\nsignificant role. The Constrained Pressure-Temperature Residual (CPTR)\npreconditioner retains the 2x2 block structure (elliptic/hyperbolic) of CPR but\nincludes the temperature in the elliptic subsystem. The elliptic subsystem is\nnow formed by two equations, and is dealt with by the system-solver of\nBoomerAMG (from the HYPRE library). Then a global smoother, ILU(0), is applied\nto the full system to handle the local, hyperbolic temperature fronts. We\nimplemented CPTR in the multi-physics solver GEOS and present results on\nvarious large-scale thermal CCS simulation cases, including both Cartesian and\nfully unstructured meshes, up to tens of millions of degrees of freedom. The\nCPTR preconditioner severely reduces the number of GMRES iterations and the\nruntime, with cases timing out in 24h with CPR now requiring a few hours with\nCPTR. We present strong scaling results using hundreds of CPU cores for\nmultiple cases, and show close to linear scaling. CPTR is also virtually\ninsensitive to the thermal Peclet number (which compares advection and\ndiffusion effects) and is suitable to any thermal regime.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:40:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cremon","Matthias A.",""],["Franc","Jacques",""],["Hamon","Francois P.",""]]}
{"id":"2308.11893","submitter":"Lang Liu","authors":"Lang Liu and Yongle Yu","title":"Expanding proton dripline by employing a number of muons","comments":"15 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Through mean-field calculations, we demonstrate that, in a large $Z$ nucleus\nbinding multiple muons, these heavy leptons localize within a few dozen\nfemtometers of the nucleus. The mutual Coulomb interactions between the muons\nand the protons can lead to a substantial decrease in proton chemical\npotential, surpassing 1 MeV. These findings allow for expanding the\nproton-dripline on the nuclear chart in principle, suggesting the possible\nproduction of nuclei with Z around 120.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:40:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Lang",""],["Yu","Yongle",""]]}
{"id":"2308.11894","submitter":"Ningfei Wang","authors":"Ningfei Wang, Yunpeng Luo, Takami Sato, Kaidi Xu, Qi Alfred Chen","title":"Does Physical Adversarial Example Really Matter to Autonomous Driving?\n  Towards System-Level Effect of Adversarial Object Evasion Attack","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In autonomous driving (AD), accurate perception is indispensable to achieving\nsafe and secure driving. Due to its safety-criticality, the security of AD\nperception has been widely studied. Among different attacks on AD perception,\nthe physical adversarial object evasion attacks are especially severe. However,\nwe find that all existing literature only evaluates their attack effect at the\ntargeted AI component level but not at the system level, i.e., with the entire\nsystem semantics and context such as the full AD pipeline. Thereby, this raises\na critical research question: can these existing researches effectively achieve\nsystem-level attack effects (e.g., traffic rule violations) in the real-world\nAD context? In this work, we conduct the first measurement study on whether and\nhow effectively the existing designs can lead to system-level effects,\nespecially for the STOP sign-evasion attacks due to their popularity and\nseverity. Our evaluation results show that all the representative prior works\ncannot achieve any system-level effects. We observe two design limitations in\nthe prior works: 1) physical model-inconsistent object size distribution in\npixel sampling and 2) lack of vehicle plant model and AD system model\nconsideration. Then, we propose SysAdv, a novel system-driven attack design in\nthe AD context and our evaluation results show that the system-level effects\ncan be significantly improved, i.e., the violation rate increases by around\n70%.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:40:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Ningfei",""],["Luo","Yunpeng",""],["Sato","Takami",""],["Xu","Kaidi",""],["Chen","Qi Alfred",""]]}
{"id":"2308.11895","submitter":"Mutian Wang","authors":"Mu-Tian Wang, Gregory J. Herczeg, Hui-Gen Liu, Min Fang, Doug\n  Johnstone, Ho-Gyu Lee, Frederick M. Walter, Franz-Josef Hambsch, Carlos\n  Contreras Pena, Jeong-Eun Lee, Mervyn Millward, Andrew Pearce, Berto Monard\n  and Lihang Zhou","title":"The Accretion History of EX Lup: A Century of Bursts, Outbursts, and\n  Quiescence","comments":"Accepted by ApJ; 29 pages,19 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  EX Lup is the archetype for the class of young stars that undergoes repeated\naccretion outbursts of $\\sim 5$ mag at optical wavelengths and that last for\nmonths. Despite extensive monitoring that dates back 130 years, the accretion\nhistory of EX Lup remains mostly qualitative and has large uncertainties. We\nassess historical accretion rates of EX Lup by applying correlations between\noptical brightness and accretion, developed on multi-band magnitude photometry\nof the $\\sim 2$ mag optical burst in 2022. Two distinct classes of bursts\noccur: major outbursts ($\\Delta V\\sim5$ mag) have year-long durations, are\nrare, reach accretion rates of $\\dot{M}_{\\rm acc}\\sim10^{-7}~M_\\odot~{\\rm\nyr^{-1}}$ at peak, and have a total accreted mass of around 0.1 Earth masses.\nThe characteristic bursts ($\\Delta V\\sim2$ mag) have durations of $\\sim 2-3$\nmonths, are more common, reach accretion rates of $\\dot{M}_{\\rm\nacc}\\sim10^{-8}~M_\\odot~{\\rm yr^{-1}}$ at peak, and have a total accreted mass\nof around $10^{-3}$ Earth masses. The distribution of total accreted mass in\nthe full set of bursts is poorly described by a power law, which suggests\ndifferent driving causes behind the major outburst and characteristic bursts.\nThe total mass accreted during two classes of bursts is around two times the\nmasses accreted during quiescence. Our analysis of the light curves reveals a\ncolor-dependent time lag in the 2022 post-burst light curve, attributed to the\npresence of both hot and cool spots on the stellar surface.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:41:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Mu-Tian",""],["Herczeg","Gregory J.",""],["Liu","Hui-Gen",""],["Fang","Min",""],["Johnstone","Doug",""],["Lee","Ho-Gyu",""],["Walter","Frederick M.",""],["Hambsch","Franz-Josef",""],["Pena","Carlos Contreras",""],["Lee","Jeong-Eun",""],["Millward","Mervyn",""],["Pearce","Andrew",""],["Monard","Berto",""],["Zhou","Lihang",""]]}
{"id":"2308.11896","submitter":"Yeongnam Chae","authors":"Yeongnam Chae, Poulami Raha, Mijung Kim, Bjorn Stenger","title":"Age Prediction From Face Images Via Contrastive Learning","comments":"MVA2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a novel approach for accurately estimating age from face\nimages, which overcomes the challenge of collecting a large dataset of\nindividuals with the same identity at different ages. Instead, we leverage\nreadily available face datasets of different people at different ages and aim\nto extract age-related features using contrastive learning. Our method\nemphasizes these relevant features while suppressing identity-related features\nusing a combination of cosine similarity and triplet margin losses. We\ndemonstrate the effectiveness of our proposed approach by achieving\nstate-of-the-art performance on two public datasets, FG-NET and MORPH-II.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:43:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chae","Yeongnam",""],["Raha","Poulami",""],["Kim","Mijung",""],["Stenger","Bjorn",""]]}
{"id":"2308.11897","submitter":"Jos\\'e Antonio Riaza Valverde","authors":"Jos\\'e Antonio Riaza Valverde","title":"Tau Prolog: A Prolog interpreter for the Web","comments":"21 pages, 3 figures, under consideration in Theory and Practice of\n  Logic Programming (TPLP)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tau Prolog is a client-side Prolog interpreter fully implemented in\nJavaScript, which aims at implementing the ISO Prolog Standard. Tau Prolog has\nbeen developed to be used with either Node.js or a browser seamlessly, and\ntherefore, it has been developed following a non-blocking, callback-based\napproach to avoid blocking web browsers. Taking the best from JavaScript and\nProlog, Tau Prolog allows the programmer to handle browser events and\nmanipulate the Document Object Model (DOM) of a web using Prolog predicates. In\nthis paper we describe the architecture of Tau Prolog and its main packages for\ninteracting with the Web, and we present its programming environment. Under\nconsideration in Theory and Practice of Logic Programming (TPLP).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:45:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Valverde","Jos\u00e9 Antonio Riaza",""]]}
{"id":"2308.11898","submitter":"Han Gao","authors":"Han Gao, Huiyuan Luo, Fei Shen, Zhengtao Zhang","title":"Exploring the Optimization Objective of One-Class Classification for\n  Anomaly Detection","comments":"15 paegs, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One-class classification (OCC) is a longstanding method for anomaly\ndetection. With the powerful representation capability of the pre-trained\nbackbone, OCC methods have witnessed significant performance improvements.\nTypically, most of these OCC methods employ transfer learning to enhance the\ndiscriminative nature of the pre-trained backbone's features, thus achieving\nremarkable efficacy. While most current approaches emphasize feature transfer\nstrategies, we argue that the optimization objective space within OCC methods\ncould also be an underlying critical factor influencing performance. In this\nwork, we conducted a thorough investigation into the optimization objective of\nOCC. Through rigorous theoretical analysis and derivation, we unveil a key\ninsights: any space with the suitable norm can serve as an equivalent\nsubstitute for the hypersphere center, without relying on the distribution\nassumption of training samples. Further, we provide guidelines for determining\nthe feasible domain of norms for the OCC optimization objective. This novel\ninsight sparks a simple and data-agnostic deep one-class classification method.\nOur method is straightforward, with a single 1x1 convolutional layer as a\ntrainable projector and any space with suitable norm as the optimization\nobjective. Extensive experiments validate the reliability and efficacy of our\nfindings and the corresponding methodology, resulting in state-of-the-art\nperformance in both one-class classification and industrial vision anomaly\ndetection and segmentation tasks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:46:04 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 06:38:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gao","Han",""],["Luo","Huiyuan",""],["Shen","Fei",""],["Zhang","Zhengtao",""]]}
{"id":"2308.11899","submitter":"Rahmat Ullah","authors":"Andleeb Zahra, Muqaddar Abbas, Rahmat Ullah","title":"Amplification and Excitation of Surface Plasmon Polaritons via Four-Wave\n  Mixing Process","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We suggest a scheme for the excitation and amplification of surface plasmon\npolaritons (SPPs) along the interface between metal and semiconductor quantum\nwell (SQW), employing a four-wave mixing (FWM) process. The SQW consists of\nfour-level asymmetric double quantum wells that exhibit quantum interference\neffects, which leads to the coupler-free excitation of SPPs. In our proposed\nsystem, the inherent losses of SPPs are compensated by introducing gain through\nthe FWM process. This results in a significant enhancement in the propagation\nlength and large penetration depth of SPPs. We further analyze the effect of\ngain on the long-range and short-range SPPs and observe that the propagation\ndistance and lifetime of both types of SPPs are enhanced.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 03:55:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zahra","Andleeb",""],["Abbas","Muqaddar",""],["Ullah","Rahmat",""]]}
{"id":"2308.11900","submitter":"Benjamin Riggan","authors":"Kshitij Nikhal, Yujunrong Ma, Shuvra S. Bhattacharyya, Benjamin S.\n  Riggan","title":"HashReID: Dynamic Network with Binary Codes for Efficient Person\n  Re-identification","comments":"WACV 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Biometric applications, such as person re-identification (ReID), are often\ndeployed on energy constrained devices. While recent ReID methods prioritize\nhigh retrieval performance, they often come with large computational costs and\nhigh search time, rendering them less practical in real-world settings. In this\nwork, we propose an input-adaptive network with multiple exit blocks, that can\nterminate computation early if the retrieval is straightforward or noisy,\nsaving a lot of computation. To assess the complexity of the input, we\nintroduce a temporal-based classifier driven by a new training strategy.\nFurthermore, we adopt a binary hash code generation approach instead of relying\non continuous-valued features, which significantly improves the search process\nby a factor of 20. To ensure similarity preservation, we utilize a new ranking\nregularizer that bridges the gap between continuous and binary features.\nExtensive analysis of our proposed method is conducted on three datasets:\nMarket1501, MSMT17 (Multi-Scene Multi-Time), and the BGC1 (BRIAR Government\nCollection). Using our approach, more than 70% of the samples with compact hash\ncodes exit early on the Market1501 dataset, saving 80% of the networks\ncomputational cost and improving over other hash-based methods by 60%. These\nresults demonstrate a significant improvement over dynamic networks and\nshowcase comparable accuracy performance to conventional ReID methods. Code\nwill be made available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:01:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nikhal","Kshitij",""],["Ma","Yujunrong",""],["Bhattacharyya","Shuvra S.",""],["Riggan","Benjamin S.",""]]}
{"id":"2308.11901","submitter":"Geon Lee","authors":"Geon Lee, Sanghoon Lee, Dohyung Kim, Younghoon Shin, Yongsang Yoon,\n  Bumsub Ham","title":"Camera-Driven Representation Learning for Unsupervised Domain Adaptive\n  Person Re-identification","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel unsupervised domain adaption method for person\nre-identification (reID) that generalizes a model trained on a labeled source\ndomain to an unlabeled target domain. We introduce a camera-driven curriculum\nlearning (CaCL) framework that leverages camera labels of person images to\ntransfer knowledge from source to target domains progressively. To this end, we\ndivide target domain dataset into multiple subsets based on the camera labels,\nand initially train our model with a single subset (i.e., images captured by a\nsingle camera). We then gradually exploit more subsets for training, according\nto a curriculum sequence obtained with a camera-driven scheduling rule. The\nscheduler considers maximum mean discrepancies (MMD) between each subset and\nthe source domain dataset, such that the subset closer to the source domain is\nexploited earlier within the curriculum. For each curriculum sequence, we\ngenerate pseudo labels of person images in a target domain to train a reID\nmodel in a supervised way. We have observed that the pseudo labels are highly\nbiased toward cameras, suggesting that person images obtained from the same\ncamera are likely to have the same pseudo labels, even for different IDs. To\naddress the camera bias problem, we also introduce a camera-diversity (CD) loss\nencouraging person images of the same pseudo label, but captured across various\ncameras, to involve more for discriminative feature learning, providing person\nrepresentations robust to inter-camera variations. Experimental results on\nstandard benchmarks, including real-to-real and synthetic-to-real scenarios,\ndemonstrate the effectiveness of our framework.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:01:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lee","Geon",""],["Lee","Sanghoon",""],["Kim","Dohyung",""],["Shin","Younghoon",""],["Yoon","Yongsang",""],["Ham","Bumsub",""]]}
{"id":"2308.11902","submitter":"Joon-Young Lee","authors":"Adrit Rao, Joon-Young Lee, Oliver Aalami","title":"Studying the Impact of Augmentations on Medical Confidence Calibration","comments":"ICCV CVAMD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The clinical explainability of convolutional neural networks (CNN) heavily\nrelies on the joint interpretation of a model's predicted diagnostic label and\nassociated confidence. A highly certain or uncertain model can significantly\nimpact clinical decision-making. Thus, ensuring that confidence estimates\nreflect the true correctness likelihood for a prediction is essential. CNNs are\noften poorly calibrated and prone to overconfidence leading to improper\nmeasures of uncertainty. This creates the need for confidence calibration.\nHowever, accuracy and performance-based evaluations of CNNs are commonly used\nas the sole benchmark for medical tasks. Taking into consideration the risks\nassociated with miscalibration is of high importance. In recent years, modern\naugmentation techniques, which cut, mix, and combine images, have been\nintroduced. Such augmentations have benefited CNNs through regularization,\nrobustness to adversarial samples, and calibration. Standard augmentations\nbased on image scaling, rotating, and zooming, are widely leveraged in the\nmedical domain to combat the scarcity of data. In this paper, we evaluate the\neffects of three modern augmentation techniques, CutMix, MixUp, and CutOut on\nthe calibration and performance of CNNs for medical tasks. CutMix improved\ncalibration the most while CutOut often lowered the level of calibration.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:05:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rao","Adrit",""],["Lee","Joon-Young",""],["Aalami","Oliver",""]]}
{"id":"2308.11903","submitter":"Zhen Zhao","authors":"Zhen Zhao, Ye Liu, Meng Zhao, Di Yin, Yixuan Yuan, Luping Zhou","title":"Rethinking Data Perturbation and Model Stabilization for Semi-supervised\n  Medical Image Segmentation","comments":"Code and logs are available at https://github.com/ZhenZHAO/DPMS","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Studies on semi-supervised medical image segmentation (SSMIS) have seen fast\nprogress recently. Due to the limited labelled data, SSMIS methods mainly focus\non effectively leveraging unlabeled data to enhance the segmentation\nperformance. However, despite their promising performance, current\nstate-of-the-art methods often prioritize integrating complex techniques and\nloss terms rather than addressing the core challenges of semi-supervised\nscenarios directly. We argue that the key to SSMIS lies in generating\nsubstantial and appropriate prediction disagreement on unlabeled data. To this\nend, we emphasize the crutiality of data perturbation and model stabilization\nin semi-supervised segmentation, and propose a simple yet effective approach to\nboost SSMIS performance significantly, dubbed DPMS. Specifically, we first\nrevisit SSMIS from three distinct perspectives: the data, the model, and the\nloss, and conduct a comprehensive study of corresponding strategies to examine\ntheir effectiveness. Based on these examinations, we then propose DPMS, which\nadopts a plain teacher-student framework with a standard supervised loss and\nunsupervised consistency loss. To produce appropriate prediction disagreements,\nDPMS perturbs the unlabeled data via strong augmentations to enlarge prediction\ndisagreements considerably. On the other hand, using EMA teacher when strong\naugmentation is applied does not necessarily improve performance. DPMS further\nutilizes a forwarding-twice and momentum updating strategies for normalization\nstatistics to stabilize the training on unlabeled data effectively. Despite its\nsimplicity, DPMS can obtain new state-of-the-art performance on the public 2D\nACDC and 3D LA datasets across various semi-supervised settings, e.g. obtaining\na remarkable 22.62% improvement against previous SOTA on ACDC with 5% labels.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:08:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhao","Zhen",""],["Liu","Ye",""],["Zhao","Meng",""],["Yin","Di",""],["Yuan","Yixuan",""],["Zhou","Luping",""]]}
{"id":"2308.11904","submitter":"Na Zhang","authors":"Qia Li, Jianmin Liao, Lixin Shen, Na Zhang","title":"A Successive Two-stage Method for Sparse Generalized Eigenvalue Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Sparse Generalized Eigenvalue Problem (sGEP), a pervasive challenge in\nstatistical learning methods including sparse principal component analysis,\nsparse Fisher's discriminant analysis, and sparse canonical correlation\nanalysis, presents significant computational complexity due to its NP-hardness.\nThe primary aim of sGEP is to derive a sparse vector approximation of the\nlargest generalized eigenvector, effectively posing this as a sparse\noptimization problem. Conventional algorithms for sGEP, however, often succumb\nto local optima and exhibit significant dependency on initial points. This\npredicament necessitates a more refined approach to avoid local optima and\nachieve an improved solution in terms of sGEP's objective value, which we\naddress in this paper through a novel successive two-stage method. The first\nstage of this method incorporates an algorithm for sGEP capable of yielding a\nstationary point from any initial point. The subsequent stage refines this\nstationary point by adjusting its support, resulting in a point with an\nenhanced objective value relative to the original stationary point. This\nsupport adjustment is achieved through a novel procedure we have named support\nalteration. The final point derived from the second stage then serves as the\ninitial point for the algorithm in the first stage, creating a cyclical process\nthat continues until a predetermined stopping criterion is satisfied. We also\nprovide a comprehensive convergence analysis of this process. Through extensive\nexperimentation under various settings, our method has demonstrated significant\nimprovements in the objective value of sGEP compared to existing methodologies,\nunderscoring its potential as a valuable tool in statistical learning and\noptimization.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:14:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Qia",""],["Liao","Jianmin",""],["Shen","Lixin",""],["Zhang","Na",""]]}
{"id":"2308.11905","submitter":"Carlos N\\'u\\~nez Molina","authors":"Carlos N\\'u\\~nez-Molina and Masataro Asai","title":"Utilizing Admissible Bounds for Heuristic Learning","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While learning a heuristic function for forward search algorithms with modern\nmachine learning techniques has been gaining interest in recent years, there\nhas been little theoretical understanding of \\emph{what} they should learn,\n\\emph{how} to train them, and \\emph{why} we do so. This lack of understanding\nleads to various literature performing an ad-hoc selection of datasets\n(suboptimal vs optimal costs or admissible vs inadmissible heuristics) and\noptimization metrics (e.g., squared vs absolute errors). Moreover, due to the\nlack of admissibility of the resulting trained heuristics, little focus has\nbeen put on the role of admissibility \\emph{during} learning. This paper\narticulates the role of admissible heuristics in supervised heuristic learning\nusing them as parameters of Truncated Gaussian distributions, which tightens\nthe hypothesis space compared to ordinary Gaussian distributions. We argue that\nthis mathematical model faithfully follows the principle of maximum entropy and\nempirically show that, as a result, it yields more accurate heuristics and\nconverges faster during training.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:14:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["N\u00fa\u00f1ez-Molina","Carlos",""],["Asai","Masataro",""]]}
{"id":"2308.11906","submitter":"Surjit Wadhwa","authors":"Surjit S. Wadhwa, Jelena Petrovic, Nick F. H. Tothill, Ain Y. De\n  Horta, Miroslav D. Filipovic and Gojko Djura\\v{s}evic","title":"Photometric and Spectroscopic Study of Two Low Mass Ratio Contact Binary\n  Systems: CRTS J225828.7-121122 and CRTS J030053.5+230139","comments":"10 pages. 3 Figures. 1 Table Accepted - Research in Astronomy and\n  Astrophysics (RAA)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study reports photometric and spectroscopic observations of two recently\nrecognised contact binary systems. Both systems show total eclipses and\nanalysis of the light curves indicate both have a very low mass ratios of less\nthan 0.3. We derive absolute parameters from colour and distance based\ncalibrations and show that although both have low mass ratios they are likely\nto be in a stable orbit and unlikely to merge. In other respects both systems\nhave characteristics similar to other contact binaries with the secondary\nlarger and brighter than main sequence counterparts and we also find that the\nsecondary is considerably denser than the primary in both systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:15:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wadhwa","Surjit S.",""],["Petrovic","Jelena",""],["Tothill","Nick F. H.",""],["De Horta","Ain Y.",""],["Filipovic","Miroslav D.",""],["Djura\u0161evic","Gojko",""]]}
{"id":"2308.11907","submitter":"Trung Tran Nam","authors":"Le Xuan Dung and Tran Nam Trung","title":"Cohen-Macaulay oriented graphs with large girth","comments":"We correct typos in Lemma 2.2","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We classify the Cohen-Macaulay weighted oriented graphs whose underlying\ngraphs have girth at least $5$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:20:43 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 02:10:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dung","Le Xuan",""],["Trung","Tran Nam",""]]}
{"id":"2308.11908","submitter":"Amol Aggarwal","authors":"Amol Aggarwal and Jiaoyang Huang","title":"Strong Characterization for the Airy Line Ensemble","comments":"251 pages, 45 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we show that a Brownian Gibbsian line ensemble whose top curve\napproximates a parabola must be given by the parabolic Airy line ensemble. More\nspecifically, we prove that if $\\boldsymbol{\\mathcal{L}} = (\\mathcal{L}_1,\n\\mathcal{L}_2, \\ldots )$ is a line ensemble satisfying the Brownian Gibbs\nproperty, such that for any $\\varepsilon > 0$ there exists a constant\n$\\mathfrak{K} (\\varepsilon) > 0$ with $$\\mathbb{P} \\Big[ \\big| \\mathcal{L}_1\n(t) + 2^{-1/2} t^2 \\big| \\le \\varepsilon t^2 + \\mathfrak{K} (\\varepsilon) \\Big]\n\\ge 1 - \\varepsilon, \\qquad \\text{for all $t \\in \\mathbb{R}$},$$ then\n$\\boldsymbol{\\mathcal{L}}$ is the parabolic Airy line ensemble, up to an\nindependent affine shift. Specializing this result to the case when\n$\\boldsymbol{\\mathcal{L}} (t) + 2^{-1/2} t^2$ is translation-invariant confirms\na prediction of Okounkov and Sheffield from 2006 and Corwin-Hammond from 2014.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:25:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aggarwal","Amol",""],["Huang","Jiaoyang",""]]}
{"id":"2308.11909","submitter":"Cheng Zhu","authors":"Cheng Zhu, Jiayi Zhu, Lijuan Zhang, Xi Wu, Shuqi Yang, Ping Liang,\n  Honghan Chen, Ying Tan","title":"Edge-aware Hard Clustering Graph Pooling for Brain Imaging Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Convolutional Networks (GCNs) can capture non-Euclidean spatial\ndependence between different brain regions, and the graph pooling operator in\nGCNs is key to enhancing the representation learning capability and acquiring\nabnormal brain maps. However, the majority of existing research designs graph\npooling operators only from the perspective of nodes while disregarding the\noriginal edge features, in a way that not only confines graph pooling\napplication scenarios, but also diminishes its ability to capture critical\nsubstructures. In this study, a clustering graph pooling method that first\nsupports multidimensional edge features, called Edge-aware hard clustering\ngraph pooling (EHCPool), is developed. EHCPool proposes the first\n'Edge-to-node' score evaluation criterion based on edge features to assess node\nfeature significance. To more effectively capture the critical subgraphs, a\nnovel Iteration n-top strategy is further designed to adaptively learn sparse\nhard clustering assignments for graphs. Subsequently, an innovative N-E\nAggregation strategy is presented to aggregate node and edge feature\ninformation in each independent subgraph. The proposed model was evaluated on\nmulti-site brain imaging public datasets and yielded state-of-the-art\nperformance. We believe this method is the first deep learning tool with the\npotential to probe different types of abnormal functional brain networks from\ndata-driven perspective.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:29:40 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 13:05:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Cheng",""],["Zhu","Jiayi",""],["Zhang","Lijuan",""],["Wu","Xi",""],["Yang","Shuqi",""],["Liang","Ping",""],["Chen","Honghan",""],["Tan","Ying",""]]}
{"id":"2308.11910","submitter":"Saiful Islam","authors":"Saiful Islam, Pitambar Khanra, Johan Nakuci, Sarah F. Muldoon,\n  Takamitsu Watanabe, Naoki Masuda","title":"State-transition dynamics of resting-state functional magnetic resonance\n  imaging data: Model comparison and test-to-retest analysis","comments":"17 pages, 3 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electroencephalogram (EEG) microstate analysis entails finding dynamics of\nquasi-stable and generally recurrent discrete states in multichannel EEG time\nseries data and relating properties of the estimated state-transition dynamics\nto observables such as cognition and behavior. While microstate analysis has\nbeen widely employed to analyze EEG data, its use remains less prevalent in\nfunctional magnetic resonance imaging (fMRI) data, largely due to the slower\ntimescale of such data. In the present study, we extend various data clustering\nmethods used in EEG microstate analysis to resting-state fMRI data from healthy\nhumans to extract their state-transition dynamics. We show that the quality of\nclustering is on par with that for various microstate analyses of EEG data. We\nthen develop a method for examining test-retest reliability of the\ndiscrete-state transition dynamics between fMRI sessions and show that the\nwithin-participant test-retest reliability is higher than between-participant\ntest-retest reliability for different indices of state-transition dynamics,\ndifferent networks, and different data sets. This result suggests that\nstate-transition dynamics analysis of fMRI data could discriminate between\ndifferent individuals and is a promising tool for performing fingerprinting\nanalysis of individuals.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:36:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Islam","Saiful",""],["Khanra","Pitambar",""],["Nakuci","Johan",""],["Muldoon","Sarah F.",""],["Watanabe","Takamitsu",""],["Masuda","Naoki",""]]}
{"id":"2308.11911","submitter":"Hyekang Park","authors":"Hyekang Park, Jongyoun Noh, Youngmin Oh, Donghyeon Baek, Bumsub Ham","title":"ACLS: Adaptive and Conditional Label Smoothing for Network Calibration","comments":"Accepted to ICCV 2023 (Oral presentation)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We address the problem of network calibration adjusting miscalibrated\nconfidences of deep neural networks. Many approaches to network calibration\nadopt a regularization-based method that exploits a regularization term to\nsmooth the miscalibrated confidences. Although these approaches have shown the\neffectiveness on calibrating the networks, there is still a lack of\nunderstanding on the underlying principles of regularization in terms of\nnetwork calibration. We present in this paper an in-depth analysis of existing\nregularization-based methods, providing a better understanding on how they\naffect to network calibration. Specifically, we have observed that 1) the\nregularization-based methods can be interpreted as variants of label smoothing,\nand 2) they do not always behave desirably. Based on the analysis, we introduce\na novel loss function, dubbed ACLS, that unifies the merits of existing\nregularization methods, while avoiding the limitations. We show extensive\nexperimental results for image classification and semantic segmentation on\nstandard benchmarks, including CIFAR10, Tiny-ImageNet, ImageNet, and PASCAL\nVOC, demonstrating the effectiveness of our loss function.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:52:48 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 06:35:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Park","Hyekang",""],["Noh","Jongyoun",""],["Oh","Youngmin",""],["Baek","Donghyeon",""],["Ham","Bumsub",""]]}
{"id":"2308.11912","submitter":"Soonwoo Kwon","authors":"Soonwoo Kwon, Sojung Kim, Seunghyun Lee, Jin-Young Kim, Suyeong An,\n  and Kyuseok Kim","title":"Addressing Selection Bias in Computerized Adaptive Testing: A User-Wise\n  Aggregate Influence Function Approach","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computerized Adaptive Testing (CAT) is a widely used, efficient test mode\nthat adapts to the examinee's proficiency level in the test domain. CAT\nrequires pre-trained item profiles, for CAT iteratively assesses the student\nreal-time based on the registered items' profiles, and selects the next item to\nadminister using candidate items' profiles. However, obtaining such item\nprofiles is a costly process that involves gathering a large, dense\nitem-response data, then training a diagnostic model on the collected data. In\nthis paper, we explore the possibility of leveraging response data collected in\nthe CAT service. We first show that this poses a unique challenge due to the\ninherent selection bias introduced by CAT, i.e., more proficient students will\nreceive harder questions. Indeed, when naively training the diagnostic model\nusing CAT response data, we observe that item profiles deviate significantly\nfrom the ground-truth. To tackle the selection bias issue, we propose the\nuser-wise aggregate influence function method. Our intuition is to filter out\nusers whose response data is heavily biased in an aggregate manner, as judged\nby how much perturbation the added data will introduce during parameter\nestimation. This way, we may enhance the performance of CAT while introducing\nminimal bias to the item profiles. We provide extensive experiments to\ndemonstrate the superiority of our proposed method based on the three public\ndatasets and one dataset that contains real-world CAT response data.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:57:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kwon","Soonwoo",""],["Kim","Sojung",""],["Lee","Seunghyun",""],["Kim","Jin-Young",""],["An","Suyeong",""],["Kim","Kyuseok",""]]}
{"id":"2308.11913","submitter":"Xudong Wen","authors":"Xudong Wen, He Gao, Shunke Ai, liangduan liu, Jin-Ping Zhu, Wei-Hua\n  Lei","title":"Polarization Signature of Companion-Fed Supernovae Arising from BH-NS/BH\n  Progenitor Systems","comments":"15 pages, 13 figures,accepted for publication in APJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The formation of black hole-neutron star (BH-NS) or BH-BH systems may be\naccompanied with special supernova (SN) signals, due to the accretion feedback\nfrom the companion BH. The additional heating, which is mainly attributed to\nthe Blandford-Payne mechanism, would disrupt the isotropic nature of the\nluminosity distribution on the surface of the SN ejecta, leading to the\nappearance of polarization. Here we develop a three dimensional (3D) Monte\nCarlo polarization simulation code (MCPSC) to conduct simulations for these\nspecial SNe. We find that the maximum polarization level of approximately \\sim\n2 occurs at the peak time of SN emission in the \"close-binary\" scenario, while\nin the \"faraway-binary\" case, maximum polarization (i.e. \\sim 0.7) is observed\nat a considerably later time than the peak of the SN. The magnitude of\npolarization is dependent on the degree of unevenness in the luminosity\ndistribution and the angle between the line of sight and the equatorial\ndirection. When considering the geometric distortion of supernova ejecta at the\nsame time, the magnitude of polarization may either increase (for a oblate\nellipsoidal shape) or decrease (for a prolate ellipsoidal shape). The\npolarization signatures represent a promising auxiliary instrument to\nfacilitate the identification of the companion-fed SNe. Moreover, by comparing\nthe event rate of these special SNe with the event rate density of LIGO-Virgo\ndetected BH-NS/BH systems could further help to distinguish the BH-NS/BH\nformation channel.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:59:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wen","Xudong",""],["Gao","He",""],["Ai","Shunke",""],["liu","liangduan",""],["Zhu","Jin-Ping",""],["Lei","Wei-Hua",""]]}
{"id":"2308.11914","submitter":"Ziyi Tang","authors":"Ziyi Tang, Ruilin Wang, Weixing Chen, Keze Wang, Yang Liu, Tianshui\n  Chen, Liang Lin","title":"Towards CausalGPT: A Multi-Agent Approach for Faithful Knowledge\n  Reasoning via Promoting Causal Consistency in LLMs","comments":"8 pages, 3 figures. 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite advancements in LLMs, knowledge-based reasoning remains a\nlongstanding issue due to the fragility of knowledge recall and inference.\nExisting methods primarily encourage LLMs to autonomously plan and solve\nproblems or to extensively sample reasoning chains without addressing the\nconceptual and inferential fallacies. Attempting to alleviate inferential\nfallacies and drawing inspiration from multi-agent collaboration, we present a\nframework to increase faithfulness and causality for knowledge-based reasoning.\nSpecifically, we propose to employ multiple intelligent agents (i.e., reasoner\nand causal evaluator) to work collaboratively in a reasoning-and-consensus\nparadigm for elevated reasoning faithfulness. The reasoners focus on providing\nsolutions with human-like causality to solve open-domain problems. On the other\nhand, the causal evaluator agent scrutinizes if the answer in a solution is\ncausally deducible from the question and vice versa, with a counterfactual\nanswer replacing the original. According to the extensive and comprehensive\nevaluations on a variety of knowledge reasoning tasks (e.g., science question\nanswering and commonsense reasoning), our framework outperforms all compared\nstate-of-the-art approaches by large margins.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:59:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tang","Ziyi",""],["Wang","Ruilin",""],["Chen","Weixing",""],["Wang","Keze",""],["Liu","Yang",""],["Chen","Tianshui",""],["Lin","Liang",""]]}
{"id":"2308.11915","submitter":"Yi Wu","authors":"Ruiyuan Li, Zheng Li, Yi Wu, Chao Chen, Tong Liu, Yu Zheng","title":"Adaptive Encoding Strategies for Erasing-Based Lossless Floating-Point\n  Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lossless floating-point time series compression is crucial for a wide range\nof critical scenarios. Nevertheless, it is a big challenge to compress time\nseries losslessly due to the complex underlying layouts of floating-point\nvalues. The state-of-the-art erasing-based compression algorithm Elf\ndemonstrates a rather impressive performance. We give an in-depth exploration\nof the encoding strategies of Elf, and find that there is still much room for\nimprovement. In this paper, we propose Elf*, which employs a set of\noptimizations for leading zeros, center bits and sharing condition.\nSpecifically, we develop a dynamic programming algorithm with a set of pruning\nstrategies to compute the adaptive approximation rules efficiently. We\ntheoretically prove that the adaptive approximation rules are globally optimal.\nWe further extend Elf* to Streaming Elf*, i.e., SElf*, which achieves almost\nthe same compression ratio as Elf*, while enjoying even higher efficiency in\nstreaming scenarios. We compare Elf* and SElf* with 8 competitors using 22\ndatasets. The results demonstrate that SElf* achieves 9.2% relative compression\nratio improvement over the best streaming competitor while maintaining similar\nefficiency, and that Elf* ranks among the most competitive batch compressors.\nAll source codes are publicly released.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:00:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Ruiyuan",""],["Li","Zheng",""],["Wu","Yi",""],["Chen","Chao",""],["Liu","Tong",""],["Zheng","Yu",""]]}
{"id":"2308.11916","submitter":"Sihyeon Kim","authors":"Sihyeon Kim, Minseok Joo, Jaewon Lee, Juyeon Ko, Juhan Cha, Hyunwoo J.\n  Kim","title":"Semantic-Aware Implicit Template Learning via Part Deformation\n  Consistency","comments":"ICCV camera-ready version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning implicit templates as neural fields has recently shown impressive\nperformance in unsupervised shape correspondence. Despite the success, we\nobserve current approaches, which solely rely on geometric information, often\nlearn suboptimal deformation across generic object shapes, which have high\nstructural variability. In this paper, we highlight the importance of part\ndeformation consistency and propose a semantic-aware implicit template learning\nframework to enable semantically plausible deformation. By leveraging semantic\nprior from a self-supervised feature extractor, we suggest local conditioning\nwith novel semantic-aware deformation code and deformation consistency\nregularizations regarding part deformation, global deformation, and global\nscaling. Our extensive experiments demonstrate the superiority of the proposed\nmethod over baselines in various tasks: keypoint transfer, part label transfer,\nand texture transfer. More interestingly, our framework shows a larger\nperformance gain under more challenging settings. We also provide qualitative\nanalyses to validate the effectiveness of semantic-aware deformation. The code\nis available at https://github.com/mlvlab/PDC.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:02:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kim","Sihyeon",""],["Joo","Minseok",""],["Lee","Jaewon",""],["Ko","Juyeon",""],["Cha","Juhan",""],["Kim","Hyunwoo J.",""]]}
{"id":"2308.11917","submitter":"Juwon Seo","authors":"Juwon Seo, Ji-Su Kang, Gyeong-Moon Park","title":"LFS-GAN: Lifelong Few-Shot Image Generation","comments":"20 pages, 19 figures, 14 tables, ICCV 2023 Poster","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We address a challenging lifelong few-shot image generation task for the\nfirst time. In this situation, a generative model learns a sequence of tasks\nusing only a few samples per task. Consequently, the learned model encounters\nboth catastrophic forgetting and overfitting problems at a time. Existing\nstudies on lifelong GANs have proposed modulation-based methods to prevent\ncatastrophic forgetting. However, they require considerable additional\nparameters and cannot generate high-fidelity and diverse images from limited\ndata. On the other hand, the existing few-shot GANs suffer from severe\ncatastrophic forgetting when learning multiple tasks. To alleviate these\nissues, we propose a framework called Lifelong Few-Shot GAN (LFS-GAN) that can\ngenerate high-quality and diverse images in lifelong few-shot image generation\ntask. Our proposed framework learns each task using an efficient task-specific\nmodulator - Learnable Factorized Tensor (LeFT). LeFT is rank-constrained and\nhas a rich representation ability due to its unique reconstruction technique.\nFurthermore, we propose a novel mode seeking loss to improve the diversity of\nour model in low-data circumstances. Extensive experiments demonstrate that the\nproposed LFS-GAN can generate high-fidelity and diverse images without any\nforgetting and mode collapse in various domains, achieving state-of-the-art in\nlifelong few-shot image generation task. Surprisingly, we find that our LFS-GAN\neven outperforms the existing few-shot GANs in the few-shot image generation\ntask. The code is available at Github.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:03:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Seo","Juwon",""],["Kang","Ji-Su",""],["Park","Gyeong-Moon",""]]}
{"id":"2308.11918","submitter":"Jingchun Zhou","authors":"Jingchun Zhou, Zongxin He, Kin-Man Lam, Yudong Wang, Weishi Zhang,\n  ChunLe Guo, Chongyi Li","title":"AMSP-UOD: When Vortex Convolution and Stochastic Perturbation Meet\n  Underwater Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a novel Amplitude-Modulated Stochastic Perturbation\nand Vortex Convolutional Network, AMSP-UOD, designed for underwater object\ndetection. AMSP-UOD specifically addresses the impact of non-ideal imaging\nfactors on detection accuracy in complex underwater environments. To mitigate\nthe influence of noise on object detection performance, we propose AMSP Vortex\nConvolution (AMSP-VConv) to disrupt the noise distribution, enhance feature\nextraction capabilities, effectively reduce parameters, and improve network\nrobustness. We design the Feature Association Decoupling Cross Stage Partial\n(FAD-CSP) module, which strengthens the association of long and short-range\nfeatures, improving the network performance in complex underwater environments.\nAdditionally, our sophisticated post-processing method, based on non-maximum\nsuppression with aspect-ratio similarity thresholds, optimizes detection in\ndense scenes, such as waterweed and schools of fish, improving object detection\naccuracy. Extensive experiments on the URPC and RUOD datasets demonstrate that\nour method outperforms existing state-of-the-art methods in terms of accuracy\nand noise immunity. AMSP-UOD proposes an innovative solution with the potential\nfor real-world applications. Code will be made publicly available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:03:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhou","Jingchun",""],["He","Zongxin",""],["Lam","Kin-Man",""],["Wang","Yudong",""],["Zhang","Weishi",""],["Guo","ChunLe",""],["Li","Chongyi",""]]}
{"id":"2308.11919","submitter":"Francois Golse","authors":"Fran\\c{c}ois Golse","title":"Validit\\'e de la th\\'eorie cin\\'etique des gaz: au-del\\`a de\n  l'\\'equation de Boltzmann [d'apr\\`es T. Bodineau, I. Gallagher, L.\n  Saint-Raymond, S. Simonella]","comments":"53 pages, in French language, 3 figures. Bourbaki seminar, November\n  19th 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Obtaining a rigorous justification of the kinetic theory of gases from\nNewton's second law of dynamics for a large number of identical spheres\ninteracting by elastic binary collisions, is a problem formulated by Hilbert in\n1900 (Hilbert's 6th problem). In 1975, Lanford demonstrated the validity of the\nBoltzmann equation over a very short time interval, of the order of a fraction\nof the average time between two successive collisions experienced by the same\nparticle. This result of Lanford can be interpreted as a kind of law of large\nnumbers as the number of particles tends to infinity. This point of view raises\nseveral questions. First, the core of the argument used by Boltzmann to arrive\nat the equation bearing his name is the assumption that two particles about to\ncollide are statistically almost independent. This suggests to examine the\nvalidity of this hypothesis by studying the dynamics of correlations between\nparticles. On the other hand, the interpretation of the Boltzmann equation as a\nlaw of large numbers leads to study precisely the fluctuations of the phase\nspace empirical measure of the particle system about its mean (whose evolution\nis described by the Boltzmann equation). A series of recent papers by T.\nBodineau, I. Gallagher, L. Saint-Raymond and S. Simonella answers these various\nquestions and allows going beyond the Boltzmann equation in the understanding\nof the kinetic theory of gases.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:03:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Golse","Fran\u00e7ois",""]]}
{"id":"2308.11920","submitter":"Injae Kim","authors":"Injae Kim, Jongha Kim, Joonmyung Choi, Hyunwoo J. Kim","title":"Concept Bottleneck with Visual Concept Filtering for Explainable Medical\n  Image Classification","comments":"Accepted to MedAGI Workshop at MICCAI 2023 (Oral Presentation)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interpretability is a crucial factor in building reliable models for various\nmedical applications. Concept Bottleneck Models (CBMs) enable interpretable\nimage classification by utilizing human-understandable concepts as intermediate\ntargets. Unlike conventional methods that require extensive human labor to\nconstruct the concept set, recent works leveraging Large Language Models (LLMs)\nfor generating concepts made automatic concept generation possible. However,\nthose methods do not consider whether a concept is visually relevant or not,\nwhich is an important factor in computing meaningful concept scores. Therefore,\nwe propose a visual activation score that measures whether the concept contains\nvisual cues or not, which can be easily computed with unlabeled image data.\nComputed visual activation scores are then used to filter out the less visible\nconcepts, thus resulting in a final concept set with visually meaningful\nconcepts. Our experimental results show that adopting the proposed visual\nactivation score for concept filtering consistently boosts performance compared\nto the baseline. Moreover, qualitative analyses also validate that visually\nrelevant concepts are successfully selected with the visual activation score.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:04:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kim","Injae",""],["Kim","Jongha",""],["Choi","Joonmyung",""],["Kim","Hyunwoo J.",""]]}
{"id":"2308.11921","submitter":"Seoyeon Hwang","authors":"Ivan De Oliveira Nunes, Seoyeon Hwang, Sashidhar Jakkamsetti,\n  Norrathep Rattanavipanon, and Gene Tsudik","title":"PARseL: Towards a Verified Root-of-Trust over seL4","comments":"8 pages and 8 figures. To be published at IEEE/ACM International\n  Conference on Computer-Aided Design (ICCAD) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Widespread adoption and growing popularity of embedded/IoT/CPS devices make\nthem attractive attack targets. On low-to-mid-range devices, security features\nare typically few or none due to various constraints. Such devices are thus\nsubject to malware-based compromise. One popular defensive measure is Remote\nAttestation (RA) which allows a trusted entity to determine the current\nsoftware integrity of an untrusted remote device.\n  For higher-end devices, RA is achievable via secure hardware components. For\nlow-end (bare metal) devices, minimalistic hybrid (hardware/software) RA is\neffective, which incurs some hardware modifications. That leaves certain\nmid-range devices (e.g., ARM Cortex-A family) equipped with standard hardware\ncomponents, e.g., a memory management unit (MMU) and perhaps a secure boot\nfacility. In this space, seL4 (a verified microkernel with guaranteed process\nisolation) is a promising platform for attaining RA. HYDRA made a first step\ntowards this, albeit without achieving any verifiability or provable\nguarantees.\n  This paper picks up where HYDRA left off by constructing a PARseL\narchitecture, that separates all user-dependent components from the TCB. This\nleads to much stronger isolation guarantees, based on seL4 alone, and\nfacilitates formal verification. In PARseL, We use formal verification to\nobtain several security properties for the isolated RA TCB, including: memory\nsafety, functional correctness, and secret independence. We implement PARseL in\nF* and specify/prove expected properties using Hoare logic. Next, we\nautomatically translate the F* implementation to C using KaRaMeL, which\npreserves verified properties of PARseL C implementation (atop seL4). Finally,\nwe instantiate and evaluate PARseL on a commodity platform -- a SabreLite\nembedded device.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:06:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nunes","Ivan De Oliveira",""],["Hwang","Seoyeon",""],["Jakkamsetti","Sashidhar",""],["Rattanavipanon","Norrathep",""],["Tsudik","Gene",""]]}
{"id":"2308.11922","submitter":"Anuar Assamidanov","authors":"Anuar Assamidanov","title":"Discrimination and Constraints: Evidence from The Voice","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gender discrimination in the hiring process is one significant factor\ncontributing to labor market disparities. However, there is little evidence on\nthe extent to which gender bias by hiring managers is responsible for these\ndisparities. In this paper, I exploit a unique dataset of blind auditions of\nThe Voice television show as an experiment to identify own gender bias in the\nselection process. The first televised stage audition, in which four noteworthy\nrecording artists are coaches, listens to the contestants blindly (chairs\nfacing away from the stage) to avoid seeing the contestant. Using a\ndifference-in-differences estimation strategy, a coach (hiring person) is\ndemonstrably exogenous with respect to the artist's gender, I find that artists\nare 4.5 percentage points (11 percent) more likely to be selected when they are\nthe recipients of an opposite-gender coach. I also utilize the machine-learning\napproach in Athey et al. (2018) to include heterogeneity from team gender\ncomposition, order of performance, and failure rates of the coaches. The\nfindings offer a new perspective to enrich past research on gender\ndiscrimination, shedding light on the instances of gender bias variation by the\ngender of the decision maker and team gender composition.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:09:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Assamidanov","Anuar",""]]}
{"id":"2308.11923","submitter":"Daiki Takeuchi","authors":"Daiki Takeuchi, Yasunori Ohishi, Daisuke Niizumi, Noboru Harada, Kunio\n  Kashino","title":"Audio Difference Captioning Utilizing Similarity-Discrepancy\n  Disentanglement","comments":"Accepted to DCASE2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We proposed Audio Difference Captioning (ADC) as a new extension task of\naudio captioning for describing the semantic differences between input pairs of\nsimilar but slightly different audio clips. The ADC solves the problem that\nconventional audio captioning sometimes generates similar captions for similar\naudio clips, failing to describe the difference in content. We also propose a\ncross-attention-concentrated transformer encoder to extract differences by\ncomparing a pair of audio clips and a similarity-discrepancy disentanglement to\nemphasize the difference in the latent space. To evaluate the proposed methods,\nwe built an AudioDiffCaps dataset consisting of pairs of similar but slightly\ndifferent audio clips with human-annotated descriptions of their differences.\nThe experiment with the AudioDiffCaps dataset showed that the proposed methods\nsolve the ADC task effectively and improve the attention weights to extract the\ndifference by visualizing them in the transformer encoder.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:13:25 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Takeuchi","Daiki",""],["Ohishi","Yasunori",""],["Niizumi","Daisuke",""],["Harada","Noboru",""],["Kashino","Kunio",""]]}
{"id":"2308.11924","submitter":"Fanqi Lin","authors":"Fanqi Lin, Shiyu Huang, Weiwei Tu","title":"Diverse Policies Converge in Reward-free Markov Decision Processe","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reinforcement learning has achieved great success in many decision-making\ntasks, and traditional reinforcement learning algorithms are mainly designed\nfor obtaining a single optimal solution. However, recent works show the\nimportance of developing diverse policies, which makes it an emerging research\ntopic. Despite the variety of diversity reinforcement learning algorithms that\nhave emerged, none of them theoretically answer the question of how the\nalgorithm converges and how efficient the algorithm is. In this paper, we\nprovide a unified diversity reinforcement learning framework and investigate\nthe convergence of training diverse policies. Under such a framework, we also\npropose a provably efficient diversity reinforcement learning algorithm.\nFinally, we verify the effectiveness of our method through numerical\nexperiments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:17:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lin","Fanqi",""],["Huang","Shiyu",""],["Tu","Weiwei",""]]}
{"id":"2308.11925","submitter":"Bangti Jin","authors":"Bangti Jin and Ramesh Sau and Luowei Yin and Zhi Zhou","title":"Solving Elliptic Optimal Control Problems using Physics Informed Neural\n  Networks","comments":"28 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG cs.NA math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we present and analyze a numerical solver for optimal control\nproblems (without / with box constraint) for linear and semilinear second-order\nelliptic problems. The approach is based on a coupled system derived from the\nfirst-order optimality system of the optimal control problem, and applies\nphysics informed neural networks (PINNs) to solve the coupled system. We\npresent an error analysis of the numerical scheme, and provide $L^2(\\Omega)$\nerror bounds on the state, control and adjoint state in terms of deep neural\nnetwork parameters (e.g., depth, width, and parameter bounds) and the number of\nsampling points in the domain and on the boundary. The main tools in the\nanalysis include offset Rademacher complexity and boundedness and Lipschitz\ncontinuity of neural network functions. We present several numerical examples\nto illustrate the approach and compare it with three existing approaches.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:18:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jin","Bangti",""],["Sau","Ramesh",""],["Yin","Luowei",""],["Zhou","Zhi",""]]}
{"id":"2308.11926","submitter":"Jingnan Guo Dr.","authors":"Jingnan Guo, Bingbing Wang, Kathryn Whitman, Christina Plainaki,\n  Lingling Zhao, Hazel M. Bain, Christina Cohen, Silvia Dalla, Mateja Dumbovic,\n  Miho Janvier, Insoo Jun, Janet Luhmann, Olga E. Malandraki, M. Leila Mays,\n  Jamie S. Rankin, Linghua Wang, Yihua Zheng","title":"Particle Radiation Environment in the Heliosphere: Status, limitations\n  and recommendations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Space weather is a multidisciplinary research area connecting scientists from\nacross heliophysics domains seeking a coherent understanding of our space\nenvironment that can also serve modern life and society's needs. COSPAR's ISWAT\n(International Space Weather Action Teams) 'clusters' focus attention on\ndifferent areas of space weather study while ensuring the coupled system is\nbroadly addressed via regular communications and interactions. The ISWAT\ncluster \"H3: Radiation Environment in the Heliosphere\"\n(https://www.iswat-cospar.org/h3) has been working to provide a scientific\nplatform to understand, characterize and predict the energetic particle\nradiation in the heliosphere with the practical goal of mitigating radiation\nrisks associated with areospace activities, satellite industry and human space\nexplorations. In particular, present approaches help us understand the physical\nphenomena at large, optimizing the output of multi-viewpoint observations and\npushing current models to their limits.\n  In this paper, we review the scientific aspects of the radiation environment\nin the heliosphere covering four different radiation types: Solar Energetic\nParticles (SEPs), Ground Level Enhancement (GLE, a type of SEP events with\nenergies high enough to trigger the enhancement of ground-level detectors),\nGalactic Cosmic Rays (GCRs) and Anomalous Cosmic Rays (ACRs). We focus on\nrelated advances in the research community in the past 10-20 years and what we\nstill lack in terms of understanding and predictive capabilities. Finally we\nalso consider some recommendations related to the improvement of both\nobservational and modeling capabilities in the field of space radiation\nenvironment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:21:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Guo","Jingnan",""],["Wang","Bingbing",""],["Whitman","Kathryn",""],["Plainaki","Christina",""],["Zhao","Lingling",""],["Bain","Hazel M.",""],["Cohen","Christina",""],["Dalla","Silvia",""],["Dumbovic","Mateja",""],["Janvier","Miho",""],["Jun","Insoo",""],["Luhmann","Janet",""],["Malandraki","Olga E.",""],["Mays","M. Leila",""],["Rankin","Jamie S.",""],["Wang","Linghua",""],["Zheng","Yihua",""]]}
{"id":"2308.11927","submitter":"Enze Ye","authors":"Enze Ye, Yuhang Wang, Hong Zhang, Yiqin Gao, Huan Wang, He Sun","title":"Recovering a Molecule's 3D Dynamics from Liquid-phase Electron\n  Microscopy Movies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The dynamics of biomolecules are crucial for our understanding of their\nfunctioning in living systems. However, current 3D imaging techniques, such as\ncryogenic electron microscopy (cryo-EM), require freezing the sample, which\nlimits the observation of their conformational changes in real time. The\ninnovative liquid-phase electron microscopy (liquid-phase EM) technique allows\nmolecules to be placed in the native liquid environment, providing a unique\nopportunity to observe their dynamics. In this paper, we propose TEMPOR, a\nTemporal Electron MicroscoPy Object Reconstruction algorithm for liquid-phase\nEM that leverages an implicit neural representation (INR) and a dynamical\nvariational auto-encoder (DVAE) to recover time series of molecular structures.\nWe demonstrate its advantages in recovering different motion dynamics from two\nsimulated datasets, 7bcq and Cas9. To our knowledge, our work is the first\nattempt to directly recover 3D structures of a temporally-varying particle from\nliquid-phase EM movies. It provides a promising new approach for studying\nmolecules' 3D dynamics in structural biology.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:26:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ye","Enze",""],["Wang","Yuhang",""],["Zhang","Hong",""],["Gao","Yiqin",""],["Wang","Huan",""],["Sun","He",""]]}
{"id":"2308.11928","submitter":"Dai Kun","authors":"Tao Xie, Kun Dai, Siyi Lu, Ke Wang, Zhiqiang Jiang, Jinghan Gao,\n  Dedong Liu, Jie Xu, Lijun Zhao, Ruifeng Li","title":"OFVL-MS: Once for Visual Localization across Multiple Indoor Scenes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work, we seek to predict camera poses across scenes with a multi-task\nlearning manner, where we view the localization of each scene as a new task. We\npropose OFVL-MS, a unified framework that dispenses with the traditional\npractice of training a model for each individual scene and relieves gradient\nconflict induced by optimizing multiple scenes collectively, enabling efficient\nstorage yet precise visual localization for all scenes. Technically, in the\nforward pass of OFVL-MS, we design a layer-adaptive sharing policy with a\nlearnable score for each layer to automatically determine whether the layer is\nshared or not. Such sharing policy empowers us to acquire task-shared\nparameters for a reduction of storage cost and task-specific parameters for\nlearning scene-related features to alleviate gradient conflict. In the backward\npass of OFVL-MS, we introduce a gradient normalization algorithm that\nhomogenizes the gradient magnitude of the task-shared parameters so that all\ntasks converge at the same pace. Furthermore, a sparse penalty loss is applied\non the learnable scores to facilitate parameter sharing for all tasks without\nperformance degradation. We conduct comprehensive experiments on multiple\nbenchmarks and our new released indoor dataset LIVL, showing that OFVL-MS\nfamilies significantly outperform the state-of-the-arts with fewer parameters.\nWe also verify that OFVL-MS can generalize to a new scene with much few\nparameters while gaining superior localization performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:32:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xie","Tao",""],["Dai","Kun",""],["Lu","Siyi",""],["Wang","Ke",""],["Jiang","Zhiqiang",""],["Gao","Jinghan",""],["Liu","Dedong",""],["Xu","Jie",""],["Zhao","Lijun",""],["Li","Ruifeng",""]]}
{"id":"2308.11929","submitter":"Li Chen","authors":"Peifeng Ma, Li Chen, Chang Yu, Qing Zhu, Yulin Ding","title":"Dynamic landslide susceptibility mapping over recent three decades to\n  uncover variations in landslide causes in subtropical urban mountainous areas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Landslide susceptibility assessment (LSA) is of paramount importance in\nmitigating landslide risks. Recently, there has been a surge in the utilization\nof data-driven methods for predicting landslide susceptibility due to the\ngrowing availability of aerial and satellite data. Nonetheless, the rapid\noscillations within the landslide-inducing environment (LIE), primarily due to\nsignificant changes in external triggers such as rainfall, pose difficulties\nfor contemporary data-driven LSA methodologies to accommodate LIEs over diverse\ntimespans. This study presents dynamic landslide susceptibility mapping that\nsimply employs multiple predictive models for annual LSA. In practice, this\nwill inevitably encounter small sample problems due to the limited number of\nlandslide samples in certain years. Another concern arises owing to the\nmajority of the existing LSA approaches train black-box models to fit distinct\ndatasets, yet often failing in generalization and providing comprehensive\nexplanations concerning the interactions between input features and\npredictions. Accordingly, we proposed to meta-learn representations with fast\nadaptation ability using a few samples and gradient updates; and apply SHAP for\neach model interpretation and landslide feature permutation. Additionally, we\napplied MT-InSAR for LSA result enhancement and validation. The chosen study\narea is Lantau Island, Hong Kong, where we conducted a comprehensive dynamic\nLSA spanning from 1992 to 2019. The model interpretation results demonstrate\nthat the primary factors responsible for triggering landslides in Lantau Island\nare terrain slope and extreme rainfall. The results also indicate that the\nvariation in landslide causes can be primarily attributed to extreme rainfall\nevents, which result from global climate change, and the implementation of the\nLandslip Prevention and Mitigation Programme (LPMitP) by the Hong Kong\ngovernment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:33:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ma","Peifeng",""],["Chen","Li",""],["Yu","Chang",""],["Zhu","Qing",""],["Ding","Yulin",""]]}
{"id":"2308.11930","submitter":"Miao Liu","authors":"Guanghui Cai, Yutao Jiang, Hui Zhou, Ze Yu, Kun Jiang, Youguo Shi,\n  Sheng Meng, Miao Liu","title":"Energy landscape and phase competition of CsV3Sb5-, CsV6Sb6-, and\n  TbMn6Sn6-type Kagome materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Finding viable Kagome lattices is vital for materializing novel phenomena in\nquantum materials. In this work, we performed element substitutions on CsV3Sb5\nwith space group P6/mmm, TbMn6Sn6 with space group P6/mmm, and CsV6Sb6 with\nspace group R-3 m, respectively, as the parent compounds. A total of 4158\nmaterials were obtained through element substitutions, and these materials were\nthen calculated via density function theory in high-throughput mode. Afterward,\n48 materials were identified with high thermodynamic stability\n(E_hull<5meV/atom). Furthermore, we compared the thermodynamic stability of\nthree different phases with the same elemental composition and predicted some\ncompeting phases that may arise during material synthesis. Finally, by\ncalculating the electronic structures of these materials, we attempted to\nidentify patterns in the electronic structure variations as the elements\nchange. This work provides guidance for discovering promising AM3X5/AM6X6\nKagome materials from a vast phase space.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:33:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cai","Guanghui",""],["Jiang","Yutao",""],["Zhou","Hui",""],["Yu","Ze",""],["Jiang","Kun",""],["Shi","Youguo",""],["Meng","Sheng",""],["Liu","Miao",""]]}
{"id":"2308.11931","submitter":"Lijie Zhang","authors":"Qiwei Tian, Ping Li, Li Zhang, Yuan Tian, Long-Jing Yin, Lijie Zhang,\n  and Zhihui Qin","title":"Native Pb vacancy defects induced p-type characteristic in epitaxial\n  monolayer PbSe","comments":null,"journal-ref":"Appl. Phys. Lett. 123, 051903 (2023)","doi":"10.1063/5.0159455","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  PbSe, a predicted two-dimensional (2D) topological crystalline insulator\n(TCI) in the monolayer limit, possess excellent thermoelectric and infrared\noptical properties. Native defects in PbSe take a crucial role for the\napplications. However, little attention has been paid to the defect induced\ndoping characteristics. Here, we provide an experimental and theoretical\ninvestigation of defects induced p-type characteristic on epitaxial monolayer\nPbSe on Au(111). Scanning tunneling microscopy (STM) measurements demonstrate\nan epitaxial PbSe monolayer with a fourfold symmetric lattice. Combined\nscanning tunneling spectroscopy (STS) and density functional theory (DFT)\ncalculations reveal a quasi-particle bandgap of 0.8eV of PbSe. STM results\nunveil that there are two types of defects on the surface, one is related the\nvacancies of Pb atoms and the other is the replacement of the absent Se atoms\nby Pb. Corresponding theoretical optimization confirms the structures of the\ndefects. More importantly, both STS measurements and DFT calculations give\nevidence that the Pb vacancies move the Fermi energy inside the valence band\nand produce extra holes, leading to p-type characteristics of PbSe. Our work\nprovides effective information for the future research of device performance\nbased on PbSe films.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:36:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tian","Qiwei",""],["Li","Ping",""],["Zhang","Li",""],["Tian","Yuan",""],["Yin","Long-Jing",""],["Zhang","Lijie",""],["Qin","Zhihui",""]]}
{"id":"2308.11932","submitter":"Jingchun Zhou","authors":"Dehuan Zhang, Jingchun Zhou, Weishi Zhang, ChunLe Guo, Chongyi Li","title":"Synergistic Multiscale Detail Refinement via Intrinsic Supervision for\n  Underwater Image Enhancement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual restoration of underwater scenes is crucial for visual tasks, and\navoiding interference from underwater media has become a prominent concern. In\nthis work, we present a synergistic multiscale detail refinement via intrinsic\nsupervision (SMDR-IS) to recover underwater scene details. The low-degradation\nstage provides multiscale detail for original stage, which achieves synergistic\nmultiscale detail refinement through feature propagation via the adaptive\nselective intrinsic supervised feature module (ASISF), which achieves\nsynergistic multiscale detail refinement. ASISF is developed using intrinsic\nsupervision to precisely control and guide feature transmission in the\nmulti-degradation stages. ASISF improves the multiscale detail refinement while\nreducing interference from irrelevant scene information from the\nlow-degradation stage. Additionally, within the multi-degradation\nencoder-decoder of SMDR-IS, we introduce a bifocal intrinsic-context attention\nmodule (BICA). This module is designed to effectively leverage multi-scale\nscene information found in images, using intrinsic supervision principles as\nits foundation. BICA facilitates the guidance of higher-resolution spaces by\nleveraging lower-resolution spaces, considering the significant dependency of\nunderwater image restoration on spatial contextual relationships. During the\ntraining process, the network gains advantages from the integration of a\nmulti-degradation loss function. This function serves as a constraint, enabling\nthe network to effectively exploit information across various scales. When\ncompared with state-of-the-art methods, SMDR-IS demonstrates its outstanding\nperformance. Code will be made publicly available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:40:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Dehuan",""],["Zhou","Jingchun",""],["Zhang","Weishi",""],["Guo","ChunLe",""],["Li","Chongyi",""]]}
{"id":"2308.11933","submitter":"Peter Halmos","authors":"Peter Halmos, Jonathan Pillow, David A. Knowles","title":"System Identification for Continuous-time Linear Dynamical Systems","comments":"32 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of system identification for the Kalman filter, relying on the\nexpectation-maximization (EM) procedure to learn the underlying parameters of a\ndynamical system, has largely been studied assuming that observations are\nsampled at equally-spaced time points. However, in many applications this is a\nrestrictive and unrealistic assumption. This paper addresses system\nidentification for the continuous-discrete filter, with the aim of generalizing\nlearning for the Kalman filter by relying on a solution to a continuous-time\nIt\\^o stochastic differential equation (SDE) for the latent state and\ncovariance dynamics. We introduce a novel two-filter, analytical form for the\nposterior with a Bayesian derivation, which yields analytical updates which do\nnot require the forward-pass to be pre-computed. Using this analytical and\nefficient computation of the posterior, we provide an EM procedure which\nestimates the parameters of the SDE, naturally incorporating irregularly\nsampled measurements. Generalizing the learning of latent linear dynamical\nsystems (LDS) to continuous-time may extend the use of the hybrid Kalman filter\nto data which is not regularly sampled or has intermittent missing values, and\ncan extend the power of non-linear system identification methods such as\nswitching LDS (SLDS), which rely on EM for the linear discrete-time Kalman\nfilter as a sub-unit for learning locally linearized behavior of a non-linear\nsystem. We apply the method by learning the parameters of a latent,\nmultivariate Fokker-Planck SDE representing a toggle-switch genetic circuit\nusing biologically realistic parameters, and compare the efficacy of learning\nrelative to the discrete-time Kalman filter as the step-size irregularity and\nspectral-radius of the dynamics-matrix increases.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:53:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Halmos","Peter",""],["Pillow","Jonathan",""],["Knowles","David A.",""]]}
{"id":"2308.11934","submitter":"Haifan Yin","authors":"Mengying Gao, Haifan Yin, and Liangcheng Han","title":"An EEP-based robust beamforming approach for superdirective antenna\n  arrays and experimental validations","comments":"13 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A superdirective antenna array has the potential to achieve an array gain\nproportional to the square of the number of antennas, making it of great value\nfor future wireless communications. However, designing the superdirective\nbeamformer while considering the complicated mutual-coupling effect is a\npractical challenge. Moreover, the superdirective antenna array is highly\nsensitive to excitation errors, especially when the number of antennas is large\nor the antenna spacing is very small, necessitating demanding and precise\ncontrol over excitations. To address these problems, we first propose a novel\nsuperdirective beamforming approach based on the embedded element pattern\n(EEP), which contains the coupling information. The closed-form solution to the\nbeamforming vector and the corresponding directivity factor are derived. This\nmethod relies on the beam coupling factors (BCFs) between the antennas, which\nare provided in closed form. To address the high sensitivity problem, we\nformulate a constrained optimization problem and propose an EEP-aided\northogonal complement-based robust beamforming (EEP-OCRB) algorithm. Full-wave\nsimulation results validate our proposed methods. Finally, we build a prototype\nof a 5-dipole superdirective antenna array and conduct real-world experiments.\nThe measurement results demonstrate the realization of the superdirectivity\nwith our EEP-based method, as well as the robustness of the proposed EEP-OCRB\nalgorithm to excitation errors.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:55:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gao","Mengying",""],["Yin","Haifan",""],["Han","Liangcheng",""]]}
{"id":"2308.11935","submitter":"Liang Cheng","authors":"Liang Cheng, Tian Xiang, Jingbo Qi","title":"Magnetic-order-mediated carrier and phonon dynamics in MnBi2Te4","comments":"4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the quasiparticle dynamics in MnBi2Te4 single crystal using\nthe ultrafast optical spectroscopy. Our results show that there exist anomalous\ndynamical optical responses below the antiferromagnetic (AFM) ordering\ntemperature TN. In specific, we reveal that both the initial carrier decay and\nrecombination processes can be modulated via introducing the AFM order in\nsub-picosecond and picosecond timescales, respectively. We also discover a long\nrelaxation process emerging below TN with a timescale approaching to the\nnanosecond regime, and can be attributed to the T-dependent spin-lattice\ninteraction. There also emerges an unusual phonon energy renormalization below\nTN , which is found to arise from its coupling the spin degree via the exchange\ninteraction and magnetic anisotropy. Our findings provide key information for\nunderstanding the dynamical properties of non-equilibrium carrier, spin and\nlattice in MnBi2Te4.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:57:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cheng","Liang",""],["Xiang","Tian",""],["Qi","Jingbo",""]]}
{"id":"2308.11936","submitter":"Won Kyu Kim","authors":"Won Kyu Kim, Kiri Choi, Changbong Hyeon, Seogjoo J. Jang","title":"General Chemical Reaction Network Theory for GPCR-based Olfactory\n  Sensing: Elucidation of Odorant Mixture Effects and Agonist-Synergist\n  Threshold","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN physics.bio-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents a general chemical reaction network theory for olfactory\nsensing processes that employ G-protein-coupled receptors as olfactory\nreceptors (ORs). The theory is applicable to general mixtures of odorants and\nan arbitrary number of ORs. Reactions of ORs with G-proteins, both in the\npresence and the absence of odorants, are explicitly considered. A unique\nfeature of the theory is the definition of an odor activity vector consisting\nof strengths of odorant-induced signals from ORs relative to those due to\nbackground G-protein activity in the absence of odorants. It is demonstrated\nthat each component of the odor activity defined this way reduces to a\nMichaelis-Menten form capable of accounting for cooperation or competition\neffects between different odorants. The main features of the theory are\nillustrated for a two-odorant mixture. Known and potential mixture effects,\nsuch as suppression, shadowing, inhibition, and synergy are quantitatively\ndescribed. Effects of relative values of rate constants, basal activity, and\nG-protein concentration are also demonstrated.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:59:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kim","Won Kyu",""],["Choi","Kiri",""],["Hyeon","Changbong",""],["Jang","Seogjoo J.",""]]}
{"id":"2308.11937","submitter":"Xiao Wang","authors":"Chengguo Yuan, Yu Jin, Zongzhen Wu, Fanting Wei, Yangzirui Wang, Lan\n  Chen, and Xiao Wang","title":"Learning Bottleneck Transformer for Event Image-Voxel Feature Fusion\n  based Classification","comments":"Accepted by PRCV-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recognizing target objects using an event-based camera draws more and more\nattention in recent years. Existing works usually represent the event streams\ninto point-cloud, voxel, image, etc, and learn the feature representations\nusing various deep neural networks. Their final results may be limited by the\nfollowing factors: monotonous modal expressions and the design of the network\nstructure. To address the aforementioned challenges, this paper proposes a\nnovel dual-stream framework for event representation, extraction, and fusion.\nThis framework simultaneously models two common representations: event images\nand event voxels. By utilizing Transformer and Structured Graph Neural Network\n(GNN) architectures, spatial information and three-dimensional stereo\ninformation can be learned separately. Additionally, a bottleneck Transformer\nis introduced to facilitate the fusion of the dual-stream information.\nExtensive experiments demonstrate that our proposed framework achieves\nstate-of-the-art performance on two widely used event-based classification\ndatasets. The source code of this work is available at:\n\\url{https://github.com/Event-AHU/EFV_event_classification}\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:07:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yuan","Chengguo",""],["Jin","Yu",""],["Wu","Zongzhen",""],["Wei","Fanting",""],["Wang","Yangzirui",""],["Chen","Lan",""],["Wang","Xiao",""]]}
{"id":"2308.11938","submitter":"Faizuddin Ahmed","authors":"Faizuddin Ahmed","title":"A new five-dimensional vacuum-defect wormhole space-time","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a novel extension to the Klinkahmer-vacuum defect model by\nincorporating a fifth spatial coordinate, resulting in a comprehensive\nfive-dimensional wormhole space-time. This extension preserves its status as a\nvacuum solution to the field equations in five-dimensions. We delve into the\nbehavior of geodesic equations in the proximity of this wormhole, shedding\nlight on its intriguing properties.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:13:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ahmed","Faizuddin",""]]}
{"id":"2308.11939","submitter":"Md Sabbirul Haque","authors":"Md Sabbirul Haque, Md Shahedul Amin, Jonayet Miah","title":"Retail Demand Forecasting: A Comparative Study for Multivariate Time\n  Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate demand forecasting in the retail industry is a critical determinant\nof financial performance and supply chain efficiency. As global markets become\nincreasingly interconnected, businesses are turning towards advanced prediction\nmodels to gain a competitive edge. However, existing literature mostly focuses\non historical sales data and ignores the vital influence of macroeconomic\nconditions on consumer spending behavior. In this study, we bridge this gap by\nenriching time series data of customer demand with macroeconomic variables,\nsuch as the Consumer Price Index (CPI), Index of Consumer Sentiment (ICS), and\nunemployment rates. Leveraging this comprehensive dataset, we develop and\ncompare various regression and machine learning models to predict retail demand\naccurately.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:14:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Haque","Md Sabbirul",""],["Amin","Md Shahedul",""],["Miah","Jonayet",""]]}
{"id":"2308.11940","submitter":"Zhifang Guo","authors":"Zhifang Guo, Jianguo Mao, Rui Tao, Long Yan, Kazushige Ouchi, Hong\n  Liu, Xiangdong Wang","title":"Audio Generation with Multiple Conditional Diffusion Model","comments":"Submitted to AAAI 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Text-based audio generation models have limitations as they cannot encompass\nall the information in audio, leading to restricted controllability when\nrelying solely on text. To address this issue, we propose a novel model that\nenhances the controllability of existing pre-trained text-to-audio models by\nincorporating additional conditions including content (timestamp) and style\n(pitch contour and energy contour) as supplements to the text. This approach\nachieves fine-grained control over the temporal order, pitch, and energy of\ngenerated audio. To preserve the diversity of generation, we employ a trainable\ncontrol condition encoder that is enhanced by a large language model and a\ntrainable Fusion-Net to encode and fuse the additional conditions while keeping\nthe weights of the pre-trained text-to-audio model frozen. Due to the lack of\nsuitable datasets and evaluation metrics, we consolidate existing datasets into\na new dataset comprising the audio and corresponding conditions and use a\nseries of evaluation metrics to evaluate the controllability performance.\nExperimental results demonstrate that our model successfully achieves\nfine-grained control to accomplish controllable audio generation. Audio samples\nand our dataset are publicly available at\nhttps://conditionaudiogen.github.io/conditionaudiogen/\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:21:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Guo","Zhifang",""],["Mao","Jianguo",""],["Tao","Rui",""],["Yan","Long",""],["Ouchi","Kazushige",""],["Liu","Hong",""],["Wang","Xiangdong",""]]}
{"id":"2308.11941","submitter":"Xiyu Wang","authors":"Xiyu Wang, Anh-Dung Dinh, Daochang Liu, Chang Xu","title":"Boosting Diffusion Models with an Adaptive Momentum Sampler","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion probabilistic models (DPMs) have been shown to generate\nhigh-quality images without the need for delicate adversarial training.\nHowever, the current sampling process in DPMs is prone to violent shaking. In\nthis paper, we present a novel reverse sampler for DPMs inspired by the\nwidely-used Adam optimizer. Our proposed sampler can be readily applied to a\npre-trained diffusion model, utilizing momentum mechanisms and adaptive\nupdating to smooth the reverse sampling process and ensure stable generation,\nresulting in outputs of enhanced quality. By implicitly reusing update\ndirections from early steps, our proposed sampler achieves a better balance\nbetween high-level semantics and low-level details. Additionally, this sampler\nis flexible and can be easily integrated into pre-trained DPMs regardless of\nthe sampler used during training. Our experimental results on multiple\nbenchmarks demonstrate that our proposed reverse sampler yields remarkable\nimprovements over different baselines. We will make the source code available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:22:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Xiyu",""],["Dinh","Anh-Dung",""],["Liu","Daochang",""],["Xu","Chang",""]]}
{"id":"2308.11942","submitter":"Tomo Nakagawa","authors":"Tomo Nakagawa, Makoto Tsubota, Keegan Gunther and Yoonseok Lee","title":"Dynamics of pinned quantized vortices in superfluid $^4$He in a\n  microelectromechanical oscillator","comments":"11 pages + supplement, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.other physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We numerically studied the vortex dynamics at zero temperature in superfluid\n$^4$He confined between two parallel rough solid boundaries, one of which\noscillates in a shear mode. This study was motivated by the experimental work\nby Barquist $et$ $al.$ which employed a microelectromechanical systems (MEMS)\noscillator operating in superfluid $^4$He at a near-zero temperature. Their\nexperiments suggest that the motion of the MEMS oscillator is damped by\nquantized vortices. In our study, we postulated that this damping effect was\nclosely associated with vortex pinning phenomena and developed pinning models\nincorporating the dissipation of vortices. Our primary objective is to\nunderstand the vortex dynamics in the presence of pinning and to provide\ninsight into the experimental observations regarding the damping mechanism. We\nconfirmed that Kelvin waves were excited in the pinned vortices when the\noscillation frequency of the solid boundary matched with the mode frequency of\nthe Kelvin wave. Additionally, we examined the formation and evolution of\nvortex tangles between the boundaries. The vortex tangle was suppressed in the\npresence of pinning, while the absence of pinning allowed to form well\ndeveloped vortex tangle resulting in turbulence. Finally, by evaluating the\ntension of pinned vortices we extracted the damping force acting on the solid\nboundaries.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:29:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nakagawa","Tomo",""],["Tsubota","Makoto",""],["Gunther","Keegan",""],["Lee","Yoonseok",""]]}
{"id":"2308.11943","submitter":"Adam Lehavi","authors":"Steve Vott, Adam M. Lehavi","title":"RamseyRL: A Framework for Intelligent Ramsey Number Counterexample\n  Searching","comments":"8 pages, 4 figures, submitted to AAAI2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Ramsey number is the minimum number of nodes, $n = R(s, t)$, such that\nall undirected simple graphs of order $n$, contain a clique of order $s$, or an\nindependent set of order $t$. This paper explores the application of a best\nfirst search algorithm and reinforcement learning (RL) techniques to find\ncounterexamples to specific Ramsey numbers. We incrementally improve over prior\nsearch methods such as random search by introducing a graph vectorization and\ndeep neural network (DNN)-based heuristic, which gauge the likelihood of a\ngraph being a counterexample. The paper also proposes algorithmic optimizations\nto confine a polynomial search runtime. This paper does not aim to present new\ncounterexamples but rather introduces and evaluates a framework supporting\nRamsey counterexample exploration using other heuristics. Code and methods are\nmade available through a PyPI package and GitHub repository.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:32:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Vott","Steve",""],["Lehavi","Adam M.",""]]}
{"id":"2308.11944","submitter":"Nitin Vashishtha","authors":"Nitin Vashishtha, Satabdwa Majumdar, Ritesh Patel, Vaibhav Pant,\n  Dipankar Banerjee","title":"Exploring the Impact of Imaging Cadence on Inferring CME Kinematics","comments":"21 Pages, 7 Figures, 18 Figures in Supplementary material, accepted\n  for publication in Frontiers in Astronomy and Space Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The kinematics of coronal mass ejections (CMEs) are essential for\nunderstanding their initiation mechanisms and predicting their planetary\nimpact. Most acceleration and deceleration occur below 4 R$\\odot$, which is\ncrucial for initiation understanding. Furthermore, the kinematics of CMEs in\nthe inner corona ($<$ 3 R$_\\odot$) are closely related to their propagation in\nthe outer corona and their eventual impact on Earth. Since the CME kinematics\nare mainly probed using coronagraph data, it is crucial to investigate how\nimaging cadence affects the precision of data analysis and conclusions drawn\nand also for determining the flexibility of designing observational campaigns\nwith upcoming coronagraphs. We study ten CMEs observed by the K-Coronagraph of\nthe MLSO. We manually track the CMEs using high cadence (15 s) white-light\nobservations of K-Cor and vary the cadence as 30 s, 1 min, 2 min, and 5 min to\nstudy the impact of cadence on the kinematics. We also employed the\nbootstrapping method to estimate the fitting parameters. Our results indicate\nthat the average velocity of the CMEs does not have a high dependence on the\nimaging cadence, while the average acceleration shows significant dependence on\nthe same, with the confidence interval showing significant shifts for the\naverage acceleration for different cadences. The decrease in cadence also\ninfluences the determination of acceleration onset time. We further find that\nit is difficult to find an optimum cadence to study all CMEs, as it is also\ninfluenced by the pixel resolution of the instrument and the speed of the CME.\nHowever, except for very slow CMEs (speeds less than 300 Kms$^{-1}$), our\nresults indicate a cadence of 1 min to be reasonable for the study of their\nkinematics. The results of this work will be important in the planning of\nobservational campaigns for the existing and upcoming missions that will\nobserve the inner corona.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:37:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Vashishtha","Nitin",""],["Majumdar","Satabdwa",""],["Patel","Ritesh",""],["Pant","Vaibhav",""],["Banerjee","Dipankar",""]]}
{"id":"2308.11945","submitter":"Siqi Yang","authors":"Siqi Yang, Zejun Yang, Zhisheng Wang","title":"LongDanceDiff: Long-term Dance Generation with Conditional Diffusion\n  Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dancing with music is always an essential human art form to express emotion.\nDue to the high temporal-spacial complexity, long-term 3D realist dance\ngeneration synchronized with music is challenging. Existing methods suffer from\nthe freezing problem when generating long-term dances due to error accumulation\nand training-inference discrepancy. To address this, we design a conditional\ndiffusion model, LongDanceDiff, for this sequence-to-sequence long-term dance\ngeneration, addressing the challenges of temporal coherency and spatial\nconstraint. LongDanceDiff contains a transformer-based diffusion model, where\nthe input is a concatenation of music, past motions, and noised future motions.\nThis partial noising strategy leverages the full-attention mechanism and learns\nthe dependencies among music and past motions. To enhance the diversity of\ngenerated dance motions and mitigate the freezing problem, we introduce a\nmutual information minimization objective that regularizes the dependency\nbetween past and future motions. We also address common visual quality issues\nin dance generation, such as foot sliding and unsmooth motion, by incorporating\nspatial constraints through a Global-Trajectory Modulation (GTM) layer and\nmotion perceptual losses, thereby improving the smoothness and naturalness of\nmotion generation. Extensive experiments demonstrate a significant improvement\nin our approach over the existing state-of-the-art methods. We plan to release\nour codes and models soon.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:37:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Siqi",""],["Yang","Zejun",""],["Wang","Zhisheng",""]]}
{"id":"2308.11946","submitter":"Yifan Zhang","authors":"Yifan Zhang, Rui Wu, Sergiu M. Dascalu, Frederick C. Harris Jr","title":"Multi-scale Transformer Pyramid Networks for Multivariate Time Series\n  Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multivariate Time Series (MTS) forecasting involves modeling temporal\ndependencies within historical records. Transformers have demonstrated\nremarkable performance in MTS forecasting due to their capability to capture\nlong-term dependencies. However, prior work has been confined to modeling\ntemporal dependencies at either a fixed scale or multiple scales that\nexponentially increase (most with base 2). This limitation hinders their\neffectiveness in capturing diverse seasonalities, such as hourly and daily\npatterns. In this paper, we introduce a dimension invariant embedding technique\nthat captures short-term temporal dependencies and projects MTS data into a\nhigher-dimensional space, while preserving the dimensions of time steps and\nvariables in MTS data. Furthermore, we present a novel Multi-scale Transformer\nPyramid Network (MTPNet), specifically designed to effectively capture temporal\ndependencies at multiple unconstrained scales. The predictions are inferred\nfrom multi-scale latent representations obtained from transformers at various\nscales. Extensive experiments on nine benchmark datasets demonstrate that the\nproposed MTPNet outperforms recent state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:40:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Yifan",""],["Wu","Rui",""],["Dascalu","Sergiu M.",""],["Harris","Frederick C.","Jr"]]}
{"id":"2308.11947","submitter":"Yu Yan","authors":"Yifei Pan, Jianfei Wang, Yu Yan","title":"On the Local Regularity of the Hilbert Transform","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper the local regularity of the Hilbert transform is considered,\nand local smoothness and real analyticity results are obtained.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:41:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pan","Yifei",""],["Wang","Jianfei",""],["Yan","Yu",""]]}
{"id":"2308.11948","submitter":"Xiyu Wang","authors":"Xiyu Wang, Baijiong Lin, Daochang Liu, Chang Xu","title":"Efficient Transfer Learning in Diffusion Models via Adversarial Noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion Probabilistic Models (DPMs) have demonstrated substantial promise\nin image generation tasks but heavily rely on the availability of large amounts\nof training data. Previous works, like GANs, have tackled the limited data\nproblem by transferring pre-trained models learned with sufficient data.\nHowever, those methods are hard to be utilized in DPMs since the distinct\ndifferences between DPM-based and GAN-based methods, showing in the unique\niterative denoising process integral and the need for many timesteps with\nno-targeted noise in DPMs. In this paper, we propose a novel DPMs-based\ntransfer learning method, TAN, to address the limited data problem. It includes\ntwo strategies: similarity-guided training, which boosts transfer with a\nclassifier, and adversarial noise selection which adaptive chooses targeted\nnoise based on the input image. Extensive experiments in the context of\nfew-shot image generation tasks demonstrate that our method is not only\nefficient but also excels in terms of image quality and diversity when compared\nto existing GAN-based and DDPM-based methods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:44:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Xiyu",""],["Lin","Baijiong",""],["Liu","Daochang",""],["Xu","Chang",""]]}
{"id":"2308.11949","submitter":"Hu Yu","authors":"Hu Yu, Jie Huang, Kaiwen Zheng, Man Zhou and Feng Zhao","title":"High-quality Image Dehazing with Diffusion Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image dehazing is quite challenging in dense-haze scenarios, where quite less\noriginal information remains in the hazy image. Though previous methods have\nmade marvelous progress, they still suffer from information loss in content and\ncolor in dense-haze scenarios. The recently emerged Denoising Diffusion\nProbabilistic Model (DDPM) exhibits strong generation ability, showing\npotential for solving this problem. However, DDPM fails to consider the physics\nproperty of dehazing task, limiting its information completion capacity. In\nthis work, we propose DehazeDDPM: A DDPM-based and physics-aware image dehazing\nframework that applies to complex hazy scenarios. Specifically, DehazeDDPM\nworks in two stages. The former stage physically models the dehazing task with\nthe Atmospheric Scattering Model (ASM), pulling the distribution closer to the\nclear data and endowing DehazeDDPM with fog-aware ability. The latter stage\nexploits the strong generation ability of DDPM to compensate for the\nhaze-induced huge information loss, by working in conjunction with the physical\nmodelling. Extensive experiments demonstrate that our method attains\nstate-of-the-art performance on both synthetic and real-world hazy datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:45:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yu","Hu",""],["Huang","Jie",""],["Zheng","Kaiwen",""],["Zhou","Man",""],["Zhao","Feng",""]]}
{"id":"2308.11950","submitter":"Piotr Micek","authors":"Gwena\\\"el Joret, Piotr Micek, Micha{\\l} Pilipczuk, Bartosz Walczak","title":"Cliquewidth and dimension","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that every poset with bounded cliquewidth and with sufficiently\nlarge dimension contains the standard example of dimension $k$ as a subposet.\nThis applies in particular to posets whose cover graphs have bounded treewidth,\nas the cliquewidth of a poset is bounded in terms of the treewidth of the cover\ngraph. For the latter posets, we prove a stronger statement: every such poset\nwith sufficiently large dimension contains the Kelly example of dimension $k$\nas a subposet. Using this result, we obtain a full characterization of the\nminor-closed graph classes $\\mathcal{C}$ such that posets with cover graphs in\n$\\mathcal{C}$ have bounded dimension: they are exactly the classes excluding\nthe cover graph of some Kelly example. Finally, we consider a variant of poset\ndimension called Boolean dimension, and we prove that posets with bounded\ncliquewidth have bounded Boolean dimension.\n  The proofs rely on Colcombet's deterministic version of Simon's factorization\ntheorem, which is a fundamental tool in formal language and automata theory,\nand which we believe deserves a wider recognition in structural and algorithmic\ngraph theory.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:47:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Joret","Gwena\u00ebl",""],["Micek","Piotr",""],["Pilipczuk","Micha\u0142",""],["Walczak","Bartosz",""]]}
{"id":"2308.11951","submitter":"Chunjin Song","authors":"Chunjin Song, Bastian Wandt, Helge Rhodin","title":"Pose Modulated Avatars from Video","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is now possible to reconstruct dynamic human motion and shape from a\nsparse set of cameras using Neural Radiance Fields (NeRF) driven by an\nunderlying skeleton. However, a challenge remains to model the deformation of\ncloth and skin in relation to skeleton pose. Unlike existing avatar models that\nare learned implicitly or rely on a proxy surface, our approach is motivated by\nthe observation that different poses necessitate unique frequency assignments.\nNeglecting this distinction yields noisy artifacts in smooth areas or blurs\nfine-grained texture and shape details in sharp regions. We develop a\ntwo-branch neural network that is adaptive and explicit in the frequency\ndomain. The first branch is a graph neural network that models correlations\namong body parts locally, taking skeleton pose as input. The second branch\ncombines these correlation features to a set of global frequencies and then\nmodulates the feature encoding. Our experiments demonstrate that our network\noutperforms state-of-the-art methods in terms of preserving details and\ngeneralization capabilities.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:49:07 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 18:52:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Song","Chunjin",""],["Wandt","Bastian",""],["Rhodin","Helge",""]]}
{"id":"2308.11952","submitter":"Prateek Jain","authors":"Prateek Jain, Amit Joshi and Saraju Mohanty","title":"iGLU 4.0: A continuous glucose monitoring and balancing paradigm with\n  physiological parameters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.data-an physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The conventional method of glucose measurement such as pricking blood from\nthe body is prevalent which brings pain and trauma. Invasive methods of\nmeasurement sometimes raise the risk of blood infection to the patient.\nSometimes, some of the physiological parameters such as body temperature and\nsystolic blood pressure (SBP) are responsible for blood glucose level\nfluctuations. Moreover, diabetes for a long duration usually becomes a critical\nissue. In such situation, patients need to consult diabetologist frequently,\nwhich is not possible in normal life. Therefore, it is required to develop\nnon-invasive glucose balancing paradigm, which measures blood glucose without\npricking blood along with physiological parameters measurement and decision\nmodel. The proposed paradigm helps to doctor, who is even available at remote\nlocation. There will not be any need to consult frequently. In the way of\noptimized non-invasive system design, an NIRS technique with specific\nwavelengths along with physiological parameters is taken to predict the precise\nglucose value. The all parameters (glucose, Blood pressure and body\ntemperature), food intake and insulin levels are parts of decision model, which\nwould help to the doctor to take decision related to the further medicine doses\nand diet plan. The patients would have suggestions according to maintain their\nblood glucose level. The proposed system demonstrated an accurate model with\nMARD and AvgE 12.50% and 12.10% respectively using DNN model. Coefficient of\ndetermination R2 has been found 0.97.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:49:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jain","Prateek",""],["Joshi","Amit",""],["Mohanty","Saraju",""]]}
{"id":"2308.11953","submitter":"Geng Tian","authors":"Chao Huang, Geng Tian, Ming Tang","title":"When MiniBatch SGD Meets SplitFed Learning:Convergence Analysis and\n  Performance Evaluation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) enables collaborative model training across\ndistributed clients (e.g., edge devices) without sharing raw data. Yet, FL can\nbe computationally expensive as the clients need to train the entire model\nmultiple times. SplitFed learning (SFL) is a recent distributed approach that\nalleviates computation workload at the client device by splitting the model at\na cut layer into two parts, where clients only need to train part of the model.\nHowever, SFL still suffers from the \\textit{client drift} problem when clients'\ndata are highly non-IID. To address this issue, we propose MiniBatch-SFL. This\nalgorithm incorporates MiniBatch SGD into SFL, where the clients train the\nclient-side model in an FL fashion while the server trains the server-side\nmodel similar to MiniBatch SGD. We analyze the convergence of MiniBatch-SFL and\nshow that the bound of the expected loss can be obtained by analyzing the\nexpected server-side and client-side model updates, respectively. The\nserver-side updates do not depend on the non-IID degree of the clients'\ndatasets and can potentially mitigate client drift. However, the client-side\nmodel relies on the non-IID degree and can be optimized by properly choosing\nthe cut layer. Perhaps counter-intuitive, our empirical result shows that a\nlatter position of the cut layer leads to a smaller average gradient divergence\nand a better algorithm performance. Moreover, numerical results show that\nMiniBatch-SFL achieves higher accuracy than conventional SFL and FL. The\naccuracy improvement can be up to 24.1\\% and 17.1\\% with highly non-IID data,\nrespectively.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:51:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Chao",""],["Tian","Geng",""],["Tang","Ming",""]]}
{"id":"2308.11954","submitter":"Nojoon Myoung Prof.","authors":"Nojoon Myoung, Taegeun Song, Hee Chul Park","title":"Detecting Strain Effects due to Nanobubbles in Graphene Mach-Zehnder\n  Interferometers","comments":"17 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the effect of elastic strain on a Mach-Zehnder (MZ)\ninterferometer created by graphene p-n junction in quantum Hall regime. We\ndemonstrate that a Gaussian-shaped nanobubble causes detuning of the quantum\nHall conductance oscillations across the p-n junction, due to the\nstrain-induced local pseudo-magnetic fields. By performing a\nmachine-learning-based Fourier analysis, we differentiate the\nnanobubble-induced Fourier component from the conductance oscillations\noriginating from the external magnetic fields. We show that the detuning of the\nconductance oscillations is due to the altered pathway of quantum Hall\ninterface channels caused by the strain-induced pseudo-magnetic fields. In the\npresence of the nanobubble, a new Fourier component for a magnetic flux\n$\\Phi_{0}/2$ appears, and the corresponding MZ interferometry indicates that\nthe enclosed area is reduced by half due to the strain-mediated pathway between\ntwo quantum Hall interface channels. Our findings suggest the potential of\nusing graphene as a strain sensor for developments in graphene-based device\nfabrications and measurements technologies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:52:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Myoung","Nojoon",""],["Song","Taegeun",""],["Park","Hee Chul",""]]}
{"id":"2308.11955","submitter":"Bastien DI PIERRO","authors":"C. Jacques (LMFA), B. Di Pierro (LMFA), F. Alizard (LMFA), M. Buffat\n  (LMFA), A. Cadiou (LMFA), L. Le Penven (LMFA)","title":"Stability of variable density rotating flows: Inviscid case and viscous\n  effects in the limit of large Reynolds numbers","comments":null,"journal-ref":"Physical Review Fluids, 2023, 8 (3), pp.033901","doi":"10.1103/PhysRevFluids.8.033901","report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear stability of solid body rotating flows with axisymmetric density\nvariations is addressed analytically. Considering inviscid disturbances, a non\ntrivial dispersion relation is obtained and it is shown that the instability is\nof Rayleigh-Taylor type in cylindrical frame. The viscous correction is\nderived, in the limit of large Reynolds numbers and large azimuthal wave\nnumbers, allowing the determination of the most unstable mode. Theoretical\npredictions are checked by comparing them to (spectrally accurate) computed\neigenvalues and direct numerical simulations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:52:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jacques","C.","","LMFA"],["Di Pierro","B.","","LMFA"],["Alizard","F.","","LMFA"],["Buffat","M.","","LMFA"],["Cadiou","A.","","LMFA"],["Penven","L. Le","","LMFA"]]}
{"id":"2308.11956","submitter":"Vivek Sahu","authors":"Adimurthi, Prosenjit Roy, Vivek Sahu","title":"Fractional boundary Hardy inequality for the critical case","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish fractional boundary Hardy-type inequality for the critical\ncases. In 2004, Dyda established the inequalities for the subcritical regime,\nwhereas we establish more general inequalities (Caffarelli-Kohn-Nirenberg type)\nfor the critical cases.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:53:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Adimurthi","",""],["Roy","Prosenjit",""],["Sahu","Vivek",""]]}
{"id":"2308.11957","submitter":"Heinrich Dinkel","authors":"Heinrich Dinkel, Yongqing Wang, Zhiyong Yan, Junbo Zhang, Yujun Wang","title":"CED: Consistent ensemble distillation for audio tagging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Augmentation and knowledge distillation (KD) are well-established techniques\nemployed in the realm of audio classification tasks, aimed at enhancing\nperformance and reducing model sizes on the widely recognized Audioset (AS)\nbenchmark. Although both techniques are effective individually, their combined\nuse, called consistent teaching, hasn't been explored before. This paper\nproposes CED, a simple training framework that distils student models from\nlarge teacher ensembles with consistent teaching. To achieve this, CED\nefficiently stores logits as well as the augmentation methods on disk, making\nit scalable to large-scale datasets. Central to CED's efficacy is its\nlabel-free nature, meaning that only the stored logits are used for the\noptimization of a student model only requiring 0.3\\% additional disk space for\nAS. The study trains various transformer-based models, including a 10M\nparameter model achieving a 49.0 mean average precision (mAP) on AS. Pretrained\nmodels and code are available at https://github.com/RicherMans/CED.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:57:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dinkel","Heinrich",""],["Wang","Yongqing",""],["Yan","Zhiyong",""],["Zhang","Junbo",""],["Wang","Yujun",""]]}
{"id":"2308.11958","submitter":"Saurabh Kumar","authors":"Saurabh Kumar, Henrik Marklund, Benjamin Van Roy","title":"Maintaining Plasticity via Regenerative Regularization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In continual learning, plasticity refers to the ability of an agent to\nquickly adapt to new information. Neural networks are known to lose plasticity\nwhen processing non-stationary data streams. In this paper, we propose L2 Init,\na very simple approach for maintaining plasticity by incorporating in the loss\nfunction L2 regularization toward initial parameters. This is very similar to\nstandard L2 regularization (L2), the only difference being that L2 regularizes\ntoward the origin. L2 Init is simple to implement and requires selecting only a\nsingle hyper-parameter. The motivation for this method is the same as that of\nmethods that reset neurons or parameter values. Intuitively, when recent losses\nare insensitive to particular parameters, these parameters drift toward their\ninitial values. This prepares parameters to adapt quickly to new tasks. On\nsimple problems representative of different types of nonstationarity in\ncontinual learning, we demonstrate that L2 Init consistently mitigates\nplasticity loss. We additionally find that our regularization term reduces\nparameter magnitudes and maintains a high effective feature rank.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:57:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kumar","Saurabh",""],["Marklund","Henrik",""],["Van Roy","Benjamin",""]]}
{"id":"2308.11959","submitter":"Donya Nojavanzadeh","authors":"Donya Nojavanzadeh, Zhenwei Liu, Ali Saberi, and Anton A. Stoorvogel","title":"Scalable {\\delta}-Level Coherent State Synchronization of Multi-Agent\n  Systems in the Presence of Bounded Disturbances","comments":"18 pages, 11 figures, This is a preprint of the paper \"Scalable\n  {\\delta}-Level Coherent State Synchronization of Multi-Agent Systems with\n  Adaptive Protocols and Bounded Disturbances\" submitted to the International\n  Journal of Robust and Nonlinear Control","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we study scalable {\\delta}-Level coherent state\nsynchronization for multi-agent systems (MAS) where the agents are subject to\nbounded disturbances/noises. We propose a scale-free framework designed solely\nbased on the knowledge of agent models and agnostic to the communication graphs\nand size of the network. We define the level of coherency for each agent as the\nnorm of the weighted sum of the disagreement dynamics with its neighbors. The\nobjective is to restrict the level of coherency of the network to {\\delta}\nwithout a-priori information about the disturbances.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:58:03 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 06:51:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Nojavanzadeh","Donya",""],["Liu","Zhenwei",""],["Saberi","Ali",""],["Stoorvogel","Anton A.",""]]}
{"id":"2308.11960","submitter":"Ruijie Xu","authors":"Ruijie Xu","title":"Combinatorial insight of Riemann Boundary value problem in lattice walk\n  problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Enumeration of quarter-plane lattice walks with small steps is a classical\nproblem in combinatorics. An effective approach is the kernel method and the\nsolution is derived by positive term extraction. Another approach is to reduce\nthe lattice walk problem to a Carleman type Riemann boundary value problem\n(RBVP) and solve it by complex analysis. There are two parameter characterizing\nthe solutions of a Carleman type Riemann Boundary value problem, the index\n$\\chi$ and the conformal gluing function $w(x)$. In this paper, we propose a\ncombinatorial insight to the RBVP approach. We show that the index can be\ntreated as the canonical factorization in the kernel method and the conformal\ngluing function can be turned into a conformal mapping such that after this\nmapping, the positive degree terms and the negative degree terms can be\nnaturally separated. The combinatorial insight of RBVP provide a connection\nbetween the kernel method, the RBVP approach and the Tutte's invariant method.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:58:21 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 03:40:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Ruijie",""]]}
{"id":"2308.11961","submitter":"Sarah Keren","authors":"Adi Amuzig, David Dovrat and Sarah Keren","title":"Value of Assistance for Mobile Agents","comments":"IROS 2023. git repository: https://github.com/CLAIR-LAB-TECHNION/VOA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mobile robotic agents often suffer from localization uncertainty which grows\nwith time and with the agents' movement. This can hinder their ability to\naccomplish their task. In some settings, it may be possible to perform\nassistive actions that reduce uncertainty about a robot's location. For\nexample, in a collaborative multi-robot system, a wheeled robot can request\nassistance from a drone that can fly to its estimated location and reveal its\nexact location on the map or accompany it to its intended location. Since\nassistance may be costly and limited, and may be requested by different members\nof a team, there is a need for principled ways to support the decision of which\nassistance to provide to an agent and when, as well as to decide which agent to\nhelp within a team. For this purpose, we propose Value of Assistance (VOA) to\nrepresent the expected cost reduction that assistance will yield at a given\npoint of execution. We offer ways to compute VOA based on estimations of the\nrobot's future uncertainty, modeled as a Gaussian process. We specify\nconditions under which our VOA measures are valid and empirically demonstrate\nthe ability of our measures to predict the agent's average cost reduction when\nreceiving assistance in both simulated and real-world robotic settings.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:02:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Amuzig","Adi",""],["Dovrat","David",""],["Keren","Sarah",""]]}
{"id":"2308.11962","submitter":"florent Cabric","authors":"Florent Cabric (AVIZ), Margr\\'et Vilborg Bjarnad\\'ottir, Anne-Flore\n  Cabouat (AVIZ), Petra Isenberg (AVIZ)","title":"Open Questions about the Visualization of Sociodemographic Data","comments":null,"journal-ref":"IEEE Workshop on Visualization for Social Good (VIS4Good), Oct\n  2023, Melbourne, Australia. pp.5","doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper collects a set of open research questions on how to visualize\nsociodemographic data. Sociodemographic data is a common part of datasets\nrelated to people, including institutional censuses, health data systems, and\nhuman-resources fles. This data is sensitive, and its collection, sharing, and\nanalysis require careful consideration. For instance, the European Union,\nthrough the General Data Protection Regulation (GDPR), protects the collection\nand processing of any personal data, including sexual orientation, ethnicity,\nand religion. Data visualization of sociodemographic data can reinforce\nstereotypes, marginalize groups, and lead to biased decision-making. It is,\ntherefore, critical that these visualizations are created based on good,\nequitable design principles. In this paper, we discuss and provide a set of\nopen research questions around the visualization of sociodemographic data. Our\nwork contributes to an ongoing refection on representing data about people and\nhighlights some important future research directions for the VIS community. A\nversion of this paper and its fgures are available online at osf.io/a2u9c.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:06:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cabric","Florent","","AVIZ"],["Bjarnad\u00f3ttir","Margr\u00e9t Vilborg","","AVIZ"],["Cabouat","Anne-Flore","","AVIZ"],["Isenberg","Petra","","AVIZ"]]}
{"id":"2308.11963","submitter":"Ryo Ohashi","authors":"Ryo Ohashi","title":"On the Rosenhain forms of superspecial curves of genus two","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we examine superspecial genus-2 curves $C: y^2 =\nx(x-1)(x-\\lambda)(x-\\mu)(x-\\nu)$ in odd characteristic $p$. As a main result,\nwe show that the difference between any two elements in\n$\\{0,1,\\lambda,\\mu,\\nu\\}$ is a square in $\\mathbb{F}_{p^2}$. Moreover, we show\nthat $C$ is maximal or minimal over $\\mathbb{F}_{p^2}$ without taking its\n$\\mathbb{F}_{p^2}$-form (we also give a criterion in terms of $p$ that tells\nwhether $C$ is maximal or minimal). As these applications, we study the\nmaximality of superspecial hyperelliptic curves of genus $3$ and $4$ whose\nautomorphism groups contain $\\mathbb{Z}/2\\mathbb{Z} \\times\n\\mathbb{Z}/2\\mathbb{Z}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:08:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ohashi","Ryo",""]]}
{"id":"2308.11964","submitter":"Remi Cuingnet","authors":"Remi Cuingnet (VeRI)","title":"On the Computation of the Logarithm of the Modified Bessel Function of\n  the Second Kind","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The modified Bessel function of the second kind K$\\nu$ appears in a wide\nvariety of applied scientific fields. While its use is greatly facilitated by\nan implementation in most numerical libraries, overflow issues can be\nencountered especially for large value of $\\nu$. After giving some necessary\nand sufficient conditions for their occurrences, this technical note shows that\nthey can mostly be avoided by directly computing the logarithm of K$\\nu$ thanks\nto a simple and stable forward recursion. A statistical examples based on the\nGil-Pelaez inversion formula is given to illustrate the recursive method.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:09:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cuingnet","Remi","","VeRI"]]}
{"id":"2308.11965","submitter":"Niels Taubert","authors":"Niels Taubert, Anne Hobert, Najko Jahn, Andre Bruns, Elham Iravani","title":"Understanding differences of the OA uptake within the Germany university\n  landscape (2010-2020) -- Part 2: repository-provided OA","comments":"26 pages, 7 tables. arXiv admin note: text overlap with\n  arXiv:2209.12505","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates the determinants for the uptake of institutional and\nsubject repository Open Access (OA) in the university landscape of Germany and\nconsiders three factors: the disciplinary profile of universities, their OA\ninfrastructures and services and large transformative agreements. The uptake of\nOA as well as the determinants are measured by combining several data sources\n(incl. Web of Science, Unpaywall, an authority file of standardised German\naffiliation information, the ISSN-Gold-OA 4.0 list, and lists of publications\ncovered by transformative agreements). For universities OA infrastructures and\nservices, a structured data collection was created by harvesting different\nsources of information and by manual online search. To determine the\nexplanatory power of the different factors, a series of regression analyses was\nperformed for different periods and for both institutional as well as subject\nrepository OA. As a result of the regression analyses, the most determining\nfactor for the explanation of differences in the uptake of both repository\nOA-types turned out to be the disciplinary profile, whereas all variables that\ncapture local infrastructural support and services for OA turned out to be\nnon-significant. The outcome of the regression analyses is contextualised by an\ninterview study conducted with 20 OA officers of German universities. The\ncontextualisation provides hints that the original function of institutional\nrepositories, offering a channel for secondary publishing is vanishing, while a\nnew function of aggregation of metadata and full texts is becoming of\nincreasing importance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:15:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Taubert","Niels",""],["Hobert","Anne",""],["Jahn","Najko",""],["Bruns","Andre",""],["Iravani","Elham",""]]}
{"id":"2308.11966","submitter":"Madeline Nurcombe","authors":"Madeline Nurcombe","title":"The Ghost Algebra and the Dilute Ghost Algebra","comments":"46 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph hep-th math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the ghost algebra, a two-boundary generalisation of the\nTemperley-Lieb (TL) algebra, using a diagrammatic presentation. The existing\ntwo-boundary TL algebra has a basis of string diagrams with two boundaries, and\nthe number of strings connected to each boundary must be even; in the ghost\nalgebra, this number may be odd. To preserve associativity while allowing\nboundary-to-boundary strings to have distinct parameters according to the\nparity of their endpoints, as seen in the one-boundary TL algebra, we decorate\nthe boundaries with bookkeeping dots called ghosts. We also introduce the\ndilute ghost algebra, an analogous two-boundary generalisation of the dilute TL\nalgebra. We then present loop models associated with these algebras, and\nclassify solutions to their boundary Yang-Baxter equations, given existing\nsolutions to the Yang-Baxter equations for the TL and dilute TL models. This\nfacilitates the construction of a one-parameter family of commuting transfer\ntangles, making these models Yang-Baxter integrable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:22:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nurcombe","Madeline",""]]}
{"id":"2308.11967","submitter":"Jonas Frey","authors":"Jonas Frey","title":"Duality for Clans: a Refinement of Gabriel-Ulmer Duality","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT cs.LO math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Clans are representations of generalized algebraic theories that contain more\ninformation than the finite-limit categories associated to the l.f.p.\ncategories of models via Gabriel-Ulmer duality. Refining Gabriel-Ulmer duality\nto account for this additional information, this article presents a duality\ntheory between clans and l.f.p. categories equipped with a weak factorization\nsystem subject to axioms.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:25:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Frey","Jonas",""]]}
{"id":"2308.11968","submitter":"Shumai Zhang","authors":"S. M. Zhang, H. S. Xu, L. Jin","title":"Tunable Aharonov-Bohm cages through anti-$\\mathcal{PT}$-symmetric\n  imaginary couplings","comments":null,"journal-ref":"Phy. Rev. A 108, 023518 (2023)","doi":"10.1103/PhysRevA.108.023518","report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Aharonov-Bohm (AB) cage enables localized confinement with nondiffractive\npropagation for arbitrary excitation. In this study, we introduce an\nanti-parity-time (anti-$\\mathcal{PT}$) symmetric imaginary coupling in a\ngeneralized Creutz ladder to construct a non-Hermitian AB cage with tunable\nflat-band energy. We investigate compact localized states and complete\nlocalization dynamics, and show that non-Hermiticity affects the localization\nprobability distributions and increases the oscillation period of the AB cage\ndynamics. Non-Hermitian engineering of the decoupled core of the AB cage is the\nessential point in our proposal. Our approach is widely applicable to a more\ngeneral situation and can facilitate the manipulation of localization in\nphysics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:29:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","S. M.",""],["Xu","H. S.",""],["Jin","L.",""]]}
{"id":"2308.11969","submitter":"Benjamin Lambert","authors":"Benjamin Lambert, Pauline Roca, Florence Forbes, Senan Doyle and\n  Michel Dojat","title":"Anisotropic Hybrid Networks for liver tumor segmentation with\n  uncertainty quantification","comments":"Accepted for presentation at MICCAI Workshop on 2nd\n  Resource-Efficient Medical Image Analysis (REMIA)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The burden of liver tumors is important, ranking as the fourth leading cause\nof cancer mortality. In case of hepatocellular carcinoma (HCC), the delineation\nof liver and tumor on contrast-enhanced magnetic resonance imaging (CE-MRI) is\nperformed to guide the treatment strategy. As this task is time-consuming,\nneeds high expertise and could be subject to inter-observer variability there\nis a strong need for automatic tools. However, challenges arise from the lack\nof available training data, as well as the high variability in terms of image\nresolution and MRI sequence. In this work we propose to compare two different\npipelines based on anisotropic models to obtain the segmentation of the liver\nand tumors. The first pipeline corresponds to a baseline multi-class model that\nperforms the simultaneous segmentation of the liver and tumor classes. In the\nsecond approach, we train two distinct binary models, one segmenting the liver\nonly and the other the tumors. Our results show that both pipelines exhibit\ndifferent strengths and weaknesses. Moreover we propose an uncertainty\nquantification strategy allowing the identification of potential false positive\ntumor lesions. Both solutions were submitted to the MICCAI 2023 Atlas challenge\nregarding liver and tumor segmentation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:30:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lambert","Benjamin",""],["Roca","Pauline",""],["Forbes","Florence",""],["Doyle","Senan",""],["Dojat","Michel",""]]}
{"id":"2308.11970","submitter":"Daniel Neuen","authors":"Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer","title":"Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman\n  Refinements","comments":"26 pages, 5 figures, full version of a paper accepted at FOCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM cs.DS cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $k$-dimensional Weisfeiler-Leman ($k$-WL) algorithm is a simple\ncombinatorial algorithm that was originally designed as a graph isomorphism\nheuristic. It naturally finds applications in Babai's quasipolynomial time\nisomorphism algorithm, practical isomorphism solvers, and algebraic graph\ntheory. However, it also has surprising connections to other areas such as\nlogic, proof complexity, combinatorial optimization, and machine learning.\n  The algorithm iteratively computes a coloring of the $k$-tuples of vertices\nof a graph. Since F\\\"urer's linear lower bound [ICALP 2001], it has been an\nopen question whether there is a super-linear lower bound for the iteration\nnumber for $k$-WL on graphs. We answer this question affirmatively,\nestablishing an $\\Omega(n^{k/2})$-lower bound for all $k$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:32:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Grohe","Martin",""],["Lichter","Moritz",""],["Neuen","Daniel",""],["Schweitzer","Pascal",""]]}
{"id":"2308.11971","submitter":"Junyi Chen","authors":"Junyi Chen, Longteng Guo, Jia Sun, Shuai Shao, Zehuan Yuan, Liang Lin,\n  Dongyu Zhang","title":"EVE: Efficient Vision-Language Pre-training with Masked Prediction and\n  Modality-Aware MoE","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Building scalable vision-language models to learn from diverse, multimodal\ndata remains an open challenge. In this paper, we introduce an Efficient\nVision-languagE foundation model, namely EVE, which is one unified multimodal\nTransformer pre-trained solely by one unified pre-training task. Specifically,\nEVE encodes both vision and language within a shared Transformer network\nintegrated with modality-aware sparse Mixture-of-Experts (MoE) modules, which\ncapture modality-specific information by selectively switching to different\nexperts. To unify pre-training tasks of vision and language, EVE performs\nmasked signal modeling on image-text pairs to reconstruct masked signals, i.e.,\nimage pixels and text tokens, given visible signals. This simple yet effective\npre-training objective accelerates training by 3.5x compared to the model\npre-trained with Image-Text Contrastive and Image-Text Matching losses. Owing\nto the combination of the unified architecture and pre-training task, EVE is\neasy to scale up, enabling better downstream performance with fewer resources\nand faster training speed. Despite its simplicity, EVE achieves\nstate-of-the-art performance on various vision-language downstream tasks,\nincluding visual question answering, visual reasoning, and image-text\nretrieval.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:36:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Junyi",""],["Guo","Longteng",""],["Sun","Jia",""],["Shao","Shuai",""],["Yuan","Zehuan",""],["Lin","Liang",""],["Zhang","Dongyu",""]]}
{"id":"2308.11972","submitter":"Emil Dare Mr","authors":"Emil Dare, Markus Kiderlen","title":"Rotational Crofton Formulae with a Fixed Subspace","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The classical Crofton formula explains how intrinsic volumes of a convex body\n$K$ in $n$-dimensional Euclidean space can be obtained from integrating a\nmeasurement function at sections of $K$ with invariantly moved affine flats.\nMotivated by stereological applications, we present variants of Crofton's\nformula, where the flats are constrained to contain a fixed linear subspace\n$L_0$, but are otherwise invariantly rotated. This main result generalizes a\nknown rotational Crofton formula, which only covers the case $\\dim L_0=0$. The\nproof combines a suitable Blaschke--Petkantschin formula with the classical\nCrofton formula. We also argue that our main result is best possible, in the\nsense that one cannot estimate intrinsic volumes of a set, based on\nlower-dimensional sections, other than those given by our result. Finally, we\nprovide a proof for a well-established variant: an integral relation for\nvertical sections. Our formula is stated for intrinsic volumes of a given set,\ncomplementing the classical approach for Hausdorff measures.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:36:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dare","Emil",""],["Kiderlen","Markus",""]]}
{"id":"2308.11973","submitter":"Gareth Parkinson","authors":"Lena Puntscher, Kevin Daninger, Michael Schmid, Ulrike Diebold, and\n  Gareth S. Parkinson","title":"A study of Pt, Rh, Ni and Ir dispersion on anatase TiO2(101) and the\n  role of water","comments":null,"journal-ref":"Electrochimica Acta, 449 (2023) 142190","doi":"10.1016/j.electacta.2023.142190","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding how metal atoms are stabilized on metal oxide supports is\nimportant for predicting the stability of single-atom catalysts. In this study,\nwe use scanning tunnelling microscopy (STM) and x-ray photoelectron\nspectroscopy (XPS) to investigate four catalytically active metals - Platinum,\nRhodium, Nickel and Iridium - on the anatase TiO2(101) surface. The metals were\nvapor deposited at room temperature in ultrahigh vacuum (UHV) conditions, and\nalso with a background water pressure of 2x10-8 mbar. Pt and Ni exist as a\nmixture of adatoms and nanoparticles in UHV at low coverage, with the adatoms\nimmobilized at defect sites. Water has no discernible effect on the Pt\ndispersion, but significantly increases the amount of Ni single atoms. Ir is\nhighly dispersed, but sinters to nanoparticles in the water vapor background\nleading to the formation of large clusters at step edges. Rh forms clusters on\nthe terrace of anatase TiO2(101) irrespective of the environment. We conclude\nthat introducing defect sites into metal oxide supports could be a strategy to\naid the dispersion of single atoms on metal-oxide surfaces, and that the\npresence of water should be taken into account in the modelling of single-atom\ncatalysts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:39:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Puntscher","Lena",""],["Daninger","Kevin",""],["Schmid","Michael",""],["Diebold","Ulrike",""],["Parkinson","Gareth S.",""]]}
{"id":"2308.11974","submitter":"Seokhun Choi","authors":"Hyeonseop Song, Seokhun Choi, Hoseok Do, Chul Lee, Taehyeong Kim","title":"Blending-NeRF: Text-Driven Localized Editing in Neural Radiance Fields","comments":"Accepted to ICCV 2023. The first two authors contributed equally to\n  this work","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-driven localized editing of 3D objects is particularly difficult as\nlocally mixing the original 3D object with the intended new object and style\neffects without distorting the object's form is not a straightforward process.\nTo address this issue, we propose a novel NeRF-based model, Blending-NeRF,\nwhich consists of two NeRF networks: pretrained NeRF and editable NeRF.\nAdditionally, we introduce new blending operations that allow Blending-NeRF to\nproperly edit target regions which are localized by text. By using a pretrained\nvision-language aligned model, CLIP, we guide Blending-NeRF to add new objects\nwith varying colors and densities, modify textures, and remove parts of the\noriginal object. Our extensive experiments demonstrate that Blending-NeRF\nproduces naturally and locally edited 3D objects from various text prompts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:46:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Song","Hyeonseop",""],["Choi","Seokhun",""],["Do","Hoseok",""],["Lee","Chul",""],["Kim","Taehyeong",""]]}
{"id":"2308.11975","submitter":"Amr Alkhatib","authors":"Amr Alkhatib, Henrik Bostr\\\"om, Sofiane Ennadir, Ulf Johansson","title":"Approximating Score-based Explanation Techniques Using Conformal\n  Regression","comments":"20 pages, 14 figures, The 12th Symposium on Conformal and\n  Probabilistic Prediction with Applications (COPA 2023)","journal-ref":"Proceedings of Machine Learning Research (PMLR) Volume 204, Year\n  2023","doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Score-based explainable machine-learning techniques are often used to\nunderstand the logic behind black-box models. However, such explanation\ntechniques are often computationally expensive, which limits their application\nin time-critical contexts. Therefore, we propose and investigate the use of\ncomputationally less costly regression models for approximating the output of\nscore-based explanation techniques, such as SHAP. Moreover, validity guarantees\nfor the approximated values are provided by the employed inductive conformal\nprediction framework. We propose several non-conformity measures designed to\ntake the difficulty of approximating the explanations into account while\nkeeping the computational cost low. We present results from a large-scale\nempirical investigation, in which the approximate explanations generated by our\nproposed models are evaluated with respect to efficiency (interval size). The\nresults indicate that the proposed method can significantly improve execution\ntime compared to the fast version of SHAP, TreeSHAP. The results also suggest\nthat the proposed method can produce tight intervals, while providing validity\nguarantees. Moreover, the proposed approach allows for comparing explanations\nof different approximation methods and selecting a method based on how\ninformative (tight) are the predicted intervals.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:50:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Alkhatib","Amr",""],["Bostr\u00f6m","Henrik",""],["Ennadir","Sofiane",""],["Johansson","Ulf",""]]}
{"id":"2308.11976","submitter":"Jin-Lou Ma","authors":"Jin-Lou Ma, Bobo Liu, Qing Li, Zexian Guo, Lei Tan, and Lei Ying","title":"Study on many-body phases in Jaynes-Cummings-Hubbard arrays","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Disorder in one-dimensional (1D) many-body systems emerges abundant phases\nsuch as many-body localization (MBL), and thermalization. However, it remains\nunclear regarding their existence and behavior within hybrid quantum systems.\nHere, based on a simple bosonic-spin hybrid model, as known as the\nJaynes-Cummings-Hubbard (JCH) array, we investigate the effect of disorder\ncomparing to the phenomena in the clean system with the variation of\natom-photon coupling strength. By using the level-spacing ratio, entanglement\nentropy, and the properties of observable diagonal and off-diagonal matrix\nelements, we find that strong disorder results in the appearance of MBL phase\nin the JCH model that strongly violate eigenstate thermalization hypothesis\n(ETH), while a conditional prethermal behavior can exist in weak disorder or\nweak coupling regime. The conditional prethermal dynamics is based on the\nchoice of initial product states. This work systematically reveals abundant\nmany-body phases in the 1D JCH model and clarifies the discrepancies in the\nthermalization properties of systems with and without disorder.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:52:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ma","Jin-Lou",""],["Liu","Bobo",""],["Li","Qing",""],["Guo","Zexian",""],["Tan","Lei",""],["Ying","Lei",""]]}
{"id":"2308.11977","submitter":"Wenbin Zhai","authors":"Wenbin Zhai, Xin Li, Liang Liu, Youwei Ding, Wanying Lu","title":"ESTA: An Efficient Spatial-Temporal Range Aggregation Query Processing\n  Algorithm for UAV Networks","comments":"14 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmanned Aerial Vehicle (UAV) networks have been widely used in both military\nand civilian scenarios. When users are interested in the statistical\ninformation of the historical sensory data in a certain region during a certain\ntime period, they will send an aggregation query request with a\nspatial-temporal constraint to target UAVs which store the qualified data.\nThen, the target UAVs will return the query results to users. Meanwhile, the\nquery results can be aggregated within the network during transmission to save\nenergy and bandwidth resources, which are typically scarce in UAV networks.\nHowever, due to the unique characteristics of UAV networks, it is difficult to\nperform efficient in-network aggregation of query results without the sacrifice\nof the user query delay. To the best of our knowledge, there is no research on\nspatial-temporal range aggregation query in UAV networks. In this paper, we\npropose an Efficient Spatial-Temporal range Aggregation query processing (ESTA)\nalgorithm for UAV networks. First, a topology change graph is constructed based\non the pre-planned trajectory information. Meanwhile, an efficient shortest\npath algorithm is proposed to obtain the user query delay. Then, on the basis\nof ensuring the user query delay, ESTA transforms the aggregation processing of\nquery results into recursively solving the set cover problem, thereby\nconstructing a spatial-temporal aggregation tree (STAT), based on which an\nefficient in-network aggregation routing path for query results can be found.\nThrough extensive simulation, we demonstrate that ESTA can save more than 50%\nof the energy consumption compared with the baseline algorithm.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:54:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhai","Wenbin",""],["Li","Xin",""],["Liu","Liang",""],["Ding","Youwei",""],["Lu","Wanying",""]]}
{"id":"2308.11978","submitter":"Xiandong Zou","authors":"Xiandong Zou, Xiangyu Zhao, Pietro Li\\`o, Yiren Zhao","title":"Will More Expressive Graph Neural Networks do Better on Generative\n  Tasks?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-bio.BM stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph generation poses a significant challenge as it involves predicting a\ncomplete graph with multiple nodes and edges based on simply a given label.\nThis task also carries fundamental importance to numerous real-world\napplications, including de-novo drug and molecular design. In recent years,\nseveral successful methods have emerged in the field of graph generation.\nHowever, these approaches suffer from two significant shortcomings: (1) the\nunderlying Graph Neural Network (GNN) architectures used in these methods are\noften underexplored; and (2) these methods are often evaluated on only a\nlimited number of metrics. To fill this gap, we investigate the expressiveness\nof GNNs under the context of the molecular graph generation task, by replacing\nthe underlying GNNs of graph generative models with more expressive GNNs.\nSpecifically, we analyse the performance of six GNNs in two different\ngenerative frameworks (GCPN and GraphAF), on six different molecular generative\nobjectives on the ZINC-250k dataset. Through our extensive experiments, we\ndemonstrate that advanced GNNs can indeed improve the performance of GCPN and\nGraphAF on molecular generation tasks, but GNN expressiveness is not a\nnecessary condition for a good GNN-based generative model. Moreover, we show\nthat GCPN and GraphAF with advanced GNNs can achieve state-of-the-art results\nacross 17 other non-GNN-based graph generative approaches, such as variational\nautoencoders and Bayesian optimisation models, on the proposed molecular\ngenerative objectives (DRD2, Median1, Median2), which are important metrics for\nde-novo molecular design.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:57:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zou","Xiandong",""],["Zhao","Xiangyu",""],["Li\u00f2","Pietro",""],["Zhao","Yiren",""]]}
{"id":"2308.11979","submitter":"Yu Chen","authors":"Yu Chen and Pengcheng Shi","title":"Rotation-Invariant Completion Network","comments":"12 pages, accepted to PRCV 2023 (The 6th Chinese Conference on\n  Pattern Recognition and Computer Vision)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-world point clouds usually suffer from incompleteness and display\ndifferent poses. While current point cloud completion methods excel in\nreproducing complete point clouds with consistent poses as seen in the training\nset, their performance tends to be unsatisfactory when handling point clouds\nwith diverse poses. We propose a network named Rotation-Invariant Completion\nNetwork (RICNet), which consists of two parts: a Dual Pipeline Completion\nNetwork (DPCNet) and an enhancing module. Firstly, DPCNet generates a coarse\ncomplete point cloud. The feature extraction module of DPCNet can extract\nconsistent features, no matter if the input point cloud has undergone rotation\nor translation. Subsequently, the enhancing module refines the fine-grained\ndetails of the final generated point cloud. RICNet achieves better rotation\ninvariance in feature extraction and incorporates structural relationships in\nman-made objects. To assess the performance of RICNet and existing methods on\npoint clouds with various poses, we applied random transformations to the point\nclouds in the MVP dataset and conducted experiments on them. Our experiments\ndemonstrate that RICNet exhibits superior completion performance compared to\nexisting methods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:58:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Yu",""],["Shi","Pengcheng",""]]}
{"id":"2308.11980","submitter":"Yuanbo Hou","authors":"Yuanbo Hou, Siyang Song, Cheng Luo, Andrew Mitchell, Qiaoqiao Ren,\n  Weicheng Xie, Jian Kang, Wenwu Wang, Dick Botteldooren","title":"Joint Prediction of Audio Event and Annoyance Rating in an Urban\n  Soundscape by Hierarchical Graph Representation Learning","comments":"INTERSPEECH 2023, Code and models: https://github.com/Yuanbo2020/HGRL","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sound events in daily life carry rich information about the objective world.\nThe composition of these sounds affects the mood of people in a soundscape.\nMost previous approaches only focus on classifying and detecting audio events\nand scenes, but may ignore their perceptual quality that may impact humans'\nlistening mood for the environment, e.g. annoyance. To this end, this paper\nproposes a novel hierarchical graph representation learning (HGRL) approach\nwhich links objective audio events (AE) with subjective annoyance ratings (AR)\nof the soundscape perceived by humans. The hierarchical graph consists of\nfine-grained event (fAE) embeddings with single-class event semantics,\ncoarse-grained event (cAE) embeddings with multi-class event semantics, and AR\nembeddings. Experiments show the proposed HGRL successfully integrates AE with\nAR for AEC and ARP tasks, while coordinating the relations between cAE and fAE\nand further aligning the two different grains of AE information with the AR.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:05:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hou","Yuanbo",""],["Song","Siyang",""],["Luo","Cheng",""],["Mitchell","Andrew",""],["Ren","Qiaoqiao",""],["Xie","Weicheng",""],["Kang","Jian",""],["Wang","Wenwu",""],["Botteldooren","Dick",""]]}
{"id":"2308.11981","submitter":"Wenbin Zhai","authors":"Wenbin Zhai, Feng Wang, Liang Liu, Youwei Ding, and Wanying Lu","title":"Federated Semi-Supervised and Semi-Asynchronous Learning for Anomaly\n  Detection in IoT Networks","comments":"18 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing FL-based approaches are based on the unrealistic assumption that the\ndata on the client-side is fully annotated with ground truths. Furthermore, it\nis a great challenge how to improve the training efficiency while ensuring the\ndetection accuracy in the highly heterogeneous and resource-constrained IoT\nnetworks. Meanwhile, the communication cost between clients and the server is\nalso a problem that can not be ignored. Therefore, in this paper, we propose a\nFederated Semi-Supervised and Semi-Asynchronous (FedS3A) learning for anomaly\ndetection in IoT networks. First, we consider a more realistic assumption that\nlabeled data is only available at the server, and pseudo-labeling is utilized\nto implement federated semi-supervised learning, in which a dynamic weight of\nsupervised learning is exploited to balance the supervised learning at the\nserver and unsupervised learning at clients. Then, we propose a\nsemi-asynchronous model update and staleness tolerant distribution scheme to\nachieve a trade-off between the round efficiency and detection accuracy.\nMeanwhile, the staleness of local models and the participation frequency of\nclients are considered to adjust their contributions to the global model. In\naddition, a group-based aggregation function is proposed to deal with the\nnon-IID distribution of the data. Finally, the difference transmission based on\nthe sparse matrix is adopted to reduce the communication cost. Extensive\nexperimental results show that FedS3A can achieve greater than 98% accuracy\neven when the data is non-IID and is superior to the classic FL-based\nalgorithms in terms of both detection performance and round efficiency,\nachieving a win-win situation. Meanwhile, FedS3A successfully reduces the\ncommunication cost by higher than 50%.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:06:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhai","Wenbin",""],["Wang","Feng",""],["Liu","Liang",""],["Ding","Youwei",""],["Lu","Wanying",""]]}
{"id":"2308.11982","submitter":"Chiara Signorile-Signorile","authors":"Chiara Signorile-Signorile and Davide Maria Tagliabue","title":"Advances in the nested soft-collinear subtraction scheme","comments":null,"journal-ref":"PoS(RADCOR2023)075","doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss a path toward the generalisation of the nested soft-collinear\nsubtraction scheme to arbitrary $2\\rightarrow n$ processes. The scheme is\ndesigned to provide an efficient and process-independent procedure to extract\nand regulate infrared (IR) singularities arising from unresolved real radiation\nand combine them with explicit singularities in virtual corrections. The new\napproach is based on a reorganisation of the relevant subtraction terms into\nsimple combinations of a relatively small number of recurring structures. This\nstrategy leads to a drastic reduction in the computational effort required to\nderive integrated subtraction terms, while preserving the full generality of\nthe scheme. We believe that this approach will allow for tackling the issue of\nregularising IR divergences at next-to-next-to-leading order in the strong\ncoupling constant for arbitrary, multi-parton processes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:11:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Signorile-Signorile","Chiara",""],["Tagliabue","Davide Maria",""]]}
{"id":"2308.11983","submitter":"Erkan Milli","authors":"Erkan Milli, \\\"Ozg\\\"ur Erkent, As{\\i}m Egemen Y{\\i}lmaz","title":"Multi-Modal Multi-Task (3MT) Road Segmentation","comments":null,"journal-ref":"in IEEE Robotics and Automation Letters, vol. 8, no. 9, pp.\n  5408-5415, Sept. 2023","doi":"10.1109/LRA.2023.3295254","report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal systems have the capacity of producing more reliable results than\nsystems with a single modality in road detection due to perceiving different\naspects of the scene. We focus on using raw sensor inputs instead of, as it is\ntypically done in many SOTA works, leveraging architectures that require high\npre-processing costs such as surface normals or dense depth predictions. By\nusing raw sensor inputs, we aim to utilize a low-cost model thatminimizes both\nthe pre-processing andmodel computation costs. This study presents a\ncost-effective and highly accurate solution for road segmentation by\nintegrating data from multiple sensorswithin a multi-task learning\narchitecture.Afusion architecture is proposed in which RGB and LiDAR depth\nimages constitute the inputs of the network. Another contribution of this study\nis to use IMU/GNSS (inertial measurement unit/global navigation satellite\nsystem) inertial navigation system whose data is collected synchronously and\ncalibrated with a LiDAR-camera to compute aggregated dense LiDAR depth images.\nIt has been demonstrated by experiments on the KITTI dataset that the proposed\nmethod offers fast and high-performance solutions. We have also shown the\nperformance of our method on Cityscapes where raw LiDAR data is not available.\nThe segmentation results obtained for both full and half resolution images are\ncompetitive with existing methods. Therefore, we conclude that our method is\nnot dependent only on raw LiDAR data; rather, it can be used with different\nsensor modalities. The inference times obtained in all experiments are very\npromising for real-time experiments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:15:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Milli","Erkan",""],["Erkent","\u00d6zg\u00fcr",""],["Y\u0131lmaz","As\u0131m Egemen",""]]}
{"id":"2308.11984","submitter":"WooCheol Choi","authors":"Hyung Jun Choi, Woocheol Choi, Jinmyoung Seok","title":"Non-ergodic linear convergence property of the delayed gradient descent\n  under the strongly convexity and the Polyak-{\\L}ojasiewicz condition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we establish the linear convergence estimate for the gradient\ndescent involving the delay $\\tau\\in\\mathbb{N}$ when the cost function is\n$\\mu$-strongly convex and $L$-smooth. This result improves upon the well-known\nestimates in Arjevani et al. \\cite{ASS} and Stich-Karmireddy \\cite{SK} in the\nsense that it is non-ergodic and is still established in spite of weaker\nconstraint of cost function. Also, the range of learning rate $\\eta$ can be\nextended from $\\eta\\leq 1/(10L\\tau)$ to $\\eta\\leq 1/(4L\\tau)$ for $\\tau =1$ and\n$\\eta\\leq 3/(10L\\tau)$ for $\\tau \\geq 2$, where $L >0$ is the Lipschitz\ncontinuity constant of the gradient of cost function. In a further research, we\nshow the linear convergence of cost function under the\nPolyak-{\\L}ojasiewicz\\,(PL) condition, for which the available choice of\nlearning rate is further improved as $\\eta\\leq 9/(10L\\tau)$ for the large delay\n$\\tau$. Finally, some numerical experiments are provided in order to confirm\nthe reliability of the analyzed results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:18:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Choi","Hyung Jun",""],["Choi","Woocheol",""],["Seok","Jinmyoung",""]]}
{"id":"2308.11985","submitter":"Lin Sun","authors":"Lin Sun, Todd Rosenkrantz, Prathyusha Enganti, Huiyang Li, Zhijun\n  Wang, Hao Che, Hong Jiang, Xukai Zou","title":"DSSP: A Distributed, SLO-aware, Sensing-domain-privacy-Preserving\n  Architecture for Sensing-as-a-Service","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.PF","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we propose DSSP, a Distributed, SLO-aware,\nSensing-domain-privacy-Preserving architecture for Sensing-as-a-Service (SaS).\nDSSP addresses four major limitations of the current SaS architecture. First,\nto improve sensing quality and enhance geographic coverage, DSSP allows\nIndependent sensing Administrative Domains (IADs) to participate in sensing\nservices, while preserving the autonomy of control and privacy for individual\ndomains. Second, DSSP enables a marketplace in which a sensing data seller\n(i.e., an IAD) can sell its sensing data to more than one buyer (i.e., cloud\nservice provider (CSP)), rather than being locked in with just one CSP. Third,\nDSSP enables per-query tail-latency service-level-objective (SLO) guaranteed\nSaS. Fourth, DSSP enables distributed, rather than centralized, query\nscheduling, making SaS highly scalable. At the core of DSSP is the design of a\nbudget decomposition technique that translates: (a) a query tail-latency SLO\ninto exact task response time budgets for sensing tasks of the query dispatched\nto individual IADs; and (b) the task budget for a task arrived at an IAD into\nexact subtask queuing deadlines for subtasks of the task dispatched to\nindividual edge nodes in each IAD. This enables IADs to allocate their internal\nresources independently and accurately to meet the task budgets and hence,\nquery tail-latency SLO, based on a simple subtask-budget-aware\nearliest-deadline-first queuing (EDFQ) policy for all the subtasks. The\nperformance and scalability of DSSP are evaluated and verified by both\non-campus testbed experiment at small scale and simulation at large scale.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:18:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sun","Lin",""],["Rosenkrantz","Todd",""],["Enganti","Prathyusha",""],["Li","Huiyang",""],["Wang","Zhijun",""],["Che","Hao",""],["Jiang","Hong",""],["Zou","Xukai",""]]}
{"id":"2308.11986","submitter":"Andy Knoll","authors":"Andy Knoll and Carsten Timm","title":"Irreducible momentum-space spin structure of Weyl semimetals and its\n  signatures in Friedel oscillations","comments":"19 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Materials that break time-reversal or inversion symmetry possess\nnondegenerate electronic bands, which can touch at so-called Weyl points. The\nspinor eigenstates in the vicinity of a Weyl point exhibit a well-defined\nchirality $\\pm 1$. Numerous works have studied the consequences of this\nchirality, for example in unconventional magnetoelectric transport. However,\neven a Weyl point with isotropic dispersion is not only characterized by its\nchirality but also by the momentum dependence of the spinor eigenstates. For a\nsingle Weyl point, this momentum-space spin structure can be brought into\nstandard \"hedgehog\" form by a unitary transformation, but for two or more Weyl\npoints, this is not possible. In this work, we show that the relative spin\nstructure of a pair of Weyl points has strong qualitative signatures in the\nelectromagnetic response. Specifically, we investigate the Friedel oscillations\nin the induced charge density due to a test charge for a centrosymmetric system\nconsisting of two Weyl points with isotropic dispersion. The most pronounced\nsignature is that the amplitude of the Friedel oscillations falls off as\n$1/r^4$ in directions in which both Weyl points exhibit the same spin\nstructure, while for directions with inverted spin structures, the amplitude of\nthe Friedel oscillations decreases as $1/r^3$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:22:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Knoll","Andy",""],["Timm","Carsten",""]]}
{"id":"2308.11987","submitter":"Dimitris Koukoulopoulos","authors":"Kevin Ford, Dimitris Koukoulopoulos, Terence Tao","title":"A lower bound on the mean value of the Erd\\H{o}s-Hooley Delta function","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give an improved lower bound for the average of the Erd\\H{o}s-Hooley\nfunction $\\Delta(n)$, namely $\\sum_{n\\le x} \\Delta(n) \\gg_\\varepsilon\nx(\\log\\log x)^{1+\\eta-\\varepsilon}$ for all $x\\geqslant100$ and any fixed\n$\\varepsilon$, where $\\eta = 0.3533227\\dots$ is an exponent previously\nappearing in work of Green and the first two authors. This improves on a\nprevious lower bound of $\\gg x \\log\\log x$ of Hall and Tenenbaum, and can be\ncompared to the recent upper bound of $x (\\log\\log x)^{11/4}$ of the second and\nthird authors.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:23:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ford","Kevin",""],["Koukoulopoulos","Dimitris",""],["Tao","Terence",""]]}
{"id":"2308.11988","submitter":"Shunsuke Sakurai","authors":"Shunsuke Sakurai, Justin Albury, Jose Bellido, Fraser Bradfield,\n  Ladislav Chytka, John Farmer, Toshihiro Fujii, Petr Hamal, Pavel Horvath,\n  Miroslav Hrabovsky, Vlastimil Jilek, Jakub Kmec, Jiri Kvita, Max Malacari,\n  Dusan Mandat, Massimo Mastrodicasa, John N. Matthews, Stanislav Michal,\n  Hiromu Nagasawa, Hiroki Namba, Libor Nozka, Miroslav Palatka, Miroslav Pech,\n  Paolo Privitera, Francesco Salamida, Petr Schovanek, Radomir Smida, Daniel\n  Stanik, Zuzana Svozilikova, Akimichi Taketa, Kenta Terauch, Stan B. Thomas,\n  Petr Travnicek, Martin Vacula (The FAST Collaboration)","title":"Detecting ultra-high-energy cosmic rays with prototypes of the\n  Fluorescence detector Array of Single-pixel Telescopes (FAST) in both\n  hemispheres","comments":"8 pages, 8 figures, Proceedings of the 38th International Cosmic Ray\n  Conference (ICRC2023)","journal-ref":"PoS(ICRC2023)302","doi":"10.22323/1.444.0302","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultra-high energy cosmic rays (UHECRs), whose energy are beyond\n$10^{18}~\\mathrm{eV}$, are the most energetic particles we have ever detected.\nThe latest results seem to indicate a heavier composition at the highest\nenergies, complicating the search for their origins. Due to the limited number\nof UHECR events, we need to build an instrument with an order of magnitude\nlarger effective-exposure to collect UHECRs in future decades. The Fluorescence\ndetector Array of Single-pixel Telescopes (FAST) is a proposed low-cost, easily\ndeployable UHECR detector suitable for a future ground array. It is essential\nto validate the telescope design and autonomous observational techniques using\nprototypes located in both hemispheres. Here we report on the current status of\nobservations, recent performance results of prototypes, and developments\ntowards a future mini-array.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:24:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sakurai","Shunsuke","","The FAST Collaboration"],["Albury","Justin","","The FAST Collaboration"],["Bellido","Jose","","The FAST Collaboration"],["Bradfield","Fraser","","The FAST Collaboration"],["Chytka","Ladislav","","The FAST Collaboration"],["Farmer","John","","The FAST Collaboration"],["Fujii","Toshihiro","","The FAST Collaboration"],["Hamal","Petr","","The FAST Collaboration"],["Horvath","Pavel","","The FAST Collaboration"],["Hrabovsky","Miroslav","","The FAST Collaboration"],["Jilek","Vlastimil","","The FAST Collaboration"],["Kmec","Jakub","","The FAST Collaboration"],["Kvita","Jiri","","The FAST Collaboration"],["Malacari","Max","","The FAST Collaboration"],["Mandat","Dusan","","The FAST Collaboration"],["Mastrodicasa","Massimo","","The FAST Collaboration"],["Matthews","John N.","","The FAST Collaboration"],["Michal","Stanislav","","The FAST Collaboration"],["Nagasawa","Hiromu","","The FAST Collaboration"],["Namba","Hiroki","","The FAST Collaboration"],["Nozka","Libor","","The FAST Collaboration"],["Palatka","Miroslav","","The FAST Collaboration"],["Pech","Miroslav","","The FAST Collaboration"],["Privitera","Paolo","","The FAST Collaboration"],["Salamida","Francesco","","The FAST Collaboration"],["Schovanek","Petr","","The FAST Collaboration"],["Smida","Radomir","","The FAST Collaboration"],["Stanik","Daniel","","The FAST Collaboration"],["Svozilikova","Zuzana","","The FAST Collaboration"],["Taketa","Akimichi","","The FAST Collaboration"],["Terauch","Kenta","","The FAST Collaboration"],["Thomas","Stan B.","","The FAST Collaboration"],["Travnicek","Petr","","The FAST Collaboration"],["Vacula","Martin","","The FAST Collaboration"]]}
{"id":"2308.11989","submitter":"Fraser Bradfield Mr","authors":"Fraser Bradfield, Justin Albury, Jose Bellido, Ladislav Chytka, John\n  Farmer, Toshihiro Fujii, Petr Hamal, Pavel Horvath, Miroslav Hrabovsky,\n  Vlastimil Jilek, Jakub Kmec, Jiri Kvita, Max Malacari, Dusan Mandat, Massimo\n  Mastrodicasa, John N. Matthews, Stanislav Michal, Hiromu Nagasawa, Hiroki\n  Namba, Libor Nozka, Miroslav Palatka, Miroslav Pech, Paolo Privitera,\n  Shunsuke Sakurai, Francesco Salamida, Petr Schovanek, Radomir Smida, Daniel\n  Stanik, Zuzana Svozilikova, Akimichi Taketa, Kenta Terauchi, Stan B. Thomas,\n  Petr Travnicek, Martin Vacula (The FAST Collaboration)","title":"Reconstruction procedure of the Fluorescence detector Array of\n  Single-pixel Telescopes (FAST)","comments":"8 pages, 7 figures, 1 table, Proceedings of the 38th International\n  Cosmic Ray Conference 2023","journal-ref":"PoS(ICRC2023)303","doi":"10.22323/1.444.0303","report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Fluorescence detector Array of Single-pixel Telescopes (FAST) is one of\nseveral proposed designs for a next-generation cosmic-ray detector. Such\ndetectors will require enormous collecting areas whilst also needing to remain\ncost-efficient. To meet these demands, the FAST collaboration has designed a\nsimplified, low-cost fluorescence telescope consisting of only four\nphotomultiplier tubes (PMTs). Since standard air shower reconstruction\ntechniques cannot be used with so few PMTs, FAST utilises an alternative\ntwo-step approach. In the first step, a neural network is used to provide a\nfirst estimate of the true shower parameters. This estimate is then used as the\ninitial guess in a minimisation procedure where the measured PMT traces are\ncompared to simulated ones, and the best-fit shower parameters are found. A\ndetailed explanation of these steps is given, with the expected performance of\nFAST prototypes at the Telescope Array experiment acting as a demonstration of\nthe technique.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:24:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bradfield","Fraser","","The FAST Collaboration"],["Albury","Justin","","The FAST Collaboration"],["Bellido","Jose","","The FAST Collaboration"],["Chytka","Ladislav","","The FAST Collaboration"],["Farmer","John","","The FAST Collaboration"],["Fujii","Toshihiro","","The FAST Collaboration"],["Hamal","Petr","","The FAST Collaboration"],["Horvath","Pavel","","The FAST Collaboration"],["Hrabovsky","Miroslav","","The FAST Collaboration"],["Jilek","Vlastimil","","The FAST Collaboration"],["Kmec","Jakub","","The FAST Collaboration"],["Kvita","Jiri","","The FAST Collaboration"],["Malacari","Max","","The FAST Collaboration"],["Mandat","Dusan","","The FAST Collaboration"],["Mastrodicasa","Massimo","","The FAST Collaboration"],["Matthews","John N.","","The FAST Collaboration"],["Michal","Stanislav","","The FAST Collaboration"],["Nagasawa","Hiromu","","The FAST Collaboration"],["Namba","Hiroki","","The FAST Collaboration"],["Nozka","Libor","","The FAST Collaboration"],["Palatka","Miroslav","","The FAST Collaboration"],["Pech","Miroslav","","The FAST Collaboration"],["Privitera","Paolo","","The FAST Collaboration"],["Sakurai","Shunsuke","","The FAST Collaboration"],["Salamida","Francesco","","The FAST Collaboration"],["Schovanek","Petr","","The FAST Collaboration"],["Smida","Radomir","","The FAST Collaboration"],["Stanik","Daniel","","The FAST Collaboration"],["Svozilikova","Zuzana","","The FAST Collaboration"],["Taketa","Akimichi","","The FAST Collaboration"],["Terauchi","Kenta","","The FAST Collaboration"],["Thomas","Stan B.","","The FAST Collaboration"],["Travnicek","Petr","","The FAST Collaboration"],["Vacula","Martin","","The FAST Collaboration"]]}
{"id":"2308.11990","submitter":"Jongyoun Noh","authors":"Jongyoun Noh, Hyekang Park, Junghyup Lee and Bumsub Ham","title":"RankMixup: Ranking-Based Mixup Training for Network Calibration","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Network calibration aims to accurately estimate the level of confidences,\nwhich is particularly important for employing deep neural networks in\nreal-world systems. Recent approaches leverage mixup to calibrate the network's\npredictions during training. However, they do not consider the problem that\nmixtures of labels in mixup may not accurately represent the actual\ndistribution of augmented samples. In this paper, we present RankMixup, a novel\nmixup-based framework alleviating the problem of the mixture of labels for\nnetwork calibration. To this end, we propose to use an ordinal ranking\nrelationship between raw and mixup-augmented samples as an alternative\nsupervisory signal to the label mixtures for network calibration. We\nhypothesize that the network should estimate a higher level of confidence for\nthe raw samples than the augmented ones (Fig.1). To implement this idea, we\nintroduce a mixup-based ranking loss (MRL) that encourages lower confidences\nfor augmented samples compared to raw ones, maintaining the ranking\nrelationship. We also propose to leverage the ranking relationship among\nmultiple mixup-augmented samples to further improve the calibration capability.\nAugmented samples with larger mixing coefficients are expected to have higher\nconfidences and vice versa (Fig.1). That is, the order of confidences should be\naligned with that of mixing coefficients. To this end, we introduce a novel\nloss, M-NDCG, in order to reduce the number of misaligned pairs of the\ncoefficients and confidences. Extensive experimental results on standard\nbenchmarks for network calibration demonstrate the effectiveness of RankMixup.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:25:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Noh","Jongyoun",""],["Park","Hyekang",""],["Lee","Junghyup",""],["Ham","Bumsub",""]]}
{"id":"2308.11991","submitter":"Pietro Barbiero","authors":"Pietro Barbiero, Francesco Giannini, Gabriele Ciravegna, Michelangelo\n  Diligenti, Giuseppe Marra","title":"Relational Concept Based Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The design of interpretable deep learning models working in relational\ndomains poses an open challenge: interpretable deep learning methods, such as\nConcept-Based Models (CBMs), are not designed to solve relational problems,\nwhile relational models are not as interpretable as CBMs. To address this\nproblem, we propose Relational Concept-Based Models, a family of relational\ndeep learning methods providing interpretable task predictions. Our\nexperiments, ranging from image classification to link prediction in knowledge\ngraphs, show that relational CBMs (i) match generalization performance of\nexisting relational black-boxes (as opposed to non-relational CBMs), (ii)\nsupport the generation of quantified concept-based explanations, (iii)\neffectively respond to test-time interventions, and (iv) withstand demanding\nsettings including out-of-distribution scenarios, limited training data\nregimes, and scarce concept supervisions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:25:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Barbiero","Pietro",""],["Giannini","Francesco",""],["Ciravegna","Gabriele",""],["Diligenti","Michelangelo",""],["Marra","Giuseppe",""]]}
{"id":"2308.11992","submitter":"Okyaz Eminaga","authors":"Okyaz Eminaga, Mahmoud Abbas, Christian Kunder, Yuri Tolkach, Ryan\n  Han, James D. Brooks, Rosalie Nolley, Axel Semjonow, Martin Boegemann, Robert\n  West, Jin Long, Richard Fan, Olaf Bettendorf","title":"Critical Evaluation of Artificial Intelligence as Digital Twin of\n  Pathologist for Prostate Cancer Pathology","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Prostate cancer pathology plays a crucial role in clinical management but is\ntime-consuming. Artificial intelligence (AI) shows promise in detecting\nprostate cancer and grading patterns. We tested an AI-based digital twin of a\npathologist, vPatho, on 2,603 histology images of prostate tissue stained with\nhematoxylin and eosin. We analyzed various factors influencing tumor-grade\ndisagreement between vPatho and six human pathologists. Our results\ndemonstrated that vPatho achieved comparable performance in prostate cancer\ndetection and tumor volume estimation, as reported in the literature.\nConcordance levels between vPatho and human pathologists were examined.\nNotably, moderate to substantial agreement was observed in identifying\ncomplementary histological features such as ductal, cribriform, nerve, blood\nvessels, and lymph cell infiltrations. However, concordance in tumor grading\nshowed a decline when applied to prostatectomy specimens (kappa = 0.44)\ncompared to biopsy cores (kappa = 0.70). Adjusting the decision threshold for\nthe secondary Gleason pattern from 5% to 10% improved the concordance level\nbetween pathologists and vPatho for tumor grading on prostatectomy specimens\n(kappa from 0.44 to 0.64). Potential causes of grade discordance included the\nvertical extent of tumors toward the prostate boundary and the proportions of\nslides with prostate cancer. Gleason pattern 4 was particularly associated with\ndiscordance. Notably, grade discordance with vPatho was not specific to any of\nthe six pathologists involved in routine clinical grading. In conclusion, our\nstudy highlights the potential utility of AI in developing a digital twin of a\npathologist. This approach can help uncover limitations in AI adoption and the\ncurrent grading system for prostate cancer pathology.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:25:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Eminaga","Okyaz",""],["Abbas","Mahmoud",""],["Kunder","Christian",""],["Tolkach","Yuri",""],["Han","Ryan",""],["Brooks","James D.",""],["Nolley","Rosalie",""],["Semjonow","Axel",""],["Boegemann","Martin",""],["West","Robert",""],["Long","Jin",""],["Fan","Richard",""],["Bettendorf","Olaf",""]]}
{"id":"2308.11993","submitter":"Caterina Sportelli","authors":"Giovanni Molica Bisci, Kanishka Perera, Raffaella Servadei and\n  Caterina Sportelli","title":"Nonlocal critical growth elliptic problems with jumping nonlinearities","comments":"26 pages. arXiv admin note: substantial text overlap with\n  arXiv:2207.01347","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we study a nonlocal critical growth elliptic problem driven by\nthe fractional Laplacian in presence of jumping nonlinearities. In the main\nresults of the paper we prove the existence of a nontrivial solution for the\nproblem under consideration, using variational and topological methods and\napplying a new linking theorems recently got by Perera and Sportelli in [10].\nThe existence results provided in this paper can be seen as the nonlocal\ncounterpart of the ones obtained in [10] in the context of the Laplacian\nequations. In the nonlocal framework the arguments used in the classical\nsetting have to be refined. Indeed the presence of the fractional Laplacian\noperator gives rise to some additional difficulties, that we are able to\novercome proving new regularity results for weak solutions of nonlocal\nproblems, which are of independent interest.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:29:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bisci","Giovanni Molica",""],["Perera","Kanishka",""],["Servadei","Raffaella",""],["Sportelli","Caterina",""]]}
{"id":"2308.11994","submitter":"Huafeng Li","authors":"Huafeng Li, Shedan Yang, Yafei Zhang, Dapeng Tao, Zhengtao Yu","title":"Progressive Feature Mining and External Knowledge-Assisted\n  Text-Pedestrian Image Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-Pedestrian Image Retrieval aims to use the text describing pedestrian\nappearance to retrieve the corresponding pedestrian image. This task involves\nnot only modality discrepancy, but also the challenge of the textual diversity\nof pedestrians with the same identity. At present, although existing research\nprogress has been made in text-pedestrian image retrieval, these methods do not\ncomprehensively consider the above-mentioned problems. Considering these, this\npaper proposes a progressive feature mining and external knowledge-assisted\nfeature purification method. Specifically, we use a progressive mining mode to\nenable the model to mine discriminative features from neglected information,\nthereby avoiding the loss of discriminative information and improving the\nexpression ability of features. In addition, to further reduce the negative\nimpact of modal discrepancy and text diversity on cross-modal matching, we\npropose to use other sample knowledge of the same modality, i.e., external\nknowledge to enhance identity-consistent features and weaken\nidentity-inconsistent features. This process purifies features and alleviates\nthe interference caused by textual diversity and negative sample correlation\nfeatures of the same modal. Extensive experiments on three challenging datasets\ndemonstrate the effectiveness and superiority of the proposed method, and the\nretrieval performance even surpasses that of the large-scale model-based method\non large-scale datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:29:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Huafeng",""],["Yang","Shedan",""],["Zhang","Yafei",""],["Tao","Dapeng",""],["Yu","Zhengtao",""]]}
{"id":"2308.11995","submitter":"Karthik Gopalakrishnan","authors":"Karthik Gopalakrishnan, Behnam Hedayatnia, Qinlang Chen, Anna\n  Gottardi, Sanjeev Kwatra, Anu Venkatesh, Raefer Gabriel, Dilek Hakkani-Tur","title":"Topical-Chat: Towards Knowledge-Grounded Open-Domain Conversations","comments":"arXiving an old paper accepted at INTERSPEECH 2019","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building socialbots that can have deep, engaging open-domain conversations\nwith humans is one of the grand challenges of artificial intelligence (AI). To\nthis end, bots need to be able to leverage world knowledge spanning several\ndomains effectively when conversing with humans who have their own world\nknowledge. Existing knowledge-grounded conversation datasets are primarily\nstylized with explicit roles for conversation partners. These datasets also do\nnot explore depth or breadth of topical coverage with transitions in\nconversations. We introduce Topical-Chat, a knowledge-grounded human-human\nconversation dataset where the underlying knowledge spans 8 broad topics and\nconversation partners don't have explicitly defined roles, to help further\nresearch in open-domain conversational AI. We also train several\nstate-of-the-art encoder-decoder conversational models on Topical-Chat and\nperform automated and human evaluation for benchmarking.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:33:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gopalakrishnan","Karthik",""],["Hedayatnia","Behnam",""],["Chen","Qinlang",""],["Gottardi","Anna",""],["Kwatra","Sanjeev",""],["Venkatesh","Anu",""],["Gabriel","Raefer",""],["Hakkani-Tur","Dilek",""]]}
{"id":"2308.11996","submitter":"Elena Zemlyanaya Dr","authors":"M. Bashashin, E. Zemlyanaya, I. Rahmonov","title":"Parallel simulation of the magnetic moment reversal within the\n  $\\phi_0$-Josephson junction model","comments":"The XXVI International Scientific Conference of Young Scientists and\n  Specialists (AYSS-2022), JINR, Dubna","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Periodic structure of the magnetization reversal (MR) domains is studied\nwithin the superconductor-ferromagnetic-superconductor $\\phi_0$-junction model.\nThe model is described by the Cauchy problem for the system of nonlinear\nordinary equations which is numerically solved by means of the 2-step\nGauss-Legendre method. Two versions of parallel implementation on the basis of\nMPI and OpenMP techniques have been developed. Efficiency of both versions is\nconfirmed by test calculations. An effect of frequency of ferromagnetic\nresonance on the configuration of MR domains has been investigated.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:33:18 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bashashin","M.",""],["Zemlyanaya","E.",""],["Rahmonov","I.",""]]}
{"id":"2308.11997","submitter":"Juergen Elstrodt","authors":"J\\\"urgen Elstrodt","title":"What is a fundamental domain?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show by means of various examples that many of the current definitions of\nthe notion of fundamental domain of a Fuchsian group lack an extra condition\nensuring that the domain differs from a measurable fundamental set at most by a\nnull set.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:35:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Elstrodt","J\u00fcrgen",""]]}
{"id":"2308.11998","submitter":"Dietmar Jannach","authors":"Alvise De Biasio, Nicol\\`o Navarin, Dietmar Jannach","title":"Economic Recommender Systems -- A Systematic Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many of today's online services provide personalized recommendations to their\nusers. Such recommendations are typically designed to serve certain user needs,\ne.g., to quickly find relevant content in situations of information overload.\nCorrespondingly, the academic literature in the field largely focuses on the\nvalue of recommender systems for the end user. In this context, one underlying\nassumption is that the improved service that is achieved through the\nrecommendations will in turn positively impact the organization's goals, e.g.,\nin the form of higher customer retention or loyalty. However, in reality,\nrecommender systems can be used to target organizational economic goals more\ndirectly by incorporating monetary considerations such as price awareness and\nprofitability aspects into the underlying recommendation models. In this work,\nwe survey the existing literature on what we call Economic Recommender Systems\nbased on a systematic review approach that helped us identify 133 relevant\npapers. We first categorize existing works along different dimensions and then\nreview the most important technical approaches from the literature.\nFurthermore, we discuss common methodologies to evaluate such systems and\nfinally outline the limitations of today's research and future directions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:35:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["De Biasio","Alvise",""],["Navarin","Nicol\u00f2",""],["Jannach","Dietmar",""]]}
{"id":"2308.11999","submitter":"Tadahisa Hamada","authors":"Tadahisa Hamada","title":"A concise geometric proof of the three distance theorem","comments":"Slightly modified the English wording of Abstract. Changed the\n  notation of fractional parts and intervals to the common ones. Corrected the\n  notation of references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The three distance theorem states that for any given irrational number\n$\\alpha$ and a natural number $n$, when the interval $( 0, 1 )$ is divided into\n$n+1$ subintervals by integer multiples of $\\alpha$, namely, $\\{0\\}, \\{ \\alpha\n\\}, \\{ 2\\,\\alpha \\},\\dots, \\{ n\\,\\alpha \\}$, then each subinterval is limited\nto at most three different lengths. Steinhaus conjectured this theorem in the\n1950s, and many researchers have given various proofs since then.\n  This paper aims to improve the perspective by showing a two-dimensional map\nof how the unit interval is divided by continuously changing $\\alpha$, and give\na concise proof of the theorem. We also present a simple proof of the three gap\ntheorem, a dual of the three distance theorem.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:38:08 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 03:52:51 GMT"},{"version":"v3","created":"Wed, 30 Aug 2023 03:20:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hamada","Tadahisa",""]]}
{"id":"2308.12000","submitter":"Kaito Ariu","authors":"Po-An Wang, Kaito Ariu, Alexandre Proutiere","title":"On Uniformly Optimal Algorithms for Best Arm Identification in Two-Armed\n  Bandits with Fixed Budget","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of best-arm identification with fixed budget in\nstochastic two-arm bandits with Bernoulli rewards. We prove that surprisingly,\nthere is no algorithm that (i) performs as well as the algorithm sampling each\narm equally (this algorithm is referred to as the {\\it uniform sampling}\nalgorithm) on all instances, and that (ii) strictly outperforms this algorithm\non at least one instance. In short, there is no algorithm better than the\nuniform sampling algorithm. Towards this result, we introduce the natural class\nof {\\it consistent} and {\\it stable} algorithms, and show that any algorithm\nthat performs as well as the uniform sampling algorithm on all instances\nbelongs to this class. The proof is completed by deriving a lower bound on the\nerror rate satisfied by any consistent and stable algorithm, and by showing\nthat the uniform sampling algorithm matches this lower bound. Our results\nprovide a solution to the two open problems presented in \\cite{qin2022open}.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:38:53 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 05:46:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Po-An",""],["Ariu","Kaito",""],["Proutiere","Alexandre",""]]}
{"id":"2308.12001","submitter":"Kangmin Xu","authors":"Kangmin Xu, Liang Liao, Jing Xiao, Chaofeng Chen, Haoning Wu, Qiong\n  Yan, Weisi Lin","title":"Local Distortion Aware Efficient Transformer Adaptation for Image\n  Quality Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image Quality Assessment (IQA) constitutes a fundamental task within the\nfield of computer vision, yet it remains an unresolved challenge, owing to the\nintricate distortion conditions, diverse image contents, and limited\navailability of data. Recently, the community has witnessed the emergence of\nnumerous large-scale pretrained foundation models, which greatly benefit from\ndramatically increased data and parameter capacities. However, it remains an\nopen problem whether the scaling law in high-level tasks is also applicable to\nIQA task which is closely related to low-level clues. In this paper, we\ndemonstrate that with proper injection of local distortion features, a larger\npretrained and fixed foundation model performs better in IQA tasks.\nSpecifically, for the lack of local distortion structure and inductive bias of\nvision transformer (ViT), alongside the large-scale pretrained ViT, we use\nanother pretrained convolution neural network (CNN), which is well known for\ncapturing the local structure, to extract multi-scale image features. Further,\nwe propose a local distortion extractor to obtain local distortion features\nfrom the pretrained CNN and a local distortion injector to inject the local\ndistortion features into ViT. By only training the extractor and injector, our\nmethod can benefit from the rich knowledge in the powerful foundation models\nand achieve state-of-the-art performance on popular IQA datasets, indicating\nthat IQA is not only a low-level problem but also benefits from stronger\nhigh-level features drawn from large-scale pretrained models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:41:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Kangmin",""],["Liao","Liang",""],["Xiao","Jing",""],["Chen","Chaofeng",""],["Wu","Haoning",""],["Yan","Qiong",""],["Lin","Weisi",""]]}
{"id":"2308.12002","submitter":"Abhishek Chandra","authors":"Abhishek Chandra, Taniya Kapoor, Bram Daniels, Mitrofan Curti, Koen\n  Tiels, Daniel M. Tartakovsky, Elena A. Lomonova","title":"Neural oscillators for magnetic hysteresis modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE cs.SY eess.SY physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hysteresis is a ubiquitous phenomenon in science and engineering; its\nmodeling and identification are crucial for understanding and optimizing the\nbehavior of various systems. We develop an ordinary differential equation-based\nrecurrent neural network (RNN) approach to model and quantify the hysteresis,\nwhich manifests itself in sequentiality and history-dependence. Our neural\noscillator, HystRNN, draws inspiration from coupled-oscillatory RNN and\nphenomenological hysteresis models to update the hidden states. The performance\nof HystRNN is evaluated to predict generalized scenarios, involving first-order\nreversal curves and minor loops. The findings show the ability of HystRNN to\ngeneralize its behavior to previously untrained regions, an essential feature\nthat hysteresis models must have. This research highlights the advantage of\nneural oscillators over the traditional RNN-based methods in capturing complex\nhysteresis patterns in magnetic materials, where traditional rate-dependent\nmethods are inadequate to capture intrinsic nonlinearity.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:41:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chandra","Abhishek",""],["Kapoor","Taniya",""],["Daniels","Bram",""],["Curti","Mitrofan",""],["Tiels","Koen",""],["Tartakovsky","Daniel M.",""],["Lomonova","Elena A.",""]]}
{"id":"2308.12003","submitter":"Sebastian Leontica","authors":"Sebastian Leontica and Max McGinley","title":"Purification Dynamics in a Continuous-time Hybrid Quantum Circuit Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.other","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a continuous time model of many-body quantum dynamics based on\ninfinitesimal random unitary operations, combined with projective measurements.\nWe consider purification dynamics in this model, where the system is\ninitialized in a mixed state, which then purifies over time as a result of the\nmeasurements. By mapping our model to a family of effective 1D quantum\nHamiltonians, we are able to derive analytic expressions that capture how the\nentropy of the system decays in time. Our results confirm the existence of two\ndistinct dynamical phases, where purification occurs over a timescale that is\nexponential vs. constant in system size. We compare our analytic expressions\nfor this microscopic model to results derived from field theories that are\nexpected to capture such measurement-induced phase transitions, and find\nquantitative agreement between the two.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:41:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Leontica","Sebastian",""],["McGinley","Max",""]]}
{"id":"2308.12004","submitter":"Cliff Burgess","authors":"Philippe Brax, C.P. Burgess and F. Quevedo","title":"Lifting Klein-Gordon/Einstein Solutions to General Nonlinear\n  Sigma-Models: the Wormhole Example","comments":"12 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe a simple technique for generating solutions to the classical\nfield equations for an arbitrary nonlinear sigma-model minimally coupled to\ngravity. The technique promotes an arbitrary solution to the coupled\nEinstein/Klein-Gordon field equations for a single scalar field $\\sigma$ to a\nsolution of the nonlinear sigma-model for $N$ scalar fields minimally coupled\nto gravity. This mapping between solutions does not require there to be any\ntarget-space isometries and exists for every choice of geodesic computed using\nthe target-space metric. In some special situations -- such as when the\nsolution depends only on a single coordinate (e.g. for homogeneous\ntime-dependent or static spherically symmetric configurations) -- the general\nsolution to the sigma-model equations can be obtained in this way. We\nillustrate the technique by applying it to generate Euclidean wormhole\nsolutions for multi-field sigma models coupled to gravity starting from the\nsimplest Giddings-Strominger wormhole, clarifying why in the wormhole case\nMinkowski-signature target-space geometries can arise. We reproduce in this way\nthe well-known axio-dilaton string wormhole and we illustrate the power of the\ntechnique by generating simple perturbations to it, like those due to string or\n$\\alpha'$ corrections.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:46:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Brax","Philippe",""],["Burgess","C. P.",""],["Quevedo","F.",""]]}
{"id":"2308.12005","submitter":"Fanjie Sun","authors":"Fanjie Sun and Xiao Yan Xu","title":"Delay Update in Determinant Quantum Monte Carlo","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Determinant quantum Monte Carlo (DQMC) is a widely used unbiased numerical\nmethod for simulating strongly correlated electron systems. However, the update\nprocess in DQMC is often a bottleneck for its efficiency. To address this\nissue, we propose a generalized delay update scheme that can handle both onsite\nand extended interactions. Our delay update scheme can be implemented in both\nzero-temperature and finite-temperature versions of DQMC. We apply the delay\nupdate scheme to various strongly correlated electron models and evaluate its\nefficiency under different conditions. Our results demonstrate that the\nproposed delay update scheme significantly improves the efficiency of DQMC\nsimulations, enable it to simulate larger system size.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:46:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sun","Fanjie",""],["Xu","Xiao Yan",""]]}
{"id":"2308.12006","submitter":"Yujun Ma","authors":"Yujun Ma, Benjia Zhou, Ruili Wang, Pichao Wang","title":"Multi-stage Factorized Spatio-Temporal Representation for RGB-D Action\n  and Gesture Recognition","comments":"ACM MM'23 has accepted this paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  RGB-D action and gesture recognition remain an interesting topic in\nhuman-centered scene understanding, primarily due to the multiple granularities\nand large variation in human motion. Although many RGB-D based action and\ngesture recognition approaches have demonstrated remarkable results by\nutilizing highly integrated spatio-temporal representations across multiple\nmodalities (i.e., RGB and depth data), they still encounter several challenges.\nFirstly, vanilla 3D convolution makes it hard to capture fine-grained motion\ndifferences between local clips under different modalities. Secondly, the\nintricate nature of highly integrated spatio-temporal modeling can lead to\noptimization difficulties. Thirdly, duplicate and unnecessary information can\nadd complexity and complicate entangled spatio-temporal modeling. To address\nthe above issues, we propose an innovative heuristic architecture called\nMulti-stage Factorized Spatio-Temporal (MFST) for RGB-D action and gesture\nrecognition. The proposed MFST model comprises a 3D Central Difference\nConvolution Stem (CDC-Stem) module and multiple factorized spatio-temporal\nstages. The CDC-Stem enriches fine-grained temporal perception, and the\nmultiple hierarchical spatio-temporal stages construct dimension-independent\nhigher-order semantic primitives. Specifically, the CDC-Stem module captures\nbottom-level spatio-temporal features and passes them successively to the\nfollowing spatio-temporal factored stages to capture the hierarchical spatial\nand temporal features through the Multi- Scale Convolution and Transformer\n(MSC-Trans) hybrid block and Weight-shared Multi-Scale Transformer (WMS-Trans)\nblock. The seamless integration of these innovative designs results in a robust\nspatio-temporal representation that outperforms state-of-the-art approaches on\nRGB-D action and gesture recognition datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:49:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ma","Yujun",""],["Zhou","Benjia",""],["Wang","Ruili",""],["Wang","Pichao",""]]}
{"id":"2308.12007","submitter":"Haixin Chang","authors":"Gaojie Zhang, Hao Wu, Li Yang, Wen Jin, Bichen Xiao, Wenfeng Zhang and\n  Haixin Chang","title":"Room-Temperature Highly-Tunable Coercivity and Highly-Efficient\n  Nonvolatile Multi-States Magnetization Switching by Small Current in Single\n  2D Ferromagnet Fe$_3$GaTe$_2$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Room-temperature electrically-tuned coercivity and nonvolatile multi-states\nmagnetization switching is crucial for next-generation low-power 2D\nspintronics. However, most methods have limited ability to adjust the\ncoercivity of ferromagnetic systems, and room-temperature electrically-driven\nmagnetization switching shows high critical current density and high power\ndissipation. Here, highly-tunable coercivity and highly-efficient nonvolatile\nmulti-states magnetization switching are achieved at room temperature in\nsingle-material based devices by 2D van der Waals itinerant ferromagnet\nFe$_3$GaTe$_2$. The coercivity can be readily tuned up to ~98.06% at 300 K by a\ntiny in-plane electric field that is 2-5 orders of magnitude smaller than that\nof other ferromagnetic systems. Moreover, the critical current density and\npower dissipation for room-temperature magnetization switching in 2D\nFe$_3$GaTe$_2$ are down to ~1.7E5 A cm$^{-2}$ and ~4E12 W m$^{-3}$,\nrespectively. Such switching power dissipation is 2-6 orders of magnitude lower\nthan that of other 2D ferromagnetic systems. Meanwhile, multi-states\nmagnetization switching are presented by continuously controlling the current,\nwhich can dramatically enhance the information storage capacity and develop new\ncomputing methodology. This work opens the avenue for room-temperature\nelectrical control of ferromagnetism and potential applications for\nvdW-integrated 2D spintronics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:52:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Gaojie",""],["Wu","Hao",""],["Yang","Li",""],["Jin","Wen",""],["Xiao","Bichen",""],["Zhang","Wenfeng",""],["Chang","Haixin",""]]}
{"id":"2308.12008","submitter":"Frederick Riemenschneider","authors":"Frederick Riemenschneider and Anette Frank","title":"Graecia capta ferum victorem cepit. Detecting Latin Allusions to Ancient\n  Greek Literature","comments":"Paper accepted for publication at the First Workshop on Ancient\n  Language Processing (ALP) 2023; 9 pages, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intertextual allusions hold a pivotal role in Classical Philology, with Latin\nauthors frequently referencing Ancient Greek texts. Until now, the automatic\nidentification of these intertextual references has been constrained to\nmonolingual approaches, seeking parallels solely within Latin or Greek texts.\nIn this study, we introduce SPhilBERTa, a trilingual Sentence-RoBERTa model\ntailored for Classical Philology, which excels at cross-lingual semantic\ncomprehension and identification of identical sentences across Ancient Greek,\nLatin, and English. We generate new training data by automatically translating\nEnglish texts into Ancient Greek. Further, we present a case study,\ndemonstrating SPhilBERTa's capability to facilitate automated detection of\nintertextual parallels. Our models and resources are available at\nhttps://github.com/Heidelberg-NLP/ancient-language-models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:54:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Riemenschneider","Frederick",""],["Frank","Anette",""]]}
{"id":"2308.12009","submitter":"Christopher Hahne","authors":"Christopher Hahne, Michel Hayoz, Raphael Sznitman","title":"StofNet: Super-resolution Time of Flight Network","comments":"pre-print","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time of Flight (ToF) is a prevalent depth sensing technology in the fields of\nrobotics, medical imaging, and non-destructive testing. Yet, ToF sensing faces\nchallenges from complex ambient conditions making an inverse modelling from the\nsparse temporal information intractable. This paper highlights the potential of\nmodern super-resolution techniques to learn varying surroundings for a reliable\nand accurate ToF detection. Unlike existing models, we tailor an architecture\nfor sub-sample precise semi-global signal localization by combining\nsuper-resolution with an efficient residual contraction block to balance\nbetween fine signal details and large scale contextual information. We\nconsolidate research on ToF by conducting a benchmark comparison against six\nstate-of-the-art methods for which we employ two publicly available datasets.\nThis includes the release of our SToF-Chirp dataset captured by an airborne\nultrasound transducer. Results showcase the superior performance of our\nproposed StofNet in terms of precision, reliability and model complexity. Our\ncode is available at https://github.com/hahnec/stofnet.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:02:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hahne","Christopher",""],["Hayoz","Michel",""],["Sznitman","Raphael",""]]}
{"id":"2308.12010","submitter":"Golam Ali Sekh Dr","authors":"Bijan Layek, Sk. Siddik and Golam Ali Sekh","title":"Fisher information on the phase transition from regular to flat top\n  optical pulse in cubic-quintic nonlinear media","comments":"5 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the properties of optical pulse in cubic-quintic nonlinear media\nusing information theoretic approach. The system can support regular (sharp\ntop) and flat top pulse depending on the type of quintic interaction and the\nfrequency of the pulse. For defocusing quintic nonlinearity, it holds both\nregular and flat top soliton. We find that Fisher information suddenly drops\nnear the transition from sharp to flat top pulse. This is also reflected in the\nlinear stability curve where power of the pulse suddenly grows near the point\nof transition. However, the solution is linearly stable according to\nVakhitov-Kolokolov criterion. We examine that, in the case of focusing\nnonlinearity, the change from linearly stable and unstable solitons becomes\nimperceptible through Fisher information.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:02:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Layek","Bijan",""],["Siddik","Sk.",""],["Sekh","Golam Ali",""]]}
{"id":"2308.12011","submitter":"Andrea Severing","authors":"Andrea Marino, Denise S. Christovam, Chun-Fu Chang, Johannes Falke,\n  Chang-Yang Kuo, Chi-Nan Wu, Martin Sundermann, Andrea Amorese, Hlynur\n  Gretarsson, Eric Lee Wong, Camilla M. Moir, Yuang Deng, M. Brian Maple, Peter\n  Thalmeier, Liu Hao Tjeng, Andrea Severing","title":"Fe substitution in URu$_2$Si$_2$: singlet magnetism in an extended\n  Doniach phase diagram","comments":"10 pages, 7 figures","journal-ref":"Phys. Rev. B 108, 085128 (2023)","doi":"10.1103/PhysRevB.108.085128","report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The application of pressure as well as the successive substitution of Ru with\nFe in the hidden order (HO) compound URu$_2$Si$_2$ leads to the formation of\nthe large moment antiferromagnetic phase (LMAFM). Here we have investigated the\nsubstitution series URu$_{2-x}$Fe$_x$Si$_2$ from $x$\\,=\\,0.0 to 2.0 by U\\,4$f$\ncore-level photoelectron spectroscopy and have observed non-monotonic changes\nin the spectra. The initial increase and subsequent decrease of the spectral\nweight of the 4$f$ core level satellite with increasing $x$ stands for a\nnon-monotonic 5$f$ filling across the substitution series. The competition of\nchemical pressure and increase of the density of states at the Fermi energy,\nboth due to substitution of Ru with Fe, can explain such a behavior. An\nextended Doniach phase diagram including the $x$ dependence of the density of\nstates is proposed. Also in URu$_{2-x}$Fe$_x$Si$_2$ the ground state is a\nsinglet or quasi-doublet state consisting of two singlets. Hence, the formation\nof magnetic order in the URu$_{2-x}$Fe$_x$Si$_2$ substitution series must be\nexplained within a singlet magnetism model.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:05:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Marino","Andrea",""],["Christovam","Denise S.",""],["Chang","Chun-Fu",""],["Falke","Johannes",""],["Kuo","Chang-Yang",""],["Wu","Chi-Nan",""],["Sundermann","Martin",""],["Amorese","Andrea",""],["Gretarsson","Hlynur",""],["Wong","Eric Lee",""],["Moir","Camilla M.",""],["Deng","Yuang",""],["Maple","M. Brian",""],["Thalmeier","Peter",""],["Tjeng","Liu Hao",""],["Severing","Andrea",""]]}
{"id":"2308.12012","submitter":"Nermin Okicic","authors":"Nermin Oki\\v{c}i\\'c, Amra Reki\\'c-Vukovi\\'c","title":"A convexity in $\\mathbb{R}^2$ with river metric","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we consider the space $\\mathbb{R}^2$ with the river metric\n$d^*$ and different types of convexity of this space. We define $W$-convex\nstructure in $(\\mathbb{R}^2,d^*)$ and we give the complete characterization of\nthe convex sets in this space. We consider some measures of noncompactness and\nwe give the moduli of noncompactness for considered measures on this space.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:06:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Oki\u010di\u0107","Nermin",""],["Reki\u0107-Vukovi\u0107","Amra",""]]}
{"id":"2308.12013","submitter":"Filippo Caruso","authors":"Marco Parigi, Stefano Martina, Filippo Caruso","title":"Quantum-Noise-driven Generative Diffusion Models","comments":"13 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cs.AI cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative models realized with machine learning techniques are powerful\ntools to infer complex and unknown data distributions from a finite number of\ntraining samples in order to produce new synthetic data. Diffusion models are\nan emerging framework that have recently overcome the performance of the\ngenerative adversarial networks in creating synthetic text and high-quality\nimages. Here, we propose and discuss the quantum generalization of diffusion\nmodels, i.e., three quantum-noise-driven generative diffusion models that could\nbe experimentally tested on real quantum systems. The idea is to harness unique\nquantum features, in particular the non-trivial interplay among coherence,\nentanglement and noise that the currently available noisy quantum processors do\nunavoidably suffer from, in order to overcome the main computational burdens of\nclassical diffusion models during inference. Hence, we suggest to exploit\nquantum noise not as an issue to be detected and solved but instead as a very\nremarkably beneficial key ingredient to generate much more complex probability\ndistributions that would be difficult or even impossible to express\nclassically, and from which a quantum processor might sample more efficiently\nthan a classical one. Therefore, our results are expected to pave the way for\nnew quantum-inspired or quantum-based generative diffusion algorithms\naddressing more powerfully classical tasks as data generation/prediction with\nwidespread real-world applications ranging from climate forecasting to\nneuroscience, from traffic flow analysis to financial forecasting.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:09:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Parigi","Marco",""],["Martina","Stefano",""],["Caruso","Filippo",""]]}
{"id":"2308.12014","submitter":"Jing Yao","authors":"Jing Yao, Xiaoyuan Yi, Xiting Wang, Jindong Wang and Xing Xie","title":"From Instructions to Intrinsic Human Values -- A Survey of Alignment\n  Goals for Big Models","comments":"20 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Big models, exemplified by Large Language Models (LLMs), are models typically\npre-trained on massive data and comprised of enormous parameters, which not\nonly obtain significantly improved performance across diverse tasks but also\npresent emergent capabilities absent in smaller models. However, the growing\nintertwining of big models with everyday human lives poses potential risks and\nmight cause serious social harm. Therefore, many efforts have been made to\nalign LLMs with humans to make them better follow user instructions and satisfy\nhuman preferences. Nevertheless, `what to align with' has not been fully\ndiscussed, and inappropriate alignment goals might even backfire. In this\npaper, we conduct a comprehensive survey of different alignment goals in\nexisting work and trace their evolution paths to help identify the most\nessential goal. Particularly, we investigate related works from two\nperspectives: the definition of alignment goals and alignment evaluation. Our\nanalysis encompasses three distinct levels of alignment goals and reveals a\ngoal transformation from fundamental abilities to value orientation, indicating\nthe potential of intrinsic human values as the alignment goal for enhanced\nLLMs. Based on such results, we further discuss the challenges of achieving\nsuch intrinsic value alignment and provide a collection of available resources\nfor future research on the alignment of big models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:11:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yao","Jing",""],["Yi","Xiaoyuan",""],["Wang","Xiting",""],["Wang","Jindong",""],["Xie","Xing",""]]}
{"id":"2308.12015","submitter":"Nicholas Kamp","authors":"Nicholas Kamp","title":"Experimental and Phenomenological Investigations of the MiniBooNE\n  Anomaly","comments":"Ph.D. Thesis. 287 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This thesis covers a range of experimental and theoretical efforts to\nelucidate the origin of the $4.8\\sigma$ MiniBooNE low energy excess (LEE). We\nbegin with the follow-up MicroBooNE experiment, which took data along the BNB\nfrom 2016 to 2021. This thesis specifically presents MicroBooNE's search for\n$\\nu_e$ charged-current quasi-elastic (CCQE) interactions consistent with\ntwo-body scattering. The two-body CCQE analysis uses a novel reconstruction\nprocess, including a number of deep-learning-based algorithms, to isolate a\nsample of $\\nu_e$ CCQE interaction candidates with $75\\%$ purity. The analysis\nrules out an entirely $\\nu_e$-based explanation of the MiniBooNE excess at the\n$2.4\\sigma$ confidence level. We next perform a combined fit of MicroBooNE and\nMiniBooNE data to the popular $3+1$ model; even after the MicroBooNE results,\nallowed regions in $\\Delta m^2$-$\\sin^2 2_{\\theta_{\\mu e}}$ parameter space\nexist at the $3\\sigma$ confidence level. This thesis also demonstrates that the\nMicroBooNE data are consistent with a $\\overline{\\nu}_e$-based explanation of\nthe MiniBooNE LEE at the $<2\\sigma$ confidence level. Next, we investigate a\nphenomenological explanation of the MiniBooNE excess combining the $3+1$ model\nwith a dipole-coupled heavy neutral lepton (HNL). It is shown that a 500 MeV\nHNL can accommodate the energy and angular distributions of the LEE at the\n$2\\sigma$ confidence level while avoiding stringent constraints derived from\nMINER$\\nu$A elastic scattering data. Finally, we discuss the Coherent\nCAPTAIN-Mills experiment--a 10-ton light-based liquid argon detector at Los\nAlamos National Laboratory. The background rejection achieved from a novel\nCherenkov-based reconstruction algorithm will enable world-leading sensitivity\nto a number of beyond-the-Standard Model physics scenarios, including\ndipole-coupled HNLs.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:14:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kamp","Nicholas",""]]}
{"id":"2308.12016","submitter":"Bin Zhu","authors":"Bin Zhu and Yijie Shi","title":"MKL-$L_{0/1}$-SVM","comments":"26 pages in the JMLR template, 4 figures, and 2 tables. arXiv admin\n  note: substantial text overlap with arXiv:2303.04445","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a Multiple Kernel Learning (abbreviated as MKL) framework\nfor the Support Vector Machine (SVM) with the $(0, 1)$ loss function. Some\nKKT-like first-order optimality conditions are provided and then exploited to\ndevelop a fast ADMM algorithm to solve the nonsmooth nonconvex optimization\nproblem. Numerical experiments on synthetic and real datasets show that the\nperformance of our MKL-$L_{0/1}$-SVM is comparable with the one of the leading\napproaches called SimpleMKL developed by Rakotomamonjy, Bach, Canu, and\nGrandvalet [Journal of Machine Learning Research, vol.~9, pp.~2491--2521,\n2008].\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:18:41 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 08:51:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Bin",""],["Shi","Yijie",""]]}
{"id":"2308.12017","submitter":"Donghao Zhou","authors":"Donghao Zhou, Jialin Li, Jinpeng Li, Jiancheng Huang, Qiang Nie, Yong\n  Liu, Bin-Bin Gao, Qiong Wang, Pheng-Ann Heng, Guangyong Chen","title":"Distribution-Aware Calibration for Object Detection with Noisy Bounding\n  Boxes","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale well-annotated datasets are of great importance for training an\neffective object detector. However, obtaining accurate bounding box annotations\nis laborious and demanding. Unfortunately, the resultant noisy bounding boxes\ncould cause corrupt supervision signals and thus diminish detection\nperformance. Motivated by the observation that the real ground-truth is usually\nsituated in the aggregation region of the proposals assigned to a noisy\nground-truth, we propose DIStribution-aware CalibratiOn (DISCO) to model the\nspatial distribution of proposals for calibrating supervision signals. In\nDISCO, spatial distribution modeling is performed to statistically extract the\npotential locations of objects. Based on the modeled distribution, three\ndistribution-aware techniques, i.e., distribution-aware proposal augmentation\n(DA-Aug), distribution-aware box refinement (DA-Ref), and distribution-aware\nconfidence estimation (DA-Est), are developed to improve classification,\nlocalization, and interpretability, respectively. Extensive experiments on\nlarge-scale noisy image datasets (i.e., Pascal VOC and MS-COCO) demonstrate\nthat DISCO can achieve state-of-the-art detection performance, especially at\nhigh noise levels.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:20:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhou","Donghao",""],["Li","Jialin",""],["Li","Jinpeng",""],["Huang","Jiancheng",""],["Nie","Qiang",""],["Liu","Yong",""],["Gao","Bin-Bin",""],["Wang","Qiong",""],["Heng","Pheng-Ann",""],["Chen","Guangyong",""]]}
{"id":"2308.12018","submitter":"Moritz Knolle","authors":"Moritz Knolle, Robert Dorfman, Alexander Ziller, Daniel Rueckert and\n  Georgios Kaissis","title":"Bias-Aware Minimisation: Understanding and Mitigating Estimator Bias in\n  Private SGD","comments":"Accepted to the 2023 Theory and Practice of Differential Privacy\n  (TPDP) Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Differentially private SGD (DP-SGD) holds the promise of enabling the safe\nand responsible application of machine learning to sensitive datasets. However,\nDP-SGD only provides a biased, noisy estimate of a mini-batch gradient. This\nrenders optimisation steps less effective and limits model utility as a result.\nWith this work, we show a connection between per-sample gradient norms and the\nestimation bias of the private gradient oracle used in DP-SGD. Here, we propose\nBias-Aware Minimisation (BAM) that allows for the provable reduction of private\ngradient estimator bias. We show how to efficiently compute quantities needed\nfor BAM to scale to large neural networks and highlight similarities to closely\nrelated methods such as Sharpness-Aware Minimisation. Finally, we provide\nempirical evidence that BAM not only reduces bias but also substantially\nimproves privacy-utility trade-offs on the CIFAR-10, CIFAR-100, and ImageNet-32\ndatasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:20:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Knolle","Moritz",""],["Dorfman","Robert",""],["Ziller","Alexander",""],["Rueckert","Daniel",""],["Kaissis","Georgios",""]]}
{"id":"2308.12019","submitter":"Yehuda Band","authors":"Y. B. Band, Igor Kuzmenko, Marek Trippenbach","title":"Negative Refraction in isotropic achiral and chiral materials","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that negative refraction in materials can occur at frequencies\n$\\omega$ where the real part of the permittivity $\\veps(\\omega)$ and the real\npart of the permeability $\\mu(\\omega)$ are of different sign, and that light\nwith such frequencies can propagate just as well as light with frequencies\nwhere they are of equal sign. Therefore, in order to have negative refraction\none does not need to be in the \"double negative\" regime. We consider negative\nrefractive index achiral materials using the Drude model, and chiral materials\nusing the Drude-Born-Fedorov model. We find that the time-averaged Poynting\nvector always points along the wave vector, the time-averaged energy flux\ndensity is always positive, and the time-averaged energy density is positive\n(negative) when the refractive index is positive (negative). The phase velocity\nis negative when the real part of the refractive index is negative, and the\ngroup velocity generally changes sign several times as a function of frequency\nnear resonance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:26:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Band","Y. B.",""],["Kuzmenko","Igor",""],["Trippenbach","Marek",""]]}
{"id":"2308.12020","submitter":"Jinao Wang","authors":"Jinao Wang, Rimika Jaiswal","title":"Scalable Quantum Ground State Preparation of the Heisenberg Model: A\n  Variational Quantum Eigensolver Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum systems have historically been formidable to simulate using classical\ncomputational methods, particularly as the system size grows. The Heisenberg\nModel, pivotal in understanding magnetic materials, is a quintessential example\nwhere classical simulations face scalability issues. The Variational Quantum\nEigensolver (VQE) algorithm is a system composed of a quantum circuit as well\nas a classical optimizer that can efficiently prepare the Heisenberg ground\nstate by iteratively optimizing the variational parameters. We assess the\nefficacy and scalability of VQE by preparing the ground states of isotropic and\nanisotropic Heisenberg models. This paper also aims to provide insights into\nthe precision and time consumption involved in classical and optimized sampling\napproaches in the calculation of expectation values. In preparing the ground\nstate for the Heisenberg models, this paper paves the way for more efficient\nquantum algorithms and contributes to the broader field of condensed matter\nphysics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:26:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Jinao",""],["Jaiswal","Rimika",""]]}
{"id":"2308.12021","submitter":"Tong Li","authors":"Tong Li, Lu Zhang, Sikang Liu, Shaojie Shen","title":"MARC: Multipolicy and Risk-aware Contingency Planning for Autonomous\n  Driving","comments":"8 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generating safe and non-conservative behaviors in dense, dynamic environments\nremains challenging for automated vehicles due to the stochastic nature of\ntraffic participants' behaviors and their implicit interaction with the ego\nvehicle. This paper presents a novel planning framework, Multipolicy And\nRisk-aware Contingency planning (MARC), that systematically addresses these\nchallenges by enhancing the multipolicy-based pipelines from both behavior and\nmotion planning aspects. Specifically, MARC realizes a critical scenario set\nthat reflects multiple possible futures conditioned on each semantic-level ego\npolicy. Then, the generated policy-conditioned scenarios are further formulated\ninto a tree-structured representation with a dynamic branchpoint based on the\nscene-level divergence. Moreover, to generate diverse driving maneuvers, we\nintroduce risk-aware contingency planning, a bi-level optimization algorithm\nthat simultaneously considers multiple future scenarios and user-defined risk\ntolerance levels. Owing to the more unified combination of behavior and motion\nplanning layers, our framework achieves efficient decision-making and\nhuman-like driving maneuvers. Comprehensive experimental results demonstrate\nsuperior performance to other strong baselines in various environments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:27:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Tong",""],["Zhang","Lu",""],["Liu","Sikang",""],["Shen","Shaojie",""]]}
{"id":"2308.12022","submitter":"Hongyin Zhu","authors":"Hongyin Zhu","title":"Reranking Passages with Coarse-to-Fine Neural Retriever using\n  List-Context Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Passage reranking is a crucial task in many applications, particularly when\ndealing with large-scale documents. Traditional neural architectures are\nlimited in retrieving the best passage for a question because they usually\nmatch the question to each passage separately, seldom considering contextual\ninformation in other passages that can provide comparison and reference\ninformation. This paper presents a list-context attention mechanism to augment\nthe passage representation by incorporating the list-context information from\nother candidates. The proposed coarse-to-fine (C2F) neural retriever addresses\nthe out-of-memory limitation of the passage attention mechanism by dividing the\nlist-context modeling process into two sub-processes, allowing for efficient\nencoding of context information from a large number of candidate answers. This\nmethod can be generally used to encode context information from any number of\ncandidate answers in one pass. Different from most multi-stage information\nretrieval architectures, this model integrates the coarse and fine rankers into\nthe joint optimization process, allowing for feedback between the two layers to\nupdate the model simultaneously. Experiments demonstrate the effectiveness of\nthe proposed approach.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:29:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhu","Hongyin",""]]}
{"id":"2308.12023","submitter":"Gareth Parkinson","authors":"Florian Kraushofer, Matthias Meier, Zden\\v{e}k Jakub, Johanna\n  H\\\"utner, Jan Balajka, Jan Hulva, Michael Schmid, Cesare Franchini, Ulrike\n  Diebold, Gareth S. Parkinson","title":"Oxygen-Terminated (1x1) Reconstruction of Reduced Magnetite\n  Fe$_3$O$_4$(111)","comments":null,"journal-ref":"Journal of Physical Chemistry C Letters, 14 (2023) 3258 - 3265","doi":"10.1021/acs.jpclett.3c00281","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The (111) facet of magnetite (Fe$_3$O$_4$) has been studied extensively by\nexperimental and theoretical methods, but controversy remains regarding the\nstructure of its low-energy surface terminations. Using density functional\ntheory (DFT) computations, we demonstrate three reconstructions that are more\nfavorable than the accepted Fe$_{\\rm oct2}$ termination in reducing conditions.\nAll three structures change the coordination of iron in the kagome Fe$_{\\rm\noct1}$ layer to tetrahedral. With atomically-resolved microscopy techniques, we\nshow that the termination that coexists with the Fe$_{\\rm tet1}$ termination\nconsists of tetrahedral iron capped by three-fold coordinated oxygen atoms.\nThis structure explains the inert nature of the reduced patches.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:31:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kraushofer","Florian",""],["Meier","Matthias",""],["Jakub","Zden\u011bk",""],["H\u00fctner","Johanna",""],["Balajka","Jan",""],["Hulva","Jan",""],["Schmid","Michael",""],["Franchini","Cesare",""],["Diebold","Ulrike",""],["Parkinson","Gareth S.",""]]}
{"id":"2308.12024","submitter":"Mohamad Nasser","authors":"Mohamad N. Nasser","title":"The faithfulness of an extension of Lawrence-Krammer representation on\n  the group of conjugating automorphisms $C_n$ in the cases $n=3$ and $n=4$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $C_n$ be the group of conjugating automorphisms. Valerij G. Bardakov\ndefined a representation $\\rho$ of $C_n$, which is an extension of\nLawrence-Krammer representation of the braid group $B_n$. Bardakov proved that\nthe representation $\\rho$ is unfaithful for $n \\geq 5$. The cases $n=3,4$\nremain open. M. N. Nasser and M. N. Abdulrahim made attempts towards the\nfaithfulness of $\\rho$ in the case $n=3$. In this work, we prove that $\\rho$ is\nunfaithful in the both cases $n=3$ and $n=4$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:32:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nasser","Mohamad N.",""]]}
{"id":"2308.12025","submitter":"Songhua Yang","authors":"Songhua Yang, Chenghao Zhang, Hongfei Xu and Yuxiang Jia","title":"Knowledge-injected Prompt Learning for Chinese Biomedical Entity\n  Normalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Biomedical Entity Normalization (BEN) task aims to align raw,\nunstructured medical entities to standard entities, thus promoting data\ncoherence and facilitating better downstream medical applications. Recently,\nprompt learning methods have shown promising results in this task. However,\nexisting research falls short in tackling the more complex Chinese BEN task,\nespecially in the few-shot scenario with limited medical data, and the vast\npotential of the external medical knowledge base has yet to be fully harnessed.\nTo address these challenges, we propose a novel Knowledge-injected Prompt\nLearning (PL-Knowledge) method. Specifically, our approach consists of five\nstages: candidate entity matching, knowledge extraction, knowledge encoding,\nknowledge injection, and prediction output. By effectively encoding the\nknowledge items contained in medical entities and incorporating them into our\ntailor-made knowledge-injected templates, the additional knowledge enhances the\nmodel's ability to capture latent relationships between medical entities, thus\nachieving a better match with the standard entities. We extensively evaluate\nour model on a benchmark dataset in both few-shot and full-scale scenarios. Our\nmethod outperforms existing baselines, with an average accuracy boost of\n12.96\\% in few-shot and 0.94\\% in full-data cases, showcasing its excellence in\nthe BEN task.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:32:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Songhua",""],["Zhang","Chenghao",""],["Xu","Hongfei",""],["Jia","Yuxiang",""]]}
{"id":"2308.12026","submitter":"Dr Krishna Kumar Singh","authors":"M. Khurana, A. Pathania, K. K. Singh, C. Borwankar, P. K. Netrakanti,\n  K. K. Yadav","title":"Prospects of detecting gamma-ray signal of dark matter interaction with\n  the MACE telescope","comments":"8 Pages, 4 Figures, To appear in Proceedings of Science (ICRC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The MACE (Major Atmospheric Cherenkov Experiment) telescope has started its\nregular gamma-ray observations at Hanle in India. Located at an altitude of\n$\\sim$ 4.3 km above sea level and equipped with a 21 m diameter large\nquasi-parabolic reflector, it has the capability to explore the gamma-ray sky\nin the energy range above 20 GeV with very high sensitivity. In this work, we\npresent the results from the feasibility studies for searching high-energy\ngamma-ray signals from dark matter interaction in potential astrophysical\nenvironments. We study the impact of MACE response function and other\ninstrumental characteristics to probe the velocity average interaction\ncross-section ($<\\sigma v>$) of the weakly interacting massive particles\n(WIMPs), expected from the thermal dark matter freeze-out during the decoupling\nera. We consider the presence of dark matter in the form of pure WIMPs in the\nmass range 200 GeV - 10 TeV to produce distinctive gamma-ray spectra through\nits self-annihilation into standard model particles using the Pythia simulation\npackage. The convolution of gamma-ray spectra corresponding to different\nstandard model channels with the MACE response function is used to estimate the\nupper limit on $<\\sigma v>$ for 100 hours of expected MACE observation of\nSegue1 (a dwarf spheroidal galaxy) which is a potential site of dark matter.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:33:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Khurana","M.",""],["Pathania","A.",""],["Singh","K. K.",""],["Borwankar","C.",""],["Netrakanti","P. K.",""],["Yadav","K. K.",""]]}
{"id":"2308.12027","submitter":"Xin Liu","authors":"Guo-Liang Guo, Han-Bing Leng and Xin Liu","title":"Parity-protected superconducting qubit based on topological insulators","comments":"10 pages and 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a novel architecture that utilizes two 0-$\\pi$ qubits based on\ntopological Josephson junctions to implement a parity-protected superconducting\nqubit. The topological Josephson junctions provides protection against\nfabrication variations, which ensures the identical Josephson junctions\nrequired to implement the0-$\\pi$ qubit. By viewing the even and odd parity\nground states of a 0-$\\pi$ qubit as spin-$\\frac{1}{2}$ states, we construct the\nlogic qubit states using the total parity odd subspace of two 0-$\\pi$ qubits.\nThis parity-protected qubit exhibits robustness against charge noise, similar\nto a singlet-triplet qubit's immunity to global magnetic field fluctuations.\nMeanwhile, the flux noise cannot directly couple two states with the same total\nparity and therefore is greatly suppressed. Benefiting from the simultaneous\nprotection from both charge and flux noise, we demonstrate a dramatic\nenhancement of both $T_1$ and $T_2$ coherence times. Our work presents a new\napproach to engineer symmetry-protected superconducting qubits.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:38:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Guo","Guo-Liang",""],["Leng","Han-Bing",""],["Liu","Xin",""]]}
{"id":"2308.12028","submitter":"Hao Chen","authors":"Chen hao, Xie Runfeng, Cui Xiangyang, Yan Zhou, Wang Xin, Xuan\n  Zhanwei, Zhang Kai","title":"LKPNR: LLM and KG for Personalized News Recommendation Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurately recommending candidate news articles to users is a basic challenge\nfaced by personalized news recommendation systems. Traditional methods are\nusually difficult to grasp the complex semantic information in news texts,\nresulting in unsatisfactory recommendation results. Besides, these traditional\nmethods are more friendly to active users with rich historical behaviors.\nHowever, they can not effectively solve the \"long tail problem\" of inactive\nusers. To address these issues, this research presents a novel general\nframework that combines Large Language Models (LLM) and Knowledge Graphs (KG)\ninto semantic representations of traditional methods. In order to improve\nsemantic understanding in complex news texts, we use LLMs' powerful text\nunderstanding ability to generate news representations containing rich semantic\ninformation. In addition, our method combines the information about news\nentities and mines high-order structural information through multiple hops in\nKG, thus alleviating the challenge of long tail distribution. Experimental\nresults demonstrate that compared with various traditional models, the\nframework significantly improves the recommendation effect. The successful\nintegration of LLM and KG in our framework has established a feasible path for\nachieving more accurate personalized recommendations in the news field. Our\ncode is available at https://github.com/Xuan-ZW/LKPNR.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:39:18 GMT"}],"update_date":"2023-08-24","authors_parsed":[["hao","Chen",""],["Runfeng","Xie",""],["Xiangyang","Cui",""],["Zhou","Yan",""],["Xin","Wang",""],["Zhanwei","Xuan",""],["Kai","Zhang",""]]}
{"id":"2308.12029","submitter":"Baijiong Lin","authors":"Baijiong Lin, Weisen Jiang, Feiyang Ye, Yu Zhang, Pengguang Chen,\n  Ying-Cong Chen, Shu Liu","title":"A Scale-Invariant Task Balancing Approach for Multi-Task Learning","comments":"Technical Report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-task learning (MTL), a learning paradigm to learn multiple related\ntasks simultaneously, has achieved great success in various fields. However,\ntask-balancing remains a significant challenge in MTL, with the disparity in\nloss/gradient scales often leading to performance compromises. In this paper,\nwe propose a Scale-Invariant Multi-Task Learning (SI-MTL) method to alleviate\nthe task-balancing problem from both loss and gradient perspectives.\nSpecifically, SI-MTL contains a logarithm transformation which is performed on\nall task losses to ensure scale-invariant at the loss level, and a gradient\nbalancing method, SI-G, which normalizes all task gradients to the same\nmagnitude as the maximum gradient norm. Extensive experiments conducted on\nseveral benchmark datasets consistently demonstrate the effectiveness of SI-G\nand the state-of-the-art performance of SI-MTL.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:41:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lin","Baijiong",""],["Jiang","Weisen",""],["Ye","Feiyang",""],["Zhang","Yu",""],["Chen","Pengguang",""],["Chen","Ying-Cong",""],["Liu","Shu",""]]}
{"id":"2308.12030","submitter":"Renlong Jie","authors":"Renlong Jie, Xiaojun Meng, Lifeng Shang, Xin Jiang, Qun Liu","title":"Prompt-Based Length Controlled Generation with Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, large language models (LLMs) like ChatGPT and GPT-4 have attracted\ngreat attention given their surprising improvement and performance. Length\ncontrolled generation of LLMs emerges as an important topic, which also enables\nusers to fully leverage the capability of LLMs in more real-world scenarios\nlike generating a proper answer or essay of a desired length. In addition, the\nautoregressive generation in LLMs is extremely time-consuming, while the\nability of controlling this generated length can arbitrarily reduce the\ninference cost by limiting the length, and thus satisfy different needs.\nTherefore, we aim to propose a prompt-based length control method to achieve\nthis length controlled generation, which can also be widely applied in\nGPT-style LLMs. In particular, we adopt reinforcement learning with the reward\nsignal given by either trainable or rule-based reward model, which further\naffects the generation of LLMs via rewarding a pre-defined target length.\nExperiments show that our method significantly improves the accuracy of\nprompt-based length control for summarization task on popular datasets like\nCNNDM and NYT. We believe this length-controllable ability can provide more\npotentials towards the era of LLMs.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:43:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jie","Renlong",""],["Meng","Xiaojun",""],["Shang","Lifeng",""],["Jiang","Xin",""],["Liu","Qun",""]]}
{"id":"2308.12031","submitter":"Jose Sousa","authors":"Luca Gherardini, Varun Ravi Varma, Karol Capala, Roger Woods, Jose\n  Sousa","title":"CACTUS: a Comprehensive Abstraction and Classification Tool for\n  Uncovering Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The availability of large data sets is providing an impetus for driving\ncurrent artificial intelligent developments. There are, however, challenges for\ndeveloping solutions with small data sets due to practical and cost-effective\ndeployment and the opacity of deep learning models. The Comprehensive\nAbstraction and Classification Tool for Uncovering Structures called CACTUS is\npresented for improved secure analytics by effectively employing explainable\nartificial intelligence. It provides additional support for categorical\nattributes, preserving their original meaning, optimising memory usage, and\nspeeding up the computation through parallelisation. It shows to the user the\nfrequency of the attributes in each class and ranks them by their\ndiscriminative power. Its performance is assessed by application to the\nWisconsin diagnostic breast cancer and Thyroid0387 data sets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:44:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gherardini","Luca",""],["Varma","Varun Ravi",""],["Capala","Karol",""],["Woods","Roger",""],["Sousa","Jose",""]]}
{"id":"2308.12032","submitter":"Ming Li","authors":"Ming Li, Yong Zhang, Zhitao Li, Jiuhai Chen, Lichang Chen, Ning Cheng,\n  Jianzong Wang, Tianyi Zhou, Jing Xiao","title":"From Quantity to Quality: Boosting LLM Performance with Self-Guided Data\n  Selection for Instruction Tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the realm of Large Language Models, the balance between instruction data\nquality and quantity has become a focal point. Recognizing this, we introduce a\nself-guided methodology for LLMs to autonomously discern and select cherry\nsamples from vast open-source datasets, effectively minimizing manual curation\nand potential cost for instruction tuning an LLM. Our key innovation, the\nInstruction-Following Difficulty (IFD) metric, emerges as a pivotal tool to\nidentify discrepancies between a model's expected responses and its autonomous\ngeneration prowess. Through the adept application of IFD, cherry samples are\npinpointed, leading to a marked uptick in model training efficiency. Empirical\nvalidations on renowned datasets like Alpaca and WizardLM underpin our\nfindings; with a mere 10% of conventional data input, our strategy showcases\nimproved results. This synthesis of self-guided cherry-picking and the IFD\nmetric signifies a transformative leap in the optimization of LLMs, promising\nboth efficiency and resource-conscious advancements.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:45:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Ming",""],["Zhang","Yong",""],["Li","Zhitao",""],["Chen","Jiuhai",""],["Chen","Lichang",""],["Cheng","Ning",""],["Wang","Jianzong",""],["Zhou","Tianyi",""],["Xiao","Jing",""]]}
{"id":"2308.12033","submitter":"Chenrui Zhang","authors":"Chenrui Zhang, Lin Liu, Jinpeng Wang, Chuyuan Wang, Xiao Sun, Hongyu\n  Wang, Mingchen Cai","title":"PREFER: Prompt Ensemble Learning via Feedback-Reflect-Refine","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As an effective tool for eliciting the power of Large Language Models (LLMs),\nprompting has recently demonstrated unprecedented abilities across a variety of\ncomplex tasks. To further improve the performance, prompt ensemble has\nattracted substantial interest for tackling the hallucination and instability\nof LLMs. However, existing methods usually adopt a two-stage paradigm, which\nrequires a pre-prepared set of prompts with substantial manual effort, and is\nunable to perform directed optimization for different weak learners. In this\npaper, we propose a simple, universal, and automatic method named PREFER (Pompt\nEnsemble learning via Feedback-Reflect-Refine) to address the stated\nlimitations. Specifically, given the fact that weak learners are supposed to\nfocus on hard examples during boosting, PREFER builds a feedback mechanism for\nreflecting on the inadequacies of existing weak learners. Based on this, the\nLLM is required to automatically synthesize new prompts for iterative\nrefinement. Moreover, to enhance stability of the prompt effect evaluation, we\npropose a novel prompt bagging method involving forward and backward thinking,\nwhich is superior to majority voting and is beneficial for both feedback and\nweight calculation in boosting. Extensive experiments demonstrate that our\nPREFER achieves state-of-the-art performance in multiple types of tasks by a\nsignificant margin. We have made our code publicly available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:46:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Chenrui",""],["Liu","Lin",""],["Wang","Jinpeng",""],["Wang","Chuyuan",""],["Sun","Xiao",""],["Wang","Hongyu",""],["Cai","Mingchen",""]]}
{"id":"2308.12034","submitter":"Md Ashequl Islam","authors":"Md Ashequl Islam, Nur Saifullah Kamarrudin, Ruslizam Daud, Ishak\n  Ibrahim, Anas Rahman and Fauziah Mat","title":"Temperature measurement methods in an experimental setup during bone\n  drilling: A brief review on the comparison of thermocouple and infrared\n  thermography","comments":null,"journal-ref":null,"doi":"10.1088/1742-6596/2129/1/012096","report-no":null,"categories":"physics.med-ph q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Predicting thermal response in orthopaedic surgery or dental implantation\nremains a significant challenge. This study aims to find a practical approach\nfor measuring temperature elevation during a bone drilling experiment by\nanalyzing the existing methods. Traditionally thermocouple has frequently been\nused to predict the bone temperature in the drilling process. However, several\nexperimental studies demonstrate that the invasive method using thermocouple is\nimpractical in medical conditions and prefers the thermal infrared (IR) camera\nas a non-invasive method. This work proposes a simplified experimental model\nthat uses the thermocouple to determine temperature rise coupled with the\nthermal image source approach. Furthermore, our new method provides a\nsignificant opportunity to calibrate the thermal IR camera by discovering the\nundetected heat elevation in a workpiece depth.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:47:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Islam","Md Ashequl",""],["Kamarrudin","Nur Saifullah",""],["Daud","Ruslizam",""],["Ibrahim","Ishak",""],["Rahman","Anas",""],["Mat","Fauziah",""]]}
{"id":"2308.12035","submitter":"Shuhei Kurita","authors":"Shuhei Kurita, Naoki Katsura, Eri Onami","title":"RefEgo: Referring Expression Comprehension Dataset from First-Person\n  Perception of Ego4D","comments":"15 pages, 11 figures. ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Grounding textual expressions on scene objects from first-person views is a\ntruly demanding capability in developing agents that are aware of their\nsurroundings and behave following intuitive text instructions. Such capability\nis of necessity for glass-devices or autonomous robots to localize referred\nobjects in the real-world. In the conventional referring expression\ncomprehension tasks of images, however, datasets are mostly constructed based\non the web-crawled data and don't reflect diverse real-world structures on the\ntask of grounding textual expressions in diverse objects in the real world.\nRecently, a massive-scale egocentric video dataset of Ego4D was proposed. Ego4D\ncovers around the world diverse real-world scenes including numerous indoor and\noutdoor situations such as shopping, cooking, walking, talking, manufacturing,\netc. Based on egocentric videos of Ego4D, we constructed a broad coverage of\nthe video-based referring expression comprehension dataset: RefEgo. Our dataset\nincludes more than 12k video clips and 41 hours for video-based referring\nexpression comprehension annotation. In experiments, we combine the\nstate-of-the-art 2D referring expression comprehension models with the object\ntracking algorithm, achieving the video-wise referred object tracking even in\ndifficult conditions: the referred object becomes out-of-frame in the middle of\nthe video or multiple similar objects are presented in the video.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:49:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kurita","Shuhei",""],["Katsura","Naoki",""],["Onami","Eri",""]]}
{"id":"2308.12036","submitter":"Chen Xiao Zhao","authors":"Chenxiao Zhao, Qiang Huang, Leo\\v{s} Valenta, Kristjan Eimre, Lin\n  Yang, Aliaksandr V. Yakutovich, Wangwei Xu, Ji Ma, Xinliang Feng, Michal\n  Jur\\'i{\\v{c}}ek, Roman Fasel, Pascal Ruffieux, Carlo A. Pignedoli","title":"Tailoring magnetism of nanographenes via tip-controlled dehydrogenation","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atomically precise graphene nanoflakes, called nanographenes, have emerged as\na promising platform to realize carbon magnetism. Their ground state spin\nconfiguration can be anticipated by Ovchinnikov-Lieb rules based on the\nmismatch of {\\pi}-electrons from two sublattices. While rational geometrical\ndesign achieves specific spin configurations, further direct control over the\n{\\pi}-electrons offers a desirable extension for efficient spin manipulations\nand potential quantum device operations. To this end, we apply a site-specific\ndehydrogenation using a scanning tunneling microscope tip to nanographenes\ndeposited on a Au(111) substrate, which shows the capability of precisely\ntailoring the underlying {\\pi}-electron system and therefore efficiently\nmanipulating their magnetism. Through first-principles calculations and\ntight-binding mean-field-Hubbard modelling, we demonstrate that the\ndehydrogenation-induced Au-C bond formation along with the resulting\nhybridization between frontier {\\pi}-orbitals and Au substrate states\neffectively eliminate the unpaired {\\pi}-electron. Our results establish an\nefficient technique for controlling the magnetism of nanographenes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:50:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhao","Chenxiao",""],["Huang","Qiang",""],["Valenta","Leo\u0161",""],["Eimre","Kristjan",""],["Yang","Lin",""],["Yakutovich","Aliaksandr V.",""],["Xu","Wangwei",""],["Ma","Ji",""],["Feng","Xinliang",""],["Jur\u00ed{\u010d}ek","Michal",""],["Fasel","Roman",""],["Ruffieux","Pascal",""],["Pignedoli","Carlo A.",""]]}
{"id":"2308.12037","submitter":"Tiago Fran\\c{c}a","authors":"Tiago Fran\\c{c}a","title":"Binary Black Holes in Modified Gravity","comments":"Ph.D. thesis; Supervisor: Pau Figueras; 252 pages, 69 figures, 6\n  tables; 2 Youtube videos https://www.youtube.com/watch?v=cfXF1wIcIJc and\n  https://www.youtube.com/watch?v=uOed4AG1ulg","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this thesis, we use numerical relativity to investigate gravitational\nwaves from binary black holes in extensions of GR. We first study spherically\nsymmetric gravitational collapse in cubic Horndeski theories of gravity. By\nvarying the coupling constants and the initial amplitude of the scalar field,\nwe determine the region in the space of couplings and amplitudes for which it\nis possible to construct global solutions to the Horndeski theories.\nFurthermore, we identify the regime of validity of effective field theory (EFT)\nas the sub-region for which a certain weak coupling condition remains small at\nall times. We study black hole binary mergers in these cubic Horndeski theories\nof gravity, treating them fully non-linearly. In the regime of validity of EFT,\nthe mismatch of the gravitational wave strain between Horndeski and GR (coupled\nto a scalar field) can be larger than $30\\%$ in the Advanced LIGO mass range.\nInitial data and coupling constants are chosen so the theory always remains in\nthe weakly coupled regime. We observe that the waveform in Horndeski theories\nis shifted by an amount much larger than the smallness parameter that controls\ninitial data. This effect is generic and may be present in other theories of\ngravity involving higher derivatives. We explore a higher-order curvature\ncorrection of GR. Guided by toy models, we develop systems capable of\nreproducing the low energy behaviour of many such theories with a fully\nnonlinear/non-perturbative approach. We evolve binary black holes, observing a\nshift in phase accumulated over time which is not statistically significant\nwhen compared to GR, for the methods and coupling used. Finally, we present\nAHFinder, a flexible multi-purpose tool to find apparent horizons in the\nopen-source numerical relativity code GRChombo.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:54:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Fran\u00e7a","Tiago",""]]}
{"id":"2308.12038","submitter":"Jinyi Hu","authors":"Jinyi Hu, Yuan Yao, Chongyi Wang, Shan Wang, Yinxu Pan, Qianyu Chen,\n  Tianyu Yu, Hanghao Wu, Yue Zhao, Haoye Zhang, Xu Han, Yankai Lin, Jiao Xue,\n  Dahai Li, Zhiyuan Liu, Maosong Sun","title":"Large Multilingual Models Pivot Zero-Shot Multimodal Learning across\n  Languages","comments":"https://github.com/OpenBMB/VisCPM.git","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently there has been a significant surge in multimodal learning in terms\nof both image-to-text and text-to-image generation. However, the success is\ntypically limited to English, leaving other languages largely behind. Building\na competitive counterpart in other languages is highly challenging due to the\nlow-resource nature of non-English multimodal data (i.e., lack of large-scale,\nhigh-quality image-text data). In this work, we propose MPM, an effective\ntraining paradigm for training large multimodal models in low-resource\nlanguages. MPM demonstrates that Multilingual language models can Pivot\nzero-shot Multimodal learning across languages. Specifically, based on a strong\nmultilingual large language model, multimodal models pretrained on English-only\nimage-text data can well generalize to other languages in a zero-shot manner\nfor both image-to-text and text-to-image generation, even surpassing models\ntrained on image-text data in native languages. Taking Chinese as a practice of\nMPM, we build large multimodal models VisCPM in image-to-text and text-to-image\ngeneration, which achieve state-of-the-art (open-source) performance in\nChinese. To facilitate future research, we open-source codes and model weights\nat https://github.com/OpenBMB/VisCPM.git.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:55:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hu","Jinyi",""],["Yao","Yuan",""],["Wang","Chongyi",""],["Wang","Shan",""],["Pan","Yinxu",""],["Chen","Qianyu",""],["Yu","Tianyu",""],["Wu","Hanghao",""],["Zhao","Yue",""],["Zhang","Haoye",""],["Han","Xu",""],["Lin","Yankai",""],["Xue","Jiao",""],["Li","Dahai",""],["Liu","Zhiyuan",""],["Sun","Maosong",""]]}
{"id":"2308.12039","submitter":"Guangwei Xu","authors":"Guangwei Xu, Yangzhao Zhang, Longhui Zhang, Dingkun Long, Pengjun Xie,\n  Ruijie Guo","title":"Hybrid Retrieval and Multi-stage Text Ranking Solution at TREC 2022 Deep\n  Learning Track","comments":"TREC 2022 Deep Learning Track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale text retrieval technology has been widely used in various\npractical business scenarios. This paper presents our systems for the TREC 2022\nDeep Learning Track. We explain the hybrid text retrieval and multi-stage text\nranking method adopted in our solution. The retrieval stage combined the two\nstructures of traditional sparse retrieval and neural dense retrieval. In the\nranking stage, in addition to the full interaction-based ranking model built on\nlarge pre-trained language model, we also proposes a lightweight sub-ranking\nmodule to further enhance the final text ranking performance. Evaluation\nresults demonstrate the effectiveness of our proposed approach. Our models\nachieve the 1st and 4th rank on the test set of passage ranking and document\nranking respectively.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:56:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Guangwei",""],["Zhang","Yangzhao",""],["Zhang","Longhui",""],["Long","Dingkun",""],["Xie","Pengjun",""],["Guo","Ruijie",""]]}
{"id":"2308.12040","submitter":"Shubham Kumar Shah","authors":"Shubham Kumar, Narendra N. Hegade, Enrique Solano, Francisco\n  Albarr\\'an-Arriagada, and Gabriel Alvarado Barrios","title":"Digital-analog quantum computing of fermion-boson models in\n  superconducting circuits","comments":"6+5 Pages, 5+2 Figures, 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a digital-analog quantum algorithm for simulating the\nHubbard-Holstein model, describing strongly-correlated fermion-boson\ninteractions, in a suitable architecture with superconducting circuits. It\ncomprises a linear chain of qubits connected by resonators, emulating\nelectron-electron (e-e) and electron-phonon (e-p) interactions, as well as\nfermion tunneling. Our approach is adequate for a digital-analog quantum\ncomputing (DAQC) of fermion-boson models including those described by the\nHubbard-Holstein model. We show the reduction in the circuit depth of the DAQC\nalgorithm, a sequence of digital steps and analog blocks, outperforming the\npurely digital approach. We exemplify the quantum simulation of a half-filling\ntwo-site Hubbard-Holstein model. In such example we obtain fidelities larger\nthan 0.98, showing that our proposal is suitable to study the dynamical\nbehavior of solid-state systems. Our proposal opens the door to computing\ncomplex systems for chemistry, materials, and high-energy physics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:01:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kumar","Shubham",""],["Hegade","Narendra N.",""],["Solano","Enrique",""],["Albarr\u00e1n-Arriagada","Francisco",""],["Barrios","Gabriel Alvarado",""]]}
{"id":"2308.12041","submitter":"Avraham Gal","authors":"Eliahu Friedman and Avraham Gal","title":"Deciphering $\\Xi^-$ capture events in light emulsion nuclei","comments":"6 pages, 3 figures, 2 tables; invited talk at MESON2023, Krakow, June\n  2023, plus updated discussion section; v1: as submitted to EPJ Web of\n  Conferences","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We recently showed that all five KEK and J-PARC uniquely assigned two-body\n$\\Xi^-$+${^A}$Z$\\to{_{\\Lambda}^{A'}}$Z'+${_{\\Lambda}^{A''}}$Z'' capture events\nin CNO light emulsion nuclei are consistent with Coulomb-assisted $1p_{\\Xi^-}$\nnuclear states in a $\\Xi$-nuclear potential of nuclear-matter depth\n$V_{\\Xi}\\gtrsim 20$ MeV. Here we argue that the recently reported $^{14}$N\ncapture events named KINKA and IRRAWADDY are more likely $1p_{\\Xi^0}$--$^{14}$C\nnuclear states than $1s_{\\Xi^-}$--$^{14}$N states that would imply considerably\nsmaller values of $V_{\\Xi}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:03:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Friedman","Eliahu",""],["Gal","Avraham",""]]}
{"id":"2308.12042","submitter":"Enrico Pasqualetto","authors":"Emanuele Caputo, Milica Lu\\v{c}i\\'c, Enrico Pasqualetto, Ivana\n  Vojnovi\\'c","title":"On the integration of Banach modules and its applications to vector\n  calculus on ${\\sf RCD}$ spaces","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A finite-dimensional ${\\sf RCD}$ space can be foliated into sufficiently\nregular leaves, where a differential calculus can be performed. Two important\nexamples are given by the measure-theoretic boundary of the superlevel set of a\nfunction of bounded variation and the needle decomposition associated to a\nLipschitz function. The aim of this paper is to connect the vector calculus on\nthe lower dimensional leaves with the one on the base space. In order to\nachieve this goal, we develop a general theory of integration of $L^0$-Banach\n$L^0$-modules of independent interest. Roughly speaking, we study how to `patch\ntogether' vector fields defined on the leaves that are measurable with respect\nto the foliation parameter.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:06:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Caputo","Emanuele",""],["Lu\u010di\u0107","Milica",""],["Pasqualetto","Enrico",""],["Vojnovi\u0107","Ivana",""]]}
{"id":"2308.12043","submitter":"Junhao Chen","authors":"Feiyu Zhang, Liangzhi Li, Junhao Chen, Zhouqiang Jiang, Bowen Wang,\n  Yiming Qian","title":"IncreLoRA: Incremental Parameter Allocation Method for\n  Parameter-Efficient Fine-tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increasing size of pre-trained language models (PLMs), fine-tuning\nall the parameters in the model is not efficient, especially when there are a\nlarge number of downstream tasks, which incur significant training and storage\ncosts. Many parameter-efficient fine-tuning (PEFT) approaches have been\nproposed, among which, Low-Rank Adaptation (LoRA) is a representative approach\nthat injects trainable rank decomposition matrices into every target module.\nYet LoRA ignores the importance of parameters in different modules. To address\nthis problem, many works have been proposed to prune the parameters of LoRA.\nHowever, under limited training conditions, the upper bound of the rank of the\npruned parameter matrix is still affected by the preset values. We, therefore,\npropose IncreLoRA, an incremental parameter allocation method that adaptively\nadds trainable parameters during training based on the importance scores of\neach module. This approach is different from the pruning method as it is not\nlimited by the initial number of training parameters, and each parameter matrix\nhas a higher rank upper bound for the same training overhead. We conduct\nextensive experiments on GLUE to demonstrate the effectiveness of IncreLoRA.\nThe results show that our method owns higher parameter efficiency, especially\nwhen under the low-resource settings where our method significantly outperforms\nthe baselines. Our code is publicly available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:08:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Feiyu",""],["Li","Liangzhi",""],["Chen","Junhao",""],["Jiang","Zhouqiang",""],["Wang","Bowen",""],["Qian","Yiming",""]]}
{"id":"2308.12044","submitter":"Augustina Chidinma Amakor","authors":"Augustina C. Amakor, Konstantin Sonntag and Sebastian Peitz","title":"A multiobjective continuation method to compute the regularization path\n  of deep neural networks","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI math.OC stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Sparsity is a highly desired feature in deep neural networks (DNNs) since it\nensures numerical efficiency, improves the interpretability of models (due to\nthe smaller number of relevant features), and robustness. In machine learning\napproaches based on linear models, it is well known that there exists a\nconnecting path between the sparsest solution in terms of the $\\ell^1$ norm\n(i.e., zero weights) and the non-regularized solution, which is called the\nregularization path. Very recently, there was a first attempt to extend the\nconcept of regularization paths to DNNs by means of treating the empirical loss\nand sparsity ($\\ell^1$ norm) as two conflicting criteria and solving the\nresulting multiobjective optimization problem. However, due to the\nnon-smoothness of the $\\ell^1$ norm and the high number of parameters, this\napproach is not very efficient from a computational perspective. To overcome\nthis limitation, we present an algorithm that allows for the approximation of\nthe entire Pareto front for the above-mentioned objectives in a very efficient\nmanner. We present numerical examples using both deterministic and stochastic\ngradients. We furthermore demonstrate that knowledge of the regularization path\nallows for a well-generalizing network parametrization.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:08:52 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 07:37:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Amakor","Augustina C.",""],["Sonntag","Konstantin",""],["Peitz","Sebastian",""]]}
{"id":"2308.12045","submitter":"Jiarui Yu","authors":"Jiarui Yu, Haoran Li, Yanbin Hao, Bin Zhu, Tong Xu and Xiangnan He","title":"CgT-GAN: CLIP-guided Text GAN for Image Captioning","comments":"Accepted at ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3611891","report-no":null,"categories":"cs.CV cs.AI cs.CL cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The large-scale visual-language pre-trained model, Contrastive Language-Image\nPre-training (CLIP), has significantly improved image captioning for scenarios\nwithout human-annotated image-caption pairs. Recent advanced CLIP-based image\ncaptioning without human annotations follows a text-only training paradigm,\ni.e., reconstructing text from shared embedding space. Nevertheless, these\napproaches are limited by the training/inference gap or huge storage\nrequirements for text embeddings. Given that it is trivial to obtain images in\nthe real world, we propose CLIP-guided text GAN (CgT-GAN), which incorporates\nimages into the training process to enable the model to \"see\" real visual\nmodality. Particularly, we use adversarial training to teach CgT-GAN to mimic\nthe phrases of an external text corpus and CLIP-based reward to provide\nsemantic guidance. The caption generator is jointly rewarded based on the\ncaption naturalness to human language calculated from the GAN's discriminator\nand the semantic guidance reward computed by the CLIP-based reward module. In\naddition to the cosine similarity as the semantic guidance reward (i.e.,\nCLIP-cos), we further introduce a novel semantic guidance reward called\nCLIP-agg, which aligns the generated caption with a weighted text embedding by\nattentively aggregating the entire corpus. Experimental results on three\nsubtasks (ZS-IC, In-UIC and Cross-UIC) show that CgT-GAN outperforms\nstate-of-the-art methods significantly across all metrics. Code is available at\nhttps://github.com/Lihr747/CgtGAN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:25:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yu","Jiarui",""],["Li","Haoran",""],["Hao","Yanbin",""],["Zhu","Bin",""],["Xu","Tong",""],["He","Xiangnan",""]]}
{"id":"2308.12046","submitter":"Henrik Kalisch","authors":"Karoline Holand, Henrik Kalisch, Maria Bj{\\o}rnestad, Michael\n  Stre{\\ss}er, Marc Buckley, Jochen Horstmann, Volker Roeber, Ruben\n  Carrasco-Alvarez, Marius Cysewski, Hege G. Fr{\\o}ysa","title":"Identification of wave breaking from nearshore wave-by-wave records","comments":"Eight figures, two tables, submitted to Physics of Fluids","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using data from a recent field campaign, we evaluate several breaking\ncriteria with the goal of assessing the accuracy of these criteria in wave\nbreaking detection. Two new criteria are also evaluated. An integral parameter\nis defined in terms of temporal wave trough area, and a differential parameter\nis defined in terms of maximum steepness of the crest front period. The\ncriteria tested here are based solely on sea surface elevation derived from\nstandard pressure gauge records. They identify breaking and non-breaking waves\nwith an accuracy between 84% and 89% based on the examined field data.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:29:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Holand","Karoline",""],["Kalisch","Henrik",""],["Bj\u00f8rnestad","Maria",""],["Stre\u00dfer","Michael",""],["Buckley","Marc",""],["Horstmann","Jochen",""],["Roeber","Volker",""],["Carrasco-Alvarez","Ruben",""],["Cysewski","Marius",""],["Fr\u00f8ysa","Hege G.",""]]}
{"id":"2308.12047","submitter":"Michal Mrnka","authors":"Michal Mrnka, Harry Penketh, Ian R. Hooper, Sonal Saxena, Nicholas E.\n  Grant, John D. Murphy, David B. Phillips, Euan Hendry","title":"Terahertz imaging through emissivity control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Adoption of terahertz technologies is hindered by the lack of cost-effective\nTHz sources. Here we demonstrate a fundamentally new way to generate and\ncontrol THz radiation, via spatio-temporal emissivity modulation. By patterning\nthe optical photoexcitation of a surface-passivated silicon wafer, we locally\ncontrol the free-electron density, and thereby pattern the wafer's emissivity\nin the THz part of the electromagnetic spectrum. We show how this\nunconventional source of controllable THz radiation enables a new form of\nincoherent computational THz imaging. We use it to image various concealed\nobjects, demonstrating this scheme has the penetrating capability of\nstate-of-the-art THz imaging approaches, without the requirement of\nfemto-second pulsed laser sources. Furthermore, the incoherent nature of\nthermal radiation also ensures the obtained images are free of interference\nartifacts. Our spatio-temporal emissivity control paves the way towards a new\nfamily of long-wavelength structured illumination, imaging and spectroscopy\nsystems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:29:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mrnka","Michal",""],["Penketh","Harry",""],["Hooper","Ian R.",""],["Saxena","Sonal",""],["Grant","Nicholas E.",""],["Murphy","John D.",""],["Phillips","David B.",""],["Hendry","Euan",""]]}
{"id":"2308.12048","submitter":"Lei Wang","authors":"Lei Wang, Zejian Yuan, Yao Lu, Badong Chen","title":"Head-Tail Cooperative Learning Network for Unbiased Scene Graph\n  Generation","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scene Graph Generation (SGG) as a critical task in image understanding,\nfacing the challenge of head-biased prediction caused by the long-tail\ndistribution of predicates. However, current unbiased SGG methods can easily\nprioritize improving the prediction of tail predicates while ignoring the\nsubstantial sacrifice in the prediction of head predicates, leading to a shift\nfrom head bias to tail bias. To address this issue, we propose a model-agnostic\nHead-Tail Collaborative Learning (HTCL) network that includes head-prefer and\ntail-prefer feature representation branches that collaborate to achieve\naccurate recognition of both head and tail predicates. We also propose a\nself-supervised learning approach to enhance the prediction ability of the\ntail-prefer feature representation branch by constraining tail-prefer predicate\nfeatures. Specifically, self-supervised learning converges head predicate\nfeatures to their class centers while dispersing tail predicate features as\nmuch as possible through contrast learning and head center loss. We demonstrate\nthe effectiveness of our HTCL by applying it to various SGG models on VG150,\nOpen Images V6 and GQA200 datasets. The results show that our method achieves\nhigher mean Recall with a minimal sacrifice in Recall and achieves a new\nstate-of-the-art overall performance. Our code is available at\nhttps://github.com/wanglei0618/HTCL.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:29:25 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Lei",""],["Yuan","Zejian",""],["Lu","Yao",""],["Chen","Badong",""]]}
{"id":"2308.12049","submitter":"Hejun Xiao","authors":"Hejun Xiao, Kunyu Peng, Xiangsheng Huang, Alina Roitberg1, Hao Li,\n  Zhaohui Wang and Rainer Stiefelhagen","title":"Towards Privacy-Supporting Fall Detection via Deep Unsupervised\n  RGB2Depth Adaptation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fall detection is a vital task in health monitoring, as it allows the system\nto trigger an alert and therefore enabling faster interventions when a person\nexperiences a fall. Although most previous approaches rely on standard RGB\nvideo data, such detailed appearance-aware monitoring poses significant privacy\nconcerns. Depth sensors, on the other hand, are better at preserving privacy as\nthey merely capture the distance of objects from the sensor or camera, omitting\ncolor and texture information. In this paper, we introduce a privacy-supporting\nsolution that makes the RGB-trained model applicable in depth domain and\nutilizes depth data at test time for fall detection. To achieve cross-modal\nfall detection, we present an unsupervised RGB to Depth (RGB2Depth) cross-modal\ndomain adaptation approach that leverages labelled RGB data and unlabelled\ndepth data during training. Our proposed pipeline incorporates an intermediate\ndomain module for feature bridging, modality adversarial loss for modality\ndiscrimination, classification loss for pseudo-labeled depth data and labeled\nsource data, triplet loss that considers both source and target domains, and a\nnovel adaptive loss weight adjustment method for improved coordination among\nvarious losses. Our approach achieves state-of-the-art results in the\nunsupervised RGB2Depth domain adaptation task for fall detection. Code is\navailable at https://github.com/1015206533/privacy_supporting_fall_detection.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:35:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xiao","Hejun",""],["Peng","Kunyu",""],["Huang","Xiangsheng",""],["Roitberg1","Alina",""],["Li","Hao",""],["Wang","Zhaohui",""],["Stiefelhagen","Rainer",""]]}
{"id":"2308.12050","submitter":"Jian Hu","authors":"Jian Hu, Li Tao, June Yang, Chandler Zhou","title":"Aligning Language Models with Offline Reinforcement Learning from Human\n  Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning from human preferences is crucial for language models (LMs) to\neffectively cater to human needs and societal values. Previous research has\nmade notable progress by leveraging human feedback to follow instructions.\nHowever, these approaches rely primarily on online reinforcement learning (RL)\ntechniques like Proximal Policy Optimization (PPO), which have been proven\nunstable and challenging to tune for language models. Moreover, PPO requires\ncomplex distributed system implementation, hindering the efficiency of\nlarge-scale distributed training. In this study, we propose an offline\nreinforcement learning from human feedback (RLHF) framework to align LMs using\npre-generated samples without interacting with RL environments. Specifically,\nwe explore maximum likelihood estimation (MLE) with filtering, reward-weighted\nregression (RWR), and Decision Transformer (DT) to align language models to\nhuman preferences. By employing a loss function similar to supervised\nfine-tuning, our methods ensure more stable model training than PPO with a\nsimple machine learning system~(MLSys) and much fewer (around 12.3\\%) computing\nresources. Experimental results demonstrate the DT alignment outperforms other\nOffline RLHF methods and is better than PPO.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:41:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hu","Jian",""],["Tao","Li",""],["Yang","June",""],["Zhou","Chandler",""]]}
{"id":"2308.12051","submitter":"Alejandro Bermudez","authors":"A. Bermudez, D. Gonz\\'alez-Cuadra, S. Hands","title":"A higher-order topological twist on cold-atom SO(5) Dirac fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.str-el hep-lat quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ultracold Fermi gases of spin-3/2 atoms provide a clean platform to realise\nSO(5) models of 4-Fermi interactions in the laboratory. By confining the atoms\nin a two-dimensional Raman lattice, we show how this system can be used as a\nflexible quantum simulator of Dirac quantum field theories (QFTs) that combine\nGross-Neveu and Thirring interactions with a higher-order topological twist. We\nshow that the lattice model corresponds to a regularization of this QFT with an\nanisotropic twisted Wilson mass. This allows us to access higher-order\ntopological states protected by a hidden SO(5) symmetry, a remnant of the\noriginal rotational symmetry of the 4-Fermi interactions that is not explicitly\nbroken by the lattice discretization. Using large-$N$ methods, we show that the\n4-Fermi interactions lead to a rich phase diagram with various competing\nfermion condensates. Our work opens a route for the implementation of\ncorrelated higher-order topological states with tunable interactions that has\ninteresting connections to non-trivial relativistic QFTs of Dirac fermions in\n$D = 2 + 1$ dimensions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:42:17 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 14:31:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bermudez","A.",""],["Gonz\u00e1lez-Cuadra","D.",""],["Hands","S.",""]]}
{"id":"2308.12052","submitter":"Mohammad R. Garousi","authors":"Mohammad R. Garousi","title":"Exploring Scheme Dependence in Boundary Terms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, it has been proposed that the least action principle is consistent\nwith the effective action of string theory at order $\\alpha'^m$ in the critical\ndimension, provided that the values of massless fields and their derivatives up\nto order $m$ on the boundary are known. These data should be preserved through\nhigher-derivative field redefinitions. Moreover, in the cosmological reduction\nof the effective action, it is expected that implementing the aforementioned\nrestricted field redefinitions will make the cosmological bulk action\nconsistent with the least action principle when only the massless fields on the\nboundary are known. Consequently, the cosmological bulk action must involve at\nmost the first time derivative. In the critical dimension, these conditions\nrequire bulk action couplings with a maximum of $(m+1)$ derivatives for $m>0$,\npotentially resulting in a zero boundary action.\n  However, if the circular reduction of bulk effective actions exhibits\n$O(1,1)$ symmetry up to certain residual total derivative terms in the base\nspace, nontrivial boundary couplings become necessary to maintain this\nsymmetry. Nevertheless, this paper introduces novel schemes where the bulk\neffective actions possess $O(1,1)$ symmetry without any residual total\nderivative terms, thereby eliminating the need for boundary actions through the\nutilization of T-duality. By applying these constraints, the paper provides a\ndetermination of the bulk action at $\\alpha'$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:43:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Garousi","Mohammad R.",""]]}
{"id":"2308.12053","submitter":"Leander Weber","authors":"Leander Weber, Jim Berend, Alexander Binder, Thomas Wiegand, Wojciech\n  Samek, Sebastian Lapuschkin","title":"Layer-wise Feedback Propagation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we present Layer-wise Feedback Propagation (LFP), a novel\ntraining approach for neural-network-like predictors that utilizes\nexplainability, specifically Layer-wise Relevance Propagation(LRP), to assign\nrewards to individual connections based on their respective contributions to\nsolving a given task. This differs from traditional gradient descent, which\nupdates parameters towards anestimated loss minimum. LFP distributes a reward\nsignal throughout the model without the need for gradient computations. It then\nstrengthens structures that receive positive feedback while reducingthe\ninfluence of structures that receive negative feedback. We establish the\nconvergence of LFP theoretically and empirically, and demonstrate its\neffectiveness in achieving comparable performance to gradient descent on\nvarious models and datasets. Notably, LFP overcomes certain limitations\nassociated with gradient-based methods, such as reliance on meaningful\nderivatives. We further investigate how the different LRP-rules can be extended\nto LFP, what their effects are on training, as well as potential applications,\nsuch as training models with no meaningful derivatives, e.g., step-function\nactivated Spiking Neural Networks (SNNs), or for transfer learning, to\nefficiently utilize existing knowledge.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:48:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Weber","Leander",""],["Berend","Jim",""],["Binder","Alexander",""],["Wiegand","Thomas",""],["Samek","Wojciech",""],["Lapuschkin","Sebastian",""]]}
{"id":"2308.12054","submitter":"Pascale Gourdeau","authors":"Pascale Gourdeau","title":"Sample Complexity of Robust Learning against Evasion Attacks","comments":"DPhil (PhD) Thesis - University of Oxford","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is becoming increasingly important to understand the vulnerability of\nmachine learning models to adversarial attacks. One of the fundamental problems\nin adversarial machine learning is to quantify how much training data is needed\nin the presence of evasion attacks, where data is corrupted at test time. In\nthis thesis, we work with the exact-in-the-ball notion of robustness and study\nthe feasibility of adversarially robust learning from the perspective of\nlearning theory, considering sample complexity.\n  We first explore the setting where the learner has access to random examples\nonly, and show that distributional assumptions are essential. We then focus on\nlearning problems with distributions on the input data that satisfy a Lipschitz\ncondition and show that robustly learning monotone conjunctions has sample\ncomplexity at least exponential in the adversary's budget (the maximum number\nof bits it can perturb on each input). However, if the adversary is restricted\nto perturbing $O(\\log n)$ bits, then one can robustly learn conjunctions and\ndecision lists w.r.t. log-Lipschitz distributions.\n  We then study learning models where the learner is given more power. We first\nconsider local membership queries, where the learner can query the label of\npoints near the training sample. We show that, under the uniform distribution,\nthe exponential dependence on the adversary's budget to robustly learn\nconjunctions remains inevitable. We then introduce a local equivalence query\noracle, which returns whether the hypothesis and target concept agree in a\ngiven region around a point in the training sample, and a counterexample if it\nexists. We show that if the query radius is equal to the adversary's budget, we\ncan develop robust empirical risk minimization algorithms in the\ndistribution-free setting. We give general query complexity upper and lower\nbounds, as well as for concrete concept classes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:51:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gourdeau","Pascale",""]]}
{"id":"2308.12055","submitter":"Haohao Sheng","authors":"Haohao Sheng, Yue Xie, Quansheng Wu, Hongming Weng, Xi Dai, B. Andrei\n  Bernevig, Zhong Fang, and Zhijun Wang","title":"Symmetry indicator-free unconventionality, obstructed edge states and\n  Majorana engineering in 1T-PtSe2 family","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unconventional materials with mismatch between electronic centers and atomic\npositions can be diagnosed by symmetry eigenvalues at several high-symmetry $k$\npoints. Their electronic states are decomposed into a sum of elementary band\nrepresentations (EBRs), but not a sum of atomic valence-electron band\nrepresentations (ABRs). In this work, we propose a new kind of symmetry\nindicator-free (SI-free) unconventional insulators, whose unconventionality has\nno symmetry eigenvalue indication. Instead, it is identified directly by the\ncomputed charge centers by using the one-dimensional (1D) Wilson loop method.\nWe demonstrate that 1T-PtSe$_2$ is an SI-free unconventional insulator, whose\nunconventional nature originates from orbital hybridization between Pt-$d$ and\nSe-$p_{x,y}$ states. The SI-free unconventionality widely exists in the members\nof PtSe$_2$ family ($MX_2$: $M=$ Ni,Pd,Pt; $X=$ S, Se,Te).The obstructed\nelectronic states are obtained on the edges, which exhibit large Rashba\nsplitting. By introducing superconducting proximity and external magnetic\nfield, we propose that the Majorana zero modes (MZM) can be generated on the\ncorners of 1T-PtSe$_2$ monolayer.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:55:18 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sheng","Haohao",""],["Xie","Yue",""],["Wu","Quansheng",""],["Weng","Hongming",""],["Dai","Xi",""],["Bernevig","B. Andrei",""],["Fang","Zhong",""],["Wang","Zhijun",""]]}
{"id":"2308.12056","submitter":"Sina Khoonbani","authors":"Sina Khoonbani and Hasan Ramezanian","title":"Unraveling the Neural Network: Identifying Temporal Labeling of Visual\n  Events through EEG-Based Functional Connectivity Analysis of Brain Regions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Understanding the complex interplay between the brain and a dynamic\nenvironment necessitates the continuous generation and updating of expectations\nfor forthcoming events and their corresponding sensory and motor responses.\nThis study investigates the interconnectivity patterns associated with time\nperception in predictable and unpredictable conditions. EEG signals were\nobtained from an existing database, encompassing an experiment conducted on\nhealthy participants subjected to two conditions: predictable and\nunpredictable, across various time delays. Functional connectivity between\nbrain regions was estimated using the phase lag index method, allowing for the\nidentification of differences in time perception between conditions.\nComparative analysis revealed significant variations, particularly in the\ngamma, beta, and theta frequency bands, with more pronounced differences\nobserved in the predictable condition. Subsequent exploration of the\ndissimilarities within each delay demonstrated significant differences across\nall delays. Notably, the unpredictable condition exhibited increased\nconnectivity within the alpha band during the 400-ms delay, specifically\nbetween occipital and temporal regions, with higher mean connectivity compared\nto the predictable condition. In the delta band, distinct connectivity patterns\nemerged, involving connections between central and frontal regions across\ndifferent delays. Notably, heightened connectivity between central and\nprefrontal regions was observed during the 83-ms delay. The right hemisphere of\nthe prefrontal cortex played a pivotal role in time perception. Furthermore, a\ndecline in connectivity across the delta, theta, and beta bands was observed\nduring the longest delay (800 ms) in both conditions, relative to other delays.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:55:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Khoonbani","Sina",""],["Ramezanian","Hasan",""]]}
{"id":"2308.12057","submitter":"Sebastian Herr","authors":"Timothy Candy and Sebastian Herr","title":"The massless and the non-relativistic limit for the cubic Dirac equation","comments":"48 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Massive and massless Dirac equations with Lorentz-covariant cubic\nnonlinearities are considered in spatial dimension $d=2,3$. Global\nwell-posedness of the Cauchy problem for small initial data in scale-invariant\nSobolev spaces and scattering of solutions is proved by a new approach which\nuses bilinear Fourier restriction estimates and atomic function spaces.\nFurthermore, global uniform convergence results, both in the massless and in\nthe non-relativistic limit, are proved at optimal regularity. In both regimes,\nthese are the first results which imply convergence of scattering states and\nwave operators.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:56:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Candy","Timothy",""],["Herr","Sebastian",""]]}
{"id":"2308.12058","submitter":"Nan Zhou","authors":"Nan Zhou, Jiaxin Chen, Di Huang","title":"DR-Tune: Improving Fine-tuning of Pretrained Visual Models by\n  Distribution Regularization with Semantic Calibration","comments":"Accepted by ICCV'2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The visual models pretrained on large-scale benchmarks encode general\nknowledge and prove effective in building more powerful representations for\ndownstream tasks. Most existing approaches follow the fine-tuning paradigm,\neither by initializing or regularizing the downstream model based on the\npretrained one. The former fails to retain the knowledge in the successive\nfine-tuning phase, thereby prone to be over-fitting, and the latter imposes\nstrong constraints to the weights or feature maps of the downstream model\nwithout considering semantic drift, often incurring insufficient optimization.\nTo deal with these issues, we propose a novel fine-tuning framework, namely\ndistribution regularization with semantic calibration (DR-Tune). It employs\ndistribution regularization by enforcing the downstream task head to decrease\nits classification error on the pretrained feature distribution, which prevents\nit from over-fitting while enabling sufficient training of downstream encoders.\nFurthermore, to alleviate the interference by semantic drift, we develop the\nsemantic calibration (SC) module to align the global shape and class centers of\nthe pretrained and downstream feature distributions. Extensive experiments on\nwidely used image classification datasets show that DR-Tune consistently\nimproves the performance when combing with various backbones under different\npretraining strategies. Code is available at:\nhttps://github.com/weeknan/DR-Tune.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:59:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhou","Nan",""],["Chen","Jiaxin",""],["Huang","Di",""]]}
{"id":"2308.12059","submitter":"Niklas Deckers","authors":"Niklas Deckers, Julia Peters, Martin Potthast","title":"Manipulating Embeddings of Stable Diffusion Prompts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative text-to-image models such as Stable Diffusion allow users to\ngenerate images based on a textual description, the prompt. Changing the prompt\nis still the primary means for the user to change a generated image as desired.\nHowever, changing the image by reformulating the prompt remains a difficult\nprocess of trial and error, which has led to the emergence of prompt\nengineering as a new field of research. We propose and analyze methods to\nchange the embedding of a prompt directly instead of the prompt text. It allows\nfor more fine-grained and targeted control that takes into account user\nintentions. Our approach treats the generative text-to-image model as a\ncontinuous function and passes gradients between the image space and the prompt\nembedding space. By addressing different user interaction problems, we can\napply this idea in three scenarios: (1) Optimization of a metric defined in\nimage space that could measure, for example, image style. (2) Assistance of\nusers in creative tasks by enabling them to navigate the image space along a\nselection of directions of \"near\" prompt embeddings. (3) Changing the embedding\nof the prompt to include information that the user has seen in a particular\nseed but finds difficult to describe in the prompt. Our experiments demonstrate\nthe feasibility of the described methods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:59:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Deckers","Niklas",""],["Peters","Julia",""],["Potthast","Martin",""]]}
{"id":"2308.12060","submitter":"Zhenyu Li","authors":"Zhenyu Li, Sunqi Fan, Yu Gu, Xiuxing Li, Zhichao Duan, Bowen Dong,\n  Ning Liu, Jianyong Wang","title":"FlexKBQA: A Flexible LLM-Powered Framework for Few-Shot Knowledge Base\n  Question Answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge base question answering (KBQA) is a critical yet challenging task\ndue to the vast number of entities within knowledge bases and the diversity of\nnatural language questions posed by users. Unfortunately, the performance of\nmost KBQA models tends to decline significantly in real-world scenarios where\nhigh-quality annotated data is insufficient. To mitigate the burden associated\nwith manual annotation, we introduce FlexKBQA by utilizing Large Language\nModels (LLMs) as program translators for addressing the challenges inherent in\nthe few-shot KBQA task. Specifically, FlexKBQA leverages automated algorithms\nto sample diverse programs, such as SPARQL queries, from the knowledge base,\nwhich are subsequently converted into natural language questions via LLMs. This\nsynthetic dataset facilitates training a specialized lightweight model for the\nKB. Additionally, to reduce the barriers of distribution shift between\nsynthetic data and real user questions, FlexKBQA introduces an executionguided\nself-training method to iterative leverage unlabeled user questions.\nFurthermore, we explore harnessing the inherent reasoning capability of LLMs to\nenhance the entire framework. Consequently, FlexKBQA delivers substantial\nflexibility, encompassing data annotation, deployment, and being domain\nagnostic. Through extensive experiments on GrailQA, WebQSP, and KQA Pro, we\nobserve that under the few-shot even the more challenging zero-shot scenarios,\nFlexKBQA achieves impressive results with a few annotations, surpassing all\nprevious baselines and even approaching the performance of supervised models,\nachieving a remarkable 93% performance relative to the fully-supervised models.\nWe posit that FlexKBQA represents a significant advancement towards exploring\nbetter integration of large and lightweight models. The code is open-sourced.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:00:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Zhenyu",""],["Fan","Sunqi",""],["Gu","Yu",""],["Li","Xiuxing",""],["Duan","Zhichao",""],["Dong","Bowen",""],["Liu","Ning",""],["Wang","Jianyong",""]]}
{"id":"2308.12061","submitter":"Amna Elmustafa","authors":"Jonathan Xu, Amna Elmustafa, Liya Weldegebriel, Emnet Negash, Richard\n  Lee, Chenlin Meng, Stefano Ermon, David Lobell","title":"HarvestNet: A Dataset for Detecting Smallholder Farming Activity Using\n  Harvest Piles and Remote Sensing","comments":"18 pages, 22 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Small farms contribute to a large share of the productive land in developing\ncountries. In regions such as sub-Saharan Africa, where 80% of farms are small\n(under 2 ha in size), the task of mapping smallholder cropland is an important\npart of tracking sustainability measures such as crop productivity. However,\nthe visually diverse and nuanced appearance of small farms has limited the\neffectiveness of traditional approaches to cropland mapping. Here we introduce\na new approach based on the detection of harvest piles characteristic of many\nsmallholder systems throughout the world. We present HarvestNet, a dataset for\nmapping the presence of farms in the Ethiopian regions of Tigray and Amhara\nduring 2020-2023, collected using expert knowledge and satellite images,\ntotaling 7k hand-labeled images and 2k ground collected labels. We also\nbenchmark a set of baselines including SOTA models in remote sensing with our\nbest models having around 80% classification performance on hand labelled data\nand 90%, 98% accuracy on ground truth data for Tigray, Amhara respectively. We\nalso perform a visual comparison with a widely used pre-existing coverage map\nand show that our model detects an extra 56,621 hectares of cropland in Tigray.\nWe conclude that remote sensing of harvest piles can contribute to more timely\nand accurate cropland assessments in food insecure region.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:03:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Jonathan",""],["Elmustafa","Amna",""],["Weldegebriel","Liya",""],["Negash","Emnet",""],["Lee","Richard",""],["Meng","Chenlin",""],["Ermon","Stefano",""],["Lobell","David",""]]}
{"id":"2308.12062","submitter":"Xianghong Niu","authors":"Dazhong Sun, Wentao Li, Anqi Shi, Wenxia Zhang, Huabing Shu, Fengfeng\n  Chi, Bing Wang, Xiuyun Zhang, and Xianghong Niu","title":"Rationally Correcting Impurity Levels Positions Based on Electrostatic\n  Potential Strategy for Photocatalytic Overall Water Splitting","comments":"15 pages, 7 figures, 1 table, 37 reference articles","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Doping to induce suitable impurity levels is an effective strategy to achieve\nhighly efficient photocatalytic overall water splitting (POWS). However, to\npredict the position of impurity levels, it is not enough to only depend on the\nprojected density of states of the substituted atom in the traditional method.\nHerein, taking in phosphorus-doped g-C3N5 as a sample, we find that the\nimpurity atom can change electrostatic potential gradient and polarity, then\nsignificantly affect the spatial electron density around the substituted atom,\nwhich further adjusts the impurity level position. Based on the redox potential\nrequirement of POWS, we not only obtain suitable impurity levels, but also\nexpand the visible light absorption range. Simultaneously, the strengthened\npolarity induced by doping further improve the redox ability of photogenerated\ncarriers. Moreover, the enhanced surface dipoles obviously promote the\nadsorption and subsequent splitting of water molecules. Our study provides a\nmore comprehensive view to realize accurate regulation of impurity levels in\ndoping engineering and gives reasonable strategies for designing an excellent\ncatalyst of POWS.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:05:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sun","Dazhong",""],["Li","Wentao",""],["Shi","Anqi",""],["Zhang","Wenxia",""],["Shu","Huabing",""],["Chi","Fengfeng",""],["Wang","Bing",""],["Zhang","Xiuyun",""],["Niu","Xianghong",""]]}
{"id":"2308.12063","submitter":"Guobin Shen","authors":"Guobin Shen, Dongcheng Zhao, Yiting Dong, Yang Li, Feifei Zhao and Yi\n  Zeng","title":"Metaplasticity: Unifying Learning and Homeostatic Plasticity in Spiking\n  Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The natural evolution of the human brain has given rise to multiple forms of\nsynaptic plasticity, allowing for dynamic changes to adapt to an ever-evolving\nworld. The evolutionary development of synaptic plasticity has spurred our\nexploration of biologically plausible optimization and learning algorithms for\nSpiking Neural Networks (SNNs). Present neural networks rely on the direct\ntraining of synaptic weights, which ultimately leads to fixed connections and\nhampers their ability to adapt to dynamic real-world environments. To address\nthis challenge, we introduce the application of metaplasticity -- a\nsophisticated mechanism involving the learning of plasticity rules rather than\ndirect modifications of synaptic weights. Metaplasticity dynamically combines\ndifferent plasticity rules, effectively enhancing working memory, multitask\ngeneralization, and adaptability while uncovering potential associations\nbetween various forms of plasticity and cognitive functions. By integrating\nmetaplasticity into SNNs, we demonstrate the enhanced adaptability and\ncognitive capabilities within artificial intelligence systems. This\ncomputational perspective unveils the learning mechanisms of the brain, marking\na significant step in the profound intersection of neuroscience and artificial\nintelligence.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:11:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shen","Guobin",""],["Zhao","Dongcheng",""],["Dong","Yiting",""],["Li","Yang",""],["Zhao","Feifei",""],["Zeng","Yi",""]]}
{"id":"2308.12064","submitter":"Han Yang","authors":"Han Yang, Tianyu Wang, Xiaowei Hu and Chi-Wing Fu","title":"SILT: Shadow-aware Iterative Label Tuning for Learning to Detect Shadows\n  from Noisy Labels","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing shadow detection datasets often contain missing or mislabeled\nshadows, which can hinder the performance of deep learning models trained\ndirectly on such data. To address this issue, we propose SILT, the Shadow-aware\nIterative Label Tuning framework, which explicitly considers noise in shadow\nlabels and trains the deep model in a self-training manner. Specifically, we\nincorporate strong data augmentations with shadow counterfeiting to help the\nnetwork better recognize non-shadow regions and alleviate overfitting. We also\ndevise a simple yet effective label tuning strategy with global-local fusion\nand shadow-aware filtering to encourage the network to make significant\nrefinements on the noisy labels. We evaluate the performance of SILT by\nrelabeling the test set of the SBU dataset and conducting various experiments.\nOur results show that even a simple U-Net trained with SILT can outperform all\nstate-of-the-art methods by a large margin. When trained on SBU / UCF / ISTD,\nour network can successfully reduce the Balanced Error Rate by 25.2% / 36.9% /\n21.3% over the best state-of-the-art method.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:16:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Han",""],["Wang","Tianyu",""],["Hu","Xiaowei",""],["Fu","Chi-Wing",""]]}
{"id":"2308.12065","submitter":"Tommaso Zoppi Dr","authors":"Tommaso Zoppi, Andrea Ceccarelli, Andrea Bondavalli","title":"Ensembling Uncertainty Measures to Improve Safety of Black-Box\n  Classifiers","comments":"To appear at ECAI23 in October23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning (ML) algorithms that perform classification may predict the\nwrong class, experiencing misclassifications. It is well-known that\nmisclassifications may have cascading effects on the encompassing system,\npossibly resulting in critical failures. This paper proposes SPROUT, a Safety\nwraPper thROugh ensembles of UncertainTy measures, which suspects\nmisclassifications by computing uncertainty measures on the inputs and outputs\nof a black-box classifier. If a misclassification is detected, SPROUT blocks\nthe propagation of the output of the classifier to the encompassing system. The\nresulting impact on safety is that SPROUT transforms erratic outputs\n(misclassifications) into data omission failures, which can be easily managed\nat the system level. SPROUT has a broad range of applications as it fits binary\nand multi-class classification, comprising image and tabular datasets. We\nexperimentally show that SPROUT always identifies a huge fraction of the\nmisclassifications of supervised classifiers, and it is able to detect all\nmisclassifications in specific cases. SPROUT implementation contains\npre-trained wrappers, it is publicly available and ready to be deployed with\nminimal effort.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:24:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zoppi","Tommaso",""],["Ceccarelli","Andrea",""],["Bondavalli","Andrea",""]]}
{"id":"2308.12066","submitter":"Minsoo Rhu","authors":"Ranggi Hwang, Jianyu Wei, Shijie Cao, Changho Hwang, Xiaohu Tang, Ting\n  Cao, Mao Yang, Minsoo Rhu","title":"Pre-gated MoE: An Algorithm-System Co-Design for Fast and Scalable\n  Mixture-of-Expert Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Large language models (LLMs) based on transformers have made significant\nstrides in recent years, the success of which is driven by scaling up their\nmodel size. Despite their high algorithmic performance, the computational and\nmemory requirements of LLMs present unprecedented challenges. To tackle the\nhigh compute requirements of LLMs, the Mixture-of-Experts (MoE) architecture\nwas introduced which is able to scale its model size without proportionally\nscaling up its computational requirements. Unfortunately, MoE's high memory\ndemands and dynamic activation of sparse experts restrict its applicability to\nreal-world problems. Previous solutions that offload MoE's memory-hungry expert\nparameters to CPU memory fall short because the latency to migrate activated\nexperts from CPU to GPU incurs high performance overhead. Our proposed\nPre-gated MoE system effectively tackles the compute and memory challenges of\nconventional MoE architectures using our algorithm-system co-design. Pre-gated\nMoE employs our novel pre-gating function which alleviates the dynamic nature\nof sparse expert activation, allowing our proposed system to address the large\nmemory footprint of MoEs while also achieving high performance. We demonstrate\nthat Pre-gated MoE is able to improve performance, reduce GPU memory\nconsumption, while also maintaining the same level of model quality. These\nfeatures allow our Pre-gated MoE system to cost-effectively deploy large-scale\nLLMs using just a single GPU with high performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:25:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hwang","Ranggi",""],["Wei","Jianyu",""],["Cao","Shijie",""],["Hwang","Changho",""],["Tang","Xiaohu",""],["Cao","Ting",""],["Yang","Mao",""],["Rhu","Minsoo",""]]}
{"id":"2308.12067","submitter":"Lai Wei","authors":"Lai Wei, Zihao Jiang, Weiran Huang, Lichao Sun","title":"InstructionGPT-4: A 200-Instruction Paradigm for Fine-Tuning MiniGPT-4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multimodal large language models acquire their instruction-following\ncapabilities through a two-stage training process: pre-training on image-text\npairs and fine-tuning on supervised vision-language instruction data. Recent\nstudies have shown that large language models can achieve satisfactory results\neven with a limited amount of high-quality instruction-following data. In this\npaper, we introduce InstructionGPT-4, which is fine-tuned on a small dataset\ncomprising only 200 examples, amounting to approximately 6% of the\ninstruction-following data used in the alignment dataset for MiniGPT-4. We\nfirst propose several metrics to access the quality of multimodal instruction\ndata. Based on these metrics, we present a simple and effective data selector\nto automatically identify and filter low-quality vision-language data. By\nemploying this method, InstructionGPT-4 outperforms the original MiniGPT-4 on\nvarious evaluations (e.g., visual question answering, GPT-4 preference).\nOverall, our findings demonstrate that less but high-quality instruction tuning\ndata is efficient to enable multimodal large language models to generate better\noutput.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:27:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wei","Lai",""],["Jiang","Zihao",""],["Huang","Weiran",""],["Sun","Lichao",""]]}
{"id":"2308.12068","submitter":"David Trabish","authors":"David Trabish, Noam Rinetzky, Sharon Shoham, Vaibhav Sharma","title":"State Merging with Quantifiers in Symbolic Execution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the problem of constraint encoding explosion which hinders the\napplicability of state merging in symbolic execution. Specifically, our goal is\nto reduce the number of disjunctions and if-then-else expressions introduced\nduring state merging. The main idea is to dynamically partition the symbolic\nstates into merging groups according to a similar uniform structure detected in\ntheir path constraints, which allows to efficiently encode the merged path\nconstraint and memory using quantifiers. To address the added complexity of\nsolving quantified constraints, we propose a specialized solving procedure that\nreduces the solving time in many cases. Our evaluation shows that our approach\ncan lead to significant performance gains.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:29:20 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 09:25:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Trabish","David",""],["Rinetzky","Noam",""],["Shoham","Sharon",""],["Sharma","Vaibhav",""]]}
{"id":"2308.12069","submitter":"Zengjie Zhang Dr.","authors":"Ni Dang, Tao Shi, Zengjie Zhang, Wanxin Jin, Marion Leibold, and\n  Martin Buss","title":"Identifying Reaction-Aware Driving Styles of Stochastic Model Predictive\n  Controlled Vehicles by Inverse Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The driving style of an Autonomous Vehicle (AV) refers to how it behaves and\ninteracts with other AVs. In a multi-vehicle autonomous driving system, an AV\ncapable of identifying the driving styles of its nearby AVs can reliably\nevaluate the risk of collisions and make more reasonable driving decisions.\nHowever, there has not been a consistent definition of driving styles for an AV\nin the literature, although it is considered that the driving style is encoded\nin the AV's trajectories and can be identified using Maximum Entropy Inverse\nReinforcement Learning (ME-IRL) methods as a cost function. Nevertheless, an\nimportant indicator of the driving style, i.e., how an AV reacts to its nearby\nAVs, is not fully incorporated in the feature design of previous ME-IRL\nmethods. In this paper, we describe the driving style as a cost function of a\nseries of weighted features. We design additional novel features to capture the\nAV's reaction-aware characteristics. Then, we identify the driving styles from\nthe demonstration trajectories generated by the Stochastic Model Predictive\nControl (SMPC) using a modified ME-IRL method with our newly proposed features.\nThe proposed method is validated using MATLAB simulation and an off-the-shelf\nexperiment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:31:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dang","Ni",""],["Shi","Tao",""],["Zhang","Zengjie",""],["Jin","Wanxin",""],["Leibold","Marion",""],["Buss","Martin",""]]}
{"id":"2308.12070","submitter":"Stefan Ivkovic","authors":"Stefan Ivkovic","title":"On New Approach to semi-Fredholm theory in unital C*-algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Axiomatic Fredholm theory in unital C*-algebras was established by Keckic and\nLazovic in [15]. Following the purely algebraic approach by Keckic and Lazovic,\nin [14] we extended further this theory to axiomatic semi-Fredholm and\nsemi-Weyl theory in unital C*-algebras. However, recently, in [11] we developed\nanother approach to axiomatic Fredholm theory in unital C*-algebras which is\nbased on the theory of Hilbert modules and which is equivalent to the algebraic\napproach by Keckic and Lazovic. In this paper, we extend further this new\nHilbert-module approach from Fredholm theory to semi-Fredholm and semi-Weyl\ntheory in unital C*-algebras. Hence, we provide a new proof of the results in\n[14].\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:36:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ivkovic","Stefan",""]]}
{"id":"2308.12071","submitter":"Kashyap Rajeevsarathy","authors":"Pankaj Kapari, Kashyap Rajeevsarathy, Apeksha Sanghi","title":"Generating the liftable mapping class groups of cyclic covers of spheres","comments":"1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For $g\\geq 2$, let $\\mathrm{Mod}(S_g)$ be the mapping class group of closed\norientable surface $S_g$ of genus $g$. In this paper, we derive a finite\ngenerating set for the liftable mapping class groups corresponding to\nfinite-sheeted regular branched cyclic covers of spheres. As an application, we\nprovide an algorithm to derive presentations of these liftable mapping class\ngroups, and the normalizers and centralizers of periodic mapping classes\ncorresponding to these covers. Furthermore, we determine the isomorphism\nclasses of the normalizers of irreducible periodic mapping classes in\n$\\mathrm{Mod}(S_g)$. Moreover, we derive presentations for the liftable mapping\nclass groups corresponding to covers induced by certain reducible periodic\nmapping classes. Consequently, we derive a presentation for the centralizer and\nnormalizer of a reducible periodic mapping class in $\\mathrm{Mod}(S_g)$ of the\nhighest order $2g+2$. As final applications of our results, we recover the\ngenerating sets of the liftable mapping class groups of the hyperelliptic cover\nobtained by Birman-Hilden and the balanced superelliptic cover obtained by\nGhaswala-Winarski.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:39:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kapari","Pankaj",""],["Rajeevsarathy","Kashyap",""],["Sanghi","Apeksha",""]]}
{"id":"2308.12072","submitter":"Richard Mitev","authors":"Philipp P\\\"utz, Richard Mitev, Markus Miettinen, Ahmad-Reza Sadeghi","title":"Unleashing IoT Security: Assessing the Effectiveness of Best Practices\n  in Protecting Against Threats","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Internet of Things (IoT) market is rapidly growing and is expected to\ndouble from 2020 to 2025. The increasing use of IoT devices, particularly in\nsmart homes, raises crucial concerns about user privacy and security as these\ndevices often handle sensitive and critical information. Inadequate security\ndesigns and implementations by IoT vendors can lead to significant\nvulnerabilities.\n  To address these IoT device vulnerabilities, institutions, and organizations\nhave published IoT security best practices (BPs) to guide manufacturers in\nensuring the security of their products. However, there is currently no\nstandardized approach for evaluating the effectiveness of individual BP\nrecommendations. This leads to manufacturers investing effort in implementing\nless effective BPs while potentially neglecting measures with greater impact.\n  In this paper, we propose a methodology for evaluating the security impact of\nIoT BPs and ranking them based on their effectiveness in protecting against\nsecurity threats. Our approach involves translating identified BPs into\nconcrete test cases that can be applied to real-world IoT devices to assess\ntheir effectiveness in mitigating vulnerabilities. We applied this methodology\nto evaluate the security impact of nine commodity IoT products, discovering 18\nvulnerabilities. By empirically assessing the actual impact of BPs on device\nsecurity, IoT designers and implementers can prioritize their security\ninvestments more effectively, improving security outcomes and optimizing\nlimited security budgets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:40:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["P\u00fctz","Philipp",""],["Mitev","Richard",""],["Miettinen","Markus",""],["Sadeghi","Ahmad-Reza",""]]}
{"id":"2308.12073","submitter":"Riku Funada","authors":"Riku Funada, Koju Nishimoto, Tatsuya Ibuki, Mitsuji Sampei","title":"Collision Avoidance for Ellipsoidal Rigid Bodies with Control Barrier\n  Functions Designed from Rotating Supporting Hyperplanes","comments":"15 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.RO cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a collision avoidance method for ellipsoidal rigid\nbodies, which utilizes a control barrier function (CBF) designed from a\nsupporting hyperplane. We formulate the problem in the Special Euclidean Group\nSE(2) and SE(3), where the dynamics are described as rigid body motion (RBM).\nThen, we consider the condition for separating two ellipsoidal rigid bodies by\nemploying a signed distance from a supporting hyperplane of a rigid body to the\nother rigid body. Although the positive value of this signed distance implies\nthat two rigid bodies are collision-free, a naively prepared supporting\nhyperplane yields a smaller value than the actual distance. To avoid such a\nconservative evaluation, the supporting hyperplane is rotated so that the\nsigned distance from the supporting hyperplane to the other rigid body is\nmaximized. We prove that the maximum value of this optimization problem is\nequal to the actual distance between two ellipsoidal rigid bodies, hence\neliminating excessive conservativeness. We leverage this signed distance as a\nCBF to prevent collision while the supporting hyperplane is rotated via a\ngradient-based input. The designed CBF is integrated into a quadratic\nprogramming (QP) problem, where each rigid body calculates its collision-free\ninput in a distributed manner, given communication among rigid bodies. The\nproposed method is demonstrated with simulations. Finally, we exemplify our\nmethod can be extended to a vehicle having nonholonomic dynamics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:44:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Funada","Riku",""],["Nishimoto","Koju",""],["Ibuki","Tatsuya",""],["Sampei","Mitsuji",""]]}
{"id":"2308.12074","submitter":"Verena Biener","authors":"Verena Biener, Forouzan Farzinnejad, Rinaldo Schuster, Seyedmasih\n  Tabaei, Leon Lindlein, Jinghui Hu, Negar Nouri, John J. Dudley, Per Ola\n  Kristensson, J\\\"org M\\\"uller, Jens Grubert","title":"Video Analysis of Behavioral Patterns During Prolonged Work in VR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  VR has recently been promoted as a tool for knowledge workers and studies\nhave shown that it has the potential to improve knowledge work. However,\nstudies on its prolonged use have been scarce. A prior study compared working\nin VR for one week to working in a physical environment, focusing on\nperformance measures and subjective feedback. However, a nuanced understanding\nand comparison of participants' behavior in VR and the physical environment is\nstill missing. To this end, we analyzed video material made available from this\npreviously conducted experiment, carried out over a working week, and present\nour findings on comparing the behavior of participants while working in VR and\nin a physical environment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:44:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Biener","Verena",""],["Farzinnejad","Forouzan",""],["Schuster","Rinaldo",""],["Tabaei","Seyedmasih",""],["Lindlein","Leon",""],["Hu","Jinghui",""],["Nouri","Negar",""],["Dudley","John J.",""],["Kristensson","Per Ola",""],["M\u00fcller","J\u00f6rg",""],["Grubert","Jens",""]]}
{"id":"2308.12075","submitter":"Luca Herranz-Celotti","authors":"Luca Herranz-Celotti, Jean Rouat","title":"Stabilizing RNN Gradients through Pre-training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerous theories of learning suggest to prevent the gradient variance from\nexponential growth with depth or time, to stabilize and improve training.\nTypically, these analyses are conducted on feed-forward fully-connected neural\nnetworks or single-layer recurrent neural networks, given their mathematical\ntractability. In contrast, this study demonstrates that pre-training the\nnetwork to local stability can be effective whenever the architectures are too\ncomplex for an analytical initialization. Furthermore, we extend known\nstability theories to encompass a broader family of deep recurrent networks,\nrequiring minimal assumptions on data and parameter distribution, a theory that\nwe refer to as the Local Stability Condition (LSC). Our investigation reveals\nthat the classical Glorot, He, and Orthogonal initialization schemes satisfy\nthe LSC when applied to feed-forward fully-connected neural networks. However,\nanalysing deep recurrent networks, we identify a new additive source of\nexponential explosion that emerges from counting gradient paths in a\nrectangular grid in depth and time. We propose a new approach to mitigate this\nissue, that consists on giving a weight of a half to the time and depth\ncontributions to the gradient, instead of the classical weight of one. Our\nempirical results confirm that pre-training both feed-forward and recurrent\nnetworks to fulfill the LSC often results in improved final performance across\nmodels. This study contributes to the field by providing a means to stabilize\nnetworks of any complexity. Our approach can be implemented as an additional\nstep before pre-training on large augmented datasets, and as an alternative to\nfinding stable initializations analytically.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:48:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Herranz-Celotti","Luca",""],["Rouat","Jean",""]]}
{"id":"2308.12076","submitter":"Jakob Kj{\\ae}rulff Svaneborg","authors":"Jakob Kj{\\ae}rulff Svaneborg, Aleksander Bach Lorentzen, Fei Gao,\n  Antti-Pekka Jauho, Mads Brandbyge","title":"Manipulation of magnetization and spin transport in hydrogenated\n  graphene with THz pulses","comments":"The Supplementary Material for this article can be found online at:\n  https://www.frontiersin.org/articles/10.3389/fphy.2023.1237383/\n  full#supplementary-material","journal-ref":null,"doi":"10.3389/fphy.2023.1237383","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Terahertz (THz) field pulses can now be applied in Scanning Tunnelling\nMicroscopy (THz-STM) junction experiments to study time resolved dynamics. The\nrelatively slow pulse compared to the typical electronic time-scale calls for\napproximations based on a time-scale separation. Here, we contrast three\nmethods based on non-equilibrium Green's functions (NEGF): (i) the\nsteady-state, adiabatic results, (ii) the lowest order dynamic expansion in the\ntime-variation (DE), and (iii) the auxiliary mode (AM) propagation method\nwithout approximations in the time-variation. We consider a concrete THz-STM\njunction setup involving a hydrogen adsorbate on graphene where the localized\nspin polarization can be manipulated on/off by a local field from the tip\nelectrode and/or a back-gate affecting the in-plane transport. We use\nsteady-state NEGF combined with Density Functional Theory (DFT-NEGF) to obtain\na Hubbard model for the study of the junction dynamics. Solving the Hubbard\nmodel in a mean-field approximation, we find that the near-adiabatic first\norder dynamical expansion provides a good description for STM voltage pulses up\nto the 1 V range.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:52:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Svaneborg","Jakob Kj\u00e6rulff",""],["Lorentzen","Aleksander Bach",""],["Gao","Fei",""],["Jauho","Antti-Pekka",""],["Brandbyge","Mads",""]]}
{"id":"2308.12077","submitter":"Bastiaan Tamm","authors":"Bastiaan Tamm, Rik Vandenberghe, Hugo Van hamme","title":"Analysis of XLS-R for Speech Quality Assessment","comments":"5 pages, submitted to WASPAA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In online conferencing applications, estimating the perceived quality of an\naudio signal is crucial to ensure high quality of experience for the end user.\nThe most reliable way to assess the quality of a speech signal is through human\njudgments in the form of the mean opinion score (MOS) metric. However, such an\napproach is labor intensive and not feasible for large-scale applications. The\nfocus has therefore shifted towards automated speech quality assessment through\nend-to-end training of deep neural networks. Recently, it was shown that\nleveraging pre-trained wav2vec-based XLS-R embeddings leads to state-of-the-art\nperformance for the task of speech quality prediction. In this paper, we\nperform an in-depth analysis of the pre-trained model. First, we analyze the\nperformance of embeddings extracted from each layer of XLS-R and also for each\nsize of the model (300M, 1B, 2B parameters). Surprisingly, we find two optimal\nregions for feature extraction: one in the lower-level features and one in the\nhigh-level features. Next, we investigate the reason for the two distinct\noptima. We hypothesize that the lower-level features capture characteristics of\nnoise and room acoustics, whereas the high-level features focus on speech\ncontent and intelligibility. To investigate this, we analyze the sensitivity of\nthe MOS predictions with respect to different levels of corruption in each\ncategory. Afterwards, we try fusing the two optimal feature depths to determine\nif they contain complementary information for MOS prediction. Finally, we\ncompare the performance of the proposed models and assess the generalizability\nof the models on unseen datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:52:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tamm","Bastiaan",""],["Vandenberghe","Rik",""],["Van hamme","Hugo",""]]}
{"id":"2308.12078","submitter":"Carlos Varea","authors":"Elizabeth Gasparim, Lino Grama and Carlos Varea","title":"The $H$-flux on flag manifolds generated by infinitesimal $T$-duality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define a new correspondence for pairs $(\\mathbb{F},H)$ formed by a flag\nmanifold $\\mathbb{F}$ together with an $H$-flux on $\\mathbb{F}$. Given its role\nwithin our correspondence, infinitesimal $T$-duality may be viewed as a source\nof $H$-flux, in the sense that it contributes towards taking fluxless pairs\n$(\\mathbb{F},0)$ to pairs $(\\mathbb{F}^\\vee, H^\\vee)$ carrying nontrivial flux\n$H^\\vee\\neq 0$. We also illustrate how our correspondence exchanges complex\nstructures with symplectic ones up to $B$-transformations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:57:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gasparim","Elizabeth",""],["Grama","Lino",""],["Varea","Carlos",""]]}
{"id":"2308.12079","submitter":"Brittany Reid","authors":"Brittany Reid, Christoph Treude, Markus Wagner","title":"Using the TypeScript compiler to fix erroneous Node.js snippets","comments":"Accepted in the 23rd IEEE International Working Conference on Source\n  Code Analysis and Manipulation (SCAM) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most online code snippets do not run. This means that developers looking to\nreuse code from online sources must manually find and fix errors. We present an\napproach for automatically evaluating and correcting errors in Node.js code\nsnippets: Node Code Correction (NCC). NCC leverages the ability of the\nTypeScript compiler to generate errors and inform code corrections through the\ncombination of TypeScript's built-in codefixes, our own targeted fixes, and\ndeletion of erroneous lines. Compared to existing approaches using linters, our\nfindings suggest that NCC is capable of detecting a larger number of errors per\nsnippet and more error types, and it is more efficient at fixing snippets. We\nfind that 73.7% of the code snippets in NPM documentation have errors; with the\nuse of NCC's corrections, this number was reduced to 25.1%. Our evaluation\nconfirms that the use of the TypeScript compiler to inform code corrections is\na promising strategy to aid in the reuse of code snippets from online sources.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:58:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Reid","Brittany",""],["Treude","Christoph",""],["Wagner","Markus",""]]}
{"id":"2308.12080","submitter":"Albert Cabot","authors":"Albert Cabot, Gianluca Giorgi, Roberta Zambrini","title":"Nonequilibrium transition between a continuous and a discrete\n  time-crystal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show a dissipative phase transition in a driven nonlinear quantum\noscillator in which a discrete time-translation symmetry is broken either\ncontinuously or discretely. The corresponding regimes display either continuous\nor discrete time crystals, which we analyze numerically and analytically beyond\nthe classical limit addressing observable dynamics, Liouvillian spectral\nfeatures, and quantum fluctuations. Via an effective semiclassical description,\nwe show that phase diffusion dominates when the symmetry is broken\ncontinuously, which manifests as a band of eigenmodes with a lifetime growing\nlinearly with the mean-field excitation number. Instead, in the discrete\nsymmetry broken phase, the leading fluctuation process corresponds to quantum\nactivation with a single mode that has an exponentially growing lifetime.\nInterestingly, the transition between these two regimes manifests itself\nalready in the quantum regime as a spectral singularity, namely as an\nexceptional point mediating between phase diffusion and quantum activation.\nFinally, we discuss this transition between different time-crystal orders in\nthe context of synchronization phenomena.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:59:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cabot","Albert",""],["Giorgi","Gianluca",""],["Zambrini","Roberta",""]]}
{"id":"2308.12081","submitter":"Yurii Kosovtsov","authors":"Yu.N. Kosovtsov","title":"Exact linear representations of the nonlinear Cauchy problems and their\n  smooth solutions","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The paper establishes conditions under which there are exact linear\nrepresentations of nonlinear partial differential equations (Cauchy problems).\nBy introducing a certain linear operator $A$, it is shown that under these\nconditions there are three equivalent equations (one linear and two nonlinear),\nwhile the formal operator solution is common for all of them and is the\nexpansion of the desired function $v(t,x)$ into a formal Taylor series.\n  Using the Borel-Whitney lemma, which states that any smooth function $v(t,x)$\nin a neighborhood of a point is defined by its formal Taylor series, we obtain\nthe following statement. If all parameters of the operator $A$ are smooth\nfunctions, then there exists a smooth function $\\tilde{v}(t,x)$, which for\n$t=0$ has the same power expansion as $v(t,x) $ and this function solves all\nequivalent equations.\n  The Navier-Stokes and Euler equations are considered as a non-trivial\nexamples of this approach.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:00:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kosovtsov","Yu. N.",""]]}
{"id":"2308.12082","submitter":"Andrei Cramariuc","authors":"Cornelius von Einem, Andrei Cramariuc, Roland Siegwart, Cesar Cadena,\n  Florian Tschopp","title":"Path-Constrained State Estimation for Rail Vehicles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Globally rising demand for transportation by rail is pushing existing\ninfrastructure to its capacity limits, necessitating the development of\naccurate, robust, and high-frequency positioning systems to ensure safe and\nefficient train operation. As individual sensor modalities cannot satisfy the\nstrict requirements of robustness and safety, a combination thereof is\nrequired. We propose a path-constrained sensor fusion framework to integrate\nvarious modalities while leveraging the unique characteristics of the railway\nnetwork. To reflect the constrained motion of rail vehicles along their tracks,\nthe state is modeled in 1D along the track geometry. We further leverage the\nlimited action space of a train by employing a novel multi-hypothesis tracking\nto account for multiple possible trajectories a vehicle can take through the\nrailway network. We demonstrate the reliability and accuracy of our fusion\nframework on multiple tram datasets recorded in the city of Zurich, utilizing\nVisual-Inertial Odometry for local motion estimation and a standard GNSS for\nglobal localization. We evaluate our results using ground truth localizations\nrecorded with a RTK-GNSS, and compare our method to standard baselines. A Root\nMean Square Error of 4.78 m and a track selectivity score of up to 94.9 % have\nbeen achieved.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:01:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["von Einem","Cornelius",""],["Cramariuc","Andrei",""],["Siegwart","Roland",""],["Cadena","Cesar",""],["Tschopp","Florian",""]]}
{"id":"2308.12083","submitter":"Giacomo Medda","authors":"Ludovico Boratto, Francesco Fabbri, Gianni Fenu, Mirko Marras, Giacomo\n  Medda","title":"Counterfactual Graph Augmentation for Consumer Unfairness Mitigation in\n  Recommender Systems","comments":"Accepted as a short paper at CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recommendation literature, explainability and fairness are becoming two\nprominent perspectives to consider. However, prior works have mostly addressed\nthem separately, for instance by explaining to consumers why a certain item was\nrecommended or mitigating disparate impacts in recommendation utility. None of\nthem has leveraged explainability techniques to inform unfairness mitigation.\nIn this paper, we propose an approach that relies on counterfactual\nexplanations to augment the set of user-item interactions, such that using them\nwhile inferring recommendations leads to fairer outcomes. Modeling user-item\ninteractions as a bipartite graph, our approach augments the latter by\nidentifying new user-item edges that not only can explain the original\nunfairness by design, but can also mitigate it. Experiments on two public data\nsets show that our approach effectively leads to a better trade-off between\nfairness and recommendation utility compared with state-of-the-art mitigation\nprocedures. We further analyze the characteristics of added edges to highlight\nkey unfairness patterns. Source code available at\nhttps://github.com/jackmedda/RS-BGExplainer/tree/cikm2023.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:05:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Boratto","Ludovico",""],["Fabbri","Francesco",""],["Fenu","Gianni",""],["Marras","Mirko",""],["Medda","Giacomo",""]]}
{"id":"2308.12084","submitter":"Qi Wang","authors":"Qi Wang, Lucas Mahler, Julius Steiglechner, Florian Birk, Klaus\n  Scheffler, Gabriele Lohmann","title":"DISGAN: Wavelet-informed Discriminator Guides GAN to MRI\n  Super-resolution with Noise Cleaning","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  MRI super-resolution (SR) and denoising tasks are fundamental challenges in\nthe field of deep learning, which have traditionally been treated as distinct\ntasks with separate paired training data. In this paper, we propose an\ninnovative method that addresses both tasks simultaneously using a single deep\nlearning model, eliminating the need for explicitly paired noisy and clean\nimages during training. Our proposed model is primarily trained for SR, but\nalso exhibits remarkable noise-cleaning capabilities in the super-resolved\nimages. Instead of conventional approaches that introduce frequency-related\noperations into the generative process, our novel approach involves the use of\na GAN model guided by a frequency-informed discriminator. To achieve this, we\nharness the power of the 3D Discrete Wavelet Transform (DWT) operation as a\nfrequency constraint within the GAN framework for the SR task on magnetic\nresonance imaging (MRI) data. Specifically, our contributions include: 1) a 3D\ngenerator based on residual-in-residual connected blocks; 2) the integration of\nthe 3D DWT with $1\\times 1$ convolution into a DWT+conv unit within a 3D Unet\nfor the discriminator; 3) the use of the trained model for high-quality image\nSR, accompanied by an intrinsic denoising process. We dub the model \"Denoising\nInduced Super-resolution GAN (DISGAN)\" due to its dual effects of SR image\ngeneration and simultaneous denoising. Departing from the traditional approach\nof training SR and denoising tasks as separate models, our proposed DISGAN is\ntrained only on the SR task, but also achieves exceptional performance in\ndenoising. The model is trained on 3D MRI data from dozens of subjects from the\nHuman Connectome Project (HCP) and further evaluated on previously unseen MRI\ndata from subjects with brain tumours and epilepsy to assess its denoising and\nSR performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:07:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Qi",""],["Mahler","Lucas",""],["Steiglechner","Julius",""],["Birk","Florian",""],["Scheffler","Klaus",""],["Lohmann","Gabriele",""]]}
{"id":"2308.12085","submitter":"Bence Borda","authors":"Bence Borda, Lorenz Fr\\\"uhwirth and Manuel Hauke","title":"Limit laws for cotangent and Diophantine sums","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.DS math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Limit laws for ergodic averages with a power singularity over circle\nrotations were first proved by Sinai and Ulcigrai, as well as Dolgopyat and\nFayad. In this paper, we prove limit laws with an estimate for the rate of\nconvergence for the sum $\\sum_{n=1}^N f(n \\alpha)/n^p$ in terms of a\n$1$-periodic function $f$ with a power singularity of order $p \\ge 1$ at\nintegers. Our results apply in particular to cotangent sums related to Dedekind\nsums, and to sums of reciprocals of fractional parts, which appear in\nmultiplicative Diophantine approximation. The main tools are Schmidt's method\nin metric Diophantine approximation, the Gauss-Kuzmin problem and the theory of\n$\\psi$-mixing random variables.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:10:47 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Borda","Bence",""],["Fr\u00fchwirth","Lorenz",""],["Hauke","Manuel",""]]}
{"id":"2308.12086","submitter":"Maria Rigaki","authors":"Maria Rigaki, Ond\\v{r}ej Luk\\'a\\v{s}, Carlos A. Catania, Sebastian\n  Garcia","title":"Out of the Cage: How Stochastic Parrots Win in Cyber Security\n  Environments","comments":"Under review. 10 pages plus appendices, 7 figures, 4 tables. Edit:\n  fix e-mails and code repository","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Large Language Models (LLMs) have gained widespread popularity across diverse\ndomains involving text generation, summarization, and various natural language\nprocessing tasks. Despite their inherent limitations, LLM-based designs have\nshown promising capabilities in planning and navigating open-world scenarios.\nThis paper introduces a novel application of pre-trained LLMs as agents within\ncybersecurity network environments, focusing on their utility for sequential\ndecision-making processes.\n  We present an approach wherein pre-trained LLMs are leveraged as attacking\nagents in two reinforcement learning environments. Our proposed agents\ndemonstrate similar or better performance against state-of-the-art agents\ntrained for thousands of episodes in most scenarios and configurations. In\naddition, the best LLM agents perform similarly to human testers of the\nenvironment without any additional training process. This design highlights the\npotential of LLMs to efficiently address complex decision-making tasks within\ncybersecurity.\n  Furthermore, we introduce a new network security environment named\nNetSecGame. The environment is designed to eventually support complex\nmulti-agent scenarios within the network security domain. The proposed\nenvironment mimics real network attacks and is designed to be highly modular\nand adaptable for various scenarios.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:11:27 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 09:42:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rigaki","Maria",""],["Luk\u00e1\u0161","Ond\u0159ej",""],["Catania","Carlos A.",""],["Garcia","Sebastian",""]]}
{"id":"2308.12087","submitter":"Ji\\v{r}\\'i Klime\\v{s}","authors":"Sirous Yourdkhani and Jiri Klimes","title":"Using Non-covalent Interactions to Test Precision of Projector-Augmented\n  Wave Data Sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The projector-augmented wave (PAW) method is one of the approaches that are\nwidely used to approximately treat core electrons and thus to speed-up\nplane-wave basis set electronic structure calculations. However, PAW involves\napproximations and it is thus important to understand how they affect the\nresults. Tests of precision of PAW data sets often use properties of isolated\natoms or of atomic solids. While this is sufficient to identify problematic PAW\ndata sets, little information has been gained to understand the origins of the\nerrors and suggest ways to correct them. Here we show that interaction energies\nof molecular dimers are very useful not only to identify problematic PAW data\nsets but also to uncover the origin of the errors. Using dimers from the S22\nand S66 test sets and other dimers we find that the error in the interaction\nenergy is composed of a short range component with an exponential decay and a\nlong range electrostatic part caused by error in the total charge density. We\npropose and evaluate a simple improvable scheme to correct the long range error\nand find that even in its simple and readily usable form, it is able to reduce\nthe interaction energy errors to less than one half on average for hydrogen\nbonded dimers.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:14:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yourdkhani","Sirous",""],["Klimes","Jiri",""]]}
{"id":"2308.12088","submitter":"Junyi Shen","authors":"Junyi Shen, Tetsuro Miyazaki, Shingo Ohno, Maina Sogabe, and Kenji\n  Kawashima","title":"Trajectory Tracking Control of Dual-PAM Soft Actuator with Hysteresis\n  Compensator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Soft robotics is an emergent and swiftly evolving field. Pneumatic actuators\nare suitable for driving soft robots because of their superior performance.\nHowever, their control is not easy due to their hysteresis characteristics. In\nresponse to these challenges, we propose an adaptive control method to\ncompensate hysteresis of a soft actuator. Employing a novel dual pneumatic\nartificial muscle (PAM) bending actuator, the innovative control strategy\nabates hysteresis effects by dynamically modulating gains within a traditional\nPID controller corresponding with the predicted motion of the reference\ntrajectory. Through comparative experimental evaluation, we found that the new\ncontrol method outperforms its conventional counterparts regarding tracking\naccuracy and response speed. Our work reveals a new direction for advancing\ncontrol in soft actuators.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:20:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shen","Junyi",""],["Miyazaki","Tetsuro",""],["Ohno","Shingo",""],["Sogabe","Maina",""],["Kawashima","Kenji",""]]}
{"id":"2308.12089","submitter":"Shahram Jalalzadeh","authors":"S. Jalalzadeh, H. Moradpour, and P.V. Moniz","title":"Modified cosmology from quantum deformed entropy","comments":"16 pages, 8 figures, to appear in Physics of the Dark Universe","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In Ref. [S. Jalalzadeh, Phys. Lett. B 829 (2022) 137058], Jalalzadeh\nestablished that the thermodynamical entropy of a quantum-deformed black hole\nwith horizon area $A$ can be written as $S_q=\\pi\\sin\\left(\\frac{A}{8G\\mathcal\nN} \\right)/\\sin\\left(\\frac{\\pi}{2\\mathcal N} \\right)$, where $\\mathcal\nN=L_q^2/L_\\text{P}^2$, $L_\\text{P}$ being the Planck length and $L_q$ denoting,\ngenerically, the q-deformed cosmic event horizon distance $L_q$. Motivated by\nthis, we now extend the framework constructed in [S. Jalalzadeh, Phys. Lett. B\n829 (2022) 137058] towards the Friedmann and Raychaudhuri equations describing\nspatially homogeneous and isotropic universe dynamics. Our procedure in this\npaper involves a twofold assumption. On the one hand, we take the entropy\nassociated with the apparent horizon of the Robertson-Walker universe in the\nform of the aforementioned expression. On the other hand, we assume that the\nunified first law of thermodynamics, $dE=TdS+WdV$, holds on the apparent\nhorizon. Subsequently, we find a novel modified cosmological scenario\ncharacterized by quantum-deformed (q-deformed) Friedmann and Raychaudhuri\nequations containing additional components that generate an effective dark\nenergy sector. Our results indicate an effective dark energy component, which\ncan explain the Universe's late-time acceleration. Moreover, the Universe\nfollows the standard thermal history, with a transition redshift from\ndeceleration to acceleration at $z_\\text{tran}=0.5$. More precisely, according\nto our model, at a redshift of $z = 0.377$, the effective dark energy dominates\nwith a de Sitter universe in the long run. We include the evolution of\nluminosity distance, $\\mu$, the Hubble parameter, $H(z)$, and the deceleration\nparameter, $q(z)$, versus redshift. Finally, we have conducted a comparative\nanalysis of our proposed model with others involving non-extensive entropies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:20:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jalalzadeh","S.",""],["Moradpour","H.",""],["Moniz","P. V.",""]]}
{"id":"2308.12090","submitter":"Ilya Charaev","authors":"M. Sidorova, A.D. Semenov, I. Charaev, M. Gonzalez, A. Schilling, S.\n  Gyger, and S. Steinhauer","title":"Phonon heat capacity and disorder: new opportunities for performance\n  enhancement of superconducting devices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We experimentally study for the first time the self-heating normal domain in\nmagnetic field using nanowires made of granular NbTiN films with sub-10~nm\nthicknesses. Specifically, we found that at temperatures below 10 K, the heat\ncapacity of phonons in such films is reduced with respect to predictions of the\nDebye model. Moreover, as the temperature decreases, the phonon heat capacity\nreduces quicker than the Debye prediction. These effects strengthen when the\nfilm thickness decreases. We attribute the observed reduction in the heat\ncapacity to the size effect, which arises from the confinement of phonon modes\nwithin the grains; a phenomenon that has been predicted but not yet observed.\nThese findings hold great importance in understanding the role of heat\ntransport in superconducting electronic devices and have the potential for\npractical applications in mid-infrared photon sensing with superconducting\nnanowire detectors.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:23:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sidorova","M.",""],["Semenov","A. D.",""],["Charaev","I.",""],["Gonzalez","M.",""],["Schilling","A.",""],["Gyger","S.",""],["Steinhauer","S.",""]]}
{"id":"2308.12091","submitter":"Elias R. Koch","authors":"Mina St\\\"ohr, Elias R. Koch, Julien Javaloyes, Svetlana V. Gurevich,\n  Matthias Wolfrum","title":"Square Waves and Bykov T-points in a Delay Algebraic Model for the\n  Kerr-Gires-Tournois Interferometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study theoretically the mechanisms of square wave formation of a\nvertically emitting micro-cavity operated in the Gires-Tournois regime that\ncontains a Kerr medium and that is subjected to strong time-delayed optical\nfeedback and detuned optical injection. We show that in the limit of large\ndelay, square wave solutions of the time-delayed system can be treated as\nrelative homoclinic solutions of an equation with an advanced argument. Based\non this, we use concepts of classical homoclinic bifurcation theory to study\ndifferent types of square wave solutions. In particular, we unveil the\nmechanisms behind the collapsed snaking scenario of square waves and explain\nthe formation of complex-shaped multistable square wave solutions through a\nBykov T-point. Finally we relate the position of the T-point to the position of\nthe Maxwell point in the original time-delayed system.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:26:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["St\u00f6hr","Mina",""],["Koch","Elias R.",""],["Javaloyes","Julien",""],["Gurevich","Svetlana V.",""],["Wolfrum","Matthias",""]]}
{"id":"2308.12092","submitter":"Nicholas Storm","authors":"Nicholas Storm, Maria Bergemann","title":"Observational constraints on the origin of the elements. VII. NLTE\n  analysis of Y II lines in spectra of cool stars and implications for Y as a\n  Galactic chemical clock","comments":"12 pages, 10 figures, accepted by MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Yttrium (Y), a key s-process element, is commonly used in nucleosynthesis\nstudies and as a Galactic chemical clock when combined with magnesium (Mg). We\nstudy the applicability of the previously assumed LTE line formation assumption\nin Y abundance studies of main-sequence and red giant stars, and probe the\nimpact of NLTE effects on the [Y/Mg] ratio, a proposed stellar age indicator.\nWe derive stellar parameters, ages, and NLTE abundances of Fe, Mg, and Y for 48\nsolar analogue stars from high-resolution spectra acquired within the Gaia-ESO\nsurvey. For Y, we present a new NLTE atomic model. We determine a solar NLTE\nabundance of A(Y)$_{\\rm NLTE}=2.12\\pm0.04$ dex, $0.04$ dex higher than LTE.\nNLTE effects on Y abundance are modest for optical Y II lines, which are\nfrequently used in Sun-like stars diagnostics. NLTE has a small impact on the\n[Y/Mg] ratio in such stars. For metal-poor red giants, NLTE effects on Y II\nlines are substantial, potentially exceeding $+0.5$ dex. For the\nGaia/4MOST/WEAVE benchmark star, HD 122563, we find the NLTE abundance ratio of\n[Y/Fe]$_{\\rm NLTE}=-0.55\\pm0.04$ dex with consistent abundances obtained from\ndifferent Y II lines. NLTE has a differential effect on Y abundance diagnostics\nin late-type stars. They notably affect Y II lines in red giants and very\nmetal-poor stars, which are typical Galactic enrichment tracers of\nneutron-capture elements. For main-sequence stars, NLTE effects on optical\ndiagnostic Y II lines remain minimal across metallicities. This affirms the\n[Y/Mg] ratio's reliability as a cosmochronometer for Sun-like stars.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:27:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Storm","Nicholas",""],["Bergemann","Maria",""]]}
{"id":"2308.12093","submitter":"Andrei Ivanov","authors":"Julia Bazinska, Andrei Ivanov, Tal Ben-Nun, Nikoli Dryden, Maciej\n  Besta, Siyuan Shen and Torsten Hoefler","title":"Cached Operator Reordering: A Unified View for Fast GNN Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.PF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Neural Networks (GNNs) are a powerful tool for handling structured\ngraph data and addressing tasks such as node classification, graph\nclassification, and clustering. However, the sparse nature of GNN computation\nposes new challenges for performance optimization compared to traditional deep\nneural networks. We address these challenges by providing a unified view of GNN\ncomputation, I/O, and memory. By analyzing the computational graphs of the\nGraph Convolutional Network (GCN) and Graph Attention (GAT) layers -- two\nwidely used GNN layers -- we propose alternative computation strategies. We\npresent adaptive operator reordering with caching, which achieves a speedup of\nup to 2.43x for GCN compared to the current state-of-the-art. Furthermore, an\nexploration of different caching schemes for GAT yields a speedup of up to\n1.94x. The proposed optimizations save memory, are easily implemented across\nvarious hardware platforms, and have the potential to alleviate performance\nbottlenecks in training large-scale GNN models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:27:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bazinska","Julia",""],["Ivanov","Andrei",""],["Ben-Nun","Tal",""],["Dryden","Nikoli",""],["Besta","Maciej",""],["Shen","Siyuan",""],["Hoefler","Torsten",""]]}
{"id":"2308.12094","submitter":"Gokhan Soydan","authors":"Maohua Le and G\\\"okhan Soydan","title":"On the Ternary Purely Exponential Diophantine Equation\n  $(ak)^x+(bk)^y=((a+b)k)^z$ with Prime Powers $a$ and $b$","comments":"18 pages","journal-ref":"published in Journal of Integer Sequences, 2023","doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Let $k$ be a positive integer, and let $a,b$ be coprime positive integers\nwith $\\min\\{a,b\\}>1$. In this paper, using a combination of some elementary\nnumber theory techniques with classical results on the Nagell-Ljunggren\nequation, the Catalan equation and some new properties of the Lucas sequence\n(\\seqnum{A000204} in OEIS), we prove that if $k>1$ and $a,b$ are both prime\npowers with $\\min\\{a,b\\}>2$, then the equation $(ak)^x+(bk)^y=((a+b)k)^z$ has\nonly one positive integer solution $(x,y,z)=(1,1,1)$. The above result\npartially proves that Conjecture 1 presented in (Acta Arith. 2018, 184 (1):\n37-49) is true.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:28:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Le","Maohua",""],["Soydan","G\u00f6khan",""]]}
{"id":"2308.12095","submitter":"Anamaria Irmgard Mojica Hanke","authors":"Laura Cabra-Acela and Anamaria Mojica-Hanke and Mario\n  Linares-V\\'asquez and Steffen Herbold","title":"On Using Information Retrieval to Recommend Machine Learning Good\n  Practices for Software Engineers","comments":"Accepted for Publication at ESEC/FSE demonstrations track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning (ML) is nowadays widely used for different purposes and in\nseveral disciplines. From self-driving cars to automated medical diagnosis,\nmachine learning models extensively support users' daily activities, and\nsoftware engineering tasks are no exception. Not embracing good ML practices\nmay lead to pitfalls that hinder the performance of an ML system and\npotentially lead to unexpected results. Despite the existence of documentation\nand literature about ML best practices, many non-ML experts turn towards gray\nliterature like blogs and Q&A systems when looking for help and guidance when\nimplementing ML systems. To better aid users in distilling relevant knowledge\nfrom such sources, we propose a recommender system that recommends ML practices\nbased on the user's context. As a first step in creating a recommender system\nfor machine learning practices, we implemented Idaka. A tool that provides two\ndifferent approaches for retrieving/generating ML best practices: i) an\ninformation retrieval (IR) engine and ii) a large language model. The IR-engine\nuses BM25 as the algorithm for retrieving the practices, and a large language\nmodel, in our case Alpaca. The platform has been designed to allow comparative\nstudies of best practices retrieval tools. Idaka is publicly available at\nGitHub: https://bit.ly/idaka. Video: https://youtu.be/cEb-AhIPxnM.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:28:18 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 08:05:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cabra-Acela","Laura",""],["Mojica-Hanke","Anamaria",""],["Linares-V\u00e1squez","Mario",""],["Herbold","Steffen",""]]}
{"id":"2308.12096","submitter":"Ivan Arzhantsev","authors":"Ivan Arzhantsev","title":"On conjugacy of additive actions in the affine Cremona group","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An additive action on an irreducible algebraic variety $X$ is an effective\naction $\\mathbb{G}_a^n\\times X\\to X$ with an open orbit of the vector group\n$\\mathbb{G}_a^n$. Any two additive actions on $X$ are conjugate by a birational\nautomorphism of $X$. We prove that, if $X$ is the projective space, the\nconjugating element can be chosen in the affine Cremona group and it is given\nby so-called basic polynomials of the corresponding local algebra.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:33:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Arzhantsev","Ivan",""]]}
{"id":"2308.12097","submitter":"Yijin Liu","authors":"Yijin Liu, Xianfeng Zeng, Fandong Meng, Jie Zhou","title":"Instruction Position Matters in Sequence Generation with Large Language\n  Models","comments":"Codes and results are at\n  https://github.com/Adaxry/Post-Instruction/tree/main","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) are capable of performing conditional sequence\ngeneration tasks, such as translation or summarization, through instruction\nfine-tuning. The fine-tuning data is generally sequentially concatenated from a\nspecific task instruction, an input sentence, and the corresponding response.\nConsidering the locality modeled by the self-attention mechanism of LLMs, these\nmodels face the risk of instruction forgetting when generating responses for\nlong input sentences. To mitigate this issue, we propose enhancing the\ninstruction-following capability of LLMs by shifting the position of task\ninstructions after the input sentences. Theoretical analysis suggests that our\nstraightforward method can alter the model's learning focus, thereby\nemphasizing the training of instruction-following capabilities. Concurrently,\nexperimental results demonstrate that our approach consistently outperforms\ntraditional settings across various model scales (1B / 7B / 13B) and different\nsequence generation tasks (translation and summarization), without any\nadditional data or annotation costs. Notably, our method significantly improves\nthe zero-shot performance on conditional sequence generation, e.g., up to 9.7\nBLEU points on WMT zero-shot translation tasks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:36:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Yijin",""],["Zeng","Xianfeng",""],["Meng","Fandong",""],["Zhou","Jie",""]]}
{"id":"2308.12098","submitter":"Sophie Hermann","authors":"Silas Robitschko, Florian Samm\\\"uller, Matthias Schmidt, Sophie\n  Hermann","title":"Hyperforce balance via thermal Noether invariance of any observable","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate that thermally averaged classical phase space functions,\nincluding local and global forces and energies, are associated with exact\nhyperforce sum rules that follow from translational Noether invariance. Both\nglobal and locally resolved identities hold and they relate the mean gradient\nof a phase space function to its negative correlation with the total force.\nExact hierarchies of higher-body sum rules follow iteratively. As applications\nwe investigate via computer simulations the emerging one-body force fluctuation\nprofiles in confined liquids. These local correlators quantify spatially\ninhomogeneous self organization and they allow to carry out stringent tests for\nsufficient sampling in complex systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:39:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Robitschko","Silas",""],["Samm\u00fcller","Florian",""],["Schmidt","Matthias",""],["Hermann","Sophie",""]]}
{"id":"2308.12099","submitter":"Moshe Friedman","authors":"Chandrabhan Yadav and Akiva Green and Moshe Friedman","title":"A Micromegas-based gaseous detector for neutron-induced charged-particle\n  reaction studies in nuclear astrophysics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The quasistellar neutron spectrum produced via $^{7}$Li($p$, $n$)$^{7}$Be\nreaction at a proton energy of 1.912 MeV has been extensively studied and\nemployed reaction for neutron-induced reaction studies. We are working towards\nusing this reaction at various proton energies from 1.9 MeV to 3.6 MeV to\nproduce a neutron field at a temperature range of $\\sim$1.5-3.5 GK to conduct\nmeasurements of neutron-induced charge particle reaction cross sections on\nvarious unstable nuclei at explosive stellar temperatures. In this paper, we\nare reporting our design and simulation study with regards to experimental\nset-up and a gaseous detector with a segmented Micromegas detector for\nconducting neutron-induced charge particle reactions studies for nuclei of\nastrophysics importance, for example, $^{26}$Al($n$, $p$)$^{26}$Mg,\n$^{26}$Al($n$, $\\alpha$)$^{23}$Na and $^{40}$K($n$, $p$)$^{40}$Ar,\n$^{40}$K($n$, $\\alpha$)$^{37}$Cl reactions. We plan to perform our experiments\nwith a 10-$\\mu$A proton beam at the Physikalisch Technische Bundesanstalt\nfacility (PTB, Germany), with a Micromegas-based gaseous detector under\nconstruction as discussed in the paper.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:41:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yadav","Chandrabhan",""],["Green","Akiva",""],["Friedman","Moshe",""]]}
{"id":"2308.12100","submitter":"Willian Hogendoorn","authors":"Willian Hogendoorn, Wim-Paul Breugem, David Frank, Martin Bruschewski,\n  Sven Grundmann, and Christian Poelma","title":"From nearly homogeneous to core-peaking suspensions: insight in\n  suspension pipe flows using MRI and DNS","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic Resonance Imaging (MRI) experiments have been performed in\nconjunction with Direct Numerical Simulations (DNS) to study neutrally buoyant\nparticle-laden pipe flows. The flows are characterized by the suspension liquid\nReynolds number ($Re_s$), based on the bulk liquid velocity and suspension\nviscosity obtained from Eilers' correlation, the bulk solid volume fraction\n($\\phi_b$) and the particle-to-pipe diameter ratio ($d/D$). Six different cases\nhave been studied, each with a unique combination of $Re_s$ and $\\phi$, while\n$d/D$ is kept constant at 0.058. These cases ensure that the comparison is\nperformed across different flow regimes, each exhibiting characteristic\nbehavior. In general, an excellent agreement is found between experiment and\nsimulation for the average liquid velocity and solid volume fraction profiles.\nThis study presents, for the first time, accurate and quantitative velocity and\nvolume fraction profiles of semi-dilute up to dense suspension flows using both\nexperimental and numerical methods. The discrepancy between the experiments and\nsimulations can be explained by various reasons, including a difference in\nparticle size distribution, uncertainty in experimental parameters used as an\ninput for the DNS, slight variations in particle roughness and frictional\ncollisions in the simulations. Eventually, three different flow regimes are\nidentified. For low bulk solid volume fractions a drag increase is observed.\nFor moderate $\\phi_b$ the drag is found to decrease, due to particle\naccumulation at the pipe centre. For high volume fractions the drag is found to\ndecrease further. For solid volume fractions of 0.4 a drag reduction higher\nthan 25% is found. This drag reduction is linked to the strong viscosity\ngradient in the radial direction, where the relatively low viscosity near the\npipe wall acts as a lubrication layer between the pipe wall and the dense core.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:43:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hogendoorn","Willian",""],["Breugem","Wim-Paul",""],["Frank","David",""],["Bruschewski","Martin",""],["Grundmann","Sven",""],["Poelma","Christian",""]]}
{"id":"2308.12101","submitter":"Etienne Bonnafoux","authors":"Bonnafoux Etienne","title":"Polynomial rate of mixing for a family of billiard flows","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the continuous correlation function decrease polynomially for\ntwo families of billiard studied by Chernov and Zhang. The main computation is\nto show that the return function is Holder on stable and unstable manifold.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:44:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Etienne","Bonnafoux",""]]}
{"id":"2308.12102","submitter":"Peter Gerdes","authors":"Peter Gerdes","title":"A $\\Pi^0_2$ Singleton of Minimal Arithmetic Degree","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the study of the arithmetic degrees (the degree structure induced by\nrelative arithmetic definability, ($\\leq_{a}$) the $\\omega$-REA sets play a\nrole analogous to the role the r.e. degrees play in the study of the Turing\ndegrees. However, much less is known about the arithmetic degrees and the role\nof the $\\omega$-REA sets in that structure than about the Turing degrees.\nIndeed, even basic questions such as the existence of a $\\omega$-REA set of\nminimal arithmetic degree are open. This paper makes progress on this question\nby demonstrating that some promising approaches inspired by the analogy with\nthe r.e sets fail to show that no $\\omega$-REA set is arithmetically minimal.\nFinally, it constructs a $\\Pi^0_2$ singleton of minimal arithmetic degree. Not\nonly is this a result of considerable interest in it's own right, constructions\nof $\\Pi^0_2$ singletons often pave the way for constructions of $\\omega$-REA\nsets with similar properties. Along the way, a number of interesting results\nrelating arithmetic reducibility and rates of growth are established.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:45:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gerdes","Peter",""]]}
{"id":"2308.12103","submitter":"Sebastian Yde Madsen","authors":"Sebastian Yde Madsen, Frederik Kofoed Marqversen, Stig Elkj{\\ae}r\n  Rasmussen and Nikolaj Thomas Zinner","title":"Multi-sequence alignment using the Quantum Approximate Optimization\n  Algorithm","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The task of Multiple Sequence Alignment (MSA) is a constrained combinatorial\noptimization problem that is generally considered a complex computational\nproblem. In this paper, we first present a binary encoding of MSA and devise a\ncorresponding soft-constrained cost-function that enables a Hamiltonian\nformulation and implementation of the MSA problem with the variational Quantum\nApproximate Optimization Algorithm (QAOA). Through theoretical analysis, a\nbound on the ratio of the number of feasible states to the size of the Hilbert\nspace is determined. Furthermore, we consider a small instance of our QAOA-MSA\nalgorithm in both a quantum simulator and its performance on an actual quantum\ncomputer. While the ideal solution to the instance of MSA investigated is shown\nto be the most probable state sampled for a shallow p<5 quantum circuit in the\nsimulation, the level of noise in current devices is still a formidable\nchallenge for the kind of MSA-QAOA algorithm developed here. In turn, we are\nnot able to distinguish the feasible solutions from other states in the quantum\nhardware output data at this point. This indicates a need for further\ninvestigation into both the strategy utilized for compiling the quantum\ncircuit, but also the possibility of devising a more compact ansatz, as one\nmight achieve through constraint-preserving mixers for QAOA.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:46:24 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Madsen","Sebastian Yde",""],["Marqversen","Frederik Kofoed",""],["Rasmussen","Stig Elkj\u00e6r",""],["Zinner","Nikolaj Thomas",""]]}
{"id":"2308.12104","submitter":"Basant Lal Sharma","authors":"Basant Lal Sharma, Luigi E. Perotti, Sanjay Dharmavaram","title":"Computational Modeling of Coupled Interactions of Fluid Membranes with\n  Embedded Filaments","comments":"9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cond-mat.soft cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we present a computational formulation based on continuum\nmechanics to study the interaction of fluid membranes embedded with\nsemiflexible filaments. This is motivated by systems in membrane biology, such\nas cytoskeletal networks and protein filaments aiding the cell fission process.\nWe model the membrane as a fluid shell via the Helfrich-Canham energy and the\nfilament as a one-dimensional Cosserat continuum. We assume the filament to be\ntethered to the surface of the membrane in a way that it is allowed to float on\nthe surface freely. The novel filament-membrane coupling, which is anticipated\nto yield interesting physics, also gives rise to unique computational\nchallenges, which we address in this work. We present validation results and\napply the formulation to certain problems inspired by cellular biology.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:47:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sharma","Basant Lal",""],["Perotti","Luigi E.",""],["Dharmavaram","Sanjay",""]]}
{"id":"2308.12105","submitter":"Aur\\'elie Bonhomme","authors":"H. Bonet, A. Bonhomme, C. Buck, K. F\\\"ulber, J. Hakenm\\\"uller, J.\n  Hempfling, J. Henrichs, G. Heusser, M. Lindner, W. Maneschg, T. Rink, E.\n  Sanchez Garcia, J. Stauber, H. Strecker, R. Wink","title":"Pulse shape discrimination for the CONUS experiment in the keV and\n  sub-keV regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Point-contact p-type high-purity germanium detectors (PPC HPGe) are\nparticularly suited for detection of sub-keV nuclear recoils from coherent\nelastic scattering of neutrinos or light dark matter particles. While these\nparticles are expected to interact homogeneously in the entire detector volume,\nspecific classes of external background radiation preferably deposit their\nenergy close to the semi-active detector surface, in which diffusion processes\ndominate that subsequently lead to slower rising pulses compared to the ones\nfrom the fully active bulk volume. Dedicated studies of their shape are\ntherefore highly beneficial for the understanding and the rejection of these\nunwanted events. This article reports about the development of a data-driven\npulse shape discrimination (PSD) method for the four 1 kg size PPC HPGe\ndetectors of the CONUS experiment in the keV and sub-keV regime down to 210\neV$_{\\text{ee}}$. The impact of the electronic noise at such low energies is\ncarefully examined. It is shown that for an acceptance of 90% of the faster\nsignal-like pulses from the bulk volume, approx. 50% of the surface events can\nbe rejected at the energy threshold and that their contribution is fully\nsuppressed above 800 eV$_{\\text{ee}}$. Applied to the CONUS background data,\nsuch a PSD rejection cut allows to achieve an overall (15-25)% reduction of the\ntotal background budget. The new method allows to improve the sensitivity of\nfuture CONUS analyses and to refine the corresponding background model in the\nsub-keV energy region.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:51:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bonet","H.",""],["Bonhomme","A.",""],["Buck","C.",""],["F\u00fclber","K.",""],["Hakenm\u00fcller","J.",""],["Hempfling","J.",""],["Henrichs","J.",""],["Heusser","G.",""],["Lindner","M.",""],["Maneschg","W.",""],["Rink","T.",""],["Garcia","E. Sanchez",""],["Stauber","J.",""],["Strecker","H.",""],["Wink","R.",""]]}
{"id":"2308.12106","submitter":"Xinyang Li","authors":"Xinyang Li, Vlad Costin Andrei, Ullrich J M\\\"onich, Holger Boche","title":"Optimal Linear Precoder Design for MIMO-OFDM Integrated Sensing and\n  Communications Based on Bayesian Cram\\'er-Rao Bound","comments":"Accepted to IEEE GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the fundamental limits of MIMO-OFDM integrated\nsensing and communications (ISAC) systems based on a Bayesian Cram\\'er-Rao\nbound (BCRB) analysis. We derive the BCRB for joint channel parameter\nestimation and data symbol detection, in which a performance trade-off between\nboth functionalities is observed. We formulate the optimization problem for a\nlinear precoder design and propose the stochastic Riemannian gradient descent\n(SRGD) approach to solve the non-convex problem. We analyze the optimality\nconditions and show that SRGD ensures convergence with high probability. The\nsimulation results verify our analyses and also demonstrate a fast convergence\nspeed. Finally, the performance trade-off is illustrated and investigated.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:53:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Xinyang",""],["Andrei","Vlad Costin",""],["M\u00f6nich","Ullrich J",""],["Boche","Holger",""]]}
{"id":"2308.12107","submitter":"Christina Williams","authors":"Adam J. Burgasser, Roman Gerasimov, Rachel Bezanson, Ivo Labbe,\n  Gabriel Brammer, Sam E. Cutler, Lukas J. Furtak, Jenny E. Greene, Joel Leja,\n  Richard Pan, Sedona H. Price, Bingjie Wang, John R. Weaver, Katherine E.\n  Whitaker, Seiji Fujimoto, Vasily Kokorev, Pratika Dayal, Themiya Nanayakkara,\n  Christina C. Williams, and Adi Zitrin","title":"UNCOVER: JWST Spectroscopy of Three Cold Brown Dwarfs at\n  Kiloparsec-scale Distances","comments":"submitted; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report JWST/NIRSpec spectra of three distant T-type brown dwarfs\nidentified in the Ultradeep NIRSpec and NIRCam ObserVations before the Epoch of\nReionization (UNCOVER) survey of the Abell 2744 lensing field. One source was\npreviously reported as a candidate T dwarf on the basis of NIRCam photometry,\nwhile the two other sources were initially identified as candidate active\ngalactic nuclei. Ultradeep, low-resolution 1-5 $\\mu$m spectra confirm the\npresence of molecular features consistent with T dwarf atmospheres, and\ncomparison to near-infrared spectral standards infers spectral classifications\nof sdT1, T6, and T8-T9. The spectrum of the warmest source, UNCOVER-BD-1, shows\nevidence of subsolar metallicity, and a fit to atmosphere models indicates Teff\n= 1300 K and [M/H] ~ -1.0, making this one of the few examples of a\nspectroscopically-confirmed T subdwarf. The spectrum of the coldest source,\nUNCOVER-BD-3, places it near the T/Y dwarf boundary with Teff = 550 K, and we\nidentify features of CH$_4$, CO, H$_2$O, and likely PH$_3$ in the 3.5-5.0\n$\\mu$m band. Our analysis suggests that PH3 is favored over CO$_2$ in this\nsource, a possible indicator of subsolar metallicity. We estimate distances of\n0.9-4.5 kpc from the Galactic midplane, and population simulations indicate\nhigh probabilities of membership in the Galactic thick disk or halo. Our\nsimulations also indicate that there may be up to 7 T dwarfs and 5-6 L dwarfs\nin the Abell 2744 field down to F444W = 30 AB mag, roughly half of which are\nhalo members. These results highlight the utility of deep JWST/NIRSpec\nspectroscopy for identifying and characterizing the oldest metal-poor brown\ndwarfs in the Milky Way.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:46:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Burgasser","Adam J.",""],["Gerasimov","Roman",""],["Bezanson","Rachel",""],["Labbe","Ivo",""],["Brammer","Gabriel",""],["Cutler","Sam E.",""],["Furtak","Lukas J.",""],["Greene","Jenny E.",""],["Leja","Joel",""],["Pan","Richard",""],["Price","Sedona H.",""],["Wang","Bingjie",""],["Weaver","John R.",""],["Whitaker","Katherine E.",""],["Fujimoto","Seiji",""],["Kokorev","Vasily",""],["Dayal","Pratika",""],["Nanayakkara","Themiya",""],["Williams","Christina C.",""],["Zitrin","Adi",""]]}
{"id":"2308.12108","submitter":"Edmund Lau","authors":"Edmund Lau, Daniel Murfet, Susan Wei","title":"Quantifying degeneracy in singular models via the learning coefficient","comments":"22 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks (DNN) are singular statistical models which exhibit\ncomplex degeneracies. In this work, we illustrate how a quantity known as the\n\\emph{learning coefficient} introduced in singular learning theory quantifies\nprecisely the degree of degeneracy in deep neural networks. Importantly, we\nwill demonstrate that degeneracy in DNN cannot be accounted for by simply\ncounting the number of \"flat\" directions. We propose a computationally scalable\napproximation of a localized version of the learning coefficient using\nstochastic gradient Langevin dynamics. To validate our approach, we demonstrate\nits accuracy in low-dimensional models with known theoretical values.\nImportantly, the local learning coefficient can correctly recover the ordering\nof degeneracy between various parameter regions of interest. An experiment on\nMNIST shows the local learning coefficient can reveal the inductive bias of\nstochastic opitmizers for more or less degenerate critical points.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:55:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lau","Edmund",""],["Murfet","Daniel",""],["Wei","Susan",""]]}
{"id":"2308.12109","submitter":"Hidetoshi Masai","authors":"Hidetoshi Masai, Greg McShane","title":"Isospectral Configurations in Euclidean and Hyperbolic Geometry","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A number of questions related to the length spectrum of surfaces are\ndiscussed and in particular the existence of pairs of surfaces which though not\nisometric are isospectral. Here by isospectral we mean that a pair of bodies\nhave the same distribution of chord lengths. In the Euclidean setting, we study\nisospectral convex dodecagons found by Mallows and Clark in the 1970's.\nStarting from their idea, we give constructions for isospectral pairs of\nhyperbolic surfaces that have no common cover. Since the work of Mallows and\nClark is probably unfamiliar to readers with a background in\ntopology/hyperbolic geometry we include expository material on other related\ntopics about the distribution of chord lengths.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:56:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Masai","Hidetoshi",""],["McShane","Greg",""]]}
{"id":"2308.12110","submitter":"Thomas Power","authors":"Thomas Power and Dmitry Berenson","title":"Constrained Stein Variational Trajectory Optimization","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present Constrained Stein Variational Trajectory Optimization (CSVTO), an\nalgorithm for performing trajectory optimization with constraints on a set of\ntrajectories in parallel. We frame constrained trajectory optimization as a\nnovel form of constrained functional minimization over trajectory\ndistributions, which avoids treating the constraints as a penalty in the\nobjective and allows us to generate diverse sets of constraint-satisfying\ntrajectories. Our method uses Stein Variational Gradient Descent (SVGD) to find\na set of particles that approximates a distribution over low-cost trajectories\nwhile obeying constraints. CSVTO is applicable to problems with arbitrary\nequality and inequality constraints and includes a novel particle resampling\nstep to escape local minima. By explicitly generating diverse sets of\ntrajectories, CSVTO is better able to avoid poor local minima and is more\nrobust to initialization. We demonstrate that CSVTO outperforms baselines in\nchallenging highly-constrained tasks, such as a 7DoF wrench manipulation task,\nwhere CSVTO succeeds in 20/20 trials vs 13/20 for the closest baseline. Our\nresults demonstrate that generating diverse constraint-satisfying trajectories\nimproves robustness to disturbances and initialization over baselines.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:58:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Power","Thomas",""],["Berenson","Dmitry",""]]}
{"id":"2308.12111","submitter":"Chao Tian","authors":"Chao Tian, Zikun Zhou, Yuqing Huang, Gaojun Li, and Zhenyu He","title":"Cross-Modality Proposal-guided Feature Mining for Unregistered\n  RGB-Thermal Pedestrian Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  RGB-Thermal (RGB-T) pedestrian detection aims to locate the pedestrians in\nRGB-T image pairs to exploit the complementation between the two modalities for\nimproving detection robustness in extreme conditions. Most existing algorithms\nassume that the RGB-T image pairs are well registered, while in the real world\nthey are not aligned ideally due to parallax or different field-of-view of the\ncameras. The pedestrians in misaligned image pairs may locate at different\npositions in two images, which results in two challenges: 1) how to achieve\ninter-modality complementation using spatially misaligned RGB-T pedestrian\npatches, and 2) how to recognize the unpaired pedestrians at the boundary. To\ndeal with these issues, we propose a new paradigm for unregistered RGB-T\npedestrian detection, which predicts two separate pedestrian locations in the\nRGB and thermal images, respectively. Specifically, we propose a cross-modality\nproposal-guided feature mining (CPFM) mechanism to extract the two precise\nfusion features for representing the pedestrian in the two modalities, even if\nthe RGB-T image pair is unaligned. It enables us to effectively exploit the\ncomplementation between the two modalities. With the CPFM mechanism, we build a\ntwo-stream dense detector; it predicts the two pedestrian locations in the two\nmodalities based on the corresponding fusion feature mined by the CPFM\nmechanism. Besides, we design a data augmentation method, named Homography, to\nsimulate the discrepancy in scales and views between images. We also\ninvestigate two non-maximum suppression (NMS) methods for post-processing.\nFavorable experimental results demonstrate the effectiveness and robustness of\nour method in dealing with unregistered pedestrians with different shifts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:58:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tian","Chao",""],["Zhou","Zikun",""],["Huang","Yuqing",""],["Li","Gaojun",""],["He","Zhenyu",""]]}
{"id":"2308.12112","submitter":"Grzegorz Rype\\'s\\'c","authors":"Daniel Marczak, Grzegorz Rype\\'s\\'c, Sebastian Cygert, Tomasz\n  Trzci\\'nski, Bart{\\l}omiej Twardowski","title":"Generalized Continual Category Discovery","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Most of Continual Learning (CL) methods push the limit of supervised learning\nsettings, where an agent is expected to learn new labeled tasks and not forget\nprevious knowledge. However, these settings are not well aligned with real-life\nscenarios, where a learning agent has access to a vast amount of unlabeled data\nencompassing both novel (entirely unlabeled) classes and examples from known\nclasses. Drawing inspiration from Generalized Category Discovery (GCD), we\nintroduce a novel framework that relaxes this assumption. Precisely, in any\ntask, we allow for the existence of novel and known classes, and one must use\ncontinual version of unsupervised learning methods to discover them. We call\nthis setting Generalized Continual Category Discovery (GCCD). It unifies CL and\nGCD, bridging the gap between synthetic benchmarks and real-life scenarios.\nWith a series of experiments, we present that existing methods fail to\naccumulate knowledge from subsequent tasks in which unlabeled samples of novel\nclasses are present. In light of these limitations, we propose a method that\nincorporates both supervised and unsupervised signals and mitigates the\nforgetting through the use of centroid adaptation. Our method surpasses strong\nCL methods adopted for GCD techniques and presents a superior representation\nlearning performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:02:52 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Marczak","Daniel",""],["Rype\u015b\u0107","Grzegorz",""],["Cygert","Sebastian",""],["Trzci\u0144ski","Tomasz",""],["Twardowski","Bart\u0142omiej",""]]}
{"id":"2308.12113","submitter":"Qinfeng Zhu","authors":"Qinfeng Zhu, Lei Fan, Ningxin Weng","title":"Advancements in Point Cloud Data Augmentation for Deep Learning: A\n  Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Point cloud has a wide range of applications in areas such as autonomous\ndriving, mapping, navigation, scene reconstruction, and medical imaging. Due to\nits great potentials in these applications, point cloud processing has gained\ngreat attention in the field of computer vision. Among various point cloud\nprocessing techniques, deep learning (DL) has become one of the mainstream and\neffective methods for tasks such as detection, segmentation and classification.\nTo reduce overfitting during training DL models and improve model performance\nespecially when the amount and/or diversity of training data are limited,\naugmentation is often crucial. Although various point cloud data augmentation\nmethods have been widely used in different point cloud processing tasks, there\nare currently no published systematic surveys or reviews of these methods.\nTherefore, this article surveys and discusses these methods and categorizes\nthem into a taxonomy framework. Through the comprehensive evaluation and\ncomparison of the augmentation methods, this article identifies their\npotentials and limitations and suggests possible future research directions.\nThis work helps researchers gain a holistic understanding of the current status\nof point cloud data augmentation and promotes its wider application and\ndevelopment.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:06:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhu","Qinfeng",""],["Fan","Lei",""],["Weng","Ningxin",""]]}
{"id":"2308.12114","submitter":"Richa Upadhyay","authors":"Richa Upadhyay, Ronald Phlypo, Rajkumar Saini, Marcus Liwicki","title":"Less is More -- Towards parsimonious multi-task models using structured\n  sparsity","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Group sparsity in Machine Learning (ML) encourages simpler, more\ninterpretable models with fewer active parameter groups. This work aims to\nincorporate structured group sparsity into the shared parameters of a\nMulti-Task Learning (MTL) framework, to develop parsimonious models that can\neffectively address multiple tasks with fewer parameters while maintaining\ncomparable or superior performance to a dense model. Sparsifying the model\nduring training helps decrease the model's memory footprint, computation\nrequirements, and prediction time during inference. We use channel-wise l1/l2\ngroup sparsity in the shared layers of the Convolutional Neural Network (CNN).\nThis approach not only facilitates the elimination of extraneous groups\n(channels) but also imposes a penalty on the weights, thereby enhancing the\nlearning of all tasks. We compare the outcomes of single-task and multi-task\nexperiments under group sparsity on two publicly available MTL datasets, NYU-v2\nand CelebAMask-HQ. We also investigate how changing the sparsification degree\nimpacts both the performance of the model and the sparsity of groups.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:09:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Upadhyay","Richa",""],["Phlypo","Ronald",""],["Saini","Rajkumar",""],["Liwicki","Marcus",""]]}
{"id":"2308.12115","submitter":"Oleg Kolosov","authors":"Oleg Kolosov, Mehmet Fatih Aktas, Emina Soljanin, Gala Yadgar","title":"Theory vs. Practice in Modeling Edge Storage Systems","comments":"Accepted to 2023 IEEE International Performance, Computing, and\n  Communications Conference (IPCCC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Edge systems promise to bring data and computing closer to the users of\ntime-critical applications. Specifically, edge storage systems are emerging as\na new system paradigm, where users can retrieve data from small-scale servers\ninter-operating at the network's edge. The analysis, design, and optimization\nof such systems require a tractable model that will reflect their costs and\nbottlenecks. Alas, most existing mathematical models for edge systems focus on\nstateless tasks, network performance, or isolated nodes and are inapplicable\nfor evaluating edge-based storage performance.\n  We analyze the capacity-region model - the most promising model proposed so\nfar for edge storage systems. The model addresses the system's ability to serve\na set of user demands. Our analysis reveals five inherent gaps between this\nmodel and reality, demonstrating the significant remaining challenges in\nmodeling storage service at the edge.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:09:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kolosov","Oleg",""],["Aktas","Mehmet Fatih",""],["Soljanin","Emina",""],["Yadgar","Gala",""]]}
{"id":"2308.12116","submitter":"Christoph Reich","authors":"Christoph Reich, Tim Prangemeier, Heinz Koeppl","title":"The TYC Dataset for Understanding Instance-Level Semantics and Motions\n  of Cells in Microstructures","comments":"Accepted at ICCV 2023 Workshop on BioImage Computing. Project page\n  (with links to the dataset and code):\n  https://christophreich1996.github.io/tyc_dataset/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Segmenting cells and tracking their motion over time is a common task in\nbiomedical applications. However, predicting accurate instance-wise\nsegmentation and cell motions from microscopy imagery remains a challenging\ntask. Using microstructured environments for analyzing single cells in a\nconstant flow of media adds additional complexity. While large-scale labeled\nmicroscopy datasets are available, we are not aware of any large-scale dataset,\nincluding both cells and microstructures. In this paper, we introduce the\ntrapped yeast cell (TYC) dataset, a novel dataset for understanding\ninstance-level semantics and motions of cells in microstructures. We release\n$105$ dense annotated high-resolution brightfield microscopy images, including\nabout $19$k instance masks. We also release $261$ curated video clips composed\nof $1293$ high-resolution microscopy images to facilitate unsupervised\nunderstanding of cell motions and morphology. TYC offers ten times more\ninstance annotations than the previously largest dataset, including cells and\nmicrostructures. Our effort also exceeds previous attempts in terms of\nmicrostructure variability, resolution, complexity, and capturing device\n(microscopy) variability. We facilitate a unified comparison on our novel\ndataset by introducing a standardized evaluation strategy. TYC and evaluation\ncode are publicly available under CC BY 4.0 license.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:10:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Reich","Christoph",""],["Prangemeier","Tim",""],["Koeppl","Heinz",""]]}
{"id":"2308.12117","submitter":"Meng Guo","authors":"Yuda Chen and Meng Guo","title":"Multi-UAV Deployment in Obstacle-Cluttered Environments with LOS\n  Connectivity","comments":"8 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A reliable communication network is essential for multiple UAVs operating\nwithin obstacle-cluttered environments, where limited communication due to\nobstructions often occurs. A common solution is to deploy intermediate UAVs to\nrelay information via a multi-hop network, which introduces two challenges: (i)\nhow to design the structure of multi-hop networks; and (ii) how to maintain\nconnectivity during collaborative motion. To this end, this work first proposes\nan efficient constrained search method based on the minimum-edge RRT$^\\star$\nalgorithm, to find a spanning-tree topology that requires a less number of UAVs\nfor the deployment task. To achieve this deployment, a distributed model\npredictive control strategy is proposed for the online motion coordination. It\nexplicitly incorporates not only the inter-UAV and UAV-obstacle distance\nconstraints, but also the line-of-sight (LOS) connectivity constraint. These\nconstraints are well-known to be nonlinear and often tackled by various\napproximations. In contrast, this work provides a theoretical guarantee that\nall agent trajectories are ensured to be collision-free with a team-wise LOS\nconnectivity at all time. Numerous simulations are performed in 3D valley-like\nenvironments, while hardware experiments validate its dynamic adaptation when\nthe deployment position changes online.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:12:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Yuda",""],["Guo","Meng",""]]}
{"id":"2308.12118","submitter":"Dant\\'e Hewitt Mr","authors":"Dant\\'e M. Hewitt, Jason W. T. Hessels, Omar S. Ould-Boukattine,\n  Pragya Chawla, Isma\\\"el Cognard, Akshatha Gopinath, Lucas Guillemot, Daniela\n  Huppenkothen, Kenzie Nimmo6 and Mark P. Snelders","title":"Dense Forests of Microshots in Bursts from FRB 20220912A","comments":"submitted to MNRAS, 19 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on exceptionally bright bursts (>400 Jy ms) detected from the\nrepeating fast radio burst source FRB 20220912A using the Nan\\c{c}ay Radio\nTelescope (NRT), as part of the ECLAT (Extragalactic Coherent Light from\nAstrophysical Transients) monitoring campaign. These bursts exhibit extremely\nluminous, broadband, short-duration structures (~ 16 microseconds), which we\nterm 'microshots' and which can be especially well studied in the NRT data\ngiven the excellent signal-to-noise and dynamic range (32-bit samples). The\nestimated peak flux density of the brightest microshot is 450 Jy. We show that\nthe microshots are clustered into dense 'forests', by modelling them as Weibull\ndistributions and obtaining Weibull shape parameters of approximately 0.5. Our\npolarimetric analysis reveals that the bursts are nearly 100% linearly\npolarised; have < 10% circular polarisation fractions; a near-zero average\nrotation measure of 0.10(6) rad/m^2; and varying polarisation position angles\nover the burst duration. For one of the bursts, we analyse raw voltage data\nfrom simultaneous observations with the Westerbork RT-1 single 25-m dish. These\ndata allow us to measure the scintillation bandwidth, 0.30(3) MHz, and to probe\nthe bursts on (sub-)microsecond timescales. Some important nuances related to\ndedispersion are also discussed. We propose that the emission mechanism for the\nbroadband microshots is potentially different from the emission mechanism of\nthe broader burst components which still show a residual drift of a few hundred\nMHz/ms after correcting for dispersion using the microshots. We discuss how the\nobserved emission is phenomenologically analogous to different types of radio\nbursts from the Sun.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:13:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hewitt","Dant\u00e9 M.",""],["Hessels","Jason W. T.",""],["Ould-Boukattine","Omar S.",""],["Chawla","Pragya",""],["Cognard","Isma\u00ebl",""],["Gopinath","Akshatha",""],["Guillemot","Lucas",""],["Huppenkothen","Daniela",""],["Nimmo6","Kenzie",""],["Snelders","Mark P.",""]]}
{"id":"2308.12119","submitter":"Vincent Pilaud","authors":"B\\'er\\'enice Delcroix-Oger, Guillaume Laplante-Anfossi, Vincent\n  Pilaud, Kurt Stoeckl","title":"Cellular diagonals of permutahedra","comments":"71 pages, 28 figures, 8 tables","journal-ref":null,"doi":null,"report-no":"MPIM-Bonn-2023","categories":"math.CO math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a systematic enumerative and combinatorial study of geometric\ncellular diagonals on the permutahedra.\n  In the first part of the paper, we study the combinatorics of certain\nhyperplane arrangements obtained as the union of $\\ell$ generically translated\ncopies of the classical braid arrangement. Based on Zaslavsky's theory, we\nderive enumerative results on the faces of these arrangements involving\ncombinatorial objects named partition forests and rainbow forests. This yields\nin particular nice formulas for the number of regions and bounded regions in\nterms of exponentials of generating functions of Fuss-Catalan numbers. By\nduality, the specialization of these results to the case $\\ell = 2$ gives the\nenumeration of any geometric diagonal of the permutahedron.\n  In the second part of the paper, we study diagonals which respect the\noperadic structure on the family of permutahedra. We show that there are\nexactly two such diagonals, which are moreover isomorphic. We describe their\nfacets by a simple rule on paths in partition trees, and their vertices as\npattern-avoiding pairs of permutations. We show that one of these diagonals is\na topological enhancement of the Sanbeblidze-Umble diagonal, and unravel a\nnatural lattice structure on their sets of facets.\n  In the third part of the paper, we use the preceding results to show that\nthere are precisely two isomorphic topological cellular operadic structures on\nthe families of operahedra and multiplihedra, and exactly two\ninfinity-isomorphic geometric universal tensor products of homotopy operads and\nA-infinity morphisms.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:15:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Delcroix-Oger","B\u00e9r\u00e9nice",""],["Laplante-Anfossi","Guillaume",""],["Pilaud","Vincent",""],["Stoeckl","Kurt",""]]}
{"id":"2308.12120","submitter":"Sayak Kundu","authors":"Hadi Esmaeilzadeh, Soroush Ghodrati, Andrew B. Kahng, Joon Kyung Kim,\n  Sean Kinzer, Sayak Kundu, Rohan Mahapatra, Susmita Dey Manasi, Sachin\n  Sapatnekar, Zhiang Wang and Ziqing Zeng","title":"An Open-Source ML-Based Full-Stack Optimization Framework for Machine\n  Learning Accelerators","comments":"This is an extended version of our work titled \"Physically Accurate\n  Learning-based Performance Prediction of Hardware-accelerated ML Algorithms\"\n  published in MLCAD 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parameterizable machine learning (ML) accelerators are the product of recent\nbreakthroughs in ML. To fully enable their design space exploration (DSE), we\npropose a physical-design-driven, learning-based prediction framework for\nhardware-accelerated deep neural network (DNN) and non-DNN ML algorithms. It\nadopts a unified approach that combines backend power, performance, and area\n(PPA) analysis with frontend performance simulation, thereby achieving a\nrealistic estimation of both backend PPA and system metrics such as runtime and\nenergy. In addition, our framework includes a fully automated DSE technique,\nwhich optimizes backend and system metrics through an automated search of\narchitectural and backend parameters. Experimental studies show that our\napproach consistently predicts backend PPA and system metrics with an average\n7% or less prediction error for the ASIC implementation of two deep learning\naccelerator platforms, VTA and VeriGOOD-ML, in both a commercial 12 nm process\nand a research-oriented 45 nm process.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:16:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Esmaeilzadeh","Hadi",""],["Ghodrati","Soroush",""],["Kahng","Andrew B.",""],["Kim","Joon Kyung",""],["Kinzer","Sean",""],["Kundu","Sayak",""],["Mahapatra","Rohan",""],["Manasi","Susmita Dey",""],["Sapatnekar","Sachin",""],["Wang","Zhiang",""],["Zeng","Ziqing",""]]}
{"id":"2308.12121","submitter":"Chuangchuang Kang","authors":"Xiang Gao, Chuangchuang Kang, Jiafeng L\\\"u, Shizhuo Yu","title":"Nijenhuis operators on low dimensional pre-Lie algebras and solutions of\n  CYBE","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We first classify all Nijenhuis operators on 2-dimensional complex pre-Lie\nalgebras and 3-dimensional complex associative algebras. Moreover, applying the\nobtained classification, we provide solutions of classical Yang-Baxter equation\nof the semi-direct product sub-adjacent Lie algebras.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:17:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gao","Xiang",""],["Kang","Chuangchuang",""],["L\u00fc","Jiafeng",""],["Yu","Shizhuo",""]]}
{"id":"2308.12122","submitter":"Fabio L. Braghin","authors":"Fabio L. Braghin, Marcelo Loewe, Cristian Villavicencio","title":"The Yukawa potential under weak magnetic field","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weak magnetic field induced corrections for the Yukawa potential due to one\npion exchange between two constituent quarks(nucleons) are presented. For that,\nthe magnetic field effect on the pion propagator and on the pion form factor\nare taken into account. For that, an effective gluon propagator parameterized\nwith an effective gluon mass ($M_g\\sim 0.5$GeV) is considered. In the limit of\nmagnetic field weak with respect to the constituent quark mass and pion mass,\nanalytical and semi-analytical expressions can be obtained. Different types of\ncontributions are found, isotropic or anisotropic, dependent on the pion mass\nand also on the constituent quark and effective gluon masses. Overall the\ncorrections are of the order of $2\\%$ to $5\\%$ of the Yukawa potential at\ndistances close to $2$fm, and they decrease slower than the Yukawa potential.\nThe anistropic corrections are considerably smaller than the isotropic\ncomponents. A sizable splitting between results due to magnetic field dependent\nneutral or charged pion mass is found.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:17:49 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Braghin","Fabio L.",""],["Loewe","Marcelo",""],["Villavicencio","Cristian",""]]}
{"id":"2308.12123","submitter":"Norbert Kaiser","authors":"Norbert Kaiser","title":"Solving the matrix exponential function for special orthogonal groups\n  SO(n) and the exceptional G$_2$","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work the matrix exponential function is solved analytically for the\nspecial orthogonal groups $SO(n)$ up to $n=9$. The number of occurring $k$-th\nmatrix powers gets limited to $0\\leq k \\leq n-1$ by exploiting the\nCayley-Hamilton relation. The corresponding expansion coefficients can be\nexpressed as cosine and sine functions of a vector-norm $V$ and the roots of a\npolynomial equation that depends on a few specific invariants. Besides the well\nknown case of $SO(3)$, a quadratic equation needs to be solved for $n=4,5$, a\ncubic equation for $n=6,7$, and a quartic equation for $n=8,9$. As an\ninteresting subgroup of $SO(7)$, the exceptional Lie group $G_2$ of dimension\n$14$ is constructed via the matrix exponential function through a remarkably\nsimple constraint on an invariant, $\\xi=1$. The calculation of the trace of the\n$SO(n)$-matrices arising from the exponential function, results in a sum of\ncosines of several angles, which specify the associated conjugation class as a\npoint on a maximal torus.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:19:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kaiser","Norbert",""]]}
{"id":"2308.12124","submitter":"Saikat Santra","authors":"Saikat Santra and Anupam Kundu","title":"Crossover in density profiles of confined particles in power-law models\n  with finite range of interaction","comments":"46 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a classical system of $N$ particles confined in a harmonic trap\nin one dimension. The pairwise interaction potential between two particles\nseparated by a distance $r$ is taken to be power-law form, $ V(r) \\sim 1/r^k$\nknown as Riesz gas. We particularly look at the case where the particles can\ninteract up to $d$ particles to its left and right if any. By tuning the values\nof the parameter $d$, the system can be made from nearest neighbour $(d=1)$ to\nall-to-all $(d=N-1)$ interaction model, however the scaling function changes\ndramatically as $f$ is changed. Previous studies inform that the collective\ntheories and the equilibrium densities are different in the two limits. In this\narticle we study the crossover in density profile by tuning the parameter\n$f(=d/N)$ from $1$ to $0$. We find the system size scaling of the density\nprofile for $f \\neq 0$ to be same as it is in the all-to-all coupling case. We\nhave numerically demonstrated the density-crossover for general $k$ and provide\nour analytical understanding in some special values of $k$ e.g., $k=-1$ and $k\n\\to 0$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:24:23 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 06:57:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Santra","Saikat",""],["Kundu","Anupam",""]]}
{"id":"2308.12125","submitter":"Marco Muzio","authors":"Paramita Dasgupta, Marco Stein Muzio (for the ARA Collaboration)","title":"Progress Towards a Diffuse Neutrino Search in the Full Livetime of the\n  Askaryan Radio Array","comments":null,"journal-ref":null,"doi":"10.22323/1.444.1226","report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Askaryan Radio Array (ARA) is an in-ice ultrahigh energy (UHE, $>10$ PeV)\nneutrino experiment at the South Pole that aims to detect radio emissions from\nneutrino-induced particle cascades. ARA has five independent stations which\ntogether have collected nearly 24 station-years of data. Each of these stations\nsearch for UHE neutrinos by burying in-ice clusters of antennas $\\sim 200$ m\ndeep in a roughly cubical lattice with side length $\\sim 15$ m. Additionally,\nthe fifth ARA station (A5) has a beamforming trigger, referred to as the Phased\nArray (PA), consisting of a trigger array of 7 tightly packed\nvertically-polarized antennas. In this proceeding, we will present a neutrino\nsearch with the data of this \"hybrid\" station, emphasizing its capabilities for\nimproved analysis efficiencies, background rejection, and neutrino vertex\nreconstruction. This is enabled by combining the closely packed trigger\nantennas with the long-baselines of the outrigger antennas. We will also place\nthe A5 analysis into the context of the broader five station analysis program,\nincluding efforts to characterize and calibrate the detector, model and\nconstrain backgrounds, and reject noise across the entire array. We anticipate\nthis full neutrino search to set world-leading limits above 100 PeV, and inform\nthe next generation of neutrino detection experiments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:31:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dasgupta","Paramita","","for the ARA Collaboration"],["Muzio","Marco Stein","","for the ARA Collaboration"]]}
{"id":"2308.12126","submitter":"Wenwen Min","authors":"Weifeng Yang and Wenwen Min","title":"An Accelerated Block Proximal Framework with Adaptive Momentum for\n  Nonconvex and Nonsmooth Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an accelerated block proximal linear framework with adaptive\nmomentum (ABPL$^+$) for nonconvex and nonsmooth optimization. We analyze the\npotential causes of the extrapolation step failing in some algorithms, and\nresolve this issue by enhancing the comparison process that evaluates the\ntrade-off between the proximal gradient step and the linear extrapolation step\nin our algorithm. Furthermore, we extends our algorithm to any scenario\ninvolving updating block variables with positive integers, allowing each cycle\nto randomly shuffle the update order of the variable blocks. Additionally,\nunder mild assumptions, we prove that ABPL$^+$ can monotonically decrease the\nfunction value without strictly restricting the extrapolation parameters and\nstep size, demonstrates the viability and effectiveness of updating these\nblocks in a random order, and we also more obviously and intuitively\ndemonstrate that the derivative set of the sequence generated by our algorithm\nis a critical point set. Moreover, we demonstrate the global convergence as\nwell as the linear and sublinear convergence rates of our algorithm by\nutilizing the Kurdyka-Lojasiewicz (K{\\L}) condition. To enhance the\neffectiveness and flexibility of our algorithm, we also expand the study to the\nimprecise version of our algorithm and construct an adaptive extrapolation\nparameter strategy, which improving its overall performance. We apply our\nalgorithm to multiple non-negative matrix factorization with the $\\ell_0$ norm,\nnonnegative tensor decomposition with the $\\ell_0$ norm, and perform extensive\nnumerical experiments to validate its effectiveness and efficiency.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:32:31 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 14:16:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Weifeng",""],["Min","Wenwen",""]]}
{"id":"2308.12127","submitter":"Ananthu Aniraj","authors":"Ananthu Aniraj, Cassio F. Dantas, Dino Ienco, Diego Marcos","title":"Masking Strategies for Background Bias Removal in Computer Vision Models","comments":"Accepted at the 2023 IEEE/CVF International Conference on Computer\n  Vision Workshop (ICCVW) on Out Of Distribution Generalization in Computer\n  Vision (OOD-CV)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Models for fine-grained image classification tasks, where the difference\nbetween some classes can be extremely subtle and the number of samples per\nclass tends to be low, are particularly prone to picking up background-related\nbiases and demand robust methods to handle potential examples with\nout-of-distribution (OOD) backgrounds. To gain deeper insights into this\ncritical problem, our research investigates the impact of background-induced\nbias on fine-grained image classification, evaluating standard backbone models\nsuch as Convolutional Neural Network (CNN) and Vision Transformers (ViT). We\nexplore two masking strategies to mitigate background-induced bias: Early\nmasking, which removes background information at the (input) image level, and\nlate masking, which selectively masks high-level spatial features corresponding\nto the background. Extensive experiments assess the behavior of CNN and ViT\nmodels under different masking strategies, with a focus on their generalization\nto OOD backgrounds. The obtained findings demonstrate that both proposed\nstrategies enhance OOD performance compared to the baseline models, with early\nmasking consistently exhibiting the best OOD performance. Notably, a ViT\nvariant employing GAP-Pooled Patch token-based classification combined with\nearly masking achieves the highest OOD robustness.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:33:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aniraj","Ananthu",""],["Dantas","Cassio F.",""],["Ienco","Dino",""],["Marcos","Diego",""]]}
{"id":"2308.12128","submitter":"Alexander Shen","authors":"Alexander Shen","title":"Israil Moiseevich Gelfand [In Russian]","comments":"In Russian","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  I was lucky to meet (and even cooperate at some extent) with Israel M.\nGelfand, and tried to write down (mainly in 2003-2013) my recollections about\nhis work style and lessons I learned from him about teaching and writing\nmathematics (though the views are my own and I.M. is not responsible for them\nin any way).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:34:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shen","Alexander",""]]}
{"id":"2308.12129","submitter":"Oluwatosin Ogundare","authors":"Oluwatosin Ogundare, Gustavo Quiros Araya, Ioannis Akrotirianakis,\n  Ankit Shukla","title":"Resiliency Analysis of LLM generated models for Industrial Automation","comments":"8 Pages, Conference Manuscript","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a study of the resilience and efficiency of automatically\ngenerated industrial automation and control systems using Large Language Models\n(LLMs). The approach involves modeling the system using percolation theory to\nestimate its resilience and formulating the design problem as an optimization\nproblem subject to constraints. Techniques from stochastic optimization and\nregret analysis are used to find a near-optimal solution with provable regret\nbounds. The study aims to provide insights into the effectiveness and\nreliability of automatically generated systems in industrial automation and\ncontrol, and to identify potential areas for improvement in their design and\nimplementation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:35:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ogundare","Oluwatosin",""],["Araya","Gustavo Quiros",""],["Akrotirianakis","Ioannis",""],["Shukla","Ankit",""]]}
{"id":"2308.12130","submitter":"Yuan Wang","authors":"Yuan Wang and Sander Rhebergen","title":"Space-time hybridizable discontinuous Galerkin method for\n  advection-diffusion on deforming domains: The advection-dominated regime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze a space-time hybridizable discontinuous Galerkin method to solve\nthe time-dependent advection-diffusion equation on deforming domains. We prove\nstability of the discretization in the advection-dominated regime by using\nweighted test functions and derive a priori space-time error estimates. A\nnumerical example illustrates the theoretical results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:36:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Yuan",""],["Rhebergen","Sander",""]]}
{"id":"2308.12131","submitter":"Ciprian-Octavian Truic\\u{a}","authors":"Ciprian-Octavian Truic\\u{a}, Victor Tudose and Elena-Simona Apostol","title":"Semantic Change Detection for the Romanian Language","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Automatic semantic change methods try to identify the changes that appear\nover time in the meaning of words by analyzing their usage in diachronic\ncorpora. In this paper, we analyze different strategies to create static and\ncontextual word embedding models, i.e., Word2Vec and ELMo, on real-world\nEnglish and Romanian datasets. To test our pipeline and determine the\nperformance of our models, we first evaluate both word embedding models on an\nEnglish dataset (SEMEVAL-CCOHA). Afterward, we focus our experiments on a\nRomanian dataset, and we underline different aspects of semantic changes in\nthis low-resource language, such as meaning acquisition and loss. The\nexperimental results show that, depending on the corpus, the most important\nfactors to consider are the choice of model and the distance to calculate a\nscore for detecting semantic change.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:37:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Truic\u0103","Ciprian-Octavian",""],["Tudose","Victor",""],["Apostol","Elena-Simona",""]]}
{"id":"2308.12132","submitter":"Subhendu Kahaly","authors":"Mousumi Upadhyay Kahaly, Saibabu Madas, Boris Mesits and Subhendu\n  Kahaly","title":"Tunable ultrafast thermionic emission from femtosecond-laser hot spot on\n  a metal surface: role of laser polarization and angle of incidence","comments":"17 pages, 7 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall cond-mat.mtrl-sci physics.app-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Ultrafast laser induced thermionic emission from metal surfaces has several\napplications. Here, we investigate the role of laser polarization and angle of\nincidence on the ultrafast thermionic emission process from laser driven gold\ncoated glass surface. The spatio-temporal evolution of electron and lattice\ntemperatures are obtained using an improved three-dimensional (3D)\ntwo-temperature model (TTM) which takes into account the 3D laser pulse profile\nfocused obliquely onto the surface. The associated thermionic emission features\nare described through modified Richardson-Dushman equation, including dynamic\nspace charge effects and are included self-consistently in our numerical\napproach. We show that temperature dependent reflectivity influences laser\nenergy absorption. The resulting peak electron temperature on the metal surface\nmonotonically increases with angle of incidence for P polarization, while for S\npolarization it shows opposite trend. We observe that thermionic emission\nduration shows strong dependence on angle of incidence and contrasting\npolarization dependent behaviour. The duration of thermionic current shows\nstrong correlation to the intrinsic electron-lattice thermalization time, in a\nfluence regime well below the damage threshold of gold. The observations and\ninsights have important consequences in designing ultrafast thermionic emitters\nbased on a metal based architecture.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:41:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kahaly","Mousumi Upadhyay",""],["Madas","Saibabu",""],["Mesits","Boris",""],["Kahaly","Subhendu",""]]}
{"id":"2308.12133","submitter":"Sota Kato","authors":"Sota Kato, Kazuhiro Hotta, Yuhki Hatakeyama, Yoshinori Konishi","title":"Lite-HRNet Plus: Fast and Accurate Facial Landmark Detection","comments":"Accepted at ICIP2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Facial landmark detection is an essential technology for driver status\ntracking and has been in demand for real-time estimations. As a landmark\ncoordinate prediction, heatmap-based methods are known to achieve a high\naccuracy, and Lite-HRNet can achieve a fast estimation. However, with\nLite-HRNet, the problem of a heavy computational cost of the fusion block,\nwhich connects feature maps with different resolutions, has yet to be solved.\nIn addition, the strong output module used in HRNetV2 is not applied to\nLite-HRNet. Given these problems, we propose a novel architecture called\nLite-HRNet Plus. Lite-HRNet Plus achieves two improvements: a novel fusion\nblock based on a channel attention and a novel output module with less\ncomputational intensity using multi-resolution feature maps. Through\nexperiments conducted on two facial landmark datasets, we confirmed that\nLite-HRNet Plus further improved the accuracy in comparison with conventional\nmethods, and achieved a state-of-the-art accuracy with a computational\ncomplexity with the range of 10M FLOPs.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:43:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kato","Sota",""],["Hotta","Kazuhiro",""],["Hatakeyama","Yuhki",""],["Konishi","Yoshinori",""]]}
{"id":"2308.12134","submitter":"Pieter Hartel","authors":"Pieter Hartel, Eljo Haspels, Mark van Staalduinen, Octavio Texeira","title":"DarkDiff: Explainable web page similarity of TOR onion sites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In large-scale data analysis, near-duplicates are often a problem. For\nexample, with two near-duplicate phishing emails, a difference in the\nsalutation (Mr versus Ms) is not essential, but whether it is bank A or B is\nimportant. The state-of-the-art in near-duplicate detection is a black box\napproach (MinHash), so one only knows that emails are near-duplicates, but not\nwhy. We present DarkDiff, which can efficiently detect near-duplicates while\nproviding the reason why there is a near-duplicate. We have developed DarkDiff\nto detect near-duplicates of homepages on the Darkweb. DarkDiff works well on\nthose pages because they resemble the clear web of the past.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:44:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hartel","Pieter",""],["Haspels","Eljo",""],["van Staalduinen","Mark",""],["Texeira","Octavio",""]]}
{"id":"2308.12135","submitter":"Heinrich Freistuhler","authors":"Heinrich Freistuhler","title":"On Phase Boundaries in Relativistic Korteweg Fluids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is the first of several planned papers that study the existence and\nlocal-in-time persistence of phase fronts in the Lorentz invariant Euler\nequations for gases of van der Waals type, aiming at transferring earlier\nresults of Slemrod and of Benzoni-Gavage and collaborators to the context of\nthe theory of relativity. While the later papers will examine more general\nadmissibility criteria, this one uses and extends the author's Lorentz\ninvariant formulation of Korteweg's theory of capillarity, establishing a\nfamily of phase fronts that have a regular heteroclinic profile with respect to\nthe associated Euler-Korteweg equations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:44:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Freistuhler","Heinrich",""]]}
{"id":"2308.12136","submitter":"Tatsuya Goto","authors":"Jorge Antonio Cruz Chapital, Tatsuya Goto and Yusuke Hayashi","title":"Game-theoretic variants of cardinal invariants","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate game-theoretic variants of cardinal invariants of the\ncontinuum. The invariants we treat are the splitting number $\\mathfrak{s}$, the\nreaping number $\\mathfrak{r}$, the bounding number $\\mathfrak{b}$, the\ndominating number $\\mathfrak{d}$ and the additivity number of the null ideal\n$\\operatorname{add}(\\mathsf{null})$. We also consider games, called tallness\ngames, defined according to ideals on $\\omega$ and characterize that each of\nPlayer I and Player II has a winning strategy.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:50:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chapital","Jorge Antonio Cruz",""],["Goto","Tatsuya",""],["Hayashi","Yusuke",""]]}
{"id":"2308.12137","submitter":"Ares Osborn","authors":"Ares Osborn, David J. Armstrong, Jorge Fern\\'andez Fern\\'andez, Henrik\n  Knierim, Vardan Adibekyan, Karen A. Collins, Elisa Delgado-Mena, Malcolm\n  Fridlund, Jo\\~ao Gomes da Silva, Coel Hellier, David G. Jackson, George W.\n  King, Jorge Lillo-Box, Rachel A. Matson, Elisabeth C. Matthews, Nuno C.\n  Santos, S\\'ergio G. Sousa, Keivan G. Stassun, Thiam-Guan Tan, George R.\n  Ricker, Roland Vanderspek, David W. Latham, Sara Seager, Joshua N. Winn, Jon\n  M. Jenkins, Daniel Bayliss, Luke G. Bouma, David R. Ciardi, Kevin I. Collins,\n  Knicole D. Col\\'on, Ian J. M. Crossfield, Olivier D. S. Demangeon, Rodrigo F.\n  D\\'iaz, Caroline Dorn, Xavier Dumusque, Marcelo Aron Fetzner Keniger, Pedro\n  Figueira, Tianjun Gan, Robert F. Goeke, Andreas Hadjigeorghiou, Faith\n  Hawthorn, Ravit Helled, Steve B. Howell, Louise D. Nielsen, Hugh P. Osborn,\n  Samuel N. Quinn, Ramotholo Sefako, Avi Shporer, Paul A. Str{\\o}m, Joseph D.\n  Twicken, Andrew Vanderburg, and Peter J. Wheatley","title":"TOI-332 b: a super dense Neptune found deep within the Neptunian desert","comments":"20 pages, 14 figures, 6 tables, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To date, thousands of planets have been discovered, but there are regions of\nthe orbital parameter space that are still bare. An example is the short period\nand intermediate mass/radius space known as the Neptunian desert, where planets\nshould be easy to find but discoveries remain few. This suggests unusual\nformation and evolution processes are responsible for the planets residing\nhere. We present the discovery of TOI-332 b, a planet with an ultra-short\nperiod of $0.78$ d that sits firmly within the desert. It orbits a K0 dwarf\nwith an effective temperature of $5251 \\pm 71$ K. TOI-332 b has a radius of\n$3.20^{+0.16}_{-0.12}$ R$_{\\oplus}$, smaller than that of Neptune, but an\nunusually large mass of $57.2 \\pm 1.6$ M$_{\\oplus}$. It has one of the highest\ndensities of any Neptune-sized planet discovered thus far at\n$9.6^{+1.1}_{-1.3}$ gcm$^{-3}$. A 4-layer internal structure model indicates it\nlikely has a negligible hydrogen-helium envelope, something only found for a\nsmall handful of planets this massive, and so TOI-332 b presents an interesting\nchallenge to planetary formation theories. We find that photoevaporation cannot\naccount for the mass loss required to strip this planet of the Jupiter-like\nenvelope it would have been expected to accrete. We need to look towards other\nscenarios, such as high-eccentricity migration, giant impacts, or gap opening\nin the protoplanetary disc, to try and explain this unusual discovery.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:51:12 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Osborn","Ares",""],["Armstrong","David J.",""],["Fern\u00e1ndez","Jorge Fern\u00e1ndez",""],["Knierim","Henrik",""],["Adibekyan","Vardan",""],["Collins","Karen A.",""],["Delgado-Mena","Elisa",""],["Fridlund","Malcolm",""],["da Silva","Jo\u00e3o Gomes",""],["Hellier","Coel",""],["Jackson","David G.",""],["King","George W.",""],["Lillo-Box","Jorge",""],["Matson","Rachel A.",""],["Matthews","Elisabeth C.",""],["Santos","Nuno C.",""],["Sousa","S\u00e9rgio G.",""],["Stassun","Keivan G.",""],["Tan","Thiam-Guan",""],["Ricker","George R.",""],["Vanderspek","Roland",""],["Latham","David W.",""],["Seager","Sara",""],["Winn","Joshua N.",""],["Jenkins","Jon M.",""],["Bayliss","Daniel",""],["Bouma","Luke G.",""],["Ciardi","David R.",""],["Collins","Kevin I.",""],["Col\u00f3n","Knicole D.",""],["Crossfield","Ian J. M.",""],["Demangeon","Olivier D. S.",""],["D\u00edaz","Rodrigo F.",""],["Dorn","Caroline",""],["Dumusque","Xavier",""],["Keniger","Marcelo Aron Fetzner",""],["Figueira","Pedro",""],["Gan","Tianjun",""],["Goeke","Robert F.",""],["Hadjigeorghiou","Andreas",""],["Hawthorn","Faith",""],["Helled","Ravit",""],["Howell","Steve B.",""],["Nielsen","Louise D.",""],["Osborn","Hugh P.",""],["Quinn","Samuel N.",""],["Sefako","Ramotholo",""],["Shporer","Avi",""],["Str\u00f8m","Paul A.",""],["Twicken","Joseph D.",""],["Vanderburg","Andrew",""],["Wheatley","Peter J.",""]]}
{"id":"2308.12138","submitter":"Rongjun Qin","authors":"Mostafa Elhashash and Rongjun Qin","title":"Select-and-Combine (SAC): A Novel Multi-Stereo Depth Fusion Algorithm\n  for Point Cloud Generation via Efficient Local Markov Netlets","comments":"6 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many practical systems for image-based surface reconstruction employ a\nstereo/multi-stereo paradigm, due to its ability to scale for large scenes and\nits ease of implementation for out-of-core operations. In this process,\nmultiple and abundant depth maps from stereo matching must be combined and\nfused into a single, consistent, and clean point cloud. However, the noises and\noutliers caused by stereo matching and the heterogenous geometric errors of the\nposes present a challenge for existing fusion algorithms, since they mostly\nassume Gaussian errors and predict fused results based on data from local\nspatial neighborhoods, which may inherit uncertainties from multiple depths\nresulting in lowered accuracy. In this paper, we propose a novel depth fusion\nparadigm, that instead of numerically fusing points from multiple depth maps,\nselects the best depth map per point, and combines them into a single and clean\npoint cloud. This paradigm, called select-and-combine (SAC), is achieved\nthrough modeling the point level fusion using local Markov Netlets, a\nmicro-network over point across neighboring views for depth/view selection,\nfollowed by a Netlets collapse process for point combination. The Markov\nNetlets are optimized such that they can inherently leverage spatial\nconsistencies among depth maps of neighboring views, thus they can address\nerrors beyond Gaussian ones. Our experiment results show that our approach\noutperforms existing depth fusion approaches by increasing the F1 score that\nconsiders both accuracy and completeness by 2.07% compared to the best existing\nmethod. Finally, our approach generates clearer point clouds that are 18% less\nredundant while with a higher accuracy before fusion\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:51:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Elhashash","Mostafa",""],["Qin","Rongjun",""]]}
{"id":"2308.12139","submitter":"Rongjun Qin","authors":"Shuang Song, Rongjun Qin","title":"Mesh Conflation of Oblique Photogrammetric Models using Virtual Cameras\n  and Truncated Signed Distance Field","comments":"5 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conflating/stitching 2.5D raster digital surface models (DSM) into a large\none has been a running practice in geoscience applications, however, conflating\nfull-3D mesh models, such as those from oblique photogrammetry, is extremely\nchallenging. In this letter, we propose a novel approach to address this\nchallenge by conflating multiple full-3D oblique photogrammetric models into a\nsingle, and seamless mesh for high-resolution site modeling. Given two or more\nindividually collected and created photogrammetric meshes, we first propose to\ncreate a virtual camera field (with a panoramic field of view) to incubate\nvirtual spaces represented by Truncated Signed Distance Field (TSDF), an\nimplicit volumetric field friendly for linear 3D fusion; then we adaptively\nleverage the truncated bound of meshes in TSDF to conflate them into a single\nand accurate full 3D site model. With drone-based 3D meshes, we show that our\napproach significantly improves upon traditional methods for model conflations,\nto drive new potentials to create excessively large and accurate full 3D mesh\nmodels in support of geoscience and environmental applications.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:54:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Song","Shuang",""],["Qin","Rongjun",""]]}
{"id":"2308.12140","submitter":"Harsh Narola","authors":"Harsh Narola, Justin Janquart, Quirijn Meijer, K. Haris, and Chris Van\n  Den Broeck","title":"Relative binning for complete gravitational-wave parameter estimation\n  with higher-order modes and precession, and applications to lensing and\n  third-generation detectors","comments":"Minor changes before journal submission, attempt 2","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Once a gravitational wave signal is detected, the measurement of its source\nparameters is important to achieve various scientific goals. This is done\nthrough Bayesian inference, where the analysis cost increases with the model\ncomplexity and the signal duration. For typical binary black hole signals with\nprecession and higher-order modes, one has 15 model parameters. With standard\nmethods, such analyses require at least a few days. For strong gravitational\nwave lensing, where multiple images of the same signal are produced, the joint\nanalysis of two data streams requires 19 parameters, further increasing the\ncomplexity and run time. Moreover, for third generation detectors, due to the\nlowered minimum sensitive frequency, the signal duration increases, leading to\neven longer analysis times. With the increased detection rate, such analyses\ncan then become intractable. In this work, we present a fast and precise\nparameter estimation method relying on relative binning and capable of\nincluding higher-order modes and precession. We also extend the method to\nperform joint Bayesian inference for lensed gravitational wave signals. Then,\nwe compare its accuracy and speed to those of state-of-the-art parameter\nestimation routines by analyzing a set of simulated signals for the current and\nthird generation of interferometers. Additionally, for the first time, we\nanalyze some real events known to contain higher-order modes with relative\nbinning. For binary black hole systems with a total mass larger than $50\\,\nM_{\\odot}$, our method is about 2.5 times faster than current techniques. This\nspeed-up increases for lower masses, with the analysis time being reduced by a\nfactor of 10 on average. In all cases, the recovered posterior probability\ndistributions for the parameters match those found with traditional techniques.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:55:26 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 17:52:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Narola","Harsh",""],["Janquart","Justin",""],["Meijer","Quirijn",""],["Haris","K.",""],["Broeck","Chris Van Den",""]]}
{"id":"2308.12141","submitter":"Jie Zhang","authors":"Zhe Lei, Jie Zhang, Jingtao Li, Weiming Zhang, and Nenghai Yu","title":"Aparecium: Revealing Secrets from Physical Photographs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Watermarking is a crucial tool for safeguarding copyrights and can serve as a\nmore aesthetically pleasing alternative to QR codes. In recent years,\nwatermarking methods based on deep learning have proved superior robustness\nagainst complex physical distortions than traditional watermarking methods.\nHowever, they have certain limitations that render them less effective in\npractice. For instance, current solutions necessitate physical photographs to\nbe rectangular for accurate localization, cannot handle physical bending or\nfolding, and require the hidden area to be completely captured at a close\ndistance and small angle. To overcome these challenges, we propose a novel deep\nwatermarking framework dubbed \\textit{Aparecium}. Specifically, we preprocess\nsecrets (i.e., watermarks) into a pattern and then embed it into the cover\nimage, which is symmetrical to the final decoding-then-extracting process. To\ncapture the watermarked region from complex physical scenarios, a locator is\nalso introduced. Besides, we adopt a three-stage training strategy for training\nconvergence. Extensive experiments demonstrate that \\textit{Aparecium} is not\nonly robust against different digital distortions, but also can resist various\nphysical distortions, such as screen-shooting and printing-shooting, even in\nsevere cases including different shapes, curvature, folding, incompleteness,\nlong distances, and big angles while maintaining high visual quality.\nFurthermore, some ablation studies are also conducted to verify our design.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:56:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lei","Zhe",""],["Zhang","Jie",""],["Li","Jingtao",""],["Zhang","Weiming",""],["Yu","Nenghai",""]]}
{"id":"2308.12142","submitter":"Agostina Fil\\'ocomo","authors":"A. Fil\\'ocomo, J. F. Albacete Colombo, E. Mestre, L. J. Pellizza and\n  J. A. Combi","title":"$\\gamma$-ray detection from occasional flares in T Tauri stars of NGC\n  2071. I. Observational connection","comments":"5 pages, 4 figures","journal-ref":"Volume 525, Issue 2, October 2023, Pages 1726 1730","doi":"10.1093/mnras/stad2029","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  NGC 2071 is a star-forming region that overlaps with three $\\gamma$-ray\nsources detected by the Fermi Space Telescope. We propose that strong flare\nactivity in T Tauri stars could produce $\\gamma$-ray emission in a way that\nmakes them a counterpart to some unidentified sources detected by the Large\nArea Telescope aboard the Fermi satellite. We have performed a spectral and\ntemporal analysis for two Fermi data sets: the first 2 yr and the entire 14 yr\nof observations. We have found that the $\\gamma$-ray source is detectable at\n3.2$\\sigma$ above the background at energies above 100 GeV during the first 2\nyr of observation. The analysis of the expected frequency of the highest energy\nflares occurring in T Tauri stars is consistent with our estimate. In addition,\nwe have determined the minimum energy of the flare that would produce\n$\\gamma$-ray emission, which is $\\sim 5 \\times 10^{37}$ erg. This agreement\nbecomes a hard observational constraint supporting previous hypotheses about\nrare flares as the origin of unidentified $\\gamma$-ray sources in star-forming\nregions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:59:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fil\u00f3como","A.",""],["Colombo","J. F. Albacete",""],["Mestre","E.",""],["Pellizza","L. J.",""],["Combi","J. A.",""]]}
{"id":"2308.12143","submitter":"Wenjie Fu","authors":"Wenjie Fu, Huandong Wang, Chen Gao, Guanghua Liu, Yong Li, Tao Jiang","title":"A Probabilistic Fluctuation based Membership Inference Attack for\n  Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Membership Inference Attack (MIA) identifies whether a record exists in a\nmachine learning model's training set by querying the model. MIAs on the\nclassic classification models have been well-studied, and recent works have\nstarted to explore how to transplant MIA onto generative models. Our\ninvestigation indicates that existing MIAs designed for generative models\nmainly depend on the overfitting in target models. However, overfitting can be\navoided by employing various regularization techniques, whereas existing MIAs\ndemonstrate poor performance in practice. Unlike overfitting, memorization is\nessential for deep learning models to attain optimal performance, making it a\nmore prevalent phenomenon. Memorization in generative models leads to an\nincreasing trend in the probability distribution of generating records around\nthe member record. Therefore, we propose a Probabilistic Fluctuation Assessing\nMembership Inference Attack (PFAMI), a black-box MIA that infers memberships by\ndetecting these trends via analyzing the overall probabilistic fluctuations\naround given records. We conduct extensive experiments across multiple\ngenerative models and datasets, which demonstrate PFAMI can improve the attack\nsuccess rate (ASR) by about 27.9% when compared with the best baseline.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:00:58 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 02:42:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fu","Wenjie",""],["Wang","Huandong",""],["Gao","Chen",""],["Liu","Guanghua",""],["Li","Yong",""],["Jiang","Tao",""]]}
{"id":"2308.12144","submitter":"Kazuhiro Kanagawa D","authors":"Kazuhiro D. Kanagawa, Tomohiro Ono, and Munetake Momose","title":"Kinematic signatures of a low-mass planet with a moderately inclined\n  orbit in a protoplanetary disk","comments":"Accepted for publication in PASJ, 32 pages, 20 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A planet embedded in a protoplanetary disk produces a gap by disk-planet\ninteraction. It also generates velocity perturbation of gas, which can also be\nobserved as deviations from the Keplerian rotation in the channel map of\nmolecular line emission, called kinematic planetary features. These observed\nsignatures provide clues to determine the mass of the planet. We investigated\nthe features induced by the planet with an inclined orbit through\nthree-dimensional hydrodynamic simulations. We found that a smaller planet,\nwith the inclination being $\\sim 10^{\\circ}$ -- $20^{\\circ}$, can produce\nkinematic features as prominent as those induced by the massive coplanar\nplanet. Despite the kinematic features being similar, the gap is shallower and\nnarrower as compared with the case in which the kinematic features are formed\nby the coplanar planet. We also found that the kinematic features induced by\nthe inclined planet were fainter for rarer CO isotopologues because the\nvelocity perturbation is weaker at the position closer to the midplane, which\nwas different in the case with a coplanar massive planet. This dependence on\nthe isotopologues is distinguished if the planet has the inclined orbit. We\ndiscussed two observed kinematic features in the disk of HD 163296. We\nconcluded that the kink observed at 220 au can be induced by the inclined\nplanet, while the kink at 67 au is consistent to that induced by the coplanar\nplanet.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:01:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kanagawa","Kazuhiro D.",""],["Ono","Tomohiro",""],["Momose","Munetake",""]]}
{"id":"2308.12145","submitter":"Pietro Benedusi","authors":"Pietro Benedusi, Paola Ferrari, Marie Rognes, Stefano Serra-Capizzano","title":"Modeling excitable cells with the EMI equations: spectral analysis and\n  iterative solution strategy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we are interested in solving large linear systems stemming from\nthe Extra-Membrane-Intra (EMI) model, which is employed for simulating\nexcitable tissues at a cellular scale. After setting the related systems of\npartial differential equations (PDEs) equipped with proper boundary conditions,\nwe provide numerical approximation schemes for the EMI PDEs and focus on the\nresulting large linear systems. We first give a relatively complete spectral\nanalysis using tools from the theory of Generalized Locally Toeplitz matrix\nsequences. The obtained spectral information is used for designing appropriate\n(preconditioned) Krylov solvers. We show, through numerical experiments, that\nthe presented solution strategy is robust w.r.t. problem and discretization\nparameters, efficient and scalable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:01:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Benedusi","Pietro",""],["Ferrari","Paola",""],["Rognes","Marie",""],["Serra-Capizzano","Stefano",""]]}
{"id":"2308.12146","submitter":"Lucas Winter","authors":"Lucas Winter, Oded Zilberberg","title":"Fractional quantum Hall edge polaritons","comments":"20 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is commonly believed that light cannot couple to the collective\nexcitations of the fractional quantum Hall effect (FQHE). This assumption\nrelies on Kohn's theorem that states that electron-electron interactions\ndecouple from homogeneous electromagnetic fields due to galilean invariance.\nHere, we demonstrate that the existence of an edge breaks Kohn's theorem, and\nenables coupling of cavity light to the plasmonic edge modes of the FQHE. We\nderive the coupling using the FQHE bulk-boundary correspondence and predict the\nformation of experimentally detectable plasmon polaritons. We find that a\nsingle cavity mode leaves the system's topological protection intact.\nInterestingly, however, a multimode cavity mediates plasmon backscattering, and\neffectively transforms the edges of the 2D FQHE into a 1D wire. Such\ncavity-meditated nonlocal backscattering bodes the breakdown of the topological\nprotection in the regime of ultra-strong photon-plasmon coupling. Our\nanalytical framework and photoelectric findings pave the way for investigating\nthe topological order of the FQHE via optical spectroscopic probes and provide\nnew opportunities to control FQHE edge excitations using light.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:04:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Winter","Lucas",""],["Zilberberg","Oded",""]]}
{"id":"2308.12147","submitter":"Tiziano M\\\"uller","authors":"Tiziano M\\\"uller, Nina Mujkanovic, Juan J. Durillo, Nicolay Hammer","title":"Survey of adaptive containerization architectures for HPC","comments":"11 pages, 5 tables, 1 figure, submitted to the 5th International\n  Workshop on Containers and New Orchestration Paradigms for Isolated\n  Environments in HPC (CANOPIE-HPC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Containers offer an array of advantages that benefit research reproducibility\nand portability across groups and systems. As container tools mature, container\nsecurity improves, and High-performance computing (HPC) and cloud system tools\nconverge, supercomputing centers are increasingly integrating containers in\ntheir workflows. The technology selection process requires sufficient\ninformation on the diverse tools available, yet the majority of research into\ncontainers still focuses on cloud environments. We consider an adaptive\ncontainerization approach, with a focus on accelerating the deployment of\napplications and workflows on HPC systems using containers. To this end, we\ndiscuss the specific HPC requirements regarding container tools, and analyze\nthe entire containerization stack, including container engines and registries,\nin-depth. Finally, we consider various orchestrator and HPC workload manager\nintegration scenarios.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:05:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["M\u00fcller","Tiziano",""],["Mujkanovic","Nina",""],["Durillo","Juan J.",""],["Hammer","Nicolay",""]]}
{"id":"2308.12148","submitter":"Strohmaier Alexander","authors":"Alexander Strohmaier and Steve Zelditch","title":"Heat and Wave kernel expansions for stationary spacetimes","comments":"18 pages, fixed some typos","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP gr-qc math-ph math.AP math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The generator of time-translations on the solution space of the wave equation\non stationary spacetimes specialises to the square root of the Laplacian on\nRiemannian manifolds when the spacetime is ultrastatic. Its spectral analysis\ntherefore constitutes a generalization of classical spectral geometry. If the\nspacetime is spatially compact the spectrum is discrete and admits a wave-trace\nexpansion at time zero. A Weyl law for the eigenvalues and a wave-trace formula\nwas shown in a previous paper and related to the geometry of the space of\nnull-geodesics. In this paper we investigate the relation to heat kernel\ncoefficients and residues of zeta functions in this context and compute the\nsecond non-zero term in the wave-trace expansion. This second coefficient is an\nanalogue in the category of stationary spacetimes of the second heat kernel\ncoefficient of the Laplace operator. The general formula is quite involved but\nreduces to the usual term involving the scalar curvature when specialised to\nultra-static spacetimes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:05:14 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 09:10:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Strohmaier","Alexander",""],["Zelditch","Steve",""]]}
{"id":"2308.12149","submitter":"Fraser Daly","authors":"Fraser Daly, Matthias Schulte, Seva Shneer","title":"First passage percolation on Erd\\H{o}s-R\\'{e}nyi graphs with general\n  weights","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider first passage percolation on the Erd\\H{o}s-R\\'{e}nyi graph with\n$n$ vertices in which each pair of distinct vertices is connected independently\nby an edge with probability $\\lambda/n$ for some $\\lambda>1$. The edges of the\ngraph are given non-negative i.i.d. weights with a non-degenerate distribution\nsuch that the probability of zero is not too large. We consider the paths with\nsmall total weight between two distinct typical vertices and analyse the joint\nbehaviour of the numbers of edges on such paths, the so-called hopcounts, and\nthe total weights of these paths. For $n\\to\\infty$, we show that, after a\nsuitable transformation, the pairs of hopcounts and total weights of these\npaths converge in distribution to a Cox process, i.e., a Poisson process with a\nrandom intensity measure. The random intensity measure is controlled by two\nindependent random variables, whose distribution is the solution of a\ndistributional fixed point equation and is related to branching processes. For\nnon-arithmetic and arithmetic edge weight distributions we observe different\nbehaviour. In particular, we derive the limiting distribution for the minimal\ntotal weight and the corresponding hopcount(s). Our results generalise earlier\nwork of Bhamidi, van der Hofstad and Hooghiemstra, who assume edge weights are\nexponentially distributed. The main tool we employ is the method of moments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:07:19 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Daly","Fraser",""],["Schulte","Matthias",""],["Shneer","Seva",""]]}
{"id":"2308.12150","submitter":"Lai Zhao","authors":"Lai Zhao, Zhaoyi Xu","title":"Destroying the Event Horizon of a Rotating Black-Bounce Black Hole","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a rotating black hole to be nonsingular, it means that there are no\nspacetime singularities at its center. The destruction of the event horizon of\nsuch a rotating black hole is not constrained by the weak cosmic censorship\nconjecture, which may provide possibilities to understand the internal\nstructure of black hole event horizons. In this paper, we investigate the\npossibility of destroying the event horizon of a rotating Black-Bounce black\nhole by considering test particles with high angular momentum and scalar fields\nwith large angular momentum, covering the entire range of the rotating\nBlack-Bounce black hole. We analyze the influence of the parameter m on the\nlikelihood of destroying the event horizon in this spacetime. Our analysis\nreveals that under extreme or near-extreme conditions, the event horizon of\nthis spacetime can potentially be destroyed after the absorption of particles\nenergy and angular momentum, as well as the scattering of scalar fields.\nAdditionally, we find that as the parameter m increases, the event horizon of\nthis spacetime model becomes more susceptible to destruction after the\ninjection of test particles or the scattering of scalar fields.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:08:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhao","Lai",""],["Xu","Zhaoyi",""]]}
{"id":"2308.12151","submitter":"Ryui Kaneko","authors":"Ryui Kaneko, Masaya Kunimi, Ippei Danshita","title":"Quantum many-body scars in the Bose-Hubbard model with a three-body\n  constraint","comments":"6+10 pages, 2+4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We uncover the exact athermal eigenstates in the Bose-Hubbard (BH) model with\na three-body constraint, motivated by the exact construction of quantum\nmany-body scar (QMBS) states in the $S=1$ XY model. These states are generated\nby applying an $\\rm SU(2)$ ladder operator consisting of a linear combination\nof two-particle annihilation operators to the fully occupied state. By using\nthe improved Holstein-Primakoff expansion, we clarify that the QMBS states in\nthe $S=1$ XY model are equivalent to those in the constrained BH model with\nadditional correlated hopping terms. We also find that, in the strong coupling\nlimit of the constrained BH model, the QMBS state exists as the lowest-energy\neigenstate of the effective model in the highest-energy sector. This fact\nenables us to prepare the QMBS states in a certain adiabatic process and opens\nup the possibility of observing them in ultracold-atom experiments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:10:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kaneko","Ryui",""],["Kunimi","Masaya",""],["Danshita","Ippei",""]]}
{"id":"2308.12152","submitter":"Emilio Vital Brazil","authors":"Ronan Amorim, Emilio Vital Brazil, Faramarz Samavati, Mario Costa\n  Sousa","title":"Geo-Sketcher: Rapid 3D Geological Modeling using Geological and\n  Topographic Map Sketches","comments":"21 pages, 30 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The construction of 3D geological models is an essential task in oil/gas\nexploration, development and production. However, it is a cumbersome,\ntime-consuming and error-prone task mainly because of the model's geometric and\ntopological complexity. The models construction is usually separated into\ninterpretation and 3D modeling, performed by different highly specialized\nindividuals, which leads to inconsistencies and intensifies the challenges. In\naddition, the creation of models following geological rules is paramount for\nproperly depicting static and dynamic properties of oil/gas reservoirs. In this\nwork, we propose a sketch-based approach to expedite the creation of valid 3D\ngeological models by mimicking how domain experts interpret geological\nstructures, allowing creating models directly from interpretation sketches. Our\nsketch-based modeler (Geo-Sketcher) is based on sketches of standard 2D\ntopographic and geological maps, comprised of lines, symbols and annotations.\nWe developed a graph-based representation to enable (1) the automatic\ncomputation of the relative ages of rock series and layers, and (2) the\nembedding of specific geological rules directly in the sketching. We introduce\nthe use of Hermite-Birkhoff Radial Basis Functions to interpolate the\ngeological map constraints, and demonstrate the capabilities of our approach\nwith a variety of results with different levels of complexity.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 17:01:36 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Amorim","Ronan",""],["Brazil","Emilio Vital",""],["Samavati","Faramarz",""],["Sousa","Mario Costa",""]]}
{"id":"2308.12153","submitter":"Koshy George","authors":"Koshy George","title":"Deep optical imaging of star-forming blue early-type galaxies: Color map\n  structures and faint features indicative of recent mergers","comments":"Accepted in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blue early-type galaxies with galaxy-scale ongoing star formation are\ninteresting targets in order to understand the stellar mass buildup in\nelliptical and S0 galaxies in the local Universe. We study the star-forming\npopulation of blue early-type galaxies to understand the origin of star\nformation in these otherwise red and dead stellar systems. The legacy survey\nimaging data taken with the dark energy camera in the $g$, $r$, and $z$ bands\nfor 55 star-forming blue early-type galaxies were examined, and $g-r$ color\nmaps were created. We identified low surface brightness features near 37\ngalaxies, faint-level interaction signatures near 15 galaxies, and structures\nindicative of recent merger activity in the optical color maps of all 55\ngalaxies. These features are not visible in the shallow Sloan Digital Sky\nSurvey imaging data in which these galaxies were originally identified. Low\nsurface brightness features found around galaxies could be remnants of recent\nmerger events. The star-forming population of blue early-type galaxies could be\npost-merger systems that are expected to be the pathway for the formation of\nelliptical galaxies. We hypothesize that the star-forming population of blue\nearly-type galaxies is a stage in the evolution of early-type galaxies. The\nmerger features will eventually disappear, fuel for star formation will cease,\nand the galaxy will move to the passive population of normal early-type\ngalaxies.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:43:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["George","Koshy",""]]}
{"id":"2308.12154","submitter":"Yuma Narita","authors":"Yuma Narita, Fuminobu Takahashi, and Wen Yin","title":"QCD Axion Hybrid Inflation","comments":"45 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"TU-1207","categories":"hep-ph astro-ph.CO gr-qc hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When the inflaton is coupled to the gluon Chern-Simons term for successful\nreheating, mixing between the inflaton and the QCD axion is generally expected\ngiven the solution of the strong CP problem by the QCD axion. This is\nparticularly natural if the inflaton is a different, heavier axion. We propose\na scenario in which the QCD axion plays the role of the inflaton by mixing with\nheavy axions. In particular, if the energy scale of inflation is lower than the\nQCD scale, a hybrid inflation is realized where the QCD axion plays the role of\nthe inflaton in early stages. We perform detailed numerical calculations to\ntake account of the mixing effects. Interestingly, the initial misalignment\nangle of the QCD axion, which is usually a free parameter, is determined by the\ninflaton dynamics. It is found to be close to $\\pi$ in simple models. This is\nthe realization of the pi-shift inflation proposed in previous literature, and\nit shows that QCD axion dark matter and inflation can be closely related. The\nheavy axion may be probed by future accelerator experiments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:17:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Narita","Yuma",""],["Takahashi","Fuminobu",""],["Yin","Wen",""]]}
{"id":"2308.12155","submitter":"Anjan Kar","authors":"Anjan Kar and Sayan Kar (Indian Institute of Technology Kharagpur,\n  India)","title":"Novel regular black holes: geometry, source and shadow","comments":"30 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a two-parameter, static and spherically symmetric regular\ngeometry, which, for specific parameter values represents a regular black hole.\nThe matter required to support such spacetimes within the framework of General\nRelativity (GR), is found to violate the energy conditions, though not in the\nentire domain of the radial coordinate. A particular choice of the parameters\nreduces the regular black hole to a singular, mutated Reissner-Nordstr\\\"om\ngeometry. It also turns out that our regular black hole is geodesically\ncomplete. Fortunately, despite energy condition violation, we are able to\nconstruct a viable source, within the framework of GR coupled to matter, for\nour regular geometry. The source term involves a nonlinear magnetic monopole in\na chosen version of nonlinear electrodynamics. Finally, we obtain the shadow\nprofile of the regular black hole and try to estimate the metric parameters\nusing some recent observational results from the EHT collaboration.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:17:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kar","Anjan","","Indian Institute of Technology Kharagpur,\n  India"],["Kar","Sayan","","Indian Institute of Technology Kharagpur,\n  India"]]}
{"id":"2308.12156","submitter":"Liangfei Zhang","authors":"Liangfei Zhang, Yifei Qian, Ognjen Arandjelovic, Anthony Zhu","title":"Multimodal Latent Emotion Recognition from Micro-expression and\n  Physiological Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper discusses the benefits of incorporating multimodal data for\nimproving latent emotion recognition accuracy, focusing on micro-expression\n(ME) and physiological signals (PS). The proposed approach presents a novel\nmultimodal learning framework that combines ME and PS, including a 1D separable\nand mixable depthwise inception network, a standardised normal distribution\nweighted feature fusion method, and depth/physiology guided attention modules\nfor multimodal learning. Experimental results show that the proposed approach\noutperforms the benchmark method, with the weighted fusion method and guided\nattention modules both contributing to enhanced performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:17:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zhang","Liangfei",""],["Qian","Yifei",""],["Arandjelovic","Ognjen",""],["Zhu","Anthony",""]]}
{"id":"2308.12157","submitter":"Anirudh Mittal","authors":"Anirudh Mittal, Timo Schick, Mikel Artetxe, Jane Dwivedi-Yu","title":"Evaluation of Faithfulness Using the Longest Supported Subsequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As increasingly sophisticated language models emerge, their trustworthiness\nbecomes a pivotal issue, especially in tasks such as summarization and\nquestion-answering. Ensuring their responses are contextually grounded and\nfaithful is challenging due to the linguistic diversity and the myriad of\npossible answers. In this paper, we introduce a novel approach to evaluate\nfaithfulness of machine-generated text by computing the longest noncontinuous\nsubstring of the claim that is supported by the context, which we refer to as\nthe Longest Supported Subsequence (LSS). Using a new human-annotated dataset,\nwe finetune a model to generate LSS. We introduce a new method of evaluation\nand demonstrate that these metrics correlate better with human ratings when LSS\nis employed, as opposed to when it is not. Our proposed metric demonstrates an\n18% enhancement over the prevailing state-of-the-art metric for faithfulness on\nour dataset. Our metric consistently outperforms other metrics on a\nsummarization dataset across six different models. Finally, we compare several\npopular Large Language Models (LLMs) for faithfulness using this metric. We\nrelease the human-annotated dataset built for predicting LSS and our fine-tuned\nmodel for evaluating faithfulness.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:18:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mittal","Anirudh",""],["Schick","Timo",""],["Artetxe","Mikel",""],["Dwivedi-Yu","Jane",""]]}
{"id":"2308.12158","submitter":"Lei Si","authors":"Lei Si, Guoning Chen","title":"A Visualization System for Hexahedral Mesh Quality Study","comments":"Accepted by IEEE VIS 2023 Short Papers and will be published on IEEE\n  Xplore. Paper contains 4 pages, and 1 reference page. Supplemental includes 4\n  pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we introduce a new 3D hex mesh visual analysis system that\nemphasizes poor-quality areas with an aggregated glyph, highlights overlapping\nelements, and provides detailed boundary error inspection in three forms. By\nsupporting multi-level analysis through multiple views, our system effectively\nevaluates various mesh models and compares the performance of mesh generation\nand optimization algorithms for hexahedral meshes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:18:56 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 15:10:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Si","Lei",""],["Chen","Guoning",""]]}
{"id":"2308.12159","submitter":"Rui Song","authors":"Rui Song, Saihua Liu, Jianping Ou","title":"On bicyclic graphs with maximal Graovac-Ghorbani index","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graovac-Ghorbani index is a new version of the atom-bond connectivity index.\nD. Pacheco et al. [D. Pacheco, L. de Lima, C. S. Oliveira, On the\nGraovac-Ghorbani Index for Bicyclic Graph with No Pendent Vertices, MATCH\nCommun. Math. Comput. Chem. 86 (2021) 429-448] conjectured a sharp lower and\nupper bounds to the Graovac-Ghorbani index for all bicyclic graphs. Motivated\nby their nice work, in this paper we determine the maximal Graovac-Ghorbani\nindex of bicyclic graphs and characterize the corresponding extremal graphs,\nwhich solves one of their Conjectures.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:20:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Song","Rui",""],["Liu","Saihua",""],["Ou","Jianping",""]]}
{"id":"2308.12160","submitter":"Alexander Bensberg","authors":"A. Bensberg, J. Kobus, S. Wolf","title":"The potential of VLTI observations for the study of circumstellar disk\n  variability","comments":"Accepted for publication in Astronomy & Astrophysics. 14 pages, 15\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context. A characteristic feature of young stellar objects is their\nvariability, which is caused by a variety of different physical processes.\nHigh-resolution interferometric observations in the near- and mid-infrared\nwavelength ranges spanning multiple epochs allow the detailed study of these\nprocesses.\n  Aims. We aim at investigating the expected variations of the interferometric\nobservables connected to changes in the measured photometric fluxes of a\ntypical variable accreting central young stellar object with a circumstellar\ndisk.\n  Methods. We calculated visibilities and closure phases as well as the\nphotometric flux of brightness distributions obtained using 3D Monte Carlo\nradiative transfer simulations for a model of a circumstellar disk with an\naccreting central star.\n  Results. Changes in the accretion luminosity of the central object, that is,\nan accreting pre-main-sequence star, can lead to significant variations in the\nvisibility and closure phase of the star-disk system measured with instruments\nat the Very Large Telescope Interferometer (VLTI) that can be related to\nchanges in the photometric flux. Taking into account additional effects due to\nbaseline variation, interferometric observations can provide valuable\ncontributions to the understanding of the underlying processes. Additionally,\nwe provide the web application VLTI B-VAR that allows the impact of the hour\nangle on the visibility and closure phase for customized intensity maps to be\nestimated.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:21:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bensberg","A.",""],["Kobus","J.",""],["Wolf","S.",""]]}
{"id":"2308.12161","submitter":"Qi Zhang","authors":"Rishabh Gupta, Qi Zhang","title":"Data-driven decision-focused surrogate modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the concept of decision-focused surrogate modeling for solving\ncomputationally challenging nonlinear optimization problems in real-time\nsettings. The proposed data-driven framework seeks to learn a simpler, e.g.\nconvex, surrogate optimization model that is trained to minimize the decision\nprediction error, which is defined as the difference between the optimal\nsolutions of the original and the surrogate optimization models. The learning\nproblem, formulated as a bilevel program, can be viewed as a data-driven\ninverse optimization problem to which we apply a decomposition-based solution\nalgorithm from previous work. We validate our framework through numerical\nexperiments involving the optimization of common nonlinear chemical processes\nsuch as chemical reactors, heat exchanger networks, and material blending\nsystems. We also present a detailed comparison of decision-focused surrogate\nmodeling with standard data-driven surrogate modeling methods and demonstrate\nthat our approach is significantly more data-efficient while producing simple\nsurrogate models with high decision prediction accuracy.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:23:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gupta","Rishabh",""],["Zhang","Qi",""]]}
{"id":"2308.12162","submitter":"Alfons Laarman","authors":"Max Blankestijn, Alfons Laarman","title":"Incremental Property Directed Reachability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SC cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Property Directed Reachability (PDR) is a widely used technique for formal\nverification of hardware and software systems. This paper presents an\nincremental version of PDR (IPDR), which enables the automatic verification of\nsystem instances of incremental complexity. The proposed algorithm leverages\nthe concept of incremental SAT solvers to reuse verification results from\npreviously verified system instances, thereby accelerating the verification\nprocess. The new algorithm supports both incremental constraining and relaxing;\ni.e., starting from an over-constrained instance that is gradually relaxed.\n  To validate the effectiveness of the proposed algorithm, we implemented IPDR\nand experimentally evaluate it on two different problem domains. First, we\nconsider a circuit pebbling problem, where the number of pebbles is both\nconstrained and relaxed. Second, we explore parallel program instances,\nprogressively increasing the allowed number of interleavings. The experimental\nresults demonstrate significant performance improvements compared to Z3's PDR\nimplementation SPACER. Experiments also show that the incremental approach\nsucceeds in reusing a substantial amount of clauses between instances, for both\nthe constraining and relaxing algorithm.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:23:48 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Blankestijn","Max",""],["Laarman","Alfons",""]]}
{"id":"2308.12163","submitter":"Sucheng Ren","authors":"Ziyu Yang, Sucheng Ren, Zongwei Wu, Nanxuan Zhao, Junle Wang, Jing\n  Qin, Shengfeng He","title":"NPF-200: A Multi-Modal Eye Fixation Dataset and Method for\n  Non-Photorealistic Videos","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-photorealistic videos are in demand with the wave of the metaverse, but\nlack of sufficient research studies. This work aims to take a step forward to\nunderstand how humans perceive non-photorealistic videos with eye fixation\n(\\ie, saliency detection), which is critical for enhancing media production,\nartistic design, and game user experience. To fill in the gap of missing a\nsuitable dataset for this research line, we present NPF-200, the first\nlarge-scale multi-modal dataset of purely non-photorealistic videos with eye\nfixations. Our dataset has three characteristics: 1) it contains soundtracks\nthat are essential according to vision and psychological studies; 2) it\nincludes diverse semantic content and videos are of high-quality; 3) it has\nrich motions across and within videos. We conduct a series of analyses to gain\ndeeper insights into this task and compare several state-of-the-art methods to\nexplore the gap between natural images and non-photorealistic data.\nAdditionally, as the human attention system tends to extract visual and audio\nfeatures with different frequencies, we propose a universal frequency-aware\nmulti-modal non-photorealistic saliency detection model called NPSNet,\ndemonstrating the state-of-the-art performance of our task. The results uncover\nstrengths and weaknesses of multi-modal network design and multi-domain\ntraining, opening up promising directions for future works. {Our dataset and\ncode can be found at \\url{https://github.com/Yangziyu/NPF200}}.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:25:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Ziyu",""],["Ren","Sucheng",""],["Wu","Zongwei",""],["Zhao","Nanxuan",""],["Wang","Junle",""],["Qin","Jing",""],["He","Shengfeng",""]]}
{"id":"2308.12164","submitter":"Morgan Pierre","authors":"Dieunel Dor and Morgan Pierre","title":"A robust family of exponential attractors for a linear time\n  discretization of the Cahn-Hilliard equation with a source term","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider a linear implicit-explicit (IMEX) time discretization of the\nCahn-Hilliard equation with a source term, endowed with Dirichlet boundary\nconditions. For every time step small enough, we build an exponential attractor\nof the discrete-in-time dynamical system associated to the discretization. We\nprove that, as the time step tends to 0, this attractor converges for the\nsymmmetric Hausdorff distance to an exponential attractor of the\ncontinuous-in-time dynamical system associated with the PDE. We also prove that\nthe fractal dimension of the exponential attractor (and consequently, of the\nglobal attractor) is bounded by a constant independent of the time step. The\nresults also apply to the classical Cahn-Hilliard equation with Neumann\nboundary conditions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:28:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dor","Dieunel",""],["Pierre","Morgan",""]]}
{"id":"2308.12165","submitter":"Leoni Carla Wirth","authors":"Dominic Schuhmacher and Leoni Carla Wirth","title":"Assignment Based Metrics for Attributed Graphs","comments":"53 pages, 7 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the Graph TT (GTT) and Graph OSPA (GOSPA) metrics based on\noptimal assignment, which allow us to compare not only the edge structures but\nalso general vertex and edge attributes of graphs of possibly different sizes.\nWe argue that this provides an intuitive and universal way to measure the\ndistance between finite simple attributed graphs. Our paper discusses useful\nequivalences and inequalities as well as the relation of the new metrics to\nvarious existing quantifications of distance between graphs. By deriving a\nrepresentation of a graph as a pair of point processes, we are able to\nformulate and study a new type of (finite) random graph convergence and\ndemonstrate its applicability using general point processes of vertices with\nindependent random edges. Computational aspects of the new metrics are studied\nin the form of an exact and two heuristic algorithms that are derived from\nprevious algorithms for similar tasks. As an application, we perform a\nstatistical test based on the GOSPA metric for functional differences in\nolfactory neurons of Drosophila flies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:31:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Schuhmacher","Dominic",""],["Wirth","Leoni Carla",""]]}
{"id":"2308.12166","submitter":"Daniel Orr","authors":"Daniel Orr and Mark Shimozono","title":"Wreath Macdonald polynomials, a survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wreath Macdonald polynomials arise from the geometry of $\\Gamma$-fixed loci\nof Hilbert schemes of points in the plane, where $\\Gamma$ is a finite cyclic\ngroup of order $r\\ge 1$. For $r=1$, they recover the classical (modified)\nMacdonald symmetric functions through Haiman's geometric realization of these\nfunctions. The existence, integrality, and positivity of wreath Macdonald\npolynomials for $r>1$ was conjectured by Haiman and first proved in work of\nBezrukavnikov and Finkelberg by means of an equivalence of derived categories.\nDespite the power of this approach, a lack of explicit tools providing direct\naccess to wreath Macdonald polynomials -- in the spirit of Macdonald's original\nworks -- has limited progress in the subject.\n  A recent result of Wen provides a remarkable set of such tools, packaged in\nthe representation theory of quantum toroidal algebras. In this article, we\nsurvey Wen's result along with the basic theory of wreath Macdonald\npolynomials, including its geometric foundations and the role of bigraded\nreflection functors in the construction of wreath analogs of the $\\nabla$\noperator. We also formulate new conjectures on the values of important\nconstants arising in the theory of wreath Macdonald $P$-polynomials. A variety\nof examples are used to illustrate these objects and constructions throughout\nthe paper.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:32:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Orr","Daniel",""],["Shimozono","Mark",""]]}
{"id":"2308.12167","submitter":"Enrico Trebeschi","authors":"Enrico Trebeschi","title":"Constant mean curvature hypersurfaces in Anti-de Sitter space","comments":"42 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study spacelike entire constant mean curvature hypersurfaces in Anti-de\nSitter space of any dimension. First, we give a classification result with\nrespect to their asymptotic boundary, namely we show that every admissible\nsphere $\\Lambda$ is the boundary of a unique such hypersurface, for any given\nvalue $H$ of the mean curvature. We also demonstrate that, as $H$ varies in\n$\\mathbb{R}$, these hypersurfaces analytically foliate the invisible domain of\n$\\Lambda$. Finally, we extend Cheng-Yau Theorem to the Anti-de Sitter space,\nwhich establishes the completeness of any entire constant mean curvature\nhypersurface.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:33:55 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Trebeschi","Enrico",""]]}
{"id":"2308.12168","submitter":"Mutyyba Asghar","authors":"Mutyyba Asghar (1), Ahmad Raza Shahid (1), Akhtar Jamil (1), Kiran\n  Aftab (2) and Syed Ather Enam (2) ((1) National University of Computer and\n  Emerging Sciences, (2) The Aga Khan University)","title":"Tumor-Centered Patching for Enhanced Medical Image Segmentation","comments":"20 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The realm of medical image diagnosis has advanced significantly with the\nintegration of computer-aided diagnosis and surgical systems. However,\nchallenges persist, particularly in achieving precise image segmentation. While\ndeep learning techniques show potential, obstacles like limited resources, slow\nconvergence, and class imbalance impede their effectiveness. Traditional\npatch-based methods, though common, struggle to capture intricate tumor\nboundaries and often lead to redundant samples, compromising computational\nefficiency and feature quality. To tackle these issues, this research\nintroduces an innovative approach centered on the tumor itself for patch-based\nimage analysis. This novel tumor-centered patching method aims to address the\nclass imbalance and boundary deficiencies, enabling focused and accurate tumor\nsegmentation. By aligning patches with the tumor's anatomical context, this\ntechnique enhances feature extraction accuracy and reduces computational load.\nExperimental results demonstrate improved class imbalance, with segmentation\nscores of 0.78, 0.76, and 0.71 for whole, core, and enhancing tumors,\nrespectively using a lightweight simple U-Net. This approach shows potential\nfor enhancing medical image segmentation and improving computer-aided diagnosis\nsystems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:35:03 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Asghar","Mutyyba",""],["Shahid","Ahmad Raza",""],["Jamil","Akhtar",""],["Aftab","Kiran",""],["Enam","Syed Ather",""]]}
{"id":"2308.12169","submitter":"Narayan Rana","authors":"Sudeepan Datta, Narayan Rana, V. Ravindran, Ratan Sarkar","title":"Three loop QCD corrections to the heavy-light form factors in the\n  color-planar limit","comments":"72 pages; Ancillary Mathematica notebook (result.nb) attached","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the analytic expressions for the color-planar contributions to the\nheavy-light form factors at three loops in perturbative QCD. These form factors\nplay an important role in the precision predictions of various observables in\ntop quark and flavour physics. We compute the master integrals using the method\nof differential equations. We perform the ultraviolet renormalization for all\nthe appearing fields and parameters. The analytic results for the renormalized\nform factors are expressed in terms of generalized harmonic polylogarithms. We\nalso study the Sudakov behaviour of these form factors in the asymptotic limit,\nwhich enables us to obtain the complete logarithmic three-loop and partial\nfour-loop contributions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:37:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Datta","Sudeepan",""],["Rana","Narayan",""],["Ravindran","V.",""],["Sarkar","Ratan",""]]}
{"id":"2308.12170","submitter":"Sudipta Chattopadhyay","authors":"Sudipta Chattopadhyay, Srikant Sukumar, Vivek Natarajan","title":"Model reference adaptive control for state and input constrained linear\n  systems","comments":"14 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  State and input constraints are ubiquitous in all engineering systems. In\nthis article, we derive adaptive controllers for uncertain linear systems under\npre-specified state and input constraints. Several modifications of the model\nreference adaptive control (MRAC) framework have been proposed to address input\nconstraints in uncertain linear systems. Considering the infeasibility of\narbitrary reference trajectories, reference modification has been implemented\nin the case of input constraints in literature. The resulting conditions on the\nreference and input signals are difficult to verify online. Similar results on\nstate and input constraints together have also been proposed, albeit resulting\nin more complex and unverifiable conditions on the control. The primary\nobjective of this article is therefore to account for state and input\nconstraints in uncertain linear systems by providing easily verifiable\nconditions on the control and reference. A combination of reference\nmodification and barrier Lyapunov methods in adaptive control are employed to\narrive at these results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:41:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chattopadhyay","Sudipta",""],["Sukumar","Srikant",""],["Natarajan","Vivek",""]]}
{"id":"2308.12171","submitter":"Dong Wang","authors":"Dong Wang, Juan-Ying Zhao, Ya-Chao Wang, Liang-Jiang Zhou, and Yi-Bo\n  Zhao","title":"Quantum secured LiDAR with Gaussian modulated coherent states","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LiDAR systems that rely on classical signals are susceptible to\nintercept-and-recent spoofing attacks, where a target attempts to avoid\ndetection. To address this vulnerability, we propose a quantum-secured LiDAR\nprotocol that utilizes Gaussian modulated coherent states for both range\ndetermination and spoofing attack detection. By leveraging the Gaussian nature\nof the signals, the LiDAR system can accurately determine the range of the\ntarget through cross-correlation analysis. Additionally, by estimating the\nexcess noise of the LiDAR system, the spoofing attack performed by the target\ncan be detected, as it can introduce additional noise to the signals. We have\ndeveloped a model for target detection and security check, and conducted\nnumerical simulations to evaluate the Receiver Operating Characteristic (ROC)\nof the LiDAR system. The results indicate that an intercept-and-recent spoofing\nattack can be detected with a high probability at a low false-alarm rate.\nFurthermore, the proposed method can be implemented using currently available\ntechnology, highlighting its feasibility and practicality in real-world\napplications.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:45:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Dong",""],["Zhao","Juan-Ying",""],["Wang","Ya-Chao",""],["Zhou","Liang-Jiang",""],["Zhao","Yi-Bo",""]]}
{"id":"2308.12172","submitter":"Gregory Kozyreff","authors":"Gregory Kozyreff","title":"Multiple-scale analysis of the simplest large-delay differential\n  equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A delayed term in a differential equation reflects the fact that information\ntakes significant time to travel from one place to another within a process\nbeing studied. Despite de apparent similarity with ordinary differential\nequations, delay-differential equations (DDE) are known to be fundamentally\ndifferent and to require a dedicate mathematical apparatus for their analysis.\nIndeed, when the delay is large, it was found that they can sometimes be\nrelated to spatially extended dynamical systems. The purpose of this paper is\nto explain this fact in the simplest possible DDE by way of a multiple-scale\nanalysis. We show the asymptotic correspondence of that linear DDE with the\ndiffusion equation. This partial differential equations arises from a\nsolvability condition that differs from the ones usually encountered in\ntextbooks on asymptotics: In the limit of large delays, the leading-order\nproblem is a map and secular divergence at subsequent orders stem from forcing\nterms in that map.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:50:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kozyreff","Gregory",""]]}
{"id":"2308.12173","submitter":"Jian Xiao","authors":"Xing Lu and Jian Xiao","title":"The inequalities of Chern classes and Riemann-Roch type inequalities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.DG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Motivated by Koll\\'{a}r-Matsusaka's Riemann-Roch type inequalities, applying\neffective very ampleness of adjoint bundles on Fujita conjecture we show that\nfor any partition $\\lambda$ of the positive integer $d$ there exists a\nuniversal bivariate polynomial $Q_\\lambda(x, y)$ which has $\\text{deg}\\ Q \\leq\nd$ and whose coefficients depend only on $n$, such that for any projective\nmanifold $X$ of dimension $n$ and any ample line bundle $L$ on $X$,\n\\begin{equation*}\n  \\left|c_\\lambda(X)\\cdot L^{n -d}\\right|\\leq\n  \\frac{Q_{\\lambda}(L^{n}, K_X \\cdot L^{n -1} )}{(L^{n})^{d-1}},\n\\end{equation*} where $K_X$ is the canonical bundle of $X$ and $c_\\lambda(X)$\nis the monomial Chern class given by the partition $\\lambda$. As a special\ncase, when $K_X$ or $-K_X$ is ample, this implies that there exists a constant\n$c_n$ depending only on $n$ such that for any monomial Chern classes of top\ndegree, the Chern number ratios \\begin{equation*} \\left|\\frac{c_\\lambda(X)}{c_1\n(X) ^{n}}\\right|\\leq c_n, \\end{equation*} which recovers a recent result of\nDu-Sun. The main result also yields an asymptotic version of the sharper\nRiemann-Roch type inequality.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:52:00 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lu","Xing",""],["Xiao","Jian",""]]}
{"id":"2308.12174","submitter":"C\\'edric Jockel","authors":"C\\'edric Jockel","title":"Scalar- and Vector Dark Matter Admixed Neutron Stars","comments":"Master thesis, 104 pages, 29 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is believed that dark matter (DM) could accumulate inside neutron stars\nand significantly change their masses, radii and tidal properties. We study\nwhat effect bosonic dark matter, modelled as a massive and self-interacting\nscalar or vector field, has on neutron stars. We derive equations to compute\nthe tidal deformability of the full Einstein-Hilbert-Klein-Gordon system\nself-consistently, and probe the influence of the scalar field mass and\nself-interaction strength on the total mass and tidal properties of the\ncombined system, called fermion boson stars (FBS). We are the first to combine\nProca stars with neutron stars to mixed systems of fermions and a vector field\nin Einstein-Proca theory, which we name fermion Proca stars (FPS). We construct\nequilibrium solutions of FPS, compute their masses, radii and analyse them\nregarding their stability and higher modes. We find that FPS tend to be more\nmassive and geometrically larger than FBS for equal boson masses and\nself-interaction strengths. Both FBS and FPS admit DM core and DM cloud\nsolutions and we find that they can produce degenerate results. Core solutions\ncompactify the neutron star component and lower their tidal deformability,\ncloud solutions have the inverse effect. Electromagnetic observations of\ncertain cloud-like configurations would appear to violate the Buchdahl limit.\nThe self-interaction strength is found to significantly affect both mass and\ntidal deformability. We discuss observational constraints and the connection to\nanomalous detections. We also show how models with an effective equation of\nstate compare to the self-consistent solution of FBS and find the\nself-interaction strength where both solutions converge sufficiently.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:52:59 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Jockel","C\u00e9dric",""]]}
{"id":"2308.12175","submitter":"Niyomukiza Thamar","authors":"Niyomukiza Thamar, Hossam Samy Elsaid Sharara","title":"Unsupervised anomalies detection in IIoT edge devices networks using\n  federated learning","comments":"Accepted for PuBlication in machine learning journals","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a connection of many IoT devices that each collect data, normally training\na machine learning model would involve transmitting the data to a central\nserver which requires strict privacy rules. However, some owners are reluctant\nof availing their data out of the company due to data security concerns.\nFederated learning(FL) as a distributed machine learning approach performs\ntraining of a machine learning model on the device that gathered the data\nitself. In this scenario, data is not share over the network for training\npurpose. Fedavg as one of FL algorithms permits a model to be copied to\nparticipating devices during a training session. The devices could be chosen at\nrandom, and a device can be aborted. The resulting models are sent to the\ncoordinating server and then average models from the devices that finished\ntraining. The process is repeated until a desired model accuracy is achieved.\nBy doing this, FL approach solves the privacy problem for IoT/ IIoT devices\nthat held sensitive data for the owners. In this paper, we leverage the\nbenefits of FL and implemented Fedavg algorithm on a recent dataset that\nrepresent the modern IoT/ IIoT device networks. The results were almost the\nsame as the centralized machine learning approach. We also evaluated some\nshortcomings of Fedavg such as unfairness that happens during the training when\nstruggling devices do not participate for every stage of training. This\ninefficient training of local or global model could lead in a high number of\nfalse alarms in intrusion detection systems for IoT/IIoT gadgets developed\nusing Fedavg. Hence, after evaluating the FedAv deep auto encoder with\ncentralized deep auto encoder ML, we further proposed and designed a Fair\nFedavg algorithm that will be evaluated in the future work.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:53:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Thamar","Niyomukiza",""],["Sharara","Hossam Samy Elsaid",""]]}
{"id":"2308.12176","submitter":"Alvaro Chavarria","authors":"A.E. Chavarria, H. Lin, K.J. McGuire, A. Piers, M. Traina","title":"The DAMIC excess from WIMP-nucleus elastic scattering","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two dark matter searches performed with charge-coupled devices (CCDs) in the\nDAMIC cryostat at SNOLAB reported with high statistical significance the\npresence of an unidentified source of low-energy events in bulk silicon. The\nobserved spectrum is consistent with nuclear recoils from the elastic\nscattering of weakly interacting massive particles (WIMPs) with masses between\n2 and 3 GeV. In the standard scenario of spin-independent WIMP-nucleus\nscattering, the derived cross section is conclusively excluded by results in\nargon by the DarkSide-50 experiment. We identify isospin-violating and\nspin-dependent scenarios where interactions with $^{40}$Ar are strongly\nsuppressed and the interpretation of the DAMIC excess as WIMP-nucleus elastic\nscattering remains viable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:55:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chavarria","A. E.",""],["Lin","H.",""],["McGuire","K. J.",""],["Piers","A.",""],["Traina","M.",""]]}
{"id":"2308.12177","submitter":"Shengwei Zhou","authors":"Biaoshuai Tao, Xiaowei Wu, Ziqi Yu, Shengwei Zhou","title":"On the Existence of EFX (and Pareto-Optimal) Allocations for Binary\n  Chores","comments":"11 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of allocating a group of indivisible chores among agents\nwhile each chore has a binary marginal. We focus on the fairness criteria of\nenvy-freeness up to any item (EFX) and investigate the existence of EFX\nallocations. We show that when agents have additive binary cost functions,\nthere exist EFX and Pareto-optimal (PO) allocations that can be computed in\npolynomial time. To the best of our knowledge, this is the first setting of a\ngeneral number of agents that admits EFX and PO allocations, before which EFX\nand PO allocations have only been shown to exist for three bivalued agents. We\nfurther consider more general cost functions: cancelable and general monotone\n(both with binary marginal). We show that EFX allocations exist and can be\ncomputed for binary cancelable chores, but EFX is incompatible with PO. For\ngeneral binary marginal functions, we propose an algorithm that computes\n(partial) envy-free (EF) allocations with at most $n-1$ unallocated items.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:56:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tao","Biaoshuai",""],["Wu","Xiaowei",""],["Yu","Ziqi",""],["Zhou","Shengwei",""]]}
{"id":"2308.12178","submitter":"Adrian Sieler","authors":"Sumit Patidar and Adrian Sieler and Oliver Brock","title":"In-Hand Cube Reconfiguration: Simplified","comments":"Accepted at 2023 IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a simple approach to in-hand cube reconfiguration. By simplifying\nplanning, control, and perception as much as possible, while maintaining robust\nand general performance, we gain insights into the inherent complexity of\nin-hand cube reconfiguration. We also demonstrate the effectiveness of\ncombining GOFAI-based planning with the exploitation of environmental\nconstraints and inherently compliant end-effectors in the context of dexterous\nmanipulation. The proposed system outperforms a substantially more complex\nsystem for cube reconfiguration based on deep learning and accurate physical\nsimulation, contributing arguments to the discussion about what the most\npromising approach to general manipulation might be. Project website:\nhttps://rbo.gitlab-pages.tu-berlin.de/robotics/simpleIHM/\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:57:41 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Patidar","Sumit",""],["Sieler","Adrian",""],["Brock","Oliver",""]]}
{"id":"2308.12179","submitter":"Lorenzo Mercuri","authors":"Lorenzo Mercuri and Andrea Perchiazzo and Edit Rroji","title":"Investigating Short-Term Dynamics in Green Bond Markets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper investigates the effect of the label green in bond markets from the\nlens of the trading activity. The idea is that jumps in the dynamics of returns\nhave a specific memory nature that can be well represented through a\nself-exciting process. Specifically, using Hawkes processes where the intensity\nis described through a continuous time moving average model, we study the\nhigh-frequency dynamics of bond prices. We also introduce a bivariate extension\nof the model that deals with the cross-effect of upward and downward price\nmovements. Empirical results suggest that differences emerge if we consider\nperiods with relevant interest rate announcements, especially in the case of an\nissuer operating in the energy market.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:01:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mercuri","Lorenzo",""],["Perchiazzo","Andrea",""],["Rroji","Edit",""]]}
{"id":"2308.12180","submitter":"Francois Richard","authors":"Alain Le Yaouanc, Fran\\c{c}ois Richard (Universit\\'e Paris-Saclay,\n  CNRS/IN2P3, IJCLab, 91405 Orsay, France)","title":"As a consequence of H(650)->W+W-/ZZ, one predicts H++->W+W+ and H+->ZW+,\n  as indicated by LHC data","comments":"17 pages, 7 figures, Work in preparation of the 2023 ECFA Workshop on\n  Higgs/EW/Top factories in Paestum (Salerno) / Italy from 11 - 13 October 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several indications for neutral scalars are observed at the LHC. One of them,\na broad resonance peaked at about 650 GeV which we call H(650), was first\nobserved by an outsider combining published histograms from ATLAS and CMS on ZZ\n->4 leptons searches, and this combination shows a local significance close to\n4 s.d. Since then, CMS has reported two other indications at the same mass,\nwith similar local significances: H ->WW -> lepton nu lepton nu and H->bbh(125)\nwhere h(125) ->2 photons. ATLAS has completed its analysis of ZZ->4 leptons\nfrom which we infer an indication for H(650) with 3.5 s.d. significance.\nAssuming that the mass is already known from the former set, and combining\nthese three results, one gets a global statistical significance above 6 s.d.\nH(650) has a coupling to WW similar to h(125) and therefore we argue that a sum\nrule (SR) required by unitarity for WW scattering implies that there should be\na compensating effect from a doubly charged scalar H++, with a large coupling\nto W+W+. We therefore predict that this mode should become visible through the\nvector boson fusion process W+W+->H++, naturally provided by LHC. A recent\nindication for H++(450)->W+W+ from ATLAS allows a model independent\ninterpretation of this result through the SR constraint which gives\nBR(H++->W+W+)=10%, implying the occurrence of additional decay modes H+W+ and\nH+H+ from one or several light H+ with masses below mH++ - mW or MH++/2, that\nis mH+ < 370 GeV or 225 GeV. A similar analysis is provided for H+(375)->ZW,\nindicated by ATLAS and CMS. Both channels suggest a scalar field content\nsimilar to the Georgi Machacek model with triplets, at variance with the models\nusually considered.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:02:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yaouanc","Alain Le","","Universit\u00e9 Paris-Saclay,\n  CNRS/IN2P3, IJCLab, 91405 Orsay, France"],["Richard","Fran\u00e7ois","","Universit\u00e9 Paris-Saclay,\n  CNRS/IN2P3, IJCLab, 91405 Orsay, France"]]}
{"id":"2308.12181","submitter":"Brian Gilbert","authors":"Brian Gilbert, Elizabeth L. Ogburn, Abhirup Datta","title":"Consistency of common spatial estimators under spatial confounding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper addresses the asymptotic performance of popular spatial regression\nestimators on the task of estimating the effect of an exposure on an outcome in\nthe presence of an unmeasured spatially-structured confounder. This setting is\noften referred to as \"spatial confounding.\" We consider spline models, Gaussian\nprocesses (GP), generalized least squares (GLS), and restricted spatial\nregression (RSR) under two data generation processes: one where the confounder\nis a fixed effect and one where it is a random effect. The literature on\nspatial confounding is confusing and contradictory, and our results correct and\nclarify several misunderstandings. We first show that, like an unadjusted OLS\nestimator, RSR is asymptotically biased under any spatial confounding scenario.\nWe then prove a novel result on the consistency of the GLS estimator under\nspatial confounding. We finally prove that estimators like GLS, GP, and\nsplines, that are consistent under confounding by a fixed effect will also be\nconsistent under confounding by a random effect. We conclude that, contrary to\nmuch of the recent literature on spatial confounding, traditional estimators\nbased on partially linear models are amenable to estimating effects in the\npresence of spatial confounding. We support our theoretical arguments with\nsimulation studies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:06:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gilbert","Brian",""],["Ogburn","Elizabeth L.",""],["Datta","Abhirup",""]]}
{"id":"2308.12182","submitter":"Hoi Tim Cheung","authors":"Damon H. T. Cheung, Stefano Rinaldi, Martina Toscani and Otto A.\n  Hannuksela","title":"Mitigating the effect of population model uncertainty on strong lensing\n  Bayes factor using nonparametric methods","comments":"15 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strong lensing of gravitational waves can produce several detectable images\nas repeated events in the upcoming observing runs, which can be detected with\nthe posterior overlap analysis (Bayes factor). The choice of the binary black\nhole population plays an important role in the analysis as two\ngravitational-wave events could be similar either because of lensing or\nastrophysical coincidence. In this study, we investigate the biases induced by\ndifferent population models on the Bayes factor. We build up a mock catalogue\nof gravitational-wave events following a benchmark population and reconstruct\nit using both non-parametric and parametric methods. Using these\nreconstructions, we compute the Bayes factor for lensed pair events by\nutilizing both models and compare the results with a benchmark model. We show\nthat the use of a non-parametric population model gives a smaller bias than\nparametric population models. Therefore, our study demonstrates the importance\nof choosing a sufficiently agnostic population model for strong lensing\nanalyses.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:12:32 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Cheung","Damon H. T.",""],["Rinaldi","Stefano",""],["Toscani","Martina",""],["Hannuksela","Otto A.",""]]}
{"id":"2308.12183","submitter":"Ecaterina Sava-Huss","authors":"Robin Kaiser and Ecaterina Sava-Huss","title":"Scaling limit of the sandpile identity element on the Sierpinski gasket","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the identity element of the sandpile group on finite\napproximations of the Sierpinski gasket with normal boundary conditions and\nshow that the sequence of piecewise constant continuations of the identity\nelements on SG_n converges in the weak* topology to the constant function with\nvalue 8/3 on the Sierpinski gasket SG. We then generalize the proof to a wider\nrange of functions and obtain the scaling limit for the identity elements with\ndifferent choices of sink vertices.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:14:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kaiser","Robin",""],["Sava-Huss","Ecaterina",""]]}
{"id":"2308.12184","submitter":"Tetiana Stepaniuk","authors":"A.S. Serdyuk, T.A. Stepaniuk","title":"Estimates of approximations by interpolation trigonometric polynomials\n  on the classes of convolutions of high smoothness","comments":"in Ukrainian","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish interpolation analogues of Lebesgue type inequalities on the\nsets of $C^{\\psi}_{\\beta}L_{1}$ $2\\pi$-periodic functions $f$, which are\nrepresentable as convolutions of generating kernel $\\Psi_{\\beta}(t) =\n\\sum\\limits_{k=1}^{\\infty}\\psi(k)\\cos \\big(kt-\\frac{\\beta\\pi}{2}\\big)$,\n$\\psi(k)\\geq 0$, $\\sum\\limits_{k=1}^{\\infty}\\psi(k)<\\infty$,\n$\\beta\\in\\mathbb{R}$, with functions $\\varphi$ from $L_{1}$ . In obtained\ninequalities for each $x\\in\\mathbb{R}$ the modules of deviations $|f(x)-\n\\tilde{S}_{n-1}(f;x)|$ of interpolation Lagrange polynomials $\n\\tilde{S}_{n-1}(f;\\cdot)$ are estimated via best approximations\n$E_{n}(\\varphi)_{L_{1}}$ of functions $\\varphi$ by trigonometric polynomials in\n$L_{1}$-metrics. When the sequences $\\psi(k)$ decrease to zero faster than any\npower function, the obtained inequalities in many important cases are\nasymptotically exact. In such cases we also establish the asymptotic equalities\nfor exact upper boundaries of pointwise approximations by interpolation\ntrigonometric polynomials on the classes of convolutions of generating kernel\n$\\Psi_{\\beta}$ with functions $\\varphi$, which belong to the unit ball from the\nspace $L_{1}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:14:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Serdyuk","A. S.",""],["Stepaniuk","T. A.",""]]}
{"id":"2308.12185","submitter":"Julian Wykowski","authors":"Julian Wykowski","title":"Profinite Subgroup Accessibility and Recognition of Amalgamated Factors","comments":"29 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate accessible subgroups of a profinite group $G$, i.e. subgroups\n$H$ appearing as vertex groups in a graph of profinite groups decomposition of\n$G$ with finite edge groups. We prove that any accessible subgroup $H \\leq G$\narises as the kernel of a continuous derivation of $G$ in a free module over\nits completed group algebra. This allows us to deduce splittings of an abstract\ngroup from splittings of its profinite completion. We prove that any finitely\ngenerated subgroup $\\Delta$ of a finitely generated virtually free group\n$\\Gamma$ whose closure is a factor in a profinite amalgamated product\n$\\widehat{\\Gamma} = \\overline{\\Delta} \\amalg_K L$ along a finite $K$ must be a\nfactor in an amalgamated product $\\Gamma = \\Delta \\ast_\\chi \\Lambda$ along some\n$\\chi \\cong K$. This extends previous results of Parzanchevski--Puder, Wilton\nand Garrido--Jaikin-Zapirain on free factors.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:16:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wykowski","Julian",""]]}
{"id":"2308.12186","submitter":"Yu Liu","authors":"Yu Liu and Chao Liu","title":"Modeling Heat Capacity of Supercritical Fluids: A Phonon Theory Approach","comments":"18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.other cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent research shows that liquids and dense supercritical fluids support\nhigh frequency shear waves. Here, we proposed a general heat capacity model of\nsupercritical fluids using the latest theoretical findings (the liquid phonon\ntheory). In this theory, heat capacity cv of supercritical fluids is only\nrelated to the infinite-frequency shear modulus, Debye relaxation time and\nminimal length of the longitudinal mode in supercritical fluids rather than the\nsystem-specific structure and interactions. The present model quantitatively\nexplains the heat capacities in the liquid-like region and the gas-like region\nabove the critical point. At the same time, the heat capacities of 6\nsupercritical fluids (including monatomic fluids Ar, Ne and molecular fluids\nN2, CO, CO2, CH4) over a wide range of temperatures and pressures were\ncalculated using the present model, yielding a high accuracy with no\nfree-fitting parameters. This model has two advantages: (1) The contribution of\nintramolecular vibrations was considered, which makes the model applicable to\nmolecular fluids and high temperature region; (2) This method starts from the\nquasi-harmonic Debye model. Thus, it does not require any adjustable parameters\nand thermal expansion coefficients. Furthermore, the present cv model of the\nrigid liquid-like supercritical region in this paper can be extended to liquid\nphase of molecular fluids.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:19:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Yu",""],["Liu","Chao",""]]}
{"id":"2308.12187","submitter":"Anton Zabrodin","authors":"I. Krichever, A. Zabrodin","title":"Quasi-periodic solutions of the universal hierarchy","comments":"21 pages, no figures. arXiv admin note: text overlap with\n  arXiv:2304.05108","journal-ref":null,"doi":null,"report-no":"ITEP-TH-19/23","categories":"nlin.SI math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct quasi-periodic solutions of the universal hierarchy which\nincludes the multi-component KP and Toda hierarchies and show how they fit into\nthe bilinear formalism. The tau-function is expressed in terms of the Riemann\ntheta-function multiplied by exponential function of a quadratic form in the\nhierarchical times.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:24:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Krichever","I.",""],["Zabrodin","A.",""]]}
{"id":"2308.12188","submitter":"Pierre-Louis Benveniste","authors":"Pierre-Louis Benveniste, Julie Alberge, Lei Xing, Jean-Emmanuel\n  Bibault","title":"Development and external validation of a lung cancer risk estimation\n  tool using gradient-boosting","comments":"14 pages, 4 figures, 4 tables, 1 Github repository, see\n  http://github.com/plbenveniste/LungCancerRisk","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Lung cancer is a significant cause of mortality worldwide, emphasizing the\nimportance of early detection for improved survival rates. In this study, we\npropose a machine learning (ML) tool trained on data from the PLCO Cancer\nScreening Trial and validated on the NLST to estimate the likelihood of lung\ncancer occurrence within five years. The study utilized two datasets, the PLCO\n(n=55,161) and NLST (n=48,595), consisting of comprehensive information on risk\nfactors, clinical measurements, and outcomes related to lung cancer. Data\npreprocessing involved removing patients who were not current or former smokers\nand those who had died of causes unrelated to lung cancer. Additionally, a\nfocus was placed on mitigating bias caused by censored data. Feature selection,\nhyper-parameter optimization, and model calibration were performed using\nXGBoost, an ensemble learning algorithm that combines gradient boosting and\ndecision trees. The ML model was trained on the pre-processed PLCO dataset and\ntested on the NLST dataset. The model incorporated features such as age,\ngender, smoking history, medical diagnoses, and family history of lung cancer.\nThe model was well-calibrated (Brier score=0.044). ROC-AUC was 82% on the PLCO\ndataset and 70% on the NLST dataset. PR-AUC was 29% and 11% respectively. When\ncompared to the USPSTF guidelines for lung cancer screening, our model provided\nthe same recall with a precision of 13.1% vs. 9.3% on the PLCO dataset and 3.2%\nvs. 3.1% on the NLST dataset. The developed ML tool provides a freely available\nweb application for estimating the likelihood of developing lung cancer within\nfive years. By utilizing risk factors and clinical data, individuals can assess\ntheir risk and make informed decisions regarding lung cancer screening. This\nresearch contributes to the efforts in early detection and prevention\nstrategies, aiming to reduce lung cancer-related mortality rates.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:25:17 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Benveniste","Pierre-Louis",""],["Alberge","Julie",""],["Xing","Lei",""],["Bibault","Jean-Emmanuel",""]]}
{"id":"2308.12189","submitter":"Fiona Seibold","authors":"Fiona K. Seibold and Arkady A. Tseytlin","title":"S-matrix on effective string and compactified membrane","comments":"34 pages, v2","journal-ref":null,"doi":null,"report-no":"Imperial-TP-FS-2023-01","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Expanding Nambu-Goto action near infinitely long string vacuum one can\ncompute scattering amplitudes of 2d massless fields representing transverse\nstring coordinates. As was shown in arXiv:1203.1054, the resulting S-matrix is\nintegrable, in agreement with the known free string spectrum and also with an\ninterpretation of the static-gauge NG action as a $T\\bar T$ deformation of a\nfree massless theory. We consider a generalization of this computation to the\ncase of a membrane, expanding its 3d action near an infinite membrane vacuum\nthat has cylindrical $\\mathbb R \\times S^1$ shape (we refer to such membrane as\n\"compactified\"). Representing 3d fields as Fourier series in $S^1$ coordinate\nwe get an effective 2d model in which the massless string modes are coupled to\nan infinite KK tower of massive 2d modes. We find that the resulting 2d\nS-matrix is not integrable already at the tree level. We also compute 1-loop\nscattering amplitude of massless string modes with all compactified membrane\nmodes propagating in the loop. The result is UV finite and is a non-trivial\nfunction of the kinematic variables. In the large momentum limit or when the\nradius of $S^1$ is taken to infinity we recover the expression for the 1-loop\nscattering amplitude of the uncompactified $\\mathbb R^2$ membrane. We also\nconsider a 2d model which is the $T\\bar T$ deformation to the free theory with\nthe same massless plus infinite massive tower of modes. The corresponding 2d\nS-matrix is found, as expected, to be integrable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:25:36 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 16:45:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Seibold","Fiona K.",""],["Tseytlin","Arkady A.",""]]}
{"id":"2308.12190","submitter":"Rebecca Whitman","authors":"Michael D. Barrus, Ann N. Trenk, Rebecca Whitman","title":"The Hereditary Closure of the Unigraphs","comments":"35 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A graph with degree sequence $\\pi$ is a \\emph{unigraph} if it is isomorphic\nto every graph that has degree sequence $\\pi$. The class of unigraphs is not\nhereditary and in this paper we study the related hereditary class HCU, the\nhereditary closure of unigraphs, consisting of all graphs induced in a\nunigraph. We characterize the class HCU in multiple ways making use of the\ntools of a decomposition due to Tyshkevich and a partial order on degree\nsequences due to Rao. We also provide a new characterization of the class that\nconsists of unigraphs for which all induced subgraphs are also unigraphs.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:26:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Barrus","Michael D.",""],["Trenk","Ann N.",""],["Whitman","Rebecca",""]]}
{"id":"2308.12191","submitter":"Huijie Yao","authors":"Huijie Yao, Wengang Zhou, Hao Feng, Hezhen Hu, Hao Zhou, Houqiang Li","title":"Sign Language Translation with Iterative Prototype","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents IP-SLT, a simple yet effective framework for sign\nlanguage translation (SLT). Our IP-SLT adopts a recurrent structure and\nenhances the semantic representation (prototype) of the input sign language\nvideo via an iterative refinement manner. Our idea mimics the behavior of human\nreading, where a sentence can be digested repeatedly, till reaching accurate\nunderstanding. Technically, IP-SLT consists of feature extraction, prototype\ninitialization, and iterative prototype refinement. The initialization module\ngenerates the initial prototype based on the visual feature extracted by the\nfeature extraction module. Then, the iterative refinement module leverages the\ncross-attention mechanism to polish the previous prototype by aggregating it\nwith the original video feature. Through repeated refinement, the prototype\nfinally converges to a more stable and accurate state, leading to a fluent and\nappropriate translation. In addition, to leverage the sequential dependence of\nprototypes, we further propose an iterative distillation loss to compress the\nknowledge of the final iteration into previous ones. As the autoregressive\ndecoding process is executed only once in inference, our IP-SLT is ready to\nimprove various SLT systems with acceptable overhead. Extensive experiments are\nconducted on public benchmarks to demonstrate the effectiveness of the IP-SLT.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:27:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yao","Huijie",""],["Zhou","Wengang",""],["Feng","Hao",""],["Hu","Hezhen",""],["Zhou","Hao",""],["Li","Houqiang",""]]}
{"id":"2308.12192","submitter":"Sophie A. Neubauer (N\\'ee Gruenbacher)","authors":"Sophie A. Neubauer (n\\'ee Gruenbacher), Radu Grosu","title":"Robustness Analysis of Continuous-Depth Models with Lagrangian\n  Techniques","comments":"arXiv admin note: text overlap with arXiv:2107.08467","journal-ref":"J.-F. Raskin and K. Chatterjee (Eds.): Principles of Systems\n  Design, LNCS 13660, pp. 625-649, 2022","doi":"10.1007/978-3-031-22337-2_30","report-no":null,"categories":"cs.LG cs.AI math.DS math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents, in a unified fashion, deterministic as well as\nstatistical Lagrangian-verification techniques. They formally quantify the\nbehavioral robustness of any time-continuous process, formulated as a\ncontinuous-depth model. To this end, we review LRT-NG, SLR, and GoTube,\nalgorithms for constructing a tight reachtube, that is, an over-approximation\nof the set of states reachable within a given time-horizon, and provide\nguarantees for the reachtube bounds. We compare the usage of the variational\nequations, associated to the system equations, the mean value theorem, and the\nLipschitz constants, in achieving deterministic and statistical guarantees. In\nLRT-NG, the Lipschitz constant is used as a bloating factor of the initial\nperturbation, to compute the radius of an ellipsoid in an optimal metric, which\nover-approximates the set of reachable states. In SLR and GoTube, we get\nstatistical guarantees, by using the Lipschitz constants to compute local balls\naround samples. These are needed to calculate the probability of having found\nan upper bound, of the true maximum perturbation at every timestep. Our\nexperiments demonstrate the superior performance of Lagrangian techniques, when\ncompared to LRT, Flow*, and CAPD, and illustrate their use in the robustness\nanalysis of various continuous-depth models.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:30:44 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Neubauer","Sophie A.","","n\u00e9e Gruenbacher"],["Grosu","Radu",""]]}
{"id":"2308.12193","submitter":"Yinshuo Li","authors":"Yinshuo Li, Zhuo Jia, Wenkai Lu, Cao Song","title":"Self-Supervised Knowledge-Driven Deep Learning for 3D Magnetic Inversion","comments":"11 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The magnetic inversion method is one of the non-destructive geophysical\nmethods, which aims to estimate the subsurface susceptibility distribution from\nsurface magnetic anomaly data. Recently, supervised deep learning methods have\nbeen widely utilized in lots of geophysical fields including magnetic\ninversion. However, these methods rely heavily on synthetic training data,\nwhose performance is limited since the synthetic data is not independently and\nidentically distributed with the field data. Thus, we proposed to realize\nmagnetic inversion by self-supervised deep learning. The proposed\nself-supervised knowledge-driven 3D magnetic inversion method (SSKMI) learns on\nthe target field data by a closed loop of the inversion and forward models.\nGiven that the parameters of the forward model are preset, SSKMI can optimize\nthe inversion model by minimizing the mean absolute error between observed and\nre-estimated surface magnetic anomalies. Besides, there is a knowledge-driven\nmodule in the proposed inversion model, which makes the deep learning method\nmore explicable. Meanwhile, comparative experiments demonstrate that the\nknowledge-driven module can accelerate the training of the proposed method and\nachieve better results. Since magnetic inversion is an ill-pose task, SSKMI\nproposed to constrain the inversion model by a guideline in the auxiliary loop.\nThe experimental results demonstrate that the proposed method is a reliable\nmagnetic inversion method with outstanding performance.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:31:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Li","Yinshuo",""],["Jia","Zhuo",""],["Lu","Wenkai",""],["Song","Cao",""]]}
{"id":"2308.12194","submitter":"Lei Shi","authors":"Lei Shi, Paul-Christian B\\\"urkner, Andreas Bulling","title":"Inferring Human Intentions from Predicted Action Probabilities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Predicting the next action that a human is most likely to perform is key to\nhuman-AI collaboration and has consequently attracted increasing research\ninterests in recent years. An important factor for next action prediction are\nhuman intentions: If the AI agent knows the intention it can predict future\nactions and plan collaboration more effectively. Existing Bayesian methods for\nthis task struggle with complex visual input while deep neural network (DNN)\nbased methods do not provide uncertainty quantifications. In this work we\ncombine both approaches for the first time and show that the predicted next\naction probabilities contain information that can be used to infer the\nunderlying intention. We propose a two-step approach to human intention\nprediction: While a DNN predicts the probabilities of the next action,\nMCMC-based Bayesian inference is used to infer the underlying intention from\nthese predictions. This approach not only allows for independent design of the\nDNN architecture but also the subsequently fast, design-independent inference\nof human intentions. We evaluate our method using a series of experiments on\nthe Watch-And-Help (WAH) and a keyboard and mouse interaction dataset. Our\nresults show that our approach can accurately predict human intentions from\nobserved actions and the implicit information contained in next action\nprobabilities. Furthermore, we show that our approach can predict the correct\nintention even if only few actions have been observed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:35:02 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Shi","Lei",""],["B\u00fcrkner","Paul-Christian",""],["Bulling","Andreas",""]]}
{"id":"2308.12195","submitter":"Francois Loeser","authors":"Arthur Forey, Fran\\c{c}ois Loeser and Dimitri Wyss","title":"A motivic Fundamental Lemma","comments":"53 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.LO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we prove motivic versions of the Langlands-Shelstad Fundamental\nLemma and Ng\\^o's Geometric Stabilization. To achieve this, we follow the\nstrategy from the recent proof by Groechenig, Wyss and Ziegler which avoided\nthe use of perverse sheaves using instead $p$-adic integration and Tate\nduality. We make a key use of a construction of Denef and Loeser which assigns\na virtual motive to any definable set in the theory of pseudo-finite fields.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:35:22 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Forey","Arthur",""],["Loeser","Fran\u00e7ois",""],["Wyss","Dimitri",""]]}
{"id":"2308.12196","submitter":"Aldo Ledesma-Dur\\'an PhD.","authors":"Aldo Ledesma-Dur\\'an","title":"Turing patterns on a two-component isotropic growing system. Part 1:\n  Homogeneous state and stability of perturbations in absence of diffusion","comments":"17 pages, 11 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The reaction-diffusion processes in a growing domain involves a dilution term\nthat modifies the properties of the homogeneous state that, in contrast to a\nfixed domain, depends on time. We study how the dilution term changes the\nsteady concentrations and modifies the stability properties of the\nperturbations. We propose a solution for the homogeneous state that\nincorporates these factors and is valid for slow variation of the size of the\ndomain which is based on a linear approach and has been tested against\nnumerical solutions for different types of growing: exponential, linear,\nquadratic and oscillatory. We prove that the deviation of the steady state is\nproportional to the fixed point concentration, and occurs most notably for\nexponential growth. Systems with linear or quadratic growth tend to recover the\nstate that would have in absence of diffusion, whereas the oscillatory\nvariation of the domain size produce temporal oscillations of the\nconcentration. Regarding the Turing conditions for the apparition of spatial\npatterns, we study those related to stability in absence of diffusion and\nestablish that in a growing domain it depends upon: the change in the steady\nstate concentrations, the local change of volume that affects the concentration\nand the stability that the reactive system would have in absence of dilution.\nThese conditions provide richer conditions for the emergence of patterns than\nthose found in a fixed domain. The formal results provided in this work are\nverified against numerical simulations of the homogeneous state for the\nBrusselator and BVAM reactions and we discuss how these variations of the\nhomogeneous state can give raise to crucial differences in the formation of\nTuring patterns in growing domains.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:35:30 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ledesma-Dur\u00e1n","Aldo",""]]}
{"id":"2308.12197","submitter":"Fan Zheng","authors":"Diego C\\'ordoba, Luis Mart\\'inez-Zoroa and Fan Zheng","title":"Finite time singularities to the 3D incompressible Euler equations for\n  solutions in $C^{\\infty}(\\mathbb{R}^3 \\setminus \\{0\\})\\cap C^{1,\\alpha}\\cap\n  L^2$","comments":"40 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a novel mechanism that reveals finite time singularities within\nthe 1D De Gregorio model and the 3D incompressible Euler equations. Remarkably,\nwe do not construct our blow up using self-similar coordinates, but build it\nfrom infinitely many regions with vorticity, separated by vortex-free regions\nin between. It yields solutions of the 3D incompressible Euler equations in\n$\\mathbb{R}^3\\times [-T,0]$ such that the velocity is in the space\n$C^{\\infty}(\\mathbb{R}^3 \\setminus \\{0\\})\\cap C^{1,\\alpha}\\cap L^2$ for times\n$t\\in (-T,0)$ and is not $C^1$ at time 0.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:35:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["C\u00f3rdoba","Diego",""],["Mart\u00ednez-Zoroa","Luis",""],["Zheng","Fan",""]]}
{"id":"2308.12198","submitter":"Weifeng Zhu","authors":"Junyi Yang, Weifeng Zhu, Meixia Tao, and Shu Sun","title":"Hierarchical Beam Alignment for Millimeter-Wave Communication Systems: A\n  Deep Learning Approach","comments":"15 pages, 16 figures, to appear in Transactions on Wireless\n  Communications. arXiv admin note: text overlap with arXiv:2209.03643","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fast and precise beam alignment is crucial for high-quality data transmission\nin millimeter-wave (mmWave) communication systems, where large-scale antenna\narrays are utilized to overcome the severe propagation loss. To tackle the\nchallenging problem, we propose a novel deep learning-based hierarchical beam\nalignment method for both multiple-input single-output (MISO) and\nmultiple-input multiple-output (MIMO) systems, which learns two tiers of\nprobing codebooks (PCs) and uses their measurements to predict the optimal beam\nin a coarse-to-fine search manner. Specifically, a hierarchical beam alignment\nnetwork (HBAN) is developed for MISO systems, which first performs coarse\nchannel measurement using a tier-1 PC, then selects a tier-2 PC for fine\nchannel measurement, and finally predicts the optimal beam based on both coarse\nand fine measurements. The propounded HBAN is trained in two steps: the tier-1\nPC and the tier-2 PC selector are first trained jointly, followed by the joint\ntraining of all the tier-2 PCs and beam predictors. Furthermore, an HBAN for\nMIMO systems is proposed to directly predict the optimal beam pair without\nperforming beam alignment individually at the transmitter and receiver.\nNumerical results demonstrate that the proposed HBANs are superior to the\nstate-of-art methods in both alignment accuracy and signaling overhead\nreduction.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:38:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yang","Junyi",""],["Zhu","Weifeng",""],["Tao","Meixia",""],["Sun","Shu",""]]}
{"id":"2308.12199","submitter":"Nitin Nilesh","authors":"Nitin Nilesh, Tushar Sharma, Anurag Ghosh, C. V. Jawahar","title":"Towards Real-Time Analysis of Broadcast Badminton Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Analysis of player movements is a crucial subset of sports analysis. Existing\nplayer movement analysis methods use recorded videos after the match is over.\nIn this work, we propose an end-to-end framework for player movement analysis\nfor badminton matches on live broadcast match videos. We only use the visual\ninputs from the match and, unlike other approaches which use multi-modal sensor\ndata, our approach uses only visual cues. We propose a method to calculate the\non-court distance covered by both the players from the video feed of a live\nbroadcast badminton match. To perform this analysis, we focus on the gameplay\nby removing replays and other redundant parts of the broadcast match. We then\nperform player tracking to identify and track the movements of both players in\neach frame. Finally, we calculate the distance covered by each player and the\naverage speed with which they move on the court. We further show a heatmap of\nthe areas covered by the player on the court which is useful for analyzing the\ngameplay of the player. Our proposed framework was successfully used to analyze\nlive broadcast matches in real-time during the Premier Badminton League 2019\n(PBL 2019), with commentators and broadcasters appreciating the utility.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:38:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nilesh","Nitin",""],["Sharma","Tushar",""],["Ghosh","Anurag",""],["Jawahar","C. V.",""]]}
{"id":"2308.12200","submitter":"Kenichi Namikawa","authors":"Takashi Hara, Tadashi Miyazaki, Kenichi Namikawa","title":"Uniform Integrality of critical values of the Rankin-Selberg\n  $L$-function for ${\\rm GL}_{n}\\times {\\rm GL}_{n-1}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  After introducing the notion of uniform integrality of critical values of the\nRankin--Selberg $L$-functions for $\\mathrm{GL}_{n}\\times \\mathrm{GL}_{n-1}$, we\nstudy it when the base field is totally imaginary. For this purpose, we adopt\nspecific models of highest weight representations of the general linear groups,\nconstruct the Eichler--Shimura classes for $\\mathrm{GL}_{n}$ and\n$\\mathrm{GL}_{n-1}$ in an explicit manner, and then evaluate the cohomological\ncup product of them, by making the best use of Gel'fand-Tsetlin basis.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:38:39 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hara","Takashi",""],["Miyazaki","Tadashi",""],["Namikawa","Kenichi",""]]}
{"id":"2308.12201","submitter":"Peter Zelchenko","authors":"Peter Zelchenko, Li Xiangqian, Fu Xiaohan, Alex Ivanov, Zhenyu Gu","title":"A foolish consistency? Aligning interface objects hinders location\n  recall and may induce collinear errors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During our nearly constant use of digital devices, perhaps our most frequent\nneed is to visually identify icons representing our content and invoke the\nactions to manipulate them. Almost since the inception of user interface design\nin the 1970s, with rare exception it has become the tendency for programmers to\nprescribe the arrangement these things in uniform rectilinear rows and columns.\nThis was imported from theories for print design and ultimately brought into\nwidespread practice for graphical user interfaces (GUIs). Whether consistent\nrectilinearity actually does better than less rectilinear arrangements to\nmaximize selection efficiency has not been challenged on considerations of\nspeed or any other measure. In a series of four experiments, we explore how\nalignment may in fact discourage easy recallability of screen object locations\nand hence increase search intensity. A second objective is to present a\nmethodological model where we deliberately attempt to begin with psychophysical\ncognitive evidence at the environmental schematic low end (beginning with\ncontextual cueing paradigm), then move progressively upwards in naturalism in\nthe experiments to something that approximates actual human work at the higher\nend, all along attempting to keep one important environmental property\nconstant. Two experiments using contextual cueing paradigm confirm that\ncollinearly aligned arrays do not encourage recallability of location, while\nnoncollinear arrays appear to create traces that can be recalled automatically.\nTwo other experiments give further demonstration of explicit recollection and\nlocation recall, showing that collinear arrangements may in fact induce\nlocation recall errors to neighboring collinear objects. We discuss surrounding\ntheoretical, historical, and practical questions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:39:18 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Zelchenko","Peter",""],["Xiangqian","Li",""],["Xiaohan","Fu",""],["Ivanov","Alex",""],["Gu","Zhenyu",""]]}
{"id":"2308.12202","submitter":"Lucas Weber","authors":"Lucas Weber, Jaap Jumelet, Paul Michel, Elia Bruni, Dieuwke Hupkes","title":"Curriculum Learning with Adam: The Devil Is in the Wrong Details","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Curriculum learning (CL) posits that machine learning models -- similar to\nhumans -- may learn more efficiently from data that match their current\nlearning progress. However, CL methods are still poorly understood and, in\nparticular for natural language processing (NLP), have achieved only limited\nsuccess. In this paper, we explore why. Starting from an attempt to replicate\nand extend a number of recent curriculum methods, we find that their results\nare surprisingly brittle when applied to NLP. A deep dive into the\n(in)effectiveness of the curricula in some scenarios shows us why: when\ncurricula are employed in combination with the popular Adam optimisation\nalgorithm, they oftentimes learn to adapt to suboptimally chosen optimisation\nparameters for this algorithm. We present a number of different case studies\nwith different common hand-crafted and automated CL approaches to illustrate\nthis phenomenon, and we find that none of them outperforms optimisation with\nonly Adam with well-chosen hyperparameters. As such, our results contribute to\nunderstanding why CL methods work, but at the same time urge caution when\nclaiming positive results.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:39:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Weber","Lucas",""],["Jumelet","Jaap",""],["Michel","Paul",""],["Bruni","Elia",""],["Hupkes","Dieuwke",""]]}
{"id":"2308.12203","submitter":"Tian Tian","authors":"Tian Tian, Agastya Raj, Bruno Missi Xavier, Ying Zhang, Feiyun Wu,\n  Kunde Yang","title":"A Robust ADMM-Based Optimization Algorithm For Underwater Acoustic\n  Channel Estimation","comments":"This paper has been accepted and presented at OCEANS 2023 - Limerick\n  Conference. This version is a preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accurate estimation of the Underwater acoustic (UWA) is a key part of\nunderwater communications, especially for coherent systems. The severe\nmultipath effects and large delay spreads make the estimation problem\nlarge-scale. The non-stationary, non-Gaussian, and impulsive nature of ocean\nambient noise poses further obstacles to the design of estimation algorithms.\nUnder the framework of compressed sensing (CS), this work addresses the issue\nof robust channel estimation when measurements are contaminated by impulsive\nnoise. A first-order algorithm based on alternating direction method of\nmultipliers (ADMM) is proposed. Numerical simulations of time-varying channel\nestimation are performed to show its improved performance in highly impulsive\nnoise environments.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:39:44 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:15:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tian","Tian",""],["Raj","Agastya",""],["Xavier","Bruno Missi",""],["Zhang","Ying",""],["Wu","Feiyun",""],["Yang","Kunde",""]]}
{"id":"2308.12204","submitter":"Qijun Yan","authors":"Qijun Yan","title":"Zip stacks and moduli stacks of local Shtukas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $k$ be a field and $G$ be a connected reductive group over $k$. We denote\nthe positive loop group of $G$ by ${\\mathcal{L}}^+G$ and $\\mathcal{K}_1$ the\nkernel of the canonical reduction map $\\mathcal{L}^+G \\to G$. For any\ncocharacter $\\mu$ of $G$, we show that Viehmann's double coset spaces, namely\nthe set-valued (rather than groupoid-valued) fpqc sheaf\n${}_1\\mathcal{C}_1^\\mu:= \\mathcal{K}_1\\backslash\n\\mathcal{L}^+Gt^{\\mu}\\mathcal{L}^+G/\\mathcal{K}_1$, and its mixed\ncharacteristic analogue when $k$ is a perfect field of posi{t}ive\ncharacteristic, are represented by a common smooth homogeneous $G\\times_k\nG$-spherical variety. These are, in fact, isomorphic to Lusztig varieties. Such\na representability result allows us to initiate the study of comparison between\nthe moduli stack of local Shtukas and zip stacks. When the base field is a\nperfect field of characteristic $p>0$, we establish a direct homeomorphism\nbetween the coarse moduli stack of 1-1-truncated local $G$-Shtukas and that of\n$G$-zips\\comment{ (which morally are linearized 1-truncated $p$-divisible\ngroups)} of the same type. The results are applied to our work on zip period\nmaps of Shimura varieties. An open problem is proposed in the last section.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:40:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Yan","Qijun",""]]}
{"id":"2308.12205","submitter":"Julian Amette Estrada","authors":"Julian Amette Estrada, Franco Mayo, Augusto J. Roncaglia, Pablo D.\n  Mininni","title":"Quantum engines with interacting Bose-Einstein condensates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a quantum Otto cycle with an interacting Bose-Einstein condensate\nat finite temperature. We present a procedure to evolve this system in time in\nthree spatial dimensions, in which closed (adiabatic) strokes are described by\nthe Gross-Pitaevskii equation, and open (isochoric) strokes are modeled using a\nstochastic Ginzburg-Landau equation. We analyze the effect on the thermodynamic\nefficiency of the strength of interactions, the frequency of the harmonic trap,\nand the temperatures of the reservoirs. The efficiency has little sensitivity\nto changes in the temperatures, but decreases as interactions increase.\nHowever, stronger interactions allow for faster cycles and for substantial\nincreases in power.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:43:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Estrada","Julian Amette",""],["Mayo","Franco",""],["Roncaglia","Augusto J.",""],["Mininni","Pablo D.",""]]}
{"id":"2308.12206","submitter":"Francisco Javier Dom\\'inguez-Guti\\'errez Dr.","authors":"F. J. Dominguez-Gutierrez, S. Papanikolaou, S. Bonfanti, M. J. Alava","title":"Plastic deformation mechanisms during nanoindentation of W, Mo, V\n  body-centered cubic single crystals and their corresponding W-Mo, W-V\n  equiatomic random solid solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deformation plasticity mechanisms in alloys and compounds may unveil the\nmaterial capacity towards optimal mechanical properties. We conduct a series of\nmolecular dynamics (MD) simulations to investigate plasticity mechanisms due to\nnanoindentation in pure tungsten, molybdenum and vanadium body-centered cubic\nsingle crystals, as well as the also body-centered cubic, equiatomic, random\nsolid solutions (RSS) of tungsten--molybdenum and tungsten--vanadium alloys.\nOur analysis focuses on a thorough, side-by-side comparison of dynamic\ndeformation processes, defect nucleation, and evolution, along with\ncorresponding stress--strain curves. We also check the surface morphology of\nindented samples through atomic shear strain mapping. As expected, the presence\nof Mo and V atoms in W matrices introduces lattice strain and distortion,\nincreasing material resistance to deformation and slowing down dislocation\nmobility of dislocation loops with a Burgers vector of 1/2 $\\langle 111\n\\rangle$. Our side-by-side comparison displays a remarkable suppression of the\nplastic zone size in equiatomic W--V RSS, but not in equiatomic W--Mo RSS\nalloys, displaying a clear prediction for optimal hardening response equiatomic\nW--V RSS alloys. If the small-depth nanoindentation plastic response is\nindicative of overall mechanical performance, it is possible to conceive a\nnovel MD-based pathway towards material design for mechanical applications in\ncomplex, multi-component alloys.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:43:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dominguez-Gutierrez","F. J.",""],["Papanikolaou","S.",""],["Bonfanti","S.",""],["Alava","M. J.",""]]}
{"id":"2308.12207","submitter":"Ryan Bignell","authors":"Gert Aarts, Chris Allton, M. Naeem Anwar, Ryan Bignell, Timothy J.\n  Burns, Benjamin J\\\"ager, Jon-Ivar Skullerud","title":"Non-zero temperature study of spin 1/2 charmed baryons using lattice\n  gauge theory","comments":"17 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the behaviour of spin $1/2$ charmed baryons as the temperature\nincreases. We make use of anisotropic lattice QCD simulations with $N_f = 2 +\n1$ dynamical flavours. After determining the positive and negative parity\nground state masses at the lowest temperature, we investigate the effect of\nrising temperature using ratios of thermal lattice correlators with both\nso-called reconstructed correlators and with simple model correlators. This\navoids difficulties associated with non-zero temperature fitting or spectral\nreconstruction. We find that temperature effects are prominent throughout the\nhadronic phase for all negative parity channels considered and for some\npositive parity channels. Subsequently and where possible, we determine the\nmasses of the ground states as a function of temperature. Finally we consider\nthe effect of chiral symmetry restoration and extract an estimate of the\npseudocritical temperature from singly charmed baryonic correlators.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:43:42 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aarts","Gert",""],["Allton","Chris",""],["Anwar","M. Naeem",""],["Bignell","Ryan",""],["Burns","Timothy J.",""],["J\u00e4ger","Benjamin",""],["Skullerud","Jon-Ivar",""]]}
{"id":"2308.12208","submitter":"Fulton Gonzalez","authors":"Fulton Gonzalez, Tomoyuki Kakehi, Jens Christensen, Jue Wang","title":"The Snapshot Problem for the Wave equation","comments":"47 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By definition, a wave is a $C^\\infty$ solution $u(x,t)$ of the wave equation\non $\\mathbb R^n$, and a snapshot of the wave $u$ at time $t$ is the function\n$u_t$ on $\\mathbb R^n$ given by $u_t(x)=u(x,t)$. We show that there are\ninfinitely many waves with given $C^\\infty$ snapshots $f_0$ and $f_1$ at times\n$t=0$ and $t=1$ respectively, but that all such waves have the same snapshots\nat integer times. We present a necessary condition for the uniqueness, and a\ncompatibility condition for the existence, of a wave $u$ to have three given\nsnapshots at three different times, and we show how this compatibility\ncondition leads to the problem of small denominators and Liouville numbers. We\nextend our results to shifted wave equations on noncompact symmetric spaces.\nFinally, we consider the two-snapshot problem and corresponding small\ndenominator results for the shifted wave equation on the $n$-sphere.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:44:29 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gonzalez","Fulton",""],["Kakehi","Tomoyuki",""],["Christensen","Jens",""],["Wang","Jue",""]]}
{"id":"2308.12209","submitter":"Arash Dizqah","authors":"Mobolaji O. Orisatoki, Mahdi Amouzadi, Arash M. Dizqah","title":"A Heuristic Informative-Path-Planning Algorithm for Autonomous Mapping\n  of Unknown Areas","comments":"11 Pages, 11 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Informative path planning algorithms are of paramount importance in\napplications like disaster management to efficiently gather information through\na priori unknown environments. This is, however, a complex problem that\ninvolves finding a globally optimal path that gathers the maximum amount of\ninformation (e.g., the largest map with a minimum travelling distance) while\nusing partial and uncertain local measurements. This paper addresses this\nproblem by proposing a novel heuristic algorithm that continuously estimates\nthe potential mapping gain for different sub-areas across the partially created\nmap, and then uses these estimations to locally navigate the robot.\nFurthermore, this paper presents a novel algorithm to calculate a benchmark\nsolution, where the map is a priori known to the planar, to evaluate the\nefficacy of the developed heuristic algorithm over different test scenarios.\nThe findings indicate that the efficiency of the proposed algorithm, measured\nin terms of the mapped area per unit of travelling distance, ranges from 70% to\n80% of the benchmark solution in various test scenarios. In essence, the\nalgorithm demonstrates the capability to generate paths that come close to the\nglobally optimal path provided by the benchmark solution.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:47:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Orisatoki","Mobolaji O.",""],["Amouzadi","Mahdi",""],["Dizqah","Arash M.",""]]}
{"id":"2308.12210","submitter":"Fumiyuki Kato","authors":"Fumiyuki Kato, Li Xiong, Shun Takagi, Yang Cao, Masatoshi Yoshikawa","title":"ULDP-FL: Federated Learning with Across Silo User-Level Differential\n  Privacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Differentially Private Federated Learning (DP-FL) has garnered attention as a\ncollaborative machine learning approach that ensures formal privacy. Most DP-FL\napproaches ensure DP at the record-level within each silo for cross-silo FL.\nHowever, a single user's data may extend across multiple silos, and the desired\nuser-level DP guarantee for such a setting remains unknown. In this study, we\npresent ULDP-FL, a novel FL framework designed to guarantee user-level DP in\ncross-silo FL where a single user's data may belong to multiple silos. Our\nproposed algorithm directly ensures user-level DP through per-user weighted\nclipping, departing from group-privacy approaches. We provide a theoretical\nanalysis of the algorithm's privacy and utility. Additionally, we enhance the\nalgorithm's utility and showcase its private implementation using cryptographic\nbuilding blocks. Empirical experiments on real-world datasets show substantial\nimprovements in our methods in privacy-utility trade-offs under user-level DP\ncompared to baseline methods. To the best of our knowledge, our work is the\nfirst FL framework that effectively provides user-level DP in the general\ncross-silo FL setting.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:50:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kato","Fumiyuki",""],["Xiong","Li",""],["Takagi","Shun",""],["Cao","Yang",""],["Yoshikawa","Masatoshi",""]]}
{"id":"2308.12211","submitter":"Michal Sroka PhD","authors":"Michal Sroka and Mohammadreza Fani Sani","title":"Recording of 50 Business Assignments","comments":"6 pages. Describes a dataset published in github","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the main use cases of process mining is to discover and analyze how\nusers follow business assignments, providing valuable insights into process\nefficiency and optimization. In this paper, we present a comprehensive dataset\nconsisting of 50 real business processes. The dataset holds significant\npotential for research in various applications, including task mining and\nprocess automation which is a valuable resource for researchers and\npractitioners.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:58:13 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sroka","Michal",""],["Sani","Mohammadreza Fani",""]]}
{"id":"2308.12212","submitter":"Xingyue (Stacy) Pu","authors":"Xingyue Pu, Stefan Zohren, Stephen Roberts, and Xiaowen Dong","title":"Learning to Learn Financial Networks for Optimising Momentum Strategies","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM cs.AI cs.LG q-fin.TR stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Network momentum provides a novel type of risk premium, which exploits the\ninterconnections among assets in a financial network to predict future returns.\nHowever, the current process of constructing financial networks relies heavily\non expensive databases and financial expertise, limiting accessibility for\nsmall-sized and academic institutions. Furthermore, the traditional approach\ntreats network construction and portfolio optimisation as separate tasks,\npotentially hindering optimal portfolio performance. To address these\nchallenges, we propose L2GMOM, an end-to-end machine learning framework that\nsimultaneously learns financial networks and optimises trading signals for\nnetwork momentum strategies. The model of L2GMOM is a neural network with a\nhighly interpretable forward propagation architecture, which is derived from\nalgorithm unrolling. The L2GMOM is flexible and can be trained with diverse\nloss functions for portfolio performance, e.g. the negative Sharpe ratio.\nBacktesting on 64 continuous future contracts demonstrates a significant\nimprovement in portfolio profitability and risk control, with a Sharpe ratio of\n1.74 across a 20-year period.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:51:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pu","Xingyue",""],["Zohren","Stefan",""],["Roberts","Stephen",""],["Dong","Xiaowen",""]]}
{"id":"2308.12213","submitter":"Hualiang Wang","authors":"Hualiang Wang, Yi Li, Huifeng Yao, Xiaomeng Li","title":"CLIPN for Zero-Shot OOD Detection: Teaching CLIP to Say No","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Out-of-distribution (OOD) detection refers to training the model on an\nin-distribution (ID) dataset to classify whether the input images come from\nunknown classes. Considerable effort has been invested in designing various OOD\ndetection methods based on either convolutional neural networks or\ntransformers. However, zero-shot OOD detection methods driven by CLIP, which\nonly require class names for ID, have received less attention. This paper\npresents a novel method, namely CLIP saying no (CLIPN), which empowers the\nlogic of saying no within CLIP. Our key motivation is to equip CLIP with the\ncapability of distinguishing OOD and ID samples using positive-semantic prompts\nand negation-semantic prompts. Specifically, we design a novel learnable no\nprompt and a no text encoder to capture negation semantics within images.\nSubsequently, we introduce two loss functions: the image-text binary-opposite\nloss and the text semantic-opposite loss, which we use to teach CLIPN to\nassociate images with no prompts, thereby enabling it to identify unknown\nsamples. Furthermore, we propose two threshold-free inference algorithms to\nperform OOD detection by utilizing negation semantics from no prompts and the\ntext encoder. Experimental results on 9 benchmark datasets (3 ID datasets and 6\nOOD datasets) for the OOD detection task demonstrate that CLIPN, based on\nViT-B-16, outperforms 7 well-used algorithms by at least 2.34% and 11.64% in\nterms of AUROC and FPR95 for zero-shot OOD detection on ImageNet-1K. Our CLIPN\ncan serve as a solid foundation for effectively leveraging CLIP in downstream\nOOD tasks. The code is available on https://github.com/xmed-lab/CLIPN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:51:36 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 00:48:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Hualiang",""],["Li","Yi",""],["Yao","Huifeng",""],["Li","Xiaomeng",""]]}
{"id":"2308.12214","submitter":"Jamie Holder","authors":"Jamie Holder (for the VERITAS Collaboration)","title":"VERITAS observations of the Be/X-ray binary system LS V +44 17 during a\n  major outburst","comments":"Proceedings paper presented at the 38th International Cosmic Ray\n  Conference (ICRC2023), held 26 July - 3 August, 2023, in Nagoya, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Be/X-ray binary system LS V +44 17 (RX J0440.9+4431) is a potential\nmember of the rare class of gamma-ray binaries. The system is comprised of a Be\nstar and a neutron star companion with an orbital period of 150 days. In\nDecember of 2022, MAXI detected an X-ray outburst from the source, which peaked\nin early January before declining and then re-brightening. During the second\npeak, the flux exceeded 1 Crab in the 15-50 keV range, and exhibited a pulsed\nemission component with a pulse period of 208 seconds. VERITAS observations\nwere conducted close to the peak of the second outburst, from January 24 to\nJanuary 27, 2023. We report here on the search for very high energy (VHE)\ngamma-ray emission in these data.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:51:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Holder","Jamie","","for the VERITAS Collaboration"]]}
{"id":"2308.12215","submitter":"Madelyne Xiao","authors":"Madelyne Xiao, Jonathan Mayer","title":"The Challenges of Machine Learning for Trust and Safety: A Case Study on\n  Misinformation Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the disconnect between scholarship and practice in applying\nmachine learning to trust and safety problems, using misinformation detection\nas a case study. We systematize literature on automated detection of\nmisinformation across a corpus of 270 well-cited papers in the field. We then\nexamine subsets of papers for data and code availability, design missteps,\nreproducibility, and generalizability. We find significant shortcomings in the\nliterature that call into question claimed performance and practicality.\nDetection tasks are often meaningfully distinct from the challenges that online\nservices actually face. Datasets and model evaluation are often\nnon-representative of real-world contexts, and evaluation frequently is not\nindependent of model training. Data and code availability is poor. Models do\nnot generalize well to out-of-domain data. Based on these results, we offer\nrecommendations for evaluating machine learning applications to trust and\nsafety problems. Our aim is for future work to avoid the pitfalls that we\nidentify.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:52:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xiao","Madelyne",""],["Mayer","Jonathan",""]]}
{"id":"2308.12216","submitter":"Sucheng Ren","authors":"Sucheng Ren, Xingyi Yang, Songhua Liu, Xinchao Wang","title":"SG-Former: Self-guided Transformer with Evolving Token Reallocation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision Transformer has demonstrated impressive success across various vision\ntasks. However, its heavy computation cost, which grows quadratically with\nrespect to the token sequence length, largely limits its power in handling\nlarge feature maps. To alleviate the computation cost, previous works rely on\neither fine-grained self-attentions restricted to local small regions, or\nglobal self-attentions but to shorten the sequence length resulting in coarse\ngranularity. In this paper, we propose a novel model, termed as Self-guided\nTransformer~(SG-Former), towards effective global self-attention with adaptive\nfine granularity. At the heart of our approach is to utilize a significance\nmap, which is estimated through hybrid-scale self-attention and evolves itself\nduring training, to reallocate tokens based on the significance of each region.\nIntuitively, we assign more tokens to the salient regions for achieving\nfine-grained attention, while allocating fewer tokens to the minor regions in\nexchange for efficiency and global receptive fields. The proposed SG-Former\nachieves performance superior to state of the art: our base size model achieves\n\\textbf{84.7\\%} Top-1 accuracy on ImageNet-1K, \\textbf{51.2mAP} bbAP on CoCo,\n\\textbf{52.7mIoU} on ADE20K surpassing the Swin Transformer by \\textbf{+1.3\\% /\n+2.7 mAP/ +3 mIoU}, with lower computation costs and fewer parameters. The code\nis available at\n\\href{https://github.com/OliverRensu/SG-Former}{https://github.com/OliverRensu/SG-Former}\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:52:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ren","Sucheng",""],["Yang","Xingyi",""],["Liu","Songhua",""],["Wang","Xinchao",""]]}
{"id":"2308.12217","submitter":"Dario Dennst\\\"adt","authors":"Thomas Berger, Dario Dennst\\\"adt","title":"Funnel MPC for nonlinear systems with arbitrary relative degree","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Model Predictive Control (MPC) scheme Funnel MPC enables output tracking\nof smooth reference signals with prescribed error bounds for nonlinear\nmulti-input multi-output systems with stable internal dynamics. Earlier works\nachieved the control objective for system with relative degree restricted to\none or incorporated additional feasibility constraints in the optimal control\nproblem. Here we resolve these limitations by introducing a modified stage cost\nfunction relying on a weighted sum of the tracking error derivatives. The\nweights need to be sufficiently large and we state explicit lower bounds. Under\nthese assumptions we are able to prove initial and recursive feasibility of the\nnovel Funnel MPC scheme for systems with arbitrary relative degree - without\nrequiring any terminal conditions, a sufficiently long prediction horizon or\nadditional output constraints.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:55:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Berger","Thomas",""],["Dennst\u00e4dt","Dario",""]]}
{"id":"2308.12218","submitter":"Joson Chan","authors":"Xiaojia Chen, Xuanhan Wang, Lianli Gao, Beitao Chen, Jingkuan Song,\n  HenTao Shen","title":"CIParsing: Unifying Causality Properties into Multiple Human Parsing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing methods of multiple human parsing (MHP) apply statistical models to\nacquire underlying associations between images and labeled body parts. However,\nacquired associations often contain many spurious correlations that degrade\nmodel generalization, leading statistical models to be vulnerable to visually\ncontextual variations in images (e.g., unseen image styles/external\ninterventions). To tackle this, we present a causality inspired parsing\nparadigm termed CIParsing, which follows fundamental causal principles\ninvolving two causal properties for human parsing (i.e., the causal diversity\nand the causal invariance). Specifically, we assume that an input image is\nconstructed by a mix of causal factors (the characteristics of body parts) and\nnon-causal factors (external contexts), where only the former ones cause the\ngeneration process of human parsing.Since causal/non-causal factors are\nunobservable, a human parser in proposed CIParsing is required to construct\nlatent representations of causal factors and learns to enforce representations\nto satisfy the causal properties. In this way, the human parser is able to rely\non causal factors w.r.t relevant evidence rather than non-causal factors w.r.t\nspurious correlations, thus alleviating model degradation and yielding improved\nparsing ability. Notably, the CIParsing is designed in a plug-and-play fashion\nand can be integrated into any existing MHP models. Extensive experiments\nconducted on two widely used benchmarks demonstrate the effectiveness and\ngeneralizability of our method.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:56:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Xiaojia",""],["Wang","Xuanhan",""],["Gao","Lianli",""],["Chen","Beitao",""],["Song","Jingkuan",""],["Shen","HenTao",""]]}
{"id":"2308.12219","submitter":"Jiasheng Ye","authors":"Jiasheng Ye, Zaixiang Zheng, Yu Bao, Lihua Qian, Quanquan Gu","title":"Diffusion Language Models Can Perform Many Tasks with Scaling and\n  Instruction-Finetuning","comments":"added references","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The recent surge of generative AI has been fueled by the generative power of\ndiffusion probabilistic models and the scalable capabilities of large language\nmodels. Despite their potential, it remains elusive whether diffusion language\nmodels can solve general language tasks comparable to their autoregressive\ncounterparts. This paper demonstrates that scaling diffusion models w.r.t.\ndata, sizes, and tasks can effectively make them strong language learners. We\nbuild competent diffusion language models at scale by first acquiring knowledge\nfrom massive data via masked language modeling pretraining thanks to their\nintrinsic connections. We then reprogram pretrained masked language models into\ndiffusion language models via diffusive adaptation, wherein task-specific\nfinetuning and instruction finetuning are explored to unlock their versatility\nin solving general language tasks. Experiments show that scaling diffusion\nlanguage models consistently improves performance across downstream language\ntasks. We further discover that instruction finetuning can elicit zero-shot and\nfew-shot in-context learning abilities that help tackle many unseen tasks by\nfollowing natural language instructions, and show promise in advanced and\nchallenging abilities such as reasoning.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:01:12 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 16:32:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ye","Jiasheng",""],["Zheng","Zaixiang",""],["Bao","Yu",""],["Qian","Lihua",""],["Gu","Quanquan",""]]}
{"id":"2308.12220","submitter":"Tristan Roy","authors":"Tristan Roy, Hatem Zaag","title":"The blow-up rate for a loglog non-scaling invariant semilinear wave\n  equation","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider blow-up solutions of a semilinear wave equation with a loglog\nperturbation of the power nonlinearity in the subconformal case, and show that\nthe blow-up rate is given by the solution of the associated ODE which has the\nsame blow-up time. In fact, our result shows an upper bound and a lower bound\nof the blow-up rate, both proportional to the blow-up solution of the\nassociated ODE. The main difficulty comes from the fact that the PDE is not\nscaling invariant.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:01:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Roy","Tristan",""],["Zaag","Hatem",""]]}
{"id":"2308.12221","submitter":"Michael Kleinman","authors":"Michael Kleinman, Alessandro Achille, Stefano Soatto","title":"Critical Learning Periods Emerge Even in Deep Linear Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-bio.NC stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Critical learning periods are periods early in development where temporary\nsensory deficits can have a permanent effect on behavior and learned\nrepresentations. Despite the radical differences between biological and\nartificial networks, critical learning periods have been empirically observed\nin both systems. This suggests that critical periods may be fundamental to\nlearning and not an accident of biology. Yet, why exactly critical periods\nemerge in deep networks is still an open question, and in particular it is\nunclear whether the critical periods observed in both systems depend on\nparticular architectural or optimization details. To isolate the key underlying\nfactors, we focus on deep linear network models, and show that, surprisingly,\nsuch networks also display much of the behavior seen in biology and artificial\nnetworks, while being amenable to analytical treatment. We show that critical\nperiods depend on the depth of the model and structure of the data\ndistribution. We also show analytically and in simulations that the learning of\nfeatures is tied to competition between sources. Finally, we extend our\nanalysis to multi-task learning to show that pre-training on certain tasks can\ndamage the transfer performance on new tasks, and show how this depends on the\nrelationship between tasks and the duration of the pre-training stage. To the\nbest of our knowledge, our work provides the first analytically tractable model\nthat sheds light into why critical learning periods emerge in biological and\nartificial networks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:01:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kleinman","Michael",""],["Achille","Alessandro",""],["Soatto","Stefano",""]]}
{"id":"2308.12222","submitter":"Ramin Mehrabifard","authors":"R. Mehrabifard, H. Mehdian, K. Hajisharifi, E. Amini","title":"Improving cold atmospheric pressure plasma efficacy on breast cancer\n  cells control-ability and mortality by using vitamin C and static magnetic\n  field","comments":null,"journal-ref":null,"doi":"10.1007/s11090-019-10050-5","report-no":null,"categories":"physics.med-ph physics.atom-ph physics.bio-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Since the last decades, there have been numerous reports about the\ninteraction of magnetic field (MF) and cold atmospheric plasma (CAP) with the\nbiological systems, separately. In this manuscript, we have investigated the\ncombined effect of CAP with the static magnetic field (SMF) as an effective\nmethod for cancer cells treatment. MDA-MB-231 breast cancer cells were cultured\nand treated with CAP in different input power and different exposure time in\nthe presence and absence of the SMF. Vitamin C is used in medium, and cell\nviability is investigated in the presence and absence of this antioxidant\ncompound. The MTT assay has been employed to measure cell survival, and then\nT-test and one-way ANOVA are used to assess the significance level of\nquantitative data. In order to determine the migration rate of cancer cells,\nwound healing assay has been carried out. Results show that presence of the SMF\nand vitamin C as well as increasing the input power has a significant role on\nthe attenuation of the survival and migration rate of the cells. The results of\nthe present investigation will greatly contribute to improve the CAP efficiency\nin cancer therapy through using the SMF and vitamin C as a complement to\nconventional CAP therapies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:02:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mehrabifard","R.",""],["Mehdian","H.",""],["Hajisharifi","K.",""],["Amini","E.",""]]}
{"id":"2308.12223","submitter":"Dominik Semmler","authors":"Josef A. Nossek, Dominik Semmler, Michael Joham, and Wolfgang Utschick","title":"Physically Consistent Modelling of Wireless Links with Reconfigurable\n  Intelligent Surfaces Using Multiport Network Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  RISs are an emerging technology for engineering the channels of future\nwireless communication systems. The vast majority of research publications on\nRIS are focussing on system-level optimization and are based on very simplistic\nmodels ignoring basic physical laws. There are only a few publications with a\nfocus on physical modeling. Nevertheless, the widely employed model is still\ninconsistent with basic physical laws. We will show that even with a very\nsimple abstract model based on isotropic radiators, ignoring any mismatch,\nmutual coupling, and losses, each RIS element cannot be modeled to simply\nreflect the incident signal by manipulating its phase only and letting the\namplitude unchanged. We will demonstrate the inconsistencies with the aid of\nvery simple toy examples, even with only one or two RIS elements. Based on\nimpedance parameters, the problems associated with scattering parameters can be\nidentified enabling a correct interpretation of the derived solutions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:03:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Nossek","Josef A.",""],["Semmler","Dominik",""],["Joham","Michael",""],["Utschick","Wolfgang",""]]}
{"id":"2308.12224","submitter":"Ammar Hoori","authors":"Ammar Hoori, Sadeer Al-Kindi, Tao Hu, Yingnan Song, Hao Wu, Juhwan\n  Lee, Nour Tashtish, Pingfu Fu, Robert Gilkeson, Sanjay Rajagopalan, David L.\n  Wilson","title":"Enhancing cardiovascular risk prediction through AI-enabled\n  calcium-omics","comments":"12 pages, 8 figures, 2 tables, 4 pages supplemental, journal paper\n  format (under review)","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Background. Coronary artery calcium (CAC) is a powerful predictor of major\nadverse cardiovascular events (MACE). Traditional Agatston score simply sums\nthe calcium, albeit in a non-linear way, leaving room for improved\ncalcification assessments that will more fully capture the extent of disease.\n  Objective. To determine if AI methods using detailed calcification features\n(i.e., calcium-omics) can improve MACE prediction.\n  Methods. We investigated additional features of calcification including\nassessment of mass, volume, density, spatial distribution, territory, etc. We\nused a Cox model with elastic-net regularization on 2457 CT calcium score\n(CTCS) enriched for MACE events obtained from a large no-cost CLARIFY program\n(ClinicalTri-als.gov Identifier: NCT04075162). We employed sampling techniques\nto enhance model training. We also investigated Cox models with selected\nfeatures to identify explainable high-risk characteristics.\n  Results. Our proposed calcium-omics model with modified synthetic down\nsampling and up sampling gave C-index (80.5%/71.6%) and two-year AUC\n(82.4%/74.8%) for (80:20, training/testing), respectively (sampling was applied\nto the training set only). Results compared favorably to Agatston which gave\nC-index (71.3%/70.3%) and AUC (71.8%/68.8%), respectively. Among calcium-omics\nfeatures, numbers of calcifications, LAD mass, and diffusivity (a measure of\nspatial distribution) were important determinants of increased risk, with dense\ncalcification (>1000HU) associated with lower risk. The calcium-omics model\nreclassified 63% of MACE patients to the high risk group in a held-out test.\nThe categorical net-reclassification index was NRI=0.153.\n  Conclusions. AI analysis of coronary calcification can lead to improved\nresults as compared to Agatston scoring. Our findings suggest the utility of\ncalcium-omics in improved prediction of risk.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:05:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hoori","Ammar",""],["Al-Kindi","Sadeer",""],["Hu","Tao",""],["Song","Yingnan",""],["Wu","Hao",""],["Lee","Juhwan",""],["Tashtish","Nour",""],["Fu","Pingfu",""],["Gilkeson","Robert",""],["Rajagopalan","Sanjay",""],["Wilson","David L.",""]]}
{"id":"2308.12225","submitter":"Claudianor Alves","authors":"Claudianor O. Alves and Ismael S. da Silva","title":"[Existence of multiple solutions for a Schr\\\"ondiger logarithmic\n  equation","comments":"The final version of this paper will appear in Analysis and\n  Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper concerns the existence of multiple solutions for a Schr\\\"odinger\nlogarithmic equation of the form\n  \\begin{equation}\n  \\left\\{\\begin{aligned}\n  -\\varepsilon^2\\Delta u + V(x)u & =u\\log\nu^2,\\;\\;\\mbox{in}\\;\\;\\mathbb{R}^{N},\\nonumber\n  u \\in H^{1}(\\mathbb{R}^{N}),\n  \\end{aligned}\n  \\right.\\leqno{(P_\\varepsilon)}\n  \\end{equation}\n  where $V:\\mathbb{R}^N\\longrightarrow \\mathbb{R}$ is a continuous function\nthat satisfies some technical conditions and $\\varepsilon$ is a positive\nparameter. We will establish the multiplicity of solution for $(P_\\varepsilon)$\nby using the notion of Lusternik-Schnirelmann category, by introducing a new\nfunction space where the energy functional is $C^1$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:07:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Alves","Claudianor O.",""],["da Silva","Ismael S.",""]]}
{"id":"2308.12226","submitter":"L\\'eo Pioge","authors":"L\\'eo Pioge, Benoit Seron, Leonardo Novo and Nicolas J. Cerf","title":"Enhanced bunching of nearly indistinguishable bosons","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In multiphon interference processes, the commonly assumed direct link between\nboson bunching and particle indistinguishability has recently been challenged\nin Seron $\\textit{et al.}$ [Nat. Photon. 17, 702 (2023)]. Exploiting the\nconnection between optical interferometry and matrix permanents, it appeared\nthat bunching effects may surprisingly be enhanced in some interferometers by\npreparing specific states of partially distinguishable photons. Interestingly,\nall the states giving rise to such an anomalous bunching were found to be\n$\\textit{far from}$ the state of perfectly indistinguishable particles, raising\nthe question of whether this intriguing phenomenon might even exist for\n$\\textit{nearly indistinguishable}$ particles. Here, we answer positively this\nphysically motivated question by exploiting some mathematical conjecture on\nmatrix permanents, whose physical interpretation had not yet been unveiled.\nUsing a recently found counterexample to this conjecture, we demonstrate that\nthere is an optical set-up involving 8~photons in 10~modes for which the\nprobability that all photons bunch into two output modes can be enhanced by\napplying a suitable perturbation to the polarization states starting from\nphotons with the same polarization. We also find out that the perturbation that\ndecreases the bunching probability the most is not the one that takes the\nperfectly indistinguishable state towards a fully distinguishable state, as\ncould naively be expected.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:08:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Pioge","L\u00e9o",""],["Seron","Benoit",""],["Novo","Leonardo",""],["Cerf","Nicolas J.",""]]}
{"id":"2308.12227","submitter":"Yinqiu He","authors":"Yinqiu He, Jiajin Sun, Yuang Tian, Zhiliang Ying, and Yang Feng","title":"Semiparametric Modeling and Analysis for Longitudinal Network Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a semiparametric latent space model for analyzing longitudinal\nnetwork data. The model consists of a static latent space component and a\ntime-varying node-specific baseline component. We develop a semiparametric\nefficient score equation for the latent space parameter by adjusting for the\nbaseline nuisance component. Estimation is accomplished through a one-step\nupdate estimator and an appropriately penalized maximum likelihood estimator.\nWe derive oracle error bounds for the two estimators and address\nidentifiability concerns from a quotient manifold perspective. Our approach is\ndemonstrated using the New York Citi Bike Dataset.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:09:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["He","Yinqiu",""],["Sun","Jiajin",""],["Tian","Yuang",""],["Ying","Zhiliang",""],["Feng","Yang",""]]}
{"id":"2308.12228","submitter":"Changyan He","authors":"Adam Schonewille, Changyan He, Cameron Forbrigger, Nancy Wu, James\n  Drake, Thomas Looi, Eric Diller","title":"Electromagnets Under the Table: an Unobtrusive Magnetic Navigation\n  System for Microsurgery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Miniature magnetic tools have the potential to enable minimally invasive\nsurgical techniques to be applied to space-restricted surgical procedures in\nareas such as neurosurgery. However, typical magnetic navigation systems, which\ncreate the magnetic fields to drive such tools, either cannot generate large\nenough fields, or surround the patient in a way that obstructs surgeon access\nto the patient. This paper introduces the design of a magnetic navigation\nsystem with eight electromagnets arranged completely under the operating table,\nto endow the system with maximal workspace accessibility, which allows the\npatient to lie down on the top surface of the system without any constraints.\nThe found optimal geometric layout of the electromagnets maximizes the field\nstrength and uniformity over a reasonable neurosurgical operating volume. The\nsystem can generate non-uniform magnetic fields up to 38 mT along the x and y\naxes and 47 mT along the z axis at a working distance of 120 mm away from the\nactuation system workbench, deep enough to deploy magnetic microsurgical tools\nin the brain. The forces which can be exerted on millimeter-scale magnets used\nin prototype neurosurgical tools are validated experimentally. Due to its large\nworkspace, this system could be used to control milli-robots in a variety of\nsurgical applications.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:09:28 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Schonewille","Adam",""],["He","Changyan",""],["Forbrigger","Cameron",""],["Wu","Nancy",""],["Drake","James",""],["Looi","Thomas",""],["Diller","Eric",""]]}
{"id":"2308.12229","submitter":"Sylvia Wenmackers","authors":"Sylvia Wenmackers","title":"Uniform probability in cosmology","comments":"16 pages; accepted for publication in Studies in History and\n  Philosophy of Science","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph astro-ph.CO math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Problems with uniform probabilities on an infinite support show up in\ncontemporary cosmology. This paper focuses on the context of inflation theory,\nwhere it complicates the assignment of a probability measure over pocket\nuniverses. The measure problem in cosmology, whereby it seems impossible to\npick out a uniquely well-motivated measure, is associated with a paradox that\noccurs in standard probability theory and crucially involves uniformity on an\ninfinite sample space. This problem has been discussed by physicists, albeit\nwithout reference to earlier work on this topic. The aim of this article is\nboth to introduce philosophers of probability to these recent discussions in\ncosmology and to familiarize physicists and philosophers working on cosmology\nwith relevant foundational work by Kolmogorov, de Finetti, Jaynes, and other\nprobabilists. As such, the main goal is not to solve the measure problem, but\nto clarify the exact origin of some of the current obstacles. The analysis of\nthe assumptions going into the paradox indicates that there exist multiple ways\nof dealing consistently with uniform probabilities on infinite sample spaces.\nTaking a pluralist stance towards the mathematical methods used in cosmology\nshows there is some room for progress with assigning probabilities in\ncosmological theories.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:11:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wenmackers","Sylvia",""]]}
{"id":"2308.12230","submitter":"Lucas Feitosa De Souza","authors":"Lucas F. de Souza, Renato F. Miotto and William R. Wolf","title":"Analysis of transient and intermittent flows using a multidimensional\n  empirical mode decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modal decomposition techniques are important tools for the analysis of\nunsteady flows and, in order to provide meaningful insights with respect to\ncoherent structures and their characteristic frequencies, the modes must\npossess a robust spatial support. In this context, although widely used,\nmethods based on singular value decomposition (SVD) may produce modes that are\ndifficult to interpret when applied to problems dominated by intermittent and\ntransient events. Fortunately, specific modal decomposition techniques have\nbeen recently developed to analyze such problems. However, a proper comparison\nbetween existing methods is still lacking from the literature. Therefore, this\nwork compares two recent methods: the fast adaptive multivariate empirical mode\ndecomposition (FA-MVEMD) and the multi-resolution dynamic mode decomposition\n(mrDMD). These techniques are employed here for the study of flow databases\ninvolving transient and intermittent dynamics. Specifically, the investigated\nproblems include an SD7003 airfoil subjected to deep dynamic stall conditions,\nand a steady NACA0012 airfoil operating at a transitional Reynolds number. In\nthe former case, the methods are employed to investigate the onset and\nevolution of the dynamic stall vortex (DSV), while in the latter case,\nintermittent vortex pairing is analyzed. We show that the combination of a\nmultidimensional EMD with the Hilbert transform provides modes with superior\nspatial support when compared to the mrDMD, also allowing the characterization\nof instantaneous frequencies of coherent structures. Moreover, the EMD also\ncondenses a larger amount of information within a single intrinsic mode\nfunction (IMF).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:12:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["de Souza","Lucas F.",""],["Miotto","Renato F.",""],["Wolf","William R.",""]]}
{"id":"2308.12231","submitter":"Qing Xu","authors":"Qing Xu, Wenwei Kuang, Zeyu Zhang, Xueyao Bao, Haoran Chen, Wenting\n  Duan","title":"SPPNet: A Single-Point Prompt Network for Nuclei Image Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image segmentation plays an essential role in nuclei image analysis.\nRecently, the segment anything model has made a significant breakthrough in\nsuch tasks. However, the current model exists two major issues for cell\nsegmentation: (1) the image encoder of the segment anything model involves a\nlarge number of parameters. Retraining or even fine-tuning the model still\nrequires expensive computational resources. (2) in point prompt mode, points\nare sampled from the center of the ground truth and more than one set of points\nis expected to achieve reliable performance, which is not efficient for\npractical applications. In this paper, a single-point prompt network is\nproposed for nuclei image segmentation, called SPPNet. We replace the original\nimage encoder with a lightweight vision transformer. Also, an effective\nconvolutional block is added in parallel to extract the low-level semantic\ninformation from the image and compensate for the performance degradation due\nto the small image encoder. We propose a new point-sampling method based on the\nGaussian kernel. The proposed model is evaluated on the MoNuSeg-2018 dataset.\nThe result demonstrated that SPPNet outperforms existing U-shape architectures\nand shows faster convergence in training. Compared to the segment anything\nmodel, SPPNet shows roughly 20 times faster inference, with 1/70 parameters and\ncomputational cost. Particularly, only one set of points is required in both\nthe training and inference phases, which is more reasonable for clinical\napplications. The code for our work and more technical details can be found at\nhttps://github.com/xq141839/SPPNet.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:13:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Xu","Qing",""],["Kuang","Wenwei",""],["Zhang","Zeyu",""],["Bao","Xueyao",""],["Chen","Haoran",""],["Duan","Wenting",""]]}
{"id":"2308.12232","submitter":"Claude Quitt\\'e","authors":"Claude Quitt\\'e and Claire T\\^ete","title":"Une approche combinatoire pour le r\\'esultant multivari\\'e. Le\n  r\\'esultant multivari\\'e pour les enfants motiv\\'es","comments":"474 pages, in French language","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide, in a 474 pages study, a comprehensive and self-contained\ntreatment of Resultant Theory for a homogeneous system of polynomials with\nseveral variables (as many variables as of polynomials).\n  In a non classical way, we use the multiplicative structure of finite free\nresolutions, by applying it to the complex homogeneous components of the Koszul\ncomplex of the system, and this in any degree. Moreover, these complexes have\nMacaulay decompositions. These three pillars, multiplicative structure, Koszul\ncomplex, Macaulay decomposition, allow to establish, surprisingly to us,\nremarkable binomial relations between 3 families of scalars resulting from the\ndifferentials of that complexes. These binomial relations generate several\nnotable results, like a determinantal expression of a certain denominator,\ndepending only on the first differential, and provide in particular formulas\nexpressing the resultant. We have explored more deeply the case of the critical\ndegree delta. This degree produces a fundamental linear form on the homogeneous\npolynomial component of degree delta, including the resultant. And this\nfundamental linear form has allowed us to highlight a certain number of\nremarkable properties.\n  Key words: Elimination theory, homogeneous polynomial system, resultant,\ndeterminant of complexes, Cayley determinant, computational algebra, finitefree\nresolution, Koszul complex, Euler characteristic, Grade, Multiplicative\nstructure, Macaulay decomposition, Fitting invariants, MacRae invariant,\nregular sequence.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:14:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Quitt\u00e9","Claude",""],["T\u00eate","Claire",""]]}
{"id":"2308.12233","submitter":"Adil Meraki","authors":"Adil Meraki, Lucy Elson, Nok Ho, Ali Akbar, Marcin Ko\\'zbia{\\l}, Jan\n  Ko{\\l}ody\\'nski and Kasper Jensen","title":"Zero-field optical magnetometer based on spin-alignment","comments":"Main text is 11 pages and 7 figures, and the supplementary is 6 pages\n  and 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.atom-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optically-pumped magnetometers are an important instrument for imaging\nbiological magnetic signals without the need for cryogenic cooling. These\nmagnetometers are presently available in the commercial market and utilize the\nprinciples of atomic alignment or orientation, enabling remarkable sensitivity\nand precision in the measurement of magnetic fields. This research focuses on\nutilizing a spin-aligned atomic ensemble for magnetometry at zero-field. A\nnovel approach is introduced, which involves evaluating how the linear\npolarization of light rotates as it passes through the atomic vapor to null the\nmagnetic field. Analytical expressions are derived for the resulting spin\nalignment and photodetection signals. Experimental results are provided,\ndemonstrating good agreement with the theoretical predictions. The sensitivity\nand bandwidth of the magnetometer are characterized based on the detected\npolarization rotation signal. Lastly, the practical utility of the magnetometer\nfor medical applications is demonstrated by successfully detecting a synthetic\ncardiac signal.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:15:10 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Meraki","Adil",""],["Elson","Lucy",""],["Ho","Nok",""],["Akbar","Ali",""],["Ko\u017abia\u0142","Marcin",""],["Ko\u0142ody\u0144ski","Jan",""],["Jensen","Kasper",""]]}
{"id":"2308.12234","submitter":"Lucas Morin","authors":"Lucas Morin, Martin Danelljan, Maria Isabel Agea, Ahmed Nassar, Valery\n  Weber, Ingmar Meijer, Peter Staar, Fisher Yu","title":"MolGrapher: Graph-based Visual Recognition of Chemical Structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The automatic analysis of chemical literature has immense potential to\naccelerate the discovery of new materials and drugs. Much of the critical\ninformation in patent documents and scientific articles is contained in\nfigures, depicting the molecule structures. However, automatically parsing the\nexact chemical structure is a formidable challenge, due to the amount of\ndetailed information, the diversity of drawing styles, and the need for\ntraining data. In this work, we introduce MolGrapher to recognize chemical\nstructures visually. First, a deep keypoint detector detects the atoms. Second,\nwe treat all candidate atoms and bonds as nodes and put them in a graph. This\nconstruct allows a natural graph representation of the molecule. Last, we\nclassify atom and bond nodes in the graph with a Graph Neural Network. To\naddress the lack of real training data, we propose a synthetic data generation\npipeline producing diverse and realistic results. In addition, we introduce a\nlarge-scale benchmark of annotated real molecule images, USPTO-30K, to spur\nresearch on this critical topic. Extensive experiments on five datasets show\nthat our approach significantly outperforms classical and learning-based\nmethods in most settings. Code, models, and datasets are available.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:16:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Morin","Lucas",""],["Danelljan","Martin",""],["Agea","Maria Isabel",""],["Nassar","Ahmed",""],["Weber","Valery",""],["Meijer","Ingmar",""],["Staar","Peter",""],["Yu","Fisher",""]]}
{"id":"2308.12235","submitter":"Jonah Duncan","authors":"Jonah A. J. Duncan, Yannick Sire, Joel Spruck","title":"An improved eigenvalue estimate for embedded minimal hypersurfaces in\n  the sphere","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Suppose that $\\Sigma^n\\subset\\mathbb{S}^{n+1}$ is a closed embedded minimal\nhypersurface. We prove that the first non-zero eigenvalue $\\lambda_1$ of the\ninduced Laplace-Beltrami operator on $\\Sigma$ satisfies $\\lambda_1 \\geq\n\\frac{n}{2}+ a_n(\\Lambda^6 + b_n)^{-1}$, where $a_n$ and $b_n$ are explicit\ndimensional constants and $\\Lambda$ is an upper bound for the length of the\nsecond fundamental form of $\\Sigma$. This provides the first explicitly\ncomputable improvement on Choi & Wang's lower bound $\\lambda_1 \\geq\n\\frac{n}{2}$ without any further assumptions on $\\Sigma$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:19:40 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Duncan","Jonah A. J.",""],["Sire","Yannick",""],["Spruck","Joel",""]]}
{"id":"2308.12236","submitter":"Angel Rincon","authors":"Gabriel Abell\\'an, Angel Rincon and Eduard Sanchez","title":"A Generalized Double Chaplygin Model for Anisotropic Matter: The\n  Newtonian Case","comments":"14 pages, 3 figures. Matches the published version (invited\n  contribution to the Journal Universe)","journal-ref":"Universe 9 (2023) 1-14","doi":"10.3390/universe9080352","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we investigate astrophysical systems in a Newtonian regime\nusing anisotropic matter. For this purpose, we considered that both radial and\ntangential pressures satisfy a generalized Chaplygin-type equation of state.\nUsing this model, we found the Lane--Emden equation for this system and solved\nit numerically for several sets of parameters. Finally, we explored the mass\nsupported by this physical system and compared it with the Chandrasekhar mass.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:22:33 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Abell\u00e1n","Gabriel",""],["Rincon","Angel",""],["Sanchez","Eduard",""]]}
{"id":"2308.12237","submitter":"Sergey Antonyan","authors":"Sergey Antonyan","title":"Extension properties of orbit spaces of proper actions revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a locally compact Hausdorff group. We study orbit spaces of\nequivariant absolute neighborhood extensors ($G$-${\\rm ANE}$'s) in the class of\nall proper $G$-spaces that are metrizable by a $G$-invariant metric.\n  We prove that if a proper $G$-space $X$ is a $G$-${\\rm ANE}$ and all $G\n$-orbits in $X$ are metrizable, then the $G$-orbit space $X/G$ is an {\\rm ANE}.\nIf $G$ is a Lie group and $H$ is a closed normal subgroup of $G$, then the\n$H$-orbit space $X/H$ is a $G/H$-{\\rm ANE}.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:24:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Antonyan","Sergey",""]]}
{"id":"2308.12238","submitter":"Christian Lenz","authors":"Christian Lenz, Max Schwarz, Andre Rochow, Bastian P\\\"atzold, Raphael\n  Memmesheimer, Michael Schreiber, and Sven Behnke","title":"NimbRo wins ANA Avatar XPRIZE Immersive Telepresence Competition:\n  Human-Centric Evaluation and Lessons Learned","comments":"C. Lenz and M. Schwarz contributed equally. Accepted for\n  International Journal of Social Robotics (SORO), Springer, to appear 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robotic avatar systems can enable immersive telepresence with locomotion,\nmanipulation, and communication capabilities. We present such an avatar system,\nbased on the key components of immersive 3D visualization and transparent\nforce-feedback telemanipulation. Our avatar robot features an anthropomorphic\nupper body with dexterous hands. The remote human operator drives the arms and\nfingers through an exoskeleton-based operator station, which provides force\nfeedback both at the wrist and for each finger. The robot torso is mounted on a\nholonomic base, providing omnidirectional locomotion on flat floors, controlled\nusing a 3D rudder device. Finally, the robot features a 6D movable head with\nstereo cameras, which stream images to a VR display worn by the operator.\nMovement latency is hidden using spherical rendering. The head also carries a\ntelepresence screen displaying an animated image of the operator's face,\nenabling direct interaction with remote persons. Our system won the \\$10M ANA\nAvatar XPRIZE competition, which challenged teams to develop intuitive and\nimmersive avatar systems that could be operated by briefly trained judges. We\nanalyze our successful participation in the semifinals and finals and provide\ninsight into our operator training and lessons learned. In addition, we\nevaluate our system in a user study that demonstrates its intuitive and easy\nusability.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:25:13 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 17:30:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lenz","Christian",""],["Schwarz","Max",""],["Rochow","Andre",""],["P\u00e4tzold","Bastian",""],["Memmesheimer","Raphael",""],["Schreiber","Michael",""],["Behnke","Sven",""]]}
{"id":"2308.12239","submitter":"Sean McGuinness","authors":"Sean McGuinness","title":"Cyclic Orderings of Paving Matroids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A matroid M is cyclically orderable if there is a cyclic permutation of the\nelements of M such that any r consecutive elements form a basis in M. An old\nconjecture of Kajitani, Miyano, and Ueno states that a matroid M is cyclically\norderable if and only if for all nonempty subsets X in E(M), |X|/r(M) is less\nthan or equal to |E(M)|/r(M). In this paper, we verify this conjecture for all\npaving matroids.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:27:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["McGuinness","Sean",""]]}
{"id":"2308.12240","submitter":"Alain Oliviero Durmus","authors":"Giovanni Conforti, Alain Durmus, Marta Gentiloni Silveri","title":"Score diffusion models without early stopping: finite Fisher information\n  is all you need","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion models are a new class of generative models that revolve around the\nestimation of the score function associated with a stochastic differential\nequation. Subsequent to its acquisition, the approximated score function is\nthen harnessed to simulate the corresponding time-reversal process, ultimately\nenabling the generation of approximate data samples. Despite their evident\npractical significance these models carry, a notable challenge persists in the\nform of a lack of comprehensive quantitative results, especially in scenarios\ninvolving non-regular scores and estimators. In almost all reported bounds in\nKullback Leibler (KL) divergence, it is assumed that either the score function\nor its approximation is Lipschitz uniformly in time. However, this condition is\nvery restrictive in practice or appears to be difficult to establish.\n  To circumvent this issue, previous works mainly focused on establishing\nconvergence bounds in KL for an early stopped version of the diffusion model\nand a smoothed version of the data distribution, or assuming that the data\ndistribution is supported on a compact manifold. These explorations have lead\nto interesting bounds in either Wasserstein or Fortet-Mourier metrics. However,\nthe question remains about the relevance of such early-stopping procedure or\ncompactness conditions. In particular, if there exist a natural and mild\ncondition ensuring explicit and sharp convergence bounds in KL.\n  In this article, we tackle the aforementioned limitations by focusing on\nscore diffusion models with fixed step size stemming from the\nOrnstein-Ulhenbeck semigroup and its kinetic counterpart. Our study provides a\nrigorous analysis, yielding simple, improved and sharp convergence bounds in KL\napplicable to any data distribution with finite Fisher information with respect\nto the standard Gaussian distribution.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:31:08 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Conforti","Giovanni",""],["Durmus","Alain",""],["Silveri","Marta Gentiloni",""]]}
{"id":"2308.12241","submitter":"Junling Liu","authors":"Junling Liu, Chao Liu, Peilin Zhou, Qichen Ye, Dading Chong, Kang\n  Zhou, Yueqi Xie, Yuwei Cao, Shoujin Wang, Chenyu You, Philip S.Yu","title":"LLMRec: Benchmarking Large Language Models on Recommendation Task","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, the fast development of Large Language Models (LLMs) such as\nChatGPT has significantly advanced NLP tasks by enhancing the capabilities of\nconversational models. However, the application of LLMs in the recommendation\ndomain has not been thoroughly investigated. To bridge this gap, we propose\nLLMRec, a LLM-based recommender system designed for benchmarking LLMs on\nvarious recommendation tasks. Specifically, we benchmark several popular\noff-the-shelf LLMs, such as ChatGPT, LLaMA, ChatGLM, on five recommendation\ntasks, including rating prediction, sequential recommendation, direct\nrecommendation, explanation generation, and review summarization. Furthermore,\nwe investigate the effectiveness of supervised finetuning to improve LLMs'\ninstruction compliance ability. The benchmark results indicate that LLMs\ndisplayed only moderate proficiency in accuracy-based tasks such as sequential\nand direct recommendation. However, they demonstrated comparable performance to\nstate-of-the-art methods in explainability-based tasks. We also conduct\nqualitative evaluations to further evaluate the quality of contents generated\nby different models, and the results show that LLMs can truly understand the\nprovided information and generate clearer and more reasonable results. We\naspire that this benchmark will serve as an inspiration for researchers to\ndelve deeper into the potential of LLMs in enhancing recommendation\nperformance. Our codes, processed data and benchmark results are available at\nhttps://github.com/williamliujl/LLMRec.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:32:54 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Junling",""],["Liu","Chao",""],["Zhou","Peilin",""],["Ye","Qichen",""],["Chong","Dading",""],["Zhou","Kang",""],["Xie","Yueqi",""],["Cao","Yuwei",""],["Wang","Shoujin",""],["You","Chenyu",""],["Yu","Philip S.",""]]}
{"id":"2308.12242","submitter":"Linda Cai","authors":"Hedyeh Beyhaghi and Linda Cai","title":"Recent Developments in Pandora's Box Problem: Variants and Applications","comments":"The survey appears in ACM SIGecom Exchanges, Vol. 21, No. 1, June\n  2023. https://www.sigecom.org/exchanges/volume_21/1/BEYHAGHI.pdf","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.DS econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1979, Weitzman introduced Pandora's box problem as a framework for\nsequential search with costly inspections. Recently, there has been a surge of\ninterest in Pandora's box problem, particularly among researchers working at\nthe intersection of economics and computation. This survey provides an overview\nof the recent literature on Pandora's box problem, including its latest\nextensions and applications in areas such as market design, decision theory,\nand machine learning.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:39:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Beyhaghi","Hedyeh",""],["Cai","Linda",""]]}
{"id":"2308.12243","submitter":"Sedjro Salomon Hotegni","authors":"S. S. Hotegni, S. Peitz, M. Berkemeier","title":"Multi-Objective Optimization for Sparse Deep Neural Network Training","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Different conflicting optimization criteria arise naturally in various Deep\nLearning scenarios. These can address different main tasks (i.e., in the\nsetting of Multi-Task Learning), but also main and secondary tasks such as loss\nminimization versus sparsity. The usual approach is a simple weighting of the\ncriteria, which formally only works in the convex setting. In this paper, we\npresent a Multi-Objective Optimization algorithm using a modified Weighted\nChebyshev scalarization for training Deep Neural Networks (DNNs) with respect\nto several tasks. By employing this scalarization technique, the algorithm can\nidentify all optimal solutions of the original problem while reducing its\ncomplexity to a sequence of single-objective problems. The simplified problems\nare then solved using an Augmented Lagrangian method, enabling the use of\npopular optimization techniques such as Adam and Stochastic Gradient Descent,\nwhile efficaciously handling constraints. Our work aims to address the\n(economical and also ecological) sustainability issue of DNN models, with a\nparticular focus on Deep Multi-Task models, which are typically designed with a\nvery large number of weights to perform equally well on multiple tasks. Through\nexperiments conducted on two Machine Learning datasets, we demonstrate the\npossibility of adaptively sparsifying the model during training without\nsignificantly impacting its performance, if we are willing to apply\ntask-specific adaptations to the network weights. Code is available at\nhttps://github.com/salomonhotegni/MDMTN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:42:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Hotegni","S. S.",""],["Peitz","S.",""],["Berkemeier","M.",""]]}
{"id":"2308.12244","submitter":"Guy Fowler","authors":"Vahagn Aslanyan, Sebastian Eterovi\\'c, Guy Fowler","title":"Multiplicative relations among differences of singular moduli","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $n \\in \\mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and\nfinitely many algebraic curves $T_1, \\ldots, T_k$ with the following property:\nif $(x_1, \\ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular\nmoduli such that $\\prod_{i=1}^n (x_i - y)^{a_i}=1$ for some $a_1, \\ldots, a_n\n\\in \\mathbb{Z} \\setminus \\{0\\}$, then $(x_1, \\ldots, x_n, y) \\in V \\cup T_1\n\\cup \\ldots \\cup T_k$. Further, the curves $T_1, \\ldots, T_k$ may be determined\nexplicitly for a given $n$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:43:09 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Aslanyan","Vahagn",""],["Eterovi\u0107","Sebastian",""],["Fowler","Guy",""]]}
{"id":"2308.12245","submitter":"Sam Farrington","authors":"Sam Farrington","title":"On the minimisation of Neumann and Zaremba eigenvalues","comments":"37 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider minimising the $k$-th eigenvalue of the Laplacian under Neumann\nand mixed Dirichlet-Neumann, so-called Zaremba, boundary conditions over\ncollections of convex domains with prescribed perimeter or diameter constraint.\nWe determine when one has the existence of minimisers and consider the\nasymptotic behaviour of sequences of such minimisers, when they do exist, as\n$k\\to + \\infty$. A key element of our proofs involves ascertaining results\nconcerning the geometric stability of Weyl's law.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:45:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Farrington","Sam",""]]}
{"id":"2308.12246","submitter":"Gayathrini Premawardhana","authors":"Gayathrini Premawardhana, Jonathan Kunjummen, Sarthak Subhankar, and\n  Jacob M. Taylor","title":"Investigating the feasibility of a trapped atom interferometer with\n  movable traps","comments":"22 pages. 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atom interferometers can be used to obtain information about accelerations\nand fields, whether this may be in the investigation of fundamental aspects of\nphysics, such as measuring fundamental constants or testing gravity, or as part\nof a measurement device, such as for inertial navigation. Today's\ninterferometers benefit from creating larger separations between the two paths\nfor the atoms and from having long periods of freefall, which combine to create\na larger spacetime area. However, longer freefall also reduces the bandwidth of\nthe sampling that these interferometers can provide; thus a key priority has\nbeen to increase the separation by use of increasingly complex optical setups.\nHere we consider the additional benefits of using trapped atoms for these\ntasks, by examining theoretically the benefit of holding and moving the atoms\nusing optical tweezer traps. We specifically find that accelerations of up to\n$10^{3}$-$10^{5}$ m/s$^2$ can be achieved in a relatively small field of view,\nalthough laser intensity noise may limit trapping times to as short as a\nmillisecond in some settings, which nonetheless leads to improved overall\nperformance in high bandwidth measurement settings. At the same time, when\nlaser intensity correlations between the two traps can be made high, much\nlonger coherence times are possible, enabling compact devices with long hold\ntimes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:46:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Premawardhana","Gayathrini",""],["Kunjummen","Jonathan",""],["Subhankar","Sarthak",""],["Taylor","Jacob M.",""]]}
{"id":"2308.12247","submitter":"Chiwun Yang","authors":"Timothy Chu, Zhao Song, Chiwun Yang","title":"How to Protect Copyright Data in Optimization of Large Language Models?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large language models (LLMs) and generative AI have played a transformative\nrole in computer research and applications. Controversy has arisen as to\nwhether these models output copyrighted data, which can occur if the data the\nmodels are trained on is copyrighted. LLMs are built on the transformer neural\nnetwork architecture, which in turn relies on a mathematical computation called\nAttention that uses the softmax function.\n  In this paper, we show that large language model training and optimization\ncan be seen as a softmax regression problem. We then establish a method of\nefficiently performing softmax regression, in a way that prevents the\nregression function from generating copyright data. This establishes a\ntheoretical method of training large language models in a way that avoids\ngenerating copyright data.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:48:04 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chu","Timothy",""],["Song","Zhao",""],["Yang","Chiwun",""]]}
{"id":"2308.12248","submitter":"Stylianos E. Trevlakis Dr.","authors":"Alexandros-Apostolos A. Boulogeorgos, Stylianos Trevlakis, and\n  Theodoros A. Tsiftsis","title":"Holographic RIS Empowered THz Communications with Hardware Imperfections\n  under Adverse Weather Conditions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper focuses on providing a theoretical framework for the evaluation of\nthe performance of holographic reconfigurable intelligent surface (HRIS)\nempowered terahertz (THz) wireless systems under fog conditions. In more\ndetail, we present a comprehensive methodology for evaluating the geometric\nlosses of the end-to-end channel. Moreover, the stochastic nature of the\nend-to-end channel is characterized by novel closed-form probability density\nand cumulative distribution functions. Building upon them, the outage\nprobability and the throughput of the system are extracted in closed form.\nThese formulas account for the impact of transceiver hardware imperfections and\nare expected to become useful tools for the design of HRIS empowered THz\nwireless systems due to its remarkable engineering insights.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:48:23 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Boulogeorgos","Alexandros-Apostolos A.",""],["Trevlakis","Stylianos",""],["Tsiftsis","Theodoros A.",""]]}
{"id":"2308.12249","submitter":"Jorge David Castano-Yepes","authors":"Jorge David Casta\\~no-Yepes, Marcelo Loewe, Enrique Mu\\~noz, Juan\n  Crist\\'obal Rojas","title":"QED Fermions in a noisy magnetic field background: The effective action\n  approach","comments":"14 pages, 7 figures. This work is an extension of arXiv:2211.16985.\n  arXiv admin note: text overlap with arXiv:2211.16985","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the effects of a noisy magnetic field background over the fermion\npropagator in QED, as an approximation to the spatial inhomogeneities and\ntime-fluctuations that would naturally arise in certain physical scenarios,\nsuch as heavy-ion collisions or the quark-gluon plasma in the early stages of\nthe evolution of the Universe. We considered a classical, finite and uniform\naverage magnetic field background $\\langle\n\\mathbf{B}(\\mathbf{x})\\rangle_{\\Delta} = \\mathbf{B}$, subject to white-noise\nfluctuations with auto-correlation of magnitude $\\Delta_B$. By means of the\nSchwinger representation of the propagator in the average magnetic field as a\nreference system, we used the replica formalism to study the effects of the\nmagnetic noise at the mean field level, in terms of a vector order parameter\n$Q_j = \\ii e \\Delta_B\\langle\\langle \\bar{\\psi}\\gamma_j\\psi\n\\rangle\\rangle_{\\Delta}$ whose magnitude represents the ensemble average (over\nmagnetic noise) of the fermion currents. We identified the region where this\norder parameter acquires a finite value, thus breaking the $U(1)$-symmetry of\nthe model due to the presence of the magnetic noise.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:53:01 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Casta\u00f1o-Yepes","Jorge David",""],["Loewe","Marcelo",""],["Mu\u00f1oz","Enrique",""],["Rojas","Juan Crist\u00f3bal",""]]}
{"id":"2308.12250","submitter":"Robert Hoye","authors":"Yi-Teng Huang, Davide Nodari, Francesco Furlan, Youcheng Zhang, Marin\n  Rusu, Linjie Dai, Zahra Andaji-Garmaroudi, Samuel D. Stranks, Henning\n  Sirringhaus, Akshay Rao, Nicola Gasparini, and Robert L. Z. Hoye","title":"Fast near-infrared photodetectors based on nontoxic and\n  solution-processable AgBiS2","comments":"29 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solution-processable near-infrared (NIR) photodetectors are urgently needed\nfor a wide range of next-generation electronics, including sensors, optical\ncommunications and bioimaging. However, there is currently a compromise between\nlow toxicity and slow (<300 kHz cut-off frequency) organic materials versus\nfaster detectors (>300 kHz cut-off frequency) based on compounds containing\ntoxic lead or cadmium. Herein, we circumvent this trade-off by developing\nsolution-processed AgBiS2 photodetectors with high cut-off frequencies under\nboth white light (>1 MHz) and NIR (approaching 500 kHz) illumination. These\nhigh cut-off frequencies are due to the short transit distances of\ncharge-carriers in the AgBiS2 photodetectors, which arise from the strong light\nabsorption of these materials, such that film thicknesses well below 120 nm are\nadequate to absorb >65% of near-infrared to visible light. By finely\ncontrolling the thickness of the photoactive layer, we can modulate the\ncharge-collection efficiency, achieve low dark current densities, and minimize\nthe effects of ion migration to realize fast photodetectors that are stable in\nair. These outstanding characteristics enable real-time heartbeat sensors based\non NIR AgBiS2 photodetectors.\n  # equal contribution, * corresponding authors\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:58:46 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Huang","Yi-Teng",""],["Nodari","Davide",""],["Furlan","Francesco",""],["Zhang","Youcheng",""],["Rusu","Marin",""],["Dai","Linjie",""],["Andaji-Garmaroudi","Zahra",""],["Stranks","Samuel D.",""],["Sirringhaus","Henning",""],["Rao","Akshay",""],["Gasparini","Nicola",""],["Hoye","Robert L. Z.",""]]}
{"id":"2308.12251","submitter":"Tib\\'erio De Paula Netto","authors":"Tib\\'erio de Paula Netto, Breno L. Giacchini, Nicol\\`o Burzill\\`a,\n  Leonardo Modesto","title":"Regular black holes from higher-derivative and nonlocal gravity: The\n  smeared delta source approximation","comments":"33 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we study static spherically symmetric solutions of effective\nfield equations related to local and nonlocal higher-derivative gravity models,\nbased on the effective delta source approximation. We discuss several\npossibilities for the equations of state, and how they influence the solutions.\nIn particular, we present an equation of state such that the solutions match\nthe Newtonian-limit metric in both regimes of large and small $r$. A\nsignificant part of the work is dedicated to the study of the regularity of the\nsolutions and the comparison with the linearized solutions. Explicit solutions\nare presented for some cases of local and nonlocal models. The results obtained\nhere can be regarded as a possible link between the previous researches on\nlinearized higher-derivative gravity and the solutions of the nonlinear\ncomplete field equations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:01:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Netto","Tib\u00e9rio de Paula",""],["Giacchini","Breno L.",""],["Burzill\u00e0","Nicol\u00f2",""],["Modesto","Leonardo",""]]}
{"id":"2308.12252","submitter":"Zhenjiang Mao","authors":"Zhenjiang Mao, Carson Sobolewski, Ivan Ruchkin","title":"How Safe Am I Given What I See? Calibrated Prediction of Safety Chances\n  for Image-Controlled Autonomy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  End-to-end learning has emerged as a major paradigm for developing autonomous\nsystems. Unfortunately, with its performance and convenience comes an even\ngreater challenge of safety assurance. A key factor of this challenge is the\nabsence of the notion of a low-dimensional and interpretable dynamical state,\naround which traditional assurance methods revolve. Focusing on the online\nsafety prediction problem, this paper proposes a configurable family of\nlearning pipelines based on generative world models, which do not require\nlow-dimensional states. To implement these pipelines, we overcome the\nchallenges of learning safety-informed latent representations and missing\nsafety labels under prediction-induced distribution shift. These pipelines come\nwith statistical calibration guarantees on their safety chance predictions\nbased on conformal prediction. We perform an extensive evaluation of the\nproposed learning pipelines on two case studies of image-controlled systems: a\nracing car and a cartpole.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:01:53 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mao","Zhenjiang",""],["Sobolewski","Carson",""],["Ruchkin","Ivan",""]]}
{"id":"2308.12253","submitter":"Maria Laura Di Vacri","authors":"M.L. di Vacri, S. Scorza, A. French, N.D. Rocco, T.D. Schlieder, I.J.\n  Arnquist, E.W. Hoppe, J. Hall","title":"Evaluation of SNOLAB background mitigation procedures through the use of\n  an ICP-MS based dust monitoring methodology","comments":"20 pages, 5 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dust particulate fallout on materials in use for rare-event searches is a\nconcerning source of radioactive backgrounds due to the presence of naturally\noccurring radionuclides K-40, Th-232, U-238, and their progeny in dust. Much\neffort is dedicated to inform radioactive backgrounds from dust and evaluate\nthe efficacy of mitigation procedures. A great portion of such effort relies on\nfallout models and assumed dust composition. In this work, an ICP-MS based\nmethodology was employed for a direct determination of fallout rates of\nradionuclides and stable isotopes of interest from dust particulate at the\nSNOLAB facility. Hosted in an active mine, the SNOLAB underground laboratory\nstrives to maintain experimental areas at class 2000 cleanroom level. This work\nvalidates the mitigation procedures in place at SNOLAB, and informs dust\nbackgrounds during laboratory activities. Fallout rates of major constituent of\nthe local rock were measured two to three orders of magnitude lower in the\nclean experimental areas compared to non-clean transition areas from the mine\nto the laboratory. A ca. two order of magnitude increase in stable Pb fallout\nrate was determined in an experimental area during activities involving\nhandling of Pb bricks. Increased K-40, Th-232, and U-238 fallout rates were\nmeasured in clean experimental areas during activities generating particulate.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:04:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["di Vacri","M. L.",""],["Scorza","S.",""],["French","A.",""],["Rocco","N. D.",""],["Schlieder","T. D.",""],["Arnquist","I. J.",""],["Hoppe","E. W.",""],["Hall","J.",""]]}
{"id":"2308.12254","submitter":"Kang Lu","authors":"Kang Lu, Weiqiang Wang, Weinan Zhang","title":"A Drinfeld type presentation of twisted Yangians","comments":"29 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a Gauss decomposition approach to establish a Drinfeld type\ncurrent presentation for Olshanski's twisted Yangians associated to the\northogonal Lie algebras (also called twisted Yangians of type AI), settling a\nlongstanding open problem. We expect that this will open the door for finding\ncurrent presentations for other twisted Yangians.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:11:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lu","Kang",""],["Wang","Weiqiang",""],["Zhang","Weinan",""]]}
{"id":"2308.12255","submitter":"Koki Sagiyama","authors":"Koki Sagiyama and David A. Ham","title":"Absorbing boundary conditions for the Helmholtz equation using\n  Gauss-Legendre quadrature reduced integrations","comments":"Draft version for submission","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new class of absorbing boundary conditions (ABCs) for the\nHelmholtz equation. The proposed ABCs can be derived from a certain simple\nclass of perfectly matched layers using $L$ discrete layers and using the $Q_N$\nLagrange finite element in conjunction with the $N$-point Gauss-Legendre\nquadrature reduced integration rule. The proposed ABCs are classified by a\ntuple $(L,N)$, and achieve reflection error of order $O(R^{2LN})$ for some\n$R<1$. The new ABCs generalise the perfectly matched discrete layers proposed\nby Guddati and Lim [Int. J. Numer. Meth. Engng 66 (6) (2006) 949-977],\nincluding them as type $(L,1)$. An analysis of the proposed ABCs is performed\nmotivated by the work of Ainsworth [J. Comput. Phys. 198 (1) (2004) 106-130].\nThe new ABCs facilitate numerical implementations of the Helmholtz problem with\nABCs if $Q_N$ finite elements are used in the physical domain. Moreover, giving\nmore insight, the analysis presented in this work potentially aids with\ndeveloping ABCs in related areas.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:15:20 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Sagiyama","Koki",""],["Ham","David A.",""]]}
{"id":"2308.12256","submitter":"Yueqi Wang","authors":"Yueqi Wang, Yoni Halpern, Shuo Chang, Jingchen Feng, Elaine Ya Le,\n  Longfei Li, Xujian Liang, Min-Cheng Huang, Shane Li, Alex Beutel, Yaping\n  Zhang, Shuchao Bi","title":"Learning from Negative User Feedback and Measuring Responsiveness for\n  Sequential Recommenders","comments":"RecSys 2023 Industry Track","journal-ref":null,"doi":"10.1145/3604915.3610244","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Sequential recommenders have been widely used in industry due to their\nstrength in modeling user preferences. While these models excel at learning a\nuser's positive interests, less attention has been paid to learning from\nnegative user feedback. Negative user feedback is an important lever of user\ncontrol, and comes with an expectation that recommenders should respond quickly\nand reduce similar recommendations to the user. However, negative feedback\nsignals are often ignored in the training objective of sequential retrieval\nmodels, which primarily aim at predicting positive user interactions. In this\nwork, we incorporate explicit and implicit negative user feedback into the\ntraining objective of sequential recommenders in the retrieval stage using a\n\"not-to-recommend\" loss function that optimizes for the log-likelihood of not\nrecommending items with negative feedback. We demonstrate the effectiveness of\nthis approach using live experiments on a large-scale industrial recommender\nsystem. Furthermore, we address a challenge in measuring recommender\nresponsiveness to negative feedback by developing a counterfactual simulation\nframework to compare recommender responses between different user actions,\nshowing improved responsiveness from the modeling change.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:16:07 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Wang","Yueqi",""],["Halpern","Yoni",""],["Chang","Shuo",""],["Feng","Jingchen",""],["Le","Elaine Ya",""],["Li","Longfei",""],["Liang","Xujian",""],["Huang","Min-Cheng",""],["Li","Shane",""],["Beutel","Alex",""],["Zhang","Yaping",""],["Bi","Shuchao",""]]}
{"id":"2308.12257","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan","title":"On Orbit Spaces of Distributive Binary $G$-Spaces","comments":"7 pages","journal-ref":"Mathematical Notes, 112:2, 177--182 (2022)","doi":"10.1134/S0001434622070215","report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The orbit space of a distributive binary $G$-space is studied. A number of\nits properties in the case of a compact binarily acting group $G$ are\nestablished.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:20:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gevorgyan","Pavel S.",""]]}
{"id":"2308.12258","submitter":"Ethan Dickey","authors":"Ethan Dickey, Andres Bejarano, Chirayu Garg","title":"Innovating Computer Programming Pedagogy: The AI-Lab Framework for\n  Generative AI Adoption","comments":"6 pages plus references and appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the last year, the ascent of Generative AI (GenAI) has raised concerns\nabout its impact on core skill development, such as problem-solving and\nalgorithmic thinking, in Computer Science students. Preliminary anonymous\nsurveys show that at least 48.5% of our students use GenAI for homework. With\nthe proliferation of these tools, the academic community must contemplate the\nappropriate role of these tools in education. Neglecting this might culminate\nin a phenomenon we term the \"Junior-Year Wall,\" where students struggle in\nadvanced courses due to prior over-dependence on GenAI. Instead of discouraging\nGenAI use, which may unintentionally foster covert usage, our research seeks to\nanswer: \"How can educators guide students' interactions with GenAI to preserve\ncore skill development during their foundational academic years?\"\n  We introduce \"AI-Lab,\" a pedagogical framework for guiding students in\neffectively leveraging GenAI within core collegiate programming courses. This\nframework accentuates GenAI's benefits and potential as a pedagogical\ninstrument. By identifying and rectifying GenAI's errors, students enrich their\nlearning process. Moreover, AI-Lab presents opportunities to use GenAI for\ntailored support such as topic introductions, detailed examples, corner case\nidentification, rephrased explanations, and debugging assistance. Importantly,\nthe framework highlights the risks of GenAI over-dependence, aiming to\nintrinsically motivate students towards balanced usage. This approach is\npremised on the idea that mere warnings of GenAI's potential failures may be\nmisconstrued as instructional shortcomings rather than genuine tool\nlimitations.\n  Additionally, AI-Lab offers strategies for formulating prompts to elicit\nhigh-quality GenAI responses. For educators, AI-Lab provides mechanisms to\nexplore students' perceptions of GenAI's role in their learning experience.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:20:37 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Dickey","Ethan",""],["Bejarano","Andres",""],["Garg","Chirayu",""]]}
{"id":"2308.12259","submitter":"Abu Hasnat Mohammad Rubaiyat","authors":"Abu Hasnat Mohammad Rubaiyat, Duy H. Thai, Jonathan M. Nichols,\n  Meredith N. Hutchinson, Samuel P. Wallen, Christina J. Naify, Nathan Geib,\n  Michael R. Haberman, Gustavo K. Rohde","title":"System Identification Using the Signed Cumulative Distribution Transform\n  In Structural Health Monitoring Applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel, data-driven approach to identifying partial\ndifferential equation (PDE) parameters of a dynamical system in structural\nhealth monitoring applications. Specifically, we adopt a mathematical\n\"transport\" model of the sensor data that allows us to accurately estimate the\nmodel parameters, including those associated with structural damage. This is\naccomplished by means of a newly-developed transform, the signed cumulative\ndistribution transform (SCDT), which is shown to convert the general, nonlinear\nparameter estimation problem into a simple linear regression. This approach has\nthe additional practical advantage of requiring no a priori knowledge of the\nsource of the excitation (or, alternatively, the initial conditions). By using\ntraining sensor data, we devise a coarse regression procedure to recover\ndifferent PDE parameters from a single sensor measurement. Numerical\nexperiments show that the proposed regression procedure is capable of detecting\nand estimating PDE parameters with superior accuracy compared to a number of\nrecently developed \"Deep Learning\" methods. The Python implementation of the\nproposed system identification technique is integrated as a part of the\nsoftware package PyTransKit (https://github.com/rohdelab/PyTransKit).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:25:27 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rubaiyat","Abu Hasnat Mohammad",""],["Thai","Duy H.",""],["Nichols","Jonathan M.",""],["Hutchinson","Meredith N.",""],["Wallen","Samuel P.",""],["Naify","Christina J.",""],["Geib","Nathan",""],["Haberman","Michael R.",""],["Rohde","Gustavo K.",""]]}
{"id":"2308.12260","submitter":"Yihan Bao","authors":"Yihan Bao, Lauren Bell, Elizabeth Williamson, Claire Garnett, Tianchen\n  Qian","title":"Estimating Causal Effects for Binary Outcomes Using Per-Decision Inverse\n  Probability Weighting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Micro-randomized trials are commonly conducted for optimizing mobile health\ninterventions such as push notifications for behavior change. In analyzing such\ntrials, causal excursion effects are often of primary interest, and their\nestimation typically involves inverse probability weighting (IPW). However, in\na micro-randomized trial additional treatments can often occur during the time\nwindow over which an outcome is defined, and this can greatly inflate the\nvariance of the causal effect estimator because IPW would involve a product of\nnumerous weights. To reduce variance and improve estimation efficiency, we\npropose a new estimator using a modified version of IPW, which we call\n\"per-decision IPW\". It is applicable when the outcome is binary and can be\nexpressed as the maximum of a series of sub-outcomes defined over sub-intervals\nof time. We establish the estimator's consistency and asymptotic normality.\nThrough simulation studies and real data applications, we demonstrate\nsubstantial efficiency improvement of the proposed estimator over existing\nestimators (relative efficiency up to 1.45 and sample size savings up to 31% in\nrealistic settings). The new estimator can be used to improve the precision of\nprimary and secondary analyses for micro-randomized trials with binary\noutcomes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:25:45 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Bao","Yihan",""],["Bell","Lauren",""],["Williamson","Elizabeth",""],["Garnett","Claire",""],["Qian","Tianchen",""]]}
{"id":"2308.12261","submitter":"Vijay Viswanathan","authors":"Vijay Viswanathan, Chenyang Zhao, Amanda Bertsch, Tongshuang Wu,\n  Graham Neubig","title":"Prompt2Model: Generating Deployable Models from Natural Language\n  Instructions","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) enable system builders today to create competent\nNLP systems through prompting, where they only need to describe the task in\nnatural language and provide a few examples. However, in other ways, LLMs are a\nstep backward from traditional special-purpose NLP models; they require\nextensive computational resources for deployment and can be gated behind APIs.\nIn this paper, we propose Prompt2Model, a general-purpose method that takes a\nnatural language task description like the prompts provided to LLMs, and uses\nit to train a special-purpose model that is conducive to deployment. This is\ndone through a multi-step process of retrieval of existing datasets and\npretrained models, dataset generation using LLMs, and supervised fine-tuning on\nthese retrieved and generated datasets. Over three tasks, we demonstrate that\ngiven the same few-shot prompt as input, Prompt2Model trains models that\noutperform the results of a strong LLM, gpt-3.5-turbo, by an average of 20%\nwhile being up to 700 times smaller. We also show that this data can be used to\nobtain reliable performance estimates of model performance, enabling model\ndevelopers to assess model reliability before deployment. Prompt2Model is\navailable open-source at https://github.com/neulab/prompt2model.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:28:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Viswanathan","Vijay",""],["Zhao","Chenyang",""],["Bertsch","Amanda",""],["Wu","Tongshuang",""],["Neubig","Graham",""]]}
{"id":"2308.12262","submitter":"Naveenta Gautam","authors":"Naveenta Gautam, Sai Vikranth Pendem, Brejesh Lall and Amol Choudhary","title":"Transformer-based Nonlinear Equalization for DP-16QAM Coherent Optical\n  Communication Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compensating for nonlinear effects using digital signal processing (DSP) is\ncomplex and computationally expensive in long-haul optical communication\nsystems due to intractable interactions between Kerr nonlinearity, chromatic\ndispersion (CD), and amplified spontaneous emission (ASE) noise from inline\namplifiers. The application of machine learning architectures has demonstrated\npromising advancements in enhancing transmission performance through the\nmitigation of fiber nonlinear effects. In this paper, we apply a\nTransformer-based model to dual-polarisation (DP)-16QAM coherent optical\ncommunication systems. We test the performance of the proposed model for\ndifferent values of fiber lengths and launched optical powers and show improved\nperformance compared to the state-of-the-art digital backpropagation (DBP)\nalgorithm, fully connected neural network (FCNN) and bidirectional long short\nterm memory (BiLSTM) architecture.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:29:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Gautam","Naveenta",""],["Pendem","Sai Vikranth",""],["Lall","Brejesh",""],["Choudhary","Amol",""]]}
{"id":"2308.12263","submitter":"Seth A. Major","authors":"Seth A. Major","title":"Footprinting in a course on energy","comments":"10 pages, to be published in Am. J. Phys., comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Footprints provide a way to estimate the relative impact of processes and\nproducts on the global climate. Including footprint analysis in a course on\nenergy simultaneously provides students with an understanding of this tool and\na quantitative guide to approaches that address climate change. College-level\nclassroom activities for (primarily) process-based life cycle carbon\nfootprinting are discussed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:31:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Major","Seth A.",""]]}
{"id":"2308.12264","submitter":"Saurabhsingh Rajput","authors":"Saurabhsingh Rajput, Tim Widmayer, Ziyuan Shang, Maria Kechagia,\n  Federica Sarro, Tushar Sharma","title":"FECoM: A Step towards Fine-Grained Energy Measurement for Deep Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.PF cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With the increasing usage, scale, and complexity of Deep Learning (DL)\nmodels, their rapidly growing energy consumption has become a critical concern.\nPromoting green development and energy awareness at different granularities is\nthe need of the hour to limit carbon emissions of DL systems. However, the lack\nof standard and repeatable tools to accurately measure and optimize energy\nconsumption at a fine granularity (e.g., at method level) hinders progress in\nthis area. In this paper, we introduce FECoM (Fine-grained Energy Consumption\nMeter), a framework for fine-grained DL energy consumption measurement.\nSpecifically, FECoM provides researchers and developers a mechanism to profile\nDL APIs. FECoM addresses the challenges of measuring energy consumption at\nfine-grained level by using static instrumentation and considering various\nfactors, including computational load and temperature stability. We assess\nFECoM's capability to measure fine-grained energy consumption for one of the\nmost popular open-source DL frameworks, namely TensorFlow. Using FECoM, we also\ninvestigate the impact of parameter size and execution time on energy\nconsumption, enriching our understanding of TensorFlow APIs' energy profiles.\nFurthermore, we elaborate on the considerations, issues, and challenges that\none needs to consider while designing and implementing a fine-grained energy\nconsumption measurement tool. We hope this work will facilitate further\nadvances in DL energy measurement and the development of energy-aware practices\nfor DL systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:32:06 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Rajput","Saurabhsingh",""],["Widmayer","Tim",""],["Shang","Ziyuan",""],["Kechagia","Maria",""],["Sarro","Federica",""],["Sharma","Tushar",""]]}
{"id":"2308.12265","submitter":"Thomas Depian","authors":"Thomas Depian, Christoph Kern, Sebastian R\\\"oder, Soeren Terziadis,\n  Markus Wallinger","title":"Network Navigation with Online Delays is PSPACE-complete","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In public transport networks disruptions may occur and lead to travel delays.\nIt is thus interesting to determine whether a traveler can be resilient to\ndelays that occur unexpectedly, ensuring that they can reach their destination\nin time regardless. We model this as a game between the traveler and a\ndelay-introducing adversary. We study the computational complexity of the\nproblem of deciding whether the traveler has a winning strategy in this game.\nOur main result is that this problem is PSPACE-complete.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:32:56 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Depian","Thomas",""],["Kern","Christoph",""],["R\u00f6der","Sebastian",""],["Terziadis","Soeren",""],["Wallinger","Markus",""]]}
{"id":"2308.12266","submitter":"Arunabh Srivastava","authors":"Arunabh Srivastava and Sennur Ulukus","title":"Age of Gossip on Generalized Rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.MA cs.NI eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a gossip network consisting of a source forwarding updates and\n$n$ nodes placed geometrically in a ring formation. Each node gossips with\n$f(n)$ nodes on either side, thus communicating with $2f(n)$ nodes in total.\n$f(n)$ is a sub-linear, non-decreasing and positive function. The source keeps\nupdates of a process, that might be generated or observed, and shares them with\nthe nodes in the ring network. The nodes in the ring network communicate with\ntheir neighbors and disseminate these version updates using a push-style gossip\nstrategy. We use the version age metric to quantify the timeliness of\ninformation at the nodes. Prior to this work, it was shown that the version age\nscales as $O(n^{\\frac{1}{2}})$ in a ring network, i.e., when $f(n)=1$, and as\n$O(\\log{n})$ in a fully-connected network, i.e., when $2f(n)=n-1$. In this\npaper, we find an upper bound for the average version age for a set of nodes in\nsuch a network in terms of the number of nodes $n$ and the number of gossiped\nneighbors $2 f(n)$. We show that if $f(n) = \\Omega(\\frac{n}{\\log^2{n}})$, then\nthe version age still scales as $\\theta(\\log{n})$. We also show that if $f(n)$\nis a rational function, then the version age also scales as a rational\nfunction. In particular, if $f(n)=n^\\alpha$, then version age is\n$O(n^\\frac{1-\\alpha}{2})$. Finally, through numerical calculations we verify\nthat, for all practical purposes, if $f(n) = \\Omega(n^{0.6})$, the version age\nscales as $O(\\log{n})$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:34:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Srivastava","Arunabh",""],["Ulukus","Sennur",""]]}
{"id":"2308.12267","submitter":"Parvez Mahbub","authors":"Parvez Mahbub, Mohammad Masudur Rahman, Ohiduzzaman Shuvo, Avinash\n  Gopal","title":"Bugsplainer: Leveraging Code Structures to Explain Software Bugs with\n  Neural Machine Translation","comments":"arXiv admin note: substantial text overlap with arXiv:2212.04584","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Software bugs cost the global economy billions of dollars each year and take\nup ~50% of the development time. Once a bug is reported, the assigned developer\nattempts to identify and understand the source code responsible for the bug and\nthen corrects the code. Over the last five decades, there has been significant\nresearch on automatically finding or correcting software bugs. However, there\nhas been little research on automatically explaining the bugs to the\ndevelopers, which is essential but a highly challenging task. In this paper, we\npropose Bugsplainer, a novel web-based debugging solution that generates\nnatural language explanations for software bugs by learning from a large corpus\nof bug-fix commits. Bugsplainer leverages code structures to reason about a bug\nand employs the fine-tuned version of a text generation model, CodeT5, to\ngenerate the explanations.\n  Tool video: https://youtu.be/xga-ScvULpk\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:35:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mahbub","Parvez",""],["Rahman","Mohammad Masudur",""],["Shuvo","Ohiduzzaman",""],["Gopal","Avinash",""]]}
{"id":"2308.12268","submitter":"Zhihan Jin","authors":"Michael Anastos, Zhihan Jin, Matthew Kwan, Benny Sudakov","title":"Extremal, enumerative and probabilistic results on ordered hypergraph\n  matchings","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with\nan ordering on its vertices. These objects can be viewed as natural\ngeneralisations of $r$-dimensional orders. The theory of ordered 2-matchings is\nwell-developed and has connections and applications to extremal and enumerative\ncombinatorics, probability, and geometry. On the other hand, in the case $r \\ge\n3$ much less is known, largely due to a lack of powerful bijective tools.\nRecently, Dudek, Grytczuk and Ruci\\'nski made some first steps towards a\ngeneral theory of ordered $r$-matchings, and in this paper we substantially\nimprove several of their results and introduce some new directions of study.\nMany intriguing open questions remain.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:37:15 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Anastos","Michael",""],["Jin","Zhihan",""],["Kwan","Matthew",""],["Sudakov","Benny",""]]}
{"id":"2308.12269","submitter":"Martin Lebrat","authors":"Martin Lebrat, Muqing Xu, Lev Haldar Kendrick, Anant Kale, Youqi Gang,\n  Pranav Seetharaman, Ivan Morera, Ehsan Khatami, Eugene Demler, Markus Greiner","title":"Observation of Nagaoka Polarons in a Fermi-Hubbard Quantum Simulator","comments":"8+11 pages, 4+8 figures, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum interference can deeply alter the nature of many-body phases of\nmatter. In the paradigmatic case of the Hubbard model, Nagaoka famously proved\nthat introducing a single itinerant charge can transform a paramagnetic\ninsulator into a ferromagnet through path interference. However, a microscopic\nobservation of such kinetic magnetism induced by individually imaged dopants\nhas been so far elusive. Here we demonstrate the emergence of Nagaoka polarons\nin a Hubbard system realized with strongly interacting fermions in a triangular\noptical lattice. Using quantum gas microscopy, we reveal these polarons as\nextended ferromagnetic bubbles around particle dopants arising from the local\ninterplay of coherent dopant motion and spin exchange. In contrast, kinetic\nfrustration due to the triangular geometry promotes antiferromagnetic polarons\naround hole dopants, as proposed by Haerter and Shastry. Our work augurs the\nexploration of exotic quantum phases driven by charge motion in strongly\ncorrelated systems and over sizes that are challenging for numerical\nsimulation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:37:34 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lebrat","Martin",""],["Xu","Muqing",""],["Kendrick","Lev Haldar",""],["Kale","Anant",""],["Gang","Youqi",""],["Seetharaman","Pranav",""],["Morera","Ivan",""],["Khatami","Ehsan",""],["Demler","Eugene",""],["Greiner","Markus",""]]}
{"id":"2308.12270","submitter":"Ademi Adeniji","authors":"Ademi Adeniji, Amber Xie, Carmelo Sferrazza, Younggyo Seo, Stephen\n  James, Pieter Abbeel","title":"Language Reward Modulation for Pretraining Reinforcement Learning","comments":"Code available at https://github.com/ademiadeniji/lamp","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using learned reward functions (LRFs) as a means to solve sparse-reward\nreinforcement learning (RL) tasks has yielded some steady progress in\ntask-complexity through the years. In this work, we question whether today's\nLRFs are best-suited as a direct replacement for task rewards. Instead, we\npropose leveraging the capabilities of LRFs as a pretraining signal for RL.\nConcretely, we propose $\\textbf{LA}$nguage Reward $\\textbf{M}$odulated\n$\\textbf{P}$retraining (LAMP) which leverages the zero-shot capabilities of\nVision-Language Models (VLMs) as a $\\textit{pretraining}$ utility for RL as\nopposed to a downstream task reward. LAMP uses a frozen, pretrained VLM to\nscalably generate noisy, albeit shaped exploration rewards by computing the\ncontrastive alignment between a highly diverse collection of language\ninstructions and the image observations of an agent in its pretraining\nenvironment. LAMP optimizes these rewards in conjunction with standard\nnovelty-seeking exploration rewards with reinforcement learning to acquire a\nlanguage-conditioned, pretrained policy. Our VLM pretraining approach, which is\na departure from previous attempts to use LRFs, can warmstart sample-efficient\nlearning on robot manipulation tasks in RLBench.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:37:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Adeniji","Ademi",""],["Xie","Amber",""],["Sferrazza","Carmelo",""],["Seo","Younggyo",""],["James","Stephen",""],["Abbeel","Pieter",""]]}
{"id":"2308.12271","submitter":"Catherine Ordun","authors":"Catherine Ordun, Alexandra Cha, Edward Raff, Sanjay Purushotham, Karen\n  Kwok, Mason Rule, James Gulley","title":"A Generative Approach for Image Registration of Visible-Thermal (VT)\n  Cancer Faces","comments":"2nd Annual Artificial Intelligence over Infrared Images for Medical\n  Applications Workshop (AIIIMA) at the 26th International Conference on\n  Medical Image Computing and Computer Assisted Intervention (MICCAI 2023)","journal-ref":"2nd Annual Artificial Intelligence over Infrared Images for\n  Medical Applications Workshop 2023","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since thermal imagery offers a unique modality to investigate pain, the U.S.\nNational Institutes of Health (NIH) has collected a large and diverse set of\ncancer patient facial thermograms for AI-based pain research. However,\ndiffering angles from camera capture between thermal and visible sensors has\nled to misalignment between Visible-Thermal (VT) images. We modernize the\nclassic computer vision task of image registration by applying and modifying a\ngenerative alignment algorithm to register VT cancer faces, without the need\nfor a reference or alignment parameters. By registering VT faces, we\ndemonstrate that the quality of thermal images produced in the generative AI\ndownstream task of Visible-to-Thermal (V2T) image translation significantly\nimproves up to 52.5\\%, than without registration. Images in this paper have\nbeen approved by the NIH NCI for public dissemination.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:39:58 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Ordun","Catherine",""],["Cha","Alexandra",""],["Raff","Edward",""],["Purushotham","Sanjay",""],["Kwok","Karen",""],["Rule","Mason",""],["Gulley","James",""]]}
{"id":"2308.12272","submitter":"Nancy Tyagi","authors":"Nancy Tyagi, Aidin Shiri, Surjodeep Sarkar, Abhishek Kumar Umrawal,\n  Manas Gaur","title":"Simple is Better and Large is Not Enough: Towards Ensembling of\n  Foundational Language Models","comments":"Accepted at the 10th Mid-Atlantic Student Colloquium on Speech,\n  Language and Learning (MASC-SLL 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Foundational Language Models (FLMs) have advanced natural language processing\n(NLP) research. Current researchers are developing larger FLMs (e.g., XLNet,\nT5) to enable contextualized language representation, classification, and\ngeneration. While developing larger FLMs has been of significant advantage, it\nis also a liability concerning hallucination and predictive uncertainty.\nFundamentally, larger FLMs are built on the same foundations as smaller FLMs\n(e.g., BERT); hence, one must recognize the potential of smaller FLMs which can\nbe realized through an ensemble. In the current research, we perform a reality\ncheck on FLMs and their ensemble on benchmark and real-world datasets. We\nhypothesize that the ensembling of FLMs can influence the individualistic\nattention of FLMs and unravel the strength of coordination and cooperation of\ndifferent FLMs. We utilize BERT and define three other ensemble techniques:\n{Shallow, Semi, and Deep}, wherein the Deep-Ensemble introduces a\nknowledge-guided reinforcement learning approach. We discovered that the\nsuggested Deep-Ensemble BERT outperforms its large variation i.e. BERTlarge, by\na factor of many times using datasets that show the usefulness of NLP in\nsensitive fields, such as mental health.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:40:35 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tyagi","Nancy",""],["Shiri","Aidin",""],["Sarkar","Surjodeep",""],["Umrawal","Abhishek Kumar",""],["Gaur","Manas",""]]}
{"id":"2308.12273","submitter":"Chun-Hung Liu","authors":"Chun-Hung Liu","title":"Assouad-Nagata dimension of minor-closed metrics","comments":"arXiv admin note: text overlap with arXiv:2007.08771","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM math.GR math.GT math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assouad-Nagata dimension addresses both large and small scale behaviors of\nmetric spaces and is a refinement of Gromov's asymptotic dimension. A metric\nspace $M$ is a minor-closed metric if there exists an (edge)-weighted graph $G$\nin a fixed minor-closed family such that the underlying space of $M$ is the\nvertex-set of $G$, and the metric of $M$ is the distance function in $G$.\nMinor-closed metrics naturally arise when removing redundant edges of the\nunderlying graphs by using edge-deletion and edge-contraction. In this paper,\nwe determine the Assouad-Nagata dimension of every minor-closed metric. It is a\ncommon generalization of known results for the asymptotic dimension of\n$H$-minor free unweighted graphs and the Assouad-Nagata dimension of some\n2-dimensional continuous spaces (e.g.\\ complete Rienmannian surfaces with\nfinite Euler genus) and their corollaries.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:42:31 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Liu","Chun-Hung",""]]}
{"id":"2308.12274","submitter":"Claire Halloran","authors":"Claire Halloran, Malcolm McCulloch","title":"Spatial clustering of temporal energy profiles with empirical orthogonal\n  functions and max-p regionalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents a spatial clustering method to create regions with\nsimilar time-varying energy characteristics. This method combines empirical\northogonal functions (EOFs) for dimensionality reduction and max-p\nregionalization for spatial clustering. The proposed approach creates regions\nthat each have a similar value of a spatially extensive attribute, such as\navailable land area, population, or GDP, as well as similar weather-dependent\ntemporal energy profiles, such as wind and solar generation potential or\nheating and cooling demand, within each region. We demonstrate this technique\nusing hourly wind and solar generation potential in 2019 in Ireland and\nBritain. Solar generation clusters are best-defined at a smaller land area\nthreshold compared to wind generation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:44:05 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Halloran","Claire",""],["McCulloch","Malcolm",""]]}
{"id":"2308.12276","submitter":"Ethan Dickey","authors":"Ethan Dickey, Andres Bejarano","title":"A Model for Integrating Generative AI into Course Content Development","comments":"6 pages plus references. Updated to fix one arXiv reference number","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As Generative AI (GenAI) models continue to gain prominence, a new frontier\nis emerging in the field of computer science education. Results from initial\nanonymous surveys reveal that nearly half (48.5%) of our students now turn to\nGenAI for academic assignments, highlighting its growing role in modern\neducation. With educators facing challenges in creating dynamic and unique\ncourse content, the potential of GenAI becomes evident. It offers not only a\nquicker method for content development but also paves the way for diversified,\nhigh-quality educational resources, countering traditional cheating methods and\ncatering to varied student needs. Key questions thus arise: \"How can GenAI\nassist instructors in creating meaningful content and problems quickly, and can\nit reduce the instructional staff's workload?\"\n  Addressing the first question, we unveil the \"GenAI Content Generation\nFramework\". This novel tool equips educators to tap into the prowess of GenAI\nfor course content design. The framework presents a systematic and practical\nblueprint for generating university-level course material through chat-based\nGenAI. Drawing from our first-hand experiences, we provide strategic guidance\non formulating inquiries and organizing GenAI sessions to elicit quality\ncontent that aligns with specific educational goals and context.\n  Our work stands apart by outlining a specific workflow and offering concrete\nsuggestions for harnessing GenAI in course material development, backed by a\nstrong case for its adoption. Armed with the framework and insights presented\nin this paper, educators and course content developers can move forward with\nassurance, tapping into GenAI's vast potential for innovative content creation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:47:35 GMT"},{"version":"v2","created":"Thu, 24 Aug 2023 17:49:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dickey","Ethan",""],["Bejarano","Andres",""]]}
{"id":"2308.12277","submitter":"Arpan Kusari","authors":"Arpan Kusari and Satabdi Saha","title":"Operational requirements for localization in autonomous vehicles","comments":"Submitted to IROS 2023 Localization Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous vehicles (AVs) need to determine their position and orientation\naccurately with respect to global coordinate system or local features under\ndifferent scene geometries, traffic conditions and environmental conditions.\n\\cite{reid2019localization} provides a comprehensive framework for the\nlocalization requirements for AVs. However, the framework is too restrictive\nwhereby - (a) only a very small deviation from the lane is tolerated (one every\n$10^{8}$ hours), (b) all roadway types are considered same without any\nattention to restriction provided by the environment onto the localization and\n(c) the temporal nature of the location and orientation is not considered in\nthe requirements. In this research, we present a more practical view of the\nlocalization requirement aimed at keeping the AV safe during an operation. We\npresent the following novel contributions - (a) we propose a deviation penalty\nas a cumulative distribution function of the Weibull distribution which starts\nfrom the adjacent lane boundary, (b) we customize the parameters of the\ndeviation penalty according to the current roadway type, particular lane\nboundary that the ego vehicle is against and roadway curvature and (c) we\nupdate the deviation penalty based on the available gap in the adjacent lane.\nWe postulate that this formulation can provide a more robust and achievable\nview of the localization requirements than previous research while focusing on\nsafety.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:49:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Kusari","Arpan",""],["Saha","Satabdi",""]]}
{"id":"2308.12278","submitter":"Wei Leong Tee","authors":"Wei Leong Tee, Xiaohui Fan, Feige Wang, Jinyi Yang, Sangeeta Malhotra,\n  James E. Rhoads","title":"Predicting the Yields of $z$ > 6.5 Quasar Surveys in the Era of Roman\n  and Rubin","comments":"Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Around 70 $z>6.5$ luminous quasars have been discovered, strongly biased\ntoward the bright end, thus not providing a comprehensive view on quasar\nabundance beyond cosmic dawn. We present the predicted results of Roman/Rubin\nhigh-redshift quasar survey, yielding 3 times more, $2-4$ magnitudes deeper\nquasar samples, probing high-redshift quasars across broad range of\nluminosities, especially faint quasars at $L_\\mathrm{bol}\\sim\n10^{10}\\;L_{\\odot}$ or $M_\\mathrm{1450} \\sim-22$ that are currently poorly\nexplored. We include high-$z$ quasars, galactic dwarfs and low-$z$ compact\ngalaxies with similar colors as quasar candidates. We create mock catalogs\nbased on population models to evaluate selection completeness and efficiency.\nWe utilize classical color dropout method in $z$ and $Y$ bands to select\nprimary quasar candidates, followed up with Bayesian selection method to\nidentify quasars. We show that overall selection completeness $> 80\\%$ and\nefficiency $\\sim 10\\%$ at $6.5<z<9$, with 180 quasars at $z>6.5$, 20 at $z >\n7.5$ and 2 at $z > 8.5$. The quasar yields depend sensitively on the assumed\nquasar luminosity shape and redshift evolution. Brown dwarf rejection through\nproper motion up to 50$\\%$ can be made for stars brighter than 25 mag, low-$z$\ngalaxies dominate at fainter magnitude. Our results show that Roman/Rubin are\nable to discover a statistical sample of the earliest and faintest quasars in\nthe Universe. The new valuable datasets worth follow up studies with James Webb\nSpace Telescope and Extremely Large Telescopes, to determine quasar luminosity\nfunction faint end slope and constraint the supermassive black holes growth in\nthe early Universe.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:50:16 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tee","Wei Leong",""],["Fan","Xiaohui",""],["Wang","Feige",""],["Yang","Jinyi",""],["Malhotra","Sangeeta",""],["Rhoads","James E.",""]]}
{"id":"2308.12279","submitter":"Tyrus Berry","authors":"Aaron Mahler, Tyrus Berry, Tom Stephens, Harbir Antil, Michael\n  Merritt, Jeanie Schreiber, Ioannis Kevrekidis","title":"On-Manifold Projected Gradient Descent","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work provides a computable, direct, and mathematically rigorous\napproximation to the differential geometry of class manifolds for\nhigh-dimensional data, along with nonlinear projections from input space onto\nthese class manifolds. The tools are applied to the setting of neural network\nimage classifiers, where we generate novel, on-manifold data samples, and\nimplement a projected gradient descent algorithm for on-manifold adversarial\ntraining. The susceptibility of neural networks (NNs) to adversarial attack\nhighlights the brittle nature of NN decision boundaries in input space.\nIntroducing adversarial examples during training has been shown to reduce the\nsusceptibility of NNs to adversarial attack; however, it has also been shown to\nreduce the accuracy of the classifier if the examples are not valid examples\nfor that class. Realistic \"on-manifold\" examples have been previously generated\nfrom class manifolds in the latent of an autoencoder. Our work explores these\nphenomena in a geometric and computational setting that is much closer to the\nraw, high-dimensional input space than can be provided by VAE or other black\nbox dimensionality reductions. We employ conformally invariant diffusion maps\n(CIDM) to approximate class manifolds in diffusion coordinates, and develop the\nNystr\\\"{o}m projection to project novel points onto class manifolds in this\nsetting. On top of the manifold approximation, we leverage the spectral\nexterior calculus (SEC) to determine geometric quantities such as tangent\nvectors of the manifold. We use these tools to obtain adversarial examples that\nreside on a class manifold, yet fool a classifier. These misclassifications\nthen become explainable in terms of human-understandable manipulations within\nthe data, by expressing the on-manifold adversary in the semantic basis on the\nmanifold.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:50:50 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Mahler","Aaron",""],["Berry","Tyrus",""],["Stephens","Tom",""],["Antil","Harbir",""],["Merritt","Michael",""],["Schreiber","Jeanie",""],["Kevrekidis","Ioannis",""]]}
{"id":"2308.12280","submitter":"Gokulprasath R","authors":"Gokulprasath R","title":"Extended Linear Regression: A Kalman Filter Approach for Minimizing Loss\n  via Area Under the Curve","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This research enhances linear regression models by integrating a Kalman\nfilter and analysing curve areas to minimize loss. The goal is to develop an\noptimal linear regression equation using stochastic gradient descent (SGD) for\nweight updating. Our approach involves a stepwise process, starting with\nuser-defined parameters. The linear regression model is trained using SGD,\ntracking weights and loss separately and zipping them finally. A Kalman filter\nis then trained based on weight and loss arrays to predict the next\nconsolidated weights. Predictions result from multiplying input averages with\nweights, evaluated for loss to form a weight-versus-loss curve. The curve's\nequation is derived using the two-point formula, and area under the curve is\ncalculated via integration. The linear regression equation with minimum area\nbecomes the optimal curve for prediction. Benefits include avoiding constant\nweight updates via gradient descent and working with partial datasets, unlike\nmethods needing the entire set. However, computational complexity should be\nconsidered. The Kalman filter's accuracy might diminish beyond a certain\nprediction range.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:50:57 GMT"}],"update_date":"2023-08-24","authors_parsed":[["R","Gokulprasath",""]]}
{"id":"2308.12281","submitter":"Richard Lang","authors":"Richard Lang","title":"Tiling Dense Hypergraphs","comments":"35 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the perfect tiling problem, we aim to cover the vertices of a hypergraph\n$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three\nessentially necessary conditions for such a perfect tiling, which correspond to\nbarriers in space, divisibility and covering. It is natural to ask in which\nsituations these conditions are also asymptotically sufficient.\n  Our main result confirms this for all hypergraph families that are\napproximately closed under taking typical induced subgraphs of constant order.\nAmong others, this includes families parametrised by minimum degrees and\nquasirandomness, which have been studied extensively in this area. As an\napplication, we recover and extend a series of well-known results for perfect\ntilings in hypergraphs and related settings involving vertex orderings and\nrainbow structures.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:54:38 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Lang","Richard",""]]}
{"id":"2308.12282","submitter":"Renai Chen","authors":"Renai Chen, Mohammadhasan Dinpajooh, Abraham Nitzan","title":"Quantum bath augmented stochastic nonequilibrium atomistic simulations\n  for molecular heat conduction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.stat-mech physics.chem-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Classical molecular dynamics (MD) has been shown to be effective in\nsimulating heat conduction in certain molecular junctions since it inherently\ntakes into account some essential methodological components which are lacking\nwith quantum Landauer-type transport model, such as many-body full force-field\ninteractions, anharmonicity effects and nonlinear responses for large\ntemperature biases. However, the classical mechanics reaches its limit in the\nenvironments where the quantum effects are significant (e.g. with\nlow-temperatures substrates, presence of extremely high frequency molecular\nmodes). Here, we present an atomistic simulation methodology for molecular heat\nconduction that incorporates the quantum Bose-Einstein statistics into an\neffective temperature in the form of modified Langevin equation. We show that\nthe results from such a quasi-classical effective temperature (QCET) MD method\ndeviates drastically when the baths temperature approaches zero from classical\nMD simulations and the results converge to the classical ones when the bath\napproaches the high-temperature limit, which makes the method suitable for full\ntemperature range. In addition, we show that our quasi-classical thermal\ntransport method can be used to model the conducting substrate layout and\nmolecular composition (e.g. anharmonicities, high-frequency modes). Anharmonic\nmodels are explicitly simulated via the Morse potential and compared to pure\nharmonic interactions, to show the effects of anharmonicities under quantum\ncolored bath setups. Finally, the chain length dependence of heat conduction is\nexamined for one-dimensional polymer chains placed in between quantum augmented\nbaths.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:55:43 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Chen","Renai",""],["Dinpajooh","Mohammadhasan",""],["Nitzan","Abraham",""]]}
{"id":"2308.12283","submitter":"Brad Koplitz","authors":"Brad Koplitz, Edward Buie II, Evan Scannapieco","title":"Constraining Circumgalactic Turbulence with QSO Absorption-line\n  Measurements","comments":"16 pages, 9 figures, 2 tables, ApJ, in press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our knowledge of the circumgalactic medium (CGM) is mostly based on quasar\nabsorption-line measurements. These have uncovered a multiphase medium that is\nlikely highly turbulent, but constraints of this turbulence are limited to\nmeasurements of the non-thermal width of absorption-line components\n($b_{turb}$) and the line-of-sight velocity dispersion between components\n($\\sigma_{LOS}$). Here we analyze a suite of CGM simulations to determine how\nwell these indirect measures are related to the underlying CGM. Our simulations\ntrack the non-equilibrium evolution of all commonly observed ions, and consist\nof two main types: small-scale simulations of regions of homogeneous CGM\nturbulence and global simulations of inhomogeneous turbulence throughout a\ngalactic halo. From each simulation, we generate mock spectra of Si II, Si IV,\nC IV, and O VI, which allow us to directly compare $b_{turb}$ and\n$\\sigma_{LOS}$ to the true line-of-sight turbulence ($\\sigma_{1D}$). In the\nsmall-scale simulations, $b_{turb}$ is only weakly correlated with\n$\\sigma_{1D}$, likely because it measures random motions within individual warm\nCGM clouds, which do not sample the overall random motions. Meanwhile,\n$\\sigma_{LOS}$ and $\\sigma_{1D}$ are strongly correlated, with\n$\\sigma_{1D}\\approx\\sigma_{LOS}+10$ km s$^{-1}$ in the densest regions we\nsimulated, though, the strength of this correlation depended weakly on the gas\nphase being probed. Our large-scale simulations also indicate that $b_{turb}$\nand $\\sigma_{1D}$ are largely uncorrelated, and that\n$\\sigma_{1D}\\approx\\sigma_{LOS}+10$ kms$^{-1}$ on average, although it varies\nalong individual sightlines. Moreover, the $\\sigma_\\mathrm{LOS}$ distributions\nfrom our global simulations are similar to recent observations, suggesting that\nthis quantity may provide useful constraints on circumgalactic turbulence\nregardless of the axis probed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:57:51 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Koplitz","Brad",""],["Buie","Edward","II"],["Scannapieco","Evan",""]]}
{"id":"2308.12284","submitter":"Kushal Tirumala","authors":"Kushal Tirumala, Daniel Simig, Armen Aghajanyan, Ari S. Morcos","title":"D4: Improving LLM Pretraining via Document De-Duplication and\n  Diversification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over recent years, an increasing amount of compute and data has been poured\ninto training large language models (LLMs), usually by doing one-pass learning\non as many tokens as possible randomly selected from large-scale web corpora.\nWhile training on ever-larger portions of the internet leads to consistent\nperformance improvements, the size of these improvements diminishes with scale,\nand there has been little work exploring the effect of data selection on\npre-training and downstream performance beyond simple de-duplication methods\nsuch as MinHash. Here, we show that careful data selection (on top of\nde-duplicated data) via pre-trained model embeddings can speed up training (20%\nefficiency gains) and improves average downstream accuracy on 16 NLP tasks (up\nto 2%) at the 6.7B model scale. Furthermore, we show that repeating data\nintelligently consistently outperforms baseline training (while repeating\nrandom data performs worse than baseline training). Our results indicate that\nclever data selection can significantly improve LLM pre-training, calls into\nquestion the common practice of training for a single epoch on as much data as\npossible, and demonstrates a path to keep improving our models past the limits\nof randomly sampling web data.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:58:14 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Tirumala","Kushal",""],["Simig","Daniel",""],["Aghajanyan","Armen",""],["Morcos","Ari S.",""]]}
{"id":"2308.12285","submitter":"Matt Larson","authors":"Joshua Brakensiek, Christopher Eur, Matt Larson, Shiyue Li","title":"Kapranov degrees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The moduli space of stable rational curves with marked points has two\ndistinguished families of maps: the forgetful maps, given by forgetting some of\nthe markings, and the Kapranov maps, given by complete linear series of\n$\\psi$-classes. The collection of all these maps embeds the moduli space into a\nproduct of projective spaces. We call the multidegrees of this embedding\n\"Kapranov degrees,\" which include as special cases the work of Witten,\nSilversmith, Castravet-Tevelev, Postnikov, Cavalieri-Gillespie-Monin, and\nGillespie-Griffins-Levinson. We establish, in terms of a combinatorial matching\ncondition, upper bounds for Kapranov degrees and a characterization of their\npositivity. The positivity characterization answers a question of Silversmith.\nWe achieve this by proving a recursive formula for Kapranov degrees and by\nusing tools from the theory of error correcting codes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:58:21 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Brakensiek","Joshua",""],["Eur","Christopher",""],["Larson","Matt",""],["Li","Shiyue",""]]}
{"id":"2308.12286","submitter":"Michael Burkhart","authors":"Michael C. Burkhart","title":"Fixed point conditions for non-coprime actions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the setting of finite groups, suppose $J$ acts on $N$ via automorphisms so\nthat the induced semidirect product $N\\rtimes J$ acts on some non-empty set\n$\\Omega$, with $N$ acting transitively. Glauberman proved that if the orders of\n$J$ and $N$ are coprime, then $J$ fixes a point in $\\Omega$. We consider the\nnon-coprime case and show that if $N$ is abelian and a Sylow $p$-subgroup of\n$J$ fixes a point in $\\Omega$ for each prime $p$, then $J$ fixes a point in\n$\\Omega$. We also show that if $N$ is nilpotent, $N\\rtimes J$ is supersoluble,\nand a Sylow $p$-subgroup of $J$ fixes a point in $\\Omega$ for each prime $p$,\nthen $J$ fixes a point in $\\Omega$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:58:26 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Burkhart","Michael C.",""]]}
{"id":"2308.12287","submitter":"Fredrik Heiding","authors":"Fredrik Heiding, Bruce Schneier, Arun Vishwanath, and Jeremy Bernstein","title":"Devising and Detecting Phishing: Large Language Models vs. Smaller Human\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  AI programs, built using large language models, make it possible to\nautomatically create phishing emails based on a few data points about a user.\nThey stand in contrast to traditional phishing emails that hackers manually\ndesign using general rules gleaned from experience. The V-Triad is an advanced\nset of rules for manually designing phishing emails to exploit our cognitive\nheuristics and biases. In this study, we compare the performance of phishing\nemails created automatically by GPT-4 and manually using the V-Triad. We also\ncombine GPT-4 with the V-Triad to assess their combined potential. A fourth\ngroup, exposed to generic phishing emails, was our control group. We utilized a\nfactorial approach, sending emails to 112 randomly selected participants\nrecruited for the study. The control group emails received a click-through rate\nbetween 19-28%, the GPT-generated emails 30-44%, emails generated by the\nV-Triad 69-79%, and emails generated by GPT and the V-Triad 43-81%. Each\nparticipant was asked to explain for why they pressed or did not press a link\nin the email. These answers often contradict each other, highlighting the need\nfor personalized content. The cues that make one person avoid phishing emails\nmake another person fall for them. Next, we used four popular large language\nmodels (GPT, Claude, PaLM, and LLaMA) to detect the intention of phishing\nemails and compare the results to human detection. The language models\ndemonstrated a strong ability to detect malicious intent, even in non-obvious\nphishing emails. They sometimes surpassed human detection, although often being\nslightly less accurate than humans.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:58:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Heiding","Fredrik",""],["Schneier","Bruce",""],["Vishwanath","Arun",""],["Bernstein","Jeremy",""]]}
{"id":"2308.12288","submitter":"Sookwan Han","authors":"Sookwan Han and Hanbyul Joo","title":"CHORUS: Learning Canonicalized 3D Human-Object Spatial Relations from\n  Unbounded Synthesized Images","comments":"Accepted to ICCV 2023 (Oral Presentation). Project Page:\n  https://jellyheadandrew.github.io/projects/chorus","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method for teaching machines to understand and model the\nunderlying spatial common sense of diverse human-object interactions in 3D in a\nself-supervised way. This is a challenging task, as there exist specific\nmanifolds of the interactions that can be considered human-like and natural,\nbut the human pose and the geometry of objects can vary even for similar\ninteractions. Such diversity makes the annotating task of 3D interactions\ndifficult and hard to scale, which limits the potential to reason about that in\na supervised way. One way of learning the 3D spatial relationship between\nhumans and objects during interaction is by showing multiple 2D images captured\nfrom different viewpoints when humans interact with the same type of objects.\nThe core idea of our method is to leverage a generative model that produces\nhigh-quality 2D images from an arbitrary text prompt input as an \"unbounded\"\ndata generator with effective controllability and view diversity. Despite its\nimperfection of the image quality over real images, we demonstrate that the\nsynthesized images are sufficient to learn the 3D human-object spatial\nrelations. We present multiple strategies to leverage the synthesized images,\nincluding (1) the first method to leverage a generative image model for 3D\nhuman-object spatial relation learning; (2) a framework to reason about the 3D\nspatial relations from inconsistent 2D cues in a self-supervised manner via 3D\noccupancy reasoning with pose canonicalization; (3) semantic clustering to\ndisambiguate different types of interactions with the same object types; and\n(4) a novel metric to assess the quality of 3D spatial learning of interaction.\nProject Page: https://jellyheadandrew.github.io/projects/chorus\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:59:11 GMT"}],"update_date":"2023-08-24","authors_parsed":[["Han","Sookwan",""],["Joo","Hanbyul",""]]}
{"id":"2308.12294","submitter":"Arkady Bolotin","authors":"Arkady Bolotin","title":"A geometry of space that satisfies the holographic principle","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional wisdom holds that any region of 3-space contains infinitely many\npoints, and the Planck length scale determines the uncertainty in every\nmeasurement of distance between two separate points. Against such a backdrop,\nthis uncertainty may be interpreted as resulting from either foaminess or\ndiscreteness of 3-space. But, as it is demonstrated in the present paper,\nneither of those interpretations is consistent with the holographic principle.\nIn the paper it is shown that the statement ``The holographic principle holds\ntrue'' and the statement ``Each region in 3-space contains only a finite number\nof points'' are logically equivalent.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 12:47:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bolotin","Arkady",""]]}
{"id":"2308.12295","submitter":"Douglas Newman","authors":"Douglas Newman","title":"Problems with the Standard Model","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Standard Model (SM) of particle physics is in such good agreement with\nexperiment that it is currently accepted as providing an accurate model of\nreality, with the role of chiral symmetry breaking in electro-weak unification\nregarded as one of its major achievements. This work focusses on weaknesses in\nthe algebraic formulation of the SM, especially the introduction of chirality,\nwhich is shown to be inconsistent with neutrinos being fermions, and conflicts\nwith the experimental evidence that they have finite mass. The SM description\nof parity is also shown to be erroneous. It is argued that these errors in its\nalgebraic formulation have had the effect of making theoretical extensions of\nthe SM impossible, as well as wasting considerable experimental effort in\ntrying to understand erroneous predictions of the theory.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 13:31:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Newman","Douglas",""]]}
{"id":"2308.12296","submitter":"Rodolfo Jos\\'e Bueno Rogerio","authors":"R.J. Bueno Rogerio and C.H. Coronado Villalobos","title":"Singular spinors as expansion coefficients of local spin-half fermionic\n  and bosonic fields","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By scrutinizing the singular sector of the Lounesto spinor classification, we\ninvestigate the correct definition of the expansion coefficient functions of\nlocal fermionic fields within a fully Lorentz covariant theory. As we can\nobserve, a careful definition of the adjoint structure, directed towards local\nfields, maps singular spinors into class-2 according to a general spinor\nclassification. Furthermore, we investigate all the necessary mathematical\ntools for constructing local fermionic and bosonic fields and provide insights\ninto the physical implications for the other singular classes. Besides, we also\nshow that incorporating \\emph{Wigner degeneracy} maintains the rotational\nsymmetry formalism working in general.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 22:41:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rogerio","R. J. Bueno",""],["Villalobos","C. H. Coronado",""]]}
{"id":"2308.12297","submitter":"Igor Salom","authors":"Igor Salom","title":"2022 Nobel Prize in Physics and the End of Mechanistic Materialism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph physics.hist-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ideas and results that are in the background of the 2022 Nobel Prize in\nphysics had an immense impact on our understanding of reality. Therefore, it is\ncrucial that these implications reach also the general public, not only the\nscientists in the related fields of quantum mechanics. The purpose of this\nreview is to attempt to elucidate these revolutionary changes in our worldview\nthat were eventually acknowledged also by the Nobel's committee, and to do it\nwith very few references to mathematical details (which could be even ignored\nwithout undermining the take-away essence of the text).\n  We first look into the foundational disputes between Einstein and Bohr about\nthe nature of quantum mechanics, which culminated in the so-called EPR paradox\n-- the main impetus for all the research that would ensue in this context.\nNext, we try to explain the statement of the famous Bell's theorem -- the\ntheorem that relocated the Einstain-Bohr discussions from the realm of\nphilosophy and metaphysics to hard-core physics verifiable by experiments (we\nalso give a brief derivation of the theorem's proof). Then we overview the\nexperimental work of the last year's laureates, that had the final say about\nwho was right in the debate. The outcome of these experiments forced us to\nprofoundly revise our understanding of the universe. Finally, we discuss in\nmore detail the implications of such outcomes, and what are the possible ways\nthat our worldviews can be modified to account for the experimental facts. As\nwe will see, the standard mechanist picture of the universe is no longer a\nviable option, and can be never again. Nowadays, we know this with certainty\nunusual for physics, that only a strict mathematical theorem could provide.\n","versions":[{"version":"v1","created":"Fri, 11 Aug 2023 14:53:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Salom","Igor",""]]}
{"id":"2308.12298","submitter":"Stefano Bellucci","authors":"Stefano Bellucci and Fabio Cardone","title":"Axiomatic Foundations of Physical Theories","comments":"23 pages, Keywords: Axiomatic foundations; mechanics; special\n  relativity; general relativity and quantum mechanics; principle of\n  solidarity; interactions. PACS numbers: 03.30.+p, 03.65.-w, 04.20-q,\n  11.10.Cd, 95.30.Sf. Accepted for publication in International Journal of\n  Modern Physics A (2023), https://doi.org/10.1142/S0217751X2350094X","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we give a contribution to the taxonomy of physical theories. We\nprovide here a thorough description of the axiomatic foundations of the most\nrelevant physical theories, Mechanics, Special Relativity, General Relativity,\nQuantum Mechanics. The corresponding interactions will be dealt with as well,\ni.e. Gravity in the Minkowskian limit, Electricity without quantized energy,\nGravity without quantized energy, Electricity with quantized energy. We pose\nthe problem if the extension of the principle of solidarity to all interactions\ncan impose to consider all variables as dynamic.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 11:32:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bellucci","Stefano",""],["Cardone","Fabio",""]]}
{"id":"2308.12299","submitter":"Xingyu Ma","authors":"Xing-Yu Ma, Shaogang Hao","title":"Inverse Lithography Physics-informed Deep Neural Level Set for Mask\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AR cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the feature size of integrated circuits continues to decrease, optical\nproximity correction (OPC) has emerged as a crucial resolution enhancement\ntechnology for ensuring high printability in the lithography process. Recently,\nlevel set-based inverse lithography technology (ILT) has drawn considerable\nattention as a promising OPC solution, showcasing its powerful pattern\nfidelity, especially in advanced process. However, massive computational time\nconsumption of ILT limits its applicability to mainly correcting partial layers\nand hotspot regions. Deep learning (DL) methods have shown great potential in\naccelerating ILT. However, lack of domain knowledge of inverse lithography\nlimits the ability of DL-based algorithms in process window (PW) enhancement\nand etc. In this paper, we propose an inverse lithography physics-informed deep\nneural level set (ILDLS) approach for mask optimization. This approach utilizes\nlevel set based-ILT as a layer within the DL framework and iteratively conducts\nmask prediction and correction to significantly enhance printability and PW in\ncomparison with results from pure DL and ILT. With this approach, computation\ntime is reduced by a few orders of magnitude versus ILT. By gearing up DL with\nknowledge of inverse lithography physics, ILDLS provides a new and efficient\nmask optimization solution.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 01:56:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ma","Xing-Yu",""],["Hao","Shaogang",""]]}
{"id":"2308.12300","submitter":"Abhishek Ghosh","authors":"Abhishek Ghosh, Andrew McBride, Zhaowei Liu, Luca Heltai, Paul\n  Steinmann, Prashant Saxena","title":"A fully-coupled nonlinear magnetoelastic thin shell formulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A geometrically exact dimensionally reduced order model for the nonlinear\ndeformation of thin magnetoelastic shells is presented. The Kirchhoff-Love\nassumptions for the mechanical fields are generalised to the magnetic variables\nto derive a consistent two-dimensional theory based on a rigorous variational\napproach. The general deformation map, as opposed to the mid-surface\ndeformation, is considered as the primary variable resulting in a more accurate\ndescription of the nonlinear deformation. The commonly used plane stress\nassumption is discarded due to the Maxwell stress in the surrounding free-space\nrequiring careful treatment on the upper and lower shell surfaces. The\ncomplexity arising from the boundary terms when deriving the Euler-Lagrange\ngoverning equations is addressed via a unique application of Green's\ntheorem.The governing equations are solved analytically for the problem of an\ninfinite cylindrical magnetoelastic shell. This clearly demonstrates the\nmodel's capabilities and provides a physical interpretation of the new\nvariables in the modified variational approach. This novel formulation for\nmagnetoelastic shells serves as a valuable tool for the accurate design of thin\nmagneto-mechanically coupled devices.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 17:56:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ghosh","Abhishek",""],["McBride","Andrew",""],["Liu","Zhaowei",""],["Heltai","Luca",""],["Steinmann","Paul",""],["Saxena","Prashant",""]]}
{"id":"2308.12301","submitter":"Zachary Hartwig","authors":"Zachary Hartwig, Rui Vieira, Darby Dunn, Theodore Golfinopoulos, Brian\n  LaBombard, Christopher Lammi, Phil Michael, Susan Agabian, David Arsenault,\n  Raheem Barnett, Mike Barry, Larry Bartoszek, William Beck, David Bellofatto,\n  Daniel Brunner, William Burke, Jason Burrows, William Byford, Charles Cauley,\n  Sarah Chamberlain, David Chavarria, JL Cheng, James Chicarello, Karen Cote,\n  Corinne Cotta, Van Diep, Eric Dombrowski, Jeffrey Doody, Raouf Doos, Brian\n  Eberlin, Jose Estrada, Vincent Fry, Matthew Fulton, Sarah Garberg, Robert\n  Granetz, Aliya Greenberg, Martin Greenwald, Samuel Heller, Amanda Hubbard,\n  Ernest Ihloff, James Irby, Mark Iverson, Peter Jardin, Daniel Korsun, Sergey\n  Kuznetsov, Chris Lammi, Steven Lane Walsh, Richard Landry, Richard Lations,\n  Matthew Levine, George Mackay, Kristin Metcalfe, Kevin Moazeni, John Mota,\n  Theodore Mouratidis, Robert Mumgaard, JP Muncks, Richard Murray, Daniel Nash,\n  Ben Nottingham, Colin O Shea, Andrew Pfeiffer, Samuel Pierson, Clayton Purdy,\n  Alexi Radovinsky, DJ Ravikumar, Veronica Reyes, Nicolo Riva, Ron Rosati,\n  Michael Rowell, Erica E. Salazar, Fernando Santoro, Dior Sattarov, Wayne\n  Saunders, Patrick Schweiger, Shane Schweiger, Maise Shepard, Syunichi\n  Shiraiwa, Maria Silveira, FT Snowman, Brandon Sorbom, Peter Stahle, Ken\n  Stevens, Joseph Stiebler, Joshua Stillerman, Deepthi Tammana, David Tracy,\n  Ronnie Turcotte, Kiran Uppalapati, Matthew Vernacchia, Christopher Vidal,\n  Erik Voirin, Alex Warner, Amy Watterson, Dennis Whyte, Sidney Wilcox, Michael\n  Wolf, Bruce Wood, Lihua Zhou, and Alex Zhukovsky","title":"The SPARC Toroidal Field Model Coil Program","comments":"17 pages 9 figures, overview paper and the first of a six-part series\n  of papers covering the TFMC Program","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.acc-ph physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The SPARC Toroidal Field Model Coil (TFMC) Program was a three-year effort\nbetween 2018 and 2021 that developed novel Rare Earth Yttrium Barium Copper\nOxide (REBCO) superconductor technologies and then successfully utilized these\ntechnologies to design, build, and test a first-in-class, high-field (~20 T),\nrepresentative-scale (~3 m) superconducting toroidal field coil. With the\nprincipal objective of demonstrating mature, large-scale, REBCO magnets, the\nproject was executed jointly by the MIT Plasma Science and Fusion Center (PSFC)\nand Commonwealth Fusion Systems (CFS). The TFMC achieved its programmatic goal\nof experimentally demonstrating a large-scale high-field REBCO magnet,\nachieving 20.1 T peak field-on-conductor with 40.5 kA of terminal current, 815\nkN/m of Lorentz loading on the REBCO stacks, and almost 1 GPa of mechanical\nstress accommodated by the structural case. Fifteen internal demountable\npancake-to-pancake joints operated in the 0.5 to 2.0 nOhm range at 20 K and in\nmagnetic fields up to 12 T. The DC and AC electromagnetic performance of the\nmagnet, predicted by new advances in high-fidelity computational models, was\nconfirmed in two test campaigns while the massively parallel, single-pass,\npressure-vessel style coolant scheme capable of large heat removal was\nvalidated. The REBCO current lead and feeder system was experimentally\nqualified up to 50 kA, and the crycooler based cryogenic system provided 600 W\nof cooling power at 20 K with mass flow rates up to 70 g/s at a maximum design\npressure of 20 bar-a for the test campaigns. Finally, the feasibility of using\npassive, self-protection against a quench in a fusion-scale NI TF coil was\nexperimentally assessed with an intentional open-circuit quench at 31.5 kA\nterminal current.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 18:58:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hartwig","Zachary",""],["Vieira","Rui",""],["Dunn","Darby",""],["Golfinopoulos","Theodore",""],["LaBombard","Brian",""],["Lammi","Christopher",""],["Michael","Phil",""],["Agabian","Susan",""],["Arsenault","David",""],["Barnett","Raheem",""],["Barry","Mike",""],["Bartoszek","Larry",""],["Beck","William",""],["Bellofatto","David",""],["Brunner","Daniel",""],["Burke","William",""],["Burrows","Jason",""],["Byford","William",""],["Cauley","Charles",""],["Chamberlain","Sarah",""],["Chavarria","David",""],["Cheng","JL",""],["Chicarello","James",""],["Cote","Karen",""],["Cotta","Corinne",""],["Diep","Van",""],["Dombrowski","Eric",""],["Doody","Jeffrey",""],["Doos","Raouf",""],["Eberlin","Brian",""],["Estrada","Jose",""],["Fry","Vincent",""],["Fulton","Matthew",""],["Garberg","Sarah",""],["Granetz","Robert",""],["Greenberg","Aliya",""],["Greenwald","Martin",""],["Heller","Samuel",""],["Hubbard","Amanda",""],["Ihloff","Ernest",""],["Irby","James",""],["Iverson","Mark",""],["Jardin","Peter",""],["Korsun","Daniel",""],["Kuznetsov","Sergey",""],["Lammi","Chris",""],["Walsh","Steven Lane",""],["Landry","Richard",""],["Lations","Richard",""],["Levine","Matthew",""],["Mackay","George",""],["Metcalfe","Kristin",""],["Moazeni","Kevin",""],["Mota","John",""],["Mouratidis","Theodore",""],["Mumgaard","Robert",""],["Muncks","JP",""],["Murray","Richard",""],["Nash","Daniel",""],["Nottingham","Ben",""],["Shea","Colin O",""],["Pfeiffer","Andrew",""],["Pierson","Samuel",""],["Purdy","Clayton",""],["Radovinsky","Alexi",""],["Ravikumar","DJ",""],["Reyes","Veronica",""],["Riva","Nicolo",""],["Rosati","Ron",""],["Rowell","Michael",""],["Salazar","Erica E.",""],["Santoro","Fernando",""],["Sattarov","Dior",""],["Saunders","Wayne",""],["Schweiger","Patrick",""],["Schweiger","Shane",""],["Shepard","Maise",""],["Shiraiwa","Syunichi",""],["Silveira","Maria",""],["Snowman","FT",""],["Sorbom","Brandon",""],["Stahle","Peter",""],["Stevens","Ken",""],["Stiebler","Joseph",""],["Stillerman","Joshua",""],["Tammana","Deepthi",""],["Tracy","David",""],["Turcotte","Ronnie",""],["Uppalapati","Kiran",""],["Vernacchia","Matthew",""],["Vidal","Christopher",""],["Voirin","Erik",""],["Warner","Alex",""],["Watterson","Amy",""],["Whyte","Dennis",""],["Wilcox","Sidney",""],["Wolf","Michael",""],["Wood","Bruce",""],["Zhou","Lihua",""],["Zhukovsky","Alex",""]]}
{"id":"2308.12302","submitter":"Arijit Chatterjee","authors":"Arijit Chatterjee, T S Mahesh, Mounir Nisse and Yen-Kheng Lim","title":"A Method for Investigating Thermodynamics of Inaccessible Objects by\n  Determining the Co-Amoeba of their Partition Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math-ph math.AG math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given an Ising-type system, the zeros of its complexified partition function,\nknown as Lee--Yang zeros, form an algebraic variety that sheds light on the\nthermodynamics of that system. But in practice, we often confront with the\ninaccessibility of a system for direct experimentation and then a strategic\napproach is taken to investigate a probe that is interacting with the target\nsystem. Considering such an inaccessible system, reading the probe alone, we\npresent a method to determine the co-amoeba, the images of the argument map of\nan algebraic variety corresponding to the Lee--Yang zeros of its partition\nfunction. In our method, starting from thermal equilibrium of target and probe,\nthe target can be effectively initiated at any chosen value of its internal\nparameters by doing operations only on the probe. Thus, sampling the co-amoeba\ncorresponding to a wide of range of physical parameters is possible which\nallows one to perceive the full algebraic variety and thereby determining the\nthermodynamics of the system. No prior knowledge about the internal parameters,\nneither any control over the target system under investigation is required for\nthis protocol. Finally, we experimentally demonstrate this protocol via the\nnuclear magnetic resonance architecture using a system of three mutually\ninteracting spin-1/2 nuclei.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 08:12:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chatterjee","Arijit",""],["Mahesh","T S",""],["Nisse","Mounir",""],["Lim","Yen-Kheng",""]]}
{"id":"2308.12303","submitter":"Milan Batista","authors":"Milan Batista","title":"On Sudden Cessation in Circular Motion","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This short paper presents a simple analytical model for the abrupt\ntermination of circular motion, as discussed in the \"The Most Mind-Blowing\nAspect of Circular Motion\".\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 14:45:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Batista","Milan",""]]}
{"id":"2308.12304","submitter":"Abram Magner","authors":"Abram Magner and Arun Padakandla","title":"Fat Shattering, Joint Measurability, and PAC Learnability of POVM\n  Hypothesis Classes","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We characterize learnability for quantum measurement classes by establishing\nmatching necessary and sufficient conditions for their PAC learnability, along\nwith corresponding sample complexity bounds, in the setting where the learner\nis given access only to prepared quantum states. We first probe the results\nfrom previous works on this setting. We show that the empirical risk defined in\nprevious works and matching the definition in the classical theory fails to\nsatisfy the uniform convergence property enjoyed in the classical setting for\nsome learnable classes. Moreover, we show that VC dimension generalization\nupper bounds in previous work are frequently infinite, even for\nfinite-dimensional POVM classes. To surmount the failure of the standard ERM to\nsatisfy uniform convergence, we define a new learning rule -- denoised ERM. We\nshow this to be a universal learning rule for POVM and probabilistically\nobserved concept classes, and the condition for it to satisfy uniform\nconvergence is finite fat shattering dimension of the class. We give\nquantitative sample complexity upper and lower bounds for learnability in terms\nof finite fat-shattering dimension and a notion of approximate finite\npartitionability into approximately jointly measurable subsets, which allow for\nsample reuse. We then show that finite fat shattering dimension implies finite\ncoverability by approximately jointly measurable subsets, leading to our\nmatching conditions. We also show that every measurement class defined on a\nfinite-dimensional Hilbert space is PAC learnable. We illustrate our results on\nseveral example POVM classes.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 18:38:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Magner","Abram",""],["Padakandla","Arun",""]]}
{"id":"2308.12305","submitter":"Haokun Chen","authors":"Haokun Chen, Yao Zhang, Denis Krompass, Jindong Gu, Volker Tresp","title":"FedDAT: An Approach for Foundation Model Finetuning in Multi-Modal\n  Heterogeneous Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, foundation models have exhibited remarkable advancements in\nmulti-modal learning. These models, equipped with millions (or billions) of\nparameters, typically require a substantial amount of data for finetuning.\nHowever, collecting and centralizing training data from diverse sectors becomes\nchallenging due to distinct privacy regulations. Federated Learning (FL)\nemerges as a promising solution, enabling multiple clients to collaboratively\ntrain neural networks without centralizing their local data. To alleviate\nclient computation burdens and communication overheads, previous works have\nadapted Parameter-efficient Finetuning (PEFT) methods for FL. Hereby, only a\nsmall fraction of the model parameters are optimized and communicated during\nfederated communications. Nevertheless, most previous works have focused on a\nsingle modality and neglected one common phenomenon, i.e., the presence of data\nheterogeneity across the clients. Therefore, in this work, we propose a\nfinetuning framework tailored to heterogeneous multi-modal FL, called Federated\nDual-Aadapter Teacher (FedDAT). Specifically, our approach leverages a\nDual-Adapter Teacher (DAT) to address data heterogeneity by regularizing the\nclient local updates and applying Mutual Knowledge Distillation (MKD) for an\nefficient knowledge transfer. FedDAT is the first approach that enables an\nefficient distributed finetuning of foundation models for a variety of\nheterogeneous Vision-Language tasks. To demonstrate its effectiveness, we\nconduct extensive experiments on four multi-modality FL benchmarks with\ndifferent types of data heterogeneity, where FedDAT substantially outperforms\nthe existing centralized PEFT methods adapted for FL.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 21:57:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Haokun",""],["Zhang","Yao",""],["Krompass","Denis",""],["Gu","Jindong",""],["Tresp","Volker",""]]}
{"id":"2308.12306","submitter":"Alborz Azarang","authors":"Alborz Azarang, Nasrin Parsa","title":"Maximal subrings up to isomorphism of fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we study maximal subrings up to isomorphism of fields. It is\nshown that each field with zero characteristic has infinitely many maximal\nsubrings up to isomorphism. If $K$ is an algebraically closed field and $x$ is\nan indeterminate over $K$, then we prove that integrally closed maximal\nsubrings of $K(x)$ which contains $K$ are all isomorphic. In particular, if $K$\nis an absolutely algebraic field, then $K(x)$ has only finitely many integrally\nclosed maximal subrings up to isomorphism if and only if $K$ is algebraically\nclosed. Also, we show that if $K$ is an absolutely algebraic field then $K$ has\nonly finitely many maximal subrings up to isomorphism if and only if $K$ has\nonly finitely many maximal subrings. We prove that if a commutative ring $R$\nwith zero characteristic has only finitely many maximal subrings up to\nisomorphism, then $U(R)\\cap\\mathbb{P}$ is finite, where $\\mathbb{P}$ is the set\nof natural prime numbers. In particular, if $R$ is a commutative ring with zero\ncharacteristic and $Char(R/J(R))\\neq 0$, then $R$ has infinitely many maximal\nsubrings up to isomorphism. Maximal subrings up to isomorphism of $K[x]$,\n$K\\times K$ and $K[x]/(x^2)$ for a field $K$ are investigated. If $R$ is a\nnon-field maximal subring of a field $K$ and $\\mathcal{A}$ is the set of all\nmaximal subrings of $K$ which are isomorphic to $R$, then we prove that\n$\\mathcal{A}=\\{\\sigma(R)\\ |\\ \\sigma\\in Aut(K)|\\}$, in particular\n$|\\mathcal{A}|\\leq |Aut(K)|$. Moreover if $K$ is infinite and $|Aut(K)|<|K|$,\nthen $R$ has at least $|K|$-many integrally closed maximal subrings up to\nisomorphism.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 02:23:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Azarang","Alborz",""],["Parsa","Nasrin",""]]}
{"id":"2308.12307","submitter":"Alexandre D'HOOGE","authors":"Alexandre D'Hooge, Louis Bigo, Ken D\\'eguernel","title":"Modeling Bends in Popular Music Guitar Tablatures","comments":null,"journal-ref":"24th International Society for Music Information Retrieval\n  Conference, International Society for Music Information Retrieval, Nov 2023,\n  Milan, Italy","doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.MM eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tablature notation is widely used in popular music to transcribe and share\nguitar musical content. As a complement to standard score notation, tablatures\ntranscribe performance gesture information including finger positions and a\nvariety of guitar-specific playing techniques such as slides,\nhammer-on/pull-off or bends.This paper focuses on bends, which enable to\nprogressively shift the pitch of a note, therefore circumventing physical\nlimitations of the discrete fretted fingerboard. In this paper, we propose a\nset of 25 high-level features, computed for each note of the tablature, to\nstudy how bend occurrences can be predicted from their past and future\nshort-term context. Experiments are performed on a corpus of 932 lead guitar\ntablatures of popular music and show that a decision tree successfully predicts\nbend occurrences with an F1 score of 0.71 anda limited amount of false positive\npredictions, demonstrating promising applications to assist the arrangement of\nnon-guitar music into guitar tablatures.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 07:50:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["D'Hooge","Alexandre",""],["Bigo","Louis",""],["D\u00e9guernel","Ken",""]]}
{"id":"2308.12308","submitter":"Ian Cohen","authors":"Ian J. Cohen, Dan Baker, Jacob Bortnik, Pontus Brandt, Jim Burch, Amir\n  Caspi, George Clark, Ofer Cohen, Craig DeForest, Gordon Emslie, Matina\n  Gkioulidou, Alexa Halford, Aleida Higginson, Allison Jaynes, Kristopher\n  Klein, Craig Kletzing, Ryan McGranaghan, David Miles, Romina Nikoukar,\n  Katariina Nykyrii, Larry Paxton, Louise Prockter, Harlan Spence, William H.\n  Swartz, Drew L. Turner, Joe Westlake, Phyllis Whittlesey, Michael Wiltberger","title":"Reimagining Heliophysics: A bold new vision for the next decade and\n  beyond","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.space-ph astro-ph.SR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The field of Heliophysics has a branding problem. We need an answer to the\nquestion: ``What is Heliophysics\\?'', the answer to which should clearly and\nsuccinctly defines our science in a compelling way that simultaneously\nintroduces a sense of wonder and exploration into our science and our missions.\nUnfortunately, recent over-reliance on space weather to define our field, as\nopposed to simply using it as a practical and relatable example of applied\nHeliophysics science, narrows the scope of what solar and space physics is and\ndiminishes its fundamental importance. Moving forward, our community needs to\nbe bold and unabashed in our definition of Heliophysics and its big questions.\nWe should emphasize the general and fundamental importance and excitement of\nour science with a new mindset that generalizes and expands the definition of\nHeliophysics to include new ``frontiers'' of increasing interest to the\ncommunity. Heliophysics should be unbound from its current confinement to the\nSun-Earth connection and expanded to studies of the fundamental nature of space\nplasma physics across the solar system and greater cosmos. Finally, we need to\ncome together as a community to advance our science by envisioning,\nprioritizing, and supporting -- with a unified voice -- a set of bold new\nmissions that target compelling science questions - even if they do not explore\nthe traditional Sun- and Earth-centric aspects of Heliophysics science. Such\nnew, large missions to expand the frontiers and scope of Heliophysics science\nlarge missions can be the key to galvanizing the public and policymakers to\nsupport the overall Heliophysics program.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:28:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cohen","Ian J.",""],["Baker","Dan",""],["Bortnik","Jacob",""],["Brandt","Pontus",""],["Burch","Jim",""],["Caspi","Amir",""],["Clark","George",""],["Cohen","Ofer",""],["DeForest","Craig",""],["Emslie","Gordon",""],["Gkioulidou","Matina",""],["Halford","Alexa",""],["Higginson","Aleida",""],["Jaynes","Allison",""],["Klein","Kristopher",""],["Kletzing","Craig",""],["McGranaghan","Ryan",""],["Miles","David",""],["Nikoukar","Romina",""],["Nykyrii","Katariina",""],["Paxton","Larry",""],["Prockter","Louise",""],["Spence","Harlan",""],["Swartz","William H.",""],["Turner","Drew L.",""],["Westlake","Joe",""],["Whittlesey","Phyllis",""],["Wiltberger","Michael",""]]}
{"id":"2308.12309","submitter":"Thomas Baycroft","authors":"Thomas A. Baycroft, Harry Badnell, Samuel Blacker, Amaury H.M.J Triaud","title":"GJ 9404 b: a confirmed eccentric planet, and not a candidate","comments":"3 pages, 1 figure","journal-ref":"Res. Notes AAS 7 175 (2023)","doi":"10.3847/2515-5172/acefc5","report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Eccentric orbits can be decomposed into a series of sine curves which affects\nhow the false alarm probability is computed when using traditional periodograms\non radial-velocity data. Here we show that a candidate exoplanet orbiting the M\ndwarf GJ 9404, identified by the HADES survey using data from the HARPS-N\nspectrograph, is in fact a bona-fide planet on a highly eccentric orbit. Far\nfrom a candidate, GJ 9404 b is detected with a high confidence. We reach our\nconclusion using two methods that assume Keplerian functions rather than sines\nto compute a detection probability, a Bayes Factor, and the FIP periodogram. We\ncompute these using nested sampling with {\\tt kima}.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:05:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Baycroft","Thomas A.",""],["Badnell","Harry",""],["Blacker","Samuel",""],["Triaud","Amaury H. M. J",""]]}
{"id":"2308.12310","submitter":"Xiaogang Cheng","authors":"Xiaogang Cheng, Ren Guo","title":"Better Quantum Seal Schemes based on Trapdoor Claw-Free Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Seal in classical information is simply impossible. Since classical\ninformation can be easily copied any number of times. Based on quantum\ninformation, esp. quantum unclonable theorem, quantum seal maybe constructed\nperfectly. But it is shown that perfect quantum seal is impossible, and the\nsuccess probability is bounded. In this paper, we show how to exceed the\noptimal bound by using the TCF (Trapdoor Claw Free) functions, which can be\nconstructed based on LWE assumption. Hence it is post-quantum secure.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:44:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cheng","Xiaogang",""],["Guo","Ren",""]]}
{"id":"2308.12311","submitter":"Shenggen Zheng","authors":"Yonghe Zhang, Liwei Ni, Jiaxi Zhang, Guojie Luo, Huawei Li, Shenggen\n  Zheng","title":"Fast Exact NPN Classification with Influence-aided Canonical Form","comments":"To be appeared in ICCAD'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  NPN classification has many applications in the synthesis and verification of\ndigital circuits. The canonical-form-based method is the most common approach,\ndesigning a canonical form as representative for the NPN equivalence class\nfirst and then computing the transformation function according to the canonical\nform. Most works use variable symmetries and several signatures, mainly based\non the cofactor, to simplify the canonical form construction and computation.\nThis paper describes a novel canonical form and its computation algorithm by\nintroducing Boolean influence to NPN classification, which is a basic concept\nin analysis of Boolean functions. We show that influence is\ninput-negation-independent, input-permutation-dependent, and has other\nstructural information than previous signatures for NPN classification.\nTherefore, it is a significant ingredient in speeding up NPN classification.\nExperimental results prove that influence plays an important role in reducing\nthe transformation enumeration in computing the canonical form. Compared with\nthe state-of-the-art algorithm implemented in ABC, our influence-aided\ncanonical form for exact NPN classification gains up to 5.5x speedup.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:50:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Yonghe",""],["Ni","Liwei",""],["Zhang","Jiaxi",""],["Luo","Guojie",""],["Li","Huawei",""],["Zheng","Shenggen",""]]}
{"id":"2308.12312","submitter":"Jai Kumar","authors":"Jai Kumar (IRFM), David Zarzoso (M2P2), Virginie Grandgirard (IRFM),\n  Jan Ebert, Stefan Kesselheim","title":"Physics informed Neural Networks applied to the description of\n  wave-particle resonance in kinetic simulations of fusion plasmas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.AI physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Vlasov-Poisson system is employed in its reduced form version (1D1V) as a\ntest bed for the applicability of Physics Informed Neural Network (PINN) to the\nwave-particle resonance. Two examples are explored: the Landau damping and the\nbump-on-tail instability. PINN is first tested as a compression method for the\nsolution of the Vlasov-Poisson system and compared to the standard neural\nnetworks. Second, the application of PINN to solving the Vlasov-Poisson system\nis also presented with the special emphasis on the integral part, which\nmotivates the implementation of a PINN variant, called Integrable PINN\n(I-PINN), based on the automatic-differentiation to solve the partial\ndifferential equation and on the automatic-integration to solve the integral\nequation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:00:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kumar","Jai","","IRFM"],["Zarzoso","David","","M2P2"],["Grandgirard","Virginie","","IRFM"],["Ebert","Jan",""],["Kesselheim","Stefan",""]]}
{"id":"2308.12313","submitter":"Pietro Bonazzi","authors":"Thomas Ruegg, Pietro Bonazzi, Andrea Ronco","title":"Gaze Estimation on Spresense","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gaze estimation is a valuable technology with numerous applications in fields\nsuch as human-computer interaction, virtual reality, and medicine. This report\npresents the implementation of a gaze estimation system using the Sony\nSpresense microcontroller board and explores its performance in latency,\nMAC/cycle, and power consumption. The report also provides insights into the\nsystem's architecture, including the gaze estimation model used. Additionally,\na demonstration of the system is presented, showcasing its functionality and\nperformance. Our lightweight model TinyTrackerS is a mere 169Kb in size, using\n85.8k parameters and runs on the Spresense platform at 3 FPS.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:11:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ruegg","Thomas",""],["Bonazzi","Pietro",""],["Ronco","Andrea",""]]}
{"id":"2308.12314","submitter":"Florent Autrusseau","authors":"Ibtissam Essadik (UIT), Anass Nouri (UIT), Raja Touahni (UIT), Florent\n  Autrusseau (LTeN)","title":"Comparing Autoencoder to Geometrical Features for Vascular Bifurcations\n  Identification","comments":"International Symposium on Image And Signal Processing and Analysis,\n  Sep 2023, Rome, Italy","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The cerebrovascular tree is a complex anatomical structure that plays a\ncrucial role in the brain irrigation. A precise identification of the\nbifurcations in the vascular network is essential for understanding various\ncerebral pathologies. Traditional methods often require manual intervention and\nare sensitive to variations in data quality. In recent years, deep learning\ntechniques, and particularly autoencoders, have shown promising performances\nfor feature extraction and pattern recognition in a variety of domains. In this\npaper, we propose two novel approaches for vascular bifurcation identification\nbased respectiveley on Autoencoder and geometrical features. The performance\nand effectiveness of each method in terms of classification of vascular\nbifurcations using medical imaging data is presented. The evaluation was\nperformed on a sample database composed of 91 TOF-MRA, using various evaluation\nmeasures, including accuracy, F1 score and confusion matrix.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:38:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Essadik","Ibtissam","","UIT"],["Nouri","Anass","","UIT"],["Touahni","Raja","","UIT"],["Autrusseau","Florent","","LTeN"]]}
{"id":"2308.12315","submitter":"Ronghang Zhu","authors":"Ronghang Zhu and Dongliang Guo and Daiqing Qi and Zhixuan Chu and\n  Xiang Yu and Sheng Li","title":"Trustworthy Representation Learning Across Domains","comments":"38 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As AI systems have obtained significant performance to be deployed widely in\nour daily live and human society, people both enjoy the benefits brought by\nthese technologies and suffer many social issues induced by these systems. To\nmake AI systems good enough and trustworthy, plenty of researches have been\ndone to build guidelines for trustworthy AI systems. Machine learning is one of\nthe most important parts for AI systems and representation learning is the\nfundamental technology in machine learning. How to make the representation\nlearning trustworthy in real-world application, e.g., cross domain scenarios,\nis very valuable and necessary for both machine learning and AI system fields.\nInspired by the concepts in trustworthy AI, we proposed the first trustworthy\nrepresentation learning across domains framework which includes four concepts,\ni.e, robustness, privacy, fairness, and explainability, to give a comprehensive\nliterature review on this research direction. Specifically, we first introduce\nthe details of the proposed trustworthy framework for representation learning\nacross domains. Second, we provide basic notions and comprehensively summarize\nexisting methods for the trustworthy framework from four concepts. Finally, we\nconclude this survey with insights and discussions on future research\ndirections.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:38:54 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 23:19:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhu","Ronghang",""],["Guo","Dongliang",""],["Qi","Daiqing",""],["Chu","Zhixuan",""],["Yu","Xiang",""],["Li","Sheng",""]]}
{"id":"2308.12316","submitter":"Richard Scott Bergna","authors":"Richard Bergna, Felix Opolka, Pietro Li\\`o, Jose Miguel\n  Hernandez-Lobato","title":"Graph Neural Stochastic Differential Equations","comments":"9 main pages, 6 of appendix (15 in total), submitted for the Learning\n  on Graph (LoG) conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a novel model Graph Neural Stochastic Differential Equations\n(Graph Neural SDEs). This technique enhances the Graph Neural Ordinary\nDifferential Equations (Graph Neural ODEs) by embedding randomness into data\nrepresentation using Brownian motion. This inclusion allows for the assessment\nof prediction uncertainty, a crucial aspect frequently missed in current\nmodels. In our framework, we spotlight the \\textit{Latent Graph Neural SDE}\nvariant, demonstrating its effectiveness. Through empirical studies, we find\nthat Latent Graph Neural SDEs surpass conventional models like Graph\nConvolutional Networks and Graph Neural ODEs, especially in confidence\nprediction, making them superior in handling out-of-distribution detection\nacross both static and spatio-temporal contexts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 09:20:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bergna","Richard",""],["Opolka","Felix",""],["Li\u00f2","Pietro",""],["Hernandez-Lobato","Jose Miguel",""]]}
{"id":"2308.12317","submitter":"Saibal Ray","authors":"Francisco Tello-Ortiz, \\'Angel Rinc\\'on, A. Alvarez and Saibal Ray","title":"Gravitationally decoupled Non-Schwarzschild black holes and wormhole\n  space-times","comments":"15 pages, 6 figures, Accepted in European Physical Journal C (in\n  press)","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, using gravitational decoupling by means of minimal geometric\ndeformation approach, we obtain a new spherically symmetric and static black\nhole solution. To progress, we close the system by assuming that the average\npressure of the $\\theta$-sector is vanishing. Also, we tackle the problem\nregarding how, for a given minimally deformed black hole solution, one can\nconnect it to a wormhole space-time.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 10:28:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tello-Ortiz","Francisco",""],["Rinc\u00f3n","\u00c1ngel",""],["Alvarez","A.",""],["Ray","Saibal",""]]}
{"id":"2308.12318","submitter":"Wenkai Zhang","authors":"Wenkai Zhang, Bo Wu, Junwei Cheng, Hailong Zhou, Jianji Dong, Dongmei\n  Huang, P. K. A. Wai and Xinliang Zhang","title":"Eight-input optical programmable logic array enabled by parallel\n  spectrum modulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.ET physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite over 40 years' development of optical logic computing, the studies\nhave been still struggling to support more than four operands, since the high\nparallelism of light has not been fully leveraged blocked by the optical\nnonlinearity and redundant input modulation in existing methods. Here, we\npropose a scalable multi-input optical programmable logic array (PLA) with\nminimal logical input, enabled by parallel spectrum modulation. By making full\nuse of the wavelength resource, an eight-input PLA is experimentally\ndemonstrated, and there are 2^256 possible combinations of generated logic\ngates. Various complex logic fuctions, such as 8-256 decoder, 4-bit comparator,\nadder and multiplier are experimentally demonstrated via leveraging the PLA.\nThe scale of PLA can be further extended by fully using the dimensions of\nwavelength and space. As an example, a nine-input PLA is implemented to realize\nthe two-dimensional optical cellular automaton for the first time and perform\nConway's Game of Life to simulate the evolutionary process of cells. Our work\nsignificantly alleviates the challenge of extensibility of optical logic\ndevices, opening up new avenues for future large-scale, high-speed and\nenergy-efficient optical digital computing.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:21:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Wenkai",""],["Wu","Bo",""],["Cheng","Junwei",""],["Zhou","Hailong",""],["Dong","Jianji",""],["Huang","Dongmei",""],["Wai","P. K. A.",""],["Zhang","Xinliang",""]]}
{"id":"2308.12319","submitter":"Hongwei Yao","authors":"Hongwei Yao, Zheng Li, Kunzhe Huang, Jian Lou, Zhan Qin, Kui Ren","title":"RemovalNet: DNN Fingerprint Removal Attacks","comments":"some mistake","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the performance of deep neural networks (DNNs) remarkably improving,\nDNNs have been widely used in many areas. Consequently, the DNN model has\nbecome a valuable asset, and its intellectual property is safeguarded by\nownership verification techniques (e.g., DNN fingerprinting). However, the\nfeasibility of the DNN fingerprint removal attack and its potential influence\nremains an open problem. In this paper, we perform the first comprehensive\ninvestigation of DNN fingerprint removal attacks. Generally, the knowledge\ncontained in a DNN model can be categorized into general semantic and\nfingerprint-specific knowledge. To this end, we propose a min-max bilevel\noptimization-based DNN fingerprint removal attack named RemovalNet, to evade\nmodel ownership verification. The lower-level optimization is designed to\nremove fingerprint-specific knowledge. While in the upper-level optimization,\nwe distill the victim model's general semantic knowledge to maintain the\nsurrogate model's performance. We conduct extensive experiments to evaluate the\nfidelity, effectiveness, and efficiency of the RemovalNet against four advanced\ndefense methods on six metrics. The empirical results demonstrate that (1) the\nRemovalNet is effective. After our DNN fingerprint removal attack, the model\ndistance between the target and surrogate models is x100 times higher than that\nof the baseline attacks, (2) the RemovalNet is efficient. It uses only 0.2%\n(400 samples) of the substitute dataset and 1,000 iterations to conduct our\nattack. Besides, compared with advanced model stealing attacks, the RemovalNet\nsaves nearly 85% of computational resources at most, (3) the RemovalNet\nachieves high fidelity that the created surrogate model maintains high accuracy\nafter the DNN fingerprint removal process. Our code is available at:\nhttps://github.com/grasses/RemovalNet.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:31:38 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 09:26:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yao","Hongwei",""],["Li","Zheng",""],["Huang","Kunzhe",""],["Lou","Jian",""],["Qin","Zhan",""],["Ren","Kui",""]]}
{"id":"2308.12320","submitter":"Xiaoyu Dong","authors":"Xiaoyu Dong and Naoto Yokoya","title":"Understanding Dark Scenes by Contrasting Multi-Modal Observations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding dark scenes based on multi-modal image data is challenging, as\nboth the visible and auxiliary modalities provide limited semantic information\nfor the task. Previous methods focus on fusing the two modalities but neglect\nthe correlations among semantic classes when minimizing losses to align pixels\nwith labels, resulting in inaccurate class predictions. To address these\nissues, we introduce a supervised multi-modal contrastive learning approach to\nincrease the semantic discriminability of the learned multi-modal feature\nspaces by jointly performing cross-modal and intra-modal contrast under the\nsupervision of the class correlations. The cross-modal contrast encourages\nsame-class embeddings from across the two modalities to be closer and pushes\ndifferent-class ones apart. The intra-modal contrast forces same-class or\ndifferent-class embeddings within each modality to be together or apart. We\nvalidate our approach on a variety of tasks that cover diverse light conditions\nand image modalities. Experiments show that our approach can effectively\nenhance dark scene understanding based on multi-modal images with limited\nsemantics by shaping semantic-discriminative feature spaces. Comparisons with\nprevious methods demonstrate our state-of-the-art performance. Code and\npretrained models are available at https://github.com/palmdong/SMMCL.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 11:39:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dong","Xiaoyu",""],["Yokoya","Naoto",""]]}
{"id":"2308.12321","submitter":"Reyne Dowling","authors":"Reyne Dowling and Mikhail Kostylev","title":"Enhancing the Capture of Magnetic Nanoparticles Inside of Ferromagnetic\n  Nanostructures Using External Magnetic Fields","comments":"25 pages, 30 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The influence of an external magnetic field upon the capture of 130 nm\nmagnetic nanoparticles (MNPs) by ferromagnetic nanostructures was investigated.\nThe magnetophoretic forces acting upon a nanoparticle were simulated in\nexternal magnetic fields parallel and perpendicular to ferromagnetic\nnanostructures consisting of arrays of antidots and dots. Changing the\ndirection of the external field was found to dramatically alter the\nmagnetophoretic forces acting on the particle and the trajectories of the MNPs.\nA field parallel to the nanostructures' surfaces generated magnetophoretic\nforces that directed the nanoparticle into the nanostructures. A perpendicular\nfield produced forces directing particles onto the structures' surfaces.\nNanostructures were etched into the surfaces of Permalloy films using ion beam\nlithography. MNPs were then deposited onto the films' surfaces under a parallel\nor perpendicular magnetic field. The distributions of particles in the\nnanostructures were analysed to obtain the capture efficiencies of each\nstructure which indicate the proportion of particles trapped inside. Without an\nexternal field, the highest efficiency was displayed by arrays of circular\nantidots with circular dot arrays displaying the lowest. Antidot arrays\ndisplayed higher capture efficiencies than dot arrays. Addition of a field\nparallel to the surface significantly increased the capture efficiencies and\naddition of a field perpendicular to the surface decreased the efficiencies.\nUnder the perpendicular field, the particles were instead caught on the outer\nedges of the nanostructures. These results suggest that application of a\nparallel external magnetic field promotes the capture of MNPs within\nferromagnetic nanostructures and a perpendicular field increases the capture of\nMNPs onto the outer surface and edges of nanostructures.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:11:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dowling","Reyne",""],["Kostylev","Mikhail",""]]}
{"id":"2308.12322","submitter":"Shaoyuan Huang","authors":"Shaoyuan Huang, Heng Zhang, Xiaofei Wang, Min Chen, Jianxin Li, and\n  Victor C. M. Leung","title":"Fine-grained Spatio-Temporal Distribution Prediction of Mobile Content\n  Delivery in 5G Ultra-Dense Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The 5G networks have extensively promoted the growth of mobile users and\nnovel applications, and with the skyrocketing user requests for a large amount\nof popular content, the consequent content delivery services (CDSs) have been\nbringing a heavy load to mobile service providers. As a key mission in\nintelligent networks management, understanding and predicting the distribution\nof CDSs benefits many tasks of modern network services such as resource\nprovisioning and proactive content caching for content delivery networks.\nHowever, the revolutions in novel ubiquitous network architectures led by\nultra-dense networks (UDNs) make the task extremely challenging. Specifically,\nconventional methods face the challenges of insufficient spatio precision,\nlacking generalizability, and complex multi-feature dependencies of user\nrequests, making their effectiveness unreliable in CDSs prediction under 5G\nUDNs. In this paper, we propose to adopt a series of encoding and sampling\nmethods to model CDSs of known and unknown areas at a tailored fine-grained\nlevel. Moreover, we design a spatio-temporal-social multi-feature extraction\nframework for CDSs hotspots prediction, in which a novel edge-enhanced graph\nconvolution block is proposed to encode dynamic CDSs networks based on the\nsocial relationships and the spatio features. Besides, we introduce the\nLong-Short Term Memory (LSTM) to further capture the temporal dependency.\nExtensive performance evaluations with real-world measurement data collected in\ntwo mobile content applications demonstrate the effectiveness of our proposed\nsolution, which can improve the prediction area under the curve (AUC) by 40.5%\ncompared to the state-of-the-art proposals at a spatio granularity of 76m, with\nup to 80% of the unknown areas.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:34:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Huang","Shaoyuan",""],["Zhang","Heng",""],["Wang","Xiaofei",""],["Chen","Min",""],["Li","Jianxin",""],["Leung","Victor C. M.",""]]}
{"id":"2308.12323","submitter":"Quirijn Meijer","authors":"Quirijn Meijer, Melissa Lopez, Daichi Tsuna, Sarah Caudill","title":"Gravitational-Wave Searches for Cosmic String Cusps in Einstein\n  Telescope Data using Deep Learning","comments":"15 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gravitational-wave searches for cosmic strings are currently hindered by the\npresence of detector glitches, some classes of which strongly resemble cosmic\nstring signals. This confusion greatly reduces the efficiency of searches. A\ndeep-learning model is proposed for the task of distinguishing between\ngravitational wave signals from cosmic string cusps and simulated blip glitches\nin design sensitivity data from the future Einstein Telescope. The model is an\nensemble consisting of three convolutional neural networks, achieving an\naccuracy of 79%, a true positive rate of 76%, and a false positive rate of 18%.\nThis marks the first time convolutional neural networks have been trained on a\nrealistic population of Einstein Telescope glitches. On a dataset consisting of\nsignals and glitches, the model is shown to outperform matched filtering,\nspecifically being better at rejecting glitches. The behaviour of the model is\ninterpreted through the application of several methods, including a novel\ntechnique called waveform surgery, used to quantify the importance of waveform\nsections to a classification model. In addition, a method to visualise\nconvolutional neural network activations for one-dimensional time series is\nproposed and used. These analyses help further the understanding of the\nmorphological differences between cosmic string cusp signals and blip glitches.\nBecause of its classification speed in the order of magnitude of milliseconds,\nthe deep-learning model is suitable for future use as part of a real-time\ndetection pipeline. The deep-learning model is transverse and can therefore\npotentially be applied to other transient searches.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 12:57:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Meijer","Quirijn",""],["Lopez","Melissa",""],["Tsuna","Daichi",""],["Caudill","Sarah",""]]}
{"id":"2308.12324","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Differential cross-section measurements of the production of four\n  charged leptons in association with two jets using the ATLAS detector","comments":"47 pages in total, author list starting page 30, 11 figures, 4\n  tables, submitted to JHEP. All figures including auxiliary figures are\n  available at\n  https://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/STDM-2020-02","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-152","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Differential cross-sections are measured for the production of four charged\nleptons in association with two jets. These measurements are sensitive to final\nstates in which the jets are produced via the strong interaction as well as to\nthe purely-electroweak vector boson scattering process. The analysis is\nperformed using proton-proton collision data collected by ATLAS at\n$\\sqrt{s}=13$ TeV and with an integrated luminosity of 140 fb$^{-1}$. The data\nare corrected for the effects of detector inefficiency and resolution and are\ncompared to state-of-the-art Monte Carlo event generator predictions. The\ndifferential cross-sections are used to search for anomalous weak-boson\nself-interactions that are induced by dimension-six and dimension-eight\noperators in Standard Model effective field theory.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 14:10:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.12325","submitter":"Colin Zhang","authors":"John Ho, Zhao-Heng Yin, Colin Zhang, Henry Overhauser, Kyle Swanson,\n  Yang Ha","title":"Predicting Drug Solubility Using Different Machine Learning Methods --\n  Linear Regression Model with Extracted Chemical Features vs Graph\n  Convolutional Neural Network","comments":"6 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Predicting the solubility of given molecules is an important task in the\npharmaceutical industry, and consequently this is a well-studied topic. In this\nresearch, we revisited this problem with the advantage of modern computing\nresources. We applied two machine learning models, a linear regression model\nand a graph convolutional neural network model, on multiple experimental\ndatasets. Both methods can make reasonable predictions while the GCNN model had\nthe best performance. However, the current GCNN model is a black box, while\nfeature importance analysis from the linear regression model offers more\ninsights into the underlying chemical influences. Using the linear regression\nmodel, we show how each functional group affects the overall solubility.\nUltimately, knowing how chemical structure influences chemical properties is\ncrucial when designing new drugs. Future work should aim to combine the high\nperformance of GCNNs with the interpretability of linear regression, unlocking\nnew advances in next generation high throughput screening.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:35:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ho","John",""],["Yin","Zhao-Heng",""],["Zhang","Colin",""],["Overhauser","Henry",""],["Swanson","Kyle",""],["Ha","Yang",""]]}
{"id":"2308.12326","submitter":"Michael Florian Wondrak","authors":"Michael F. Wondrak, Walter D. van Suijlekom, Heino Falcke","title":"Reply to \"Comment on 'Gravitational Pair Production and Black Hole\n  Evaporation'\"","comments":"2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent letter, the authors presented a unified derivation of the\nelectric Schwinger effect and Hawking radiation with an additional radiation\ncomponent. The approach discloses a radial profile of black hole pair\nproduction and traces the emission back to local tidal forces which are\nindependent of the black hole event horizon. It uses an effective action valid\nto second order in curvature and arbitrary order in proper time. A comment\nsupposed an inconsistency when applying the formula to other cases, i.e. the\nSchwinger effect with magnetic fields and cosmological particle production.\nThis letter points out that these conclusions are drawn from using the formula\noutside its range of applicability.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:43:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wondrak","Michael F.",""],["van Suijlekom","Walter D.",""],["Falcke","Heino",""]]}
{"id":"2308.12327","submitter":"Dong Bai","authors":"Dong Bai","title":"Towards experimental determination of spin entanglement of nucleon pairs","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nuclear entanglement is a flagship in the interdisciplinary direction of\nnuclear physics and quantum information science. Spin entanglement, a special\nkind of nuclear entanglement, is ubiquitous in nuclear structures and dynamics.\nBased on the idea of quantum state tomography, the problem of experimental\ndetermination of spin entanglement of two-nucleon pure states is studied\ndirectly within the scope of nuclear physics. It is shown that the amount of\nspin entanglement can be obtained by measuring three spin polarizations of one\nnucleon in polarization experiments. The errors from imperfect preparation of\nnucleon pairs are also analyzed. This work not only complements the existing\nliterature of nuclear entanglement but also provides new opportunities for\nnuclear physics with polarized particles.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 16:24:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bai","Dong",""]]}
{"id":"2308.12328","submitter":"Batuhan Mekiker","authors":"Batuhan Mekiker, Alisha Patel, Mike P. Wittie","title":"Cost-Effective Situational Awareness Through IoT COTS Radios","comments":"6 pages, 3 figures, targeted to IEEE MILCOM conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Situational awareness (SA) through encrypted connectivity in modern warfare\nis critical to battlefield coordination. Existing solutions provide\ninfrastructure-less connectivity and situational awareness, but at a high cost,\npower consumption, and bulky form factors that limit their utility for tactical\noperations. We propose the Beartooth MKII radios as a cost- and\npower-effective, handy solution for establishing a situational awareness\noverlay. To integrate with military information brokers, such as the Tactical\nAssault Kit (TAK), we propose the Beartooth Gateway, which creates an IP\nnetwork between Beartooth radios, Gateways, and other TAK-capable devices. We\nshow that leveraging Internet of Things (IoT) Commercial Off The Shelf (COTS)\ncomponents for MKII and the Gateway can enhance the availability of SA and meet\nthe user requirements in the field while ensuring compatibility with existing\nIP networks connected to TAK infrastructure.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:34:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mekiker","Batuhan",""],["Patel","Alisha",""],["Wittie","Mike P.",""]]}
{"id":"2308.12329","submitter":"Anders Miltner","authors":"Anders Miltner and Devon Loehr and Arnold Mong and Kathleen Fisher and\n  David Walker","title":"Saggitarius: A DSL for Specifying Grammatical Domains","comments":"OOPSLA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Common data types like dates, addresses, phone numbers and tables can have\nmultiple textual representations, and many heavily-used languages, such as SQL,\ncome in several dialects. These variations can cause data to be misinterpreted,\nleading to silent data corruption, failure of data processing systems, or even\nsecurity vulnerabilities. Saggitarius is a new language and system designed to\nhelp programmers reason about the format of data, by describing grammatical\ndomains -- that is, sets of context-free grammars that describe the many\npossible representations of a datatype. We describe the design of Saggitarius\nvia example and provide a relational semantics. We show how Saggitarius may be\nused to analyze a data set: given example data, it uses an algorithm based on\nsemi-ring parsing and MaxSAT to infer which grammar in a given domain best\nmatches that data. We evaluate the effectiveness of the algorithm on a\nbenchmark suite of 110 example problems, and we demonstrate that our system\ntypically returns a satisfying grammar within a few seconds with only a small\nnumber of examples. We also delve deeper into a more extensive case study on\nusing Saggitarius for CSV dialect detection. Despite being general-purpose, we\nfind that Saggitarius offers comparable results to hand-tuned, specialized\ntools; in the case of CSV, it infers grammars for 84% of benchmarks within 60\nseconds, and has comparable accuracy to custom-built dialect detection tools.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:57:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Miltner","Anders",""],["Loehr","Devon",""],["Mong","Arnold",""],["Fisher","Kathleen",""],["Walker","David",""]]}
{"id":"2308.12330","submitter":"Cristina Mondino","authors":"Cristina Mondino, Andreas Tsantilas, Anna-Maria Taki, Ken Van Tilburg,\n  Neal Weiner","title":"Astrometric Weak Lensing with Gaia DR3 and Future Catalogs: Searches for\n  Dark Matter Substructure","comments":"16 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.GA hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Small-scale dark matter structures lighter than a billion solar masses are an\nimportant probe of primordial density fluctuations and dark matter\nmicrophysics. Due to their lack of starlight emission, their only guaranteed\nsignatures are gravitational in nature. We report on results of a search for\nastrometric weak lensing by compact dark matter subhalos in the Milky Way with\nGaia DR3 data. Using a matched-filter analysis to look for correlated imprints\nof time-domain lensing on the proper motions of background stars in the\nMagellanic Clouds, we exclude order-unity substructure fractions in halos with\nmasses $M_{l}$ between $10^{7} \\, M_{\\odot}$ and $10^{9} \\, M_{\\odot}$ and\nsizes of one parsec or smaller. We forecast that a similar approach based on\nproper accelerations across the entire sky with data from Gaia DR4 may be\nsensitive to substructure fractions of $f_{l} \\gtrsim 10^{-3}$ in the much\nlower mass range of $10 \\, M_{\\odot} \\lesssim M_{l} \\lesssim 3 \\times 10^{3} \\,\nM_{\\odot}$. We further propose an analogous technique for stacked star-star\nlensing events in the regime of large impact parameters. Our first\nimplementation is not yet sufficiently sensitive but serves as a useful\ndiagnostic and calibration tool; future data releases should enable average\nstellar mass measurements using this stacking method.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mondino","Cristina",""],["Tsantilas","Andreas",""],["Taki","Anna-Maria",""],["Van Tilburg","Ken",""],["Weiner","Neal",""]]}
{"id":"2308.12331","submitter":"Fabio Pacucci","authors":"Fabio Pacucci, Bao Nguyen, Stefano Carniani, Roberto Maiolino, Xiaohui\n  Fan","title":"JWST CEERS & JADES Active Galaxies at z = 4-7 Violate the Local\n  $M_\\bullet-M_\\star$ Relation at $>3\\sigma$: Implications for Low-Mass Black\n  Holes and Seeding Models","comments":"Submitted for publication in The Astrophysical Journal Letters. 13\n  pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JWST is revolutionizing our understanding of the high-z Universe by expanding\nthe black hole horizon, looking farther and to smaller masses, and revealing\nthe stellar light of their hosts. New detections of high-z systems offer\nunprecedented insights into the formation of the first black holes and their\nearly co-evolution with galaxies. By examining JWST galaxies at z=4-7 that host\nH$\\alpha$-detected black holes, we investigate (i) the high-z\n$M_\\bullet-M_\\star$ relation and (ii) the black hole mass distribution,\nespecially in its low-mass range ($M_\\bullet\\lesssim10^{6.5} M_\\odot$). With a\ndetailed statistical analysis, our findings conclusively reveal a high-z\n$M_\\bullet-M_\\star$ relation that deviates at $>3\\sigma$ confidence level from\nthe local relation: $\\log(M_\\bullet/M_\\odot) =\n-2.38^{+0.82}_{-0.83}+1.06^{+0.09}_{-0.09}\\log(M_\\star/M_\\odot)$. Black holes\nare overmassive by $\\sim10-100\\times$ compared to their local counterparts in\nsimilar galactic hosts. This fact is not due to a selection effect in surveys.\nMoreover, our analysis predicts the possibility of detecting in high-z JWST\nsurveys $5-18\\times$ more black holes with $M_\\bullet\\lesssim10^{6.5} M_\\odot$,\nand $10-30\\times$ more with $M_\\bullet \\lesssim 10^{8.5} M_\\odot$, compared to\nlocal relation's predictions. The lighter black holes preferentially occupy\ngalaxies with a stellar mass of $\\sim 10^{7.5}-10^8 M_\\odot$. We have yet to\ndetect these sources because (i) they may be inactive (duty cycles 1%-10%),\n(ii) the host overshines the AGN, or (iii) the AGN is obscured and not\nimmediately recognizable by line diagnostics. A search of low-mass black holes\nin existing JWST surveys will further test the $M_\\bullet-M_\\star$ relation.\nCurrent JWST fields represent a treasure trove of black hole systems at z=4-7;\ntheir detection will provide crucial insights into their early evolution and\nco-evolution with their galactic hosts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pacucci","Fabio",""],["Nguyen","Bao",""],["Carniani","Stefano",""],["Maiolino","Roberto",""],["Fan","Xiaohui",""]]}
{"id":"2308.12332","submitter":"Kevin Mato","authors":"Kevin Mato and Stefan Hillmich and Robert Wille","title":"Mixed-Dimensional Quantum Circuit Simulation with Decision Diagrams","comments":"12 pages, 5 figures, 1 table","journal-ref":"2023 IEEE International Conference on Quantum Computing and\n  Engineering (QCE)","doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computers promise to solve several categories of problems faster than\nclassical computers ever could. Current research mostly focuses on qubits,\ni.e., systems where the unit of information can assume only two levels.\nHowever, the underlying physics of most (if not all) of the technological\nplatforms supports more than two levels, commonly referred to as qudits.\nPerforming computations with qudits increases the overall complexity while, at\nthe same time, reducing the number of operations and providing a lower error\nrate. Furthermore, qudits with different number of levels can be mixed in one\nsystem to ease the experimental control and keep representations as compact as\npossible. Exploiting these capabilities requires dedicated software support to\ntackle the increased complexity in an automated and efficient fashion. In this\npaper, we present a qudit simulator that handles mixed-dimensional systems\nbased on Decision Diagrams (DDs). More precisely, we discuss the type of\ndecision diagram introduced as underlying data structure as well as the\nresulting implementation. Experimental evaluations demonstrate that the\nproposed solution is capable of efficiently simulating mixed-dimensional\nquantum circuits, with specific use cases including more than 100 qudits in one\ncircuit. The source code of the simulator is available via\ngithub.com/cda-tum/MiSiM under the MIT~license.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mato","Kevin",""],["Hillmich","Stefan",""],["Wille","Robert",""]]}
{"id":"2308.12333","submitter":"Seyed Faroogh Moosavian","authors":"Nafiz Ishtiaque, Seyed Faroogh Moosavian, Yehao Zhou","title":"Elliptic Stable Envelopes for Certain Non-Symplectic Varieties and\n  Dynamical R-Matrices for Superspin Chains from The Bethe/Gauge Correspondence","comments":"89 Pages + Appendices + References = 125 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech math.AG math.QA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize Aganagic-Okounkov's theory of elliptic stable envelopes, and\nits physical realization in Dedushenko-Nekrasov's and Bullimore-Zhang's works,\nto certain varieties without holomorphic symplectic structure or polarization.\nThese classes of varieties include, in particular, classical Higgs branches of\n3d $\\mathcal N=2$ quiver gauge theories. The Bethe/Gauge Correspondence relates\nsuch a gauge theory to an anisotropic/elliptic superspin chain, and the stable\nenvelopes compute the R-matrix that solves the dynamical Yang-Baxter equation\n(dYBE) for this spin chain. As an illustrative example, we solve the dYBE for\nthe elliptic $\\mathfrak{sl}(1|1)$ spin chain with fundamental representations\nusing the corresponding 3d $\\mathcal N=2$ SQCD whose classical Higgs branch is\nthe Lascoux resolution of a determinantal variety. Certain Janus partition\nfunctions of this theory on $I \\times \\mathbb E$ for an interval $I$ and an\nelliptic curve $\\mathbb E$ compute the stable envelopes, and in turn the\ngeometric R-matrix, of the $\\mathfrak{sl}(1|1)$ spin chain. Furthermore, we\nconsider the 2d and 1d reductions of elliptic stable envelopes and the\nR-matrix. The reduction to 2d gives the K-theoretic stable envelopes and the\ntrigonometric R-matrix, and a further reduction to 1d produces the\ncohomological stable envelopes and the rational R-matrix. The latter recovers\nthe results of Rim\\'anyi and Rozansky.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ishtiaque","Nafiz",""],["Moosavian","Seyed Faroogh",""],["Zhou","Yehao",""]]}
{"id":"2308.12334","submitter":"Eric R. Sharpe","authors":"W. Gu, I. V. Melnikov, E. Sharpe","title":"Quantum cohomology from mixed Higgs-Coulomb branches","comments":"64 pages, LaTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize Coulomb-branch-based gauged linear sigma model (GLSM)-based\ncomputations of quantum cohomology rings of Fano spaces. Typically such\ncomputations have focused on GLSMs without superpotential, for which the IR\nphase of the GLSM is a pure Coulomb branch, and quantum cohomology is\ndetermined by the critical locus of a twisted one-loop effective\nsuperpotential. Here, we systematically extend to cases for which the IR phase\nis a mixture of Coulomb and Higgs branches, where the latter is a\nLandau-Ginzburg orbifold. We describe the state spaces and products of\ncorresponding operators in detail, comparing a geometric phase description,\nwhere the OPE ring is quantum cohomology, to the IR description in terms of\nCoulomb and Higgs branch states. As a concrete test of our methods, we compare\nto existing mathematics results for quantum cohomology rings of hypersurfaces\nin projective spaces in numerous examples.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gu","W.",""],["Melnikov","I. V.",""],["Sharpe","E.",""]]}
{"id":"2308.12335","submitter":"Jacob Linder","authors":"Chi Sun and Jacob Linder","title":"Spin pumping from a ferromagnetic insulator into an altermagnet","comments":"5 pages, 3 figures + supplementary information","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A class of antiferromagnets with spin-polarized electron bands, yet zero net\nmagnetization, called altermagnets is attracting increasing attention due to\ntheir potential use in spintronics. Here, we study spin injection into an\naltermagnet via spin pumping from a ferromagnetic insulator. We find that the\nspin pumping behaves qualitatively different depending on how the altermagnet\nis crystallographically oriented relative the interface to the ferromagnetic\ninsulator. The altermagnetic state can enhance or suppress spin pumping, which\nwe explain in terms of spin-split altermagnetic band structure and the\nspin-flip probability for the incident modes. Including the effect of\ninterfacial Rashba spin-orbit coupling, we find that the spin-pumping effect is\nin general magnified, but that it can display a non-monotonic behavior as a\nfunction of the spin-orbit coupling strength. We show that there exists an\noptimal value of the spin-orbit coupling strength which causes an order of\nmagnitude increase in the pumped spin current, even for the crystallographic\norientation of the altermagnet which suppresses the spin pumping.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sun","Chi",""],["Linder","Jacob",""]]}
{"id":"2308.12336","submitter":"Tarak Nath Maity","authors":"Tarak Nath Maity, Akash Kumar Saha, Sagnik Mondal, Ranjan Laha","title":"Neutrinos from the Sun can discover dark matter-electron scattering","comments":"11 pages, 5 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":"HRI-RECAPP-2023-03","categories":"hep-ph astro-ph.CO astro-ph.HE astro-ph.SR hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We probe dark matter-electron scattering using high-energy neutrino\nobservations from the Sun. Dark matter (DM) interacting with electrons can get\ncaptured inside the Sun. These captured DM may annihilate to produce different\nStandard Model (SM) particles. Neutrinos produced from these SM states can be\nobserved in IceCube and DeepCore. Although there is no excess of neutrinos from\nthe Solar direction, we find that the current data-sets of IceCube and DeepCore\nset the strongest constraint on DM-electron scattering cross section in the DM\nmass range $10\\,$GeV to $10^5\\,$GeV. Our work implies that future observations\nof the Sun by neutrino telescopes have the potential to discover DM-electron\ninteraction.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Maity","Tarak Nath",""],["Saha","Akash Kumar",""],["Mondal","Sagnik",""],["Laha","Ranjan",""]]}
{"id":"2308.12337","submitter":"Anindya Dey","authors":"Anindya Dey","title":"Three dimensional Mirrors from IR N-ality","comments":"6 pages, 6 figures, figures are color-coded","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss an explicit field theory construction of three dimensional mirrors\nfor a large sub-class of quiver gauge theories involving unitary and special\nunitary gauge nodes with matter in fundamental and bifundamental\nrepresentations. For this sub-class of theories, one can deploy a sequence of\nIR dualities and certain Abelian field theory operations to reduce the\naforementioned problem to a problem of finding the 3d mirror of a simpler\nunitary quiver gauge theory. We illustrate the construction with a linear\nquiver consisting of unitary and special unitary gauge nodes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dey","Anindya",""]]}
{"id":"2308.12338","submitter":"Ryuji Takagi","authors":"Naoto Shiraishi and Ryuji Takagi","title":"Alchemy of quantum coherence: Arbitrary amplification in asymptotic and\n  catalytic coherence manipulation","comments":"7+20 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum coherence is one of the fundamental aspects distinguishing classical\nand quantum theories. Coherence between different energy eigenstates is\nparticularly important, as it serves as a valuable resource under the law of\nenergy conservation. A fundamental question in this setting is how well one can\nprepare good coherent states from low coherent states and whether a given\ncoherent state is convertible to another one. Here, contrarily to intuitions\nand previous expectations, we show that any low coherent state is convertible\nto any high coherent state arbitrarily well, implying that one can increase the\namount of quantum coherence inexhaustibly. We demonstrate this remarkable\nphenomenon in two operational settings: asymptotic and catalytic\ntransformations. For a variant of asymptotic coherence manipulation, the rate\nof transformation becomes unbounded regardless of how weak the initial\ncoherence is. This particularly shows that the infinite rate of coherence\ndistillation can be accomplished for all coherent states. In a non-asymptotic\ntransformation with a catalyst -- a helper state that locally remains in the\noriginal form after the transformation, we show that an arbitrary state can be\nobtained from any low coherent states. Our protocol avoids the barrier of\nquantum coherence in state conversion and allows us to amplify quantum\ncoherence infinitely. On its opposite side, we show that the aforementioned\namplification requires small but non-zero coherence, characterizing the\ncondition under which the anomalous power of coherence transformation is\nenabled.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shiraishi","Naoto",""],["Takagi","Ryuji",""]]}
{"id":"2308.12339","submitter":"Sascha Diefenbacher","authors":"Sascha Diefenbacher, Vinicius Mikuni, Benjamin Nachman","title":"Refining Fast Calorimeter Simulations with a Schr\\\"{o}dinger Bridge","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning-based simulations, especially calorimeter simulations, are\npromising tools for approximating the precision of classical high energy\nphysics simulations with a fraction of the generation time. Nearly all methods\nproposed so far learn neural networks that map a random variable with a known\nprobability density, like a Gaussian, to realistic-looking events. In many\ncases, physics events are not close to Gaussian and so these neural networks\nhave to learn a highly complex function. We study an alternative approach:\nSchr\\\"{o}dinger bridge Quality Improvement via Refinement of Existing\nLightweight Simulations (SQuIRELS). SQuIRELS leverages the power of\ndiffusion-based neural networks and Schr\\\"{o}dinger bridges to map between\nsamples where the probability density is not known explicitly. We apply\nSQuIRELS to the task of refining a classical fast simulation to approximate a\nfull classical simulation. On simulated calorimeter events, we find that\nSQuIRELS is able to reproduce highly non-trivial features of the full\nsimulation with a fraction of the generation time.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Diefenbacher","Sascha",""],["Mikuni","Vinicius",""],["Nachman","Benjamin",""]]}
{"id":"2308.12340","submitter":"Niusha Ahvazi","authors":"Niusha Ahvazi, Laura V. Sales, Jessica E. Doppel, Andrew Benson,\n  Richard D'Souza, Vicente Rodriguez-Gomez","title":"The progenitors of the intra-cluster light and intra-cluster globular\n  clusters in galaxy groups and clusters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the IllustrisTNG50 cosmological hydrodynamical simulation,\ncomplemented by a catalog of tagged globular clusters, to investigate the\nproperties and build up of two extended luminous components: the intra-cluster\nlight (ICL) and the intra-cluster globular clusters (ICGC). We select the 39\nmost massive groups and clusters in the box, spanning the range of virial\nmasses $5 \\times 10^{12} < \\rm M_{200}/\\rm M_{\\odot} < 2 \\times 10^{14}$. We\nfind good agreement between predictions from the simulations and current\nobservational estimates of the fraction of mass in the ICL and its radial\nextension. The stellar mass of the ICL is only $\\sim10\\%-20\\%$ of the stellar\nmass in the central galaxy but encodes useful information on the assembly\nhistory of the group or cluster. About half the ICL in all our systems is\nbrought in by galaxies in a narrow stellar mass range, $M_*=10^{10}-10^{11}$\n$\\rm M_{\\odot}$. However, the contribution of low-mass galaxies ($M_*<10^{10}$\n$\\rm M_{\\odot}$) to the build-up of the ICL varies broadly from system to\nsystem, $\\sim 5\\%-45\\%$, a feature that might be recovered from the observable\nproperties of the ICL at $z=0$. At fixed virial mass, systems where the\naccretion of dwarf galaxies plays an important role have shallower metallicity\nprofiles, less metal content and a lower stellar mass in the ICL than systems\nwhere the main contributors are more massive galaxies. We show that\nintra-cluster GCs are also good tracers of this history, representing a\nvaluable alternative when diffuse light is not detectable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ahvazi","Niusha",""],["Sales","Laura V.",""],["Doppel","Jessica E.",""],["Benson","Andrew",""],["D'Souza","Richard",""],["Rodriguez-Gomez","Vicente",""]]}
{"id":"2308.12341","submitter":"Hong Zhe Chen","authors":"Hong Zhe Chen, Robert C. Myers, and Ana-Maria Raclariu","title":"Entanglement, Soft Modes, and Celestial Holography","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We evaluate the vacuum entanglement entropy across a cut of future null\ninfinity for free Maxwell theory in four-dimensional Minkowski spacetime. The\nWeyl invariance of 4D Maxwell theory allows us to embed the Minkowski spacetime\ninside the Einstein static universe. The Minkowski vacuum can then be described\nas a thermofield double state on the (future) Milne wedges of the original and\nan inverted Minkowski patches. We show that the soft mode contribution to\nentanglement entropy is due to correlations between asymptotic charges of these\nMilne wedges, or equivalently nontrivial conformally soft (or edge) mode\nconfigurations at the entangling surface.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Hong Zhe",""],["Myers","Robert C.",""],["Raclariu","Ana-Maria",""]]}
{"id":"2308.12342","submitter":"Thomas Haworth PhD","authors":"Thomas J. Haworth, Megan Reiter, C. Robert O'Dell, Peter Zeidler,\n  Olivier Berne, Carlo F. Manara, Giulia Ballabio, Jinyoung S. Kim, John Bally,\n  Javier R. Goicoechea, Mari-Liis Aru, Aashish Gupta, Anna Miotello","title":"The VLT MUSE NFM view of outflows and externally photoevaporating discs\n  near the Orion Bar","comments":"14 pages, 8 figures. Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present VLT/MUSE Narrow Field Mode (NFM) observations of a pair of\ndisc-bearing young stellar objects towards the Orion Bar: 203-504 and 203-506.\nBoth of these discs are subject to external photoevaporation, where winds are\nlaunched from their outer regions due to environmental irradiation.\nIntriguingly, despite having projected separation from one another of only\n1.65{\\arcsec} (660au at 400pc), 203-504 has a classic teardrop shaped\n``proplyd'' morphology pointing towards $\\theta^2$Ori A (indicating irradiation\nby the EUV of that star, rather than $\\theta^1$ Ori C) but 203-506 has no\nionisation front, indicating it is not irradiated by stellar EUV at all.\nHowever, 203-506 does show [CI] 8727{\\AA} and [OI] 6300{\\AA} in emission,\nindicating irradiation by stellar FUV. This explicitly demonstrates the\nimportance of FUV irradiation in driving mass loss from discs. We conclude that\nshielding of 203-506 from EUV is most likely due to its position on the\nobservers side of an ionized layer lying in the foreground of the Huygens\nRegion. We demonstrate that the outflow HH 519, previously thought to be\nemanating from 203-504 is actually an irradiated cloud edge and identify a new\ncompact outflow from that object approximately along our line of sight with a\nvelocity $\\sim130$\\,km\\,s$^{-1}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Haworth","Thomas J.",""],["Reiter","Megan",""],["O'Dell","C. Robert",""],["Zeidler","Peter",""],["Berne","Olivier",""],["Manara","Carlo F.",""],["Ballabio","Giulia",""],["Kim","Jinyoung S.",""],["Bally","John",""],["Goicoechea","Javier R.",""],["Aru","Mari-Liis",""],["Gupta","Aashish",""],["Miotello","Anna",""]]}
{"id":"2308.12343","submitter":"Boryana Hadzhiyska","authors":"Boryana Hadzhiyska, Martin J. White, Xinyi Chen, Lehman H. Garrison,\n  Joseph DeRose, Nikhil Padmanabhan, Cristhian Garcia-Quintero, Juan\n  Mena-Fern\\'andez, Shi-Fan Chen, Hee-Jong Seo, Patrick McDonald, Jessica\n  Aguilar, Steven Ahlen, David Brooks, Todd Claybaugh, Axel de la Macorra,\n  Peter Doel, Andreu Font-Ribera, Jaime E. Forero-Romero, Satya Gontcho A\n  Gontcho, Klaus Honscheid, Anthony Kremin, Martin Landriau, Marc Manera, Ramon\n  Miquel, Jundan Nie, Nathalie Palanque-Delabrouille, Mehdi Rezaie, Graziano\n  Rossi, Eusebio Sanchez, Michael Schubnell, Gregory, Tarl\\'e, Zhimin Zhou","title":"Mitigating the noise of DESI mocks using analytic control variates","comments":"15 pages, 9 figures, public package (for power spectrum and control\n  variates estimation)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In order to address fundamental questions related to the expansion history of\nthe Universe and its primordial nature with the next generation of galaxy\nexperiments, we need to model reliably large-scale structure observables such\nas the correlation function and the power spectrum. Cosmological $N$-body\nsimulations provide a reference through which we can test our models, but their\noutput suffers from sample variance on large scales. Fortunately, this is the\nregime where accurate analytic approximations exist. To reduce the variance,\nwhich is key to making optimal use of these simulations, we can leverage the\naccuracy and precision of such analytic descriptions using Control Variates\n(CV). We apply two control variate formulations to mock catalogs generated in\nanticipation of upcoming data from the Dark Energy Spectroscopic Instrument\n(DESI) to test the robustness of its analysis pipeline. Our CV-reduced\nmeasurements, of the power spectrum and correlation function, both pre- and\npost-reconstruction, offer a factor of 5-10 improvement in the measurement\nerror compared with the raw measurements from the DESI mock catalogs. We\nexplore the relevant properties of the galaxy samples that dictate this\nreduction and comment on the improvements we find on some of the derived\nquantities relevant to Baryon Acoustic Oscillation (BAO) analysis. We also\nprovide an optimized package for computing the power spectra and other\ntwo-point statistics of an arbitrary galaxy catalog as well as a pipeline for\nobtaining CV-reduced measurements on any of the AbacusSummit cubic box outputs.\nWe make our scripts, notebooks, and benchmark tests against existing software\npublicly available and report a speed improvement of a factor of $\\sim$10 for a\ngrid size of $N_{\\rm mesh} = 256^3$ compared with $\\texttt{nbodykit}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hadzhiyska","Boryana",""],["White","Martin J.",""],["Chen","Xinyi",""],["Garrison","Lehman H.",""],["DeRose","Joseph",""],["Padmanabhan","Nikhil",""],["Garcia-Quintero","Cristhian",""],["Mena-Fern\u00e1ndez","Juan",""],["Chen","Shi-Fan",""],["Seo","Hee-Jong",""],["McDonald","Patrick",""],["Aguilar","Jessica",""],["Ahlen","Steven",""],["Brooks","David",""],["Claybaugh","Todd",""],["de la Macorra","Axel",""],["Doel","Peter",""],["Font-Ribera","Andreu",""],["Forero-Romero","Jaime E.",""],["Gontcho","Satya Gontcho A",""],["Honscheid","Klaus",""],["Kremin","Anthony",""],["Landriau","Martin",""],["Manera","Marc",""],["Miquel","Ramon",""],["Nie","Jundan",""],["Palanque-Delabrouille","Nathalie",""],["Rezaie","Mehdi",""],["Rossi","Graziano",""],["Sanchez","Eusebio",""],["Schubnell","Michael",""],["Gregory","",""],["Tarl\u00e9","",""],["Zhou","Zhimin",""]]}
{"id":"2308.12344","submitter":"Antti Rantala","authors":"Antti Rantala and Thorsten Naab","title":"Evolution of eccentric stellar disks around supermassive black holes:\n  the complex disk disruption dynamics and the milliparsec stars","comments":"33 pages, 28 figures, submitted into MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the 10 Myr evolution of parsec-scale stellar disks with initial\nmasses of $M_{\\mathrm{disk}} = 1.0$ - $7.5 \\times 10^4 M_\\odot$ and\neccentricities $e_\\mathrm{init}=0.1$-$0.9$ around supermassive black holes\n(SMBHs). Our disk models are embedded in a spherical background potential and\nhave top-heavy single and binary star initial mass functions (IMF) with slopes\nof $0.25$-$1.7$. The systems are evolved with the N-body code\n$\\texttt{BIFROST}$ including post-Newtonian (PN) equations of motion and\nsimplified stellar evolution. All disks are unstable and evolve on Myr\ntimescales towards similar eccentricity distributions peaking at $e_\\star \\sim\n0.3$-$0.4$. Models with high $e_\\mathrm{init}$ also develop a very eccentric\n$(e_\\star\\gtrsim0.9)$ stellar population. For higher disk masses\n$M_\\mathrm{disk} \\gtrsim3 \\times10^4\\;\\mathrm{M_\\odot}$, the disk disruption\ndynamics is more complex than the standard secular eccentric disk instability\nwith opposite precession directions at different disk radii - a precession\ndirection instability. We present an analytical model describing this behavior.\nA milliparsec population of $N\\sim10$-$100$ stars forms around the SMBH in all\nmodels. For low $e_\\mathrm{init}$ stars migrate inward while for\n$e_\\mathrm{init}\\gtrsim0.6$ stars are captured by the Hills mechanism. Without\nPN, after $6$ Myr the captured stars have a sub-thermal eccentricity\ndistribution. We show that including PN effects prevents this thermalization by\nsuppressing resonant relaxation effects and cannot be ignored. The number of\ntidally disrupted stars is similar or larger than the number of milliparsec\nstars. None of the simulated models can simultaneously reproduce the kinematic\nand stellar population properties of the Milky Way center clockwise disk and\nthe S-cluster.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rantala","Antti",""],["Naab","Thorsten",""]]}
{"id":"2308.12345","submitter":"Guillermo Franco Abell\\'an","authors":"Guillermo Franco Abell\\'an, Matteo Braglia, Mario Ballardini, Fabio\n  Finelli and Vivian Poulin","title":"Probing Early Modification of Gravity with Planck, ACT and SPT","comments":"25 pages, 9 figures, 5 tables. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a model of early modified gravity (EMG) that was recently\nproposed as a candidate to resolve the Hubble tension. The model consists in a\nscalar field $\\sigma$ with a non-minimal coupling (NMC) to the Ricci curvature\nof the form $F(\\sigma) = M_{\\mathrm{pl}}^2+\\xi\\sigma^2$ and an effective mass\ninduced by a quartic potential $V(\\sigma) = \\lambda \\sigma^4/4$. We present the\nfirst analyses of the EMG model in light of the latest ACT DR4 and SPT-3G data\nin combination with full Planck data, and find a $\\gtrsim 2\\sigma$ preference\nfor a non-zero EMG contribution from a combination of primary CMB data alone,\nmostly driven by ACT DR4 data. This is different from popular 'Early Dark\nEnergy' models, which are detected only when the high-$\\ell$ information from\nPlanck temperature is removed. We find that the NMC plays a key role in\ncontrolling the evolution of density perturbations that is favored by the data\nover the minimally coupled case. Including measurements of supernovae\nluminosity distance from Pantheon+, baryonic acoustic oscillations and growth\nfactor from BOSS, and CMB lensing of Planck leaves the preference unaffected.\nIn the EMG model, the tension with S$H_0$ES is alleviated from $\\sim 6\\sigma$\nto $\\sim 3\\sigma$. Further adding S$H_0$ES data rise the detection of the EMG\nmodel above $5\\sigma$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Abell\u00e1n","Guillermo Franco",""],["Braglia","Matteo",""],["Ballardini","Mario",""],["Finelli","Fabio",""],["Poulin","Vivian",""]]}
{"id":"2308.12346","submitter":"Jakub Zakrzewski","authors":"Bitan De, Gabriela W\\'ojtowicz, Marek M. Rams, Michael Zwolak, and\n  Jakub Zakrzewski","title":"The confluence of fractured resonances at points of dynamical,\n  many--body flare","comments":"comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall cond-mat.quant-gas quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Resonant transport occurs when there is a matching of frequencies across some\nspatial medium, increasing the efficiency of shuttling particles from one\nreservoir to another. We demonstrate that in a periodically driven, many--body\ntitled lattice there are sets of spatially fractured resonances. These\n``emanate'' from two essential resonances due to scattering off internal\nsurfaces created when the driving frequency and many--body interaction strength\nvary, a scattering reminiscent of lens flare. The confluence of these fractured\nresonances dramatically enhances transport. At one confluence, the interaction\nstrength is finite and the essential resonance arises due to the interplay of\ninteraction with the counter--rotating terms of the periodic drive. The other\nforms where several paths split by the many--body interaction merge in the\nnon--interacting limit. We discuss the origin and structure of the fractured\nresonances, as well as the scaling of the conductance on system parameters.\nThese results furnish a new example of the richness of open, driven, many--body\nsystems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["De","Bitan",""],["W\u00f3jtowicz","Gabriela",""],["Rams","Marek M.",""],["Zwolak","Michael",""],["Zakrzewski","Jakub",""]]}
{"id":"2308.12347","submitter":"Partha Pratim Deka","authors":"P. P. Deka, N. Gupta, P. Jagannathan, S. Sekhar, E. Momjian, S.\n  Bhatnagar, J. Wagenveld, H.-R. Kl\\\"ockner, J. Jose, S. A. Balashev, F.\n  Combes, M. Hilton, D. Borgaonkar, A. Chatterjee, K. L. Emig, A. N. Gaunekar,\n  G. I. G. J\\'ozsa, D. Y. Klutse, K. Knowles, J-.K. Krogager, A. Mohapatra, K.\n  Moodley, S\\'ebastien Muller, P. Noterdaeme, P. Petitjean, P. Salas, S.\n  Sikhosana","title":"The MeerKAT Absorption Line Survey (MALS) data release I: Stokes I image\n  catalogs at 1-1.4 GHz","comments":"64 pages, 25 figures, accepted for publication in the ApJS (full\n  version of the paper with complete tables is available at DR1 release notes)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The MeerKAT Absorption Line Survey (MALS) has observed 391 telescope\npointings at L-band (900 - 1670 MHz) at $\\delta\\lesssim$ $+20\\deg$. We present\nradio continuum images and a catalog of 495,325 (240,321) radio sources\ndetected at a signal-to-noise ratio (SNR) $>$5 over an area of 2289 deg$^2$\n(1132 deg$^2$) at 1006 MHz (1381 MHz). Every MALS pointing contains a central\nbright radio source ($S_{1\\,\\mathrm{GHz}} \\gtrsim 0.2$ Jy). The median spatial\nresolution is $12^{\\prime\\prime}$ ($8^{\\prime\\prime}$). The median rms noise\naway from the pointing center is 25 $\\mu$Jy beam$^{-1}$ (22 $\\mu$Jy\nbeam$^{-1}$) and is within $\\sim$ 15% of the achievable theoretical\nsensitivity. The flux density scale ratio and astrometric accuracy deduced from\nmultiply observed sources in MALS are less than 1% (8% scatter) and\n$1^{\\prime\\prime}$, respectively. Through comparisons with NVSS and FIRST at\n1.4 GHz, we establish the catalog's accuracy in the flux density scale and\nastrometry to be better than 6% (15% scatter) and $0.8^{\\prime\\prime}$,\nrespectively. The median flux density offset is higher (9%) for an alternate\nbeam model based on holographic measurements. The MALS radio source counts at\n1.4 GHz are in agreement with literature. We estimate spectral indices\n($\\alpha$) of a subset of 125,621 sources (SNR$>$8), confirm the flattening of\nspectral indices with decreasing flux density and identify 140 ultra\nsteep-spectrum ($\\alpha<-1.3$) sources as prospective high-$z$ radio galaxies\n($z>2$). We have identified 1308 variable and 122 transient radio sources\ncomprising primarily of AGN that demonstrate long-term (26 years) variability\nin their observed flux densities. The MALS catalogs and images are publicly\navailable at https://mals.iucaa.in.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Deka","P. P.",""],["Gupta","N.",""],["Jagannathan","P.",""],["Sekhar","S.",""],["Momjian","E.",""],["Bhatnagar","S.",""],["Wagenveld","J.",""],["Kl\u00f6ckner","H. -R.",""],["Jose","J.",""],["Balashev","S. A.",""],["Combes","F.",""],["Hilton","M.",""],["Borgaonkar","D.",""],["Chatterjee","A.",""],["Emig","K. L.",""],["Gaunekar","A. N.",""],["J\u00f3zsa","G. I. G.",""],["Klutse","D. Y.",""],["Knowles","K.",""],["Krogager","J-. K.",""],["Mohapatra","A.",""],["Moodley","K.",""],["Muller","S\u00e9bastien",""],["Noterdaeme","P.",""],["Petitjean","P.",""],["Salas","P.",""],["Sikhosana","S.",""]]}
{"id":"2308.12348","submitter":"Astor Sandoval","authors":"Astor Sandoval, Mario Riquelme, Anatoly Spitkovsky, Fabio Bacchini","title":"Particle-in-cell Simulations of the Magnetorotational Instability in\n  Stratified Shearing Boxes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The magnetorotational instability (MRI) plays a crucial role in regulating\nthe accretion efficiency in astrophysical accretion disks. In low-luminosity\ndisks around black holes, such as Sgr A* and M87, Coulomb collisions are\ninfrequent, making the MRI physics effectively collisionless. The collisionless\nMRI gives rise to kinetic plasma effects that can potentially affect its\ndynamic and thermodynamic properties. We present 2D and 3D particle-in-cell\n(PIC) plasma simulations of the collisionless MRI in stratified disks using\nshearing boxes with net vertical field. We use pair plasmas, with initial\n$\\beta=100$ and concentrate on sub-relativistic plasma temperatures ($k_BT\n\\lesssim mc^2$). Our 2D and 3D runs show disk expansion, particle and magnetic\nfield outflows, and a dynamo-like process. They also produce magnetic pressure\ndominated disks with (Maxwell stress dominated) viscosity parameter $\\alpha\n\\sim 0.5-1$. By the end of the simulations, the dynamo-like magnetic field\ntends to dominate the magnetic energy and the viscosity in the disks. Our 2D\nand 3D runs produce fairly similar results, and are also consistent with\nprevious 3D MHD simulations. Our simulations also show nonthermal particle\nacceleration, approximately characterized by power-law tails with temperature\ndependent spectral indices $-p$. For temperatures $k_BT \\sim 0.05-0.3\\, mc^2$,\nwe find $p\\approx 2.2-1.9$. The maximum accelerated particle energy depends on\nthe scale separation between MHD and Larmor-scale plasma phenomena in a way\nconsistent with previous PIC results of magnetic reconnection-driven\nacceleration. Our study constitutes a first step towards modeling from first\nprinciples potentially observable stratified MRI effects in low-luminosity\naccretion disks around black holes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sandoval","Astor",""],["Riquelme","Mario",""],["Spitkovsky","Anatoly",""],["Bacchini","Fabio",""]]}
{"id":"2308.12349","submitter":"Lev Levitin","authors":"Marijn Lucas, Lev V. Levitin, Petra Knappov\\'a, J\\'an Ny\\'eki, Andrew\n  Casey, John Saunders","title":"Verification of Wiedemann-Franz law in silver with moderate residual\n  resistivity ratio","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electrical and thermal transport were studied in a vacuum-annealed\npolycrystalline silver wire with residual resistivity ratio 200-400, in the\ntemperature range 0.1-1.2K and in magnetic fields up to 5T. Both at zero field\nand at 5T the wire exhibits the Wiedemann-Franz law with the fundamental Lorenz\nnumber, contrary to an earlier report [Gloos, K. et al, Cryogenics 30, 14\n(1990)]. Our result demonstrates that silver is an excellent material for\nthermal links in ultra-low-temperature experiments operating at high magnetic\nfields.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:00:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lucas","Marijn",""],["Levitin","Lev V.",""],["Knappov\u00e1","Petra",""],["Ny\u00e9ki","J\u00e1n",""],["Casey","Andrew",""],["Saunders","John",""]]}
{"id":"2308.12350","submitter":"Duo Peng","authors":"Duo Peng, Ping Hu, Qiuhong Ke, Jun Liu","title":"Diffusion-based Image Translation with Label Guidance for Domain\n  Adaptive Semantic Segmentation","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Translating images from a source domain to a target domain for learning\ntarget models is one of the most common strategies in domain adaptive semantic\nsegmentation (DASS). However, existing methods still struggle to preserve\nsemantically-consistent local details between the original and translated\nimages. In this work, we present an innovative approach that addresses this\nchallenge by using source-domain labels as explicit guidance during image\ntranslation. Concretely, we formulate cross-domain image translation as a\ndenoising diffusion process and utilize a novel Semantic Gradient Guidance\n(SGG) method to constrain the translation process, conditioning it on the\npixel-wise source labels. Additionally, a Progressive Translation Learning\n(PTL) strategy is devised to enable the SGG method to work reliably across\ndomains with large gaps. Extensive experiments demonstrate the superiority of\nour approach over state-of-the-art methods.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:01:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Peng","Duo",""],["Hu","Ping",""],["Ke","Qiuhong",""],["Liu","Jun",""]]}
{"id":"2308.12351","submitter":"Vinicius Mikuni","authors":"Sascha Diefenbacher, Guan-Horng Liu, Vinicius Mikuni, Benjamin\n  Nachman, and Weili Nie","title":"Improving Generative Model-based Unfolding with Schr\\\"{o}dinger Bridges","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph cs.LG hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning-based unfolding has enabled unbinned and high-dimensional\ndifferential cross section measurements. Two main approaches have emerged in\nthis research area: one based on discriminative models and one based on\ngenerative models. The main advantage of discriminative models is that they\nlearn a small correction to a starting simulation while generative models scale\nbetter to regions of phase space with little data. We propose to use\nSchroedinger Bridges and diffusion models to create SBUnfold, an unfolding\napproach that combines the strengths of both discriminative and generative\nmodels. The key feature of SBUnfold is that its generative model maps one set\nof events into another without having to go through a known probability density\nas is the case for normalizing flows and standard diffusion models. We show\nthat SBUnfold achieves excellent performance compared to state of the art\nmethods on a synthetic Z+jets dataset.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:01:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Diefenbacher","Sascha",""],["Liu","Guan-Horng",""],["Mikuni","Vinicius",""],["Nachman","Benjamin",""],["Nie","Weili",""]]}
{"id":"2308.12352","submitter":"Nicholas Rubin","authors":"Nicholas C. Rubin, Dominic W. Berry, Alina Kononov, Fionn D. Malone,\n  Tanuj Khattar, Alec White, Joonho Lee, Hartmut Neven, Ryan Babbush, Andrew D.\n  Baczewski","title":"Quantum computation of stopping power for inertial fusion target design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stopping power is the rate at which a material absorbs the kinetic energy of\na charged particle passing through it -- one of many properties needed over a\nwide range of thermodynamic conditions in modeling inertial fusion implosions.\nFirst-principles stopping calculations are classically challenging because they\ninvolve the dynamics of large electronic systems far from equilibrium, with\naccuracies that are particularly difficult to constrain and assess in the\nwarm-dense conditions preceding ignition. Here, we describe a protocol for\nusing a fault-tolerant quantum computer to calculate stopping power from a\nfirst-quantized representation of the electrons and projectile. Our approach\nbuilds upon the electronic structure block encodings of Su et al. [PRX Quantum\n2, 040332 2021], adapting and optimizing those algorithms to estimate\nobservables of interest from the non-Born-Oppenheimer dynamics of multiple\nparticle species at finite temperature. Ultimately, we report logical qubit\nrequirements and leading-order Toffoli costs for computing the stopping power\nof various projectile/target combinations relevant to interpreting and\ndesigning inertial fusion experiments. We estimate that scientifically\ninteresting and classically intractable stopping power calculations can be\nquantum simulated with roughly the same number of logical qubits and about one\nhundred times more Toffoli gates than is required for state-of-the-art quantum\nsimulations of industrially relevant molecules such as FeMoCo or P450.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:01:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rubin","Nicholas C.",""],["Berry","Dominic W.",""],["Kononov","Alina",""],["Malone","Fionn D.",""],["Khattar","Tanuj",""],["White","Alec",""],["Lee","Joonho",""],["Neven","Hartmut",""],["Babbush","Ryan",""],["Baczewski","Andrew D.",""]]}
{"id":"2308.12353","submitter":"Benjam\\'in A. Itz\\'a-Ortiz","authors":"Benjam\\'in A. Itz\\'a-Ortiz, Rub\\'en A. Mart\\'inez-Avenda\\~no and\n  Hiroshi Nakazato","title":"The numerical range of periodic banded Toeplitz operators","comments":"17 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the closure of the numerical range of a $(n+1)$-periodic and\n$(2m+1)$-banded Toeplitz operator can be expressed as the closure of the convex\nhull of the uncountable union of numerical ranges of certain symbol matrices.\nIn contrast to the periodic $3$-banded (or tridiagonal) case, we show an\nexample of a $2$-periodic and $5$-banded Toeplitz operator such that the\nclosure of its numerical range is not equal to the numerical range of a single\nfinite matrix.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:01:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Itz\u00e1-Ortiz","Benjam\u00edn A.",""],["Mart\u00ednez-Avenda\u00f1o","Rub\u00e9n A.",""],["Nakazato","Hiroshi",""]]}
{"id":"2308.12354","submitter":"Nikolai Schapin","authors":"Nikolai Schapin, Maciej Majewski, Alejandro Varela, Carlos Arroniz,\n  Gianni De Fabritiis","title":"Machine Learning Small Molecule Properties in Drug Discovery","comments":"46 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.LG q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning (ML) is a promising approach for predicting small molecule\nproperties in drug discovery. Here, we provide a comprehensive overview of\nvarious ML methods introduced for this purpose in recent years. We review a\nwide range of properties, including binding affinities, solubility, and ADMET\n(Absorption, Distribution, Metabolism, Excretion, and Toxicity). We discuss\nexisting popular datasets and molecular descriptors and embeddings, such as\nchemical fingerprints and graph-based neural networks. We highlight also\nchallenges of predicting and optimizing multiple properties during hit-to-lead\nand lead optimization stages of drug discovery and explore briefly possible\nmulti-objective optimization techniques that can be used to balance diverse\nproperties while optimizing lead candidates. Finally, techniques to provide an\nunderstanding of model predictions, especially for critical decision-making in\ndrug discovery are assessed. Overall, this review provides insights into the\nlandscape of ML models for small molecule property predictions in drug\ndiscovery. So far, there are multiple diverse approaches, but their\nperformances are often comparable. Neural networks, while more flexible, do not\nalways outperform simpler models. This shows that the availability of\nhigh-quality training data remains crucial for training accurate models and\nthere is a need for standardized benchmarks, additional performance metrics,\nand best practices to enable richer comparisons between the different\ntechniques and models that can shed a better light on the differences between\nthe many techniques.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 22:18:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Schapin","Nikolai",""],["Majewski","Maciej",""],["Varela","Alejandro",""],["Arroniz","Carlos",""],["De Fabritiis","Gianni",""]]}
{"id":"2308.12355","submitter":"Jordan Cotler","authors":"Jordan Cotler, Semon Rezchikov","title":"Renormalizing Diffusion Models","comments":"68+15 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cs.LG hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explain how to use diffusion models to learn inverse renormalization group\nflows of statistical and quantum field theories. Diffusion models are a class\nof machine learning models which have been used to generate samples from\ncomplex distributions, such as the distribution of natural images, by learning\nthe inverse process to a diffusion process which adds noise to the data until\nthe distribution of the data is pure noise. Nonperturbative renormalization\ngroup schemes can naturally be written as diffusion processes in the space of\nfields. We combine these observations in a concrete framework for building\nML-based models for studying field theories, in which the models learn the\ninverse process to an explicitly-specified renormalization group scheme. We\ndetail how these models define a class of adaptive bridge (or parallel\ntempering) samplers for lattice field theory. Because renormalization group\nschemes have a physical meaning, we provide explicit prescriptions for how to\ncompare results derived from models associated to several different\nrenormalization group schemes of interest. We also explain how to use diffusion\nmodels in a variational method to find ground states of quantum systems. We\napply some of our methods to numerically find RG flows of interacting\nstatistical field theories. From the perspective of machine learning, our work\nprovides an interpretation of multiscale diffusion models, and gives\nphysically-inspired suggestions for diffusion models which should have novel\nproperties.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:02:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cotler","Jordan",""],["Rezchikov","Semon",""]]}
{"id":"2308.12356","submitter":"Samuel F. Romera","authors":"Miguel G. Echevarria, Samuel F. Romera and Ignazio Scimemi","title":"Gluon TMD fragmentation function into quarkonium","comments":"v2: typos corrected; v1: 29 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the gluon transverse-momentum-dependent fragmentation function\n(TMDFF) at next-to-leading order (NLO) into heavy quarkonium in the color-octet\n$^3S_1^{[8]}$ channel, based on the NRQCD factorization approach. The spurious\nrapidity divergences are explicitly shown to cancel in a well-defined TMDFF,\nwhich incorporates the needed soft factor. We also compute the integrated gluon\nFF at NLO in the same $^3S_1^{[8]}$ channel, and show that the matching\ncoefficient of the TMDFF onto the FF at large transverse momentum is the\nexpected one. These results are relevant to perform precise and sensible\nphenomenological studies of transverse-momentum spectra of quarkonium\nproduction, for which the production mechanism through fragmentation plays a\nrelevant role, like in the future Electron-Ion Collider.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:03:01 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:54:49 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Echevarria","Miguel G.",""],["Romera","Samuel F.",""],["Scimemi","Ignazio",""]]}
{"id":"2308.12357","submitter":"Nayyer Raza","authors":"Nayyer Raza, Man Leong Chan, Daryl Haggard, Ashish Mahabal, Jess\n  McIver, Thomas C. Abbott, Eitan Buffaz, Nicholas Vieira","title":"Explaining the GWSkyNet-Multi machine learning classifier predictions\n  for gravitational-wave events","comments":"22 pages, 11 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  GWSkyNet-Multi is a machine learning model developed for classification of\ncandidate gravitational-wave events detected by the LIGO and Virgo\nobservatories. The model uses limited information released in the low-latency\nOpen Public Alerts to produce prediction scores indicating whether an event is\na merger of two black holes, a merger involving a neutron star, or a\nnon-astrophysical glitch. This facilitates time sensitive decisions about\nwhether to perform electromagnetic follow-up of candidate events during\nLIGO-Virgo-KAGRA (LVK) observing runs. However, it is not well understood how\nthe model is leveraging the limited information available to make its\npredictions. As a deep learning neural network, the inner workings of the model\ncan be difficult to interpret, impacting our trust in its validity and\nrobustness. We tackle this issue by systematically perturbing the model and its\ninputs to explain what underlying features and correlations it has learned for\ndistinguishing the sources. We show that the localization area of the 2D sky\nmaps and the computed coherence versus incoherence Bayes factors are used as\nstrong predictors for distinguishing between real events and glitches. The\nestimated distance to the source is further used to discriminate between binary\nblack hole mergers and mergers involving neutron stars. We leverage these\nfindings to show that events misclassified by GWSkyNet-Multi in LVK's third\nobserving run have distinct sky area, coherence factor, and distance values\nthat influence the predictions and explain these misclassifications. The\nresults help identify the model's limitations and inform potential avenues for\nfurther optimization.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:03:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Raza","Nayyer",""],["Chan","Man Leong",""],["Haggard","Daryl",""],["Mahabal","Ashish",""],["McIver","Jess",""],["Abbott","Thomas C.",""],["Buffaz","Eitan",""],["Vieira","Nicholas",""]]}
{"id":"2308.12358","submitter":"Jan Naumann","authors":"Jan Naumann, Erik Lennart Weerda, Matteo Rizzi, Jens Eisert and\n  Philipp Schmoll","title":"variPEPS -- a versatile tensor network library for variational ground\n  state simulations in two spatial dimensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el physics.comp-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tensor networks capture large classes of ground states of phases of quantum\nmatter faithfully and efficiently. Their manipulation and contraction has\nremained a challenge over the years, however. For most of the history, ground\nstate simulations of two-dimensional quantum lattice systems using (infinite)\nprojected entangled pair states have relied on what is called a time-evolving\nblock decimation. In recent years, multiple proposals for the variational\noptimization of the quantum state have been put forward, overcoming accuracy\nand convergence problems of previously known methods. The incorporation of\nautomatic differentiation in tensor networks algorithms has ultimately enabled\na new, flexible way for variational simulation of ground states and excited\nstates. In this work, we review the state of the art of the variational iPEPS\nframework. We present and explain the functioning of an efficient,\ncomprehensive and general tensor network library for the simulation of infinite\ntwo-dimensional systems using iPEPS, with support for flexible unit cells and\ndifferent lattice geometries.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:03:14 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Naumann","Jan",""],["Weerda","Erik Lennart",""],["Rizzi","Matteo",""],["Eisert","Jens",""],["Schmoll","Philipp",""]]}
{"id":"2308.12359","submitter":"James Alcala","authors":"James K. Alcala and Yat Tin Chow and Mahesh Sunkula","title":"Moving Anchor Extragradient Methods For Smooth Structured Minimax\n  Problems","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This work introduces a moving anchor acceleration technique to extragradient\nalgorithms for smooth structured minimax problems. The moving anchor is\nintroduced as a generalization of the original algorithmic anchoring framework,\ni.e. the EAG method introduced in [32], in hope of further acceleration. We\nshow that the optimal order of convergence in terms of worst-case complexity on\nthe squared gradient, O(1/k2), is achieved by our new method (where k is the\nnumber of iterations). We have also extended our algorithm to a more general\nnonconvex-nonconcave class of saddle point problems using the framework of\n[14], which slightly generalizes [32]. We obtain similar order-optimal\ncomplexity results in this extended case. In both problem settings, numerical\nresults illustrate the efficacy of our moving anchor algorithm variants, in\nparticular by attaining the theoretical optimal convergence rate for first\norder methods, as well as suggesting a better optimized constant in the big O\nnotation which surpasses the traditional fixed anchor methods in many cases. A\nproximal-point preconditioned version of our algorithms is also introduced and\nanalyzed to match optimal theoretical convergence rates.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:04:18 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 23:06:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alcala","James K.",""],["Chow","Yat Tin",""],["Sunkula","Mahesh",""]]}
{"id":"2308.12360","submitter":"Aldo Ledesma-Dur\\'an PhD.","authors":"Aldo Ledesma-Dur\\'an","title":"Turing patterns on a two-component isotropic growing system. Part 2:\n  Conditions based on a potential function for exponential growth/shrinkage","comments":"14 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose conditions for the emergence of Turing patterns in a domain that\nchanges in size by homogeneous growth/shrinkage. These conditions to determine\nthe bifurcation are based on considering the geometric change of a potential\nfunction whose evolution determines the stability of the trajectories of all\nthe Fourier modes of the perturbation. For this part of the work we consider\nthe situation where the homogeneous state of the system are constant\nconcentrations close to its stationary value, as occurs for exponential\ngrowth/decrease. This proposal recovers the traditional Turing conditions for\ntwo-component systems in a fixed domain and is corroborated against numerical\nsimulations of increasing/decreasing domains of the Brusselator reaction\nsystem. The simulations carried out allowed us to understand some\ncharacteristics of the pattern related to the evolution of its amplitude and\nwavenumber and allow us to anticipate which features strictly depend on its\ntemporal evolution.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:05:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ledesma-Dur\u00e1n","Aldo",""]]}
{"id":"2308.12361","submitter":"Dmitry Agafontsev","authors":"D.S. Agafontsev, A.A. Gelash, S. Randoux and P. Suret","title":"Multi-soliton interactions underlying the dynamics of breather rogue\n  waves","comments":"16 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the most famous one-breather solutions of the focusing\none-dimensional nonlinear Schrodinger equation which are used in the theory of\nrogue waves -- the Peregrine, Akhmediev and Kuznetsov-Ma breathers, as well as\nthe general case of drifting Tajiri-Watanabe breather. In terms of the inverse\nscattering transform (IST) theory, it is known that these breathers are\nconstructed by \"dressing\" a plane wave solution with a single soliton. In this\nconstruction, we replace the plane wave with an exact $N$-soliton solution\nwhich converges asymptotically to the plane wave at large number of solitons\n$N$. As a result, we obtain exact $(N+1)$-soliton solutions practically\nindistinguishable from the Peregrine, Akhmediev, Kuznetsov-Ma and\nTajiri-Watanabe breathers in a relatively wide region of space and time. The\nconstructed solutions are localized in space with characteristic width\nproportional to $N$ and approximate the breathers with accuracy improving as\n$N$ grows. Our method makes it possible to build solitonic models with the same\ndynamical properties for the higher-order rational and super-regular breathers,\nand can be generalized straightforwardly to multi-breather solutions, breathers\non a nontrivial background (e.g., cnoidal waves) and other integrable systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:06:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Agafontsev","D. S.",""],["Gelash","A. A.",""],["Randoux","S.",""],["Suret","P.",""]]}
{"id":"2308.12362","submitter":"John A. Tomsick","authors":"John A. Tomsick, Steven E. Boggs, Andreas Zoglauer, Dieter Hartmann,\n  Marco Ajello, Eric Burns, Chris Fryer, Chris Karwin, Carolyn Kierans,\n  Alexander Lowell, Julien Malzac, Jarred Roberts, Pascal Saint-Hilaire, Albert\n  Shih, Thomas Siegert, Clio Sleator, Tadayuki Takahashi, Fabrizio Tavecchio,\n  Eric Wulf, Jacqueline Beechert, Hannah Gulick, Alyson Joens, Hadar Lazar,\n  Eliza Neights, Juan Carlos Martinez Oliveros, Shigeki Matsumoto, Tom Melia,\n  Hiroki Yoneda, Mark Amman, Dhruv Bal, Peter von Ballmoos, Hugh Bates, Markus\n  B\\\"ottcher, Andrea Bulgarelli, Elisabetta Cavazzuti, Hsiang-Kuang Chang,\n  Claire Chen, Che-Yen Chu, Alex Ciabattoni, Luigi Costamante, Lente Dreyer,\n  Valentina Fioretti, Francesco Fenu, Savitri Gallego, Giancarlo Ghirlanda,\n  Eric Grove, Chien-You Huang, Pierre Jean, Nikita Khatiya, J\\\"urgen\n  Kn\\\"odlseder, Martin Krause, Mark Leising, Tiffany R. Lewis, Jan Peter\n  Lommler, Lea Marcotulli, Israel Martinez-Castellanos, Saurabh Mittal, Michela\n  Negro, Samer Al Nussirat, Kazuhiro Nakazawa, Uwe Oberlack, David Palmore,\n  Gabriele Panebianco, Nicolo Parmiggiani, Tyler Parsotan, Sean N. Pike, Field\n  Rogers, Hester Schutte, Yong Sheng, Alan P. Smale, Jacob Smith, Aaron Trigg,\n  Tonia Venters, Yu Watanabe, Haocheng Zhang","title":"The Compton Spectrometer and Imager","comments":"8 pages","journal-ref":"PoS(ICRC2023)745","doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Compton Spectrometer and Imager (COSI) is a NASA Small Explorer (SMEX)\nsatellite mission in development with a planned launch in 2027. COSI is a\nwide-field gamma-ray telescope designed to survey the entire sky at 0.2-5 MeV.\nIt provides imaging, spectroscopy, and polarimetry of astrophysical sources,\nand its germanium detectors provide excellent energy resolution for emission\nline measurements. Science goals for COSI include studies of 0.511 MeV emission\nfrom antimatter annihilation in the Galaxy, mapping radioactive elements from\nnucleosynthesis, determining emission mechanisms and source geometries with\npolarization measurements, and detecting and localizing multimessenger sources.\nThe instantaneous field of view for the germanium detectors is >25% of the sky,\nand they are surrounded on the sides and bottom by active shields, providing\nbackground rejection as well as allowing for detection of gamma-ray bursts and\nother gamma-ray flares over most of the sky. In the following, we provide an\noverview of the COSI mission, including the science, the technical design, and\nthe project status.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:06:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tomsick","John A.",""],["Boggs","Steven E.",""],["Zoglauer","Andreas",""],["Hartmann","Dieter",""],["Ajello","Marco",""],["Burns","Eric",""],["Fryer","Chris",""],["Karwin","Chris",""],["Kierans","Carolyn",""],["Lowell","Alexander",""],["Malzac","Julien",""],["Roberts","Jarred",""],["Saint-Hilaire","Pascal",""],["Shih","Albert",""],["Siegert","Thomas",""],["Sleator","Clio",""],["Takahashi","Tadayuki",""],["Tavecchio","Fabrizio",""],["Wulf","Eric",""],["Beechert","Jacqueline",""],["Gulick","Hannah",""],["Joens","Alyson",""],["Lazar","Hadar",""],["Neights","Eliza",""],["Oliveros","Juan Carlos Martinez",""],["Matsumoto","Shigeki",""],["Melia","Tom",""],["Yoneda","Hiroki",""],["Amman","Mark",""],["Bal","Dhruv",""],["von Ballmoos","Peter",""],["Bates","Hugh",""],["B\u00f6ttcher","Markus",""],["Bulgarelli","Andrea",""],["Cavazzuti","Elisabetta",""],["Chang","Hsiang-Kuang",""],["Chen","Claire",""],["Chu","Che-Yen",""],["Ciabattoni","Alex",""],["Costamante","Luigi",""],["Dreyer","Lente",""],["Fioretti","Valentina",""],["Fenu","Francesco",""],["Gallego","Savitri",""],["Ghirlanda","Giancarlo",""],["Grove","Eric",""],["Huang","Chien-You",""],["Jean","Pierre",""],["Khatiya","Nikita",""],["Kn\u00f6dlseder","J\u00fcrgen",""],["Krause","Martin",""],["Leising","Mark",""],["Lewis","Tiffany R.",""],["Lommler","Jan Peter",""],["Marcotulli","Lea",""],["Martinez-Castellanos","Israel",""],["Mittal","Saurabh",""],["Negro","Michela",""],["Nussirat","Samer Al",""],["Nakazawa","Kazuhiro",""],["Oberlack","Uwe",""],["Palmore","David",""],["Panebianco","Gabriele",""],["Parmiggiani","Nicolo",""],["Parsotan","Tyler",""],["Pike","Sean N.",""],["Rogers","Field",""],["Schutte","Hester",""],["Sheng","Yong",""],["Smale","Alan P.",""],["Smith","Jacob",""],["Trigg","Aaron",""],["Venters","Tonia",""],["Watanabe","Yu",""],["Zhang","Haocheng",""]]}
{"id":"2308.12363","submitter":"Eric Andersson","authors":"Eric P. Andersson, Mordecai-Mark Mac Low, Oscar Agertz, Florent Renaud\n  and Hui Li","title":"Pre-supernova feedback sets the star cluster mass function to a power\n  law and reduces the cluster formation efficiency","comments":"Submitted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The star cluster initial mass function is observed to have an inverse power\nlaw exponent around 2, yet there is no consensus on what determines this\ndistribution, and why some variation is observed in different galaxies.\nFurthermore, the cluster formation efficiency covers a range of values,\nparticularly when considering different environments. These clusters are often\nused to empirically constrain star formation and as fundamental units for\nstellar feedback models. Detailed galaxy models must therefore accurately\ncapture the basic properties of observed clusters to be considered predictive.\nWe use hydrodynamical simulations of a dwarf galaxy as a laboratory to study\nstar cluster formation. We test different combinations of stellar feedback\nmechanisms, including stellar winds, ionizing radiation, and supernovae. Each\nfeedback mechanism affects the cluster formation efficiency and cluster mass\nfunction. Increasing the feedback budget by combining the different types of\nfeedback decreases the cluster formation efficiency by reducing the number of\nmassive clusters. Ionizing radiation is found to be especially influential.\nThis effect depends on the timing of feedback initiation, as shown by comparing\nearly and late feedback. Early feedback occurs from ionizing radiation and\nstellar winds with onset immediately after a massive star is formed. Late\nfeedback occurs when energy injection only starts after the main-sequence\nlifetime of the most massive SN progenitor, a timing that is further influenced\nby the choice of the most massive SN progenitor. Late feedback alone results in\na broad, flat mass function, approaching a log-normal shape in the complete\nabsence of feedback. Early feedback, on the other hand, produces a power-law\ncluster mass function with lower formation efficiency, albeit with a steeper\nslope than that usually observed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:07:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Andersson","Eric P.",""],["Mac Low","Mordecai-Mark",""],["Agertz","Oscar",""],["Renaud","Florent",""],["Li","Hui",""]]}
{"id":"2308.12364","submitter":"Usman Muhammad Mr","authors":"Usman Muhammad, Mourad Oussalah, Md Ziaul Hoque and Jorma Laaksonen","title":"Saliency-based Video Summarization for Face Anti-spoofing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the growing availability of face anti-spoofing databases, researchers\nare increasingly focusing on video-based methods that use hundreds to thousands\nof images to assess their impact on performance. However, there is no clear\nconsensus on the exact number of frames in a video required to improve the\nperformance of face anti-spoofing tasks. Inspired by the visual saliency\ntheory, we present a video summarization method for face anti-spoofing tasks\nthat aims to enhance the performance and efficiency of deep learning models by\nleveraging visual saliency. In particular, saliency information is extracted\nfrom the differences between the Laplacian and Wiener filter outputs of the\nsource images, enabling identification of the most visually salient regions\nwithin each frame. Subsequently, the source images are decomposed into base and\ndetail layers, enhancing representation of important information. The weighting\nmaps are then computed based on the saliency information, indicating the\nimportance of each pixel in the image. By linearly combining the base and\ndetail layers using the weighting maps, the method fuses the source images to\ncreate a single representative image that summarizes the entire video. The key\ncontribution of our proposed method lies in demonstrating how visual saliency\ncan be used as a data-centric approach to improve the performance and\nefficiency of face presentation attack detection models. By focusing on the\nmost salient images or regions within the images, a more representative and\ndiverse training set can be created, potentially leading to more effective\nmodels. To validate the method's effectiveness, a simple deep learning\narchitecture (CNN-RNN) was used, and the experimental results showcased\nstate-of-the-art performance on five challenging face anti-spoofing datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:08:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Muhammad","Usman",""],["Oussalah","Mourad",""],["Hoque","Md Ziaul",""],["Laaksonen","Jorma",""]]}
{"id":"2308.12365","submitter":"Martin Werner Licht","authors":"Martin Werner Licht","title":"Constructing collars in paracompact Hausdorff spaces and Lipschitz\n  estimates","comments":"Feedback welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a constructive proof for the following new collar theorem: every\nlocally collared closed set that is paracompact in a Hausdorff space is\ncollared. This includes the important special case of locally collared closed\nsets in paracompact Hausdorff spaces. Importantly, we use Stone's result that\nevery open cover of a paracompact space has an open locally finite refinement\nwhich is the countable union of discrete families. Furthermore, in the LIP\ncategory, our construction yields collars that are locally bi-Lipschitz\nembeddings. If the initial data satisfy uniform estimates, then this collar is\neven bi-Lipschitz onto its image and we explicitly bound the constants. We also\nprovide partitions of unity whose Lipschitz constants are bounded by the\nLebesgue constant and the order of the cover.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:10:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Licht","Martin Werner",""]]}
{"id":"2308.12366","submitter":"Wenxuan Zhang","authors":"Wenxuan Zhang, Paul Janson, Kai Yi, Ivan Skorokhodov, Mohamed\n  Elhoseiny","title":"Continual Zero-Shot Learning through Semantically Guided Generative\n  Random Walks","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning novel concepts, remembering previous knowledge, and adapting it to\nfuture tasks occur simultaneously throughout a human's lifetime. To model such\ncomprehensive abilities, continual zero-shot learning (CZSL) has recently been\nintroduced. However, most existing methods overused unseen semantic information\nthat may not be continually accessible in realistic settings. In this paper, we\naddress the challenge of continual zero-shot learning where unseen information\nis not provided during training, by leveraging generative modeling. The heart\nof the generative-based methods is to learn quality representations from seen\nclasses to improve the generative understanding of the unseen visual space.\nMotivated by this, we introduce generalization-bound tools and provide the\nfirst theoretical explanation for the benefits of generative modeling to CZSL\ntasks. Guided by the theoretical analysis, we then propose our learning\nalgorithm that employs a novel semantically guided Generative Random Walk (GRW)\nloss. The GRW loss augments the training by continually encouraging the model\nto generate realistic and characterized samples to represent the unseen space.\nOur algorithm achieves state-of-the-art performance on AWA1, AWA2, CUB, and SUN\ndatasets, surpassing existing CZSL methods by 3-7\\%. The code has been made\navailable here \\url{https://github.com/wx-zhang/IGCZSL}\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:10:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Wenxuan",""],["Janson","Paul",""],["Yi","Kai",""],["Skorokhodov","Ivan",""],["Elhoseiny","Mohamed",""]]}
{"id":"2308.12367","submitter":"Sriram Gopalakrishnan","authors":"Haochen Wu, Shubham Sharma, Sunandita Patra, Sriram Gopalakrishnan","title":"SafeAR: Towards Safer Algorithmic Recourse by Risk-Aware Policies","comments":"Supplemental material appended to main paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the growing use of machine learning (ML) models in critical domains such\nas finance and healthcare, the need to offer recourse for those adversely\naffected by the decisions of ML models has become more important; individuals\nought to be provided with recommendations on actions to take for improving\ntheir situation and thus receive a favorable decision. Prior work on sequential\nalgorithmic recourse -- which recommends a series of changes -- focuses on\naction feasibility and uses the proximity of feature changes to determine\naction costs. However, the uncertainties of feature changes and the risk of\nhigher than average costs in recourse have not been considered. It is\nundesirable if a recourse could (with some probability) result in a worse\nsituation from which recovery requires an extremely high cost. It is essential\nto incorporate risks when computing and evaluating recourse. We call the\nrecourse computed with such risk considerations as Safer Algorithmic Recourse\n(SafeAR). The objective is to empower people to choose a recourse based on\ntheir risk tolerance. In this work, we discuss and show how existing recourse\ndesiderata can fail to capture the risk of higher costs. We present a method to\ncompute recourse policies that consider variability in cost and connect\nalgorithmic recourse literature with risk-sensitive reinforcement learning. We\nalso adopt measures ``Value at Risk'' and ``Conditional Value at Risk'' from\nthe financial literature to summarize risk concisely. We apply our method to\ntwo real-world datasets and compare policies with different levels of\nrisk-aversion using risk measures and recourse desiderata (sparsity and\nproximity).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:12:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wu","Haochen",""],["Sharma","Shubham",""],["Patra","Sunandita",""],["Gopalakrishnan","Sriram",""]]}
{"id":"2308.12368","submitter":"Petr Jizba","authors":"Petr Jizba, Gaetano Lambiase, Giuseppe Gaetano Luciano and Luciano\n  Petruzziello","title":"Coherent states for generalized uncertainty relations as Tsallis\n  probability amplitudes: new route to non-extensive thermostatistics","comments":"25 pages, 4 figures, accepted to Physical Review D","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study coherent states associated to a generalized uncertainty principle\n(GUP). We separately analyze the cases of positive and negative deformation\nparameter $\\beta$, showing that the ensuing probability distribution is a\nTsallis distribution whose non-extensivity parameter $q$ is monotonically\nrelated to $\\beta$. Moreover, for $\\beta <0$ (corresponding to $q<1$), we\nreformulate the GUP in terms of a one-parameter class of Tsallis entropy-power\nbased uncertainty relations, which are again saturated by the GUP coherent\nstates. We argue that this combination of coherent states with Tsallis entropy\noffers a natural conceptual framework allowing to study quasi-classical regime\nof GUP in terms of non-extensive thermodynamics. We substantiate our claim by\ndiscussing generalization of Verlinde's entropic force and ensuing implications\nin the late-inflation epoch. Corresponding dependence of the $\\beta$ parameter\non cosmological time is derived for the reheating epoch. The obtained $\\beta$\nis consistent with values predicted by both string-theory models and the\nnaturalness principle. Further salient issues, including derivation of new\n$\\beta$-dependent expressions for the lowest possible value of the spin and\nImmirzi parameter in Loop Quantum Gravity, and connection of our proposal with\nthe Magueijo--Smolin doubly special relativity are also discussed. This article\nprovides a more extended and comprehensive treatment of our recent letter\n[Phys. Rev. D 105, L121501 (2022)].\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:16:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jizba","Petr",""],["Lambiase","Gaetano",""],["Luciano","Giuseppe Gaetano",""],["Petruzziello","Luciano",""]]}
{"id":"2308.12369","submitter":"Irakli Patchkoria","authors":"Christopher Davis, Julius Frank, Irakli Patchkoria","title":"On the cyclic homology of certain universal differential graded algebras","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.KT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p$ be an odd prime and $R$ a $p$-torsion-free commutative\n$\\mathbb{Z}_{(p)}$-algebra. We compute the periodic cyclic homology over $R$ of\nthe universal differential graded algebra $R//p$ which is obtained from $R$ by\nuniversally killing $p$. We furthermore compute the cyclic and negative cyclic\nhomologies of $R//p$ over $R$ in infinitely many degrees.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:16:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Davis","Christopher",""],["Frank","Julius",""],["Patchkoria","Irakli",""]]}
{"id":"2308.12370","submitter":"Subhrajyoti Dasgupta","authors":"Sanjoy Chowdhury, Sreyan Ghosh, Subhrajyoti Dasgupta, Anton\n  Ratnarajah, Utkarsh Tyagi and Dinesh Manocha","title":"AdVerb: Visually Guided Audio Dereverberation","comments":"Accepted at ICCV 2023. For project page, see\n  https://gamma.umd.edu/researchdirections/speech/adverb","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present AdVerb, a novel audio-visual dereverberation framework that uses\nvisual cues in addition to the reverberant sound to estimate clean audio.\nAlthough audio-only dereverberation is a well-studied problem, our approach\nincorporates the complementary visual modality to perform audio\ndereverberation. Given an image of the environment where the reverberated sound\nsignal has been recorded, AdVerb employs a novel geometry-aware cross-modal\ntransformer architecture that captures scene geometry and audio-visual\ncross-modal relationship to generate a complex ideal ratio mask, which, when\napplied to the reverberant audio predicts the clean sound. The effectiveness of\nour method is demonstrated through extensive quantitative and qualitative\nevaluations. Our approach significantly outperforms traditional audio-only and\naudio-visual baselines on three downstream tasks: speech enhancement, speech\nrecognition, and speaker verification, with relative improvements in the range\nof 18% - 82% on the LibriSpeech test-clean set. We also achieve highly\nsatisfactory RT60 error scores on the AVSpeech dataset.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:20:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chowdhury","Sanjoy",""],["Ghosh","Sreyan",""],["Dasgupta","Subhrajyoti",""],["Ratnarajah","Anton",""],["Tyagi","Utkarsh",""],["Manocha","Dinesh",""]]}
{"id":"2308.12371","submitter":"Rafael Henrique Vareto Mr.","authors":"Rafael Henrique Vareto and Manuel G\\\"unther and William Robson\n  Schwartz","title":"Open-set Face Recognition with Neural Ensemble, Maximal Entropy Loss and\n  Feature Augmentation","comments":null,"journal-ref":"36th Conference on Graphics, Patterns and Images (SIBGRAPI 2023)","doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Open-set face recognition refers to a scenario in which biometric systems\nhave incomplete knowledge of all existing subjects. Therefore, they are\nexpected to prevent face samples of unregistered subjects from being identified\nas previously enrolled identities. This watchlist context adds an arduous\nrequirement that calls for the dismissal of irrelevant faces by focusing mainly\non subjects of interest. As a response, this work introduces a novel method\nthat associates an ensemble of compact neural networks with a margin-based cost\nfunction that explores additional samples. Supplementary negative samples can\nbe obtained from external databases or synthetically built at the\nrepresentation level in training time with a new mix-up feature augmentation\napproach. Deep neural networks pre-trained on large face datasets serve as the\npreliminary feature extraction module. We carry out experiments on well-known\nLFW and IJB-C datasets where results show that the approach is able to boost\nclosed and open-set identification rates.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:22:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Vareto","Rafael Henrique",""],["G\u00fcnther","Manuel",""],["Schwartz","William Robson",""]]}
{"id":"2308.12372","submitter":"Deblina Bhattacharjee","authors":"Deblina Bhattacharjee, Sabine S\\\"usstrunk, Mathieu Salzmann","title":"Vision Transformer Adapters for Generalizable Multitask Learning","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce the first multitasking vision transformer adapters that learn\ngeneralizable task affinities which can be applied to novel tasks and domains.\nIntegrated into an off-the-shelf vision transformer backbone, our adapters can\nsimultaneously solve multiple dense vision tasks in a parameter-efficient\nmanner, unlike existing multitasking transformers that are parametrically\nexpensive. In contrast to concurrent methods, we do not require retraining or\nfine-tuning whenever a new task or domain is added. We introduce a task-adapted\nattention mechanism within our adapter framework that combines gradient-based\ntask similarities with attention-based ones. The learned task affinities\ngeneralize to the following settings: zero-shot task transfer, unsupervised\ndomain adaptation, and generalization without fine-tuning to novel domains. We\ndemonstrate that our approach outperforms not only the existing convolutional\nneural network-based multitasking methods but also the vision transformer-based\nones. Our project page is at \\url{https://ivrl.github.io/VTAGML}.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:40:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhattacharjee","Deblina",""],["S\u00fcsstrunk","Sabine",""],["Salzmann","Mathieu",""]]}
{"id":"2308.12373","submitter":"Jake Fillman","authors":"Andrew Arroyo, Faye Castro, Jake Fillman","title":"On the Number of Closed Gaps of Discrete Periodic One-Dimensional\n  Operators","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  From the general inverse theory of periodic Jacobi matrices, it is known that\na periodic Jacobi matrix of minimal period $p \\geq 2$ may have at most $p-2$\nclosed spectral gaps. We discuss the maximal number of closed gaps for\none-dimensional periodic discrete Schr\\\"odinger operators of period $p$. We\nprove nontrivial upper and lower bounds on this quantity for large $p$ and\ncompute it exactly for $p \\leq 6$. Among our results, we show that a discrete\nSchr\\\"odinger operator of period four or five may have at most a single closed\ngap, and we characterize exactly which potentials may exhibit a closed gap. For\nperiod six, we show that at most two gaps may close. In all cases in which the\nmaximal number of closed gaps is computed, it is seen to be strictly smaller\nthan $p-2$, the bound guaranteed by the inverse theory. We also discuss similar\nresults for purely off-diagonal Jacobi matrices.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:42:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Arroyo","Andrew",""],["Castro","Faye",""],["Fillman","Jake",""]]}
{"id":"2308.12374","submitter":"Hassan ZivariFard","authors":"Hassan ZivariFard and Remi A. Chou","title":"Private Information Retrieval with Private Noisy Side Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider Private Information Retrieval (PIR), where a client wants to\nretrieve one file out of $K$ files that are replicated in $N$ different servers\nand the client selection must remain private when up to $T$ servers may\ncollude. Additionally, suppose that the client has noisy side information about\neach of the $K$ files, and the side information about a specific file is\nobtained by passing this file through one of $D$ possible discrete memoryless\ntest channels, where $D\\le K$. While the statistics of the test channels are\nknown by the client and by all the servers, the specific mapping\n$\\boldsymbol{\\mathcal{M}}$ between the files and the test channels is unknown\nto the servers. We study this problem under two different privacy metrics.\nUnder the first privacy metric, the client wants to preserve the privacy of its\ndesired file selection and the mapping $\\boldsymbol{\\mathcal{M}}$. Under the\nsecond privacy metric, the client wants to preserve the privacy of its desired\nfile and the mapping $\\boldsymbol{\\mathcal{M}}$, but is willing to reveal the\nindex of the test channel that is associated to its desired file. For both of\nthese two privacy metrics, we derive the optimal normalized download cost. Our\nproblem setup generalizes PIR with colluding servers, PIR with private\nnoiseless side information, and PIR with private side information under storage\nconstraints.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:42:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["ZivariFard","Hassan",""],["Chou","Remi A.",""]]}
{"id":"2308.12375","submitter":"Yue-Kin Tsang","authors":"Yue-Kin Tsang and Chris A. Jones","title":"Scaling of the geomagnetic secular variation time scales","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.flu-dyn physics.geo-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The ratio of the Lowes spectrum and the secular variation spectrum measured\nat the Earth's surface provides a time scale $\\tau_{\\rm sv}(l)$ as a function\nof spherical harmonic degree $l$. $\\tau_{\\rm sv}$ is often assumed to be\nrepresentative of time scales related to the dynamo inside the outer core and\nits scaling with $l$ is debated. To assess the validity of this surmise and to\nstudy the time variation of the geomagnetic field $\\boldsymbol{\\dot B}$ inside\nthe outer core, we introduce a magnetic time-scale spectrum $\\tau(l,r)$ that is\nvalid for all radius $r$ above the inner core and reduces to the usual\n$\\tau_{\\rm sv}$ at and above the core-mantle boundary (CMB). We study $\\tau$ in\na numerical geodynamo model. Focusing on the large scales, we find that $\\tau\n\\sim l^{-1}$ at the CMB. Just below the CMB, $\\tau$ undergo a sharp transition\nsuch that the scaling becomes shallower than $l^{-1}$. This transition stems\nfrom the magnetic boundary condition at the CMB that ties all three components\nof $\\boldsymbol{\\dot B}$ together. In the interior of the outer core, the time\nvariation of the horizontal magnetic field, which dominates $\\boldsymbol{\\dot\nB}$, has no such constraint. The upshot is $\\tau_{\\rm sv}$ becomes unreliable\nin estimating time scales inside the outer core. Another question concerning\n$\\tau$ is whether a scaling argument based on the frozen-flux hypothesis can be\nused to explain its scaling. To investigate this, we analyse the induction\nequation in the spectral space. We find that away from both boundaries, the\nmagnetic diffusion term is negligible in the power spectrum of\n$\\boldsymbol{\\dot B}$. However, $\\boldsymbol{\\dot B}$ is controlled by the\nradial derivative in the induction term, thus invalidating the frozen-flux\nargument. Near the CMB, magnetic diffusion starts to affect $\\boldsymbol{\\dot\nB}$ rendering the frozen-flux hypothesis inapplicable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:42:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tsang","Yue-Kin",""],["Jones","Chris A.",""]]}
{"id":"2308.12376","submitter":"Chen Shi","authors":"Chen Shi, Nikos Sioulas, Zesen Huang, Marco Velli, Anna Tenerani,\n  Victor R\\'eville","title":"Evolution of MHD turbulence in the expanding solar wind: residual energy\n  and intermittency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conduct 3D magnetohydrodynamic (MHD) simulations of decaying turbulence in\nthe solar wind context. To account for the spherical expansion of the solar\nwind, we implement the expanding box model. The initial turbulence comprises\nuncorrelated counter-propagating Alfv\\'en waves and exhibits an isotropic power\nspectrum. Our findings reveal the consistent generation of negative residual\nenergy whenever nonlinear interactions are present, independent of the\nnormalized cross helicity $\\sigma_c$. The spherical expansion facilitates this\nprocess. The resulting residual energy is primarily distributed in the\nperpendicular direction, with $[S_2(\\mathbf{b})-S_2(\\mathbf{u})] \\propto\nl_\\perp$ or equivalently $-E_r \\propto k_\\perp^{-2}$. Here $S_2(\\mathbf{b})$\nand $S_2(\\mathbf{u})$ are second-order structure functions of magnetic field\nand velocity respectively. In most runs, $S_2(\\mathbf{b})$ develops a scaling\nrelation $S_2(\\mathbf{b}) \\propto l_\\perp^{1/2}$ ($E_b \\propto\nk_\\perp^{-3/2}$). In contrast, $S_2(\\mathbf{u})$ is consistently shallower than\n$S_2(\\mathbf{b})$, which aligns with in-situ observations of the solar wind. We\nobserve that the higher-order statistics of the turbulence, which act as a\nproxy for intermittency, are strongly affected by the expansion effect but have\nweak dependence on the initial $\\sigma_c$. Generally, the intermittency is more\npronounced when the expansion effect is present. Finally, we find that in our\nsimulations although the negative residual energy and intermittency grow\nsimultaneously as the turbulence evolves, there is no obvious causal relation\nbetween them because they are generated on different scales.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:45:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shi","Chen",""],["Sioulas","Nikos",""],["Huang","Zesen",""],["Velli","Marco",""],["Tenerani","Anna",""],["R\u00e9ville","Victor",""]]}
{"id":"2308.12377","submitter":"Wagner Sgobbi","authors":"Carolina de Miranda e Pereiro and Wagner Sgobbi","title":"The BNS invariants of the braid groups and pure braid groups of some\n  surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute and explicitly describe the Bieri-Neumann-Strebel invariants\n$\\Sigma^1$ for the full and pure braid groups of the sphere $\\mathbb{S}^2$, the\nreal projective plane $\\mathbb{R}P^2$ and specially the torus $\\mathbb{T}$ and\nthe Klein bottle $\\mathbb{K}$. In order to do this for $M=\\mathbb T$ or\n$M=\\mathbb K$, and $n \\geq 2$, we use the $n^{th}$-configuration space of $M$\nto show that the action by homeomorphisms of the group $Out(P_n(M))$ on the\ncharacter sphere $S(P_n(M))$ contains certain permutation of coordinates, under\nwhich $\\Sigma^1(P_n(\\mathbb T))^c$ and $\\Sigma^1(P_n(\\mathbb K))^c$ are\ninvariant. Furthermore, $\\Sigma^1(P_n(\\mathbb T))^c$ and\n$\\Sigma^1(P_n(\\mathbb{S}^2))^c$ (the latter with $n \\geq 5$) are finite unions\nof pairwise disjoint circles, and $\\Sigma^1(P_n(\\mathbb K))^c$ is finite. This\nlast fact implies that there is a normal finite index subgroup $H \\leq\nAut(P_n(\\mathbb K))$ such that the Reidemeister number $R(\\varphi)$ is infinite\nfor every $\\varphi \\in H$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:46:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pereiro","Carolina de Miranda e",""],["Sgobbi","Wagner",""]]}
{"id":"2308.12378","submitter":"Francesco Iacovelli","authors":"Francesco Iacovelli, Michele Mancarella, Chiranjib Mondal, Anna\n  Puecher, Tim Dietrich, Francesca Gulminelli, Michele Maggiore, Micaela Oertel","title":"Nuclear physics constraints from binary neutron star mergers in the\n  Einstein Telescope era","comments":"18 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The next generation of ground-based gravitational-wave detectors, Einstein\nTelescope (ET) and Cosmic Explorer (CE), present a unique opportunity to put\nconstraints on dense matter, among many other groundbreaking scientific goals.\nIn a recent study the science case of ET was further strengthened, studying in\nparticular the performances of different detector designs. In this paper we\npresent a more detailed study of the nuclear physics section of that work. In\nparticular, focusing on two different detector configurations (the single-site\ntriangular-shaped design and a design consisting of two widely separated\n\"L-shaped\" interferometers), we study the detection prospects of binary neutron\nstar (BNS) mergers, and how they can reshape our understanding of the\nunderlying equation of state (EoS) of dense matter. We employ several\nstate-of-the-art EoS models and state-of-the-art synthetic BNS merger catalogs,\nand we make use of the Fisher information formalism (FIM) to quantify\nstatistical errors on the astrophysical parameters describing individual BNS\nevents. To check the reliability of the FIM method, we further perform a full\nparameter estimation for a few simulated events. Based on the uncertainties on\nthe tidal deformabilities associated to these events, we outline a mechanism to\nextract the underlying injected EoS using a recently developed meta-modelling\napproach within a Bayesian framework. Our results suggest that with $\\gtrsim\n500$ events with signal-to-noise ratio greater than $12$, we will be able to\npin down very precisely the underlying EoS governing the neutron star matter.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:36:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Iacovelli","Francesco",""],["Mancarella","Michele",""],["Mondal","Chiranjib",""],["Puecher","Anna",""],["Dietrich","Tim",""],["Gulminelli","Francesca",""],["Maggiore","Michele",""],["Oertel","Micaela",""]]}
{"id":"2308.12379","submitter":"Will Robson Monteiro Rocha","authors":"W. R. M. Rocha, M. G. Rachid, M. K. McClure, J. He and H. Linnartz","title":"Water ice: temperature-dependent refractive indexes and their\n  astrophysical implications","comments":"Accepted for publication in A&A, 12 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interstellar ices are largely composed of frozen water. It is important to\nderive fundamental parameters for H$_2$O ice such as absorption and scattering\nopacities for which accurate complex refractive indexes are needed. The primary\ngoal of this work is to derive ice-grain opacities based on accurate H$_2$O ice\ncomplex refractive indexes and to assess their impact on the derivation of ice\ncolumn densities and porosity in space. We use the \\texttt{optool} code to\nderive ice-grain opacities values based on new mid-IR complex refractive index\nmeasurements of H$_2$O ice. Next, we use those opacities in the\n\\texttt{RADMC-3D} code to run a radiative transfer simulation of a protostellar\nenvelope containing H$_2$O ice. This is used to calculate water ice column\ndensities. We find that the real refractive index in the mid-IR of H$_2$O ice\nat 30~K is $\\sim$14\\% lower than previously reported in the literature. This\nhas a direct impact on the ice column densities derived from the simulations of\nembedded protostars. We find that ice porosity plays a significant role in the\nopacity of icy grains and that the H$_2$O libration mode can be used as a\ndiagnostic tool to constrain the porosity level. Finally, the refractive\nindexes presented here allow us to estimate a grain size detection limit of\n18~$\\mu$m based on the 3~$\\mu$m band whereas the 6~$\\mu$m band allows tracing\ngrain sizes larger than 20~$\\mu$m. Based on radiative transfer simulations\nusing new mid-IR refractive indexes, we conclude that H$_2$O ice leads to more\nabsorption of infrared light than previously estimated. This implies that the 3\nand 6~$\\mu$m bands remain detectable in icy grains with sizes larger than\n10~$\\mu$m. Finally, we propose that also the H$_2$O ice libration band can be a\ndiagnostic tool to constrain the porosity level of the interstellar ice, in\naddition to the OH dangling bond, which is routinely used for this purpose.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:47:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rocha","W. R. M.",""],["Rachid","M. G.",""],["McClure","M. K.",""],["He","J.",""],["Linnartz","H.",""]]}
{"id":"2308.12380","submitter":"Yufeng Yin","authors":"Yufeng Yin, Di Chang, Guoxian Song, Shen Sang, Tiancheng Zhi, Jing\n  Liu, Linjie Luo, Mohammad Soleymani","title":"FG-Net: Facial Action Unit Detection with Generalizable Pyramidal\n  Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic detection of facial Action Units (AUs) allows for objective facial\nexpression analysis. Due to the high cost of AU labeling and the limited size\nof existing benchmarks, previous AU detection methods tend to overfit the\ndataset, resulting in a significant performance loss when evaluated across\ncorpora. To address this problem, we propose FG-Net for generalizable facial\naction unit detection. Specifically, FG-Net extracts feature maps from a\nStyleGAN2 model pre-trained on a large and diverse face image dataset. Then,\nthese features are used to detect AUs with a Pyramid CNN Interpreter, making\nthe training efficient and capturing essential local features. The proposed\nFG-Net achieves a strong generalization ability for heatmap-based AU detection\nthanks to the generalizable and semantic-rich features extracted from the\npre-trained generative model. Extensive experiments are conducted to evaluate\nwithin- and cross-corpus AU detection with the widely-used DISFA and BP4D\ndatasets. Compared with the state-of-the-art, the proposed method achieves\nsuperior cross-domain performance while maintaining competitive within-domain\nperformance. In addition, FG-Net is data-efficient and achieves competitive\nperformance even when trained on 1000 samples. Our code will be released at\n\\url{https://github.com/ihp-lab/FG-Net}\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:51:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yin","Yufeng",""],["Chang","Di",""],["Song","Guoxian",""],["Sang","Shen",""],["Zhi","Tiancheng",""],["Liu","Jing",""],["Luo","Linjie",""],["Soleymani","Mohammad",""]]}
{"id":"2308.12381","submitter":"Kriste Krstovski","authors":"Kriste Krstovski, Yao Lu, Ye Xu","title":"Inferring gender from name: a large scale performance evaluation study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A person's gender is a crucial piece of information when performing research\nacross a wide range of scientific disciplines, such as medicine, sociology,\npolitical science, and economics, to name a few. However, in increasing\ninstances, especially given the proliferation of big data, gender information\nis not readily available. In such cases researchers need to infer gender from\nreadily available information, primarily from persons' names. While inferring\ngender from name may raise some ethical questions, the lack of viable\nalternatives means that researchers have to resort to such approaches when the\ngoal justifies the means - in the majority of such studies the goal is to\nexamine patterns and determinants of gender disparities. The necessity of\nname-to-gender inference has generated an ever-growing domain of algorithmic\napproaches and software products. These approaches have been used throughout\nthe world in academia, industry, governmental and non-governmental\norganizations. Nevertheless, the existing approaches have yet to be\nsystematically evaluated and compared, making it challenging to determine the\noptimal approach for future research. In this work, we conducted a large scale\nperformance evaluation of existing approaches for name-to-gender inference.\nAnalysis are performed using a variety of large annotated datasets of names. We\nfurther propose two new hybrid approaches that achieve better performance than\nany single existing approach.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 13:38:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Krstovski","Kriste",""],["Lu","Yao",""],["Xu","Ye",""]]}
{"id":"2308.12382","submitter":"Natsuki Tsutsumi","authors":"Natsuki Tsutsumi, Kengo Nakai, Yoshitaka Saiki","title":"Constructing low-dimensional ordinary differential equations from\n  chaotic time series of high/infinite-dimensional systems using radial\n  function-based regression","comments":"14pages, 15figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS nlin.CD physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In our previous study (N. Tsutsumi, K. Nakai and Y. Saiki (2022)) we proposed\na method of constructing a system of differential equations of chaotic behavior\nonly from observable deterministic time series, which we will call radial\nfunction-based regression (RfR) method. The RfR method employs a regression\nusing Gaussian radial basis functions together with polynomial terms to\nfacilitate the robust modeling of chaotic behavior. In this paper, we apply the\nRfR method to several types of relatively high-dimensional deterministic time\nseries generated by a partial differential equation, a delay differential\nequation, a turbulence model, and intermittent dynamics. The case when the\nobservation includes noise is also tested. We have effectively constructed a\nsystem of differential equations for each of these examples, which is assessed\nfrom the point of view of time series forecast, reconstruction of invariant\nsets, and invariant densities. We find that in some of the models, an\nappropriate trajectory is realized on the chaotic saddle and is identified by\nthe Stagger-and-Step method.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 05:12:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tsutsumi","Natsuki",""],["Nakai","Kengo",""],["Saiki","Yoshitaka",""]]}
{"id":"2308.12383","submitter":"Marcella Cornia","authors":"Manuele Barraco, Sara Sarto, Marcella Cornia, Lorenzo Baraldi, Rita\n  Cucchiara","title":"With a Little Help from your own Past: Prototypical Memory Networks for\n  Image Captioning","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image captioning, like many tasks involving vision and language, currently\nrelies on Transformer-based architectures for extracting the semantics in an\nimage and translating it into linguistically coherent descriptions. Although\nsuccessful, the attention operator only considers a weighted summation of\nprojections of the current input sample, therefore ignoring the relevant\nsemantic information which can come from the joint observation of other\nsamples. In this paper, we devise a network which can perform attention over\nactivations obtained while processing other training samples, through a\nprototypical memory model. Our memory models the distribution of past keys and\nvalues through the definition of prototype vectors which are both\ndiscriminative and compact. Experimentally, we assess the performance of the\nproposed model on the COCO dataset, in comparison with carefully designed\nbaselines and state-of-the-art approaches, and by investigating the role of\neach of the proposed components. We demonstrate that our proposal can increase\nthe performance of an encoder-decoder Transformer by 3.7 CIDEr points both when\ntraining in cross-entropy only and when fine-tuning with self-critical sequence\ntraining. Source code and trained models are available at:\nhttps://github.com/aimagelab/PMA-Net.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:53:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Barraco","Manuele",""],["Sarto","Sara",""],["Cornia","Marcella",""],["Baraldi","Lorenzo",""],["Cucchiara","Rita",""]]}
{"id":"2308.12384","submitter":"Matthew Foreman","authors":"Matthew Foreman","title":"Where do you put a telescope? How do you understand Covid\n  concentrations?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This note discusses dynamical systems-systems that evolve through time. We\nstart with two contemporary examples illustrating the qualitative and the\nquantitative behavior of dynamical systems. These are two broad categories,\nusually called the study of the smooth behavior and ergodic theory. We then\nintroduce the technical framework necessary to state the problems\nmathematically. Finally we show that the problems are unsolvable in a rigorous\nsense.\n","versions":[{"version":"v1","created":"Mon, 7 Aug 2023 01:44:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Foreman","Matthew",""]]}
{"id":"2308.12385","submitter":"Isma\\\"il Baaj","authors":"Isma\\\"il Baaj","title":"Handling the inconsistency of systems of $\\min\\rightarrow$ fuzzy\n  relational equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we study the inconsistency of systems of $\\min-\\rightarrow$\nfuzzy relational equations. We give analytical formulas for computing the\nChebyshev distances $\\nabla = \\inf_{d \\in \\mathcal{D}} \\Vert \\beta - d \\Vert$\nassociated to systems of $\\min-\\rightarrow$ fuzzy relational equations of the\nform $\\Gamma \\Box_{\\rightarrow}^{\\min} x = \\beta$, where $\\rightarrow$ is a\nresidual implicator among the G\\\"odel implication $\\rightarrow_G$, the Goguen\nimplication $\\rightarrow_{GG}$ or Lukasiewicz's implication $\\rightarrow_L$ and\n$\\mathcal{D}$ is the set of second members of consistent systems defined with\nthe same matrix $\\Gamma$. The main preliminary result that allows us to obtain\nthese formulas is that the Chebyshev distance $\\nabla$ is the lower bound of\nthe solutions of a vector inequality, whatever the residual implicator used.\nFinally, we show that, in the case of the $\\min-\\rightarrow_{G}$ system, the\nChebyshev distance $\\nabla$ may be an infimum, while it is always a minimum for\n$\\min-\\rightarrow_{GG}$ and $\\min-\\rightarrow_{L}$ systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 16:12:26 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Baaj","Isma\u00efl",""]]}
{"id":"2308.12386","submitter":"Sourav Dutta","authors":"Bubai Rahaman, Sid C. Wright, and Sourav Dutta","title":"Observation of quantum interference of optical transition pathways in\n  Doppler-free two-photon spectroscopy and implications for precision\n  measurements","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph cond-mat.quant-gas physics.app-ph physics.chem-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Doppler-free two-photon spectroscopy is a standard technique for precision\nmeasurement of transition frequencies of dipole-forbidden transitions. The\naccuracy of such measurements depends critically on fitting of the spectrum to\nan appropriate line shape model, often a Voigt profile which neglects the\neffect of quantum interference of optical transitions. Here, we report the\nobservation of quantum interference of optical transition pathways in\nDoppler-free two-photon spectroscopy of the cesium 6S-7D transitions. The\nquantum interference manifests itself as asymmetric line shapes of the\nhyperfine lines of the 7D states, observed through spontaneous emission\nfollowing excitation by a narrow-linewidth cw laser. The interference persists\ndespite the lines being spectrally well-resolved. Ignoring the effect of\nquantum interference causes large systematic shifts in the determination of the\nline-centers, while accounting for it resolves the apparent line shift and\nenables the precise determination of hyperfine splitting in the 7D states. We\ncalculate the spectral line shape including the effect of quantum interference\nand show that it agrees with the experimental observations. Our results have\nimplications for precision measurements of hyperfine splittings, isotope shifts\nand transition frequencies, including those of the hydrogen S-S and S-D\ntransitions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 18:54:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rahaman","Bubai",""],["Wright","Sid C.",""],["Dutta","Sourav",""]]}
{"id":"2308.12387","submitter":"James Davis","authors":"Kelechi G. Kalu, Taylor R. Schorlemmer, Sophie Chen, Kyle Robinson,\n  Erik Kocinare, James C. Davis","title":"Reflecting on the Use of the Policy-Process-Product Theory in Empirical\n  Software Engineering","comments":"5 pages, published in the proceedings of the 2023 ACM Joint European\n  Software Engineering Conference and Symposium on the Foundations of Software\n  Engineering in the Ideas-Visions-Reflections track (ESEC/FSE-IVR'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The primary theory of software engineering is that an organization's Policies\nand Processes influence the quality of its Products. We call this the PPP\nTheory. Although empirical software engineering research has grown common, it\nis unclear whether researchers are trying to evaluate the PPP Theory. To assess\nthis, we analyzed half (33) of the empirical works published over the last two\nyears in three prominent software engineering conferences. In this sample, 70%\nfocus on policies/processes or products, not both. Only 33% provided\nmeasurements relating policy/process and products. We make four\nrecommendations: (1) Use PPP Theory in study design; (2) Study feedback\nrelationships; (3) Diversify the studied feedforward relationships; and (4)\nDisentangle policy and process. Let us remember that research results are in\nthe context of, and with respect to, the relationship between software\nproducts, processes, and policies.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:01:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kalu","Kelechi G.",""],["Schorlemmer","Taylor R.",""],["Chen","Sophie",""],["Robinson","Kyle",""],["Kocinare","Erik",""],["Davis","James C.",""]]}
{"id":"2308.12388","submitter":"Ou Deng","authors":"Ou Deng, Qun Jin","title":"FOSA: Full Information Maximum Likelihood (FIML) Optimized\n  Self-Attention Imputation for Missing Data","comments":"The source code for the experiments is publicly available at:\n  https://github.com/oudeng/FOSA/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In data imputation, effectively addressing missing values is pivotal,\nespecially in intricate datasets. This paper delves into the FIML Optimized\nSelf-attention (FOSA) framework, an innovative approach that amalgamates the\nstrengths of Full Information Maximum Likelihood (FIML) estimation with the\ncapabilities of self-attention neural networks. Our methodology commences with\nan initial estimation of missing values via FIML, subsequently refining these\nestimates by leveraging the self-attention mechanism. Our comprehensive\nexperiments on both simulated and real-world datasets underscore FOSA's\npronounced advantages over traditional FIML techniques, encapsulating facets of\naccuracy, computational efficiency, and adaptability to diverse data\nstructures. Intriguingly, even in scenarios where the Structural Equation Model\n(SEM) might be mis-specified, leading to suboptimal FIML estimates, the robust\narchitecture of FOSA's self-attention component adeptly rectifies and optimizes\nthe imputation outcomes. Our empirical tests reveal that FOSA consistently\ndelivers commendable predictions, even in the face of up to 40% random\nmissingness, highlighting its robustness and potential for wide-scale\napplications in data imputation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:01:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Deng","Ou",""],["Jin","Qun",""]]}
{"id":"2308.12389","submitter":"Vinko Zlati\\'c","authors":"Benjamin Sven Ko\\v{z}i\\'c, Salvatore Marco Giampaolo, Vinko Zlati\\'c","title":"Rewiring driven evolution of quenched frustrated signed network","comments":"12 pages, 10 figures","journal-ref":null,"doi":null,"report-no":"RBI-ThPhys-2023-30","categories":"cond-mat.stat-mech physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A framework for studying the behavior of a classically frustrated signed\nnetwork in the process of random rewiring is developed. We describe jump\nprobabilities for change in frustration and formulate a theoretical estimate in\nterms of the master equation. Stationary thermodynamic distribution and moments\nare derived from the master equation and compared to numerical simulations.\nFurthermore, an exact solution of the probability distribution is provided\nthrough suitable mapping of rewiring dynamic to birth and death processes with\nquadratic asymptotically symmetric transition rates.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:07:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ko\u017ei\u0107","Benjamin Sven",""],["Giampaolo","Salvatore Marco",""],["Zlati\u0107","Vinko",""]]}
{"id":"2308.12390","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan","title":"Duality in the homology of 5-manifolds","comments":"Paper. Published in peer reviewed journal in 2017","journal-ref":"Homology, Homotopy and Applications Vol. 19 (2017), No. 1, pp.\n  171-179","doi":"10.4310/HHA.2017.v19.n1.a9","report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the homological properties of a 5-manifold M with fundamental\ngroup G are encapsulated in a G-invariant stable form on the dual of the third\nsyzygy of Z. In this notation one may express an even stronger version of\nPoincare duality for M. However we find an obstruction to this duality.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:14:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""]]}
{"id":"2308.12391","submitter":"Luis Antonio da Mota","authors":"L.G.S. Duarte, L.A.C.P. da Mota, A.B.M.M. Queiroz","title":"Solving first order differential equations presenting elementary\n  functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.CA math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We have already dealt with the problem of solving First Order Differential\nEquations (1ODEs) presenting elementary functions before in [1, 2]. In this\npresent paper, we have established solid theoretical basis through a relation\nbetween the 1ODE we are dealing with and a rational second order ordinary\ndifferential equation, presenting a Liouvillian first Integral. Here, we have\nexpanded the results in [3], where we have establish a theoretical background\nto deal with rational second order ordinary differential equations (2ODEs) via\nthe S-function method. Using this generalisation and other results hereby\nintroduced, we have produced a method to integrate the 1ODE under scrutiny. Our\nmethods and algorithm are capable to deal efficiently with chaotic systems,\ndetermining regions of integrability.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:19:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Duarte","L. G. S.",""],["da Mota","L. A. C. P.",""],["Queiroz","A. B. M. M.",""]]}
{"id":"2308.12392","submitter":"Zeynab Hashimli","authors":"Shahin Mamedov, Zeynab Hashimli and Shahriyar Jafarzade","title":"Tensor meson couplings in AdS/QCD","comments":"12 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the hadronic and radiative couplings of the $f_2(1270)$ meson within\nthe hard- and soft-wall models of AdS/QCD. The results for the tensor\nmeson-nucleon-nucleon coupling ($g_{f_2NN}$) and tensor meson-photon-vector\nmeson coupling ($g_{f_2\\gamma\\rho}$) are compared to the ones obtained by using\nthe dispersion relations and amplitude methods, respectively. Qualitative\nagreement with different analyses implies the reliability of the holographic\ndescription of spin-2 meson.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:20:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mamedov","Shahin",""],["Hashimli","Zeynab",""],["Jafarzade","Shahriyar",""]]}
{"id":"2308.12393","submitter":"Kaushal Kumar","authors":"Kaushal Kumar","title":"Machine learning in parameter estimation of nonlinear systems","comments":"23 pages, 7 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.DS math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Accurately estimating parameters in complex nonlinear systems is crucial\nacross scientific and engineering fields. We present a novel approach for\nparameter estimation using a neural network with the Huber loss function. This\nmethod taps into deep learning's abilities to uncover parameters governing\nintricate behaviors in nonlinear equations. We validate our approach using\nsynthetic data and predefined functions that model system dynamics. By training\nthe neural network with noisy time series data, it fine-tunes the Huber loss\nfunction to converge to accurate parameters. We apply our method to damped\noscillators, Van der Pol oscillators, Lotka-Volterra systems, and Lorenz\nsystems under multiplicative noise. The trained neural network accurately\nestimates parameters, evident from closely matching latent dynamics. Comparing\ntrue and estimated trajectories visually reinforces our method's precision and\nrobustness. Our study underscores the Huber loss-guided neural network as a\nversatile tool for parameter estimation, effectively uncovering complex\nrelationships in nonlinear systems. The method navigates noise and uncertainty\nadeptly, showcasing its adaptability to real-world challenges.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:20:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kumar","Kaushal",""]]}
{"id":"2308.12394","submitter":"Regev Cohen","authors":"Roy Hirsch, Mathilde Caron, Regev Cohen, Amir Livne, Ron Shapiro,\n  Tomer Golany, Roman Goldenberg, Daniel Freedman, and Ehud Rivlin","title":"Self-Supervised Learning for Endoscopic Video Analysis","comments":"Accepted to MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning (SSL) has led to important breakthroughs in computer\nvision by allowing learning from large amounts of unlabeled data. As such, it\nmight have a pivotal role to play in biomedicine where annotating data requires\na highly specialized expertise. Yet, there are many healthcare domains for\nwhich SSL has not been extensively explored. One such domain is endoscopy,\nminimally invasive procedures which are commonly used to detect and treat\ninfections, chronic inflammatory diseases or cancer. In this work, we study the\nuse of a leading SSL framework, namely Masked Siamese Networks (MSNs), for\nendoscopic video analysis such as colonoscopy and laparoscopy. To fully exploit\nthe power of SSL, we create sizable unlabeled endoscopic video datasets for\ntraining MSNs. These strong image representations serve as a foundation for\nsecondary training with limited annotated datasets, resulting in\nstate-of-the-art performance in endoscopic benchmarks like surgical phase\nrecognition during laparoscopy and colonoscopic polyp characterization.\nAdditionally, we achieve a 50% reduction in annotated data size without\nsacrificing performance. Thus, our work provides evidence that SSL can\ndramatically reduce the need of annotated data in endoscopy.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:27:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hirsch","Roy",""],["Caron","Mathilde",""],["Cohen","Regev",""],["Livne","Amir",""],["Shapiro","Ron",""],["Golany","Tomer",""],["Goldenberg","Roman",""],["Freedman","Daniel",""],["Rivlin","Ehud",""]]}
{"id":"2308.12395","submitter":"Hongyu Zhou","authors":"Hongyu Zhou and Vasileios Tzoumas","title":"Safe Non-Stochastic Control of Linear Dynamical Systems","comments":"A preliminary version of this paper has been accepted for publication\n  in the IEEE Conference on Decision and Control (CDC)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of \\textit{safe control of linear dynamical systems\ncorrupted with non-stochastic noise}, and provide an algorithm that guarantees\n(i) zero constraint violation of convex time-varying constraints, and (ii)\nbounded dynamic regret, \\ie bounded suboptimality against an optimal\nclairvoyant controller that knows the future noise a priori. The constraints\nbound the values of the state and of the control input such as to ensure\ncollision avoidance and bounded control effort. We are motivated by the future\nof autonomy where robots will safely perform complex tasks despite real-world\nunpredictable disturbances such as wind and wake disturbances. To develop the\nalgorithm, we capture our problem as a sequential game between a linear\nfeedback controller and an adversary, assuming a known upper bound on the\nnoise's magnitude. Particularly, at each step $t=1,\\ldots, T$, first the\ncontroller chooses a linear feedback control gain $K_t \\in \\calK_t$, where\n$\\calK_t$ is constructed such that it guarantees that the safety constraints\nwill be satisfied; then, the adversary reveals the current noise $w_t$ and the\ncontroller suffers a loss $f_t(K_t)$ -- \\eg $f_t$ represents the system's\ntracking error at $t$ upon the realization of the noise. The controller aims to\nminimize its cumulative loss, despite knowing $w_t$ only after $K_t$ has been\nchosen. We validate our algorithm in simulated scenarios of safe control of\nlinear dynamical systems in the presence of bounded noise\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:29:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhou","Hongyu",""],["Tzoumas","Vasileios",""]]}
{"id":"2308.12396","submitter":"Oliver Roberts","authors":"O.J. Roberts, E. Burns, A. Goldstein, C.M. Hui (on behalf of the\n  MoonBEAM Team)","title":"Detecting Magnetar Giant Flares with MoonBEAM","comments":"8 pages, 1 figure, 38th International Cosmic Ray Conference\n  (ICRC2023), 26 July - 3 August, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetars are slowly-rotating neutron stars with extremely strong magnetic\nfields that rarely produce extremely bright, energetic giant flares. Magnetar\nGiant Flares (MGFs) begin with a short (200 ms) intense flash, followed by\nfainter emission lasting several minutes that is modulated by the magnetar spin\nperiod (typically 2-12 s). Over the last 40 years, only three MGFs have been\nobserved within our Galaxy and the Magellanic Clouds, which all suffered from\ninstrumental saturation due to their extreme intensity. It has been proposed,\nthat extragalactic MGFs masquerade as a small subset of short Gamma-ray Bursts\n(GRBs), noting that the sensitivity of current instrumentation prevents us from\ndetecting the pulsating tail to distances slightly beyond the Magellanic\nClouds. However, their initial bright flash is readily observable out to\ndistances of < 25 Mpc. In this presentation, we will evaluate the spectral and\ntemporal behaviors of MGFs using recent observations from events such as\nGRB200415A, to differentiate them from other progenitors, such as short GRBs.\nWe then present an overview of the Moon Burst Energetics All-sky Monitor\n(MoonBEAM), which will attempt to discover more of these events, providing\nhighly sensitive data that will help unravel the nature of these phenomena\nfurther in an attempt to better understand their emission mechanisms\ncomparatively with GRBs. In doing so, MoonBEAM will help provide a\ncomprehensive picture of energetic astrophysical phenomena, a key goal of the\nAstro2020 decadal survey.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:31:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Roberts","O. J.","","on behalf of the\n  MoonBEAM Team"],["Burns","E.","","on behalf of the\n  MoonBEAM Team"],["Goldstein","A.","","on behalf of the\n  MoonBEAM Team"],["Hui","C. M.","","on behalf of the\n  MoonBEAM Team"]]}
{"id":"2308.12397","submitter":"Tyler Slade","authors":"Tyler J. Slade, Aashish Sapkota, John M. Wilde, Qiang Zhang, Lin-Lin\n  Wang, Saul H. Lapidus, Juan Schmidt, Thomas Heitmann, Sergey L. Budko, Paul\n  C. Canfield","title":"Vacancy Tuned Magnetism in LaMn$_x$Sb$_2$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The layered ATMPn$_2$ (A = alkali earth or rare earth atom, TM = transition\nmetal, Pn = Sb, Bi) compounds are widely studied for their rich magnetism and\nelectronic structure topology. Here, we characterize the physical properties of\nLaMn$_x$Sb$_2$, an understudied member of the ATMPn$_2$ family. LaMn$_x$Sb$_2$\nforms with intrinsic Mn vacancies, and we demonstrate synthetic control of the\nMn occupancy to produce single crystals with x = 0.74-0.97. Magnetization and\ntransport measurements indicate LaMn$_x$Sb$_2$ has a rich\ntemperature-composition (T-x) magnetic phase diagram with physical properties\nstrongly influenced by the Mn occupancy. LaMn$_x$Sb$_2$ orders\nantiferromagnetically at T$_{1}$ = 130--180 K, where T$_{1}$ increases with x.\nBelow T$_{1}$, the T-x phase diagram is complicated. At high x, there is a\nsecond transition T$_2$ that decreases in temperature as x is lowered,\nvanishing below x $\\leq$ 0.85. A third, first-order, transition T$_3$ is\ndetected at x $\\approx$ 0.92, and the transition temperature increases as x is\nlowered, crossing above T$_2$ near x $\\approx$ 0.9. On moving below x $<$ 0.79,\nwe find the crystal structure changes from the P4/nmm arrangement to a\nI$\\bar{4}$2m structure with partially ordered Mn vacancies. The change in\ncrystal structure results in the appearance of two new low temperature phases\nand a crossover between regimes of negative and positive magnetoresistance.\nFinally, we provide neutron diffraction for x = 0.93, and find that the high x\ncompositions first adopt a G-type AFM structure with the Mn moments aligned\nwithin the ab-plane which is followed on cooling by a second transition to a\ndifferent, non-collinear structure where the moments are rotated within the\nbasal plane. Our results demonstrate that LaMn$_x$Sb$_2$ is a highly tunable\nmaterial with six unique magnetically ordered phases, depending on T and x.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:32:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Slade","Tyler J.",""],["Sapkota","Aashish",""],["Wilde","John M.",""],["Zhang","Qiang",""],["Wang","Lin-Lin",""],["Lapidus","Saul H.",""],["Schmidt","Juan",""],["Heitmann","Thomas",""],["Budko","Sergey L.",""],["Canfield","Paul C.",""]]}
{"id":"2308.12398","submitter":"Michael Renger","authors":"M. Renger, S. Gandorfer, W. Yam, F. Fesquet, M. Handschuh, K. E.\n  Honasoge, F. Kronowetter, Y. Nojiri, M. Partanen, M. Pfeiffer, H. van der\n  Vliet, A. J. Matthews, J. Govenius, R. N. Jabdaraghi, M. Prunnila, A. Marx,\n  F. Deppe, R. Gross, K. G. Fedorov","title":"Cryogenic microwave link for quantum local area networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.supr-con physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Scalable quantum information processing with superconducting circuits is\nabout to advance from individual processors in single dilution refrigerators to\nmore powerful distributed quantum computing systems located in separate cooling\nunits in order to achieve a practical quantum advantage. Hence, realization of\nhardware platforms for quantum local area networks (QLANs) compatible with\nsuperconducting technology is of high importance. Here, we demonstrate a basic\nprototype for a microwave QLAN based on a cryogenic link connecting two\nindividual dilution cryostats over a distance of 6.6m with a base temperature\nof 52mK in the center. We provide details about the system design,\ninstallation, and performance. We employ superconducting coaxial microwave\ntransmission lines to form a quantum communication channel and characterize its\npotential by demonstrating robust entanglement distribution in the form of\ntwo-mode squeezing between remote parties. By preserving entanglement\ndistribution at link temperatures up to 1K, we experimentally verify the\nfluctuation-dissipation theorem. Consequently, we demonstrate that our system\ncan form the backbone for future distributed quantum computing applications.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:34:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Renger","M.",""],["Gandorfer","S.",""],["Yam","W.",""],["Fesquet","F.",""],["Handschuh","M.",""],["Honasoge","K. E.",""],["Kronowetter","F.",""],["Nojiri","Y.",""],["Partanen","M.",""],["Pfeiffer","M.",""],["van der Vliet","H.",""],["Matthews","A. J.",""],["Govenius","J.",""],["Jabdaraghi","R. N.",""],["Prunnila","M.",""],["Marx","A.",""],["Deppe","F.",""],["Gross","R.",""],["Fedorov","K. G.",""]]}
{"id":"2308.12399","submitter":"Helena Smigoc","authors":"Damjana Kokol Bukov\\v{s}ek, Helena \\v{S}migoc","title":"Symmetric Nonnegative Trifactorization of Pattern Matrices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  A factorization of an $n \\times n$ nonnegative symmetric matrix $A$ of the\nform $BCB^T$, where $C$ is a $k \\times k$ symmetric matrix, and both $B$ and\n$C$ are required to be nonnegative, is called the Symmetric Nonnegative Matrix\nTrifactorization (SN-Trifactorization). The SNT-rank of $A$ is the minimal $k$\nfor which such factorization exists. The SNT-rank of a simple graph $G$ that\nallows loops is defined to be the minimal possible SNT-rank of all symmetric\nnonnegative matrices whose zero-nonzero pattern is prescribed by a given graph.\n  We define set-join covers of graphs, and show that finding the SNT-rank of\n$G$ is equivalent to finding the minimal order of a set-join cover of $G$.\nUsing this insight we develop basic properties of the SNT-rank for graphs and\ncompute it for trees and cycles without loops. We show the equivalence between\nthe SNT-rank for complete graphs and the Katona problem, and discuss uniqueness\nof patterns of matrices in the factorization.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:37:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bukov\u0161ek","Damjana Kokol",""],["\u0160migoc","Helena",""]]}
{"id":"2308.12401","submitter":"Nathan Chen","authors":"Nathan Chen, Benjamin Church, Lena Ji, David Stapleton","title":"The fibering genus of Fano hypersurfaces","comments":"13 pages, 1 figure. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Koll\\'ar proved that a very general $n$-dimensional complex hypersurface of\ndegree at least $3\\lceil (n+3)/4\\rceil$ is not birational to a fibration in\nrational curves. This is most interesting when the hypersurface is Fano, in\nwhich case it is covered by rational curves. In this paper, we extend\nKoll\\'ar's ideas and show that for any genus $g$, there are Fano hypersurfaces\n(in more restrictive degree and dimension ranges) that are not birational to\nfibrations in genus $g$ curves. In other words, we show that the fibering genus\nof these hypersurfaces can be arbitrarily large. The fibering genus of a\nvariety has been studied in work of Konno, Ein--Lazarsfeld, and Voisin, but\nthis is the first paper to explore these ideas in the Fano range. Following\nKoll\\'ar, we degenerate to characteristic $p>0$ to rule out these fibrations. A\ncrucial input is Tate's genus change formula and its generalizations, which\nimply that any regular curve of genus $g$ is smooth if $p$ is sufficiently\nlarge compared to $g$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:43:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Nathan",""],["Church","Benjamin",""],["Ji","Lena",""],["Stapleton","David",""]]}
{"id":"2308.12402","submitter":"Aryapoor Masood","authors":"Masood Aryapoor","title":"Skew-convex function rings and evaluation of skew rational functions","comments":"arXiv admin note: text overlap with arXiv:2211.07006","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The product formula for evaluating products of skew polynomials is used to\nconstruct a class of rings. As an application, we present a method of\nevaluating quotients of skew polynomials.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:49:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Aryapoor","Masood",""]]}
{"id":"2308.12403","submitter":"P\\'eter Bereczky","authors":"P\\'eter Bereczky, D\\'aniel Horp\\'acsi, Simon Thompson","title":"A Frame Stack Semantics for Sequential Core Erlang","comments":"Draft paper of IFL 2023, The 35th Symposium on Implementation and\n  Application of Functional Languages, August 29--31, 2023, Braga, Portugal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a small-step, frame stack style, semantics for sequential Core\nErlang, a dynamically typed, impure functional programming language. The\nsemantics and the properties that we prove are machine-checked with the Coq\nproof assistant. We improve on previous work by including exceptions and\nexception handling, as well as built-in data types and functions. Based on the\nsemantics, we define multiple concepts of program equivalence (contextual, CIU\nequivalence, and equivalence based on logical relations) and prove that the\ndefinitions are all equivalent. Using this we are able to give a correctness\ncriterion for refactorings by means of contextually equivalent symbolic\nexpression pairs, which is one of the main motivations of this work.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:56:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bereczky","P\u00e9ter",""],["Horp\u00e1csi","D\u00e1niel",""],["Thompson","Simon",""]]}
{"id":"2308.12404","submitter":"Alp\\'ar J\\\"uttner","authors":"Alp\\'ar J\\\"uttner and Eszter Szab\\'o","title":"Balanced Submodular Flows","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper examines the Balanced Submodular Flow Problem, that is the problem\nof finding a feasible submodular flow minimizing the difference between the\nflow values along the edges. A min-max formula is given to the problem and an\nalgorithm is presented to solve it using $O(m^2)$ submodular function\nminimizations. Then, these result are extended to the weighted version of the\nproblem. Finally, the Balanced Integer Submodular Flow Problem is discussed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:57:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["J\u00fcttner","Alp\u00e1r",""],["Szab\u00f3","Eszter",""]]}
{"id":"2308.12405","submitter":"Joe Sawada","authors":"J. Sawada, J. Sears, A. Trautrim, A. Williams","title":"Demystifying our Grandparent's De Bruijn Sequences with Concatenation\n  Trees","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Some of the most interesting de Bruijn sequences can be constructed in\nseemingly unrelated ways. In particular, the \"Granddaddy\" and \"Grandmama\" can\nbe understood by joining necklace cycles into a tree using simple parent rules,\nor by concatenating smaller strings (e.g., Lyndon words) in lexicographic\norders. These constructions are elegant, but their equivalences seem to come\nout of thin air, and the community has had limited success in finding others of\nthe same ilk. We aim to demystify the connection between cycle-joining trees\nand concatenation schemes by introducing \"concatenation trees\". These\nstructures combine binary trees and ordered trees, and traversals yield\nconcatenation schemes for their sequences.\n  In this work, we focus on the four simplest cycle-joining trees using the\npure cycling register (PCR): \"Granddaddy\" (PCR1), \"Grandmama\" (PCR2), \"Granny\"\n(PCR3), and \"Grandpa\" (PCR4). In particular, we formally prove a previously\nobserved correspondence for PCR3 and we unravel the mystery behind PCR4. More\nbroadly, this work lays the foundation for translating cycle-joining trees to\nknown concatenation constructions for a variety of underlying feedback\nfunctions including the complementing cycling register (CCR), pure summing\nregister (PSR), complementing summing register (CSR), and pure run-length\nregister (PRR).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:58:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sawada","J.",""],["Sears","J.",""],["Trautrim","A.",""],["Williams","A.",""]]}
{"id":"2308.12406","submitter":"Kevin O'Bryant","authors":"Kevin O'Bryant","title":"Constructing Thick $B_h$ sets","comments":"15 pages, including tables of data","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A subset $A$ of a commutative semigroup $X$ is called a $B_h$ set in $X$ if\nthe only solutions to $a_1+\\dots+a_h = b_1 + \\cdots +b_h$ (with $a_i,b_i \\in\nA$) are the trivial solutions $\\{a_1,\\dots,a_h\\} = \\{b_1,\\dots,b_h\\}$ (as\nmultisets). With $h=2$ and $X={\\mathbb Z}$, these sets are also known as Sidon\nsets, Golomb Rulers, and Babcock sets. In this work, we generalize\nconstructions of Bose-Chowla and Singer and give the resultant bounds on the\ndiameter of a $k$ element $B_h$ set in $\\mathbb Z$ for small $k$. We conclude\nwith a list of open problems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 19:59:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["O'Bryant","Kevin",""]]}
{"id":"2308.12407","submitter":"Fabio Vallejo","authors":"Fabio Andres Vallejo Narvaez","title":"Existence of Rayleigh waves in the presence of impedance boundary\n  conditions: A perpective from linear algebra","comments":"In preparation for journal submission","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we present an alternative method to deal with the secular\nequation for surface Rayleigh waves occurring in an isotropic elastic\nhalf-space subjected to impedance boundary conditions of the type proposed by\nGodoy et al. [Wave Motion 49 (2012), 585-594]. The method is applied to a\nboundary condition that is defined by proportional relationships between both\nthe stress and velocity components, with proportional constants being complex\nnumbers with negative real part. Our analysis shows that a Rayleigh wave cannot\nexist in this scenario. Interestingly, the problem considered here contains the\nproblems investigated recently by Vinh and Xuan [European Journal of Mechanics\nA/Solids 61 (2017) 180-185] and Giang and Vinh [J Eng Math (2021) 130:13] as\nparticular cases, which allows us to demonstrate for the first time that the\nsecular equation derived on those works has not complex roots outside the real\naxis for general impedance parameters. This is a crucial property that has only\nbeen verified for the stress-free secular equation by Achenbach in 1975. Our\nfindings are primarily obtained through arguments from linear algebra.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:01:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Narvaez","Fabio Andres Vallejo",""]]}
{"id":"2308.12408","submitter":"Jackson Wagner","authors":"Matthew Martel, Jackson Wagner","title":"An Initial Exploration: Learning to Generate Realistic Audio for Silent\n  Video","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CV eess.AS","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Generating realistic audio effects for movies and other media is a\nchallenging task that is accomplished today primarily through physical\ntechniques known as Foley art. Foley artists create sounds with common objects\n(e.g., boxing gloves, broken glass) in time with video as it is playing to\ngenerate captivating audio tracks. In this work, we aim to develop a\ndeep-learning based framework that does much the same - observes video in it's\nnatural sequence and generates realistic audio to accompany it. Notably, we\nhave reason to believe this is achievable due to advancements in realistic\naudio generation techniques conditioned on other inputs (e.g., Wavenet\nconditioned on text). We explore several different model architectures to\naccomplish this task that process both previously-generated audio and video\ncontext. These include deep-fusion CNN, dilated Wavenet CNN with visual\ncontext, and transformer-based architectures. We find that the\ntransformer-based architecture yields the most promising results, matching\nlow-frequencies to visual patterns effectively, but failing to generate more\nnuanced waveforms.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:08:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Martel","Matthew",""],["Wagner","Jackson",""]]}
{"id":"2308.12409","submitter":"Anne E. B. Nielsen","authors":"Michael Iversen, Jens H. Bardarson, Anne E. B. Nielsen","title":"Tower of two-dimensional scar states in a localized system","comments":"17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.str-el quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The eigenstate thermalization hypothesis describes how most isolated\nmany-body quantum systems reach thermal equilibrium. However, the hypothesis is\nviolated by phenomena such as many-body localization and quantum many-body\nscars. In this work, we study a finite, two-dimensional, disordered model\nhosting a tower of scar states. This construction is a particular instance of a\ngeneral framework and we demonstrate its generality by constructing two\ndisordered models hosting a different tower of scar states. At weak disorder,\nwe find numerically that the spectra are nonthermal, and the scar states appear\nas exact eigenstates with high entropy for certain bipartitions. At strong\ndisorder, the spectra localize and the scar states are identified as inverted\nscars since the scar states are embedded in a localized background as opposed\nto a thermal background. We argue that, for the considered type of models, the\nlocalization is stronger than what would be naively expected, and we show this\nexplicitly for one of the models. The argument also provides guidelines for\nobtaining similarly strong localization in other scarred models. We study the\ntransition from the thermal phase to localization by observing the adjacent gap\nratio shifting from the Wigner surmise to the Poisson distribution with\nincreasing disorder strength. Moreover, the entanglement entropy transitions\nfrom volume-law scaling with system size at weak disorder to area-law scaling\nat strong disorder. Finally, we demonstrate that localization protects scar\nrevivals for initial states with partial support in the scar subspace.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:11:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Iversen","Michael",""],["Bardarson","Jens H.",""],["Nielsen","Anne E. B.",""]]}
{"id":"2308.12410","submitter":"Jozef Strecka","authors":"Jozef Strecka, Katarina Karlova, Taras Verkholyak, Nils Caci, Stefan\n  Wessel, Andreas Honecker","title":"Magnetic analogue of liquid-gas phase transition of water: case study of\n  a spin-1/2 Ising-Heisenberg model on a diamond-decorated square lattice","comments":"6 pages, 6 figures, to be presented at 21st Conference of Czech and\n  Slovak Physicists, 4.-7. 9. 2023 in Bratislava","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spin-1/2 Ising-Heisenberg model on a diamond-decorated square lattice\nexhibits an intriguing temperature-driven phase transition in a magnetic field\nbetween a classical ferrimagnetic phase and a quantum monomer-dimer phase. A\ngeneralized decoration-iteration transformation accurately maps the considered\nmodel to an effective spin-1/2 Ising model on a square lattice with\ntemperature-dependent effective interactions and field, whereby the effective\nfield vanishes at the phase boundary separating the classical ferrimagnetic\nphase from the quantum monomer-dimer phase. Typical features of the\nmagnetization, magnetic susceptibility and specific heat in the vicinity of\ndiscontinuous and continuous thermal phase transitions between the classical\nferrimagnetic phase and the quantum monomer-dimer phase are elucidated.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:14:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Strecka","Jozef",""],["Karlova","Katarina",""],["Verkholyak","Taras",""],["Caci","Nils",""],["Wessel","Stefan",""],["Honecker","Andreas",""]]}
{"id":"2308.12411","submitter":"Michael Hochberg","authors":"Michael E. Hochberg","title":"A Theory of Intelligences: Concepts, Models, Implications","comments":"36 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligence is a human construct to represent the ability to achieve goals.\nGiven this wide berth, intelligence has been defined countless times, studied\nin a variety of ways and quantified using numerous measures. Understanding\nintelligence ultimately requires theory and quantification, both of which are\nelusive. My main objectives are to identify some of the central elements in and\nsurrounding intelligence, discuss some of its challenges and propose a theory\nbased on first principles. I focus on intelligence as defined by and for\nhumans, frequently in comparison to machines, with the intention of setting the\nstage for more general characterizations in life, collectives, human designs\nsuch as AI and in non-designed physical and chemical systems. I discuss key\nfeatures of intelligence, including path efficiency and goal accuracy,\nintelligence as a Black Box, environmental influences, flexibility to deal with\nsurprisal, the regress of intelligence, the relativistic nature of intelligence\nand difficulty, and temporal changes in intelligence including its evolution. I\npresent a framework for a first principles Theory of IntelligenceS (TIS), based\non the quantifiable macro-scale system features of difficulty, surprisal and\ngoal resolution accuracy. The proposed partitioning of uncertainty/solving and\naccuracy/understanding is particularly novel since it predicts that paths to a\ngoal not only function to accurately achieve goals, but as experimentations\nleading to higher probabilities for future attainable goals and increased\nbreadth to enter new goal spaces. TIS can therefore explain endeavors that do\nnot necessarily affect Darwinian fitness, such as leisure, politics, games and\nart. I conclude with several conceptual advances of TIS including a compact\nmathematical form of surprisal and difficulty, the theoretical basis of TIS,\nand open questions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:18:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hochberg","Michael E.",""]]}
{"id":"2308.12412","submitter":"Sam Nelson","authors":"Sam Nelson","title":"Biquandle Brackets and Quivers","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this brief expository article we review the background for biquandle\nbracket quivers -- including biquandles, biquandle homsets, biquandle coloring\nquivers and biquandle brackets -- for a talk at the 70th Topology Symposium at\nNara Women's University in August 2023.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:23:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Nelson","Sam",""]]}
{"id":"2308.12413","submitter":"Itsik Bergel","authors":"Itsik Bergel","title":"Non-Linear Relay Optimization using Deep-Learning tools","comments":"arXiv admin note: substantial text overlap with arXiv:2306.14253","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Widespread deployment of relays can yield a significant boost in the\nthroughput of forthcoming wireless networks. However, the optimal operation of\nlarge relay networks is still infeasible. This paper presents two approaches\nfor the optimization of large relay networks. In the traditional approach, we\nformulate and solve an optimization problem where the relays are considered\nlinear. In the second approach, we take an entirely new direction and consider\nthe true non-linear nature of the relays. Using the similarity to neural\nnetworks, we leverage deep-learning methodology.\n  Unlike previous applications of neural networks in wireless communications,\nwhere neural networks are added to the network to perform computational tasks,\nour deep relay optimization treats the relay network itself as a neural\nnetwork. By exploiting the non-linear transfer function exhibited by each\nrelay, we achieve over 15dB gain compared to traditional optimization methods.\nMoreover, we are able to implement part of the network functionality over the\nrelay network. Our findings shed light on the potential of deep relay\noptimization, promising significant advancements in future wireless\ncommunication systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:23:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bergel","Itsik",""]]}
{"id":"2308.12414","submitter":"Xianghan Xu","authors":"Xianghan Xu, Danrui Ni, Weiwei Xie, and R.J. Cava","title":"Superconductivity in electron doped PbBi2Te4","comments":"PRB accepted 11 pages main text + 4 pages SI","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Single crystals of In-doped PbBi2Te4 are synthesized via a conventional\nsolid-state method. Chemical analysis and hall measurements indicate that In\nreplaces Pb, introducing n-type carriers, creating Pb1-xInxBi2Te4. A\nsuperconducting transition is observed with a maximum transition temperature\naround 2.06 K for Pb1-xInxBi2Te4. Field dependent transport measurements reveal\ntype-II superconductivity and yield a maximum upper critical field around 1.55\nT. Thermodynamic data indicates bulk superconductivity in the BCS weak coupling\nlimit. Our findings establish an ambient-pressure superconducting system in the\nAM2X4 family, and doped PbBi2Te4 as a promising platform for the study of\ntopological superconductivity.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:23:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xu","Xianghan",""],["Ni","Danrui",""],["Xie","Weiwei",""],["Cava","R. J.",""]]}
{"id":"2308.12415","submitter":"Daniel Rodriguez-Cardenas","authors":"Daniel Rodriguez-Cardenas, David N. Palacio, Dipin Khati, Henry Burke,\n  Denys Poshyvanyk","title":"Benchmarking Causal Study to Interpret Large Language Models for Source\n  Code","comments":"6 pages, 4 tables, 3 figures, accepted to ICSME 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  One of the most common solutions adopted by software researchers to address\ncode generation is by training Large Language Models (LLMs) on massive amounts\nof source code. Although a number of studies have shown that LLMs have been\neffectively evaluated on popular accuracy metrics (e.g., BLEU, CodeBleu),\nprevious research has largely overlooked the role of Causal Inference as a\nfundamental component of the interpretability of LLMs' performance. Existing\nbenchmarks and datasets are meant to highlight the difference between the\nexpected and the generated outcome, but do not take into account confounding\nvariables (e.g., lines of code, prompt size) that equally influence the\naccuracy metrics. The fact remains that, when dealing with generative software\ntasks by LLMs, no benchmark is available to tell researchers how to quantify\nneither the causal effect of SE-based treatments nor the correlation of\nconfounders to the model's performance. In an effort to bring statistical rigor\nto the evaluation of LLMs, this paper introduces a benchmarking strategy named\nGaleras comprised of curated testbeds for three SE tasks (i.e., code\ncompletion, code summarization, and commit generation) to help aid the\ninterpretation of LLMs' performance. We illustrate the insights of our\nbenchmarking strategy by conducting a case study on the performance of ChatGPT\nunder distinct prompt engineering methods. The results of the case study\ndemonstrate the positive causal influence of prompt semantics on ChatGPT's\ngenerative performance by an average treatment effect of $\\approx 3\\%$.\nMoreover, it was found that confounders such as prompt size are highly\ncorrelated with accuracy metrics ($\\approx 0.412\\%$). The end result of our\ncase study is to showcase causal inference evaluations, in practice, to reduce\nconfounding bias. By reducing the bias, we offer an interpretable solution for\nthe accuracy metric under analysis.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:32:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rodriguez-Cardenas","Daniel",""],["Palacio","David N.",""],["Khati","Dipin",""],["Burke","Henry",""],["Poshyvanyk","Denys",""]]}
{"id":"2308.12416","submitter":"Roberto Souza","authors":"Neha Gianchandani, Mahsa Dibaji, Mariana Bento, Ethan MacDonald,\n  Roberto Souza","title":"Reframing the Brain Age Prediction Problem to a More Interpretable and\n  Quantitative Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning models have achieved state-of-the-art results in estimating\nbrain age, which is an important brain health biomarker, from magnetic\nresonance (MR) images. However, most of these models only provide a global age\nprediction, and rely on techniques, such as saliency maps to interpret their\nresults. These saliency maps highlight regions in the input image that were\nsignificant for the model's predictions, but they are hard to be interpreted,\nand saliency map values are not directly comparable across different samples.\nIn this work, we reframe the age prediction problem from MR images to an\nimage-to-image regression problem where we estimate the brain age for each\nbrain voxel in MR images. We compare voxel-wise age prediction models against\nglobal age prediction models and their corresponding saliency maps. The results\nindicate that voxel-wise age prediction models are more interpretable, since\nthey provide spatial information about the brain aging process, and they\nbenefit from being quantitative.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:33:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gianchandani","Neha",""],["Dibaji","Mahsa",""],["Bento","Mariana",""],["MacDonald","Ethan",""],["Souza","Roberto",""]]}
{"id":"2308.12417","submitter":"Endadul Hoque","authors":"Akib Jawad Nafis, Omar Chowdhury, Endadul Hoque","title":"VetIoT: On Vetting IoT Defenses Enforcing Policies at Runtime","comments":"Accepted in the IEEE Conference on Communications and Network\n  Security (CNS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Smart homes are powered by numerous programmable IoT platforms. Despite\ntremendous innovations, these platforms often suffer from safety and security\nissues. One class of defense solutions dynamically enforces safety and security\npolicies, which essentially capture the expected behavior of the IoT system.\nWhile many proposed works were built on this runtime approach, they all are\nunder-vetted. The primary reason lies in their evaluation approach. They are\nmostly self-evaluated in isolation using a virtual testbed combined with\nmanually orchestrated test scenarios that rely on user interactions with the\nplatform's UI. Such hand-crafted and non-uniform evaluation setups are limiting\nnot only the reproducibility but also a comparative analysis of their efficacy\nresults. Closing this gap in the traditional way requires a huge upfront manual\neffort, which causes the researchers turn away from any large-scale comparative\nempirical evaluation. Therefore, in this paper, we propose a highly-automated\nuniform evaluation platform, dubbed VetIoT, to vet the defense solutions that\nhinge on runtime policy enforcement. Given a defense solution, VetIoT easily\ninstantiates a virtual testbed inside which the solution is empirically\nevaluated. VetIoT replaces manual UI-based interactions with an automated event\nsimulator and manual inspection of test outcomes with an automated comparator.\nWe developed a fully-functional prototype of VetIoT and applied it on three\nruntime policy enforcement solutions: Expat, Patriot, and IoTguard. VetIoT\nreproduced their individual prior results and assessed their efficacy results\nvia stress testing and differential testing. We believe VetIoT can foster\nfuture research/evaluation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:33:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Nafis","Akib Jawad",""],["Chowdhury","Omar",""],["Hoque","Endadul",""]]}
{"id":"2308.12418","submitter":"Tim Barfoot","authors":"Timothy D Barfoot and Connor Holmes and Frederike D\\\"umbgen","title":"Certifiably Optimal Rotation and Pose Estimation Based on the Cayley Map","comments":"20 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present novel, tight, convex relaxations for rotation and pose estimation\nproblems that can guarantee global optimality via strong Lagrangian duality.\nSome such relaxations exist in the literature for specific problem setups that\nassume the matrix von Mises-Fisher distribution (a.k.a., matrix Langevin\ndistribution or chordal distance) for isotropic rotational uncertainty.\nHowever, another common way to represent uncertainty for rotations and poses is\nto define anisotropic noise in the associated Lie algebra. Starting from a\nnoise model based on the Cayley map, we define our estimation problems, convert\nthem to Quadratically Constrained Quadratic Programs (QCQPs), then relax them\nto Semidefinite Programs (SDPs), which can be solved using standard\ninterior-point optimization methods. We first show how to carry out basic\nrotation and pose averaging. We then turn to the more complex problem of\ntrajectory estimation, which involves many pose variables with both individual\nand inter-pose measurements (or motion priors). Our contribution is to\nformulate SDP relaxations for all these problems, including the identification\nof sufficient redundant constraints to make them tight. We hope our results can\nadd to the catalogue of useful estimation problems whose global optimality can\nbe guaranteed.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:34:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Barfoot","Timothy D",""],["Holmes","Connor",""],["D\u00fcmbgen","Frederike",""]]}
{"id":"2308.12419","submitter":"Bowen Shi","authors":"Bowen Shi","title":"Toward American Sign Language Processing in the Real World: Data, Tasks,\n  and Methods","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sign language, which conveys meaning through gestures, is the chief means of\ncommunication among deaf people. Recognizing sign language in natural settings\npresents significant challenges due to factors such as lighting, background\nclutter, and variations in signer characteristics. In this thesis, I study\nautomatic sign language processing in the wild, using signing videos collected\nfrom the Internet. This thesis contributes new datasets, tasks, and methods.\nMost chapters of this thesis address tasks related to fingerspelling, an\nimportant component of sign language and yet has not been studied widely by\nprior work. I present three new large-scale ASL datasets in the wild:\nChicagoFSWild, ChicagoFSWild+, and OpenASL. Using ChicagoFSWild and\nChicagoFSWild+, I address fingerspelling recognition, which consists of\ntranscribing fingerspelling sequences into text. I propose an end-to-end\napproach based on iterative attention that allows recognition from a raw video\nwithout explicit hand detection. I further show that using a Conformer-based\nnetwork jointly modeling handshape and mouthing can bring performance close to\nthat of humans. Next, I propose two tasks for building real-world\nfingerspelling-based applications: fingerspelling detection and search. For\nfingerspelling detection, I introduce a suite of evaluation metrics and a new\ndetection model via multi-task training. To address the problem of searching\nfor fingerspelled keywords in raw sign language videos, we propose a novel\nmethod that jointly localizes and matches fingerspelling segments to text.\nFinally, I will describe a benchmark for large-vocabulary open-domain sign\nlanguage translation based on OpenASL. To address the challenges of sign\nlanguage translation in realistic settings, we propose a set of techniques\nincluding sign search as a pretext task for pre-training and fusion of mouthing\nand handshape features.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:38:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shi","Bowen",""]]}
{"id":"2308.12420","submitter":"Walter Hernandez","authors":"Walter Hernandez, Kamil Tylinski, Alastair Moore, Niall Roche, Nikhil\n  Vadgama, Horst Treiblmaier, Jiangbo Shangguan, Paolo Tasca, and Jiahua Xu","title":"Evolution of ESG-focused DLT Research: An NLP Analysis of the Literature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Distributed Ledger Technologies (DLTs) have rapidly evolved, necessitating\ncomprehensive insights into their diverse components. However, a systematic\nliterature review that emphasizes the Environmental, Sustainability, and\nGovernance (ESG) components of DLT remains lacking. To bridge this gap, we\nselected 107 seed papers to build a citation network of 63,083 references and\nrefined it to a corpus of 24,539 publications for analysis. Then, we labeled\nthe named entities in 46 papers according to twelve top-level categories\nderived from an established technology taxonomy and enhanced the taxonomy by\npinpointing DLT's ESG elements. Leveraging transformer-based language models,\nwe fine-tuned a pre-trained language model for a Named Entity Recognition (NER)\ntask using our labeled dataset. We used our fine-tuned language model to\ndistill the corpus to 505 key papers, facilitating a literature review via\nnamed entities and temporal graph analysis on DLT evolution in the context of\nESG. Our contributions are a methodology to conduct a machine learning-driven\nsystematic literature review in the DLT field, placing a special emphasis on\nESG aspects. Furthermore, we present a first-of-its-kind NER dataset, composed\nof 54,808 named entities, designed for DLT and ESG-related explorations.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:42:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hernandez","Walter",""],["Tylinski","Kamil",""],["Moore","Alastair",""],["Roche","Niall",""],["Vadgama","Nikhil",""],["Treiblmaier","Horst",""],["Shangguan","Jiangbo",""],["Tasca","Paolo",""],["Xu","Jiahua",""]]}
{"id":"2308.12421","submitter":"Hajime Otsuka","authors":"Keiya Ishiguro, Takafumi Kai, Satsuki Nishimura, Hajime Otsuka, Maki\n  Takeuchi","title":"Upper bound on the Atiyah-Singer index from tadpole cancellation","comments":"23 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"KEK-TH-2542, KYUSHU-HET-267, KOBE-TH-23-04","categories":"hep-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose an upper bound on the Atiyah-Singer index in the effective action\nof the string theory. For $E_8\\times E_8^\\prime$ and $SO(32)$ heterotic string\ntheories on smooth Calabi-Yau threefolds with line bundles, we find that the\ntadpole cancellation condition leads to the upper bound on the generation\nnumber of quarks and leptons as well as Higgs doublets. By taking into account\nthe observed value of four-dimensional gauge couplings and the supergravity\napproximation, we explicitly evaluate the bound on complete intersection\nCalabi-Yau threefolds. The bound can be extended to Calabi-Yau threefolds in\nthe Kreuzer-Skarke database. We also put the upper bound on the Atiyah-Singer\nindex in Type IIB/F-theory compactifications.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:45:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ishiguro","Keiya",""],["Kai","Takafumi",""],["Nishimura","Satsuki",""],["Otsuka","Hajime",""],["Takeuchi","Maki",""]]}
{"id":"2308.12422","submitter":"Francesco Coppini","authors":"F. Coppini (1 and 2), P. G. Grinevich (3) and P. M. Santini (1 and 2)\n  ((1) Universit\\`a di Roma 'La Sapienza', (2) Istituto Nazionale di Fisica\n  Nucleare (INFN), Sezione di Roma, (3) Steklov Mathematical Institute of\n  Russian Academy of Sciences, Moscow, Russia)","title":"The periodic N breather anomalous wave solution of the Davey-Stewartson\n  equations; first appearance, recurrence, and blow up properties","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integrable focusing Davey-Stewarson (DS) equations, multidimensional\ngeneralizations of the focusing cubic nonlinear Schr\\\"odinger (NLS) equation,\nprovide ideal mathematical models for describing analytically the dynamics of\n2+1 dimensional anomalous (rogue) waves (AWs). In this paper i) we construct\nthe $N$-breather AW solution of Akhmediev type of the DS1 and DS2 equations,\ndescribing the nonlinear interaction of $N$ unstable modes over the constant\nbackground solution. ii) For the simplest multidimensional solution of DS2 we\nconstruct its limiting subcases, and we identify the constraint on its\narbitrary parameters giving rise to blow up at finite time. iii) We use matched\nasymptotic expansions to describe the relevance of the constructed AW solutions\nin the doubly periodic Cauchy problem for small initial perturbations of the\nbackground, in the case of one and two unstable modes. We also show, in the\ncase of two unstable modes, that no blow up takes place generically, although\nthe AW amplitude can be arbitrarily large. All the results are expressed in\nterms of elementary functions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:52:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Coppini","F.","","1 and 2"],["Grinevich","P. G.","","1 and 2"],["Santini","P. M.","","1 and 2"]]}
{"id":"2308.12423","submitter":"Davide Venturelli","authors":"Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall, Mark Hodson,\n  Maxime Dupont, Bram Evert, James Sud, M. Sohaib Alam, Zhihui Wang, Stephen\n  Jeffrey, Bhuvanesh Sundar, P. Aaron Lott, Shon Grabbe, Eleanor G. Rieffel,\n  Matthew J. Reagor and Davide Venturelli","title":"Design and execution of quantum circuits using tens of superconducting\n  qubits and thousands of gates for dense Ising optimization problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a hardware-efficient ansatz for variational optimization, derived\nfrom existing ansatze in the literature, that parametrizes subsets of all\ninteractions in the Cost Hamiltonian in each layer. We treat gate orderings as\na variational parameter and observe that doing so can provide significant\nperformance boosts in experiments. We carried out experimental runs of a\ncompilation-optimized implementation of fully-connected Sherrington-Kirkpatrick\nHamiltonians on a 50-qubit linear-chain subsystem of Rigetti Aspen-M-3 transmon\nprocessor. Our results indicate that, for the best circuit designs tested, the\naverage performance at optimized angles and gate orderings increases with\ncircuit depth (using more parameters), despite the presence of a high level of\nnoise. We report performance significantly better than using a random guess\noracle for circuits involving up to approx 5000 two-qubit and approx 5000\none-qubit native gates. We additionally discuss various takeaways of our\nresults toward more effective utilization of current and future quantum\nprocessors for optimization.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 02:36:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maciejewski","Filip B.",""],["Hadfield","Stuart",""],["Hall","Benjamin",""],["Hodson","Mark",""],["Dupont","Maxime",""],["Evert","Bram",""],["Sud","James",""],["Alam","M. Sohaib",""],["Wang","Zhihui",""],["Jeffrey","Stephen",""],["Sundar","Bhuvanesh",""],["Lott","P. Aaron",""],["Grabbe","Shon",""],["Rieffel","Eleanor G.",""],["Reagor","Matthew J.",""],["Venturelli","Davide",""]]}
{"id":"2308.12424","submitter":"Yan-Ke Chen","authors":"Yan-Ke Chen, Lu Meng, Zi-Yang Lin, Shi-Lin Zhu","title":"Virtual states in the coupled-channel problems with an improved complex\n  scaling method","comments":"12 pages, 14 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat nucl-th physics.atom-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We improve the complex scaling method (CSM) to obtain the virtual states,\nwhich were previously challenging in the conventional CSM. Our approach solves\nthe Schr\\\"odinger equation in the momentum space as an eigenvalue problem by\nchoosing the flexible contours. It proves to be highly effective in identifying\nthe poles across the different Riemann sheets in the multi-channel scatterings.\nIt is more straightforward and efficient than searching for the zeros of the\nFredholm determinant of the Lippmann-Schwinger equation using the root-finding\nalgorithms. This advancement significantly extends the capabilities of the CSM\nin accurately characterizing the resonances and virtual states in quantum\nsystems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:02:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Yan-Ke",""],["Meng","Lu",""],["Lin","Zi-Yang",""],["Zhu","Shi-Lin",""]]}
{"id":"2308.12425","submitter":"Angela Capel","authors":"Andreas Bluhm, Angela Capel, Paul Gondolf and Tim M\\\"obus","title":"Unified framework for continuity of sandwiched R\\'enyi divergences","comments":"44 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT math-ph math.IT math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we prove uniform continuity bounds for entropic quantities\nrelated to the sandwiched R\\'enyi divergences such as the sandwiched R\\'enyi\nconditional entropy. We follow three different approaches: The first one is the\naxiomatic approach, which exploits the sub-/ superadditivity and joint\nconcavity/ convexity of the exponential of the divergence. In our second\napproach, termed the \"operator space approach\", we express the entropic\nmeasures as norms and utilize their properties for establishing the bounds.\nThese norms draw inspiration from interpolation space norms. We not only\ndemonstrate the norm properties solely relying on matrix analysis tools but\nalso extend their applicability to a context that holds relevance in resource\ntheories. By this, we extend the strategies of Marwah and Dupuis as well as\nBeigi and Goodarzi employed in the sandwiched R\\'enyi conditional entropy\ncontext. Finally, we merge the approaches into a mixed approach that has some\nadvantageous properties and then discuss in which regimes each bound performs\nbest. Our results improve over the previous best continuity bounds or sometimes\neven give the first continuity bounds available. In a separate contribution, we\nuse the ALAAF method, developed in a previous article by some of the authors,\nto study the stability of approximate quantum Markov chains.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:09:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bluhm","Andreas",""],["Capel","Angela",""],["Gondolf","Paul",""],["M\u00f6bus","Tim",""]]}
{"id":"2308.12426","submitter":"Max Uetrecht","authors":"Max Uetrecht and Igor F. Herbut and Emmanuel Stamou and Michael M.\n  Scherer","title":"Absence of SO(4) quantum criticality in Dirac semimetals at two-loop\n  order","comments":"13 pages, 6 figures, 2 tables","journal-ref":null,"doi":null,"report-no":"DO-TH 23/13","categories":"cond-mat.str-el cond-mat.stat-mech hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Evidence for relativistic quantum criticality of antiferromagnetism and\nsuperconductivity in two-dimensional Dirac fermion systems has been found in\nlarge-scale quantum Monte Carlo simulations. However, the corresponding\n($2+1$)-dimensional Gross--Neveu--Yukawa field theory with $N_f=2$\nfour-component Dirac fermions coupled to two triplets of order parameters does\nnot exhibit a renormalization group fixed point at one-loop order. Instead, the\ntheory only features a critical point for a large or very small fractional\nnumber of fermion flavors $N_f$, which disappears for a broad range of flavor\nnumbers around the physical case, $N_f=2$, due to fixed-point annihilation.\nThis raises the question on how to explain the observed scaling collapse in the\nquantum Monte Carlo data. Here, we extend previous renormalization-group\nanalyses by studying a generalized model at two-loop order in $4-\\epsilon$\nspacetime dimensions. We determine the $\\epsilon$ correction to the upper and\nlower critical flavor numbers for the fixed-point annihilation and find that\nthey both go towards the physical case $N_f=2$. However, this only happens very\nslowly, such that an extrapolation to $\\epsilon=1$ still suggests the absence\nof criticality in $2+1$ dimensions. Thereby, we consolidate the finding that\nthe continuum field theory does not feature a stable renormalization-group\nfixed point and no true quantum criticality would be expected for the\nconsidered system. We briefly discuss a possible reconciliation in terms of a\ncomplex conformal field theory. Further, we also explore the fixed-point\nstructure in an enlarged theory space and identify a candidate stable\nfixed-point solution.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:09:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Uetrecht","Max",""],["Herbut","Igor F.",""],["Stamou","Emmanuel",""],["Scherer","Michael M.",""]]}
{"id":"2308.12427","submitter":"Junichiro Kono","authors":"Fuyang Tay, Ali Mojibpour, Stephen Sanders, Shuang Liang, Hongjing Xu,\n  Geoff C. Gardner, Andrey Baydin, Michael J. Manfra, Alessandro Alabastri,\n  David Hagenm\\\"uller, Junichiro Kono","title":"Ultrastrong photon-photon coupling","comments":"32 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Correlations between photons are a key feature of nonclassical states of\nlight. Recent studies suggest that the ground state of a cavity quantum\nelectrodynamics system can have light-matter correlations in the form of a\nsqueezed vacuum state in thermal equilibrium when the matter ultrastrongly\ncouples with cavity photons. This raises a question whether different photonic\nmodes can also be correlated in the ground state via ultrastrong light-matter\ncoupling. Here we demonstrate ultrastrong coupling between photonic modes of a\nmulti-mode three-dimensional terahertz photonic-crystal cavity that is mediated\nby their simultaneous ultrastrong coupling with the cyclotron resonance of a\ntwo-dimensional electron gas in GaAs. Terahertz spectroscopy measurements of\nLandau polaritons showed excellent agreement with our calculations based on a\nmicroscopic quantum model. Despite the lack of nonlinearity in the matter\nsystem, the model shows significant correlations between the photonic modes in\nthe ground state of the system, which can be controlled by changing the matter\nand photon frequencies and the spatial overlap of their mode profiles. We\npropose a detuning-independent figure of merit to quantify all possible\ncouplings in multi-mode systems. These findings pave the way for creating\nmulti-mode nonclassical states and exploring the many-body regime of quantum\noptics with vacuum fields.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:14:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tay","Fuyang",""],["Mojibpour","Ali",""],["Sanders","Stephen",""],["Liang","Shuang",""],["Xu","Hongjing",""],["Gardner","Geoff C.",""],["Baydin","Andrey",""],["Manfra","Michael J.",""],["Alabastri","Alessandro",""],["Hagenm\u00fcller","David",""],["Kono","Junichiro",""]]}
{"id":"2308.12428","submitter":"Tom Hutchcroft","authors":"Philip Easo and Tom Hutchcroft","title":"Uniform finite presentation for groups of polynomial growth","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove a quantitative refinement of the statement that groups of polynomial\ngrowth are finitely presented. Let $G$ be a group with finite generating set\n$S$ and let $\\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in\nthe associated Cayley graph. For each $k \\geq 0$, let $R_k$ be the set of words\nof length at most $2^k$ in the free group $F_S$ that are equal to the identity\nin $G$, and let $\\langle \\langle R_k \\rangle\\rangle$ be the normal subgroup of\n$F_S$ generated by $R_k$, so that the quotient map $F_S/\\langle\\langle\nR_k\\rangle\\rangle \\to G$ induces a covering map of the associated Cayley graphs\nthat has injectivity radius at least $2^{k-1}-1$. Given a non-negative integer\n$k$, we say that $(G,S)$ has a new relation on scale k if $\\langle\\langle\nR_{k+1} \\rangle\\rangle \\neq \\langle\\langle R_{k} \\rangle\\rangle$. We prove that\nfor each $K<\\infty$ there exist constants $n_0$ and $C$ depending only on $K$\nand $|S|$ such that if $\\operatorname{Gr}(3n)\\leq K \\operatorname{Gr}(n)$ for\nsome $n\\geq n_0$, then there exist at most $C$ scales $k\\geq \\log_2 (n)$ on\nwhich $G$ has a new relation. We apply this result in a forthcoming paper as\npart of our proof of Schramm's locality conjecture in percolation theory.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:19:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Easo","Philip",""],["Hutchcroft","Tom",""]]}
{"id":"2308.12429","submitter":"Anirban Chaudhuri","authors":"Anirban Chaudhuri, Graham Pash, David A. Hormuth II, Guillermo\n  Lorenzo, Michael Kapteyn, Chengyue Wu, Ernesto A. B. F. Lima, Thomas E.\n  Yankeelov, Karen Willcox","title":"Predictive Digital Twin for Optimizing Patient-Specific Radiotherapy\n  Regimens under Uncertainty in High-Grade Gliomas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE math.OC math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop a methodology to create data-driven predictive digital twins for\noptimal risk-aware clinical decision-making. We illustrate the methodology as\nan enabler for an anticipatory personalized treatment that accounts for\nuncertainties in the underlying tumor biology in high-grade gliomas, where\nheterogeneity in the response to standard-of-care (SOC) radiotherapy\ncontributes to sub-optimal patient outcomes. The digital twin is initialized\nthrough prior distributions derived from population-level clinical data in the\nliterature for a mechanistic model's parameters. Then the digital twin is\npersonalized using Bayesian model calibration for assimilating patient-specific\nmagnetic resonance imaging data and used to propose optimal radiotherapy\ntreatment regimens by solving a multi-objective risk-based optimization under\nuncertainty problem. The solution leads to a suite of patient-specific optimal\nradiotherapy treatment regimens exhibiting varying levels of trade-off between\nthe two competing clinical objectives: (i) maximizing tumor control\n(characterized by minimizing the risk of tumor volume growth) and (ii)\nminimizing the toxicity from radiotherapy. The proposed digital twin framework\nis illustrated by generating an in silico cohort of 100 patients with\nhigh-grade glioma growth and response properties typically observed in the\nliterature. For the same total radiation dose as the SOC, the personalized\ntreatment regimens lead to median increase in tumor time to progression of\naround six days. Alternatively, for the same level of tumor control as the SOC,\nthe digital twin provides optimal treatment options that lead to a median\nreduction in radiation dose by 16.7% (10 Gy) compared to SOC total dose of 60\nGy. The range of optimal solutions also provide options with increased doses\nfor patients with aggressive cancer, where SOC does not lead to sufficient\ntumor control.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:22:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chaudhuri","Anirban",""],["Pash","Graham",""],["Hormuth","David A.","II"],["Lorenzo","Guillermo",""],["Kapteyn","Michael",""],["Wu","Chengyue",""],["Lima","Ernesto A. B. F.",""],["Yankeelov","Thomas E.",""],["Willcox","Karen",""]]}
{"id":"2308.12430","submitter":"Jo Kurian","authors":"Jo S. Kurian, Hong-Zhou Ye, Ankit Mahajan, Timothy C. Berkelbach, and\n  Sandeep Sharma","title":"Toward linear scaling auxiliary field quantum Monte Carlo with local\n  natural orbitals","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a local correlation variant of auxiliary field quantum Monte Carlo\n(AFQMC) that is based on local natural orbitals (LNO-AFQMC). In LNO-AFQMC,\nindependent AFQMC calculations are performed for each localized occupied\norbital using a truncated set of tailored orbitals. Because the size of this\nspace does not grow with system size for a target accuracy, the method has\nlinear scaling. Applying LNO AFQMC to molecular problems containing a few\nhundred to a thousand orbitals, we demonstrate convergence of total energies\nwith significantly reduced costs. The savings are more significant for larger\nsystems and larger basis sets. However, even for our smallest system studied,\nwe find that LNO-AFQMC is cheaper than canonical AFQMC, in contrast with many\nother reduced-scaling methods. Perhaps most significantly, we show that energy\ndifferences converge much more quickly than total energies, making the method\nideal for applications in chemistry and material science. Our work paves the\nway for linear scaling AFQMC calculations of strongly correlated systems, which\nwould have a transformative effect on ab initio quantum chemistry.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:26:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kurian","Jo S.",""],["Ye","Hong-Zhou",""],["Mahajan","Ankit",""],["Berkelbach","Timothy C.",""],["Sharma","Sandeep",""]]}
{"id":"2308.12431","submitter":"Ahmad Abubakar Mr","authors":"Ahmad Abubakar, Ruqqayya Alhammadi, Yahya Zweiri, Lakmal Seneviratne","title":"Advance Simulation Method for Wheel-Terrain Interactions of Space\n  Rovers: A Case Study on the UAE Rashid Rover","comments":"Submitted to ICAR2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A thorough analysis of wheel-terrain interaction is critical to ensure the\nsafe and efficient operation of space rovers on extraterrestrial surfaces like\nthe Moon or Mars. This paper presents an approach for developing and\nexperimentally validating a virtual wheel-terrain interaction model for the UAE\nRashid rover. The model aims to improve the fidelity and capability of current\nsimulation methods for space rovers and facilitate the design, evaluation, and\ncontrol of their locomotion systems. The proposed method considers various\nfactors, such as wheel grouser properties, wheel slippage, loose soil\nproperties, and interaction mechanics. The model accuracy was validated through\nexperiments on a Test-rig testbed that simulated lunar soil conditions. In\nspecific, a set of experiments was carried out to test the behaviors acted on a\nGrouser-Rashid rover wheel by the lunar soil with different slip ratios of 0,\n0.25, 0.50, and 0.75. The obtained results demonstrate that the proposed\nsimulation method provides a more accurate and realistic simulation of the\nwheel-terrain interaction behavior and provides insight into the overall\nperformance of the rover\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:30:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Abubakar","Ahmad",""],["Alhammadi","Ruqqayya",""],["Zweiri","Yahya",""],["Seneviratne","Lakmal",""]]}
{"id":"2308.12432","submitter":"Evan Lewis","authors":"Evan F. Lewis, Sarah Burke-Spolaor, Maura McLaughlin, Duncan Lorimer,\n  Kshitij Aggarwal, Devansh Agarwal, Joseph Kania, Nate Garver-Daniels, Joseph\n  P. Glaser","title":"The Petabyte Project","comments":"5 pages, 1 figure. Accepted for publication in Proceedings for IAU\n  Symposium 369: The Dawn of Cosmology & Multi-Messenger Studies with Fast\n  Radio Bursts","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transient radio sources, such as fast radio bursts, intermittent pulsars, and\nrotating radio transients, can offer a wealth of information regarding extreme\nemission physics as well as the intervening interstellar and/or intergalactic\nmedium. Vital steps towards understanding these objects include characterizing\ntheir source populations and estimating their event rates across observing\nfrequencies. However, previous efforts have been undertaken mostly by\nindividual survey teams at disparate observing frequencies and telescopes, and\nwith non-uniform algorithms for searching and characterization. The Petabyte\nProject (TPP) aims to address these issues by uniformly reprocessing data from\nseveral petabytes of radio transient surveys covering two decades of observing\nfrequency (300 MHz-20 GHz). The TPP will provide robust event rate analyses,\nin-depth assessment of survey and pipeline completeness, as well as revealing\ndiscoveries from archival and ongoing radio surveys. We present an overview of\nTPP's processing pipeline, scope, and our potential to make new discoveries.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:31:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lewis","Evan F.",""],["Burke-Spolaor","Sarah",""],["McLaughlin","Maura",""],["Lorimer","Duncan",""],["Aggarwal","Kshitij",""],["Agarwal","Devansh",""],["Kania","Joseph",""],["Garver-Daniels","Nate",""],["Glaser","Joseph P.",""]]}
{"id":"2308.12433","submitter":"Pan He","authors":"Xiao Li, Pan He, Aotian Wu, Sanjay Ranka, Anand Rangarajan","title":"A Spatiotemporal Correspondence Approach to Unsupervised LiDAR\n  Segmentation with Traffic Applications","comments":"Accepted for publication in IEEE International Conference on\n  Intelligent Transportation Systems (ITSC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address the problem of unsupervised semantic segmentation of outdoor LiDAR\npoint clouds in diverse traffic scenarios. The key idea is to leverage the\nspatiotemporal nature of a dynamic point cloud sequence and introduce\ndrastically stronger augmentation by establishing spatiotemporal\ncorrespondences across multiple frames. We dovetail clustering and pseudo-label\nlearning in this work. Essentially, we alternate between clustering points into\nsemantic groups and optimizing models using point-wise pseudo-spatiotemporal\nlabels with a simple learning objective. Therefore, our method can learn\ndiscriminative features in an unsupervised learning fashion. We show promising\nsegmentation performance on Semantic-KITTI, SemanticPOSS, and FLORIDA benchmark\ndatasets covering scenarios in autonomous vehicle and intersection\ninfrastructure, which is competitive when compared against many existing fully\nsupervised learning methods. This general framework can lead to a unified\nrepresentation learning approach for LiDAR point clouds incorporating domain\nknowledge.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:32:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Xiao",""],["He","Pan",""],["Wu","Aotian",""],["Ranka","Sanjay",""],["Rangarajan","Anand",""]]}
{"id":"2308.12434","submitter":"Alejandro Mendoza-Coto","authors":"Matheus Grossklags, Matteo Ciardi, Vinicius Zampronio, Fabio Cinti,\n  Alejandro Mendoza-Coto","title":"Self-induced Bose glass phase in quantum cluster quasicrystals","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.mes-hall cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the emergence of Bose glass phases in self sustained bosonic\nquasicrystals induced by a pair interaction between particles of\nLifshitz-Petrich type. By using a mean field variational method designed in\nmomentum space as well as Gross-Pitaevskii simulations we determine the phase\ndiagram of the model. The study of the local and global superfluid fraction\nallows the identification of supersolid, super quasicrystal, Bose glass and\ninsulating phases. The Bose glass phase emerges as a quasicrystal phase in\nwhich the global superfluidity is essentially zero, while the local\nsuperfluidity remains finite in certain ring structures of the quasicrystalline\npattern. Furthermore, we perform continuous space Path Integral Monte Carlo\nsimulations for a case in which the interaction between particles stabilizes a\nquasicrystal phase. Our results show that as the strength of the interaction\nbetween particles is increased the system undergoes a sequence of states\nconsistent with the super quasicrystal, Bose glass, and quasicrystal insulator\nthermodynamic phases.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:32:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Grossklags","Matheus",""],["Ciardi","Matteo",""],["Zampronio","Vinicius",""],["Cinti","Fabio",""],["Mendoza-Coto","Alejandro",""]]}
{"id":"2308.12435","submitter":"Sushrut Thorat","authors":"Sushrut Thorat, Adrien Doerig, Tim C. Kietzmann","title":"Characterising representation dynamics in recurrent neural networks for\n  object recognition","comments":"8 pages, 6 figures; revision of our Conference on Cognitive\n  Computational Neuroscience (CCN) 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recurrent neural networks (RNNs) have yielded promising results for both\nrecognizing objects in challenging conditions and modeling aspects of primate\nvision. However, the representational dynamics of recurrent computations remain\npoorly understood, especially in large-scale visual models. Here, we studied\nsuch dynamics in RNNs trained for object classification on MiniEcoset, a novel\nsubset of ecoset. We report two main insights. First, upon inference,\nrepresentations continued to evolve after correct classification, suggesting a\nlack of the notion of being ``done with classification''. Second, focusing on\n``readout zones'' as a way to characterize the activation trajectories, we\nobserve that misclassified representations exhibit activation patterns with\nlower L2 norm, and are positioned more peripherally in the readout zones. Such\narrangements help the misclassified representations move into the correct zones\nas time progresses. Our findings generalize to networks with lateral and\ntop-down connections, and include both additive and multiplicative interactions\nwith the bottom-up sweep. The results therefore contribute to a general\nunderstanding of RNN dynamics in naturalistic tasks. We hope that the analysis\nframework will aid future investigations of other types of RNNs, including\nunderstanding of representational dynamics in primate vision.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:36:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Thorat","Sushrut",""],["Doerig","Adrien",""],["Kietzmann","Tim C.",""]]}
{"id":"2308.12436","submitter":"Robert Beverly","authors":"Robert Beverly","title":"IP Neo-colonialism: Geo-auditing RIR Address Registrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Allocation of the global IP address space is under the purview of IANA, who\ndistributes management responsibility among five geographically distinct\nRegional Internet Registries (RIRs). Each RIR is empowered to bridge technical\n(e.g., address uniqueness and aggregatability) and policy (e.g., contact\ninformation and IP scarcity) requirements unique to their region. While\ndifferent RIRs have different policies for out-of-region address use, little\nprior systematic analysis has studied where addresses are used post-allocation.\n  In this preliminary work, we e IPv4 prefix registrations across the five RIRs\n(50k total prefixes) and utilize the Atlas distributed active measurement\ninfrastructure to geolocate prefixes at RIR-region granularity. We define a\ntaxonomy of registration ``geo-consistency'' by comparing a prefixes' inferred\nphysical location to the allocating RIR's coverage region as well as the\nregistered organization's location. We then apply this methodology and taxonomy\nto audit the geo-consistency of 10k random IPv4 prefix allocations within each\nRIR (50k total prefixes). While we find registry information to largely be\nconsistent with our geolocation inferences, we show that some RIRs have a\nnon-trivial fraction of prefixes that are used both outside of the RIR's region\nand outside of the registered organization's region. A better understanding of\nsuch discrepancies can increase transparency for the community and inform\nongoing discussions over in-region address use and policy.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:41:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Beverly","Robert",""]]}
{"id":"2308.12437","submitter":"Steven Rieck","authors":"Steven Rieck, Alexander W. Criswell, Valeriya Korol, Michael A. Keim,\n  Malachy Bloom, Vuk Mandic","title":"LISA Detectability of a Stochastic Gravitational Wave Background from\n  Unresolved White Dwarf Binaries in the LMC","comments":"7 pages, 3 figures. To be submitted for publication to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Laser Interferometer Space Antenna (LISA) is expected to detect a wide\nvariety of gravitational wave sources in the mHz band. Some of these signals\nwill elude individual detection, instead contributing as confusion noise to one\nof several stochastic gravitational-wave backgrounds (SGWBs) -- notably\nincluding the `Galactic foreground', a loud signal resulting from the\nsuperposition of millions of unresolved double white dwarf binaries (DWDs) in\nthe Milky Way. It is possible that similar, weaker SGWBs will be detectable\nfrom other DWD populations in the local universe, including the Large\nMagellanic Cloud (LMC). We use the Bayesian LISA Inference Package\n($\\tt{BLIP}$) to evaluate the detectability by LISA of an anisotropic SGWB\ngenerated by unresolved DWDs in the LMC. To do so, we simulate the LMC SGWB\nfrom a realistic DWD population generated via binary population synthesis,\nsimulate four years of time-domain data with $\\tt{BLIP}$ comprised of\nstochastic contributions from the LMC SGWB and the LISA detector noise, and\nanalyze this data with $\\tt{BLIP}$'s spherical harmonic anisotropic SGWB\nsearch. We present results of this analysis and show that the SGWB from DWDs in\nthe LMC is potentially detectable by LISA.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:41:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rieck","Steven",""],["Criswell","Alexander W.",""],["Korol","Valeriya",""],["Keim","Michael A.",""],["Bloom","Malachy",""],["Mandic","Vuk",""]]}
{"id":"2308.12438","submitter":"Ahmed Haj Yahmed","authors":"Ahmed Haj Yahmed, Altaf Allah Abbassi, Amin Nikanjam, Heng Li, Foutse\n  Khomh","title":"Deploying Deep Reinforcement Learning Systems: A Taxonomy of Challenges","comments":"Accepted for publication in The International Conference on Software\n  Maintenance and Evolution (ICSME 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep reinforcement learning (DRL), leveraging Deep Learning (DL) in\nreinforcement learning, has shown significant potential in achieving\nhuman-level autonomy in a wide range of domains, including robotics, computer\nvision, and computer games. This potential justifies the enthusiasm and growing\ninterest in DRL in both academia and industry. However, the community currently\nfocuses mostly on the development phase of DRL systems, with little attention\ndevoted to DRL deployment. In this paper, we propose an empirical study on\nStack Overflow (SO), the most popular Q&A forum for developers, to uncover and\nunderstand the challenges practitioners faced when deploying DRL systems.\nSpecifically, we categorized relevant SO posts by deployment platforms:\nserver/cloud, mobile/embedded system, browser, and game engine. After filtering\nand manual analysis, we examined 357 SO posts about DRL deployment,\ninvestigated the current state, and identified the challenges related to\ndeploying DRL systems. Then, we investigate the prevalence and difficulty of\nthese challenges. Results show that the general interest in DRL deployment is\ngrowing, confirming the study's relevance and importance. Results also show\nthat DRL deployment is more difficult than other DRL issues. Additionally, we\nbuilt a taxonomy of 31 unique challenges in deploying DRL to different\nplatforms. On all platforms, RL environment-related challenges are the most\npopular, and communication-related challenges are the most difficult among\npractitioners. We hope our study inspires future research and helps the\ncommunity overcome the most common and difficult challenges practitioners face\nwhen deploying DRL systems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:44:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yahmed","Ahmed Haj",""],["Abbassi","Altaf Allah",""],["Nikanjam","Amin",""],["Li","Heng",""],["Khomh","Foutse",""]]}
{"id":"2308.12439","submitter":"Tinghao Xie","authors":"Tinghao Xie, Xiangyu Qi, Ping He, Yiming Li, Jiachen T. Wang, Prateek\n  Mittal","title":"BaDExpert: Extracting Backdoor Functionality for Accurate Backdoor Input\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel defense, against backdoor attacks on Deep Neural Networks\n(DNNs), wherein adversaries covertly implant malicious behaviors (backdoors)\ninto DNNs. Our defense falls within the category of post-development defenses\nthat operate independently of how the model was generated. The proposed defense\nis built upon a novel reverse engineering approach that can directly extract\nbackdoor functionality of a given backdoored model to a backdoor expert model.\nThe approach is straightforward -- finetuning the backdoored model over a small\nset of intentionally mislabeled clean samples, such that it unlearns the normal\nfunctionality while still preserving the backdoor functionality, and thus\nresulting in a model (dubbed a backdoor expert model) that can only recognize\nbackdoor inputs. Based on the extracted backdoor expert model, we show the\nfeasibility of devising highly accurate backdoor input detectors that filter\nout the backdoor inputs during model inference. Further augmented by an\nensemble strategy with a finetuned auxiliary model, our defense, BaDExpert\n(Backdoor Input Detection with Backdoor Expert), effectively mitigates 16 SOTA\nbackdoor attacks while minimally impacting clean utility. The effectiveness of\nBaDExpert has been verified on multiple datasets (CIFAR10, GTSRB and ImageNet)\nacross various model architectures (ResNet, VGG, MobileNetV2 and Vision\nTransformer).\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:47:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xie","Tinghao",""],["Qi","Xiangyu",""],["He","Ping",""],["Li","Yiming",""],["Wang","Jiachen T.",""],["Mittal","Prateek",""]]}
{"id":"2308.12440","submitter":"Jiong Wu","authors":"Jiong Wu and Yong Fan","title":"HNAS-reg: hierarchical neural architecture search for deformable medical\n  image registration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convolutional neural networks (CNNs) have been widely used to build deep\nlearning models for medical image registration, but manually designed network\narchitectures are not necessarily optimal. This paper presents a hierarchical\nNAS framework (HNAS-Reg), consisting of both convolutional operation search and\nnetwork topology search, to identify the optimal network architecture for\ndeformable medical image registration. To mitigate the computational overhead\nand memory constraints, a partial channel strategy is utilized without losing\noptimization quality. Experiments on three datasets, consisting of 636\nT1-weighted magnetic resonance images (MRIs), have demonstrated that the\nproposal method can build a deep learning model with improved image\nregistration accuracy and reduced model size, compared with state-of-the-art\nimage registration approaches, including one representative traditional\napproach and two unsupervised learning-based approaches.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:47:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wu","Jiong",""],["Fan","Yong",""]]}
{"id":"2308.12441","submitter":"Imran Mirza Dr.","authors":"Logan Patrick, Umar Arshad, Dingyu Guo, and Imran M. Mirza","title":"Chirality-assisted enhancement of tripartite entanglement in waveguide\n  QED","comments":"14 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the generation and control of genuine tripartite entanglement among\nquantum emitters (QEs) that are side coupled to one-dimensional spin-momentum\nlocked (or chiral) waveguides. By applying the machinery of Fock state master\nequations along with the recently proposed concurrence fill measure of\ntripartite entanglement [S. Xie and J. H. Eberly, Phys. Rev. Lett. 127, 040403\n(2021)], we analyze how three-photon Gaussian wavepackets can distribute\nentanglement among two and three QEs. We show that with a five times larger\nwaveguide decay rate in the right direction as compared to the left direction,\nthe maximum value of tripartite entanglement can be elevated by 35% as compared\nto the symmetric scenario where both left and right direction decay rates are\nequal. Additionally, chirality can maintain the tripartite entanglement for\nlonger times in comparison to the corresponding symmetric decay rate situation.\nFinally, we study the influence of detunings and spontaneous emission on the\nresulting entanglement. We envision quantum networking and long-distance\nquantum communication as two main areas of applications of this work.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:48:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Patrick","Logan",""],["Arshad","Umar",""],["Guo","Dingyu",""],["Mirza","Imran M.",""]]}
{"id":"2308.12442","submitter":"Jacob Neal","authors":"Jacob Neal, Anton Burtsev, Jean Helder Marques Ribeiro, Kunihiko\n  Taira, Vassilios Theofilis, Michael Amitay","title":"Similarities in Massive Separation Across Reynolds Numbers for Swept and\n  Tapered Finite Span Wings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Experimental investigations were performed to elucidate the features of flow\nfields occurring over cantilevered finite-aspect ratio NACA 0015 wings at high\nangles of attack with various sweep angles and taper ratios. Volumetric\nStereoscopic Particle Image Velocimetry experiments were performed at mean\nchord based Reynolds number of 247,500 in a wind tunnel and 600 in a water\ntunnel. Direct Numerical Simulations (DNS) of the water tunnel test section,\nincluding the cantilevered model, were also performed at the lower Reynolds\nnumber. The low Reynolds number experiments, low Reynolds number simulations,\nand high Reynolds number experiments all showed that sweeping the leading edge\nback shifted the largest portion of the reversed flow towards the wingtip while\nsweeping the trailing edge forward shifted the reversed flow towards the wing\nroot. A detailed parametric sweep of planform geometry systematically varied\nthe leading and trailing edge sweep angles and taper ratios of the finite\nwings. It was found that the large scale vortical structures resulting from\nvarying these parameters at the two Reynolds numbers share surprisingly many\nthree-dimensional topological features, despite the orders of magnitude\ndifferent Reynolds numbers.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:49:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Neal","Jacob",""],["Burtsev","Anton",""],["Ribeiro","Jean Helder Marques",""],["Taira","Kunihiko",""],["Theofilis","Vassilios",""],["Amitay","Michael",""]]}
{"id":"2308.12443","submitter":"Nicha Dvornek","authors":"Xueqi Guo, Luyao Shi, Xiongchao Chen, Bo Zhou, Qiong Liu, Huidong Xie,\n  Yi-Hwa Liu, Richard Palyo, Edward J. Miller, Albert J. Sinusas, Bruce\n  Spottiswoode, Chi Liu, Nicha C. Dvornek","title":"TAI-GAN: Temporally and Anatomically Informed GAN for early-to-late\n  frame conversion in dynamic cardiac PET motion correction","comments":"Accepted by Simulation and Synthesis in Medical Imaging (SASHIMI\n  2023, MICCAI workshop), preprint version","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid tracer kinetics of rubidium-82 ($^{82}$Rb) and high variation of\ncross-frame distribution in dynamic cardiac positron emission tomography (PET)\nraise significant challenges for inter-frame motion correction, particularly\nfor the early frames where conventional intensity-based image registration\ntechniques are not applicable. Alternatively, a promising approach utilizes\ngenerative methods to handle the tracer distribution changes to assist existing\nregistration methods. To improve frame-wise registration and parametric\nquantification, we propose a Temporally and Anatomically Informed Generative\nAdversarial Network (TAI-GAN) to transform the early frames into the late\nreference frame using an all-to-one mapping. Specifically, a feature-wise\nlinear modulation layer encodes channel-wise parameters generated from temporal\ntracer kinetics information, and rough cardiac segmentations with local shifts\nserve as the anatomical information. We validated our proposed method on a\nclinical $^{82}$Rb PET dataset and found that our TAI-GAN can produce converted\nearly frames with high image quality, comparable to the real reference frames.\nAfter TAI-GAN conversion, motion estimation accuracy and clinical myocardial\nblood flow (MBF) quantification were improved compared to using the original\nframes. Our code is published at https://github.com/gxq1998/TAI-GAN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:51:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guo","Xueqi",""],["Shi","Luyao",""],["Chen","Xiongchao",""],["Zhou","Bo",""],["Liu","Qiong",""],["Xie","Huidong",""],["Liu","Yi-Hwa",""],["Palyo","Richard",""],["Miller","Edward J.",""],["Sinusas","Albert J.",""],["Spottiswoode","Bruce",""],["Liu","Chi",""],["Dvornek","Nicha C.",""]]}
{"id":"2308.12444","submitter":"Yixin Han","authors":"Yixin Han, Jun Yu, Nan Zhang, Cheng Meng, Ping Ma, Wenxuan Zhong, and\n  Changliang Zou","title":"Leverage classifier: Another look at support vector machine","comments":"50 pages, 9 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Support vector machine (SVM) is a popular classifier known for accuracy,\nflexibility, and robustness. However, its intensive computation has hindered\nits application to large-scale datasets. In this paper, we propose a new\noptimal leverage classifier based on linear SVM under a nonseparable setting.\nOur classifier aims to select an informative subset of the training sample to\nreduce data size, enabling efficient computation while maintaining high\naccuracy. We take a novel view of SVM under the general subsampling framework\nand rigorously investigate the statistical properties. We propose a two-step\nsubsampling procedure consisting of a pilot estimation of the optimal\nsubsampling probabilities and a subsampling step to construct the classifier.\nWe develop a new Bahadur representation of the SVM coefficients and derive\nunconditional asymptotic distribution and optimal subsampling probabilities\nwithout giving the full sample. Numerical results demonstrate that our\nclassifiers outperform the existing methods in terms of estimation,\ncomputation, and prediction.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:52:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Han","Yixin",""],["Yu","Jun",""],["Zhang","Nan",""],["Meng","Cheng",""],["Ma","Ping",""],["Zhong","Wenxuan",""],["Zou","Changliang",""]]}
{"id":"2308.12445","submitter":"Ahmed Haj Yahmed","authors":"Ahmed Haj Yahmed, Rached Bouchoucha, Houssem Ben Braiek, Foutse Khomh","title":"An Intentional Forgetting-Driven Self-Healing Method For Deep\n  Reinforcement Learning Systems","comments":"Accepted for publication in The 38th IEEE/ACM International\n  Conference on Automated Software Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SE stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep reinforcement learning (DRL) is increasingly applied in large-scale\nproductions like Netflix and Facebook. As with most data-driven systems, DRL\nsystems can exhibit undesirable behaviors due to environmental drifts, which\noften occur in constantly-changing production settings. Continual Learning (CL)\nis the inherent self-healing approach for adapting the DRL agent in response to\nthe environment's conditions shifts. However, successive shifts of considerable\nmagnitude may cause the production environment to drift from its original\nstate. Recent studies have shown that these environmental drifts tend to drive\nCL into long, or even unsuccessful, healing cycles, which arise from\ninefficiencies such as catastrophic forgetting, warm-starting failure, and slow\nconvergence. In this paper, we propose Dr. DRL, an effective self-healing\napproach for DRL systems that integrates a novel mechanism of intentional\nforgetting into vanilla CL to overcome its main issues. Dr. DRL deliberately\nerases the DRL system's minor behaviors to systematically prioritize the\nadaptation of the key problem-solving skills. Using well-established DRL\nalgorithms, Dr. DRL is compared with vanilla CL on various drifted\nenvironments. Dr. DRL is able to reduce, on average, the healing time and\nfine-tuning episodes by, respectively, 18.74% and 17.72%. Dr. DRL successfully\nhelps agents to adapt to 19.63% of drifted environments left unsolved by\nvanilla CL while maintaining and even enhancing by up to 45% the obtained\nrewards for drifted environments that are resolved by both approaches.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:55:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yahmed","Ahmed Haj",""],["Bouchoucha","Rached",""],["Braiek","Houssem Ben",""],["Khomh","Foutse",""]]}
{"id":"2308.12446","submitter":"Walt Deheer","authors":"Jian Zhao, Peixun Ji, Yaqi Li, Rui Li, Kaiming Zhang, Hao Tian,\n  Kaichen Yu, Boyue Bian, Luzhen Hao, Xue Xiao, Will Griffin, Noel Dudeck,\n  Ramiro Moro, Lei Ma, Walt A. de Heer","title":"Ultra-high mobility semiconducting epitaxial graphene on silicon carbide","comments":"Text and figures + supplemental information","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Graphene nanoelectronics potential was limited by the lack of an intrinsic\nbandgap[1] and attempts to tailor a bandgap either by quantum confinement or by\nchemical functionalization failed to produce a semiconductor with a large\nenough band gap and a sufficient mobility. It is well known that by evaporating\nsilicon from commercial electronics grade silicon carbide crystals an epitaxial\ngraphene layer forms on the surfaces [2]. The first epigraphene layer to form\non the silicon terminated face, known as the buffer layer, is insulating. It is\nchemically bonded to the SiC and spectroscopic measurements [3] have identified\nsemiconducting signatures on the microscopic domains. However, the bonding to\nthe SiC is disordered and the mobilities are small. Here we demonstrate a\nquasi-equilibrium annealing method that produces macroscopic atomically flat\nterraces covered with a well ordered epigraphene buffer layer that has a 0.6 eV\nbandgap. Room temperature mobilities exceed 5000 cm2/Vs which is much larger\nthan silicon and 20 times larger than the phonon scattering imposed limit of\ncurrent 2D semiconductors. Critical for nanotechnology, its lattice is aligned\nwith the SiC substrate, it is chemically, mechanically, and thermally robust,\nand it can be conventionally patterned and seamlessly connected to semimetallic\nepigraphene making semiconducting epigraphene ideally suited for\nnanoelectronics.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:57:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhao","Jian",""],["Ji","Peixun",""],["Li","Yaqi",""],["Li","Rui",""],["Zhang","Kaiming",""],["Tian","Hao",""],["Yu","Kaichen",""],["Bian","Boyue",""],["Hao","Luzhen",""],["Xiao","Xue",""],["Griffin","Will",""],["Dudeck","Noel",""],["Moro","Ramiro",""],["Ma","Lei",""],["de Heer","Walt A.",""]]}
{"id":"2308.12447","submitter":"Mona Ahmadian","authors":"Mona Ahmadian, Frank Guerin, and Andrew Gilbert","title":"MOFO: MOtion FOcused Self-Supervision for Video Understanding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning (SSL) techniques have recently produced outstanding\nresults in learning visual representations from unlabeled videos. Despite the\nimportance of motion in supervised learning techniques for action recognition,\nSSL methods often do not explicitly consider motion information in videos. To\naddress this issue, we propose MOFO (MOtion FOcused), a novel SSL method for\nfocusing representation learning on the motion area of a video, for action\nrecognition. MOFO automatically detects motion areas in videos and uses these\nto guide the self-supervision task. We use a masked autoencoder which randomly\nmasks out a high proportion of the input sequence; we force a specified\npercentage of the inside of the motion area to be masked and the remainder from\noutside. We further incorporate motion information into the finetuning step to\nemphasise motion in the downstream task. We demonstrate that our motion-focused\ninnovations can significantly boost the performance of the currently leading\nSSL method (VideoMAE) for action recognition. Our method improves the recent\nself-supervised Vision Transformer (ViT), VideoMAE, by achieving +2.6%, +2.1%,\n+1.3% accuracy on Epic-Kitchens verb, noun and action classification,\nrespectively, and +4.7% accuracy on Something-Something V2 action\nclassification. Our proposed approach significantly improves the performance of\nthe current SSL method for action recognition, indicating the importance of\nexplicitly encoding motion in SSL.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:03:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ahmadian","Mona",""],["Guerin","Frank",""],["Gilbert","Andrew",""]]}
{"id":"2308.12448","submitter":"Polra Victor Falade","authors":"Polra Victor Falade","title":"Trend and Emerging Types of 419 Scams","comments":"Conference proceedings of Cyber Secure Nigeria","journal-ref":null,"doi":"10.22624/AIMS/CSEAN-SMART2023P13","report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Technological advancements have revolutionized various aspects of human life,\nfacilitating communication, business operations, healthcare, education, and\nenvironmental monitoring. However, this increased reliance on technology has\nalso led to a surge in cybercrime, including cyber scams. The \"419 scam\" or\nNigerian scam has been a persistent problem for decades, encompassing frauds\nlike advance fee scams, fake lotteries, and black money scams. Initially\nprevalent through postal mail and later via fax, the scam has now transitioned\nto email. This study aims to identify recent types of 419 scam emails,\nparticularly after the covid 19 pandemic, and explore commonly used email\nsubjects. Analysis of the sample 419 scam emails revealed trending scams like\nlucky winner, threat of exposure, business/partnership proposals, investment,\ncancer/long-term illness, fund, and compensation scams. Emerging scams included\nCOVID-related, cryptocurrency, marketing contact, and software development\nscams. Irrespective of the scam type, scammers commonly employed email subjects\nsuch as 'Re', 'Good day', 'Greetings', 'Dear friend', 'Confirm', 'Attention',\nand 'Hello dear'. The severity of cybercrime, especially the 419 scams, cannot\nbe overstated, as it erodes trust, causes financial losses, and hampers\nNigeria's reputation and economic progress. Combatting cyber scams and\nenhancing cybersecurity measures are crucial to protect individuals and\norganizations from falling victim to these fraudulent schemes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:10:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Falade","Polra Victor",""]]}
{"id":"2308.12449","submitter":"Matthew Siebert","authors":"Matthew R. Siebert, Lindsey A. Kwok, Joel Johansson, Saurabh W. Jha,\n  St\\'ephane Blondin, Luc Dessart, Ryan J. Foley, D. John Hillier, Conor\n  Larison, R\\\"udiger Pakmor, Tea Temim, Jennifer E. Andrews, Katie Auchettl,\n  Carles Badenes, Barnabas Barna, K. Azalee Bostroem, Max J. Brenner Newman,\n  Thomas G. Brink, Mar\\'ia Jos\\'e Bustamante-Rosell, Yssavo Camacho-Neves,\n  Alejandro Clocchiatti, David A. Coulter, Kyle W. Davis, Maxime Deckers,\n  Georgios Dimitriadis, Yize Dong, Joseph Farah, Alexei V. Filippenko, Andreas\n  Fl\\\"ors, Ori D. Fox, Peter Garnavich, Estefania Padilla Gonzalez, Or Graur,\n  Franz-Josef Hambsch, Griffin Hosseinzadeh, D. Andrew Howell, John P. Hughes,\n  Wolfgang E. Kerzendorf, Xavier K. Le Saux, Keiichi Maeda, Kate Maguire,\n  Curtis McCully, Cassidy Mihalenko, Megan Newsome, John T. O'Brien, Jeniveve\n  Pearson, Craig Pellegrino, Justin D. R. Pierel, Abigail Polin, Armin Rest,\n  C\\'esar Rojas-Bravo, David J. Sand, Michaela Schwab, Melissa Shahbandeh,\n  Manisha Shrestha, Nathan Smith, Louis-Gregory Strolger, Tam\\'as Szalai,\n  Kirsty Taggart, Giacomo Terreran, Jacco H. Terwel, Samaporn Tinyanont,\n  Stefano Valenti, J\\'ozsef Vink\\'o, J. Craig Wheeler, Yi Yang, Weikang Zheng,\n  Chris Ashall, James M. Derkacy, Llu\\'is Galbany, Peter Hoeflich, Eric Hsiao,\n  Thomas De Jaeger, Jing Lu, Justyn Maund, Kyle Medler, Nidia Morrell, Benjamin\n  J. Shappee, Maximilian Stritzinger, Nicholas Suntzeff, Michael Tucker, and\n  Lifan Wang","title":"Ground-based and JWST Observations of SN 2022pul: I. Unusual Signatures\n  of Carbon, Oxygen, and Circumstellar Interaction in a Peculiar Type Ia\n  Supernova","comments":"23 pages, 11 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nebular-phase observations of peculiar Type Ia supernovae (SNe Ia) provide\nimportant constraints on progenitor scenarios and explosion dynamics for both\nthese rare SNe and the more common, cosmologically useful SNe Ia. We present\nobservations from an extensive ground-based and space-based follow-up campaign\nto characterize SN 2022pul, a \"super-Chandrasekhar\" mass SN Ia (alternatively\n\"03fg-like\" SN), from before peak brightness to well into the nebular phase\nacross optical to mid-infrared (MIR) wavelengths. The early rise of the light\ncurve is atypical, exhibiting two distinct components, consistent with SN Ia\nejecta interacting with dense carbon-oxygen rich circumstellar material (CSM).\nIn the optical, SN 2022pul is most similar to SN 2012dn, having a low estimated\npeak luminosity ($M_{B}=-18.9$ mag) and high photospheric velocity relative to\nother 03fg-like SNe. In the nebular phase, SN 2022pul adds to the increasing\ndiversity of the 03fg-like subclass. From 168 to 336 days after peak $B$-band\nbrightness, SN 2022pul exhibits asymmetric and narrow emission from [O I]\n$\\lambda\\lambda 6300,\\ 6364$ (${\\rm FWHM} \\approx 2{,}000$ km s$^{-1}$),\nstrong, broad emission from [Ca II] $\\lambda\\lambda 7291,\\ 7323$ (${\\rm FWHM}\n\\approx 7{,}300$ km s$^{-1}$), and a rapid Fe III to Fe II ionization change.\nFinally, we present the first-ever optical-to-mid-infrared (MIR) nebular\nspectrum of an 03fg-like SN Ia using data from JWST. In the MIR, strong lines\nof neon and argon, weak emission from stable nickel, and strong thermal dust\nemission (with $T \\approx 500$ K), combined with prominent [O I] in the\noptical, suggest that SN 2022pul was produced by a white dwarf merger within\ncarbon/oxygen-rich CSM.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:12:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Siebert","Matthew R.",""],["Kwok","Lindsey A.",""],["Johansson","Joel",""],["Jha","Saurabh W.",""],["Blondin","St\u00e9phane",""],["Dessart","Luc",""],["Foley","Ryan J.",""],["Hillier","D. John",""],["Larison","Conor",""],["Pakmor","R\u00fcdiger",""],["Temim","Tea",""],["Andrews","Jennifer E.",""],["Auchettl","Katie",""],["Badenes","Carles",""],["Barna","Barnabas",""],["Bostroem","K. Azalee",""],["Newman","Max J. Brenner",""],["Brink","Thomas G.",""],["Bustamante-Rosell","Mar\u00eda Jos\u00e9",""],["Camacho-Neves","Yssavo",""],["Clocchiatti","Alejandro",""],["Coulter","David A.",""],["Davis","Kyle W.",""],["Deckers","Maxime",""],["Dimitriadis","Georgios",""],["Dong","Yize",""],["Farah","Joseph",""],["Filippenko","Alexei V.",""],["Fl\u00f6rs","Andreas",""],["Fox","Ori D.",""],["Garnavich","Peter",""],["Gonzalez","Estefania Padilla",""],["Graur","Or",""],["Hambsch","Franz-Josef",""],["Hosseinzadeh","Griffin",""],["Howell","D. Andrew",""],["Hughes","John P.",""],["Kerzendorf","Wolfgang E.",""],["Saux","Xavier K. Le",""],["Maeda","Keiichi",""],["Maguire","Kate",""],["McCully","Curtis",""],["Mihalenko","Cassidy",""],["Newsome","Megan",""],["O'Brien","John T.",""],["Pearson","Jeniveve",""],["Pellegrino","Craig",""],["Pierel","Justin D. R.",""],["Polin","Abigail",""],["Rest","Armin",""],["Rojas-Bravo","C\u00e9sar",""],["Sand","David J.",""],["Schwab","Michaela",""],["Shahbandeh","Melissa",""],["Shrestha","Manisha",""],["Smith","Nathan",""],["Strolger","Louis-Gregory",""],["Szalai","Tam\u00e1s",""],["Taggart","Kirsty",""],["Terreran","Giacomo",""],["Terwel","Jacco H.",""],["Tinyanont","Samaporn",""],["Valenti","Stefano",""],["Vink\u00f3","J\u00f3zsef",""],["Wheeler","J. Craig",""],["Yang","Yi",""],["Zheng","Weikang",""],["Ashall","Chris",""],["Derkacy","James M.",""],["Galbany","Llu\u00eds",""],["Hoeflich","Peter",""],["Hsiao","Eric",""],["De Jaeger","Thomas",""],["Lu","Jing",""],["Maund","Justyn",""],["Medler","Kyle",""],["Morrell","Nidia",""],["Shappee","Benjamin J.",""],["Stritzinger","Maximilian",""],["Suntzeff","Nicholas",""],["Tucker","Michael",""],["Wang","Lifan",""]]}
{"id":"2308.12450","submitter":"Lindsey Kwok","authors":"Lindsey A. Kwok, Matthew R. Siebert, Joel Johansson, Saurabh W. Jha,\n  Stephane Blondin, Luc Dessart, Ryan J. Foley, D. John Hillier, Conor Larison,\n  Ruediger Pakmor, Tea Temim, Jennifer E. Andrews, Katie Auchettl, Carles\n  Badenes, Barnabas Barna, K. Azalee Bostroem, Max J. Brenner Newman, Thomas G.\n  Brink, Maria Jose Bustamante-Rosell, Yssavo Camacho-Neves, Alejandro\n  Clocchiatti, David A. Coulter, Kyle W. Davis, Maxime Deckers, Georgios\n  Dimitriadis, Yize Dong, Joseph Farah, Alexei V. Filippenko, Andreas Flors,\n  Ori D. Fox, Peter Garnavich, Estefania Padilla Gonzalez, Or Graur,\n  Franz-Josef Hambsch, Griffin Hosseinzadeh, D. Andrew Howell, John P. Hughes,\n  Wolfgang E. Kerzendorf, Xavier K. Le Saux, Keiichi Maeda, Kate Maguire,\n  Curtis McCully, Cassidy Mihalenko, Megan Newsome, John T. O'Brien, Jeniveve\n  Pearson, Craig Pellegrino, Justin D. R. Pierel, Abigail Polin, Armin Rest,\n  Cesar Rojas-Bravo, David J. Sand, Michaela Schwab, Melissa Shahbandeh,\n  Manisha Shrestha, Nathan Smith, Louis-Gregory Strolger, Tamas Szalai, Kirsty\n  Taggart, Giacomo Terreran, Jacco H. Terwel, Samaporn Tinyanont, Stefano\n  Valenti, Jozsef Vinko, J. Craig Wheeler, Yi Yang, WeiKang Zheng, Chris\n  Ashall, James M. DerKacy, Lluis Galbany, Peter Hoeflich, Thomas de Jaeger,\n  Jing Lu, Justyn Maund, Kyle Medler, Nidia Morrell, Benjamin J. Shappee,\n  Maximilian Stritzinger, Nicholas Suntzeff, Michael Tucker, and Lifan Wang","title":"Ground-based and JWST Observations of SN 2022pul: II. Evidence from\n  Nebular Spectroscopy for a Violent Merger in a Peculiar Type-Ia Supernova","comments":"20 pages, 10 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an analysis of ground-based and JWST observations of SN 2022pul, a\npeculiar \"03fg-like\" (or \"super-Chandrasekhar\") Type Ia supernova (SN Ia), in\nthe nebular phase at 338 d post explosion. Our combined spectrum continuously\ncovers 0.4-14 $\\mu$m and includes the first mid-infrared spectrum of an\n03fg-like SN Ia. Compared to normal SN Ia 2021aefx, SN 2022pul exhibits a lower\nmean ionization state, asymmetric emission-line profiles, stronger emission\nfrom the intermediate-mass elements (IMEs) argon and calcium, weaker emission\nfrom iron-group elements (IGEs), and the first unambiguous detection of neon in\na SN Ia. Strong, broad, centrally peaked [Ne II] at 12.81 $\\mu$m was previously\npredicted as a hallmark of \"violent merger'' SN Ia models, where dynamical\ninteraction between two sub-$M_{\\text{Ch}}$ white dwarfs (WDs) causes\ndisruption of the lower mass WD and detonation of the other. The violent merger\nscenario was already a leading hypothesis for 03fg-like SNe Ia; in SN 2022pul\nit can explain the large-scale ejecta asymmetries seen between the IMEs and\nIGEs and the central location of narrow oxygen and broad neon. We modify extant\nmodels to add clumping of the central ejecta to better reproduce the optical\niron emission, and add mass in the innermost region ($< 2000$ km s$^{-1}$) to\naccount for the observed narrow [O I] $\\lambda\\lambda6300$, 6364 emission. A\nviolent WD-WD merger explains many of the observations of SN 2022pul, and our\nresults favor this model interpretation for the subclass of 03fg-like SN Ia.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:13:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kwok","Lindsey A.",""],["Siebert","Matthew R.",""],["Johansson","Joel",""],["Jha","Saurabh W.",""],["Blondin","Stephane",""],["Dessart","Luc",""],["Foley","Ryan J.",""],["Hillier","D. John",""],["Larison","Conor",""],["Pakmor","Ruediger",""],["Temim","Tea",""],["Andrews","Jennifer E.",""],["Auchettl","Katie",""],["Badenes","Carles",""],["Barna","Barnabas",""],["Bostroem","K. Azalee",""],["Newman","Max J. Brenner",""],["Brink","Thomas G.",""],["Bustamante-Rosell","Maria Jose",""],["Camacho-Neves","Yssavo",""],["Clocchiatti","Alejandro",""],["Coulter","David A.",""],["Davis","Kyle W.",""],["Deckers","Maxime",""],["Dimitriadis","Georgios",""],["Dong","Yize",""],["Farah","Joseph",""],["Filippenko","Alexei V.",""],["Flors","Andreas",""],["Fox","Ori D.",""],["Garnavich","Peter",""],["Gonzalez","Estefania Padilla",""],["Graur","Or",""],["Hambsch","Franz-Josef",""],["Hosseinzadeh","Griffin",""],["Howell","D. Andrew",""],["Hughes","John P.",""],["Kerzendorf","Wolfgang E.",""],["Saux","Xavier K. Le",""],["Maeda","Keiichi",""],["Maguire","Kate",""],["McCully","Curtis",""],["Mihalenko","Cassidy",""],["Newsome","Megan",""],["O'Brien","John T.",""],["Pearson","Jeniveve",""],["Pellegrino","Craig",""],["Pierel","Justin D. R.",""],["Polin","Abigail",""],["Rest","Armin",""],["Rojas-Bravo","Cesar",""],["Sand","David J.",""],["Schwab","Michaela",""],["Shahbandeh","Melissa",""],["Shrestha","Manisha",""],["Smith","Nathan",""],["Strolger","Louis-Gregory",""],["Szalai","Tamas",""],["Taggart","Kirsty",""],["Terreran","Giacomo",""],["Terwel","Jacco H.",""],["Tinyanont","Samaporn",""],["Valenti","Stefano",""],["Vinko","Jozsef",""],["Wheeler","J. Craig",""],["Yang","Yi",""],["Zheng","WeiKang",""],["Ashall","Chris",""],["DerKacy","James M.",""],["Galbany","Lluis",""],["Hoeflich","Peter",""],["de Jaeger","Thomas",""],["Lu","Jing",""],["Maund","Justyn",""],["Medler","Kyle",""],["Morrell","Nidia",""],["Shappee","Benjamin J.",""],["Stritzinger","Maximilian",""],["Suntzeff","Nicholas",""],["Tucker","Michael",""],["Wang","Lifan",""]]}
{"id":"2308.12451","submitter":"Shachar Lovett","authors":"Zander Kelley, Shachar Lovett, Raghu Meka","title":"Explicit separations between randomized and deterministic\n  Number-on-Forehead communication","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the power of randomness in the Number-on-Forehead (NOF) model in\ncommunication complexity. We construct an explicit 3-player function $f:[N]^3\n\\to \\{0,1\\}$, such that: (i) there exist a randomized NOF protocol computing it\nthat sends a constant number of bits; but (ii) any deterministic or\nnondeterministic NOF protocol computing it requires sending about $(\\log\nN)^{1/3}$ many bits. This exponentially improves upon the previously best-known\nsuch separation. At the core of our proof is an extension of a recent result of\nthe first and third authors on sets of integers without 3-term arithmetic\nprogressions into a non-arithmetic setting.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:21:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kelley","Zander",""],["Lovett","Shachar",""],["Meka","Raghu",""]]}
{"id":"2308.12452","submitter":"Wenzhao Li","authors":"Wenzhao Li, Tianhao Wu, Fangcheng Zhong, Cengiz Oztireli","title":"ARF-Plus: Controlling Perceptual Factors in Artistic Radiance Fields for\n  3D Scene Stylization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The radiance fields style transfer is an emerging field that has recently\ngained popularity as a means of 3D scene stylization, thanks to the outstanding\nperformance of neural radiance fields in 3D reconstruction and view synthesis.\nWe highlight a research gap in radiance fields style transfer, the lack of\nsufficient perceptual controllability, motivated by the existing concept in the\n2D image style transfer. In this paper, we present ARF-Plus, a 3D neural style\ntransfer framework offering manageable control over perceptual factors, to\nsystematically explore the perceptual controllability in 3D scene stylization.\nFour distinct types of controls - color preservation control, (style pattern)\nscale control, spatial (selective stylization area) control, and depth\nenhancement control - are proposed and integrated into this framework. Results\nfrom real-world datasets, both quantitative and qualitative, show that the four\ntypes of controls in our ARF-Plus framework successfully accomplish their\ncorresponding perceptual controls when stylizing 3D scenes. These techniques\nwork well for individual style inputs as well as for the simultaneous\napplication of multiple styles within a scene. This unlocks a realm of\nlimitless possibilities, allowing customized modifications of stylization\neffects and flexible merging of the strengths of different styles, ultimately\nenabling the creation of novel and eye-catching stylistic effects on 3D scenes.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:22:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Wenzhao",""],["Wu","Tianhao",""],["Zhong","Fangcheng",""],["Oztireli","Cengiz",""]]}
{"id":"2308.12453","submitter":"Arjun Manrai","authors":"Luke W. Sagers, James A. Diao, Luke Melas-Kyriazi, Matthew Groh,\n  Pranav Rajpurkar, Adewole S. Adamson, Veronica Rotemberg, Roxana Daneshjou,\n  Arjun K. Manrai","title":"Augmenting medical image classifiers with synthetic data from latent\n  diffusion models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While hundreds of artificial intelligence (AI) algorithms are now approved or\ncleared by the US Food and Drugs Administration (FDA), many studies have shown\ninconsistent generalization or latent bias, particularly for underrepresented\npopulations. Some have proposed that generative AI could reduce the need for\nreal data, but its utility in model development remains unclear. Skin disease\nserves as a useful case study in synthetic image generation due to the\ndiversity of disease appearance, particularly across the protected attribute of\nskin tone. Here we show that latent diffusion models can scalably generate\nimages of skin disease and that augmenting model training with these data\nimproves performance in data-limited settings. These performance gains saturate\nat synthetic-to-real image ratios above 10:1 and are substantially smaller than\nthe gains obtained from adding real images. As part of our analysis, we\ngenerate and analyze a new dataset of 458,920 synthetic images produced using\nseveral generation strategies. Our results suggest that synthetic data could\nserve as a force-multiplier for model development, but the collection of\ndiverse real-world data remains the most important step to improve medical AI\nalgorithms.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:34:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sagers","Luke W.",""],["Diao","James A.",""],["Melas-Kyriazi","Luke",""],["Groh","Matthew",""],["Rajpurkar","Pranav",""],["Adamson","Adewole S.",""],["Rotemberg","Veronica",""],["Daneshjou","Roxana",""],["Manrai","Arjun K.",""]]}
{"id":"2308.12454","submitter":"Achintha Wijesinghe","authors":"Achintha Wijesinghe, Songyang Zhang, Zhi Ding","title":"PFL-GAN: When Client Heterogeneity Meets Generative Models in\n  Personalized Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances of generative learning models are accompanied by the growing\ninterest in federated learning (FL) based on generative adversarial network\n(GAN) models. In the context of FL, GAN can capture the underlying client data\nstructure, and regenerate samples resembling the original data distribution\nwithout compromising the private raw data. Although most existing GAN-based FL\nworks focus on training a global model, Personalized FL (PFL) sometimes can be\nmore effective in view of client data heterogeneity in terms of distinct data\nsample distributions, feature spaces, and labels. To cope with client\nheterogeneity in GAN-based FL, we propose a novel GAN sharing and aggregation\nstrategy for PFL. The proposed PFL-GAN addresses the client heterogeneity in\ndifferent scenarios. More specially, we first learn the similarity among\nclients and then develop an weighted collaborative data aggregation. The\nempirical results through the rigorous experimentation on several well-known\ndatasets demonstrate the effectiveness of PFL-GAN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:38:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wijesinghe","Achintha",""],["Zhang","Songyang",""],["Ding","Zhi",""]]}
{"id":"2308.12455","submitter":"Maleknaz Nayebi","authors":"Umme Ayman Koana, Francis Chew, Chris Carlson, Maleknaz Nayebi","title":"Ownership in the Hands of Accountability at Brightsquid -- A Case Study\n  and a Developer Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The COVID-19 pandemic has accelerated the adoption of digital health\nsolutions. This has presented significant challenges for software development\nteams to swiftly adjust to the market need and demand. To address these\nchallenges, product management teams have had to adapt their approach to\nsoftware development, reshaping their processes to meet the demands of the\npandemic. Brighsquid implemented a new task assignment process aimed at\nenhancing developer accountability toward the customer. To assess the impact of\nthis change on code ownership, we conducted a code change analysis.\nAdditionally, we surveyed 67 developers to investigate the relationship between\naccountability and ownership more broadly. The findings of our case study\nindicate that the revised assignment model not only increased the perceived\nsense of accountability within the production team but also improved code\nresilience against ownership changes. Moreover, the survey results revealed\nthat a majority of the participating developers (67.5%) associated perceived\naccountability with artifact ownership.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:39:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Koana","Umme Ayman",""],["Chew","Francis",""],["Carlson","Chris",""],["Nayebi","Maleknaz",""]]}
{"id":"2308.12456","submitter":"Marcelo Flamarion","authors":"Marcelo V. Flamarion","title":"Flow patterns induced by a moving disturbance in rotational flows within\n  the forced Korteweg-de Vries equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Flow structures beneath a moving disturbance along a water free surface in\nthe weakly nonlinear weakly dispersive regime in a sheared channel with finite\ndepth and constant vorticity are investigated. We compute the exact two\nbranches of steady solutions in the disturbance moving frame. The velocity\nfield in the bulk fluid is approximated which allows us to compute the flow\nstructures beneath the free surface including stagnation points and Kelvin\ncat-eyes structures. We show that stagnation points exist only in one branch of\nsolutions. The bifurcation of the flow is analyzed according to the intensity\nof the vorticity and the speed of the moving disturbance. Differently from the\nunforced problem, stagnation points can arise for small values of the vorticity\nas long as the moving disturbance travels sufficiently fast.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:46:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Flamarion","Marcelo V.",""]]}
{"id":"2308.12457","submitter":"Jonathan Roslund","authors":"Jonathan D. Roslund, Arman Cing\\\"oz, William D. Lunden, Guthrie B.\n  Partridge, Abijith S. Kowligy, Frank Roller, Daniel B. Sheredy, Gunnar E.\n  Skulason, Joe P. Song, Jamil R. Abo-Shaeer, and Martin M. Boyd","title":"Optical Clocks at Sea","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deployed optical clocks will improve positioning for navigational autonomy,\nprovide remote time standards for geophysical monitoring and distributed\ncoherent sensing, allow time synchronization of remote quantum networks, and\nprovide operational redundancy for national time standards. While laboratory\noptical clocks now reach timing inaccuracies below 1E-18, transportable\nversions of these high-performing clocks have limited utility due to their\nsize, environmental sensitivity, and cost. Here we report the development of\noptical clocks with the requisite combination of size, performance, and\nenvironmental insensitivity for operation on mobile platforms. The 35 L clock\ncombines a molecular iodine spectrometer, fiber frequency comb, and control\nelectronics. Three of these clocks operated continuously aboard a naval ship in\nthe Pacific Ocean for 20 days while accruing timing errors below 300 ps per\nday. The clocks have comparable performance to active hydrogen masers in\none-tenth the volume. Operating high-performance clocks at sea has been\nhistorically challenging and continues to be critical for navigation. This\ndemonstration marks a significant technological advancement that heralds the\narrival of future optical timekeeping networks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:47:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Roslund","Jonathan D.",""],["Cing\u00f6z","Arman",""],["Lunden","William D.",""],["Partridge","Guthrie B.",""],["Kowligy","Abijith S.",""],["Roller","Frank",""],["Sheredy","Daniel B.",""],["Skulason","Gunnar E.",""],["Song","Joe P.",""],["Abo-Shaeer","Jamil R.",""],["Boyd","Martin M.",""]]}
{"id":"2308.12458","submitter":"Urs Wenger","authors":"C. Alexandrou, S. Bacchio, G. Bergner, S. Burri, J. Finkenrath, A.\n  Gasbarro, K. Hadjiyiannakou, K. Jansen, G. Kanwar, B. Kostrzewa, G. Koutsou,\n  K. Ottnad, M. Petschlies, F. Pittler, F. Steffens, C. Urbach, and U. Wenger","title":"Pion Transition Form Factor from Twisted-Mass Lattice QCD and the\n  Hadronic Light-by-Light $\\pi^0$-pole Contribution to the Muon $g-2$","comments":"21 pages, 17 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The neutral pion generates the leading pole contribution to the hadronic\nlight-by-light tensor, which is given in terms of the nonperturbative\ntransition form factor $\\mathcal{F}_{\\pi^0\\gamma\\gamma}(q_1^2,q_2^2)$. Here we\npresent an ab-initio lattice calculation of this quantity in the continuum and\nat the physical point using twisted-mass lattice QCD. We report our results for\nthe transition form factor parameterized using a model-independent conformal\nexpansion valid for arbitrary space-like kinematics and compare it with\nexperimental measurements of the single-virtual form factor, the two-photon\ndecay width, and the slope parameter. We then use the transition form factors\nto compute the pion-pole contribution to the hadronic light-by-light scattering\nin the muon $g-2$, finding $a_\\mu^{\\pi^0\\text{-pole}} = 56.7(3.2) \\times\n10^{-11}$.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:48:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Alexandrou","C.",""],["Bacchio","S.",""],["Bergner","G.",""],["Burri","S.",""],["Finkenrath","J.",""],["Gasbarro","A.",""],["Hadjiyiannakou","K.",""],["Jansen","K.",""],["Kanwar","G.",""],["Kostrzewa","B.",""],["Koutsou","G.",""],["Ottnad","K.",""],["Petschlies","M.",""],["Pittler","F.",""],["Steffens","F.",""],["Urbach","C.",""],["Wenger","U.",""]]}
{"id":"2308.12459","submitter":"Emilio Ruiz-Moreno","authors":"Emilio Ruiz-Moreno, Luis Miguel L\\'opez-Ramos, Baltasar\n  Beferull-Lozano","title":"Zero-delay Consistent Signal Reconstruction from Streamed Multivariate\n  Time Series","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Digitalizing real-world analog signals typically involves sampling in time\nand discretizing in amplitude. Subsequent signal reconstructions inevitably\nincur an error that depends on the amplitude resolution and the temporal\ndensity of the acquired samples. From an implementation viewpoint, consistent\nsignal reconstruction methods have proven a profitable error-rate decay as the\nsampling rate increases. Despite that, these results are obtained under offline\nsettings. Therefore, a research gap exists regarding methods for consistent\nsignal reconstruction from data streams. This paper presents a method that\nconsistently reconstructs streamed multivariate time series of quantization\nintervals under a zero-delay response requirement. On the other hand, previous\nwork has shown that the temporal dependencies within univariate time series can\nbe exploited to reduce the roughness of zero-delay signal reconstructions. This\nwork shows that the spatiotemporal dependencies within multivariate time series\ncan also be exploited to achieve improved results. Specifically, the\nspatiotemporal dependencies of the multivariate time series are learned, with\nthe assistance of a recurrent neural network, to reduce the roughness of the\nsignal reconstruction on average while ensuring consistency. Our experiments\nshow that our proposed method achieves a favorable error-rate decay with the\nsampling rate compared to a similar but non-consistent reconstruction.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:50:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ruiz-Moreno","Emilio",""],["L\u00f3pez-Ramos","Luis Miguel",""],["Beferull-Lozano","Baltasar",""]]}
{"id":"2308.12460","submitter":"Sida Chen","authors":"Sida Chen, Danilo Alvares, Christopher Jackson, Jessica Barrett","title":"Bayesian blockwise inference for joint models of longitudinal and\n  multistate processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Joint models (JM) for longitudinal and survival data have gained increasing\ninterest and found applications in a wide range of clinical and biomedical\nsettings. These models facilitate the understanding of the relationship between\noutcomes and enable individualized predictions. In many applications, more\ncomplex event processes arise, necessitating joint longitudinal and multistate\nmodels. However, their practical application can be hindered by computational\nchallenges due to increased model complexity and large sample sizes. Motivated\nby a longitudinal multimorbidity analysis of large UK health records, we have\ndeveloped a scalable Bayesian methodology for such joint multistate models that\nis capable of handling complex event processes and large datasets, with\nstraightforward implementation. We propose two blockwise inference approaches\nfor different inferential purposes based on different levels of decomposition\nof the multistate processes. These approaches leverage parallel computing, ease\nthe specification of different models for different transitions, and\nmodel/variable selection can be performed within a Bayesian framework using\nBayesian leave-one-out cross-validation. Using a simulation study, we show that\nthe proposed approaches achieve satisfactory performance regarding posterior\npoint and interval estimation, with notable gains in sampling efficiency\ncompared to the standard estimation strategy. We illustrate our approaches\nusing a large UK electronic health record dataset where we analysed the\ncoevolution of routinely measured systolic blood pressure (SBP) and the\nprogression of multimorbidity, defined as the combinations of three chronic\nconditions. Our analysis identified distinct association structures between SBP\nand different disease transitions.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:51:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Sida",""],["Alvares","Danilo",""],["Jackson","Christopher",""],["Barrett","Jessica",""]]}
{"id":"2308.12461","submitter":"Flavio Del Santo","authors":"Flavio Del Santo","title":"Between understanding and control: Science as a cultural product","comments":"9 pages, 1 illustration. Dedicated to the memory of Angelo Baracca.\n  Originally written for the FQXi essay contest 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph physics.pop-ph physics.soc-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since the early days of humankind, people have been asking questions about\nNature of two kinds: why did that happen? And how can that be used? In a broad\nsense, science was born that day. We show indeed that science has two\ncomplementary and interdependent souls that aim, respectively, to how to\nunderstand and how to control Nature. Through a broad historical analysis, this\nessay aims to (1) give an account of the development of science as an\noscillation and an interplay between its two intrinsic natures, (2) demonstrate\nthat this happened already in ancient times starting from the 6th century BC,\nand (3) the fact that in different periods one of the two natures was largely\nfavored over the other is a consequence of science being a cultural product of\nthe different social-historical contexts.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:52:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Del Santo","Flavio",""]]}
{"id":"2308.12462","submitter":"Wenxuan Zhang","authors":"Wenxuan Zhang, Paul Janson, Rahaf Aljundi, Mohamed Elhoseiny","title":"Overcoming General Knowledge Loss with Selective Parameter Finetuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Foundation models encompass an extensive knowledge base and offer remarkable\ntransferability. However, this knowledge becomes outdated or insufficient over\ntime. The challenge lies in updating foundation models to accommodate novel\ninformation while retaining their original ability. In this paper, we present a\nnovel approach to achieving continual model updates by effecting localized\nmodifications to a small subset of parameters. Guided by insights gleaned from\nprior analyses of foundational models, we first localize a specific layer for\nmodel refinement and then introduce an importance scoring mechanism designed to\nupdate only the most crucial weights. Our method is exhaustively evaluated on\nfoundational vision-language models, measuring its efficacy in both learning\nnew information and preserving pre-established knowledge across a diverse\nspectrum of continual learning tasks, including Aircraft, Birdsnap CIFAR-100,\nCUB, Cars, and GTSRB. The results show that our method improves the existing\ncontinual learning methods by 0.5\\% - 10\\% on average, and reduces the loss of\npre-trained knowledge from around 5\\% to 0.97\\%. Comprehensive ablation studies\nsubstantiate our method design, shedding light on the contributions of each\ncomponent to controllably learning new knowledge and mitigating the forgetting\nof pre-trained knowledge.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:55:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Wenxuan",""],["Janson","Paul",""],["Aljundi","Rahaf",""],["Elhoseiny","Mohamed",""]]}
{"id":"2308.12463","submitter":"Tomer Amit","authors":"Tomer Amit and Sivan Refaely-Abramson","title":"Ultrafast Exciton Decomposition in Transition Metal Dichalcogenide\n  Heterostructures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Heterostructures of layered transition metal dichalcogenides (TMDs) host\nlong-lived, tunable excitons, making them intriguing candidates for\nmaterial-based quantum information applications. Light absorption in these\nsystems induces a plethora of optically excited states that hybridize both\ninterlayer and intralayer characteristics, providing a distinctive starting\npoint for their relaxation processes, in which the interplay between generated\nelectron-hole pairs and their scattering with phonons play a key role. We\npresent a first-principles theoretical approach to compute phonon-induced\nexciton decomposition due to rapid occupation of electron-hole pairs with\nfinite momentum and opposite spin. Using the MoSe$_2$/WSe$_2$ heterostructure\nas a case study, we observe a reduction in the optical activity of bright\nstates upon phonon scattering already in the first few femtoseconds proceeding\nthe photoexcitation, driving exciton interlayer delocalization and subsequent\nvariations in the exciton spin. Our results reveal an unexpected and previously\nunexplored starting point for exciton relaxation dynamics, suggesting increased\navailability for coherent interactions and non-radiative processes through\nultrafast changes in exciton momentum, spatial, and spin properties upon light\nexcitation.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:57:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Amit","Tomer",""],["Refaely-Abramson","Sivan",""]]}
{"id":"2308.12464","submitter":"Janeth Valverde","authors":"Janeth Valverde (UMBC/NASA GSFC), Nicholas Kirschner (GWU), Zachary\n  Metzler (UMD/CRESST II/NASA GSFC), Lucas D. Smith (UMD), Nicholas Cannady\n  (CRESST/UMBC), Regina Caputo (GSFC), Carolyn Kierans (GSFC), Iker\n  Liceaga-Indart (GSFC/Catholic U), Alexander Moiseev (CRESST/UMD), Lucas\n  Parker (LANL), Makoto Sasaki (CRESST/UMD), Adam Schoenwald (GSFC/UMBC),\n  Daniel Shy (NRL), Sambid Wasti (CUA/ NASA/ CRESST II), Richard Woolf (NRL),\n  Aleksey Bolotnikov (BNL), Gabriella Carini (BNL), A. W. Crosier (NREP), T.\n  Caligure (NREP), Alfred Dellapenna Jr (BNL), Jack Fried (BNL), P. Ghosh (CUA/\n  NASA/ CRESST II), Sean Griffin (Wisconsin IceCube Particle Astrophysics\n  Center), J. Eric Grove (NRL), Elizabeth Hays (GSFC), Sven Herrmann (BNL),\n  Emily Kong (Technology Service Corporation), Julie McEnery (GSFC), John\n  Mitchell (NASA/GSFC), Jeremy S. Perkins (GSFC), Bernard Phlips (NRL), Clio\n  Sleator (NRL), Eric Wulf (NRL), and Anna Zajczyk (CRESST/UMBC)","title":"The Compton-Pair telescope: A prototype for a next-generation MeV\n  $\\gamma$-ray observatory","comments":"Proceedings for the 38th International Cosmic Ray Conference\n  (ICRC2023)","journal-ref":"PoS(ICRC2023)857","doi":"10.22323/1.444.0857","report-no":null,"categories":"astro-ph.IM hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Compton Pair (ComPair) telescope is a prototype that aims to develop the\nnecessary technologies for future medium energy gamma-ray missions and to\ndesign, build, and test the prototype in a gamma-ray beam and balloon flight.\nThe ComPair team has built an instrument that consists of 4 detector\nsubsystems: a double-sided silicon strip detector Tracker, a novel\nhigh-resolution virtual Frisch-grid cadmium zinc telluride Calorimeter, and a\nhigh-energy hodoscopic cesium iodide Calorimeter, all of which are surrounded\nby a plastic scintillator anti-coincidence detector. These subsystems together\ndetect and characterize photons via Compton scattering and pair production,\nenable a veto of cosmic rays, and are a proof-of-concept for a space telescope\nwith the same architecture. A future medium-energy gamma-ray mission enabled\nthrough ComPair will address many questions posed in the Astro2020 Decadal\nsurvey in both the New Messengers and New Physics and the Cosmic Ecosystems\nthemes. In this contribution, we will give an overview of the ComPair project\nand steps forward to the balloon flight.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:02:43 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 16:42:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Valverde","Janeth","","UMBC/NASA GSFC"],["Kirschner","Nicholas","","GWU"],["Metzler","Zachary","","UMD/CRESST II/NASA GSFC"],["Smith","Lucas D.","","UMD"],["Cannady","Nicholas","","CRESST/UMBC"],["Caputo","Regina","","GSFC"],["Kierans","Carolyn","","GSFC"],["Liceaga-Indart","Iker","","GSFC/Catholic U"],["Moiseev","Alexander","","CRESST/UMD"],["Parker","Lucas","","LANL"],["Sasaki","Makoto","","CRESST/UMD"],["Schoenwald","Adam","","GSFC/UMBC"],["Shy","Daniel","","NRL"],["Wasti","Sambid","","CUA/ NASA/ CRESST II"],["Woolf","Richard","","NRL"],["Bolotnikov","Aleksey","","BNL"],["Carini","Gabriella","","BNL"],["Crosier","A. W.","","NREP"],["Caligure","T.","","NREP"],["Dellapenna","Alfred","Jr","BNL"],["Fried","Jack","","BNL"],["Ghosh","P.","","CUA/\n  NASA/ CRESST II"],["Griffin","Sean","","Wisconsin IceCube Particle Astrophysics\n  Center"],["Grove","J. Eric","","NRL"],["Hays","Elizabeth","","GSFC"],["Herrmann","Sven","","BNL"],["Kong","Emily","","Technology Service Corporation"],["McEnery","Julie","","GSFC"],["Mitchell","John","","NASA/GSFC"],["Perkins","Jeremy S.","","GSFC"],["Phlips","Bernard","","NRL"],["Sleator","Clio","","NRL"],["Wulf","Eric","","NRL"],["Zajczyk","Anna","","CRESST/UMBC"]]}
{"id":"2308.12465","submitter":"Jueqi Wang","authors":"Jueqi Wang and Jacob Levman and Walter Hugo Lopez Pinaya and\n  Petru-Daniel Tudosiu and M. Jorge Cardoso and Razvan Marinescu","title":"InverseSR: 3D Brain MRI Super-Resolution Using a Latent Diffusion Model","comments":"Early Accepted to MICCAI 2023 [top 14% of Submissions]","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  High-resolution (HR) MRI scans obtained from research-grade medical centers\nprovide precise information about imaged tissues. However, routine clinical MRI\nscans are typically in low-resolution (LR) and vary greatly in contrast and\nspatial resolution due to the adjustments of the scanning parameters to the\nlocal needs of the medical center. End-to-end deep learning methods for MRI\nsuper-resolution (SR) have been proposed, but they require re-training each\ntime there is a shift in the input distribution. To address this issue, we\npropose a novel approach that leverages a state-of-the-art 3D brain generative\nmodel, the latent diffusion model (LDM) trained on UK BioBank, to increase the\nresolution of clinical MRI scans. The LDM acts as a generative prior, which has\nthe ability to capture the prior distribution of 3D T1-weighted brain MRI.\nBased on the architecture of the brain LDM, we find that different methods are\nsuitable for different settings of MRI SR, and thus propose two novel\nstrategies: 1) for SR with more sparsity, we invert through both the decoder of\nthe LDM and also through a deterministic Denoising Diffusion Implicit Models\n(DDIM), an approach we will call InverseSR(LDM); 2) for SR with less sparsity,\nwe invert only through the LDM decoder, an approach we will call\nInverseSR(Decoder). These two approaches search different latent spaces in the\nLDM model to find the optimal latent code to map the given LR MRI into HR. The\ntraining process of the generative model is independent of the MRI\nunder-sampling process, ensuring the generalization of our method to many MRI\nSR problems with different input measurements. We validate our method on over\n100 brain T1w MRIs from the IXI dataset. Our method can demonstrate that\npowerful priors given by LDM can be used for MRI reconstruction.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:04:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Jueqi",""],["Levman","Jacob",""],["Pinaya","Walter Hugo Lopez",""],["Tudosiu","Petru-Daniel",""],["Cardoso","M. Jorge",""],["Marinescu","Razvan",""]]}
{"id":"2308.12466","submitter":"Akshat Gupta","authors":"Akshat Gupta","title":"Are ChatGPT and GPT-4 Good Poker Players? -- A Pre-Flop Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the introduction of ChatGPT and GPT-4, these models have been tested\nacross a large number of tasks. Their adeptness across domains is evident, but\ntheir aptitude in playing games and specifically their aptitude in the realm of\npoker has remained unexplored. Poker is a game that requires decision making\nunder uncertainty and incomplete information. In this paper, we put ChatGPT and\nGPT-4 through the poker test and evaluate their poker skills. Our findings\nreveal that while both models display an advanced understanding of poker,\nencompassing concepts like the valuation of starting hands, playing positions\nand other intricacies of game theory optimal (GTO) poker, both ChatGPT and\nGPT-4 are NOT game theory optimal poker players.\n  Through a series of experiments, we first discover the characteristics of\noptimal prompts and model parameters for playing poker with these models. Our\nobservations then unveil the distinct playing personas of the two models. We\nfirst conclude that GPT-4 is a more advanced poker player than ChatGPT. This\nexploration then sheds light on the divergent poker tactics of the two models:\nChatGPT's conservativeness juxtaposed against GPT-4's aggression. In poker\nvernacular, when tasked to play GTO poker, ChatGPT plays like a Nit, which\nmeans that it has a propensity to only engage with premium hands and folds a\nmajority of hands. When subjected to the same directive, GPT-4 plays like a\nmaniac, showcasing a loose and aggressive style of play. Both strategies,\nalthough relatively advanced, are not game theory optimal.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:16:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gupta","Akshat",""]]}
{"id":"2308.12467","submitter":"Shuai Dong","authors":"Ziwen Wang, Yisheng Chai, Shuai Dong","title":"First-principles demonstration of Roman surface topological\n  multiferroicity","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The concept of topology has been widely applied to condensed matter, going\nbeyond the band crossover in reciprocal spaces. A recent breakthrough suggested\nunconventional topological physics in a quadruple perovskite\nTbMn$_3$Cr$_4$O$_{12}$, whose magnetism-induced polarization manifests a unique\nRoman surface topology [Nat. Commun. \\textbf{13}, 2373 (2022)]. However, the\navailable experimental evidence based on tiny polarizations of polycrystalline\nsamples is far from sufficient. Here, this topological multiferroicity is\ndemonstrated by using density functional theory calculations, which ideally\nconfirms the Roman surface trajectory of magnetism-induced polarization. In\naddition, an alternative material in this category is proposed to\nsystematically enhance the performance, by promoting its magnetism-induced\npolarization to an easily detectable level.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:34:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Ziwen",""],["Chai","Yisheng",""],["Dong","Shuai",""]]}
{"id":"2308.12468","submitter":"James MacDonald","authors":"T. M. Lawlor and J. MacDonald","title":"Evolution of low mass population III stars from the pre-main sequence to\n  the white dwarf cooling track","comments":"To appear in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Radiation feedback from massive population III stars may have given rise to\nlow mass star formation from primordial or nearly primordial material. If early\nuniverse low mass stars did form, some should remain locally as white dwarfs,\nsub-giants, or main sequence stars. In this paper, we present model\ncalculations for the evolution of single 0.8 Msun to 3.0 Msun stars with\nprimordial metallicity from pre-main sequence to the white dwarf cooling track,\nand calculations for the evolution of single 4.0 Msun to 7.0 Msun stars which\nconclude in the giant phase. One goal of this work is to identify potential\nobservable markers for potential observed progenitors of first or nearly first\nstars. We uncover a number of seemingly peculiar evolutionary differences\nbetween that of pop III low mass stars compared with younger higher Z stars, as\nwell as compared to other primordial evolution models. We also present an\ninitial-final mass relationship and identify the minimum mass of a single white\ndwarf that could have had a population III progenitor.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:43:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lawlor","T. M.",""],["MacDonald","J.",""]]}
{"id":"2308.12469","submitter":"Junjiao Tian","authors":"Junjiao Tian, Lavisha Aggarwal, Andrea Colaco, Zsolt Kira, Mar\n  Gonzalez-Franco","title":"Diffuse, Attend, and Segment: Unsupervised Zero-Shot Segmentation using\n  Stable Diffusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Producing quality segmentation masks for images is a fundamental problem in\ncomputer vision. Recent research has explored large-scale supervised training\nto enable zero-shot segmentation on virtually any image style and unsupervised\ntraining to enable segmentation without dense annotations. However,\nconstructing a model capable of segmenting anything in a zero-shot manner\nwithout any annotations is still challenging. In this paper, we propose to\nutilize the self-attention layers in stable diffusion models to achieve this\ngoal because the pre-trained stable diffusion model has learned inherent\nconcepts of objects within its attention layers. Specifically, we introduce a\nsimple yet effective iterative merging process based on measuring KL divergence\namong attention maps to merge them into valid segmentation masks. The proposed\nmethod does not require any training or language dependency to extract quality\nsegmentation for any images. On COCO-Stuff-27, our method surpasses the prior\nunsupervised zero-shot SOTA method by an absolute 26% in pixel accuracy and 17%\nin mean IoU.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:44:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tian","Junjiao",""],["Aggarwal","Lavisha",""],["Colaco","Andrea",""],["Kira","Zsolt",""],["Gonzalez-Franco","Mar",""]]}
{"id":"2308.12470","submitter":"Kenichi Shimizu","authors":"Siddhartha Chib and Kenichi Shimizu","title":"Scalable Estimation of Multinomial Response Models with Uncertain\n  Consideration Sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME econ.EM stat.AP stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A standard assumption in the fitting of unordered multinomial response models\nfor J mutually exclusive nominal categories, on cross-sectional or longitudinal\ndata, is that the responses arise from the same set of J categories between\nsubjects. However, when responses measure a choice made by the subject, it is\nmore appropriate to assume that the distribution of multinomial responses is\nconditioned on a subject-specific consideration set, where this consideration\nset is drawn from the power set of {1,2,...,J}. Because the cardinality of this\npower set is exponential in J, estimation is infeasible in general. In this\npaper, we provide an approach to overcoming this problem. A key step in the\napproach is a probability model over consideration sets, based on a general\nrepresentation of probability distributions on contingency tables. Although the\nsupport of this distribution is exponentially large, the posterior distribution\nover consideration sets given parameters is typically sparse, and is easily\nsampled as part of an MCMC scheme that iterates sampling of subject-specific\nconsideration sets given parameters, followed by parameters given consideration\nsets. The effectiveness of the procedure is documented in simulated\nlongitudinal data sets with J=100 categories and real data from the cereal\nmarket with J=73 brands.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:48:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chib","Siddhartha",""],["Shimizu","Kenichi",""]]}
{"id":"2308.12471","submitter":"Ravi Acharya","authors":"Ravi Acharya, Maddison Coke, Mason Adshead, Kexue Li, Barat Achinuq,\n  Rongsheng Cai, A. Baset Gholizadeh, Janet Jacobs, Jessica L. Boland, Sarah J.\n  Haigh, Katie L. Moore, David N. Jamieson, Richard J. Curry","title":"Highly ${ }^{28} \\mathrm{Si}$ Enriched Silicon by Localised Focused Ion\n  Beam Implantation","comments":"8 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solid-state spin qubits within silicon crystals at mK temperatures show great\npromise in the realisation of a fully scalable quantum computation platform.\nQubit coherence times are limited in natural silicon owing to coupling to the\nisotope ${ }^{29} \\mathrm{Si}$ which has a non-zero nuclear spin. This work\npresents a method for the depletion of ${ }^{29} \\mathrm{Si}$ in localised\nvolumes of natural silicon wafers by irradiation using a 45 keV ${ }^{28}\n\\mathrm{Si}$ focused ion beam with fluences above $1 \\times 10^{19} \\,\n\\mathrm{ions} \\, \\mathrm{cm}^{-2}$. Nanoscale secondary ion mass spectrometry\nanalysis of the irradiated volumes shows unprecedented quality enriched silicon\nthat reaches a minimal residual ${ }^{29} \\mathrm{Si}$ value of 2.3 $\\pm$ 0.7\nppm and with residual C and O comparable to the background concentration in the\nunimplanted wafer. Transmission electron microscopy lattice images confirm the\nsolid phase epitaxial re-crystallization of the as-implanted amorphous enriched\nvolume extending over 200 nm in depth upon annealing. The ease of fabrication,\nrequiring only commercially available natural silicon wafers and ion sources,\nopens the possibility for co-integration of qubits in localised highly enriched\nvolumes with control circuitry in the surrounding natural silicon for\nlarge-scale devices.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:50:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Acharya","Ravi",""],["Coke","Maddison",""],["Adshead","Mason",""],["Li","Kexue",""],["Achinuq","Barat",""],["Cai","Rongsheng",""],["Gholizadeh","A. Baset",""],["Jacobs","Janet",""],["Boland","Jessica L.",""],["Haigh","Sarah J.",""],["Moore","Katie L.",""],["Jamieson","David N.",""],["Curry","Richard J.",""]]}
{"id":"2308.12472","submitter":"Saulo Matuslem Da Silva Mendes","authors":"Saulo Mendes","title":"Nonlinear Wave Transformation over Steep Breakwaters","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.ao-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Wave shoaling of water waves over mild bottom slopes is well described by\nlinearized theories. However, the analytical treatment of nonlinear wave\nshoaling subject to rapidly varying bottoms has proven to be elusive in the\npast decades. As the spatial evolution of the exceedance probability of\nirregular waves is affected by second-order effects in steepness, the nonlinear\nshoaling coefficient throughout a symmetrical and steep breakwater is\ninvestigated through a stochastic framework. By inverting the effect of slope\non normalized wave height distribution, it is possible to obtain a closed-form\nslope dependence of the nonlinear shoaling coefficient compatible with\nexperiments over steep breakwaters.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:55:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mendes","Saulo",""]]}
{"id":"2308.12473","submitter":"Jayita Lahiri","authors":"Subhaditya Bhattacharya, Atri Dey, Jayita Lahiri, Biswarup\n  Mukhopadhyaya","title":"High scale validity of two Higgs doublet scenarios with a real scalar\n  singlet dark matter","comments":"32 pages, 6 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the high-scale validity of two kinds of two Higgs doublet models\n(2HDM), namely, Type-II and Type-X, but with a scalar SU(2) singlet dark matter\n(DM) candidate in addition in each case. The additional quartic couplings\ninvolving the DM particle in the scalar potential in both the scenarios bring\nin additional constraints from the requirement of perturbative unitarity and\nvacuum stability. DM relic density and direct search constraints play a crucial\nrole in this analysis as the perturbative unitarity of the DM-Higgs portal\ncouplings primarily decide the high scale validity of the model. We find that,\nwithin the parameter regions thus restricted, the Type-II scenario must have a\ncut-off at around $10^6$ GeV, while the Type-X scenario admits of validity upto\nthe Planck scale. However, only those regions which are valid upto about $10^8$\nGeV in Type-X 2HDM is amenable to detection at the High-luminosity LHC (upto\n3000 $fb^{-1}$), while most of the parameter space of the Type-II scenario\nmentioned above is likely to be detectable.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 23:57:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhattacharya","Subhaditya",""],["Dey","Atri",""],["Lahiri","Jayita",""],["Mukhopadhyaya","Biswarup",""]]}
{"id":"2308.12474","submitter":"Sasan Razmkhah","authors":"Sasan Razmkhah and Massoud Pedram","title":"High-Density Superconductive Logic Circuits Utilizing 0 and $\\pi$\n  Josephson Junctions","comments":"9 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Superconductor Electronics (SCE) is a fast and power-efficient technology\nwith great potential for overcoming conventional CMOS electronics' scaling\nlimits. Nevertheless, the primary challenge confronting SCE today pertains to\nits integration level, which lags several orders of magnitude behind CMOS\ncircuits. In this study, we have innovated and simulated a novel logic family\ngrounded in the principles of phase shifts occurring in 0 and $\\pi$ Josephson\njunctions. The fast phase logic (FPL) eliminates the need for large inductor\nloops and shunt resistances by combining the half-flux and phase logic.\nTherefore, the Josephson junction (JJ) area only limits the integration\ndensity. The cells designed with this paradigm are fast, and the clock-to-Q\ndelay is about 4ps while maintaining over 50% parameter margins. This logic is\npower efficient and can increase the integration by at least 100$\\times$ in the\nSCE chips.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:00:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Razmkhah","Sasan",""],["Pedram","Massoud",""]]}
{"id":"2308.12475","submitter":"Jian Zhai","authors":"Gunther Uhlmann, Jian Zhai","title":"Determination of the density in a nonlinear elastic wave equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a continuation of our study [Uhlmann-Zhai, JMPA, 2021] on an inverse\nboundary value problem for a nonlinear elastic wave equation. We prove that all\nthe linear and nonlinear coefficients can be recovered from the\ndisplacement-to-traction map, including the density, under some natural\ngeometric conditions on the wavespeeds.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:00:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Uhlmann","Gunther",""],["Zhai","Jian",""]]}
{"id":"2308.12476","submitter":"DongHoon Kim","authors":"DongHoon Kim, Dongyun Han, Isaac Cho","title":"Comparative Analysis of Change Blindness in Virtual Reality and\n  Augmented Reality Environments","comments":"This paper is accepted as a conference paper on ISMAR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Change blindness is a phenomenon where an individual fails to notice\nalterations in a visual scene when a change occurs during a brief interruption\nor distraction. Understanding this phenomenon is specifically important for the\ntechnique that uses a visual stimulus, such as Virtual Reality (VR) or\nAugmented Reality (AR). Previous research had primarily focused on 2D\nenvironments or conducted limited controlled experiments in 3D immersive\nenvironments. In this paper, we design and conduct two formal user experiments\nto investigate the effects of different visual attention-disrupting conditions\n(Flickering and Head-Turning) and object alternative conditions (Removal, Color\nAlteration, and Size Alteration) on change blindness detection in VR and AR\nenvironments. Our results reveal that participants detected changes more\nquickly and had a higher detection rate with Flickering compared to\nHead-Turning. Furthermore, they spent less time detecting changes when an\nobject disappeared compared to changes in color or size. Additionally, we\nprovide a comparison of the results between VR and AR environments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:08:39 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 03:40:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kim","DongHoon",""],["Han","Dongyun",""],["Cho","Isaac",""]]}
{"id":"2308.12477","submitter":"Melissa Dell","authors":"Melissa Dell, Jacob Carlson, Tom Bryan, Emily Silcock, Abhishek Arora,\n  Zejiang Shen, Luca D'Amico-Wong, Quan Le, Pablo Querubin, Leander Heldring","title":"American Stories: A Large-Scale Structured Text Dataset of Historical\n  U.S. Newspapers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CV econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing full text datasets of U.S. public domain newspapers do not recognize\nthe often complex layouts of newspaper scans, and as a result the digitized\ncontent scrambles texts from articles, headlines, captions, advertisements, and\nother layout regions. OCR quality can also be low. This study develops a novel,\ndeep learning pipeline for extracting full article texts from newspaper images\nand applies it to the nearly 20 million scans in Library of Congress's public\ndomain Chronicling America collection. The pipeline includes layout detection,\nlegibility classification, custom OCR, and association of article texts\nspanning multiple bounding boxes. To achieve high scalability, it is built with\nefficient architectures designed for mobile phones. The resulting American\nStories dataset provides high quality data that could be used for pre-training\na large language model to achieve better understanding of historical English\nand historical world knowledge. The dataset could also be added to the external\ndatabase of a retrieval-augmented language model to make historical information\n- ranging from interpretations of political events to minutiae about the lives\nof people's ancestors - more widely accessible. Furthermore, structured article\ntexts facilitate using transformer-based methods for popular social science\napplications like topic classification, detection of reproduced content, and\nnews story clustering. Finally, American Stories provides a massive silver\nquality dataset for innovating multimodal layout analysis models and other\nmultimodal applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:24:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dell","Melissa",""],["Carlson","Jacob",""],["Bryan","Tom",""],["Silcock","Emily",""],["Arora","Abhishek",""],["Shen","Zejiang",""],["D'Amico-Wong","Luca",""],["Le","Quan",""],["Querubin","Pablo",""],["Heldring","Leander",""]]}
{"id":"2308.12478","submitter":"Xizhe Zhang","authors":"Xiao Xu, Yang Wang, Xinru Wei, Fei Wang, Xizhe Zhang","title":"Attention-Based Acoustic Feature Fusion Network for Depression Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Depression, a common mental disorder, significantly influences individuals\nand imposes considerable societal impacts. The complexity and heterogeneity of\nthe disorder necessitate prompt and effective detection, which nonetheless,\nposes a difficult challenge. This situation highlights an urgent requirement\nfor improved detection methods. Exploiting auditory data through advanced\nmachine learning paradigms presents promising research directions. Yet,\nexisting techniques mainly rely on single-dimensional feature models,\npotentially neglecting the abundance of information hidden in various speech\ncharacteristics. To rectify this, we present the novel Attention-Based Acoustic\nFeature Fusion Network (ABAFnet) for depression detection. ABAFnet combines\nfour different acoustic features into a comprehensive deep learning model,\nthereby effectively integrating and blending multi-tiered features. We present\na novel weight adjustment module for late fusion that boosts performance by\nefficaciously synthesizing these features. The effectiveness of our approach is\nconfirmed via extensive validation on two clinical speech databases, CNRAC and\nCS-NRAC, thereby outperforming previous methods in depression detection and\nsubtype classification. Further in-depth analysis confirms the key role of each\nfeature and highlights the importance of MFCCrelated features in speech-based\ndepression detection.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:31:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xu","Xiao",""],["Wang","Yang",""],["Wei","Xinru",""],["Wang","Fei",""],["Zhang","Xizhe",""]]}
{"id":"2308.12479","submitter":"Yonghong An","authors":"Yonghong An, David Davis, Yizao Liu and Ruli Xiao","title":"Procurement in welfare programs: Evidence and implications from WIC\n  infant formula contracts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper examines the impact of government procurement in social welfare\nprograms on consumers, manufacturers, and the government. We analyze the U.S.\ninfant formula market, where over half of the total sales are purchased by the\nWomen, Infants, and Children (WIC) program. The WIC program utilizes\nfirst-price auctions to solicit rebates from the three main formula\nmanufacturers, with the winner exclusively serving all WIC consumers in the\nwinning state. The manufacturers compete aggressively in providing rebates\nwhich account for around 85% of the wholesale price. To rationalize and\ndisentangle the factors contributing to this phenomenon, we model\nmanufacturers' retail pricing competition by incorporating two unique features:\nprice inelastic WIC consumers and government regulation on WIC brand prices.\nOur findings confirm three sizable benefits from winning the auction: a notable\nspill-over effect on non-WIC demand, a significant marginal cost reduction, and\na higher retail price for the WIC brand due to the price inelasticity of WIC\nconsumers. Our counterfactual analysis shows that procurement auctions affect\nmanufacturers asymmetrically, with the smallest manufacturer harmed the most.\nMore importantly, by switching from the current mechanism to a predetermined\nrebate procurement, the government can still contain the cost successfully,\nconsumers' surplus is greatly improved, and the smallest manufacturer benefits\nfrom the switch, promoting market competition.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:39:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["An","Yonghong",""],["Davis","David",""],["Liu","Yizao",""],["Xiao","Ruli",""]]}
{"id":"2308.12480","submitter":"Zezhou Huang","authors":"Zezhou Huang, Eugene Wu","title":"Lightweight Materialization for Fast Dashboards Over Joins","comments":null,"journal-ref":"SIGMOD 2024","doi":null,"report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dashboards are vital in modern business intelligence tools, providing\nnon-technical users with an interface to access comprehensive business data.\nWith the rise of cloud technology, there is an increased number of data sources\nto provide enriched contexts for various analytical tasks, leading to a demand\nfor interactive dashboards over a large number of joins. Nevertheless, joins\nare among the most expensive operations in DBMSes, making the support of\ninteractive dashboards over joins challenging.\n  In this paper, we present Treant, a dashboard accelerator for queries over\nlarge joins. Treant uses factorized query execution to handle aggregation\nqueries over large joins, which alone is still insufficient for interactive\nspeeds. To address this, we exploit the incremental nature of user interactions\nusing Calibrated Junction Hypertree (CJT), a novel data structure that applies\nlightweight materialization of the intermediates during factorized execution.\nCJT ensures that the work needed to compute a query is proportional to how\ndifferent it is from the previous query, rather than the overall complexity.\nTreant manages CJTs to share work between queries and performs materialization\noffline or during user \"think-times.\" Implemented as a middleware that rewrites\nSQL, Treant is portable to any SQL-based DBMS. Our experiments on single node\nand cloud DBMSes show that Treant improves dashboard interactions by two orders\nof magnitude, and provides 10x improvement for ML augmentation compared to SOTA\nfactorized ML system.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:40:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Huang","Zezhou",""],["Wu","Eugene",""]]}
{"id":"2308.12481","submitter":"Hannah Zhou","authors":"Hannah Zhou, Allison Chen, Celine Buer, Emily Chen, Kayleen Tang,\n  Lauryn Gong, Zhiqi Liu, Jianbin Tang","title":"Fall Detection using Knowledge Distillation Based Long short-term memory\n  for Offline Embedded and Low Power Devices","comments":"4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a cost-effective, low-power approach to unintentional\nfall detection using knowledge distillation-based LSTM (Long Short-Term Memory)\nmodels to significantly improve accuracy. With a primary focus on analyzing\ntime-series data collected from various sensors, the solution offers real-time\ndetection capabilities, ensuring prompt and reliable identification of falls.\nThe authors investigate fall detection models that are based on different\nsensors, comparing their accuracy rates and performance. Furthermore, they\nemploy the technique of knowledge distillation to enhance the models'\nprecision, resulting in refined accurate configurations that consume lower\npower. As a result, this proposed solution presents a compelling avenue for the\ndevelopment of energy-efficient fall detection systems for future advancements\nin this critical domain.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:49:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhou","Hannah",""],["Chen","Allison",""],["Buer","Celine",""],["Chen","Emily",""],["Tang","Kayleen",""],["Gong","Lauryn",""],["Liu","Zhiqi",""],["Tang","Jianbin",""]]}
{"id":"2308.12482","submitter":"Ji Luo","authors":"Ji Luo","title":"General nonsymmetry of the stress tensor of fluids: Further\n  considerations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Regarding a recent dispute, it is emphasized that the usual proofs of the\nsymmetry of the stress tensor of fluids based on the theorem of angular\nmomentum may not be valid because an internal force and its reaction may not be\nalong the line connecting the interacting fluid particles, even down to the\nlevel of molecules. Derivation according to the theorem of the motion of\ncenter-of-mass indicates an additional term representing the total moment of\ninternal forces. This moment of internal forces is the origin of the\nnonsymmetry of the stress tensor of fluids and is in general nonzero as long as\nshear stress exists. Examples are analyzed with special attention to the\nmechanism of gas viscosity, indicating the reasonableness and correctness of a\nnonsymmetrical stress tensor suggested in the literature, at least for gases.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:49:57 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 23:36:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Luo","Ji",""]]}
{"id":"2308.12483","submitter":"Ashley Zhuang","authors":"Phevos Paschalidis, Ashley Zhuang","title":"Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Kadison-Singer Conjecture, as proved by Marcus, Spielman, and Srivastava\n(MSS) [Ann. Math. 182, 327-350 (2015)], has been informally thought of as a\nstrengthening of Batson, Spielman, and Srivastava's theorem that every\nundirected graph has a linear-sized spectral sparsifier [SICOMP 41, 1704-1721\n(2012)]. We formalize this intuition by using a corollary of the MSS result to\nderive the existence of spectral sparsifiers with a number of edges linear in\nits number of vertices for all undirected, weighted graphs. The proof consists\nof two steps. First, following a suggestion of Srivastava [Asia Pac. Math.\nNewsl. 3, 15-20 (2013)], we show the result in the special case of graphs with\nbounded leverage scores by repeatedly applying the MSS corollary to partition\nthe graph, while maintaining an appropriate bound on the leverage scores of\neach subgraph. Then, we extend to the general case by constructing a recursive\nalgorithm that repeatedly (i) divides edges with high leverage scores into\nmultiple parallel edges and (ii) uses the bounded leverage score case to\nsparsify the resulting graph.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:49:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Paschalidis","Phevos",""],["Zhuang","Ashley",""]]}
{"id":"2308.12484","submitter":"Kang Lu","authors":"Kang Lu","title":"Isomorphism between twisted $q$-Yangians and affine $\\imath$quantum\n  groups: type AI","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By employing Gauss decomposition, we establish a direct and explicit\nisomorphism between the twisted $q$-Yangians (in R-matrix presentation) and\naffine $\\imath$quantum groups (in current presentation) associated to symmetric\npair of type AI introduced by Molev-Ragoucy-Sorba and Lu-Wang, respectively. As\na corollary, we obtain a PBW type basis for affine $\\imath$quantum groups of\ntype AI.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:58:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lu","Kang",""]]}
{"id":"2308.12485","submitter":"Soonwoo Kwon","authors":"Soonwoo Kwon","title":"Optimal Shrinkage Estimation of Fixed Effects in Linear Panel Data\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shrinkage methods are frequently used to estimate fixed effects to reduce the\nnoisiness of the least square estimators. However, widely used shrinkage\nestimators guarantee such noise reduction only under strong distributional\nassumptions. I develop an estimator for the fixed effects that obtains the best\npossible mean squared error within a class of shrinkage estimators. This class\nincludes conventional shrinkage estimators and the optimality does not require\ndistributional assumptions. The estimator has an intuitive form and is easy to\nimplement. Moreover, the fixed effects are allowed to vary with time and to be\nserially correlated, and the shrinkage optimally incorporates the underlying\ncorrelation structure in this case. In such a context, I also provide a method\nto forecast fixed effects one period ahead.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:59:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kwon","Soonwoo",""]]}
{"id":"2308.12486","submitter":"Bowen Xu","authors":"Bowen Xu","title":"A Model of Sequential Learning based on Non-Axiomatic Logic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sequential learning is a fundamental function of an intelligent agent. This\ntechnical report introduces a model of sequential learning, which is\ninterpretable through Non-Axiomatic Logic. The learning procedure includes\nthree steps, hypothesizing, revising, and recycling, and can work under the\nAssumption of Insufficient Knowledge and Resources. Although there are\nlimitations for the current design, the model has been proven effective in some\nsimple cases.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:01:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xu","Bowen",""]]}
{"id":"2308.12487","submitter":"Fucheng Tian","authors":"Fucheng Tian, Jian Ping Gong","title":"Nonlinearity tunes crack dynamics in soft materials","comments":"12 pages,4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cracks in soft materials exhibit diverse dynamic patterns, involving\nstraight, oscillation, branching, and supershear fracture. Here, we\nsuccessfully reproduce these crack morphologies in a two-dimensional\npre-strained fracture scenario and establish crack stability phase diagrams for\nthree distinct nonlinear materials using a fracture phase field model. The\ncontrasting phase diagrams highlight the crucial role of nonlinearity in\nregulating crack dynamics. In strain-softening materials, crack branching\nprevails, limiting the cracks to sub-Rayleigh states. Yet strain-stiffening\nstabilizes crack propagation, allowing for the presence of supershear fracture.\nOf particular interest is the large-strain linear elastic materials, where\ncrack oscillation is readily triggered. The onset speed of such instability\nscales linearly with the characteristic wave speed near the crack tip,\nsupporting the notion that such crack oscillations are a universal instability\nclosely tied to the wave speed. The oscillation wavelength is shown to be a\nbilinear function of the nonlinear scale and crack driving force, with a\nminimum length scale associated with the dissipative zone. Moreover, our\nfindings suggest that the increase in characteristic wave speed due to\nstrain-stiffening can account for the observed transition of cracks from\nsub-Rayleigh to supershear regimes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:11:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tian","Fucheng",""],["Gong","Jian Ping",""]]}
{"id":"2308.12488","submitter":"Rui Mao","authors":"Rui Mao, Guanyi Chen, Xulang Zhang, Frank Guerin, Erik Cambria","title":"GPTEval: A Survey on Assessments of ChatGPT and GPT-4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The emergence of ChatGPT has generated much speculation in the press about\nits potential to disrupt social and economic systems. Its astonishing language\nability has aroused strong curiosity among scholars about its performance in\ndifferent domains. There have been many studies evaluating the ability of\nChatGPT and GPT-4 in different tasks and disciplines. However, a comprehensive\nreview summarizing the collective assessment findings is lacking. The objective\nof this survey is to thoroughly analyze prior assessments of ChatGPT and GPT-4,\nfocusing on its language and reasoning abilities, scientific knowledge, and\nethical considerations. Furthermore, an examination of the existing evaluation\nmethods is conducted, offering several recommendations for future research in\nevaluating large language models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:17:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mao","Rui",""],["Chen","Guanyi",""],["Zhang","Xulang",""],["Guerin","Frank",""],["Cambria","Erik",""]]}
{"id":"2308.12489","submitter":"Dejian Liu","authors":"Dejian Liu and Ye Xu and Chaojie Hao and Shuaibo Bian and Zehao Lin\n  and Yingjie Li and Jingjing Li","title":"Kinematics of the Local Spiral Structure Revealed by Young Stars in\n  \\emph{Gaia}~DR3","comments":"13 pages, 10 figures, Accepted for publication in The Astrophysical\n  Journal Supplement Series","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using young open clusters and O--B2-type stars in~\\emph{Gaia}~DR3, we\ninvestigate the kinematics of the local spiral structure. In general, the young\nsources in the outer spiral arms may present larger peculiar motions than those\nin the inner spiral arms. The young open clusters appear to have smaller\npeculiar motions than the O--B2-type stars, and the sources in both the Perseus\nand Local Arms may show an inward motion toward the Galactic center and rotate\nslower than Galactic rotation. Meanwhile, the sources in the Carina Arm may\nmove in the opposite direction from the Sun to the Galactic center and rotate\nmarginally faster than Galactic rotation. In addition, using young open\nclusters and O--B2-type stars, we have improved the distance estimations of\nkinematic methods for several regions near the Sun.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:18:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Dejian",""],["Xu","Ye",""],["Hao","Chaojie",""],["Bian","Shuaibo",""],["Lin","Zehao",""],["Li","Yingjie",""],["Li","Jingjing",""]]}
{"id":"2308.12490","submitter":"Yu-Wen Chen","authors":"Yu-Wen Chen, Zhou Yu, Julia Hirschberg","title":"MultiPA: a multi-task speech pronunciation assessment system for a\n  closed and open response scenario","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The design of automatic speech pronunciation assessment can be categorized\ninto closed and open response scenarios, each with strengths and limitations. A\nsystem with the ability to function in both scenarios can cater to diverse\nlearning needs and provide a more precise and holistic assessment of\npronunciation skills. In this study, we propose a Multi-task Pronunciation\nAssessment model called MultiPA. MultiPA provides an alternative to Kaldi-based\nsystems in that it has simpler format requirements and better compatibility\nwith other neural network models. Compared with previous open response systems,\nMultiPA provides a wider range of evaluations, encompassing assessments at both\nthe sentence and word-level. Our experimental results show that MultiPA\nachieves comparable performance when working in closed response scenarios and\nmaintains more robust performance when directly used for open responses.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:24:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Yu-Wen",""],["Yu","Zhou",""],["Hirschberg","Julia",""]]}
{"id":"2308.12491","submitter":"Shijun Mao","authors":"Luyang Li and Shijun Mao","title":"Inverse magnetic catalysis effect and current quark mass effect on mass\n  spectra and Mott transitions of pions under external magnetic field","comments":"10 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mass spectra and Mott transition of pions $(\\pi^0,\\ \\pi^\\pm)$ at finite\ntemperature and magnetic field are investigated in a two-flavor NJL model, and\nwe focus on the inverse magnetic catalysis (IMC) effect and current quark mass\n(CQM) effect. Due to the dimension reduction of the constituent quarks, the\npion masses jump at their Mott transitions, which is independent of the IMC\neffect and CQM effect. We consider the IMC effect by using a magnetic dependent\ncoupling constant, which is a monotonic decreasing function of magnetic field.\nWith IMC effect, the Mott transition temperature of $\\pi^0$ meson $T_m^0$ is a\nmonotonic decreasing function of magnetic field. For charged pions $\\pi^{\\pm}$,\nthe Mott transition temperature $T_m^+$ fast increases in weak magnetic field\nregion and then decreases with magnetic field, which are accompanied with some\noscillations. Comparing with the case without IMC effect, $T_m^0$ and $T_m^+$\nare lower when including IMC effect. CQM effect are considered by varying\nparameter $m_0$ in non-chiral limit. For $\\pi^0$ meson, $T_m^0$ is not a\nmonotonic function of magnetic field with low $m_0$, but it is a monotonic\ndecreasing function with larger $m_0$. In the weak magnetic field region,\n$T_m^0$ is higher for larger $m_0$, but in the strong magnetic field region, it\nis lower for larger $m_0$. For $\\pi^+$ meson, $T^+_m$ is only quantitatively\nmodifies by current quark mass effect, and it becomes higher with larger $m_0$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:25:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Luyang",""],["Mao","Shijun",""]]}
{"id":"2308.12492","submitter":"Yong-Yeon Jo Ph.D.","authors":"Byeong Tak Lee, Yong-Yeon Jo, Joon-Myoung Kwon","title":"Optimizing Neural Network Scale for ECG Classification","comments":"30pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study scaling convolutional neural networks (CNNs), specifically targeting\nResidual neural networks (ResNet), for analyzing electrocardiograms (ECGs).\nAlthough ECG signals are time-series data, CNN-based models have been shown to\noutperform other neural networks with different architectures in ECG analysis.\nHowever, most previous studies in ECG analysis have overlooked the importance\nof network scaling optimization, which significantly improves performance. We\nexplored and demonstrated an efficient approach to scale ResNet by examining\nthe effects of crucial parameters, including layer depth, the number of\nchannels, and the convolution kernel size. Through extensive experiments, we\nfound that a shallower network, a larger number of channels, and smaller kernel\nsizes result in better performance for ECG classifications. The optimal network\nscale might differ depending on the target task, but our findings provide\ninsight into obtaining more efficient and accurate models with fewer computing\nresources or less time. In practice, we demonstrate that a narrower search\nspace based on our findings leads to higher performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:26:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lee","Byeong Tak",""],["Jo","Yong-Yeon",""],["Kwon","Joon-Myoung",""]]}
{"id":"2308.12493","submitter":"Pei-Sen Li","authors":"Pei-Sen Li, Jian Wang and Xiaowen Zhou","title":"Quasi-stationary distribution for continuous-state branching processes\n  with competition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study quasi-stationary distribution of the continuous-state branching\nprocess with competition introduced in Berestycki, Fittipaldi and Fontbona\\\n(Probab. Theory Relat. Fields, 2018). This process is constructed as the unique\nstrong solution to a stochastic integral equation with jumps. An important\nexample is the logistic branching process constructed in Lambert (Ann. Appl.\nProbab., 2005). We establish the strong Feller property,trajectory Feller\nproperty, Lyapunov condition, weak Feller property and irreducibility,\nrespectively. These properties together allow us to prove that when the\ncompetition term is strong enough near $+\\infty$, then there is a unique\nquasi-stationary distribution, which attracts all initial distributions with\nexponential rates.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:27:10 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 03:34:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Pei-Sen",""],["Wang","Jian",""],["Zhou","Xiaowen",""]]}
{"id":"2308.12494","submitter":"Xiangyu Chen","authors":"Xiangyu Chen, Ruiwen Zhen, Shuai Li, Xiaotian Li and Guanghui Wang","title":"MOFA: A Model Simplification Roadmap for Image Restoration on Mobile\n  Devices","comments":"Accepted by 2023 ICCV Workshop (RCV)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image restoration aims to restore high-quality images from degraded\ncounterparts and has seen significant advancements through deep learning\ntechniques. The technique has been widely applied to mobile devices for tasks\nsuch as mobile photography. Given the resource limitations on mobile devices,\nsuch as memory constraints and runtime requirements, the efficiency of models\nduring deployment becomes paramount. Nevertheless, most previous works have\nprimarily concentrated on analyzing the efficiency of single modules and\nimproving them individually. This paper examines the efficiency across\ndifferent layers. We propose a roadmap that can be applied to further\naccelerate image restoration models prior to deployment while simultaneously\nincreasing PSNR (Peak Signal-to-Noise Ratio) and SSIM (Structural Similarity\nIndex). The roadmap first increases the model capacity by adding more\nparameters to partial convolutions on FLOPs non-sensitive layers. Then, it\napplies partial depthwise convolution coupled with decoupling\nupsampling/downsampling layers to accelerate the model speed. Extensive\nexperiments demonstrate that our approach decreases runtime by up to 13% and\nreduces the number of parameters by up to 23%, while increasing PSNR and SSIM\non several image restoration datasets. Source Code of our method is available\nat \\href{https://github.com/xiangyu8/MOFA}{https://github.com/xiangyu8/MOFA}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:29:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Xiangyu",""],["Zhen","Ruiwen",""],["Li","Shuai",""],["Li","Xiaotian",""],["Wang","Guanghui",""]]}
{"id":"2308.12495","submitter":"Yuqi Fang","authors":"Yuqi Fang, Jinjian Wu, Qianqian Wang, Shijun Qiu, Andrea Bozoki,\n  Huaicheng Yan, Mingxia Liu","title":"Source-Free Collaborative Domain Adaptation via Multi-Perspective\n  Feature Enrichment for Functional MRI Analysis","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Resting-state functional MRI (rs-fMRI) is increasingly employed in multi-site\nresearch to aid neurological disorder analysis. Existing studies usually suffer\nfrom significant cross-site/domain data heterogeneity caused by site effects\nsuch as differences in scanners/protocols. Many methods have been proposed to\nreduce fMRI heterogeneity between source and target domains, heavily relying on\nthe availability of source data. But acquiring source data is challenging due\nto privacy concerns and/or data storage burdens in multi-site studies. To this\nend, we design a source-free collaborative domain adaptation (SCDA) framework\nfor fMRI analysis, where only a pretrained source model and unlabeled target\ndata are accessible. Specifically, a multi-perspective feature enrichment\nmethod (MFE) is developed for target fMRI analysis, consisting of multiple\ncollaborative branches to dynamically capture fMRI features of unlabeled target\ndata from multiple views. Each branch has a data-feeding module, a\nspatiotemporal feature encoder, and a class predictor. A mutual-consistency\nconstraint is designed to encourage pair-wise consistency of latent features of\nthe same input generated from these branches for robust representation\nlearning. To facilitate efficient cross-domain knowledge transfer without\nsource data, we initialize MFE using parameters of a pretrained source model.\nWe also introduce an unsupervised pretraining strategy using 3,806 unlabeled\nfMRIs from three large-scale auxiliary databases, aiming to obtain a general\nfeature encoder. Experimental results on three public datasets and one private\ndataset demonstrate the efficacy of our method in cross-scanner and cross-study\nprediction tasks. The model pretrained on large-scale rs-fMRI data has been\nreleased to the public.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:30:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fang","Yuqi",""],["Wu","Jinjian",""],["Wang","Qianqian",""],["Qiu","Shijun",""],["Bozoki","Andrea",""],["Yan","Huaicheng",""],["Liu","Mingxia",""]]}
{"id":"2308.12496","submitter":"Zhihan Zhang","authors":"Zhihan Zhang, Agni K. Biswal, Ankush Nandi, Kali Frost, Jake A. Smith,\n  Bichlien H. Nguyen, Shwetak Patel, Aniruddh Vashisth, Vikram Iyer","title":"Recyclable vitrimer-based printed circuit board for circular electronics","comments":"45 pages, 14 figures, journal","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Electronics are integral to modern life; however, at their end-of-life these\ndevices produce environmentally hazardous electronic waste (e-waste). Recycling\nthe ubiquitous printed circuit boards (PCBs) that make up a substantial mass\nand volume fraction of e-waste is challenging due to their use of irreversibly\ncured thermoset epoxies. We present a PCB formulation using transesterification\nvitrimers (vPCBs), and an end-to-end fabrication process compatible with\nstandard manufacturing ecosystems. We create functional prototypes of IoT\ndevices transmitting 2.4 GHz radio signals on vPCBs with electrical and\nmechanical properties meeting industry standards. Fractures and holes in vPCBs\ncan be repaired while retaining comparable performance over more than four\nrepair cycles. We further demonstrate non-destructive decomposition of\ntransesterification vitrimer composites with solid inclusions and metal\nattachments by polymer swelling with small molecule solvents. We hypothesize\nthat unlike traditional solvolysis recycling, swelling does not degrade the\nmaterials. Through dynamic mechanical analysis we find negligible catalyst\nloss, minimal changes in storage modulus, and equivalent polymer backbone\ncomposition across multiple recycling cycles. We achieve 98% polymer recovery,\n100% fiber recovery, and 91% solvent recovery which we reuse to create new\nvPCBs without degraded performance. Our cradle-to-cradle life-cycle assessment\nshows substantial environmental impact reduction over conventional PCBs in 11\ncategories.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:34:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Zhihan",""],["Biswal","Agni K.",""],["Nandi","Ankush",""],["Frost","Kali",""],["Smith","Jake A.",""],["Nguyen","Bichlien H.",""],["Patel","Shwetak",""],["Vashisth","Aniruddh",""],["Iyer","Vikram",""]]}
{"id":"2308.12497","submitter":"Mohammad Majid Akhtar","authors":"Mohammad Majid Akhtar, Rahat Masood, Muhammad Ikram, Salil S. Kanhere","title":"False Information, Bots and Malicious Campaigns: Demystifying Elements\n  of Social Media Manipulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid spread of false information and persistent manipulation attacks on\nonline social networks (OSNs), often for political, ideological, or financial\ngain, has affected the openness of OSNs. While researchers from various\ndisciplines have investigated different manipulation-triggering elements of\nOSNs (such as understanding information diffusion on OSNs or detecting\nautomated behavior of accounts), these works have not been consolidated to\npresent a comprehensive overview of the interconnections among these elements.\nNotably, user psychology, the prevalence of bots, and their tactics in relation\nto false information detection have been overlooked in previous research. To\naddress this research gap, this paper synthesizes insights from various\ndisciplines to provide a comprehensive analysis of the manipulation landscape.\nBy integrating the primary elements of social media manipulation (SMM),\nincluding false information, bots, and malicious campaigns, we extensively\nexamine each SMM element. Through a systematic investigation of prior research,\nwe identify commonalities, highlight existing gaps, and extract valuable\ninsights in the field. Our findings underscore the urgent need for\ninterdisciplinary research to effectively combat social media manipulations,\nand our systematization can guide future research efforts and assist OSN\nproviders in ensuring the safety and integrity of their platforms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:37:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Akhtar","Mohammad Majid",""],["Masood","Rahat",""],["Ikram","Muhammad",""],["Kanhere","Salil S.",""]]}
{"id":"2308.12498","submitter":"Gayathri Raman","authors":"Gayathri Raman, Varun, Pragati Pradhan, Jamie Kennea","title":"Quiet, but not silent: Uncovering quiescent state properties of two\n  transient High Mass X-ray binaries","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first set of broadband spectral and timing studies of two\ntransient X-ray pulsars, MXB 0656-072 and MAXI J1409-619 using NuSTAR\nobservations conducted during quiescence. Despite being captured at one of\ntheir lowest luminosity states, both these targets show signs of ongoing\nlow-level accretion. Results from the time-averaged spectral analysis indicate\nfor the first time, the presence of a strong soft power law component along\nwith thermal emission from the neutron star hot spots. For both targets, the\nquiescent thermal X-ray emission is consistent with the deep crustal heating\nmodel. In MXB 0656-072, we do not detect any pulsations or indications of a\ncyclotron line during quiescence. However, in MAXI J1409-619 we detect strong\npulsations at 502 s with a pulsed fraction of $\\sim$66%, which adds this pulsar\nto the list of a handful of quiescent-state pulsating systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:38:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Raman","Gayathri",""],["Varun","",""],["Pradhan","Pragati",""],["Kennea","Jamie",""]]}
{"id":"2308.12499","submitter":"Liang-Gui Zhu","authors":"Liang-Gui Zhu and Xian Chen","title":"Addressing the final-parsec problem by combining milli-Hertz\n  gravitational-wave observation and AGN survey","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Massive black hole binaries (MBHBs) are the loudest gravitational-wave (GW)\nsources in milli-Hertz (mHz) GW band, but their dynamical evolution may stall\nwhen the black holes reach the innermost parsec of a galaxy. Such a\n``final-parsec problem'' could be solved if MBHB forms in a gas-rich\nenvironment, such as an active galactic nucleus (AGN), but other solutions not\ninvolving AGNs also exist. Testing the correlation between MBHBs and AGNs is\ndifficult in real observation because AGNs are ubiquitous. To overcome this\ndifficult, we use a statistical method, first designed to constrain the host\ngalaxies of stellar-mass binary black holes, to search for the MBHB-AGN\ncorrelation in different scenarios. We find that by detecting only one MBHB at\n$z\\lesssim0.5$, a mHz GW detector, such as the Laser Interferometer Space\nAntenna (LISA), can already distinguish different merger scenarios thanks to\nits ability of precisely localizing the source. Moreover, future detector\nnetworks and deeper AGNs surveys will allow us to testify the MBHB-AGN\ncorrelation up to a redshift of $z\\sim 3$ even if only a small fraction of\n$20\\%$ of MBHBs actually merge in AGNs. These constraints will help settle the\nlong-standing debate on the possible solutions to the final-parsec problem.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:42:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Liang-Gui",""],["Chen","Xian",""]]}
{"id":"2308.12500","submitter":"Daniel Sando","authors":"D. Sando, S. Chen, O. Paull, B. Xu, J. J. L. van Rijn, C. Xu, S. Xu,\n  F. Appert, J. Juraszek, L. Bellaiche, V. Nagarajan, T. Banerjee","title":"Strain Dependent Spin Hall Magnetoresistance in the Multiferroic\n  Antiferromagnet BiFeO$_3$","comments":"14 pages incl. 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spin Hall magnetoresistance (SMR) of epitaxial BiFeO$_3$ thin films is\ninvestigated. SMR consistent with ferromagnetic interfacial states for\nBiFeO$_3$ films fabricated on (001) SrTiO$_3$ (R' BFO) and LaAlO$_3$ (T' BFO)\nsubstrates is found, albeit with different temperature dependencies. For T'\nBFO, the SMR is enhanced at room temperature, and decays with reduced\ntemperatures. By contrast, R' BFO shows a monotonic decrease in SMR response\nwith increasing temperature, mirroring the trend of a weak ferromagnet. Density\nfunctional theory shows that this difference originates from the coupling of\nthe applied magnetic field to oxygen octahedral rotation (R') and spin (T')\ndegrees of freedom.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:47:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sando","D.",""],["Chen","S.",""],["Paull","O.",""],["Xu","B.",""],["van Rijn","J. J. L.",""],["Xu","C.",""],["Xu","S.",""],["Appert","F.",""],["Juraszek","J.",""],["Bellaiche","L.",""],["Nagarajan","V.",""],["Banerjee","T.",""]]}
{"id":"2308.12501","submitter":"Qian Huang","authors":"Chang Li, Qian Huang, Yingchi Mao","title":"DD-GCN: Directed Diffusion Graph Convolutional Network for\n  Skeleton-based Human Action Recognition","comments":"ICEM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Convolutional Networks (GCNs) have been widely used in skeleton-based\nhuman action recognition. In GCN-based methods, the spatio-temporal graph is\nfundamental for capturing motion patterns. However, existing approaches ignore\nthe physical dependency and synchronized spatio-temporal correlations between\njoints, which limits the representation capability of GCNs. To solve these\nproblems, we construct the directed diffusion graph for action modeling and\nintroduce the activity partition strategy to optimize the weight sharing\nmechanism of graph convolution kernels. In addition, we present the\nspatio-temporal synchronization encoder to embed synchronized spatio-temporal\nsemantics. Finally, we propose Directed Diffusion Graph Convolutional Network\n(DD-GCN) for action recognition, and the experiments on three public datasets:\nNTU-RGB+D, NTU-RGB+D 120, and NW-UCLA, demonstrate the state-of-the-art\nperformance of our method.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:53:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Chang",""],["Huang","Qian",""],["Mao","Yingchi",""]]}
{"id":"2308.12502","submitter":"Ningning Ding","authors":"Ningning Ding, Zhenyu Sun, Ermin Wei, Randall Berry","title":"Incentive Mechanism Design for Federated Learning and Unlearning","comments":null,"journal-ref":"International Symposium on Theory, Algorithmic Foundations, and\n  Protocol Design for Mobile Networks and Mobile Computing (MobiHoc'23), 2023","doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To protect users' right to be forgotten in federated learning, federated\nunlearning aims at eliminating the impact of leaving users' data on the global\nlearned model. The current research in federated unlearning mainly concentrated\non developing effective and efficient unlearning techniques. However, the issue\nof incentivizing valuable users to remain engaged and preventing their data\nfrom being unlearned is still under-explored, yet important to the unlearned\nmodel performance. This paper focuses on the incentive issue and develops an\nincentive mechanism for federated learning and unlearning. We first\ncharacterize the leaving users' impact on the global model accuracy and the\nrequired communication rounds for unlearning. Building on these results, we\npropose a four-stage game to capture the interaction and information updates\nduring the learning and unlearning process. A key contribution is to summarize\nusers' multi-dimensional private information into one-dimensional metrics to\nguide the incentive design. We show that users who incur high costs and\nexperience significant training losses are more likely to discontinue their\nengagement through federated unlearning. The server tends to retain users who\nmake substantial contributions to the model but has a trade-off on users'\ntraining losses, as large training losses of retained users increase privacy\ncosts but decrease unlearning costs. The numerical results demonstrate the\nnecessity of unlearning incentives for retaining valuable leaving users, and\nalso show that our proposed mechanisms decrease the server's cost by up to\n53.91% compared to state-of-the-art benchmarks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:57:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ding","Ningning",""],["Sun","Zhenyu",""],["Wei","Ermin",""],["Berry","Randall",""]]}
{"id":"2308.12503","submitter":"Jinxin Shi","authors":"Shi Jinxin, Zhao Jiabao, Wang Yilei, Wu Xingjiao, Li Jiawen, He Liang","title":"CGMI: Configurable General Multi-Agent Interaction Framework","comments":"11 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Benefiting from the powerful capabilities of large language models (LLMs),\nagents based on LLMs have shown the potential to address domain-specific tasks\nand emulate human behaviors. However, the content generated by these agents\nremains somewhat superficial, owing to their limited domain expertise and the\nabsence of an effective cognitive architecture. To address this, we present the\nConfigurable General Multi-Agent Interaction (CGMI) framework, designed to\nreplicate human interactions in real-world scenarios. Specifically, we propose\na tree-structured methodology for the assignment, detection, and maintenance of\nagent personality. Additionally, we designed a cognitive architecture equipped\nwith a skill library based on the ACT* model, which contains memory,\nreflection, and planning modules. We have also integrated general agents to\naugment the virtual environment's realism. Using the CGMI framework, we\nsimulated numerous classroom interactions between teacher and students. The\nexperiments indicate that aspects such as the teaching methodology, curriculum,\nand student performance closely mirror real classroom settings. We will open\nsource our work.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:03:29 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 05:44:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jinxin","Shi",""],["Jiabao","Zhao",""],["Yilei","Wang",""],["Xingjiao","Wu",""],["Jiawen","Li",""],["Liang","He",""]]}
{"id":"2308.12504","submitter":"Ilan Hirshberg","authors":"Ilan Hirshberg and Jianchao Wu","title":"Long thin covers and nuclear dimension","comments":"105 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish finite nuclear dimension for crossed product C*-algebras arising\nfrom various classes of possibly non-free topological actions, including\narbitrary actions of finitely generated virtually nilpotent groups on finite\ndimensional spaces, certain amenable actions of hyperbolic groups, and certain\nallosteric actions of wreath products. We obtain these results by introducing a\nnew notion of dimension for topological dynamical systems, called the long thin\ncovering dimension, which involves a suitable version of Rokhlin-type towers\nwith controlled overlaps for possibly non-free actions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:08:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hirshberg","Ilan",""],["Wu","Jianchao",""]]}
{"id":"2308.12505","submitter":"Sushil Pandit","authors":"Md Firoz Ali and Sushil Pandit","title":"On the pre-Schwarzian norm of certain Logharmonic mappings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We connect the pre-Schwarzian norm of logharmonic mappings to the\npre-Schwarzian norm of an analytic function and establish some necessary and\nsufficient conditions under which locally univalent logharmonic mappings have a\nfinite pre-Schwarzian norm. We also obtain a necessary and sufficient condition\nfor a logharmonic function to be Bloch. Furthermore, we obtain the\npre-Schwarzian norm and growth theorem for logharmonic Bloch mappings and their\nanalytic and co-analytic parts.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:09:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ali","Md Firoz",""],["Pandit","Sushil",""]]}
{"id":"2308.12506","submitter":"Tyler McCormick","authors":"Arun G. Chandrasekhar, Matthew O. Jackson, Tyler H. McCormick,\n  Vydhourie Thiyageswaran","title":"General Covariance-Based Conditions for Central Limit Theorems with\n  Dependent Triangular Arrays","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a general central limit theorem with simple, easy-to-check\ncovariance-based sufficient conditions for triangular arrays of random vectors\nwhen all variables could be interdependent. The result is constructed from\nStein's method, but the conditions are distinct from related work. We show that\nthese covariance conditions nest standard assumptions studied in the literature\nsuch as $M$-dependence, mixing random fields, non-mixing autoregressive\nprocesses, and dependency graphs, which themselves need not imply each other.\nThis permits researchers to work with high-level but intuitive conditions based\non overall correlation instead of more complicated and restrictive conditions\nsuch as strong mixing in random fields that may not have any obvious\nmicro-foundation. As examples of the implications, we show how the theorem\nimplies asymptotic normality in estimating: treatment effects with spillovers\nin more settings than previously admitted, covariance matrices, processes with\nglobal dependencies such as epidemic spread and information diffusion, and\nspatial process with Mat\\'{e}rn dependencies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:15:04 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 21:20:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chandrasekhar","Arun G.",""],["Jackson","Matthew O.",""],["McCormick","Tyler H.",""],["Thiyageswaran","Vydhourie",""]]}
{"id":"2308.12507","submitter":"Carlos Barrera","authors":"Carlos M. Barrera Retamal, Nathan W.C. Leigh, Nicholas C. Stone","title":"The chaotic four-body problem in Newtonian gravity -- II. An\n  ansatz-based approach to analytic solutions","comments":"10 pages, 8 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we continue our analysis of the chaotic four-body problem by\npresenting a general ansatz-based analytic treatment using statistical\nmechanics, where each outcome of the four-body problem is regarded as some\nvariation of the three-body problem (e.g., when two single stars are produced,\ncalled the 2+1+1 outcome, each ejection event is modeled as its own three-body\ninteraction by assuming that the ejections are well separated in time). This is\na generalization of the statistical mechanics treatment of the three-body\nproblem based on the density-of-states formalism. In our case, we focus on the\ninteraction of two binary systems, after which we divide our results into three\npossible outcome scenarios (2+2, 2+1+1, and 3+1). For each outcome, we apply an\nansatz-based approach to deriving analytic distribution functions that describe\nthe properties of the products of chaotic four-body interactions involving\npoint particles. To test our theoretical distributions, we perform a set of\nscattering simulations in the equal-mass point particle limit using FEWBODY. We\ncompare our final theoretical distributions to the simulations for each\nparticular scenario, finding consistently good agreement between the two. The\nhighlights of our results include that binary-binary scatterings act to\nsystematically destroy binaries producing instead a single binary and two\nejected stars or a stable triple, the 2+2 outcome produces the widest binaries\nand the 2+1+1 outcome produces the most compact binaries.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:26:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Retamal","Carlos M. Barrera",""],["Leigh","Nathan W. C.",""],["Stone","Nicholas C.",""]]}
{"id":"2308.12508","submitter":"Chenyue Jiao","authors":"Chenyue Jiao, Chongke Bi and Lu Yang","title":"FFEINR: Flow Feature-Enhanced Implicit Neural Representation for\n  Spatio-temporal Super-Resolution","comments":"This paper has been accepted and published by ChinaVis\n  2023(2023.7.21-24)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale numerical simulations are capable of generating data up to\nterabytes or even petabytes. As a promising method of data reduction,\nsuper-resolution (SR) has been widely studied in the scientific visualization\ncommunity. However, most of them are based on deep convolutional neural\nnetworks (CNNs) or generative adversarial networks (GANs) and the scale factor\nneeds to be determined before constructing the network. As a result, a single\ntraining session only supports a fixed factor and has poor generalization\nability. To address these problems, this paper proposes a Feature-Enhanced\nImplicit Neural Representation (FFEINR) for spatio-temporal super-resolution of\nflow field data. It can take full advantage of the implicit neural\nrepresentation in terms of model structure and sampling resolution. The neural\nrepresentation is based on a fully connected network with periodic activation\nfunctions, which enables us to obtain lightweight models. The learned\ncontinuous representation can decode the low-resolution flow field input data\nto arbitrary spatial and temporal resolutions, allowing for flexible\nupsampling. The training process of FFEINR is facilitated by introducing\nfeature enhancements for the input layer, which complements the contextual\ninformation of the flow field. To demonstrate the effectiveness of the proposed\nmethod, a series of experiments are conducted on different datasets by setting\ndifferent hyperparameters. The results show that FFEINR achieves significantly\nbetter results than the trilinear interpolation method.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:28:18 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 02:07:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiao","Chenyue",""],["Bi","Chongke",""],["Yang","Lu",""]]}
{"id":"2308.12509","submitter":"Yang Zhan","authors":"Yuan Yuan, Yang Zhan, and Zhitong Xiong","title":"Parameter-Efficient Transfer Learning for Remote Sensing Image-Text\n  Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision-and-language pre-training (VLP) models have experienced a surge in\npopularity recently. By fine-tuning them on specific datasets, significant\nperformance improvements have been observed in various tasks. However, full\nfine-tuning of VLP models not only consumes a significant amount of\ncomputational resources but also has a significant environmental impact.\nMoreover, as remote sensing (RS) data is constantly being updated, full\nfine-tuning may not be practical for real-world applications. To address this\nissue, in this work, we investigate the parameter-efficient transfer learning\n(PETL) method to effectively and efficiently transfer visual-language knowledge\nfrom the natural domain to the RS domain on the image-text retrieval task. To\nthis end, we make the following contributions. 1) We construct a novel and\nsophisticated PETL framework for the RS image-text retrieval (RSITR) task,\nwhich includes the pretrained CLIP model, a multimodal remote sensing adapter,\nand a hybrid multi-modal contrastive (HMMC) learning objective; 2) To deal with\nthe problem of high intra-modal similarity in RS data, we design a simple yet\neffective HMMC loss; 3) We provide comprehensive empirical studies for\nPETL-based RS image-text retrieval. Our results demonstrate that the proposed\nmethod is promising and of great potential for practical applications. 4) We\nbenchmark extensive state-of-the-art PETL methods on the RSITR task. Our\nproposed model only contains 0.16M training parameters, which can achieve a\nparameter reduction of 98.9% compared to full fine-tuning, resulting in\nsubstantial savings in training costs. Our retrieval performance exceeds\ntraditional methods by 7-13% and achieves comparable or better performance than\nfull fine-tuning. This work can provide new ideas and useful insights for RS\nvision-language tasks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:43:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yuan","Yuan",""],["Zhan","Yang",""],["Xiong","Zhitong",""]]}
{"id":"2308.12510","submitter":"Xialei Liu","authors":"Jiang-Tian Zhai, Xialei Liu, Andrew D. Bagdanov, Ke Li, Ming-Ming\n  Cheng","title":"Masked Autoencoders are Efficient Class Incremental Learners","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Class Incremental Learning (CIL) aims to sequentially learn new classes while\navoiding catastrophic forgetting of previous knowledge. We propose to use\nMasked Autoencoders (MAEs) as efficient learners for CIL. MAEs were originally\ndesigned to learn useful representations through reconstructive unsupervised\nlearning, and they can be easily integrated with a supervised loss for\nclassification. Moreover, MAEs can reliably reconstruct original input images\nfrom randomly selected patches, which we use to store exemplars from past tasks\nmore efficiently for CIL. We also propose a bilateral MAE framework to learn\nfrom image-level and embedding-level fusion, which produces better-quality\nreconstructed images and more stable representations. Our experiments confirm\nthat our approach performs better than the state-of-the-art on CIFAR-100,\nImageNet-Subset, and ImageNet-Full. The code is available at\nhttps://github.com/scok30/MAE-CIL .\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:49:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhai","Jiang-Tian",""],["Liu","Xialei",""],["Bagdanov","Andrew D.",""],["Li","Ke",""],["Cheng","Ming-Ming",""]]}
{"id":"2308.12511","submitter":"Bingbing Ding","authors":"Bingbing Ding, Zhouping Xin, Huicheng Yin","title":"Global smooth solutions to 4D quasilinear wave equations with short\n  pulse initial data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we establish the global existence of smooth solutions to\ngeneral 4D quasilinear wave equations satisfying the first null condition with\nthe short pulse initial data. Although the global existence of small data\nsolutions to 4D quasilinear wave equations holds true without any requirement\nof null conditions, yet for short pulse data, in general, it is sufficient and\nnecessary to require the fulfillment of the first null condition to have global\nsmooth solutions. It is noted that short pulse data are extensions of a class\nof spherically symmetric data, for which the smallness restrictions are imposed\non angular directions and along the outgoing directional derivative\n$\\partial_t+\\partial_r$, but the largeness is kept for the incoming directional\nderivative $\\partial_t-\\partial_r$. We expect that here methods can be applied\nto study the global smooth solution or blowup problem with short pulse initial\ndata for the general 2D and 3D quasilinear wave equations when the\ncorresponding null conditions hold or not. On the other hand, as some direct\napplications of our main results, one can show that for the short pulse initial\ndata, the smooth solutions to the 4D irrotational compressible Euler equations\nfor Chaplygin gases, 4D nonlinear membrane equations and 4D relativistic\nmembrane equations exist globally since their nonlinearities satisfy the first\nnull condition; while the smooth solutions to the 4D irrotational compressible\nEuler equations for polytropic gases generally blow up in finite time since the\ncorresponding first null condition does not hold.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:51:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ding","Bingbing",""],["Xin","Zhouping",""],["Yin","Huicheng",""]]}
{"id":"2308.12512","submitter":"Wenqi Liang","authors":"Wenqi Liang, Gan Sun, Chenxi Liu, Jiahua Dong and Kangru Wang","title":"I3DOD: Towards Incremental 3D Object Detection via Prompting","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  3D object detection has achieved significant performance in many fields,\ne.g., robotics system, autonomous driving, and augmented reality. However, most\nexisting methods could cause catastrophic forgetting of old classes when\nperforming on the class-incremental scenarios. Meanwhile, the current\nclass-incremental 3D object detection methods neglect the relationships between\nthe object localization information and category semantic information and\nassume all the knowledge of old model is reliable. To address the above\nchallenge, we present a novel Incremental 3D Object Detection framework with\nthe guidance of prompting, i.e., I3DOD. Specifically, we propose a task-shared\nprompts mechanism to learn the matching relationships between the object\nlocalization information and category semantic information. After training on\nthe current task, these prompts will be stored in our prompt pool, and perform\nthe relationship of old classes in the next task. Moreover, we design a\nreliable distillation strategy to transfer knowledge from two aspects: a\nreliable dynamic distillation is developed to filter out the negative knowledge\nand transfer the reliable 3D knowledge to new detection model; the relation\nfeature is proposed to capture the responses relation in feature space and\nprotect plasticity of the model when learning novel 3D classes. To the end, we\nconduct comprehensive experiments on two benchmark datasets and our method\noutperforms the state-of-the-art object detection methods by 0.6% - 2.7% in\nterms of mAP@0.25.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:54:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liang","Wenqi",""],["Sun","Gan",""],["Liu","Chenxi",""],["Dong","Jiahua",""],["Wang","Kangru",""]]}
{"id":"2308.12513","submitter":"Zhang Lei","authors":"Xiaoyu Cheng, Tiantao Qu, Liantuan Xiao, Suotang Jia, Jun Chen, and\n  Lei Zhang","title":"Topological Anderson amorphous insulator","comments":"4 figures","journal-ref":"Phys. Rev. B, 108, L081110 (2023)","doi":"10.1103/PhysRevB.108.L081110","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The topological phase in amorphous systems adds a new dimension to the\ntopological states of matter. Here, we present an interesting phenomenon dubbed\nthe topological Anderson amorphous insulator (TAAI). Anderson disorder can\ndrive topologically trivial amorphous systems with structural disorders into\nnoncrystalline topological insulators. The gap closing and reopening, spin Bott\nindex, robust edge states, and quantized conductance characterize the Anderson\ndisorder-induced nontrivial topology in amorphous systems. More importantly,\nphase diagrams are given for the topological phase transition (TPT). It is\nfound that amorphous structural disorder and Anderson disorder are synergistic\nto drive the s-p band inversion of the system and hence the TPT, which is\nfurther confirmed by the effective medium theory. Our findings report a\ndisorder-induced topological phenomenon in noncrystalline systems and shed\nlight on the physical understanding of the interplay between the coexistence of\ntwo types of disorder effects and topology.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:56:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cheng","Xiaoyu",""],["Qu","Tiantao",""],["Xiao","Liantuan",""],["Jia","Suotang",""],["Chen","Jun",""],["Zhang","Lei",""]]}
{"id":"2308.12514","submitter":"Ero Balsa","authors":"Ero Balsa","title":"Privacy engineering through obfuscation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Obfuscation in privacy engineering denotes a diverse set of data operations\naimed at reducing the privacy loss that users incur in by participating in\ndigital systems. Obfuscation's domain of application is vast:\nprivacy-preserving database analysis, location-based privacy, private web\nsearch or privacy-friendly recommender systems are but a few examples of the\ncontexts in which privacy engineers have resorted to obfuscation. Yet an\nunderstanding of the role that obfuscation, in general, plays in the\nengineering of privacy has so far proved elusive. Similarly, we lack a cohesive\nview of the wide array of privacy measures that assist the evaluation of\nobfuscation technologies. This paper contributes to closing these research\ngaps. First, we provide a general analysis framework that brings together a\nmultiplicity of obfuscation methods under the same analytical umbrella. Second,\nwe distinguish between mechanism-centred and attack-centred evaluation, making\nexplicit a hierarchy of assumptions behind privacy measures that assists and\ndemystifies obfuscation tools' evaluation. Finally, we examine the role that\nobfuscation technology plays in privacy engineering by introducing the concepts\nof personal and public utility and distinguishing between utility-degrading and\nutility-preserving obfuscation. We observe that public utility requirements\nrequire us to resort to utility-degrading obfuscation to arbitrarily reduce\nprivacy loss. Conversely, personal utility requirements do not, in theory,\nimpose such a privacy-utility trade-off, and we illustrate how to perform\nutility-preserving obfuscation through chaff.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:57:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Balsa","Ero",""]]}
{"id":"2308.12515","submitter":"Rongkai Shi","authors":"Rongkai Shi, Yushi Wei, Yue Li, Lingyun Yu, Hai-Ning Liang","title":"Expanding Targets in Virtual Reality Environments: A Fitts' Law Study","comments":"4 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Target pointing selection is a fundamental task. According to Fitts' law,\nusers need more time to select targets with smaller sizes. Expanding the target\nto a larger size is a practical approach that can facilitate pointing\nselection. It has been well-examined and -deployed in 2D user interfaces.\nHowever, limited research has investigated target expansion methods using an\nimmersive virtual reality (VR) head-mounted display (HMD). In this work, we\naimed to fill this gap by conducting a user study using ISO 9241-411\nmulti-directional pointing task to examine the effect of target expansion on\ntarget selection performance in VR HMD. Based on our results, we found that\ncompared to not expanding the target, expanding the target width by 1.5 and 2.5\ntimes during the movement can significantly reduce the selection time. We hope\nthat the design and results derived from the study can help frame future work.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:57:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shi","Rongkai",""],["Wei","Yushi",""],["Li","Yue",""],["Yu","Lingyun",""],["Liang","Hai-Ning",""]]}
{"id":"2308.12516","submitter":"Yicong Yu","authors":"Yi-Cong Yu and Xiaoming Cai","title":"Controlled transport in chiral quantum walks on graphs","comments":"25 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate novel transport properties of chiral continuous-time quantum\nwalks (CTQWs) on graphs. By employing a gauge transformation, we demonstrate\nthat CTQWs on chiral chains are equivalent to those on non-chiral chains, but\nwith additional momenta from initial wave packets. This explains the novel\ntransport phenomenon numerically studied in [New J. Phys. 23, 083005(2021)].\nBuilding on this, we delve deeper into the analysis of chiral CTQWs on the\nY-junction graph, introducing phases to account for the chirality. The phase\nplays a key role in controlling both asymmetric transport and directed complete\ntransport among the chains in the Y-junction graph. We systematically analyze\nthese features through a comprehensive examination of the chiral\ncontinuous-time quantum walk (CTQW) on a Y-junction graph. Our analysis shows\nthat the CTQW on Y-junction graph can be modeled as a combination of three wave\nfunctions, each of which evolves independently on three effective open chains.\nBy constructing a lattice scattering theory, we calculate the phase shift of a\nwave packet after it interacts with the potential-shifted boundary. Our results\ndemonstrate that the interplay of these phase shifts leads to the observed\nenhancement and suppression of quantum transport. The explicit condition for\ndirected complete transport or 100% efficiency is analytically derived. Our\ntheory has applications in building quantum versions of binary tree search\nalgorithms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:02:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yu","Yi-Cong",""],["Cai","Xiaoming",""]]}
{"id":"2308.12517","submitter":"Kim Yunho","authors":"Yunho Kim, Hyunsik Oh, Jeonghyun Lee, Jinhyeok Choi, Gwanghyeon Ji,\n  Moonkyu Jung, Donghoon Youm, Jemin Hwangbo","title":"Not Only Rewards But Also Constraints: Applications on Legged Robot\n  Locomotion","comments":"Submitted to Transactions on Robotics (T-RO)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Several earlier studies have shown impressive control performance in complex\nrobotic systems by designing the controller using a neural network and training\nit with model-free reinforcement learning. However, these outstanding\ncontrollers with natural motion style and high task performance are developed\nthrough extensive reward engineering, which is a highly laborious and\ntime-consuming process of designing numerous reward terms and determining\nsuitable reward coefficients. In this work, we propose a novel reinforcement\nlearning framework for training neural network controllers for complex robotic\nsystems consisting of both rewards and constraints. To let the engineers\nappropriately reflect their intent to constraints and handle them with minimal\ncomputation overhead, two constraint types and an efficient policy optimization\nalgorithm are suggested. The learning framework is applied to train locomotion\ncontrollers for several legged robots with different morphology and physical\nattributes to traverse challenging terrains. Extensive simulation and\nreal-world experiments demonstrate that performant controllers can be trained\nwith significantly less reward engineering, by tuning only a single reward\ncoefficient. Furthermore, a more straightforward and intuitive engineering\nprocess can be utilized, thanks to the interpretability and generalizability of\nconstraints. The summary video is available at https://youtu.be/KAlm3yskhvM.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:06:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kim","Yunho",""],["Oh","Hyunsik",""],["Lee","Jeonghyun",""],["Choi","Jinhyeok",""],["Ji","Gwanghyeon",""],["Jung","Moonkyu",""],["Youm","Donghoon",""],["Hwangbo","Jemin",""]]}
{"id":"2308.12518","submitter":"Anatoly Kamchatnov","authors":"A. M. Kamchatnov, D. V. Shaykin","title":"Quasiclassical integrability condition in AKNS scheme","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI nlin.PS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the condition of quasiclassical integrability of\nsoliton equations. This condition states that the Hamiltonian structure of\nequations, which govern propagation of high-frequency wave packets, is\npreserved by the dispersionless flow independently of initial conditions. If\nthis condition is fulfilled, then the carrier wave number of any packet is a\ncertain function of local values of the dispersionless variables pertained to\nthe soliton equations under consideration. We show for several examples that\nthis function together with the dispersion relation for linear harmonic waves\ndetermine the quasiclassical limit of the Lax pair functions in the scalar\nrepresentation of the Ablowitz-Kaup-Newell-Segur scheme.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:07:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kamchatnov","A. M.",""],["Shaykin","D. V.",""]]}
{"id":"2308.12519","submitter":"Xin Cong","authors":"Yining Ye, Xin Cong, Yujia Qin, Yankai Lin, Zhiyuan Liu, Maosong Sun","title":"Large Language Model as Autonomous Decision Maker","comments":"Work in progess","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While large language models (LLMs) exhibit impressive language understanding\nand in-context learning abilities, their decision-making ability still heavily\nrelies on the guidance of task-specific expert knowledge when solving\nreal-world tasks. To unleash the potential of LLMs as autonomous decision\nmakers, this paper presents an approach JuDec to endow LLMs with the\nself-judgment ability, enabling LLMs to achieve autonomous judgment and\nexploration for decision making. Specifically, in JuDec, Elo-based\nSelf-Judgment Mechanism is designed to assign Elo scores to decision steps to\njudge their values and utilities via pairwise comparisons between two solutions\nand then guide the decision-searching process toward the optimal solution\naccordingly. Experimental results on the ToolBench dataset demonstrate JuDec's\nsuperiority over baselines, achieving over 10% improvement in Pass Rate on\ndiverse tasks. It offers higher-quality solutions and reduces costs (ChatGPT\nAPI calls), highlighting its effectiveness and efficiency.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:11:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ye","Yining",""],["Cong","Xin",""],["Qin","Yujia",""],["Lin","Yankai",""],["Liu","Zhiyuan",""],["Sun","Maosong",""]]}
{"id":"2308.12520","submitter":"Yudong Hu","authors":"Yudong Hu, Haoran Li, Congying Han, Tiande Guo, Mingqiang Li, Bonan Li","title":"SC-PSRO: A Unified Strategy Learning Method for Normal-form Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solving Nash equilibrium is the key challenge in normal-form games with large\nstrategy spaces, wherein open-ended learning framework provides an efficient\napproach. Previous studies invariably employ diversity as a conduit to foster\nthe advancement of strategies. Nevertheless, diversity-based algorithms can\nonly work in zero-sum games with cyclic dimensions, which lead to limitations\nin their applicability. Here, we propose an innovative unified open-ended\nlearning framework SC-PSRO, i.e., Self-Confirming Policy Space Response Oracle,\nas a general framework for both zero-sum and general-sum games. In particular,\nwe introduce the advantage function as an improved evaluation metric for\nstrategies, allowing for a unified learning objective for agents in normal-form\ngames. Concretely, SC-PSRO comprises three quintessential components: 1) A\nDiversity Module, aiming to avoid strategies to be constrained by the cyclic\nstructure. 2) A LookAhead Module, devised for the promotion of strategy in the\ntransitive dimension. This module is theoretically guaranteed to learn\nstrategies in the direction of the Nash equilibrium. 3) A Confirming-based\nPopulation Clipping Module, contrived for tackling the equilibrium selection\nproblem in general-sum games. This module can be applied to learn equilibria\nwith optimal rewards, which to our knowledge is the first improvement for\ngeneral-sum games. Our experiments indicate that SC-PSRO accomplishes a\nconsiderable decrease in exploitability in zero-sum games and an escalation in\nrewards in general-sum games, markedly surpassing antecedent methodologies.\nCode will be released upon acceptance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:14:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hu","Yudong",""],["Li","Haoran",""],["Han","Congying",""],["Guo","Tiande",""],["Li","Mingqiang",""],["Li","Bonan",""]]}
{"id":"2308.12521","submitter":"Yayun Wu","authors":"Yayun Wu","title":"The generalized Bernoulli numbers and its relation with the Riemann zeta\n  function at odd-integer arguments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By using the generalized Bernoulli numbers, we deduce new integral\nrepresentations for the Riemann zeta function at positive odd-integer\narguments. The explicit expressions enable us to obtain criteria for the\ndimension of the vector space spanned over the rational by the\n$\\zeta(2n+1)/\\pi^{2n}$, $n\\geq1$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:19:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wu","Yayun",""]]}
{"id":"2308.12522","submitter":"Siming Fu","authors":"Siming Fu, Xiaoxuan He, Xinpeng Ding, Yuchen Cao, Hualiang Wang","title":"Uniformly Distributed Category Prototype-Guided Vision-Language\n  Framework for Long-Tail Recognition","comments":"11pages, 5figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, large-scale pre-trained vision-language models have presented\nbenefits for alleviating class imbalance in long-tailed recognition. However,\nthe long-tailed data distribution can corrupt the representation space, where\nthe distance between head and tail categories is much larger than the distance\nbetween two tail categories. This uneven feature space distribution causes the\nmodel to exhibit unclear and inseparable decision boundaries on the uniformly\ndistributed test set, which lowers its performance. To address these\nchallenges, we propose the uniformly category prototype-guided vision-language\nframework to effectively mitigate feature space bias caused by data imbalance.\nEspecially, we generate a set of category prototypes uniformly distributed on a\nhypersphere. Category prototype-guided mechanism for image-text matching makes\nthe features of different classes converge to these distinct and uniformly\ndistributed category prototypes, which maintain a uniform distribution in the\nfeature space, and improve class boundaries. Additionally, our proposed\nirrelevant text filtering and attribute enhancement module allows the model to\nignore irrelevant noisy text and focus more on key attribute information,\nthereby enhancing the robustness of our framework. In the image recognition\nfine-tuning stage, to address the positive bias problem of the learnable\nclassifier, we design the class feature prototype-guided classifier, which\ncompensates for the performance of tail classes while maintaining the\nperformance of head classes. Our method outperforms previous vision-language\nmethods for long-tailed learning work by a large margin and achieves\nstate-of-the-art performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:21:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fu","Siming",""],["He","Xiaoxuan",""],["Ding","Xinpeng",""],["Cao","Yuchen",""],["Wang","Hualiang",""]]}
{"id":"2308.12523","submitter":"Asaki Saito","authors":"Asaki Saito, Jun-ichi Tamura, Shin-ichi Yasutomi","title":"Arithmetical independence of certain uniform sets of algebraic integers","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study four (families of) sets of algebraic integers of degree less than or\nequal to three. Apart from being simply defined, we show that they share two\ndistinctive characteristics: almost uniformity and arithmetical independence.\nHere, ``almost uniformity'' means that the elements of a finite set are\ndistributed almost equidistantly in the unit interval, while ``arithmetical\nindependence'' means that the number fields generated by the elements of a set\ndo not have a mutual inclusion relation each other. Furthermore, we reveal to\nwhat extent the algebraic number fields generated by the elements of the four\nsets can cover quadratic or cubic fields.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:22:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Saito","Asaki",""],["Tamura","Jun-ichi",""],["Yasutomi","Shin-ichi",""]]}
{"id":"2308.12524","submitter":"Harshdeep Singh","authors":"Harshdeep Singh, Sabyashachi Mishra, Sonjoy Majumder","title":"On The Study Of Partial Qubit Hamiltonian For Efficient Molecular\n  Simulation Using Variational Quantum Eigensolvers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum computing is being extensively used in quantum chemistry, especially\nin simulating simple molecules and evaluating properties like the ground state\nenergy, dipole moment, etc. The transformation of a molecular Hamiltonian from\nthe fermionic space to the qubit space provides us with a series of Pauli\nstrings and the energy calculation involves the evaluation of the expectation\nvalues of all these individual strings. This introduces a major bottleneck for\napplications of VQEs in quantum chemistry. Unlike the fermionic Hamiltonian,\nthe terms in a qubit Hamiltonian are additive and the present paper exploits\nthis property to describe a new approach for extracting information from the\npartial qubit Hamiltonian of simple molecules to design more efficient\nvariational quantum eigensolvers. In the partial (qubit) Hamiltonian approach\n(PHA), the qubit Hamiltonian is studied term-by-term to understand their\nrelative contributions to the overall energy and a partial Hamiltonian is\nconstructed with fewer Pauli strings that can resolve the entire Hamiltonian.\nWith PHA, we can simulate molecules at a much lower computational cost with a\ntruncated Hamiltonian. Additionally, the outcomes of the measurements with PHA\nquench the error due to noise introduced by the quantum circuits. We have also\ndemonstrated the application of PHA as an initialization technique, where the\nsimple partial Hamiltonian can be used to find a suitable initial state for a\nmore complex system. The results of this study have the potential to\ndemonstrate the potential advancement in the field of quantum computing and its\nimplementation in quantum chemistry.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:25:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Singh","Harshdeep",""],["Mishra","Sabyashachi",""],["Majumder","Sonjoy",""]]}
{"id":"2308.12525","submitter":"Polykarpos Thomadakis","authors":"Polykarpos Thomadakis and Nikos Chrisochoides","title":"Experience with Distributed Memory Delaunay-based Image-to-Mesh\n  Conversion Implementation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper presents some of our findings on the scalability of parallel 3D\nmesh generation on distributed memory machines. The primary objective of this\nstudy was to evaluate a distributed memory approach for implementing a 3D\nparallel Delaunay-based algorithm that converts images to meshes by leveraging\nan efficient shared memory implementation. The secondary objective was to\nevaluate the effectiveness of labor (i.e., reduce development time) while\nintroducing minimal overheads to maintain the parallel efficiency of the\nend-product i.e., distributed implementation. The distributed algorithm\nutilizes two existing and independently developed parallel Delaunay-based\nmethods: (1) a fine-grained method that employs multi-threading and speculative\nexecution on shared memory nodes and (2) a loosely coupled Delaunay-refinement\nframework for multi-node platforms. The shared memory implementation uses a\nFIFO work-sharing scheme for thread scheduling, while the distributed memory\nimplementation utilizes the MPI and the Master-Worker (MW) model. The findings\nfrom the specific MPI-MW implementation we tested suggest that the execution on\n(1) 40 cores not necessary in the same single node is 2.3 times faster than the\nexecution on ten cores, (2) the best speedup is 5.4 with 180 cores again the\ncomparison is with the best performance on ten cores. A closer look at the\nperformance of distributed memory and shared memory implementation executing on\na single node (40 cores) suggest that the overheads introduced in the MPI-MW\nimplementation are high and render the MPI-MW implementation 4 times slower\nthan the shared memory code using the same number of cores. These findings\nraise several questions on the potential scalability of a \"black box\" approach,\ni.e., re-using a code designed to execute efficiently on shared memory machines\nwithout considering its potential use in a distributed memory setting.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:30:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Thomadakis","Polykarpos",""],["Chrisochoides","Nikos",""]]}
{"id":"2308.12526","submitter":"Yu Zheng","authors":"Yu Zheng, Yajun Zhang, Chuanying Niu, Yibin Zhan, Yanhua Long,\n  Dongxing Xu","title":"UNISOUND System for VoxCeleb Speaker Recognition Challenge 2023","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report describes the UNISOUND submission for Track1 and Track2 of\nVoxCeleb Speaker Recognition Challenge 2023 (VoxSRC 2023). We submit the same\nsystem on Track 1 and Track 2, which is trained with only VoxCeleb2-dev.\nLarge-scale ResNet and RepVGG architectures are developed for the challenge. We\npropose a consistency-aware score calibration method, which leverages the\nstability of audio voiceprints in similarity score by a Consistency Measure\nFactor (CMF). CMF brings a huge performance boost in this challenge. Our final\nsystem is a fusion of six models and achieves the first place in Track 1 and\nsecond place in Track 2 of VoxSRC 2023. The minDCF of our submission is 0.0855\nand the EER is 1.5880%.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:30:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zheng","Yu",""],["Zhang","Yajun",""],["Niu","Chuanying",""],["Zhan","Yibin",""],["Long","Yanhua",""],["Xu","Dongxing",""]]}
{"id":"2308.12527","submitter":"Hosea Wondo","authors":"Hosea Wondo, Zhou Zhang","title":"Independence of Singularity Type for Numerically Effective\n  K\\\"ahler-Ricci Flows","comments":"13 pages, 2 figures, any comments welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we show that the singularity type of solutions to the\nK\\\"aher-Ricci flow on a numerically effective manifold does not depend on the\ninitial metric. More precisely if there exists a type III solution to the\nK\\\"ahler-Ricci flow, then any other solution starting from a different initial\nmetric will also be Type III. This generalises previous results by Y. Zhang for\nthe semi-ample case.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:32:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wondo","Hosea",""],["Zhang","Zhou",""]]}
{"id":"2308.12528","submitter":"Yogesh D.","authors":"Yogesh D., Neeraja Sahasrabudhe","title":"Urns with Multiple Drawings and Graph-based Interaction","comments":"31 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider a finite undirected graph and place an urn with balls of two colours\nat each vertex. At every discrete time-step, for each urn, a fixed number of\nballs are drawn from that same urn with probability $p$, and from a randomly\nchosen neighbour of that urn with probability $1-p$. Based on what is drawn,\nthe urns then reinforce themselves or their neighbours. For every ball of a\ngiven colour in the sample, in case of P\\'olya-type reinforcement, a constant\nmultiple of balls of that colour is added while in case of Friedman-type\nreinforcement, balls of the other colour are reinforced. These different\nchoices for reinforcement give rise to multiple models. In this paper, we study\nthe convergence of the fraction of balls of either colour across urns for all\nof these models. We show that in most cases the urns synchronize, that is, the\nfraction of balls of either colour in each urn converges to the same limit\nalmost surely. A different kind of asymptotic behaviour is observed on\nbipartite graphs. We also prove similar results for the case of finite directed\ngraphs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:35:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["D.","Yogesh",""],["Sahasrabudhe","Neeraja",""]]}
{"id":"2308.12529","submitter":"Pengbo Lee","authors":"Pengbo Li, Ting Gao, Huifang Huang, Jiani Cheng, Shuhong Gao, Zhigang\n  Zeng and Jinqiao Duan","title":"Privacy-Preserving Discretized Spiking Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rapid development of artificial intelligence has brought considerable\nconvenience, yet also introduces significant security risks. One of the\nresearch hotspots is to balance data privacy and utility in the real world of\nartificial intelligence. The present second-generation artificial neural\nnetworks have made tremendous advances, but some big models could have really\nhigh computational costs. The third-generation neural network, SNN (Spiking\nNeural Network), mimics real neurons by using discrete spike signals, whose\nsequences exhibit strong sparsity, providing advantages such as low energy\nconsumption and high efficiency. In this paper, we construct a framework to\nevaluate the homomorphic computation of SNN named FHE-DiSNN that enables SNN to\nachieve good prediction performance on encrypted data. First, benefitting from\nthe discrete nature of spike signals, our proposed model avoids the errors\nintroduced by discretizing activation functions. Second, by applying\nbootstrapping, we design new private preserving functions FHE-Fire and\nFHE-Reset, through which noise can be refreshed, allowing us to evaluate SNN\nfor an arbitrary number of operations. Furthermore, We improve the\ncomputational efficiency of FHE-DiSNN while maintaining a high level of\naccuracy. Finally, we evaluate our model on the MNIST dataset. The experiments\nshow that FHE-DiSNN with 30 neurons in the hidden layer achieves a minimum\nprediction accuracy of 94.4%. Under optimal parameters, it achieves a 95.1%\naccuracy, with only a 0.6% decrease compared to the original SNN (95.7%). These\nresults demonstrate the superiority of SNN over second-generation neural\nnetworks for homomorphic evaluation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:38:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Pengbo",""],["Gao","Ting",""],["Huang","Huifang",""],["Cheng","Jiani",""],["Gao","Shuhong",""],["Zeng","Zhigang",""],["Duan","Jinqiao",""]]}
{"id":"2308.12530","submitter":"Shengchao Yuan","authors":"Shengchao Yuan, Yishun Dou, Rui Shi, Bingbing Ni, Zhong Zheng","title":"SieveNet: Selecting Point-Based Features for Mesh Networks","comments":"The project homepage is https://sievenet.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Meshes are widely used in 3D computer vision and graphics, but their\nirregular topology poses challenges in applying them to existing neural network\narchitectures. Recent advances in mesh neural networks turn to remeshing and\npush the boundary of pioneer methods that solely take the raw meshes as input.\nAlthough the remeshing offers a regular topology that significantly facilitates\nthe design of mesh network architectures, features extracted from such remeshed\nproxies may struggle to retain the underlying geometry faithfully, limiting the\nsubsequent neural network's capacity. To address this issue, we propose\nSieveNet, a novel paradigm that takes into account both the regular topology\nand the exact geometry. Specifically, this method utilizes structured mesh\ntopology from remeshing and accurate geometric information from\ndistortion-aware point sampling on the surface of the original mesh.\nFurthermore, our method eliminates the need for hand-crafted feature\nengineering and can leverage off-the-shelf network architectures such as the\nvision transformer. Comprehensive experimental results on classification and\nsegmentation tasks well demonstrate the effectiveness and superiority of our\nmethod.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:40:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yuan","Shengchao",""],["Dou","Yishun",""],["Shi","Rui",""],["Ni","Bingbing",""],["Zheng","Zhong",""]]}
{"id":"2308.12531","submitter":"Wenjun Kong","authors":"Wenjun Kong and Yamei Xia","title":"CARE: Co-Attention Network for Joint Entity and Relation Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Joint entity and relation extraction is the fundamental task of information\nextraction, consisting of two subtasks: named entity recognition and relation\nextraction. Most existing joint extraction methods suffer from issues of\nfeature confusion or inadequate interaction between two subtasks. In this work,\nwe propose a Co-Attention network for joint entity and Relation Extraction\n(CARE). Our approach involves learning separate representations for each\nsubtask, aiming to avoid feature overlap. At the core of our approach is the\nco-attention module that captures two-way interaction between two subtasks,\nallowing the model to leverage entity information for relation prediction and\nvice versa, thus promoting mutual enhancement. Extensive experiments on three\njoint entity-relation extraction benchmark datasets (NYT, WebNLG and SciERC)\nshow that our proposed model achieves superior performance, surpassing existing\nbaseline models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:40:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kong","Wenjun",""],["Xia","Yamei",""]]}
{"id":"2308.12532","submitter":"Gihun Lee","authors":"Gihun Lee, Minchan Jeong, Sangmook Kim, Jaehoon Oh, Se-Young Yun","title":"FedSoL: Bridging Global Alignment and Local Generality in Federated\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) aggregates locally trained models from individual\nclients to construct a global model. While FL enables learning a model with\ndata privacy, it often suffers from significant performance degradation when\nclient data distributions are heterogeneous. Many previous FL algorithms have\naddressed this issue by introducing various proximal restrictions. These\nrestrictions aim to encourage global alignment by constraining the deviation of\nlocal learning from the global objective. However, they inherently limit local\nlearning by interfering with the original local objectives. Recently, an\nalternative approach has emerged to improve local learning generality. By\nobtaining local models within a smooth loss landscape, this approach mitigates\nconflicts among different local objectives of the clients. Yet, it does not\nensure stable global alignment, as local learning does not take the global\nobjective into account. In this study, we propose Federated Stability on\nLearning (FedSoL), which combines both the concepts of global alignment and\nlocal generality. In FedSoL, the local learning seeks a parameter region robust\nagainst proximal perturbations. This strategy introduces an implicit proximal\nrestriction effect in local learning while maintaining the original local\nobjective for parameter update. Our experiments show that FedSoL consistently\nachieves state-of-the-art performance on various setups.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:43:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lee","Gihun",""],["Jeong","Minchan",""],["Kim","Sangmook",""],["Oh","Jaehoon",""],["Yun","Se-Young",""]]}
{"id":"2308.12533","submitter":"Quanjun Zhang","authors":"Quanjun Zhang, Chunrong Fang, Bowen Yu, Weisong Sun, Tongke Zhang,\n  Zhenyu Chen","title":"Pre-trained Model-based Automated Software Vulnerability Repair: How Far\n  are We?","comments":"Accepted to IEEE Transactions on Dependable and Secure Computing 2023\n  (TDSC'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Various approaches are proposed to help under-resourced security researchers\nto detect and analyze software vulnerabilities. It is still incredibly\ntime-consuming and labor-intensive for security researchers to fix\nvulnerabilities. The time lag between reporting and fixing a vulnerability\ncauses software systems to suffer from significant exposure to possible\nattacks. Recently, some techniques have proposed applying pre-trained models to\nfix security vulnerabilities and have proved their success in improving repair\naccuracy. However, the effectiveness of existing pre-trained models has not\nbeen systematically analyzed, and little is known about their advantages and\ndisadvantages.\n  To bridge this gap, we perform the first extensive study on applying various\npre-trained models to vulnerability repair. The results show that studied\npre-trained models consistently outperform the state-of-the-art technique\nVRepair with a prediction accuracy of 32.94%~44.96%. We also investigate the\nimpact of major phases in the vulnerability repair workflow. Surprisingly, a\nsimplistic approach adopting transfer learning improves the prediction accuracy\nof pre-trained models by 9.40% on average. Besides, we provide additional\ndiscussion to illustrate the capacity and limitations of pre-trained models.\nFinally, we further pinpoint various practical guidelines for advancing\npre-trained model-based vulnerability repair. Our study highlights the\npromising future of adopting pre-trained models to patch real-world\nvulnerabilities.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:43:10 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 01:34:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Quanjun",""],["Fang","Chunrong",""],["Yu","Bowen",""],["Sun","Weisong",""],["Zhang","Tongke",""],["Chen","Zhenyu",""]]}
{"id":"2308.12534","submitter":"Zikun Zhou","authors":"Zikun Zhou, Shukun Wu, Guoqing Zhu, Hongpeng Wang, Zhenyu He","title":"Channel and Spatial Relation-Propagation Network for RGB-Thermal\n  Semantic Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  RGB-Thermal (RGB-T) semantic segmentation has shown great potential in\nhandling low-light conditions where RGB-based segmentation is hindered by poor\nRGB imaging quality. The key to RGB-T semantic segmentation is to effectively\nleverage the complementarity nature of RGB and thermal images. Most existing\nalgorithms fuse RGB and thermal information in feature space via concatenation,\nelement-wise summation, or attention operations in either unidirectional\nenhancement or bidirectional aggregation manners. However, they usually\noverlook the modality gap between RGB and thermal images during feature fusion,\nresulting in modality-specific information from one modality contaminating the\nother. In this paper, we propose a Channel and Spatial Relation-Propagation\nNetwork (CSRPNet) for RGB-T semantic segmentation, which propagates only\nmodality-shared information across different modalities and alleviates the\nmodality-specific information contamination issue. Our CSRPNet first performs\nrelation-propagation in channel and spatial dimensions to capture the\nmodality-shared features from the RGB and thermal features. CSRPNet then\naggregates the modality-shared features captured from one modality with the\ninput feature from the other modality to enhance the input feature without the\ncontamination issue. While being fused together, the enhanced RGB and thermal\nfeatures will be also fed into the subsequent RGB or thermal feature extraction\nlayers for interactive feature fusion, respectively. We also introduce a\ndual-path cascaded feature refinement module that aggregates multi-layer\nfeatures to produce two refined features for semantic and boundary prediction.\nExtensive experimental results demonstrate that CSRPNet performs favorably\nagainst state-of-the-art algorithms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:43:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhou","Zikun",""],["Wu","Shukun",""],["Zhu","Guoqing",""],["Wang","Hongpeng",""],["He","Zhenyu",""]]}
{"id":"2308.12535","submitter":"Ao Luo","authors":"Ao Luo, Linxin Song, Keisuke Nonaka, Kyohei Unno, Heming Sun, Masayuki\n  Goto, Jiro Katto","title":"SCP: Spherical-Coordinate-based Learned Point Cloud Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In recent years, the task of learned point cloud compression has gained\nprominence. An important type of point cloud, the spinning LiDAR point cloud,\nis generated by spinning LiDAR on vehicles. This process results in numerous\ncircular shapes and azimuthal angle invariance features within the point\nclouds. However, these two features have been largely overlooked by previous\nmethodologies. In this paper, we introduce a model-agnostic method called\nSpherical-Coordinate-based learned Point cloud compression (SCP), designed to\nleverage the aforementioned features fully. Additionally, we propose a\nmulti-level Octree for SCP to mitigate the reconstruction error for distant\nareas within the Spherical-coordinate-based Octree. SCP exhibits excellent\nuniversality, making it applicable to various learned point cloud compression\ntechniques. Experimental results demonstrate that SCP surpasses previous\nstate-of-the-art methods by up to 29.14% in point-to-point PSNR BD-Rate.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:44:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Luo","Ao",""],["Song","Linxin",""],["Nonaka","Keisuke",""],["Unno","Kyohei",""],["Sun","Heming",""],["Goto","Masayuki",""],["Katto","Jiro",""]]}
{"id":"2308.12536","submitter":"Atta Ur Rahman","authors":"Atta ur Rahman, Liu Aoxiang, Saeed haddadi, Cong-Feng Qiao","title":"Advantage of gravitational cat states in preserving non-classical\n  characteristics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate how resourceful gravitational cat states are to preserve\nquantum correlations. In this regard, we explore the dynamics of gravitational\ncat states under different situations such as thermal, classical stochastic,\ngeneral decaying, and power-law noisy fields. In particular, the one-way\nsteerability, Bell non-locality, entanglement, and purity in two qubits are our\nmain focus. We also address the weak measurement reversal protocol on the\ndynamics of quantum correlations and purity of the state. Our results show that\nthe gravitational cat states have a reliable and better capacity to preserve\nquantum correlations and remain one of the good resources for the deployment of\nquantum information processing protocols.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:47:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rahman","Atta ur",""],["Aoxiang","Liu",""],["haddadi","Saeed",""],["Qiao","Cong-Feng",""]]}
{"id":"2308.12537","submitter":"Weikun Zhang","authors":"Zichao Dong, Weikun Zhang, Xufeng Huang, Hang Ji, Xin Zhan, Junbo Chen","title":"HuBo-VLM: Unified Vision-Language Model designed for HUman roBOt\n  interaction tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human robot interaction is an exciting task, which aimed to guide robots\nfollowing instructions from human. Since huge gap lies between human natural\nlanguage and machine codes, end to end human robot interaction models is fair\nchallenging. Further, visual information receiving from sensors of robot is\nalso a hard language for robot to perceive. In this work, HuBo-VLM is proposed\nto tackle perception tasks associated with human robot interaction including\nobject detection and visual grounding by a unified transformer based vision\nlanguage model. Extensive experiments on the Talk2Car benchmark demonstrate the\neffectiveness of our approach. Code would be publicly available in\nhttps://github.com/dzcgaara/HuBo-VLM.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:47:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dong","Zichao",""],["Zhang","Weikun",""],["Huang","Xufeng",""],["Ji","Hang",""],["Zhan","Xin",""],["Chen","Junbo",""]]}
{"id":"2308.12538","submitter":"Yuanshen Guan","authors":"Yuanshen Guan, Ruikang Xu, Mingde Yao, Lizhi Wang, Zhiwei Xiong","title":"Mutual-Guided Dynamic Network for Image Fusion","comments":"ACMMM 2023 accepted","journal-ref":null,"doi":"10.1145/3581783.3612261","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Image fusion aims to generate a high-quality image from multiple images\ncaptured under varying conditions. The key problem of this task is to preserve\ncomplementary information while filtering out irrelevant information for the\nfused result. However, existing methods address this problem by leveraging\nstatic convolutional neural networks (CNNs), suffering two inherent limitations\nduring feature extraction, i.e., being unable to handle spatial-variant\ncontents and lacking guidance from multiple inputs. In this paper, we propose a\nnovel mutual-guided dynamic network (MGDN) for image fusion, which allows for\neffective information utilization across different locations and inputs.\nSpecifically, we design a mutual-guided dynamic filter (MGDF) for adaptive\nfeature extraction, composed of a mutual-guided cross-attention (MGCA) module\nand a dynamic filter predictor, where the former incorporates additional\nguidance from different inputs and the latter generates spatial-variant kernels\nfor different locations. In addition, we introduce a parallel feature fusion\n(PFF) module to effectively fuse local and global information of the extracted\nfeatures. To further reduce the redundancy among the extracted features while\nsimultaneously preserving their shared structural information, we devise a\nnovel loss function that combines the minimization of normalized mutual\ninformation (NMI) with an estimated gradient mask. Experimental results on five\nbenchmark datasets demonstrate that our proposed method outperforms existing\nmethods on four image fusion tasks. The code and model are publicly available\nat: https://github.com/Guanys-dar/MGDN.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:50:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guan","Yuanshen",""],["Xu","Ruikang",""],["Yao","Mingde",""],["Wang","Lizhi",""],["Xiong","Zhiwei",""]]}
{"id":"2308.12539","submitter":"Vipul Gupta","authors":"Vipul Gupta, Pranav Narayanan Venkit, Hugo Lauren\\c{c}on, Shomir\n  Wilson, Rebecca J. Passonneau","title":"CALM : A Multi-task Benchmark for Comprehensive Assessment of Language\n  Model Bias","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As language models (LMs) become increasingly powerful, it is important to\nquantify and compare them for sociodemographic bias with potential for harm.\nPrior bias measurement datasets are sensitive to perturbations in their\nmanually designed templates, therefore unreliable. To achieve reliability, we\nintroduce the Comprehensive Assessment of Language Model bias (CALM), a\nbenchmark dataset to quantify bias in LMs across three tasks. We integrate 16\nexisting datasets across different domains, such as Wikipedia and news\narticles, to filter 224 templates from which we construct a dataset of 78,400\nexamples. We compare the diversity of CALM with prior datasets on metrics such\nas average semantic similarity, and variation in template length, and test the\nsensitivity to small perturbations. We show that our dataset is more diverse\nand reliable than previous datasets, thus better capture the breadth of\nlinguistic variation required to reliably evaluate model bias. We evaluate 20\nlarge language models including six prominent families of LMs such as Llama-2.\nIn two LM series, OPT and Bloom, we found that larger parameter models are more\nbiased than lower parameter models. We found the T0 series of models to be the\nleast biased. Furthermore, we noticed a tradeoff between gender and racial bias\nwith increasing model size in some model series. The code is available at\nhttps://github.com/vipulgupta1011/CALM.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:53:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gupta","Vipul",""],["Venkit","Pranav Narayanan",""],["Lauren\u00e7on","Hugo",""],["Wilson","Shomir",""],["Passonneau","Rebecca J.",""]]}
{"id":"2308.12540","submitter":"Yidong Zhou","authors":"Yidong Zhou and Hans-Georg M\\\"uller","title":"Wasserstein Regression with Empirical Measures and Density Estimation\n  for Sparse Data","comments":"27 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of modeling the relationship between univariate distributions and\none or more explanatory variables has found increasing interest. Traditional\nfunctional data methods cannot be applied directly to distributional data\nbecause of their inherent constraints. Modeling distributions as elements of\nthe Wasserstein space, a geodesic metric space equipped with the Wasserstein\nmetric that is related to optimal transport, is attractive for statistical\napplications. Existing approaches proceed by substituting proxy estimated\ndistributions for the typically unknown response distributions. These estimates\nare obtained from available data but are problematic when for some of the\ndistributions only few data are available. Such situations are common in\npractice and cannot be addressed with available approaches, especially when one\naims at density estimates. We show how this and other problems associated with\ndensity estimation such as tuning parameter selection and bias issues can be\nside-stepped when covariates are available. We also introduce a novel version\nof distribution-response regression that is based on empirical measures. By\navoiding the preprocessing step of recovering complete individual response\ndistributions, the proposed approach is applicable when the sample size\navailable for some of the distributions is small. In this case, one can still\nobtain consistent distribution estimates even for distributions with only few\ndata by gaining strength across the entire sample of distributions, while\ntraditional approaches where distributions or densities are estimated\nindividually fail, since sparsely sampled densities cannot be consistently\nestimated. The proposed model is demonstrated to outperform existing approaches\nthrough simulations. Its efficacy is corroborated in two case studies on\nEnvironmental Influences on Child Health Outcomes (ECHO) data and eBay auction\ndata.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:54:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhou","Yidong",""],["M\u00fcller","Hans-Georg",""]]}
{"id":"2308.12541","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan","title":"Quillen's Plus Construction and the D(2) problem","comments":"Paper published in peer reviewed journal in 2009","journal-ref":"Algebr. Geom. Topol. 9 (2009), Issue 3, pp. 1399-1411","doi":"10.2140/agt.2009.9.1399","report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a finite connected 3-complex with cohomological dimension 2, we show it\nmay be constructed up to homotopy by applying the Quillen plus construction to\nthe Cayley complex of a finite group presentation. This reduces the D(2)\nproblem to a question about perfect normal subgroups.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:55:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""]]}
{"id":"2308.12542","submitter":"Faruque Ahamed","authors":"Gautam Kumar Biswas and Faruque Ahamed","title":"Financial Inclusion and Monetary Policy: A Study on the Relationship\n  between Financial Inclusion and Effectiveness of Monetary Policy in\n  Developing Countries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study analyzed the impact of financial inclusion on the effectiveness of\nmonetary policy in developing countries. By using a panel data set of 10\ndeveloping countries during 2004-2020, the study revealed that the financial\ninclusion measured by the number of ATM per 100,000 adults had a significant\nnegative effect on monetary policy, whereas the other measure of financial\ninclusion i.e. the number of bank accounts per 100,000 adults had a positive\nimpact on monetary policy, which is not statistically significant. The study\nalso revealed that foreign direct investment (FDI), lending rate and exchange\nrate had a positive impact on inflation, but only the effect of lending rate is\nstatistically significant. Therefore, the governments of these countries should\nmake necessary drives to increase the level of financial inclusion as it\nstabilizes the price level by reducing the inflation in the economy.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:57:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Biswas","Gautam Kumar",""],["Ahamed","Faruque",""]]}
{"id":"2308.12543","submitter":"Da-Cheng Yan","authors":"Da-Cheng Yan (Changzhou U.), Zhou Rui (NCUST, Taiyuan), Yan Yan\n  (Changzhou U.), Ya Li (Nanjing Agricultural U.)","title":"Study of four-body decays $B_{(s)} \\to (\\pi\\pi)(\\pi\\pi)$ in the\n  perturbative QCD approach","comments":"24 pages, 4 figures. arXiv admin note: text overlap with\n  arXiv:2204.01092","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we make a systematical study on the four-body $B_{(s)} \\to\n(\\pi\\pi)(\\pi\\pi)$ decays in the perturbative QCD approach, where the $\\pi\\pi$\ninvariant mass spectra are dominated by the vector resonance $\\rho(770)$ and\nthe scalar resonance $f_0(980)$. We improve the Gengenbauer moments for the\nlongitudinal $P$-wave two-pion distribution amplitudes (DAs) by fitting the\nPQCD factorization formulas to measured branching ratios of three-body and\nfour-body $B$ decays. With the fitted Gegenbauer moments, we make predictions\nfor the branching ratios and direct $CP$ asymmetries of four-body $B_{(s)} \\to\n(\\pi\\pi)(\\pi\\pi)$ decays. We extract the branching ratios of two-body $B_{(s)}\n\\to \\rho\\rho$ from the corresponding four-body decay modes and calculate the\nrelevant polarization fractions. We find that the ${\\cal B}(B^0 \\to\n\\rho^+\\rho^-)$ is consistent with the previous theoretical predictions and\ndata. The leading-order PQCD calculations of the ${\\cal B}(B^+\\to\n\\rho^+\\rho^0)$, ${\\cal B}(B^0\\to \\rho^0\\rho^0)$ and the $f_0(B^0\\to\n\\rho^0\\rho^0)$ are a bit lower than the experimental measurements, which should\nbe further examined. In addition, the \"true\" and \"fake\" triple-product\nasymmetries (TPAs) in the $B_{(s)}\\to (\\pi\\pi)(\\pi\\pi)$ decays are also\nanalyzed. The sizable averaged TPA ${\\cal A}_{\\text{T-true}}^{1,\n\\text{ave}}=25.26\\%$ of the color-suppressed decay $B^0\\to \\rho^0\\rho^0 \\to\n(\\pi^+\\pi^-)(\\pi^+\\pi^-)$ is predicted for the first time, which deviates a lot\nfrom the so-called \"true\" TPA $\\mathcal{A}_\\text{T-true}^1=7.92\\%$ due to the\nlarge direct $CP$ violation. A large \"fake\" TPA\n$\\mathcal{A}_\\text{T-fake}^1=24.96\\%$ of the decay $B^0\\to \\rho^0\\rho^0 \\to\n(\\pi^+\\pi^-)(\\pi^+\\pi^-)$ is also found, which indicates the significance of\nthe final-state interactions. The predictions in this work can be tested by\nLHCb and Belle-II experiments in the near future.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:58:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yan","Da-Cheng","","Changzhou U."],["Rui","Zhou","","NCUST, Taiyuan"],["Yan","Yan","","Changzhou U."],["Li","Ya","","Nanjing Agricultural U."]]}
{"id":"2308.12544","submitter":"Hsuan-Po Liu","authors":"Hsuan-Po Liu, Mahdi Soleymani, and Hessam Mahdavifar","title":"Analog Multi-Party Computing: Locally Differential Private Protocols for\n  Collaborative Computations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.CR cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a fully decentralized scenario in which no central trusted entity\nexists and all clients are honest-but-curious. The state-of-the-art approaches\nto this problem often rely on cryptographic protocols, such as multiparty\ncomputation (MPC), that require mapping real-valued data to a discrete\nalphabet, specifically a finite field. These approaches, however, can result in\nsubstantial accuracy losses due to computation overflows. To address this\nissue, we propose A-MPC, a private analog MPC protocol that performs all\ncomputations in the analog domain. We characterize the privacy of individual\ndatasets in terms of $(\\epsilon, \\delta)$-local differential privacy, where the\nprivacy of a single record in each client's dataset is guaranteed against other\nparticipants. In particular, we characterize the required noise variance in the\nGaussian mechanism in terms of the required $(\\epsilon,\\delta)$-local\ndifferential privacy parameters by solving an optimization problem.\nFurthermore, compared with existing decentralized protocols, A-MPC keeps the\nprivacy of individual datasets against the collusion of all other participants,\nthereby, in a notably significant improvement, increasing the maximum number of\ncolluding clients tolerated in the protocol by a factor of three compared with\nthe state-of-the-art collaborative learning protocols. Our experiments\nillustrate that the accuracy of the proposed $(\\epsilon,\\delta)$-locally\ndifferential private logistic regression and linear regression models trained\nin a fully-decentralized fashion using A-MPC closely follows that of a\ncentralized one performed by a single trusted entity.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:01:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Hsuan-Po",""],["Soleymani","Mahdi",""],["Mahdavifar","Hessam",""]]}
{"id":"2308.12545","submitter":"Donald Pinckney","authors":"Donald Pinckney, Federico Cassano, Arjun Guha, Jonathan Bell","title":"npm-follower: A Complete Dataset Tracking the NPM Ecosystem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software developers typically rely upon a large network of dependencies to\nbuild their applications. For instance, the NPM package repository contains\nover 3 million packages and serves tens of billions of downloads weekly.\nUnderstanding the structure and nature of packages, dependencies, and published\ncode requires datasets that provide researchers with easy access to metadata\nand code of packages. However, prior work on NPM dataset construction typically\nhas two limitations: 1) only metadata is scraped, and 2) packages or versions\nthat are deleted from NPM can not be scraped. Over 330,000 versions of packages\nwere deleted from NPM between July 2022 and May 2023. This data is critical for\nresearchers as it often pertains to important questions of security and\nmalware. We present npm-follower, a dataset and crawling architecture which\narchives metadata and code of all packages and versions as they are published,\nand is thus able to retain data which is later deleted. The dataset currently\nincludes over 35 million versions of packages, and grows at a rate of about 1\nmillion versions per month. The dataset is designed to be easily used by\nresearchers answering questions involving either metadata or program analysis.\nBoth the code and dataset are available at https://dependencies.science.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:05:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pinckney","Donald",""],["Cassano","Federico",""],["Guha","Arjun",""],["Bell","Jonathan",""]]}
{"id":"2308.12546","submitter":"Agustina Czenky","authors":"Akshaya Chakravarthy, Agustina Czenky, Julia Plavnik","title":"On modular categories with Frobenius-Perron dimension congruent to 2\n  modulo 4","comments":"Theorem 3.13 has been generalized","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We contribute to the classification of modular categories $\\mathcal{C}$ with\n$\\operatorname{FPdim}(\\mathcal{C})\\equiv 2 \\pmod 4$. We prove that such\ncategories have group of invertibles of even order, and that they factorize as\n$\\mathcal C\\cong \\widetilde{\\mathcal C} \\boxtimes \\operatorname{sem}$, where\n$\\widetilde{\\mathcal C}$ is an odd-dimensional modular category and\n$\\operatorname{sem}$ is the rank 2 pointed modular category. This reduces the\nclassification of these categories to the classification of odd-dimensional\nmodular categories. It follows that modular categories $\\mathcal C$ with\n$\\operatorname{FPdim}(\\mathcal{C})\\equiv 2 \\pmod 4$ of rank up to 46 are\npointed. More generally, we prove that if $\\mathcal C$ is a weakly integral MTC\nand $p$ is an odd prime dividing the order of the group of invertibles that has\nmultiplicity one in $\\operatorname{FPdim}(\\mathcal C)$, then we have a\nfactorization $\\mathcal C \\cong \\widetilde{\\mathcal C} \\boxtimes\n\\operatorname{Vec}_{\\mathbb Z_p}^{\\chi},$ for $\\widetilde{\\mathcal C}$ an MTC\nwith dimension not divisible by $p$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:09:18 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 02:14:58 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chakravarthy","Akshaya",""],["Czenky","Agustina",""],["Plavnik","Julia",""]]}
{"id":"2308.12547","submitter":"Rafael Zimmer","authors":"Rafael Zimmer and Marcos Sobral and Helio Azevedo","title":"Hybrid Models for Facial Emotion Recognition in Children","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper focuses on the use of emotion recognition techniques to assist\npsychologists in performing children's therapy through remotely robot operated\nsessions. In the field of psychology, the use of agent-mediated therapy is\ngrowing increasingly given recent advances in robotics and computer science.\nSpecifically, the use of Embodied Conversational Agents (ECA) as an\nintermediary tool can help professionals connect with children who face social\nchallenges such as Attention Deficit Hyperactivity Disorder (ADHD), Autism\nSpectrum Disorder (ASD) or even who are physically unavailable due to being in\nregions of armed conflict, natural disasters, or other circumstances. In this\ncontext, emotion recognition represents an important feedback for the\npsychotherapist. In this article, we initially present the result of a\nbibliographical research associated with emotion recognition in children. This\nresearch revealed an initial overview on algorithms and datasets widely used by\nthe community. Then, based on the analysis carried out on the results of the\nbibliographical research, we used the technique of dense optical flow features\nto improve the ability of identifying emotions in children in uncontrolled\nenvironments. From the output of a hybrid model of Convolutional Neural\nNetwork, two intermediary features are fused before being processed by a final\nclassifier. The proposed architecture was called HybridCNNFusion. Finally, we\npresent the initial results achieved in the recognition of children's emotions\nusing a dataset of Brazilian children.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:20:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zimmer","Rafael",""],["Sobral","Marcos",""],["Azevedo","Helio",""]]}
{"id":"2308.12548","submitter":"Yuyue Yan","authors":"Yuyue Yan, Takahiro Kawaguchi, Yuichiro Yano, Yuko Hanado, Takayuki\n  Ishizaki","title":"Relations Between Generalized JST Algorithm and Kalman Filtering\n  Algorithm for Time Scale Generation","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a generalized Japan Standard Time algorithm\n(JST-algo) for higher-order atomic clock ensembles and mathematically clarify\nthe relations of the (generalized) JST-algo and the conventional Kalman\nfiltering algorithm (CKF-algo) in the averaged atomic time and the clock\nresiduals for time scale generation. In particular, we reveal the fact that the\naveraged atomic time of the generalized JST-algo does not depend on the\nobservation noise even though the measurement signal is not filtered in the\nalgorithm. Furthermore, the prediction error of CKF- algo is rigorously shown\nby using the prediction error regarding an observable state space. It is\nmathematically shown that when the covariance matrices of system noises are\nidentical for all atomic clocks, considering equal averaging weights for the\nclocks is a necessary and sufficient condition to ensure equivalence between\nthe generalized JST-algo and CKF-algo in averaged atomic time. In such\nhomogeneous systems, a necessary and sufficient condition for observation\nnoises is presented to determine which algorithm can generate the clock\nresiduals with smaller variances. A couple of numerical examples comparing the\ngeneralized JST-algo and CKF-algo are provided to illustrate the efficacy of\nthe results.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:22:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yan","Yuyue",""],["Kawaguchi","Takahiro",""],["Yano","Yuichiro",""],["Hanado","Yuko",""],["Ishizaki","Takayuki",""]]}
{"id":"2308.12549","submitter":"Teli Ma","authors":"Teli Ma, Mengmeng Wang, Jimin Xiao, Huifeng Wu, Yong Liu","title":"Synchronize Feature Extracting and Matching: A Single Branch Framework\n  for 3D Object Tracking","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Siamese network has been a de facto benchmark framework for 3D LiDAR object\ntracking with a shared-parametric encoder extracting features from template and\nsearch region, respectively. This paradigm relies heavily on an additional\nmatching network to model the cross-correlation/similarity of the template and\nsearch region. In this paper, we forsake the conventional Siamese paradigm and\npropose a novel single-branch framework, SyncTrack, synchronizing the feature\nextracting and matching to avoid forwarding encoder twice for template and\nsearch region as well as introducing extra parameters of matching network. The\nsynchronization mechanism is based on the dynamic affinity of the Transformer,\nand an in-depth analysis of the relevance is provided theoretically. Moreover,\nbased on the synchronization, we introduce a novel Attentive Points-Sampling\nstrategy into the Transformer layers (APST), replacing the random/Farthest\nPoints Sampling (FPS) method with sampling under the supervision of attentive\nrelations between the template and search region. It implies connecting\npoint-wise sampling with the feature learning, beneficial to aggregating more\ndistinctive and geometric features for tracking with sparse points. Extensive\nexperiments on two benchmark datasets (KITTI and NuScenes) show that SyncTrack\nachieves state-of-the-art performance in real-time tracking.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:28:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ma","Teli",""],["Wang","Mengmeng",""],["Xiao","Jimin",""],["Wu","Huifeng",""],["Liu","Yong",""]]}
{"id":"2308.12550","submitter":"Yashar Mousavi","authors":"Yashar Mousavi","title":"Optimal and Robust Fault Tolerant Control of Wind Turbines Working under\n  Sensor, Actuator, and System Faults","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the increasing concerns over environmental challenges such as\nglobal warming and the exhaustion of fossil-fuel reserves, the renewable energy\nindustry has become the most demanded electrical energy production source\nworldwide. In this context, wind energy conversion systems (WECSs) are the most\ndominant and fastest-growing alternative energy production technologies,\nplaying an increasingly vital role in renewable power generation. To tackle the\npitch control problem of WECSs, this thesis proposes an optimal fault-tolerant\nfractional-order pitch control strategy for pitch angle regulation of WT blades\nsubjected to sensor, actuator, and system faults. To showcast the effects of\nfaults, changes in the system parameters are considered as a result of sensor,\nactuator and system faults with various levels of severity.} Furthermore,\ntaking advantage of the favourable merits of higher-order SMCs and fractional\ncalculus, this thesis develops a fault-tolerant fractional-calculus-based\nhigher-order sliding mode controller for optimum rotor speed tracking and power\nproduction maximization of WECSs. \\textcolor{black}{The partial loss of the\ngenerator output torque is considered as an actuator failure, leading to loss\nof partial actuation power. Moreover, active fault-tolerant fractional-order\nhigher-order SMC strategies are developed for rotor current regulation and\nspeed trajectory tracking of doubly-fed induction generator (DFIG) -driven\nWECSs subjected to model uncertainties and rotor current sensor faults. The\ndeveloped controllers are augmented with two state observers, an algebraic\nstate estimator and a sliding mode observer, to estimate the rotor current\ndynamics during sensors' faults.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:31:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mousavi","Yashar",""]]}
{"id":"2308.12551","submitter":"Weiqi Zhang","authors":"Weiqi Zhang, Jianfeng Zhang, Jia Li, Fugee Tsung","title":"A Co-training Approach for Noisy Time Series Learning","comments":"Accepted by CIKM2023","journal-ref":null,"doi":"10.1145/3583780.3614759","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we focus on robust time series representation learning. Our\nassumption is that real-world time series is noisy and complementary\ninformation from different views of the same time series plays an important\nrole while analyzing noisy input. Based on this, we create two views for the\ninput time series through two different encoders. We conduct co-training based\ncontrastive learning iteratively to learn the encoders. Our experiments\ndemonstrate that this co-training approach leads to a significant improvement\nin performance. Especially, by leveraging the complementary information from\ndifferent views, our proposed TS-CoT method can mitigate the impact of data\nnoise and corruption. Empirical evaluations on four time series benchmarks in\nunsupervised and semi-supervised settings reveal that TS-CoT outperforms\nexisting methods. Furthermore, the representations learned by TS-CoT can\ntransfer well to downstream tasks through fine-tuning.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:33:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Weiqi",""],["Zhang","Jianfeng",""],["Li","Jia",""],["Tsung","Fugee",""]]}
{"id":"2308.12552","submitter":"N. Anders Petersson","authors":"Mohammad Motamed and N. Anders Petersson","title":"Gaussian Process-based Bayesian Quantum Characterization","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":"LLNL-JRNL-853217","categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a Bayesian quantum characterization framework that takes into\naccount uncertainties from both experimental data and the dynamical modeling of\nthe experiment. We demonstrate that ignoring dynamical model uncertainty may\nlead to predictions that are inconsistent with the uncertainty present in\nquantum data. A Bayesian framework is proposed and applied to characterize a\ntantalum-based transmon device at Lawrence Livermore National Laboratory. We\ndemonstrate how modeling uncertainty can be represented by a Gaussian process\nwithin the Bayesian framework, and how this approach improves the predictive\ncapability of Lindblad's master equations applied to the Ramsey measurement\nprotocol.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:39:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Motamed","Mohammad",""],["Petersson","N. Anders",""]]}
{"id":"2308.12553","submitter":"Aahlad Manas Puli","authors":"Aahlad Puli, Lily Zhang, Yoav Wald, Rajesh Ranganath","title":"Don't blame Dataset Shift! Shortcut Learning due to Gradients and Cross\n  Entropy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Common explanations for shortcut learning assume that the shortcut improves\nprediction under the training distribution but not in the test distribution.\nThus, models trained via the typical gradient-based optimization of\ncross-entropy, which we call default-ERM, utilize the shortcut. However, even\nwhen the stable feature determines the label in the training distribution and\nthe shortcut does not provide any additional information, like in perception\ntasks, default-ERM still exhibits shortcut learning. Why are such solutions\npreferred when the loss for default-ERM can be driven to zero using the stable\nfeature alone? By studying a linear perception task, we show that default-ERM's\npreference for maximizing the margin leads to models that depend more on the\nshortcut than the stable feature, even without overparameterization. This\ninsight suggests that default-ERM's implicit inductive bias towards max-margin\nis unsuitable for perception tasks. Instead, we develop an inductive bias\ntoward uniform margins and show that this bias guarantees dependence only on\nthe perfect stable feature in the linear perception task. We develop loss\nfunctions that encourage uniform-margin solutions, called margin control\n(MARG-CTRL). MARG-CTRL mitigates shortcut learning on a variety of vision and\nlanguage tasks, showing that better inductive biases can remove the need for\nexpensive two-stage shortcut-mitigating methods in perception tasks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:39:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Puli","Aahlad",""],["Zhang","Lily",""],["Wald","Yoav",""],["Ranganath","Rajesh",""]]}
{"id":"2308.12554","submitter":"Yang Li","authors":"Yang Li, Fanjin Bu, Zhen Yang, Bin Wang, Meng Han","title":"Deep Reinforcement Learning-driven Cross-Community Energy Interaction\n  Optimal Scheduling","comments":"in Chinese language, Accepted by Electric Power Construction","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In order to coordinate energy interactions among various communities and\nenergy conversions among multi-energy subsystems within the multi-community\nintegrated energy system under uncertain conditions, and achieve overall\noptimization and scheduling of the comprehensive energy system, this paper\nproposes a comprehensive scheduling model that utilizes a multi-agent deep\nreinforcement learning algorithm to learn load characteristics of different\ncommunities and make decisions based on this knowledge. In this model, the\nscheduling problem of the integrated energy system is transformed into a Markov\ndecision process and solved using a data-driven deep reinforcement learning\nalgorithm, which avoids the need for modeling complex energy coupling\nrelationships between multi-communities and multi-energy subsystems. The\nsimulation results show that the proposed method effectively captures the load\ncharacteristics of different communities and utilizes their complementary\nfeatures to coordinate reasonable energy interactions among them. This leads to\na reduction in wind curtailment rate from 16.3% to 0% and lowers the overall\noperating cost by 5445.6 Yuan, demonstrating significant economic and\nenvironmental benefits.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:42:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Yang",""],["Bu","Fanjin",""],["Yang","Zhen",""],["Wang","Bin",""],["Han","Meng",""]]}
{"id":"2308.12555","submitter":"Gordon Heier","authors":"Minzi Chen, Gordon Heier","title":"On positive semi-definite holomorphic sectional curvature with many\n  zeroes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AG math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish the existence of complete K\\\"ahler metrics of semi-positive\nholomorphic sectional curvature with many zeroes in an interesting and natural\ngeometric setting. Specifically, we use Calabi's Ansatz in the form due to\nKoiso-Sakane to produce such metrics on the total space of powers of the\ntautological line bundles over the projective line. We formulate a general\nconjecture regarding the compact case and use a product approach to obtain an\nanalogous result in the non-compact case.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:43:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Minzi",""],["Heier","Gordon",""]]}
{"id":"2308.12556","submitter":"Hoernisa Iminniyaz","authors":"Fangyu Liu, Hoernisa Iminniyaz","title":"Relic abundance of dark matter with coannihilation in non-standard\n  cosmological scenarios","comments":"15 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We investigate the relic abundance of dark matter from coannihilation in\nnon-standard cosmological scenarios. We explore the effect of coannihilation on\nthe relic density of dark matter and freeze out temperature in quintessence\nmodel with kination phase and brane world cosmological scenarios. Since the\nHubble expansion rate is enhanced in quintessence and brane world cosmological\nmodels, it causes the larger relic density comparing to the standard one. On\nthe other hand, the relic density of dark matter is decreased due to the\ncoannihilation in the standard cosmological scenario. In quintessence or brane\nworld cosmological scenarios, we find the decrease of the relic density of dark\nmatter is slightly slower than that in the standard cosmological scenario.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:51:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Fangyu",""],["Iminniyaz","Hoernisa",""]]}
{"id":"2308.12557","submitter":"Luo Sheng","authors":"Sheng Luo, Chuang-Han Hsu, Guoqing Chang, Arun Bansil, Hsin Lin,\n  Gengchiau Liang","title":"Real Space Characterization of Nonlinear Hall Effect in Confined\n  Directions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The nonlinear Hall effect (NLHE) is a phenomenon which could produce a\ntransverse Hall voltage in a time-reversal-invariant material. Here, we report\nthe real space characterization of NLHE evaluated through quantum transport in\nTaIrTe4 nanoribbon without the explicit Berry curvature dipole (BCD)\ninformation. We first characterize the NLHE in both transverse confined\ndirections in global-level measurement. The impact of quantum confinement in\nNLHE is evaluated by adjusting the width of nanoribbons. Then, the probing area\nis trimmed to the atomic scale to evaluate the local texture, where we discover\nits unique patterns among the probed atomic groups for the first time. The\nanalysis of charge distribution reveals the connections between NLHE's local\npatterns and its non-centrosymmetric nature, rendering nearly an order of Hall\nvoltage enhancement through probe positioning. Our work paves the way to expand\nthe range of NLHE study and unveil its physics in more versatile material\nsystems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:51:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Luo","Sheng",""],["Hsu","Chuang-Han",""],["Chang","Guoqing",""],["Bansil","Arun",""],["Lin","Hsin",""],["Liang","Gengchiau",""]]}
{"id":"2308.12558","submitter":"Jie Hong","authors":"Jie Hong, Zeeshan Hayder, Junlin Han, Pengfei Fang, Mehrtash Harandi\n  and Lars Petersson","title":"Hyperbolic Audio-visual Zero-shot Learning","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Audio-visual zero-shot learning aims to classify samples consisting of a pair\nof corresponding audio and video sequences from classes that are not present\nduring training. An analysis of the audio-visual data reveals a large degree of\nhyperbolicity, indicating the potential benefit of using a hyperbolic\ntransformation to achieve curvature-aware geometric learning, with the aim of\nexploring more complex hierarchical data structures for this task. The proposed\napproach employs a novel loss function that incorporates cross-modality\nalignment between video and audio features in the hyperbolic space.\nAdditionally, we explore the use of multiple adaptive curvatures for hyperbolic\nprojections. The experimental results on this very challenging task demonstrate\nthat our proposed hyperbolic approach for zero-shot learning outperforms the\nSOTA method on three datasets: VGGSound-GZSL, UCF-GZSL, and ActivityNet-GZSL\nachieving a harmonic mean (HM) improvement of around 3.0%, 7.0%, and 5.3%,\nrespectively.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:52:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hong","Jie",""],["Hayder","Zeeshan",""],["Han","Junlin",""],["Fang","Pengfei",""],["Harandi","Mehrtash",""],["Petersson","Lars",""]]}
{"id":"2308.12559","submitter":"Somayye Rostami","authors":"Somayye Rostami, Douglas G. Down, and George Karakostas","title":"Thermal-aware Workload Distribution for Data Centers with Demand\n  Variations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thermal-aware workload distribution is a common approach in the literature\nfor power consumption optimization in data centers. However, data centers also\nhave other operational costs such as the cost of equipment maintenance and\nreplacement. It has been shown that server reliability depends on frequency of\ntheir temperature variations, arising from workload transitions due to dynamic\ndemands. In this work, we formulate a nonlinear optimization problem that\nconsiders the cost of workload transitions in addition to IT and cooling power\nconsumption. To approximate the solution, we first linearize the problem; the\nresult is a mixed integer programming problem. A modified heuristic is then\nproposed to approximate the solution of the linear problem. Finally, a Model\nPredictive Control (MPC) approach is integrated with the proposed heuristics\nfor automatic workload reconfiguration when future demand is not known exactly,\nbut predictions are available. Numerical results show that the proposed schemes\nare attractive in different settings.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 04:53:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rostami","Somayye",""],["Down","Douglas G.",""],["Karakostas","George",""]]}
{"id":"2308.12560","submitter":"Dakshit Agrawal","authors":"Dakshit Agrawal, Jiajie Xu, Siva Karthik Mustikovela, Ioannis\n  Gkioulekas, Ashish Shrivastava, Yuning Chai","title":"NOVA: NOvel View Augmentation for Neural Composition of Dynamic Objects","comments":"Accepted for publication in ICCV Computer Vision for Metaverse\n  Workshop 2023 (code is available at https://github.com/dakshitagrawal/NoVA)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel-view augmentation (NOVA) strategy to train NeRFs for\nphoto-realistic 3D composition of dynamic objects in a static scene. Compared\nto prior work, our framework significantly reduces blending artifacts when\ninserting multiple dynamic objects into a 3D scene at novel views and times;\nachieves comparable PSNR without the need for additional ground truth\nmodalities like optical flow; and overall provides ease, flexibility, and\nscalability in neural composition. Our codebase is on GitHub.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:00:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Agrawal","Dakshit",""],["Xu","Jiajie",""],["Mustikovela","Siva Karthik",""],["Gkioulekas","Ioannis",""],["Shrivastava","Ashish",""],["Chai","Yuning",""]]}
{"id":"2308.12561","submitter":"Wee Teck Gan","authors":"Wee Teck Gan and Gordan Savin","title":"A theory of $\\gamma$-factors for $G_2 \\times GL_r$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a theory of local gamma factors for $G_2 \\times GL_r$ using a\nfunctorial lifting from $G_2$ to $GL_7$. This theory of gamma factors is\nuniquely characterized by a usual list of properties, showing that it is the\nonly possible candidate. Moreover, this theory of gamma factors is compatible\nwith the Galois theoretic one under the local Langlands correspondence for\n$G_2$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:01:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gan","Wee Teck",""],["Savin","Gordan",""]]}
{"id":"2308.12562","submitter":"Kwan Ho Ryan Chan","authors":"Kwan Ho Ryan Chan, Aditya Chattopadhyay, Benjamin David Haeffele, Rene\n  Vidal","title":"Variational Information Pursuit with Large Language and Multimodal\n  Models for Interpretable Predictions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Variational Information Pursuit (V-IP) is a framework for making\ninterpretable predictions by design by sequentially selecting a short chain of\ntask-relevant, user-defined and interpretable queries about the data that are\nmost informative for the task. While this allows for built-in interpretability\nin predictive models, applying V-IP to any task requires data samples with\ndense concept-labeling by domain experts, limiting the application of V-IP to\nsmall-scale tasks where manual data annotation is feasible. In this work, we\nextend the V-IP framework with Foundational Models (FMs) to address this\nlimitation. More specifically, we use a two-step process, by first leveraging\nLarge Language Models (LLMs) to generate a sufficiently large candidate set of\ntask-relevant interpretable concepts, then using Large Multimodal Models to\nannotate each data sample by semantic similarity with each concept in the\ngenerated concept set. While other interpretable-by-design frameworks such as\nConcept Bottleneck Models (CBMs) require an additional step of removing\nrepetitive and non-discriminative concepts to have good interpretability and\ntest performance, we mathematically and empirically justify that, with a\nsufficiently informative and task-relevant query (concept) set, the proposed\nFM+V-IP method does not require any type of concept filtering. In addition, we\nshow that FM+V-IP with LLM generated concepts can achieve better test\nperformance than V-IP with human annotated concepts, demonstrating the\neffectiveness of LLMs at generating efficient query sets. Finally, when\ncompared to other interpretable-by-design frameworks such as CBMs, FM+V-IP can\nachieve competitive test performance using fewer number of concepts/queries in\nboth cases with filtered or unfiltered concept sets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:04:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chan","Kwan Ho Ryan",""],["Chattopadhyay","Aditya",""],["Haeffele","Benjamin David",""],["Vidal","Rene",""]]}
{"id":"2308.12563","submitter":"Thi Kieu Khanh Ho","authors":"Thi Kieu Khanh Ho and Narges Armanfard","title":"Multivariate Time-Series Anomaly Detection with Contaminated Data:\n  Application to Physiological Signals","comments":"9 pages, 2 tables, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mainstream unsupervised anomaly detection algorithms often excel in academic\ndatasets, yet their real-world performance is restricted due to the controlled\nexperimental conditions involving clean training data. Addressing the challenge\nof training with noise, a prevalent issue in practical anomaly detection, is\nfrequently overlooked. In a pioneering endeavor, this study delves into the\nrealm of label-level noise within sensory time-series anomaly detection (TSAD).\nThis paper presents a novel and practical end-to-end unsupervised TSAD when the\ntraining data are contaminated with anomalies. The introduced approach, called\nTSAD-C, is devoid of access to abnormality labels during the training phase.\nTSAD-C encompasses three modules: a Decontaminator to rectify the abnormalities\n(aka noise) present in the training data, a Variable Dependency Modeling module\nto capture both long-term intra- and inter-variable dependencies within the\ndecontaminated data that can be considered as a surrogate of the pure normal\ndata, and an Anomaly Scoring module to detect anomalies. Our extensive\nexperiments conducted on three widely used physiological datasets conclusively\ndemonstrate that our approach surpasses existing methodologies, thus\nestablishing a new state-of-the-art performance in the field.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:10:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ho","Thi Kieu Khanh",""],["Armanfard","Narges",""]]}
{"id":"2308.12564","submitter":"Ashish Verma","authors":"Ashish Verma, Komal Singh Yadav","title":"Some New Results for Generalized Incomplete Exponential Matrix Functions","comments":"arXiv admin note: text overlap with arXiv:2003.11419","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The primary goal of this paper is to introduce and investigate generalized\nincomplete exponential functions with matrix parameters. Integral\nrepresentation, differential formula, addition formula, multiplication formula,\nand recurrence relation obtained here are believed to be new in the theory of\nspecial matrix functions. We also establish the connection between these matrix\nfunctions and other matrix functions, such as the incomplete gamma matrix\nfunction, the Bessel and modified Bessel matrix functions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:10:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Verma","Ashish",""],["Yadav","Komal Singh",""]]}
{"id":"2308.12565","submitter":"Zhensong Hu","authors":"Zhensong Hu, Yuanyuan Su, Zhiyuan Li, Kelley M. Hess, Ralph P. Kraft,\n  William R. Forman, Paul E. J. Nulsen, Sarrvesh S. Sridhar, Andra Stroe,\n  Junhyun Baek, Aeree Chung, Dirk Grupe, Hao Chen, Jimmy A. Irwin, Christine\n  Jones, Scott W. Randall, and Elke Roediger","title":"AMUSE-antlia I: Nuclear X-ray properties of early-type galaxies in a\n  dynamically young galaxy cluster","comments":"14 pages, 8 figures, 2 tables, accepted for publication in The\n  Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To understand the formation and growth of supermassive black holes (SMBHs)\nand their co-evolution with host galaxies, it is essential to know the impact\nof environment on the activity of active galactic nuclei (AGN). We present new\nChandra X-ray observations of nuclear emission from member galaxies in the\nAntlia cluster, the nearest non-cool core and the nearest merging galaxy\ncluster, residing at D = 35.2 Mpc. Its inner region, centered on two dominant\ngalaxies NGC 3268 and NGC 3258, has been mapped with three deep Chandra ACIS-I\npointings. Nuclear X-ray sources are detected in 7/84 (8.3%) early-type\ngalaxies (ETG) and 2/8 (25%) late-type galaxies with a median detection limit\nof 8x10^38 erg/s. All nuclear X-ray sources but one have a corresponding radio\ncontinuum source detected by MeerKAT at the L-band. Nuclear X-ray sources\ndetected in early-type galaxies are considered as the genuine X-ray counterpart\nof low-luminosity AGN. When restricted to a detection limit of logLx(erg/s) >\n38.9 and a stellar mass of 10 < log Ms(Msun) <11.6, 6/11 (54.5%) ETG are found\nto contain an X-ray AGN in Antlia, exceeding the AGN occupation fraction of\n7/39 (18.0%) and 2/12 (16.7%) in the more relaxed, cool core clusters, Virgo\nand Fornax, respectively, and rivaling that of the AMUSE-Field ETG of 27/49\n(55.1%). Furthermore, more than half of the X-ray AGN in Antlia are hosted by\nits younger subcluster, centered on NGC 3258. We believe that this is because\nSMBH activity is enhanced in a dynamically young cluster compared to relatively\nrelaxed clusters.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:12:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hu","Zhensong",""],["Su","Yuanyuan",""],["Li","Zhiyuan",""],["Hess","Kelley M.",""],["Kraft","Ralph P.",""],["Forman","William R.",""],["Nulsen","Paul E. J.",""],["Sridhar","Sarrvesh S.",""],["Stroe","Andra",""],["Baek","Junhyun",""],["Chung","Aeree",""],["Grupe","Dirk",""],["Chen","Hao",""],["Irwin","Jimmy A.",""],["Jones","Christine",""],["Randall","Scott W.",""],["Roediger","Elke",""]]}
{"id":"2308.12566","submitter":"Byeongho Jo Dr.","authors":"Byeongho Jo, Seungkwon Beack","title":"Hybrid noise shaping for audio coding using perfectly overlapped window","comments":"accepted to WASPAA (IEEE Workshop on Applications of Signal\n  Processing to Audio and Acoustics) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, audio coding technology has been standardized based on\nseveral frameworks that incorporate linear predictive coding (LPC). However,\ncoding the transient signal using frequency-domain LP residual signals remains\na challenge. To address this, temporal noise shaping (TNS) can be adapted,\nalthough it cannot be effectively operated since the estimated temporal\nenvelope in the modified discrete cosine transform (MDCT) domain is accompanied\nby the time-domain aliasing (TDA) terms. In this study, we propose the\nmodulated complex lapped transform-based coding framework integrated with\ntransform coded excitation (TCX) and complex LPC-based TNS (CTNS). Our approach\nuses a 50\\% overlap window and switching scheme for the CTNS to improve the\ncoding efficiency. Additionally, an adaptive calculation of the target bits for\nthe sub-bands using the frequency envelope information based on the quantized\nLPC coefficients is proposed. To minimize the quantization mismatch between\nboth modes, an integrated quantization for real and complex values and a TDA\naugmentation method that compensates for the artificially generated TDA\ncomponents during switching operations are proposed. The proposed coding\nframework shows a superior performance in both objective metrics and subjective\nlistening tests, thereby demonstrating its low bit-rate audio coding.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:12:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jo","Byeongho",""],["Beack","Seungkwon",""]]}
{"id":"2308.12567","submitter":"Lingjun Liu","authors":"Lingjun Liu","title":"Global existence of spherically symmetry solutions for isothermal\n  Euler-Poisson system outside a ball","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider an isothermal Euler-Poisson system with\nself-gravitational force, modeling a compact star such as strange quark star.\nWe prove that there exists a global entropy solution with spherically symmetry\noutside a ball, through the fractional Lax-Friedrichs scheme and the theory of\ncompensated compactness.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:15:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Lingjun",""]]}
{"id":"2308.12568","submitter":"Tongtao Ling","authors":"Tongtao Ling, Chen Liao, Zhipeng Yu, Lei Chen, Shilei Huang, Yi Liu","title":"A Small and Fast BERT for Chinese Medical Punctuation Restoration","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In clinical dictation, utterances after automatic speech recognition (ASR)\nwithout explicit punctuation marks may lead to the misunderstanding of dictated\nreports. To give a precise and understandable clinical report with ASR,\nautomatic punctuation restoration is required. Considering a practical\nscenario, we propose a fast and light pre-trained model for Chinese medical\npunctuation restoration based on 'pretraining and fine-tuning' paradigm. In\nthis work, we distill pre-trained models by incorporating supervised\ncontrastive learning and a novel auxiliary pre-training task (Punctuation Mark\nPrediction) to make it well-suited for punctuation restoration. Our experiments\non various distilled models reveal that our model can achieve 95% performance\nwhile 10% model size relative to state-of-the-art Chinese RoBERTa.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:15:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ling","Tongtao",""],["Liao","Chen",""],["Yu","Zhipeng",""],["Chen","Lei",""],["Huang","Shilei",""],["Liu","Yi",""]]}
{"id":"2308.12569","submitter":"Tsutomu Momoi","authors":"Tsutomu Momoi","title":"Dynamics of quantum spin-nematics: comparisons with canted\n  antiferromagnets","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting spin-nematic states is challenging due to the absence of Bragg\npeaks, but dynamical physical quantities offer promising means for\ncharacterizing these states. In this study, we investigate the dynamical\nproperties of spin-nematic states in three-dimensional quantum spin systems in\na magnetic field. Using a two-component boson theory that incorporates magnons\nand bi-magnons, we explore the dynamical quantities in the spin-nematic and\nparamagnetic phases, with a particular focus on the dynamical spin structure\nfactor at zero temperature and the nuclear magnetic resonance (NMR) relaxation\nrate at finite temperatures. Our findings reveal that the dynamical structure\nfactor does not exhibit any diverging singularity across momentum and frequency\nwhile providing a valuable information about the form factor of bi-magnon\nstates and the underlying structure of spin-nematic order. Additionally, we\nfind a temperature dependence in the NMR relaxation rate proportional to $T^3$\nat low temperatures, similar to canted antiferromagnets. A clear distinction is\nfound as there is no critical divergence of the NMR relaxation rate at the\nspin-nematic transition temperature. Our theory provides a comprehensive\nunderstanding of the dynamical properties of spin-nematic states, covering\narbitrary spin values $S$ and encompassing site and bond nematic orders. We\nalso analyze these dynamical quantities using the same methodology in a canted\nantiferromagnetic state. These are compared with the results in the\nspin-nematic states.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:18:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Momoi","Tsutomu",""]]}
{"id":"2308.12570","submitter":"Tianyuan Yuan","authors":"Tianyuan Yuan, Yicheng Liu, Yue Wang, Yilun Wang, Hang Zhao","title":"StreamMapNet: Streaming Mapping Network for Vectorized Online HD Map\n  Construction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-Definition (HD) maps are essential for the safety of autonomous driving\nsystems. While existing techniques employ camera images and onboard sensors to\ngenerate vectorized high-precision maps, they are constrained by their reliance\non single-frame input. This approach limits their stability and performance in\ncomplex scenarios such as occlusions, largely due to the absence of temporal\ninformation. Moreover, their performance diminishes when applied to broader\nperception ranges. In this paper, we present StreamMapNet, a novel online\nmapping pipeline adept at long-sequence temporal modeling of videos.\nStreamMapNet employs multi-point attention and temporal information which\nempowers the construction of large-range local HD maps with high stability and\nfurther addresses the limitations of existing methods. Furthermore, we\ncritically examine widely used online HD Map construction benchmark and\ndatasets, Argoverse2 and nuScenes, revealing significant bias in the existing\nevaluation protocols. We propose to resplit the benchmarks according to\ngeographical spans, promoting fair and precise evaluations. Experimental\nresults validate that StreamMapNet significantly outperforms existing methods\nacross all settings while maintaining an online inference speed of $14.2$ FPS.\nOur code is available at https://github.com/yuantianyuan01/StreamMapNet.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:22:43 GMT"},{"version":"v2","created":"Sun, 27 Aug 2023 05:23:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Tianyuan",""],["Liu","Yicheng",""],["Wang","Yue",""],["Wang","Yilun",""],["Zhao","Hang",""]]}
{"id":"2308.12571","submitter":"Lily Ishizaki","authors":"Lily Ishizaki, Shogo Tachibana, Tamami Okamoto, Daiki Yamamoto, and\n  Shigeru Ida","title":"Effective reaction temperatures of irreversible dust chemical reactions\n  in a protoplanetary disk","comments":"28 pages, 7 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dust particles in protoplanetary disks experience various chemical reactions\nunder different physicochemical conditions through their accretion and\ndiffusion, which results in the radial chemical gradient of dust. We performed\nthree-dimensional Monte Carlo simulations to evaluate the dust trajectories and\nthe progress of fictitious irreversible reactions, of which kinetics is\nexpressed by the Johnson-Mehl-Avrami equation. The distribution of the highest\ntemperature that each particle experiences before the degree of reaction\nexceeds a certain level shows the log-normal distribution, and its mode\ntemperature was used as the effective reaction temperature. Semi-analytical\nprediction formulas of the effective reaction temperature and its dispersion\nwere derived by comparing a reaction timescale with a diffusive transport\ntimescale of dust as a function of the reaction parameters and the disk\nparameters. The formulas reproduce the numerical results of the effective\nreaction temperatures and their dispersions within 5.5 and 24 %, respectively,\nin a wide temperature range (200-1400 K). We applied the formulas for the\ncrystallization of amorphous silicate dust and its oxygen isotope exchange with\nthe H2O vapor based on the experimentally determined kinetics. For sub-micron\nsized amorphous forsterite dust, the predicted effective reaction temperature\nfor the oxygen isotope exchange was lower than that of crystallization without\noverlap even considering their dispersions. This suggests that the amorphous\nsilicate dust in the protosolar disk could exchange their oxygen isotopes\nefficiently with the 16O-poor H2O vapor, resulting in the distinct oxygen\nisotope compositions from the Sun.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:23:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ishizaki","Lily",""],["Tachibana","Shogo",""],["Okamoto","Tamami",""],["Yamamoto","Daiki",""],["Ida","Shigeru",""]]}
{"id":"2308.12572","submitter":"Elda Guzman Elda Guzman-Herrera","authors":"Elda Guzman-Herrera, Nora Breton","title":"Light Propagation in the vicinity of the ModMax black hole","comments":"24 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  ModMax is a nonlinear electrodynamics theory with the same symmetries as\nMaxwell electrodynamics. Static spherically symmetric solutions have been\nderived by coupling ModMax electrodynamics with the Einstein equations, which\ncan represent a black hole. In this paper, we analyze light propagation in the\nvicinity of the ModMax black hole. We determine birefringence, light\ntrajectories, deflection, redshifts, as well as the shadow of the black hole\nusing the effective or optical metric to determine the optical paths of light;\ncomparison is done with the corresponding effects in the neighborhood of the\nReissner-Nordstrom black hole, that is the solution to the Einstein-Maxwell\nequations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:26:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guzman-Herrera","Elda",""],["Breton","Nora",""]]}
{"id":"2308.12573","submitter":"Rishabh Agrawal","authors":"Rishabh Agrawal, Nathan Dahlin, Rahul Jain, Ashutosh Nayyar","title":"Conditional Kernel Imitation Learning for Continuous State Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Imitation Learning (IL) is an important paradigm within the broader\nreinforcement learning (RL) methodology. Unlike most of RL, it does not assume\navailability of reward-feedback. Reward inference and shaping are known to be\ndifficult and error-prone methods particularly when the demonstration data\ncomes from human experts. Classical methods such as behavioral cloning and\ninverse reinforcement learning are highly sensitive to estimation errors, a\nproblem that is particularly acute in continuous state space problems.\nMeanwhile, state-of-the-art IL algorithms convert behavioral policy learning\nproblems into distribution-matching problems which often require additional\nonline interaction data to be effective. In this paper, we consider the problem\nof imitation learning in continuous state space environments based solely on\nobserved behavior, without access to transition dynamics information, reward\nstructure, or, most importantly, any additional interactions with the\nenvironment. Our approach is based on the Markov balance equation and\nintroduces a novel conditional kernel density estimation-based imitation\nlearning framework. It involves estimating the environment's transition\ndynamics using conditional kernel density estimators and seeks to satisfy the\nprobabilistic balance equations for the environment. We establish that our\nestimators satisfy basic asymptotic consistency requirements. Through a series\nof numerical experiments on continuous state benchmark environments, we show\nconsistently superior empirical performance over many state-of-the-art IL\nalgorithms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:26:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Agrawal","Rishabh",""],["Dahlin","Nathan",""],["Jain","Rahul",""],["Nayyar","Ashutosh",""]]}
{"id":"2308.12574","submitter":"Ye Liu","authors":"Ye Liu, Semih Yavuz, Rui Meng, Meghana Moorthy, Shafiq Joty, Caiming\n  Xiong, Yingbo Zhou","title":"Exploring the Integration Strategies of Retriever and Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integration of retrieved passages and large language models (LLMs), such\nas ChatGPTs, has significantly contributed to improving open-domain question\nanswering. However, there is still a lack of exploration regarding the optimal\napproach for incorporating retrieved passages into the answer generation\nprocess. This paper aims to fill this gap by investigating different methods of\ncombining retrieved passages with LLMs to enhance answer generation. We begin\nby examining the limitations of a commonly-used concatenation approach.\nSurprisingly, this approach often results in generating \"unknown\" outputs, even\nwhen the correct document is among the top-k retrieved passages. To address\nthis issue, we explore four alternative strategies for integrating the\nretrieved passages with the LLMs. These strategies include two single-round\nmethods that utilize chain-of-thought reasoning and two multi-round strategies\nthat incorporate feedback loops. Through comprehensive analyses and\nexperiments, we provide insightful observations on how to effectively leverage\nretrieved passages to enhance the answer generation capability of LLMs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:26:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Ye",""],["Yavuz","Semih",""],["Meng","Rui",""],["Moorthy","Meghana",""],["Joty","Shafiq",""],["Xiong","Caiming",""],["Zhou","Yingbo",""]]}
{"id":"2308.12575","submitter":"Yuxi Liu","authors":"Yuxi Liu, Zhenhao Zhang, Shaowen Qin, Flora D. Salim, Antonio Jimeno\n  Yepes, Jun Shen","title":"Hypergraph Convolutional Networks for Fine-grained ICU Patient\n  Similarity Analysis and Risk Prediction","comments":"7 pages, 2 figures, submitted to IEEE BIBM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Intensive Care Unit (ICU) is one of the most important parts of a\nhospital, which admits critically ill patients and provides continuous\nmonitoring and treatment. Various patient outcome prediction methods have been\nattempted to assist healthcare professionals in clinical decision-making.\nExisting methods focus on measuring the similarity between patients using deep\nneural networks to capture the hidden feature structures. However, the\nhigher-order relationships are ignored, such as patient characteristics (e.g.,\ndiagnosis codes) and their causal effects on downstream clinical predictions.\n  In this paper, we propose a novel Hypergraph Convolutional Network that\nallows the representation of non-pairwise relationships among diagnosis codes\nin a hypergraph to capture the hidden feature structures so that fine-grained\npatient similarity can be calculated for personalized mortality risk\nprediction. Evaluation using a publicly available eICU Collaborative Research\nDatabase indicates that our method achieves superior performance over the\nstate-of-the-art models on mortality risk prediction. Moreover, the results of\nseveral case studies demonstrated the effectiveness of constructing graph\nnetworks in providing good transparency and robustness in decision-making.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:26:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Yuxi",""],["Zhang","Zhenhao",""],["Qin","Shaowen",""],["Salim","Flora D.",""],["Yepes","Antonio Jimeno",""],["Shen","Jun",""]]}
{"id":"2308.12576","submitter":"Ehtibar Dzhafarov","authors":"Janne V. Kujala and Ehtibar N. Dzhafarov","title":"Quantum mechanics is compatible with counterfactual definiteness","comments":"14 pp","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Counterfactual definiteness (CFD) means that if some property is measured in\nsome context, then the outcome of the measurement would have been the same had\nthis property been measured in a different context. A context includes all\nother measurements made together with the one in question, and the\nspatiotemporal relations among them. The proviso for CFD is non-disturbance:\nany physical influence of the contexts on the property being measured is\nexcluded by the laws of nature, so that no one measuring this property has a\nway of ascertaining its context. It is usually claimed that in quantum\nmechanics CFD does not hold, because if one assigns the same value to a\nproperty in all contexts it is measured in, one runs into a logical\ncontradiction, or at least contravenes quantum theory and experimental\nevidence. We show that this claim is not substantiated if one takes into\naccount that only one of the possible contexts can be a factual context, all\nother contexts being counterfactual. With this in mind, any system of random\nvariables can be viewed as satisfying CFD. The concept of CFD is closely\nrelated to but distinct from that of noncontextuality, and it is the latter\nproperty that may or may not hold for a system, in particular being contravened\nby some quantum systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:27:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kujala","Janne V.",""],["Dzhafarov","Ehtibar N.",""]]}
{"id":"2308.12577","submitter":"Shuai Lyu","authors":"Shuai Lyu and Dongmei Mo and Waikeung Wong","title":"REB: Reducing Biases in Representation for Industrial Anomaly Detection","comments":"11 pages, 5 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing K-nearest neighbor (KNN) retrieval-based methods usually conduct\nindustrial anomaly detection in two stages: obtain feature representations with\na pre-trained CNN model and perform distance measures for defect detection.\nHowever, the features are not fully exploited as they ignore domain bias and\nthe difference of local density in feature space, which limits the detection\nperformance. In this paper, we propose Reducing Biases (REB) in representation\nby considering the domain bias of the pre-trained model and building a\nself-supervised learning task for better domain adaption with a defect\ngeneration strategy (DefectMaker) imitating the natural defects. Additionally,\nwe propose a local density KNN (LDKNN) to reduce the local density bias and\nobtain effective anomaly detection. We achieve a promising result of 99.5\\%\nAUROC on the widely used MVTec AD benchmark. We also achieve 88.0\\% AUROC on\nthe challenging MVTec LOCO AD dataset and bring an improvement of 4.7\\% AUROC\nto the state-of-the-art result. All results are obtained with smaller backbone\nnetworks such as Vgg11 and Resnet18, which indicates the effectiveness and\nefficiency of REB for practical industrial applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:32:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lyu","Shuai",""],["Mo","Dongmei",""],["Wong","Waikeung",""]]}
{"id":"2308.12578","submitter":"Yachao Zhao","authors":"Yachao Zhao, Bo Wang, Dongming Zhao, Kun Huang, Yan Wang, Ruifang He,\n  Yuexian Hou","title":"Mind vs. Mouth: On Measuring Re-judge Inconsistency of Social Bias in\n  Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent researches indicate that Pre-trained Large Language Models (LLMs)\npossess cognitive constructs similar to those observed in humans, prompting\nresearchers to investigate the cognitive aspects of LLMs. This paper focuses on\nexplicit and implicit social bias, a distinctive two-level cognitive construct\nin psychology. It posits that individuals' explicit social bias, which is their\nconscious expression of bias in the statements, may differ from their implicit\nsocial bias, which represents their unconscious bias. We propose a two-stage\napproach and discover a parallel phenomenon in LLMs known as \"re-judge\ninconsistency\" in social bias. In the initial stage, the LLM is tasked with\nautomatically completing statements, potentially incorporating implicit social\nbias. However, in the subsequent stage, the same LLM re-judges the biased\nstatement generated by itself but contradicts it. We propose that this re-judge\ninconsistency can be similar to the inconsistency between human's unaware\nimplicit social bias and their aware explicit social bias. Experimental\ninvestigations on ChatGPT and GPT-4 concerning common gender biases examined in\npsychology corroborate the highly stable nature of the re-judge inconsistency.\nThis finding may suggest that diverse cognitive constructs emerge as LLMs'\ncapabilities strengthen. Consequently, leveraging psychological theories can\nprovide enhanced insights into the underlying mechanisms governing the\nexpressions of explicit and implicit constructs in LLMs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:35:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhao","Yachao",""],["Wang","Bo",""],["Zhao","Dongming",""],["Huang","Kun",""],["Wang","Yan",""],["He","Ruifang",""],["Hou","Yuexian",""]]}
{"id":"2308.12579","submitter":"Bruno. Cessac","authors":"Bruno Cessac, Dora Matzakou-Karvouniari","title":"The non linear dynamics of retinal waves","comments":"51 pages, 56 figures","journal-ref":"Physica D, Volume 439, November 2022, 133436","doi":null,"report-no":null,"categories":"nlin.AO q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We investigate the dynamics of stage II retinal waves via a dynamical system,\ngrounded on biophysics, and analysed with bifurcation theory. We show how the\nnonlinear cells coupling and bifurcation structure explain how waves start,\npropagate, interact and stop. Especially, we analyse how the existence of a\nsmall region in parameter space, where dynamics returns in a recurrent way,\ngives rise to a very rich dynamics. In this context, we propose a non linear\ntransport equation characterizing the waves propagation and interaction.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:40:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cessac","Bruno",""],["Matzakou-Karvouniari","Dora",""]]}
{"id":"2308.12580","submitter":"Akhil Pandey Akella","authors":"Akhil Pandey Akella, David Koop, Hamed Alhoori","title":"Laying foundations to quantify the \"Effort of Reproducibility\"","comments":"Accepted at ACM/IEEE conference JCDL' 2023. Refer\n  https://2023.jcdl.org/program/schedule-printable/ for confirmation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Why are some research studies easy to reproduce while others are difficult?\nCasting doubt on the accuracy of scientific work is not fruitful, especially\nwhen an individual researcher cannot reproduce the claims made in the paper.\nThere could be many subjective reasons behind the inability to reproduce a\nscientific paper. The field of Machine Learning (ML) faces a reproducibility\ncrisis, and surveying a portion of published articles has resulted in a group\nrealization that although sharing code repositories would be appreciable, code\nbases are not the end all be all for determining the reproducibility of an\narticle. Various parties involved in the publication process have come forward\nto address the reproducibility crisis and solutions such as badging articles as\nreproducible, reproducibility checklists at conferences (\\textit{NeurIPS, ICML,\nICLR, etc.}), and sharing artifacts on \\textit{OpenReview} come across as\npromising solutions to the core problem. The breadth of literature on\nreproducibility focuses on measures required to avoid ir-reproducibility, and\nthere is not much research into the effort behind reproducing these articles.\nIn this paper, we investigate the factors that contribute to the easiness and\ndifficulty of reproducing previously published studies and report on the\nfoundational framework to quantify effort of reproducibility.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:44:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Akella","Akhil Pandey",""],["Koop","David",""],["Alhoori","Hamed",""]]}
{"id":"2308.12581","submitter":"Puning Zhao","authors":"Puning Zhao, Fei Yu, Zhiguo Wan","title":"A Huber Loss Minimization Approach to Byzantine Robust Federated\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning systems are susceptible to adversarial attacks. To combat\nthis, we introduce a novel aggregator based on Huber loss minimization, and\nprovide a comprehensive theoretical analysis. Under independent and identically\ndistributed (i.i.d) assumption, our approach has several advantages compared to\nexisting methods. Firstly, it has optimal dependence on $\\epsilon$, which\nstands for the ratio of attacked clients. Secondly, our approach does not need\nprecise knowledge of $\\epsilon$. Thirdly, it allows different clients to have\nunequal data sizes. We then broaden our analysis to include non-i.i.d data,\nsuch that clients have slightly different distributions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:49:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhao","Puning",""],["Yu","Fei",""],["Wan","Zhiguo",""]]}
{"id":"2308.12582","submitter":"Felix Ritort","authors":"M. Gironella-Torrent, G. Bergamaschi, R. Sorkin, G. Wuite, F. Ritort","title":"Viscoelastic phenotyping of red blood cells","comments":"Main text (10 pages, 7 figures, 2 tables) and Supplementary (8 pages,\n  8 figures, 2 tables and 2 movies). paper submitted to Biophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Red Blood Cells (RBCs) are the simplest cell types with complex dynamical and\nviscoelastic phenomenology. While the mechanical rigidity and the flickering\nnoise of RBCs have been extensively investigated, an accurate determination of\nthe constitutive equations of the relaxational kinetics is lacking. Here we\nmeasure the force relaxation of RBCs under different types of tensional and\ncompressive extension-jump protocols by attaching an optically trapped bead to\nthe RBC membrane. Relaxational kinetics follows linear response from 60pN\n(tensional) to -20pN (compressive) applied forces, exhibiting a\ntriple-exponential function with three well-separated timescales over four\ndecades (0.01-100s). While the fast timescale ($\\tau_F\\sim 0.02(1)s$)\ncorresponds to the relaxation of the membrane, the intermediate and slow\ntimescales ($\\tau_I=4(1)s$; $\\tau_S=70(8)s$) likely arise from the cortex\ndynamics and the cytosol viscosity. Relaxation is highly heterogeneous across\nthe RBC population, yet the three relaxation times are correlated, showing\ndynamical scaling. Finally, we find that glucose depletion and laser\nillumination of RBCs lead to faster triple-exponential kinetics and RBC\nrigidification. Viscoelastic phenotyping is a promising dynamical biomarker\napplicable to other cell types and active systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 05:53:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gironella-Torrent","M.",""],["Bergamaschi","G.",""],["Sorkin","R.",""],["Wuite","G.",""],["Ritort","F.",""]]}
{"id":"2308.12583","submitter":"Ian Edmonds Dr","authors":"Ian R. Edmonds","title":"On the origin of quasi-periodicity in the atmospheres of Earth, Jupiter,\n  Saturn and the Sun","comments":"38 pages, 33 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores a possible linkage between solar motion about the solar\nsystem center of mass and the quasi-periodicity evident in the pressure and\ntemperature of planet atmospheres. We establish that dominant mid frequency\nrange periodicity in planet atmospheres corresponds closely to the harmonic\nseries 39.5/n = TA/n years where n = 2, 3, 4, etc. We establish that the period\nTA = 39.5 years is the interval between acceleration impulses experienced by\nthe Sun as it passes close to the solar system center of mass and that the time\nsequence of impulses generates the spectral harmonic series TA/n that is\nobserved in the periodicity of climate indices like the North Atlantic\nOscillation and the Quasi Biennial Oscillation. We develop a model of a simple\nharmonic oscillator responding to periodic acceleration impulses and show that\nthe response duplicates several features of the Quasi Biennial Oscillation. We\nconclude that oscillatory phenomena observed in solar activity and in planet\natmosphere variability could be due to the response of the various natural\noscillatory modes to impulsive Sun acceleration associated with planetary\nmotion.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:00:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Edmonds","Ian R.",""]]}
{"id":"2308.12584","submitter":"Tobias Koch","authors":"Tobias Koch, Christian Riess, Thomas K\\\"ohler","title":"LORD: Leveraging Open-Set Recognition with Unknown Data","comments":"Accepted at ICCV 2023 Workshop (Out-Of-Distribution Generalization in\n  Computer Vision)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Handling entirely unknown data is a challenge for any deployed classifier.\nClassification models are typically trained on a static pre-defined dataset and\nare kept in the dark for the open unassigned feature space. As a result, they\nstruggle to deal with out-of-distribution data during inference. Addressing\nthis task on the class-level is termed open-set recognition (OSR). However,\nmost OSR methods are inherently limited, as they train closed-set classifiers\nand only adapt the downstream predictions to OSR. This work presents LORD, a\nframework to Leverage Open-set Recognition by exploiting unknown Data. LORD\nexplicitly models open space during classifier training and provides a\nsystematic evaluation for such approaches. We identify three model-agnostic\ntraining strategies that exploit background data and applied them to\nwell-established classifiers. Due to LORD's extensive evaluation protocol, we\nconsistently demonstrate improved recognition of unknown data. The benchmarks\nfacilitate in-depth analysis across various requirement levels. To mitigate\ndependency on extensive and costly background datasets, we explore mixup as an\noff-the-shelf data generation technique. Our experiments highlight mixup's\neffectiveness as a substitute for background datasets. Lightweight constraints\non mixup synthesis further improve OSR performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:12:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Koch","Tobias",""],["Riess","Christian",""],["K\u00f6hler","Thomas",""]]}
{"id":"2308.12585","submitter":"Il Memming Park","authors":"Il Memming Park and \\'Abel S\\'agodi and Piotr Aleksander Sok\\'o\\l","title":"Persistent learning signals and working memory without continuous\n  attractors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.LG cs.NE nlin.AO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural dynamical systems with stable attractor structures, such as point\nattractors and continuous attractors, are hypothesized to underlie meaningful\ntemporal behavior that requires working memory. However, working memory may not\nsupport useful learning signals necessary to adapt to changes in the temporal\nstructure of the environment. We show that in addition to the continuous\nattractors that are widely implicated, periodic and quasi-periodic attractors\ncan also support learning arbitrarily long temporal relationships. Unlike the\ncontinuous attractors that suffer from the fine-tuning problem, the less\nexplored quasi-periodic attractors are uniquely qualified for learning to\nproduce temporally structured behavior. Our theory has broad implications for\nthe design of artificial learning systems and makes predictions about\nobservable signatures of biological neural dynamics that can support temporal\ndependence learning and working memory. Based on our theory, we developed a new\ninitialization scheme for artificial recurrent neural networks that outperforms\nstandard methods for tasks that require learning temporal dynamics. Moreover,\nwe propose a robust recurrent memory mechanism for integrating and maintaining\nhead direction without a ring attractor.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:12:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Park","Il Memming",""],["S\u00e1godi","\u00c1bel",""],["Sok\u00f3\u0142","Piotr Aleksander",""]]}
{"id":"2308.12586","submitter":"Dylan Antonio Talabis","authors":"Dylan Antonio Talabis, Eduardo Mendoza","title":"Analysis of biochemical systems via reaction network operations","comments":"40 pages. arXiv admin note: text overlap with arXiv:1109.2923 by\n  other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A dynamical system obtains a wide variety of kinetic realizations, which is\nadvantageous for the analysis of biochemical systems. A reaction network,\nderived from a dynamical system, may or may not possess some properties needed\nfor a thorough analysis. We present eight reaction network operations that can\nmodify a reaction network while preserving the dynamical system. In particular,\nwe study the structural and kinetic properties of these transformed systems,\nsuch as stoichiometric alignment, concordance and existence of equilibria. To\nillustrate our approach, we use the kinetic realizations of the following\nbiochemical systems: (1) calcium signaling in the olfactory system, (2)\nmetabolic insulin signaling and (3) monolignol biosynthesis in \\textit{Populus\nxylem}. Furthermore, we present a sufficient condition for the invariance of\nconcordance under a network transformation and introduce an algorithm for a\nnetwork transformation of a weakly reversible non-CFK system to a weakly\nreversible CFK system. We review the work of Hong et al. on network\ntranslation, discussing its relevance in this study. Finally, we end by\nhighlighting some benefits of positive deficiency kinetic realizations for the\nanalysis of biochemical systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:24:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Talabis","Dylan Antonio",""],["Mendoza","Eduardo",""]]}
{"id":"2308.12587","submitter":"Yibo Cui","authors":"Yibo Cui, Liang Xie, Yakun Zhang, Meishan Zhang, Ye Yan, Erwei Yin","title":"Grounded Entity-Landmark Adaptive Pre-training for Vision-and-Language\n  Navigation","comments":"ICCV 2023 Oral","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-modal alignment is one key challenge for Vision-and-Language Navigation\n(VLN). Most existing studies concentrate on mapping the global instruction or\nsingle sub-instruction to the corresponding trajectory. However, another\ncritical problem of achieving fine-grained alignment at the entity level is\nseldom considered. To address this problem, we propose a novel Grounded\nEntity-Landmark Adaptive (GELA) pre-training paradigm for VLN tasks. To achieve\nthe adaptive pre-training paradigm, we first introduce grounded entity-landmark\nhuman annotations into the Room-to-Room (R2R) dataset, named GEL-R2R.\nAdditionally, we adopt three grounded entity-landmark adaptive pre-training\nobjectives: 1) entity phrase prediction, 2) landmark bounding box prediction,\nand 3) entity-landmark semantic alignment, which explicitly supervise the\nlearning of fine-grained cross-modal alignment between entity phrases and\nenvironment landmarks. Finally, we validate our model on two downstream\nbenchmarks: VLN with descriptive instructions (R2R) and dialogue instructions\n(CVDN). The comprehensive experiments show that our GELA model achieves\nstate-of-the-art results on both tasks, demonstrating its effectiveness and\ngeneralizability.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:25:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cui","Yibo",""],["Xie","Liang",""],["Zhang","Yakun",""],["Zhang","Meishan",""],["Yan","Ye",""],["Yin","Erwei",""]]}
{"id":"2308.12588","submitter":"Zhi-Long Han","authors":"Ang Liu, Feng-Lan Shao, Zhi-Long Han, Yi Jin, Honglei Li","title":"Sterile Neutrino Portal Dark Matter from Semi-Production","comments":"24 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study the feeble sterile neutrino portal dark matter under\nthe $Z_3$ symmetry. The dark sector consists of one fermion singlet $\\chi$ and\none scalar singlet $\\chi$, which transforms as $\\chi\\to e^{i2\\pi/3}\\chi,\n\\phi\\to e^{i2\\pi/3}\\phi$ under the $Z_3$ symmetry. Regarding fermion singlet\n$\\chi$ as the dark matter candidate, the new interaction terms $y_\\chi \\phi\n\\bar{\\chi^c}\\chi$ and $\\mu\\phi^3/2$ could induce various new production\nchannels. For instance, when $m_\\phi>2m_\\chi$, the pair decay $\\phi\\to\\chi\\chi$\ncould be the dominant channel, rather than the delayed decay $\\phi\\to\\chi\\nu$.\nAnother appealing scenario is when the dark sector is initially produced\nthrough the scattering process as $NN\\to\\chi\\chi,\nNN\\to\\phi\\phi,h\\nu\\to\\chi\\phi$, then the semi-production processes $N\n\\chi\\to\\phi\\phi, N\\phi\\to\\phi\\chi, N\\chi\\to\\chi\\chi$ could lead to the\nexponential growth of dark sector abundances. The phenomenology of sterile\nneutrino and the cosmological impact of the dark scalar are also considered in\nthe $Z_3$ symmetric model.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:30:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Ang",""],["Shao","Feng-Lan",""],["Han","Zhi-Long",""],["Jin","Yi",""],["Li","Honglei",""]]}
{"id":"2308.12589","submitter":"Michele Dolce","authors":"Michele Dolce","title":"Stability threshold of the 2D Couette flow in a homogeneous magnetic\n  field using symmetric variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a 2D incompressible and electrically conducting fluid in the\ndomain $\\mathbb{T}\\times\\mathbb{R}$. The aim is to quantify stability\nproperties of the Couette flow $(y,0)$ with a constant homogenous magnetic\nfield $(\\beta,0)$ when $|\\beta|>1/2$. The focus lies on the regime with small\nfluid viscosity $\\nu$, magnetic resistivity $\\mu$ and we assume that the\nmagnetic Prandtl number satisfies\n$\\mu^2\\lesssim\\mathrm{Pr}_{\\mathrm{m}}=\\nu/\\mu\\leq 1$. We establish that small\nperturbations around this steady state remain close to it, provided their size\nis of order $\\varepsilon\\ll\\nu^{2/3}$ in $H^N$ with $N$ large enough.\nAdditionally, the vorticity and current density experience a transient growth\nof order $\\nu^{-1/3}$ while converging exponentially fast to an $x$-independent\nstate after a time-scale of order $\\nu^{-1/3}$. The growth is driven by an\ninviscid mechanism, while the subsequent exponential decay results from the\ninterplay between transport and diffusion, leading to the dissipation\nenhancement. A key argument to prove these results is to reformulate the system\nin terms of symmetric variables, inspired by the study of inhomogeneous fluid,\nto effectively characterize the system's dynamic behavior.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:31:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dolce","Michele",""]]}
{"id":"2308.12590","submitter":"Jiahe Li","authors":"Baowen Zhang, Jiahe Li, Xiaoming Deng, Yinda Zhang, Cuixia Ma, Hongan\n  Wang","title":"Self-supervised Learning of Implicit Shape Representation with Dense\n  Correspondence for Deformable Objects","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning 3D shape representation with dense correspondence for deformable\nobjects is a fundamental problem in computer vision. Existing approaches often\nneed additional annotations of specific semantic domain, e.g., skeleton poses\nfor human bodies or animals, which require extra annotation effort and suffer\nfrom error accumulation, and they are limited to specific domain. In this\npaper, we propose a novel self-supervised approach to learn neural implicit\nshape representation for deformable objects, which can represent shapes with a\ntemplate shape and dense correspondence in 3D. Our method does not require the\npriors of skeleton and skinning weight, and only requires a collection of\nshapes represented in signed distance fields. To handle the large deformation,\nwe constrain the learned template shape in the same latent space with the\ntraining shapes, design a new formulation of local rigid constraint that\nenforces rigid transformation in local region and addresses local reflection\nissue, and present a new hierarchical rigid constraint to reduce the ambiguity\ndue to the joint learning of template shape and correspondences. Extensive\nexperiments show that our model can represent shapes with large deformations.\nWe also show that our shape representation can support two typical\napplications, such as texture transfer and shape editing, with competitive\nperformance. The code and models are available at\nhttps://iscas3dv.github.io/deformshape\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:38:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Baowen",""],["Li","Jiahe",""],["Deng","Xiaoming",""],["Zhang","Yinda",""],["Ma","Cuixia",""],["Wang","Hongan",""]]}
{"id":"2308.12591","submitter":"Stefan Baumgartner","authors":"Stefan Baumgartner and Oliver Lang and Mario Huemer","title":"SICNN: Soft Interference Cancellation Inspired Neural Network Equalizers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Equalization is an important task at the receiver side of a digital wireless\ncommunication system, which is traditionally conducted with model-based\nestimation methods. Among the numerous options for model-based equalization,\niterative soft interference cancellation (SIC) is a well-performing approach\nsince error propagation caused by hard decision data symbol estimation during\nthe iterative estimation procedure is avoided. However, the model-based method\nsuffers from high computational complexity and performance degradation due to\nrequired approximations. In this work, we propose a novel neural network\n(NN-)based equalization approach, referred to as SICNN, which is designed by\ndeep unfolding of a model-based iterative SIC method, eliminating the main\ndisadvantages of its model-based counterpart. We present different variants of\nSICNN. SICNNv1 is very similar to the model-based method, and is specifically\ntailored for single carrier frequency domain equalization systems, which is the\ncommunication system we regard in this work. The second variant, SICNNv2, is\nmore universal, and is applicable as an equalizer in any communication system\nwith a block-based data transmission scheme. We highlight the pros and cons of\nboth variants. Moreover, for both SICNNv1 and SICNNv2 we present a version with\na highly reduced number of learnable parameters. We compare the achieved bit\nerror ratio performance of the proposed NN-based equalizers with\nstate-of-the-art model-based and NN-based approaches, highlighting the\nsuperiority of SICNNv1 over all other methods. Also, we present a thorough\ncomplexity analysis of the proposed NN-based equalization approaches, and we\ninvestigate the influence of the training set size on the performance of\nNN-based equalizers.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:40:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Baumgartner","Stefan",""],["Lang","Oliver",""],["Huemer","Mario",""]]}
{"id":"2308.12592","submitter":"Shinichiro Yahagi","authors":"Kohki Kawabata and Shinichiro Yahagi","title":"Elliptic genera from classical error-correcting codes","comments":"44 pages","journal-ref":null,"doi":null,"report-no":"OU-HET-1200","categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider chiral fermionic conformal field theories constructed from\nclassical error-correcting codes and provide a systematic way of computing\ntheir elliptic genera. We exploit the U(1) current of the $\\mathcal{N}=2$\nsuperconformal algebra to obtain the U(1)-graded partition function that is\ninvariant under the modular transformation and the spectral flow. We\ndemonstrate our method by constructing extremal $\\mathcal{N}=2$ elliptic genera\nfrom classical codes for relatively small central charges. Also, we give\nnear-extremal elliptic genera and decompose them into $\\mathcal{N}=2$\nsuperconformal characters.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:42:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kawabata","Kohki",""],["Yahagi","Shinichiro",""]]}
{"id":"2308.12593","submitter":"Klaus Heeger","authors":"Klaus Heeger and Danny Hermelin and Matthias Mnich and Dvir Shabtay","title":"No Polynomial Kernels for Knapsack","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DM math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper focuses on kernelization algorithms for the fundamental Knapsack\nproblem. A kernelization algorithm (or kernel) is a polynomial-time reduction\nfrom a problem onto itself, where the output size is bounded by a function of\nsome problem-specific parameter. Such algorithms provide a theoretical model\nfor data reduction and preprocessing and are central in the area of\nparameterized complexity. In this way, a kernel for Knapsack for some parameter\n$k$ reduces any instance of Knapsack to an equivalent instance of size at most\n$f(k)$ in polynomial time, for some computable function $f(\\cdot)$. When\n$f(k)=k^{O(1)}$ then we call such a reduction a polynomial kernel.\n  Our study focuses on two natural parameters for Knapsack: The number of\ndifferent item weights $w_{\\#}$, and the number of different item profits\n$p_{\\#}$. Our main technical contribution is a proof showing that Knapsack does\nnot admit a polynomial kernel for any of these two parameters under standard\ncomplexity-theoretic assumptions. Our proof discovers an elaborate application\nof the standard kernelization lower bound framework, and develops along the way\nnovel ideas that should be useful for other problems as well. We complement our\nlower bounds by showing the Knapsack admits a polynomial kernel for the\ncombined parameter $w_{\\#}+p_{\\#}$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:47:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Heeger","Klaus",""],["Hermelin","Danny",""],["Mnich","Matthias",""],["Shabtay","Dvir",""]]}
{"id":"2308.12594","submitter":"Rafa{\\l} Filip\\'ow","authors":"Rafa{\\l} Filip\\'ow, Krzysztof Kowitz, Adam Kwela","title":"Characterizing existence of certain ultrafilters","comments":null,"journal-ref":"Ann. Pure Appl. Logic 173 (2022), no. 9, Paper No. 103157","doi":"10.1016/j.apal.2022.103157","report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Following Baumgartner [J. Symb. Log. 60 (1995), no. 2], for an ideal\n$\\mathcal{I}$ on $\\omega$, we say that an ultrafilter $\\mathcal{U}$ on $\\omega$\nis an $\\mathcal{I}$-ultrafilter if for every function $f:\\omega\\to\\omega$ there\nis $A\\in \\mathcal{U}$ with $f[A]\\in \\mathcal{I}$. If there is an\n$\\mathcal{I}$-ultrafilter which is not a $\\mathcal{J}$-ultrafilter, then\n$\\mathcal{I}$ is not below $\\mathcal{J}$ in the Kat\\v{e}tov order $\\leq_{K}$\n(i.e. for every function $f:\\omega\\to\\omega$ there is $A\\in \\mathcal{I}$ with\n$f^{-1}[A]\\notin \\mathcal{J}$). On the other hand, in general\n$\\mathcal{I}\\not\\leq_{K}\\mathcal{J}$ does not imply that existence of an\n$\\mathcal{I}$-ultrafilter which is not a $\\mathcal{J}$-ultrafilter is\nconsistent.\n  We provide some sufficient conditions on ideals to obtain the equivalence:\n$\\mathcal{I}\\not\\leq_{K}\\mathcal{J}$ if and only if it is consistent that there\nexists an $\\mathcal{I}$-ultrafilter which is not a $\\mathcal{J}$-ultrafilter.\nIn some cases when the Kat\\v{e}tov order is not enough for the above\nequivalence, we provide other conditions for which a similar equivalence holds.\nWe are mainly interested in the cases when the family of all\n$\\mathcal{I}$-ultrafilters or $\\mathcal{J}$-ultrafilters coincides with some\nknown family of ultrafilters: P-points, Q-points or selective ultrafilters\n(a.k.a. Ramsey ultrafilters). In particular, our results provide a\ncharacterization of Borel ideals $\\mathcal{I}$ which can be used to\ncharacterize P-points as $\\mathcal{I}$-ultrafilters. Moreover, we introduce a\ncardinal invariant which is used to obtain a sufficient condition for the\nexistence of an $\\mathcal{I}$-ultrafilter which is not a\n$\\mathcal{I}$-ultrafilter. Finally, we prove some new results concerning\nexistence of certain ultrafilters under various set-theoretic assumptions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:49:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Filip\u00f3w","Rafa\u0142",""],["Kowitz","Krzysztof",""],["Kwela","Adam",""]]}
{"id":"2308.12595","submitter":"Chen Liang","authors":"Chen Liang, Wenguan Wang, Jiaxu Miao, Yi Yang","title":"Logic-induced Diagnostic Reasoning for Semi-supervised Semantic\n  Segmentation","comments":"Accepted to ICCV 2023; Code: https://github.com/leonnnop/LogicDiag","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in semi-supervised semantic segmentation have been heavily\nreliant on pseudo labeling to compensate for limited labeled data, disregarding\nthe valuable relational knowledge among semantic concepts. To bridge this gap,\nwe devise LogicDiag, a brand new neural-logic semi-supervised learning\nframework. Our key insight is that conflicts within pseudo labels, identified\nthrough symbolic knowledge, can serve as strong yet commonly ignored learning\nsignals. LogicDiag resolves such conflicts via reasoning with logic-induced\ndiagnoses, enabling the recovery of (potentially) erroneous pseudo labels,\nultimately alleviating the notorious error accumulation problem. We showcase\nthe practical application of LogicDiag in the data-hungry segmentation\nscenario, where we formalize the structured abstraction of semantic concepts as\na set of logic rules. Extensive experiments on three standard semi-supervised\nsemantic segmentation benchmarks demonstrate the effectiveness and generality\nof LogicDiag. Moreover, LogicDiag highlights the promising opportunities\narising from the systematic integration of symbolic reasoning into the\nprevalent statistical, neural learning approaches.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:50:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liang","Chen",""],["Wang","Wenguan",""],["Miao","Jiaxu",""],["Yang","Yi",""]]}
{"id":"2308.12596","submitter":"Richa Naja Jain","authors":"Richa N. Jain, R. K. Choudhary, Anil Bhardwaj, T. Imamura, Anshuman\n  Sharma, Umang M. Parikh","title":"Turbulence dynamics and flow speeds in the inner solar corona: Results\n  from radio-sounding experiments by the Akatsuki spacecraft","comments":null,"journal-ref":null,"doi":"10.1093/mnras/stad2491","report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The solar inner corona is a region that plays a critical role in energizing\nthe solar wind and propelling it to supersonic and supra-Alfvenic velocities.\nDespite its importance, this region remains poorly understood because of being\nleast explored due to observational limitations. The coronal radio sounding\ntechnique in this context becomes useful as it helps in providing information\nin parts of this least explored region. To shed light on the dynamics of the\nsolar wind in the inner corona, we conducted a study using data obtained from\ncoronal radio-sounding experiments carried out by the Akatsuki spacecraft\nduring the 2021 Venus-solar conjunction event. By analyzing X-band radio\nsignals recorded at two ground stations (IDSN in Bangalore and UDSC in Japan),\nwe investigated plasma turbulence characteristics and estimated flow speed\nmeasurements based on isotropic quasi-static turbulence models. Our analysis\nrevealed that the speed of the solar wind in the inner corona (at heliocentric\ndistances from 5 to 13 solar radii), ranging from 220-550 km/sec, was higher\nthan the expected average flow speeds in this region. By integrating our\nradio-sounding results with EUV images of the solar disk, we gained a unique\nperspective on the properties and energization of high-velocity plasma streams\noriginating from coronal holes. We tracked the evolution of fast solar wind\nstreams emanating from an extended coronal hole as they propagated to\nincreasing heliocentric distances. Our study provides unique insights into the\nleast-explored inner coronal region by corroborating radio sounding results\nwith EUV observations of the corona.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:51:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jain","Richa N.",""],["Choudhary","R. K.",""],["Bhardwaj","Anil",""],["Imamura","T.",""],["Sharma","Anshuman",""],["Parikh","Umang M.",""]]}
{"id":"2308.12597","submitter":"Soumyadeep Paul","authors":"Soumyadeep Paul, Yusuke Ito, Wei-Lun Hsu, Hirofumi Daiguji","title":"Thermodynamic Bifurcations of Boiling in Solid-State Nanopores","comments":"12 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft nlin.AO physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Boiling heat transfer is the basis of many commonly used cooling techniques.\nIn cooling of electronic devices, for example, it is desirable to further\nminiaturize heat exchangers to achieve higher heat transfer, and thus it is\nnecessary to understand boiling phenomena on shorter spatial and temporal\nscales. This is especially challenging at the nanometer scale because\nconventional imaging techniques cannot capture the dynamics of nanobubbles,\nowing to the Abbe diffraction limit. Here in this research, we utilize the\nnanopore Joule heating system that enables the generation of nanobubbles and\nsimultaneous diagnosis of their nanosecond resolution dynamics using resistive\npulse sensing. When a bias voltage is applied across a silicon nitride nanopore\nimmersed in an aqueous salt solution, Joule heat is generated owing to the flow\nof ionic current. With increasing voltage, the Joule heating intensifies, and\nthe temperature and entropy production in the pore increase. Our sensing\nresults show that nanopore boiling follows the theory of minimum entropy\nproduction and attempts to settle to a minimum dissipative state. This results\nin two boiling bifurcations corresponding to the transition between different\nboiling states. These characteristics of nanopore boiling are represented by an\n\"M\"-shaped boiling curve, experimentally obtained from the Joule heat variation\nwith the applied voltage. A theoretical framework is proposed to model the\nthermodynamics of nanopore bubbles and estimate the system dissipation which\nexplains the four arms of the \"M\"-shaped boiling curve. The present study\nreveals that the utilization of nanopore boiling as a benchmark platform offers\na valuable means for investigating the intricate boiling phenomenon and its\ncorrelation with nanoscale bubble dynamics. This would provide fundamental\ninsights into the chaotic transition boiling regime, which is least understood.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:55:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Paul","Soumyadeep",""],["Ito","Yusuke",""],["Hsu","Wei-Lun",""],["Daiguji","Hirofumi",""]]}
{"id":"2308.12598","submitter":"Xiaoyang Shen","authors":"Xiaoyang Shen","title":"Long range SYK model and boundary SYK model","comments":"12 pages, 10 figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a class of long-range disordered model which is solvable in large-N\nand IR limit and corresponds to a one-dimensional long-range conformal\nmanifold. This class of long-range model can be interpreted as the non-unitary\ninterpolation between the Sachdev-Ye-Kiteav model and the free theory. We\ninvestigate the chaos and information scrambling of the model by analyzing its\nout-of-time correlators. We find suppression of the Lyapunov exponent by the\nlong range interaction and a slowdown in butterfly velocity in the emergent\nlight cone which can be interpreted as the contribution from the anomalous\ndimension of the stress tensor in the spectrum. We further study a Yukawa-SYK\nmodel located in 3 dimensional boundary with a free field living in 4\ndimensional bulk. In the boundary limit, we find a tower of the spinning\noperator protected by the higher spin symmetry in the spectrum. We study the\ninformation of the spectrum and evaluate the central charge and the Lyapunov\nexponent of the boundary model.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:56:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shen","Xiaoyang",""]]}
{"id":"2308.12599","submitter":"Yunkee Chae","authors":"Yunkee Chae, Junghyun Koo, Sungho Lee and Kyogu Lee","title":"Exploiting Time-Frequency Conformers for Music Audio Enhancement","comments":"Accepted by ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the proliferation of video platforms on the internet, recording musical\nperformances by mobile devices has become commonplace. However, these\nrecordings often suffer from degradation such as noise and reverberation, which\nnegatively impact the listening experience. Consequently, the necessity for\nmusic audio enhancement (referred to as music enhancement from this point\nonward), involving the transformation of degraded audio recordings into\npristine high-quality music, has surged to augment the auditory experience. To\naddress this issue, we propose a music enhancement system based on the\nConformer architecture that has demonstrated outstanding performance in speech\nenhancement tasks. Our approach explores the attention mechanisms of the\nConformer and examines their performance to discover the best approach for the\nmusic enhancement task. Our experimental results show that our proposed model\nachieves state-of-the-art performance on single-stem music enhancement.\nFurthermore, our system can perform general music enhancement with multi-track\nmixtures, which has not been examined in previous work.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 06:56:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chae","Yunkee",""],["Koo","Junghyun",""],["Lee","Sungho",""],["Lee","Kyogu",""]]}
{"id":"2308.12600","submitter":"Falak Shah","authors":"Rishit Javia, Falak Shah, and Shivam Dave","title":"PoseSync: Robust pose based video synchronization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pose based video sychronization can have applications in multiple domains\nsuch as gameplay performance evaluation, choreography or guiding athletes. The\nsubject's actions could be compared and evaluated against those performed by\nprofessionals side by side. In this paper, we propose an end to end pipeline\nfor synchronizing videos based on pose. The first step crops the region where\nthe person present in the image followed by pose detection on the cropped\nimage. This is followed by application of Dynamic Time Warping(DTW) on angle/\ndistance measures between the pose keypoints leading to a scale and shift\ninvariant pose matching pipeline.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:02:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Javia","Rishit",""],["Shah","Falak",""],["Dave","Shivam",""]]}
{"id":"2308.12601","submitter":"Joy Bose","authors":"Koonlin Eunice Chan, Joy Bose","title":"Effect of Mindfulness and Mindful Art on Beginners and Experienced\n  Meditators","comments":"5 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mindfulness meditation has been proven to be effective in treating a range of\nmental and physical conditions. Mindful Art is a type of mindfulness meditation\nthat comprises sessions of drawing, painting and sculpturing with mindfulness\nfor a given length of time. To date, the efficacy of mindful art has not been\nsystematically studied. In this paper, we describe an experimental pilot study\non two groups of participants, a beginner group of 21 participants and an\nexperienced meditation group of 9 participants, who had previously practiced\nmindfulness meditation for more than one year. The beginner group was\ninstructed in mindfulness sitting and moving meditation, while the experienced\ngroup was instructed in mindful art making in addition to mindfulness\nmeditation. The instructions were delivered remotely over Tencent Conference\nand WeChat. The sessions were of 90 minutes duration each, twice per week, with\n45 minutes of home practice daily and the length of the study was 21 days. The\nblood pressure, pulse rate and breathing rates, as well as the subjective\ndegree of relaxation were recorded at every session. At the end of the study,\nthe experienced group reported higher average difference in breath rate and\nrelaxation within each session, while the beginner group reported a greater\ndegree of improvement in breath rate and relaxation over the period of the\nstudy, although their scores were lower on average than the experienced group.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:02:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chan","Koonlin Eunice",""],["Bose","Joy",""]]}
{"id":"2308.12602","submitter":"Hongbo Cheng","authors":"Yuxuan Shi, Hongbo Cheng","title":"The gamma-ray burst arising from neutrino pair annihilation in the\n  static and spherically symmetric black-hole-like wormholes","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We look into the neutrino-antineutrino pair ($\\nu+\\bar{\\nu}\\longrightarrow\ne^{-}+e^{+}$) annihilation in the Damour-Solodukhin wormhole spacetime whose\nmetric component involves a shift in contrast to the similar black hole. The\ndeep analysis of the surface temperature of the accretion disk of static,\nspherically symmetric black-hole-like wormholes from R. Kh. Karimov et.al.\nreveals that the accretion disks of the wormholes are hotter than that of\ncomparable black holes, indicating that the wormholes accretion disk can\nrelease neutrinos. Further we investigate the energy deposition rate from the\nneutrino pair annihilation around the Damour-Solodukhin wormhole thought as a\nmimicker of Schwarzschild black hole. By comparison made between the\nblack-hole-like wormhole and the similar black hole, we demonstrate that the\nwormhole's accretion disk drawing the annihilation can become a source of\ngamma-ray burst although the more significant deviation from the similar black\nhole reduces the emitted power slightly. The ratio of energy deposition per\nunit time from the annihilation surrounding the accretion disk of the\nDamour-Solodukhin wormhole over the emitting power of black hole might alter\nnoticeably depending on how slightly the metrics of the wormhole differ from\nthe black hole spacetime.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:04:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shi","Yuxuan",""],["Cheng","Hongbo",""]]}
{"id":"2308.12603","submitter":"Md Ashequl Islam","authors":"Md Ashequl Islam, Nur Saifullah Kamarrudin, M.F.F. Suhaimi, Ruslizam\n  Daud, Ishak Ibrahim, Fauziah Mat","title":"Parametric Investigation on Different Bone Densities to avoid Thermal\n  Necrosis during Bone Drilling Process","comments":null,"journal-ref":null,"doi":"10.1088/1742-6596/2051/1/012033","report-no":null,"categories":"physics.med-ph q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bone drilling is a universal surgical procedure commonly used for internal\nfracture fixation, implant placement, or reconstructive surgery in orthopedics\nand dentistry. The increased temperature during such treatment increases the\nrisk of thermal penetration of the bone, which may delay healing or compromise\nthe fixation's integrity. Thus, avoiding penetration during bone drilling is\ncritical to ensuring the implant's stability, which needs surgical drills with\nan optimized design. Bovine femur and mandible bones are chosen as the work\nmaterial since human bones are not available and are the closest animal bone to\nhuman bone in terms of properties. In the present study, the Taguchi fractional\nfactorial approach was used to determine the best design of surgical drills by\ncomparing the drilling properties (i.e., signal-to-noise ratio and temperature\nrise). The control factors (spindle speed, drill bit diameter, drill site\ndepth, and their levels) were arranged in an L9 orthogonal array. Drilling\nexperiments were done using nine experimental drills with three repetitions.\nThe findings of this study indicate that the ideal values of the surgical\ndrill's three parameters combination (S1D1Di2) and their percentage\ncontribution depend on the parameters' drilling levels. However, the result\nshows that the spindle speed has the highest temperature effect among other\nparameters in both (femur and mandible) bones.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:07:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Islam","Md Ashequl",""],["Kamarrudin","Nur Saifullah",""],["Suhaimi","M. F. F.",""],["Daud","Ruslizam",""],["Ibrahim","Ishak",""],["Mat","Fauziah",""]]}
{"id":"2308.12604","submitter":"Haibo Jin","authors":"Haibo Jin, Haoxuan Che, Yi Lin, Hao Chen","title":"PromptMRG: Diagnosis-Driven Prompts for Medical Report Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic medical report generation (MRG) is of great research value as it\nhas the potential to relieve radiologists from the heavy burden of report\nwriting. Despite recent advancements, accurate MRG remains challenging due to\nthe need for precise clinical understanding and the identification of clinical\nfindings. Moreover, the imbalanced distribution of diseases makes the challenge\neven more pronounced, as rare diseases are underrepresented in training data,\nmaking their diagnostic performance unreliable. To address these challenges, we\npropose diagnosis-driven prompts for medical report generation (PromptMRG), a\nnovel framework that aims to improve the diagnostic accuracy of MRG with the\nguidance of diagnosis-aware prompts. Specifically, PromptMRG is based on\nencoder-decoder architecture with an extra disease classification branch. When\ngenerating reports, the diagnostic results from the classification branch are\nconverted into token prompts to explicitly guide the generation process. To\nfurther improve the diagnostic accuracy, we design cross-modal feature\nenhancement, which retrieves similar reports from the database to assist the\ndiagnosis of a query image by leveraging the knowledge from a pre-trained CLIP.\nMoreover, the disease imbalanced issue is addressed by applying an adaptive\nlogit-adjusted loss to the classification branch based on the individual\nlearning status of each disease, which overcomes the barrier of text decoder's\ninability to manipulate disease distributions. Experiments on two MRG\nbenchmarks show the effectiveness of the proposed method, where it obtains\nstate-of-the-art clinical efficacy performance on both datasets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:10:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jin","Haibo",""],["Che","Haoxuan",""],["Lin","Yi",""],["Chen","Hao",""]]}
{"id":"2308.12605","submitter":"Yupu Yao","authors":"Yupu Yao, Shangqi Deng, Zihan Cao, Harry Zhang, Liang-Jian Deng","title":"APLA: Additional Perturbation for Latent Noise with Adversarial Training\n  Enables Consistency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diffusion models have exhibited promising progress in video generation.\nHowever, they often struggle to retain consistent details within local regions\nacross frames. One underlying cause is that traditional diffusion models\napproximate Gaussian noise distribution by utilizing predictive noise, without\nfully accounting for the impact of inherent information within the input\nitself. Additionally, these models emphasize the distinction between\npredictions and references, neglecting information intrinsic to the videos. To\naddress this limitation, inspired by the self-attention mechanism, we propose a\nnovel text-to-video (T2V) generation network structure based on diffusion\nmodels, dubbed Additional Perturbation for Latent noise with Adversarial\ntraining (APLA). Our approach only necessitates a single video as input and\nbuilds upon pre-trained stable diffusion networks. Notably, we introduce an\nadditional compact network, known as the Video Generation Transformer (VGT).\nThis auxiliary component is designed to extract perturbations from the inherent\ninformation contained within the input, thereby refining inconsistent pixels\nduring temporal predictions. We leverage a hybrid architecture of transformers\nand convolutions to compensate for temporal intricacies, enhancing consistency\nbetween different frames within the video. Experiments demonstrate a noticeable\nimprovement in the consistency of the generated videos both qualitatively and\nquantitatively.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:11:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yao","Yupu",""],["Deng","Shangqi",""],["Cao","Zihan",""],["Zhang","Harry",""],["Deng","Liang-Jian",""]]}
{"id":"2308.12606","submitter":"Tanmay Sen","authors":"Piyush Kanti Bhunre, Tanmay Sen, and Arijit Sarkar","title":"A Greedy Approach for Offering to Telecom Subscribers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.AI cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Customer retention or churn prevention is a challenging task of a telecom\noperator. One of the effective approaches is to offer some attractive incentive\nor additional services or money to the subscribers for keeping them engaged and\nmake sure they stay in the operator's network for longer time. Often, operators\nallocate certain amount of monetary budget to carry out the offer campaign. The\ndifficult part of this campaign is the selection of a set of customers from a\nlarge subscriber-base and deciding the amount that should be offered to an\nindividual so that operator's objective is achieved. There may be multiple\nobjectives (e.g., maximizing revenue, minimizing number of churns) for\nselection of subscriber and selection of an offer to the selected subscriber.\nApart from monetary benefit, offers may include additional data, SMS, hots-spot\ntethering, and many more. This problem is known as offer optimization. In this\npaper, we propose a novel combinatorial algorithm for solving offer\noptimization under heterogeneous offers by maximizing expected revenue under\nthe scenario of subscriber churn, which is, in general, seen in telecom domain.\nThe proposed algorithm is efficient and accurate even for a very large\nsubscriber-base.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:11:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhunre","Piyush Kanti",""],["Sen","Tanmay",""],["Sarkar","Arijit",""]]}
{"id":"2308.12607","submitter":"Yuanjie Lei","authors":"Ning Jiang and Yuanjie Lei","title":"The incompressible Navier-Stokes-Fourier-Maxwell system limits of the\n  Vlasov-Maxwell-Boltzmann system for soft potentials: the noncutoff cases and\n  cutoff cases","comments":"61 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain the global-in-time and uniform in Knudsen number $\\epsilon$ energy\nestimate for the cutoff and non-cutoff scaled Vlasov-Maxwell-Boltzmann system\nfor the soft potential. For the non-cutoff soft potential cases, our analysis\nrelies heavily on additional dissipative mechanisms with respect to velocity,\nwhich are brought about by the strong angular singularity hypothesis, i.e.\n$\\frac12\\leq s<1$. In the case of cutoff cases, our proof relies on two new\nkinds of weight functions and complex construction of energy functions, and\nhere we ask $\\gamma\\geq-1$. As a consequence, we justify the incompressible\nNavier-Stokes-Fourier-Maxwell equations with Ohm's law limit.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:19:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jiang","Ning",""],["Lei","Yuanjie",""]]}
{"id":"2308.12608","submitter":"Huaxin Zhang","authors":"Huaxin Zhang, Xiang Wang, Xiaohao Xu, Zhiwu Qing, Changxin Gao, Nong\n  Sang","title":"HR-Pro: Point-supervised Temporal Action Localization via Hierarchical\n  Reliability Propagation","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Point-supervised Temporal Action Localization (PSTAL) is an emerging research\ndirection for label-efficient learning. However, current methods mainly focus\non optimizing the network either at the snippet-level or the instance-level,\nneglecting the inherent reliability of point annotations at both levels. In\nthis paper, we propose a Hierarchical Reliability Propagation (HR-Pro)\nframework, which consists of two reliability-aware stages: Snippet-level\nDiscrimination Learning and Instance-level Completeness Learning, both stages\nexplore the efficient propagation of high-confidence cues in point annotations.\nFor snippet-level learning, we introduce an online-updated memory to store\nreliable snippet prototypes for each class. We then employ a Reliability-aware\nAttention Block to capture both intra-video and inter-video dependencies of\nsnippets, resulting in more discriminative and robust snippet representation.\nFor instance-level learning, we propose a point-based proposal generation\napproach as a means of connecting snippets and instances, which produces\nhigh-confidence proposals for further optimization at the instance level.\nThrough multi-level reliability-aware learning, we obtain more reliable\nconfidence scores and more accurate temporal boundaries of predicted proposals.\nOur HR-Pro achieves state-of-the-art performance on multiple challenging\nbenchmarks, including an impressive average mAP of 60.3% on THUMOS14. Notably,\nour HR-Pro largely surpasses all previous point-supervised methods, and even\noutperforms several competitive fully supervised methods. Code will be\navailable at https://github.com/pipixin321/HR-Pro.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:19:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Huaxin",""],["Wang","Xiang",""],["Xu","Xiaohao",""],["Qing","Zhiwu",""],["Gao","Changxin",""],["Sang","Nong",""]]}
{"id":"2308.12609","submitter":"Zhang Songchun","authors":"Songchun Zhang, and Chunhui Zhao","title":"Cross-Video Contextual Knowledge Exploration and Exploitation for\n  Ambiguity Reduction in Weakly Supervised Temporal Action Localization","comments":"Submitted to TCSVT. 14 pages and 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Weakly supervised temporal action localization (WSTAL) aims to localize\nactions in untrimmed videos using video-level labels. Despite recent advances,\nexisting approaches mainly follow a localization-by-classification pipeline,\ngenerally processing each segment individually, thereby exploiting only limited\ncontextual information. As a result, the model will lack a comprehensive\nunderstanding (e.g. appearance and temporal structure) of various action\npatterns, leading to ambiguity in classification learning and temporal\nlocalization. Our work addresses this from a novel perspective, by exploring\nand exploiting the cross-video contextual knowledge within the dataset to\nrecover the dataset-level semantic structure of action instances via weak\nlabels only, thereby indirectly improving the holistic understanding of\nfine-grained action patterns and alleviating the aforementioned ambiguities.\nSpecifically, an end-to-end framework is proposed, including a Robust\nMemory-Guided Contrastive Learning (RMGCL) module and a Global Knowledge\nSummarization and Aggregation (GKSA) module. First, the RMGCL module explores\nthe contrast and consistency of cross-video action features, assisting in\nlearning more structured and compact embedding space, thus reducing ambiguity\nin classification learning. Further, the GKSA module is used to efficiently\nsummarize and propagate the cross-video representative action knowledge in a\nlearnable manner to promote holistic action patterns understanding, which in\nturn allows the generation of high-confidence pseudo-labels for self-learning,\nthus alleviating ambiguity in temporal localization. Extensive experiments on\nTHUMOS14, ActivityNet1.3, and FineAction demonstrate that our method\noutperforms the state-of-the-art methods, and can be easily plugged into other\nWSTAL methods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:19:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Songchun",""],["Zhao","Chunhui",""]]}
{"id":"2308.12610","submitter":"Shanti Stewart","authors":"Shanti Stewart, Tiantian Feng, Kleanthis Avramidis, Shrikanth\n  Narayanan","title":"Emotion-Aligned Contrastive Learning Between Images and Music","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traditional music search engines rely on retrieval methods that match natural\nlanguage queries with music metadata. There have been increasing efforts to\nexpand retrieval methods to consider the audio characteristics of music itself,\nusing queries of various modalities including text, video, and speech. Most\napproaches aim to match general music semantics to the input queries, while\nonly a few focus on affective qualities. We address the task of retrieving\nemotionally-relevant music from image queries by proposing a framework for\nlearning an affective alignment between images and music audio. Our approach\nfocuses on learning an emotion-aligned joint embedding space between images and\nmusic. This joint embedding space is learned via emotion-supervised contrastive\nlearning, using an adapted cross-modal version of the SupCon loss. We directly\nevaluate the joint embeddings with cross-modal retrieval tasks (image-to-music\nand music-to-image) based on emotion labels. In addition, we investigate the\ngeneralizability of the learned music embeddings with automatic music tagging\nas a downstream task. Our experiments show that our approach successfully\naligns images and music, and that the learned embedding space is effective for\ncross-modal retrieval applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:20:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Stewart","Shanti",""],["Feng","Tiantian",""],["Avramidis","Kleanthis",""],["Narayanan","Shrikanth",""]]}
{"id":"2308.12611","submitter":"Nepal Banerjee","authors":"Nepal Banerjee","title":"Mixed phase and Tetra-critical Behaviour of Dilute 3D Heisenberg Magnet","comments":"Comments and suggestions are most welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Here we have simulated the dilute magnetic alloy with generic type\n$A_pB_{1-p}$.Here A and B is ferromagnetic and antiferromagnetic type magnetic\natom.Here we have studied the mixed phase and tetra-critical behavior of that\ndilute magnet.We have simulated the critical behavior of that kind of mixed\nphase at different doping strength.Here we have observed mixed phase rather\nthan spin-glass(SG) phase in this site random(SR) disorder model.Here we have\nused classical Monte-Carlo simulation with Heisenberg spin and use 3D simple\ncubic lattice for this simulation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:21:14 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:40:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Banerjee","Nepal",""]]}
{"id":"2308.12612","submitter":"Lin Yang","authors":"Lin Yang, Junjie Chen, Zhihao Gong, Shutao Gao, Hongyu Zhang, Yue\n  Kang, Huaan Li","title":"Try with Simpler -- An Evaluation of Improved Principal Component\n  Analysis in Log-based Anomaly Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapid growth of deep learning (DL) has spurred interest in enhancing\nlog-based anomaly detection. This approach aims to extract meaning from log\nevents (log message templates) and develop advanced DL models for anomaly\ndetection. However, these DL methods face challenges like heavy reliance on\ntraining data, labels, and computational resources due to model complexity. In\ncontrast, traditional machine learning and data mining techniques are less\ndata-dependent and more efficient but less effective than DL. To make log-based\nanomaly detection more practical, the goal is to enhance traditional techniques\nto match DL's effectiveness. Previous research in a different domain (linking\nquestions on Stack Overflow) suggests that optimized traditional techniques can\nrival state-of-the-art DL methods. Drawing inspiration from this concept, we\nconducted an empirical study. We optimized the unsupervised PCA (Principal\nComponent Analysis), a traditional technique, by incorporating lightweight\nsemantic-based log representation. This addresses the issue of unseen log\nevents in training data, enhancing log representation. Our study compared seven\nlog-based anomaly detection methods, including four DL-based, two traditional,\nand the optimized PCA technique, using public and industrial datasets. Results\nindicate that the optimized unsupervised PCA technique achieves similar\neffectiveness to advanced supervised/semi-supervised DL methods while being\nmore stable with limited training data and resource-efficient. This\ndemonstrates the adaptability and strength of traditional techniques through\nsmall yet impactful adaptations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:22:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Lin",""],["Chen","Junjie",""],["Gong","Zhihao",""],["Gao","Shutao",""],["Zhang","Hongyu",""],["Kang","Yue",""],["Li","Huaan",""]]}
{"id":"2308.12613","submitter":"Evgeny Perepelkin","authors":"E.E. Perepelkin, B.I. Sadovnikov, N.G. Inozemtseva, P.V. Afonin","title":"Wigner function properties for electromagnetic systems","comments":"26 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using the Wigner-Vlasov formalism, an exact 3D solution of the Schr\\\"odinger\nequation for a scalar particle in an electromagnetic field is constructed.\nElectric and magnetic fields are non-uniform. According to the exact expression\nfor the wave function, the search for two types of the Wigner functions is\nconducted. The first function is the usual Wigner function with a modified\nmomentum. The second Wigner function is constructed on the basis of the\nWeyl-Stratonovich transform in papers [Phys. Rev. A 35 2791 (1987)] or [Phys.\nRev. B 99 014423 (2019)]. It turns out that the second function, unlike the\nfirst one, has areas of negative values for wave functions with the Gaussian\ndistribution (Hudson's theorem).\n  On the one hand, knowing the Wigner functions allows one to find the\ndistribution of the mean momentum vector field and the energy spectrum of the\nquantum system. On the other hand, within the framework of the Wigner-Vlasov\nformalism, the mean momentum distribution and the magnitude of the energy are\ninitially known. Consequently, the mean momentum distributions and energy\nvalues obtained according to the Wigner functions can be compared with the\nexact momentum distribution and energy values. This paper presents this\ncomparison and describes the differences. For the first Wigner function, an\nanalog of the Moyal equation with an electromagnetic part and the\nHamilton-Jacobi operator equation are obtained. An operator analogue of the\n{\\guillemotleft}motion equation{\\guillemotright} with electromagnetic\ninteraction is constructed. For the second Vlasov equation, an operator\nexpression for the Vlasov-Moyal approximation for systems with electromagnetic\ninteraction is obtained.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:23:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Perepelkin","E. E.",""],["Sadovnikov","B. I.",""],["Inozemtseva","N. G.",""],["Afonin","P. V.",""]]}
{"id":"2308.12614","submitter":"Indrajit Paul","authors":"Ashok Kumar Das, Indrajit Paul","title":"Obstruction characterization of co-TT graphs","comments":"arXiv admin note: substantial text overlap with arXiv:2206.05917","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Threshold tolerance graphs and their complement graphs ( known as co-TT\ngraphs) were introduced by Monma, Reed and Trotter[24]. Introducing the concept\nof negative interval Hell et al.[19] defined signed-interval bigraphs/digraphs\nand have shown that they are equivalent to several seemingly different classes\nof bigraphs/digraphs. They have also shown that co-TT graphs are equivalent to\nsymmetric signed-interval digraphs. In this paper we characterize\nsigned-interval bigraphs and signed-interval graphs respectively in terms of\ntheir biadjacency matrices and adjacency matrices. Finally, based on the\ngeometric representation of signed-interval graphs we have setteled the open\nproblem of forbidden induced subgraph characterization of co-TT graphs posed by\nMonma, Reed and Trotter in the same paper.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:26:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Das","Ashok Kumar",""],["Paul","Indrajit",""]]}
{"id":"2308.12615","submitter":"Kuan-Hsun Ho","authors":"Kuan-Hsun Ho, En-Lun Yu, Jeih-weih Hung, and Berlin Chen","title":"Naaloss: Rethinking the objective of speech enhancement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reducing noise interference is crucial for automatic speech recognition (ASR)\nin a real-world scenario. However, most single-channel speech enhancement (SE)\ngenerates \"processing artifacts\" that negatively affect ASR performance. Hence,\nin this study, we suggest a Noise- and Artifacts-aware loss function, NAaLoss,\nto ameliorate the influence of artifacts from a novel perspective. NAaLoss\nconsiders the loss of estimation, de-artifact, and noise ignorance, enabling\nthe learned SE to individually model speech, artifacts, and noise. We examine\ntwo SE models (simple/advanced) learned with NAaLoss under various input\nscenarios (clean/noisy) using two configurations of the ASR system\n(with/without noise robustness). Experiments reveal that NAaLoss significantly\nimproves the ASR performance of most setups while preserving the quality of SE\ntoward perception and intelligibility. Furthermore, we visualize artifacts\nthrough waveforms and spectrograms, and explain their impact on ASR.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:29:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ho","Kuan-Hsun",""],["Yu","En-Lun",""],["Hung","Jeih-weih",""],["Chen","Berlin",""]]}
{"id":"2308.12616","submitter":"Lei Gu","authors":"Lei Gu, Guoping Zhaov, Yan-Zhen Zheng, Ruqian Wu","title":"Coercivity Mechanisms of Single-Molecule Magnets","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic hysteresis has become a crucial aspect for characterizing\nsingle-molecule magnets, but the comprehension of the coercivity mechanism is\nstill a challenge. By using analytical derivation and quantum dynamical\nsimulations, we reveal fundamental rules that govern magnetic relaxation of\nsingle molecule magnets under the influence of external magnetic fields, which\nin turn dictates the hysteresis behavior. Specifically, we find that energy\nlevel crossing induced by magnetic fields can drastically increase the\nrelaxation rate and set a coercivity limit. The activation of\noptical-phonon-mediated quantum tunneling accelerates the relaxation and\nlargely determines the coercivity. Intra-molecular exchange interaction in\nmulti-ion compounds may enhance the coercivity by suppressing key relaxation\nprocesses. A single-occupant bond in mixed-valence complexes compromises\ncoercivity, and pre-spin-flip of the bonding electron facilitates the overall\nmagnetization reversal. Underlying these properties are magnetic relaxation\nprocesses modulated by the interplay of magnetic fields, phonon spectrum and\nspin state configuration, which also proposes a fresh perspective for the\nnearly centurial coercive paradox.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:33:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gu","Lei",""],["Zhaov","Guoping",""],["Zheng","Yan-Zhen",""],["Wu","Ruqian",""]]}
{"id":"2308.12617","submitter":"Shuai Feng","authors":"Shuai Feng, Maojiao Ye, Lihua Xie, Shengyuan Xu","title":"Quantized distributed Nash equilibrium seeking under DoS attacks: A\n  quantized consensus based approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.MA cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper studies distributed Nash equilibrium (NE) seeking under\nDenial-of-Service (DoS) attacks and quantization. The players can only exchange\ninformation with their own direct neighbors. The transmitted information is\nsubject to quantization and packet losses induced by malicious DoS attacks. We\npropose a quantized distributed NE seeking strategy based on the approach of\ndynamic quantized consensus. To solve the quantizer saturation problem caused\nby DoS attacks, the quantization mechanism is equipped to have zooming-in and\nholding capabilities, in which the holding capability is consistent with the\nresults in quantized consensus under DoS. A sufficient condition on the number\nof quantizer levels is provided, under which the quantizers are free from\nsaturation under DoS attacks. The proposed distributed quantized NE seeking\nstrategy is shown to have the so-called maximum resilience to DoS attacks.\nNamely, if the bound characterizing the maximum resilience is violated, an\nattacker can deny all the transmissions and hence distributed NE seeking is\nimpossible.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:34:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Feng","Shuai",""],["Ye","Maojiao",""],["Xie","Lihua",""],["Xu","Shengyuan",""]]}
{"id":"2308.12618","submitter":"Hui Wang","authors":"Hui Wang, Xiaoqiu Ye, Xitian Zhang, Jian Lv and Yansun Yao","title":"Unveiling Hidden Physics in the 215-Kelvin Superconducting Calcium\n  Hydride: Temperature, Quantum and Defect Effects","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Temperature and quantum effects induce the structural complexity of condensed\nhydrogen, and therefore they are expected to impact nontrivially the structures\nof clathrate hydrides. Exemplified by clathrate calcium hydride, we show\nthrough ab initio (path-integral) molecular dynamics simulations that these\neffects are indeed pivotal at 100-200 GPa. The quantum equation of states\nderived at 300 K suggests that the synthesized samples in previous experiments\nwere berthollide-like CaH$_{6-\\delta}$, with the stoichiometric defect $\\delta$\nincreasing smoothly during decompression. The change of composition provides an\nexplanation for the experimental observation of positive pressure dependence of\nsuperconducting T$_c$ below 165 GPa. Furthermore, we find significant proton\ndiffusion in CaH$_{6-\\delta}$ at 150-300 K, with the diffusion coefficient\nreaching 10$^{-7}$ cm$^{2}$/s. This suggests a coexistence of superconductivity\nand proton diffusion in clathrate hydrides. Our findings underline the\nimportance of temperature, quantum and defect effects to the understandings of\nthe structure and pertinent physics in high-T$_c$ superconducting clathrate\nhydrides.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:38:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Hui",""],["Ye","Xiaoqiu",""],["Zhang","Xitian",""],["Lv","Jian",""],["Yao","Yansun",""]]}
{"id":"2308.12619","submitter":"Ziao Qin","authors":"Ziao Qin, Haifan Yin, and Weidong Li","title":"Eigenvector prediction-based precoding for massive MIMO with mobility","comments":"13pages, 7 figures, 1 table, journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Eigenvector decomposition (EVD) is an inevitable operation to obtain the\nprecoders in practical massive multiple-input multiple-output (MIMO) systems.\nDue to the large antenna size and at finite computation resources at the base\nstation (BS), the overwhelming computation complexity of EVD is one of the key\nlimiting factors of the system performance. To address this problem, we propose\nan eigenvector prediction (EGVP) method by interpolating the precoding matrix\nwith predicted eigenvectors. The basic idea is to exploit a few historical\nprecoders to interpolate the rest of them without EVD of the channel state\ninformation (CSI). We transform the nonlinear EVD into a linear prediction\nproblem and prove that the prediction of the eigenvectors can be achieved with\na complex exponential model. Furthermore, a channel prediction method called\nfast matrix pencil prediction (FMPP) is proposed to cope with the CSI delay\nwhen applying the EGVP method in mobility environments. The asymptotic analysis\ndemonstrates how many samples are needed to achieve asymptotically error-free\neigenvector predictions and channel predictions. Finally, the simulation\nresults demonstrate the spectral efficiency improvement of our scheme over the\nbenchmarks and the robustness to different mobility scenarios.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:45:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Qin","Ziao",""],["Yin","Haifan",""],["Li","Weidong",""]]}
{"id":"2308.12620","submitter":"Takato Ishida","authors":"Takato Ishida, Yuya Doi, Takashi Uneyama and Yuichi Masubuchi","title":"Modeling for heterogeneous oxidative aging of polymers using\n  coarse-grained molecular dynamics","comments":"32 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study presents a coarse-grained molecular dynamics simulation model to\ninvestigate the process of oxidative aging in polymers. The chemical aging\neffect is attributed to the auto-oxidation mechanism, which is initiated by\nradicals, leading to the chain scission and crosslinking of polymer chains. In\nthis study, we integrate a thermal oxidation kinetic model in the oxygen excess\nregime into the Kremer-Grest model, thereby enabling a reactive coarse-grained\nmolecular dynamics simulation to capture the process of oxidative degradation.\nOur simulation reveals that when the timescale of the characteristic reaction\nstep of oxidative degradation is shorter than the longest relaxation time of\npolymer chains, the scission sites exhibit spatial heterogeneity. This\ninnovative simulation model possesses the potential to enhance our\ncomprehension of polymer aging phenomena, thus making noteworthy contributions\nto the realm of polymer science and degradation chemistry.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:50:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ishida","Takato",""],["Doi","Yuya",""],["Uneyama","Takashi",""],["Masubuchi","Yuichi",""]]}
{"id":"2308.12621","submitter":"Xinqi Zhang","authors":"Xinqi Zhang, Jihao Shi, Junjie Li, Guoming Chen","title":"Hydrogen jet diffusion modeling by using physics-informed graph neural\n  network and sparsely-distributed sensor data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient modeling of jet diffusion during accidental release is critical for\noperation and maintenance management of hydrogen facilities. Deep learning has\nproven effective for concentration prediction in gas jet diffusion scenarios.\nNonetheless, its reliance on extensive simulations as training data and its\npotential disregard for physical laws limit its applicability to unseen\naccidental scenarios. Recently, physics-informed neural networks (PINNs) have\nemerged to reconstruct spatial information by using data from\nsparsely-distributed sensors which are easily collected in real-world\napplications. However, prevailing approaches use the fully-connected neural\nnetwork as the backbone without considering the spatial dependency of sensor\ndata, which reduces the accuracy of concentration prediction. This study\nintroduces the physics-informed graph deep learning approach (Physic_GNN) for\nefficient and accurate hydrogen jet diffusion prediction by using\nsparsely-distributed sensor data. Graph neural network (GNN) is used to model\nthe spatial dependency of such sensor data by using graph nodes at which\ngoverning equations describing the physical law of hydrogen jet diffusion are\nimmediately solved. The computed residuals are then applied to constrain the\ntraining process. Public experimental data of hydrogen jet is used to compare\nthe accuracy and efficiency between our proposed approach Physic_GNN and\nstate-of-the-art PINN. The results demonstrate our Physic_GNN exhibits higher\naccuracy and physical consistency of centerline concentration prediction given\nsparse concentration compared to PINN and more efficient compared to OpenFOAM.\nThe proposed approach enables accurate and robust real-time spatial consequence\nreconstruction and underlying physical mechanisms analysis by using sparse\nsensor data.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:50:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Xinqi",""],["Shi","Jihao",""],["Li","Junjie",""],["Chen","Guoming",""]]}
{"id":"2308.12622","submitter":"Ariel Kulik","authors":"Ilan Doron-Arad and Ariel Kulik and Hadas Shachnai","title":"An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative\n  Randomized Rounding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the Uniform Cardinality Constrained Multiple Knapsack problem (CMK),\na natural generalization of Multiple Knapsack with applications ranging from\ncloud computing to radio networks. The input is a set of items, each has a\nvalue and a weight, and a set of uniform capacity bins. The goal is to assign a\nsubset of the items of maximum total value to the bins such that $(i)$ the\ncapacity of any bin is not exceeded, and $(ii)$ the number of items assigned to\neach bin satisfies a given cardinality constraint. The best known approximation\nratio for CMK is $1-\\frac{\\ln (2)}{2} -\\epsilon \\approx 0.653$, which follows\nfrom a result for a generalization of the problem.\n  Our main contribution is an efficient polynomial time approximation scheme\n(EPTAS) for CMK. This essentially resolves the complexity status of the\nproblem, since the existence of a fully polynomial time approximation scheme\n(FPTAS) is ruled out. Our technique is based on the following simple algorithm:\nin each iteration, solve a configuration linear program (LP) of the problem;\nthen, sample configurations (i.e., feasible subsets of items for a single bin)\naccording to a distribution specified by the LP solution. The algorithm\nterminates once each bin is assigned a configuration. We believe that our\ngeneric technique may lead to efficient approximations for other assignment\nproblems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:52:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Doron-Arad","Ilan",""],["Kulik","Ariel",""],["Shachnai","Hadas",""]]}
{"id":"2308.12623","submitter":"Sebastien Pecqueur","authors":"Wiem Haj Ammar, Aicha Boujnah, Aimen Boubaker, Adel Kalboussi, Kamal\n  Lmimouni and S\\'ebastien Pecqueur","title":"Steady vs. Dynamic Contributions of Different Doped Conducting Polymers\n  in the Principal Components of an Electronic Nose's Response","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multivariate data analysis and machine-learning classification become popular\ntools to extract features without physical models for complex environments\nrecognition. For electronic noses, time sampling over multiple sensors must be\na fair compromise between a period sufficiently long to output a meaningful\ninformation pattern, and sufficiently short to minimize training time for\npractical applications. Particularly when reactivity's kinetics differ from\nthermodynamics' in sensitive materials, finding the best compromise to get the\nmost from data is not obvious. Here, we investigate on the influence of data\nacquisition to improve or alter data clustering for molecular recognition on a\nconducting polymer electronic nose. We found out that waiting for the sensors\nto reach their steady state is not required for classification, and that\nreducing data acquisition down to the first dynamical information suffice to\nrecognize molecular gases by principal component analysis with the same\nmaterials. Particularly for online inference, this study shows that a good\nsensing array is no array of good sensors, and that new figure-of-merits shall\nbe defined for sensing hardware aiming machine-learning pattern-recognition\nrather than metrology.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 07:55:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ammar","Wiem Haj",""],["Boujnah","Aicha",""],["Boubaker","Aimen",""],["Kalboussi","Adel",""],["Lmimouni","Kamal",""],["Pecqueur","S\u00e9bastien",""]]}
{"id":"2308.12624","submitter":"Jianan Li","authors":"Jianan Li, Liang Li, Shiyu Zhao","title":"Predator-prey survival pressure is sufficient to evolve swarming\n  behaviors","comments":null,"journal-ref":null,"doi":"10.1088/1367-2630/acf33a","report-no":null,"categories":"q-bio.PE cs.MA cs.NE cs.RO physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The comprehension of how local interactions arise in global collective\nbehavior is of utmost importance in both biological and physical research.\nTraditional agent-based models often rely on static rules that fail to capture\nthe dynamic strategies of the biological world. Reinforcement learning has been\nproposed as a solution, but most previous methods adopt handcrafted reward\nfunctions that implicitly or explicitly encourage the emergence of swarming\nbehaviors. In this study, we propose a minimal predator-prey coevolution\nframework based on mixed cooperative-competitive multiagent reinforcement\nlearning, and adopt a reward function that is solely based on the fundamental\nsurvival pressure, that is, prey receive a reward of $-1$ if caught by\npredators while predators receive a reward of $+1$. Surprisingly, our analysis\nof this approach reveals an unexpectedly rich diversity of emergent behaviors\nfor both prey and predators, including flocking and swirling behaviors for\nprey, as well as dispersion tactics, confusion, and marginal predation\nphenomena for predators. Overall, our study provides novel insights into the\ncollective behavior of organisms and highlights the potential applications in\nswarm robotics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:03:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Jianan",""],["Li","Liang",""],["Zhao","Shiyu",""]]}
{"id":"2308.12625","submitter":"Yuqiong Wu","authors":"Hua Wang, Yuqiong Wu, Yushun Zhang, Fuqiang Lai, Zhou Feng, Bing Xie,\n  Ailin Zhao","title":"Uncertainty and Explainable Analysis of Machine Learning Model for\n  Reconstruction of Sonic Slowness Logs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Logs are valuable information for oil and gas fields as they help to\ndetermine the lithology of the formations surrounding the borehole and the\nlocation and reserves of subsurface oil and gas reservoirs. However, important\nlogs are often missing in horizontal or old wells, which poses a challenge in\nfield applications. In this paper, we utilize data from the 2020 machine\nlearning competition of the SPWLA, which aims to predict the missing\ncompressional wave slowness and shear wave slowness logs using other logs in\nthe same borehole. We employ the NGBoost algorithm to construct an Ensemble\nLearning model that can predicate the results as well as their uncertainty.\nFurthermore, we combine the SHAP method to investigate the interpretability of\nthe machine learning model. We compare the performance of the NGBosst model\nwith four other commonly used Ensemble Learning methods, including Random\nForest, GBDT, XGBoost, LightGBM. The results show that the NGBoost model\nperforms well in the testing set and can provide a probability distribution for\nthe prediction results. In addition, the variance of the probability\ndistribution of the predicted log can be used to justify the quality of the\nconstructed log. Using the SHAP explainable machine learning model, we\ncalculate the importance of each input log to the predicted results as well as\nthe coupling relationship among input logs. Our findings reveal that the\nNGBoost model tends to provide greater slowness prediction results when the\nneutron porosity and gamma ray are large, which is consistent with the\ncognition of petrophysical models. Furthermore, the machine learning model can\ncapture the influence of the changing borehole caliper on slowness, where the\ninfluence of borehole caliper on slowness is complex and not easy to establish\na direct relationship. These findings are in line with the physical principle\nof borehole acoustics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:03:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Hua",""],["Wu","Yuqiong",""],["Zhang","Yushun",""],["Lai","Fuqiang",""],["Feng","Zhou",""],["Xie","Bing",""],["Zhao","Ailin",""]]}
{"id":"2308.12626","submitter":"Kevin Guo","authors":"Kevin S. Guo, MengKe Feng, Jonathan Y. Huang, Will Gilbert, Kohei M.\n  Itoh, Fay E. Hudson, Kok Wai Chan, Wee Han Lim, Andrew S. Dzurak, and Andre\n  Saraiva","title":"Methods for transverse and longitudinal spin-photon coupling in silicon\n  quantum dots with intrinsic spin-orbit effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a full-scale quantum computer with a fault-tolerant architecture, having\nscalable, long-range interaction between qubits is expected to be a highly\nvaluable resource. One promising method of achieving this is through the\nlight-matter interaction between spins in semiconductors and photons in\nsuperconducting cavities. This paper examines the theory of both transverse and\nlongitudinal spin-photon coupling and their applications in the silicon\nmetal-oxide-semiconductor (SiMOS) platform. We propose a method of coupling\nwhich uses the intrinsic spin-orbit interaction arising from orbital\ndegeneracies in SiMOS qubits. Using theoretical analysis and experimental data,\nwe show that the strong coupling regime is achievable in the transverse scheme.\nWe also evaluate the feasibility of a longitudinal coupling driven by an AC\nmodulation on the qubit. These coupling methods eschew the requirement for an\nexternal micromagnet, enhancing prospects for scalability and integration into\na large-scale quantum computer.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:04:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guo","Kevin S.",""],["Feng","MengKe",""],["Huang","Jonathan Y.",""],["Gilbert","Will",""],["Itoh","Kohei M.",""],["Hudson","Fay E.",""],["Chan","Kok Wai",""],["Lim","Wee Han",""],["Dzurak","Andrew S.",""],["Saraiva","Andre",""]]}
{"id":"2308.12627","submitter":"Max Landauer","authors":"Max Landauer and Florian Skopik and Markus Wurzenberger","title":"Introducing a New Alert Data Set for Multi-Step Attack Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Intrusion detection systems (IDS) reinforce cyber defense by autonomously\nmonitoring various data sources for traces of attacks. However, IDSs are also\ninfamous for frequently raising false positives and alerts that are difficult\nto interpret without context. This results in high workloads on security\noperators who need to manually verify all reported alerts, often leading to\nfatigue and incorrect decisions. To generate more meaningful alerts and\nalleviate these issues, the research domain focused on multi-step attack\nanalysis proposes approaches for filtering, clustering, and correlating IDS\nalerts, as well as generation of attack graphs. Unfortunately, existing data\nsets are outdated, unreliable, narrowly focused, or only suitable for IDS\nevaluation. Since hardly any suitable benchmark data sets are publicly\navailable, researchers often resort to private data sets that prevent\nreproducibility of evaluations. We therefore generate a new alert data set that\nwe publish alongside this paper. The data set contains alerts from three\ndistinct IDSs monitoring eight executions of a multi-step attack as well as\nsimulations of normal user behavior. To illustrate the potential of our data\nset, we experiment with alert prioritization as well as two open-source tools\nfor meta-alert generation and attack graph extraction.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:06:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Landauer","Max",""],["Skopik","Florian",""],["Wurzenberger","Markus",""]]}
{"id":"2308.12628","submitter":"Velitchko Filipov","authors":"Velitchko Filipov and Davide Ceneda and Daniel Archambault and Alessio\n  Arleo","title":"TimeLighting: Guidance-enhanced Exploration of 2D Projections of\n  Temporal Graphs","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In temporal (or event-based) networks, time is a continuous axis, with\nreal-valued time coordinates for each node and edge. Computing a layout for\nsuch graphs means embedding the node trajectories and edge surfaces over time\nin a 2D + t space, known as the space-time cube. Currently, these space-time\ncube layouts are visualized through animation or by slicing the cube at regular\nintervals. However, both techniques present problems ranging from sub-par\nperformance on some tasks to loss of precision. In this paper, we present\nTimeLighting, a novel visual analytics approach to visualize and explore\ntemporal graphs embedded in the space-time cube. Our interactive approach\nhighlights the node trajectories and their mobility over time, visualizes node\n\"aging\", and provides guidance to support users during exploration. We evaluate\nour approach through two case studies, showing the system's efficacy in\nidentifying temporal patterns and the role of the guidance features in the\nexploration process.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:12:04 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:37:57 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Filipov","Velitchko",""],["Ceneda","Davide",""],["Archambault","Daniel",""],["Arleo","Alessio",""]]}
{"id":"2308.12629","submitter":"Liang Li","authors":"Liang Li, Haotian Li, Xiyuan Liu, Dongjiao He, Ziliang Miao, Fanze\n  Kong, Rundong Li, Zheng Liu and Fu Zhang","title":"Joint Intrinsic and Extrinsic LiDAR-Camera Calibration in Targetless\n  Environments Using Plane-Constrained Bundle Adjustment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel targetless method for joint intrinsic and\nextrinsic calibration of LiDAR-camera systems using plane-constrained bundle\nadjustment (BA). Our method leverages LiDAR point cloud measurements from\nplanes in the scene, alongside visual points derived from those planes. The\ncore novelty of our method lies in the integration of visual BA with the\nregistration between visual points and LiDAR point cloud planes, which is\nformulated as a unified optimization problem. This formulation achieves\nconcurrent intrinsic and extrinsic calibration, while also imparting depth\nconstraints to the visual points to enhance the accuracy of intrinsic\ncalibration. Experiments are conducted on both public data sequences and\nself-collected dataset. The results showcase that our approach not only\nsurpasses other state-of-the-art (SOTA) methods but also maintains remarkable\ncalibration accuracy even within challenging environments. For the benefits of\nthe robotics community, we have open sourced our codes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:12:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Liang",""],["Li","Haotian",""],["Liu","Xiyuan",""],["He","Dongjiao",""],["Miao","Ziliang",""],["Kong","Fanze",""],["Li","Rundong",""],["Liu","Zheng",""],["Zhang","Fu",""]]}
{"id":"2308.12630","submitter":"Yong Xiao","authors":"Yong Xiao, Yu Tian and Yu-Xiao Liu","title":"Extended black hole thermodynamics from extended Iyer-Wald formalism","comments":"8 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, there has been significant interest in the field of extended\nblack hole thermodynamics, where the cosmological constant and/or other\ncoupling parameters are treated as thermodynamic variables. Drawing inspiration\nfrom the Iyer-Wald formalism, which reveals the intrinsic and universal\nstructure of conventional black hole thermodynamics, we illustrate that a\nproper extension of this formalism also unveils the underlying theoretical\nstructure of extended black hole thermodynamics. As a remarkable consequence,\nfor any gravitational theory described by a diffeomorphism invariant action, it\nis always possible to construct a consistent extended thermodynamics using this\nextended formalism.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:13:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xiao","Yong",""],["Tian","Yu",""],["Liu","Yu-Xiao",""]]}
{"id":"2308.12631","submitter":"Shiro Kawachi","authors":"Shiro Kawachi, Jun-ichi Yamaura, Yoshio Kuramoto, Soshi Iimura,\n  Toshihiro Nomura, Yoshimitsu Kohama, Takashi Sasaki, Masashi Tokunaga,\n  Youichi Murakami, and Hideo Hosono","title":"Distinctive Doping Dependence of Upper Critical Field in Iron-Based\n  Superconductor LaFeAsO$_{1-x}$H$_{x}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High magnetic fields up to 105 T have been utilized in deriving the upper\ncritical field $B_{\\rm c2}$ of LaFeAsO$_{1-x}$H$_x$ throughout whole\ntemperatures below $T_{\\rm c}$. Resistivity measurements demonstrate that\n$B_{\\rm c2}$ behaves differently in samples with $x = 0.12$ (SC1) from those\nwith 0.32 (SC2). In SC1, the two-band model assuming the $s$-wave pairing gives\na good fitting with repulsive intraband interaction and dominant interband\ncoupling. In SC2, we have to assume attractive intraband interaction with weak\ninterband coupling, which in fact suggests a non-$s$-wave pairing in view of\nthe strong Coulomb repulsion. These results support the possibility that SC1\nand SC2 have different pairing symmetries.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:15:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kawachi","Shiro",""],["Yamaura","Jun-ichi",""],["Kuramoto","Yoshio",""],["Iimura","Soshi",""],["Nomura","Toshihiro",""],["Kohama","Yoshimitsu",""],["Sasaki","Takashi",""],["Tokunaga","Masashi",""],["Murakami","Youichi",""],["Hosono","Hideo",""]]}
{"id":"2308.12632","submitter":"Junna Sugiyama","authors":"Junna Sugiyama, Haruki Nishino and Akito Kusaka","title":"Precipitable Water Vapor Measurement using GNSS Data in the Atacama\n  Desert for Millimeter and Submillimeter Astronomical Observations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Precipitable water vapor (PWV) strongly affects the quality of data obtained\nfrom millimeter- and submillimeter-wave astronomical observations, such as\nthose for cosmic microwave background (CMB) measurements. Some of these\nobservatories have used radiometers to monitor PWV. In this study, PWV was\nmeasured from April 2021 to April 2022 using Global Navigation Satellite System\n(GNSS) instruments in the Atacama Desert, Chile, where several millimeter and\nsubmillimeter-wave telescopes are located. We evaluated the accuracy of these\nmeasurements by comparing them to radiometer measurements. We calculated the\nPWV from GNSS data using Canadian Spatial Reference System Precise Point\nPositioning (CSRS-PPP), an online software package. When using GNSS data alone,\nthe estimated PWV showed a systematic offset of +1.08 mm. When combining GNSS\ndata with data from a barometer which was co-located with the GNSS receiver,\nthe estimated PWV showed a lower systematic offset of -0.14 mm. The GNSS PWV\nshowed a statistical error of 0.52 mm with an averaging time of an hour.\nCompared to other PWV measurement methods, GNSS instruments are robust in bad\nweather conditions, have sufficient time resolution, and are less expensive. By\ndemonstrating good accuracy and precision in low PWV conditions, this paper\nshows that GNSS instruments are valuable tools for PWV measurements for\nobserving site evaluation and data analysis for ground-based telescopes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:17:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sugiyama","Junna",""],["Nishino","Haruki",""],["Kusaka","Akito",""]]}
{"id":"2308.12633","submitter":"Bradley Ganoe","authors":"Brad Ganoe, Martin Head-Gordon","title":"The Doubles Connected Moments Expansion: A Tractable Approximate\n  Horn-Weinstein Approach for Quantum Chemistry","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ab initio methods based on the second-order and higher connected moments, or\ncumulants, of a reference function have seen limited use in the determination\nof correlation energies of chemical systems throughout the years. Moment-based\nmethods have remained unattractive relative to more ubiquitous methods, such as\nperturbation theory and coupled cluster theory, due in part to the intractable\ncost of assembling moments of high-order and poor performance of low-order\nexpansions. Many of the traditional quantum chemical methodologies can be\nrecast as a selective summation of perturbative contributions to their energy;\nusing this familiar structure as a guide in selecting terms, we develop a\nscheme to approximate connected moments limited to double excitations. The\ntractable Double Connected Moments (DCM(N)) approximation is developed and\ntested against a multitude of common single-reference methods to determine its\nefficacy in the determination of the correlation energy of model systems and\nsmall molecules. The DCM(N) sequence of energies exhibits smooth convergence,\nwith compute costs that scale as a non-iterative O(N^6) with molecule size, M.\nNumerical tests on correlation energy recovery for 55 small molecules\ncomprising the G1 test set in the cc-pVDZ basis show that DCM(N) strongly\noutperforms MP2 and even CCD with a Hartree-Fock reference. When using an\napproximate Brueckner reference from orbital-optimized (oo) MP2, the resulting\noo:DCM(N) energies converge to values more accurate than CCSD for 49 of 55\nmolecules.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:18:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ganoe","Brad",""],["Head-Gordon","Martin",""]]}
{"id":"2308.12634","submitter":"Josef Cersovsky","authors":"Josef Cersovsky, Sadegh Mohammadi, Dagmar Kainmueller and Johannes\n  Hoehne","title":"Towards Hierarchical Regional Transformer-based Multiple Instance\n  Learning","comments":"To be published as ICCV 2023 workshop paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The classification of gigapixel histopathology images with deep multiple\ninstance learning models has become a critical task in digital pathology and\nprecision medicine. In this work, we propose a Transformer-based multiple\ninstance learning approach that replaces the traditional learned attention\nmechanism with a regional, Vision Transformer inspired self-attention\nmechanism. We present a method that fuses regional patch information to derive\nslide-level predictions and show how this regional aggregation can be stacked\nto hierarchically process features on different distance levels. To increase\npredictive accuracy, especially for datasets with small, local morphological\nfeatures, we introduce a method to focus the image processing on high attention\nregions during inference. Our approach is able to significantly improve\nperformance over the baseline on two histopathology datasets and points towards\npromising directions for further research.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:19:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cersovsky","Josef",""],["Mohammadi","Sadegh",""],["Kainmueller","Dagmar",""],["Hoehne","Johannes",""]]}
{"id":"2308.12635","submitter":"Gy\\\"orgy Orosz","authors":"Gy\\\"orgy Orosz and Gerg\\H{o} Szab\\'o and P\\'eter Berkecz and Zsolt\n  Sz\\'ant\\'o and Rich\\'ard Farkas","title":"Advancing Hungarian Text Processing with HuSpaCy: Efficient and Accurate\n  NLP Pipelines","comments":"Submitted to TSD 2023 Conference","journal-ref":null,"doi":"10.1007/978-3-031-40498-6_6","report-no":null,"categories":"cs.CL cs.AI stat.ML","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper presents a set of industrial-grade text processing models for\nHungarian that achieve near state-of-the-art performance while balancing\nresource efficiency and accuracy. Models have been implemented in the spaCy\nframework, extending the HuSpaCy toolkit with several improvements to its\narchitecture. Compared to existing NLP tools for Hungarian, all of our\npipelines feature all basic text processing steps including tokenization,\nsentence-boundary detection, part-of-speech tagging, morphological feature\ntagging, lemmatization, dependency parsing and named entity recognition with\nhigh accuracy and throughput. We thoroughly evaluated the proposed\nenhancements, compared the pipelines with state-of-the-art tools and\ndemonstrated the competitive performance of the new models in all text\npreprocessing steps. All experiments are reproducible and the pipelines are\nfreely available under a permissive license.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:19:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Orosz","Gy\u00f6rgy",""],["Szab\u00f3","Gerg\u0151",""],["Berkecz","P\u00e9ter",""],["Sz\u00e1nt\u00f3","Zsolt",""],["Farkas","Rich\u00e1rd",""]]}
{"id":"2308.12636","submitter":"Youze Wang","authors":"Youze Wang, Wenbo Hu, Yinpeng Dong and Richang Hong","title":"Exploring Transferability of Multimodal Adversarial Samples for\n  Vision-Language Pre-training Models with Contrastive Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision-language pre-training models (VLP) are vulnerable, especially to\nmultimodal adversarial samples, which can be crafted by adding imperceptible\nperturbations on both original images and texts. However, under the black-box\nsetting, there have been no works to explore the transferability of multimodal\nadversarial attacks against the VLP models. In this work, we take CLIP as the\nsurrogate model and propose a gradient-based multimodal attack method to\ngenerate transferable adversarial samples against the VLP models. By applying\nthe gradient to optimize the adversarial images and adversarial texts\nsimultaneously, our method can better search for and attack the vulnerable\nimages and text information pairs. To improve the transferability of the\nattack, we utilize contrastive learning including image-text contrastive\nlearning and intra-modal contrastive learning to have a more generalized\nunderstanding of the underlying data distribution and mitigate the overfitting\nof the surrogate model so that the generated multimodal adversarial samples\nhave a higher transferability for VLP models. Extensive experiments validate\nthe effectiveness of the proposed method.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:22:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Youze",""],["Hu","Wenbo",""],["Dong","Yinpeng",""],["Hong","Richang",""]]}
{"id":"2308.12637","submitter":"Franc Forstneric","authors":"Franc Forstneric","title":"Minimal surfaces with symmetries","comments":"The hypotheses of Theorem 1.1 are stated more precisely and the\n  exposition in improved","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $X$ be an open Riemann surface. Assume that $G$ is a finite group acting\non $X$ by holomorphic automorphisms and acting on a Euclidean space $\\mathbb\nR^n$ $(n\\ge 3)$ by orthogonal transformations. In this paper, we find a simple\nnecessary and sufficient condition for the existence of a $G$-equivariant\nconformal minimal immersion $F:X\\to\\mathbb R^n$, i.e., such that $F(gx)=gF(x)$\nholds for every $x\\in X$ and $g\\in G$. We show in particular that every finite\ngroup $G$ arises in this way for some Riemann surface $X$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:28:16 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 09:19:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Forstneric","Franc",""]]}
{"id":"2308.12638","submitter":"Cecile Monthus","authors":"Cecile Monthus","title":"Inverse problem in the conditioning of Markov processes on trajectory\n  observables : what canonical conditionings can connect two given Markov\n  generators ?","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the field of large deviations for stochastic dynamics, the canonical\nconditioning of a given Markov process with respect to a given time-local\ntrajectory observable over a large time-window has attracted a lot of interest\nrecently. In the present paper, we analyze the following inverse problem: when\ntwo Markov generators are given, is it possible to connect them via some\ncanonical conditioning and to construct the corresponding time-local trajectory\nobservable? We focus on continuous-time Markov processes and obtain the\nfollowing necessary and sufficient conditions: (i) for continuous-time Markov\njump processes, the two generators should involve the same possible elementary\njumps in configuration space, i.e. only the values of the corresponding rates\ncan differ; (ii) for diffusion processes, the two Fokker-Planck generators\nshould involve the same diffusion coefficients, i.e. only the two forces can\ndiffer. In both settings, we then construct explicitly the various time-local\ntrajectory observables that can be used to connect the two given generators via\ncanonical conditioning. This general framework is illustrated with various\napplications involving a single particle or many-body spin models. In\nparticular, we describe several examples to show how non-equilibrium Markov\nprocesses with non-vanishing steady currents can be interpreted as the\ncanonical conditionings of detailed-balance processes with respect to explicit\ntime-local trajectory observables.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:31:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Monthus","Cecile",""]]}
{"id":"2308.12639","submitter":"Siba Prasad Das Dr.","authors":"H. A. Redekar, R. B. Kumbhar, S. P. Das and K. Y. Rajpure","title":"A short note on Magnetized Black-hole in Non-linear Electrodynamics","comments":"6 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have analyzed the thermodynamic properties of magnetized black-hole in the\nbackground of non-linear electrodynamics with two parameters $\\beta$ and\n$\\gamma$. We have studied the Bekenstein-Hawking entropy, Hawking temperature,\nspecific heats in two-dimesional surface plots as a function of event horizon\n($r_{+}$) and $\\gamma$. We showed the variation profiles of the above\nthermodynamic parameters for $\\gamma$ [$ 0 \\rightarrow 1$]. We identified\nregions of parameters for the possible phase-transitions and the stability of\nthe black-holes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:31:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Redekar","H. A.",""],["Kumbhar","R. B.",""],["Das","S. P.",""],["Rajpure","K. Y.",""]]}
{"id":"2308.12640","submitter":"Melvin Drent","authors":"Chaaben Kouki and Melvin Drent and Collin Drent and Mohamed Zied Babai","title":"Dedicated maintenance and repair shop control for spare parts networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a repairable inventory system dedicated to a single component that\nis critical in operating a capital good. The system consists of a stock point\ncontaining spare components, and a dedicated repair shop responsible for\nrepairing damaged components. Components are replaced using an age-replacement\nstrategy, which sends components to the repair shop either preventively if it\nreaches the age-threshold, and correctively otherwise. Damaged components are\nreplaced by new ones if there are spare components available, otherwise the\ncapital good is inoperable. If there is free capacity in the repair shop, then\nthe repair of the damaged component immediately starts, otherwise it is queued.\nThe manager decides on the number of repairables in the system, the\nage-threshold, and the capacity of the repair shop. There is an inherent\ntrade-off: A low (high) age-threshold reduces (increases) the probability of a\ncorrective replacement but increases (decreases) the demand for repair\ncapacity, and a high (low) number of repairables in the system leads to higher\n(lower) holding costs, but decreases (increases) the probability of downtime.\nWe first show that the single capital good setting can be modelled as a closed\nqueuing network with finite population, which we show is equivalent to a single\nqueue with fixed capacity and state-dependent arrivals. For this queue, we\nderive closed-form expressions for the steady-state distribution. We\nsubsequently use these results to approximate performance measures for the\nsetting with multiple capital goods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:32:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kouki","Chaaben",""],["Drent","Melvin",""],["Drent","Collin",""],["Babai","Mohamed Zied",""]]}
{"id":"2308.12641","submitter":"Richard Schwartz","authors":"Richard Evan Schwartz","title":"The Optimal Paper Moebius Band","comments":"First version was fine but this new version has a more streamlined\n  proof. The main Theorem follows quickly from Lemmas A,B,C and each of these\n  takes at most 2 pages to prove","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we prove that a smooth embedded paper Moebius band must have\naspect ratio greater than $\\sqrt 3$. We also prove that any sequence of smooth\nembedded paper Moebius bands whose aspect ratio converges to $\\sqrt 3$ must\nconverge, up to isometry, to the famous triangular Moebius band. These results\nresolve the optimal paper Moebius band conjecture of Halpern and Weaver from\n1977.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:33:16 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 17:05:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Schwartz","Richard Evan",""]]}
{"id":"2308.12642","submitter":"An Ngo","authors":"An Ngo, Daniel Phelps, Derrick Lai, Thanyared Wong, Lucas Mathias,\n  Anish Shivamurthy, Mustafa Ajmal, Minghao Liu, James Davis","title":"Tag-Based Annotation for Avatar Face Creation","comments":"9 pages, 5 figures, 18 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Currently, digital avatars can be created manually using human images as\nreference. Systems such as Bitmoji are excellent producers of detailed avatar\ndesigns, with hundreds of choices for customization. A supervised learning\nmodel could be trained to generate avatars automatically, but the hundreds of\npossible options create difficulty in securing non-noisy data to train a model.\nAs a solution, we train a model to produce avatars from human images using\ntag-based annotations. This method provides better annotator agreement, leading\nto less noisy data and higher quality model predictions. Our contribution is an\napplication of tag-based annotation to train a model for avatar face creation.\nWe design tags for 3 different facial facial features offered by Bitmoji, and\ntrain a model using tag-based annotation to predict the nose.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:35:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ngo","An",""],["Phelps","Daniel",""],["Lai","Derrick",""],["Wong","Thanyared",""],["Mathias","Lucas",""],["Shivamurthy","Anish",""],["Ajmal","Mustafa",""],["Liu","Minghao",""],["Davis","James",""]]}
{"id":"2308.12643","submitter":"Sergei Monakhov","authors":"Sergei Monakhov","title":"Probabilistic Method of Measuring Linguistic Productivity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper I propose a new way of measuring linguistic productivity that\nobjectively assesses the ability of an affix to be used to coin new complex\nwords and, unlike other popular measures, is not directly dependent upon token\nfrequency. Specifically, I suggest that linguistic productivity may be viewed\nas the probability of an affix to combine with a random base. The advantages of\nthis approach include the following. First, token frequency does not dominate\nthe productivity measure but naturally influences the sampling of bases.\nSecond, we are not just counting attested word types with an affix but rather\nsimulating the construction of these types and then checking whether they are\nattested in the corpus. Third, a corpus-based approach and randomised design\nassure that true neologisms and words coined long ago have equal chances to be\nselected. The proposed algorithm is evaluated both on English and Russian data.\nThe obtained results provide some valuable insights into the relation of\nlinguistic productivity to the number of types and tokens. It looks like\nburgeoning linguistic productivity manifests itself in an increasing number of\ntypes. However, this process unfolds in two stages: first comes the increase in\nhigh-frequency items, and only then follows the increase in low-frequency\nitems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:36:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Monakhov","Sergei",""]]}
{"id":"2308.12644","submitter":"Danial Yazdani","authors":"Mai Peng, Zeneng She, Delaram Yazdani, Danial Yazdani, Wenjian Luo,\n  Changhe Li, Juergen Branke, Trung Thanh Nguyen, Amir H. Gandomi, Yaochu Jin,\n  Xin Yao","title":"Evolutionary Dynamic Optimization Laboratory: A MATLAB Optimization\n  Platform for Education and Experimentation in Dynamic Environments","comments":"This work was submitted to ACM Transactions on Mathematical Software\n  on December 7, 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.MS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Many real-world optimization problems possess dynamic characteristics.\nEvolutionary dynamic optimization algorithms (EDOAs) aim to tackle the\nchallenges associated with dynamic optimization problems. Looking at the\nexisting works, the results reported for a given EDOA can sometimes be\nconsiderably different. This issue occurs because the source codes of many\nEDOAs, which are usually very complex algorithms, have not been made publicly\navailable. Indeed, the complexity of components and mechanisms used in many\nEDOAs makes their re-implementation error-prone. In this paper, to assist\nresearchers in performing experiments and comparing their algorithms against\nseveral EDOAs, we develop an open-source MATLAB platform for EDOAs, called\nEvolutionary Dynamic Optimization LABoratory (EDOLAB). This platform also\ncontains an education module that can be used for educational purposes. In the\neducation module, the user can observe a) a 2-dimensional problem space and how\nits morphology changes after each environmental change, b) the behaviors of\nindividuals over time, and c) how the EDOA reacts to environmental changes and\ntries to track the moving optimum. In addition to being useful for research and\neducation purposes, EDOLAB can also be used by practitioners to solve their\nreal-world problems. The current version of EDOLAB includes 25 EDOAs and three\nfully-parametric benchmark generators. The MATLAB source code for EDOLAB is\npublicly available and can be accessed from\n[https://github.com/EDOLAB-platform/EDOLAB-MATLAB].\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:37:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Peng","Mai",""],["She","Zeneng",""],["Yazdani","Delaram",""],["Yazdani","Danial",""],["Luo","Wenjian",""],["Li","Changhe",""],["Branke","Juergen",""],["Nguyen","Trung Thanh",""],["Gandomi","Amir H.",""],["Jin","Yaochu",""],["Yao","Xin",""]]}
{"id":"2308.12645","submitter":"PoYung Chou","authors":"Po-Yung Chou, Yu-Chun Lo, Bo-Zheng Xie, Cheng-Hung Lin, Yu-Yung Kao","title":"An All Deep System for Badminton Game Analysis","comments":"Golden Award for IJCAI CoachAI Challenge 2023: Team NTNUEE AIoTLab","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The CoachAI Badminton 2023 Track1 initiative aim to automatically detect\nevents within badminton match videos. Detecting small objects, especially the\nshuttlecock, is of quite importance and demands high precision within the\nchallenge. Such detection is crucial for tasks like hit count, hitting time,\nand hitting location. However, even after revising the well-regarded\nshuttlecock detecting model, TrackNet, our object detection models still fall\nshort of the desired accuracy. To address this issue, we've implemented various\ndeep learning methods to tackle the problems arising from noisy detectied data,\nleveraging diverse data types to improve precision. In this report, we detail\nthe detection model modifications we've made and our approach to the 11 tasks.\nNotably, our system garnered a score of 0.78 out of 1.0 in the challenge.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:41:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chou","Po-Yung",""],["Lo","Yu-Chun",""],["Xie","Bo-Zheng",""],["Lin","Cheng-Hung",""],["Kao","Yu-Yung",""]]}
{"id":"2308.12646","submitter":"Taras Kucherenko","authors":"Taras Kucherenko, Rajmund Nagy, Youngwoo Yoon, Jieyeon Woo, Teodor\n  Nikolov, Mihail Tsakov, Gustav Eje Henter","title":"The GENEA Challenge 2023: A large scale evaluation of gesture generation\n  models in monadic and dyadic settings","comments":"The first three authors made equal contributions. Accepted for\n  publication at the ACM International Conference on Multimodal Interaction\n  (ICMI)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper reports on the GENEA Challenge 2023, in which participating teams\nbuilt speech-driven gesture-generation systems using the same speech and motion\ndataset, followed by a joint evaluation. This year's challenge provided data on\nboth sides of a dyadic interaction, allowing teams to generate full-body motion\nfor an agent given its speech (text and audio) and the speech and motion of the\ninterlocutor. We evaluated 12 submissions and 2 baselines together with\nheld-out motion-capture data in several large-scale user studies. The studies\nfocused on three aspects: 1) the human-likeness of the motion, 2) the\nappropriateness of the motion for the agent's own speech whilst controlling for\nthe human-likeness of the motion, and 3) the appropriateness of the motion for\nthe behaviour of the interlocutor in the interaction, using a setup that\ncontrols for both the human-likeness of the motion and the agent's own speech.\nWe found a large span in human-likeness between challenge submissions, with a\nfew systems rated close to human mocap. Appropriateness seems far from being\nsolved, with most submissions performing in a narrow range slightly above\nchance, far behind natural motion. The effect of the interlocutor is even more\nsubtle, with submitted systems at best performing barely above chance.\nInterestingly, a dyadic system being highly appropriate for agent speech does\nnot necessarily imply high appropriateness for the interlocutor. Additional\nmaterial is available via the project website at\nhttps://svito-zar.github.io/GENEAchallenge2023/ .\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:42:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kucherenko","Taras",""],["Nagy","Rajmund",""],["Yoon","Youngwoo",""],["Woo","Jieyeon",""],["Nikolov","Teodor",""],["Tsakov","Mihail",""],["Henter","Gustav Eje",""]]}
{"id":"2308.12647","submitter":"Haoyuan Lv","authors":"Haoyuan Lv, Ruochen Liu","title":"Multitasking Evolutionary Algorithm Based on Adaptive Seed Transfer for\n  Combinatorial Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Evolutionary computing (EC) is widely used in dealing with combinatorial\noptimization problems (COP). Traditional EC methods can only solve a single\ntask in a single run, while real-life scenarios often need to solve multiple\nCOPs simultaneously. In recent years, evolutionary multitasking optimization\n(EMTO) has become an emerging topic in the EC community. And many methods have\nbeen designed to deal with multiple COPs concurrently through exchanging\nknowledge. However, many-task optimization, cross-domain knowledge transfer,\nand negative transfer are still significant challenges in this field. A new\nevolutionary multitasking algorithm based on adaptive seed transfer (MTEA-AST)\nis developed for multitasking COPs in this work. First, a dimension unification\nstrategy is proposed to unify the dimensions of different tasks. And then, an\nadaptive task selection strategy is designed to capture the similarity between\nthe target task and other online optimization tasks. The calculated similarity\nis exploited to select suitable source tasks for the target one and determine\nthe transfer strength. Next, a task transfer strategy is established to select\nseeds from source tasks and correct unsuitable knowledge in seeds to suppress\nnegative transfer. Finally, the experimental results indicate that MTEA-AST can\nadaptively transfer knowledge in both same-domain and cross-domain many-task\nenvironments. And the proposed method shows competitive performance compared to\nother state-of-the-art EMTOs in experiments consisting of four COPs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:43:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lv","Haoyuan",""],["Liu","Ruochen",""]]}
{"id":"2308.12648","submitter":"Shutong Feng","authors":"Shutong Feng, Nurul Lubis, Benjamin Ruppik, Christian Geishauser,\n  Michael Heck, Hsien-chin Lin, Carel van Niekerk, Renato Vukovic, Milica\n  Ga\\v{s}i\\'c","title":"From Chatter to Matter: Addressing Critical Steps of Emotion Recognition\n  Learning in Task-oriented Dialogue","comments":"Accepted by SIGDIAL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Emotion recognition in conversations (ERC) is a crucial task for building\nhuman-like conversational agents. While substantial efforts have been devoted\nto ERC for chit-chat dialogues, the task-oriented counterpart is largely left\nunattended. Directly applying chit-chat ERC models to task-oriented dialogues\n(ToDs) results in suboptimal performance as these models overlook key features\nsuch as the correlation between emotions and task completion in ToDs. In this\npaper, we propose a framework that turns a chit-chat ERC model into a\ntask-oriented one, addressing three critical aspects: data, features and\nobjective. First, we devise two ways of augmenting rare emotions to improve ERC\nperformance. Second, we use dialogue states as auxiliary features to\nincorporate key information from the goal of the user. Lastly, we leverage a\nmulti-aspect emotion definition in ToDs to devise a multi-task learning\nobjective and a novel emotion-distance weighted loss function. Our framework\nyields significant improvements for a range of chit-chat ERC models on EmoWOZ,\na large-scale dataset for user emotion in ToDs. We further investigate the\ngeneralisability of the best resulting model to predict user satisfaction in\ndifferent ToD datasets. A comparison with supervised baselines shows a strong\nzero-shot capability, highlighting the potential usage of our framework in\nwider scenarios.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:46:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Feng","Shutong",""],["Lubis","Nurul",""],["Ruppik","Benjamin",""],["Geishauser","Christian",""],["Heck","Michael",""],["Lin","Hsien-chin",""],["van Niekerk","Carel",""],["Vukovic","Renato",""],["Ga\u0161i\u0107","Milica",""]]}
{"id":"2308.12649","submitter":"Hadar Schreiber Galler","authors":"Hadar Schreiber Galler, Tom Zahavy, Guillaume Desjardins, Alon Cohen","title":"APART: Diverse Skill Discovery using All Pairs with Ascending Reward and\n  DropouT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study diverse skill discovery in reward-free environments, aiming to\ndiscover all possible skills in simple grid-world environments where prior\nmethods have struggled to succeed. This problem is formulated as mutual\ntraining of skills using an intrinsic reward and a discriminator trained to\npredict a skill given its trajectory. Our initial solution replaces the\nstandard one-vs-all (softmax) discriminator with a one-vs-one (all pairs)\ndiscriminator and combines it with a novel intrinsic reward function and a\ndropout regularization technique. The combined approach is named APART: Diverse\nSkill Discovery using All Pairs with Ascending Reward and Dropout. We\ndemonstrate that APART discovers all the possible skills in grid worlds with\nremarkably fewer samples than previous works. Motivated by the empirical\nsuccess of APART, we further investigate an even simpler algorithm that\nachieves maximum skills by altering VIC, rescaling its intrinsic reward, and\ntuning the temperature of its softmax discriminator. We believe our findings\nshed light on the crucial factors underlying success of skill discovery\nalgorithms in reinforcement learning.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:46:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Galler","Hadar Schreiber",""],["Zahavy","Tom",""],["Desjardins","Guillaume",""],["Cohen","Alon",""]]}
{"id":"2308.12650","submitter":"Pietro Belotti","authors":"Pietro Belotti","title":"Convex envelopes of bounded monomials on two-variable cones","comments":"22 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We consider an $n$-variate monomial function that is restricted both in value\nby lower and upper bounds and in domain by two homogeneous linear inequalities.\nSuch functions are building blocks of several problems found in practical\napplications, and that fall under the class of Mixed Integer Nonlinear\nOptimization. We show that the upper envelope of the function in the given\ndomain, for $n\\ge 2$ is given by a conic inequality. We also present the lower\nenvelope for $n=2$. To assess the applicability of branching rules based on\nhomogeneous linear inequalities, we also derive the volume of the convex hull\nfor $n=2$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:47:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Belotti","Pietro",""]]}
{"id":"2308.12651","submitter":"Ayano Nishii","authors":"Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni","title":"Sink Location Problems in Dynamic Flow Grid Networks","comments":"16 pages, 6 figures, full version of a paper accepted at COCOON 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A dynamic flow network consists of a directed graph, where nodes called\nsources represent locations of evacuees, and nodes called sinks represent\nlocations of evacuation facilities. Each source and each sink are given supply\nrepresenting the number of evacuees and demand representing the maximum number\nof acceptable evacuees, respectively. Each edge is given capacity and transit\ntime. Here, the capacity of an edge bounds the rate at which evacuees can enter\nthe edge per unit time, and the transit time represents the time which evacuees\ntake to travel across the edge. The evacuation completion time is the minimum\ntime at which each evacuees can arrive at one of the evacuation facilities.\nGiven a dynamic flow network without sinks, once sinks are located on some\nnodes or edges, the evacuation completion time for this sink location is\ndetermined. We then consider the problem of locating sinks to minimize the\nevacuation completion time, called the sink location problem. The problems have\nbeen given polynomial-time algorithms only for limited networks such as paths,\ncycles, and trees, but no polynomial-time algorithms are known for more complex\nnetwork classes. In this paper, we prove that the 1-sink location problem can\nbe solved in polynomial-time when an input network is a grid with uniform edge\ncapacity and transit time.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:47:15 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 16:59:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Higashikawa","Yuya",""],["Nishii","Ayano",""],["Teruyama","Junichi",""],["Tokuni","Yuki",""]]}
{"id":"2308.12652","submitter":"Qian Jiang","authors":"Qian Jiang, Feng Ren, Chenglei Wang, Zhaokun Wang, Gholamreza\n  Kefayati, Sasa Kenjeres, Kambiz Vafai, Yang Liu, Hui Tang","title":"Simulation of tumor ablation in hyperthermia cancer treatment: A\n  parametric study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A holistic simulation framework is established on magnetic hyperthermia\nmodeling to solve the treatment process of tumor, which is surrounded by a\nhealthy tissue block. The interstitial tissue fluid, MNP distribution,\ntemperature profile, and nanofluids are involved in the simulation. Study\nevaluates the cancer treatment efficacy by cumulative-equivalent-minutes-at-43\ncentigrade (CEM43), a widely accepted thermal dose coming from the cell death\ncurve. Results are separated into the conditions of with or without gravity\neffect in the computational domain, where two baseline case are investigated\nand compared. An optimal treatment time 46.55 min happens in the baseline case\nwithout gravity, but the situation deteriorates with gravity effect where the\ntime for totally killing tumor cells prolongs 36.11% and meanwhile causing\n21.32% ablation in healthy tissue. For the cases without gravity, parameter\nstudy of Lewis number and Heat source number are conducted and the variation of\noptimal treatment time are both fitting to the inverse functions. For the case\nconsidering the gravity, parameters Buoyancy ratio and Darcy ratio are\ninvestigated and their influence on totally killing tumor cells and the injury\non healthy tissue are matching with the parabolic functions. The results are\nbeneficial to the prediction of various conditions, and provides useful guide\nto the magnetic hyperthermia treatment.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:49:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jiang","Qian",""],["Ren","Feng",""],["Wang","Chenglei",""],["Wang","Zhaokun",""],["Kefayati","Gholamreza",""],["Kenjeres","Sasa",""],["Vafai","Kambiz",""],["Liu","Yang",""],["Tang","Hui",""]]}
{"id":"2308.12653","submitter":"Lydia Mirabel Mendoza Cadena","authors":"Alp\\'ar J\\\"uttner, Csaba Kir\\'aly, Lydia Mirabel Mendoza-Cadena, Gyula\n  Pap, Ildik\\'o Schlotter, Yutaro Yamaguchi","title":"Shortest Odd Paths in Undirected Graphs with Conservative Weight\n  Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the Shortest Odd Path problem, where given an undirected graph\n$G$, a weight function on its edges, and two vertices $s$ and $t$ in $G$, the\naim is to find an $(s,t)$-path with odd length and, among all such paths, of\nminimum weight. For the case when the weight function is conservative, i.e.,\nwhen every cycle has non-negative total weight, the complexity of the Shortest\nOdd Path problem had been open for 20 years, and was recently shown to be\nNP-hard. We give a polynomial-time algorithm for the special case when the\nweight function is conservative and the set $E^-$ of negative-weight edges\nforms a single tree. Our algorithm exploits the strong connection between\nShortest Odd Path and the problem of finding two internally vertex-disjoint\npaths between two terminals in an undirected edge-weighted graph. It also\nrelies on solving an intermediary problem variant called Shortest\nParity-Constrained Odd Path where for certain edges we have parity constraints\non their position along the path. Also, we exhibit two FPT algorithms for\nsolving Shortest Odd Path in graphs with conservative weight functions. The\nfirst FPT algorithm is parameterized by $|E^-|$, the number of negative edges,\nor more generally, by the maximum size of a matching in the subgraph of $G$\nspanned by $E^-$. Our second FPT algorithm is parameterized by the treewidth of\n$G$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:51:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["J\u00fcttner","Alp\u00e1r",""],["Kir\u00e1ly","Csaba",""],["Mendoza-Cadena","Lydia Mirabel",""],["Pap","Gyula",""],["Schlotter","Ildik\u00f3",""],["Yamaguchi","Yutaro",""]]}
{"id":"2308.12654","submitter":"Christoph Helmberg","authors":"Christoph Helmberg and Guilherme Porto and Guilherme Torres and Vilmar\n  Trevisan","title":"An interlacing property of the signless Laplacian of threshold graphs","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We show that for threshold graphs, the eigenvalues of the signless Laplacian\nmatrix interlace with the degrees of the vertices. As an application, we show\nthat the signless Brouwer conjecture holds for threshold graphs, i.e., for\nthreshold graphs the sum of the k largest eigenvalues is bounded by the number\nof edges plus k + 1 choose 2.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:52:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Helmberg","Christoph",""],["Porto","Guilherme",""],["Torres","Guilherme",""],["Trevisan","Vilmar",""]]}
{"id":"2308.12655","submitter":"\\'Agnes Backhausz","authors":"\\'Agnes Backhausz, Gy\\\"orgy J. Sz\\'ekely","title":"Epidemic spread, parameter sensitivity and vaccination strategies on a\n  random graph with overlapping communities","comments":"16 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph q-bio.PE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Our main goal is to examine the role of communities in epidemic spread in a\nrandom graph model. More precisely, we consider a random graph model which\nconsists of overlapping complete graphs, representing households, workplaces,\nschool classes, and which also has a simple geometric structure. We study the\nmodel's sensitivity to infection parameters and other tunable parameters of the\nmodel, which might be helpful in finding efficient social distancing\nstrategies. We also quantitatively compare different vaccination strategies to\nsee which order is the best to defend the most vulnerable groups or the\npopulation in general, and how important it is to gather and use information on\nthe position of infected individuals in the network.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:54:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Backhausz","\u00c1gnes",""],["Sz\u00e9kely","Gy\u00f6rgy J.",""]]}
{"id":"2308.12656","submitter":"Mingxiang Li","authors":"Mingxiang Li","title":"Asymptotic behavior of conformal metrics with null Q-curvature","comments":"22 pages. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe the asymptotic behavior of conformal metrics related to the GJMS\noperator in the null case, as the prescribed Q-curvature $f_0(x) + \\lambda$\ngradually changes. We show that if one of the maximum points of $f_0$ is flat\nup to order $n-1$, the normalized conformal metrics in the lowest energy level\nwill form exactly one spherical bubble as $\\lambda$ approaches zero using\nhigher order Bol's inequality. This generalizes the result of Struwe (JEMS,\n2020) in the two-dimensional case to higher dimensions and helps rule out the\nslow bubble case discussed by Ng\\^o and Zhang (arXiv:1903.12054) to some\ndegree.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 08:56:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Mingxiang",""]]}
{"id":"2308.12657","submitter":"Sabrina Gericke","authors":"Sabrina M. Gericke (1), Minttu M. Kauppinen (2), Margareta Wagner (3),\n  Michele Riva (3), Giada Franceschi (3), Alvaro Posada-Borb\\'on (2), Lisa\n  R\\\"amisch (1), Sebastian Pfaff (1), Erik Rheinfrank (3), Alexander M. Imre\n  (3), Alexei B. Preobrajenski (4), Stephan Appelfeller (4), Sara Blomberg (5),\n  Lindsay R. Merte (6), Johan Zetterberg (1), Ulrike Diebold (3), Henrik\n  Gr\\\"onbeck (2), Edvin Lundgren (7) ((1) Division of Combustion Physics, Lund\n  University, 221 00 Lund, Sweden, (2) Department of Physics and Competence\n  Centre for Catalysis, Chalmers University of Technology, 412 96 G\\\"oteborg,\n  Sweden, (3) Institute of Applied Physics, TU Wien, 1040 Vienna, Austria, (4)\n  MAX IV Laboratory, Lund University, 221 00 Lund, Sweden, (5) Department of\n  Chemical Engineering, Lund University, 221 00 Lund, Sweden, (6) Department of\n  Materials Science and Applied Mathematics, Malm\\\"o University, 205 06\n  Malm\\\"o, Sweden, (7) Division of Synchrotron Radiation Research, Lund\n  University, 221 00 Lund, Sweden)","title":"The effect of different In$_2$O$_3$(111) surface terminations on CO$_2$\n  adsorption","comments":"49 pages, 18 figures","journal-ref":null,"doi":"10.1021/acsami.3c07166","report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In$_2$O$_3$-based catalysts have shown high activity and selectivity for\nCO$_2$ hydrogenation to methanol, however the origin of the high performance of\nIn$_2$O$_3$ is still unclear. To elucidate the initial steps of CO$_2$\nhydrogenation over In$_2$O$_3$, we have combined X-ray Photoelectron\nSpectroscopy (XPS) and Density Functional Theory (DFT) calculations to study\nthe adsorption of CO$_2$ on the In$_2$O$_3$(111) crystalline surface with\ndifferent terminations, namely the stoichiometric, the reduced, and the\nhydroxylated surface, respectively. The combined approach confirms that the\nreduction of the surface results in the formation of In ad-atoms and that water\ndissociates on the surface at room temperature. A comparison of the\nexperimental spectra and the computed core-level-shifts (using methanol and\nformic acid as benchmark molecules) suggests that CO$_2$ adsorbs as a carbonate\non all surface terminations. We find that CO$_2$ adsorption is hindered by\nhydroxyl groups on the hydroxylated surface.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:05:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gericke","Sabrina M.",""],["Kauppinen","Minttu M.",""],["Wagner","Margareta",""],["Riva","Michele",""],["Franceschi","Giada",""],["Posada-Borb\u00f3n","Alvaro",""],["R\u00e4misch","Lisa",""],["Pfaff","Sebastian",""],["Rheinfrank","Erik",""],["Imre","Alexander M.",""],["Preobrajenski","Alexei B.",""],["Appelfeller","Stephan",""],["Blomberg","Sara",""],["Merte","Lindsay R.",""],["Zetterberg","Johan",""],["Diebold","Ulrike",""],["Gr\u00f6nbeck","Henrik",""],["Lundgren","Edvin",""]]}
{"id":"2308.12658","submitter":"Sergey Berezin","authors":"Sergey Berezin","title":"Functional Limit Theorems for Constrained Mittag-Leffler Ensemble in\n  Hard Edge Scaling","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the hard-edge scaling of the Mittag-Leffler ensemble confined to\na fixed disk inside the droplet. Our primary emphasis is on fluctuations of\nrotationally-invariant additive statistics that depend on the radius and thus\ngive rise to radius-dependent stochastic processes. For the statistics\noriginating from bounded measurable functions, we establish a central limit\ntheorem in the appropriate functional space. By assuming further regularity, we\nare able to extend the result to a vector functional limit theorem that\nadditionally includes the first hitting \"time\" of the radius-dependent\nstatistic. The proof of the first theorem involves an approximation by\nexponential random variables alongside a coupling technique. The proof of the\nsecond result rests heavily on Skorohod's almost sure representation theorem\nand builds upon a result of Galen Shorack (1973).\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:06:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Berezin","Sergey",""]]}
{"id":"2308.12659","submitter":"Wenyu Zhu","authors":"Wenyu Zhu, Hao Wang, Yuchen Zhou, Jiaming Wang, Zihan Sha, Zeyu Gao,\n  Chao Zhang","title":"kTrans: Knowledge-Aware Transformer for Binary Code Embedding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Binary Code Embedding (BCE) has important applications in various reverse\nengineering tasks such as binary code similarity detection, type recovery,\ncontrol-flow recovery and data-flow analysis. Recent studies have shown that\nthe Transformer model can comprehend the semantics of binary code to support\ndownstream tasks. However, existing models overlooked the prior knowledge of\nassembly language. In this paper, we propose a novel Transformer-based\napproach, namely kTrans, to generate knowledge-aware binary code embedding. By\nfeeding explicit knowledge as additional inputs to the Transformer, and fusing\nimplicit knowledge with a novel pre-training task, kTrans provides a new\nperspective to incorporating domain knowledge into a Transformer framework. We\ninspect the generated embeddings with outlier detection and visualization, and\nalso apply kTrans to 3 downstream tasks: Binary Code Similarity Detection\n(BCSD), Function Type Recovery (FTR) and Indirect Call Recognition (ICR).\nEvaluation results show that kTrans can generate high-quality binary code\nembeddings, and outperforms state-of-the-art (SOTA) approaches on downstream\ntasks by 5.2%, 6.8%, and 12.6% respectively. kTrans is publicly available at:\nhttps://github.com/Learner0x5a/kTrans-release\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:07:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Wenyu",""],["Wang","Hao",""],["Zhou","Yuchen",""],["Wang","Jiaming",""],["Sha","Zihan",""],["Gao","Zeyu",""],["Zhang","Chao",""]]}
{"id":"2308.12660","submitter":"Jingqi Chen","authors":"Jingqi Chen, Wei Liu, and Wenjie Dou","title":"Floquet Nonadiabatic Nuclear Dynamics with Photoinduced Lorenz-Like\n  Force in Quantum Transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our recent paper [Mosallanejad et al., Phys. Rev. B 107(18), 184314,\n2023], we have derived a Floquet electronic friction model to describe\nnonadiabatic molecular dynamics near metal surfaces in the presence of periodic\ndriving. In this work, we demonstrate that Floquet driving can introduce an\nanti-symmetric electronic friction tensor in quantum transport, resulting in\ncircular motion of the nuclei in the long time limit. Furthermore, we show that\nsuch a Lorentz-like force strongly affects nuclear motion: at lower voltage\nbias, Floquet driving can increase the temperature of nuclei; at larger voltage\nbias, Floquet driving can decrease the temperature of nuclei. In addition,\nFloquet driving can affect electron transport strenuously. Finally, we show\nthat there is an optimal frequency that maximizes electron current. We expect\nthat the Floquet electronic friction model is a powerful tool to study\nnonadiabatic molecular dynamics near metal surfaces under Floquet driving in\ncomplex systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:10:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Jingqi",""],["Liu","Wei",""],["Dou","Wenjie",""]]}
{"id":"2308.12661","submitter":"Paul Gavrikov","authors":"Paul Gavrikov and Janis Keuper","title":"Don't Look into the Sun: Adversarial Solarization Attacks on Image\n  Classifiers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Assessing the robustness of deep neural networks against out-of-distribution\ninputs is crucial, especially in safety-critical domains like autonomous\ndriving, but also in safety systems where malicious actors can digitally alter\ninputs to circumvent safety guards. However, designing effective\nout-of-distribution tests that encompass all possible scenarios while\npreserving accurate label information is a challenging task. Existing\nmethodologies often entail a compromise between variety and constraint levels\nfor attacks and sometimes even both. In a first step towards a more holistic\nrobustness evaluation of image classification models, we introduce an attack\nmethod based on image solarization that is conceptually straightforward yet\navoids jeopardizing the global structure of natural images independent of the\nintensity. Through comprehensive evaluations of multiple ImageNet models, we\ndemonstrate the attack's capacity to degrade accuracy significantly, provided\nit is not integrated into the training augmentations. Interestingly, even then,\nno full immunity to accuracy deterioration is achieved. In other settings, the\nattack can often be simplified into a black-box attack with model-independent\nparameters. Defenses against other corruptions do not consistently extend to be\neffective against our specific attack.\n  Project website: https://github.com/paulgavrikov/adversarial_solarization\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:10:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gavrikov","Paul",""],["Keuper","Janis",""]]}
{"id":"2308.12662","submitter":"Suzhi Bi","authors":"Xiaojia Wang, Suzhi Bi, Xian Li, Xiaohui Lin, Zhi Quan, and Ying-Jun\n  Angela Zhang","title":"Capacity Analysis and Throughput Maximization of NOMA with Nonlinear\n  Power Amplifier Distortion","comments":"The paper has been submitted for potential journal publications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In future B5G/6G broadband communication systems, non-linear signal\ndistortion caused by the impairment of transmit power amplifier (PA) can\nseverely degrade the communication performance, especially when uplink users\nshare the wireless medium using non-orthogonal multiple access (NOMA) schemes.\nThis is because the successive interference cancellation (SIC) decoding\ntechnique, used in NOMA, is incapable of eliminating the interference caused by\nPA distortion. Consequently, each user's decoding process suffers from the\ncumulative distortion noise of all uplink users. In this paper, we establish a\nnew and tractable PA distortion signal model based on real-world measurements,\nwhere the distortion noise power is a polynomial function of PA transmit power\ndiverging from the oversimplified linear function commonly employed in existing\nstudies. Applying the proposed signal model, we characterize the capacity rate\nregion of multi-user uplink NOMA by optimizing the user transmit power. Our\nfindings reveal a significant contraction in the capacity region of NOMA,\nattributable to polynomial distortion noise power. For practical engineering\napplications, we formulate a general weighted sum rate maximization (WSRMax)\nproblem under individual user rate constraints. We further propose an efficient\npower control algorithm to attain the optimal performance. Numerical results\nshow that the optimal power control policy under the proposed non-linear PA\nmodel achieves on average 13\\% higher throughput compared to the policies\nassuming an ideal linear PA model. Overall, our findings demonstrate the\nimportance of accurate PA distortion modeling to the performance of NOMA and\nprovide efficient optimal power control method accordingly.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:10:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Xiaojia",""],["Bi","Suzhi",""],["Li","Xian",""],["Lin","Xiaohui",""],["Quan","Zhi",""],["Zhang","Ying-Jun Angela",""]]}
{"id":"2308.12663","submitter":"Lian-You Shan","authors":"Lianyou Shan, Zhao-Huan Yu","title":"Dark Mater Interactions From An Extra U(1) gauge symmetry with kinetic\n  mixing and Higgs charge","comments":"21 pages, 2 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We investigate fermionic dark matter interactions with standard model\nparticles from an additional $\\mathrm{U}(1)_\\mathrm{X}$ gauge symmetry,\nassuming kinetic mixing between the $\\mathrm{U}(1)_\\mathrm{X}$ and\n$\\mathrm{U}(1)_\\mathrm{Y}$ gauge fields as well as a nonzero\n$\\mathrm{U}(1)_\\mathrm{X}$ charge of the Higgs doublet. For ensuring\ngauge-invariant Yukawa interactions and the cancellation of gauge anomalies,\nthe standard model fermions are assigned $Y$-sequential\n$\\mathrm{U}(1)_\\mathrm{X}$ charges proportional to the Higgs charge. Although\nthe Higgs charge should be small due to collider constraints, it is useful to\ndecrease the effective cross section of dark matter scattering off nucleons by\ntwo orders of magnitude and easier evade from direct detection bounds. After\nsome numerical scans performed in the parameter space, we find that the\nintroduction of the Higgs charge can also enhance the dark matter relic density\nby at least two orders of magnitude. When the observed relic density and the\ndirect detection constraints are tangled, at the case where the resonance\neffect is important for dark matter freeze-out, the Higgs charge can expand\nphysical windows to some extent by relieving the tension between the relic\ndensity and the direct detection.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:12:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shan","Lianyou",""],["Yu","Zhao-Huan",""]]}
{"id":"2308.12664","submitter":"Simone Pigolotti","authors":"Florian Pflug, Deepak Bhat, Simone Pigolotti","title":"Genome replication in asynchronously growing microbial populations","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.SC q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Biological cells adopt specific programs to replicate their genomes.\nInformation about the replication program of an organism can be obtained by\nsequencing an exponentially growing cell culture and studying the frequency of\nDNA fragments as a function of genomic position. However, a quantitative\ninterpretation of this data has been challenging for asynchronously growing\ncultures. In this paper, we introduce a general theory to predict the abundance\nof DNA fragments in asynchronously growing cultures from any given stochastic\nmodel of the DNA replication program. As key examples, we present stochastic\nmodels of DNA replication in Escherichia coli and in budding yeast. In both\ncases, our approach leads to analytical predictions that are in excellent\nagreement with experimental data and permit to infer biophysically relevant\nparameters. In particular, our method is able to infer the locations of known\nreplication origins in budding yeast with high accuracy. These examples\ndemonstrate that our method can provide insight into a broad range of\norganisms, from bacteria to eukaryotes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:14:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pflug","Florian",""],["Bhat","Deepak",""],["Pigolotti","Simone",""]]}
{"id":"2308.12665","submitter":"Marcel Schmidt","authors":"Daniel Lenz, Marcel Schmidt, Felix Seifert","title":"Note on intrinsic metrics on graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the set of intrinsic metrics on a given graph. This is a convex\ncompact set and it carries a natural order. We investigate existence of largest\nelements with respect to this order. We show that the only locally finite\ngraphs which admit a largest intrinsic metric are certain finite star graphs.\nIn particular all infinite locally finite graphs do not admit a largest\nintrinsic metric. Moreover, we give a characterization for the existence of\nintrinsic metrics with finite balls for weakly spherically symmetric graphs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:15:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lenz","Daniel",""],["Schmidt","Marcel",""],["Seifert","Felix",""]]}
{"id":"2308.12666","submitter":"Charlie Tan","authors":"Charlie Tan, Theodore Long, Sarah Zhao and Rudolf Laine","title":"Geodesic Mode Connectivity","comments":"Published as a TinyPaper at ICLR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mode connectivity is a phenomenon where trained models are connected by a\npath of low loss. We reframe this in the context of Information Geometry, where\nneural networks are studied as spaces of parameterized distributions with\ncurved geometry. We hypothesize that shortest paths in these spaces, known as\ngeodesics, correspond to mode-connecting paths in the loss landscape. We\npropose an algorithm to approximate geodesics and demonstrate that they achieve\nmode connectivity.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:18:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tan","Charlie",""],["Long","Theodore",""],["Zhao","Sarah",""],["Laine","Rudolf",""]]}
{"id":"2308.12667","submitter":"Francesco Bei","authors":"Francesco Bei","title":"Compact convergence, deformation of the\n  $L^2$-$\\overline{\\partial}$-complex and canonical $K$-homology classes","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.CV math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $(X,\\gamma)$ be a compact, irreducible Hermitian complex space of complex\ndimension $m$ and with $\\mathrm{dim}(\\mathrm{sing}(X))=0$. Let\n$(F,\\tau)\\rightarrow X$ be a Hermitian holomorphic vector bundle over $X$ and\nlet us denote with $\\overline{\\eth}_{F,m,\\mathrm{abs}}$ the rolled-up operator\nof the maximal $L^2$-$\\overline{\\partial}$ complex of $F$-valued\n$(m,\\bullet)$-forms. Let $\\pi:M\\rightarrow X$ be a resolution of singularities,\n$g$ a metric on $M$, $E:=\\pi^*F$ and $\\rho:=\\pi^*\\tau$. In this paper, under\nquite general assumptions on $\\tau$, we prove the following equality of\nanalytic $K$-homology classes\n$[\\overline{\\eth}_{F,m,\\mathrm{abs}}]=\\pi_*[\\overline{\\eth}_{E,m}]$, with\n$\\overline{\\eth}_{E,m}$ the rolled-up operator of the\n$L^2$-$\\overline{\\partial}$ complex of $E$-valued $(m,\\bullet)$-forms on $M$.\nOur proof is based on functional analytic techniques developed in \\cite{KuSh}\nand provides an explicit homotopy between the even unbounded Fredholm modules\ninduced by $\\overline{\\eth}_{F,m,\\mathrm{abs}}$ and $\\overline{\\eth}_{E,m}$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:19:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bei","Francesco",""]]}
{"id":"2308.12668","submitter":"Suraka Bhattacharjee","authors":"Suraka Bhattacharjee, Koushik Mandal","title":"Effect of magnetic field on the long-time dynamics of two charged\n  coupled harmonic oscillators in the presence of a common heat bath","comments":"12 pages; 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, the moderately long-time behaviours of the position\nautocorrelation, position velocity correlation and velocity autocorrelation\nfunctions for two charged coupled harmonic oscillators connected to a heat bath\nare derived in the presence of a magnetic field via the Quantum Langevin\nequation. It is seen that at long times the correlation functions at T->0\nexhibit a power law decay with the coefficients of the power laws being\ncompletely different for the two masses that affect the overall trends of the\ndecays of the correlation functions. The effect of the bath-induced force on\nmass m1 mediated by the interaction of m2 with the common heat bath is studied\nand the results are highlighted in the presence of an external magnetic field.\nThis brings out the distinctness of the coupled oscillator scenario from the\nindependent single oscillator model studied earlier in the literature. The\nresults in the absence of a magnetic field are also presented, which are\nextremely important for analyzing the dynamics of atoms in protein molecules at\nlow temperatures.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:19:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhattacharjee","Suraka",""],["Mandal","Koushik",""]]}
{"id":"2308.12669","submitter":"Giuseppe Gaetano Luciano Dr","authors":"Giuseppe Gaetano Luciano and Emmanuel Saridakis","title":"$P-v$ criticalities, phase transitions and geometrothermodynamics of\n  charged AdS black holes from Kaniadakis statistics","comments":"15 pages, 11 labelled figures, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc cond-mat.stat-mech hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Boltzmann entropy-based thermodynamics of charged anti-de Sitter (AdS) black\nholes has been shown to exhibit physically interesting features, such as $P-V$\ncriticalities and van der Waals-like phase transitions. In this work we extend\nthe study of these critical phenomena to Kaniadakis theory, which is a\nnon-extensive generalization of the classical statistical mechanics\nincorporating relativity. By applying the typical framework of condensed-matter\nphysics, we analyze the impact of Kaniadakis entropy onto the equation of\nstate, the Gibbs free energy and the critical exponents of AdS black holes in\nthe extended phase space. Additionally, we investigate the underlying\nmicro-structure of black holes in Ruppeiner geometry, which reveals appreciable\ndeviations of the nature of the particle interactions from the standard\nbehavior. Our analysis opens up new perspectives on the understanding of black\nhole thermodynamics in a relativistic statistical framework, highlighting the\nrole of non-extensive corrections in the AdS black holes/van der Waals fluids\ndual picture.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:20:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Luciano","Giuseppe Gaetano",""],["Saridakis","Emmanuel",""]]}
{"id":"2308.12670","submitter":"Melvin Drent","authors":"Collin Drent and Melvin Drent and Geert-Jan van Houtum","title":"Optimal data pooling for shared learning in maintenance operations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the benefits of pooling data for shared learning in\nmaintenance operations. We consider a set of systems subject to Poisson\ndegradation that are coupled through an a-priori unknown rate. Decision\nproblems involving these systems are high-dimensional Markov decision processes\n(MDPs). We present a decomposition result that reduces such an MDP to\ntwo-dimensional MDPs, enabling structural analyses and computations. We\nleverage this decomposition to demonstrate that pooling data can lead to\nsignificant cost reductions compared to not pooling.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:27:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Drent","Collin",""],["Drent","Melvin",""],["van Houtum","Geert-Jan",""]]}
{"id":"2308.12671","submitter":"Matthew Coak","authors":"M.J. Coak, S.P.M. Curley, Z. Hawkhead, J.P. Tidey, D. Graf, S.J.\n  Clark, P. Sengupta, Z.E. Manson, T. Lancaster, P.A. Goddard and J.L. Manson","title":"Asymmetric phase diagram and dimensional crossover in a system of\n  spin-1/2 dimers under applied hydrostatic pressure","comments":"Submitted to Phys. Rev. B","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the magnetic and structural properties of\n[Cu(pyrazine)$_{0.5}$(glycine)]ClO$_4$ under applied pressure. As previously\nreported, at ambient pressure this material consists of quasi-two-dimensional\nlayers of weakly coupled antiferromagnetic dimers which undergo Bose-Einstein\ncondensation of triplet excitations between two magnetic field-induced quantum\ncritical points (QCPs). The molecular building blocks from which the compound\nis constructed give rise to exchange strengths that are considerably lower than\nthose found in other $S = 1/2$ dimer materials, which allows us to determine\nthe pressure evolution of the entire field-temperature magnetic phase diagram\nusing radio-frequency magnetometry. We find that a distinct phase emerges above\nthe upper field-induced transition at elevated pressures and also show that an\nadditional QCP is induced at zero-field at a critical pressure of $p_{\\rm c} =\n15.7(5)$ kbar. Pressure-dependent single-crystal X-ray diffraction and density\nfunctional theory calculations indicate that this QCP arises primarily from a\ndimensional crossover driven by an increase in the interdimer interactions\nbetween the planes. While the effect of quantum fluctuations on the lower\nfield-induced transition is enhanced with applied pressure, quantum Monte Carlo\ncalculations suggest that this alone cannot explain an unconventional asymmetry\nthat develops in the phase diagram.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:28:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Coak","M. J.",""],["Curley","S. P. M.",""],["Hawkhead","Z.",""],["Tidey","J. P.",""],["Graf","D.",""],["Clark","S. J.",""],["Sengupta","P.",""],["Manson","Z. E.",""],["Lancaster","T.",""],["Goddard","P. A.",""],["Manson","J. L.",""]]}
{"id":"2308.12672","submitter":"Karlijn Kruiswijk","authors":"Karlijn Kruiswijk (1), Gwenha\\\"el de Wasseige (1) ((1) Centre for\n  Cosmology, Particle Physics and Phenomenology - CP3, Universit\\'e catholique\n  de Louvain, Louvain-la-Neuve, Belgium)","title":"The classification and categorisation of Gamma-Ray Bursts with machine\n  learning techniques for neutrino detection","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023)","journal-ref":null,"doi":"10.22323/1.444.1508","report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While Gamma-Ray Burst (GRBs) are clear and distinct observed events, every\nindividual GRB is unique. In fact, GRBs are known for their variable behaviour,\nand BATSE was already able to discover two categories of GRB from the T90\ndistribution; the short and long GRBs. These two categories match up with the\nexpected two types of GRB progenitors. Nowadays, more features have been found\nto be able to further distinguish them, such as the hardness ratio or the\npresence of supernovae. However, that does not mean that it is by any means\nsimple to categorise individual GRBs. Furthermore, more GRB categories have\nbeen theorised as well, such as low-luminosity or X-ray-rich GRBs. These\ndifferent types of GRBs also could indicate a different neutrino spectrum, with\ndifferent types of GRBs more likely to emit higher amounts of neutrinos. We\npresent an ongoing effort to use machine learning to categorise and classify\nGRBs, searching for subpopulations that could yield a larger neutrino flux. We\nspecifically use unsupervised learning, as it allows hidden patterns and\ncorrelations to come to light. With the help of features such as the T90,\nhardness, fluence, SNR, spectral index and even the full light curve and\nspectra, different structures and categories of Gamma-Ray bursts can be found.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:30:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kruiswijk","Karlijn",""],["de Wasseige","Gwenha\u00ebl",""]]}
{"id":"2308.12673","submitter":"Vasileios Mezaris","authors":"Dimitrios Daskalakis, Nikolaos Gkalelis, Vasileios Mezaris","title":"Masked Feature Modelling: Feature Masking for the Unsupervised\n  Pre-training of a Graph Attention Network Block for Bottom-up Video Event\n  Recognition","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we introduce Masked Feature Modelling (MFM), a novel approach\nfor the unsupervised pre-training of a Graph Attention Network (GAT) block. MFM\nutilizes a pretrained Visual Tokenizer to reconstruct masked features of\nobjects within a video, leveraging the MiniKinetics dataset. We then\nincorporate the pre-trained GAT block into a state-of-the-art bottom-up\nsupervised video-event recognition architecture, ViGAT, to improve the model's\nstarting point and overall accuracy. Experimental evaluations on the YLI-MED\ndataset demonstrate the effectiveness of MFM in improving event recognition\nperformance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:31:02 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 08:03:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Daskalakis","Dimitrios",""],["Gkalelis","Nikolaos",""],["Mezaris","Vasileios",""]]}
{"id":"2308.12674","submitter":"Yijie Chen","authors":"Yijie Chen, Yijin Liu, Fandong Meng, Yufeng Chen, Jinan Xu, Jie Zhou","title":"Improving Translation Faithfulness of Large Language Models via\n  Augmenting Instructions","comments":"Our code and datasets are released in Github:\n  https://github.com/pppa2019/swie_overmiss_llm4mt","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) present strong general capabilities, and a\ncurrent compelling challenge is stimulating their specialized capabilities,\nsuch as machine translation, through low-cost instruction tuning. The standard\ninstruction-following data is sequentially organized as the concatenation of an\ninstruction, an input, and a response. As the attention mechanism of LLMs has\nlimitations on local focus, LLMs tend to focus more on the words or sentences\nnearby at each position. This leads to a high risk of instruction forgetting\nduring decoding. To alleviate the above issues, We propose SWIE\n(Segment-Weighted Instruction Embedding) and an instruction-following dataset\nOVERMISS. SWIE improves the model instruction understanding by adding a global\ninstruction representation on the following input and response representations.\nOVERMISS improves model faithfulness by comparing over-translation and\nmiss-translation results with the correct translation. We apply our methods to\ntwo main-stream open-source LLMs, BLOOM and LLaMA. The experimental results\ndemonstrate significant improvements in translation performance with SWIE based\non BLOOMZ-3b, particularly in zero-shot and long text translations due to\nreduced instruction forgetting risk. Additionally, OVERMISS outperforms the\nbaseline in translation performance (e.g. an increase in BLEU scores from 0.69\nto 3.12 and an average improvement of 0.48 percentage comet scores for\nLLaMA-7b) with further enhancements seen in models combining OVERMISS and SWIE\n(e.g. the BLUE scores increase up to 0.56 from English to German across three\ndifferent backbones), and both exhibit improvements in the faithfulness metric\nbased on word alignment.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:32:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Yijie",""],["Liu","Yijin",""],["Meng","Fandong",""],["Chen","Yufeng",""],["Xu","Jinan",""],["Zhou","Jie",""]]}
{"id":"2308.12675","submitter":"Ario Sadafi","authors":"Ario Sadafi, Matthias Hehr, Nassir Navab, Carsten Marr","title":"A Study of Age and Sex Bias in Multiple Instance Learning based\n  Classification of Acute Myeloid Leukemia Subtypes","comments":"Accepted for publication at workshop on Fairness of AI in Medical\n  Imaging in International Conference on Medical Image Computing and Computer\n  Assisted Intervention (MICCAI 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate classification of Acute Myeloid Leukemia (AML) subtypes is crucial\nfor clinical decision-making and patient care. In this study, we investigate\nthe potential presence of age and sex bias in AML subtype classification using\nMultiple Instance Learning (MIL) architectures. To that end, we train multiple\nMIL models using different levels of sex imbalance in the training set and\nexcluding certain age groups. To assess the sex bias, we evaluate the\nperformance of the models on male and female test sets. For age bias, models\nare tested against underrepresented age groups in the training data. We find a\nsignificant effect of sex and age bias on the performance of the model for AML\nsubtype classification. Specifically, we observe that females are more likely\nto be affected by sex imbalance dataset and certain age groups, such as\npatients with 72 to 86 years of age with the RUNX1::RUNX1T1 genetic subtype,\nare significantly affected by an age bias present in the training data.\nEnsuring inclusivity in the training data is thus essential for generating\nreliable and equitable outcomes in AML genetic subtype classification,\nultimately benefiting diverse patient populations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:32:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sadafi","Ario",""],["Hehr","Matthias",""],["Navab","Nassir",""],["Marr","Carsten",""]]}
{"id":"2308.12676","submitter":"Masanori Tanaka","authors":"Amine Ahriche, Shinya Kanemura, Masanori Tanaka","title":"Gravitational Waves from Phase Transitions in Scale Invariant Models","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"OU-HET-1201","categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the properties of the gravitational waves (GWs) generated\nduring a strongly first order electroweak phase transition (EWPT) in models\nwith the classical scale invariance (CSI). Here, we distinguish two parameter\nspace regions that correspond to the cases of (1) light dilaton and (2) purely\nradiative Higgs mass (PRHM). In the CSI models, the dilaton mass, or the Higgs\nmass in the PRHM case, in addition to some triple scalar couplings are fully\ntriggered by the radiative corrections (RCs). In order to probe the RCs effects\non the EWPT strength and on the GW spectrum, we extend the standard model by a\nreal singlet to assist the electroweak symmetry breaking and an additional\nscalar field $Q$ with multiplicity $N_Q$ and mass $m_Q$. After imposing all\ntheoretical and experimental constraints, we show that a strongly first order\nEWPT with detectable GW spectra can be realized for the two cases of light\ndilaton and PRHM. We also show the corresponding values of the relative\nenhancement of the cross section for the di-Higgs production process, which is\nrelated to the triple Higgs boson coupling. We obtain the region in which the\nGW spectrum can be observed by different future experiments such as LISA and\nDECIGO. We also show that the scenarios (1) and (2) can be discriminated by\nfuture GW observations and measurements of the di-Higgs productions at future\ncolliders.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:35:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ahriche","Amine",""],["Kanemura","Shinya",""],["Tanaka","Masanori",""]]}
{"id":"2308.12677","submitter":"Yunfei Wang","authors":"Keyu Su, Yi Zhong, Shanchao Zhang, Jianfeng Li, Chang-Ling Zou, Yunfei\n  Wang, Hui Yan, Shi-Liang Zhu","title":"Quantum interference between non-identical single particles","comments":"6 pages, 4 figures","journal-ref":null,"doi":"10.1103/PhysRevLett.129.093604","report-no":null,"categories":"quant-ph physics.atom-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum interference between identical single particles reveals the intrinsic\nquantum statistic nature of particles, which could not be interpreted through\nclassical physics. Here, we demonstrate quantum interference between\nnon-identical bosons using a generalized beam splitter based on a quantum\nmemory. The Hong-Ou-Mandel type interference between single photons and single\nmagnons with high visibility is demonstrated, and the crossover from the\nbosonic to fermionic quantum statistics is observed by tuning the beam splitter\nto be non-Hermitian. Moreover, multi-particle interference that simulates the\nbehavior of three fermions by three input photons is realized. Our work extends\nthe understanding of the quantum interference effects and demonstrates a\nversatile experimental platform for studying and engineering quantum statistics\nof particles.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:36:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Su","Keyu",""],["Zhong","Yi",""],["Zhang","Shanchao",""],["Li","Jianfeng",""],["Zou","Chang-Ling",""],["Wang","Yunfei",""],["Yan","Hui",""],["Zhu","Shi-Liang",""]]}
{"id":"2308.12678","submitter":"Felippe Guimar\\~aes","authors":"Felippe Guimar\\~aes","title":"A note on parallel mean curvature surfaces and Codazzi operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present an intrinsic Klotz-Osserman type theorem for surfaces in terms of\nCodazzi operators. Additionally, utilizing Simons' formula, we investigate\nsurfaces with parallel mean curvature with non-positive Gaussian curvature in\nproduct spaces.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:38:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guimar\u00e3es","Felippe",""]]}
{"id":"2308.12679","submitter":"Ario Sadafi","authors":"Ario Sadafi, Raheleh Salehi, Armin Gruber, Sayedali Shetab Boushehri,\n  Pascal Giehr, Nassir Navab, Carsten Marr","title":"A Continual Learning Approach for Cross-Domain White Blood Cell\n  Classification","comments":"Accepted for publication at workshop on Domain Adaptation and\n  Representation Transfer (DART) in International Conference on Medical Image\n  Computing and Computer Assisted Intervention (MICCAI 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate classification of white blood cells in peripheral blood is essential\nfor diagnosing hematological diseases. Due to constantly evolving clinical\nsettings, data sources, and disease classifications, it is necessary to update\nmachine learning classification models regularly for practical real-world use.\nSuch models significantly benefit from sequentially learning from incoming data\nstreams without forgetting previously acquired knowledge. However, models can\nsuffer from catastrophic forgetting, causing a drop in performance on previous\ntasks when fine-tuned on new data. Here, we propose a rehearsal-based continual\nlearning approach for class incremental and domain incremental scenarios in\nwhite blood cell classification. To choose representative samples from previous\ntasks, we employ exemplar set selection based on the model's predictions. This\ninvolves selecting the most confident samples and the most challenging samples\nidentified through uncertainty estimation of the model. We thoroughly evaluated\nour proposed approach on three white blood cell classification datasets that\ndiffer in color, resolution, and class composition, including scenarios where\nnew domains or new classes are introduced to the model with every task. We also\ntest a long class incremental experiment with both new domains and new classes.\nOur results demonstrate that our approach outperforms established baselines in\ncontinual learning, including existing iCaRL and EWC methods for classifying\nwhite blood cells in cross-domain environments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:38:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sadafi","Ario",""],["Salehi","Raheleh",""],["Gruber","Armin",""],["Boushehri","Sayedali Shetab",""],["Giehr","Pascal",""],["Navab","Nassir",""],["Marr","Carsten",""]]}
{"id":"2308.12680","submitter":"Li Shen","authors":"Hanchi Huang, Li Shen, Deheng Ye, Wei Liu","title":"Master-slave Deep Architecture for Top-K Multi-armed Bandits with\n  Non-linear Bandit Feedback and Diversity Constraints","comments":"IEEE Transactions on Neural Networks and Learning Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC math.OC stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel master-slave architecture to solve the top-$K$\ncombinatorial multi-armed bandits problem with non-linear bandit feedback and\ndiversity constraints, which, to the best of our knowledge, is the first\ncombinatorial bandits setting considering diversity constraints under bandit\nfeedback. Specifically, to efficiently explore the combinatorial and\nconstrained action space, we introduce six slave models with distinguished\nmerits to generate diversified samples well balancing rewards and constraints\nas well as efficiency. Moreover, we propose teacher learning based optimization\nand the policy co-training technique to boost the performance of the multiple\nslave models. The master model then collects the elite samples provided by the\nslave models and selects the best sample estimated by a neural contextual\nUCB-based network to make a decision with a trade-off between exploration and\nexploitation. Thanks to the elaborate design of slave models, the co-training\nmechanism among slave models, and the novel interactions between the master and\nslave models, our approach significantly surpasses existing state-of-the-art\nalgorithms in both synthetic and real datasets for recommendation tasks. The\ncode is available at:\n\\url{https://github.com/huanghanchi/Master-slave-Algorithm-for-Top-K-Bandits}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:39:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Huang","Hanchi",""],["Shen","Li",""],["Ye","Deheng",""],["Liu","Wei",""]]}
{"id":"2308.12681","submitter":"Yanci Zhang","authors":"Yanci Zhang and Han Yu","title":"LR-XFL: Logical Reasoning-based Explainable Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DC cs.LG cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning (FL) is an emerging approach for training machine learning\nmodels collaboratively while preserving data privacy. The need for privacy\nprotection makes it difficult for FL models to achieve global transparency and\nexplainability. To address this limitation, we incorporate logic-based\nexplanations into FL by proposing the Logical Reasoning-based eXplainable\nFederated Learning (LR-XFL) approach. Under LR-XFL, FL clients create local\nlogic rules based on their local data and send them, along with model updates,\nto the FL server. The FL server connects the local logic rules through a proper\nlogical connector that is derived based on properties of client data, without\nrequiring access to the raw data. In addition, the server also aggregates the\nlocal model updates with weight values determined by the quality of the\nclients' local data as reflected by their uploaded logic rules. The results\nshow that LR-XFL outperforms the most relevant baseline by 1.19%, 5.81% and\n5.41% in terms of classification accuracy, rule accuracy and rule fidelity,\nrespectively. The explicit rule evaluation and expression under LR-XFL enable\nhuman experts to validate and correct the rules on the server side, hence\nimproving the global FL model's robustness to errors. It has the potential to\nenhance the transparency of FL models for areas like healthcare and finance\nwhere both data privacy and explainability are important.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:40:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Yanci",""],["Yu","Han",""]]}
{"id":"2308.12682","submitter":"Rishi Hazra","authors":"Rishi Hazra, Pedro Zuidberg Dos Martires, Luc De Raedt","title":"SayCanPay: Heuristic Planning with Large Language Models using Learnable\n  Domain Knowledge","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have demonstrated impressive planning abilities\ndue to their vast \"world knowledge\". Yet, obtaining plans that are both\nfeasible (grounded in affordances) and cost-effective (in plan length), remains\na challenge, despite recent progress. This contrasts with heuristic planning\nmethods that employ domain knowledge (formalized in action models such as PDDL)\nand heuristic search to generate feasible, optimal plans. Inspired by this, we\npropose to combine the power of LLMs and heuristic planning by leveraging the\nworld knowledge of LLMs and the principles of heuristic search. Our approach,\nSayCanPay, employs LLMs to generate actions (Say) guided by learnable domain\nknowledge, that evaluates actions' feasibility (Can) and long-term\nreward/payoff (Pay), and heuristic search to select the best sequence of\nactions. Our contributions are (1) a novel framing of the LLM planning problem\nin the context of heuristic planning, (2) integrating grounding and\ncost-effective elements into the generated plans, and (3) using heuristic\nsearch over actions. Our extensive evaluations show that our model surpasses\nother LLM planning approaches.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:47:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hazra","Rishi",""],["Martires","Pedro Zuidberg Dos",""],["De Raedt","Luc",""]]}
{"id":"2308.12683","submitter":"Ioannis Koureas","authors":"Ioannis Koureas, Mohit Pundir, Shai Feldfogel, David S. Kammer","title":"The key to the enhanced performance of slab-like topologically\n  interlocked structures with non-planar blocks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topologically interlocked structures are assemblies of interlocking blocks\nthat hold together solely through contact. Such structures have been shown to\nexhibit high strength, energy dissipation, and crack arrest properties. Recent\nstudies on beam-like topologically interlocked structures have shown that, with\nnon-planar blocks, it is possible to reach levels of strength and\nwork-to-failure which are otherwise possible only with unrealistically high\nfriction coefficients. While non-planar blocks have been extensively used for\nslab-like assemblies, many questions in that context are still not fully\nunderstood. Specifically, it is unclear what are the exact characteristics of\nnon-planar surface morphologies which can potentially improve the enhanced\nmechanical response of slab-like assemblies. In addition, it is unclear if\nslab-like structures with non-planar surface blocks can reach a saturated\nresponse with realistic friction coefficient values, as is the case with\nbeam-like ones. Here, we investigate such fundamental questions using numerical\nsimulations. We show that, by using non-planar blocks, it is possible to reach\nsaturation to the response capacity of the structure with a realistic friction\ncoefficient. Furthermore, we show that the key morphology parameter responsible\nfor the enhanced performance is the local angle of inclination at the top of\nthe loaded block. Lastly, we show that non-planar morphologies lead to improved\nwork-to-failure and ultimate deflection, which cannot be attained with\nplanar-faced blocks. These findings shed new light on topologically interlocked\nstructures with non-planar blocks, allowing for a better understanding of their\nstrengths and potential applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:48:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Koureas","Ioannis",""],["Pundir","Mohit",""],["Feldfogel","Shai",""],["Kammer","David S.",""]]}
{"id":"2308.12684","submitter":"Matteo Raffaelli","authors":"Matteo Raffaelli","title":"Total torsion of three-dimensional lines of curvature","comments":"8 pages, no figures. Accepted version","journal-ref":"Geom. Dedicata 217 (2023), no. 6, Paper No. 96","doi":"10.1007/s10711-023-00833-8","report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A curve $\\gamma$ in a Riemannian manifold $M$ is three-dimensional if its\ntorsion (signed second curvature function) is well-defined and all higher-order\ncurvatures vanish identically. In particular, when $\\gamma$ lies on an oriented\nhypersurface $S$ of $M$, we say that $\\gamma$ is well positioned if the curve's\nprincipal normal, its torsion vector, and the surface normal are everywhere\ncoplanar. Suppose that $\\gamma$ is three-dimensional and closed. We show that\nif $\\gamma$ is a well-positioned line of curvature of $S$, then its total\ntorsion is an integer multiple of $2\\pi$; and that, conversely, if the total\ntorsion of $\\gamma$ is an integer multiple of $2\\pi$, then there exists an\noriented hypersurface of $M$ in which $\\gamma$ is a well-positioned line of\ncurvature. Moreover, under the same assumptions, we prove that the total\ntorsion of $\\gamma$ vanishes when $S$ is convex. This extends the classical\ntotal torsion theorem for spherical curves.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:51:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Raffaelli","Matteo",""]]}
{"id":"2308.12685","submitter":"Jos\\'e Miguel Sanz Alcaine","authors":"Jose Miguel Sanz-Alcaine, Francisco Jose Perez-Cebolla, Carlos\n  Bernal-Ruiz, Asier Arruti, Iosu Aizpuru, Juan Sanchez","title":"Loss Measurement of Low RDS Devices Through Thermal Modelling -- The\n  Advantage of Not Turning it Fully On","comments":"7 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents and evaluates a novel method for generating power losses\non transistors avoiding high currents. These could heat up the circuit tracks,\naffecting the accurate thermal modeling of the system. The proposed procedure\nis based on the transistor current regulation with low gate voltages and the\nlinearity between power and temperature, being useful for all transistor\ntechnologies (Si, SiC and GaN). Through this method, low DC currents are enough\nto bring transistors to their thermal limits. Thermal stability issues and\ntheir differences between technologies are discussed and an experimental\nvalidation of the method is carried out.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:53:04 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 14:36:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sanz-Alcaine","Jose Miguel",""],["Perez-Cebolla","Francisco Jose",""],["Bernal-Ruiz","Carlos",""],["Arruti","Asier",""],["Aizpuru","Iosu",""],["Sanchez","Juan",""]]}
{"id":"2308.12686","submitter":"Charlotte Pelletier Dr","authors":"Fran\\c{c}ois Painblanc, Laetitia Chapel, Nicolas Courty, Chlo\\'e\n  Friguet, Charlotte Pelletier, and Romain Tavenard","title":"Match-And-Deform: Time Series Domain Adaptation through Optimal\n  Transport and Temporal Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While large volumes of unlabeled data are usually available, associated\nlabels are often scarce. The unsupervised domain adaptation problem aims at\nexploiting labels from a source domain to classify data from a related, yet\ndifferent, target domain. When time series are at stake, new difficulties arise\nas temporal shifts may appear in addition to the standard feature distribution\nshift. In this paper, we introduce the Match-And-Deform (MAD) approach that\naims at finding correspondences between the source and target time series while\nallowing temporal distortions. The associated optimization problem\nsimultaneously aligns the series thanks to an optimal transport loss and the\ntime stamps through dynamic time warping. When embedded into a deep neural\nnetwork, MAD helps learning new representations of time series that both align\nthe domains and maximize the discriminative power of the network. Empirical\nstudies on benchmark datasets and remote sensing data demonstrate that MAD\nmakes meaningful sample-to-sample pairing and time shift estimation, reaching\nsimilar or better classification performance than state-of-the-art deep time\nseries domain adaptation strategies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 09:57:11 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 09:12:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Painblanc","Fran\u00e7ois",""],["Chapel","Laetitia",""],["Courty","Nicolas",""],["Friguet","Chlo\u00e9",""],["Pelletier","Charlotte",""],["Tavenard","Romain",""]]}
{"id":"2308.12687","submitter":"George Tsibidis","authors":"George D. Tsibidis and Emmanuel Stratakis","title":"Influence of Antireflection Si coatings on the Damage Threshold of fused\n  silica upon irradiation with Mid-IR femtosecond laser pulses","comments":"TO appear in Optics Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mtrl-sci cond-mat.other","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent progress in the development of high-power mid-IR laser sources and the\nexciting laser driven physical phenomena associated with the irradiation of\nsolids via ultrashort laser pulses in that spectral region are aimed to\npotentially create novel capabilities for material processing. In particularly,\nthe investigation of the underlying physical processes and the evaluation of\nthe optical breakdown threshold (OBT) following irradiation of bulk dielectric\nmaterials with Mid-IR femtosecond (fs) pulses has been recently presented. In\nthis report, we will explore the conditions that generate sufficient carrier\nexcitation levels which leads to damage upon irradiated a dielectric material\n(SiO2) coated with antireflection (AR) semiconducting films (Si) of variable\nthickness with fs pulses. Simulation results demonstrate that the reflectivity\nand transmissivity of the Si/SiO2 are thickness-dependent which can be employed\nto modulate the damage threshold of the substrate. The study is to provide\ninnovative routes for selecting material sizes that can be used for\nantireflection coatings and applications in the Mid-IR region.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:02:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tsibidis","George D.",""],["Stratakis","Emmanuel",""]]}
{"id":"2308.12688","submitter":"Santiago Martinez Balvanera","authors":"Santiago Martinez Balvanera, Oisin Mac Aodha, Matthew J. Weldy, Holly\n  Pringle, Ella Browning, Kate E. Jones","title":"Whombat: An open-source annotation tool for machine learning development\n  in bioacoustics","comments":"17 pages, 2 figures, 2 tables, to be submitted to Methods in Ecology\n  and Evolution","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  1. Automated analysis of bioacoustic recordings using machine learning (ML)\nmethods has the potential to greatly scale biodiversity monitoring efforts. The\nuse of ML for high-stakes applications, such as conservation research, demands\na data-centric approach with a focus on utilizing carefully annotated and\ncurated evaluation and training data that is relevant and representative.\nCreating annotated datasets of sound recordings presents a number of\nchallenges, such as managing large collections of recordings with associated\nmetadata, developing flexible annotation tools that can accommodate the diverse\nrange of vocalization profiles of different organisms, and addressing the\nscarcity of expert annotators.\n  2. We present Whombat a user-friendly, browser-based interface for managing\naudio recordings and annotation projects, with several visualization,\nexploration, and annotation tools. It enables users to quickly annotate,\nreview, and share annotations, as well as visualize and evaluate a set of\nmachine learning predictions on a dataset. The tool facilitates an iterative\nworkflow where user annotations and machine learning predictions feedback to\nenhance model performance and annotation quality.\n  3. We demonstrate the flexibility of Whombat by showcasing two distinct use\ncases: an project aimed at enhancing automated UK bat call identification at\nthe Bat Conservation Trust (BCT), and a collaborative effort among the USDA\nForest Service and Oregon State University researchers exploring bioacoustic\napplications and extending automated avian classification models in the Pacific\nNorthwest, USA.\n  4. Whombat is a flexible tool that can effectively address the challenges of\nannotation for bioacoustic research. It can be used for individual and\ncollaborative work, hosted on a shared server or accessed remotely, or run on a\npersonal computer without the need for coding skills.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:06:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Balvanera","Santiago Martinez",""],["Mac Aodha","Oisin",""],["Weldy","Matthew J.",""],["Pringle","Holly",""],["Browning","Ella",""],["Jones","Kate E.",""]]}
{"id":"2308.12689","submitter":"Mayank Narang","authors":"Mayank Narang, Manoj Puravankara, Himanshu Tyagi, Prasanta K. Nayak,\n  Saurabh Sharma, Arun Surya, Bihan Banerjee, Blesson Mathew, Arpan Ghosh and\n  Aayushi Verma","title":"Optical spectroscopy of Gaia detected protostars with DOT: can we probe\n  protostellar photospheres?","comments":"9 pages, 5 figures accepted in Journal of Astrophysics and Astronomy\n  as part of the \"Star formation studies in the context of NIR instruments on\n  3.6m DOT\" special issue","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optical spectroscopy offers the most direct view of the stellar properties\nand the accretion indicators. Standard accretion tracers, such as $H\\beta$,\n$H\\alpha$, and, Ca II triplet lines, and most photospheric features, fall in\nthe optical wavelengths. However, these tracers are not readily observable from\ndeeply embedded protostars because of the large line of sight extinction (Av\n$\\sim$ 50-100 mag) toward them. In some cases, however, it is possible to\nobserve protostars at optical wavelengths if the outflow cavity is aligned\nalong the line-of-sight that allows observations of the photosphere, or the\nenvelope is very tenuous and thin such that the extinction is low. In such\ncases, we can not only detect these protostars at optical wavelengths but also\nfollow up spectroscopically. We have used the HOPS catalog (Furlan et al. 2016)\nof protostars in Orion to search for optical counterparts for protostars in the\nGaia DR3 survey. Out of the 330 protostars in the HOPS sample, an optical\ncounterpart within 2\" is detected for 62 of the protostars. For 17 out of 62\noptically detected protostars, we obtained optical spectra { (between 5500 to\n8900 $\\AA$) using the Aries-Devasthal Faint Object Spectrograph \\& Camera\n(ADFOSC) on the 3.6-m Devasthal Optical Telescope (DOT) and Hanle Faint Object\nSpectrograph Camera (HFOSC) on 2-m Himalayan Chandra Telescope (HCT)}. We\ndetect strong photospheric features, such as the TiO bands in the spectra {(of\n4 protostars)}, hinting that photospheres can form early on in the star\nformation process. We further determined the spectral types of protostars,\nwhich show photospheres similar to a late M-type. Mass accretion rates derived\nfor the protostars are similar to those found for T-Tauri stars, in the range\nof 10$^{-7}$ to 10$^{-8}$ $M_\\odot$/yr.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:07:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Narang","Mayank",""],["Puravankara","Manoj",""],["Tyagi","Himanshu",""],["Nayak","Prasanta K.",""],["Sharma","Saurabh",""],["Surya","Arun",""],["Banerjee","Bihan",""],["Mathew","Blesson",""],["Ghosh","Arpan",""],["Verma","Aayushi",""]]}
{"id":"2308.12690","submitter":"HongTao Wang","authors":"Hongtao Wang, Chao Guo, Hongmin Cao, Yongyun Chen, Nan Ding, Xiaotong\n  Guo","title":"The comparison of optical variability of broad-line Seyfert 1 and\n  narrow-line Seyfert 1 galaxies from the view of Pan-STARRS","comments":"10 pages, 5 figures, accepted by Astrophysics and Space Science, in\n  Press","journal-ref":null,"doi":"10.1007/s10509-023-04226-x","report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By means of the data sets of the Panoramic Survey Telescope and Rapid\nResponse System (Pan-STARRS), we investigate the relationship between the\nvariability amplitude and luminosity at 5100 \\AA, black hole mass, Eddington\nratio, $ R_{\\rm Fe \\, II}$ ( the ratio of the flux of Fe II line within\n4435-4685 \\AA ~to the broad proportion of $\\rm H\\beta$ line) as well as $\nR_{5007}$ (the ratio of the flux [O III] line to the total $\\rm H\\beta$ line)\nof the broad line Seyfert 1 (BLS1) and narrow line Seyfert 1 (NLS1) galaxies\nsample in g,r,i,z and y bands, respectively. We also analyze the similarities\nand differences of the variability characteristics between the BLS1 galaxies\nand NLS1 galaxies. The results are listed as follows. (1). The cumulative\nprobability distribution of the variability amplitude shows that NLS1 galaxies\nare lower than that in BLS1 galaxies. (2). We analyze the dependence of the\nvariability amplitude with the luminosity at 5100 \\AA, black hole mass,\nEddington ratio, $ R_{\\rm Fe \\,II}$ and $ R_{5007}$, respectively. We find\nsignificantly negative correlations between the variability amplitude and\nEddington ratio, insignificant correlations with the luminosity at 5100 \\AA.\nThe results also show significantly positive correlations with the black hole\nmass and $ R_{5007}$, significantly negative correlations with $ R_{\\rm Fe\\,\nII}$ which are consistent with Rakshit and Stalin(2017) in low redshift bins\n(z<0.4) and Ai et al.(2010). (3). The relationship between the variability\namplitude and the radio loudness is investigated for 155 BLS1 galaxies and 188\nNLS1 galaxies. No significant correlations are found in our results.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:18:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Hongtao",""],["Guo","Chao",""],["Cao","Hongmin",""],["Chen","Yongyun",""],["Ding","Nan",""],["Guo","Xiaotong",""]]}
{"id":"2308.12691","submitter":"Bohan Lyu","authors":"Bohan Lyu and Jianzhong Li","title":"An Efficient Data Analysis Method for Big Data using Multiple-Model\n  Linear Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a new data analysis method for big data using a newly\ndefined regression model named multiple model linear regression(MMLR), which\nseparates input datasets into subsets and construct local linear regression\nmodels of them. The proposed data analysis method is shown to be more efficient\nand flexible than other regression based methods. This paper also proposes an\napproximate algorithm to construct MMLR models based on\n$(\\epsilon,\\delta)$-estimator, and gives mathematical proofs of the correctness\nand efficiency of MMLR algorithm, of which the time complexity is linear with\nrespect to the size of input datasets. This paper also empirically implements\nthe method on both synthetic and real-world datasets, the algorithm shows to\nhave comparable performance to existing regression methods in many cases, while\nit takes almost the shortest time to provide a high prediction accuracy.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:20:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lyu","Bohan",""],["Li","Jianzhong",""]]}
{"id":"2308.12692","submitter":"Srirang Manohar","authors":"Srirang Manohar, Ioannis Sechopoulos, Mark A. Anastasio, Lena\n  Maier-Hein and Rajiv (Raj) Gupta","title":"Imaging Super Phantoms","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We advocate for phantoms that replicate imaging features related to physical,\nfunctional, and physiological properties of organs, both in health and disease.\nThese physical and digital models can be employed to test imaging technologies\nat early stages of development, allowing iterative improvements considerably\nearlier than in-vivo studies. We call these models 'super phantoms' to signify\nthat they occupy a class of sophistication beyond standard phantoms. We provide\nexamples of super phantoms, and present challenges in developing these. We\nconclude with a vision of centralized facilities serving multiple institutions\nthat house infrastructure for the development and application of these super\nphantoms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:20:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Manohar","Srirang","","Raj"],["Sechopoulos","Ioannis","","Raj"],["Anastasio","Mark A.","","Raj"],["Maier-Hein","Lena","","Raj"],["Rajiv","","","Raj"],["Gupta","",""]]}
{"id":"2308.12693","submitter":"Younghan Yoon","authors":"Suyoung Choi and Younghan Yoon","title":"The cohomology rings of real permutohedral varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish explicit descriptions of the cohomology ring of real\npermutohedral varieties. In particular, the multiplicative structure is given\nin terms of alternating permutations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:21:48 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 01:54:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Choi","Suyoung",""],["Yoon","Younghan",""]]}
{"id":"2308.12694","submitter":"Benjamin Marussig","authors":"Michael H. Gfrerer, Benjamin Marussig, Katharina Maitz, Mia M. Bangerl","title":"Teaching mechanics with individual exercise assignments and automated\n  correction","comments":null,"journal-ref":null,"doi":"10.1002/pamm.202300168","report-no":null,"categories":"physics.ed-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Solving exercise problems by yourself is a vital part of developing a\nmechanical understanding. Yet, most mechanics lectures have more than 200\nparticipants, so the workload for manually creating and correcting assignments\nlimits the number of exercises. The resulting example pool is usually much\nsmaller than the number of participants, making verifying whether students can\nsolve problems themselves considerably harder. At the same time, unreflected\ncopying of tasks already solved does not foster the understanding of the\nsubject and leads to a false self-assessment. We address these issues by\nproviding a scalable approach for creating, distributing, and correcting\nexercise assignments for problems related to statics, strength of materials,\ndynamics, and hydrostatics. The overall concept allows us to provide individual\nexercise assignments for each student. A quantitative survey among students of\nour recent statics lecture assesses the acceptance of our teaching tool. The\nfeedback indicates a clear added value for the lecture, which fosters\nself-directed and reflective learning.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:24:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gfrerer","Michael H.",""],["Marussig","Benjamin",""],["Maitz","Katharina",""],["Bangerl","Mia M.",""]]}
{"id":"2308.12695","submitter":"Tzay-Ming Hong","authors":"Ting-Heng Hsieh, Wei-Chi Li, and Tzay-Ming Hong","title":"Dual residence time for droplet to coalesce with liquid surface","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When droplets approach a liquid surface, they have a tendency to merge in\norder to minimize surface energy. However, under certain conditions, they can\nexhibit a phenomenon called coalescence delay, where they remain separate for\ntens of milliseconds. This duration is known as the residence time or the\nnon-coalescence time. Surprisingly, under identical parameters and initial\nconditions, the residence time for water droplets is not a constant value but\nexhibits dual peaks in its distribution. In this paper, we present the\nobservation of the dual residence times through rigorous statistical analysis\nand investigate the quantitative variations in residence time by manipulating\nparameters such as droplet height, radius, and viscosity. Theoretical models\nand physical arguments are provided to explain their effects, particularly why\na large viscosity or/and a small radius is detrimental to the appearance of the\nlonger residence time peak.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:27:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hsieh","Ting-Heng",""],["Li","Wei-Chi",""],["Hong","Tzay-Ming",""]]}
{"id":"2308.12696","submitter":"Daria Voronkova","authors":"Nikita Balabin, Daria Voronkova, Ilya Trofimov, Evgeny Burnaev,\n  Serguei Barannikov","title":"Disentanglement Learning via Topology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose TopDis (Topological Disentanglement), a method for learning\ndisentangled representations via adding multi-scale topological loss term.\nDisentanglement is a crucial property of data representations substantial for\nthe explainability and robustness of deep learning models and a step towards\nhigh-level cognition. The state-of-the-art method based on VAE minimizes the\ntotal correlation of the joint distribution of latent variables. We take a\ndifferent perspective on disentanglement by analyzing topological properties of\ndata manifolds. In particular, we optimize the topological similarity for data\nmanifolds traversals. To the best of our knowledge, our paper is the first one\nto propose a differentiable topological loss for disentanglement. Our\nexperiments have shown that the proposed topological loss improves\ndisentanglement scores such as MIG, FactorVAE score, SAP score and DCI\ndisentanglement score with respect to state-of-the-art results. Our method\nworks in an unsupervised manner, permitting to apply it for problems without\nlabeled factors of variation. Additionally, we show how to use the proposed\ntopological loss to find disentangled directions in a trained GAN.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:29:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Balabin","Nikita",""],["Voronkova","Daria",""],["Trofimov","Ilya",""],["Burnaev","Evgeny",""],["Barannikov","Serguei",""]]}
{"id":"2308.12697","submitter":"Chenyuan Zhang","authors":"Chenyuan Zhang, Hao Liu, Jiutian Zeng, Kejing Yang, Yuhong Li, Hui Li","title":"Prompt-Enhanced Software Vulnerability Detection Using ChatGPT","comments":"13 Pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increase in software vulnerabilities that cause significant economic\nand social losses, automatic vulnerability detection has become essential in\nsoftware development and maintenance. Recently, large language models (LLMs)\nlike GPT have received considerable attention due to their stunning\nintelligence, and some studies consider using ChatGPT for vulnerability\ndetection. However, they do not fully consider the characteristics of LLMs,\nsince their designed questions to ChatGPT are simple without a specific prompt\ndesign tailored for vulnerability detection. This paper launches a study on the\nperformance of software vulnerability detection using ChatGPT with different\nprompt designs. Firstly, we complement previous work by applying various\nimprovements to the basic prompt. Moreover, we incorporate structural and\nsequential auxiliary information to improve the prompt design. Besides, we\nleverage ChatGPT's ability of memorizing multi-round dialogue to design\nsuitable prompts for vulnerability detection. We conduct extensive experiments\non two vulnerability datasets to demonstrate the effectiveness of\nprompt-enhanced vulnerability detection using ChatGPT. We also analyze the\nmerit and demerit of using ChatGPT for vulnerability detection.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:30:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Chenyuan",""],["Liu","Hao",""],["Zeng","Jiutian",""],["Yang","Kejing",""],["Li","Yuhong",""],["Li","Hui",""]]}
{"id":"2308.12698","submitter":"Jinjie Li","authors":"Jinjie Li, Liang Han, Haoyang Yu, Zhaotian Wang, Pengzhi Yang, Ziwei\n  Yan, Zhang Ren","title":"Potato: A Data-Oriented Programming 3D Simulator for Large-Scale\n  Heterogeneous Swarm Robotics","comments":"4 pages, 5 figures, accepted by ICRA 2023 Workshop on \"The Role of\n  Robotics Simulators for Unmanned Aerial Vehicles\"","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale simulation with realistic nonlinear dynamic models is crucial for\nalgorithms development for swarm robotics. However, existing platforms are\nmainly developed based on Object-Oriented Programming (OOP) and either use\nsimple kinematic models to pursue a large number of simulating nodes or\nimplement realistic dynamic models with limited simulating nodes. In this\npaper, we develop a simulator based on Data-Oriented Programming (DOP) that\nutilizes GPU parallel computing to achieve large-scale swarm robotic\nsimulations. Specifically, we use a multi-process approach to simulate\nheterogeneous agents and leverage PyTorch with GPU to simulate homogeneous\nagents with a large number. We test our approach using a nonlinear quadrotor\nmodel and demonstrate that this DOP approach can maintain almost the same\ncomputational speed when quadrotors are less than 5,000. We also provide two\nexamples to present the functionality of the platform.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:33:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Jinjie",""],["Han","Liang",""],["Yu","Haoyang",""],["Wang","Zhaotian",""],["Yang","Pengzhi",""],["Yan","Ziwei",""],["Ren","Zhang",""]]}
{"id":"2308.12699","submitter":"Marina Ishchenko","authors":"Maryna Ishchenko, Margaryta Sobolenko, Peter Berczik, Chingis Omarov,\n  Olexander Sobodar, Mukhagali Kalambay, and Denis Yurin","title":"Milky Way globular clusters on cosmological timescales. III. Interaction\n  rates","comments":"11 pages, 9 figures, 3 tables, accepted for publication in Astronomy\n  and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aims. We carry out the self-consistent dynamic evolution of the orbital\nstructure of Milky Way globular clusters. This allows us to estimate possible\nand probable close passages and even collisions of the clusters with each\nother. Methods. We reproduced the orbits of 147 globular clusters in 10 Gyr\nlookback time using our own high-order N-body parallel dynamic phi-GPU code.\nThe initial conditions (three coordinates and three velocities for the present\ntime) were derived from the Gaia DR3 catalogue. The galaxy is represented by\nfive external potentials from the IllustrisTNG-100, whose masses and sizes of\nthe disk and halo components are similar to the physical values of the Milky\nWay at present. Results. We present a statistical analysis of the cumulative\nclose passages rate: About ten close passages with relative distances shorter\nthan 50 pc for every billion years for each of the five external potentials. We\npresent the 22 most reliable collision pairs with a good probability. As an\nexample: Terzan 4 versus Terzan 2 (49%), Terzan 4 versus NGC 6624 (44%), Terzan\n4 versus Terzan 5 (40%), Terzan 4 versus NGC 6440 (40%), and Terzan 4 versus\nLiller 1 (42%). The most active globular cluster in the collision sense is\nTerzan 4, which has 5.65 collision events on average (averaged over all\nindividual 1000 initial condition realisations). Most collisions are located\ninside the Galactic disk and form two ring-like structures. The first ring-like\nstructure has the highest collision number density at 1 kpc, and the second\nsturcture has a maximum at 2 kpc. Conclusions. Based on our numerical\nsimulations, we can conclude that the few dozen Milky Way globular clusters\nprobably undergo some close encounters and even possible collisions during\ntheir lifetimes, which can significantly affect their individual dynamical\nevolution and possibly even their stellar content.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:35:53 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ishchenko","Maryna",""],["Sobolenko","Margaryta",""],["Berczik","Peter",""],["Omarov","Chingis",""],["Sobodar","Olexander",""],["Kalambay","Mukhagali",""],["Yurin","Denis",""]]}
{"id":"2308.12700","submitter":"Jiawei Lin","authors":"Jiawei Lin, Jiaqi Guo, Shizhao Sun, Weijiang Xu, Ting Liu, Jian-Guang\n  Lou, Dongmei Zhang","title":"A Parse-Then-Place Approach for Generating Graphic Layouts from Textual\n  Descriptions","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Creating layouts is a fundamental step in graphic design. In this work, we\npropose to use text as the guidance to create graphic layouts, i.e.,\nText-to-Layout, aiming to lower the design barriers. Text-to-Layout is a\nchallenging task, because it needs to consider the implicit, combined, and\nincomplete layout constraints from text, each of which has not been studied in\nprevious work. To address this, we present a two-stage approach, named\nparse-then-place. The approach introduces an intermediate representation (IR)\nbetween text and layout to represent diverse layout constraints. With IR,\nText-to-Layout is decomposed into a parse stage and a place stage. The parse\nstage takes a textual description as input and generates an IR, in which the\nimplicit constraints from the text are transformed into explicit ones. The\nplace stage generates layouts based on the IR. To model combined and incomplete\nconstraints, we use a Transformer-based layout generation model and carefully\ndesign a way to represent constraints and layouts as sequences. Besides, we\nadopt the pretrain-then-finetune strategy to boost the performance of the\nlayout generation model with large-scale unlabeled layouts. To evaluate our\napproach, we construct two Text-to-Layout datasets and conduct experiments on\nthem. Quantitative results, qualitative analysis, and user studies demonstrate\nthe effectiveness of our approach.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:37:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lin","Jiawei",""],["Guo","Jiaqi",""],["Sun","Shizhao",""],["Xu","Weijiang",""],["Liu","Ting",""],["Lou","Jian-Guang",""],["Zhang","Dongmei",""]]}
{"id":"2308.12701","submitter":"Kisub Kim","authors":"Kisub Kim, Xin Zhou, Dongsun Kim, Julia Lawall, Kui Liu, Tegawend\\'e\n  F. Bissyand\\'e, Jacques Klein, Jaekwon Lee, and David Lo","title":"How are We Detecting Inconsistent Method Names? An Empirical Study from\n  Code Review Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Proper naming of methods can make program code easier to understand, and thus\nenhance software maintainability. Yet, developers may use inconsistent names\ndue to poor communication or a lack of familiarity with conventions within the\nsoftware development lifecycle. To address this issue, much research effort has\nbeen invested into building automatic tools that can check for method name\ninconsistency and recommend consistent names. However, existing datasets\ngenerally do not provide precise details about why a method name was deemed\nimproper and required to be changed. Such information can give useful hints on\nhow to improve the recommendation of adequate method names. Accordingly, we\nconstruct a sample method-naming benchmark, ReName4J, by matching name changes\nwith code reviews. We then present an empirical study on how state-of-the-art\ntechniques perform in detecting or recommending consistent and inconsistent\nmethod names based on ReName4J. The main purpose of the study is to reveal a\ndifferent perspective based on reviewed names rather than proposing a complete\nbenchmark. We find that the existing techniques underperform on our\nreview-driven benchmark, both in inconsistent checking and the recommendation.\nWe further identify potential biases in the evaluation of existing techniques,\nwhich future research should consider thoroughly.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:39:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kim","Kisub",""],["Zhou","Xin",""],["Kim","Dongsun",""],["Lawall","Julia",""],["Liu","Kui",""],["Bissyand\u00e9","Tegawend\u00e9 F.",""],["Klein","Jacques",""],["Lee","Jaekwon",""],["Lo","David",""]]}
{"id":"2308.12702","submitter":"Safikaa Fathima","authors":"Samik Basu, Safikaa Fathima, Shilpa Gondhali","title":"A Study of topology of the Flip Stiefel Manifolds","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A well known quotient of the real Stiefel manifold is the projective Stiefel\nmanifold. We introduce a new family of quotients of the real Stiefel manifold\nby cyclic group of order 2 whose action is induced by simultaneous pairwise\nflipping of the coordinates. We obtain a description for their tangent bundles,\ncompute their mod 2 cohomology and compute Stiefel Whitney classes of these\nmanifolds. We use these to give applications to their stable span,\nparallelizability and equivariant maps, and the associated results in\ntopological combinatorics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:44:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Basu","Samik",""],["Fathima","Safikaa",""],["Gondhali","Shilpa",""]]}
{"id":"2308.12703","submitter":"Ashis Kumar Nandy","authors":"Pritam Chatterjee, Arnob Kumar Ghosh, Ashis K. Nandy, and Arijit Saha","title":"Second-order topological superconductor via noncollinear magnetic\n  texture","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We put forth a theoretical framework for engineering a two-dimensional (2D)\nsecond-order topological superconductor (SOTSC) by utilizing a heterostructure:\nincorporating noncollinear magnetic textures between an s-wave superconductor\nand a 2D quantum spin Hall insulator. It stabilizes the higher order\ntopological superconducting phase, resulting in Majorana corner modes (MCMs) at\nfour corners of a 2D domain. The calculated non-zero quadrupole moment\ncharacterizes the bulk topology. Subsequently, through a unitary\ntransformation, an effective low-energy Hamiltonian reveals the effects of\nmagnetic textures, resulting in an effective in-plane Zeeman field and\nspin-orbit coupling. This approach provides a qualitative depiction of the\ntopological phase, substantiated by numerical validation within exact\nreal-space model. Analytically calculated effective pairings in the bulk\nilluminate the microscopic behavior of the SOTSC. The comprehension of MCM\nemergence is aided by a low-energy edge theory, which is attributed to the\ninterplay between effective pairings of (px + py )-type and (px + ipy )-type.\nOur extensive study paves the way for practically attaining the SOTSC phase by\nintegrating noncollinear magnetic textures.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:49:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chatterjee","Pritam",""],["Ghosh","Arnob Kumar",""],["Nandy","Ashis K.",""],["Saha","Arijit",""]]}
{"id":"2308.12704","submitter":"Suratna Das","authors":"Sandip Biswas, Kaushik Bhattacharya and Suratna Das","title":"Embedding Ultra slow-roll in Warm Inflation","comments":"10 pages, double column, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Slow-roll of the inflaton field defines the standard dynamics of the\ninflationary epoch. However, the inflationary system deviates from slow-roll\nwhen it encounters an extremely flat region of the inflaton potential, and\nenters a phase dubbed Ultra slow roll. In this article, we explore the\npossibility of realizing an Ultra slow-roll phase in a particularly interesting\ninflationary scenario, called Warm Inflation. In the Warm inflationary scenario\na thermalized, sub-dominant radiation bath coexists with the inflaton energy\ndensity as an effect of dissipative dynamics. We show in this article that\nthough the background dynamics indicate Ultra slow-roll when the potential\nbecomes extremely flat, in Warm Inflation models, where the dissipation\ncoefficient is a sole function of the temperature of the radiation bath, the\nsystem fails to maintain the thermal equilibrium as soon as it enters the Ultra\nslow-roll phase. As thermal equilibrium is a key feature of Warm Inflation, and\nas it is not yet known how to deal with Warm Inflation without thermal\nequilibrium, we could not analyze such systems any further in this article.\nHowever, we demonstrate that brief periods of Ultra slow-roll phase, which\nsmoothly ends into standard slow-roll, can be accommodated in WI models where\nthe dissipation coefficient is not only a function of the temperature of the\nradiation bath but also depends on the amplitude of the inflaton field. We\ntheoretically determine the criteria of successfully embedding Ultra slow-roll\nin WI while the system remain in thermal equilibrium, and also demonstrate\nnumerically that such short Ultra slow-roll phases can indeed be embedded in\nspecific Warm Inflation models which comply with the theoretically determined\ncriteria.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:50:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Biswas","Sandip",""],["Bhattacharya","Kaushik",""],["Das","Suratna",""]]}
{"id":"2308.12705","submitter":"Ian Marquette","authors":"Rutwig Campoamor-Stursberg, Danilo Latini, Ian Marquette and Yao-Zhong\n  Zhang","title":"Polynomial algebras from commutants: Classical and Quantum aspects of\n  $\\mathcal{A}_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We review some aspects of the Racah algebra $R(n)$, including the closure\nrelations, pointing out their role in superintegrability, as well as in the\ndescription of the symmetry algebra for several models with coalgebra symmetry.\nThe connection includes the generic model on the $(n-1)$ sphere. We discuss an\nalgebraic scheme of constructing Hamiltonians, integrals of the motion and\nsymmetry algebras. This scheme reduces to the Racah algebra $R(n)$ and the\nmodel on the $(n-1)$ sphere only for the case of specific differential operator\nrealizations. We review the method, which allows us to obtain the commutant\ndefined in the enveloping algebra of $\\mathfrak{sl}(n)$ in the classical\nsetting. The related $\\mathcal{A}_3$ polynomial algebra is presented for the\ncase $\\mathfrak{sl}(3)$. An explicit construction of the quantization of the\nscheme for $\\mathcal{A}_3$ by symmetrization of the polynomial and the\nreplacement of the Berezin bracket by commutator and symmetrization of the\npolynomial relations is presented. We obtain the additional quantum terms.\nThese explicit relations are of interest not only for superintegrability, but\nalso for other applications in mathematical physics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:56:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Campoamor-Stursberg","Rutwig",""],["Latini","Danilo",""],["Marquette","Ian",""],["Zhang","Yao-Zhong",""]]}
{"id":"2308.12706","submitter":"Ian Gossett","authors":"Ian Gossett","title":"Some orientation theorems for restricted DP-colorings of graphs","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We define signable, generalized signable, and $Z$-signable correspondence\nassignments on multigraphs, which generalize good correspondence assignments as\nintroduced by Kaul and Mudrock. DP-colorings from these classes generalize\nsigned colorings, signed $\\mathbb{Z}_p$-colorings, and signed list colorings of\nsigned graphs. We introduce an auxiliary digraph that allows us to prove an\nAlon-Tarsi style theorem for DP-colorings from $Z$-signable correspondence\nassignments on multigraphs, and obtain three DP-coloring analogs of the\nAlon-Tarsi theorem as corollaries.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 10:57:31 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 13:04:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gossett","Ian",""]]}
{"id":"2308.12707","submitter":"Carmine Cesarano","authors":"Carmine Cesarano","title":"Security Assessment and Hardening of Fog Computing Systems","comments":"4 pages, Accepted for publication at The 34th IEEE International\n  Symposium on Software Reliability Engineering Workshops (ISSREW)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, there has been a shift in computing architectures, moving\naway from centralized cloud computing towards decentralized edge and fog\ncomputing. This shift is driven by factors such as the increasing volume of\ndata generated at the edge, the growing demand for real-time processing and\nlow-latency applications, and the need for improved privacy and data locality.\nAlthough this new paradigm offers numerous advantages, it also introduces\nsignificant security and reliability challenges. This paper aims to review the\narchitectures and technologies employed in fog computing and identify\nopportunities for developing novel security assessment and security hardening\ntechniques. These techniques include secure configuration and debloating to\nenhance the security of middleware, testing techniques to assess secure\ncommunication mechanisms, and automated rehosting to speed up the security\ntesting of embedded firmware.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:01:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cesarano","Carmine",""]]}
{"id":"2308.12708","submitter":"Azizul Hoque Dr.","authors":"Kalyan Chakraborty and Azizul Hoque","title":"On the exponential Diophantine equation $x^2+p^mq^n=2y^p$","comments":"10 pages. To appear in `New Zealand J. Math.'","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the exponential Diophantine equation $x^2+p^mq^n=2y^p$ in positive\nintegers $x,y,m,n$, and odd primes $p$ and $q$ using primitive divisors of\nLehmer sequences in combination with elementary number theory. We discuss the\nsolvability of this equation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:02:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chakraborty","Kalyan",""],["Hoque","Azizul",""]]}
{"id":"2308.12709","submitter":"Janeth Valverde","authors":"Janeth Valverde, D. Kocevski, M. Negro, S. Garrappa and A. Brill (for\n  the Fermi-LAT Collaboration)","title":"The Fermi-LAT Light Curve Repository: A resource for the time-domain and\n  multi-messenger communities","comments":"Proceedings for the 38th International Cosmic Ray Conference\n  (ICRC2023)","journal-ref":"PoS(ICRC2023)1547","doi":"10.22323/1.444.1547","report-no":null,"categories":"astro-ph.HE hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For over 15 years the Fermi Large Area Telescope (Fermi-LAT) has been\nmonitoring the entire high-energy gamma-ray sky, providing the best sampled 0.1\n-- $>1$ TeV photons to this day. As a result, the Fermi-LAT has been serving\nthe time-domain and multi-messenger community as the main source of gamma-ray\nactivity alerts. All of this makes the Fermi-LAT a key instrument towards\nunderstanding the underlying physics behind the most extreme objects in the\nuniverse. However, generating mission-long LAT light curves can be very\ncomputationally expensive. The Fermi-LAT light curve repository (LCR) tackles\nthis issue. The LCR is a public library of gamma-ray light curves for 1525\nFermi-LAT sources deemed variable in the 4FGL-DR2 catalog. The repository\nconsists of light curves on timescales of days, weeks, and months, generated\nthrough a full-likelihood unbinned analysis of the source and surrounding\nregion, providing flux and photon index measurements for each time interval.\nHosted at NASA's FSSC, the library provides users with access to this\ncontinually updated light curve data, further serving as a resource to the\ntime-domain and multi-messenger communities.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:03:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Valverde","Janeth","","for\n  the Fermi-LAT Collaboration"],["Kocevski","D.","","for\n  the Fermi-LAT Collaboration"],["Negro","M.","","for\n  the Fermi-LAT Collaboration"],["Garrappa","S.","","for\n  the Fermi-LAT Collaboration"],["Brill","A.","","for\n  the Fermi-LAT Collaboration"]]}
{"id":"2308.12710","submitter":"Hechang Lei","authors":"Shaohua Yan, Shangjie Tian, Yang Fu, Fanyu Meng, Zhiteng Li, Shouguo\n  Wang, Xiao Zhang and Hechang Lei","title":"Highly efficient room-temperature nonvolatile magnetic switching by\n  current in Fe3GaTe2 thin flakes","comments":"18 page2, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Effectively tuning magnetic state by using current is essential for novel\nspintronic devices. Magnetic van der Waals (vdW) materials have shown superior\nproperties for the applications of magnetic information storage based on the\nefficient spin torque effect. However, for most of known vdW ferromagnets, the\nferromagnetic transition temperatures lower than room temperature strongly\nimpede their applications and the room-temperature vdW spintronic device with\nlow energy consumption is still a long-sought goal. Here, we realize the highly\nefficient room-temperature nonvolatile magnetic switching by current in a\nsingle-material device based on vdW ferromagnet Fe3GaTe2. Moreover, the\nswitching current density and power dissipation are about 300 and 60000 times\nsmaller than conventional spin-orbit-torque devices of magnet/heavymetal\nheterostructures. These findings make an important progress on the applications\nof magnetic vdW materials in the fields of spintronics and magnetic information\nstorage.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:06:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yan","Shaohua",""],["Tian","Shangjie",""],["Fu","Yang",""],["Meng","Fanyu",""],["Li","Zhiteng",""],["Wang","Shouguo",""],["Zhang","Xiao",""],["Lei","Hechang",""]]}
{"id":"2308.12711","submitter":"Yue Wang","authors":"Yue Wang, Xinrui Wang, Juntao Li, Jinxiong Chang, Qishen Zhang,\n  Zhongyi Liu, Guannan Zhang, Min Zhang","title":"Harnessing the Power of David against Goliath: Exploring Instruction\n  Data Generation without Using Closed-Source Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Instruction tuning is instrumental in enabling Large Language Models~(LLMs)\nto follow user instructions to complete various open-domain tasks. The success\nof instruction tuning depends on the availability of high-quality instruction\ndata. Owing to the exorbitant cost and substandard quality of human annotation,\nrecent works have been deeply engaged in the exploration of the utilization of\npowerful closed-source models to generate instruction data automatically.\nHowever, these methods carry potential risks arising from the usage\nrequirements of powerful closed-source models, which strictly forbid the\nutilization of their outputs to develop machine learning models. To deal with\nthis problem, in this work, we explore alternative approaches to generate\nhigh-quality instruction data that do not rely on closed-source models. Our\nexploration includes an investigation of various existing instruction\ngeneration methods, culminating in the integration of the most efficient\nvariant with two novel strategies to enhance the quality further. Evaluation\nresults from two benchmarks and the GPT-4 model demonstrate the effectiveness\nof our generated instruction data, which can outperform Alpaca, a method\nreliant on closed-source models. We hope that more progress can be achieved in\ngenerating high-quality instruction data without using closed-source models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:07:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Yue",""],["Wang","Xinrui",""],["Li","Juntao",""],["Chang","Jinxiong",""],["Zhang","Qishen",""],["Liu","Zhongyi",""],["Zhang","Guannan",""],["Zhang","Min",""]]}
{"id":"2308.12712","submitter":"Qingchun Yang","authors":"Shizhou Zhang, Qingchun Yang, De Cheng, Yinghui Xing, Guoqiang Liang,\n  Peng Wang, Yanning Zhang","title":"Ground-to-Aerial Person Search: Benchmark Dataset and Approach","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612105","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we construct a large-scale dataset for Ground-to-Aerial Person\nSearch, named G2APS, which contains 31,770 images of 260,559 annotated bounding\nboxes for 2,644 identities appearing in both of the UAVs and ground\nsurveillance cameras. To our knowledge, this is the first dataset for\ncross-platform intelligent surveillance applications, where the UAVs could work\nas a powerful complement for the ground surveillance cameras. To more\nrealistically simulate the actual cross-platform Ground-to-Aerial surveillance\nscenarios, the surveillance cameras are fixed about 2 meters above the ground,\nwhile the UAVs capture videos of persons at different location, with a variety\nof view-angles, flight attitudes and flight modes. Therefore, the dataset has\nthe following unique characteristics: 1) drastic view-angle changes between\nquery and gallery person images from cross-platform cameras; 2) diverse\nresolutions, poses and views of the person images under 9 rich real-world\nscenarios. On basis of the G2APS benchmark dataset, we demonstrate detailed\nanalysis about current two-step and end-to-end person search methods, and\nfurther propose a simple yet effective knowledge distillation scheme on the\nhead of the ReID network, which achieves state-of-the-art performances on both\nof the G2APS and the previous two public person search datasets, i.e., PRW and\nCUHK-SYSU. The dataset and source code available on\n\\url{https://github.com/yqc123456/HKD_for_person_search}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:11:26 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Shizhou",""],["Yang","Qingchun",""],["Cheng","De",""],["Xing","Yinghui",""],["Liang","Guoqiang",""],["Wang","Peng",""],["Zhang","Yanning",""]]}
{"id":"2308.12713","submitter":"Enrico Junior Schioppa","authors":"Luca Abrahao, Francesco Coradeschi, Antonia Micol Frassino, Thiago\n  Guerreiro, Jennifer Rittenhouse West and Enrico Junior Schioppa","title":"The quantum optics of gravitational waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By utilizing quantum optics techniques, we examine the characteristics of a\nquantum gravitational wave (GW) signature at interferometers. In particular, we\nstudy the problem by analyzing the equations of motion of a GW interacting with\nan idealized interferometer. Using this method, we reconstruct the classical GW\nsignal from a representation of the quantum version of an almost classical\nmonochromatic wave (a single-mode coherent state), then we discuss the\nexperimental signatures of some specific, more general quantum states. We\ncalculate the observables that could be used at future interferometers to probe\npossible quantum states carried by the gravitational waves.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:17:47 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 12:29:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Abrahao","Luca",""],["Coradeschi","Francesco",""],["Frassino","Antonia Micol",""],["Guerreiro","Thiago",""],["West","Jennifer Rittenhouse",""],["Schioppa","Enrico Junior",""]]}
{"id":"2308.12714","submitter":"Bin Wang","authors":"Bin Wang, Fan Wu, Xiao Han, Jiahui Peng, Huaping Zhong, Pan Zhang,\n  Xiaoyi Dong, Weijia Li, Wei Li, Jiaqi Wang, Conghui He","title":"VIGC: Visual Instruction Generation and Correction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The integration of visual encoders and large language models (LLMs) has\ndriven recent progress in multimodal large language models (MLLMs). However,\nthe scarcity of high-quality instruction-tuning data for vision-language tasks\nremains a challenge. The current leading paradigm, such as LLaVA, relies on\nlanguage-only GPT-4 to generate data, which requires pre-annotated image\ncaptions and detection bounding boxes, suffering from understanding image\ndetails. A practical solution to this problem would be to utilize the available\nmultimodal large language models (MLLMs) to generate instruction data for\nvision-language tasks. However, it's worth noting that the currently accessible\nMLLMs are not as powerful as their LLM counterparts, as they tend to produce\ninadequate responses and generate false information. As a solution for\naddressing the current issue, this paper proposes the Visual Instruction\nGeneration and Correction (VIGC) framework that enables multimodal large\nlanguage models to generate instruction-tuning data and progressively enhance\nits quality on-the-fly. Specifically, Visual Instruction Generation (VIG)\nguides the vision-language model to generate diverse instruction-tuning data.\nTo ensure generation quality, Visual Instruction Correction (VIC) adopts an\niterative update mechanism to correct any inaccuracies in data produced by VIG,\neffectively reducing the risk of hallucination. Leveraging the diverse,\nhigh-quality data generated by VIGC, we finetune mainstream models and validate\ndata quality based on various evaluations. Experimental results demonstrate\nthat VIGC not only compensates for the shortcomings of language-only data\ngeneration methods, but also effectively enhances the benchmark performance.\nThe models, datasets, and code will be made publicly available.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:21:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Bin",""],["Wu","Fan",""],["Han","Xiao",""],["Peng","Jiahui",""],["Zhong","Huaping",""],["Zhang","Pan",""],["Dong","Xiaoyi",""],["Li","Weijia",""],["Li","Wei",""],["Wang","Jiaqi",""],["He","Conghui",""]]}
{"id":"2308.12715","submitter":"Selcuk Bilmis","authors":"T.M.Aliev, S.Bilmis, M.Savci","title":"Analysis of the strong decays of SU(3) partners of the $\\Omega(2012)$\n  baryon","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We estimate the coupling constants and decay widths of the $SU(3)$ partners\nof the $\\Omega(2012)$ hyperon, as discovered by the BELLE Collaboration, using\nthe light cone sum rules method. Our study includes a comparison of the\nobtained results for relevant decay widths with those derived within the\nframework of the flavor $SU(3)$ analysis. We observe a good agreement between\nthe predictions of both approaches. The results we obtain for the branching\nratio can provide helpful insights for determining the nature of the $SU(3)$\npartners of the $\\Omega(2012)$ baryon.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:23:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Aliev","T. M.",""],["Bilmis","S.",""],["Savci","M.",""]]}
{"id":"2308.12716","submitter":"Tarik Sahin","authors":"T. Sahin, M. von Danwitz, A. Popp","title":"Solving Forward and Inverse Problems of Contact Mechanics using\n  Physics-Informed Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.LG cs.NA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper explores the ability of physics-informed neural networks (PINNs)\nto solve forward and inverse problems of contact mechanics for small\ndeformation elasticity. We deploy PINNs in a mixed-variable formulation\nenhanced by output transformation to enforce Dirichlet and Neumann boundary\nconditions as hard constraints. Inequality constraints of contact problems,\nnamely Karush-Kuhn-Tucker (KKT) type conditions, are enforced as soft\nconstraints by incorporating them into the loss function during network\ntraining. To formulate the loss function contribution of KKT constraints,\nexisting approaches applied to elastoplasticity problems are investigated and\nwe explore a nonlinear complementarity problem (NCP) function, namely\nFischer-Burmeister, which possesses advantageous characteristics in terms of\noptimization. Based on the Hertzian contact problem, we show that PINNs can\nserve as pure partial differential equation (PDE) solver, as data-enhanced\nforward model, as inverse solver for parameter identification, and as\nfast-to-evaluate surrogate model. Furthermore, we demonstrate the importance of\nchoosing proper hyperparameters, e.g. loss weights, and a combination of Adam\nand L-BFGS-B optimizers aiming for better results in terms of accuracy and\ntraining time.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:31:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sahin","T.",""],["von Danwitz","M.",""],["Popp","A.",""]]}
{"id":"2308.12717","submitter":"Andreas Savin","authors":"Jacek Karwowski, Andreas Savin","title":"Erfonium: A Hooke Atom with Soft Interaction Potential","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Properties of erfonium, a Hooke atom with the Coulomb interaction potential\n$1/r$ replaced by a non-singular $\\text{erf}(\\mu r)/r$ potential are\ninvestigated. The structure of the Hooke atom potential and properties of its\nenergy spectrum, relative to the ones of the spherical harmonic oscillator and\nof harmonium, are analyzed. It is shown, that at a certain value of $\\mu$ the\nsystem changes its behavior from a harmonium-like regime to a\nharmonic-oscillator-like regime.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:31:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Karwowski","Jacek",""],["Savin","Andreas",""]]}
{"id":"2308.12718","submitter":"Masaki J.S. Yang","authors":"Masaki J. S. Yang","title":"Chiral perturbative reconstruction of the complex orthogonal matrix $R$\n  in Casas--Ibarra parameterization","comments":"6 pages","journal-ref":null,"doi":null,"report-no":"STUPP-23-266","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this letter, we perform a chiral perturbative analysis by singular values\n$m_{Di}$ of the Dirac mass matrix $m_{D}$ for the type-I seesaw mechanism. In\nthe basis where $m_{D} = V m_{D}^{\\rm diag} U^{\\dagger}$ is diagonal, the mass\nmatrix of right-handed neutrinos $M_{R}$ is written by $M_{R} = m_{D}^{\\rm\ndiag} m^{-1} m_{D}^{\\rm diag}$. If the mass matrix of light neutrinos $m$ has\nan inverse matrix and the singular values $m_{Di}$ are hierarchical ($m_{D1}\n\\ll m_{D2} \\ll m_{D3}$), the singular values $M_{i}$ and diagonalization matrix\n$U$ of $M_{R}$ are obtained perturbatively.\n  By treating $m_{Di}$ and $V$ as input parameters, $m_{D}$ is represented in\nthe basis where $M_{R}$ is diagonal, and we perturbatively derive the\northogonal matrix $R$ in Casas--Ibarra parameterization. As a result, $R$ is\nindependent of $m_{Di}$ in the leading order, and it is reconstructed as an\northonormal basis $R_{i1} \\simeq \\pm \\sqrt{m_{i} / m_{11} } (U_{\\rm MNS}^{T}\nV^{*})_{i1} \\, ,\n  R_{i2} \\simeq \\pm \\epsilon_{ijk} R_{j3} R_{k1} \\, ,\n  R_{i3} \\simeq \\pm {(U_{\\rm MNS}^{\\dagger} V)_{i3} / \\sqrt {m_{i}\n(m^{-1})_{33}} } $. Here, $m_{i}$ is the masses of light neutrinos and $\\pm$\ndenotes the independent degree of freedom for each column vector.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:32:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Masaki J. S.",""]]}
{"id":"2308.12719","submitter":"Andreas B\\\"auerle","authors":"Andreas B\\\"auerle","title":"Sharp volume and multiplicity bounds for Fano simplices","comments":"27 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present sharp upper bounds on the volume, Mahler volume and multiplicity\nfor Fano simplices depending on the dimension and Gorenstein index. These\nbounds rely on the interplay between lattice simplices and unit fraction\npartitions. Moreover, we present an efficient procedure for explicitly\nclassifying Fano simplicies of any dimension and Gorenstein index and we carry\nout the classification up to dimension four for various Gorenstein indices.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:33:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["B\u00e4uerle","Andreas",""]]}
{"id":"2308.12720","submitter":"Mario Javier Rinc\\'on","authors":"M. J. Rinc\\'on, A. Amarloo, M. Reclari, X. I. A. Yang, M. Abkar","title":"Progressive augmentation of Reynolds stress tensor models for secondary\n  flow prediction by computational fluid dynamics driven surrogate optimisation","comments":"23 pages, 20 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalisability and the consistency of the a posteriori results are the most\ncritical points of view regarding data-driven turbulence models. This study\npresents a progressive improvement of turbulence models using simulation-driven\nsurrogate optimisation based on Kriging. We aim for the augmentation of\nsecondary-flow reconstruction capability in a linear eddy-viscosity model\nwithout violating its original performance on canonical cases e.g. channel\nflow. Explicit algebraic Reynolds stress correction models (EARSCMs) for\n$k-\\omega$ SST turbulence model are obtained to predict the secondary flow\nwhich the standard model fails to capture. The optimisation of the models is\nachieved by a multi-objective approach based on duct flow quantities, and\nnumerical verification of the developed models is performed for various test\ncases. The results of testing new models on channel flow cases guarantee that\nnew models preserve the performance of the original $k-\\omega$ SST model.\nRegarding the generalisability of the new models, results of unseen test cases\ndemonstrate a significant improvement in the prediction of secondary flows and\nstreamwise velocity. These results highlight the potential of the progressive\napproach to enhance the performance of data-driven turbulence models for fluid\nflow simulation while preserving the robustness and stability of the solver.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:37:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rinc\u00f3n","M. J.",""],["Amarloo","A.",""],["Reclari","M.",""],["Yang","X. I. A.",""],["Abkar","M.",""]]}
{"id":"2308.12721","submitter":"Artem Bohdan","authors":"Artem Bohdan, Anabella Araudo, Allard Jan van Marle, Fabien Casse,\n  Alexandre Marcowith","title":"Using PIC and PIC-MHD to investigate cosmic ray acceleration in mildly\n  relativistic shocks","comments":"38th International Cosmic Ray Conference, Proceedings of Science\n  (ICRC2023) 543","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Astrophysical shocks create cosmic rays by accelerating charged particles to\nrelativistic speeds. However, the relative contribution of various types of\nshocks to the cosmic ray spectrum is still the subject of ongoing debate.\nNumerical studies have shown that in the non-relativistic regime, oblique\nshocks are capable of accelerating cosmic rays, depending on the Alfv\\'enic\nMach number of the shock. We now seek to extend this study into the mildly\nrelativistic regime. In this case, dependence of the ion reflection rate on the\nshock obliquity is different compared to the nonrelativistic regime. Faster\nrelativistic shocks are perpendicular for the majority of shock obliquity\nangles therefore their ability to initialize efficient DSA is limited. We\ndefine the ion injection rate using fully kinetic PIC simulation where we\nfollow the formation of the shock and determine the fraction of ions that gets\ninvolved into formation of the shock precursor in the mildly relativistic\nregime covering a Lorentz factor range from 1 to 3. Then, with this result, we\nuse a combined PIC-MHD method to model the large-scale evolution of the shock\nwith the ion injection recipe dependent on the local shock obliquity. This\nmethodology accounts for the influence of the self-generated or pre-existing\nupstream turbulence on the shock obliquity which allows study substantially\nlarger and longer simulations compared to classical hybrid techniques.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:40:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bohdan","Artem",""],["Araudo","Anabella",""],["van Marle","Allard Jan",""],["Casse","Fabien",""],["Marcowith","Alexandre",""]]}
{"id":"2308.12722","submitter":"Ruman Moulik","authors":"Ruman Moulik, Ankita Phutela, Sajjan Sheoran, Saswata Bhattacharya","title":"Accelerated Neural Network Training through Dimensionality Reduction for\n  High-Throughput Screening of Topological Materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine Learning facilitates building a large variety of models, starting\nfrom elementary linear regression models to very complex neural networks.\nNeural networks are currently limited by the size of data provided and the huge\ncomputational cost of training a model. This is especially problematic when\ndealing with a large set of features without much prior knowledge of how good\nor bad each individual feature is. We try tackling the problem using\ndimensionality reduction algorithms to construct more meaningful features. We\nalso compare the accuracy and training times of raw data and data transformed\nafter dimensionality reduction to deduce a sufficient number of dimensions\nwithout sacrificing accuracy. The indicated estimation is done using a lighter\ndecision tree-based algorithm, AdaBoost, as it trains faster than neural\nnetworks. We have chosen the data from an online database of topological\nmaterials, Materiae. Our final goal is to construct a model to predict the\ntopological properties of new materials from elementary properties.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:51:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Moulik","Ruman",""],["Phutela","Ankita",""],["Sheoran","Sajjan",""],["Bhattacharya","Saswata",""]]}
{"id":"2308.12723","submitter":"Zhifei Li","authors":"Zhifei Li, Yan Liang, and Linfeng Xu","title":"Distributed Extended Object Tracking Using Coupled Velocity Model from\n  WLS Perspective","comments":"Corrected Version","journal-ref":"Published by IEEE Transactions on Signal and Information\n  Processing over Networks,2022","doi":"10.1109/TSIPN.2022.3176113","report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study proposes a coupled velocity model (CVM) that establishes the\nrelation between the orientation and velocity using their correlation, avoiding\nthat the existing extended object tracking (EOT) models treat them as two\nindependent quantities. As a result, CVM detects the mismatch between the prior\ndynamic model and actual motion pattern to correct the filtering gain, and\nsimultaneously becomes a nonlinear and state-coupled model with multiplicative\nnoise. The study considers CVM to design a feasible distributed weighted least\nsquares (WLS) filter. The WLS criterion requires a linear state-space model\ncontaining only additive noise about the estimated state. To meet the\nrequirement, we derive such two separate pseudo-linearized models by using the\nfirst-order Taylor series expansion. The separation is merely in form, and the\nestimates of interested states are embedded as parameters into each other's\nmodel, which implies that their interdependency is still preserved in the\niterative operation of two linear filters. With the two models, we first\npropose a centralized WLS filter by converting the measurements from all nodes\ninto a summation form. Then, a distributed consensus scheme, which directly\nperforms an inner iteration on the priors across different nodes, is proposed\nto incorporate the cross-covariances between nodes. Under the consensus scheme,\na distributed WLS filter over a realistic network with ``naive'' node is\ndeveloped by proper weighting of the priors and measurements. Finally, the\nperformance of proposed filters in terms of accuracy, robustness, and\nconsistency is testified under different prior situations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 11:56:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Zhifei",""],["Liang","Yan",""],["Xu","Linfeng",""]]}
{"id":"2308.12724","submitter":"Daniel Holmberg","authors":"Daniel Holmberg, Dejan Golubovic, Henning Kirschenmann","title":"Jet energy calibration with deep learning as a Kubeflow pipeline","comments":"20 pages, 10 figures. Code repository available via\n  https://zenodo.org/record/7799179","journal-ref":"Computing and Software for Big Science 7 (2023) 9","doi":"10.1007/s41781-023-00103-y","report-no":null,"categories":"hep-ex hep-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precise measurements of the energy of jets emerging from particle collisions\nat the LHC are essential for a vast majority of physics searches at the CMS\nexperiment. In this study, we leverage well-established deep learning models\nfor point clouds and CMS open data to improve the energy calibration of\nparticle jets. To enable production-ready machine learning based jet energy\ncalibration an end-to-end pipeline is built on the Kubeflow cloud platform. The\npipeline allowed us to scale up our hyperparameter tuning experiments on cloud\nresources, and serve optimal models as REST endpoints. We present the results\nof the parameter tuning process and analyze the performance of the served\nmodels in terms of inference time and overhead, providing insights for future\nwork in this direction. The study also demonstrates improvements in both flavor\ndependence and resolution of the energy response when compared to the standard\njet energy corrections baseline.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:02:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Holmberg","Daniel",""],["Golubovic","Dejan",""],["Kirschenmann","Henning",""]]}
{"id":"2308.12725","submitter":"Youngsuk Mun","authors":"Youngsuk Mun, Seung ki Baek","title":"Second-order effects of mutation in continuous indirect reciprocity","comments":"30 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have developed a continuous model of indirect reciprocity and thereby\ninvestigated effects of mutation in assessment rules. Within this continuous\nframework, the difference between the resident and mutant norms is treated as a\nsmall parameter for perturbative expansion. Unfortunately, the linear-order\nexpansion leads to singularity when applied to the leading eight, the\ncooperative norms that resist invasion of another norm having a different\nbehavioral rule. For this reason, this study aims at a second-order analysis\nfor the effects of mutation when the resident norm is one of the leading eight.\nWe approximately solve a set of coupled nonlinear equations using Newton's\nmethod, and the solution is compared with Monte Carlo calculations. The\nsolution indicates how the characteristics of a social norm can shape the\nresponse to its close variants appearing through mutation. Specifically, it\nshows that the resident norm should allow one to refuse to cooperate toward the\nill-reputed, while regarding cooperation between two ill-reputed players as\ngood, so as to reduce the impact of mutation.This study enhances our analytic\nunderstanding on the organizing principles of successful social norms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:05:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mun","Youngsuk",""],["Baek","Seung ki",""]]}
{"id":"2308.12726","submitter":"Masoud Rahimi","authors":"Masoud Rahimi, Hadi Moradi, Abdol-hossein Vahabie, Hamed Kebriaei","title":"Continuous Reinforcement Learning-based Dynamic Difficulty Adjustment in\n  a Visual Working Memory Game","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic Difficulty Adjustment (DDA) is a viable approach to enhance a\nplayer's experience in video games. Recently, Reinforcement Learning (RL)\nmethods have been employed for DDA in non-competitive games; nevertheless, they\nrely solely on discrete state-action space with a small search space. In this\npaper, we propose a continuous RL-based DDA methodology for a visual working\nmemory (VWM) game to handle the complex search space for the difficulty of\nmemorization. The proposed RL-based DDA tailors game difficulty based on the\nplayer's score and game difficulty in the last trial. We defined a continuous\nmetric for the difficulty of memorization. Then, we consider the task\ndifficulty and the vector of difficulty-score as the RL's action and state,\nrespectively. We evaluated the proposed method through a within-subject\nexperiment involving 52 subjects. The proposed approach was compared with two\nrule-based difficulty adjustment methods in terms of player's score and game\nexperience measured by a questionnaire. The proposed RL-based approach resulted\nin a significantly better game experience in terms of competence, tension, and\nnegative and positive affect. Players also achieved higher scores and win\nrates. Furthermore, the proposed RL-based DDA led to a significantly less\ndecline in the score in a 20-trial session.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:05:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rahimi","Masoud",""],["Moradi","Hadi",""],["Vahabie","Abdol-hossein",""],["Kebriaei","Hamed",""]]}
{"id":"2308.12727","submitter":"Oleg Rogov Y.","authors":"Razan Dibo and Andrey Galichin and Pavel Astashev and Dmitry V. Dylov\n  and Oleg Y. Rogov","title":"DeepLOC: Deep Learning-based Bone Pathology Localization and\n  Classification in Wrist X-ray Images","comments":"AIST-2023 accepted paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, computer-aided diagnosis systems have shown great potential\nin assisting radiologists with accurate and efficient medical image analysis.\nThis paper presents a novel approach for bone pathology localization and\nclassification in wrist X-ray images using a combination of YOLO (You Only Look\nOnce) and the Shifted Window Transformer (Swin) with a newly proposed block.\nThe proposed methodology addresses two critical challenges in wrist X-ray\nanalysis: accurate localization of bone pathologies and precise classification\nof abnormalities. The YOLO framework is employed to detect and localize bone\npathologies, leveraging its real-time object detection capabilities.\nAdditionally, the Swin, a transformer-based module, is utilized to extract\ncontextual information from the localized regions of interest (ROIs) for\naccurate classification.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:06:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dibo","Razan",""],["Galichin","Andrey",""],["Astashev","Pavel",""],["Dylov","Dmitry V.",""],["Rogov","Oleg Y.",""]]}
{"id":"2308.12728","submitter":"Kazuhiro Kuwae","authors":"Syota Esaki, Zi Jian Xu and Kazuhiro Kuwae","title":"Riesz transforms for Dirichlet spaces tamed by distributional curvature\n  lower bounds","comments":"68 pages. arXiv admin note: text overlap with arXiv:2307.12514; text\n  overlap with arXiv:2108.12374 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The notion of tamed Dirichlet space was proposed by Erbar, Rigoni, Sturm and\nTamanini as a Dirichlet space having a weak form of Bakry-\\'Emery curvature\nlower bounds in distribution sense. After their work, Braun established a\nvector calculus for it, in particular, the space of $L^2$-normed\n$L^{\\infty}$-module describing vector fields, $1$-forms, Hessian in\n$L^2$-sense. In this framework, we establish the Littlewood-Paley-Stein\ninequality for $1$-forms as an element of $L^p$-cotangent bundles and\nboundedness of Riesz transforms, which partially solves the problem raised by\nKawabi-Miyokawa.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:07:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Esaki","Syota",""],["Xu","Zi Jian",""],["Kuwae","Kazuhiro",""]]}
{"id":"2308.12729","submitter":"Shijie Zhang","authors":"Shijie Zhang, Xin Yan, Xuejiao Yang, Binfeng Jia, Shuangyang Wang","title":"Out of the Box Thinking: Improving Customer Lifetime Value Modelling via\n  Expert Routing and Game Whale Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Customer lifetime value (LTV) prediction is essential for mobile game\npublishers trying to optimize the advertising investment for each user\nacquisition based on the estimated worth. In mobile games, deploying\nmicrotransactions is a simple yet effective monetization strategy, which\nattracts a tiny group of game whales who splurge on in-game purchases. The\npresence of such game whales may impede the practicality of existing LTV\nprediction models, since game whales' purchase behaviours always exhibit varied\ndistribution from general users. Consequently, identifying game whales can open\nup new opportunities to improve the accuracy of LTV prediction models. However,\nlittle attention has been paid to applying game whale detection in LTV\nprediction, and existing works are mainly specialized for the long-term LTV\nprediction with the assumption that the high-quality user features are\navailable, which is not applicable in the UA stage. In this paper, we propose\nExpLTV, a novel multi-task framework to perform LTV prediction and game whale\ndetection in a unified way. In ExpLTV, we first innovatively design a deep\nneural network-based game whale detector that can not only infer the intrinsic\norder in accordance with monetary value, but also precisely identify high\nspenders (i.e., game whales) and low spenders. Then, by treating the game whale\ndetector as a gating network to decide the different mixture patterns of LTV\nexperts assembling, we can thoroughly leverage the shared information and\nscenario-specific information (i.e., game whales modelling and low spenders\nmodelling). Finally, instead of separately designing a purchase rate estimator\nfor two tasks, we design a shared estimator that can preserve the inner task\nrelationships. The superiority of ExpLTV is further validated via extensive\nexperiments on three industrial datasets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:08:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Shijie",""],["Yan","Xin",""],["Yang","Xuejiao",""],["Jia","Binfeng",""],["Wang","Shuangyang",""]]}
{"id":"2308.12730","submitter":"Helge Maakestad Dr.","authors":"Helge \\\"Oystein Maakestad","title":"A virtual Clebsch-Gordan formula for $\\operatorname{SL}(2,\\mathbb{Z})$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.GR math.RT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The aim of the paper is to study the group scheme $G:=\\operatorname{SL}(2,\nA)$, it's comodules and a virtual Clebsch-Gordan formula. Here $A$ is a field\nor a Dedekind domain. If $V:=A\\{e_1,e_2\\}$ is the free rank $2$ module on $A$\nand if we give $V$ the \"standard\" structure as comodule on $G$, we may form the\nsymmetric powers $\\operatorname{Sym}^n(V)$ for $n \\geq 1$ an integer. If $A$ is\na field of characteristic zero, there is a direct sum decomposition of the\ntensor product $\\operatorname{Sym}^n(V) \\otimes \\operatorname{Sym}^m(V)$ into\nirreducible $G$-comodules and the main aim of the paper is to investigate if\nsimilar results hold over the ring of integers or a more general commutative\nring such as a Dedekind domain. For $A:=\\mathbb{Z}$ we will find that there is\nfor any pair of integers $1 \\leq n \\leq m$ a finite filtration $F_i \\subseteq\n\\operatorname{Sym}^n(V) \\otimes \\operatorname{Sym}^m(V)$ with $F_i/F_{i+1}\n\\cong \\operatorname{Sym}^{n+m-2i}(V)$ for $i=0,..,n$. This implies there is a\nversion of the Clebsch-Gordan formula valid in the Grothendieck group of\ncoherent comodules on $G$. We moreover prove that the group scheme $G$ is not\n\"completely reducible\" in the sense that there are sujections $\\phi: V\n\\rightarrow W$ of finite rank comodules on $G$ that do not split. We moreover\nprove that the comodule $\\operatorname{Sym}^n(V)$ has an infinite set of strict\nsub-comdoules, hence $\\operatorname{Sym}^n(V)$ is not irreducible over\n$A:=\\mathbb{Z}$. When $A:=k$ is a field it follows $\\operatorname{Sym}^n(V)$ is\nan irreducible comodule for any $n \\geq 1$. The filtration $F_i$ pulls back to\na filtration of $G_k:=\\operatorname{SL}(2,k)$-comodules $F(k)_i \\subseteq\n\\operatorname{Sym}^n(V_k)\\otimes\\operatorname{Sym}^m(V_k)$ for any commutative\nring $k$. Hence we get a virtual Clebsch-Gordan formula for any commutative\nring $k$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:10:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maakestad","Helge \u00d6ystein",""]]}
{"id":"2308.12731","submitter":"Karsten Brogaard","authors":"K. Brogaard, T. Arentoft, A. Miglio, G. Casali, J. S. Thomsen, M.\n  Tailo, J. Montalb\\'an, V. Grisoni, E. Willett, A. Stokholm, F. Grundahl, D.\n  Stello and E. L. Sandquist","title":"An asteroseismic age estimate of the open cluster NGC 6866 using Kepler\n  and Gaia","comments":"Accepted on 21/08/2023 for publication in Section 7. Stellar\n  structure and evolution of Astronomy & Astrophysics. 20 Pages, 11 Figures +\n  appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Asteroseismology of solar-like oscillations in giant stars allow the\nderivation of their masses and radii. For members of open clusters this allows\nan age estimate of the cluster which should be identical to the age estimate\nfrom the colour-magnitude diagram, but independent of the uncertainties that\nare present for that type of analysis. Thus, a more precise and accurate age\nestimate can be obtained. We aim to measure asteroseismic properties of\noscillating giant members of the open cluster NGC 6866 and utilise these for a\ncluster age estimate. Model comparisons allow constraints on the stellar\nphysics, and here we investigate the efficiency of convective-core overshoot\nand effects of rotation during the main-sequence, which has a significant\ninfluence on the age for these relatively massive giants. We identify six giant\nmembers of NGC 6866 and derive asteroseismic measurements for five of them.\nThis constrains the convective-core overshoot and enables a more precise and\naccurate age estimate than previously possible. Asteroseismology establishes\nthe helium-core burning evolutionary phase for the giants, which have a mean\nmass of 2.8 $M_{\\odot}$. Their radii are significantly smaller than predicted\nby current 1D stellar models unless the amount of convective-core overshoot on\nthe main sequence is reduced to $\\alpha_{ov} \\leq 0.1 H_p$ in the\nstep-overshoot description. Our measurements also suggest that rotation has\naffected the evolution of the stars in NGC 6866 in a way that is consistent\nwith 3D simulations but not with current 1D stellar models. The cluster age is\nestimated to be 0.43 $\\pm$ 0.05 Gyr, significantly younger and more precise\nthan most previous estimates. We derive a precise cluster age while\nconstraining convective-core overshooting and effects of rotation in the\nmodels. We uncover potential biases for automated age estimates of helium-core\nburning stars.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:22:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Brogaard","K.",""],["Arentoft","T.",""],["Miglio","A.",""],["Casali","G.",""],["Thomsen","J. S.",""],["Tailo","M.",""],["Montalb\u00e1n","J.",""],["Grisoni","V.",""],["Willett","E.",""],["Stokholm","A.",""],["Grundahl","F.",""],["Stello","D.",""],["Sandquist","E. L.",""]]}
{"id":"2308.12732","submitter":"Micha\\\"el Dell'aiera","authors":"Micha\\\"el Dell'aiera, Mika\\\"el Jacquemont, Thomas Vuillaume, Alexandre\n  Benoit","title":"Deep unsupervised domain adaptation applied to the Cherenkov Telescope\n  Array Large-Sized Telescope","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cherenkov Telescope Array is the next generation of observatory using\nimaging air Cherenkov technique for very-high-energy gamma-ray astronomy. Its\nfirst prototype telescope is operational on-site at La Palma and its data\nacquisitions allowed to detect known sources, study new ones, and to confirm\nthe performance expectations. The application of deep learning for the\nreconstruction of the incident particle physical properties (energy, direction\nof arrival and type) have shown promising results when conducted on\nsimulations. Nevertheless, its application to real observational data is\nchallenging because deep-learning-based models can suffer from domain shifts.\nIn the present article, we address this issue by implementing domain adaptation\nmethods into state-of-art deep learning models for Imaging Atmospheric\nCherenkov Telescopes event reconstruction to reduce the domain discrepancies,\nand we shed light on the gain in performance that they bring along.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:25:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dell'aiera","Micha\u00ebl",""],["Jacquemont","Mika\u00ebl",""],["Vuillaume","Thomas",""],["Benoit","Alexandre",""]]}
{"id":"2308.12733","submitter":"Chiara Bellenghi","authors":"Chiara Bellenghi, Martina Karl, Martin Wolf (for the IceCube\n  Collaboration)","title":"Extending SkyLLH software for neutrino point source analyses with 10\n  years of IceCube public data","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1061","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Searching for the sources of high-energy cosmic particles requires\nsophisticated analysis techniques, frequently involving hypothesis tests with\nunbinned log-likelihood (LLH) functions. SkyLLH is an open-source, Python-based\nsoftware tool to build these LLH functions and perform likelihood-ratio tests.\nWe present a new easy-to-use and modular extension of SkyLLH that allows the\nuser to perform neutrino point source searches in the entire sky using ten\nyears of IceCube public data. To guide the user, SkyLLH provides tutorials\nshowing how to analyze the experimental data and calculate useful statistical\nquantities. Here we describe the details of the analysis workflow and\nillustrate some of the possible methods to work with the IceCube public\ndataset. Additionally, we show that SkyLLH can reproduce the results from a\nprevious IceCube publication that used the public data release. We obtain a\nsimilar local significance for the neutrino emission from a list of candidate\nsources within a maximum shift of 0.5$\\sigma$. Finally, the measured neutrino\nflux from the most significant source candidate, NGC 1068, shows substantial\nagreement with the previously published result.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:25:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bellenghi","Chiara","","for the IceCube\n  Collaboration"],["Karl","Martina","","for the IceCube\n  Collaboration"],["Wolf","Martin","","for the IceCube\n  Collaboration"]]}
{"id":"2308.12734","submitter":"Jordan J. Bird","authors":"Jordan J. Bird, Ahmad Lotfi","title":"Real-time Detection of AI-Generated Speech for DeepFake Voice Conversion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL cs.HC cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There are growing implications surrounding generative AI in the speech domain\nthat enable voice cloning and real-time voice conversion from one individual to\nanother. This technology poses a significant ethical threat and could lead to\nbreaches of privacy and misrepresentation, thus there is an urgent need for\nreal-time detection of AI-generated speech for DeepFake Voice Conversion. To\naddress the above emerging issues, the DEEP-VOICE dataset is generated in this\nstudy, comprised of real human speech from eight well-known figures and their\nspeech converted to one another using Retrieval-based Voice Conversion.\nPresenting as a binary classification problem of whether the speech is real or\nAI-generated, statistical analysis of temporal audio features through t-testing\nreveals that there are significantly different distributions. Hyperparameter\noptimisation is implemented for machine learning models to identify the source\nof speech. Following the training of 208 individual machine learning models\nover 10-fold cross validation, it is found that the Extreme Gradient Boosting\nmodel can achieve an average classification accuracy of 99.3% and can classify\nspeech in real-time, at around 0.004 milliseconds given one second of speech.\nAll data generated for this study is released publicly for future research on\nAI speech detection.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:26:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bird","Jordan J.",""],["Lotfi","Ahmad",""]]}
{"id":"2308.12735","submitter":"Casper Asbj{\\o}rn Eriksen","authors":"Casper Asbj{\\o}rn Eriksen, Jakob Lykke Andersen, Rolf Fagerberg,\n  Daniel Merkle","title":"Reconciling Inconsistent Molecular Structures from Biochemical Databases","comments":"14 pages, 4 figures, accepted at ISBRA 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM cs.DB q-bio.MN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Information on the structure of molecules, retrieved via biochemical\ndatabases, plays a pivotal role in various disciplines, such as metabolomics,\nsystems biology, and drug discovery. However, no such database can be complete,\nand the chemical structure for a given compound is not necessarily consistent\nbetween databases. This paper presents StructRecon, a novel tool for resolving\nunique and correct molecular structures from database identifiers. StructRecon\ntraverses the cross-links between database entries in different databases to\nconstruct what we call an identifier graph, which offers a more complete view\nof the total information available on a particular compound across all the\ndatabases. In order to reconcile discrepancies between databases, we first\npresent an extensible model for chemical structure which supports multiple\nindependent levels of detail, allowing standardisation of the structure to be\napplied iteratively. In some cases, our standardisation approach results in\nmultiple structures for a given compound, in which case a random walk-based\nalgorithm is used to select the most likely structure among incompatible\nalternates. We applied StructRecon to the EColiCore2 model, resolving a unique\nchemical structure for 85.11 % of identifiers. StructRecon is open-source and\nmodular, which enables the potential support for more databases in the future.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:26:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Eriksen","Casper Asbj\u00f8rn",""],["Andersen","Jakob Lykke",""],["Fagerberg","Rolf",""],["Merkle","Daniel",""]]}
{"id":"2308.12736","submitter":"Santiago Estrada","authors":"Santiago Estrada, David K\\\"ugler, Emad Bahrami, Peng Xu, Dilshad\n  Mousa, Monique M.B. Breteler, N. Ahmad Aziz, Martin Reuter","title":"FastSurfer-HypVINN: Automated sub-segmentation of the hypothalamus and\n  adjacent structures on high-resolutional brain MRI","comments":"Submitted to Imaging Neuroscience","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hypothalamus plays a crucial role in the regulation of a broad range of\nphysiological, behavioural, and cognitive functions. However, despite its\nimportance, only a few small-scale neuroimaging studies have investigated its\nsubstructures, likely due to the lack of fully automated segmentation tools to\naddress scalability and reproducibility issues of manual segmentation. While\nthe only previous attempt to automatically sub-segment the hypothalamus with a\nneural network showed promise for 1.0 mm isotropic T1-weighted (T1w) MRI, there\nis a need for an automated tool to sub-segment also high-resolutional (HiRes)\nMR scans, as they are becoming widely available, and include structural detail\nalso from multi-modal MRI. We, therefore, introduce a novel, fast, and fully\nautomated deep learning method named HypVINN for sub-segmentation of the\nhypothalamus and adjacent structures on 0.8 mm isotropic T1w and T2w brain MR\nimages that is robust to missing modalities. We extensively validate our model\nwith respect to segmentation accuracy, generalizability, in-session test-retest\nreliability, and sensitivity to replicate hypothalamic volume effects (e.g.\nsex-differences). The proposed method exhibits high segmentation performance\nboth for standalone T1w images as well as for T1w/T2w image pairs. Even with\nthe additional capability to accept flexible inputs, our model matches or\nexceeds the performance of state-of-the-art methods with fixed inputs. We,\nfurther, demonstrate the generalizability of our method in experiments with 1.0\nmm MR scans from both the Rhineland Study and the UK Biobank. Finally, HypVINN\ncan perform the segmentation in less than a minute (GPU) and will be available\nin the open source FastSurfer neuroimaging software suite, offering a\nvalidated, efficient, and scalable solution for evaluating imaging-derived\nphenotypes of the hypothalamus.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:26:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Estrada","Santiago",""],["K\u00fcgler","David",""],["Bahrami","Emad",""],["Xu","Peng",""],["Mousa","Dilshad",""],["Breteler","Monique M. B.",""],["Aziz","N. Ahmad",""],["Reuter","Martin",""]]}
{"id":"2308.12737","submitter":"Ziqi Yang","authors":"Ziqi Yang, Zhongyu Li, Chen Liu, Xiangde Luo, Xingguang Wang, Dou Xu,\n  Chaoqun Li, Xiaoying Qin, Meng Yang, Long Jin","title":"Asymmetric Co-Training with Explainable Cell Graph Ensembling for\n  Histopathological Image Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Convolutional neural networks excel in histopathological image\nclassification, yet their pixel-level focus hampers explainability. Conversely,\nemerging graph convolutional networks spotlight cell-level features and medical\nimplications. However, limited by their shallowness and suboptimal use of\nhigh-dimensional pixel data, GCNs underperform in multi-class histopathological\nimage classification. To make full use of pixel-level and cell-level features\ndynamically, we propose an asymmetric co-training framework combining a deep\ngraph convolutional network and a convolutional neural network for multi-class\nhistopathological image classification. To improve the explainability of the\nentire framework by embedding morphological and topological distribution of\ncells, we build a 14-layer deep graph convolutional network to handle cell\ngraph data. For the further utilization and dynamic interactions between\npixel-level and cell-level information, we also design a co-training strategy\nto integrate the two asymmetric branches. Notably, we collect a private\nclinically acquired dataset termed LUAD7C, including seven subtypes of lung\nadenocarcinoma, which is rare and more challenging. We evaluated our approach\non the private LUAD7C and public colorectal cancer datasets, showcasing its\nsuperior performance, explainability, and generalizability in multi-class\nhistopathological image classification.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:27:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Ziqi",""],["Li","Zhongyu",""],["Liu","Chen",""],["Luo","Xiangde",""],["Wang","Xingguang",""],["Xu","Dou",""],["Li","Chaoqun",""],["Qin","Xiaoying",""],["Yang","Meng",""],["Jin","Long",""]]}
{"id":"2308.12738","submitter":"Chenping Fu","authors":"Chenping Fu, Xin Fan, Jiewen Xiao, Wanqi Yuan, Risheng Liu, and\n  Zhongxuan Luo","title":"Learning Heavily-Degraded Prior for Underwater Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Underwater object detection suffers from low detection performance because\nthe distance and wavelength dependent imaging process yield evident image\nquality degradations such as haze-like effects, low visibility, and color\ndistortions. Therefore, we commit to resolving the issue of underwater object\ndetection with compounded environmental degradations. Typical approaches\nattempt to develop sophisticated deep architecture to generate high-quality\nimages or features. However, these methods are only work for limited ranges\nbecause imaging factors are either unstable, too sensitive, or compounded.\nUnlike these approaches catering for high-quality images or features, this\npaper seeks transferable prior knowledge from detector-friendly images. The\nprior guides detectors removing degradations that interfere with detection. It\nis based on statistical observations that, the heavily degraded regions of\ndetector-friendly (DFUI) and underwater images have evident feature\ndistribution gaps while the lightly degraded regions of them overlap each\nother. Therefore, we propose a residual feature transference module (RFTM) to\nlearn a mapping between deep representations of the heavily degraded patches of\nDFUI- and underwater- images, and make the mapping as a heavily degraded prior\n(HDP) for underwater detection. Since the statistical properties are\nindependent to image content, HDP can be learned without the supervision of\nsemantic labels and plugged into popular CNNbased feature extraction networks\nto improve their performance on underwater object detection. Without bells and\nwhistles, evaluations on URPC2020 and UODD show that our methods outperform\nCNN-based detectors by a large margin. Our method with higher speeds and less\nparameters still performs better than transformer-based detectors. Our code and\nDFUI dataset can be found in\nhttps://github.com/xiaoDetection/Learning-Heavily-Degraed-Prior.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:32:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fu","Chenping",""],["Fan","Xin",""],["Xiao","Jiewen",""],["Yuan","Wanqi",""],["Liu","Risheng",""],["Luo","Zhongxuan",""]]}
{"id":"2308.12739","submitter":"Siddhartha Das","authors":"Abhishek Sadhu, Meghana Ayyala Somayajula, Karol Horodecki, Siddhartha\n  Das","title":"Practical limitations on robustness and scalability of quantum Internet","comments":"Happy about the successful soft landing of Chandrayaan-3 on the moon\n  by ISRO. 35 pages, 32 figures. Preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As quantum theory allows for information processing and computing tasks that\notherwise are not possible with classical systems, there is a need and use of\nquantum Internet beyond existing network systems. At the same time, the\nrealization of a desirably functional quantum Internet is hindered by\nfundamental and practical challenges such as high loss during transmission of\nquantum systems, decoherence due to interaction with the environment, fragility\nof quantum states, etc. We study the implications of these constraints by\nanalyzing the limitations on the scaling and robustness of quantum Internet.\nConsidering quantum networks, we present practical bottlenecks for secure\ncommunication, delegated computing, and resource distribution among end nodes.\nMotivated by the power of abstraction in graph theory (in association with\nquantum information theory), we consider graph-theoretic quantifiers to assess\nnetwork robustness and provide critical values of communication lines for\nviable communication over quantum Internet.\n  In particular, we begin by discussing limitations on usefulness of isotropic\nstates as device-independent quantum key repeaters which otherwise could be\nuseful for device-independent quantum key distribution. We consider some\nquantum networks of practical interest, ranging from satellite-based networks\nconnecting far-off spatial locations to currently available quantum processor\narchitectures within computers, and analyze their robustness to perform quantum\ninformation processing tasks. Some of these tasks form primitives for delegated\nquantum computing, e.g., entanglement distribution and quantum teleportation.\nFor some examples of quantum networks, we present algorithms to perform\ndifferent quantum network tasks of interest such as constructing the network\nstructure, finding the shortest path between a pair of end nodes, and\noptimizing the flow of resources at a node.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:32:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sadhu","Abhishek",""],["Somayajula","Meghana Ayyala",""],["Horodecki","Karol",""],["Das","Siddhartha",""]]}
{"id":"2308.12740","submitter":"Lun Ai","authors":"Lun Ai, Shi-Shun Liang, Wang-Zhou Dai, Liam Hallett, Stephen H.\n  Muggleton, Geoff S. Baldwin","title":"Human Comprehensible Active Learning of Genome-Scale Metabolic Networks","comments":"Invited presentation for AAAI Spring Symposium Series 2023 on\n  Computational Scientific Discovery","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG q-bio.MN q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An important application of Synthetic Biology is the engineering of the host\ncell system to yield useful products. However, an increase in the scale of the\nhost system leads to huge design space and requires a large number of\nvalidation trials with high experimental costs. A comprehensible machine\nlearning approach that efficiently explores the hypothesis space and guides\nexperimental design is urgently needed for the Design-Build-Test-Learn (DBTL)\ncycle of the host cell system. We introduce a novel machine learning framework\nILP-iML1515 based on Inductive Logic Programming (ILP) that performs abductive\nlogical reasoning and actively learns from training examples. In contrast to\nnumerical models, ILP-iML1515 is built on comprehensible logical\nrepresentations of a genome-scale metabolic model and can update the model by\nlearning new logical structures from auxotrophic mutant trials. The ILP-iML1515\nframework 1) allows high-throughput simulations and 2) actively selects\nexperiments that reduce the experimental cost of learning gene functions in\ncomparison to randomly selected experiments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:42:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ai","Lun",""],["Liang","Shi-Shun",""],["Dai","Wang-Zhou",""],["Hallett","Liam",""],["Muggleton","Stephen H.",""],["Baldwin","Geoff S.",""]]}
{"id":"2308.12741","submitter":"Sergey Ganichev","authors":"M. D. Moldavskaya, L. E. Golub, S. N. Danilov, V. V. Bel'kov, D. Weiss\n  and S. D. Ganichev","title":"Photocurrents in bulk tellurium","comments":"21 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report a comprehensive study of polarized infrared/terahertz photocurrents\nin bulk tellurium crystals. We observe different photocurrent contributions and\nshow that, depending on the experimental conditions, they are caused by the\ntrigonal photogalvanic effect, the transverse linear photon drag effect, and\nthe magnetic field induced linear and circular photogalvanic effects. All\nobserved photocurrents have not been reported before and are well explained by\nthe developed phenomenological and microscopic theory. We show that the effects\ncan be unambiguously distinguished by studying the polarization, magnetic\nfield, and radiation frequency dependence of the photocurrent. At frequencies\naround 30 THz, the photocurrents are shown to be caused by the direct optical\ntransitions between subbands in the valence band. At lower frequencies of 1 to\n3 THz, used in our experiment, these transitions become impossible and the\ndetected photocurrents are caused by the indirect optical transitions\n(Drude-like radiation absorption).\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:43:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Moldavskaya","M. D.",""],["Golub","L. E.",""],["Danilov","S. N.",""],["Bel'kov","V. V.",""],["Weiss","D.",""],["Ganichev","S. D.",""]]}
{"id":"2308.12742","submitter":"Chiara Bellenghi","authors":"Chiara Bellenghi, Martin Ha Minh, Tomas Kontrimas, Elena Manao, Rasmus\n  {\\O}rs{\\o}e, Martin Wolf (for the IceCube Collaboration)","title":"Extending the IceCube search for neutrino point sources in the Northern\n  sky with additional years of data","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1060","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The IceCube Neutrino Observatory is a one-cubic-kilometer-sized neutrino\ntelescope deployed deep in the Antarctic ice at the South Pole. One of\nIceCube's major goals is finding the origins of astrophysical high-energy\nneutrinos. In 2022, IceCube identified the strongest point-like neutrino source\nso far, the active galaxy NGC 1068. Analyzing 9 years of muon-neutrino data\nfrom the Northern Sky recorded between 2011 and 2020, the emission from NGC\n1068 is significant at 4.2$\\,\\sigma$. We present a planned extension to this\nsearch with additional years of data. One of these years includes data from\n2010 when IceCube was only partially constructed. We discuss the improvement in\nsensitivity and discovery potential for neutrino point sources across the\nNorthern sky. We show that by building on the established analysis techniques,\nprevious observations could be improved, not only for NGC 1068 but for all\npossible sources in the Northern sky.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:43:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bellenghi","Chiara","","for the IceCube Collaboration"],["Minh","Martin Ha","","for the IceCube Collaboration"],["Kontrimas","Tomas","","for the IceCube Collaboration"],["Manao","Elena","","for the IceCube Collaboration"],["\u00d8rs\u00f8e","Rasmus","","for the IceCube Collaboration"],["Wolf","Martin","","for the IceCube Collaboration"]]}
{"id":"2308.12743","submitter":"Mehrdad Maghsoudi","authors":"Mehrdad Maghsoudi, MohammdHossein Valikhan, MohammdHossein Zohdi","title":"Video Recommendation Using Social Network Analysis and User Viewing\n  Patterns","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the meteoric rise of video-on-demand (VOD) platforms, users face the\nchallenge of sifting through an expansive sea of content to uncover shows that\nclosely match their preferences. To address this information overload dilemma,\nVOD services have increasingly incorporated recommender systems powered by\nalgorithms that analyze user behavior and suggest personalized content.\nHowever, a majority of existing recommender systems depend on explicit user\nfeedback in the form of ratings and reviews, which can be difficult and\ntime-consuming to collect at scale. This presents a key research gap, as\nleveraging users' implicit feedback patterns could provide an alternative\navenue for building effective video recommendation models, circumventing the\nneed for explicit ratings. However, prior literature lacks sufficient\nexploration into implicit feedback-based recommender systems, especially in the\ncontext of modeling video viewing behavior. Therefore, this paper aims to\nbridge this research gap by proposing a novel video recommendation technique\nthat relies solely on users' implicit feedback in the form of their content\nviewing percentages.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:45:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maghsoudi","Mehrdad",""],["Valikhan","MohammdHossein",""],["Zohdi","MohammdHossein",""]]}
{"id":"2308.12744","submitter":"Ilkka T\\\"orm\\\"a","authors":"Herv\\'e Sabri\\'e and Ilkka T\\\"orm\\\"a","title":"Limit dynamics of elementary cellular automaton 18","comments":"17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the the asymptotic dynamics of elementary cellular automaton 18\nthrough its limit set, generic limit set and $\\mu$-limit set. The dynamics of\nrule 18 are characterized by persistent local patterns known as kinks. We\ncharacterize the configurations of the generic limit set containing at most two\nkinks. As a corollary, we show that the three limit sets of rule 18 are\ndistinct.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:46:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sabri\u00e9","Herv\u00e9",""],["T\u00f6rm\u00e4","Ilkka",""]]}
{"id":"2308.12745","submitter":"Peter Nemeth","authors":"Julieta P. S\\'anchez Arias, P\\'eter N\\'emeth, Elisson S. G. de\n  Almeida, Matias A. Ruiz Diaz, Michaela Kraus, Maximiliano Haucke","title":"Unveiling the evolutionary state of three B supergiant stars: PU Gem,\n  $\\epsilon$ CMa and $\\eta$ CMa","comments":"29 pages, 18 figures, Accepted for publication in Galaxies","journal-ref":null,"doi":"10.3390/galaxies11050093","report-no":null,"categories":"astro-ph.SR astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We aim to combine asteroseismology, spectroscopy, and evolutionary models to\nestablish a comprehensive picture of the evolution of Galactic blue supergiant\nstars (BSG). To start such an investigation, we selected three BSG candidates\nfor our analysis: HD 42087 (PU Gem), HD 52089 ($\\epsilon$ CMa) and HD 58350\n($\\eta$ CMa). These stars show pulsations and were suspected to be in an\nevolutionary stage either preceding or succeding the red supergiant (RSG)\nstage.\n  For our analysis, we utilized the 2-min cadence TESS data to study the\nphotometric variability and obtained new spectroscopic observations at the\nCASLEO observatory. We calculated CMFGEN non-LTE radiative transfer models and\nderived stellar and wind parameters using the iterative spectral analysis\npipeline XTGRID. The spectral modeling was limited to changing only the\neffective temperature, surface gravity, CNO abundances, and mass-loss rates.\nFinally, we compared the derived metal abundances with predictions from Geneva\nstellar evolution models. The frequency spectra of all three stars show either\nstochastic oscillations, nonradial strange modes, or a rotational splitting.\n  We conclude that the rather short sectoral observing windows of TESS prevent\nestablishing a reliable mode identification of low frequencies connected to\nmass-loss variabilities. The spectral analysis confirmed gradual changes in the\nmass-loss rates and the derived CNO abundances comply with the values reported\nin the literature. We were able to achieve a quantitative match with stellar\nevolution models for the stellar masses and luminosities. However, the\nspectroscopic surface abundances turned out to be inconsistent with theoretical\npredictions. The stars show N enrichment, typical for CNO cycle processed\nmaterial, but the abundance ratios do not reflect the associated levels of C\nand O depletion.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:47:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Arias","Julieta P. S\u00e1nchez",""],["N\u00e9meth","P\u00e9ter",""],["de Almeida","Elisson S. G.",""],["Diaz","Matias A. Ruiz",""],["Kraus","Michaela",""],["Haucke","Maximiliano",""]]}
{"id":"2308.12746","submitter":"Bhabani Shankar Dey","authors":"Bhabani Shankar Dey, Indra Narayan Kar, Pushpak Jagtap","title":"On Incremental Stability of Interconnected Switched Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this letter, the incremental stability of interconnected systems is\ndiscussed. In particular, we consider an interconnection of switched nonlinear\nsystems. The incremental stability of the switched interconnected system is a\nstronger property as compared to conventional stability. Guaranteeing such a\nnotion of stability for an overall interconnected nonlinear system is\nchallenging, even if individual subsystems are incrementally stable. Here,\npreserving incremental stability for the interconnection is ensured with a set\nof sufficient conditions. Contraction theory is used as a tool to achieve\nincremental convergence. For the feedback interconnection, the small gain\ncharacterisation is presented for the overall system's incremental stability.\nThe results are derived for a special case of feedback, i.e., cascade\ninterconnection. Matrix-measure-based conditions are presented, which are\ncomputationally tractable. Two numerical examples are demonstrated and\nsupported with simulation results to verify the theoretical claims.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:48:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dey","Bhabani Shankar",""],["Kar","Indra Narayan",""],["Jagtap","Pushpak",""]]}
{"id":"2308.12747","submitter":"Alon Kipnis","authors":"Alon Kipnis","title":"Separating the Human Touch from AI-Generated Text using Higher\n  Criticism: An Information-Theoretic Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.AI math.IT stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a method to determine whether a given article was entirely written\nby a generative language model versus an alternative situation in which the\narticle includes some significant edits by a different author, possibly a\nhuman. Our process involves many perplexity tests for the origin of individual\nsentences or other text atoms, combining these multiple tests using Higher\nCriticism (HC). As a by-product, the method identifies parts suspected to be\nedited. The method is motivated by the convergence of the log-perplexity to the\ncross-entropy rate and by a statistical model for edited text saying that\nsentences are mostly generated by the language model, except perhaps for a few\nsentences that might have originated via a different mechanism. We demonstrate\nthe effectiveness of our method using real data and analyze the factors\naffecting its success. This analysis raises several interesting open challenges\nwhose resolution may improve the method's effectiveness.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:49:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kipnis","Alon",""]]}
{"id":"2308.12748","submitter":"Xiaolin Chang","authors":"Lina Liu, Jing Bai, Xiaolin Chang, Fumio Machida, Kishor S. Trivedi,\n  Haoran Zhu","title":"Towards Semi-Markov Model-based Dependability Evaluation of VM-based\n  Multi-Domain Service Function Chain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In NFV networks, service functions (SFs) can be deployed on virtual machines\n(VMs) across multiple domains and then form a service function chain (MSFC) for\nend-to-end network service provision. However, any software component in a\nVM-based MSFC must experience software aging issue after a long period of\noperation. This paper quantitatively investigates the capability of proactive\nrejuvenation techniques in reducing the damage of software aging on a VM-based\nMSFC. We develop a semi-Markov model to capture the behaviors of SFs, VMs and\nvirtual machine monitors (VMMs) from software aging to recovery under the\ncondition that failure times and recovery times follow general distributions.\nWe derive the formulas for calculating the steady-state availability and\nreliability of the VM-based MSFC composed of multiple SFs running on VMs hosted\nby VMMs. Sensitivity analysis is also conducted to identify potential\ndependability bottlenecks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:51:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Lina",""],["Bai","Jing",""],["Chang","Xiaolin",""],["Machida","Fumio",""],["Trivedi","Kishor S.",""],["Zhu","Haoran",""]]}
{"id":"2308.12749","submitter":"Yiran Wang","authors":"Yiran Wang, Yunsi Wen, Ang Li, Xiaoyan Hu, Christos Masouros","title":"Block-Level Interference Exploitation Precoding for MU-MISO: An ADMM\n  Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study constructive interference based block-level precoding (CI-BLP) in\nthe downlink of multi-user multiple-input single-output (MU-MISO) systems.\nSpecifically, our aim is to extend the analysis on CI-BLP to the case where the\nconsidered number of symbol slots is smaller than that of the users. To this\nend, we mathematically prove the feasibility of using the pseudo-inverse to\nobtain the optimal CI-BLP precoding matrix in a closed form. Similar to the\ncase when the number of users is small, we show that a quadratic programming\n(QP) optimization on simplex can be constructed. We also design a\nlow-complexity algorithm based on the alternating direction method of\nmultipliers (ADMM) framework, which can efficiently solve large-scale QP\nproblems. We further analyze the convergence and complexity of the proposed\nalgorithm. Numerical results validate our analysis and the optimality of the\nproposed algorithm, and further show that the proposed algorithm offers a\nflexible performance-complexity tradeoff by limiting the maximum number of\niterations, which motivates the use of CI-BLP in practical wireless systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:52:49 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:56:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Yiran",""],["Wen","Yunsi",""],["Li","Ang",""],["Hu","Xiaoyan",""],["Masouros","Christos",""]]}
{"id":"2308.12750","submitter":"Kazuhiko Kuroki","authors":"Naoya Kitamine, Masayuki Ochi, and Kazuhiko Kuroki","title":"Theoretical designing of multiband Nickelate and Palladate\n  superconductors with $d^{8+\\delta}$ configuration","comments":"8 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a previous study, we proposed a possibility of high $T_c$\nsuperconductivity in mixed-anion nickelates with $d^{8+\\delta}$ electron\nconfiguration. The theory was based on the fact that the two-orbital Hubbard\nmodel, when all the intra- and interorbital interactions have the same\nmagnitude, is equivalent to the bilayer Hubbard model, which has been suggested\nto exhibit high $T_c$ superconductivity. The energy level offset $\\Delta E$ in\nthe two-orbital model is transformed to twice the interlayer hopping in the\nbilayer model, and hence appropriately large $\\Delta E$ is favorable for\nsuperconductivity in the former. Extending this idea to multiorbital systems,\nwe previously suggested materials with large energy level offset between\n$d_{x^2-y^2}$ and other $d$ orbitals, such as Ca$_2$NiO$_2$Cl$_2$, to be good\ncandidates for high $T_c$ superconductivity, but such materials have not been\nsynthesized to our knowledge. In the present study, we first focus on\nSr$_2$NiO$_2$Cl$_2$, which has been synthesized in the past but has small\n$\\Delta E$, and study the effect of applying pressure, which enhances $\\Delta\nE$. We also study a 4d analogue of Sr$_2$NiO$_2$Cl$_2$, namely,\nSr$_2$PdO$_2$X$_2$ ($X=$ Cl, F, H) , in which $\\Delta E$ turns out to be large.\nThe analysis using fluctuation exchange approximation suggests possibility of\nsuperconductivity in these systems with large $\\Delta E$. We also study the\neffect of electron doping of these material, which is expected to enhance\nsuperconductivity, within the virtual crystal approximation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:54:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kitamine","Naoya",""],["Ochi","Masayuki",""],["Kuroki","Kazuhiko",""]]}
{"id":"2308.12751","submitter":"Paul Starke","authors":"Paul Starke, Sebastian Starke, Taku Komura, Frank Steinicke","title":"Motion In-Betweening with Phase Manifolds","comments":"17 pages, 11 figures, conference","journal-ref":"ACM SIGGRAPH / Eurographics Symposium on Computer Animation (SCA),\n  August 4-6, 2023, Los Angeles, CA, USA","doi":"10.1145/3606921","report-no":null,"categories":"cs.GR cs.AI cs.LG cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper introduces a novel data-driven motion in-betweening system to\nreach target poses of characters by making use of phases variables learned by a\nPeriodic Autoencoder. Our approach utilizes a mixture-of-experts neural network\nmodel, in which the phases cluster movements in both space and time with\ndifferent expert weights. Each generated set of weights then produces a\nsequence of poses in an autoregressive manner between the current and target\nstate of the character. In addition, to satisfy poses which are manually\nmodified by the animators or where certain end effectors serve as constraints\nto be reached by the animation, a learned bi-directional control scheme is\nimplemented to satisfy such constraints. The results demonstrate that using\nphases for motion in-betweening tasks sharpen the interpolated movements, and\nfurthermore stabilizes the learning process. Moreover, using phases for motion\nin-betweening tasks can also synthesize more challenging movements beyond\nlocomotion behaviors. Additionally, style control is enabled between given\ntarget keyframes. Our proposed framework can compete with popular\nstate-of-the-art methods for motion in-betweening in terms of motion quality\nand generalization, especially in the existence of long transition durations.\nOur framework contributes to faster prototyping workflows for creating animated\ncharacter sequences, which is of enormous interest for the game and film\nindustry.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:56:39 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Starke","Paul",""],["Starke","Sebastian",""],["Komura","Taku",""],["Steinicke","Frank",""]]}
{"id":"2308.12752","submitter":"Seok Hyung Lie","authors":"Seok Hyung Lie and Nelly H. Y. Ng","title":"Uniqueness of quantum state over time function","comments":"5+4 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A fundamental asymmetry exists within the conventional framework of quantum\ntheory between space and time, in terms of representing causal relations via\nquantum channels and acausal relations via multipartite quantum states. Such a\ndistinction does not exist in classical probability theory. In effort to\nintroduce this symmetry to quantum theory, a new framework has recently been\nproposed, such that dynamical description of a quantum system can be\nencapsulated by a static quantum state over time. In particular, Fullwood and\nParzygnat recently proposed the state over time function based on the Jordan\nproduct as a promising candidate for such a quantum state over time function,\nby showing that it satisfies all the axioms required in the no-go result by\nHorsman et al. However, it was unclear if the axioms induce a unique state over\ntime function. In this work, we demonstrate that the previously proposed axioms\ncannot yield a unique state over time function. In response, we therefore\npropose an alternative set of axioms that is operationally motivated, and\nbetter suited to describe quantum states over any spacetime regions beyond two\npoints. By doing so, we establish the Fullwood-Parzygnat state over time\nfunction as the essentially unique function satisfying all these operational\naxioms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:57:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lie","Seok Hyung",""],["Ng","Nelly H. Y.",""]]}
{"id":"2308.12753","submitter":"Jakub Bogus{\\l}awski","authors":"Jakub Bogus{\\l}awski, Alicja Kwa\\'sny, Dorota Stachowiak, Grzegorz\n  Sobo\\'n","title":"Increasing brightness in multiphoton microscopy with\n  low-repetition-rate, wavelength-tunable femtosecond fiber laser","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.bio-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Many experiments in biological and medical sciences currently use multiphoton\nmicroscopy as a core imaging technique. To date, solid-state lasers are most\ncommonly used as excitation beam sources. However, the most demanding\napplications require precisely adjusted excitation laser parameters to enhance\nimage quality. Still, the lag in developing easy-to-use laser sources with\ntunable output parameters makes it challenging. Here, we show that manipulating\nthe temporal and spectral properties of the excitation beam can significantly\nimprove the quality of images. We have developed a wavelength-tunable\nfemtosecond fiber laser that operates within the 760 - 800 nm spectral range\nand produces ultrashort pulses (below 70 fs) with a clean temporal profile and\nhigh pulse energy (1 nJ). The repetition rate could be easily adjusted using an\nintegrated pulse picker unit within the 1 - 25 MHz range and without strongly\ninfluencing other parameters of the generated pulses. We integrated the laser\nwith a two-photon excited fluorescence (TPEF) scanning laser microscope and\ninvestigated the effect of tunable wavelength and reducing the pulse repetition\nrate on the quality of obtained images. Using our laser, we substantially\nimproved the images brightness and penetration depth of native fluorescence and\nstained samples compared with a standard fiber laser. Our results will\ncontribute to developing imaging techniques using lower average laser power and\nbroader use of tailored fiber-based sources.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:57:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bogus\u0142awski","Jakub",""],["Kwa\u015bny","Alicja",""],["Stachowiak","Dorota",""],["Sobo\u0144","Grzegorz",""]]}
{"id":"2308.12754","submitter":"Daniel Alejandro Matoz Fernandez Matoz-Fernandez D.A","authors":"D. A. Matoz-Fernandez, Siyu Li, Monica Olvera de la Cruz, Rastko\n  Sknepnek","title":"PyMembrane: A flexible framework for efficient simulations of elastic\n  and liquid membranes","comments":"7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  PyMembrane is a software package for simulating liquid and elastic membranes\nusing a discretisation of the continuum description based on unstructured\ntriangulated two-dimensional meshes embedded in three-dimensional space. The\npackage is written in C++, with a flexible and intuitive Python interface,\nallowing for a quick setup, execution and analysis of complex simulations.\nPyMembrane follows modern software engineering principles and features a\nmodular design that allows for straightforward implementation of custom\nextensions while ensuring consistency and enabling inexpensive maintenance. A\nhallmark feature of this design is the use of a standardized C++ interface\nwhich streamlines adding new functionalities. Furthermore, PyMembrane uses data\nstructures optimised for unstructured meshes, ensuring efficient mesh\noperations and force calculations. By providing several templates for typical\nsimulations supplemented by extensive documentation, the users can seamlessly\nset up and run research-level simulations and extend the package to integrate\nadditional features, underscoring PyMembrane's commitment to user-centric\ndesign.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:01:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Matoz-Fernandez","D. A.",""],["Li","Siyu",""],["de la Cruz","Monica Olvera",""],["Sknepnek","Rastko",""]]}
{"id":"2308.12755","submitter":"Helge Spieker","authors":"Nassim Belmecheri and Arnaud Gotlieb and Nadjib Lazaar and Helge\n  Spieker","title":"Acquiring Qualitative Explainable Graphs for Automated Driving Scene\n  Interpretation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The future of automated driving (AD) is rooted in the development of robust,\nfair and explainable artificial intelligence methods. Upon request, automated\nvehicles must be able to explain their decisions to the driver and the car\npassengers, to the pedestrians and other vulnerable road users and potentially\nto external auditors in case of accidents. However, nowadays, most explainable\nmethods still rely on quantitative analysis of the AD scene representations\ncaptured by multiple sensors. This paper proposes a novel representation of AD\nscenes, called Qualitative eXplainable Graph (QXG), dedicated to qualitative\nspatiotemporal reasoning of long-term scenes. The construction of this graph\nexploits the recent Qualitative Constraint Acquisition paradigm. Our\nexperimental results on NuScenes, an open real-world multi-modal dataset, show\nthat the qualitative eXplainable graph of an AD scene composed of 40 frames can\nbe computed in real-time and light in space storage which makes it a\npotentially interesting tool for improved and more trustworthy perception and\ncontrol processes in AD.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:01:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Belmecheri","Nassim",""],["Gotlieb","Arnaud",""],["Lazaar","Nadjib",""],["Spieker","Helge",""]]}
{"id":"2308.12756","submitter":"Bin Li","authors":"Bin Li, Rongrong Yang, Lei Liu, Junyi Wang, Ning Zhang, and Mianxiong\n  Dong","title":"Robust Computation Offloading and Trajectory Optimization for\n  Multi-UAV-Assisted MEC: A Multi-Agent DRL Approach","comments":"12 pages, 10 figures","journal-ref":"IEEE Internet of Things Journal, 2023: 1-12","doi":"10.1109/JIOT.2023.3300718","report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For multiple Unmanned-Aerial-Vehicles (UAVs) assisted Mobile Edge Computing\n(MEC) networks, we study the problem of combined computation and communication\nfor user equipments deployed with multi-type tasks. Specifically, we consider\nthat the MEC network encompasses both communication and computation\nuncertainties, where the partial channel state information and the inaccurate\nestimation of task complexity are only available. We introduce a robust design\naccounting for these uncertainties and minimize the total weighted energy\nconsumption by jointly optimizing UAV trajectory, task partition, as well as\nthe computation and communication resource allocation in the multi-UAV\nscenario. The formulated problem is challenging to solve with the coupled\noptimization variables and the high uncertainties. To overcome this issue, we\nreformulate a multi-agent Markov decision process and propose a multi-agent\nproximal policy optimization with Beta distribution framework to achieve a\nflexible learning policy. Numerical results demonstrate the effectiveness and\nrobustness of the proposed algorithm for the multi-UAV-assisted MEC network,\nwhich outperforms the representative benchmarks of the deep reinforcement\nlearning and heuristic algorithms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:02:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Bin",""],["Yang","Rongrong",""],["Liu","Lei",""],["Wang","Junyi",""],["Zhang","Ning",""],["Dong","Mianxiong",""]]}
{"id":"2308.12757","submitter":"Mengya Han","authors":"Mengya Han, Heliang Zheng, Chaoyue Wang, Yong Luo, Han Hu, Jing Zhang,\n  Yonggang Wen","title":"PartSeg: Few-shot Part Segmentation via Part-aware Prompt Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we address the task of few-shot part segmentation, which aims\nto segment the different parts of an unseen object using very few labeled\nexamples. It is found that leveraging the textual space of a powerful\npre-trained image-language model (such as CLIP) can be beneficial in learning\nvisual features. Therefore, we develop a novel method termed PartSeg for\nfew-shot part segmentation based on multimodal learning. Specifically, we\ndesign a part-aware prompt learning method to generate part-specific prompts\nthat enable the CLIP model to better understand the concept of ``part'' and\nfully utilize its textual space. Furthermore, since the concept of the same\npart under different object categories is general, we establish relationships\nbetween these parts during the prompt learning process. We conduct extensive\nexperiments on the PartImageNet and Pascal$\\_$Part datasets, and the\nexperimental results demonstrated that our proposed method achieves\nstate-of-the-art performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:03:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Han","Mengya",""],["Zheng","Heliang",""],["Wang","Chaoyue",""],["Luo","Yong",""],["Hu","Han",""],["Zhang","Jing",""],["Wen","Yonggang",""]]}
{"id":"2308.12758","submitter":"Chenmin Sun","authors":"Chenmin Sun, Nikolay Tzvetkov","title":"Quasi-invariance of Gaussian measures for the $3d$ energy critical\n  nonlinear Schr\\\" odinger equation","comments":"49 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the $3d$ energy critical nonlinear Schr\\\" odinger equation with\ndata distributed according to the Gaussian measure with covariance operator\n$(1-\\Delta)^{-s}$, where $\\Delta$ is the Laplace operator and $s$ is\nsufficiently large. We prove that the flow sends full measure sets to full\nmeasure sets. We also discuss some simple applications. This extends a previous\nresult by Planchon-Visciglia and the second author from $1d$ to higher\ndimensions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:04:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sun","Chenmin",""],["Tzvetkov","Nikolay",""]]}
{"id":"2308.12759","submitter":"Lisa Schumacher","authors":"Lisa Johanna Schumacher, Foteini Oikonomou","title":"Prospects for the detection of transient neutrino sources with PLEnuM","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023)\n  in Nagoya, Japan","journal-ref":"Proceedings of Science 444 (2023) 991","doi":"10.22323/1.444.0991","report-no":"PoS-ICRC2023-991","categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The discovery of high-energy astrophysical neutrinos in the TeV-PeV range by\nIceCube marked the start of neutrino astronomy, and the search for their\nsources continues. Two promising source candidates have been identified by\nIceCube: NGC 1068 in the 1 TeV-10 TeV range and TXS 0506+056 in the 0.1-1 PeV\nrange. Both sources have gamma-ray counterparts, but additional time\ninformation of both neutrinos and gamma rays were essential for the\nidentification of TXS 0506+056. The Planetary Neutrino Monitoring (PLEnuM)\nconcept is an approach for combining the exposures of all current and future\nneutrino observatories - such as KM3NeT, Baikal-GVD, P-ONE in the Northern\nHemisphere, and IceCube-Gen2 in the Southern Hemisphere. Using this PLEnuM\napproach, we estimate how the detection capability for transient sources\ncandidates like blazars and GRBs improves once the future neutrino\nobservatories come online. In addition, we present how the combined,\ninstantaneous field of view of PLEnuM improves the real-time detection rate of\nrare, very-high-energy neutrinos across the entire sky.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:06:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Schumacher","Lisa Johanna",""],["Oikonomou","Foteini",""]]}
{"id":"2308.12760","submitter":"Hippolyte Dourdent","authors":"Hippolyte Dourdent, Alastair A. Abbott, Ivan \\v{S}upi\\'c, Cyril\n  Branciard","title":"Network-Device-Independent Certification of Causal Nonseparability","comments":"7+15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Causal nonseparability is the property underlying quantum processes\nincompatible with a definite causal order. So far it has remained a central\nopen question as to whether any process with a clear physical realisation can\nviolate a causal inequality, so that its causal nonseparability can be\ncertified in a device-independent way, as originally conceived. Here we present\na method solely based on the observed correlations, which certifies the causal\nnonseparability of all the processes that can induce a causally nonseparable\ndistributed measurement in a scenario with trusted quantum input states, as\ndefined in [Dourdent et al., Phys. Rev. Lett. 129, 090402 (2022)]. This notably\nincludes the celebrated quantum switch. This device-independent certification\nis achieved by introducing a network of untrusted operations, allowing one to\nself-test the quantum inputs on which the effective distributed measurement\ninduced by the process is performed.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:08:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dourdent","Hippolyte",""],["Abbott","Alastair A.",""],["\u0160upi\u0107","Ivan",""],["Branciard","Cyril",""]]}
{"id":"2308.12761","submitter":"Sahraoui Dhelim Dr","authors":"Nyothiri Aung, Tahar Kechadi, Liming Chen and Sahraoui Dhelim","title":"IP-UNet: Intensity Projection UNet Architecture for 3D Medical Volume\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CNNs have been widely applied for medical image analysis. However, limited\nmemory capacity is one of the most common drawbacks of processing\nhigh-resolution 3D volumetric data. 3D volumes are usually cropped or downsized\nfirst before processing, which can result in a loss of resolution, increase\nclass imbalance, and affect the performance of the segmentation algorithms. In\nthis paper, we propose an end-to-end deep learning approach called IP-UNet.\nIP-UNet is a UNet-based model that performs multi-class segmentation on\nIntensity Projection (IP) of 3D volumetric data instead of the memory-consuming\n3D volumes. IP-UNet uses limited memory capability for training without losing\nthe original 3D image resolution. We compare the performance of three models in\nterms of segmentation accuracy and computational cost: 1) Slice-by-slice 2D\nsegmentation of the CT scan images using a conventional 2D UNet model. 2)\nIP-UNet that operates on data obtained by merging the extracted Maximum\nIntensity Projection (MIP), Closest Vessel Projection (CVP), and Average\nIntensity Projection (AvgIP) representations of the source 3D volumes, then\napplying the UNet model on the output IP images. 3) 3D-UNet model directly\nreads the 3D volumes constructed from a series of CT scan images and outputs\nthe 3D volume of the predicted segmentation. We test the performance of these\nmethods on 3D volumetric images for automatic breast calcification detection.\nExperimental results show that IP-Unet can achieve similar segmentation\naccuracy with 3D-Unet but with much better performance. It reduces the training\ntime by 70\\% and memory consumption by 92\\%.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:08:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Aung","Nyothiri",""],["Kechadi","Tahar",""],["Chen","Liming",""],["Dhelim","Sahraoui",""]]}
{"id":"2308.12762","submitter":"Dmytro Humeniuk","authors":"Dmytro Humeniuk, Foutse Khomh, Giuliano Antoniol","title":"Reinforcement Learning Informed Evolutionary Search for Autonomous\n  Systems Testing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Evolutionary search-based techniques are commonly used for testing autonomous\nrobotic systems. However, these approaches often rely on computationally\nexpensive simulator-based models for test scenario evaluation. To improve the\ncomputational efficiency of the search-based testing, we propose augmenting the\nevolutionary search (ES) with a reinforcement learning (RL) agent trained using\nsurrogate rewards derived from domain knowledge. In our approach, known as\nRIGAA (Reinforcement learning Informed Genetic Algorithm for Autonomous systems\ntesting), we first train an RL agent to learn useful constraints of the problem\nand then use it to produce a certain part of the initial population of the\nsearch algorithm. By incorporating an RL agent into the search process, we aim\nto guide the algorithm towards promising regions of the search space from the\nstart, enabling more efficient exploration of the solution space. We evaluate\nRIGAA on two case studies: maze generation for an autonomous ant robot and road\ntopology generation for an autonomous vehicle lane keeping assist system. In\nboth case studies, RIGAA converges faster to fitter solutions and produces a\nbetter test suite (in terms of average test scenario fitness and diversity).\nRIGAA also outperforms the state-of-the-art tools for vehicle lane keeping\nassist system testing, such as AmbieGen and Frenetic.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:11:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Humeniuk","Dmytro",""],["Khomh","Foutse",""],["Antoniol","Giuliano",""]]}
{"id":"2308.12763","submitter":"Mathieu Baillif","authors":"Mathieu Baillif","title":"Eventually Constant and stagnating functions in non-Lindel\\\"of spaces","comments":"33 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Inspired by recent work of A. Mardani which elaborates on the elementary fact\nthat for any continuous function $f:\\omega_1\\times\\mathbb{R}\\to\\mathbb{R}$,\nthere is an $\\alpha\\in\\omega_1$ such that $f(\\langle\\beta,x\\rangle) =\nf(\\langle\\alpha,x\\rangle)$ for all $\\beta\\ge\\alpha$ and $x\\in\\mathbb{R}$, we\nintroduce four properties $\\mathsf{P}(X,Y)$,\n$\\mathsf{P}\\in\\{\\mathsf{EC},\\mathsf{S},\\mathsf{L},\\mathsf{BR}\\}$, which are\ndifferent formalizations of the idea vaguely stated as ``given a continuous\n$f:X\\to Y$, there is a small subspace of $X$ outside of which $f$ does not do\nanything much new''. We say that the spaces $X,Y$ satisfy the property\n$\\mathsf{EC}(X,Y)$ (resp. $\\mathsf{S}(X,Y)$) [resp. $\\mathsf{L}(X,Y)$] iff\ngiven $f:X\\to Y$, then there is a Lindel\\\"of $Z\\subset X$ such that $f(X-Z)$ is\na singleton (resp. there is a retraction $r:X\\to Z$ such that $f\\circ r = f$)\n[resp. $f(Z) = f(X)$]. ($\\mathsf{BR}(X,Y)$ is defined similarly.) We\ninvestigate the relations between these four and other classical topological\nproperties. Two variants of each property are given depending on whether $Z$\ncan be chosen to be closed. Here is a sample of our results. An uncountable\nsubspace $T$ of a tree of height $\\omega_1$ is $\\omega_1$-compact iff\n$\\mathsf{S}(T,Y)$ holds for any metrizable space $Y$ of cardinality $>1$. If\n$M$ is a $\\aleph_1$-strongly collectionwise Hausforff non-metrizable manifold\nsatisfying either a weakening of $\\mathsf{S}(M,\\mathbb{R})$ or\n$\\mathsf{EC}(M,\\mathbb{R})$, then $M$ is $\\omega_1$-compact. The property\n$\\mathsf{L}(M,\\mathbb{R})$ holds for any manifold while\n$\\mathsf{L}(M,\\mathbb{R}^2)$ does not. Under PFA, a locally compact countably\ntight space $Y$ for which $\\mathsf{EC}(\\omega_1,Y)$ holds is isocompact, while\nthere are counterexamples under $\\clubsuit_C$. Some of our results are\nrestatements of other researchers work put in our context.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:11:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Baillif","Mathieu",""]]}
{"id":"2308.12764","submitter":"Liu-Di Lu","authors":"Martin Jakob Gander, Liu-Di Lu","title":"Dirichlet-Neumann and Neumann-Neumann Methods for Elliptic Control\n  Problems","comments":"27th International Domain Decomposition Conference (DD27)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the Dirichlet-Neumann (DN) and Neumann-Neumann (NN) methods\napplied to the optimal control problems arising from elliptic partial\ndifferential equations (PDEs) under the $H^{-1}$ regularization. We use the\nLagrange multiplier approach to derive a forward-backward optimality system\nwith the $L^2$ regularization, and a singular perturbed Poisson equation with\nthe $H^{-1}$ regularization. The $H^{-1}$ regularization thus avoids solving a\ncoupled bi-Laplacian problem, yet the solutions are less regular. The singular\nperturbed Poisson equation is then solved by using the DN and NN methods, and a\ndetailed analysis is given both in the one-dimensional and two-dimensional\ncase. Finally, we provide some numerical experiments with conclusions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:12:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gander","Martin Jakob",""],["Lu","Liu-Di",""]]}
{"id":"2308.12765","submitter":"Hechang Lei","authors":"Shaohua Yan, Hui-Hui He, Yang Fu, Ning-Ning Zhao, Shangjie Tian,\n  Qiangwei Yin, Fanyu Meng, Xinyu Cao, Le Wang, Shanshan Chen, Ki-Hoon Son, Jun\n  Woo Choi, Hyejin Ryu, Shouguo Wang, Xiao Zhang, Kai Liu and Hechang Lei","title":"Nearly-room-temperature ferromagnetism and tunable anomalous Hall effect\n  in atomically thin Fe4CoGeTe2","comments":"28 pages, 4 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Itinerant ferromagnetism at room temperature is a key ingredient for spin\ntransport and manipulation. Here, we report the realization of\nnearly-room-temperature itinerant ferromagnetism in Co doped Fe5GeTe2 thin\nflakes. The ferromagnetic transition temperature TC (323 K - 337 K) is almost\nunchanged when thickness is down to 12 nm and is still about 284 K at 2 nm\n(bilayer thickness). Theoretical calculations further indicate that the\nferromagnetism persists in monolayer Fe4CoGeTe2. In addition to the robust\nferromagnetism down to the ultrathin limit, Fe4CoGeTe2 exhibits an unusual\ntemperature- and thickness-dependent intrinsic anomalous Hall effect. We\npropose that it could be ascribed to the dependence of band structure on\nthickness that changes the Berry curvature near the Fermi energy level subtly.\nThe nearly-room-temperature ferromagnetism and tunable anomalous Hall effect in\natomically thin Fe4CoGeTe2 provide opportunities to understand the exotic\ntransport properties of two-dimensional van der Waals magnetic materials and\nexplore their potential applications in spintronics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:13:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yan","Shaohua",""],["He","Hui-Hui",""],["Fu","Yang",""],["Zhao","Ning-Ning",""],["Tian","Shangjie",""],["Yin","Qiangwei",""],["Meng","Fanyu",""],["Cao","Xinyu",""],["Wang","Le",""],["Chen","Shanshan",""],["Son","Ki-Hoon",""],["Choi","Jun Woo",""],["Ryu","Hyejin",""],["Wang","Shouguo",""],["Zhang","Xiao",""],["Liu","Kai",""],["Lei","Hechang",""]]}
{"id":"2308.12766","submitter":"Jishnu Bhattacharya","authors":"Jishnu Bhattacharya, Chris S. Hanson, Shravan M. Hanasoge and\n  Katepalli R. Sreenivasan","title":"A linear model for inertial modes in a differentially rotating Sun","comments":"16 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Inertial wave modes in the Sun are of interest owing to their potential to\nreveal new insight into the solar interior. These predominantly\nretrograde-propagating modes in the solar subsurface appear to deviate from the\nthin-shell Rossby-Haurwitz model at high azimuthal orders. We present new\nmeasurements of sectoral equatorial inertial modes at $m>15$ where the modes\nappear to become progressively less retrograde compared to the canonical\nRossby-Haurwitz dispersion relation in a co-rotating frame. We use a spectral\neigenvalue solver to compute the spectrum of solar inertial modes in the\npresence of differential rotation. Focussing specifically on equatorial Rossby\nmodes, we find that the numerically obtained mode frequencies lie along\ndistinct ridges, one of which lies strikingly close to the observed mode\nfrequencies in the Sun. We also find that the $n=0$ ridge is deflected strongly\nin the retrograde direction. This suggests that the solar measurements may not\ncorrespond to the fundamental $n=0$ Rossby-Haurwitz solutions as was initially\nsuspected, but to a those for a higher $n$. The numerically obtained\neigenfunctions also appear to sit deep within the convection zone -- unlike\nthose for the $n=0$ modes -- which differs substantially from solar\nmeasurements and complicates inference.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:14:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhattacharya","Jishnu",""],["Hanson","Chris S.",""],["Hanasoge","Shravan M.",""],["Sreenivasan","Katepalli R.",""]]}
{"id":"2308.12767","submitter":"Guillaume Salha-Galvan","authors":"Walid Bendada and Guillaume Salha-Galvan and Romain Hennequin and\n  Thomas Bouab\\c{c}a and Tristan Cazenave","title":"On the Consistency of Average Embeddings for Item Recommendation","comments":"17th ACM Conference on Recommender Systems (RecSys 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A prevalent practice in recommender systems consists in averaging item\nembeddings to represent users or higher-level concepts in the same embedding\nspace. This paper investigates the relevance of such a practice. For this\npurpose, we propose an expected precision score, designed to measure the\nconsistency of an average embedding relative to the items used for its\nconstruction. We subsequently analyze the mathematical expression of this score\nin a theoretical setting with specific assumptions, as well as its empirical\nbehavior on real-world data from music streaming services. Our results\nemphasize that real-world averages are less consistent for recommendation,\nwhich paves the way for future research to better align real-world embeddings\nwith assumptions from our theoretical setting.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:14:49 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 15:52:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bendada","Walid",""],["Salha-Galvan","Guillaume",""],["Hennequin","Romain",""],["Bouab\u00e7a","Thomas",""],["Cazenave","Tristan",""]]}
{"id":"2308.12768","submitter":"Matthew Westaway","authors":"Matthew Westaway","title":"Tilting modules and highest weight theory for reduced enveloping\n  algebras","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be a reductive algebraic group over an algebraically closed field of\ncharacteristic $p>0$, and let ${\\mathfrak g}$ be its Lie algebra. Given\n$\\chi\\in{\\mathfrak g}^{*}$ in standard Levi form, we study a category\n${\\mathscr C}_\\chi$ of graded representations of the reduced enveloping algebra\n$U_\\chi({\\mathfrak g})$. Specifically, we study the effect of translation\nfunctors and wall-crossing functors on various highest-weight-theoretic objects\nin ${\\mathscr C}_\\chi$, including tilting modules. We also develop the theory\nof canonical $\\Delta$-flags and $\\overline{\\nabla}$-sections of $\\Delta$-flags,\nin analogy with similar concepts for algebraic groups studied by Riche and\nWilliamson.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:16:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Westaway","Matthew",""]]}
{"id":"2308.12769","submitter":"Michel Mandjes","authors":"Florine Kuipers, Michel Mandjes, Sara Morcy","title":"Bankruptcy probabilities under non-Poisson inspection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper concerns an insurance firm's surplus process observed at renewal\ninspection times, with a focus on assessing the probability of the surplus\nlevel dropping below zero. For various types of inter-inspection time\ndistributions, an explicit expression for the corresponding transform is given.\nIn addition, Cram\\'er-Lundberg type asymptotics are established. Also, an\nimportance sampling based Monte Carlo algorithm is proposed, and is shown to be\nlogarithmically efficient.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:17:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kuipers","Florine",""],["Mandjes","Michel",""],["Morcy","Sara",""]]}
{"id":"2308.12770","submitter":"Guangyu Chen","authors":"Guangyu Chen, Yu Wu, Shujie Liu, Tao Liu, Xiaoyong Du, Furu Wei","title":"WavMark: Watermarking for Audio Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CL eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent breakthroughs in zero-shot voice synthesis have enabled imitating a\nspeaker's voice using just a few seconds of recording while maintaining a high\nlevel of realism. Alongside its potential benefits, this powerful technology\nintroduces notable risks, including voice fraud and speaker impersonation.\nUnlike the conventional approach of solely relying on passive methods for\ndetecting synthetic data, watermarking presents a proactive and robust defence\nmechanism against these looming risks. This paper introduces an innovative\naudio watermarking framework that encodes up to 32 bits of watermark within a\nmere 1-second audio snippet. The watermark is imperceptible to human senses and\nexhibits strong resilience against various attacks. It can serve as an\neffective identifier for synthesized voices and holds potential for broader\napplications in audio copyright protection. Moreover, this framework boasts\nhigh flexibility, allowing for the combination of multiple watermark segments\nto achieve heightened robustness and expanded capacity. Utilizing 10 to\n20-second audio as the host, our approach demonstrates an average Bit Error\nRate (BER) of 0.48\\% across ten common attacks, a remarkable reduction of over\n2800\\% in BER compared to the state-of-the-art watermarking tool. See\nhttps://aka.ms/wavmark for demos of our work.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:17:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Guangyu",""],["Wu","Yu",""],["Liu","Shujie",""],["Liu","Tao",""],["Du","Xiaoyong",""],["Wei","Furu",""]]}
{"id":"2308.12771","submitter":"Andrzej Stupakiewicz","authors":"T. Zalewski, V. Ozerov, A. Maziewski, I. Razdolski and A. Stupakiewicz","title":"Non-reciprocal coherent all-optical switching between magnetic\n  multi-states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present experimental and computational findings of the laser-induced\nnon-reciprocal motion of magnetization during ultrafast photo-magnetic\nswitching in garnets. We found distinct coherent magnetization precession\ntrajectories and switching times between four magnetization states, depending\non both directions of the light linear polarization and initial magnetic state.\nAs a fingerprint of the topological symmetry, the choice of the switching\ntrajectory is governed by an interplay of the photo-magnetic torque and\nmagnetic anisotropy. Our results open a plethora of possibilities for designing\nenergy-efficient magnetization switching routes at arbitrary energy landscapes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:18:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zalewski","T.",""],["Ozerov","V.",""],["Maziewski","A.",""],["Razdolski","I.",""],["Stupakiewicz","A.",""]]}
{"id":"2308.12772","submitter":"Taisuke Kobayashi","authors":"Taisuke Kobayashi","title":"Intentionally-underestimated Value Function at Terminal State for\n  Temporal-difference Learning with Mis-designed Reward","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robot control using reinforcement learning has become popular, but its\nlearning process generally terminates halfway through an episode for safety and\ntime-saving reasons. This study addresses the problem of the most popular\nexception handling that temporal-difference (TD) learning performs at such\ntermination. That is, by forcibly assuming zero value after termination,\nunintentionally implicit underestimation or overestimation occurs, depending on\nthe reward design in the normal states. When the episode is terminated due to\ntask failure, the failure may be highly valued with the unintentional\noverestimation, and the wrong policy may be acquired. Although this problem can\nbe avoided by paying attention to the reward design, it is essential in\npractical use of TD learning to review the exception handling at termination.\nThis paper therefore proposes a method to intentionally underestimate the value\nafter termination to avoid learning failures due to the unintentional\noverestimation. In addition, the degree of underestimation is adjusted\naccording to the degree of stationarity at termination, thereby preventing\nexcessive exploration due to the intentional underestimation. Simulations and\nreal robot experiments showed that the proposed method can stably obtain the\noptimal policies for various tasks and reward designs.\nhttps://youtu.be/AxXr8uFOe7M\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:21:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kobayashi","Taisuke",""]]}
{"id":"2308.12773","submitter":"Zhongxing Yu","authors":"Yali Du, Zhongxing Yu","title":"Pre-training Code Representation with Semantic Flow Graph for Effective\n  Bug Localization","comments":"Accepted by 31st ACM Joint European Software Engineering Conference\n  and Symposium on the Foundations of Software Engineering (ESEC/FSE'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Enlightened by the big success of pre-training in natural language\nprocessing, pre-trained models for programming languages have been widely used\nto promote code intelligence in recent years. In particular, BERT has been used\nfor bug localization tasks and impressive results have been obtained. However,\nthese BERT-based bug localization techniques suffer from two issues. First, the\npre-trained BERT model on source code does not adequately capture the deep\nsemantics of program code. Second, the overall bug localization models neglect\nthe necessity of large-scale negative samples in contrastive learning for\nrepresentations of changesets and ignore the lexical similarity between bug\nreports and changesets during similarity estimation. We address these two\nissues by 1) proposing a novel directed, multiple-label code graph\nrepresentation named Semantic Flow Graph (SFG), which compactly and adequately\ncaptures code semantics, 2) designing and training SemanticCodeBERT based on\nSFG, and 3) designing a novel Hierarchical Momentum Contrastive Bug\nLocalization technique (HMCBL). Evaluation results show that our method\nachieves state-of-the-art performance in bug localization.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:25:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Du","Yali",""],["Yu","Zhongxing",""]]}
{"id":"2308.12774","submitter":"Changxu Cheng","authors":"Changxu Cheng, Peng Wang, Cheng Da, Qi Zheng, Cong Yao","title":"LISTER: Neighbor Decoding for Length-Insensitive Scene Text Recognition","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The diversity in length constitutes a significant characteristic of text. Due\nto the long-tail distribution of text lengths, most existing methods for scene\ntext recognition (STR) only work well on short or seen-length text, lacking the\ncapability of recognizing longer text or performing length extrapolation. This\nis a crucial issue, since the lengths of the text to be recognized are usually\nnot given in advance in real-world applications, but it has not been adequately\ninvestigated in previous works. Therefore, we propose in this paper a method\ncalled Length-Insensitive Scene TExt Recognizer (LISTER), which remedies the\nlimitation regarding the robustness to various text lengths. Specifically, a\nNeighbor Decoder is proposed to obtain accurate character attention maps with\nthe assistance of a novel neighbor matrix regardless of the text lengths.\nBesides, a Feature Enhancement Module is devised to model the long-range\ndependency with low computation cost, which is able to perform iterations with\nthe neighbor decoder to enhance the feature map progressively. To the best of\nour knowledge, we are the first to achieve effective length-insensitive scene\ntext recognition. Extensive experiments demonstrate that the proposed LISTER\nalgorithm exhibits obvious superiority on long text recognition and the ability\nfor length extrapolation, while comparing favourably with the previous\nstate-of-the-art methods on standard benchmarks for STR (mainly short text).\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:26:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cheng","Changxu",""],["Wang","Peng",""],["Da","Cheng",""],["Zheng","Qi",""],["Yao","Cong",""]]}
{"id":"2308.12775","submitter":"Prima Aditya","authors":"Prima Aditya and Herbert Werner","title":"A Distributed Linear Quadratic Discrete-Time Game Approach to Formation\n  Control with Collision Avoidance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Formation control problems can be expressed as linear quadratic discrete-time\ngames (LQDTG) for which Nash equilibrium solutions are sought. However, solving\nsuch problems requires solving coupled Riccati equations, which cannot be done\nin a distributed manner. A recent study showed that a distributed\nimplementation is possible for a consensus problem when fictitious agents are\nassociated with edges in the network graph rather than nodes. This paper\nproposes an extension of this approach to formation control with collision\navoidance, where collision is precluded by including appropriate penalty terms\non the edges. To address the problem, a state-dependent Riccati equation needs\nto be solved since the collision avoidance term in the cost function leads to a\nstate-dependent weight matrix. This solution provides relative control inputs\nassociated with the edges of the network graph. These relative inputs then need\nto be mapped to the physical control inputs applied at the nodes; this can be\ndone in a distributed manner by iterating over a gradient descent search\nbetween neighbors in each sampling interval. Unlike inter-sample iteration\nfrequently used in distributed MPC, only a matrix-vector multiplication is\nneeded for each iteration step here, instead of an optimization problem to be\nsolved. This approach can be implemented in a receding horizon manner, this is\ndemonstrated through a numerical example.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:27:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Aditya","Prima",""],["Werner","Herbert",""]]}
{"id":"2308.12776","submitter":"Roy Maman","authors":"Roy Maman, Eitan Mualem, Noa Mazurski, Jacob Engelberg and Uriel Levy","title":"Achromatic imaging systems with flat lenses enabled by deep learning","comments":"15 pages and 3 supplementary pages, 5 figures and 3 supplementary\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by their great potential to reduce the size, cost and weight, flat\nlenses, a category that includes diffractive lenses and metalenses, are rapidly\nemerging as key components with the potential to replace the traditional\nrefractive optical elements in modern optical systems. Yet, the inherently\nstrong chromatic aberration of these flat lenses is significantly impairing\ntheir performance in systems based on polychromatic illumination or passive\nambient light illumination, stalling their widespread implementation. Hereby,\nwe provide a promising solution and demonstrate high quality imaging based on\nflat lenses over the entire visible spectrum. Our approach is based on creating\na novel dataset of color outdoor images taken with our flat lens and using this\ndataset to train a deep-learning model for chromatic aberrations correction.\nBased on this approach we show unprecedented imaging results not only in terms\nof qualitative measures but also in the quantitative terms of the PSNR and SSIM\nscores of the reconstructed images. The results pave the way for the\nimplementation of flat lenses in advanced polychromatic imaging systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:27:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maman","Roy",""],["Mualem","Eitan",""],["Mazurski","Noa",""],["Engelberg","Jacob",""],["Levy","Uriel",""]]}
{"id":"2308.12777","submitter":"Xin Xia","authors":"Xin Xia, Junliang Yu, Guandong Xu and Hongzhi Yin","title":"Towards Communication-Efficient Model Updating for On-Device\n  Session-Based Recommendation","comments":"cikm2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On-device recommender systems recently have garnered increasing attention due\nto their advantages of providing prompt response and securing privacy. To stay\ncurrent with evolving user interests, cloud-based recommender systems are\nperiodically updated with new interaction data. However, on-device models\nstruggle to retrain themselves because of limited onboard computing resources.\nAs a solution, we consider the scenario where the model retraining occurs on\nthe server side and then the updated parameters are transferred to edge devices\nvia network communication. While this eliminates the need for local retraining,\nit incurs a regular transfer of parameters that significantly taxes network\nbandwidth. To mitigate this issue, we develop an efficient approach based on\ncompositional codes to compress the model update. This approach ensures the\non-device model is updated flexibly with minimal additional parameters whilst\nutilizing previous knowledge. The extensive experiments conducted on multiple\nsession-based recommendation models with distinctive architectures demonstrate\nthat the on-device model can achieve comparable accuracy to the retrained\nserver-side counterpart through transferring an update 60x smaller in size. The\ncodes are available at \\url{https://github.com/xiaxin1998/ODUpdate}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:27:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xia","Xin",""],["Yu","Junliang",""],["Xu","Guandong",""],["Yin","Hongzhi",""]]}
{"id":"2308.12778","submitter":"Victor Champain","authors":"Victor Champain, Vivien Schmitt, Benoit Bertrand, Heimanu Niebojewski,\n  Romain Maurand, Xavier Jehl, Clemens Winkelmann, Silvano De Franceschi and\n  Boris Brun","title":"Real-time milli-Kelvin thermometry in a semiconductor qubit architecture","comments":"7 pages 4 figures (supp. mat. 6 pages and 5 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report local time-resolved thermometry in a silicon nanowire quantum dot\ndevice designed to host a linear array of spin qubits. Using two alternative\nmeasurement schemes based on rf reflectometry, we are able to probe either\nlocal electron or phonon temperatures with $\\mu$s-scale time resolution and a\nnoise equivalent temperature of $3$ $\\rm mK/\\sqrt{\\rm Hz}$. Following the\napplication of short microwave pulses, causing local periodic heating,\ntime-dependent thermometry can track the dynamics of thermal excitation and\nrelaxation, revealing clearly different characteristic time scales. This work\nopens important prospects to investigate the out-of-equilibrium thermal\nproperties of semiconductor quantum electronic devices operating at very low\ntemperature. In particular, it may provide a powerful handle to understand\nheating effects recently observed in semiconductor spin-qubit systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:28:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Champain","Victor",""],["Schmitt","Vivien",""],["Bertrand","Benoit",""],["Niebojewski","Heimanu",""],["Maurand","Romain",""],["Jehl","Xavier",""],["Winkelmann","Clemens",""],["De Franceschi","Silvano",""],["Brun","Boris",""]]}
{"id":"2308.12779","submitter":"Katrin Renz","authors":"Tim Schreier, Katrin Renz, Andreas Geiger, Kashyap Chitta","title":"On Offline Evaluation of 3D Object Detection for Autonomous Driving","comments":"Appears in: IEEE International Conference on Computer Vision\n  (ICCV'23) Workshops","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prior work in 3D object detection evaluates models using offline metrics like\naverage precision since closed-loop online evaluation on the downstream driving\ntask is costly. However, it is unclear how indicative offline results are of\ndriving performance. In this work, we perform the first empirical evaluation\nmeasuring how predictive different detection metrics are of driving performance\nwhen detectors are integrated into a full self-driving stack. We conduct\nextensive experiments on urban driving in the CARLA simulator using 16 object\ndetection models. We find that the nuScenes Detection Score has a higher\ncorrelation to driving performance than the widely used average precision\nmetric. In addition, our results call for caution on the exclusive reliance on\nthe emerging class of `planner-centric' metrics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:31:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Schreier","Tim",""],["Renz","Katrin",""],["Geiger","Andreas",""],["Chitta","Kashyap",""]]}
{"id":"2308.12780","submitter":"Simon Dannenberg","authors":"Simon Dannenberg, Jonas Penning, Alexander Simm, and Stefan Klumpp","title":"The motility-matrix production switch in Bacillus subtilis -- a modeling\n  perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph nlin.CD q-bio.CB q-bio.MN q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Phenotype switching can be triggered by external stimuli and by intrinsic\nstochasticity. Here, we focus on the motility-matrix production switch in\nBacillus subtilis. We use modeling to describe the SinR-SlrR bistable switch\nits regulation by SinI, and to distinguish different sources of stochasticity.\nOur simulations indicate that intrinsic fluctuations in the synthesis of SinI\nare insufficient to drive spontaneous switching and suggest that switching is\ntriggered by upstream noise from the Spo0A phosphorelay.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:34:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dannenberg","Simon",""],["Penning","Jonas",""],["Simm","Alexander",""],["Klumpp","Stefan",""]]}
{"id":"2308.12781","submitter":"Vanni Noferini","authors":"Froil\\'an Dopico, Vanni Noferini, Lauri Nyman","title":"A Riemannian optimization method to compute the nearest singular pencil","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given a square pencil $A+ \\lambda B$, where $A$ and $B$ are complex matrices,\nwe consider the problem of finding the singular pencil nearest to it in the\nFrobenius distance. This problem is known to be very difficult, and the few\nalgorithms available in the literature can only deal efficiently with pencils\nof very small size. We show that the problem is equivalent to minimizing a\ncertain objective function over the Riemannian manifold $SU(n) \\times SU(n)$,\nwhere $SU(n)$ denotes the special unitary group. With minor modifications, the\nsame approach extends to the case of finding a nearest singular pencil with a\nspecified minimal index. This novel perspective is based on the generalized\nSchur form of pencils, and yields a competitive numerical method, by pairing it\nwith an algorithm capable of doing optimization on a Riemannian manifold. We\nprovide numerical experiments that show that the resulting method allows us to\ndeal with pencils of much larger size than alternative techniques, yielding\ncandidate minimizers of comparable or better quality. In the course of our\nanalysis, we also obtain a number of new theoretical results related to the\ngeneralized Schur form of a (regular or singular) square pencil and to the\nminimal index of a singular square pencil whose nullity is $1$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:37:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dopico","Froil\u00e1n",""],["Noferini","Vanni",""],["Nyman","Lauri",""]]}
{"id":"2308.12782","submitter":"Zhou Zhou","authors":"Zhou Zhou (1 and 5), Yiheng Zhang (2), Yingxin Xie (1), Tian Huang\n  (1), Zile Li (1 and 3), Peng Chen (2), Yanqing Lu (2), Shaohua Yu (3), Shuang\n  Zhang (6 and 7), Guoxing Zheng (1, 3 and 4)((1) Electronic Information\n  School, and School of Microelectronics, Wuhan University, Wuhan, 430072\n  China, (2) National Laboratory of Solid State Microstructures, Key Laboratory\n  of Intelligent Optical Sensing and Manipulation, and College of Engineering\n  and Applied Sciences, Nanjing University, Nanjing, 210093 China, (3) Peng\n  Cheng Laboratory, Shenzhen, 518055 China, (4) Wuhan Institute of Quantum\n  Technology, Wuhan, 430206 China, (5) NUS Graduate School, National University\n  of Singapore, Singapore 119077, Singapore, (6) New Cornerstone Science\n  Laboratory, Department of Physics, University of Hong Kong, Hong Kong, China,\n  (7) Department of Electrical and Electronic Engineering, University of Hong\n  Kong, Hong Kong, China)","title":"Spectral lens enables a minimalist framework for hyperspectral imaging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional lens-based imaging techniques have long been limited to\ncapturing only the intensity distribution of objects, resulting in the loss of\nother crucial dimensions such as spectral data. Here, we report a spectral lens\nthat captures both spatial and spectral information, and further demonstrate a\nminimalist framework wherein hyperspectral imaging can be readily achieved by\nreplacing lenses in standard cameras with our spectral lens. As a paradigm, we\ncapitalize on planar liquid crystal optics to implement the proposed framework.\nOur experiments with various targets show that the resulting hyperspectral\ncamera exhibits excellent performance in both spectral and spatial domains.\nWith merits such as ultra-compactness and strong compatibility, our framework\npaves a practical pathway for advancing hyperspectral imaging apparatus toward\nminiaturization, with great potential for portable applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:37:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhou","Zhou","","1 and 5"],["Zhang","Yiheng","","1 and 3"],["Xie","Yingxin","","1 and 3"],["Huang","Tian","","1 and 3"],["Li","Zile","","1 and 3"],["Chen","Peng","","6 and 7"],["Lu","Yanqing","","6 and 7"],["Yu","Shaohua","","6 and 7"],["Zhang","Shuang","","6 and 7"],["Zheng","Guoxing","","1, 3 and 4"]]}
{"id":"2308.12783","submitter":"Jan Robert Schmidt","authors":"Jan Robert Schmidt, Roland Ketzmerick","title":"Resonance states of the three-disk scattering system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CD quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We confirm the factorization conjecture for resonance states in open chaotic\nsystems in the paradigmatic three-disk scattering system. In particular, we\ndemonstrate that one factor is given by universal exponentially distributed\nintensity fluctuations. The other factor, supposed to be a classical density\ndepending on the lifetime of the resonance state, is found to be very well\ndescribed by a classical construction. Furthermore, ray-segment scars, recently\nobserved in dielectric cavities, dominate every resonance state at small\nwavelengths also in the three-disk scattering system. We introduce a new\nnumerical method for computing resonances, which allows for going much further\ninto the semiclassical limit. As a consequence we are able to confirm the\nfractal Weyl law over a correspondingly large range.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:38:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Schmidt","Jan Robert",""],["Ketzmerick","Roland",""]]}
{"id":"2308.12784","submitter":"Xiaolin Chang","authors":"Jing Bai, Xiaolin Chang, Fumio Machida, Kishor S. Trivedi","title":"Understanding Container-based Services under Software Aging:\n  Dependability and Performance Views","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Container technology, as the key enabler behind microservice architectures,\nis widely applied in Cloud and Edge Computing. A long and continuous running of\noperating system (OS) host-ing container-based services can encounter software\naging that leads to performance deterioration and even causes system fail-ures.\nOS rejuvenation techniques can mitigate the impact of software aging but the\nrejuvenation trigger interval needs to be carefully determined to reduce the\ndowntime cost due to rejuve-nation. This paper proposes a comprehensive\nsemi-Markov-based approach to quantitatively evaluate the effect of OS\nreju-venation on the dependability and the performance of a con-tainer-based\nservice. In contrast to the existing studies, we nei-ther restrict the\ndistributions of time intervals of events to be exponential nor assume that\nbackup resources are always avail-able. Through the numerical study, we show\nthe optimal con-tainer-migration trigger intervals that can maximize the\nde-pendability or minimize the performance of a container-based service.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:40:26 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bai","Jing",""],["Chang","Xiaolin",""],["Machida","Fumio",""],["Trivedi","Kishor S.",""]]}
{"id":"2308.12785","submitter":"Kai Brach","authors":"Kai Brach, Beate Sick, Oliver D\\\"urr","title":"Single-shot Bayesian approximation for neural networks","comments":"arXiv admin note: text overlap with arXiv:2007.03293","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep neural networks (NNs) are known for their high-prediction performances.\nHowever, NNs are prone to yield unreliable predictions when encountering\ncompletely new situations without indicating their uncertainty. Bayesian\nvariants of NNs (BNNs), such as Monte Carlo (MC) dropout BNNs, do provide\nuncertainty measures and simultaneously increase the prediction performance.\nThe only disadvantage of BNNs is their higher computation time during test time\nbecause they rely on a sampling approach. Here we present a single-shot MC\ndropout approximation that preserves the advantages of BNNs while being as fast\nas NNs. Our approach is based on moment propagation (MP) and allows to\nanalytically approximate the expected value and the variance of the MC dropout\nsignal for commonly used layers in NNs, i.e. convolution, max pooling, dense,\nsoftmax, and dropout layers. The MP approach can convert an NN into a BNN\nwithout re-training given the NN has been trained with standard dropout. We\nevaluate our approach on different benchmark datasets and a simulated toy\nexample in a classification and regression setting. We demonstrate that our\nsingle-shot MC dropout approximation resembles the point estimate and the\nuncertainty estimate of the predictive distribution that is achieved with an MC\napproach, while being fast enough for real-time deployments of BNNs. We show\nthat using part of the saved time to combine our MP approach with deep ensemble\ntechniques does further improve the uncertainty measures.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:40:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Brach","Kai",""],["Sick","Beate",""],["D\u00fcrr","Oliver",""]]}
{"id":"2308.12786","submitter":"He Xin","authors":"He Xin","title":"Some Finiteness Results on Oda's Question for Pairs of Line Bundles","comments":"Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work we prove up to finitely many exceptions any ample line bundle on\na given smooth projective toric threefold is projectively normal.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:40:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xin","He",""]]}
{"id":"2308.12787","submitter":"Marine Cases-Thomas","authors":"Marine Cases-Thomas","title":"On a question of Matt Baker regarding the dollar game","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In an introductory paper on dollar game played on a graph, Matt Baker wrote\nthe following: ``The total number of borrowing moves required to win the game\nwhen playing the 'borrowing binge strategy' is independent of which borrowing\nmoves you do in which order! Note, however, that it is usually possible to win\nin fewer moves by employing lending moves in combination with borrowing moves.\nThe optimal strategy when one uses both kinds of moves is not yet understood.''\n  In this article, we give a lower bound on the minimum number $ M_{\\text{min}}\n$ of such moves of an optimal algorithm in terms of the number of moves $ M_0 $\nof the borrowing binge strategy. Concretely, we have: $ M_{\\text{min}} \\geq\n\\frac{M_0}{n-1} $ where $ n $ is the number of vertices of the graph. This\nbound is tight.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:41:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cases-Thomas","Marine",""]]}
{"id":"2308.12788","submitter":"Zhongxing Yu","authors":"Lantian Li, Yejian Liang, Zhihao Liu, Zhongxing Yu","title":"Understanding Solidity Event Logging Practices in the Wild","comments":"Accepted by 31st ACM Joint European Software Engineering Conference\n  and Symposium on the Foundations of Software Engineering (ESEC/FSE'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Writing logging messages is a well-established conventional programming\npractice, and it is of vital importance for a wide variety of software\ndevelopment activities. The logging mechanism in Solidity programming is\nenabled by the high-level event feature, but up to now there lacks study for\nunderstanding Solidity event logging practices in the wild. To fill this gap,\nwe in this paper provide the first quantitative characteristic study of the\ncurrent Solidity event logging practices using 2,915 popular Solidity projects\nhosted on GitHub. The study methodically explores the pervasiveness of event\nlogging, the goodness of current event logging practices, and in particular the\nreasons for event logging code evolution, and delivers 8 original and important\nfindings. The findings notably include the existence of a large percentage of\nindependent event logging code modifications, and the underlying reasons for\ndifferent categories of independent event logging code modifications are\ndiverse (for instance, bug fixing and gas saving). We additionally give the\nimplications of our findings, and these implications can enlighten developers,\nresearchers, tool builders, and language designers to improve the event logging\npractices. To illustrate the potential benefits of our study, we develop a\nproof-of-concept checker on top of one of our findings and the checker\neffectively detects problematic event logging code that consumes extra gas in\n35 popular GitHub projects and 9 project owners have already confirmed the\ndetected issues.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:41:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Lantian",""],["Liang","Yejian",""],["Liu","Zhihao",""],["Yu","Zhongxing",""]]}
{"id":"2308.12789","submitter":"Zongyu Li","authors":"Zongyu Li, Ian Reyes, Homa Alemzadeh","title":"Robotic Scene Segmentation with Memory Network for Runtime Surgical\n  Context Inference","comments":"accepted at The IEEE/RSJ International Conference on Intelligent\n  Robots and Systems (IROS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surgical context inference has recently garnered significant attention in\nrobot-assisted surgery as it can facilitate workflow analysis, skill\nassessment, and error detection. However, runtime context inference is\nchallenging since it requires timely and accurate detection of the interactions\namong the tools and objects in the surgical scene based on the segmentation of\nvideo data. On the other hand, existing state-of-the-art video segmentation\nmethods are often biased against infrequent classes and fail to provide\ntemporal consistency for segmented masks. This can negatively impact the\ncontext inference and accurate detection of critical states. In this study, we\npropose a solution to these challenges using a Space Time Correspondence\nNetwork (STCN). STCN is a memory network that performs binary segmentation and\nminimizes the effects of class imbalance. The use of a memory bank in STCN\nallows for the utilization of past image and segmentation information, thereby\nensuring consistency of the masks. Our experiments using the publicly available\nJIGSAWS dataset demonstrate that STCN achieves superior segmentation\nperformance for objects that are difficult to segment, such as needle and\nthread, and improves context inference compared to the state-of-the-art. We\nalso demonstrate that segmentation and context inference can be performed at\nruntime without compromising performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:44:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Zongyu",""],["Reyes","Ian",""],["Alemzadeh","Homa",""]]}
{"id":"2308.12790","submitter":"Mohammad Shahryari","authors":"M. Shahryari and M. Rostami","title":"The Haar measure of a profinite $n$-ary group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that every profinite $n$-ary group $(G, f)=\\Gf$ has a unique Haar\nmeasure $m_p$ and further for every measurable subset $A\\subseteq G$, we have\n$$ m_p(A)=m(A)=(n-1)m^{\\ast}(A) $$ where $m$ and $m^{\\ast}$ are the normalized\nHaar measures of the profinite groups $(G, \\bullet)$ and the Post cover\n$G^{\\ast}$, respectively.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:45:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shahryari","M.",""],["Rostami","M.",""]]}
{"id":"2308.12791","submitter":"Lijie Zhang","authors":"Bo Li, Jing Wang, Qilong Wu, Qiwei Tian, Ping Li, Li Zhang, Long-Jing\n  Yin, Yuan Tian, Ping Kwan Johnny Wong, Zhihui Qin, and Lijie Zhang","title":"Nanopore-patterned CuSe drives the realization of PbSe-CuSe lateral\n  heterostructure","comments":"26 pagres, 6 Figures","journal-ref":"ACS Appl Mater Interfaces 2022, 14, 32738-32746","doi":"10.1021/acsami.2c08397","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Monolayer PbSe has been predicted to be a two-dimensional (2D) topological\ncrystalline insulator (TCI) with crystalline symmetry-protected Dirac-cone-like\nedge states. Recently, few-layered epitaxial PbSe has been grown on the SrTiO3\nsubstrate successfully, but the corresponding signature of the TCI was only\nobserved for films not thinner than seven monolayers, largely due to\ninterfacial strain. Here, we demonstrate a two-step method based on molecular\nbeam epitaxy for the growth of the PbSe-CuSe lateral heterostructure on the\nCu(111) substrate, in which we observe a nanopore patterned CuSe layer that\nacts as the template for lateral epitaxial growth of PbSe. This further results\nin a monolayer PbSe-CuSe lateral heterostructure with an atomically sharp\ninterface. Scanning tunneling microscopy and spectroscopy measurements reveal a\nfour-fold symmetric square lattice of such monolayer PbSe with a quasi-particle\nband gap of 1.8 eV, a value highly comparable with the theoretical value of\nfreestanding PbSe. The weak monolayer-substrate interaction is further\nsupported by both density functional theory (DFT) and projected crystal orbital\nHamilton population, with the former predicting the monolayer's anti-bond state\nto reside below the Fermi level. Our work demonstrates a practical strategy to\nfabricate a high-quality in-plane heterostructure, involving a monolayer TCI,\nwhich is viable for further exploration of the topology-derived quantum physics\nand phenomena in the monolayer limit.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:46:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Bo",""],["Wang","Jing",""],["Wu","Qilong",""],["Tian","Qiwei",""],["Li","Ping",""],["Zhang","Li",""],["Yin","Long-Jing",""],["Tian","Yuan",""],["Wong","Ping Kwan Johnny",""],["Qin","Zhihui",""],["Zhang","Lijie",""]]}
{"id":"2308.12792","submitter":"Siddique Latif","authors":"Siddique Latif, Moazzam Shoukat, Fahad Shamshad, Muhammad Usama,\n  Heriberto Cuay\\'ahuitl, and Bj\\\"orn W. Schuller","title":"Sparks of Large Audio Models: A Survey and Outlook","comments":"work in progress, Repo URL:\n  https://github.com/EmulationAI/awesome-large-audio-models","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This survey paper provides a comprehensive overview of the recent\nadvancements and challenges in applying large language models to the field of\naudio signal processing. Audio processing, with its diverse signal\nrepresentations and a wide range of sources--from human voices to musical\ninstruments and environmental sounds--poses challenges distinct from those\nfound in traditional Natural Language Processing scenarios. Nevertheless,\n\\textit{Large Audio Models}, epitomized by transformer-based architectures,\nhave shown marked efficacy in this sphere. By leveraging massive amount of\ndata, these models have demonstrated prowess in a variety of audio tasks,\nspanning from Automatic Speech Recognition and Text-To-Speech to Music\nGeneration, among others. Notably, recently these Foundational Audio Models,\nlike SeamlessM4T, have started showing abilities to act as universal\ntranslators, supporting multiple speech tasks for up to 100 languages without\nany reliance on separate task-specific systems. This paper presents an in-depth\nanalysis of state-of-the-art methodologies regarding \\textit{Foundational Large\nAudio Models}, their performance benchmarks, and their applicability to\nreal-world scenarios. We also highlight current limitations and provide\ninsights into potential future research directions in the realm of\n\\textit{Large Audio Models} with the intent to spark further discussion,\nthereby fostering innovation in the next generation of audio-processing\nsystems. Furthermore, to cope with the rapid development in this area, we will\nconsistently update the relevant repository with relevant recent articles and\ntheir open-source implementations at\nhttps://github.com/EmulationAI/awesome-large-audio-models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:47:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Latif","Siddique",""],["Shoukat","Moazzam",""],["Shamshad","Fahad",""],["Usama","Muhammad",""],["Cuay\u00e1huitl","Heriberto",""],["Schuller","Bj\u00f6rn W.",""]]}
{"id":"2308.12793","submitter":"Tim Engels","authors":"Tim Engels, Ivo Adan, Onno Boxma, and Jacques Resing","title":"Batch sojourn time in polling systems on a circle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we analyze a polling system on a circle. Random batches of\ncustomers arrive at a circle, where each customer, independently, obtains a\nuniform location. A single server cyclically travels over the circle to serve\nall customers. Using mean value analysis, we derive the expected number of\nwaiting customers within a given distance of the server and a closed form\nexpression for the mean batch sojourn time.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:49:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Engels","Tim",""],["Adan","Ivo",""],["Boxma","Onno",""],["Resing","Jacques",""]]}
{"id":"2308.12794","submitter":"Zaharah A. Bukhsh","authors":"Robbert Reijnen, Kjell van Straaten, Zaharah Bukhsh, Yingqian Zhang","title":"Job Shop Scheduling Benchmark: Environments and Instances for Learning\n  and Non-learning Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce an open-source GitHub repository containing comprehensive\nbenchmarks for a wide range of machine scheduling problems, including Job Shop\nScheduling (JSP), Flow Shop Scheduling (FSP), Flexible Job Shop Scheduling\n(FJSP), FJSP with Assembly constraints (FAJSP), FJSP with Sequence-Dependent\nSetup Times (FJSP-SDST), and the online FJSP (with online job arrivals). Our\nprimary goal is to provide a centralized hub for researchers, practitioners,\nand enthusiasts interested in tackling machine scheduling challenges.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:49:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Reijnen","Robbert",""],["van Straaten","Kjell",""],["Bukhsh","Zaharah",""],["Zhang","Yingqian",""]]}
{"id":"2308.12795","submitter":"Priyanka Bhoyar","authors":"Naval R. Sabe, Priyanka D. Bhoyar, and Prashant M. Gade","title":"Universality class of replica synchronization transition of smooth\n  coupled map lattices in the presence of quenched disorder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Synchronization of two replicas of coupled map lattices for continuous maps\nis known to be in the multiplicative noise universality class. We study this\ntransition in presence of identical quenched disorder in coupling in both\nreplicas for coupled logistic and tent maps. We study one-dimensional,\ntwo-dimensional, and globally coupled cases. We observe a clear second-order\ntransition with new exponents. The order parameter decays as $t^{-\\delta}$ with\n$\\delta=2$ for tent map and $\\delta=3$ for logistic map in any dimension. The\nasymptotic order parameter grows as $\\Delta^{\\beta}$ with $\\beta=2$ for the\ntent map and $\\beta=3$ for the logistic map. The quenched disorder in coupling\nis a relevant perturbation for the replica synchronization of coupled map\nlattices. The critical exponents are different from that of the multiplicative\nnoise universality class. We observe that the critical exponents are\nindependent of dimensions and super-universal in nature.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:50:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sabe","Naval R.",""],["Bhoyar","Priyanka D.",""],["Gade","Prashant M.",""]]}
{"id":"2308.12796","submitter":"Violeta Borges Marques","authors":"Violeta Borges Marques, Arne Mertens","title":"The category of necklaces is Reedy monoidal","comments":"15 pages, no figures, comments welcome; v2: removed typos, changed\n  notation, updated acknowledgements","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the first part of this note we further the study of the interactions\nbetween Reedy and monoidal structures on a small category, building upon the\nwork of Barwick. We define a Reedy monoidal category as a Reedy category\n$\\mathcal{R}$ which is monoidal such that for all symmetric monoidal model\ncategories $\\textbf{A}$, the category\n$\\mathrm{Fun}\\left(\\mathcal{R}^{\\mathrm{op}},\n\\textbf{A}\\right)_{\\mathrm{Reedy}}$ is model monoidal when equipped with the\nDay convolution. In the second part, we study the category $\\mathcal{N}ec$ of\nnecklaces, as defined by Baues and Dugger-Spivak. Making use of the\ncombinatorial description present in arXiv:2302.02484v1, we streamline some\nproofs from the literature, and finally show that $\\mathcal{N}ec$ is simple\nReedy monoidal.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:54:32 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 08:02:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Marques","Violeta Borges",""],["Mertens","Arne",""]]}
{"id":"2308.12797","submitter":"Licheng Wen","authors":"Licheng Wen, Ze Fu, Pinlong Cai, Daocheng Fu, Song Mao, Botian Shi","title":"TrafficMCTS: A Closed-Loop Traffic Flow Generation Framework with\n  Group-Based Monte Carlo Tree Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.MA cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Digital twins for intelligent transportation systems are currently attracting\ngreat interests, in which generating realistic, diverse, and human-like traffic\nflow in simulations is a formidable challenge. Current approaches often hinge\non predefined driver models, objective optimization, or reliance on\npre-recorded driving datasets, imposing limitations on their scalability,\nversatility, and adaptability. In this paper, we introduce TrafficMCTS, an\ninnovative framework that harnesses the synergy of groupbased Monte Carlo tree\nsearch (MCTS) and Social Value Orientation (SVO) to engender a multifaceted\ntraffic flow replete with varying driving styles and cooperative tendencies.\nAnchored by a closed-loop architecture, our framework enables vehicles to\ndynamically adapt to their environment in real time, and ensure feasible\ncollision-free trajectories. Through comprehensive comparisons with\nstate-of-the-art methods, we illuminate the advantages of our approach in terms\nof computational efficiency, planning success rate, intent completion time, and\ndiversity metrics. Besides, we simulate highway and roundabout scenarios to\nillustrate the effectiveness of the proposed framework and highlight its\nability to induce diverse social behaviors within the traffic flow. Finally, we\nvalidate the scalability of TrafficMCTS by showcasing its prowess in\nsimultaneously mass vehicles within a sprawling road network, cultivating a\nlandscape of traffic flow that mirrors the intricacies of human behavior.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:56:22 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 15:32:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wen","Licheng",""],["Fu","Ze",""],["Cai","Pinlong",""],["Fu","Daocheng",""],["Mao","Song",""],["Shi","Botian",""]]}
{"id":"2308.12798","submitter":"Peter Greenstreet","authors":"Peter Greenstreet, Thomas Jaki, Alun Bedding, Pavel Mozgunov","title":"A preplanned multi-stage platform trial for discovering multiple\n  superior treatments with control of FWER and power","comments":"31 page, 4 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a growing interest in the implementation of platform trials, which\nprovide the flexibility to incorporate new treatment arms during the trial and\nthe ability to halt treatments early based on lack of benefit or observed\nsuperiority. In such trials, it can be important to ensure that error rates are\ncontrolled. This paper introduces a multi-stage design that enables the\naddition of new treatment arms, at any point, in a pre-planned manner within a\nplatform trial, while still maintaining control over the family-wise error\nrate. This paper focuses on finding the required sample size to achieve a\ndesired level of statistical power when treatments are continued to be tested\neven after a superior treatment has already been found. This may be of interest\nif there are other sponsors treatments which are also superior to the current\ncontrol or multiple doses being tested. The calculations to determine the\nexpected sample size is given. A motivating trial is presented in which the\nsample size of different configurations is studied. Additionally the approach\nis compared to running multiple separate trials and it is shown that in many\nscenarios if family wise error rate control is needed there may not be benefit\nin using a platform trial when comparing the sample size of the trial.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:57:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Greenstreet","Peter",""],["Jaki","Thomas",""],["Bedding","Alun",""],["Mozgunov","Pavel",""]]}
{"id":"2308.12799","submitter":"Vitalij Chatyrko","authors":"Vitalij A. Chatyrko","title":"On $\\pi$-compatible topologies and their special cases","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topologies $\\tau, \\sigma$ on a set $X$ are called $\\pi$-compatible if $\\tau$\nis a $\\pi$-network for $\\sigma$, and vice versa. If topologies $\\tau, \\sigma$\non a set $X$ are $\\pi$-compatible then the families of nowhere dense sets\n(resp. meager sets or sets possessing the Baire property) of the spaces $(X,\n\\tau)$ and $(X, \\sigma)$ coincide. A topology $\\sigma$ on a set $X$ is called\nan admissible extension of a topology $\\tau$ on $X$ if $\\tau \\subseteq \\sigma$\nand $\\tau$ is a $\\pi$-network for $\\sigma$. It turns out that examples of\nadmissible extensions were occurred in literature several times. In the paper\nwe provide some new facts about the $\\pi$-compatibility and the admissible\nextension as well as about their particular cases.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:58:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chatyrko","Vitalij A.",""]]}
{"id":"2308.12800","submitter":"Manel Mili","authors":"Manel Mili (FSM, TIM), Asma Kerkeni (ISIMM, TIM), Asma Ben Abdallah\n  (ISIMM, TIM), Mohamed Hedi Bedoui (TIM)","title":"ICU Mortality Prediction Using Long Short-Term Memory Networks","comments":null,"journal-ref":"Intelligent Data Engineering and Automated Learning - IDEAL 2022,\n  2022, Lecture Notes in Computer Science, 13756, pp.242-251","doi":"10.1007/978-3-031-21753-1_24","report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Extensive bedside monitoring in Intensive Care Units (ICUs) has resulted in\ncomplex temporal data regarding patient physiology, which presents an upscale\ncontext for clinical data analysis. In the other hand, identifying the\ntime-series patterns within these data may provide a high aptitude to predict\nclinical events. Hence, we investigate, during this work, the implementation of\nan automatic data-driven system, which analyzes large amounts of multivariate\ntemporal data derived from Electronic Health Records (EHRs), and extracts\nhigh-level information so as to predict in-hospital mortality and Length of\nStay (LOS) early. Practically, we investigate the applicability of LSTM network\nby reducing the time-frame to 6-hour so as to enhance clinical tasks. The\nexperimental results highlight the efficiency of LSTM model with rigorous\nmultivariate time-series measurements for building real-world prediction\nengines.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:44:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mili","Manel","","FSM, TIM"],["Kerkeni","Asma","","ISIMM, TIM"],["Abdallah","Asma Ben","","ISIMM, TIM"],["Bedoui","Mohamed Hedi","","TIM"]]}
{"id":"2308.12801","submitter":"Shivani Bhandari Dr","authors":"Shivani Bhandari, Benito Marcote, Navin Sridhar, Tarraneh Eftekhari,\n  Jason W. T. Hessels, Dant\\'e M. Hewitt, Franz Kirsten, Omar S.\n  Ould-Boukattine, Zsolt Paragi, Mark P. Snelders","title":"Constraints on the persistent radio source associated with FRB 20190520B\n  using the European VLBI Network","comments":"13 pages, 6 figures, Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present very-long-baseline interferometry (VLBI) observations of a\ncontinuum radio source potentially associated with the fast radio burst source\nFRB 20190520B. Using the European VLBI network (EVN), we find the source to be\ncompact on VLBI scales with an angular size of $<2.3$ mas ($3\\sigma$). This\ncorresponds to a transverse physical size of $<9$ pc (at the $z=0.241$ redshift\nof the host galaxy), confirming it to be an FRB persistent radio source (PRS)\nlike that associated with the first-known repeater FRB 20121102A. The PRS has a\nflux density of $201 \\pm 34 \\rm{\\mu Jy}$ at 1.7 GHz and a spectral radio\nluminosity of $L_{1.7 \\rm GHz} = (3.0 \\pm 0.5) \\times 10^{29}\\,\\mathrm{erg\ns^{-1} Hz^{-1}}$ (also similar to the FRB 20121102A PRS). Comparing to previous\nlower-resolution observations, we find that no flux is resolved out on\nmilliarcsecond scales. We have refined the PRS position, improving its\nprecision by an order of magnitude compared to previous results. We also report\nthe detection of a FRB 20190520B burst at 1.4 GHz and find the burst position\nto be consistent with the PRS position, at $\\lesssim20$ mas. This strongly\nsupports their direct physical association and the hypothesis that a single\ncentral engine powers both the bursts and the PRS. We discuss the model of a\nmagnetar in a wind nebula and present an allowed parameter space for its age\nand the radius of the putative nebula powering the observed PRS emission.\nAlternatively, we find that an accretion-powered 'hypernebula' model also fits\nour observational constraints.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:59:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bhandari","Shivani",""],["Marcote","Benito",""],["Sridhar","Navin",""],["Eftekhari","Tarraneh",""],["Hessels","Jason W. T.",""],["Hewitt","Dant\u00e9 M.",""],["Kirsten","Franz",""],["Ould-Boukattine","Omar S.",""],["Paragi","Zsolt",""],["Snelders","Mark P.",""]]}
{"id":"2308.12802","submitter":"Ben Snow","authors":"B. Snow, M. Druett, A. Hillier","title":"Partially-ionised two-fluid shocks with collisional and radiative\n  ionisation and recombination -- multi-level hydrogen model","comments":"Accepted for MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Explosive phenomena are known to trigger a wealth of shocks in warm plasma\nenvironments, including the solar chromosphere and molecular clouds where the\nmedium consists of both ionised and neutral species. Partial ionisation is\ncritical in determining the behaviour of shocks, since the ions and neutrals\nlocally decouple, allowing for substructure to exist within the shock.\nAccurately modelling partially ionised shocks requires careful treatment of the\nionised and neutral species, and their interactions. Here we study a\npartially-ionised switch-off slow-mode shock using a multi-level hydrogen model\nwith both collisional and radiative ionisation and recombination rates that are\nimplemented into the two-fluid (P\\underline{I}P) code, and study physical\nparameters that are typical of the solar chromosphere. The multi-level hydrogen\nmodel differs significantly from MHD solutions due to the macroscopic thermal\nenergy loss during collisional ionisation. In particular, the plasma\ntemperature both post-shock and within the finite-width is significantly cooler\nthat the post-shock MHD temperature. Furthermore, in the mid to lower\nchromosphere, shocks feature far greater compression then their single-fluid\nMHD analogues. The decreased temperature and increased compression reveal the\nimportance of non-equilibrium ionised in the thermal evolution of shocks in\npartially ionised media. Since partially ionised shocks are not accurately\ndescribed by the Rankine-Hugoniot shock jump conditions, it may be incorrect to\nuse these to infer properties of lower atmospheric shocks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:00:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Snow","B.",""],["Druett","M.",""],["Hillier","A.",""]]}
{"id":"2308.12803","submitter":"Thomas Schmidt","authors":"Thomas A. Schmidt and Mesa Walker","title":"Distinctness of two pseudo-Anosov maps","comments":"17 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1981, Arnoux and Yoccoz gave the first examples of pseudo-Anosov maps with\nodd degree stretch factors. In 1985, D.~Fried deduced the existence of a\npseudo-Anosov map in genus three with the same stretch factor as the\nArnoux-Yoccoz example in that genus, and asked if these were the same. We show\nthat they are distinct. We do this by, in a sense, reversing Fried's\nconstruction; we show that the mapping torus of the pseudo-Anosov map induced\nby the Arnoux-Yoccoz map on the surface obtained by blowing-up its two\nsingularities has no cross section which is a torus with two points blown-up.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:00:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Schmidt","Thomas A.",""],["Walker","Mesa",""]]}
{"id":"2308.12804","submitter":"Rojalin Padhan","authors":"Arnab Dasgupta, P. S. Bhupal Dev, Tao Han, Rojalin Padhan, Si Wang,\n  Keping Xie","title":"Searching for Heavy Leptophilic $Z'$: from Lepton Colliders to\n  Gravitational Waves","comments":"40 pages, 19 figures, and 4 tables","journal-ref":null,"doi":null,"report-no":"PITT-PACC-2317, IP/BBSR/2023-09","categories":"hep-ph astro-ph.CO hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the phenomenology of leptophilic $Z'$ gauge bosons at the future\nhigh-energy $e^+e^-$ or $\\mu^+\\mu^-$ colliders, as well as at the gravitational\nwave observatories. The leptophilic $Z'$ model, although well-motivated,\nremains largely unconstrained from current low-energy and collider searches for\n$Z'$ masses above ${\\cal O}(100~{\\rm GeV})$, thus providing a unique\nopportunity for future lepton colliders. Taking leptophilic\n$U(1)_{L_\\alpha-L_\\beta}~(\\alpha,\\beta=e,\\mu,\\tau)$ models as concrete\nexamples, we show that future $e^+e^-$ and $\\mu^+\\mu^-$ colliders with\nmulti-TeV center-of-mass energies provide unprecedented sensitivity to heavy\n$Z'$ bosons. Moreover, if these $U(1)$ models are classically scale-invariant,\nthe phase transition at the $U(1)$ symmetry-breaking scale tends to be strongly\nfirst-order with ultra-supercooling, and leads to observable stochastic\ngravitational wave signatures. We find that the future sensitivity of\ngravitational wave observatories, such as advanced LIGO-VIRGO and Cosmic\nExplorer, can be complementary to the collider experiments, probing higher $Z'$\nmasses up to ${\\cal O}(10^4~{\\rm TeV})$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:02:33 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dasgupta","Arnab",""],["Dev","P. S. Bhupal",""],["Han","Tao",""],["Padhan","Rojalin",""],["Wang","Si",""],["Xie","Keping",""]]}
{"id":"2308.12805","submitter":"Christoph Laaber","authors":"Christoph Laaber, Tao Yue, Shaukat Ali, Thomas Schwitalla, Jan F.\n  Nyg{\\aa}rd","title":"Automated Test Generation for Medical Rules Web Services: A Case Study\n  at the Cancer Registry of Norway","comments":"12 pages, 2 figures, 5 tables; accepted to the industry track of the\n  31st ACM Joint European Software Engineering Conference and Symposium on the\n  Foundations of Software Engineering (ESEC/FSE '23)","journal-ref":null,"doi":"10.1145/3611643.3613882","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cancer Registry of Norway (CRN) collects, curates, and manages data\nrelated to cancer patients in Norway, supported by an interactive,\nhuman-in-the-loop, socio-technical decision support software system. Automated\nsoftware testing of this software system is inevitable; however, currently, it\nis limited in CRN's practice. To this end, we present an industrial case study\nto evaluate an AI-based system-level testing tool, i.e., EvoMaster, in terms of\nits effectiveness in testing CRN's software system. In particular, we focus on\nGURI, CRN's medical rule engine, which is a key component at the CRN. We test\nGURI with EvoMaster's black-box and white-box tools and study their test\neffectiveness regarding code coverage, errors found, and domain-specific rule\ncoverage. The results show that all EvoMaster tools achieve a similar code\ncoverage; i.e., around 19% line, 13% branch, and 20% method; and find a similar\nnumber of errors; i.e., 1 in GURI's code. Concerning domain-specific coverage,\nEvoMaster's black-box tool is the most effective in generating tests that lead\nto applied rules; i.e., 100% of the aggregation rules and between 12.86% and\n25.81% of the validation rules; and to diverse rule execution results; i.e.,\n86.84% to 89.95% of the aggregation rules and 0.93% to 1.72% of the validation\nrules pass, and 1.70% to 3.12% of the aggregation rules and 1.58% to 3.74% of\nthe validation rules fail. We further observe that the results are consistent\nacross 10 versions of the rules. Based on these results, we recommend using\nEvoMaster's black-box tool to test GURI since it provides good results and\nadvances the current state of practice at the CRN. Nonetheless, EvoMaster needs\nto be extended to employ domain-specific optimization objectives to improve\ntest effectiveness further. Finally, we conclude with lessons learned and\npotential research directions, which we believe are generally applicable.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:04:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Laaber","Christoph",""],["Yue","Tao",""],["Ali","Shaukat",""],["Schwitalla","Thomas",""],["Nyg\u00e5rd","Jan F.",""]]}
{"id":"2308.12806","submitter":"Nikhil Sarin","authors":"Nikhil Sarin, Moritz H\\\"ubner, Conor M. B. Omand, Christian N. Setzer,\n  Steve Schulze, Naresh Adhikari, Ana Sagu\\'es-Carracedo, Shanika Galaudage,\n  Wendy F. Wallace, Gavin P. Lamb, En-Tzu Lin","title":"Redback: A Bayesian inference software package for electromagnetic\n  transients","comments":"Submitted. 23 pages 9 figures. Redback is available on GitHub at\n  https://github.com/nikhil-sarin/redback","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fulfilling the rich promise of rapid advances in time-domain astronomy is\nonly possible through confronting our observations with physical models and\nextracting the parameters that best describe what we see. Here, we introduce\n{\\sc Redback}; a Bayesian inference software package for electromagnetic\ntransients. {\\sc Redback} provides an object-orientated {\\sc python} interface\nto over 12 different samplers and over 100 different models for kilonovae,\nsupernovae, gamma-ray burst afterglows, tidal disruption events, engine-driven\ntransients, X-ray afterglows of gamma-ray bursts driven by millisecond\nmagnetars among other explosive transients. The models range in complexity from\nsimple analytical and semi-analytical models to surrogates built upon numerical\nsimulations accelerated via machine learning. {\\sc Redback} also provides a\nsimple interface for downloading and processing data from Swift, Fink, Lasair,\nthe open-access catalogues, and BATSE and fit this or private data. {\\sc\nRedback} can also be used as an engine to simulate transients for telescopes\nsuch as the Zwicky Transient Facility and Vera Rubin with realistic cadences,\nlimiting magnitudes, and sky-coverage or a hypothetical user-constructed survey\nwith arbitrary settings. We also provide a more general simulation interface\nsuitable for target of opportunity observations with different telescopes. We\ndemonstrate through a series of examples how {\\sc Redback} can be used as a\ntool to simulate a large population of transients for realistic surveys, fit\nmodels to real, simulated, or private data, multi-messenger inference and serve\nas an end-to-end software toolkit for parameter estimation and interpreting the\nnature of electromagnetic transients.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:09:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sarin","Nikhil",""],["H\u00fcbner","Moritz",""],["Omand","Conor M. B.",""],["Setzer","Christian N.",""],["Schulze","Steve",""],["Adhikari","Naresh",""],["Sagu\u00e9s-Carracedo","Ana",""],["Galaudage","Shanika",""],["Wallace","Wendy F.",""],["Lamb","Gavin P.",""],["Lin","En-Tzu",""]]}
{"id":"2308.12807","submitter":"Matthew Picklo Jr","authors":"Matthew J. Picklo, Qi Tang, Yanzeng Zhang, Jennifer K. Ryan, and\n  Xian-Zhu Tang","title":"Denoising Particle-In-Cell Data via Smoothness-Increasing\n  Accuracy-Conserving Filters with Application to Bohm Speed Computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The simulation of plasma physics is computationally expensive because the\nunderlying physical system is of high dimensions, requiring three spatial\ndimensions and three velocity dimensions. One popular numerical approach is\nParticle-In-Cell (PIC) methods owing to its ease of implementation and\nfavorable scalability in high-dimensional problems. An unfortunate drawback of\nthe method is the introduction of statistical noise resulting from the use of\nfinitely many particles. In this paper we examine the application of the\nSmoothness-Increasing Accuracy-Conserving (SIAC) family of convolution kernel\nfilters as denoisers for moment data arising from PIC simulations. We show that\nSIAC filtering is a promising tool to denoise PIC data in the physical space as\nwell as capture the appropriate scales in the Fourier space. Furthermore, we\ndemonstrate how the application of the SIAC technique reduces the amount of\ninformation necessary in the computation of quantities of interest in plasma\nphysics such as the Bohm speed.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:10:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Picklo","Matthew J.",""],["Tang","Qi",""],["Zhang","Yanzeng",""],["Ryan","Jennifer K.",""],["Tang","Xian-Zhu",""]]}
{"id":"2308.12808","submitter":"Stijn Cambie","authors":"Stijn Cambie, Guantao Chen, Yanli Hao, Nizamettin Tokar","title":"Decreasing the mean subtree order by adding $k$ edges","comments":"11 Pages, 5 Figures Paper identical to JGT submission","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mean subtree order of a given graph $G$, denoted $\\mu(G)$, is the average\nnumber of vertices in a subtree of $G$. Let $G$ be a connected graph. Chin,\nGordon, MacPhee, and Vincent [J. Graph Theory, 89(4): 413-438, 2018]\nconjectured that if $H$ is a proper spanning supergraph of $G$, then $\\mu(H) >\n\\mu(G)$. Cameron and Mol [J. Graph Theory, 96(3): 403-413, 2021] disproved this\nconjecture by showing that there are infinitely many pairs of graphs $H$ and\n$G$ with $H\\supset G$, $V(H)=V(G)$ and $|E(H)|= |E(G)|+1$ such that $\\mu(H) <\n\\mu(G)$. They also conjectured that for every positive integer $k$, there\nexists a pair of graphs $G$ and $H$ with $H\\supset G$, $V(H)=V(G)$ and $|E(H)|\n= |E(G)| +k$ such that $\\mu(H) < \\mu(G)$. Furthermore, they proposed that\n$\\mu(K_m+nK_1) < \\mu(K_{m, n})$ provided $n\\gg m$. In this note, we confirm\nthese two conjectures.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:10:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cambie","Stijn",""],["Chen","Guantao",""],["Hao","Yanli",""],["Tokar","Nizamettin",""]]}
{"id":"2308.12809","submitter":"Julien Gaboriaud","authors":"Nicolas Crampe and Julien Gaboriaud and Lo\\\"ic Poulain d'Andecy and\n  Luc Vinet","title":"Matrix elements of $SO(3)$ in $sl_3$ representations as bispectral\n  multivariate functions","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the change of basis under an $SO(3)$ automorphism for a\nfinite-dimensional irreducible representation of $sl_3$. The coefficients of\nthe transition matrix are expressed in terms of a double sum of products of\nKrawtchouk and Racah polynomials. These functions generalize the\nGriffiths-Krawtchouk polynomials, which are essentially the overlap\ncoefficients in the case of symmetric representations of $sl_3$. Their\nrecurrence and difference relations are obtained as byproducts of our\nconstruction. The proof is based on the decomposition of a general\nthree-dimensional rotation in terms of elementary planar rotations and a\ntransition between two embeddings of $sl_2$ in $sl_3$. The former is related to\nmonovariate Krawtchouk polynomials and the latter, to monovariate Racah\npolynomials. The appearance of Racah polynomials in this context is\nalgebraically explained by showing that the two $sl_2$ Casimir elements related\nto the two embeddings of $sl_2$ in $sl_3$ obey the Racah algebra relations. We\nalso show that these two elements generate the centralizer in $U(sl_3)$ of the\nCartan subalgebra and its complete algebraic description is given.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:10:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Crampe","Nicolas",""],["Gaboriaud","Julien",""],["d'Andecy","Lo\u00efc Poulain",""],["Vinet","Luc",""]]}
{"id":"2308.12810","submitter":"Nicol\\`o Burzill\\`a","authors":"Nicol\\`o Burzill\\`a, Breno L. Giacchini, Tib\\'erio de Paula Netto,\n  Leonardo Modesto","title":"Regular multi-horizon Lee-Wick black holes","comments":"23 pages, 10 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we carry out a detailed analysis of the static spherically\nsymmetric solutions of a sixth-derivative Lee--Wick gravity model in the\neffective delta source approximation. Previous studies of these solutions have\nonly considered the particular case in which the real and the imaginary part of\nthe Lee--Wick mass $\\mu=a +i b$ are equal. However, as we show here, the\nsolutions exhibit an interesting structure when the full parameter space is\nconsidered, owing to the oscillations of the metric that depend on the ratio\n$b/a$. Such oscillations can generate a rich structure of horizons, a sequence\nof mass gaps and the existence of multiple regimes for black hole sizes\n(horizon position gaps). In what concerns the thermodynamics of these objects,\nthe oscillation of the Hawking temperature determines the presence of multiple\nmass scales for the remnants of the evaporation process and may permit the\nexistence of cold black holes with zero Hawking temperature~$T$ and\nquasi-stable intermediate configurations with $T \\approx 0$ and a long\nevaporation lifetime. For the sake of generality, we consider two families of\nsolutions, one with a trivial shift function and the other with a non-trivial\none (dirty black hole). The latter solution has the advantage of reproducing\nthe modified Newtonian-limit metric of Lee--Wick gravity for small and large\nvalues of~$r$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:13:26 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Burzill\u00e0","Nicol\u00f2",""],["Giacchini","Breno L.",""],["Netto","Tib\u00e9rio de Paula",""],["Modesto","Leonardo",""]]}
{"id":"2308.12811","submitter":"Jansen Formiga","authors":"J. B. Formiga and Jo\\~ao Duarte","title":"On the gravitational energy problem and the energy of photons","comments":"It has been published in Physical Review D under the title\n  Gravitational energy problem and the energy of photons","journal-ref":"Phys. Rev. D 108, 044043 (2023)","doi":"10.1103/PhysRevD.108.044043","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The lack of a well-established solution for the gravitational energy problem\nmight be one of the reasons why a clear road to quantum gravity does not exist.\nIn this paper, the gravitational energy is studied in detail with the help of\nthe teleparallel approach that is equivalent to general relativity. This\napproach is applied to the solutions of the Einstein-Maxwell equations known as\n$pp$-wave spacetimes. The quantization of the electromagnetic energy is assumed\nand it is shown that the proper area measured by an observer must satisfy an\nequation for consistency. The meaning of this equation is discussed and it is\nargued that the spacetime geometry should become discrete once all matter\nfields are quantized, including the constituents of the frame; it is shown that\nfor a harmonic oscillation with wavelength $\\lambda_0$, the area and the volume\ntake the form $A=4(N+1/2)l_p^2/n$ and $V=2(N+1/2)l_p^2\\lambda_0$, where $N$ is\nthe number of photons, $l_p$ the Planck length, and $n$ is a natural number\nassociated with the length along the $z$-axis of a box with cross-sectional\narea $A$. The localization of the gravitational energy problem is also\ndiscussed. The stress-energy tensors for the gravitational and electromagnetic\nfields are decomposed into energy density, pressures and heat flow. The\nresultant expressions are consistent with the properties of the fields, thus\nindicating that one can have a well-defined energy density for the\ngravitational field regardless of the principle of equivalence.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:14:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Formiga","J. B.",""],["Duarte","Jo\u00e3o",""]]}
{"id":"2308.12812","submitter":"Murari Soundararajan","authors":"Murari Soundararajan (1), George R. Bacanu (1), Francesco Giustiniano\n  (1), Mark C. Walkey (1), Gabriela Hoffman (1), Marina Carravetta (1), Martin\n  R. Lees (2), Richard J. Whitby (1), Malcolm H. Levitt (1) ((1) School of\n  Chemistry, University of Southampton, United Kingdom, (2) Physics Department,\n  University of Warwick, United Kingdom)","title":"Solid-state $^3\\mathrm{He}$ NMR of the superconducting rubidium\n  endofulleride $\\mathrm{Rb_3(^3He@C_{60})}$","comments":"20 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new variant of the superconducting fulleride $\\mathrm{Rb_{3}C_{60}}$ is\npresented, with $\\mathrm{^{3}He}$ atoms encapsulated in the $\\mathrm{C_{60}}$\ncages. The $\\mathrm{^{3}He}$ nuclei act as sensitive NMR probes embedded in the\nmaterial. The superconducting and normal states are characterised by\n$\\mathrm{^{3}He}$ NMR. Evidence is found for co-existing vortex liquid and\nvortex solid phases below the superconducting transition temperature. A strong\ndependence of the spin-lattice relaxation time constant on spectral frequency\nis observed in the superconducting state, as revealed by two-dimensional NMR\nutilising an inverse Laplace transform. Surprisingly, this phenomenon persists,\nin attenuated form, at temperatures well above the superconducting transition.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:17:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Soundararajan","Murari",""],["Bacanu","George R.",""],["Giustiniano","Francesco",""],["Walkey","Mark C.",""],["Hoffman","Gabriela",""],["Carravetta","Marina",""],["Lees","Martin R.",""],["Whitby","Richard J.",""],["Levitt","Malcolm H.",""]]}
{"id":"2308.12813","submitter":"Jos\\'e Lukas Montenegro Ferreira","authors":"J. L. Montenegro Ferreira and B. de Lima Bernardo","title":"Quantum state tomography of photons polarization and path degrees of\n  freedom","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum state tomography (QST), the process through which the density matrix\nof a quantum system is characterized from measurements of specific observables,\nis a fundamental pillar in the fields of quantum information and computation.\nWe propose a simple QST method to reconstruct the density matrix of two qubits\nencoded in the polarization and path degrees of freedom of a single photon,\nwhich can be realized with a single linear-optical setup. We demonstrate that\nthe density matrix can be fully described in terms of the one-point Stokes\nparameters related to the two possibles paths of the photon, together with a\nquantum version of the two-point Stokes parameters introduced here.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:17:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ferreira","J. L. Montenegro",""],["Bernardo","B. de Lima",""]]}
{"id":"2308.12814","submitter":"Tulja Varun Kondra","authors":"Tulja Varun Kondra, Ray Ganardi and Alexander Streltsov","title":"Coherence manipulation in asymmetry and thermodynamics","comments":"5 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the classical regime, thermodynamic state transformations are governed by\nthe free energy. This is also called as the second law of thermodynamics.\nPrevious works showed that, access to a catalytic system allows us to restore\nthe second law in the quantum regime when we ignore coherence. However, in the\nquantum regime, coherence and free energy are two independent resources.\nTherefore, coherence places additional non-trivial restrictions on the the\nstate transformations, that remains elusive. In order to close this gap, we\nisolate and study the nature of coherence, i.e. we assume access to a source of\nfree energy. We show that allowing catalysis along with a source of free energy\nallows us to amplify any quantum coherence present in the quantum state\narbitrarily. Additionally, any correlations between the system and the catalyst\ncan be suppressed arbitrarily. Therefore, our results provide a key step in\nformulating a fully general law of quantum thermodynamics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:18:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kondra","Tulja Varun",""],["Ganardi","Ray",""],["Streltsov","Alexander",""]]}
{"id":"2308.12815","submitter":"Xu Zhang","authors":"Xu Zhang, Hai-Long Fu, Feng-Kun Guo and Hans-Werner Hammer","title":"Neutron Scattering off One-Neutron Halo Nuclei in Halo Effective Field\n  Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neutron scattering off neutron halos can provide important information about\nthe internal structure of nuclei close to the neutron drip line. In this work,\nwe use halo effective field theory to study the $s$-wave scattering of a\nneutron and the spin-parity $J^P=\\frac{1}{2}^+$ one-neutron halo nuclei\n$^{11}\\rm Be$, $^{15}\\rm C$, and $^{19}\\rm C$ at leading order. In the $J=1$\nchannel, the only inputs to the Faddeev equations are their one-neutron\nseparation energies. In the $J=0$ channel, the neutron-neutron scattering\nlength and the two-neutron separation energies of $\\rm ^{12}Be$, $\\rm ^{16}C$\nand $\\rm ^{20}C$ enter as well. The numerical results show that the total\n$s$-wave cross sections in the $J=1$ channel at threshold are of the order of a\nfew barns. In the $J=0$ channel, these cross sections are of the order of a few\nbarns for $n$-$^{11}\\rm Be$ and $n$-$^{19}\\rm C$ scattering, and about 60 $\\rm\nmb$ for the $n$-$^{15}\\rm C$ scattering. The appearance of a pole in\n$p\\cot\\delta$ close to zero in all three cases indicates the existence of a\nvirtual Efimov state close to threshold in each of the $^{12}\\rm Be$, $^{16}\\rm\nC$, and $^{20}\\rm C$ systems. Observation of this pole would confirm the\npresence of Efimov physics in halo nuclei. The dependence of the results on the\nneutron-core scattering length is also studied.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:18:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Xu",""],["Fu","Hai-Long",""],["Guo","Feng-Kun",""],["Hammer","Hans-Werner",""]]}
{"id":"2308.12816","submitter":"Michael Unterkalmsteiner","authors":"Michael Unterkalmsteiner, Pekka Abrahamsson, Xiaofeng Wang, Anh\n  Nguyen-Duc, Syed M. Ali Shah, Sohaib Shahid Bajwa, Guido H. Baltes, Kieran\n  Conboy, Eoin Cullina, Denis Dennehy, Henry Edison, Carlos\n  Fern\\'andez-S\\'anchez, Juan Garbajosa, Tony Gorschek, Eriks Klotins, Laura\n  Hokkanen, Fabio Kon, Ilaria Lunesu, Michele Marchesi, Lorraine Morgan, Markku\n  Oivo, Christoph Selig, Pertti Sepp\\\"anen, Roger Sweetman, Pasi Tyrv\\\"ainen,\n  Christina Ungerer, Agust\\'in Yag\\\"ue","title":"Software Startups -- A Research Agenda","comments":null,"journal-ref":"e-Informatica Softw. Eng. J. 10(1): 89-124 (2016)","doi":"10.5277/e-Inf160105","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Software startup companies develop innovative, software-intensive products\nwithin limited time frames and with few resources, searching for sustainable\nand scalable business models. Software startups are quite distinct from\ntraditional mature software companies, but also from micro-, small-, and\nmedium-sized enterprises, introducing new challenges relevant for software\nengineering research. This paper's research agenda focuses on software\nengineering in startups, identifying, in particular, 70+ research questions in\nthe areas of supporting startup engineering activities, startup evolution\nmodels and patterns, ecosystems and innovation hubs, human aspects in software\nstartups, applying startup concepts in non-startup environments, and\nmethodologies and theories for startup research. We connect and motivate this\nresearch agenda with past studies in software startup research, while pointing\nout possible future directions. While all authors of this research agenda have\ntheir main background in Software Engineering or Computer Science, their\ninterest in software startups broadens the perspective to the challenges, but\nalso to the opportunities that emerge from multi-disciplinary research. Our\naudience is therefore primarily software engineering researchers, even though\nwe aim at stimulating collaborations and research that crosses disciplinary\nboundaries. We believe that with this research agenda we cover a wide spectrum\nof the software startup industry current needs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:20:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Unterkalmsteiner","Michael",""],["Abrahamsson","Pekka",""],["Wang","Xiaofeng",""],["Nguyen-Duc","Anh",""],["Shah","Syed M. Ali",""],["Bajwa","Sohaib Shahid",""],["Baltes","Guido H.",""],["Conboy","Kieran",""],["Cullina","Eoin",""],["Dennehy","Denis",""],["Edison","Henry",""],["Fern\u00e1ndez-S\u00e1nchez","Carlos",""],["Garbajosa","Juan",""],["Gorschek","Tony",""],["Klotins","Eriks",""],["Hokkanen","Laura",""],["Kon","Fabio",""],["Lunesu","Ilaria",""],["Marchesi","Michele",""],["Morgan","Lorraine",""],["Oivo","Markku",""],["Selig","Christoph",""],["Sepp\u00e4nen","Pertti",""],["Sweetman","Roger",""],["Tyrv\u00e4inen","Pasi",""],["Ungerer","Christina",""],["Yag\u00fce","Agust\u00edn",""]]}
{"id":"2308.12817","submitter":"Yu-Xiang Zeng","authors":"Yu-Xiang Zeng, Jun-Wei Hsieh, Xin Li, Ming-Ching Chang","title":"MixNet: Toward Accurate Detection of Challenging Scene Text in the Wild","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Detecting small scene text instances in the wild is particularly challenging,\nwhere the influence of irregular positions and nonideal lighting often leads to\ndetection errors. We present MixNet, a hybrid architecture that combines the\nstrengths of CNNs and Transformers, capable of accurately detecting small text\nfrom challenging natural scenes, regardless of the orientations, styles, and\nlighting conditions. MixNet incorporates two key modules: (1) the Feature\nShuffle Network (FSNet) to serve as the backbone and (2) the Central\nTransformer Block (CTBlock) to exploit the 1D manifold constraint of the scene\ntext. We first introduce a novel feature shuffling strategy in FSNet to\nfacilitate the exchange of features across multiple scales, generating\nhigh-resolution features superior to popular ResNet and HRNet. The FSNet\nbackbone has achieved significant improvements over many existing text\ndetection methods, including PAN, DB, and FAST. Then we design a complementary\nCTBlock to leverage center line based features similar to the medial axis of\ntext regions and show that it can outperform contour-based approaches in\nchallenging cases when small scene texts appear closely. Extensive experimental\nresults show that MixNet, which mixes FSNet with CTBlock, achieves\nstate-of-the-art results on multiple scene text detection datasets.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 05:13:00 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 01:45:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zeng","Yu-Xiang",""],["Hsieh","Jun-Wei",""],["Li","Xin",""],["Chang","Ming-Ching",""]]}
{"id":"2308.12818","submitter":"Marcos Leopoldo Wayhs Basso","authors":"Marcos L. W. Basso and Vilson T. Zanchin","title":"Rotating charged fluids: theorems and results for Weyl type systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We perform a systematic study of rotating charged fluids, and extend several\nwell known theorems regarding static Weyl-type systems which were recently\ncompiled by Lemos and Zanchin [Phys. Rev. D 80, 024010 (2009)] to rotating and\naxisymmetric systems. Static Weyl-type systems are composed by static charged\nfluid configurations obeying the Newton-Maxwell or the Einstein-Maxwell systems\nof equations in which the electric potential $\\phi$ and the timelike metric\npotential $g_{tt}\\equiv - W^ 2$ satisfy the Weyl hypothesis, i.e., $W=W(\\phi)$.\nIn the present analysis, both the Newton-Maxwell and Einstein-Maxwell theories\nthat describe non-relativistic and relativistic systems, respectively, are used\nto perform a detailed analysis of the general properties of rotating charged\nfluids rotating charged dust as well as rotating charged fluids with pressure\nin four-dimensional spacetimes. In comparison to the static (nonrotating)\nsystems, two additional potentials, a metric potential related to rotation and\nan electromagnetic potential related to the magnetic field, come into play for\nrotating systems. In each case, constraints between the fluid quantities and\nthe metric and electromagnetic potentials are identified in order to generalize\nthe theorems holding for static charged systems to rotating charged systems.\nNew theorems regarding equilibrium configurations with differential rotation in\nboth the Newtonian and the relativistic theories are stated and proved. For\nrigidly rotating charged fluids in the Einstein-Maxwell theory, a new ansatz\ninvolving the gradient of the metric potentials and the gradient of the\nelectromagnetic potentials is considered in order to prove new theorems. Such\nan ansatz leads to new constraints between the fluid quantities and field\npotentials, so implying new equations of state for the charged fluids.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:22:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Basso","Marcos L. W.",""],["Zanchin","Vilson T.",""]]}
{"id":"2308.12819","submitter":"Antonio Joia Neto","authors":"Antonio Joia Neto, Adam Caulfield, Chistabelle Alvares, Ivan De\n  Oliveira Nunes","title":"DiCA: A Hardware-Software Co-Design for Differential Checkpointing in\n  Intermittently Powered Devices","comments":"8 pages and 7 figures. To be published at IEEE/ACM International\n  Conference on Computer-Aided Design (ICCAD) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intermittently powered devices rely on opportunistic energy-harvesting to\nfunction, leading to recurrent power interruptions. This paper introduces DiCA,\na proposal for a hardware/software co-design to create differential\ncheck-points in intermittent devices. DiCA leverages an affordable hardware\nmodule that simplifies the check-pointing process, reducing the check-point\ngeneration time and energy consumption. This hardware module continuously\nmonitors volatile memory, efficiently tracking modifications and determining\noptimal check-point times. To minimize energy waste, the module dynamically\nestimates the energy required to create and store the check-point based on\ntracked memory modifications, triggering the check-pointing routine optimally\nvia a nonmaskable interrupt. Experimental results show the cost-effectiveness\nand energy efficiency of DiCA, enabling extended application activity cycles in\nintermittently powered embedded devices.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:23:10 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 16:23:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Neto","Antonio Joia",""],["Caulfield","Adam",""],["Alvares","Chistabelle",""],["Nunes","Ivan De Oliveira",""]]}
{"id":"2308.12820","submitter":"Bogdan Kulynych","authors":"Avni Kothari, Bogdan Kulynych, Tsui-Wei Weng, Berk Ustun","title":"Prediction without Preclusion: Recourse Verification with Reachable Sets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning models are often used to decide who will receive a loan, a\njob interview, or a public benefit. Standard techniques to build these models\nuse features about people but overlook their actionability. In turn, models can\nassign predictions that are fixed, meaning that consumers who are denied loans,\ninterviews, or benefits may be permanently locked out from access to credit,\nemployment, or assistance. In this work, we introduce a formal testing\nprocedure to flag models that assign fixed predictions that we call recourse\nverification. We develop machinery to reliably determine if a given model can\nprovide recourse to its decision subjects from a set of user-specified\nactionability constraints. We demonstrate how our tools can ensure recourse and\nadversarial robustness in real-world datasets and use them to study the\ninfeasibility of recourse in real-world lending datasets. Our results highlight\nhow models can inadvertently assign fixed predictions that permanently bar\naccess, and we provide tools to design algorithms that account for\nactionability when developing models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:24:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kothari","Avni",""],["Kulynych","Bogdan",""],["Weng","Tsui-Wei",""],["Ustun","Berk",""]]}
{"id":"2308.12821","submitter":"Joana Cirici","authors":"Joana Cirici and Bashar Saleh","title":"Weight decompositions on algebraic models for mapping spaces and\n  homotopy automorphisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain restrictions on the rational homotopy types of mapping spaces and\nof classifying spaces of homotopy automorphisms by means of the theory of\npositive weight decompositions. The theory applies, in particular, to connected\ncomponents of holomorphic maps between compact K\\\"ahler manifolds as well as\nhomotopy automorphisms of K\\\"ahler manifolds.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:24:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Cirici","Joana",""],["Saleh","Bashar",""]]}
{"id":"2308.12822","submitter":"Christian Bartsch","authors":"Christian Bartsch, Mats H. Lamann, Jiaozi Wang, Robin Steinigeweg,\n  Jochen Gemmer","title":"Equality of coefficients in Lanczos and Mori schemes for the computation\n  of autocorrelation functions and general estimate of corresponding\n  equilibration time scales","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Among the various schemes to compute autocorrelation functions in quantum\nmechanics are the Lanczos or iteration method and the Mori formalism. We show\nthat the coefficients (parameters) which appear in the respective schemes are\nidentical, and point out some other relations. We use the Lanczos method to\ncompute these coefficients from some respective observable and Hamiltonian. The\ncoefficients are endowed with a natural sequential order, computing them\niteratively becomes successively more involved. We use the Mori interpretation\nto generate an estimate of the equilibration time of the autocorrelation\nfunction from the low-order coefficients. Comparison with (state-of-the-art)\nnumerical data for the autocorrelation functions for some many-body examples\nindicates that a few coefficients may suffice to determine the order of\nmagnitude of the equilibration time. This contributes to the field of\nequilibration in closed quantum systems, where the determination of\nequilibration time scales is both crucial and notoriously difficult.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:25:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bartsch","Christian",""],["Lamann","Mats H.",""],["Wang","Jiaozi",""],["Steinigeweg","Robin",""],["Gemmer","Jochen",""]]}
{"id":"2308.12823","submitter":"Erini Lambrides","authors":"Erini Lambrides, Marco Chiaberge, Arianna Long, Daizhong Liu, Hollis\n  B. Akins, Andrew F. Ptak, Irham Taufik Andika, Alessandro Capetti, Caitlin M.\n  Casey, Jaclyn B. Champagne, Katherine Chworowsky, Olivia R. Cooper, Xuheng\n  Ding, Andreas L. Faisst, Maximilien Franco, Steven Gillman, Ghassem\n  Gozaliasl, Kirsten R. Hall, Santosh Harish, Christopher C. Hayward, Michaela\n  Hirschmann, Taylor A. Hutchison, Knud Jahnke, Shuowen Jin, Jeyhan S.\n  Kartaltepe, Anton M. Koekemoer, Vasily Kokorev, Sinclaire M. Manning, Crystal\n  L. Martin, Jed McKinney, Colin Norman, Masafusa Onoue, Brant E. Robertson,\n  Marko Shuntov, John D. Silverman, Massimo Stiavelli, Benny Trakhtenbrot,\n  Eleni Vardoulaki, Jorge A. Zavala, Natalie Allen, Olivier Ilbert, Henry Joy\n  McCracken, Louise Paquereau, Jason Rhodes, Sune Toft","title":"Uncovering a Massive z~7.65 Galaxy Hosting a Heavily Obscured Radio-Loud\n  QSO Candidate in COSMOS-Web","comments":"Submitted to ApJL, Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this letter, we report the discovery of the highest redshift, heavily\nobscured, radio-loud QSO candidate selected using JWST NIRCam/MIRI, mid-IR,\nsub-mm, and radio imaging in the COSMOS-Web field. Using multi-frequency radio\nobservations and mid-IR photometry, we identify a powerful, radio-loud (RL),\ngrowing supermassive black hole (SMBH) with significant spectral steepening of\nthe radio SED ($f_{1.32 \\mathrm{GHz}} \\sim 2$ mJy, $q_{24\\mu m} = -1.1$,\n$\\alpha_{1.32-3\\mathrm{GHz}}=-1.2$, $\\Delta \\alpha = -0.4$). In conjunction\nwith ALMA, deep ground-based observations, ancillary space-based data, and the\nunprecedented resolution and sensitivity of JWST, we find no evidence of QSO\ncontribution to the UV/optical/NIR data and thus infer heavy amounts of\nobscuration (N$_{\\mathrm{H}} > 10^{23}$ cm$^{-2}$). Using the wealth of deep UV\nto sub-mm photometric data, we report a singular solution photo-z of\n$z_\\mathrm{phot}$ = 7.65$^{+0.4}_{-0.3}$ and estimate an extremely massive\nhost-galaxy ($\\log M_{\\star} = 11.92 \\pm 0.06\\,\\mathrm{M}_{\\odot}$). This\nsource represents the furthest known obscured RL QSO candidate, and its level\nof obscuration aligns with the most representative but observationally scarce\npopulation of QSOs at these epochs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:26:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lambrides","Erini",""],["Chiaberge","Marco",""],["Long","Arianna",""],["Liu","Daizhong",""],["Akins","Hollis B.",""],["Ptak","Andrew F.",""],["Andika","Irham Taufik",""],["Capetti","Alessandro",""],["Casey","Caitlin M.",""],["Champagne","Jaclyn B.",""],["Chworowsky","Katherine",""],["Cooper","Olivia R.",""],["Ding","Xuheng",""],["Faisst","Andreas L.",""],["Franco","Maximilien",""],["Gillman","Steven",""],["Gozaliasl","Ghassem",""],["Hall","Kirsten R.",""],["Harish","Santosh",""],["Hayward","Christopher C.",""],["Hirschmann","Michaela",""],["Hutchison","Taylor A.",""],["Jahnke","Knud",""],["Jin","Shuowen",""],["Kartaltepe","Jeyhan S.",""],["Koekemoer","Anton M.",""],["Kokorev","Vasily",""],["Manning","Sinclaire M.",""],["Martin","Crystal L.",""],["McKinney","Jed",""],["Norman","Colin",""],["Onoue","Masafusa",""],["Robertson","Brant E.",""],["Shuntov","Marko",""],["Silverman","John D.",""],["Stiavelli","Massimo",""],["Trakhtenbrot","Benny",""],["Vardoulaki","Eleni",""],["Zavala","Jorge A.",""],["Allen","Natalie",""],["Ilbert","Olivier",""],["McCracken","Henry Joy",""],["Paquereau","Louise",""],["Rhodes","Jason",""],["Toft","Sune",""]]}
{"id":"2308.12824","submitter":"Pamela Suarez","authors":"Claudia Chaio and Pamela Suarez","title":"A generalization of the nilpotency index of the radical of the module\n  category of an algebra","comments":"arXiv admin note: text overlap with arXiv:2003.04189","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $A$ be a finite dimensional representation-finite algebra over an\nalgebraically closed field. The aim of this work is to generalize the results\nproven in CGS. Precisely, we determine which vertices of $Q_A$ are sufficient\nto be considered in order to compute the nilpotency index of the radical of the\nmodule category of a monomial algebra and a toupie algebra $A$, when the\nAuslander-Reiten quiver is not necessarily a component with length.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:28:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chaio","Claudia",""],["Suarez","Pamela",""]]}
{"id":"2308.12825","submitter":"Michael Unterkalmsteiner","authors":"Michael Unterkalmsteiner, Tony Gorschek","title":"Requirements Quality Assurance in Industry: Why, What and How?","comments":"Conference proceedings of Requirements Engineering: Foundation for\n  Software Quality (REFSQ) 2017: 77-84","journal-ref":null,"doi":"10.1007/978-3-319-54045-0_6","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Context and Motivation: Natural language is the most common form to specify\nrequirements in industry. The quality of the specification depends on the\ncapability of the writer to formulate requirements aimed at different\nstakeholders: they are an expression of the customer's needs that are used by\nanalysts, designers and testers. Given this central role of requirements as a\nmean to communicate intention, assuring their quality is essential to reduce\nmisunderstandings that lead to potential waste. Problem: Quality assurance of\nrequirement specifications is largely a manual effort that requires expertise\nand domain knowledge. However, this demanding cognitive process is also\ncongested by trivial quality issues that should not occur in the first place.\nPrincipal ideas: We propose a taxonomy of requirements quality assurance\ncomplexity that characterizes cognitive load of verifying a quality aspect from\nthe human perspective, and automation complexity and accuracy from the machine\nperspective. Contribution: Once this taxonomy is realized and validated, it can\nserve as the basis for a decision framework of automated requirements quality\nassurance support.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:31:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""]]}
{"id":"2308.12826","submitter":"Lara Anderson","authors":"Lara B. Anderson, James Gray, and Paul-Konstantin Oehlmann","title":"Calabi-Yau Genus-One Fibrations and Twisted Dimensional Reductions of\n  F-theory","comments":"12 pages, 1 figure. Appeared in the proceedings of the Nankai\n  Symposium on Mathematical Dialogues","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this brief note we explore the space of genus one and elliptic fibrations\nwithin CY manifolds, their organizing principles, and how they relate to the\nset of all CY manifolds. We provide examples of genus one fibered manifolds\nthat exhibit different Hodge numbers -- and physically lead to different gauge\ngroups - than their Jacobian fibrations. We suggest a physical mechanism for\nunderstanding this difference in twisted circle reductions of 6-dimensional\ncompactifications of F-theory.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:32:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Anderson","Lara B.",""],["Gray","James",""],["Oehlmann","Paul-Konstantin",""]]}
{"id":"2308.12827","submitter":"Kristen Lackeos","authors":"Kristen Lackeos, Tyson B. Littenberg, Neil J. Cornish, James I. Thorpe","title":"The LISA Data Challenge Radler Analysis and Time-dependent Ultra-compact\n  Binary Catalogues","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context. Galactic binaries account for the loudest combined continuous\ngravitational wave signal in the Laser Interferometer Space Antenna (LISA)\nband, which spans a frequency range of 0.1 mHz to 1 Hz.\n  Aims. A superposition of low frequency Galactic and extragalactic signals and\ninstrument noise comprise the LISA data stream. Resolving as many Galactic\nbinary signals as possible and characterising the unresolved Galactic\nforeground noise after their subtraction from the data are a necessary step\ntowards a global fit solution to the LISA data. Methods. We analyse a simulated\ngravitational wave time series of tens of millions of ultra-compact Galactic\nbinaries hundreds of thousands of years from merger. This data set is called\nthe Radler Galaxy and is part of the LISA Data challenges. We use a Markov\nChain Monte Carlo search pipeline specifically designed to perform a global fit\nto the Galactic binaries and detector noise. Our analysis is performed for\nincreasingly larger observation times of 1.5, 3, 6 and 12 months.\n  Results. We show that after one year of observing, as many as ten thousand\nultra-compact binary signals are individually resolvable. Ultra-compact binary\ncatalogues corresponding to each observation time are presented. The Radler\nGalaxy is a training data set, with binary parameters for every signal in the\ndata stream included. We compare our derived catalogues to the LISA Data\nchallenge Radler catalogue to quantify the detection efficiency of the search\npipeline. Included in the appendix is a more detailed analysis of two corner\ncases that provide insight into future improvements to our search pipeline.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:34:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lackeos","Kristen",""],["Littenberg","Tyson B.",""],["Cornish","Neil J.",""],["Thorpe","James I.",""]]}
{"id":"2308.12828","submitter":"Dima Kagan","authors":"Nadav Shalit, Michael Fire, Dima Kagan, Eran Ben-Elia","title":"Short Run Transit Route Planning Decision Support System Using a Deep\n  Learning-Based Weighted Graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Public transport routing plays a crucial role in transit network design,\nensuring a satisfactory level of service for passengers. However, current\nrouting solutions rely on traditional operational research heuristics, which\ncan be time-consuming to implement and lack the ability to provide quick\nsolutions. Here, we propose a novel deep learning-based methodology for a\ndecision support system that enables public transport (PT) planners to identify\nshort-term route improvements rapidly. By seamlessly adjusting specific\nsections of routes between two stops during specific times of the day, our\nmethod effectively reduces times and enhances PT services. Leveraging diverse\ndata sources such as GTFS and smart card data, we extract features and model\nthe transportation network as a directed graph. Using self-supervision, we\ntrain a deep learning model for predicting lateness values for road segments.\n  These lateness values are then utilized as edge weights in the transportation\ngraph, enabling efficient path searching. Through evaluating the method on Tel\nAviv, we are able to reduce times on more than 9\\% of the routes. The improved\nroutes included both intraurban and suburban routes showcasing a fact\nhighlighting the model's versatility. The findings emphasize the potential of\nour data-driven decision support system to enhance public transport and city\nlogistics, promoting greater efficiency and reliability in PT services.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:37:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shalit","Nadav",""],["Fire","Michael",""],["Kagan","Dima",""],["Ben-Elia","Eran",""]]}
{"id":"2308.12829","submitter":"Marius Beceanu","authors":"Marius Beceanu, Michael Goldberg","title":"Spectral multipliers III: Endpoint bounds, intertwining operators, and\n  twisted Hardy spaces","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend several fundamental estimates regarding spectral multipliers for\nthe free Laplacian on $R^3$ to the case of perturbed Hamiltonians of the form\n$H=-\\Delta+V$, where $V$ is a scalar real-valued potential. Results include\nsharp endpoint bounds for Mihlin multipliers, confirming a conjecture made in\n[BeGo3] about intertwining operators, a characterization of the twisted Hardy\nspaces that correspond to these perturbed Hamiltonians, upgrading previous\nStrichartz estimates from [BeGo2] and [BeGo3], and maximum principles.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:41:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Beceanu","Marius",""],["Goldberg","Michael",""]]}
{"id":"2308.12830","submitter":"Kaushik Mohanta","authors":"Kaushik Mohanta","title":"Bougain-Brezis-Mironescu formula for Triebel-Lizorkin spaces in\n  arbitrary domains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that the Bourgain-Brezis-Mironescu formula, regarding the limits of\nGagliardo-type seminorms as $s\\to 1-$, holds for Triebel-Lizorkin spaces\ndefined in arbitrary domains. This answers an open question raised by\nBrazke-Schikorra-Yung in [Bourgain-Brezis-Mironescu convergence via\nTriebel-Lizorkin spaces; Calc. Var. Partial Differential Equations; 2023].\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:44:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mohanta","Kaushik",""]]}
{"id":"2308.12831","submitter":"Zitao Wang","authors":"Zitao Wang, Qiguang Miao, Yue Xi","title":"EFormer: Enhanced Transformer towards Semantic-Contour Features of\n  Foreground for Portraits Matting","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The portrait matting task aims to extract an alpha matte with complete\nsemantics and finely-detailed contours. In comparison to CNN-based approaches,\ntransformers with self-attention allow a larger receptive field, enabling it to\nbetter capture long-range dependencies and low-frequency semantic information\nof a portrait. However, the recent research shows that self-attention mechanism\nstruggle with modeling high-frequency information and capturing fine contour\ndetails, which can lead to bias while predicting the portrait's contours. To\naddress the problem, we propose EFormer to enhance the model's attention\ntowards semantic and contour features. Especially the latter, which is\nsurrounded by a large amount of high-frequency details. We build a semantic and\ncontour detector (SCD) to accurately capture the distribution of semantic and\ncontour features. And we further design contour-edge extraction branch and\nsemantic extraction branch for refining contour features and complete semantic\ninformation. Finally, we fuse the two kinds of features and leverage the\nsegmentation head to generate the predicted portrait matte. Remarkably, EFormer\nis an end-to-end trimap-free method and boasts a simple structure. Experiments\nconducted on VideoMatte240K-JPEGSD and AIM datasets demonstrate that EFormer\noutperforms previous portrait matte methods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:45:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Zitao",""],["Miao","Qiguang",""],["Xi","Yue",""]]}
{"id":"2308.12832","submitter":"Alexander Petrov","authors":"Alexander N. Petrov","title":"Accurate numerical evaluation of systematics in the experiment for\n  electron electric dipole moment measurement in HfF$^+$","comments":"arXiv admin note: text overlap with arXiv:2302.02856","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperfine structure of the ground rotational level of the metastable\n$^3\\Delta_1$ electronic state of $^{180}$HfF$^+$ ion is calculated at presence\nof variable external electric and magnetic fields. Calculations are required\nfor analysis of systematic effects in experiment for electron electric dipole\nmoment ($e$EDM) search. Different perturbations in molecular spectra important\nfor $e$EDM spectroscopy are taken into account.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:45:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Petrov","Alexander N.",""]]}
{"id":"2308.12833","submitter":"Maximilian Mozes","authors":"Maximilian Mozes, Xuanli He, Bennett Kleinberg, Lewis D. Griffin","title":"Use of LLMs for Illicit Purposes: Threats, Prevention Measures, and\n  Vulnerabilities","comments":"Pre-print","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spurred by the recent rapid increase in the development and distribution of\nlarge language models (LLMs) across industry and academia, much recent work has\ndrawn attention to safety- and security-related threats and vulnerabilities of\nLLMs, including in the context of potentially criminal activities.\nSpecifically, it has been shown that LLMs can be misused for fraud,\nimpersonation, and the generation of malware; while other authors have\nconsidered the more general problem of AI alignment. It is important that\ndevelopers and practitioners alike are aware of security-related problems with\nsuch models. In this paper, we provide an overview of existing - predominantly\nscientific - efforts on identifying and mitigating threats and vulnerabilities\narising from LLMs. We present a taxonomy describing the relationship between\nthreats caused by the generative capabilities of LLMs, prevention measures\nintended to address such threats, and vulnerabilities arising from imperfect\nprevention measures. With our work, we hope to raise awareness of the\nlimitations of LLMs in light of such security concerns, among both experienced\ndevelopers and novel users of such technologies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:45:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mozes","Maximilian",""],["He","Xuanli",""],["Kleinberg","Bennett",""],["Griffin","Lewis D.",""]]}
{"id":"2308.12834","submitter":"Wenlue Song","authors":"Wenlue Song, Hanyuan Wu, Hongwei Meng, Evan Bian, Cong Tang, Jiaqi Xi,\n  Haogang Zhu","title":"A Blockchain based Fund Management System for Construction Projects -- A\n  Comprehensive Case Study in Xiong'an New Area China","comments":"Accepted to the 8th International Conference on Smart Finance (ICSF\n  2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As large scale construction projects become increasingly complex, the use and\nintegration of advanced technologies are being emphasized more and more.\nHowever, the construction industry often lags behind most industries in the\napplication of digital technologies. In recent years, a decentralized,\npeer-topeer blockchain technology has attracted widespread attention from\nacademia and industry. This paper provides a solution that combines blockchain\ntechnology with construction project fund management. The system involves\nparticipants such as the owner's unit, construction companies, government\ndepartments, banks, etc., adopting the technical architecture of the Xiong'an\nBlockchain Underlying System. The core business and key logic processing are\nall implemented through smart contracts, ensuring the transparency and\ntraceability of the fund payment process. The goal of ensuring investment\nquality, standardizing investment behavior, and strengthening cost control is\nachieved through blockchain technology. The application of this system in the\nmanagement of Xiong'an construction projects has verified that blockchain\ntechnology plays a significant positive role in strengthening fund management,\nenhancing fund supervision, and ensuring fund safety in the construction\nprocess of engineering projects. It helps to eliminate the common problems of\nmulti-party trust and transparent supervision in the industry and can further\nimprove the investment benefits of government investment projects and improve\nthe management system and operation mechanism of investment projects.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:46:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Song","Wenlue",""],["Wu","Hanyuan",""],["Meng","Hongwei",""],["Bian","Evan",""],["Tang","Cong",""],["Xi","Jiaqi",""],["Zhu","Haogang",""]]}
{"id":"2308.12835","submitter":"Yuxin Lin","authors":"Yuxin Lin, Silvia Spezzano, Jaime E. Pineda, Jorma Harju, Anika\n  Schmiedeke, Sihan Jiao, Hauyu Baobab Liu, and Paola Caselli","title":"Initial conditions of star formation at $\\lesssim$2000 au: physical\n  structure and NH$_{3}$ depletion of three early-stage cores","comments":"23 pages, 23 figures incl. appendix; A&A accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pre-stellar cores represent a critical evolutionary phase in low-mass star\nformation. We aim to unveil the detailed thermal structure and density\ndistribution of three early-stage cores, starless core L1517B, and prestellar\ncore L694-2 and L429, with the high angular resolution observations of the\nNH$_{3}$ (1,1) and (2,2) inversion transitions obtained with VLA and GBT. In\naddition, we explore where/if NH$_{3}$ depletes in the central regions.\nApplying the mid-infrared extinction method to the $\\textit{Spitzer}$ 8$~\\mu$m\nmap we obtain a high angular resolution hydrogen column density map, and derive\nthe gas density profile to assess the variation of NH$_{3}$ abundance as a\nfunction of gas volume density. The measured temperature profiles of L429 and\nL1517B show a minor decrease towards the core center, dropping from $\\sim$9\\~K\nto below 8\\~K, and $\\sim$11 K to 10 K, while L694-2 has a rather uniform\ntemperature distribution around $\\sim$9 K. Among the three cores, L429 has the\nhighest central gas density, close to sonic velocity line-width, and largest\nlocalised velocity gradient, all indicative of an advanced evolutionary stage.\nWe resolve that the abundance of NH$_{3}$ becomes two times lower in the\ncentral region of L429, occurring around a gas density of\n4.4$\\times$10$^{4}$$~cm^{-3}$. Compared to Ophiuchus/H-MM1 which shows an even\nstronger drop of the NH$_{3}$ abundance at 2$\\times$10$^{5}$$~cm^{-3}$, the\nabundance variations of the three cores plus Ophiuchus/H-MM1 suggest a\nprogressive NH$_{3}$ depletion with increasing central density of the core.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:46:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Lin","Yuxin",""],["Spezzano","Silvia",""],["Pineda","Jaime E.",""],["Harju","Jorma",""],["Schmiedeke","Anika",""],["Jiao","Sihan",""],["Liu","Hauyu Baobab",""],["Caselli","Paola",""]]}
{"id":"2308.12836","submitter":"Krishna Kumar G","authors":"Krishna Kumar G. and Judy Augustine","title":"Pseudospectra of the heat operator Pencil","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article undertakes an analysis of the one-dimensional heat equation,\nwherein the Dirichlet condition is applied at the left end and Neumann\ncondition at the right end. The heat equation is restructured as a\nnon-self-adjoint $2\\times 2$ unbounded block operator matrix pencil. The\nspectral, pseudospectral, and $(n,\\epsilon)$-pseudospectral enclosures of the\n$2\\times 2$ unbounded block operator matrix pencil are explored to scrutinize\nthe heat operator pencil. The plots of the discretized equation are depicted to\nillustrate the observations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:47:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["G.","Krishna Kumar",""],["Augustine","Judy",""]]}
{"id":"2308.12837","submitter":"Li Ge","authors":"Li Ge, Zihe Gao, Liang Feng","title":"Non-Hermitian gauged laser arrays with localized excitation: Anomalous\n  threshold and generalized principle of selective pumping","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate non-Hermitian skin modes in laser arrays with spatially\nlocalized excitation. Intriguingly, we observe an unusual threshold behavior\nwhen selectively pumping either the head or the tail of these modes: Both cases\nexhibit the same lasing threshold and hence defy the conventional principle of\nselective pumping, which aims to maximize the overlap between the pump profile\nand the target lasing mode. To shed light on this enigma, we reveal a\npreviously overlooked phenomenon, i.e., energy exchange at non-Hermitian\ncoupling junctions with the photonic environment, which does not occur with\nuniform gain or loss. Utilizing a transfer matrix approach, we elucidate the\nmechanism of this anomalous threshold behavior, which is determined by the\nspecific physical realization of the non-Hermitian gauge field (i.e., using\ngain, loss, or their mixture). Finally, we derive a generalized principle of\nselective pumping in non-Hermitian arrays, which shows that the decisive\nspatial overlap is given by the tripartite product of the pump, the lasing\nmode, and its biorthogonal partner. Our study provides a glimpse into how the\ntwo forms of non-Hermiticity, i.e., asymmetric couplings and a complex onsite\npotential, interact synergetically in laser arrays, which may stimulate further\nexplorations of their collective effects in photonics and related fields.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:47:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ge","Li",""],["Gao","Zihe",""],["Feng","Liang",""]]}
{"id":"2308.12838","submitter":"Natalia Chepiga","authors":"Natalia Chepiga","title":"Tunable quantum criticality in multi-component Rydberg arrays","comments":"9 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Arrays of Rydberg atoms have appeared as a remarkably rich playground to\nstudy quantum phase transitions in one dimension. One of the biggest puzzles\nthat was brought forward in this context is a commensurate-incommensurate phase\ntransitions out of density waves. Experiments report the transitions with\ndynamical critical exponent $z>1$ that recent theoretical and numerical\nanalysis attribute to the appearance of chiral transitions introduced by Huse\nand Fisher. However, further experimental exploration of these exotic\ntransitions is complicated by the narrow parameter window where chiral\ntransition can be realized. We argue that multi-component Rydberg arrays offer\nextra experimentally controllable parameters and provide a mechanism to tune\nquantum critical properties of the conformal Ashkin-Teller point that in turns\ncontrols the extent of the chiral transition. Here we consider an effective\nblockade model of two component Rydberg atoms - weak and strong components\nobeying nearest- and next-nearest-neighbor blockades. When laser detuning is\napplied to either strong or weak components the system is in the period-3 or\nperiod-2 phases correspondingly. However, laser detuning used for both\ncomponents simultaneously stabilizes the period-4 phase partly surrounded by\nthe chiral transition. We show that the extent of the chiral transition and\neven its appearance can be controlled by the relative ratio of the Rabi\nfrequencies of the two components.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:52:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chepiga","Natalia",""]]}
{"id":"2308.12839","submitter":"Subhankar Patra","authors":"Subhankar Patra, Bibhas Ranjan Majhi, Santabrata Das","title":"Thermal properties of accretion disc in non-Kerr spacetime:\n  distinguishing black hole and naked singularity","comments":"15 pages, 13 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study the properties of accretion flow including its\nspectral features in Johannsen and Psaltis (JP) non-Kerr spacetime. In doing\nso, we numerically solve the governing equations that describe the flow motion\naround the compact objects in a general relativistic framework, where spin\n($a_{k}$) and deformation parameters ($\\varepsilon$) demonstrate the nature of\nthe central source, namely black hole (BH) or naked singularity (NS). With\nthis, we obtain all possible classes of global accretion solutions ($i. e.$, O,\nA, W and I-type) by varying the energy ($E$) and angular momentum ($\\lambda$)\nof the relativistic accretion flow, and examine the role of thermal\nbremsstrahlung emission in studying the spectral energy distributions (SEDs) of\nthe accretion disc. We divide the parameter space in $\\lambda-E$ plane in terms\nof the different classes of accretion solutions for BH and NS models. We\nfurther calculate the disc luminosity ($L$) corresponding to these accretion\nsolutions, and observe that I-type solutions yield higher $L$ and SEDs than the\nremaining types of solutions for both BH and NS models. For BH model, SEDs for\nW and I-type solutions differ significantly from the results for O and A-type\nsolutions for low $E$ values. On the contrary, for NS model, SEDs for different\naccretion solutions are identical in the whole parameter space of $\\lambda$ and\n$E$. We also examine the effect of $\\varepsilon$ on the SEDs and observe that a\nnon-Kerr BH yields higher SEDs than the usual Kerr BH. Finally, for accretion\nsolutions of identical $E$ and $\\lambda$, we compare the SEDs obtained from BH\nand NS models, and find that naked singularity objects produce more luminous\npower spectra than the black holes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:52:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Patra","Subhankar",""],["Majhi","Bibhas Ranjan",""],["Das","Santabrata",""]]}
{"id":"2308.12840","submitter":"Mohamed Ibrahim","authors":"Mohamed R. Ibrahim and Terry Lyons","title":"FaceTouch: Detecting hand-to-face touch with supervised contrastive\n  learning to assist in tracing infectious disease","comments":"Set to be published in the PLoS ONE Journal","journal-ref":null,"doi":"10.1371/journal.pone.0288670","report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Through our respiratory system, many viruses and diseases frequently spread\nand pass from one person to another. Covid-19 served as an example of how\ncrucial it is to track down and cut back on contacts to stop its spread. There\nis a clear gap in finding automatic methods that can detect hand-to-face\ncontact in complex urban scenes or indoors. In this paper, we introduce a\ncomputer vision framework, called FaceTouch, based on deep learning. It\ncomprises deep sub-models to detect humans and analyse their actions. FaceTouch\nseeks to detect hand-to-face touches in the wild, such as through video chats,\nbus footage, or CCTV feeds. Despite partial occlusion of faces, the introduced\nsystem learns to detect face touches from the RGB representation of a given\nscene by utilising the representation of the body gestures such as arm\nmovement. This has been demonstrated to be useful in complex urban scenarios\nbeyond simply identifying hand movement and its closeness to faces. Relying on\nSupervised Contrastive Learning, the introduced model is trained on our\ncollected dataset, given the absence of other benchmark datasets. The framework\nshows a strong validation in unseen datasets which opens the door for potential\ndeployment.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:55:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ibrahim","Mohamed R.",""],["Lyons","Terry",""]]}
{"id":"2308.12841","submitter":"Armin Wei{\\ss}","authors":"Caroline Mattes, Alexander Ushakov, Armin Wei{\\ss}","title":"Complexity of Spherical Equations in Finite Groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we investigate computational properties of the Diophantine\nproblem for spherical equations in some classes of finite groups. We classify\nthe complexity of different variations of the problem, e.g., when $G$ is fixed\nand when $G$ is a part of the input.\n  When the group $G$ is constant or given as multiplication table, we show that\nthe problem always can be solved in polynomial time. On the other hand, for the\npermutation groups $S_n$ (with $n$ part of the input), the problem is\nNP-complete. The situation for matrix groups is quite involved: while we\nexhibit sequences of 2-by-2 matrices where the problem is NP-complete, in the\nfull group $GL(2,p)$ ($p$ prime and part of the input) it can be solved in\npolynomial time. We also find a similar behaviour with subgroups of matrices of\narbitrary dimension over a constant ring.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:58:06 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mattes","Caroline",""],["Ushakov","Alexander",""],["Wei\u00df","Armin",""]]}
{"id":"2308.12842","submitter":"Sagar Kulkarni","authors":"Sagar Kulkarni, Sharvari Govilkar and Dhiraj Amin","title":"Text Similarity from Image Contents using Statistical and Semantic\n  Analysis Techniques","comments":"NLPTT2023 publication, 10 Pages","journal-ref":null,"doi":"10.5121/csit.2023.131405","report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Plagiarism detection is one of the most researched areas among the Natural\nLanguage Processing(NLP) community. A good plagiarism detection covers all the\nNLP methods including semantics, named entities, paraphrases etc. and produces\ndetailed plagiarism reports. Detection of Cross Lingual Plagiarism requires\ndeep knowledge of various advanced methods and algorithms to perform effective\ntext similarity checking. Nowadays the plagiarists are also advancing\nthemselves from hiding the identity from being catch in such offense. The\nplagiarists are bypassed from being detected with techniques like paraphrasing,\nsynonym replacement, mismatching citations, translating one language to\nanother. Image Content Plagiarism Detection (ICPD) has gained importance,\nutilizing advanced image content processing to identify instances of plagiarism\nto ensure the integrity of image content. The issue of plagiarism extends\nbeyond textual content, as images such as figures, graphs, and tables also have\nthe potential to be plagiarized. However, image content plagiarism detection\nremains an unaddressed challenge. Therefore, there is a critical need to\ndevelop methods and systems for detecting plagiarism in image content. In this\npaper, the system has been implemented to detect plagiarism form contents of\nImages such as Figures, Graphs, Tables etc. Along with statistical algorithms\nsuch as Jaccard and Cosine, introducing semantic algorithms such as LSA, BERT,\nWordNet outperformed in detecting efficient and accurate plagiarism.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:06:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kulkarni","Sagar",""],["Govilkar","Sharvari",""],["Amin","Dhiraj",""]]}
{"id":"2308.12843","submitter":"Hazim Alzorgan","authors":"Hazim Alzorgan, Abolfazl Razi, Ata Jahangir Moshayedi","title":"Actuator Trajectory Planning for UAVs with Overhead Manipulator using\n  Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the operation of an aerial manipulator system,\nnamely an Unmanned Aerial Vehicle (UAV) equipped with a controllable arm with\ntwo degrees of freedom to carry out actuation tasks on the fly. Our solution is\nbased on employing a Q-learning method to control the trajectory of the tip of\nthe arm, also called end-effector. More specifically, we develop a motion\nplanning model based on Time To Collision (TTC), which enables a quadrotor UAV\nto navigate around obstacles while ensuring the manipulator's reachability.\nAdditionally, we utilize a model-based Q-learning model to independently track\nand control the desired trajectory of the manipulator's end-effector, given an\narbitrary baseline trajectory for the UAV platform. Such a combination enables\na variety of actuation tasks such as high-altitude welding, structural\nmonitoring and repair, battery replacement, gutter cleaning, skyscrapper\ncleaning, and power line maintenance in hard-to-reach and risky environments\nwhile retaining compatibility with flight control firmware. Our RL-based\ncontrol mechanism results in a robust control strategy that can handle\nuncertainties in the motion of the UAV, offering promising performance.\nSpecifically, our method achieves 92% accuracy in terms of average displacement\nerror (i.e. the mean distance between the target and obtained trajectory\npoints) using Q-learning with 15,000 episodes\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:06:23 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 16:28:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Alzorgan","Hazim",""],["Razi","Abolfazl",""],["Moshayedi","Ata Jahangir",""]]}
{"id":"2308.12844","submitter":"Michele Guerra","authors":"Michele Guerra, Simone Scardapane, Filippo Maria Bianchi","title":"Probabilistic load forecasting with Reservoir Computing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Some applications of deep learning require not only to provide accurate\nresults but also to quantify the amount of confidence in their prediction. The\nmanagement of an electric power grid is one of these cases: to avoid risky\nscenarios, decision-makers need both precise and reliable forecasts of, for\nexample, power loads. For this reason, point forecasts are not enough hence it\nis necessary to adopt methods that provide an uncertainty quantification.\n  This work focuses on reservoir computing as the core time series forecasting\nmethod, due to its computational efficiency and effectiveness in predicting\ntime series. While the RC literature mostly focused on point forecasting, this\nwork explores the compatibility of some popular uncertainty quantification\nmethods with the reservoir setting. Both Bayesian and deterministic approaches\nto uncertainty assessment are evaluated and compared in terms of their\nprediction accuracy, computational resource efficiency and reliability of the\nestimated uncertainty, based on a set of carefully chosen performance metrics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:07:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Guerra","Michele",""],["Scardapane","Simone",""],["Bianchi","Filippo Maria",""]]}
{"id":"2308.12845","submitter":"Wei Xie","authors":"Wei Xie, Haobo Jiang, Shuo Gu and Jin Xie","title":"Implicit Obstacle Map-driven Indoor Navigation Model for Robust Obstacle\n  Avoidance","comments":"9 pages, 7 figures, 43 references. This paper has been accepted for\n  ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612100","report-no":"979-8-4007-0108-5/23/10","categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robust obstacle avoidance is one of the critical steps for successful\ngoal-driven indoor navigation tasks.Due to the obstacle missing in the visual\nimage and the possible missed detection issue, visual image-based obstacle\navoidance techniques still suffer from unsatisfactory robustness. To mitigate\nit, in this paper, we propose a novel implicit obstacle map-driven indoor\nnavigation framework for robust obstacle avoidance, where an implicit obstacle\nmap is learned based on the historical trial-and-error experience rather than\nthe visual image. In order to further improve the navigation efficiency, a\nnon-local target memory aggregation module is designed to leverage a non-local\nnetwork to model the intrinsic relationship between the target semantic and the\ntarget orientation clues during the navigation process so as to mine the most\ntarget-correlated object clues for the navigation decision. Extensive\nexperimental results on AI2-Thor and RoboTHOR benchmarks verify the excellent\nobstacle avoidance and navigation efficiency of our proposed method. The core\nsource code is available at https://github.com/xwaiyy123/object-navigation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:10:28 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xie","Wei",""],["Jiang","Haobo",""],["Gu","Shuo",""],["Xie","Jin",""]]}
{"id":"2308.12846","submitter":"Arpan Kusari","authors":"Arpan Kusari, Asma Almutairi, Mark E. Gilbert and David J. LeBlanc","title":"Object level footprint uncertainty quantification in infrastructure\n  based sensing","comments":"Submitted to IEEE Sensors journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the problem of estimating footprint uncertainty of objects imaged\nusing the infrastructure based camera sensing. A closed form relationship is\nestablished between the ground coordinates and the sources of the camera\nerrors. Using the error propagation equation, the covariance of a given ground\ncoordinate can be measured as a function of the camera errors. The uncertainty\nof the footprint of the bounding box can then be given as the function of all\nthe extreme points of the object footprint. In order to calculate the\nuncertainty of a ground point, the typical error sizes of the error sources are\nrequired. We present a method of estimating the typical error sizes from an\nexperiment using a static, high-precision LiDAR as the ground truth. Finally,\nwe present a simulated case study of uncertainty quantification from\ninfrastructure based camera in CARLA to provide a sense of how the uncertainty\nchanges across a left turn maneuver.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:12:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kusari","Arpan",""],["Almutairi","Asma",""],["Gilbert","Mark E.",""],["LeBlanc","David J.",""]]}
{"id":"2308.12847","submitter":"Connie On Yu Hui","authors":"Connie On Yu Hui, Jos\\'e Andr\\'es Rodr\\'iguez Migueles","title":"Modular links: Bunch algorithm and upper volume bounds","comments":"29 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the 1970s, Williams developed an algorithm that has been used to construct\nmodular links. We introduce the notion of bunches to provide a more efficient\nalgorithm for constructing modular links in the Lorenz template. Using the\nbunch perspective, we construct parent manifolds for modular link complements\nand provide the first upper volume bound that is independent of word exponents\nand quadratic in the braid index. We find families of modular knot complements\nwith upper volume bounds that are linear in the braid index. A classification\nof modular link complements based on the relative magnitudes of word exponents\nis also presented.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:13:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hui","Connie On Yu",""],["Migueles","Jos\u00e9 Andr\u00e9s Rodr\u00edguez",""]]}
{"id":"2308.12848","submitter":"Dalia Artenstein","authors":"Dalia Artenstein, Ana Gonz\\'alez and Gustavo Mata","title":"Handle element on nearly Frobenius algebras","comments":"20 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article the concept of handle element of Frobenius algebras, as in\n[16], will be extended to nearly Frobenius algebras. The main properties of\nthis element will be analyzed in this case and many examples will be\nconstructed. Also the Casimir and Schur elements of symmetric algebras will be\nconsidered ([8]) and generalized for Frobenius and nearly Frobenius algebras\nshowing which results still hold in this framework and which ones fail.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:14:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Artenstein","Dalia",""],["Gonz\u00e1lez","Ana",""],["Mata","Gustavo",""]]}
{"id":"2308.12849","submitter":"Anna Movsheva","authors":"Anna Movsheva, Thomas A. Witten","title":"Granular convergence as an iterated local map","comments":"11 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Granular convergence is a property of a granular pack as it is repeatedly\nsheared in a cyclic, quasistatic fashion, as the packing configuration changes\nvia discrete events. Under suitable conditions the set of microscopic\nconfigurations encountered converges to a periodic sequence after sufficient\nshear cycles. Prior work modeled this evolution as the iteration of a\npre-determined, random map from a set of discrete configurations into itself.\nIterating such a map from a random starting point leads to similar periodic\nrepetition. This work explores the effect of restricting the randomness of such\nmaps in order to account for the local nature of the discrete events. The\nnumber of cycles needed for convergence shows similar statistical behavior to\nthat of numerical granular experiments. The number of cycles in a repeating\nperiod behaves only qualitatively like these granular studies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:14:58 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Movsheva","Anna",""],["Witten","Thomas A.",""]]}
{"id":"2308.12850","submitter":"Chris White","authors":"Melissa van Beekveld, Abhinava Danish, Eric Laenen, Sourav Pal, Anurag\n  Tripathi and Chris D. White","title":"Next-to-soft radiation from a different angle","comments":"26 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Soft and collinear radiation in collider processes can be described in a\nuniversal way, that is independent of the underlying process. Recent years have\nseen a number of approaches for probing whether radiation beyond the leading\nsoft approximation can also be systematically classified. In this paper, we\nstudy a formula that captures the leading next-to-soft QCD radiation affecting\nprocesses with both final- and initial-state partons, by shifting the momenta\nin the non-radiative squared amplitude. We first examine W+jet production, and\nshow that a previously derived formula of this type indeed holds in the case in\nwhich massive colour singlet particles are present in the final state. Next, we\ndevelop a physical understanding of the momentum shifts, showing precisely how\nthey disrupt the well-known angular ordering property of leading soft\nradiation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:16:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["van Beekveld","Melissa",""],["Danish","Abhinava",""],["Laenen","Eric",""],["Pal","Sourav",""],["Tripathi","Anurag",""],["White","Chris D.",""]]}
{"id":"2308.12851","submitter":"Yunkai Wang","authors":"Yunkai Wang, Yujie Zhang, Virginia O. Lorenz","title":"Astronomical interferometry using continuous variable quantum\n  teleportation","comments":"15 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a method to build an astronomical interferometer using continuous\nvariable quantum teleportation to overcome the transmission loss between\ndistant telescopes. The scheme relies on two-mode squeezed states shared by\ndistant telescopes as entanglement resources, which are distributed using\ncontinuous variable quantum repeaters. We find the optimal measurement on the\nteleported states, which uses beam-splitters and photon-number-resolved\ndetection. Compared to prior proposals relying on discrete states, our scheme\nhas the advantages of using linear optics to implement the scheme without\nwasting stellar photons and making use of multiphoton events, which are\nregarded as noise in previous discrete schemes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:17:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Yunkai",""],["Zhang","Yujie",""],["Lorenz","Virginia O.",""]]}
{"id":"2308.12852","submitter":"Kevin van Helden","authors":"Eric Bergshoeff, Jos\\'e Figueroa-O'Farrill, Kevin van Helden, Jan\n  Rosseel, Iisakki Rotko, Tonnis ter Veldhuis","title":"$p$-brane Galilean and Carrollian Geometries and Gravities","comments":"58 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.DG math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study $D$-dimensional $p$-brane Galilean geometries via the intrinsic\ntorsion of their adapted connections. These non-Lorentzian geometries are\nexamples of $G$-structures whose characteristic tensors consist of two\ndegenerate ``metrics'' of ranks $(p+1)$ and $(D-p-1)$. We carry out the\nanalysis in two different ways. In one way, inspired by Cartan geometry, we\nanalyse in detail the space of intrinsic torsions (technically, the cokernel of\na Spencer differential) as a representation of $G$, exhibiting for generic\n$(p,D)$ five classes of such geometries, which we then proceed to interpret\ngeometrically. We show how to re-interpret this classification in terms of\n($D-p-2$)-brane Carrollian geometries. The same result is recovered by methods\ninspired by similar results in the physics literature: namely by studying how\nfar an adapted connection can be determined by the characteristic tensors and\nby studying which components of the torsion tensor do not depend on the\nconnection. As an application, we derive a gravity theory with underlying\n$p$-brane Galilean geometry as a non-relativistic limit of Einstein--Hilbert\ngravity and discuss how it gives a gravitational realisation of some of the\nintrinsic torsion constraints found in this paper. Our results also have\nimplications for gravity theories with an underlying ($D-p-2$)-brane Carrollian\ngeometry.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:18:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bergshoeff","Eric",""],["Figueroa-O'Farrill","Jos\u00e9",""],["van Helden","Kevin",""],["Rosseel","Jan",""],["Rotko","Iisakki",""],["ter Veldhuis","Tonnis",""]]}
{"id":"2308.12853","submitter":"Riccardo Walter Maffucci","authors":"Riccardo W. Maffucci","title":"On self-duality and unigraphicity for $3$-polytopes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent literature posed the problem of characterising the graph degree\nsequences with exactly one $3$-polytopal (i.e. planar, $3$-connected)\nrealisation. This seems to be a difficult problem in full generality. In this\npaper, we characterise the sequences with exactly one self-dual $3$-polytopal\nrealisation.\n  An algorithm in the literature constructs a self-dual $3$-polytope for any\nadmissible degree sequence. To do so, it performs operations on the radial\ngraph, so that the corresponding $3$-polytope and its dual are modified in\nexactly the same way. To settle our question and construct the relevant graphs,\nwe apply this algorithm, we introduce some modifications of it, and we also\ndevise new ones. The speed of these algorithms is linear in the graph order.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:19:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Maffucci","Riccardo W.",""]]}
{"id":"2308.12854","submitter":"Barbara Ercolano Prof","authors":"Barbara Ercolano (LMU, Munich), Giovanni Picogna (LMU, Munich),\n  Kristina Monsch (CfA)","title":"Lowest accreting protoplanetary discs consistent with X-ray\n  photoevaporation driving their final dispersal","comments":"Corrected typo in Eq 19 alpha -> log10(alpha) 6 Pages, 4 Figures,\n  accepted for publication in MNRAS Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Photoevaporation from high energy stellar radiation has been thought to drive\nthe dispersal of protoplanetary discs. Different theoretical models have been\nproposed, but their predictions diverge in terms of the rate and modality at\nwhich discs lose their mass, with significant implications for the formation\nand evolution of planets. In this paper we use disc population synthesis models\nto interpret recent observations of the lowest accreting protoplanetary discs,\ncomparing predictions from EUV-driven, FUV-driven and X-ray driven\nphotoevaporation models. We show that the recent observational data of stars\nwith low accretion rates (low accretors) point to X-ray photoevaporation as the\npreferred mechanism driving the final stages of protoplanetary disc dispersal.\nWe also show that the distribution of accretion rates predicted by the X-ray\nphotoevaporation model is consistent with observations, while other dispersal\nmodels tested here are clearly ruled out.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:20:38 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 11:52:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ercolano","Barbara","","LMU, Munich"],["Picogna","Giovanni","","LMU, Munich"],["Monsch","Kristina","","CfA"]]}
{"id":"2308.12855","submitter":"Sergey Yurkevich","authors":"Florian F\\\"urnsinn and Sergey Yurkevich","title":"Algebraicity of hypergeometric functions with arbitrary parameters","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a complete classification of the algebraicity of (generalized)\nhypergeometric functions with no restriction on the set of their parameters.\nOur characterization relies on the interlacing criteria of Christol (1987) and\nBeukers-Heckman~(1989) for globally bounded and algebraic hypergeometric\nfunctions, however in a more general setting which allows arbitrary complex\nparameters with possibly integral differences. We also showcase the adapted\ncriterion on a variety of different examples.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:24:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["F\u00fcrnsinn","Florian",""],["Yurkevich","Sergey",""]]}
{"id":"2308.12856","submitter":"Marlon Moresco","authors":"Marlon Moresco, M\\'elina Mailhot, Silvana Pesenti","title":"Uncertainty Propagation and Dynamic Robust Risk Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.RM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a framework for quantifying propagation of uncertainty arising\nin a dynamic setting. Specifically, we define dynamic uncertainty sets designed\nexplicitly for discrete stochastic processes over a finite time horizon. These\ndynamic uncertainty sets capture the uncertainty surrounding stochastic\nprocesses and models, accounting for factors such as distributional ambiguity.\nExamples of uncertainty sets include those induced by the Wasserstein distance\nand $f$-divergences.\n  We further define dynamic robust risk measures as the supremum of all\ncandidates' risks within the uncertainty set. In an axiomatic way, we discuss\nconditions on the uncertainty sets that lead to well-known properties of\ndynamic robust risk measures, such as convexity and coherence. Furthermore, we\ndiscuss the necessary and sufficient properties of dynamic uncertainty sets\nthat lead to time-consistencies of robust dynamic risk measures. We find that\nuncertainty sets stemming from $f$-divergences lead to strong time-consistency\nwhile the Wasserstein distance results in a new notion of non-normalised\ntime-consistency. Moreover, we show that a dynamic robust risk measure is\nstrong or non-normalised time-consistent if and only if it admits a recursive\nrepresentation of one-step conditional robust risk measures arising from static\nuncertainty sets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:27:11 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Moresco","Marlon",""],["Mailhot","M\u00e9lina",""],["Pesenti","Silvana",""]]}
{"id":"2308.12857","submitter":"Mengnan Zhao","authors":"Mengnan Zhao, Lihe Zhang, Yuqiu Kong and Baocai Yin","title":"Fast Adversarial Training with Smooth Convergence","comments":null,"journal-ref":"ICCV2023","doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Fast adversarial training (FAT) is beneficial for improving the adversarial\nrobustness of neural networks. However, previous FAT work has encountered a\nsignificant issue known as catastrophic overfitting when dealing with large\nperturbation budgets, \\ie the adversarial robustness of models declines to near\nzero during training.\n  To address this, we analyze the training process of prior FAT work and\nobserve that catastrophic overfitting is accompanied by the appearance of loss\nconvergence outliers.\n  Therefore, we argue a moderately smooth loss convergence process will be a\nstable FAT process that solves catastrophic overfitting.\n  To obtain a smooth loss convergence process, we propose a novel oscillatory\nconstraint (dubbed ConvergeSmooth) to limit the loss difference between\nadjacent epochs. The convergence stride of ConvergeSmooth is introduced to\nbalance convergence and smoothing. Likewise, we design weight centralization\nwithout introducing additional hyperparameters other than the loss balance\ncoefficient.\n  Our proposed methods are attack-agnostic and thus can improve the training\nstability of various FAT techniques.\n  Extensive experiments on popular datasets show that the proposed methods\nefficiently avoid catastrophic overfitting and outperform all previous FAT\nmethods. Code is available at \\url{https://github.com/FAT-CS/ConvergeSmooth}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:28:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhao","Mengnan",""],["Zhang","Lihe",""],["Kong","Yuqiu",""],["Yin","Baocai",""]]}
{"id":"2308.12858","submitter":"Marcos Salvatierra","authors":"Marcos Salvatierra, Juan G. Colonna, Mario Salvatierra Jr., Alcides de\n  C. Amorim Neto","title":"A note on improving the search of optimal prices in envy-free perfect\n  matchings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a method for finding envy-free prices in a combinatorial auction\nwhere the consumers' number $n$ coincides with that of distinct items for sale,\neach consumer can buy one single item and each item has only one unit\navailable. This is a particular case of the {\\it unit-demand envy-free pricing\nproblem}, and was recently revisited by Arbib et al. (2019). These authors\nproved that using a Fibonacci heap for solving the maximum weight perfect\nmatching and the Bellman-Ford algorithm for getting the envy-free prices, the\noverall time complexity for solving the problem is $O(n^3)$. We propose a\nmethod based on dynamic programming design strategy that seeks the optimal\nenvy-free prices by increasing the consumers' utilities, which has the same\ncubic complexity time as the aforementioned approach, but whose theoretical and\nempirical results indicate that our method performs faster than the shortest\npaths strategy, obtaining an average time reduction in determining optimal\nenvy-free prices of approximately 48\\%.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:29:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Salvatierra","Marcos",""],["Colonna","Juan G.",""],["Salvatierra","Mario","Jr."],["Neto","Alcides de C. Amorim",""]]}
{"id":"2308.12859","submitter":"Yuheng Wang","authors":"Yuheng Wang, Juan Ye, David L. Borchers","title":"Towards Automated Animal Density Estimation with Acoustic Spatial\n  Capture-Recapture","comments":"35 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.LG eess.AS stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Passive acoustic monitoring can be an effective way of monitoring wildlife\npopulations that are acoustically active but difficult to survey visually.\nDigital recorders allow surveyors to gather large volumes of data at low cost,\nbut identifying target species vocalisations in these data is non-trivial.\nMachine learning (ML) methods are often used to do the identification. They can\nprocess large volumes of data quickly, but they do not detect all vocalisations\nand they do generate some false positives (vocalisations that are not from the\ntarget species). Existing wildlife abundance survey methods have been designed\nspecifically to deal with the first of these mistakes, but current methods of\ndealing with false positives are not well-developed. They do not take account\nof features of individual vocalisations, some of which are more likely to be\nfalse positives than others. We propose three methods for acoustic spatial\ncapture-recapture inference that integrate individual-level measures of\nconfidence from ML vocalisation identification into the likelihood and hence\nintegrate ML uncertainty into inference. The methods include a mixture model in\nwhich species identity is a latent variable. We test the methods by simulation\nand find that in a scenario based on acoustic data from Hainan gibbons, in\nwhich ignoring false positives results in 17% positive bias, our methods give\nnegligible bias and coverage probabilities that are close to the nominal 95%\nlevel.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:29:24 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Yuheng",""],["Ye","Juan",""],["Borchers","David L.",""]]}
{"id":"2308.12860","submitter":"Rafael Ferraro","authors":"Rafael Ferraro","title":"The massive side of the electromagnetic waves","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stationary electromagnetic waves display aspects that are shared with massive\nparticles, since the energy and momentum contained in a volume of sides equal\nto the wavelengths form a non-zero energy-momentum invariant. The parallel can\nbe extended to the notion of weight when this concept makes sense, that is, in\nthe Newtonian chart of a weak inertial-gravitational field.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:31:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ferraro","Rafael",""]]}
{"id":"2308.12861","submitter":"Yash Deo","authors":"Yash Deo, Rodrigo Bonazzola, Haoran Dou, Yan Xia, Tianyou Wei, Nishant\n  Ravikumar, Alejandro F. Frangi, Toni Lassila","title":"Learned Local Attention Maps for Synthesising Vessel Segmentations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic resonance angiography (MRA) is an imaging modality for visualising\nblood vessels. It is useful for several diagnostic applications and for\nassessing the risk of adverse events such as haemorrhagic stroke (resulting\nfrom the rupture of aneurysms in blood vessels). However, MRAs are not acquired\nroutinely, hence, an approach to synthesise blood vessel segmentations from\nmore routinely acquired MR contrasts such as T1 and T2, would be useful. We\npresent an encoder-decoder model for synthesising segmentations of the main\ncerebral arteries in the circle of Willis (CoW) from only T2 MRI. We propose a\ntwo-phase multi-objective learning approach, which captures both global and\nlocal features. It uses learned local attention maps generated by dilating the\nsegmentation labels, which forces the network to only extract information from\nthe T2 MRI relevant to synthesising the CoW. Our synthetic vessel segmentations\ngenerated from only T2 MRI achieved a mean Dice score of $0.79 \\pm 0.03$ in\ntesting, compared to state-of-the-art segmentation networks such as transformer\nU-Net ($0.71 \\pm 0.04$) and nnU-net($0.68 \\pm 0.05$), while using only a\nfraction of the parameters. The main qualitative difference between our\nsynthetic vessel segmentations and the comparative models was in the sharper\nresolution of the CoW vessel segments, especially in the posterior circulation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:32:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Deo","Yash",""],["Bonazzola","Rodrigo",""],["Dou","Haoran",""],["Xia","Yan",""],["Wei","Tianyou",""],["Ravikumar","Nishant",""],["Frangi","Alejandro F.",""],["Lassila","Toni",""]]}
{"id":"2308.12862","submitter":"Cem Salih Un","authors":"Cem Salih Un","title":"Low Fine-Tuning with Heavy Higgsinos in Yukawa Unified SUSY GUTs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The work presented considers a class of minimally constructed Yukawa unified\nSUSY GUTs - NUHM2 - and explore their implications when their soft\nsupersymmetry breaking Lagrangian is generalized by the non-holomorphic terms\nwhich provide extra contributions to the Higgsino mass and couple the\nsupersymmetric scalar fields to the wrong Higgs doublets. With such a simple\nextension, it can be found several regions with interesting implications which\ncannot be realized in the usual restricted models. It is observed that the\nYukawa unification solutions can be compatible with relatively light mass\nspectrum and acceptable low fine-tuning measurements. In the restricted models\nsuch effects can directly be addressed to the non-holomorphic terms. They can\nprovide a slight improvement in the SM-like Higgs boson mass without altering\nthe mass spectrum too much, and they can accommodate relatively lighter sbottom\nand stau masses, while they do not change the stop sector much. The dark matter\ncan be Higgsino-like or Bino-like, but the experimental relic density\nmeasurements favor the Higgsino-like dark matter, while the Bino-like dark\nmatter is predicted with a quite large relic density. Also several\ncoannihilation scenarios are identified in the Higgsino-like dark matter\nregions, while the Bino-like dark matter do not allow any of such\ncoannihilation processes. The presence of the non-holomorphic terms can weaken\nthe impact from the phenomenological or indirect constraints such as low\nfine-tuning, Yukawa unification and rare decays of $B-$meson, the direct and\nmodel independent constraints still yield a strong strike on the solutions.\nSuch constraints are discussed in regard of the current collider analyses on\n$\\tau\\tau$ events and direct detection of dark matter experiments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:34:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Un","Cem Salih",""]]}
{"id":"2308.12863","submitter":"Yan Gong","authors":"Xinyu Zhang, Yan Gong, Zhiwei Li, Xin Gao, Dafeng Jin, Jun Li, and\n  Huaping Liu","title":"SkipcrossNets: Adaptive Skip-cross Fusion for Road Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-modal fusion is increasingly being used for autonomous driving tasks,\nas images from different modalities provide unique information for feature\nextraction. However, the existing two-stream networks are only fused at a\nspecific network layer, which requires a lot of manual attempts to set up. As\nthe CNN goes deeper, the two modal features become more and more advanced and\nabstract, and the fusion occurs at the feature level with a large gap, which\ncan easily hurt the performance. In this study, we propose a novel fusion\narchitecture called skip-cross networks (SkipcrossNets), which combines\nadaptively LiDAR point clouds and camera images without being bound to a\ncertain fusion epoch. Specifically, skip-cross connects each layer to each\nlayer in a feed-forward manner, and for each layer, the feature maps of all\nprevious layers are used as input and its own feature maps are used as input to\nall subsequent layers for the other modality, enhancing feature propagation and\nmulti-modal features fusion. This strategy facilitates selection of the most\nsimilar feature layers from two data pipelines, providing a complementary\neffect for sparse point cloud features during fusion processes. The network is\nalso divided into several blocks to reduce the complexity of feature fusion and\nthe number of model parameters. The advantages of skip-cross fusion were\ndemonstrated through application to the KITTI and A2D2 datasets, achieving a\nMaxF score of 96.85% on KITTI and an F1 score of 84.84% on A2D2. The model\nparameters required only 2.33 MB of memory at a speed of 68.24 FPS, which could\nbe viable for mobile terminals and embedded devices.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:34:31 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Xinyu",""],["Gong","Yan",""],["Li","Zhiwei",""],["Gao","Xin",""],["Jin","Dafeng",""],["Li","Jun",""],["Liu","Huaping",""]]}
{"id":"2308.12864","submitter":"Philippe Poncet","authors":"Sarah Perez, Philippe Poncet","title":"Auto-weighted Bayesian Physics-Informed Neural Networks and robust\n  estimations for multitask inverse problems in pore-scale imaging of\n  dissolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA cs.NE math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this article, we present a novel data assimilation strategy in pore-scale\nimaging and demonstrate that this makes it possible to robustly address\nreactive inverse problems incorporating Uncertainty Quantification (UQ).\nPore-scale modeling of reactive flow offers a valuable opportunity to\ninvestigate the evolution of macro-scale properties subject to dynamic\nprocesses. Yet, they suffer from imaging limitations arising from the\nassociated X-ray microtomography (X-ray microCT) process, which induces\ndiscrepancies in the properties estimates. Assessment of the kinetic parameters\nalso raises challenges, as reactive coefficients are critical parameters that\ncan cover a wide range of values. We account for these two issues and ensure\nreliable calibration of pore-scale modeling, based on dynamical microCT images,\nby integrating uncertainty quantification in the workflow.\n  The present method is based on a multitasking formulation of reactive inverse\nproblems combining data-driven and physics-informed techniques in calcite\ndissolution. This allows quantifying morphological uncertainties on the\nporosity field and estimating reactive parameter ranges through prescribed PDE\nmodels with a latent concentration field and dynamical microCT. The data\nassimilation strategy relies on sequential reinforcement incorporating\nsuccessively additional PDE constraints. We guarantee robust and unbiased\nuncertainty quantification by straightforward adaptive weighting of Bayesian\nPhysics-Informed Neural Networks (BPINNs), ensuring reliable micro-porosity\nchanges during geochemical transformations. We demonstrate successful Bayesian\nInference in 1D+Time and 2D+Time calcite dissolution based on synthetic microCT\nimages with meaningful posterior distribution on the reactive parameters and\ndimensionless numbers.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:39:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Perez","Sarah",""],["Poncet","Philippe",""]]}
{"id":"2308.12865","submitter":"Zhiguo Yang","authors":"Lechang Qin, Changtao Sheng and Zhiguo Yang","title":"A highly efficient and accurate divergence-free spectral method for\n  curl-curl equation in two and three dimensions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we present a fast divergence-free spectral algorithm (FDSA)\nfor the curl-curl problem. Divergence-free bases in two and three dimensions\nare constructed by using the generalized Jacobi polynomials. An accurate\nspectral method with exact preservation of the divergence-free constraint\npoint-wisely is then proposed, and its corresponding error estimate is\nestablished. We then present a highly efficient solution algorithm based on a\ncombination of matrix-free preconditioned Krylov subspace iterative method and\na fully diagonalizable auxiliary problem, which is derived from the spectral\ndiscretisations of generalized eigenvalue problems of Laplace and biharmonic\noperators. We rigorously prove that the dimensions of the invariant subspace of\nthe preconditioned linear system resulting from the divergence-free spectral\nmethod with respect to the dominate eigenvalue $1$, are $(N-3)^2$ and\n$2(N-3)^3$ for two- and three-dimensional problems with $(N-1)^2$ and\n$2(N-1)^3$ unknowns, respectively. Thus, the proposed method usually takes only\nseveral iterations to converge, and astonishingly, as the problem size\n(polynomial order) increases, the number of iterations will decrease, even for\nhighly indefinite system and oscillatory solutions. As a result, the\ncomputational cost of the solution algorithm is only a small multiple of $N^3$\nand $N^4$ floating number operations for 2D and 3D problems, respectively.\nPlenty of numerical examples for solving the curl-curl problem with both\nconstant and variable coefficients in two and three dimensions are presented to\ndemonstrate the accuracy and efficiency of the proposed method.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:43:12 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Qin","Lechang",""],["Sheng","Changtao",""],["Yang","Zhiguo",""]]}
{"id":"2308.12866","submitter":"Yuan Gong","authors":"Yuan Gong, Yong Zhang, Xiaodong Cun, Fei Yin, Yanbo Fan, Xuan Wang,\n  Baoyuan Wu, Yujiu Yang","title":"ToonTalker: Cross-Domain Face Reenactment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We target cross-domain face reenactment in this paper, i.e., driving a\ncartoon image with the video of a real person and vice versa. Recently, many\nworks have focused on one-shot talking face generation to drive a portrait with\na real video, i.e., within-domain reenactment. Straightforwardly applying those\nmethods to cross-domain animation will cause inaccurate expression transfer,\nblur effects, and even apparent artifacts due to the domain shift between\ncartoon and real faces. Only a few works attempt to settle cross-domain face\nreenactment. The most related work AnimeCeleb requires constructing a dataset\nwith pose vector and cartoon image pairs by animating 3D characters, which\nmakes it inapplicable anymore if no paired data is available. In this paper, we\npropose a novel method for cross-domain reenactment without paired data.\nSpecifically, we propose a transformer-based framework to align the motions\nfrom different domains into a common latent space where motion transfer is\nconducted via latent code addition. Two domain-specific motion encoders and two\nlearnable motion base memories are used to capture domain properties. A source\nquery transformer and a driving one are exploited to project domain-specific\nmotion to the canonical space. The edited motion is projected back to the\ndomain of the source with a transformer. Moreover, since no paired data is\nprovided, we propose a novel cross-domain training scheme using data from two\ndomains with the designed analogy constraint. Besides, we contribute a cartoon\ndataset in Disney style. Extensive evaluations demonstrate the superiority of\nour method over competing methods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:43:14 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gong","Yuan",""],["Zhang","Yong",""],["Cun","Xiaodong",""],["Yin","Fei",""],["Fan","Yanbo",""],["Wang","Xuan",""],["Wu","Baoyuan",""],["Yang","Yujiu",""]]}
{"id":"2308.12867","submitter":"Shutaro Hanai","authors":"Shutaro Hanai, Shinsuke Ota, Reiko Kojima, Shoichiro Masuoka, Masanori\n  Dozono, Nobuaki Imai, Shin'ichiro Michimasa, Susumu Shimoura, Juzo Zenihiro,\n  Kento Inaba, Yuto Hijikata, Ru Longhi, Ryo Nakajima","title":"Development of fast-response PPAC with strip-readout for heavy-ion beams","comments":"16 pages, 18 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A strip-readout parallel-plate avalanche counter (SR-PPAC) has been developed\naiming at the high detection efficiency and good position resolution in\nhigh-intensity heavy-ion measurements. The performance was evaluated using 115\nMeV/u $^{132}$Xe, 300 MeV/u $^{132}$Sn, and 300 MeV/u $^{48}$Ca beams. A\ndetection efficiency beyond 99% for these beams is achieved even at an incident\nbeam intensity of 0.7 billion particles per second. The best position\nresolution achieved is 235 um (FWHM).\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:43:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hanai","Shutaro",""],["Ota","Shinsuke",""],["Kojima","Reiko",""],["Masuoka","Shoichiro",""],["Dozono","Masanori",""],["Imai","Nobuaki",""],["Michimasa","Shin'ichiro",""],["Shimoura","Susumu",""],["Zenihiro","Juzo",""],["Inaba","Kento",""],["Hijikata","Yuto",""],["Longhi","Ru",""],["Nakajima","Ryo",""]]}
{"id":"2308.12868","submitter":"Marcos Salvatierra","authors":"Marcos Salvatierra","title":"A note on solving the envy-free perfect matching problem with qualities\n  of items","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the envy-free perfect matching problem, $n$ items with unit supply are\navailable to be sold to $n$ buyers with unit demand. The objective is to find\nallocation and prices such that both seller's revenue and buyers' surpluses are\nmaximized -- given the buyers' valuations for the items -- and all items must\nbe sold. A previous work has shown that this problem can be solved in cubic\ntime, using maximum weight perfect matchings to find optimal envy-free\nallocations and shortest paths to find optimal envy-free prices. In this work,\nI consider that buyers have fixed budgets, the items have quality measures and\nso the valuations are defined by multiplying these two quantities. Under this\napproach, I prove that the valuation matrix have the inverse Monge property,\nthus simplifying the search for optimal envy-free allocations and,\nconsequently, for optimal envy-free prices through a strategy based on dynamic\nprogramming. As result, I propose an algorithm that finds optimal solutions in\nquadratic time.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:45:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Salvatierra","Marcos",""]]}
{"id":"2308.12869","submitter":"Benedetta Piroddi","authors":"Benedetta Piroddi, \\'Angel David R\\'ios Ortiz","title":"On the transcendental lattices of Hyperk\\\"ahler manifolds","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the notion of a Hyper-K\\\"{a}hler manifold $X$ induced by a Hodge\nstructure of K3-type. We explore this notion for the known deformation types of\nhyper-K\\\"{a}hler manifolds studying those that are induced by a K3 or abelian\nsurface, giving lattice-theoretic criteria to decide whether or not they are\nbirational to a moduli space of sheaves over said surface. We highlight the\ndifferent behaviors we find for the particular class of hyper-K\\\"{a}hler\nmanifolds of O'Grady type.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:45:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Piroddi","Benedetta",""],["Ortiz","\u00c1ngel David R\u00edos",""]]}
{"id":"2308.12870","submitter":"Gengxuan Tian","authors":"Gengxuan Tian, Junqiao Zhao, Yingfeng Cai, Fenglin Zhang, Wenjie Mu,\n  Chen Ye","title":"VNI-Net: Vector Neurons-based Rotation-Invariant Descriptor for LiDAR\n  Place Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LiDAR-based place recognition plays a crucial role in Simultaneous\nLocalization and Mapping (SLAM) and LiDAR localization.\n  Despite the emergence of various deep learning-based and hand-crafting-based\nmethods, rotation-induced place recognition failure remains a critical\nchallenge.\n  Existing studies address this limitation through specific training strategies\nor network structures.\n  However, the former does not produce satisfactory results, while the latter\nfocuses mainly on the reduced problem of SO(2) rotation invariance. Methods\ntargeting SO(3) rotation invariance suffer from limitations in discrimination\ncapability.\n  In this paper, we propose a new method that employs Vector Neurons Network\n(VNN) to achieve SO(3) rotation invariance.\n  We first extract rotation-equivariant features from neighboring points and\nmap low-dimensional features to a high-dimensional space through VNN.\n  Afterwards, we calculate the Euclidean and Cosine distance in the\nrotation-equivariant feature space as rotation-invariant feature descriptors.\n  Finally, we aggregate the features using GeM pooling to obtain global\ndescriptors.\n  To address the significant information loss when formulating\nrotation-invariant descriptors, we propose computing distances between features\nat different layers within the Euclidean space neighborhood.\n  This greatly improves the discriminability of the point cloud descriptors\nwhile ensuring computational efficiency.\n  Experimental results on public datasets show that our approach significantly\noutperforms other baseline methods implementing rotation invariance, while\nachieving comparable results with current state-of-the-art place recognition\nmethods that do not consider rotation issues.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:47:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Tian","Gengxuan",""],["Zhao","Junqiao",""],["Cai","Yingfeng",""],["Zhang","Fenglin",""],["Mu","Wenjie",""],["Ye","Chen",""]]}
{"id":"2308.12871","submitter":"Saeid Ghafouri","authors":"Saeid Ghafouri, Kamran Razavi, Mehran Salmani, Alireza Sanaee, Tania\n  Lorido-Botran, Lin Wang, Joseph Doyle, Pooyan Jamshidi","title":"IPA: Inference Pipeline Adaptation to Achieve High Accuracy and\n  Cost-Efficiency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG cs.PF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficiently optimizing multi-model inference pipelines for fast, accurate,\nand cost-effective inference is a crucial challenge in ML production systems,\ngiven their tight end-to-end latency requirements. To simplify the exploration\nof the vast and intricate trade-off space of accuracy and cost in inference\npipelines, providers frequently opt to consider one of them. However, the\nchallenge lies in reconciling accuracy and cost trade-offs. To address this\nchallenge and propose a solution to efficiently manage model variants in\ninference pipelines, we present IPA, an online deep-learning Inference Pipeline\nAdaptation system that efficiently leverages model variants for each deep\nlearning task. Model variants are different versions of pre-trained models for\nthe same deep learning task with variations in resource requirements, latency,\nand accuracy. IPA dynamically configures batch size, replication, and model\nvariants to optimize accuracy, minimize costs, and meet user-defined latency\nSLAs using Integer Programming. It supports multi-objective settings for\nachieving different trade-offs between accuracy and cost objectives while\nremaining adaptable to varying workloads and dynamic traffic patterns.\nExtensive experiments on a Kubernetes implementation with five real-world\ninference pipelines demonstrate that IPA improves normalized accuracy by up to\n35% with a minimal cost increase of less than 5%.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:48:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ghafouri","Saeid",""],["Razavi","Kamran",""],["Salmani","Mehran",""],["Sanaee","Alireza",""],["Lorido-Botran","Tania",""],["Wang","Lin",""],["Doyle","Joseph",""],["Jamshidi","Pooyan",""]]}
{"id":"2308.12872","submitter":"Sungkon Chang","authors":"Sungkon Chang","title":"Distribution of Zeckendorf expressions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By Zeckendorf's Theorem, every positive integer is uniquely written as a sum\nof distinct non-adjacent Fibonacci terms. In this paper, we investigate the\nasymptotic formula of the number of binary expansions $<x$ that have no\nadjacent terms, and generalize the result to the setting of general linear\nrecurrences with non-negative integer coefficients.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:48:38 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chang","Sungkon",""]]}
{"id":"2308.12873","submitter":"Barbara Maria Latacz","authors":"B. M. Latacz, B. P. Arndt, J. A. Devlin, S. R. Erlewein, M. Fleck, J.\n  I. J\\\"ager, P. Micke, G. Umbrazunas, E. Wursten, F. Abbass, D. Schweitzer, M.\n  Wiesinger, C. Will, H. Yildiz, K. Blaum, Y. Matsuda, A. Mooser, C. Ospelkaus,\n  C. Smorra, A. S\\'ot\\'er, W. Quint, J. Walz, Y. Yamazaki, S. Ulmer","title":"Ultra thin polymer foil cryogenic window for antiproton deceleration and\n  storage","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the design and characterisation of a cryogenic window based on an\nultra-thin aluminised PET foil at T < 10K, which can withstand a pressure\ndifference larger than 1bar at a leak rate < $1\\times 10^{-9}$ mbar$\\cdot$ l/s.\nIts thickness of approximately 1.7 $\\mu$m makes it transparent to various types\nof particles over a broad energy range. To optimise the transfer of 100keV\nantiprotons through the window, we tested the degrading properties of different\naluminium coated PET foils of thicknesses between 900nm and 2160nm, concluding\nthat 1760nm foil decelerates antiprotons to an average energy of 5 keV. We have\nalso explicitly studied the permeation as a function of coating thickness and\ntemperature, and have performed extensive thermal and mechanical endurance and\nstress tests. Our final design integrated into the experiment has an effective\nopen surface consisting of 7 holes with 1 mm diameter and will transmit up to\n2.5% of the injected 100keV antiproton beam delivered by the AD/ELENA-facility\nof CERN.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:51:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Latacz","B. M.",""],["Arndt","B. P.",""],["Devlin","J. A.",""],["Erlewein","S. R.",""],["Fleck","M.",""],["J\u00e4ger","J. I.",""],["Micke","P.",""],["Umbrazunas","G.",""],["Wursten","E.",""],["Abbass","F.",""],["Schweitzer","D.",""],["Wiesinger","M.",""],["Will","C.",""],["Yildiz","H.",""],["Blaum","K.",""],["Matsuda","Y.",""],["Mooser","A.",""],["Ospelkaus","C.",""],["Smorra","C.",""],["S\u00f3t\u00e9r","A.",""],["Quint","W.",""],["Walz","J.",""],["Yamazaki","Y.",""],["Ulmer","S.",""]]}
{"id":"2308.12874","submitter":"Marcial Sanchis Mr","authors":"Marcial Sanchis-Agudo and Yuning Wang and Karthik Duraisamy and\n  Ricardo Vinuesa","title":"Easy attention: A simple self-attention mechanism for Transformers","comments":"12 pages and 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To improve the robustness of transformer neural networks used for\ntemporal-dynamics prediction of chaotic systems, we propose a novel attention\nmechanism called easy attention. Due to the fact that self attention only makes\nusage of the inner product of queries and keys, it is demonstrated that the\nkeys, queries and softmax are not necessary for obtaining the attention score\nrequired to capture long-term dependencies in temporal sequences. Through\nimplementing singular-value decomposition (SVD) on the softmax attention score,\nwe further observe that the self attention compresses contribution from both\nqueries and keys in the spanned space of the attention score. Therefore, our\nproposed easy-attention method directly treats the attention scores as\nlearnable parameters. This approach produces excellent results when\nreconstructing and predicting the temporal dynamics of chaotic systems\nexhibiting more robustness and less complexity than the self attention or the\nwidely-used long short-term memory (LSTM) network. Our results show great\npotential for applications in more complex high-dimensional dynamical systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:54:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sanchis-Agudo","Marcial",""],["Wang","Yuning",""],["Duraisamy","Karthik",""],["Vinuesa","Ricardo",""]]}
{"id":"2308.12875","submitter":"Alisson R Cadore","authors":"Ingrid D. Barcelos, Raphaela de Oliveira, Gabriel R. Schleder, Matheus\n  J. S. Matos, Raphael Longuinhos, Jenaina Ribeiro-Soares, Ana Paula M.\n  Barboza, Mariana C. Prado, Elis\\^angela S. Pinto, Yara Galv\\~ao Gobato,\n  H\\'elio Chacham, Bernardo R. A. Neves, Alisson R. Cadore","title":"Phyllosilicates as earth-abundant layered materials for electronics and\n  optoelectronics: Prospects and challenges in their ultrathin limit","comments":"29 pages, 4 figures","journal-ref":"Journal of Applied Physics, 2023","doi":"10.1063/5.0161736","report-no":null,"categories":"physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Phyllosilicate minerals are an emerging class of naturally occurring layered\ninsulators with large bandgap energy that have gained attention from the\nscientific community. This class of lamellar materials has been recently\nexplored at the ultrathin two-dimensional level due to their specific\nmechanical, electrical, magnetic, and optoelectronic properties, which are\ncrucial for engineering novel devices (including heterostructures). Due to\nthese properties, phyllosilicates minerals can be considered promising low-cost\nnanomaterials for future applications. In this Perspective article, we will\npresent relevant features of these materials for their use in potential\n2D-based electronic and optoelectronic applications, also discussing some of\nthe major challenges in working with them.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:55:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Barcelos","Ingrid D.",""],["de Oliveira","Raphaela",""],["Schleder","Gabriel R.",""],["Matos","Matheus J. S.",""],["Longuinhos","Raphael",""],["Ribeiro-Soares","Jenaina",""],["Barboza","Ana Paula M.",""],["Prado","Mariana C.",""],["Pinto","Elis\u00e2ngela S.",""],["Gobato","Yara Galv\u00e3o",""],["Chacham","H\u00e9lio",""],["Neves","Bernardo R. A.",""],["Cadore","Alisson R.",""]]}
{"id":"2308.12876","submitter":"Miranda Christ","authors":"Sarah Radway and Miranda Christ","title":"The Impact of De-Identification on Single-Year-of-Age Counts in the U.S.\n  Census","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In 2020, the U.S. Census Bureau transitioned from data swapping to\ndifferential privacy (DP) in its approach to de-identifying decennial census\ndata. This decision has faced considerable criticism from data users,\nparticularly due to concerns about the accuracy of DP. We compare the relative\nimpacts of swapping and DP on census data, focusing on the use case of school\nplanning, where single-year-of-age population counts (i.e., the number of\nfour-year-olds in the district) are used to estimate the number of incoming\nstudents and make resulting decisions surrounding faculty, classrooms, and\nfunding requests. We examine these impacts for school districts of varying\npopulation sizes and age distributions.\n  Our findings support the use of DP over swapping for single-year-of-age\ncounts; in particular, concerning behaviors associated with DP (namely, poor\nbehavior for smaller districts) occur with swapping mechanisms as well. For the\nschool planning use cases we investigate, DP provides comparable, if not\nimproved, accuracy over swapping, while offering other benefits such as\nimproved transparency.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:56:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Radway","Sarah",""],["Christ","Miranda",""]]}
{"id":"2308.12877","submitter":"Anthony Yazdani","authors":"Anthony Yazdani, Hossein Rouhizadeh, David Vicente Alvarez, Douglas\n  Teodoro","title":"DS4DH at #SMM4H 2023: Zero-Shot Adverse Drug Events Normalization using\n  Sentence Transformers and Reciprocal-Rank Fusion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper outlines the performance evaluation of a system for adverse drug\nevent normalization, developed by the Data Science for Digital Health group for\nthe Social Media Mining for Health Applications 2023 shared task 5. Shared task\n5 targeted the normalization of adverse drug event mentions in Twitter to\nstandard concepts from the Medical Dictionary for Regulatory Activities\nterminology. Our system hinges on a two-stage approach: BERT fine-tuning for\nentity recognition, followed by zero-shot normalization using sentence\ntransformers and reciprocal-rank fusion. The approach yielded a precision of\n44.9%, recall of 40.5%, and an F1-score of 42.6%. It outperformed the median\nperformance in shared task 5 by 10% and demonstrated the highest performance\namong all participants. These results substantiate the effectiveness of our\napproach and its potential application for adverse drug event normalization in\nthe realm of social media text mining.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 14:07:59 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yazdani","Anthony",""],["Rouhizadeh","Hossein",""],["Alvarez","David Vicente",""],["Teodoro","Douglas",""]]}
{"id":"2308.12878","submitter":"Lijie Zhang","authors":"Jiaqi Deng, Gulnigar Ablat, Yumu Yang, Xiaoshuai Fu, Qilong Wu, Ping\n  Li, Li Zhang, Ali Safaei, Lijie Zhang, and Zhihui Qin","title":"Two-dimensional germanium islands with Dirac signature on Ag2Ge surface\n  alloy","comments":null,"journal-ref":"J. Phys.: Condens. Matter 33 (2021) 225001 (7pp)","doi":"10.1088/1361-648X/abe731","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional (2D) Dirac materials have attracted intense research efforts\ndue to their promise for applications ranging from field-effect transistors and\nlow-power electronics to fault-tolerant quantum computation. One key challenge\nis to fabricate 2D Dirac materials hosting Dirac electrons. Here, monolayer\ngermanene is successfully fabricated on a Ag2Ge surface alloy. Scanning\ntunneling spectroscopy measurements revealed a linear energy dispersion\nrelation. The latter was supported by density functional theory calculations.\nThese results demonstrate that monolayer germanene can be realistically\nfabricated on a Ag2Ge surface alloy. The finding opens the door to exploration\nand study of 2D Dirac material physics and device applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:59:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Deng","Jiaqi",""],["Ablat","Gulnigar",""],["Yang","Yumu",""],["Fu","Xiaoshuai",""],["Wu","Qilong",""],["Li","Ping",""],["Zhang","Li",""],["Safaei","Ali",""],["Zhang","Lijie",""],["Qin","Zhihui",""]]}
{"id":"2308.12879","submitter":"Matteo Zatti","authors":"Matteo Zatti","title":"$\\alpha'$ corrections to 4-dimensional non-extremal stringy black holes","comments":"21 pages + appendices, 3 figures","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-108","categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the first-order $\\alpha'$ corrections to a family of\n4-dimensional, 4-charge, non-extremal black hole solutions of Heterotic\nSupergravity in the case with 3 independent charges. The solutions are fully\nanalytic, reproduce the extremal limit previously found in the literature and,\napplying T-duality, they transform as expected. If we reduce to the case with a\nsingle independent charge we obtain the corrections to four embeddings of the\nReissner-Nordstr\\\"om black hole in string theory. We completely characterize\nthe black hole thermodynamics computing the Hawking temperature, Wald entropy,\nmass, gauge charges and their dual thermodynamic potentials. We verify that all\nthese quantities are related by the first law of extended black hole mechanics\nand the Smarr formula once we include a potential associated to the\ndimensionful parameter $\\alpha'$ and the scalar charges. We found that the\nlatter are not identified with the poles at infinity of the scalar fields\nbecause they receive $\\alpha'$ corrections.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 15:59:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zatti","Matteo",""]]}
{"id":"2308.12880","submitter":"Chengfei Liu","authors":"Qiuyu Zhu and Xuewen Zu and Chengfei Liu","title":"Multi-stage feature decorrelation constraints for improving CNN\n  classification performance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For the convolutional neural network (CNN) used for pattern classification,\nthe training loss function is usually applied to the final output of the\nnetwork, except for some regularization constraints on the network parameters.\nHowever, with the increasing of the number of network layers, the influence of\nthe loss function on the network front layers gradually decreases, and the\nnetwork parameters tend to fall into local optimization. At the same time, it\nis found that the trained network has significant information redundancy at all\nstages of features, which reduces the effectiveness of feature mapping at all\nstages and is not conducive to the change of the subsequent parameters of the\nnetwork in the direction of optimality. Therefore, it is possible to obtain a\nmore optimized solution of the network and further improve the classification\naccuracy of the network by designing a loss function for restraining the front\nstage features and eliminating the information redundancy of the front stage\nfeatures .For CNN, this article proposes a multi-stage feature decorrelation\nloss (MFD Loss), which refines effective features and eliminates information\nredundancy by constraining the correlation of features at all stages.\nConsidering that there are many layers in CNN, through experimental comparison\nand analysis, MFD Loss acts on multiple front layers of CNN, constrains the\noutput features of each layer and each channel, and performs supervision\ntraining jointly with classification loss function during network training.\nCompared with the single Softmax Loss supervised learning, the experiments on\nseveral commonly used datasets on several typical CNNs prove that the\nclassification performance of Softmax Loss+MFD Loss is significantly better.\nMeanwhile, the comparison experiments before and after the combination of MFD\nLoss and some other typical loss functions verify its good universality.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:00:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Qiuyu",""],["Zu","Xuewen",""],["Liu","Chengfei",""]]}
{"id":"2308.12881","submitter":"Luka Mili\\'cevi\\'c","authors":"Luka Mili\\'cevi\\'c","title":"Approximate quadratic varieties","comments":"58 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A classical result in additive combinatorics, which is a combination of\nBalog-Szemer\\'edi-Gowers theorem and a variant of Freiman's theorem due to\nRuzsa, says that if a subset $A$ of $\\mathbb{F}_p^n$ contains at least $c\n|A|^3$ additive quadruples, then there exists a subspace $V$, comparable in\nsize to $A$, such that $|A \\cap V| \\geq \\Omega_c(|A|)$. Motivated by the fact\nthat higher order approximate algebraic structures play an important role in\nthe theory of uniformity norms, it would be of interest to find higher order\nanalogues of the mentioned result.\n  In this paper, we study a quadratic version of the approximate property in\nquestion, namely what it means for a set to be an approximate quadratic\nvariety. It turns out that information on the number of additive cubes, which\nare 8-tuples of the form $(x, x+ a,$ $x+ b, x+ c,$ $x+ a + b, x+ a + c,$ $x+ b\n+ c, x+ a + b + c)$, in a set is insufficient on its own to guarantee quadratic\nstructure, and it is necessary to restrict linear structure in a given set,\nwhich is a natural assumption in this context. With this in mind, we say that a\nsubset $V$ of a finite vector space $G$ is a $(c_0, \\delta,\n\\varepsilon)$-approximate quadratic variety if $|V| = \\delta |G|$, $\\|1_V -\n\\delta\\|_{\\mathsf{U}^2} \\leq \\varepsilon$ and $V$ contains at least\n$c_0\\delta^7 |G|^4$ additive cubes. Our main result is the structure theorem\nfor approximate quadratic varieties, stating that such a set has a large\nintersection with an exact quadratic variety of comparable size.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:00:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mili\u0107evi\u0107","Luka",""]]}
{"id":"2308.12882","submitter":"Sayanton V. Dibbo","authors":"Sayanton V. Dibbo, Juston S. Moore, Garrett T. Kenyon, Michael A. Teti","title":"LCANets++: Robust Audio Classification using Multi-layer Neural Networks\n  with Lateral Competition","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CR cs.LG eess.AS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Audio classification aims at recognizing audio signals, including speech\ncommands or sound events. However, current audio classifiers are susceptible to\nperturbations and adversarial attacks. In addition, real-world audio\nclassification tasks often suffer from limited labeled data. To help bridge\nthese gaps, previous work developed neuro-inspired convolutional neural\nnetworks (CNNs) with sparse coding via the Locally Competitive Algorithm (LCA)\nin the first layer (i.e., LCANets) for computer vision. LCANets learn in a\ncombination of supervised and unsupervised learning, reducing dependency on\nlabeled samples. Motivated by the fact that auditory cortex is also sparse, we\nextend LCANets to audio recognition tasks and introduce LCANets++, which are\nCNNs that perform sparse coding in multiple layers via LCA. We demonstrate that\nLCANets++ are more robust than standard CNNs and LCANets against perturbations,\ne.g., background noise, as well as black-box and white-box attacks, e.g.,\nevasion and fast gradient sign (FGSM) attacks.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 17:42:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dibbo","Sayanton V.",""],["Moore","Juston S.",""],["Kenyon","Garrett T.",""],["Teti","Michael A.",""]]}
{"id":"2308.12883","submitter":"Yoshiaki Itoh","authors":"Sumie Ueda, Takashi Tsuchiya, Yoshiaki Itoh","title":"Computational Dating for the Nuzi Cuneiform Archive: The Least Squares\n  Constrained by Family Trees and Synchronisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a computational method of dating for an archive in ancient\nMesopotamia. We use the name index Nuzi Personal Names (NPN) published in 1943.\nWe made an electronic version of NPN and added the kinships of the two powerful\nfamilies to NPN to reflect the Nuzi studies after 1943. Nuzi is a town from the\n15th - 14th century B.C.E.for a period of some five generations in Arrapha. The\ncuneiform tablets listed in NPN are for contracts on land transactions,\nmarriage, loans, slavery, etc. In NPN, the kinships and cuneiform tablets\n(contracts, documents, texts) involved are listed for each person. We\nreconstruct family trees from the added NPN to formulate the least squares\nproblem with the constraints: a person's father is at least 22.5 years older\nthan the person, contractors were living at the time of the contract, etc. Our\nresults agree with the Assyriological results of M. P. Maidman on the seniority\namong siblings of a powerful family. Our method could be applied to the other\nclay tablet archives once we have the name index in the format of NPN.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:59:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Ueda","Sumie",""],["Tsuchiya","Takashi",""],["Itoh","Yoshiaki",""]]}
{"id":"2308.12884","submitter":"Zhiguo Yang","authors":"Jie Xu, Xiaotian Yang and Zhiguo Yang","title":"A second-order length-preserving and unconditionally energy stable\n  rotational discrete gradient method for Oseen-Frank gradient flows","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a second-order strictly length-preserving and unconditionally\nenergy-stable rotational discrete gradient (Rdg) scheme for the numerical\napproximation of the Oseen-Frank gradient flows with anisotropic elastic energy\nfunctional. Two essential ingredients of the Rdg method are reformulation of\nthe length constrained gradient flow into an unconstrained rotational form and\ndiscrete gradient discretization for the energy variation. Besides the\nwell-known mean-value and Gonzalez discrete gradients, we propose a novel\nOseen-Frank discrete gradient, specifically designed for the solution of\nOseen-Frank gradient flow. We prove that the proposed Oseen-Frank discrete\ngradient satisfies the energy difference relation, thus the resultant Rdg\nscheme is energy stable. Numerical experiments demonstrate the efficiency and\naccuracy of the proposed Rdg method and its capability for providing reliable\nsimulation results with highly disparate elastic coefficients.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:01:25 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Xu","Jie",""],["Yang","Xiaotian",""],["Yang","Zhiguo",""]]}
{"id":"2308.12885","submitter":"Oana Inel","authors":"Oana Inel, Tim Draws and Lora Aroyo","title":"Collect, Measure, Repeat: Reliability Factors for Responsible AI Data\n  Collection","comments":null,"journal-ref":"HCOMP 2023","doi":null,"report-no":null,"categories":"cs.LG cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The rapid entry of machine learning approaches in our daily activities and\nhigh-stakes domains demands transparency and scrutiny of their fairness and\nreliability. To help gauge machine learning models' robustness, research\ntypically focuses on the massive datasets used for their deployment, e.g.,\ncreating and maintaining documentation for understanding their origin, process\nof development, and ethical considerations. However, data collection for AI is\nstill typically a one-off practice, and oftentimes datasets collected for a\ncertain purpose or application are reused for a different problem.\nAdditionally, dataset annotations may not be representative over time, contain\nambiguous or erroneous annotations, or be unable to generalize across issues or\ndomains. Recent research has shown these practices might lead to unfair,\nbiased, or inaccurate outcomes. We argue that data collection for AI should be\nperformed in a responsible manner where the quality of the data is thoroughly\nscrutinized and measured through a systematic set of appropriate metrics. In\nthis paper, we propose a Responsible AI (RAI) methodology designed to guide the\ndata collection with a set of metrics for an iterative in-depth analysis of the\nfactors influencing the quality and reliability} of the generated data. We\npropose a granular set of measurements to inform on the internal reliability of\na dataset and its external stability over time. We validate our approach across\nnine existing datasets and annotation tasks and four content modalities. This\napproach impacts the assessment of data robustness used for AI applied in the\nreal world, where diversity of users and content is eminent. Furthermore, it\ndeals with fairness and accountability aspects in data collection by providing\nsystematic and transparent quality analysis for data collections.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 18:01:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Inel","Oana",""],["Draws","Tim",""],["Aroyo","Lora",""]]}
{"id":"2308.12886","submitter":"Chenxu Pang","authors":"Chenxu Pang, Xiaojie Wang and Yue Wu","title":"Linear implicit approximations of invariant measures of semi-linear SDEs\n  with non-globally Lipschitz coefficients","comments":"45 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article investigates the weak approximation towards the invariant\nmeasure of semi-linear stochastic differential equations (SDEs) under\nnon-globally Lipschitz coefficients. For this purpose, we propose a\nlinear-theta-projected Euler (LTPE) scheme, which also admits an invariant\nmeasure, to handle the potential influence of the linear stiffness. Under\ncertain assumptions, both the SDE and the corresponding LTPE method are shown\nto converge exponentially to the underlying invariant measures, respectively.\nMoreover, with time-independent regularity estimates for the corresponding\nKolmogorov equation, the weak error between the numerical invariant measure and\nthe original one can be guaranteed with an order one. Numerical experiments are\nprovided to verify our theoretical findings.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:03:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pang","Chenxu",""],["Wang","Xiaojie",""],["Wu","Yue",""]]}
{"id":"2308.12887","submitter":"Sruthi Narayanan","authors":"Rajamani Narayanan and Sruthi A. Narayanan","title":"Spectrum of two-dimensional $su(2)$ gauge theories coupled to massless\n  fermions in integer representations","comments":"21 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spectra of two-dimensional $su(2)$ gauge theories coupled to a single\nmassless Majorana fermion in integer representations, $J$, are numerically\ninvestigated using the Discrete Light-Cone Hamiltonian. The primary aim is to\nunderstand the presence of massless states for $J>2$ in spite of the absence of\na continuous symmetry. After comparing to existing results for $J=1$ (adjoint\nfermions), we present results for $J=2,3,4$. As expected, for $J=2$ there are\nno massless states but in contrast to the $J=1$ theory, the lightest state is a\nboson. We find exact zero modes in the bosonic and fermionic sector for all\nvalues of total momentum for $J=3$ and $J=4$ and, in each sector, the number of\nzero modes grows with the value of the total momentum. In addition to the\nspectrum, we present results on the particle number and momentum fraction\ndistributions and argue for a separation of bulk states from edge states.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:04:42 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 01:55:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Narayanan","Rajamani",""],["Narayanan","Sruthi A.",""]]}
{"id":"2308.12888","submitter":"Lu Chen","authors":"Lu Chen, Ruqing Zhang, Wei Huang, Wei Chen, Jiafeng Guo, Xueqi Cheng","title":"Inducing Causal Structure for Abstractive Text Summarization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The mainstream of data-driven abstractive summarization models tends to\nexplore the correlations rather than the causal relationships. Among such\ncorrelations, there can be spurious ones which suffer from the language prior\nlearned from the training corpus and therefore undermine the overall\neffectiveness of the learned model. To tackle this issue, we introduce a\nStructural Causal Model (SCM) to induce the underlying causal structure of the\nsummarization data. We assume several latent causal factors and non-causal\nfactors, representing the content and style of the document and summary.\nTheoretically, we prove that the latent factors in our SCM can be identified by\nfitting the observed training data under certain conditions. On the basis of\nthis, we propose a Causality Inspired Sequence-to-Sequence model (CI-Seq2Seq)\nto learn the causal representations that can mimic the causal factors, guiding\nus to pursue causal information for summary generation. The key idea is to\nreformulate the Variational Auto-encoder (VAE) to fit the joint distribution of\nthe document and summary variables from the training corpus. Experimental\nresults on two widely used text summarization datasets demonstrate the\nadvantages of our approach.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:06:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Lu",""],["Zhang","Ruqing",""],["Huang","Wei",""],["Chen","Wei",""],["Guo","Jiafeng",""],["Cheng","Xueqi",""]]}
{"id":"2308.12889","submitter":"Patrick Irwin","authors":"Patrick G. J. Irwin, Jack Dobinson, Arjuna James. Michael H. Wong,\n  Leigh N. Fletcher, Michael T. Roman, Nicholas A. Teanby, Daniel Toledo, Glenn\n  S. Orton, Santiago Perez-Hoyos, Agustin Sanchez-Lavega, Lawrence Sromovsky,\n  Amy A. Simon, Raul Morales-Juberias, Imke de Pater, and Statia L. Cook","title":"Spectral determination of the colour and vertical structure of dark\n  spots in Neptune's atmosphere","comments":"1 table. 3 figures. Nature Astronomy (2023)","journal-ref":null,"doi":"10.1038/s41550-023-02047-0","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previous observations of dark vortices in Neptune's atmosphere, such as\nVoyager-2's Great Dark Spot, have been made in only a few, broad-wavelength\nchannels, which has hampered efforts to pinpoint their pressure level and what\nmakes them dark. Here, we present Very Large Telescope (Chile) MUSE\nspectrometer observations of Hubble Space Telescope's NDS-2018 dark spot, made\nin 2019. These medium-resolution 475 - 933 nm reflection spectra allow us to\nshow that dark spots are caused by a darkening at short wavelengths (< 700 nm)\nof a deep ~5-bar aerosol layer, which we suggest is the H$_2$S condensation\nlayer. A deep bright spot, named DBS-2019, is also visible on the edge of\nNDS-2018, whose spectral signature is consistent with a brightening of the same\n5-bar layer at longer wavelengths (> 700 nm). This bright feature is much\ndeeper than previously studied dark spot companion clouds and may be connected\nwith the circulation that generates and sustains such spots.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:06:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Irwin","Patrick G. J.",""],["Dobinson","Jack",""],["Wong","Arjuna James. Michael H.",""],["Fletcher","Leigh N.",""],["Roman","Michael T.",""],["Teanby","Nicholas A.",""],["Toledo","Daniel",""],["Orton","Glenn S.",""],["Perez-Hoyos","Santiago",""],["Sanchez-Lavega","Agustin",""],["Sromovsky","Lawrence",""],["Simon","Amy A.",""],["Morales-Juberias","Raul",""],["de Pater","Imke",""],["Cook","Statia L.",""]]}
{"id":"2308.12890","submitter":"Yanshan Wang","authors":"David Oniani, Jordan Hilsman, Hang Dong, Fengyi Gao, Shiven Verma,\n  Yanshan Wang","title":"Large Language Models Vote: Prompting for Rare Disease Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The emergence of generative Large Language Models (LLMs) emphasizes the need\nfor accurate and efficient prompting approaches. LLMs are often applied in\nFew-Shot Learning (FSL) contexts, where tasks are executed with minimal\ntraining data. FSL has become popular in many Artificial Intelligence (AI)\nsubdomains, including AI for health. Rare diseases affect a small fraction of\nthe population. Rare disease identification from clinical notes inherently\nrequires FSL techniques due to limited data availability. Manual data\ncollection and annotation is both expensive and time-consuming. In this paper,\nwe propose Models-Vote Prompting (MVP), a flexible prompting approach for\nimproving the performance of LLM queries in FSL settings. MVP works by\nprompting numerous LLMs to perform the same tasks and then conducting a\nmajority vote on the resulting outputs. This method achieves improved results\nto any one model in the ensemble on one-shot rare disease identification and\nclassification tasks. We also release a novel rare disease dataset for FSL,\navailable to those who signed the MIMIC-IV Data Use Agreement (DUA).\nFurthermore, in using MVP, each model is prompted multiple times, substantially\nincreasing the time needed for manual annotation, and to address this, we\nassess the feasibility of using JSON for automating generative LLM evaluation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:09:13 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 14:16:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Oniani","David",""],["Hilsman","Jordan",""],["Dong","Hang",""],["Gao","Fengyi",""],["Verma","Shiven",""],["Wang","Yanshan",""]]}
{"id":"2308.12891","submitter":"Andreas Vikelis","authors":"Georgios Grekas, Konstantinos Koumatos, Charalambos Makridakis and\n  Andreas Vikelis","title":"A class of Discontinuous Galerkin methods for nonlinear variational\n  problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the context of Discontinuous Galerkin methods, we study approximations of\nnonlinear variational problems associated with convex energies. We propose\nelement-wise nonconforming finite element methods to discretize the continuous\nminimisation problem. Using $\\Gamma$-convergence arguments we show that the\ndiscrete minimisers converge to the unique minimiser of the continuous problem\nas the mesh parameter tends to zero, under the additional contribution of\nappropriately defined penalty terms at the level of the discrete energies. We\nfinally substantiate the feasibility of our methods by numerical examples.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:11:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Grekas","Georgios",""],["Koumatos","Konstantinos",""],["Makridakis","Charalambos",""],["Vikelis","Andreas",""]]}
{"id":"2308.12892","submitter":"Kyungeun Kim","authors":"Kyungeun Kim, Tao Zhang, J. M. Schwarz","title":"Mean field elastic moduli of a three-dimensional cell-based vertex model","comments":"18 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The mechanics of a foam typically depends on the bubble geometry, topology,\nand the material at hand, be it metallic or polymeric, for example. While the\nfoam energy functional for each bubble is typically minimization of surface\narea for a given volume, biology provides us with a wealth of additional energy\nfunctionals, should one consider biological cells as a foam-like material.\nHere, we focus on a mean field approach to obtain the elastic moduli, within\nlinear response, for an ordered, three-dimensional vertex model using the\nspace-filling shape of a truncated octahedron and whose energy functional is\ncharacterized by a restoring surface area spring and a restoring volume spring.\nThe tuning of the three-dimensional shape index exhibits a rigidity transition\nvia a compatible-incompatible transition. Specifically, for smaller shape\nindices, both the target surface area and volume cannot be achieved, while\nbeyond some critical value of the three-dimensional shape index, they can be,\nresulting in a zero-energy state. As the elastic moduli depend on curvatures of\nthe energy when the system, we obtain these as well. In addition to\nanalytically determining the location of the transition in mean field, we find\nthat the rigidity transition and the elastic moduli depend on the\nparameterization of the cell shape with this effect being more pronounced in\nthree dimensions given the array of shapes that a polyhedron can take on (as\ncompared to a polygon). We also uncover nontrivial dependence on the\ndeformation protocol in which some deformations result in affine motion of the\nvertices, while others result in nonaffine motion. Such dependencies on the\nshape parameterization and deformation protocol give rise to a nontrivial shape\nlandscape and, therefore, nontrivial mechanical response even in the absence of\ntopology changes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:15:16 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kim","Kyungeun",""],["Zhang","Tao",""],["Schwarz","J. M.",""]]}
{"id":"2308.12893","submitter":"Yael Davidov","authors":"Yael Davidov","title":"Admissibility over semi-global fields in the bad characteristic case","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A finite group $G$ is said to be admissible over a field $F$ if there exists\na division algebra $D$ central over $F$ with a maximal subfield $L$ such that\n$L/F$ is Galois with group $G$. In this paper we give a complete\ncharacterization of admissible groups over function fields of curves over\nequicharacteristic complete discretely valued fields with algebraically closed\nresidue fields, such as the field $\\overline{\\mathbb{F}_P}((t))(x)$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:15:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Davidov","Yael",""]]}
{"id":"2308.12894","submitter":"Yuhe Liu","authors":"Yuhe Liu, Chuanjian Liu, Kai Han, Quan Tang, Zengchang Qin","title":"Boosting Semantic Segmentation from the Perspective of Explicit Class\n  Embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semantic segmentation is a computer vision task that associates a label with\neach pixel in an image. Modern approaches tend to introduce class embeddings\ninto semantic segmentation for deeply utilizing category semantics, and regard\nsupervised class masks as final predictions. In this paper, we explore the\nmechanism of class embeddings and have an insight that more explicit and\nmeaningful class embeddings can be generated based on class masks purposely.\nFollowing this observation, we propose ECENet, a new segmentation paradigm, in\nwhich class embeddings are obtained and enhanced explicitly during interacting\nwith multi-stage image features. Based on this, we revisit the traditional\ndecoding process and explore inverted information flow between segmentation\nmasks and class embeddings. Furthermore, to ensure the discriminability and\ninformativity of features from backbone, we propose a Feature Reconstruction\nmodule, which combines intrinsic and diverse branches together to ensure the\nconcurrence of diversity and redundancy in features. Experiments show that our\nECENet outperforms its counterparts on the ADE20K dataset with much less\ncomputational cost and achieves new state-of-the-art results on PASCAL-Context\ndataset. The code will be released at https://gitee.com/mindspore/models and\nhttps://github.com/Carol-lyh/ECENet.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:16:10 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liu","Yuhe",""],["Liu","Chuanjian",""],["Han","Kai",""],["Tang","Quan",""],["Qin","Zengchang",""]]}
{"id":"2308.12895","submitter":"Yves Kini","authors":"Yves Kini, Tuomo Salmi, Serena Vinciguerra, Anna L. Watts, Devarshi\n  Choudhury, Slavko Bogdanov, Johannes Buchner, Zach Meisel, Valery Suleimanov","title":"Pulse Profile Modelling of Thermonuclear Burst Oscillations II: Handling\n  variability","comments":"submitted to MNRAS. The Zenodo link will go public after peer review.\n  Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pulse profile modelling is a relativistic ray-tracing technique that can be\nused to infer masses, radii and geometric parameters of neutron stars. In a\nprevious study, we looked at the performance of this technique when applied to\nthermonuclear burst oscillations from accreting neutron stars. That study\nshowed that ignoring the variability associated with burst oscillation sources\nresulted in significant biases in the inferred mass and radius, particularly\nfor the high count rates that are nominally required to obtain meaningful\nconstraints. In this follow-on study, we show that the bias can be mitigated by\nslicing the bursts into shorter segments where variability can be neglected,\nand jointly fitting the segments. Using this approach, the systematic\nuncertainties on the mass and radius are brought within the range of the\nstatistical uncertainty. With about 10$^6$ source counts, this yields\nuncertainties of approximately 10% for both the mass and radius. However, this\nmodelling strategy requires substantial computational resources. We also\nconfirm that the posterior distributions of the mass and radius obtained from\nmultiple bursts of the same source can be merged to produce outcomes comparable\nto that of a single burst with an equivalent total number of counts.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:16:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kini","Yves",""],["Salmi","Tuomo",""],["Vinciguerra","Serena",""],["Watts","Anna L.",""],["Choudhury","Devarshi",""],["Bogdanov","Slavko",""],["Buchner","Johannes",""],["Meisel","Zach",""],["Suleimanov","Valery",""]]}
{"id":"2308.12896","submitter":"Jordy Van Landeghem","authors":"Jordy Van Landeghem, Sanket Biswas, Matthew B. Blaschko,\n  Marie-Francine Moens","title":"Beyond Document Page Classification: Design, Datasets, and Challenges","comments":"8 pages, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper highlights the need to bring document classification benchmarking\ncloser to real-world applications, both in the nature of data tested ($X$:\nmulti-channel, multi-paged, multi-industry; $Y$: class distributions and label\nset variety) and in classification tasks considered ($f$: multi-page document,\npage stream, and document bundle classification, ...). We identify the lack of\npublic multi-page document classification datasets, formalize different\nclassification tasks arising in application scenarios, and motivate the value\nof targeting efficient multi-page document representations. An experimental\nstudy on proposed multi-page document classification datasets demonstrates that\ncurrent benchmarks have become irrelevant and need to be updated to evaluate\ncomplete documents, as they naturally occur in practice. This reality check\nalso calls for more mature evaluation methodologies, covering calibration\nevaluation, inference complexity (time-memory), and a range of realistic\ndistribution shifts (e.g., born-digital vs. scanning noise, shifting page\norder). Our study ends on a hopeful note by recommending concrete avenues for\nfuture improvements.}\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:16:47 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 15:57:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Van Landeghem","Jordy",""],["Biswas","Sanket",""],["Blaschko","Matthew B.",""],["Moens","Marie-Francine",""]]}
{"id":"2308.12897","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan","title":"The D(2) property for $D_8$","comments":"Paper published in peer reviewed journal in 2007","journal-ref":"Algebr. Geom. Topol. 7 (2007), Issue 1, pp. 517-528","doi":"10.2140/agt.2007.7.517","report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wall's D(2) problem asks if a cohomologically 2-dimensional geometric\n3-complex is necessarily homotopy equivalent to a geometric 2-complex. We solve\npart of the problem when the fundamental group is dihedral of order $2^n$, and\noffer a complete solution for the case where it is $D_8$ the dihedral group of\norder 8.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:17:29 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""]]}
{"id":"2308.12898","submitter":"Liang Ding","authors":"Fei Wang, Liang Ding, Jun Rao, Ye Liu, Li Shen, Changxing Ding","title":"Can Linguistic Knowledge Improve Multimodal Alignment in Vision-Language\n  Pretraining?","comments":"[TL;DR] we design and release the SNARE, the first large-scale\n  multimodal alignment probing benchmark for current vision-language pretrained\n  models","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM cs.AI cs.CL cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The multimedia community has shown a significant interest in perceiving and\nrepresenting the physical world with multimodal pretrained neural network\nmodels, and among them, the visual-language pertaining (VLP) is, currently, the\nmost captivating topic. However, there have been few endeavors dedicated to the\nexploration of 1) whether essential linguistic knowledge (e.g., semantics and\nsyntax) can be extracted during VLP, and 2) how such linguistic knowledge\nimpact or enhance the multimodal alignment. In response, here we aim to\nelucidate the impact of comprehensive linguistic knowledge, including semantic\nexpression and syntactic structure, on multimodal alignment. Specifically, we\ndesign and release the SNARE, the first large-scale multimodal alignment\nprobing benchmark, to detect the vital linguistic components, e.g., lexical,\nsemantic, and syntax knowledge, containing four tasks: Semantic structure,\nNegation logic, Attribute ownership, and Relationship composition. Based on our\nproposed probing benchmarks, our holistic analyses of five advanced VLP models\nillustrate that the VLP model: i) shows insensitivity towards complex syntax\nstructures and relies on content words for sentence comprehension; ii)\ndemonstrates limited comprehension of combinations between sentences and\nnegations; iii) faces challenges in determining the presence of actions or\nspatial relationships within visual information and struggles with verifying\nthe correctness of triple combinations. We make our benchmark and code\navailable at \\url{https://github.com/WangFei-2019/SNARE/}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:17:40 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 12:22:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Fei",""],["Ding","Liang",""],["Rao","Jun",""],["Liu","Ye",""],["Shen","Li",""],["Ding","Changxing",""]]}
{"id":"2308.12899","submitter":"Jiawei Jiang","authors":"Jiawei Jiang, Chengkai Han, Wayne Xin Zhao, Jingyuan Wang","title":"Unified Data Management and Comprehensive Performance Evaluation for\n  Urban Spatial-Temporal Prediction [Experiment, Analysis & Benchmark]","comments":"14 pages, 3 figures. arXiv admin note: text overlap with\n  arXiv:2304.14343","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The field of urban spatial-temporal prediction is advancing rapidly with the\ndevelopment of deep learning techniques and the availability of large-scale\ndatasets. However, challenges persist in accessing and utilizing diverse urban\nspatial-temporal datasets from different sources and stored in different\nformats, as well as determining effective model structures and components with\nthe proliferation of deep learning models. This work addresses these challenges\nand provides three significant contributions. Firstly, we introduce \"atomic\nfiles\", a unified storage format designed for urban spatial-temporal big data,\nand validate its effectiveness on 40 diverse datasets, simplifying data\nmanagement. Secondly, we present a comprehensive overview of technological\nadvances in urban spatial-temporal prediction models, guiding the development\nof robust models. Thirdly, we conduct extensive experiments using diverse\nmodels and datasets, establishing a performance leaderboard and identifying\npromising research directions. Overall, this work effectively manages urban\nspatial-temporal data, guides future efforts, and facilitates the development\nof accurate and efficient urban spatial-temporal prediction models. It can\npotentially make long-term contributions to urban spatial-temporal data\nmanagement and prediction, ultimately leading to improved urban living\nstandards.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:20:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jiang","Jiawei",""],["Han","Chengkai",""],["Zhao","Wayne Xin",""],["Wang","Jingyuan",""]]}
{"id":"2308.12900","submitter":"Ethan Sussman","authors":"Ethan Sussman","title":"The regularization of Dotsenko--Fateev integrals","comments":"20 pages, 6 figures. To appear in Lett. Math. Phys","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss the regularization of certain hypergeometric integrals appearing\nin 2D CFT, a step needed in the construction of the BPZ minimal models via the\nCoulomb gas formalism. The method is a generalization of Pochhammer's\nregularization of the Euler Beta-function. The constructions of the relevant\nhomology classes are inspired by a recent singular-geometric analysis of the\nDotsenko--Fateev integrand.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:20:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sussman","Ethan",""]]}
{"id":"2308.12901","submitter":"Alain Albouy","authors":"Alain Albouy and Antonio Carlos Fernandes","title":"A limit of nonplanar 5-body central configurations is nonplanar","comments":"17 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Moeckel (1990), Moeckel and Sim\\'o (1995) proved that, while continuously\nchanging the masses, a 946-body planar central configuration bifurcates into a\nspatial central configuration. We show that this kind of bifurcation does not\noccur with 5 bodies. Question 17 in the list Albouy & al (2012) is thus\nanswered negatively.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:21:43 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Albouy","Alain",""],["Fernandes","Antonio Carlos",""]]}
{"id":"2308.12902","submitter":"Hossein Shakibania","authors":"Hossein Shakibania, Sina Raoufi, Hassan Khotanlou","title":"CDAN: Convolutional Dense Attention-guided Network for Low-light Image\n  Enhancement","comments":"20 Pages, 13 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Low-light images, characterized by inadequate illumination, pose challenges\nof diminished clarity, muted colors, and reduced details. Low-light image\nenhancement, an essential task in computer vision, aims to rectify these issues\nby improving brightness, contrast, and overall perceptual quality, thereby\nfacilitating accurate analysis and interpretation. This paper introduces the\nConvolutional Dense Attention-guided Network (CDAN), a novel solution for\nenhancing low-light images. CDAN integrates an autoencoder-based architecture\nwith convolutional and dense blocks, complemented by an attention mechanism and\nskip connections. This architecture ensures efficient information propagation\nand feature learning. Furthermore, a dedicated post-processing phase refines\ncolor balance and contrast. Our approach demonstrates notable progress compared\nto state-of-the-art results in low-light image enhancement, showcasing its\nrobustness across a wide range of challenging scenarios. Our model performs\nremarkably on benchmark datasets, effectively mitigating under-exposure and\nproficiently restoring textures and colors in diverse low-light scenarios. This\nachievement underscores CDAN's potential for diverse computer vision tasks,\nnotably enabling robust object detection and recognition in challenging\nlow-light conditions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:22:05 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 14:23:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shakibania","Hossein",""],["Raoufi","Sina",""],["Khotanlou","Hassan",""]]}
{"id":"2308.12903","submitter":"Alan Boss","authors":"Alan P. Boss and Shubham Kanodia","title":"Forming Gas Giants Around a Range of Protostellar M-dwarfs by Gas Disk\n  Gravitational Instability","comments":"34 pages, 8 figures, in press, ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent discoveries of gas giant exoplanets around M-dwarfs (GEMS) from\ntransiting and radial velocity (RV) surveys are difficult to explain with\ncore-accretion models. We present here a homogeneous suite of 162 models of\ngravitationally unstable gaseous disks. These models represent an existence\nproof for gas giants more massive than 0.1 Jupiter masses to form by the gas\ndisk gravitational instability (GDGI) mechanism around M-dwarfs for comparison\nwith observed exoplanet demographics and protoplanetary disk mass estimates for\nM-dwarf stars. We use the Enzo 2.6 adaptive mesh refinement (AMR) 3D\nhydrodynamics code to follow the formation and initial orbital evolution of gas\ngiant protoplanets in gravitationally unstable gaseous disks in orbit around\nM-dwarfs with stellar masses ranging from 0.1 $M_\\odot$ to 0.5 $M_\\odot$. The\ngas disk masses are varied over a range from disks that are too low in mass to\nform gas giants rapidly to those where numerous gas giants are formed,\ntherefore revealing the critical disk mass necessary for gas giants to form by\nthe GDGI mechanism around M-dwarfs. The disk masses vary from 0.01 $M_\\odot$ to\n0.05 $M_\\odot$ while the disk to star mass ratios explored range from 0.04 to\n0.3. The models have varied initial outer disk temperatures (10 K to 60 K) and\nvaried levels of AMR grid spatial resolution, producing a sample of expected\ngas giant protoplanets for each star mass. Broadly speaking, disk masses of at\nleast 0.02 $M_\\odot$ are needed for the GDGI mechanism to form gas giant\nprotoplanets around M-dwarfs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:24:02 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Boss","Alan P.",""],["Kanodia","Shubham",""]]}
{"id":"2308.12904","submitter":"Michael Liberman A.","authors":"Chengeng Qian and Mikhail A. Liberman","title":"On the mechanism of \"tulip flame\" formation: the effect of ignition\n  sources","comments":"37 pages, 12 figures. arXiv admin note: text overlap with\n  arXiv:2209.00709","journal-ref":null,"doi":null,"report-no":"Preprint NORDITA-2023-050","categories":"physics.flu-dyn","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The early stages of hydrogen-air flame dynamics and the physical mechanism of\ntulip flame formation were studied using high-resolution numerical simulations\nto solve the two-dimensional fully compressible Navier-Stokes equations coupled\nwith a one-step chemical model, which was calibrated to obtain the correct the\nlaminar flame velocity-pressure dependence. The formation of tulip flames was\ninvestigated for a flame ignited by a spark or by a planar ignition and\npropagating to the opposite closed or open end. For a flame ignited by a spark\non-axis at the closed end of the tube and propagating to the opposite closed or\nopen end, a tulip flame is created by a tulip-shaped axial velocity profile in\nthe unburned gas flow near the flame front caused by the rarefaction wave(s)\ncreated by the flame during the deceleration stage(s). It is shown that, in a\ntube with both closed ends, this mechanism of tulip flame formation also holds\nfor flames initiated by planar ignition. The deceleration stages in the case of\nplanar ignition are caused by collisions of the flame front with pressure waves\nreflected from the opposite end of the tube. In the case of a flame initiated\nby planar ignition and propagating toward the open end, the mechanism of tulip\nflame formation is related to the stretching of the flame skirt edges backward\nalong the side wall of the tube due to wall friction, which leads to the\nformation of bulges in the flame front near the tube walls. The bulges grow and\nfinally meet at the axis of the tube, forming a tulip-shaped flame. Regardless\nof the method of flame initiation at the closed end, no distorted tulip flame\nis formed when the flame propagates to the open end of the tube.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:24:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Qian","Chengeng",""],["Liberman","Mikhail A.",""]]}
{"id":"2308.12905","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan","title":"The third homotopy module of a 2-complex","comments":"Paper published in peer reviewed journal in 2008. arXiv admin note:\n  text overlap with arXiv:2308.11844","journal-ref":"Bulletin of the London Mathematical Society 40 (2008), Issue 4,\n  pp. 664-674","doi":"10.1112/blms/bdn047","report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a connected 2-complex X with fundamental group G, we show how pi_3(X)\nmay be computed as a module over Z[G]. Further we show that if X is a finite\nconnected 2-complex with G (the fundamental group) finite of odd order, then\nthe stable class of pi_3(X) is determined by G.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:25:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""]]}
{"id":"2308.12906","submitter":"Jan Forbrich","authors":"Jan Forbrich, Charles J. Lada, J\\'er\\^ome Pety, and Glen Petitpas","title":"Tracing Dense Gas in Six Resolved GMCs of the Andromeda Galaxy","comments":"MNRAS, in press","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present dense-gas--tracing molecular observations of six resolved Giant\nMolecular Clouds (GMCs) in the Andromeda Galaxy (M31). Using the NOEMA\ninterferometer, we observed the transitions of HCN(1-0), HCO$^+$(1-0), and\nHNC(1-0), as well as $^{13}$CO(1-0) and 100 GHz continuum emission. This\ncomplements our earlier work with the Submillimeter Array (SMA), including\nresolved dust continuum detections of these clouds at 230 GHz. In this work, we\nfirst compare different continuum measurements to conclude that the average\nfree-free contamination of the observed flux is 71% at 3 mm but only 13% at 1\nmm, confirming that emission at 3 mm is less reliable than that at 1 mm for\ncalculating dust masses of star-forming clouds. While the $^{13}$CO emission is\nmore extended than both HCN and HCO$^+$ emission, which in turn is more\nextended than HNC emission, we find that both HCN and HCO$^+$ are spatially\ncoincident with, and similarly extended as, the 230 GHz dust emission. This\nsuggests that both the 230 GHz dust continuum and most importantly the HCN\nemission traces the dense gas component of these GMCs. From comparison of the\nmolecular emission with dust masses derived from the 230 GHz continuum\nemission, we obtain the first direct measurements of the dust-mass-to-light\nratios ($\\alpha^\\prime_{HCN}$ and $\\alpha^\\prime_{HCO^+}$) in GMCs of an\nexternal galaxy. For HCN, the result is broadly similar to a measurement in the\nlocal Perseus cloud suggesting that these are indeed dense gas conversion\nfactors. A larger cloud sample will be required to assess whether HCN is\ntracing comparable cloud-scale density regimes across the environments of M31.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:27:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Forbrich","Jan",""],["Lada","Charles J.",""],["Pety","J\u00e9r\u00f4me",""],["Petitpas","Glen",""]]}
{"id":"2308.12907","submitter":"Liu-Di Lu","authors":"Martin Jakob Gander, Liu-Di Lu","title":"New time domain decomposition methods for parabolic control problems I:\n  Dirichlet-Neumann and Neumann-Dirichlet algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present new Dirichlet-Neumann and Neumann-Dirichlet algorithms with a time\ndomain decomposition applied to unconstrained parabolic optimal control\nproblems. After a spatial semi-discretization, we use the Lagrange multiplier\napproach to derive a coupled forward-backward optimality system, which can then\nbe solved using a time domain decomposition. Due to the forward-backward\nstructure of the optimality system, three variants can be found for the\nDirichlet-Neumann and Neumann-Dirichlet algorithms. We analyze their\nconvergence behavior and determine the optimal relaxation parameter for each\nalgorithm. Our analysis reveals that the most natural algorithms are actually\nonly good smoothers, and there are better choices which lead to efficient\nsolvers. We illustrate our analysis with numerical experiments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:31:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gander","Martin Jakob",""],["Lu","Liu-Di",""]]}
{"id":"2308.12908","submitter":"Pratyush Patel","authors":"Pratyush Patel, Esha Choukse, Chaojie Zhang, \\'I\\~nigo Goiri, Brijesh\n  Warrier, Nithish Mahalingam, Ricardo Bianchini","title":"POLCA: Power Oversubscription in LLM Cloud Providers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent innovation in large language models (LLMs), and their myriad use-cases\nhave rapidly driven up the compute capacity demand for datacenter GPUs. Several\ncloud providers and other enterprises have made substantial plans of growth in\ntheir datacenters to support these new workloads. One of the key bottleneck\nresources in datacenters is power, and given the increasing model sizes of\nLLMs, they are becoming increasingly power intensive. In this paper, we show\nthat there is a significant opportunity to oversubscribe power in LLM clusters.\nPower oversubscription improves the power efficiency of these datacenters,\nallowing more deployable servers per datacenter, and reduces the deployment\ntime, since building new datacenters is slow.\n  We extensively characterize the power consumption patterns of a variety of\nLLMs and their configurations. We identify the differences between the\ninference and training power consumption patterns. Based on our analysis of\nthese LLMs, we claim that the average and peak power utilization in LLM\nclusters for inference should not be very high. Our deductions align with the\ndata from production LLM clusters, revealing that inference workloads offer\nsubstantial headroom for power oversubscription. However, the stringent set of\ntelemetry and controls that GPUs offer in a virtualized environment, makes it\nchallenging to have a reliable and robust power oversubscription mechanism.\n  We propose POLCA, our framework for power oversubscription that is robust,\nreliable, and readily deployable for GPU clusters. Using open-source models to\nreplicate the power patterns observed in production, we simulate POLCA and\ndemonstrate that we can deploy 30% more servers in the same GPU cluster for\ninference, with minimal performance loss\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:32:34 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Patel","Pratyush",""],["Choukse","Esha",""],["Zhang","Chaojie",""],["Goiri","\u00cd\u00f1igo",""],["Warrier","Brijesh",""],["Mahalingam","Nithish",""],["Bianchini","Ricardo",""]]}
{"id":"2308.12909","submitter":"Maosu Li","authors":"Maosu Li, Fan Xue, Anthony G.O. Yeh","title":"Efficient assessment of window views in high-rise, high-density urban\n  areas using 3D color City Information Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Urban-scale quantification of window views can inform housing selection and\nvaluation, landscape management, and urban planning. However, window views are\nnumerous in high-rise, high-density urban areas and current automatic\nassessments of window views are inaccurate and time-consuming. Thus, both\naccurate and efficient assessment of window views is significant in improving\nthe automation for urban-scale window view applications. The paper presents an\nautomatic, accurate, and efficient assessment of window view indices (WVIs) of\ngreenery, sky, waterbody, and construction using 3D color City Information\nModels (CIMs). The workflow includes: i) 3D semantic segmentation of\nphotorealistic CIM and Digital Surface Model (DSM), and ii) batch computation\nof WVIs. Experimental results showed the estimated WVIs were more accurate\n(RMSE < 0.01), and the proposed method was more efficient (3.68 times faster)\nthan Li et al.'s (2022) 2D semantic segmentation. Thus, the proposed method can\nfacilitate large-scale WVI assessment and update in healthy high-rise,\nhigh-density urban development.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:35:25 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 05:17:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Maosu",""],["Xue","Fan",""],["Yeh","Anthony G. O.",""]]}
{"id":"2308.12910","submitter":"Ziyan Yang","authors":"Ziyan Yang, Kushal Kafle, Zhe Lin, Scott Cohen, Zhihong Ding, Vicente\n  Ordonez","title":"SCoRD: Subject-Conditional Relation Detection with Text-Augmented Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose Subject-Conditional Relation Detection SCoRD, where conditioned on\nan input subject, the goal is to predict all its relations to other objects in\na scene along with their locations. Based on the Open Images dataset, we\npropose a challenging OIv6-SCoRD benchmark such that the training and testing\nsplits have a distribution shift in terms of the occurrence statistics of\n$\\langle$subject, relation, object$\\rangle$ triplets. To solve this problem, we\npropose an auto-regressive model that given a subject, it predicts its\nrelations, objects, and object locations by casting this output as a sequence\nof tokens. First, we show that previous scene-graph prediction methods fail to\nproduce as exhaustive an enumeration of relation-object pairs when conditioned\non a subject on this benchmark. Particularly, we obtain a recall@3 of 83.8% for\nour relation-object predictions compared to the 49.75% obtained by a recent\nscene graph detector. Then, we show improved generalization on both\nrelation-object and object-box predictions by leveraging during training\nrelation-object pairs obtained automatically from textual captions and for\nwhich no object-box annotations are available. Particularly, for\n$\\langle$subject, relation, object$\\rangle$ triplets for which no object\nlocations are available during training, we are able to obtain a recall@3 of\n42.59% for relation-object pairs and 32.27% for their box locations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:35:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yang","Ziyan",""],["Kafle","Kushal",""],["Lin","Zhe",""],["Cohen","Scott",""],["Ding","Zhihong",""],["Ordonez","Vicente",""]]}
{"id":"2308.12911","submitter":"Daniele Malitesta","authors":"Daniele Malitesta, Giandomenico Cornacchia, Claudio Pomo, Tommaso Di\n  Noia","title":"On Popularity Bias of Multimodal-aware Recommender Systems: a\n  Modalities-driven Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multimodal-aware recommender systems (MRSs) exploit multimodal content (e.g.,\nproduct images or descriptions) as items' side information to improve\nrecommendation accuracy. While most of such methods rely on factorization\nmodels (e.g., MFBPR) as base architecture, it has been shown that MFBPR may be\naffected by popularity bias, meaning that it inherently tends to boost the\nrecommendation of popular (i.e., short-head) items at the detriment of niche\n(i.e., long-tail) items from the catalog. Motivated by this assumption, in this\nwork, we provide one of the first analyses on how multimodality in\nrecommendation could further amplify popularity bias. Concretely, we evaluate\nthe performance of four state-of-the-art MRSs algorithms (i.e., VBPR, MMGCN,\nGRCN, LATTICE) on three datasets from Amazon by assessing, along with\nrecommendation accuracy metrics, performance measures accounting for the\ndiversity of recommended items and the portion of retrieved niche items. To\nbetter investigate this aspect, we decide to study the separate influence of\neach modality (i.e., visual and textual) on popularity bias in different\nevaluation dimensions. Results, which demonstrate how the single modality may\naugment the negative effect of popularity bias, shed light on the importance to\nprovide a more rigorous analysis of the performance of such models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:37:39 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Malitesta","Daniele",""],["Cornacchia","Giandomenico",""],["Pomo","Claudio",""],["Di Noia","Tommaso",""]]}
{"id":"2308.12912","submitter":"Alexander R. H. Smith","authors":"Philipp A. Hoehn, Andrea Russo, and Alexander R. H. Smith","title":"Matter relative to quantum hypersurfaces","comments":"21 pages, 3 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the canonical description of a scalar field as a parameterized\nfield theory on an extended phase space that includes additional embedding\nfields that characterize spacetime hypersurfaces $\\mathsf{X}$ relative to which\nthe scalar field is described. This theory is quantized via the Dirac\nprescription and physical states of the theory are used to define conditional\nwave functionals $|\\psi_\\phi[\\mathsf{X}]\\rangle$ interpreted as the state of\nthe field relative to the hypersurface $\\mathsf{X}$, thereby extending the\nPage-Wootters formalism to quantum field theory. It is shown that this\nconditional wave functional satisfies the Tomonaga-Schwinger equation, thus\ndemonstrating the formal equivalence between this extended Page-Wootters\nformalism and standard quantum field theory. We also construct relational Dirac\nobservables and define a quantum deparameterization of the physical Hilbert\nspace leading to a relational Heisenberg picture, which are both shown to be\nunitarily equivalent to the Page-Wootters formalism. Moreover, by treating\nhypersurfaces as quantum reference frames, we extend recently developed quantum\nframe transformations to changes between classical and nonclassical\nhypersurfaces. This allows us to exhibit the transformation properties of a\nquantum field under a larger class of transformations, which leads to a\nframe-dependent particle creation effect.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:39:00 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Hoehn","Philipp A.",""],["Russo","Andrea",""],["Smith","Alexander R. H.",""]]}
{"id":"2308.12913","submitter":"Liping Meng","authors":"Liping Meng, Zhaoyi Xu, Meirong Tang","title":"Test the Weak Cosmic Supervision Conjecture in Dark Matter-Black Hole\n  System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There is a possibility that the event horizon of a Kerr-like black hole with\nperfect fluid dark matter (DM) can be destroyed, providing a potential\nopportunity for understanding the weak cosmic censorship conjecture of black\nholes. In this study, we analyze the influence of the intensity parameter of\nperfect fluid DM on the destruction of the event horizon of a Kerr-like black\nhole with spinning after injecting test particles and scalar fields. We find\nthat, when test particles are incident on the black hole, the event horizon is\ndestroyed by perfect fluid dark matter for extreme black holes. For nearly\nextreme black holes, when the dark matter parameter satisfies $\\alpha \\in \\left\n(-r_{h} , 0\\right ) \\cup \\left ( r_{h} ,+ \\infty \\right )$ i.e.$(A<0)$, the\nevent horizon of the black hole will not be destroyed; when the dark matter\nparameter satisfies $\\alpha \\in\\left ( -\\infty ,-r_{h} \\right ]\\cup\n\\left[0,r_{h}\\right ]$ i.e.$(A\\ge 0)$, the event horizon of the black hole will\nbe destroyed. When a classical scalar field is incident into the black hole in\nthe extremal black hole case, we find that the range of mode patterns of the\nscalar field that can disrupt the black hole event horizon is different for\ndifferent values of the ideal fluid dark matter intensity parameter. In the\nnearly extremal black hole case, through our analysis, we have found when\n$\\alpha\\neq0 $ and $\\alpha\\neq\\pm\\ r_h$ i.e.$A\\neq0$, the event horizon of the\nblack hole can be disrupted. Our research results indicate that dark matter\nmight be capable of breaking the black hole horizon, thus potentially violating\nthe weak cosmic censorship conjecture.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:39:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Meng","Liping",""],["Xu","Zhaoyi",""],["Tang","Meirong",""]]}
{"id":"2308.12914","submitter":"Alessandro Simoni","authors":"Alessandro Simoni, Francesco Marchetti, Guido Borghi, Federico\n  Becattini, Lorenzo Seidenari, Roberto Vezzani, Alberto Del Bimbo","title":"Robot Pose Nowcasting: Forecast the Future to Improve the Present","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In recent years, the effective and safe collaboration between humans and\nmachines has gained significant importance, particularly in the Industry 4.0\nscenario. A critical prerequisite for realizing this collaborative paradigm is\nprecisely understanding the robot's 3D pose within its environment. Therefore,\nin this paper, we introduce a novel vision-based system leveraging depth data\nto accurately establish the 3D locations of robotic joints. Specifically, we\nprove the ability of the proposed system to enhance its current pose estimation\naccuracy by jointly learning to forecast future poses. Indeed, we introduce the\nconcept of Pose Nowcasting, denoting the capability of a system to exploit the\nlearned knowledge of the future to improve the estimation of the present. The\nexperimental evaluation is conducted on two different datasets, providing\nstate-of-the-art and real-time performance and confirming the validity of the\nproposed method on both the robotic and human scenarios.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:40:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Simoni","Alessandro",""],["Marchetti","Francesco",""],["Borghi","Guido",""],["Becattini","Federico",""],["Seidenari","Lorenzo",""],["Vezzani","Roberto",""],["Del Bimbo","Alberto",""]]}
{"id":"2308.12915","submitter":"Zhouyi Li","authors":"Yuqian Sun, Zhouyi Li, Ke Fang, Chang Hee Lee, Ali Asadipour","title":"Language as Reality: A Co-Creative Storytelling Game Experience in 1001\n  Nights using Generative AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present \"1001 Nights\", an AI-native game that allows\nplayers lead in-game reality through co-created storytelling with the character\ndriven by large language model. The concept is inspired by Wittgenstein's idea\nof the limits of one's world being determined by the bounds of their language.\nUsing advanced AI tools like GPT-4 and Stable Diffusion, the second iteration\nof the game enables the protagonist, Shahrzad, to realize words and stories in\nher world. The player can steer the conversation with the AI King towards\nspecific keywords, which then become battle equipment in the game. This blend\nof interactive narrative and text-to-image transformation challenges the\nconventional border between the game world and reality through a dual\nperspective. We focus on Shahrzad, who seeks to alter her fate compared to the\noriginal folklore, and the player, who collaborates with AI to craft narratives\nand shape the game world. We explore the technical and design elements of\nimplementing such a game with an objective to enhance the narrative game genre\nwith AI-generated content and to delve into AI-native gameplay possibilities.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:42:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sun","Yuqian",""],["Li","Zhouyi",""],["Fang","Ke",""],["Lee","Chang Hee",""],["Asadipour","Ali",""]]}
{"id":"2308.12916","submitter":"Ramkishor Sharma","authors":"Ramkishor Sharma, Jani Dahl, Axel Brandenburg, and Mark Hindmarsh","title":"Shallow relic gravitational wave spectrum with acoustic peak","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":"NORDITA-2023-051, HIP-2023-13/TH","categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the gravitational wave (GW) spectrum produced by acoustic waves in\nthe early universe, such as would be produced by a first order phase\ntransition, focusing on the low-frequency side of the peak. We confirm with\nnumerical simulations the Sound Shell model prediction of a steep rise with\nwave number $k$ of $k^9$ to a peak whose magnitude grows at a rate\n$(H/k_\\text{p})H$, where $H$ is the Hubble rate and $k_\\text{p}$ the peak wave\nnumber, set by the peak wave number of the fluid velocity power spectrum. We\nalso show that hitherto neglected terms give a shallower part with amplitude\n$(H/k_\\text{p})^2$ in the range $H \\lesssim k \\lesssim k_\\text{p}$, which in\nthe limit of small $H/k$ rises as $k$. This linear rise has been seen in other\nmodelling and also in direct numerical simulations. The relative amplitude\nbetween the linearly rising part and the peak therefore depends on the peak\nwave number of the velocity spectrum and the lifetime of the source, which in\nan expanding background is bounded above by the Hubble time $H^{-1}$. For slow\nphase transitions, which have the lowest peak wave number and the loudest\nsignals, the acoustic GW peak appears as a localized enhancement of the\nspectrum, with a rise to the peak less steep than $k^9$. The shape of the peak,\nabsent in vortical turbulence, may help to lift degeneracies in phase\ntransition parameter estimation at future GW observatories.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:42:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sharma","Ramkishor",""],["Dahl","Jani",""],["Brandenburg","Axel",""],["Hindmarsh","Mark",""]]}
{"id":"2308.12917","submitter":"Sina Arefizadeh","authors":"Sina Arefizadeh, Angelia Nedich","title":"Characterization of Potential Games: Application in Aggregative Games","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main objective of this work is to describe games which fall under title\nof Potential and simplify the conditions for class of aggregative games. Games\nclassified as aggregative are ones in which, in addition to the player's own\naction, the payoff for each player depends on an aggregate of all the players'\ndecision variables. In this study, we developed a method based on payoff\nfunctions to determine if a given game is potential. Then, in order to identify\nthe Aggregative Games that fall under this class we simplified the criteria for\nthe class of Aggregative Games. A $3$-player Cournot game, also known as an\nAggregative Potential Game, is used to test the characterization criteria for\nPotential Games. A $4$-player Cournot game is also utilized to test the form of\npotential function we obtained for class of general potential games.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:44:15 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Arefizadeh","Sina",""],["Nedich","Angelia",""]]}
{"id":"2308.12918","submitter":"John Harshith","authors":"John Harshith, Mantej Singh Gill, Madhan Jothimani","title":"Evaluating the Vulnerabilities in ML systems in terms of adversarial\n  attacks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There have been recent adversarial attacks that are difficult to find. These\nnew adversarial attacks methods may pose challenges to current deep learning\ncyber defense systems and could influence the future defense of cyberattacks.\nThe authors focus on this domain in this research paper. They explore the\nconsequences of vulnerabilities in AI systems. This includes discussing how\nthey might arise, differences between randomized and adversarial examples and\nalso potential ethical implications of vulnerabilities. Moreover, it is\nimportant to train the AI systems appropriately when they are in testing phase\nand getting them ready for broader use.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:46:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Harshith","John",""],["Gill","Mantej Singh",""],["Jothimani","Madhan",""]]}
{"id":"2308.12919","submitter":"Jian Liang","authors":"Jian Liang and Lijun Sheng and Zhengbo Wang and Ran He and Tieniu Tan","title":"Towards Realistic Unsupervised Fine-tuning with CLIP","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence of vision-language models (VLMs), such as CLIP, has spurred a\nsignificant research effort towards their application for downstream supervised\nlearning tasks. Although some previous studies have explored the unsupervised\nfine-tuning of CLIP, they often rely on prior knowledge in the form of class\nnames associated with ground truth labels. In this paper, we delve into a\nrealistic unsupervised fine-tuning scenario by assuming that the unlabeled data\nmight contain out-of-distribution samples from unknown classes. Furthermore, we\nemphasize the importance of simultaneously enhancing out-of-distribution\ndetection capabilities alongside the recognition of instances associated with\npredefined class labels.\n  To tackle this problem, we present a simple, efficient, and effective\nfine-tuning approach called Universal Entropy Optimization (UEO). UEO leverages\nsample-level confidence to approximately minimize the conditional entropy of\nconfident instances and maximize the marginal entropy of less confident\ninstances. Apart from optimizing the textual prompts, UEO also incorporates\noptimization of channel-wise affine transformations within the visual branch of\nCLIP. Through extensive experiments conducted across 15 domains and 4 different\ntypes of prior knowledge, we demonstrate that UEO surpasses baseline methods in\nterms of both generalization and out-of-distribution detection.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:47:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Liang","Jian",""],["Sheng","Lijun",""],["Wang","Zhengbo",""],["He","Ran",""],["Tan","Tieniu",""]]}
{"id":"2308.12920","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan and Seamus O'Shea","title":"Minimal algebraic complexes over $D_{4n}$","comments":"Paper published in peer reviewed journal in 2013","journal-ref":"Algebr. Geom. Topol. 13 (2013), Issue 6, pp. 3287-3304","doi":"10.2140/agt.2013.13.3287","report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that cancellation of free modules holds in the stable class\n$\\Omega_3(\\mathbb{Z})$ over dihedral groups of order $4n$. In light of a recent\nresult on realizing $k$-invariants for these groups, this completes the proof\nthat all all dihedral groups satisfy the D(2) property.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:47:22 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""],["O'Shea","Seamus",""]]}
{"id":"2308.12921","submitter":"Amin Shojaeighadikolaei","authors":"Amin Shojaeighadikolaei, Morteza Hashemi","title":"An Efficient Distributed Multi-Agent Reinforcement Learning for EV\n  Charging Network Control","comments":"8 pages, 4 figures, accepted at Allerton 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.LG cs.SY eess.SY math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing trend in adopting electric vehicles (EVs) will significantly\nimpact the residential electricity demand, which results in an increased risk\nof transformer overload in the distribution grid. To mitigate such risks, there\nare urgent needs to develop effective EV charging controllers. Currently, the\nmajority of the EV charge controllers are based on a centralized approach for\nmanaging individual EVs or a group of EVs. In this paper, we introduce a\ndecentralized Multi-agent Reinforcement Learning (MARL) charging framework that\nprioritizes the preservation of privacy for EV owners. We employ the\nCentralized Training Decentralized Execution-Deep Deterministic Policy Gradient\n(CTDE-DDPG) scheme, which provides valuable information to users during\ntraining while maintaining privacy during execution. Our results demonstrate\nthat the CTDE framework improves the performance of the charging network by\nreducing the network costs. Moreover, we show that the Peak-to-Average Ratio\n(PAR) of the total demand is reduced, which, in turn, reduces the risk of\ntransformer overload during the peak hours.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:53:52 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Shojaeighadikolaei","Amin",""],["Hashemi","Morteza",""]]}
{"id":"2308.12922","submitter":"Ahmed Jellal","authors":"Mohammed El Azar, Ahmed Bouhlal, Abdulaziz D. Alhaidari, Ahmed Jellal","title":"Electron trapping in graphene quantum dots with magnetic flux","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that the appearance of Klein tunneling in graphene makes it hard\nto keep or localize electrons in a graphene-based quantum dot (GQD). However, a\nmagnetic field can be used to temporarily confine an electron that is traveling\ninto a GQD. The electronic states investigated here are resonances with a\nfinite trapping time, also referred to as quasi-bound states. By subjecting the\nGDQ to a magnetic flux, we study the scattering phenomenon and the\nAharonov-Bohm effect on the lifetime of quasi-bound states existing in a GQD.\nWe demonstrate that the trapping time increases with the magnetic flux\nsustaining the trapped states for a long time even after the flux is turned\noff. Furthermore, we discover that the probability density within the GQD is\nalso clearly improved. We demonstrate that the trapping time of an electron\ninside a GQD can be successfully extended by adjusting the magnetic flux\nparameters.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:54:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Azar","Mohammed El",""],["Bouhlal","Ahmed",""],["Alhaidari","Abdulaziz D.",""],["Jellal","Ahmed",""]]}
{"id":"2308.12923","submitter":"Can Li","authors":"Hao Chen, Gonzalo E. Constante-Flores, Can Li","title":"Diagnosing Infeasible Optimization Problems Using Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CL cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Decision-making problems can be represented as mathematical optimization\nmodels, finding wide applications in fields such as economics, engineering and\nmanufacturing, transportation, and health care. Optimization models are\nmathematical abstractions of the problem of making the best decision while\nsatisfying a set of requirements or constraints. One of the primary barriers to\ndeploying these models in practice is the challenge of helping practitioners\nunderstand and interpret such models, particularly when they are infeasible,\nmeaning no decision satisfies all the constraints. Existing methods for\ndiagnosing infeasible optimization models often rely on expert systems,\nnecessitating significant background knowledge in optimization. In this paper,\nwe introduce OptiChat, a first-of-its-kind natural language-based system\nequipped with a chatbot GUI for engaging in interactive conversations about\ninfeasible optimization models. OptiChat can provide natural language\ndescriptions of the optimization model itself, identify potential sources of\ninfeasibility, and offer suggestions to make the model feasible. The\nimplementation of OptiChat is built on GPT-4, which interfaces with an\noptimization solver to identify the minimal subset of constraints that render\nthe entire optimization problem infeasible, also known as the Irreducible\nInfeasible Subset (IIS). We utilize few-shot learning, expert chain-of-thought,\nkey-retrieve, and sentiment prompts to enhance OptiChat's reliability. Our\nexperiments demonstrate that OptiChat assists both expert and non-expert users\nin improving their understanding of the optimization models, enabling them to\nquickly identify the sources of infeasibility.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 04:34:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Chen","Hao",""],["Constante-Flores","Gonzalo E.",""],["Li","Can",""]]}
{"id":"2308.12924","submitter":"Jinfei Wang","authors":"Jinfei Wang, Yi Ma, and Rahim Tafazolli","title":"On Chernoff Lower-Bound of Outage Threshold for Non-Central\n  $\\chi^2$-Distributed MIMO Beamforming Gain","comments":"6 pages, 4 figures, published on GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The cumulative distribution function (CDF) of a non-central\n$\\chi^2$-distributed random variable (RV) is often used when measuring the\noutage probability of communication systems. For adaptive transmitters, it is\nimportant but mathematically challenging to determine the outage threshold for\nan extreme target outage probability (e.g., $10^{-5}$ or less). This motivates\nus to investigate lower bounds of the outage threshold, and it is found that\nthe one derived from the Chernoff inequality (named Cher-LB) is the most\n{effective} lower bound. The Cher-LB is then employed to predict the\nmulti-antenna transmitter beamforming-gain in ultra-reliable and low-latency\ncommunication, concerning the first-order Markov time-varying channel. It is\nexhibited that, with the proposed Cher-LB, pessimistic prediction of the\nbeamforming gain is made sufficiently accurate for guaranteed reliability as\nwell as the transmit-energy efficiency.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:57:49 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Wang","Jinfei",""],["Ma","Yi",""],["Tafazolli","Rahim",""]]}
{"id":"2308.12925","submitter":"Hanting Xie","authors":"Philipp Renz, Kurt Cutajar, Niall Twomey, Gavin K. C. Cheung, Hanting\n  Xie","title":"Low-count Time Series Anomaly Detection","comments":"6 pages, 7 figures, to be published in IEEE 2023 Workshop on Machine\n  Learning for Signal Processing (MLSP)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Low-count time series describe sparse or intermittent events, which are\nprevalent in large-scale online platforms that capture and monitor diverse data\ntypes. Several distinct challenges surface when modelling low-count time\nseries, particularly low signal-to-noise ratios (when anomaly signatures are\nprovably undetectable), and non-uniform performance (when average metrics are\nnot representative of local behaviour). The time series anomaly detection\ncommunity currently lacks explicit tooling and processes to model and reliably\ndetect anomalies in these settings. We address this gap by introducing a novel\ngenerative procedure for creating benchmark datasets comprising of low-count\ntime series with anomalous segments. Via a mixture of theoretical and empirical\nanalysis, our work explains how widely-used algorithms struggle with the\ndistribution overlap between normal and anomalous segments. In order to\nmitigate this shortcoming, we then leverage our findings to demonstrate how\nanomaly score smoothing consistently improves performance. The practical\nutility of our analysis and recommendation is validated on a real-world dataset\ncontaining sales data for retail stores.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:58:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Renz","Philipp",""],["Cutajar","Kurt",""],["Twomey","Niall",""],["Cheung","Gavin K. C.",""],["Xie","Hanting",""]]}
{"id":"2308.12926","submitter":"Siddhant Agrawal","authors":"Siddhant Agrawal and Andrea R. Nahmod","title":"Uniqueness of the 2D Euler equation on rough domains","comments":"33 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the 2D incompressible Euler equation on a bounded simply\nconnected domain $\\Omega$. We give sufficient conditions on the domain $\\Omega$\nso that for all initial vorticity $\\omega_0 \\in L^{\\infty}(\\Omega)$ the weak\nsolutions are unique. Our sufficient condition is slightly more general than\nthe condition that $\\Omega$ is a $C^{1,\\alpha}$ domain for some $\\alpha>0$,\nwith its boundary belonging to $H^{3/2}(\\mathbb{S}^1)$. As a corollary we prove\nuniqueness for $C^{1,\\alpha}$ domains for $\\alpha >1/2$ and for convex domains\nwhich are also $C^{1,\\alpha}$ domains for some $\\alpha >0$. Previously\nuniqueness for general initial vorticity in $L^{\\infty}(\\Omega)$ was only known\nfor $C^{1,1}$ domains with possibly a finite number of acute angled corners.\nThe fundamental barrier to proving uniqueness below the $C^{1,1}$ regularity is\nthe fact that for less regular domains, the velocity near the boundary is no\nlonger log-Lipschitz. We overcome this barrier by defining a new change of\nvariable which we then use to define a novel energy functional.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:03:44 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Agrawal","Siddhant",""],["Nahmod","Andrea R.",""]]}
{"id":"2308.12927","submitter":"Saverio Spagnolie","authors":"Saverio E. Spagnolie, Samuel Christianson and Carsen Grote","title":"Dancing raisins: levitation and dynamics of bodies in supersaturated\n  fluids","comments":"29 pages, 9 figures. Movies are posted here:\n  https://people.math.wisc.edu/~spagnolie/publications.html","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.pop-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A body immersed in a supersaturated fluid like carbonated water can\naccumulate a dynamic field of bubbles upon its surface. The bubbles grow and\ncoalesce as gas is continually pulled from the environment. If the body is\nmobile, the attached bubbles can lift it upward against gravity, but arrival at\na free surface can clean the body of these lifting agents and the body may\nplummet. The process then begins anew, and continues for as long as the\nconcentration of gas in the fluid supports it. In this work, experiments using\nfixed and free immersed bodies reveal fundamental features of force\ndevelopment. A continuum model which incorporates the dynamics of a surface\nbuoyancy field is used to predict the ranges of body mass and size, and fluid\nproperties, for which the system is most dynamic, and those for which body\nexcursions are suppressed. Simulations are used to probe systems which are\ndominated by a small number of large bubbles. Body rotations at the surface are\nfound to be critical for driving periodic vertical motions of large bodies,\nwhich in turn can produce body wobbling, rolling, and damped surface 'bouncing'\ndynamics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:05:20 GMT"},{"version":"v2","created":"Sat, 26 Aug 2023 04:59:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Spagnolie","Saverio E.",""],["Christianson","Samuel",""],["Grote","Carsen",""]]}
{"id":"2308.12928","submitter":"Angelo Pasquale","authors":"Sebastian Rodriguez, Angelo Pasquale, Khanh Nguyen, Amine Ammar,\n  Francisco Chinesta","title":"A time multiscale based data-driven approach in cyclic elasto-plasticity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Within the framework of computational plasticity, recent advances show that\nthe quasi-static response of an elasto-plastic structure under cyclic loadings\nmay exhibit a time multiscale behaviour. In particular, the system response can\nbe computed in terms of time microscale and macroscale modes using a weakly\nintrusive multi-time Proper Generalized Decomposition (MT-PGD). In this work,\nsuch micro-macro characterization of the time response is exploited to build a\ndata-driven model of the elasto-plastic constitutive relation. This can be\nviewed as a predictor-corrector scheme where the prediction is driven by the\nmacrotime evolution and the correction is performed via a sparse sampling in\nspace. Once the nonlinear term is forecasted, the multi-time PGD algorithm\nallows the fast computation of the total strain. The algorithm shows\nconsiderable gains in terms of computational time, opening new perspectives in\nthe numerical simulation of history-dependent problems defined in very large\ntime intervals.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:05:47 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Rodriguez","Sebastian",""],["Pasquale","Angelo",""],["Nguyen","Khanh",""],["Ammar","Amine",""],["Chinesta","Francisco",""]]}
{"id":"2308.12929","submitter":"Josephine C. Meyer","authors":"Josephine C. Meyer, Gina Passante, Steven J. Pollock, Bethany R.\n  Wilcox","title":"Introductory quantum information science coursework at US institutions:\n  Content coverage","comments":"Submitted to EPJ Quantum Technology, special section on quantum\n  education","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite rapid growth of quantum information science and engineering\n(QIS/QISE) workforce development initiatives, perceived lack of agreement among\nfaculty on core content has made prior research-based curriculum and assessment\ndevelopment initiatives difficult to scale. To identify areas if consensus on\ncontent coverage, we report findings from a survey of N=63 instructors teaching\nintroductory QISE courses at US institutions of higher learning. We identify a\nsubset of content items common across a large fraction (>=80%) of introductory\nQISE courses that are potentially amenable to research-based curriculum\ndevelopment, with an emphasis on foundational skills in mathematics, physics,\nand engineering. As a further guide for curriculum development, we also examine\ndifferences in content coverage by level (undergraduate/graduate) and\ndiscipline. Finally, we briefly discuss the implications of our findings for\nthe development of a research-based QISE assessment at the postsecondary level.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:06:48 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Meyer","Josephine C.",""],["Passante","Gina",""],["Pollock","Steven J.",""],["Wilcox","Bethany R.",""]]}
{"id":"2308.12930","submitter":"Wajid Mannan Dr","authors":"Wajid Mannan","title":"Explicit generators for the relation module in the example of\n  Gruenberg-Linnell","comments":"Paper published in peer reviewed journal in 2016","journal-ref":"Mathematical Proceedings of the Cambridge Philosophical Society\n  Vol. 161 (2016), Issue 02, pp. 199-202","doi":"10.1017/S0305004116000189","report-no":null,"categories":"math.GR math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gruenberg and Linnell showed that the standard relation module of a free\nproduct of $n$ groups of the form $C_r \\times \\mathbb{Z}$ could be generated by\njust $n+1$ generators, raising the possibility of a relation gap. We explicitly\ngive such a set of generators.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:07:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Mannan","Wajid",""]]}
{"id":"2308.12931","submitter":"Luka Trifunovic","authors":"Alexander Altland, Piet W. Brouwer, Johannes Dieplinger, Matthew S.\n  Foster, Mateo Moreno-Gonzalez, Luka Trifunovic","title":"Fragility of spectral flow for topological phases in non-Wigner-Dyson\n  classes","comments":"16 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological insulators and superconductors support extended surface states\nprotected against the otherwise localizing effects of static disorder.\nSpecifically, in the Wigner-Dyson insulators belonging to the symmetry classes\nA, AI, and AII, a band of extended surface states is continuously connected to\na likewise extended set of bulk states forming a ``bridge'' between different\nsurfaces via the mechanism of spectral flow. In this work we show that this\nprinciple becomes \\emph{fragile} in the majority of non-Wigner-Dyson\ntopological superconductors and chiral topological insulators. In these\nsystems, there is precisely one point with granted extended states, the center\nof the band, $E=0$. Away from it, states are spatially localized, or can be\nmade so by the addition of spatially local potentials. Considering the\nthree-dimensional insulator in class AIII and winding number $\\nu=1$ as a\nparadigmatic case study, we discuss the physical principles behind this\nphenomenon, and its methodological and applied consequences. In particular, we\nshow that low-energy Dirac approximations in the description of surface states\ncan be treacherous in that they tend to conceal the localizability phenomenon.\nWe also identify markers defined in terms of Berry curvature as measures for\nthe degree of state localization in lattice models, and back our analytical\npredictions by extensive numerical simulations. A main conclusion of this work\nis that the surface phenomenology of non-Wigner-Dyson topological insulators is\na lot richer than that of their Wigner-Dyson siblings, extreme limits being\nspectrum wide quantum critical delocalization of all states vs. full\nlocalization except at the $E=0$ critical point. As part of our study we\nidentify possible experimental signatures distinguishing between these\ndifferent alternatives in transport or tunnel spectroscopy.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:07:18 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Altland","Alexander",""],["Brouwer","Piet W.",""],["Dieplinger","Johannes",""],["Foster","Matthew S.",""],["Moreno-Gonzalez","Mateo",""],["Trifunovic","Luka",""]]}
{"id":"2308.12932","submitter":"Vijayakumar Sasidevan","authors":"Jasna C. K. and V. Sasidevan","title":"Effect of shape asymmetry on percolation of aligned and overlapping\n  objects on lattices","comments":"12 pages, 10 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the percolation transition of aligned, overlapping,\nnon-symmetrical shapes on lattices. Using the recently proposed lattice version\nof excluded volume theory, we show that shape-asymmetry leads to some\nintriguing consequences regarding the percolation behavior of asymmetric\nshapes. We consider a prototypical asymmetric shape - rectangle - on a square\nlattice and show that for rectangles of width unity (sticks), the percolation\nthreshold is a monotonically decreasing function of the stick length, whereas,\nfor rectangles of width greater than two, it is a monotonically increasing\nfunction. Interestingly, for rectangles of width two, the percolation threshold\nis independent of its length. The limiting case of the length of the rectangles\ngoing to infinity shows that the limiting threshold value is finite and depends\nupon the width of the rectangle. Unlike the case of symmetrical shapes like\nsquares, there seems to be no continuum percolation problem that corresponds to\nthis limit. We show that similar results hold for other asymmetric shapes and\nlattices. The critical properties of the aligned and overlapping rectangles are\nevaluated using Monte Carlo simulations. We find that the threshold values\ngiven by the lattice-excluded volume theory are in good agreement with the\nsimulation results, especially for larger rectangles. We verify the isotropy of\nthe percolation threshold and also compare our results with models where\nrectangles of mixed orientation are allowed. Our simulation results show that\nalignment increases the percolation threshold. The calculation of critical\nexponents places the model in the standard percolation universality class. Our\nresults show that shape-anisotropy of the aligned, overlapping percolating\nunits has a marked influence on the percolation properties, especially when a\nsubset of the dimensions of the percolation units are made to diverge.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:10:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["K.","Jasna C.",""],["Sasidevan","V.",""]]}
{"id":"2308.12933","submitter":"Morgan Mitchell","authors":"Charikleia Troullinou and Vito Giovanni Lucivero and Morgan W.\n  Mitchell","title":"Quantum-enhanced magnetometry at optimal number density","comments":"5 pages + 3 supplementary, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the use of squeezed probe light and evasion of measurement\nback-action to enhance the sensitivity and measurement bandwidth of an\noptically-pumped magnetometer (OPM) at sensitivity-optimal atom number density.\nBy experimental observation, and in agreement with quantum noise modeling, a\nspin-exchange-limited OPM probed with off-resonance laser light is shown to\nhave an optimal sensitivity determined by density-dependent quantum noise\ncontributions. Application of squeezed probe light boosts the OPM sensitivity\nbeyond this laser-light optimum, allowing the OPM to achieve sensitivities that\nit cannot reach with coherent-state probing at any density. The observed\nquantum sensitivity enhancement at optimal number density is enabled by\nmeasurement back-action evasion.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:14:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Troullinou","Charikleia",""],["Lucivero","Vito Giovanni",""],["Mitchell","Morgan W.",""]]}
{"id":"2308.12934","submitter":"Alexander Igl","authors":"Alexander B. Igl (Louisiana State University), Robert I. Hynes\n  (Louisiana State University), Christopher T. Britt (Space Telescope Science\n  Institute), Kieren S. O'Brien (Durham University), Valerie J. Mikles (NASA\n  Goddard Space Flight Center)","title":"Links Between Optical and X-ray Light in Scorpius X-1","comments":"Accepted for publication in the Monthly Notices of the Royal\n  Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We observed the low-mass X-ray binary Sco X-1 for 12 nights simultaneously\nusing the Rossi X-Ray Timing Explorer and the Otto Struve Telescope at McDonald\nObservatory at 1 second time resolution. This is among the most comprehensive\nsimultaneous X-Ray/optical data sets of Sco X-1. Evidence of reprocessing was\nobserved in the form of nine positive, near-zero lag peaks in the cross\ncorrelation function, eight of which were relatively small and took the shape\nof piecewise exponential functions. These peaks were initially identified by\neye, after which a computational identification scheme was developed to confirm\ntheir significance. Based on their short lags (less than 4 seconds), as well as\ntheir occurrence on the flaring branch and soft apex, the small cross\ncorrelation features are likely to be caused by reprocessing off the outer\ndisc, although the companion could still make a contribution to their tails.\nThe Z track was parameterized using a rank number scheme so that the system's\nlocation on the track could be numerically defined. Plotting the results\nagainst the optical reveals an increasing step function when moving from the\nhorizontal to the normal to the flaring branch, with differential optical\nlevels at ~0.47, ~0.57, and ~1.1 respectively. An additional correlation\nbetween Z track location and the optical was found on the upper flaring branch.\nAn optical intensity histogram reveals a transition region between the normal\nand flaring branches with only intermediate fluxes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:18:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Igl","Alexander B.","","Louisiana State University"],["Hynes","Robert I.","","Louisiana State University"],["Britt","Christopher T.","","Space Telescope Science\n  Institute"],["O'Brien","Kieren S.","","Durham University"],["Mikles","Valerie J.","","NASA\n  Goddard Space Flight Center"]]}
{"id":"2308.12935","submitter":"Mikhail Gorsky","authors":"Mikhail Gorsky, Jos\\'e Simental","title":"Cluster algebras in Lie and Knot theory","comments":"This is a version with expanded references of an expository article\n  prepared for Notices of the AMS","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.AG math.CO math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a survey article on some connections between cluster algebras and\nlink invariants, written for the Notices of the AMS.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:24:40 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Gorsky","Mikhail",""],["Simental","Jos\u00e9",""]]}
{"id":"2308.12936","submitter":"Martin Dindo\\v{s}","authors":"Martin Dindo\\v{s}","title":"On the regularity problem for parabolic operators and the role of\n  half-time derivative","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we present the following result on regularity of solutions of\nthe second order parabolic equation $\\partial_t u - \\mbox{div} (A \\nabla\nu)+B\\cdot \\nabla u=0$ on cylindrical domains of the form $\\Omega=\\mathcal\nO\\times\\mathbb R$ where $\\mathcal O\\subset\\mathbb R^n$ is a uniform domain (it\nsatisfies both corkscrew and Harnack chain conditions) and has uniformly $n-1$\nrectifiable boundary. Let $u$ be a solution of such PDE in $\\Omega$ and the\nnon-tangential maximal function of its gradient in spatial directions\n$\\tilde{N}(\\nabla u)$ belongs to $L^p(\\partial\\Omega)$ for some $p>1$.\nFurthermore, assume that for $u|_{\\partial\\Omega}=f$ we have that\n$D^{1/2}_tf\\in L^p(\\partial\\Omega)$. Then both $\\tilde{N}(D^{1/2}_t u)$ and\n$\\tilde{N}(D^{1/2}_tH_t u)$ also belong to $L^p(\\partial\\Omega)$, where\n$D^{1/2}_t$ and $H_t$ are the half-derivative and the Hilbert transform in the\ntime variable, respectively. We expect this result will spur new developments\nin the study of solvability of the $L^p$ parabolic Regularity problem as thanks\nto it it is now possible to formulate the parabolic Regularity problem on a\nlarge class of time-varying domains.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:25:08 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dindo\u0161","Martin",""]]}
{"id":"2308.12937","submitter":"Jia-Quan Yu","authors":"Jia-Quan Yu, Soo-Chang Pei","title":"Panoptic-Depth Color Map for Combination of Depth and Image Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Image segmentation and depth estimation are crucial tasks in computer vision,\nespecially in autonomous driving scenarios. Although these tasks are typically\naddressed separately, we propose an innovative approach to combine them in our\nnovel deep learning network, Panoptic-DepthLab. By incorporating an additional\ndepth estimation branch into the segmentation network, it can predict the depth\nof each instance segment. Evaluating on Cityscape dataset, we demonstrate the\neffectiveness of our method in achieving high-quality segmentation results with\ndepth and visualize it with a color map. Our proposed method demonstrates a new\npossibility of combining different tasks and networks to generate a more\ncomprehensive image recognition result to facilitate the safety of autonomous\ndriving vehicles.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:25:09 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yu","Jia-Quan",""],["Pei","Soo-Chang",""]]}
{"id":"2308.12938","submitter":"Jia-Quan Yu","authors":"Jia-Quan Yu, Soo-Chang Pei","title":"Perspective-aware Convolution for Monocular 3D Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Monocular 3D object detection is a crucial and challenging task for\nautonomous driving vehicle, while it uses only a single camera image to infer\n3D objects in the scene. To address the difficulty of predicting depth using\nonly pictorial clue, we propose a novel perspective-aware convolutional layer\nthat captures long-range dependencies in images. By enforcing convolutional\nkernels to extract features along the depth axis of every image pixel, we\nincorporates perspective information into network architecture. We integrate\nour perspective-aware convolutional layer into a 3D object detector and\ndemonstrate improved performance on the KITTI3D dataset, achieving a 23.9\\%\naverage precision in the easy benchmark. These results underscore the\nimportance of modeling scene clues for accurate depth inference and highlight\nthe benefits of incorporating scene structure in network design. Our\nperspective-aware convolutional layer has the potential to enhance object\ndetection accuracy by providing more precise and context-aware feature\nextraction.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:25:36 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Yu","Jia-Quan",""],["Pei","Soo-Chang",""]]}
{"id":"2308.12939","submitter":"Zhiwei Fang","authors":"Zhiwei Fang, Sifan Wang, and Paris Perdikaris","title":"Learning Only On Boundaries: a Physics-Informed Neural operator for\n  Solving Parametric Partial Differential Equations in Complex Geometries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.NA physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently deep learning surrogates and neural operators have shown promise in\nsolving partial differential equations (PDEs). However, they often require a\nlarge amount of training data and are limited to bounded domains. In this work,\nwe present a novel physics-informed neural operator method to solve\nparametrized boundary value problems without labeled data. By reformulating the\nPDEs into boundary integral equations (BIEs), we can train the operator network\nsolely on the boundary of the domain. This approach reduces the number of\nrequired sample points from $O(N^d)$ to $O(N^{d-1})$, where $d$ is the domain's\ndimension, leading to a significant acceleration of the training process.\nAdditionally, our method can handle unbounded problems, which are unattainable\nfor existing physics-informed neural networks (PINNs) and neural operators. Our\nnumerical experiments show the effectiveness of parametrized complex geometries\nand unbounded problems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:29:57 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fang","Zhiwei",""],["Wang","Sifan",""],["Perdikaris","Paris",""]]}
{"id":"2308.12940","submitter":"Yuhao Wang","authors":"LHCb collaboration: R. Aaij, A.S.W. Abdelmotteleb, C. Abellan Beteta,\n  F. Abudin\\'en, T. Ackernley, B. Adeva, M. Adinolfi, P. Adlarson, H.\n  Afsharnia, C. Agapopoulou, C.A. Aidala, Z. Ajaltouni, S. Akar, K. Akiba, P.\n  Albicocco, J. Albrecht, F. Alessio, M. Alexander, A. Alfonso Albero, Z.\n  Aliouche, P. Alvarez Cartelle, R. Amalric, S. Amato, J.L. Amey, Y. Amhis, L.\n  An, L. Anderlini, M. Andersson, A. Andreianov, P. Andreola, M. Andreotti, D.\n  Andreou, D. Ao, F. Archilli, A. Artamonov, M. Artuso, E. Aslanides, M.\n  Atzeni, B. Audurier, I. Bachiller Perea, S. Bachmann, M. Bachmayer, J.J.\n  Back, A. Bailly-reyre, P. Baladron Rodriguez, V. Balagura, W. Baldini, J.\n  Baptista de Souza Leite, M. Barbetti, I. R. Barbosa, R.J. Barlow, S. Barsuk,\n  W. Barter, M. Bartolini, F. Baryshnikov, J.M. Basels, G. Bassi, B. Batsukh,\n  A. Battig, A. Bay, A. Beck, M. Becker, F. Bedeschi, I.B. Bediaga, A. Beiter,\n  S. Belin, V. Bellee, K. Belous, I. Belov, I. Belyaev, G. Benane, G.\n  Bencivenni, E. Ben-Haim, A. Berezhnoy, R. Bernet, S. Bernet Andres, D.\n  Berninghoff, H.C. Bernstein, C. Bertella, A. Bertolin, C. Betancourt, F.\n  Betti, J. Bex, Ia. Bezshyiko, J. Bhom, L. Bian, M.S. Bieker, N.V. Biesuz, P.\n  Billoir, A. Biolchini, M. Birch, F.C.R. Bishop, A. Bitadze, A. Bizzeti, M.P.\n  Blago, T. Blake, F. Blanc, J.E. Blank, S. Blusk, D. Bobulska, V. Bocharnikov,\n  J.A. Boelhauve, O. Boente Garcia, T. Boettcher, A. Bohare, A. Boldyrev, C.S.\n  Bolognani, R. Bolzonella, N. Bondar, F. Borgato, S. Borghi, M. Borsato, J.T.\n  Borsuk, S.A. Bouchiba, T.J.V. Bowcock, A. Boyer, C. Bozzi, M.J. Bradley, S.\n  Braun, A. Brea Rodriguez, N. Breer, J. Brodzicka, A. Brossa Gonzalo, J.\n  Brown, D. Brundu, A. Buonaura, L. Buonincontri, A.T. Burke, C. Burr, A.\n  Bursche, A. Butkevich, J.S. Butter, J. Buytaert, W. Byczynski, S. Cadeddu, H.\n  Cai, R. Calabrese, L. Calefice, S. Cali, M. Calvi, M. Calvo Gomez, J. Cambon\n  Bouzas, P. Campana, D.H. Campora Perez, A.F. Campoverde Quezada, S. Capelli,\n  L. Capriotti, A. Carbone, L. Carcedo Salgado, R. Cardinale, A. Cardini, P.\n  Carniti, L. Carus, A. Casais Vidal, R. Caspary, G. Casse, M. Cattaneo, G.\n  Cavallero, V. Cavallini, S. Celani, J. Cerasoli, D. Cervenkov, A.J. Chadwick,\n  I. Chahrour, M.G. Chapman, M. Charles, Ph. Charpentier, C.A. Chavez Barajas,\n  M. Chefdeville, C. Chen, S. Chen, A. Chernov, S. Chernyshenko, V. Chobanova,\n  S. Cholak, M. Chrzaszcz, A. Chubykin, V. Chulikov, P. Ciambrone, M.F. Cicala,\n  X. Cid Vidal, G. Ciezarek, P. Cifra, P.E.L. Clarke, M. Clemencic, H.V. Cliff,\n  J. Closier, J.L. Cobbledick, C. Cocha Toapaxi, V. Coco, J. Cogan, E.\n  Cogneras, L. Cojocariu, P. Collins, T. Colombo, A. Comerma-Montells, L.\n  Congedo, A. Contu, N. Cooke, I. Corredoira, A. Correia, G. Corti, J.J. Cottee\n  Meldrum, B. Couturier, D.C. Craik, M. Cruz Torres, R. Currie, C.L. Da Silva,\n  S. Dadabaev, L. Dai, X. Dai, E. Dall'Occo, J. Dalseno, C. D'Ambrosio, J.\n  Daniel, A. Danilina, P. d'Argent, A. Davidson, J.E. Davies, A. Davis, O. De\n  Aguiar Francisco, J. de Boer, K. De Bruyn, S. De Capua, M. De Cian, U. De\n  Freitas Carneiro Da Graca, E. De Lucia, J.M. De Miranda, L. De Paula, M. De\n  Serio, D. De Simone, P. De Simone, F. De Vellis, J.A. de Vries, C.T. Dean, F.\n  Debernardis, D. Decamp, V. Dedu, L. Del Buono, B. Delaney, H.-P. Dembinski,\n  V. Denysenko, O. Deschamps, F. Dettori, B. Dey, P. Di Nezza, I. Diachkov, S.\n  Didenko, S. Ding, V. Dobishuk, A. D. Docheva, A. Dolmatov, C. Dong, A.M.\n  Donohoe, F. Dordei, A.C. dos Reis, L. Douglas, A.G. Downes, W. Duan, P. Duda,\n  M.W. Dudek, L. Dufour, V. Duk, P. Durante, M. M. Duras, J.M. Durham, D.\n  Dutta, A. Dziurda, A. Dzyuba, S. Easo, E. Eckstein, U. Egede, A. Egorychev,\n  V. Egorychev, C. Eirea Orro, S. Eisenhardt, E. Ejopu, S. Ek-In, L. Eklund, M.\n  Elashri, J. Ellbracht, S. Ely, A. Ene, E. Epple, S. Escher, J. Eschle, S.\n  Esen, T. Evans, F. Fabiano, L.N. Falcao, Y. Fan, B. Fang, L. Fantini, M.\n  Faria, K. Farmer, S. Farry, D. Fazzini, L. Felkowski, M. Feng, M. Feo, M.\n  Fernandez Gomez, A.D. Fernez, F. Ferrari, L. Ferreira Lopes, F. Ferreira\n  Rodrigues, S. Ferreres Sole, M. Ferrillo, M. Ferro-Luzzi, S. Filippov, R.A.\n  Fini, M. Fiorini, M. Firlej, K.M. Fischer, D.S. Fitzgerald, C. Fitzpatrick,\n  T. Fiutowski, F. Fleuret, M. Fontana, F. Fontanelli, L. F. Foreman, R. Forty,\n  D. Foulds-Holt, M. Franco Sevilla, M. Frank, E. Franzoso, G. Frau, C. Frei,\n  D.A. Friday, L. Frontini, J. Fu, Q. Fuehring, Y. Fujii, T. Fulghesu, E.\n  Gabriel, G. Galati, M.D. Galati, A. Gallas Torreira, D. Galli, S. Gambetta,\n  M. Gandelman, P. Gandini, H. Gao, R. Gao, Y. Gao, Y. Gao, M. Garau, L.M.\n  Garcia Martin, P. Garcia Moreno, J. Garc\\'ia Pardi\\~nas, B. Garcia Plana,\n  F.A. Garcia Rosales, L. Garrido, C. Gaspar, R.E. Geertsema, L.L. Gerken, E.\n  Gersabeck, M. Gersabeck, T. Gershon, L. Giambastiani, F. I. Giasemis, V.\n  Gibson, H.K. Giemza, A.L. Gilman, M. Giovannetti, A. Giovent\\`u, P. Gironella\n  Gironell, C. Giugliano, M.A. Giza, K. Gizdov, E.L. Gkougkousis, F.C. Glaser,\n  V.V. Gligorov, C. G\\\"obel, E. Golobardes, D. Golubkov, A. Golutvin, A. Gomes,\n  S. Gomez Fernandez, F. Goncalves Abrantes, M. Goncerz, G. Gong, J. A.\n  Gooding, I.V. Gorelov, C. Gotti, J.P. Grabowski, L.A. Granado Cardoso, E.\n  Graug\\'es, E. Graverini, G. Graziani, A. T. Grecu, L.M. Greeven, N.A.\n  Grieser, L. Grillo, S. Gromov, C. Gu, M. Guarise, M. Guittiere, V. Guliaeva,\n  P. A. G\\\"unther, A.-K. Guseinov, E. Gushchin, Y. Guz, T. Gys, T. Hadavizadeh,\n  C. Hadjivasiliou, G. Haefeli, C. Haen, J. Haimberger, S.C. Haines, M.\n  Hajheidari, T. Halewood-leagas, M.M. Halvorsen, P.M. Hamilton, J. Hammerich,\n  Q. Han, X. Han, S. Hansmann-Menzemer, L. Hao, N. Harnew, T. Harrison, M.\n  Hartmann, C. Hasse, M. Hatch, J. He, K. Heijhoff, F. Hemmer, C. Henderson,\n  R.D.L. Henderson, A.M. Hennequin, K. Hennessy, L. Henry, J. Herd, J. Heuel,\n  A. Hicheur, D. Hill, M. Hilton, S.E. Hollitt, J. Horswill, R. Hou, Y. Hou, N.\n  Howarth, J. Hu, J. Hu, W. Hu, X. Hu, W. Huang, X. Huang, W. Hulsbergen, R.J.\n  Hunter, M. Hushchyn, D. Hutchcroft, P. Ibis, M. Idzik, D. Ilin, P. Ilten, A.\n  Inglessi, A. Iniukhin, A. Ishteev, K. Ivshin, R. Jacobsson, H. Jage, S.J.\n  Jaimes Elles, S. Jakobsen, E. Jans, B.K. Jashal, A. Jawahery, V. Jevtic, E.\n  Jiang, X. Jiang, Y. Jiang, Y. J. Jiang, M. John, D. Johnson, C.R. Jones, T.P.\n  Jones, S. Joshi, B. Jost, N. Jurik, I. Juszczak, D. Kaminaris, S. Kandybei,\n  Y. Kang, M. Karacson, D. Karpenkov, M. Karpov, A. M. Kauniskangas, J.W.\n  Kautz, F. Keizer, D.M. Keller, M. Kenzie, T. Ketel, B. Khanji, A. Kharisova,\n  S. Kholodenko, G. Khreich, T. Kirn, V.S. Kirsebom, O. Kitouni, S. Klaver, N.\n  Kleijne, K. Klimaszewski, M.R. Kmiec, S. Koliiev, L. Kolk, A. Kondybayeva, A.\n  Konoplyannikov, P. Kopciewicz, R. Kopecna, P. Koppenburg, M. Korolev, I.\n  Kostiuk, O. Kot, S. Kotriakhova, A. Kozachuk, P. Kravchenko, L. Kravchuk, M.\n  Kreps, S. Kretzschmar, P. Krokovny, W. Krupa, W. Krzemien, J. Kubat, S.\n  Kubis, W. Kucewicz, M. Kucharczyk, V. Kudryavtsev, E. Kulikova, A. Kupsc, B.\n  K. Kutsenko, D. Lacarrere, G. Lafferty, A. Lai, A. Lampis, D. Lancierini, C.\n  Landesa Gomez, J.J. Lane, R. Lane, C. Langenbruch, J. Langer, O. Lantwin, T.\n  Latham, F. Lazzari, C. Lazzeroni, R. Le Gac, S.H. Lee, R. Lef\\`evre, A.\n  Leflat, S. Legotin, O. Leroy, T. Lesiak, B. Leverington, A. Li, H. Li, K. Li,\n  L. Li, P. Li, P.-R. Li, S. Li, T. Li, T. Li, Y. Li, Z. Li, Z. Lian, X. Liang,\n  C. Lin, T. Lin, R. Lindner, V. Lisovskyi, R. Litvinov, G. Liu, H. Liu, K.\n  Liu, Q. Liu, S. Liu, Y. Liu, A. Lobo Salvia, A. Loi, J. Lomba Castro, T.\n  Long, I. Longstaff, J.H. Lopes, A. Lopez Huertas, S. L\\'opez Soli\\~no, G.H.\n  Lovell, Y. Lu, C. Lucarelli, D. Lucchesi, S. Luchuk, M. Lucio Martinez, V.\n  Lukashenko, Y. Luo, A. Lupato, E. Luppi, K. Lynch, X.-R. Lyu, R. Ma, S.\n  Maccolini, F. Machefert, F. Maciuc, I. Mackay, V. Macko, L.R. Madhan Mohan,\n  M. M. Madurai, A. Maevskiy, D. Maisuzenko, M.W. Majewski, J.J. Malczewski, S.\n  Malde, B. Malecki, A. Malinin, T. Maltsev, G. Manca, G. Mancinelli, C.\n  Mancuso, R. Manera Escalero, D. Manuzzi, C.A. Manzari, D. Marangotto, J.F.\n  Marchand, U. Marconi, S. Mariani, C. Marin Benito, J. Marks, A.M. Marshall,\n  P.J. Marshall, G. Martelli, G. Martellotti, L. Martinazzoli, M. Martinelli,\n  D. Martinez Santos, F. Martinez Vidal, A. Massafferri, M. Materok, R. Matev,\n  A. Mathad, V. Matiunin, C. Matteuzzi, K.R. Mattioli, A. Mauri, E. Maurice, J.\n  Mauricio, M. Mazurek, M. McCann, L. Mcconnell, T.H. McGrath, N.T. McHugh, A.\n  McNab, R. McNulty, B. Meadows, G. Meier, D. Melnychuk, M. Merk, A. Merli, L.\n  Meyer Garcia, D. Miao, H. Miao, M. Mikhasenko, D.A. Milanes, M. Milovanovic,\n  M.-N. Minard, A. Minotti, E. Minucci, T. Miralles, S.E. Mitchell, B.\n  Mitreska, D.S. Mitzel, A. Modak, A. M\\\"odden, R.A. Mohammed, R.D. Moise, S.\n  Mokhnenko, T. Momb\\\"acher, M. Monk, I.A. Monroy, S. Monteil, G. Morello, M.J.\n  Morello, M.P. Morgenthaler, J. Moron, A.B. Morris, A.G. Morris, R. Mountain,\n  H. Mu, Z. M. Mu, E. Muhammad, F. Muheim, M. Mulder, K. M\\\"uller, D. Murray,\n  R. Murta, P. Naik, T. Nakada, R. Nandakumar, T. Nanut, I. Nasteva, M.\n  Needham, N. Neri, S. Neubert, N. Neufeld, P. Neustroev, R. Newcombe, J.\n  Nicolini, D. Nicotra, E.M. Niel, S. Nieswand, N. Nikitin, P. Nogga, N.S.\n  Nolte, C. Normand, J. Novoa Fernandez, G. Nowak, C. Nunez, H. N. Nur, A.\n  Oblakowska-Mucha, V. Obraztsov, T. Oeser, S. Okamura, R. Oldeman, F. Oliva,\n  M. Olocco, C.J.G. Onderwater, R.H. O'Neil, J.M. Otalora Goicochea, T.\n  Ovsiannikova, P. Owen, A. Oyanguren, O. Ozcelik, K.O. Padeken, B. Pagare,\n  P.R. Pais, T. Pajero, A. Palano, M. Palutan, G. Panshin, L. Paolucci, A.\n  Papanestis, M. Pappagallo, L.L. Pappalardo, C. Pappenheimer, C. Parkes, B.\n  Passalacqua, G. Passaleva, A. Pastore, M. Patel, J. Patoc, C. Patrignani,\n  C.J. Pawley, A. Pellegrino, M. Pepe Altarelli, S. Perazzini, D. Pereima, A.\n  Pereiro Castro, P. Perret, A. Perro, K. Petridis, A. Petrolini, S. Petrucci,\n  H. Pham, A. Philippov, L. Pica, M. Piccini, B. Pietrzyk, G. Pietrzyk, D.\n  Pinci, F. Pisani, M. Pizzichemi, V. Placinta, M. Plo Casasus, F. Polci, M.\n  Poli Lener, A. Poluektov, N. Polukhina, I. Polyakov, E. Polycarpo, S. Ponce,\n  D. Popov, S. Poslavskii, K. Prasanth, L. Promberger, C. Prouve, V. Pugatch,\n  V. Puill, G. Punzi, H.R. Qi, W. Qian, N. Qin, S. Qu, R. Quagliani, B.\n  Rachwal, J.H. Rademacker, R. Rajagopalan, M. Rama, M. Ram\\'irez Garc\\'ia, M.\n  Ramos Pernas, M.S. Rangel, F. Ratnikov, G. Raven, M. Rebollo De Miguel, F.\n  Redi, J. Reich, F. Reiss, Z. Ren, P.K. Resmi, R. Ribatti, G. R. Ricart, S.\n  Ricciardi, K. Richardson, M. Richardson-Slipper, K. Rinnert, P. Robbe, G.\n  Robertson, E. Rodrigues, E. Rodriguez Fernandez, J.A. Rodriguez Lopez, E.\n  Rodriguez Rodriguez, D.L. Rolf, A. Rollings, P. Roloff, V. Romanovskiy, M.\n  Romero Lamas, A. Romero Vidal, F. Ronchetti, M. Rotondo, M.S. Rudolph, T.\n  Ruf, R.A. Ruiz Fernandez, J. Ruiz Vidal, A. Ryzhikov, J. Ryzka, J.J. Saborido\n  Silva, N. Sagidova, N. Sahoo, B. Saitta, M. Salomoni, C. Sanchez Gras, I.\n  Sanderswood, R. Santacesaria, C. Santamarina Rios, M. Santimaria, L. Santoro,\n  E. Santovetti, D. Saranin, G. Sarpis, M. Sarpis, A. Sarti, C. Satriano, A.\n  Satta, M. Saur, D. Savrina, H. Sazak, L.G. Scantlebury Smead, A. Scarabotto,\n  S. Schael, S. Scherl, A. M. Schertz, M. Schiller, H. Schindler, M.\n  Schmelling, B. Schmidt, S. Schmitt, O. Schneider, A. Schopper, M. Schubiger,\n  N. Schulte, S. Schulte, M.H. Schune, R. Schwemmer, G. Schwering, B. Sciascia,\n  A. Sciuccati, S. Sellam, A. Semennikov, M. Senghi Soares, A. Sergi, N. Serra,\n  L. Sestini, A. Seuthe, Y. Shang, D.M. Shangase, M. Shapkin, I. Shchemerov, L.\n  Shchutska, T. Shears, L. Shekhtman, Z. Shen, S. Sheng, V. Shevchenko, B. Shi,\n  E.B. Shields, Y. Shimizu, E. Shmanin, R. Shorkin, J.D. Shupperd, B.G. Siddi,\n  R. Silva Coutinho, G. Simi, S. Simone, M. Singla, N. Skidmore, R. Skuza, T.\n  Skwarnicki, M.W. Slater, J.C. Smallwood, J.G. Smeaton, E. Smith, K. Smith, M.\n  Smith, A. Snoch, L. Soares Lavra, M.D. Sokoloff, F.J.P. Soler, A. Solomin, A.\n  Solovev, I. Solovyev, R. Song, Y. Song, Y. Song, Y. S. Song, F.L. Souza De\n  Almeida, B. Souza De Paula, E. Spadaro Norella, E. Spedicato, J.G. Speer, E.\n  Spiridenkov, P. Spradlin, V. Sriskaran, F. Stagni, M. Stahl, S. Stahl, S.\n  Stanislaus, E.N. Stein, O. Steinkamp, O. Stenyakin, H. Stevens, D.\n  Strekalina, Y. Su, F. Suljik, J. Sun, L. Sun, Y. Sun, P.N. Swallow, K.\n  Swientek, F. Swystun, A. Szabelski, T. Szumlak, M. Szymanski, Y. Tan, S.\n  Taneja, M.D. Tat, A. Terentev, F. Teubert, E. Thomas, D.J.D. Thompson, H.\n  Tilquin, V. Tisserand, S. T'Jampens, M. Tobin, L. Tomassetti, G. Tonani, X.\n  Tong, D. Torres Machado, L. Toscano, D.Y. Tou, C. Trippl, G. Tuci, N. Tuning,\n  A. Ukleja, D.J. Unverzagt, E. Ursov, A. Usachov, A. Ustyuzhanin, U. Uwer, V.\n  Vagnoni, A. Valassi, G. Valenti, N. Valls Canudas, M. Van Dijk, H. Van Hecke,\n  E. van Herwijnen, C.B. Van Hulse, R. Van Laak, M. van Veghel, R. Vazquez\n  Gomez, P. Vazquez Regueiro, C. V\\'azquez Sierra, S. Vecchi, J.J. Velthuis, M.\n  Veltri, A. Venkateswaran, M. Vesterinen, D. Vieira, M. Vieites Diaz, X.\n  Vilasis-Cardona, E. Vilella Figueras, A. Villa, P. Vincent, F.C. Volle, D.\n  vom Bruch, V. Vorobyev, N. Voropaev, K. Vos, C. Vrahas, J. Walsh, E.J.\n  Walton, G. Wan, C. Wang, G. Wang, J. Wang, J. Wang, J. Wang, J. Wang, M.\n  Wang, N. W. Wang, R. Wang, X. Wang, Y. Wang, Y. Wang, Z. Wang, Z. Wang, Z.\n  Wang, J.A. Ward, N.K. Watson, D. Websdale, Y. Wei, B.D.C. Westhenry, D.J.\n  White, M. Whitehead, A.R. Wiederhold, D. Wiedner, G. Wilkinson, M.K.\n  Wilkinson, I. Williams, M. Williams, M.R.J. Williams, R. Williams, F.F.\n  Wilson, W. Wislicki, M. Witek, L. Witola, C.P. Wong, G. Wormser, S.A. Wotton,\n  H. Wu, J. Wu, Y. Wu, K. Wyllie, S. Xian, Z. Xiang, Y. Xie, A. Xu, J. Xu, L.\n  Xu, L. Xu, M. Xu, Z. Xu, Z. Xu, Z. Xu, D. Yang, S. Yang, X. Yang, Y. Yang, Z.\n  Yang, Z. Yang, V. Yeroshenko, H. Yeung, H. Yin, C. Y. Yu, J. Yu, X. Yuan, E.\n  Zaffaroni, M. Zavertyaev, M. Zdybal, M. Zeng, C. Zhang, D. Zhang, J. Zhang,\n  L. Zhang, S. Zhang, S. Zhang, Y. Zhang, Y. Zhang, Y. Zhao, A. Zharkova, A.\n  Zhelezov, Y. Zheng, T. Zhou, X. Zhou, Y. Zhou, V. Zhovkovska, L. Z. Zhu, X.\n  Zhu, X. Zhu, Z. Zhu, V. Zhukov, J. Zhuo, Q. Zou, S. Zucchelli, D. Zuliani, G.\n  Zunica","title":"Measurement of $Z$ boson production cross-section in $pp$ collisions at\n  $\\sqrt{s} = 5.02$ TeV","comments":"All figures and tables, along with any supplementary material and\n  additional information, are available at\n  https://cern.ch/lhcbproject/Publications/p/LHCb-PAPER-2023-010.html (LHCb\n  public pages)","journal-ref":null,"doi":null,"report-no":"LHCb-PAPER-2023-010, CERN-EP-2023-141","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The first measurement of the $Z$ boson production cross-section at\ncentre-of-mass energy $\\sqrt{s} = 5.02\\,$TeV in the forward region is reported,\nusing $pp$ collision data collected by the LHCb experiment in year 2017,\ncorresponding to an integrated luminosity of $100 \\pm 2\\,\\rm{pb^{-1}}$. The\nproduction cross-section is measured for final-state muons in the\npseudorapidity range $2.0<\\eta<4.5$ with transverse momentum $p_{\\rm{T}}>\n20\\,\\rm{GeV/}\\it{c}$. The integrated cross-section is determined to be \\[\n  \\sigma_{Z \\rightarrow \\mu^{+}\\mu^{-}} = 39.6 \\pm 0.7\\,(\\rm{stat}) \\pm\n0.6\\,(\\rm{syst}) \\pm 0.8\\,(\\rm{lumi}) \\ \\rm{pb} \\] for the di-muon invariant\nmass in the range $60<M_{\\mu\\mu}<120\\,\\rm{GeV/}\\it{c^{2}}$. This result and the\ndifferential cross-section results are in good agreement with theoretical\npredictions at next-to-next-to-leading order in the strong coupling.\n  Based on a previous LHCb measurement of the $Z$ boson production\ncross-section in $p$Pb collisions at $\\sqrt{s_{NN}}=5.02$ TeV, the nuclear\nmodification factor $R_{p\\rm{Pb}}$ is measured for the first time at this\nenergy. The measured values are $1.2^{+0.5}_{-0.3}\\,(\\rm{stat}) \\pm\n0.1\\,(\\rm{syst})$ in the forward region ($1.53<y^*_{\\mu}<4.03$) and\n$3.6^{+1.6}_{-0.9}\\,(\\rm{stat}) \\pm 0.2\\,(\\rm{syst})$ in the backward region\n($-4.97<y^*_{\\mu}<-2.47$), where $y^*_{\\mu}$ represents the muon rapidity in\nthe centre-of-mass frame.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:30:07 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 14:01:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["LHCb collaboration","",""],["Aaij","R.",""],["Abdelmotteleb","A. S. W.",""],["Beteta","C. Abellan",""],["Abudin\u00e9n","F.",""],["Ackernley","T.",""],["Adeva","B.",""],["Adinolfi","M.",""],["Adlarson","P.",""],["Afsharnia","H.",""],["Agapopoulou","C.",""],["Aidala","C. A.",""],["Ajaltouni","Z.",""],["Akar","S.",""],["Akiba","K.",""],["Albicocco","P.",""],["Albrecht","J.",""],["Alessio","F.",""],["Alexander","M.",""],["Albero","A. Alfonso",""],["Aliouche","Z.",""],["Cartelle","P. Alvarez",""],["Amalric","R.",""],["Amato","S.",""],["Amey","J. L.",""],["Amhis","Y.",""],["An","L.",""],["Anderlini","L.",""],["Andersson","M.",""],["Andreianov","A.",""],["Andreola","P.",""],["Andreotti","M.",""],["Andreou","D.",""],["Ao","D.",""],["Archilli","F.",""],["Artamonov","A.",""],["Artuso","M.",""],["Aslanides","E.",""],["Atzeni","M.",""],["Audurier","B.",""],["Perea","I. Bachiller",""],["Bachmann","S.",""],["Bachmayer","M.",""],["Back","J. J.",""],["Bailly-reyre","A.",""],["Rodriguez","P. Baladron",""],["Balagura","V.",""],["Baldini","W.",""],["Leite","J. Baptista de Souza",""],["Barbetti","M.",""],["Barbosa","I. R.",""],["Barlow","R. J.",""],["Barsuk","S.",""],["Barter","W.",""],["Bartolini","M.",""],["Baryshnikov","F.",""],["Basels","J. M.",""],["Bassi","G.",""],["Batsukh","B.",""],["Battig","A.",""],["Bay","A.",""],["Beck","A.",""],["Becker","M.",""],["Bedeschi","F.",""],["Bediaga","I. B.",""],["Beiter","A.",""],["Belin","S.",""],["Bellee","V.",""],["Belous","K.",""],["Belov","I.",""],["Belyaev","I.",""],["Benane","G.",""],["Bencivenni","G.",""],["Ben-Haim","E.",""],["Berezhnoy","A.",""],["Bernet","R.",""],["Andres","S. Bernet",""],["Berninghoff","D.",""],["Bernstein","H. C.",""],["Bertella","C.",""],["Bertolin","A.",""],["Betancourt","C.",""],["Betti","F.",""],["Bex","J.",""],["Bezshyiko","Ia.",""],["Bhom","J.",""],["Bian","L.",""],["Bieker","M. S.",""],["Biesuz","N. V.",""],["Billoir","P.",""],["Biolchini","A.",""],["Birch","M.",""],["Bishop","F. C. R.",""],["Bitadze","A.",""],["Bizzeti","A.",""],["Blago","M. P.",""],["Blake","T.",""],["Blanc","F.",""],["Blank","J. E.",""],["Blusk","S.",""],["Bobulska","D.",""],["Bocharnikov","V.",""],["Boelhauve","J. A.",""],["Garcia","O. Boente",""],["Boettcher","T.",""],["Bohare","A.",""],["Boldyrev","A.",""],["Bolognani","C. S.",""],["Bolzonella","R.",""],["Bondar","N.",""],["Borgato","F.",""],["Borghi","S.",""],["Borsato","M.",""],["Borsuk","J. T.",""],["Bouchiba","S. A.",""],["Bowcock","T. J. V.",""],["Boyer","A.",""],["Bozzi","C.",""],["Bradley","M. J.",""],["Braun","S.",""],["Rodriguez","A. Brea",""],["Breer","N.",""],["Brodzicka","J.",""],["Gonzalo","A. Brossa",""],["Brown","J.",""],["Brundu","D.",""],["Buonaura","A.",""],["Buonincontri","L.",""],["Burke","A. T.",""],["Burr","C.",""],["Bursche","A.",""],["Butkevich","A.",""],["Butter","J. S.",""],["Buytaert","J.",""],["Byczynski","W.",""],["Cadeddu","S.",""],["Cai","H.",""],["Calabrese","R.",""],["Calefice","L.",""],["Cali","S.",""],["Calvi","M.",""],["Gomez","M. Calvo",""],["Bouzas","J. Cambon",""],["Campana","P.",""],["Perez","D. H. Campora",""],["Quezada","A. F. Campoverde",""],["Capelli","S.",""],["Capriotti","L.",""],["Carbone","A.",""],["Salgado","L. Carcedo",""],["Cardinale","R.",""],["Cardini","A.",""],["Carniti","P.",""],["Carus","L.",""],["Vidal","A. Casais",""],["Caspary","R.",""],["Casse","G.",""],["Cattaneo","M.",""],["Cavallero","G.",""],["Cavallini","V.",""],["Celani","S.",""],["Cerasoli","J.",""],["Cervenkov","D.",""],["Chadwick","A. J.",""],["Chahrour","I.",""],["Chapman","M. G.",""],["Charles","M.",""],["Charpentier","Ph.",""],["Barajas","C. A. Chavez",""],["Chefdeville","M.",""],["Chen","C.",""],["Chen","S.",""],["Chernov","A.",""],["Chernyshenko","S.",""],["Chobanova","V.",""],["Cholak","S.",""],["Chrzaszcz","M.",""],["Chubykin","A.",""],["Chulikov","V.",""],["Ciambrone","P.",""],["Cicala","M. F.",""],["Vidal","X. Cid",""],["Ciezarek","G.",""],["Cifra","P.",""],["Clarke","P. E. L.",""],["Clemencic","M.",""],["Cliff","H. V.",""],["Closier","J.",""],["Cobbledick","J. L.",""],["Toapaxi","C. Cocha",""],["Coco","V.",""],["Cogan","J.",""],["Cogneras","E.",""],["Cojocariu","L.",""],["Collins","P.",""],["Colombo","T.",""],["Comerma-Montells","A.",""],["Congedo","L.",""],["Contu","A.",""],["Cooke","N.",""],["Corredoira","I.",""],["Correia","A.",""],["Corti","G.",""],["Meldrum","J. J. Cottee",""],["Couturier","B.",""],["Craik","D. C.",""],["Torres","M. Cruz",""],["Currie","R.",""],["Da Silva","C. L.",""],["Dadabaev","S.",""],["Dai","L.",""],["Dai","X.",""],["Dall'Occo","E.",""],["Dalseno","J.",""],["D'Ambrosio","C.",""],["Daniel","J.",""],["Danilina","A.",""],["d'Argent","P.",""],["Davidson","A.",""],["Davies","J. E.",""],["Davis","A.",""],["Francisco","O. De Aguiar",""],["de Boer","J.",""],["De Bruyn","K.",""],["De Capua","S.",""],["De Cian","M.",""],["Da Graca","U. De Freitas Carneiro",""],["De Lucia","E.",""],["De Miranda","J. M.",""],["De Paula","L.",""],["De Serio","M.",""],["De Simone","D.",""],["De Simone","P.",""],["De Vellis","F.",""],["de Vries","J. A.",""],["Dean","C. T.",""],["Debernardis","F.",""],["Decamp","D.",""],["Dedu","V.",""],["Del Buono","L.",""],["Delaney","B.",""],["Dembinski","H. -P.",""],["Denysenko","V.",""],["Deschamps","O.",""],["Dettori","F.",""],["Dey","B.",""],["Di Nezza","P.",""],["Diachkov","I.",""],["Didenko","S.",""],["Ding","S.",""],["Dobishuk","V.",""],["Docheva","A. D.",""],["Dolmatov","A.",""],["Dong","C.",""],["Donohoe","A. M.",""],["Dordei","F.",""],["Reis","A. C. dos",""],["Douglas","L.",""],["Downes","A. G.",""],["Duan","W.",""],["Duda","P.",""],["Dudek","M. W.",""],["Dufour","L.",""],["Duk","V.",""],["Durante","P.",""],["Duras","M. M.",""],["Durham","J. M.",""],["Dutta","D.",""],["Dziurda","A.",""],["Dzyuba","A.",""],["Easo","S.",""],["Eckstein","E.",""],["Egede","U.",""],["Egorychev","A.",""],["Egorychev","V.",""],["Orro","C. Eirea",""],["Eisenhardt","S.",""],["Ejopu","E.",""],["Ek-In","S.",""],["Eklund","L.",""],["Elashri","M.",""],["Ellbracht","J.",""],["Ely","S.",""],["Ene","A.",""],["Epple","E.",""],["Escher","S.",""],["Eschle","J.",""],["Esen","S.",""],["Evans","T.",""],["Fabiano","F.",""],["Falcao","L. N.",""],["Fan","Y.",""],["Fang","B.",""],["Fantini","L.",""],["Faria","M.",""],["Farmer","K.",""],["Farry","S.",""],["Fazzini","D.",""],["Felkowski","L.",""],["Feng","M.",""],["Feo","M.",""],["Gomez","M. Fernandez",""],["Fernez","A. D.",""],["Ferrari","F.",""],["Lopes","L. Ferreira",""],["Rodrigues","F. Ferreira",""],["Sole","S. Ferreres",""],["Ferrillo","M.",""],["Ferro-Luzzi","M.",""],["Filippov","S.",""],["Fini","R. A.",""],["Fiorini","M.",""],["Firlej","M.",""],["Fischer","K. M.",""],["Fitzgerald","D. S.",""],["Fitzpatrick","C.",""],["Fiutowski","T.",""],["Fleuret","F.",""],["Fontana","M.",""],["Fontanelli","F.",""],["Foreman","L. F.",""],["Forty","R.",""],["Foulds-Holt","D.",""],["Sevilla","M. Franco",""],["Frank","M.",""],["Franzoso","E.",""],["Frau","G.",""],["Frei","C.",""],["Friday","D. A.",""],["Frontini","L.",""],["Fu","J.",""],["Fuehring","Q.",""],["Fujii","Y.",""],["Fulghesu","T.",""],["Gabriel","E.",""],["Galati","G.",""],["Galati","M. D.",""],["Torreira","A. Gallas",""],["Galli","D.",""],["Gambetta","S.",""],["Gandelman","M.",""],["Gandini","P.",""],["Gao","H.",""],["Gao","R.",""],["Gao","Y.",""],["Gao","Y.",""],["Garau","M.",""],["Martin","L. M. Garcia",""],["Moreno","P. Garcia",""],["Pardi\u00f1as","J. Garc\u00eda",""],["Plana","B. Garcia",""],["Rosales","F. A. Garcia",""],["Garrido","L.",""],["Gaspar","C.",""],["Geertsema","R. E.",""],["Gerken","L. L.",""],["Gersabeck","E.",""],["Gersabeck","M.",""],["Gershon","T.",""],["Giambastiani","L.",""],["Giasemis","F. I.",""],["Gibson","V.",""],["Giemza","H. K.",""],["Gilman","A. L.",""],["Giovannetti","M.",""],["Giovent\u00f9","A.",""],["Gironell","P. Gironella",""],["Giugliano","C.",""],["Giza","M. A.",""],["Gizdov","K.",""],["Gkougkousis","E. L.",""],["Glaser","F. C.",""],["Gligorov","V. V.",""],["G\u00f6bel","C.",""],["Golobardes","E.",""],["Golubkov","D.",""],["Golutvin","A.",""],["Gomes","A.",""],["Fernandez","S. Gomez",""],["Abrantes","F. Goncalves",""],["Goncerz","M.",""],["Gong","G.",""],["Gooding","J. A.",""],["Gorelov","I. V.",""],["Gotti","C.",""],["Grabowski","J. P.",""],["Cardoso","L. A. Granado",""],["Graug\u00e9s","E.",""],["Graverini","E.",""],["Graziani","G.",""],["Grecu","A. T.",""],["Greeven","L. M.",""],["Grieser","N. A.",""],["Grillo","L.",""],["Gromov","S.",""],["Gu","C.",""],["Guarise","M.",""],["Guittiere","M.",""],["Guliaeva","V.",""],["G\u00fcnther","P. A.",""],["Guseinov","A. -K.",""],["Gushchin","E.",""],["Guz","Y.",""],["Gys","T.",""],["Hadavizadeh","T.",""],["Hadjivasiliou","C.",""],["Haefeli","G.",""],["Haen","C.",""],["Haimberger","J.",""],["Haines","S. C.",""],["Hajheidari","M.",""],["Halewood-leagas","T.",""],["Halvorsen","M. M.",""],["Hamilton","P. M.",""],["Hammerich","J.",""],["Han","Q.",""],["Han","X.",""],["Hansmann-Menzemer","S.",""],["Hao","L.",""],["Harnew","N.",""],["Harrison","T.",""],["Hartmann","M.",""],["Hasse","C.",""],["Hatch","M.",""],["He","J.",""],["Heijhoff","K.",""],["Hemmer","F.",""],["Henderson","C.",""],["Henderson","R. D. L.",""],["Hennequin","A. M.",""],["Hennessy","K.",""],["Henry","L.",""],["Herd","J.",""],["Heuel","J.",""],["Hicheur","A.",""],["Hill","D.",""],["Hilton","M.",""],["Hollitt","S. E.",""],["Horswill","J.",""],["Hou","R.",""],["Hou","Y.",""],["Howarth","N.",""],["Hu","J.",""],["Hu","J.",""],["Hu","W.",""],["Hu","X.",""],["Huang","W.",""],["Huang","X.",""],["Hulsbergen","W.",""],["Hunter","R. J.",""],["Hushchyn","M.",""],["Hutchcroft","D.",""],["Ibis","P.",""],["Idzik","M.",""],["Ilin","D.",""],["Ilten","P.",""],["Inglessi","A.",""],["Iniukhin","A.",""],["Ishteev","A.",""],["Ivshin","K.",""],["Jacobsson","R.",""],["Jage","H.",""],["Elles","S. J. Jaimes",""],["Jakobsen","S.",""],["Jans","E.",""],["Jashal","B. K.",""],["Jawahery","A.",""],["Jevtic","V.",""],["Jiang","E.",""],["Jiang","X.",""],["Jiang","Y.",""],["Jiang","Y. J.",""],["John","M.",""],["Johnson","D.",""],["Jones","C. R.",""],["Jones","T. P.",""],["Joshi","S.",""],["Jost","B.",""],["Jurik","N.",""],["Juszczak","I.",""],["Kaminaris","D.",""],["Kandybei","S.",""],["Kang","Y.",""],["Karacson","M.",""],["Karpenkov","D.",""],["Karpov","M.",""],["Kauniskangas","A. M.",""],["Kautz","J. W.",""],["Keizer","F.",""],["Keller","D. M.",""],["Kenzie","M.",""],["Ketel","T.",""],["Khanji","B.",""],["Kharisova","A.",""],["Kholodenko","S.",""],["Khreich","G.",""],["Kirn","T.",""],["Kirsebom","V. S.",""],["Kitouni","O.",""],["Klaver","S.",""],["Kleijne","N.",""],["Klimaszewski","K.",""],["Kmiec","M. R.",""],["Koliiev","S.",""],["Kolk","L.",""],["Kondybayeva","A.",""],["Konoplyannikov","A.",""],["Kopciewicz","P.",""],["Kopecna","R.",""],["Koppenburg","P.",""],["Korolev","M.",""],["Kostiuk","I.",""],["Kot","O.",""],["Kotriakhova","S.",""],["Kozachuk","A.",""],["Kravchenko","P.",""],["Kravchuk","L.",""],["Kreps","M.",""],["Kretzschmar","S.",""],["Krokovny","P.",""],["Krupa","W.",""],["Krzemien","W.",""],["Kubat","J.",""],["Kubis","S.",""],["Kucewicz","W.",""],["Kucharczyk","M.",""],["Kudryavtsev","V.",""],["Kulikova","E.",""],["Kupsc","A.",""],["Kutsenko","B. K.",""],["Lacarrere","D.",""],["Lafferty","G.",""],["Lai","A.",""],["Lampis","A.",""],["Lancierini","D.",""],["Gomez","C. Landesa",""],["Lane","J. J.",""],["Lane","R.",""],["Langenbruch","C.",""],["Langer","J.",""],["Lantwin","O.",""],["Latham","T.",""],["Lazzari","F.",""],["Lazzeroni","C.",""],["Gac","R. Le",""],["Lee","S. H.",""],["Lef\u00e8vre","R.",""],["Leflat","A.",""],["Legotin","S.",""],["Leroy","O.",""],["Lesiak","T.",""],["Leverington","B.",""],["Li","A.",""],["Li","H.",""],["Li","K.",""],["Li","L.",""],["Li","P.",""],["Li","P. -R.",""],["Li","S.",""],["Li","T.",""],["Li","T.",""],["Li","Y.",""],["Li","Z.",""],["Lian","Z.",""],["Liang","X.",""],["Lin","C.",""],["Lin","T.",""],["Lindner","R.",""],["Lisovskyi","V.",""],["Litvinov","R.",""],["Liu","G.",""],["Liu","H.",""],["Liu","K.",""],["Liu","Q.",""],["Liu","S.",""],["Liu","Y.",""],["Salvia","A. Lobo",""],["Loi","A.",""],["Castro","J. Lomba",""],["Long","T.",""],["Longstaff","I.",""],["Lopes","J. H.",""],["Huertas","A. Lopez",""],["Soli\u00f1o","S. L\u00f3pez",""],["Lovell","G. H.",""],["Lu","Y.",""],["Lucarelli","C.",""],["Lucchesi","D.",""],["Luchuk","S.",""],["Martinez","M. Lucio",""],["Lukashenko","V.",""],["Luo","Y.",""],["Lupato","A.",""],["Luppi","E.",""],["Lynch","K.",""],["Lyu","X. -R.",""],["Ma","R.",""],["Maccolini","S.",""],["Machefert","F.",""],["Maciuc","F.",""],["Mackay","I.",""],["Macko","V.",""],["Mohan","L. R. Madhan",""],["Madurai","M. M.",""],["Maevskiy","A.",""],["Maisuzenko","D.",""],["Majewski","M. W.",""],["Malczewski","J. J.",""],["Malde","S.",""],["Malecki","B.",""],["Malinin","A.",""],["Maltsev","T.",""],["Manca","G.",""],["Mancinelli","G.",""],["Mancuso","C.",""],["Escalero","R. Manera",""],["Manuzzi","D.",""],["Manzari","C. A.",""],["Marangotto","D.",""],["Marchand","J. F.",""],["Marconi","U.",""],["Mariani","S.",""],["Benito","C. Marin",""],["Marks","J.",""],["Marshall","A. M.",""],["Marshall","P. J.",""],["Martelli","G.",""],["Martellotti","G.",""],["Martinazzoli","L.",""],["Martinelli","M.",""],["Santos","D. Martinez",""],["Vidal","F. Martinez",""],["Massafferri","A.",""],["Materok","M.",""],["Matev","R.",""],["Mathad","A.",""],["Matiunin","V.",""],["Matteuzzi","C.",""],["Mattioli","K. R.",""],["Mauri","A.",""],["Maurice","E.",""],["Mauricio","J.",""],["Mazurek","M.",""],["McCann","M.",""],["Mcconnell","L.",""],["McGrath","T. H.",""],["McHugh","N. T.",""],["McNab","A.",""],["McNulty","R.",""],["Meadows","B.",""],["Meier","G.",""],["Melnychuk","D.",""],["Merk","M.",""],["Merli","A.",""],["Garcia","L. Meyer",""],["Miao","D.",""],["Miao","H.",""],["Mikhasenko","M.",""],["Milanes","D. A.",""],["Milovanovic","M.",""],["Minard","M. -N.",""],["Minotti","A.",""],["Minucci","E.",""],["Miralles","T.",""],["Mitchell","S. E.",""],["Mitreska","B.",""],["Mitzel","D. S.",""],["Modak","A.",""],["M\u00f6dden","A.",""],["Mohammed","R. A.",""],["Moise","R. D.",""],["Mokhnenko","S.",""],["Momb\u00e4cher","T.",""],["Monk","M.",""],["Monroy","I. A.",""],["Monteil","S.",""],["Morello","G.",""],["Morello","M. J.",""],["Morgenthaler","M. P.",""],["Moron","J.",""],["Morris","A. B.",""],["Morris","A. G.",""],["Mountain","R.",""],["Mu","H.",""],["Mu","Z. M.",""],["Muhammad","E.",""],["Muheim","F.",""],["Mulder","M.",""],["M\u00fcller","K.",""],["Murray","D.",""],["Murta","R.",""],["Naik","P.",""],["Nakada","T.",""],["Nandakumar","R.",""],["Nanut","T.",""],["Nasteva","I.",""],["Needham","M.",""],["Neri","N.",""],["Neubert","S.",""],["Neufeld","N.",""],["Neustroev","P.",""],["Newcombe","R.",""],["Nicolini","J.",""],["Nicotra","D.",""],["Niel","E. M.",""],["Nieswand","S.",""],["Nikitin","N.",""],["Nogga","P.",""],["Nolte","N. S.",""],["Normand","C.",""],["Fernandez","J. Novoa",""],["Nowak","G.",""],["Nunez","C.",""],["Nur","H. N.",""],["Oblakowska-Mucha","A.",""],["Obraztsov","V.",""],["Oeser","T.",""],["Okamura","S.",""],["Oldeman","R.",""],["Oliva","F.",""],["Olocco","M.",""],["Onderwater","C. J. G.",""],["O'Neil","R. H.",""],["Goicochea","J. M. Otalora",""],["Ovsiannikova","T.",""],["Owen","P.",""],["Oyanguren","A.",""],["Ozcelik","O.",""],["Padeken","K. O.",""],["Pagare","B.",""],["Pais","P. R.",""],["Pajero","T.",""],["Palano","A.",""],["Palutan","M.",""],["Panshin","G.",""],["Paolucci","L.",""],["Papanestis","A.",""],["Pappagallo","M.",""],["Pappalardo","L. L.",""],["Pappenheimer","C.",""],["Parkes","C.",""],["Passalacqua","B.",""],["Passaleva","G.",""],["Pastore","A.",""],["Patel","M.",""],["Patoc","J.",""],["Patrignani","C.",""],["Pawley","C. J.",""],["Pellegrino","A.",""],["Altarelli","M. Pepe",""],["Perazzini","S.",""],["Pereima","D.",""],["Castro","A. Pereiro",""],["Perret","P.",""],["Perro","A.",""],["Petridis","K.",""],["Petrolini","A.",""],["Petrucci","S.",""],["Pham","H.",""],["Philippov","A.",""],["Pica","L.",""],["Piccini","M.",""],["Pietrzyk","B.",""],["Pietrzyk","G.",""],["Pinci","D.",""],["Pisani","F.",""],["Pizzichemi","M.",""],["Placinta","V.",""],["Casasus","M. Plo",""],["Polci","F.",""],["Lener","M. Poli",""],["Poluektov","A.",""],["Polukhina","N.",""],["Polyakov","I.",""],["Polycarpo","E.",""],["Ponce","S.",""],["Popov","D.",""],["Poslavskii","S.",""],["Prasanth","K.",""],["Promberger","L.",""],["Prouve","C.",""],["Pugatch","V.",""],["Puill","V.",""],["Punzi","G.",""],["Qi","H. R.",""],["Qian","W.",""],["Qin","N.",""],["Qu","S.",""],["Quagliani","R.",""],["Rachwal","B.",""],["Rademacker","J. H.",""],["Rajagopalan","R.",""],["Rama","M.",""],["Garc\u00eda","M. Ram\u00edrez",""],["Pernas","M. Ramos",""],["Rangel","M. S.",""],["Ratnikov","F.",""],["Raven","G.",""],["De Miguel","M. Rebollo",""],["Redi","F.",""],["Reich","J.",""],["Reiss","F.",""],["Ren","Z.",""],["Resmi","P. K.",""],["Ribatti","R.",""],["Ricart","G. R.",""],["Ricciardi","S.",""],["Richardson","K.",""],["Richardson-Slipper","M.",""],["Rinnert","K.",""],["Robbe","P.",""],["Robertson","G.",""],["Rodrigues","E.",""],["Fernandez","E. Rodriguez",""],["Lopez","J. A. Rodriguez",""],["Rodriguez","E. Rodriguez",""],["Rolf","D. L.",""],["Rollings","A.",""],["Roloff","P.",""],["Romanovskiy","V.",""],["Lamas","M. Romero",""],["Vidal","A. Romero",""],["Ronchetti","F.",""],["Rotondo","M.",""],["Rudolph","M. S.",""],["Ruf","T.",""],["Fernandez","R. A. Ruiz",""],["Vidal","J. Ruiz",""],["Ryzhikov","A.",""],["Ryzka","J.",""],["Silva","J. J. Saborido",""],["Sagidova","N.",""],["Sahoo","N.",""],["Saitta","B.",""],["Salomoni","M.",""],["Gras","C. Sanchez",""],["Sanderswood","I.",""],["Santacesaria","R.",""],["Rios","C. Santamarina",""],["Santimaria","M.",""],["Santoro","L.",""],["Santovetti","E.",""],["Saranin","D.",""],["Sarpis","G.",""],["Sarpis","M.",""],["Sarti","A.",""],["Satriano","C.",""],["Satta","A.",""],["Saur","M.",""],["Savrina","D.",""],["Sazak","H.",""],["Smead","L. G. Scantlebury",""],["Scarabotto","A.",""],["Schael","S.",""],["Scherl","S.",""],["Schertz","A. M.",""],["Schiller","M.",""],["Schindler","H.",""],["Schmelling","M.",""],["Schmidt","B.",""],["Schmitt","S.",""],["Schneider","O.",""],["Schopper","A.",""],["Schubiger","M.",""],["Schulte","N.",""],["Schulte","S.",""],["Schune","M. H.",""],["Schwemmer","R.",""],["Schwering","G.",""],["Sciascia","B.",""],["Sciuccati","A.",""],["Sellam","S.",""],["Semennikov","A.",""],["Soares","M. Senghi",""],["Sergi","A.",""],["Serra","N.",""],["Sestini","L.",""],["Seuthe","A.",""],["Shang","Y.",""],["Shangase","D. M.",""],["Shapkin","M.",""],["Shchemerov","I.",""],["Shchutska","L.",""],["Shears","T.",""],["Shekhtman","L.",""],["Shen","Z.",""],["Sheng","S.",""],["Shevchenko","V.",""],["Shi","B.",""],["Shields","E. B.",""],["Shimizu","Y.",""],["Shmanin","E.",""],["Shorkin","R.",""],["Shupperd","J. D.",""],["Siddi","B. G.",""],["Coutinho","R. Silva",""],["Simi","G.",""],["Simone","S.",""],["Singla","M.",""],["Skidmore","N.",""],["Skuza","R.",""],["Skwarnicki","T.",""],["Slater","M. W.",""],["Smallwood","J. C.",""],["Smeaton","J. G.",""],["Smith","E.",""],["Smith","K.",""],["Smith","M.",""],["Snoch","A.",""],["Lavra","L. Soares",""],["Sokoloff","M. D.",""],["Soler","F. J. P.",""],["Solomin","A.",""],["Solovev","A.",""],["Solovyev","I.",""],["Song","R.",""],["Song","Y.",""],["Song","Y.",""],["Song","Y. S.",""],["De Almeida","F. L. Souza",""],["De Paula","B. Souza",""],["Norella","E. Spadaro",""],["Spedicato","E.",""],["Speer","J. G.",""],["Spiridenkov","E.",""],["Spradlin","P.",""],["Sriskaran","V.",""],["Stagni","F.",""],["Stahl","M.",""],["Stahl","S.",""],["Stanislaus","S.",""],["Stein","E. N.",""],["Steinkamp","O.",""],["Stenyakin","O.",""],["Stevens","H.",""],["Strekalina","D.",""],["Su","Y.",""],["Suljik","F.",""],["Sun","J.",""],["Sun","L.",""],["Sun","Y.",""],["Swallow","P. N.",""],["Swientek","K.",""],["Swystun","F.",""],["Szabelski","A.",""],["Szumlak","T.",""],["Szymanski","M.",""],["Tan","Y.",""],["Taneja","S.",""],["Tat","M. D.",""],["Terentev","A.",""],["Teubert","F.",""],["Thomas","E.",""],["Thompson","D. J. D.",""],["Tilquin","H.",""],["Tisserand","V.",""],["T'Jampens","S.",""],["Tobin","M.",""],["Tomassetti","L.",""],["Tonani","G.",""],["Tong","X.",""],["Machado","D. Torres",""],["Toscano","L.",""],["Tou","D. Y.",""],["Trippl","C.",""],["Tuci","G.",""],["Tuning","N.",""],["Ukleja","A.",""],["Unverzagt","D. J.",""],["Ursov","E.",""],["Usachov","A.",""],["Ustyuzhanin","A.",""],["Uwer","U.",""],["Vagnoni","V.",""],["Valassi","A.",""],["Valenti","G.",""],["Canudas","N. Valls",""],["Van Dijk","M.",""],["Van Hecke","H.",""],["van Herwijnen","E.",""],["Van Hulse","C. B.",""],["Van Laak","R.",""],["van Veghel","M.",""],["Gomez","R. Vazquez",""],["Regueiro","P. Vazquez",""],["Sierra","C. V\u00e1zquez",""],["Vecchi","S.",""],["Velthuis","J. J.",""],["Veltri","M.",""],["Venkateswaran","A.",""],["Vesterinen","M.",""],["Vieira","D.",""],["Diaz","M. Vieites",""],["Vilasis-Cardona","X.",""],["Figueras","E. Vilella",""],["Villa","A.",""],["Vincent","P.",""],["Volle","F. C.",""],["Bruch","D. vom",""],["Vorobyev","V.",""],["Voropaev","N.",""],["Vos","K.",""],["Vrahas","C.",""],["Walsh","J.",""],["Walton","E. J.",""],["Wan","G.",""],["Wang","C.",""],["Wang","G.",""],["Wang","J.",""],["Wang","J.",""],["Wang","J.",""],["Wang","J.",""],["Wang","M.",""],["Wang","N. W.",""],["Wang","R.",""],["Wang","X.",""],["Wang","Y.",""],["Wang","Y.",""],["Wang","Z.",""],["Wang","Z.",""],["Wang","Z.",""],["Ward","J. A.",""],["Watson","N. K.",""],["Websdale","D.",""],["Wei","Y.",""],["Westhenry","B. D. C.",""],["White","D. J.",""],["Whitehead","M.",""],["Wiederhold","A. R.",""],["Wiedner","D.",""],["Wilkinson","G.",""],["Wilkinson","M. K.",""],["Williams","I.",""],["Williams","M.",""],["Williams","M. R. J.",""],["Williams","R.",""],["Wilson","F. F.",""],["Wislicki","W.",""],["Witek","M.",""],["Witola","L.",""],["Wong","C. P.",""],["Wormser","G.",""],["Wotton","S. A.",""],["Wu","H.",""],["Wu","J.",""],["Wu","Y.",""],["Wyllie","K.",""],["Xian","S.",""],["Xiang","Z.",""],["Xie","Y.",""],["Xu","A.",""],["Xu","J.",""],["Xu","L.",""],["Xu","L.",""],["Xu","M.",""],["Xu","Z.",""],["Xu","Z.",""],["Xu","Z.",""],["Yang","D.",""],["Yang","S.",""],["Yang","X.",""],["Yang","Y.",""],["Yang","Z.",""],["Yang","Z.",""],["Yeroshenko","V.",""],["Yeung","H.",""],["Yin","H.",""],["Yu","C. Y.",""],["Yu","J.",""],["Yuan","X.",""],["Zaffaroni","E.",""],["Zavertyaev","M.",""],["Zdybal","M.",""],["Zeng","M.",""],["Zhang","C.",""],["Zhang","D.",""],["Zhang","J.",""],["Zhang","L.",""],["Zhang","S.",""],["Zhang","S.",""],["Zhang","Y.",""],["Zhang","Y.",""],["Zhao","Y.",""],["Zharkova","A.",""],["Zhelezov","A.",""],["Zheng","Y.",""],["Zhou","T.",""],["Zhou","X.",""],["Zhou","Y.",""],["Zhovkovska","V.",""],["Zhu","L. Z.",""],["Zhu","X.",""],["Zhu","X.",""],["Zhu","Z.",""],["Zhukov","V.",""],["Zhuo","J.",""],["Zou","Q.",""],["Zucchelli","S.",""],["Zuliani","D.",""],["Zunica","G.",""]]}
{"id":"2308.12941","submitter":"Andrei Smilga","authors":"A.V. Smilga","title":"Witten index in 4d supersymmetric gauge theories","comments":"87 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a review of Witten index calculations in different supersymmetric\ngauge theories in four dimensions: supersymmetric electrodynamics, pure N=1\nsupersymmetric Yang-Mills theories and also SYM theories including matter\nmultiplets -- both with chirally symmetric and asymmetric content.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:30:35 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Smilga","A. V.",""]]}
{"id":"2308.12942","submitter":"Pedro Roman-Taboada","authors":"Pedro Roman-Taboada, Estefania Obregon-Castillo, Andr\\'es R.\n  Botello-Mendez, Cecilia Noguez","title":"Excitons in twisted AA' hexagonal boron nitride bilayers","comments":"32 pages, 16 figures","journal-ref":"Phys. Rev. B 108, 075109 (2023)","doi":"10.1103/PhysRevB.108.075109","report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The twisted hexagonal boron nitride (hBN) bilayer has demonstrated\nexceptional properties, particularly the existence of electronic flat bands\nwithout needing a magic angle, suggesting strong excitonic effects. Therefore,\na systematic approach is presented to study the excitonic properties of twisted\nAA' hBN using the Bethe-Salpeter equation based on single-particle\ntight-binding wave functions. These are provided by a one-particle Hamiltonian\nthat is parameterized to describe the main features of {\\it ab initio}\ncalculations. The Bethe-Salpeter equation is then solved in the so-called\nexcitonic transition representation, which significantly reduces the problem\ndimensionality by exploiting the system's symmetries. Consequently, the\nexcitonic energies and the excitonic wave functions are obtained from the\ndirect diagonalization of the effective two-particle Hamiltonian of the\nBethe-Salpeter equation. We have studied rotation angles as low as\n$7.34^{\\circ}$. The model allows the study of commensurate and incommensurate\nmoir\\'e patterns at much lower computational cost than the {\\it ab initio}\nversion of the Bethe-Salpeter equation. Here, using the model and effective\nscreening of the Keldysh type, we could obtain the absorption spectra and\ncharacterize the excitonic properties of twisted hBN bilayers for different\nrotation angles, demonstrating how this property affects the excitonic energies\nand localizations of their wavefunctions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:30:45 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Roman-Taboada","Pedro",""],["Obregon-Castillo","Estefania",""],["Botello-Mendez","Andr\u00e9s R.",""],["Noguez","Cecilia",""]]}
{"id":"2308.12943","submitter":"Alberto Roper Pol","authors":"Alberto Roper Pol, Simona Procacci, Chiara Caprini","title":"Characterization of the gravitational wave spectrum from sound waves\n  within the sound shell model","comments":"32 pages, 14 figures, 1 table, submitted to Phys. Rev. D","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the gravitational wave (GW) spectrum sourced by the sound waves\nproduced during a first-order phase transition during radiation domination. The\ncorrelator of the velocity field is evaluated according to the sound shell\nmodel. In our derivation, we include the effects of the expansion of the\nUniverse, showing their importance, in particular for sourcing processes with\ntime duration comparable to the Hubble time. From the exact solution of the GW\nsourcing integral, we find a causal growth at small frequencies, $\\Omega_{\\rm\nGW} \\sim k^3$, possibly followed by a linear regime $\\Omega_{\\rm GW} \\sim k$ at\nintermediate $k$, depending on the phase transition parameters. Around the\npeak, we find a steep growth that approaches the $k^9$ scaling found in the\nsound shell model. This growth causes a bump around the GW spectrum peak, which\nmay represent a distinctive feature of GWs produced from acoustic motion, since\nnothing similar has been observed for vortical turbulence. Nevertheless, we\nfind that the $k^9$ scaling is much less extended than expected in the\nliterature, and it does not necessarily appear. The dependence on the duration\nof the source, $\\tau_{\\rm fin} - \\tau_*$, is quadratic at small frequencies\n$k$, and proportional to $\\ln^2 (\\tau_{\\rm fin} {\\cal H}_*)$ for an expanding\nUniverse. At frequencies around the peak, the growth is suppressed by a factor\n$\\Upsilon = 1 - 1/(\\tau_{\\rm fin} {\\cal H}_*)$, which becomes linear for short\nduration. We discuss the linear or quadratic dependence on the source duration\nfor stationary processes, which affects the amplitude of the GW spectrum, both\nin the causality tail and at the peak, showing that the assumption of\nstationarity is a very relevant one, as far as the GW spectral shape is\nconcerned. Finally, we present a general semi-analytical template of the\nresulting GW spectrum, which depends on the parameters of the phase transition.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:32:37 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Pol","Alberto Roper",""],["Procacci","Simona",""],["Caprini","Chiara",""]]}
{"id":"2308.12944","submitter":"Nahuel Diaz","authors":"N. L. Diaz, Paolo Braccia, Martin Larocca, J.M. Matera, R. Rossignoli,\n  M. Cerezo","title":"Parallel-in-time quantum simulation via Page and Wootters quantum time","comments":"19+15 pages, 18+1 figures","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29609","categories":"quant-ph stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the past few decades, researchers have created a veritable zoo of quantum\nalgorithm by drawing inspiration from classical computing, information theory,\nand even from physical phenomena. Here we present quantum algorithms for\nparallel-in-time simulations that are inspired by the Page and Wooters\nformalism. In this framework, and thus in our algorithms, the classical\ntime-variable of quantum mechanics is promoted to the quantum realm by\nintroducing a Hilbert space of \"clock\" qubits which are then entangled with the\n\"system\" qubits. We show that our algorithms can compute temporal properties\nover $N$ different times of many-body systems by only using $\\log(N)$ clock\nqubits. As such, we achieve an exponential trade-off between time and spatial\ncomplexities. In addition, we rigorously prove that the entanglement created\nbetween the system qubits and the clock qubits has operational meaning, as it\nencodes valuable information about the system's dynamics. We also provide a\ncircuit depth estimation of all the protocols, showing an exponential advantage\nin computation times over traditional sequential in time algorithms. In\nparticular, for the case when the dynamics are determined by the Aubry-Andre\nmodel, we present a hybrid method for which our algorithms have a depth that\nonly scales as $\\mathcal{O}(\\log(N)n)$. As a by product we can relate the\nprevious schemes to the problem of equilibration of an isolated quantum system,\nthus indicating that our framework enable a new dimension for studying\ndynamical properties of many-body systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:32:41 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Diaz","N. L.",""],["Braccia","Paolo",""],["Larocca","Martin",""],["Matera","J. M.",""],["Rossignoli","R.",""],["Cerezo","M.",""]]}
{"id":"2308.12945","submitter":"Sarah Petersen","authors":"Guchuan Li, Sarah Petersen, Elizabeth Ellen Tatum","title":"A Thom Spectrum Model for $C_2$-Integral Brown--Gitler Spectra","comments":"15 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Thom spectrum model for a $C_2$-equivariant analogue of integral\nBrown--Gitler spectra is established and shown to have a multiplicative\nproperty. The $C_2$-equivariant spectra constructed enjoy properties analogous\nto classical nonequivariant integral Brown--Gitler spectra and thus may prove\nuseful for producing splittings of $BP \\langle 1 \\rangle \\wedge BP \\langle 1\n\\rangle$ and $bo \\wedge bo$ in the $C_2$-equivariant setting.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:34:23 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Li","Guchuan",""],["Petersen","Sarah",""],["Tatum","Elizabeth Ellen",""]]}
{"id":"2308.12946","submitter":"Christopher Nolan","authors":"C. A. Nolan, B. Zhao, P. Caselli, Z. Y. Li","title":"On the importance of disc chemistry in the formation of protoplanetary\n  disc rings","comments":"Accepted for publication in MNRAS, 19 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Radial substructures have now been observed in a wide range of protoplanetary\ndiscs (PPDs), from young to old systems, however their formation is still an\narea of vigorous debate. Recent magnetohydrodynamic (MHD) simulations have\nshown that rings and gaps can form naturally in PPDs when non-ideal MHD effects\nare included. However these simulations employ ad-hoc approximations to the\nmagnitudes of the magnetic diffusivities in order to facilitate ring growth. We\nreplace the parametrisation of these terms with a simple chemical network and\ngrain distribution model to calculate the non-ideal effects in a more\nself-consistent way. We use a range of grain distributions to simulate grain\nformation for different disc conditions. Including ambipolar diffusion, we find\nthat large grain populations (> 1{\\mu}m), and those including a population of\nvery small polyaromatic hydrocarbons (PAHs) facilitate the growth of periodic,\nstable rings, while intermediate sized grains suppress ring formation.\nIncluding Ohmic diffusion removes the positive influence of PAHs, with only\nlarge grain populations still producing periodic ring and gap structures. These\nresults relate closely to the degree of coupling between the magnetic field and\nthe neutral disc material, quantified by the non-dimensional Elsasser number\n{\\Lambda} (the ratio of magnetic forces to Coriolis force). For both the\nambipolar-only and ambipolar-ohmic cases, if the total Elsasser number is\ninitially of order unity along the disc mid-plane, ring and gap structures may\ndevelop.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:34:55 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Nolan","C. A.",""],["Zhao","B.",""],["Caselli","P.",""],["Li","Z. Y.",""]]}
{"id":"2308.12947","submitter":"Thomas Steinke","authors":"Alexander Knop, Thomas Steinke","title":"Counting Distinct Elements Under Person-Level Differential Privacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the problem of counting the number of distinct elements in a dataset\nsubject to the constraint of differential privacy. We consider the challenging\nsetting of person-level DP (a.k.a. user-level DP) where each person may\ncontribute an unbounded number of items and hence the sensitivity is unbounded.\n  Our approach is to compute a bounded-sensitivity version of this query, which\nreduces to solving a max-flow problem. The sensitivity bound is optimized to\nbalance the noise we must add to privatize the answer against the error of the\napproximation of the bounded-sensitivity query to the true number of unique\nelements.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:36:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Knop","Alexander",""],["Steinke","Thomas",""]]}
{"id":"2308.12948","submitter":"Perla Sousi","authors":"Amine Asselah, Izumi Okada, Bruno Schapira and Perla Sousi","title":"Branching random walks and Minkowski sum of random walks","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the range of a critical branching random walk conditioned to\nsurvive forever and the Minkowski sum of two independent simple random walk\nranges are intersection-equivalent in any dimension $d\\ge 5$, in the sense that\nthey hit any finite set with comparable probability, as their common starting\npoint is sufficiently far away from the set to be hit. Furthermore, we extend a\ndiscrete version of Kesten, Spitzer and Whitman's result on the law of large\nnumbers for the volume of a Wiener sausage. Here, the sausage is made of the\nMinkowski sum of $N$ independent simple random walk ranges in $\\mathbb{Z}^d$,\nwith $d>2N$, and of a finite set $A\\subset \\mathbb{Z}^d$. When properly\nnormalised the volume of the sausage converges to a quantity equivalent to the\ncapacity of $A$ with respect to the kernel $K(x,y)=(1+\\|x-y\\|)^{2N-d}$. As a\nconsequence, we establish a new relation between capacity and {\\it branching\ncapacity}.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:37:32 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Asselah","Amine",""],["Okada","Izumi",""],["Schapira","Bruno",""],["Sousi","Perla",""]]}
{"id":"2308.12949","submitter":"Ximeng Sun","authors":"Ximeng Sun, Kihyuk Sohn, Kate Saenko, Clayton Mellina, Xiao Bian","title":"Label Budget Allocation in Multi-Task Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The cost of labeling data often limits the performance of machine learning\nsystems. In multi-task learning, related tasks provide information to each\nother and improve overall performance, but the label cost can vary among tasks.\nHow should the label budget (i.e. the amount of money spent on labeling) be\nallocated among different tasks to achieve optimal multi-task performance? We\nare the first to propose and formally define the label budget allocation\nproblem in multi-task learning and to empirically show that different budget\nallocation strategies make a big difference to its performance. We propose a\nTask-Adaptive Budget Allocation algorithm to robustly generate the optimal\nbudget allocation adaptive to different multi-task learning settings.\nSpecifically, we estimate and then maximize the extent of new information\nobtained from the allocated budget as a proxy for multi-task learning\nperformance. Experiments on PASCAL VOC and Taskonomy demonstrate the efficacy\nof our approach over other widely used heuristic labeling strategies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:38:14 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Sun","Ximeng",""],["Sohn","Kihyuk",""],["Saenko","Kate",""],["Mellina","Clayton",""],["Bian","Xiao",""]]}
{"id":"2308.12950","submitter":"Baptiste Roziere","authors":"Baptiste Rozi\\`ere, Jonas Gehring, Fabian Gloeckle, Sten Sootla, Itai\n  Gat, Xiaoqing Ellen Tan, Yossi Adi, Jingyu Liu, Tal Remez, J\\'er\\'emy Rapin,\n  Artyom Kozhevnikov, Ivan Evtimov, Joanna Bitton, Manish Bhatt, Cristian\n  Canton Ferrer, Aaron Grattafiori, Wenhan Xiong, Alexandre D\\'efossez, Jade\n  Copet, Faisal Azhar, Hugo Touvron, Louis Martin, Nicolas Usunier, Thomas\n  Scialom, Gabriel Synnaeve","title":"Code Llama: Open Foundation Models for Code","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We release Code Llama, a family of large language models for code based on\nLlama 2 providing state-of-the-art performance among open models, infilling\ncapabilities, support for large input contexts, and zero-shot instruction\nfollowing ability for programming tasks. We provide multiple flavors to cover a\nwide range of applications: foundation models (Code Llama), Python\nspecializations (Code Llama - Python), and instruction-following models (Code\nLlama - Instruct) with 7B, 13B and 34B parameters each. All models are trained\non sequences of 16k tokens and show improvements on inputs with up to 100k\ntokens. 7B and 13B Code Llama and Code Llama - Instruct variants support\ninfilling based on surrounding content. Code Llama reaches state-of-the-art\nperformance among open models on several code benchmarks, with scores of up to\n53% and 55% on HumanEval and MBPP, respectively. Notably, Code Llama - Python\n7B outperforms Llama 2 70B on HumanEval and MBPP, and all our models outperform\nevery other publicly available model on MultiPL-E. We release Code Llama under\na permissive license that allows for both research and commercial use.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:39:13 GMT"},{"version":"v2","created":"Fri, 25 Aug 2023 08:51:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rozi\u00e8re","Baptiste",""],["Gehring","Jonas",""],["Gloeckle","Fabian",""],["Sootla","Sten",""],["Gat","Itai",""],["Tan","Xiaoqing Ellen",""],["Adi","Yossi",""],["Liu","Jingyu",""],["Remez","Tal",""],["Rapin","J\u00e9r\u00e9my",""],["Kozhevnikov","Artyom",""],["Evtimov","Ivan",""],["Bitton","Joanna",""],["Bhatt","Manish",""],["Ferrer","Cristian Canton",""],["Grattafiori","Aaron",""],["Xiong","Wenhan",""],["D\u00e9fossez","Alexandre",""],["Copet","Jade",""],["Azhar","Faisal",""],["Touvron","Hugo",""],["Martin","Louis",""],["Usunier","Nicolas",""],["Scialom","Thomas",""],["Synnaeve","Gabriel",""]]}
{"id":"2308.12951","submitter":"Waseem Bakr","authors":"Max L. Prichard, Benjamin M. Spar, Ivan Morera, Eugene Demler, Zoe Z.\n  Yan and Waseem S. Bakr","title":"Directly imaging spin polarons in a kinetically frustrated Hubbard\n  system","comments":"7 pages (4 figures) + 6 pages methods (7 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.str-el quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The emergence of quasiparticles in quantum many-body systems underlies the\nrich phenomenology in many strongly interacting materials. In the context of\ndoped Mott insulators, magnetic polarons are quasiparticles that usually arise\nfrom an interplay between the kinetic energy of doped charge carriers and\nsuperexchange spin interactions. However, in kinetically frustrated lattices,\nitinerant spin polarons - bound states of a dopant and a spin-flip - have been\ntheoretically predicted even in the absence of superexchange coupling. Despite\ntheir important role in the theory of kinetic magnetism, a microscopic\nobservation of these polarons is lacking. Here we directly image itinerant spin\npolarons in a triangular lattice Hubbard system realised with ultracold atoms,\nrevealing enhanced antiferromagnetic correlations in the local environment of a\nhole dopant. In contrast, around a charge dopant, we find ferromagnetic\ncorrelations, a manifestation of the elusive Nagaoka effect. We study the\nevolution of these correlations with interactions and doping, and use\nhigher-order correlation functions to further elucidate the relative\ncontributions of superexchange and kinetic mechanisms. The robustness of\nitinerant spin polarons at high temperature paves the way for exploring\npotential mechanisms for hole pairing and superconductivity in frustrated\nsystems. Furthermore, our work provides microscopic insights into related\nphenomena in triangular lattice moir\\'{e} materials.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:41:07 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Prichard","Max L.",""],["Spar","Benjamin M.",""],["Morera","Ivan",""],["Demler","Eugene",""],["Yan","Zoe Z.",""],["Bakr","Waseem S.",""]]}
{"id":"2308.12952","submitter":"Homer Walke","authors":"Homer Walke, Kevin Black, Abraham Lee, Moo Jin Kim, Max Du, Chongyi\n  Zheng, Tony Zhao, Philippe Hansen-Estruch, Quan Vuong, Andre He, Vivek Myers,\n  Kuan Fang, Chelsea Finn, Sergey Levine","title":"BridgeData V2: A Dataset for Robot Learning at Scale","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce BridgeData V2, a large and diverse dataset of robotic\nmanipulation behaviors designed to facilitate research on scalable robot\nlearning. BridgeData V2 contains 60,096 trajectories collected across 24\nenvironments on a publicly available low-cost robot. BridgeData V2 provides\nextensive task and environment variability, leading to skills that can\ngeneralize across environments, domains, and institutions, making the dataset a\nuseful resource for a broad range of researchers. Additionally, the dataset is\ncompatible with a wide variety of open-vocabulary, multi-task learning methods\nconditioned on goal images or natural language instructions. In our\nexperiments, we train 6 state-of-the-art imitation learning and offline\nreinforcement learning methods on our dataset, and find that they succeed on a\nsuite of tasks requiring varying amounts of generalization. We also demonstrate\nthat the performance of these methods improves with more data and higher\ncapacity models, and that training on a greater variety of skills leads to\nimproved generalization. By publicly sharing BridgeData V2 and our pre-trained\nmodels, we aim to accelerate research in scalable robot learning methods.\nProject page at https://rail-berkeley.github.io/bridgedata\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:41:20 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Walke","Homer",""],["Black","Kevin",""],["Lee","Abraham",""],["Kim","Moo Jin",""],["Du","Max",""],["Zheng","Chongyi",""],["Zhao","Tony",""],["Hansen-Estruch","Philippe",""],["Vuong","Quan",""],["He","Andre",""],["Myers","Vivek",""],["Fang","Kuan",""],["Finn","Chelsea",""],["Levine","Sergey",""]]}
{"id":"2308.12953","submitter":"Lalit Vaishya","authors":"Lalit Vaishya","title":"Average behaviour of Hecke eigenvalues over certain polynomial","comments":"13 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the article, we investigate the average behaviour of normalised Hecke\neigenvalues over certain polynomials and establish an estimate for the power\nmoments of the normalised Hecke eigenvalues of a normalised Hecke eigenform of\nweight $k \\ge 2$ for the full modular group $SL_2(\\mathbb{Z})$ over certain\npolynomial, given by a sum of triangular numbers with certain positive\ncoefficients. More precisely, for each $r \\in \\mathbb{N}$, we obtain an\nasymptotic for the following sum \\begin{equation*} \\begin{split}\n\\displaystyle{\\sideset{}{^{\\flat }}\\sum_{ \\alpha(\\underline{x}))+1 \\le X \\atop\n\\underline{x} \\in {\\mathbb Z}^{4}} } \\lambda_{f}^{r}(\\alpha(\\underline{x})+1) ,\n\\\\ \\end{split} \\end{equation*} where $\\displaystyle{\\sideset{}{^{\\flat }}\\sum}$\nmeans that the sum runs over the square-free positive integers, and\n$\\lambda_{f} (n)$ is the normalised $n^{\\rm th}$-Hecke eigenvalue of a\nnormalised Hecke eigenform $f \\in S_{k}(SL_2(\\mathbb{Z}))$, and\n$\\alpha(\\underline{x}) = \\frac{1}{2} \\left( x_{1}^{2}+ x_{1} + x_{2}^{2} +\nx_{2} + 2 ( x_{3}^{2} + x_{3}) + 4 (x_{4}^{2} + x_{4}) \\right) \\in {\\mathbb\nQ}[x_{1},x_{2},x_{3},x_{4}] $ is a polynomial, and $\\underline{x} =\n(x_{1},x_{2},x_{3},x_{4}) \\in {\\mathbb Z}^{4}$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:42:05 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Vaishya","Lalit",""]]}
{"id":"2308.12954","submitter":"Tolulope Oke","authors":"Tolulope Oke","title":"Homotopy lifting maps on Hochschild cohomology and connections to\n  deformation of algebras using reduction systems","comments":"Accepted for publication in the AMS Contemporary Mathematics. arXiv\n  admin note: text overlap with arXiv:2103.12331","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe the Gerstenhaber bracket structure on Hochschild cohomology of\nKoszul quiver algebras in terms of homotopy lifting maps. There is a projective\nbimodule resolution of Koszul quiver algebras that admits a comultiplicative\nstructure. Introducing new scalars, we describe homotopy lifting maps\nassociated to Hochschild cocycles using the comultiplicative structure. We show\nthat the scalars can be described by some recurrence relations and we give\nseveral examples where these scalars appear in the literature. In particular,\nfor a member of a family of quiver algebras, we describe Hochschild 2-cocycles\nand their associated homotopy lifting maps and determine the Maurer-Cartan\nelements of the quiver algebra in two ways: (i) by the use of homotopy lifting\nmaps and (ii) by the use of a combinatorial star product that arises from the\ndeformation of algebras using reduction systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:46:27 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Oke","Tolulope",""]]}
{"id":"2308.12955","submitter":"Ellie Graeden","authors":"Ellie Graeden, David Rosado, Tess Stevens, Mallory Knodel, Rachele\n  Hendricks-Sturrup, Andrew Reiskind, Ashley Bennett, John Leitner, Paul Lekas,\n  Michelle DeMooy","title":"A new framework for global data regulation","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Under the current regulatory framework for data protections, the protection\nof human rights writ large and the corresponding outcomes are regulated largely\nindependently from the data and tools that both threaten those rights and are\nneeded to protect them. This separation between tools and the outcomes they\ngenerate risks overregulation of the data and tools themselves when not linked\nto sensitive use cases. In parallel, separation risks under-regulation if the\ndata can be collected and processed under a less-restrictive framework, but\nused to drive an outcome that requires additional sensitivity and restrictions.\nA new approach is needed to support differential protections based on the\ngenuinely high-risk use cases within each sector. Here, we propose a regulatory\nframework designed to apply not to specific data or tools themselves, but to\nthe outcomes and rights that are linked to the use of these data and tools in\ncontext. This framework is designed to recognize, address, and protect a broad\nrange of human rights, including privacy, and suggests a more flexible approach\nto policy making that is aligned with current engineering tools and practices.\nWe test this framework in the context of open banking and describe how current\nprivacy-enhancing technologies and other engineering strategies can be applied\nin this context and that of contract tracing applications. This approach for\ndata protection regulations more effectively builds on existing engineering\ntools and protects the wide range of human rights defined by legislation and\nconstitutions around the globe.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:48:56 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Graeden","Ellie",""],["Rosado","David",""],["Stevens","Tess",""],["Knodel","Mallory",""],["Hendricks-Sturrup","Rachele",""],["Reiskind","Andrew",""],["Bennett","Ashley",""],["Leitner","John",""],["Lekas","Paul",""],["DeMooy","Michelle",""]]}
{"id":"2308.12956","submitter":"Ming Li","authors":"Huafeng Kuang, Jie Wu, Xiawu Zheng, Ming Li, Xuefeng Xiao, Rui Wang,\n  Min Zheng, Rongrong Ji","title":"DLIP: Distilling Language-Image Pre-training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision-Language Pre-training (VLP) shows remarkable progress with the\nassistance of extremely heavy parameters, which challenges deployment in real\napplications. Knowledge distillation is well recognized as the essential\nprocedure in model compression. However, existing knowledge distillation\ntechniques lack an in-depth investigation and analysis of VLP, and practical\nguidelines for VLP-oriented distillation are still not yet explored. In this\npaper, we present DLIP, a simple yet efficient Distilling Language-Image\nPre-training framework, through which we investigate how to distill a light VLP\nmodel. Specifically, we dissect the model distillation from multiple\ndimensions, such as the architecture characteristics of different modules and\nthe information transfer of different modalities. We conduct comprehensive\nexperiments and provide insights on distilling a light but performant VLP\nmodel. Experimental results reveal that DLIP can achieve a state-of-the-art\naccuracy/efficiency trade-off across diverse cross-modal tasks, e.g.,\nimage-text retrieval, image captioning and visual question answering. For\nexample, DLIP compresses BLIP by 1.9x, from 213M to 108M parameters, while\nachieving comparable or better performance. Furthermore, DLIP succeeds in\nretaining more than 95% of the performance with 22.4% parameters and 24.8%\nFLOPs compared to the teacher model and accelerates inference speed by 2.7x.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:50:21 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kuang","Huafeng",""],["Wu","Jie",""],["Zheng","Xiawu",""],["Li","Ming",""],["Xiao","Xuefeng",""],["Wang","Rui",""],["Zheng","Min",""],["Ji","Rongrong",""]]}
{"id":"2308.12957","submitter":"Mohammad Abutoama","authors":"Mohammad Abutoama, George Kountouris, Jesper M{\\o}rk, and Philip\n  Tr{\\o}st Kristensen","title":"Semi-analytical Framework for Modeling Strong Coupling of Quantum\n  Emitters in Electromagnetic Resonators","comments":"18 pages, 7 figures, research article","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a semi-analytical framework for studying interactions between\nquantum emitters and general electromagnetic resonators. The method relies on\nthe Lippmann-Schwinger equation to calculate the complex resonance frequencies\nof the coupled system based only on a single calculation for the\nelectromagnetic resonator without the quantum emitter and with no fitting\nparameters. This is in stark contrast to standard approaches in the literature,\nin which the properties of the coupled system are fitted from calculated\nspectra. As an application example, we consider a recent dielectric cavity\ndesign featuring deep subwavelength confinement of light. We find the expected\nanti-crossing of the emitter and cavity resonance frequencies, and comparing to\nindependent reference calculations, we find an extraordinary quantitative\nagreement with a relative error below one part in ten thousand. In order to\nunambiguously connect with the Jaynes-Cummings model, we derive an explicit\nexpression relating the classical description of the emitter, as modeled by a\nspherical inclusion with a Lorentzian material response, to the dipole moment\nof the corresponding quantum optical model. The combined framework therefore\nenables classical calculations to be used for evaluating the coupling strength\nentering quantum optical theories in a transparent way.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:53:13 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Abutoama","Mohammad",""],["Kountouris","George",""],["M\u00f8rk","Jesper",""],["Kristensen","Philip Tr\u00f8st",""]]}
{"id":"2308.12958","submitter":"Lena Ji","authors":"Louis Esser, Lena Ji, Joaqu\\'in Moraga","title":"Symmetries of Fano varieties","comments":"32 pages, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study Fano varieties endowed with a faithful action of a symmetric group,\nas well as analogous results for Calabi--Yau varieties, and log terminal\nsingularities. We show the existence of a constant $m(n)$, so that every\nsymmetric group $S_k$ acting on an $n$-dimensional Fano variety satisfies $k\n\\leq m(n)$. We prove that $m(n)> n+\\sqrt{2n}$ for every $n$. On the other hand,\nwe show that $\\lim_{n\\to \\infty} m(n)/(n+1)^2 \\leq 1$. However, this asymptotic\nupper bound is not expected to be sharp.\n  We obtain sharp bounds for certain classes of varieties. For toric varieties,\nwe show that $m(n)=n+2$ for $n\\geq 4$. For Fano quasismooth weighted complete\nintersections, we prove the asymptotic equality $\\lim_{n\\to \\infty}\nm(n)/(n+1)=1$. Among the Fano weighted complete intersections, we study the\nmaximally symmetric ones and show that they are closely related to the\nFano--Fermat varieties, i.e., Fano complete intersections in $\\mathbb P^N$ cut\nout by Fermat hypersurfaces.\n  Finally, we draw a connection between maximally symmetric Fano varieties and\nboundedness of Fano varieties. For instance, we show that the class of\n$S_8$-equivariant Fano $4$-folds forms a bounded family. In contrast, the\n$S_7$-equivariant Fano $4$-folds are unbounded.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:53:42 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Esser","Louis",""],["Ji","Lena",""],["Moraga","Joaqu\u00edn",""]]}
{"id":"2308.12959","submitter":"Bjarne Bergh","authors":"Bjarne Bergh, Jan Kochanowski, Robert Salzmann, Nilanjana Datta","title":"Infinite Dimensional Asymmetric Quantum Channel Discrimination","comments":"39 pages, 2 figures, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study asymmetric binary channel discrimination, for qantum channels acting\non separable Hilbert spaces. We establish quantum Stein's lemma for channels\nfor both adaptive and parallel strategies, and show that under finiteness of\nthe geometric R\\'enyi divergence between the two channels for some $\\alpha >\n1$, adaptive strategies offer no asymptotic advantage over parallel ones. One\nmajor step in our argument is to demonstrate that the geometric R\\'enyi\ndivergence satisfies a chain rule and is additive for channels also in infinite\ndimensions. These results may be of independent interest. Furthermore, we not\nonly show asymptotic equivalence of parallel and adaptive strategies, but\nexplicitly construct a parallel strategy which approximates a given adaptive\n$n$-shot strategy, and give an explicit bound on the difference between the\ndiscrimination errors for these two strategies. This extends the finite\ndimensional result from [B. Bergh et al., arxiv:2206.08350]. Finally, this also\nallows us to conclude, that the chain rule for the Umegaki relative entropy in\ninfinite dimensions, recently shown in [O. Fawzi, L. Gao, and M. Rahaman,\narxiv:2212.14700v2] given finiteness of the max divergence between the two\nchannels, also holds under the weaker condition of finiteness of the geometric\nR\\'enyi divergence. We give explicit examples of channels which show that these\ntwo finiteness conditions are not equivalent.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:56:19 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bergh","Bjarne",""],["Kochanowski","Jan",""],["Salzmann","Robert",""],["Datta","Nilanjana",""]]}
{"id":"2308.12960","submitter":"Sheng Zhang","authors":"Sheng Zhang, Muzammal Naseer, Guangyi Chen, Zhiqiang Shen, Salman\n  Khan, Kun Zhang, Fahad Khan","title":"Towards Realistic Zero-Shot Classification via Self Structural Semantic\n  Alignment","comments":"submission at 24 Aug","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale pre-trained Vision Language Models (VLMs) have proven effective\nfor zero-shot classification. Despite the success, most traditional VLMs-based\nmethods are restricted by the assumption of partial source supervision or ideal\nvocabularies, which rarely satisfy the open-world scenario. In this paper, we\naim at a more challenging setting, Realistic Zero-Shot Classification, which\nassumes no annotation but instead a broad vocabulary. To address this\nchallenge, we propose the Self Structural Semantic Alignment (S^3A) framework,\nwhich extracts the structural semantic information from unlabeled data while\nsimultaneously self-learning. Our S^3A framework adopts a unique\nCluster-Vote-Prompt-Realign (CVPR) algorithm, which iteratively groups\nunlabeled data to derive structural semantics for pseudo-supervision. Our CVPR\nprocess includes iterative clustering on images, voting within each cluster to\nidentify initial class candidates from the vocabulary, generating\ndiscriminative prompts with large language models to discern confusing\ncandidates, and realigning images and the vocabulary as structural semantic\nalignment. Finally, we propose to self-learn the CLIP image encoder with both\nindividual and structural semantic alignment through a teacher-student learning\nstrategy. Our comprehensive experiments across various generic and fine-grained\nbenchmarks demonstrate that the S^3A method offers substantial improvements\nover existing VLMs-based approaches, achieving a more than 15% accuracy\nimprovement over CLIP on average. Our codes, models, and prompts are publicly\nreleased at https://github.com/sheng-eatamath/S3A.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:56:46 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Sheng",""],["Naseer","Muzammal",""],["Chen","Guangyi",""],["Shen","Zhiqiang",""],["Khan","Salman",""],["Zhang","Kun",""],["Khan","Fahad",""]]}
{"id":"2308.12961","submitter":"Xiangyang Zhu","authors":"Xiangyang Zhu, Renrui Zhang, Bowei He, Ziyu Guo, Jiaming Liu, Hao\n  Dong, Peng Gao","title":"Less is More: Towards Efficient Few-shot 3D Semantic Segmentation via\n  Training-free Networks","comments":"Code is available at https://github.com/yangyangyang127/TFS3D","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To reduce the reliance on large-scale datasets, recent works in 3D\nsegmentation resort to few-shot learning. Current 3D few-shot semantic\nsegmentation methods first pre-train the models on `seen' classes, and then\nevaluate their generalization performance on `unseen' classes. However, the\nprior pre-training stage not only introduces excessive time overhead, but also\nincurs a significant domain gap on `unseen' classes. To tackle these issues, we\npropose an efficient Training-free Few-shot 3D Segmentation netwrok, TFS3D, and\na further training-based variant, TFS3D-T. Without any learnable parameters,\nTFS3D extracts dense representations by trigonometric positional encodings, and\nachieves comparable performance to previous training-based methods. Due to the\nelimination of pre-training, TFS3D can alleviate the domain gap issue and save\na substantial amount of time. Building upon TFS3D, TFS3D-T only requires to\ntrain a lightweight query-support transferring attention (QUEST), which\nenhances the interaction between the few-shot query and support data.\nExperiments demonstrate TFS3D-T improves previous state-of-the-art methods by\n+6.93% and +17.96% mIoU respectively on S3DIS and ScanNet, while reducing the\ntraining time by -90%, indicating superior effectiveness and efficiency.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:58:03 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Xiangyang",""],["Zhang","Renrui",""],["He","Bowei",""],["Guo","Ziyu",""],["Liu","Jiaming",""],["Dong","Hao",""],["Gao","Peng",""]]}
{"id":"2308.12962","submitter":"David Fan","authors":"David Fan, Jue Wang, Shuai Liao, Yi Zhu, Vimal Bhat, Hector\n  Santos-Villalobos, Rohith MV, Xinyu Li","title":"Motion-Guided Masking for Spatiotemporal Representation Learning","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Several recent works have directly extended the image masked autoencoder\n(MAE) with random masking into video domain, achieving promising results.\nHowever, unlike images, both spatial and temporal information are important for\nvideo understanding. This suggests that the random masking strategy that is\ninherited from the image MAE is less effective for video MAE. This motivates\nthe design of a novel masking algorithm that can more efficiently make use of\nvideo saliency. Specifically, we propose a motion-guided masking algorithm\n(MGM) which leverages motion vectors to guide the position of each mask over\ntime. Crucially, these motion-based correspondences can be directly obtained\nfrom information stored in the compressed format of the video, which makes our\nmethod efficient and scalable. On two challenging large-scale video benchmarks\n(Kinetics-400 and Something-Something V2), we equip video MAE with our MGM and\nachieve up to +$1.3\\%$ improvement compared to previous state-of-the-art\nmethods. Additionally, our MGM achieves equivalent performance to previous\nvideo MAE using up to $66\\%$ fewer training epochs. Lastly, we show that MGM\ngeneralizes better to downstream transfer learning and domain adaptation tasks\non the UCF101, HMDB51, and Diving48 datasets, achieving up to +$4.9\\%$\nimprovement compared to baseline methods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:58:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Fan","David",""],["Wang","Jue",""],["Liao","Shuai",""],["Zhu","Yi",""],["Bhat","Vimal",""],["Santos-Villalobos","Hector",""],["MV","Rohith",""],["Li","Xinyu",""]]}
{"id":"2308.12963","submitter":"Xiyue Zhu Mr.","authors":"Xiyue Zhu, Vlas Zyrianov, Zhijian Liu, Shenlong Wang","title":"MapPrior: Bird's-Eye View Map Layout Estimation with Generative Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite tremendous advancements in bird's-eye view (BEV) perception, existing\nmodels fall short in generating realistic and coherent semantic map layouts,\nand they fail to account for uncertainties arising from partial sensor\ninformation (such as occlusion or limited coverage). In this work, we introduce\nMapPrior, a novel BEV perception framework that combines a traditional\ndiscriminative BEV perception model with a learned generative model for\nsemantic map layouts. Our MapPrior delivers predictions with better accuracy,\nrealism, and uncertainty awareness. We evaluate our model on the large-scale\nnuScenes benchmark. At the time of submission, MapPrior outperforms the\nstrongest competing method, with significantly improved MMD and ECE scores in\ncamera- and LiDAR-based BEV perception.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:58:30 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhu","Xiyue",""],["Zyrianov","Vlas",""],["Liu","Zhijian",""],["Wang","Shenlong",""]]}
{"id":"2308.12964","submitter":"Yunji Kim","authors":"Yunji Kim, Jiyoung Lee, Jin-Hwa Kim, Jung-Woo Ha, Jun-Yan Zhu","title":"Dense Text-to-Image Generation with Attention Modulation","comments":"Accepted by ICCV2023. Code and data are available at\n  https://github.com/naver-ai/DenseDiffusion","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing text-to-image diffusion models struggle to synthesize realistic\nimages given dense captions, where each text prompt provides a detailed\ndescription for a specific image region. To address this, we propose\nDenseDiffusion, a training-free method that adapts a pre-trained text-to-image\nmodel to handle such dense captions while offering control over the scene\nlayout. We first analyze the relationship between generated images' layouts and\nthe pre-trained model's intermediate attention maps. Next, we develop an\nattention modulation method that guides objects to appear in specific regions\naccording to layout guidance. Without requiring additional fine-tuning or\ndatasets, we improve image generation performance given dense captions\nregarding both automatic and human evaluation scores. In addition, we achieve\nsimilar-quality visual results with models specifically trained with layout\nconditions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:01 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kim","Yunji",""],["Lee","Jiyoung",""],["Kim","Jin-Hwa",""],["Ha","Jung-Woo",""],["Zhu","Jun-Yan",""]]}
{"id":"2308.12965","submitter":"Sai Kumar Dwivedi","authors":"Sai Kumar Dwivedi, Cordelia Schmid, Hongwei Yi, Michael J. Black,\n  Dimitrios Tzionas","title":"POCO: 3D Pose and Shape Estimation with Confidence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The regression of 3D Human Pose and Shape (HPS) from an image is becoming\nincreasingly accurate. This makes the results useful for downstream tasks like\nhuman action recognition or 3D graphics. Yet, no regressor is perfect, and\naccuracy can be affected by ambiguous image evidence or by poses and appearance\nthat are unseen during training. Most current HPS regressors, however, do not\nreport the confidence of their outputs, meaning that downstream tasks cannot\ndifferentiate accurate estimates from inaccurate ones. To address this, we\ndevelop POCO, a novel framework for training HPS regressors to estimate not\nonly a 3D human body, but also their confidence, in a single feed-forward pass.\nSpecifically, POCO estimates both the 3D body pose and a per-sample variance.\nThe key idea is to introduce a Dual Conditioning Strategy (DCS) for regressing\nuncertainty that is highly correlated to pose reconstruction quality. The POCO\nframework can be applied to any HPS regressor and here we evaluate it by\nmodifying HMR, PARE, and CLIFF. In all cases, training the network to reason\nabout uncertainty helps it learn to more accurately estimate 3D pose. While\nthis was not our goal, the improvement is modest but consistent. Our main\nmotivation is to provide uncertainty estimates for downstream tasks; we\ndemonstrate this in two ways: (1) We use the confidence estimates to bootstrap\nHPS training. Given unlabelled image data, we take the confident estimates of a\nPOCO-trained regressor as pseudo ground truth. Retraining with this\nautomatically-curated data improves accuracy. (2) We exploit uncertainty in\nvideo pose estimation by automatically identifying uncertain frames (e.g. due\nto occlusion) and inpainting these from confident frames. Code and models will\nbe available for research at https://poco.is.tue.mpg.de.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:04 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Dwivedi","Sai Kumar",""],["Schmid","Cordelia",""],["Yi","Hongwei",""],["Black","Michael J.",""],["Tzionas","Dimitrios",""]]}
{"id":"2308.12966","submitter":"Shuai Bai","authors":"Jinze Bai, Shuai Bai, Shusheng Yang, Shijie Wang, Sinan Tan, Peng\n  Wang, Junyang Lin, Chang Zhou, Jingren Zhou","title":"Qwen-VL: A Frontier Large Vision-Language Model with Versatile Abilities","comments":"Code, demo and models are available at\n  https://github.com/QwenLM/Qwen-VL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the Qwen-VL series, a set of large-scale vision-language models\ndesigned to perceive and understand both text and images. Comprising Qwen-VL\nand Qwen-VL-Chat, these models exhibit remarkable performance in tasks like\nimage captioning, question answering, visual localization, and flexible\ninteraction. The evaluation covers a wide range of tasks including zero-shot\ncaptioning, visual or document visual question answering, and grounding. We\ndemonstrate the Qwen-VL outperforms existing Large Vision Language Models\n(LVLMs). We present their architecture, training, capabilities, and\nperformance, highlighting their contributions to advancing multimodal\nartificial intelligence. Code, demo and models are available at\nhttps://github.com/QwenLM/Qwen-VL.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:17 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Bai","Jinze",""],["Bai","Shuai",""],["Yang","Shusheng",""],["Wang","Shijie",""],["Tan","Sinan",""],["Wang","Peng",""],["Lin","Junyang",""],["Zhou","Chang",""],["Zhou","Jingren",""]]}
{"id":"2308.12967","submitter":"Muhammad Zubair Irshad","authors":"Muhammad Zubair Irshad, Sergey Zakharov, Katherine Liu, Vitor\n  Guizilini, Thomas Kollar, Adrien Gaidon, Zsolt Kira, Rares Ambrus","title":"NeO 360: Neural Fields for Sparse View Synthesis of Outdoor Scenes","comments":"Accepted to International Conference on Computer Vision (ICCV), 2023.\n  Project page: https://zubair-irshad.github.io/projects/neo360.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent implicit neural representations have shown great results for novel\nview synthesis. However, existing methods require expensive per-scene\noptimization from many views hence limiting their application to real-world\nunbounded urban settings where the objects of interest or backgrounds are\nobserved from very few views. To mitigate this challenge, we introduce a new\napproach called NeO 360, Neural fields for sparse view synthesis of outdoor\nscenes. NeO 360 is a generalizable method that reconstructs 360{\\deg} scenes\nfrom a single or a few posed RGB images. The essence of our approach is in\ncapturing the distribution of complex real-world outdoor 3D scenes and using a\nhybrid image-conditional triplanar representation that can be queried from any\nworld point. Our representation combines the best of both voxel-based and\nbird's-eye-view (BEV) representations and is more effective and expressive than\neach. NeO 360's representation allows us to learn from a large collection of\nunbounded 3D scenes while offering generalizability to new views and novel\nscenes from as few as a single image during inference. We demonstrate our\napproach on the proposed challenging 360{\\deg} unbounded dataset, called NeRDS\n360, and show that NeO 360 outperforms state-of-the-art generalizable methods\nfor novel view synthesis while also offering editing and composition\ncapabilities. Project page:\nhttps://zubair-irshad.github.io/projects/neo360.html\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Irshad","Muhammad Zubair",""],["Zakharov","Sergey",""],["Liu","Katherine",""],["Guizilini","Vitor",""],["Kollar","Thomas",""],["Gaidon","Adrien",""],["Kira","Zsolt",""],["Ambrus","Rares",""]]}
{"id":"2308.12968","submitter":"Liming Jiang","authors":"Yuxin Jiang, Liming Jiang, Shuai Yang, Chen Change Loy","title":"Scenimefy: Learning to Craft Anime Scene via Semi-Supervised\n  Image-to-Image Translation","comments":"ICCV 2023. The first two authors contributed equally. Code:\n  https://github.com/Yuxinn-J/Scenimefy Project page:\n  https://yuxinn-j.github.io/projects/Scenimefy.html","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automatic high-quality rendering of anime scenes from complex real-world\nimages is of significant practical value. The challenges of this task lie in\nthe complexity of the scenes, the unique features of anime style, and the lack\nof high-quality datasets to bridge the domain gap. Despite promising attempts,\nprevious efforts are still incompetent in achieving satisfactory results with\nconsistent semantic preservation, evident stylization, and fine details. In\nthis study, we propose Scenimefy, a novel semi-supervised image-to-image\ntranslation framework that addresses these challenges. Our approach guides the\nlearning with structure-consistent pseudo paired data, simplifying the pure\nunsupervised setting. The pseudo data are derived uniquely from a\nsemantic-constrained StyleGAN leveraging rich model priors like CLIP. We\nfurther apply segmentation-guided data selection to obtain high-quality pseudo\nsupervision. A patch-wise contrastive style loss is introduced to improve\nstylization and fine details. Besides, we contribute a high-resolution anime\nscene dataset to facilitate future research. Our extensive experiments\ndemonstrate the superiority of our method over state-of-the-art baselines in\nterms of both perceptual quality and quantitative performance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:50 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Jiang","Yuxin",""],["Jiang","Liming",""],["Yang","Shuai",""],["Loy","Chen Change",""]]}
{"id":"2308.12969","submitter":"Rishabh Dabral","authors":"Wanyue Zhang and Rishabh Dabral and Thomas Leimk\\\"uhler and Vladislav\n  Golyanik and Marc Habermann and Christian Theobalt","title":"ROAM: Robust and Object-aware Motion Generation using Neural Pose\n  Descriptors","comments":"12 pages, 10 figures; project page:\n  https://vcai.mpi-inf.mpg.de/projects/ROAM/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing automatic approaches for 3D virtual character motion synthesis\nsupporting scene interactions do not generalise well to new objects outside\ntraining distributions, even when trained on extensive motion capture datasets\nwith diverse objects and annotated interactions. This paper addresses this\nlimitation and shows that robustness and generalisation to novel scene objects\nin 3D object-aware character synthesis can be achieved by training a motion\nmodel with as few as one reference object. We leverage an implicit feature\nrepresentation trained on object-only datasets, which encodes an\nSE(3)-equivariant descriptor field around the object. Given an unseen object\nand a reference pose-object pair, we optimise for the object-aware pose that is\nclosest in the feature space to the reference pose. Finally, we use l-NSM,\ni.e., our motion generation model that is trained to seamlessly transition from\nlocomotion to object interaction with the proposed bidirectional pose blending\nscheme. Through comprehensive numerical comparisons to state-of-the-art methods\nand in a user study, we demonstrate substantial improvements in 3D virtual\ncharacter motion and interaction quality and robustness to scenarios with\nunseen objects. Our project page is available at\nhttps://vcai.mpi-inf.mpg.de/projects/ROAM/.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:51 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Zhang","Wanyue",""],["Dabral","Rishabh",""],["Leimk\u00fchler","Thomas",""],["Golyanik","Vladislav",""],["Habermann","Marc",""],["Theobalt","Christian",""]]}
{"id":"2308.12970","submitter":"Vladislav Golyanik","authors":"Navami Kairanda and Marc Habermann and Christian Theobalt and\n  Vladislav Golyanik","title":"NeuralClothSim: Neural Deformation Fields Meet the Kirchhoff-Love Thin\n  Shell Theory","comments":"27 pages, 22 figures and 3 tables; project page:\n  https://4dqv.mpi-inf.mpg.de/NeuralClothSim/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloth simulation is an extensively studied problem, with a plethora of\nsolutions available in computer graphics literature. Existing cloth simulators\nproduce realistic cloth deformations that obey different types of boundary\nconditions. Nevertheless, their operational principle remains limited in\nseveral ways: They operate on explicit surface representations with a fixed\nspatial resolution, perform a series of discretised updates (which bounds their\ntemporal resolution), and require comparably large amounts of storage.\nMoreover, back-propagating gradients through the existing solvers is often not\nstraightforward, which poses additional challenges when integrating them into\nmodern neural architectures. In response to the limitations mentioned above,\nthis paper takes a fundamentally different perspective on physically-plausible\ncloth simulation and re-thinks this long-standing problem: We propose\nNeuralClothSim, i.e., a new cloth simulation approach using thin shells, in\nwhich surface evolution is encoded in neural network weights. Our\nmemory-efficient and differentiable solver operates on a new continuous\ncoordinate-based representation of dynamic surfaces, i.e., neural deformation\nfields (NDFs); it supervises NDF evolution with the rules of the non-linear\nKirchhoff-Love shell theory. NDFs are adaptive in the sense that they 1)\nallocate their capacity to the deformation details as the latter arise during\nthe cloth evolution and 2) allow surface state queries at arbitrary spatial and\ntemporal resolutions without retraining. We show how to train our\nNeuralClothSim solver while imposing hard boundary conditions and demonstrate\nmultiple applications, such as material interpolation and simulation editing.\nThe experimental results highlight the effectiveness of our formulation and its\npotential impact.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:59:54 GMT"}],"update_date":"2023-08-25","authors_parsed":[["Kairanda","Navami",""],["Habermann","Marc",""],["Theobalt","Christian",""],["Golyanik","Vladislav",""]]}
{"id":"2308.12972","submitter":"Stefano Pisoni","authors":"Raghavendra D. Peddinti, Stefano Pisoni, Alessandro Marini, Philippe\n  Lott, Henrique Argentieri, Egor Tiunov and Leandro Aolita","title":"Complete quantum-inspired framework for computational fluid dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.chem-ph physics.comp-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computational fluid dynamics is both an active research field and a key tool\nfor industrial applications. The central challenge is to simulate turbulent\nflows in complex geometries, a compute-power intensive task due to the large\nvector dimensions required by discretized meshes. Here, we propose a full-stack\nsolver for incompressible fluids with memory and runtime scaling\npolylogarithmically in the mesh size. Our framework is based on matrix-product\nstates, a powerful compressed representation of quantum states. It is complete\nin that it solves for flows around immersed objects of diverse geometries, with\nnon-trivial boundary conditions, and can retrieve the solution directly from\nthe compressed encoding, i.e. without ever passing through the expensive\ndense-vector representation. These developments provide a toolbox with\npotential for radically more efficient simulations of real-life fluid problems.\n","versions":[{"version":"v1","created":"Wed, 2 Aug 2023 18:01:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Peddinti","Raghavendra D.",""],["Pisoni","Stefano",""],["Marini","Alessandro",""],["Lott","Philippe",""],["Argentieri","Henrique",""],["Tiunov","Egor",""],["Aolita","Leandro",""]]}
{"id":"2308.12973","submitter":"Antonielly Garcia Rodrigues","authors":"Antonielly Garcia Rodrigues and Eduardo Mario Dias","title":"Proofs of valid categorical syllogisms in one diagrammatic and two\n  symbolic axiomatic systems","comments":"66 pages, 9 figures (some of which include subfigures), 5 tables (one\n  of which includes 2 subtables). A cut-down version of this article, which\n  removes the discussion on diagrammatic logic with Euler diagrams, was\n  submitted to the \"History and Philosophy of Logic\" journal with a different\n  title","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gottfried Leibniz embarked on a research program to prove all the Aristotelic\ncategorical syllogisms by diagrammatic and algebraic methods. He succeeded in\nproving them by means of Euler diagrams, but didn't produce a manuscript with\ntheir algebraic proofs. We demonstrate how key excerpts scattered across\nvarious Leibniz's drafts on logic contained sufficient ingredients to prove\nthem by an algebraic method -- which we call the Leibniz-Cayley (LC) system --\nwithout having to make use of the more expressive and complex machinery of\nfirst-order quantificational logic. In addition, we prove the classic\ncategorical syllogisms again by a relational method -- which we call the\nMcColl-Ladd (ML) system -- employing categorical relations studied by Hugh\nMcColl and Christine Ladd. Finally, we show the connection of ML and LC with\nBoolean algebra, proving that ML is a consequence of LC, and that LC is a\nconsequence of the Boolean lattice axioms, thus establishing Leibniz's\nhistorical priority over George Boole in characterizing and applying (a\nsufficient fragment of) Boolean algebra to effectively tackle categorical\nsyllogistic.\n","versions":[{"version":"v1","created":"Thu, 17 Aug 2023 22:36:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rodrigues","Antonielly Garcia",""],["Dias","Eduardo Mario",""]]}
{"id":"2308.12974","submitter":"Claus Gerhardt","authors":"Claus Gerhardt","title":"The quantization of gravity: The quantization of the full Einstein\n  equations","comments":"Feature Paper https://www.mdpi.com/2073-8994/15/8/1599","journal-ref":"Symmetry 15, 1599, 2023","doi":"10.3390/sym15081599","report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We quantized the full Einstein equations in a globally hyperbolic spacetime\n$N=N^{n+1}$, $n\\ge 3$, and found solutions of the resulting hyperbolic equation\nin a fiber bundle $E$ which can be expressed as a product of spatial\neigenfunctions (eigendistributions) and temporal eigenfunctions. The spatial\neigenfunctions form a basis in an appropriate Hilbert space while the temporal\neigenfunctions are solutions to a second order ordinary differential equation\nin $\\mathbb{R}_+$. In case $n\\ge 17$ and provided the cosmological constant\n$\\Lambda$ is negative the temporal eigenfunctions are eigenfunctions of a\nself-adjoint operator $\\hat H_0$ such that the eigenvalues are countable and\nthe eigenfunctions form an orthonormal basis of a Hilbert space.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 08:52:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gerhardt","Claus",""]]}
{"id":"2308.12975","submitter":"Alex Rutar","authors":"Amlan Banaji and Alex Rutar and Sascha Troscheit","title":"Interpolating with generalized Assouad dimensions","comments":"50 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.DS math.MG math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $\\phi$-Assouad dimensions are a family of dimensions which interpolate\nbetween the upper box and Assouad dimensions. They are a generalization of the\nwell-studied Assouad spectrum with a more general form of scale sensitivity\nthat is often closely related to \"phase-transition\" phenomena in sets.\n  In this article we establish a number of key properties of the $\\phi$-Assouad\ndimensions which help to clarify their behaviour. We prove for any bounded\ndoubling metric space $F$ and $\\alpha\\in\\mathbb{R}$ satisfying\n$\\overline{\\operatorname{dim}}_{\\mathrm{B}}F<\\alpha\\leq\\operatorname{dim}_{\\mathrm{A}}\nF$ that there is a function $\\phi$ so that the $\\phi$-Assouad dimension of $F$\nis equal to $\\alpha$. We further show that the \"upper\" variant of the dimension\nis fully determined by the $\\phi$-Assouad dimension, and that homogeneous Moran\nsets are in a certain sense generic for these dimensions.\n  Further, we study explicit examples of sets where the Assouad spectrum does\nnot reach the Assouad dimension. We prove a precise formula for the\n$\\phi$-Assouad dimensions for Galton--Watson trees that correspond to a general\nclass of stochastically self-similar sets, including Mandelbrot percolation.\nThis result follows from two results which may be of general interest: a sharp\nlarge deviations theorem for Galton--Watson processes with bounded offspring\ndistribution, and a Borel--Cantelli-type lemma for infinite structures in\nrandom trees. Finally, we obtain results on the $\\phi$-Assouad dimensions of\noverlapping self-similar sets and decreasing sequences with decreasing gaps.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 14:30:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Banaji","Amlan",""],["Rutar","Alex",""],["Troscheit","Sascha",""]]}
{"id":"2308.12976","submitter":"Mohammad Javad Habibi Vosta Kolaei","authors":"Mohammad Javad Habibi Vosta Kolaei and Shahroud Azami","title":"Conformal bounds for the first eigenvalue of the $(p,q)$-Laplacian\n  system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider $\\left(M,g\\right)$ as an $m$-dimensional compact connected\nRiemannian manifold without boundary. In this paper, we investigate the first\neigenvalue $\\lambda_{1,p,q}$ of the $\\left(p,q\\right)$-Laplacian system on $M$.\nAlso, in the case of $p,q >n$ we will show that for arbitrary large\n$\\lambda_{1,p,q}$ there exists a Riemannian metric of volume one conformal to\nthe standard metric of $\\mathbb{S}^{m}$.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 05:32:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kolaei","Mohammad Javad Habibi Vosta",""],["Azami","Shahroud",""]]}
{"id":"2308.12977","submitter":"Mariano Caruso","authors":"M. Caruso","title":"Equivalent quantum systems","comments":null,"journal-ref":"International Journal of Geometric Methods in Modern Physics\n  (2023) 2350209","doi":"10.1142/S0219887823502092","report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have studied quantum systems on finite-dimensional Hilbert spaces and\nfound that all these systems are connected through local transformations.\nActually, we have shown that these transformations give rise to a gauge group\nthat connects the Hamiltonian operators associated with each quantum system.\nThis bridge allows us to connect different quantum systems, in such a way that\nstudying one of them allows to understand the other through a gauge\ntransformation. Furthermore, we included the case where the Hamiltonian\noperator can be time-dependent. An application for this construction will be\nachieved in the theory of control quantum systems.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:08:07 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Caruso","M.",""]]}
{"id":"2308.12978","submitter":"Li-Xin Li","authors":"Li-Xin Li","title":"A Note on the Kaluza-Klein Theory","comments":"8 pages, 2 figures. Class. Quantum Grav. published online 2023","journal-ref":null,"doi":"10.1088/1361-6382/acf2df","report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that the Kaluza-Klein theory contains a fundamental problem: The\nfour-dimensional metric tensor and the electromagnetic potential vector assumed\nin the Kaluza-Klein theory belong to four-dimensional vector spaces that are\nnot integrable in general, resulting that the four-dimensional physical\nvariables and the corresponding field equations derived from the\nfive-dimensional Einstein field equation (i.e., the four-dimensional Einstein\nfield equation and the Maxwell equations) are not defined on a four-dimensional\nsubmanifold. That is, the four-dimensional spacetime assumed in the\nKaluza-Klein theory does not exist. No satisfactory solutions are found within\nthe Kaluza-Klein formalism. Perhaps the best approach to fix the problem is\ngiving up the Kaluza-Klein theory and looking for a new unified scheme for\ngravitational and electromagnetic interactions in the framework of a spacetime\nwith extra dimensions, as having already been explored in some literature.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 01:03:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Li-Xin",""]]}
{"id":"2308.12979","submitter":"Xavier Kervyn","authors":"Xavier Kervyn","title":"BMS Symmetries of Gravitational Scattering","comments":"62 pages, 9 figures. This review article arose from an essay\n  submitted for the partial fulfillment of the requirements for the degree of\n  Master of Advanced Study in Applied Mathematics (Part III of the Mathematical\n  Tripos) at the University of Cambridge, set by Dr. Prahar Mitra and submitted\n  in May 2023. It is aimed at advanced undergraduate students or early\n  postgraduate students willing to learn about the role of asymptotic\n  symmetries in the context of flat space holography, with only basic knowledge\n  of quantum field theory and general relativity assumed. arXiv admin note:\n  text overlap with arXiv:1801.07064 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  After motivating the relevance of the Bondi-Metzner-Sachs (BMS) group over\nthe last decades, we review how concepts such as Penrose diagrams and the\ncovariant phase space formalism can be used to understand the asymptotic\nstructure of asymptotically flat spacetimes (AFS). We then explicitly construct\nthe asymptotic symmetry group of AFS in $3+1$ dimensions, the BMS group. Next,\nwe apply this knowledge to the usual far-field scattering problem in general\nrelativity, which leads to the unravelling of the intrinsic features of gravity\nin the infrared. In particular, we work out the connections between asymptotic\nsymmetries, soft theorems in quantum field theories and gravitational memory\neffects. We restrict to the study of this infrared triangle through the lens of\nsupertranslations here, but the analogous features that can be found in the\ncase of superrotations or for other gauge theories are also motivated at the\nend of our discussion. We conclude with an overview of the implications of the\ninfrared triangle of gravity for the formulation of an approach to quantum\ngravity through holography, as well as a brief discussion of its potential in\ntackling the black hole information paradox.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 08:19:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kervyn","Xavier",""]]}
{"id":"2308.12980","submitter":"Soon-Tae Hong","authors":"Soon-Tae Hong","title":"Phenomenologies in hypersphere soliton and stringy photon models","comments":"13 pages. arXiv admin note: text overlap with arXiv:2111.11852","journal-ref":"Universe 9, 378 (2023)","doi":"10.3390/universe9090378","report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the Dirac quantization in the first class formalism to\ninvestigate the hypersphere soliton model (HSM) defined on the $S^{3}$\nhypersphere. To do this, we construct the first class Hamiltonian possessing\nthe Weyl ordering correction. In the HSM, we evaluate the baryon physical\nquantities such as the baryon masses, magnetic moments, axial coupling constant\nand charge radii, most predicted values of which are in good agreement with the\ncorresponding experimental data. Moreover, shuffling the baryon and transition\nmagnetic moments, we find the model independent sum rules. In the HSM we also\nevaluate the baryon intrinsic frequencies such as $\\omega_{N}=0.87\\times\n10^{23}~{\\rm sec}^{-1}$ and $\\omega_{\\Delta}=1.74\\times 10^{23}~{\\rm sec}^{-1}$\nof the nucleon and delta baryon, respectively, to yield the identity\n$\\omega_{\\Delta}=2\\omega_{N}$. Next, making use of the Nambu-Goto string action\nand its extended rotating bosonic string theory, we formulate the stringy\nphoton model to obtain the energy of the string configuration, which consists\nof the rotational and vibrational energies of the open string. Exploiting this\ntotal string energy we evaluate the photon intrinsic frequency\n$\\omega_{\\gamma}=9.00\\times 10^{23}~{\\rm sec}^{-1}$ which is comparable to the\ncorresponding baryon intrinsic frequencies. We also predict the photon size\n$\\langle r^{2}\\rangle^{1/2}(\\rm photon)=0.17~{\\rm fm}$ which is approximately\n21\\% of the proton magnetic charge radius.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 13:35:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hong","Soon-Tae",""]]}
{"id":"2308.12981","submitter":"Azanzi Jiomekong","authors":"Azanzi Jiomekong and Sanju Tiwari","title":"An approach based on Open Research Knowledge Graph for Knowledge\n  Acquisition from scientific papers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  A scientific paper can be divided into two major constructs which are\nMetadata and Full-body text. Metadata provides a brief overview of the paper\nwhile the Full-body text contains key-insights that can be valuable to fellow\nresearchers. To retrieve metadata and key-insights from scientific papers,\nknowledge acquisition is a central activity. It consists of gathering,\nanalyzing and organizing knowledge embedded in scientific papers in such a way\nthat it can be used and reused whenever needed. Given the wealth of scientific\nliterature, manual knowledge acquisition is a cumbersome task. Thus,\ncomputer-assisted and (semi-)automatic strategies are generally adopted. Our\npurpose in this research was two fold: curate Open Research Knowledge Graph\n(ORKG) with papers related to ontology learning and define an approach using\nORKG as a computer-assisted tool to organize key-insights extracted from\nresearch papers. This approach was used to document the \"epidemiological\nsurveillance systems design and implementation\" research problem and to prepare\nthe related work of this paper. It is currently used to document \"food\ninformation engineering\", \"Tabular data to Knowledge Graph Matching\" and\n\"Question Answering\" research problems and \"Neuro-symbolic AI\" domain.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 20:05:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jiomekong","Azanzi",""],["Tiwari","Sanju",""]]}
{"id":"2308.12982","submitter":"Yueyue Zhu","authors":"Yueyue Zhu, Jared Baca, Banafsheh Rekabdar, Reza Rawassizadeh","title":"A Survey of AI Music Generation Tools and Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.HC eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we provide a comprehensive survey of AI music generation tools,\nincluding both research projects and commercialized applications. To conduct\nour analysis, we classified music generation approaches into three categories:\nparameter-based, text-based, and visual-based classes. Our survey highlights\nthe diverse possibilities and functional features of these tools, which cater\nto a wide range of users, from regular listeners to professional musicians. We\nobserved that each tool has its own set of advantages and limitations. As a\nresult, we have compiled a comprehensive list of these factors that should be\nconsidered during the tool selection process. Moreover, our survey offers\ncritical insights into the underlying mechanisms and challenges of AI music\ngeneration.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 00:49:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhu","Yueyue",""],["Baca","Jared",""],["Rekabdar","Banafsheh",""],["Rawassizadeh","Reza",""]]}
{"id":"2308.12983","submitter":"Alvin Tang","authors":"Alvin Tang","title":"Implementation of Formal Semantics and the Potential of Non-Classical\n  Logic Systems for the Enhancement of Access Control Models: A Literature\n  Review","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This literature review discovers an implementation of formal logic systems in\ncyber security by enhancing access control models. We explore the\ncharacteristics of the existing access control theories, their limitations and\nhow classical logic is used therein. We then delve into the possibility of\nutilising non-classical logic systems for improving the models. In particular,\nwe explore how classical logic can be used to describe and prove the\ncorrectness of role-based access control and attribute-based access control\nmodels.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:05:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tang","Alvin",""]]}
{"id":"2308.12984","submitter":"Masakazu Yoshioka","authors":"Masakazu Yoshioka","title":"Green ILC Concept: Scenarios toward 2050 Carbon Neutrality in Japan and\n  ILC","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper describes Japan's scenario for achieving carbon neutrality by 2050\nand the policy that should be adopted by the ILC in Japan in line with that\npolicy. This paper only discusses CO2 emissions during operation, not the\nlifecycle CO2 emissions of the ILC.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:24:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yoshioka","Masakazu",""]]}
{"id":"2308.12985","submitter":"Jiajie Yu","authors":"Jiajie Yu, Pierre-Antoine Laharotte, Yu Han, Ludovic Leclercq","title":"Perimeter Control with Heterogeneous Cordon Signal Behaviors: A\n  Semi-Model Dependent Reinforcement Learning Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Perimeter Control (PC) strategies have been proposed to address urban road\nnetwork control in oversaturated situations by monitoring transfer flows of the\nProtected Network (PN). The uniform metering rate for cordon signals in\nexisting studies ignores the variety of local traffic states at the\nintersection level, which may cause severe local traffic congestion and ruin\nthe network stability. This paper introduces a semi-model dependent Multi-Agent\nReinforcement Learning (MARL) framework to conduct PC with heterogeneous cordon\nsignal behaviors. The proposed strategy integrates the MARL-based signal\ncontrol method with centralized feedback PC policy and is applied to cordon\nsignals of the PN. It operates as a two-stage system, with the feedback PC\nstrategy detecting the overall traffic state within the PN and then\ndistributing local instructions to cordon signals controlled by agents in the\nMARL framework. Each cordon signal acts independently and differently, creating\na slack and distributed PC for the PN. The combination of the model-free and\nmodel-based methods is achieved by reconstructing the action-value function of\nthe local agents with PC feedback reward without violating the integrity of the\nlocal signal control policy learned from the RL training process. Through\nnumerical tests with different demand patterns in a microscopic traffic\nenvironment, the proposed PC strategy (a) is shown robustness, scalability, and\ntransferability, (b) outperforms state-of-the-art model-based PC strategies in\nincreasing network throughput, reducing cordon queue and carbon emission.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:51:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yu","Jiajie",""],["Laharotte","Pierre-Antoine",""],["Han","Yu",""],["Leclercq","Ludovic",""]]}
{"id":"2308.12986","submitter":"Nicholas Read","authors":"Nicholas Read and Sankar Das Sarma","title":"A perspective on anyonic braiding statistics","comments":"A short (two page) comment, submitted to Nature Physics. v2: title\n  change, few changes to text, two additional references","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We comment on the significance of the results in the paper by Nakamura et al\n(2020). The experimental result measures the phase for a repeated elementary\nexchange of two identical quasiparticles, and shows that the quasiparticles are\nanyons. The value of the phase agrees with theoretical predictions. However, in\nterms of the statistics parameter $\\theta$ for a single elementary exchange, it\ndetermines $2\\theta$ modulo $2\\pi$, and hence $\\theta$ only modulo $\\pi$, not\nmodulo $2\\pi$, and so does not fully check the theoretical prediction for the\nbraiding statistics of charge $e/3$ quasiparticles. This is a general\nshortcoming of this particular type of interference measurement of statistics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:52:05 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:16:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Read","Nicholas",""],["Sarma","Sankar Das",""]]}
{"id":"2308.12987","submitter":"Tiago Costa","authors":"Tiago Costa (Max-Planck-Institute for Astrophysics, Garching)","title":"The host dark matter haloes of the first quasars","comments":"13 pages, submitted to MNRAS (July 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  If $z > 6$ quasars reside in rare, massive haloes, $\\Lambda$CDM cosmology\npredicts they should be surrounded by an anomalously high number of bright\ncompanion galaxies. In this paper, I show that these companion galaxies should\nalso move unusually fast. Using a new suite of cosmological, `zoom-in'\nhydrodynamic simulations, I here present predictions for the velocity\ndistribution of quasar companion galaxies and its variation with quasar host\nhalo mass at $z \\, = \\, 6$. Satellites accelerate as they approach the quasar\nhost galaxy, producing a line-of-sight velocity profile that broadens as the\ndistance to the quasar host galaxy decreases. This increase in velocity\ndispersion is particularly pronounced if the host halo mass is $\\gtrsim 5\n\\times 10^{12} \\, \\rm M_\\odot$. In this case, typical line-of-sight speeds rise\nto $\\approx 500 \\, \\rm km \\, s^{-1}$ at projected radii $\\sim 10 \\, \\rm kpc$.\nFor about $10\\%$ of satellites, they should exceed $800 \\, \\rm km \\, s^{-1}$,\nwith $\\approx 5\\%$ of companions reaching line-of-sight speeds $\\sim 1000 \\,\n\\rm km \\, s^{-1}$. For lower host halo masses $\\approx 5 \\times 10^{11} -\n10^{12} \\, \\rm M_\\odot$, the velocity profile of companion galaxies is\nsignificantly flatter. In this case, typical line-of-sight velocities are\n$\\approx 250 \\, \\rm km \\, s^{-1}$ and do not exceed $\\approx 500 \\, \\rm km \\,\ns^{-1}$. A comparison with existing ALMA, JWST and MUSE line-of-sight velocity\nmeasurements reveals that observed $z > 6$ quasar companions closely follow the\nvelocity distribution expected for a host halo with mass $\\gtrsim 5 \\times\n10^{12} \\, \\rm M_\\odot$, ruling out a light host halo. Finally, through an\nestimate of UV and [OIII] luminosity functions, I show that the velocity\ndistribution more reliably discriminates between halo mass than companion\nnumber counts, which are strongly affected by cosmic variance.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Costa","Tiago","","Max-Planck-Institute for Astrophysics, Garching"]]}
{"id":"2308.12988","submitter":"Nicholas Rodd","authors":"Daniel Carney, Valerie Domcke, Nicholas L. Rodd","title":"Graviton detection and the quantization of gravity","comments":"10+7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":"CERN-TH-2023-155","categories":"hep-th astro-ph.CO gr-qc hep-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit a question asked by Dyson: \"Is a graviton detectable?\" We\ndemonstrate that in both Dyson's original sense and in a more modern\nmeasurement-theoretic sense, it is possible to construct a detector sensitive\nto single gravitons, and in fact a variety of existing and near-term\ngravitational wave detectors can achieve this. However, while such a signal\nwould be consistent with the quantization of the gravitational field, we draw\non results from quantum optics to show how the same signal could just as well\nbe explained via classical gravitational waves. We outline the kind of\nmeasurements that would be needed to demonstrate quantization of gravitational\nradiation and explain why these are substantially more difficult than simply\ncounting graviton clicks or observing gravitational noise in an interferometer,\nand likely impossible to perform in practice.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Carney","Daniel",""],["Domcke","Valerie",""],["Rodd","Nicholas L.",""]]}
{"id":"2308.12989","submitter":"Matteo Puel","authors":"James M. Cline, Matteo Puel, Takashi Toma, Qiu Shi Wang","title":"Phantom fluid cosmology: impact of a phantom hidden sector on\n  cosmological observables","comments":"36 pages, 20 figures","journal-ref":null,"doi":null,"report-no":"KANAZAWA-23-09","categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phantom scalar theories are widely considered in cosmology, but rarely at the\nquantum level, where they give rise to negative-energy ghost particles. These\ncause decay of the vacuum into gravitons and photons, violating observational\ngamma-ray limits unless the ghosts are effective degrees of freedom with a\ncutoff $\\Lambda$ at the few-MeV scale. We update the constraints on this scale,\nfinding that $\\Lambda \\lesssim 19$ MeV. We further explore the possible\ncoupling of ghosts to a light, possibly massless, hidden sector particle, such\nas a sterile neutrino. Vacuum decays can then cause the dark matter density of\nthe universe to grow at late times. The combined phantom plus dark matter fluid\nhas an effective equation of state $w < -1$, and functions as a new source of\ndark energy. We derive constraints from cosmological observables on the rate of\nvacuum decay into such a phantom fluid. We find a mild preference for the ghost\nmodel over the standard cosmological one, and a modest amelioration of the\nHubble and $S_8$ tensions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cline","James M.",""],["Puel","Matteo",""],["Toma","Takashi",""],["Wang","Qiu Shi",""]]}
{"id":"2308.12990","submitter":"Shahar Hod","authors":"Shahar Hod","title":"Analytic study of the Maxwell electromagnetic invariant in spinning and\n  charged Kerr-Newman black-hole spacetimes","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Maxwell invariant plays a fundamental role in the mathematical\ndescription of electromagnetic fields in charged spacetimes. We present a\ndetailed {\\it analytical} study of the physical and mathematical properties of\nthe Maxwell electromagnetic invariant ${\\cal F}_{\\text{KN}}(r,\\theta;M,a,Q)$\nwhich characterizes the Kerr-Newman black-hole spacetime. It is proved that,\nfor all Kerr-Newman black-hole spacetimes, the spin and charge dependent\nminimum value of the Maxwell electromagnetic invariant is attained on the\nequator of the black-hole surface. Interestingly, we reveal the physically\nimportant fact that Kerr-Newman spacetimes are characterized by two critical\nvalues of the dimensionless rotation parameter ${\\hat a}\\equiv a/r_+$, ${\\hat\na}^{-}_{\\text{crit}}=\\sqrt{3-2\\sqrt{2}}$ and ${\\hat a}^{+}_{\\text{crit}}=\n\\sqrt{5-2\\sqrt{5}}$, which mark the boundaries between three qualitatively\ndifferent spatial functional behaviors of the Maxwell electromagnetic\ninvariant: (i) Kerr-Newman black holes in the slow-rotation ${\\hat a}<{\\hat\na}^{-}_{\\text{crit}}$ regime are characterized by negative definite Maxwell\nelectromagnetic invariants that increase monotonically towards spatial\ninfinity, (ii) for black holes in the intermediate spin regime ${\\hat\na}^{-}_{\\text{crit}}\\leq {\\hat a}\\leq{\\hat a}^{+}_{\\text{crit}}$, the positive\nglobal maximum of the Kerr-Newman Maxwell electromagnetic invariant is located\nat the black-hole poles, and (iii) Kerr-Newman black holes in the\nsuper-critical regime ${\\hat a}>{\\hat a}^{+}_{\\text{crit}}$ are characterized\nby a non-monotonic spatial behavior of the Maxwell electromagnetic invariant\nalong the black-hole horizon with a spin and charge dependent global maximum\nwhose polar angular location is characterized by the dimensionless functional\nrelation ${\\hat a}^2\\cdot(\\cos^2\\theta)_{\\text{max}}=5-2\\sqrt{5}$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hod","Shahar",""]]}
{"id":"2308.12991","submitter":"Srisurya Yadavalli","authors":"S. Karthik Yadavalli, V. Ashley Villar, Luca Izzo, Yossef Zenati, Ryan\n  J. Foley, J. Craig Wheeler, Charlotte R. Angus, Dominik B\\'anhidi, Katie\n  Auchettl, Barna Imre B\\'ir\\'o, Attila B\\'odi, Zs\\'ofia Bodola, Thomas de\n  Boer, Kenneth C. Chambers, Ryan Chornock, David A. Coulter, Istv\\'an\n  Cs\\'anyi, Borb\\'ala Cseh, Srujan Dandu, Kyle W. Davis, Connor Braden\n  Dickinson, Diego Farias, Christa Gall, Hua Gao, Wynn V. Jacobson-Galan,\n  Nandita Khetan, Charles D. Kilpatrick, R\\'eka K\\\"onyves-T\\'oth, Levente\n  Kriskovics, Natalie LeBaron, Kayla Loertscher, X. K. Le Saux, Rafaella\n  Margutti, Eugene A. Magnier, Peter McGill, Hao-Yu Miao, Andr\\'as P\\'al,\n  Bor\\'oka H. P\\'al, Yen-Chen Pan, Collin A. Politsch, Conor L. Ransome, Enrico\n  Ramirez-Ruiz, Armin Rest, Sofia Rest, Olivia Robinson, Huei Sears, Jackson\n  Scheer, \\'Ad\\'am S\\'odor, Jonathan Swift, P\\'eter Sz\\'ekely, R\\'obert\n  Szak\\'ats, Tam\\'as Szalai, Kirsty Taggart, Padma Venkatraman, J\\'ozsef\n  Vink\\'o, Grace Yang, Henry Zhou","title":"SN 2022oqm: A Multi-peaked Calcium-rich Transient from a White Dwarf\n  Binary Progenitor System","comments":"33 pages, 17 figures, 5 tables, Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the photometric and spectroscopic evolution of SN 2022oqm, a\nnearby multi-peaked hydrogen- and helium-weak calcium-rich transient (CaRT). SN\n2022oqm was detected 19.9 kpc from its host galaxy, the face-on spiral galaxy\nNGC 5875. Extensive spectroscopic coverage reveals a hot (T >= 40,000 K)\ncontinuum and carbon features observed ~1 day after discovery, SN Ic-like\nphotospheric-phase spectra, and strong forbidden calcium emission starting 38\ndays after discovery. SN 2022oqm has a relatively high peak luminosity (MB =\n-17 mag) for CaRTs, making it an outlier in the population. We determine that\nthree power sources are necessary to explain SN 2022oqm's light curve, with\neach power source corresponding to a distinct peak in its light curve. The\nfirst peak of the light curve is powered by an expanding blackbody with a power\nlaw luminosity, consistent with shock cooling by circumstellar material.\nSubsequent peaks are powered by a double radioactive decay model, consistent\nwith two separate sources of photons diffusing through an optically thick\nejecta. From the optical light curve, we derive an ejecta mass and 56Ni mass of\n~0.89 solar masses and ~0.09 solar masses, respectively. Detailed spectroscopic\nmodeling reveals ejecta that is dominated by intermediate-mass elements, with\nsigns that Fe-peak elements have been well-mixed. We discuss several physical\norigins for SN 2022oqm and favor a white dwarf progenitor model. The inferred\nejecta mass points to a surprisingly massive white dwarf, challenging models of\nCaRT progenitors.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:02 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:24:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yadavalli","S. Karthik",""],["Villar","V. Ashley",""],["Izzo","Luca",""],["Zenati","Yossef",""],["Foley","Ryan J.",""],["Wheeler","J. Craig",""],["Angus","Charlotte R.",""],["B\u00e1nhidi","Dominik",""],["Auchettl","Katie",""],["B\u00edr\u00f3","Barna Imre",""],["B\u00f3di","Attila",""],["Bodola","Zs\u00f3fia",""],["de Boer","Thomas",""],["Chambers","Kenneth C.",""],["Chornock","Ryan",""],["Coulter","David A.",""],["Cs\u00e1nyi","Istv\u00e1n",""],["Cseh","Borb\u00e1la",""],["Dandu","Srujan",""],["Davis","Kyle W.",""],["Dickinson","Connor Braden",""],["Farias","Diego",""],["Gall","Christa",""],["Gao","Hua",""],["Jacobson-Galan","Wynn V.",""],["Khetan","Nandita",""],["Kilpatrick","Charles D.",""],["K\u00f6nyves-T\u00f3th","R\u00e9ka",""],["Kriskovics","Levente",""],["LeBaron","Natalie",""],["Loertscher","Kayla",""],["Saux","X. K. Le",""],["Margutti","Rafaella",""],["Magnier","Eugene A.",""],["McGill","Peter",""],["Miao","Hao-Yu",""],["P\u00e1l","Andr\u00e1s",""],["P\u00e1l","Bor\u00f3ka H.",""],["Pan","Yen-Chen",""],["Politsch","Collin A.",""],["Ransome","Conor L.",""],["Ramirez-Ruiz","Enrico",""],["Rest","Armin",""],["Rest","Sofia",""],["Robinson","Olivia",""],["Sears","Huei",""],["Scheer","Jackson",""],["S\u00f3dor","\u00c1d\u00e1m",""],["Swift","Jonathan",""],["Sz\u00e9kely","P\u00e9ter",""],["Szak\u00e1ts","R\u00f3bert",""],["Szalai","Tam\u00e1s",""],["Taggart","Kirsty",""],["Venkatraman","Padma",""],["Vink\u00f3","J\u00f3zsef",""],["Yang","Grace",""],["Zhou","Henry",""]]}
{"id":"2308.12992","submitter":"Wenzer Qin","authors":"Wenzer Qin, Julian B. Munoz, Hongwan Liu, Tracy R. Slatyer","title":"Birth of the first stars amidst decaying and annihilating dark matter","comments":"32 pages, 13 figures, 3 tables","journal-ref":null,"doi":null,"report-no":"MIT-CTP/5596","categories":"astro-ph.CO astro-ph.GA hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The first stars are expected to form through molecular-hydrogen (H$_2$)\ncooling, a channel that is especially sensitive to the thermal and ionization\nstate of gas, and can thus act as a probe of exotic energy injection from\ndecaying or annihilating dark matter (DM). Here, we use a toy halo model to\nstudy the impact of DM-sourced energy injection on the H$_2$ content of the\nfirst galaxies, and thus estimate the threshold mass required for a halo to\nform stars at high redshifts. We find that currently allowed DM models can\nsignificantly change this threshold, producing both positive and negative\nfeedback. In some scenarios, the extra heating of the gas raises the halo mass\nrequired for collapse, whereas in others, energy injection lowers the threshold\nby increasing the free-electron fraction and catalyzing H$_2$ formation. The\ndirection of the effect can be redshift-dependent. We also bracket the\nuncertainties from self-shielding of halos from Lyman-Werner radiation. Hence,\nexotic energy injection can both delay and accelerate the onset of star\nformation; we show how this can impact the timing of 21cm signals at cosmic\ndawn. We encourage detailed simulation follow-ups in the most promising regions\nof parameter space identified in this work.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Qin","Wenzer",""],["Munoz","Julian B.",""],["Liu","Hongwan",""],["Slatyer","Tracy R.",""]]}
{"id":"2308.12993","submitter":"Elisabeta Lusso Dr","authors":"Elisabeta Lusso, Emanuele Nardini, Michele Fumagalli, Matteo Fossati,\n  Fabrizio Arrigoni Battaia, Mitchell Revalski, Marc Rafelski, Valentina\n  D'Odorico, Celine Peroux, Stefano Cristiani, Pratika Dayal, Francesco Haardt,\n  Emma K. Lofthouse","title":"The MUSE Ultra Deep Field (MUDF). IV. A pair of X-ray weak quasars at\n  the heart of two extended Ly{\\alpha} nebulae","comments":"15 pages, 9 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the results obtained from follow-up observations of the MUSE Ultra\nDeep Field (MUDF) at X-ray energies with XMM-Newton. The MUDF is centred on a\nunique field with two bright, physically associated quasars at $z\\simeq3.23$,\nseparated by $\\sim$500 kpc in projection. Both quasars are embedded within\nextended Ly$\\alpha$ nebulae ($\\gtrsim 100~\\rm kpc$ at a surface brightness flux\nlevel of $\\approx 6\\times 10^{-19} \\rm erg~s^{-1}~cm^{-2}~arcsec^{-2}$), whose\nelongated morphology is suggestive of an extended filament connecting the\nquasar haloes. The new X-ray observations presented here allow us to\ncharacterise the physical properties (e.g. X-ray slope, luminosities, gas\ncolumn densities) in the innermost region of the MUDF quasars. We find that\nboth quasars are X-ray underluminous compared to objects at similar ultraviolet\nluminosities. Based on our X-ray spectral analysis, absorbing columns of\n$N_H(z)\\gtrsim$ 10$^{23}$ cm$^{-2}$ appear unlikely, therefore such a weakness\nis possibly intrinsic. When also including literature data, we do not observe\nany detectable trend between the area of the nebulae and nuclear luminosities\nat both the rest-frame 2 keV and 2500 $\\rm \\mathring{A}$. The area is also not\ncorrelated with the X-ray photon index nor with the integrated band flux in the\nhard band (2$-$10 keV). We also do not find any trend between the extended\nLy$\\alpha$ emission of the nebulae and the nuclear X-ray luminosity. Finally,\nthe properties of the MUDF quasars' nebulae are consistent with the observed\nrelation between the Ly$\\alpha$ integrated luminosity of the nebulae and their\narea. Our results suggest that the quasar ionization power is not a strong\ndriver of the morphology and size of the nebulae.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lusso","Elisabeta",""],["Nardini","Emanuele",""],["Fumagalli","Michele",""],["Fossati","Matteo",""],["Battaia","Fabrizio Arrigoni",""],["Revalski","Mitchell",""],["Rafelski","Marc",""],["D'Odorico","Valentina",""],["Peroux","Celine",""],["Cristiani","Stefano",""],["Dayal","Pratika",""],["Haardt","Francesco",""],["Lofthouse","Emma K.",""]]}
{"id":"2308.12994","submitter":"Achilleas Passias","authors":"Achilleas Passias","title":"Superstrings on Penrose limits of AdS$_7$ solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the Penrose limit of AdS$_7$ solutions of massive Type IIA\nsupergravity. The resulting pp-wave geometry is supported by RR and NSNS\nfields. We quantize the Green--Schwarz superstring on the obtained pp-wave\nbackground, in the light-cone gauge.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Passias","Achilleas",""]]}
{"id":"2308.12995","submitter":"Matthew Lapa","authors":"Matthew F. Lapa, Michael Levin","title":"Stability of topological superconducting qubits with number conservation","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study of topological superconductivity is largely based on the analysis\nof simple mean-field models that do not conserve particle number. A major open\nquestion in the field is whether the remarkable properties of these mean-field\nmodels persist in more realistic models with a conserved total particle number\nand long-range interactions. For applications to quantum computation, two key\nproperties that one would like to verify in more realistic models are (i) the\nexistence of a set of low-energy states (the qubit states) that are separated\nfrom the rest of the spectrum by a finite energy gap, and (ii) an exponentially\nsmall (in system size) bound on the splitting of the energies of the qubit\nstates. It is well known that these properties hold for mean-field models, but\nso far only property (i) has been verified in a number-conserving model. In\nthis work we fill this gap by rigorously establishing both properties (i) and\n(ii) for a number-conserving toy model of two topological superconducting wires\ncoupled to a single bulk superconductor. Our result holds in a broad region of\nthe parameter space of this model, suggesting that properties (i) and (ii) are\nrobust properties of number-conserving models, and not just artifacts of the\nmean-field approximation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lapa","Matthew F.",""],["Levin","Michael",""]]}
{"id":"2308.12996","submitter":"Pragna Das","authors":"Pragna Das, Sebastian W\\\"uster, Auditya Sharma","title":"The disordered Dicke model","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and study the disordered Dicke model in which the spin-boson\ncouplings are drawn from a random distribution with some finite width.\nRegarding the quantum phase transition we show that when the standard deviation\n$\\sigma$ of the coupling strength gradually increases, the critical value of\nthe mean coupling strength $\\mu$ gradually decreases and after a certain\n$\\sigma$ there is no quantum phase transition at all; the system always lies in\nthe super-radiant phase. We derive an approximate expression for the quantum\nphase transition in the presence of disorder in terms of $\\mu$ and $\\sigma$,\nwhich we numerically verify. Studying the thermal phase transition in the\ndisordered Dicke model, we obtain an analytical expression for the critical\ntemperature in terms of the mean and standard deviation of the coupling\nstrength. We observe that even when the mean of the coupling strength is zero,\nthere is a finite temperature transition if the standard deviation of the\ncoupling is sufficiently high. Disordered couplings in the Dicke model will\nexist in quantum dot superlattices, and we also sketch how they can be\nengineered and controlled with ultracold atoms or molecules in a cavity.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Das","Pragna",""],["W\u00fcster","Sebastian",""],["Sharma","Auditya",""]]}
{"id":"2308.12997","submitter":"Conor Omand","authors":"Conor M. B. Omand and Nikhil Sarin","title":"A Generalized Semi-Analytic Model for Magnetar-Driven Supernovae","comments":"16 pages, 12 pages including appendices. Submitted to MNRAS. Comments\n  welcome. Model available in public code Redback:\n  https://github.com/nikhil-sarin/redback","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several types of energetic supernovae, such as superluminous supernovae\n(SLSNe) and broad-line Ic supernovae (Ic-BL SNe), could be powered by the\nspin-down of a rapidly rotating magnetar. Currently, most models used to infer\nthe parameters for potential magnetar-driven supernovae make several unsuitable\nassumptions that likely bias the estimated parameters. In this work, we present\na new model for magnetar-driven supernovae that relaxes several of these\nassumptions and an inference workflow that enables accurate estimation of\nparameters from lightcurves of magnetar-driven supernovae. In particular, in\nthis model, we include the dynamical evolution of the ejecta, coupling it to\nthe energy injected by the magnetar itself while also allowing for non-dipole\nspin down. We show that the model can reproduce SLSN and Ic-BL SN light curves\nconsistent with the parameter space from computationally expensive numerical\nmodels. We also show the results of parameter inference on four well-known\nexample supernovae, demonstrating the model's effectiveness at capturing the\nconsiderable diversity in magnetar-driven supernova lightcurves. The model fits\neach light curve well and recovers parameters broadly consistent with previous\nworks. This model will allow us to explore the full diversity of\nmagnetar-driven supernovae under one theoretical framework, more accurately\ncharacterize these supernovae from only photometric data, and make more\naccurate predictions of future multiwavelength emission to test the\nmagnetar-driven scenario better.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Omand","Conor M. B.",""],["Sarin","Nikhil",""]]}
{"id":"2308.12998","submitter":"Alessandro Santini","authors":"Alessandro Santini, Davide Gerosa, Roberto Cotesta, Emanuele Berti","title":"Black-hole mergers in disk-like environments could explain the observed\n  $q - \\chi_\\mathrm{eff}$ correlation","comments":"9 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO astro-ph.GA gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current gravitational-wave data from stellar-mass black-hole binary mergers\nsuggest a correlation between the binary mass ratio $q$ and the effective spin\n$\\chi_\\mathrm{eff}$: more unequal-mass binaries consistently show larger and\npositive values of the effective spin. Multiple generations of black-hole\nmergers in dense astrophysical environments may provide a way to form\nunequal-mass systems, but they cannot explain the observed correlation on their\nown. We show that the symmetry of the astrophysical environment is a crucial\nfeature to shed light on this otherwise puzzling piece of observational\nevidence. We present a toy model that reproduces, at least qualitatively, the\nobserved correlation. The model relies on axisymmetric, disk-like environments\nwhere binaries participating in hierarchical mergers share a preferential\ndirection. Migration traps in AGN disks are a prime candidate for this setup,\nhinting at the exciting possibility of constraining their occurrence with\ngravitational-wave data.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Santini","Alessandro",""],["Gerosa","Davide",""],["Cotesta","Roberto",""],["Berti","Emanuele",""]]}
{"id":"2308.12999","submitter":"Theodore Brennan","authors":"T. Daniel Brennan","title":"Anomaly Enforced Gaplessness and Symmetry Fractionalization for $Spin_G$\n  Symmetries","comments":"17 pages plus references","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.str-el hep-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Symmetries and their anomalies give strong constraints on renormalization\ngroup (RG) flows of quantum field theories. Recently, the identification of a\ntheory's global symmetries with its topological sector has provided additional\nconstraints on RG flows to symmetry preserving gapped phases due to\nmathematical results in category and topological quantum field theory. In this\npaper, we derive constraints on RG flows from $\\mathbb{Z}_2$-valued pure- and\nmixed-gravitational anomalies that can only be activated on non-spin manifolds.\nWe show that such anomalies cannot be matched by a unitary, symmetry preserving\ngapped phase without symmetry fractionalization. In particular, we discuss\nexamples that commonly arise in $4d$ gauge theories with fermions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:00:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Brennan","T. Daniel",""]]}
{"id":"2308.13000","submitter":"Namwoo Kang","authors":"Minyoung Jwa, Jihoon Kim, Seungyeon Shin, Ah-hyeon Jin, Dongju Shin,\n  Namwoo Kang","title":"Performance Comparison of Design Optimization and Deep Learning-based\n  Inverse Design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Surrogate model-based optimization has been increasingly used in the field of\nengineering design. It involves creating a surrogate model with objective\nfunctions or constraints based on the data obtained from simulations or\nreal-world experiments, and then finding the optimal solution from the model\nusing numerical optimization methods. Recent advancements in deep\nlearning-based inverse design methods have made it possible to generate\nreal-time optimal solutions for engineering design problems, eliminating the\nrequirement for iterative optimization processes. Nevertheless, no\ncomprehensive study has yet closely examined the specific advantages and\ndisadvantages of this novel approach compared to the traditional design\noptimization method. The objective of this paper is to compare the performance\nof traditional design optimization methods with deep learning-based inverse\ndesign methods by employing benchmark problems across various scenarios. Based\non the findings of this study, we provide guidelines that can be taken into\naccount for the future utilization of deep learning-based inverse design. It is\nanticipated that these guidelines will enhance the practical applicability of\nthis approach to real engineering design problems.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:04:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jwa","Minyoung",""],["Kim","Jihoon",""],["Shin","Seungyeon",""],["Jin","Ah-hyeon",""],["Shin","Dongju",""],["Kang","Namwoo",""]]}
{"id":"2308.13001","submitter":"Kisong Lee","authors":"Kanghyun Heo, Gitae Park, and Kisong Lee","title":"On Correcting Errors in Existing Mathematical Approaches for UAV\n  Trajectory Design Considering No-Fly-Zones","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the fact that current mathematical methods for the trajectory\ndesign of an unmanned aerial vehicle (UAV) considering no-fly-zones (NFZs)\ncannot perfectly avoid NFZs throughout the entire continuous trajectory, this\nstudy introduces a new constraint that ensures the complete avoidance of NFZs.\nMoreover, we provide mathematical proof demonstrating that a UAV operating\nwithin the proposed constraints will never violate NFZs. Under the proposed\nconstraint on NFZs, we aim to optimize the scheduling, transmit power, length\nof the time slot, and the trajectory of the UAV to maximize the minimum\nthroughput among ground nodes without violating NFZs. To find the optimal UAV\nstrategy from the non-convex optimization problem formulated here, we use\nvarious optimization techniques, in this case quadratic transform, successive\nconvex approximation, and the block coordinate descent algorithm. Simulation\nresults confirm that the proposed constraint prevents NFZs from being violated\nover the entire trajectory in any scenario. Furthermore, the proposed scheme\nshows significantly higher throughput than the baseline scheme using the\ntraditional NFZ constraint by achieving a zero outage probability due to NFZ\nviolations.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 02:18:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Heo","Kanghyun",""],["Park","Gitae",""],["Lee","Kisong",""]]}
{"id":"2308.13002","submitter":"Qing Lyu","authors":"Qing Lyu, Josh Tan, Megan E. Lipford, Chuang Niu, Micheal E. Zapadka,\n  Christopher M. Lack, Jonathan D. Clemente, Christopher T. Whitlow, Ge Wang","title":"Head-Neck Dual-energy CT Contrast Media Reduction Using Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Iodinated contrast media is essential for dual-energy computed tomography\n(DECT) angiography. Previous studies show that iodinated contrast media may\ncause side effects, and the interruption of the supply chain in 2022 led to a\nsevere contrast media shortage in the US. Both factors justify the necessity of\ncontrast media reduction in relevant clinical applications. In this study, we\npropose a diffusion model-based deep learning framework to address this\nchallenge. First, we simulate different levels of low contrast dosage DECT\nscans from the standard normal contrast dosage DECT scans using material\ndecomposition. Conditional denoising diffusion probabilistic models are then\ntrained to enhance the contrast media and create contrast-enhanced images. Our\nresults demonstrate that the proposed methods can generate high-quality\ncontrast-enhanced results even for images obtained with as low as 12.5% of the\nnormal contrast dosage. Furthermore, our method outperforms selected competing\nmethods in a human reader study.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:03:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lyu","Qing",""],["Tan","Josh",""],["Lipford","Megan E.",""],["Niu","Chuang",""],["Zapadka","Micheal E.",""],["Lack","Christopher M.",""],["Clemente","Jonathan D.",""],["Whitlow","Christopher T.",""],["Wang","Ge",""]]}
{"id":"2308.13003","submitter":"Teppei Kitahara","authors":"Teppei Kitahara, Kohsaku Tobioka","title":"MeV Sterile Neutrino in light of the Cabibbo-Angle Anomaly","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"KEK-TH-2544","categories":"hep-ph hep-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A modified neutrino sector could imprint a signature on precision\nmeasurements of the quark sector because many such measurements rely on the\nsemi-leptonic decays of the charged currents. Currently, global fits of the\ndeterminations of the Cabibbo-Kobayashi-Maskawa (CKM) matrix elements point to\na $3\\sigma$-level deficit in the first-row CKM unitarity test, commonly\nreferred to as the Cabibbo-angle anomaly. We find that a MeV sterile neutrino\nthat mixes with the electron-type neutrino increases the extracted $|V_{ud}|$,\naccommodating the Cabibbo-angle anomaly. This MeV sterile neutrino affects the\nsuperallowed nuclear $\\beta$ decays and neutron decay, but it barely modifies\nthe other measurements of the CKM elements. While various constraints may apply\nto such a sterile neutrino, we present viable scenarios within the inverse\nseesaw models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:07:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kitahara","Teppei",""],["Tobioka","Kohsaku",""]]}
{"id":"2308.13004","submitter":"Mert \\c{C}\\\"okelek","authors":"Mert Cokelek, Nevrez Imamoglu, Cagri Ozcinar, Erkut Erdem, Aykut Erdem","title":"Spherical Vision Transformer for 360-degree Video Saliency Prediction","comments":"12 pages, 4 figures, accepted to BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growing interest in omnidirectional videos (ODVs) that capture the full\nfield-of-view (FOV) has gained 360-degree saliency prediction importance in\ncomputer vision. However, predicting where humans look in 360-degree scenes\npresents unique challenges, including spherical distortion, high resolution,\nand limited labelled data. We propose a novel vision-transformer-based model\nfor omnidirectional videos named SalViT360 that leverages tangent image\nrepresentations. We introduce a spherical geometry-aware spatiotemporal\nself-attention mechanism that is capable of effective omnidirectional video\nunderstanding. Furthermore, we present a consistency-based unsupervised\nregularization term for projection-based 360-degree dense-prediction models to\nreduce artefacts in the predictions that occur after inverse projection. Our\napproach is the first to employ tangent images for omnidirectional saliency\nprediction, and our experimental results on three ODV saliency datasets\ndemonstrate its effectiveness compared to the state-of-the-art.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:07:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cokelek","Mert",""],["Imamoglu","Nevrez",""],["Ozcinar","Cagri",""],["Erdem","Erkut",""],["Erdem","Aykut",""]]}
{"id":"2308.13005","submitter":"Steven Thomson","authors":"S. J. Thomson and J. Eisert","title":"Unraveling long-time quantum dynamics using flow equations","comments":"7+8 pages; 5+4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The study of many-body quantum dynamics in strongly-correlated systems is\nextremely challenging. To date few numerical methods exist which are capable of\nsimulating the non-equilibrium dynamics of two-dimensional quantum systems, in\npart reflecting complexity theoretic obstructions. In this work, we present a\nnew technique able to overcome this obstacle, by combining continuous unitary\nflow techniques with the newly developed method of scrambling transforms. We\novercome the prejudice that approximately diagonalizing the Hamiltonian cannot\nlead to reliable predictions for relatively long times. To the contrary, we\nshow that the method works well in both localized and delocalized phases, and\nmakes reliable predictions for a number of quantities including\ninfinite-temperature autocorrelation functions. We complement our findings with\nrigorous incremental bounds on the truncation error. This approach shows that\nin practice, the exploration of intermediate-scale time evolution may be more\nfeasible than is commonly assumed, challenging near-term quantum simulators.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:10:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Thomson","S. J.",""],["Eisert","J.",""]]}
{"id":"2308.13006","submitter":"Yuxun Guo","authors":"Yuxun Guo, Xiangdong Ji and Feng Yuan","title":"Proton's gluon GPDs at large skewness and gravitational form factors\n  from near threshold heavy quarkonium photo-production","comments":"16 pages, nine figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We study the exclusive near-threshold photo-production of heavy quarkonium in\nthe framework of the generalized parton distribution (GPD) factorization,\ntaking the $J/\\psi$ production as an example. Due to the threshold kinematics,\nthe Compton-like amplitudes are related to gluon GPDs at large skewness $\\xi$,\ndistinct from the common kinematics in asymptotic high energy where the\nskewness is typically small. We discuss the nature of large-$\\xi$ expansion of\nthese amplitudes in terms of the moments of gluon GPDs in the large-$\\xi$\nlimit. Based on that, we propose several ways to extract the first few moments\nof the gluon GPDs from these amplitudes, with the leading ones corresponding to\nthe gluonic gravitational or energy-momentum tensor form factors (GFFs). We\napply these methods to analyze the recent near-threshold $J/\\psi$ production\nmeasurements by the $J/\\psi$ 007 experiment and GlueX collaboration, and find\nthat the $\\xi$-scaling of the measured differential cross sections is\nconsistent with the asymptotic behavior. However, the current data are not\naccurate enough yet for a complete determination of the gluonic GFFs, and\ntherefore we consider some prospects for better extractions in the future.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:12:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Guo","Yuxun",""],["Ji","Xiangdong",""],["Yuan","Feng",""]]}
{"id":"2308.13007","submitter":"Wenbin Wang","authors":"Wenbin Wang, Yang Song, Sanjay Jha","title":"Generalizable Zero-Shot Speaker Adaptive Speech Synthesis with\n  Disentangled Representations","comments":"5 pages, 3 figures. Accepted by Interspeech 2023, Oral","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While most research into speech synthesis has focused on synthesizing\nhigh-quality speech for in-dataset speakers, an equally essential yet unsolved\nproblem is synthesizing speech for unseen speakers who are out-of-dataset with\nlimited reference data, i.e., speaker adaptive speech synthesis. Many studies\nhave proposed zero-shot speaker adaptive text-to-speech and voice conversion\napproaches aimed at this task. However, most current approaches suffer from the\ndegradation of naturalness and speaker similarity when synthesizing speech for\nunseen speakers (i.e., speakers not in the training dataset) due to the poor\ngeneralizability of the model in out-of-distribution data. To address this\nproblem, we propose GZS-TV, a generalizable zero-shot speaker adaptive\ntext-to-speech and voice conversion model. GZS-TV introduces disentangled\nrepresentation learning for both speaker embedding extraction and timbre\ntransformation to improve model generalization and leverages the representation\nlearning capability of the variational autoencoder to enhance the speaker\nencoder. Our experiments demonstrate that GZS-TV reduces performance\ndegradation on unseen speakers and outperforms all baseline models in multiple\ndatasets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:13:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Wenbin",""],["Song","Yang",""],["Jha","Sanjay",""]]}
{"id":"2308.13008","submitter":"Noah Riggenbach","authors":"Micah Darrell and Noah Riggenbach","title":"$\\mathrm{TR}$ of quasiregular semiperfect rings is even","comments":"14 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.KT math.AT math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that $\\mathrm{TR}_{2i+1}(S)=0$ for all $i\\in \\mathbb{N}$ and all $S$\nquasiregular semiperfect.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:15:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Darrell","Micah",""],["Riggenbach","Noah",""]]}
{"id":"2308.13009","submitter":"Kaarthik Sundar","authors":"Sai Krishna Kanth Hari and Kaarthik Sundar and Shriram Srinivasan and\n  Russell Bent","title":"Relaxations of the Steady Optimal Gas Flow Problem for a Non-Ideal Gas","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Natural gas ranks second in consumption among primary energy sources in the\nUnited States. The majority of production sites are in remote locations, hence\nnatural gas needs to be transported through a pipeline network equipped with a\nvariety of physical components such as compressors, valves, etc. Thus, from the\npoint of view of both economics and reliability, it is desirable to achieve\noptimal transportation of natural gas using these pipeline networks. The\nphysics that governs the flow of natural gas through various components in a\npipeline network is governed by nonlinear and non-convex equality and\ninequality constraints and the most general steady-flow operations problem\ntakes the form of a Mixed Integer Nonlinear Program. In this paper, we consider\none example of steady-flow operations -- the Optimal Gas Flow (OGF) problem for\na natural gas pipeline network that minimizes the production cost subject to\nthe physics of steady-flow of natural gas. The ability to quickly determine\nglobal optimal solution and a lower bound to the objective value of the OGF for\ndifferent demand profiles plays a key role in efficient day-to-day operations.\nOne strategy to accomplish this relies on tight relaxations to the nonlinear\nconstraints of the OGF. Currently, many nonlinear constraints that arise due to\nmodeling the non-ideal equation of state either do not have relaxations or have\nrelaxations that scale poorly for realistic network sizes. In this work, we\ncombine recent advancements in the development of polyhedral relaxations for\nunivariate functions to obtain tight relaxations that can be solved within a\nfew seconds on a standard laptop. We demonstrate the quality of these\nrelaxations through extensive numerical experiments on very large scale test\nnetworks available in the literature and find that the proposed relaxation is\nable to prove optimality in 92% of the instances.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:22:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hari","Sai Krishna Kanth",""],["Sundar","Kaarthik",""],["Srinivasan","Shriram",""],["Bent","Russell",""]]}
{"id":"2308.13010","submitter":"Ruiyuan Chen","authors":"Ruiyuan Chen, Antoine Poulin, Ran Tao, and Anush Tserunyan","title":"Tree-like graphings, wallings, and median graphings of equivalence\n  relations","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CO math.DS math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove several results showing that every locally finite Borel graph whose\nlarge-scale geometry is \"tree-like\" induces a treeable equivalence relation. In\nparticular, our hypotheses hold if each component of the original graph either\nhas bounded tree-width or is quasi-isometric to a tree. In the latter case, we\nmoreover show that there exists a Borel quasi-isometry to a Borel forest, under\nthe additional assumption of (componentwise) bounded degree. We also extend\nthese results on quasi-treeings to Borel proper metric spaces. In fact, our\nmost general result shows treeability of countable Borel equivalence relations\nequipped with an abstract wallspace structure on each class obeying some local\nfiniteness conditions, which we call a proper walling. The proof is based on\nthe Stone duality between proper wallings and median graphs, i.e., CAT(0) cube\ncomplexes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:23:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Ruiyuan",""],["Poulin","Antoine",""],["Tao","Ran",""],["Tserunyan","Anush",""]]}
{"id":"2308.13011","submitter":"Karthik Somayaji N S","authors":"Karthik Somayaji NS, Yu Wang, Malachi Schram, Jan Drgona, Mahantesh\n  Halappanavar, Frank Liu, Peng Li","title":"Extreme Risk Mitigation in Reinforcement Learning using Extreme Value\n  Theory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Risk-sensitive reinforcement learning (RL) has garnered significant attention\nin recent years due to the growing interest in deploying RL agents in\nreal-world scenarios. A critical aspect of risk awareness involves modeling\nhighly rare risk events (rewards) that could potentially lead to catastrophic\noutcomes. These infrequent occurrences present a formidable challenge for\ndata-driven methods aiming to capture such risky events accurately. While\nrisk-aware RL techniques do exist, their level of risk aversion heavily relies\non the precision of the state-action value function estimation when modeling\nthese rare occurrences. Our work proposes to enhance the resilience of RL\nagents when faced with very rare and risky events by focusing on refining the\npredictions of the extreme values predicted by the state-action value function\ndistribution. To achieve this, we formulate the extreme values of the\nstate-action value function distribution as parameterized distributions,\ndrawing inspiration from the principles of extreme value theory (EVT). This\napproach effectively addresses the issue of infrequent occurrence by leveraging\nEVT-based parameterization. Importantly, we theoretically demonstrate the\nadvantages of employing these parameterized distributions in contrast to other\nrisk-averse algorithms. Our evaluations show that the proposed method\noutperforms other risk averse RL algorithms on a diverse range of benchmark\ntasks, each encompassing distinct risk scenarios.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:23:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["NS","Karthik Somayaji",""],["Wang","Yu",""],["Schram","Malachi",""],["Drgona","Jan",""],["Halappanavar","Mahantesh",""],["Liu","Frank",""],["Li","Peng",""]]}
{"id":"2308.13012","submitter":"Ricardo Escobedo PhD","authors":"Ricardo Escobedo, Claudia Moreno, and Rafael Hern\\'andez-Jim\\'enez","title":"Post-Newtonian Gravitational Waves with cosmological constant $\\Lambda$\n  from the Einstein-Hilbert theory","comments":"20 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the Post-Newtonian approach implemented to the Einstein-Hilbert\naction adding the cosmological constant $\\Lambda$ at 1PN order. We consider\nvery small values of $\\Lambda$ to derive the Lagrangian of a two body compact\nsystem at the center of mass frame at 1PN. Furthermore, the phase function\n$\\phi(t)$ is obtained from the balance equation and the two polarizations\n$h_{+}$ and $h_{\\times}$ are also calculated. We observe changes due to\n$\\Lambda$ only at very low frequencies and we notice that it plays the role of\n\"stretch\" the spacetime such that both amplitudes become smaller; however,\ngiven its nearly negligible value, $\\Lambda$ has no relevance at higher\nfrequencies whatsoever.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:24:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Escobedo","Ricardo",""],["Moreno","Claudia",""],["Hern\u00e1ndez-Jim\u00e9nez","Rafael",""]]}
{"id":"2308.13013","submitter":"Shinian Cheng","authors":"Shinian Cheng, Shalin Patil, and Shiwang Cheng","title":"Hydrogen bonding exchange and supramolecular dynamics of monohydroxy\n  alcohols","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This Letter unravels hydrogen bonding dynamics and their relationship with\nsupramolecular relaxations of monohydroxy alcohols (MAs) at intermediate times.\nRheological modulus of MAs exhibit Rouse scaling relaxation of G(t) ~ t^(-1/2)\nswitching to G(t) ~ t^(-1) at time tau_m before their terminal time. Meanwhile,\ndielectric spectroscopy reveals clear signatures of new supramolecular dynamics\nmatching with tau_m from rheology. Interestingly, the characteristic time,\ntau_m, follows an Arrhenius-like temperature dependence over exceptionally wide\ntemperatures and agrees well with the hydrogen bonding exchange time from\nnuclear magnetic resonance measurements. These observations demonstrate the\npresence of collective Rouse-like sub-chain motions and the active\nchain-swapping of MAs at intermediate times. Moreover, detailed theoretical\nanalyses point out explicitly that the hydrogen bonding exchange truncates the\nRouse-type supramolecular dynamics and triggers the chain-swapping processes,\nsupporting a recently proposed living polymer model.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:26:44 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 19:10:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheng","Shinian",""],["Patil","Shalin",""],["Cheng","Shiwang",""]]}
{"id":"2308.13014","submitter":"Miguel E. P. Silva","authors":"Miguel E. P. Silva, Rigina Skeva, Thomas House, Caroline Jay","title":"Tracking the Structure and Sentiment of Vaccination Discussions on\n  Mumsnet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY cs.HC physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vaccination is one of the most impactful healthcare interventions in terms of\nlives saved at a given cost, leading the anti-vaccination movement to be\nidentified as one of the top 10 threats to global health in 2019 by the World\nHealth Organization. This issue increased in importance during the COVID-19\npandemic where, despite good overall adherence to vaccination, specific\ncommunities still showed high rates of refusal. Online social media has been\nidentified as a breeding ground for anti-vaccination discussions. In this work,\nwe study how vaccination discussions are conducted in the discussion forum of\nMumsnet, a United Kingdom based website aimed at parents. By representing\nvaccination discussions as networks of social interactions, we can apply\ntechniques from network analysis to characterize these discussions, namely\nnetwork comparison, a task aimed at quantifying similarities and differences\nbetween networks. Using network comparison based on graphlets -- small\nconnected network subgraphs -- we show how the topological structure\nvaccination discussions on Mumsnet differs over time, in particular before and\nafter COVID-19. We also perform sentiment analysis on the content of the\ndiscussions and show how the sentiment towards vaccinations changes over time.\nOur results highlight an association between differences in network structure\nand changes to sentiment, demonstrating how network comparison can be used as a\ntool to guide and enhance the conclusions from sentiment analysis.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:28:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Silva","Miguel E. P.",""],["Skeva","Rigina",""],["House","Thomas",""],["Jay","Caroline",""]]}
{"id":"2308.13015","submitter":"Xiaoyan Zhou","authors":"Xiaoyan Zhou, Yalong Yang, Francisco Ortega, Anil Ufuk Batmaz,\n  Benjamin Lee","title":"Data-driven Storytelling in Hybrid Immersive Display Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data-driven stories seek to inform and persuade audiences through the use of\ndata visualisations and engaging narratives. These stories have now been highly\noptimised to be viewed on desktop and mobile computers. In contrast, while\nimmersive virtual and augmented reality (VR/AR) technologies have been shown to\nbe more persuasive, no clear standard has yet emerged for such immersive\nstories. With this in mind, we propose that a hybrid data-driven storytelling\napproach can leverage the familiarity of 2D display devices with the\nimmersiveness and presence afforded by VR/AR headsets. In this position paper,\nwe characterise hybrid data-driven stories by describing its design\nopportunities, considerations, and challenges. In particular, we describe how\nboth 2D and 3D display environments can play either complementary or symbiotic\nroles with each other for the purposes of storytelling. We hope that this work\ninspires researchers to investigate how hybrid user interfaces may be used for\nstorytelling.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:28:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhou","Xiaoyan",""],["Yang","Yalong",""],["Ortega","Francisco",""],["Batmaz","Anil Ufuk",""],["Lee","Benjamin",""]]}
{"id":"2308.13016","submitter":"Sergey Surnov Dr.","authors":"Sergey Surnov, Igor Bychkovskiy, Grigory Surnov, Nikolay Surnov","title":"Asynchronous Sensor System for Collecting Detailed Data on the\n  Environment and Resource Consumption in Smart City","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article expands on the ideas presented in arXiv:1910.08759. The article\ndemonstrates that within a unified monitoring system, cities can collect not\nonly detailed resource consumption data but also information on the\nenvironmental conditions under a common set of rules. A method for constructing\nasynchronous sensor monitoring systems for controlled parameters in Smart City\nis proposed. The controlled parameters include: resource consumption in\napartment buildings (electricity, cold and hot water, heat, gas); indoor and\noutdoor air pollution indicators (carbon monoxide, nitrogen oxides,\nhydrocarbons, dust, heavy metals, radiation levels, etc.); meteorological\nparameters (air temperature and humidity, atmospheric pressure, wind speed and\ndirection). In an asynchronous sensor monitoring system, an event occurs when\nthe value of a controlled parameter changes by a specified amount. This enables\nadjusting the granularity of the collected data. More detailed data contains\nmore information and is therefore more valuable. Transitioning from traditional\nsynchronous systems, where the value of a controlled parameter is recorded at\nset time intervals, to asynchronous systems allows for the abandonment of\ncomplex \"smart meters\" and the use of extremely simple and inexpensive sensors.\nStandardizing the data transmission protocol for all types of controlled\nparameters and reducing the cost of the most widespread equipment in the system\n-- sensors -- leads to lower expenses for creating and operating a monitoring\nsystem. Lower costs and increased value of collected data enable the potential\nopening of a new market -- a market for data on resource consumption and\nenvironmental parameters in Smart City, attracting private businesses to this\narea and accelerating the energy transition towards a global economy with zero\ngreenhouse gas emissions.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 09:25:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Surnov","Sergey",""],["Bychkovskiy","Igor",""],["Surnov","Grigory",""],["Surnov","Nikolay",""]]}
{"id":"2308.13017","submitter":"Jens Boos","authors":"Jens Boos","title":"Regular black hole from a confined spin connection in Poincare gauge\n  gravity","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Within the asymptotic safety program, it is possible to construct\nrenormalization group (RG) improved spacetimes by replacing the gravitational\ncoupling $G$ by its running counterpart $G(k)$, and subsequently identifying\nthe RG scale $k$ with a physical distance scale. This procedure has been used\nto construct a regular Schwarzschild geometry, but it fails in the presence of\na cosmological constant. This can only be avoided if the dimensionless\ncosmological constant has a trivial ultraviolet fixed point, but so far no such\nscenario has been encountered in quantum general relativity (with or without\nmatter). In this Letter we provide a possible solution to this problem. In\nPoincare gauge gravity an effective cosmological constant arises naturally, and\nif the non-Abelian Lorentz spin connection is asymptotically free, it generates\na trivial ultraviolet fixed point for this cosmological constant. We thereby\ntentatively propose a nonsingular black hole consistent with the principles of\nasymptotic safety, embedded in Poincare gauge gravity.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:30:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Boos","Jens",""]]}
{"id":"2308.13018","submitter":"Hyungsuk Tak","authors":"Hyungsuk Tak and Xuheng Ding","title":"A Robust Bayesian Meta-Analysis for Estimating the Hubble Constant via\n  Time Delay Cosmography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a Bayesian meta-analysis to infer the current expansion rate of\nthe Universe, called the Hubble constant ($H_0$), via time delay cosmography.\nInputs of the meta-analysis are estimates of two properties for each pair of\ngravitationally lensed images; time delay and Fermat potential difference\nestimates with their standard errors. A meta-analysis can be appealing in\npractice because obtaining each estimate from even a single lens system\ninvolves substantial human efforts, and thus estimates are often separately\nobtained and published. This work focuses on combining these estimates from\nindependent studies to infer $H_0$ in a robust manner. For this purpose, we\nadopt Student's $t$ error for the inputs of the meta-analysis. We investigate\nproperties of the resulting $H_0$ estimate via two simulation studies with\nrealistic imaging data. It turns out that the meta-analysis can infer $H_0$\nwith sub-percent bias and about 1 percent level of coefficient of variation,\neven when 30 percent of inputs are manipulated to be outliers. We also apply\nthe meta-analysis to three gravitationally lensed systems, and estimate $H_0$\nby $75.632 \\pm 6.918$ (km/second/Mpc), which covers a wide range of $H_0$\nestimates obtained under different physical processes. An R package, h0, is\npublicly available for fitting the proposed meta-analysis.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:31:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tak","Hyungsuk",""],["Ding","Xuheng",""]]}
{"id":"2308.13019","submitter":"Muryel Guolo","authors":"Muryel Guolo, Suvi Gezari, Yuhan Yao, Sjoert van Velzen, Erica\n  Hammerstein, S. Bradley Cenko, Yarone M. Tokayer","title":"A systematic analysis of the X-ray emission in optically selected tidal\n  disruption events: observational evidence for the unification of the\n  optically and X-ray selected populations","comments":"38 pages, 23 figures, submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a systematic analysis of the X-ray emission of a sample of 17\noptically selected, X-ray-detected tidal disruption events (TDEs) discovered\nbetween 2014 and 2021. The X-ray light curves show a diverse range of temporal\nbehaviors, with most sources not following the expected power-law decline. The\nX-ray spectra are mostly extremely soft and consistent with thermal emission\nfrom the inner region of an accretion disk that cools as the accretion rate\ndecreases. Three sources show the formation of a hard X-ray corona around 200\ndays after the UV/optical peak. The shape of the spectral energy distribution,\ntraced by the ratio ($L_{\\rm BB}/L_{\\rm X}$) between the UV/optical and X-ray\nluminosities, shows a wide range $L_{\\rm BB}/L_{\\rm X} \\in (0.5, 3000)$ at\nearly-times, and converges to disk-like values $L_{\\rm BB}/L_{\\rm X} \\in (0.5,\n10)$ at late-times. The evolution of the derived physical parameters favors a\ndecrease in the optical depth of a reprocessing layer instead of delayed disk\nformation to explain the late-time X-ray brightening found in several sources.\nWe estimate the fraction of optically discovered TDEs with $L_{\\rm X}\\geq\n10^{42}$ erg s$^{-1}$ to be at least $40\\%$, and find that the X-ray loudness\nis independent of black hole mass. We combine our sample with those from X-ray\nsurveys to construct an X-ray luminosity function, best fitted by a broken\npower-law with a brake at $\\sim 10^{44}$ erg s$^{-1}$. We show that there is no\ndichotomy between optically and X-ray selected TDEs; instead, there is a\ncontinuum of early time $L_{\\rm BB}/L_{\\rm X}$, at least as wide as $L_{\\rm\nBB}/L_{\\rm X} \\in (0.1, 3000)$, with optical/X-ray surveys selecting\npreferentially, but not exclusively, from the higher/lower end of the\ndistribution. Our findings are consistent with an orientation-dependent and\ntime-evolving reprocessing layer, and support viewing-angle unification models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:32:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Guolo","Muryel",""],["Gezari","Suvi",""],["Yao","Yuhan",""],["van Velzen","Sjoert",""],["Hammerstein","Erica",""],["Cenko","S. Bradley",""],["Tokayer","Yarone M.",""]]}
{"id":"2308.13020","submitter":"Juan Castaneda","authors":"Juan Castaneda and Nathan Wiebe","title":"Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States","comments":"59 pages, 3 figures. Pages 45-59 contain appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new approach to learn Hamiltonians through a resource that we\ncall the pseudo-Choi state, which encodes the Hamiltonian in a state using a\nprocedure that is analogous to the Choi-Jamiolkowski isomorphism. We provide an\nefficient method for generating these pseudo-Choi states by querying a time\nevolution unitary of the form $e^{-iHt}$ and its inverse, and show that for a\nHamiltonian with $M$ terms the Hamiltonian coefficients can be estimated via\nclassical shadow tomography within error $\\epsilon$ in the $2$-norm using\n$\\widetilde{O}\\left(\\frac{M}{t^2\\epsilon^2}\\right)$ queries to the state\npreparation protocol, where $t \\le \\frac{1}{2\\left\\lVert H \\right\\rVert}$. We\nfurther show an alternative approach that eschews classical shadow tomography\nin favor of quantum mean estimation that reduces this cost (at the price of\nmany more qubits) to $\\widetilde{O}\\left(\\frac{M}{t\\epsilon}\\right)$.\nAdditionally, we show that in the case where one does not have access to the\nstate preparation protocol, the Hamiltonian can be learned using\n$\\widetilde{O}\\left(\\frac{\\alpha^4M}{\\epsilon^2}\\right)$ copies of the\npseudo-Choi state. The constant $\\alpha$ depends on the norm of the\nHamiltonian, and the scaling in terms of $\\alpha$ can be improved quadratically\nif using pseudo-Choi states of the normalized Hamiltonian. Finally, we show\nthat our learning process is robust to errors in the resource states and to\nerrors in the Hamiltonian class. Specifically, we show that if the true\nHamiltonian contains more terms than we believe are present in the\nreconstruction, then our methods give an indication that there are Hamiltonian\nterms that have not been identified and will still accurately estimate the\nknown terms in the Hamiltonian.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:36:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Castaneda","Juan",""],["Wiebe","Nathan",""]]}
{"id":"2308.13021","submitter":"Kunal Aneja","authors":"Kunal Aneja, Tejaswini Ramkumar Babu, Rachel Chan","title":"Augmenting a Firefighters PPE -- Gas Mask SCBA","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  PPE (Personal Protective Equipment) has allowed firefighters to perform their\neveryday tasks without getting harmed since the mid 1800s. Now, the advancement\nof technology has given rise to the improvements of PPE. PPE can now include\nsensors to detect any number of environmental hazards (chemical, biological,\ntemperature etc.). As the GT class of CS3750, we have decided to create a\nversion of an interface design sensor that will help firefighters in two ways:\nnavigation and communication. In order to augment a firefighter display when\nthey are within a building, we chose to augment their SCBA (self-contained\nbreathing apparatus). The gas mask will include a small screen that displays\nvital information directly towards the firefighter without need of any other\nsupport. We used the Google Glass to display vital information directly towards\nthe eye in a minimalistic manner, while also augmenting that by adding LED\nlights to simulate someone calling their name or other auditory signals.While\nour prototype focuses on two main components of a firefighters search and\nrescue in a building, both of them combine to augment a firefighters display\nwhen searching throughout a building to help improve accuracy, speed and\noverall experience.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:47:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Aneja","Kunal",""],["Babu","Tejaswini Ramkumar",""],["Chan","Rachel",""]]}
{"id":"2308.13022","submitter":"Aditya Devta","authors":"Aditya Devta, Dr. Isabel C. Metz and Prof. Dr. Sophie F. Armanini","title":"Experimental Evaluation of Bird Strikes in Urban Air Mobility","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advanced mobility concepts such as Urban Air Mobility are emerging in full\nswing. In that concept, a safe and efficient aviation transportation system\nwill use highly automated aircraft that will transport passengers or cargo at\nlow altitudes within and between metropolitan regions. To accomplish these\nmissions, new types of aircraft which are sometimes known as air taxis are\nbeing developed. A successful integration of these aircraft into existing\nairspace is complicated and needs to take into account various aspects. One of\nthese is the risk of wildlife strikes which is predicted to be higher in case\nof air taxis. The proposed operational cruising altitude of air taxis is lower\nresulting in higher probability of collision as these are the altitudes where\nbirds typically fly. Additionally, air taxis are smaller in size and have lower\ncertification requirements compared to conventional aircraft. As a result, the\nseverity of damaging bird strikes is higher. To assess the risk and formulate\nsuitable regulations, an extensive analysis is required providing more\nquantitative insight into the bird strike challenge. Therefore, a theoretical\nmodel of bird strike to quantify the impact force by considering different bird\nand aircraft related parameters was developed previously. This paper aims to\nvalidate this theoretical model experimentally. It presents a methodology for\nimplementing an experimental setup, allowing for the theoretical impact force\nmodel to be fully validated. A test matrix containing seven test cases, nine\ntest scenarios and 135 iterations is formulated to conduct the bird strike\nexperiment and the influencing parameters are considered for theoretical model\nverification. The paper closes with the presentation of the experimental\nresults for validating the theoretical model which indicate 92.89 % conformance\nof experimental results with the theoretical model.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:09:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Devta","Aditya",""],["Metz","Dr. Isabel C.",""],["Armanini","Prof. Dr. Sophie F.",""]]}
{"id":"2308.13023","submitter":"Sumun Iyer","authors":"Sumun Iyer","title":"Direct limits of large orbits and the Knaster continuum homeomorphism\n  group","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The main result is that the group $\\textrm{Homeo} (K)$ of homeomorphisms of\nthe universal Knaster continuum contains an open subgroup with a comeager\nconjugacy class. Actually, this open subgroup is the very natural subgroup\nconsisting of degree-one homeomorphisms. We give a general fact about finding\ncomeager orbits in Polish group actions which are approximated densely by\ndirect limits of actions with comeager orbits. The main theorem comes as a\nresult of this fact and some finer analysis of the conjugacy action of the\ngroup $\\textrm{Homeo}_+[0,1]$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:47:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Iyer","Sumun",""]]}
{"id":"2308.13024","submitter":"Alex Kale","authors":"Alex Kale, Ziyang Guo, Xiao Li Qiao, Jeffrey Heer, Jessica Hullman","title":"EVM: Incorporating Model Checking into Exploratory Visual Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Visual analytics (VA) tools support data exploration by helping analysts\nquickly and iteratively generate views of data which reveal interesting\npatterns. However, these tools seldom enable explicit checks of the resulting\ninterpretations of data -- e.g., whether patterns can be accounted for by a\nmodel that implies a particular structure in the relationships between\nvariables. We present EVM, a data exploration tool that enables users to\nexpress and check provisional interpretations of data in the form of\nstatistical models. EVM integrates support for visualization-based model checks\nby rendering distributions of model predictions alongside user-generated views\nof data. In a user study with data scientists practicing in the private and\npublic sector, we evaluate how model checks influence analysts' thinking during\ndata exploration. Our analysis characterizes how participants use model checks\nto scrutinize expectations about data generating process and surfaces further\nopportunities to scaffold model exploration in VA tools.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:49:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kale","Alex",""],["Guo","Ziyang",""],["Qiao","Xiao Li",""],["Heer","Jeffrey",""],["Hullman","Jessica",""]]}
{"id":"2308.13025","submitter":"Yuta Sasahara","authors":"Yuta Sasahara","title":"Inhomogeneity of Isoparametric Hypersurfaces of OT-FKM-type in the\n  Pseudo-Sphere","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study isoparametric hypersurfaces, whose principal curvatures are all\nconstant, in the pseudo-Riemannian space forms. In this paper, we investigate\ntwo topics. Firstly, according to representations of Clifford algebras, we give\na construction of Clifford systems of signature $(m, r)$ for any $(m, r)$\nexplicitly. Secondly, we show that a (connected) isoparametric hypersurface of\nOT-FKM-type whose focal variety is $M_{+}$ in the pseudo-sphere is\ninhomogeneous if the signature $(m, r)$ of its Clifford system on\n$\\mathbb{R}^{2l}_{s}$ satisfies $m\\equiv 0\\pmod{4}$, $r\\equiv 0\\pmod{2}$ and\n$l>m$, showing that each connected component of $M_{+}$ is inhomogeneous.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:49:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sasahara","Yuta",""]]}
{"id":"2308.13026","submitter":"Christopher Boyer","authors":"Christopher B. Boyer and Issa J. Dahabreh and Jon A. Steingrimsson","title":"Assessing model performance for counterfactual predictions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Counterfactual prediction methods are required when a model will be deployed\nin a setting where treatment policies differ from the setting where the model\nwas developed, or when the prediction question is explicitly counterfactual.\nHowever, estimating and evaluating counterfactual prediction models is\nchallenging because one does not observe the full set of potential outcomes for\nall individuals. Here, we discuss how to tailor a model to a counterfactual\nestimand, how to assess the model's performance, and how to perform model and\ntuning parameter selection. We also provide identifiability results for\nmeasures of performance for a potentially misspecified counterfactual\nprediction model based on training and test data from the same (factual) source\npopulation. Last, we illustrate the methods using simulation and apply them to\nthe task of developing a statin-na\\\"{i}ve risk prediction model for\ncardiovascular disease.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:50:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Boyer","Christopher B.",""],["Dahabreh","Issa J.",""],["Steingrimsson","Jon A.",""]]}
{"id":"2308.13027","submitter":"Carlo Bradac Dr","authors":"G. Landry and C. Bradac","title":"Efficient characterization of blinking quantum emitters from scarce data\n  sets via machine learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Single photon emitters are core building blocks of quantum technologies, with\nestablished and emerging applications ranging from quantum computing and\ncommunication to metrology and sensing. Regardless of their nature, quantum\nemitters universally display fluorescence intermittency or photoblinking:\ninteraction with the environment can cause the emitters to undergo quantum\njumps between on and off states that correlate with higher and lower\nphotoemission events, respectively. Understanding and quantifying the mechanism\nand dynamics of photoblinking is important for both fundamental and practical\nreasons. However, the analysis of blinking time traces is often afflicted by\ndata scarcity. Blinking emitters can photo-bleach and cease to fluoresce over\ntime scales that are too short for their photodynamics to be captured by\ntraditional statistical methods. Here, we demonstrate two approaches based on\nmachine learning that directly address this problem. We present a multi-feature\nregression algorithm and a genetic algorithm that allow for the extraction of\nblinking on/off switching rates with >85% accuracy, and with >10x less data and\n>20x higher precision than traditional methods based on statistical inference.\nOur algorithms effectively extend the range of surveyable blinking systems and\ntrapping dynamics to those that would otherwise be considered too short-lived\nto be investigated. They are therefore a powerful tool to help gain a better\nunderstanding of the physical mechanism of photoblinking, with practical\nbenefits for applications based on quantum emitters that rely on either\nmitigating or harnessing the phenomenon.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:51:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Landry","G.",""],["Bradac","C.",""]]}
{"id":"2308.13028","submitter":"Steven Abel","authors":"Steve Abel, Juan Carlos Criado, Michael Spannowsky","title":"Training Neural Networks with Universal Adiabatic Quantum Computing","comments":"14 pages","journal-ref":null,"doi":null,"report-no":"IPPP/23/46, CERN-TH-2023-162","categories":"quant-ph cs.LG hep-ph hep-th physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The training of neural networks (NNs) is a computationally intensive task\nrequiring significant time and resources. This paper presents a novel approach\nto NN training using Adiabatic Quantum Computing (AQC), a paradigm that\nleverages the principles of adiabatic evolution to solve optimisation problems.\nWe propose a universal AQC method that can be implemented on gate quantum\ncomputers, allowing for a broad range of Hamiltonians and thus enabling the\ntraining of expressive neural networks. We apply this approach to various\nneural networks with continuous, discrete, and binary weights. Our results\nindicate that AQC can very efficiently find the global minimum of the loss\nfunction, offering a promising alternative to classical training methods.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:51:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Abel","Steve",""],["Criado","Juan Carlos",""],["Spannowsky","Michael",""]]}
{"id":"2308.13029","submitter":"Tarc\\'isio D\\'eda","authors":"Tarc\\'isio D\\'eda, William Wolf, Scott Dawson","title":"Neural networks in feedback for flow analysis, sensor placement and\n  control","comments":"30 pages, 22 figures, under consideration for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a novel methodology for analysis and control of nonlinear\nfluid systems using neural networks. The approach is demonstrated on four\ndifferent study cases being the Lorenz system, a modified version of the\nKuramoto-Sivashinsky equation, a streamwise-periodic 2D channel flow, and a\nconfined cylinder flow. Neural networks are trained as models to capture the\ncomplex system dynamics and estimate equilibrium points through a Newton\nmethod, enabled by backpropagation. These neural network surrogate models\n(NNSMs) are leveraged to train a second neural network, which is designed to\nact as a stabilizing closed-loop controller. The training process employs a\nrecurrent approach, whereby the NNSM and the neural network controller (NNC)\nare chained in closed loop along a finite time horizon. By cycling through\nphases of combined random open-loop actuation and closed-loop control, an\niterative training process is introduced to overcome the lack of data near\nequilibrium points. This approach improves the accuracy of the models in the\nmost critical region for achieving stabilization. Through the use of L1\nregularization within loss functions, the NNSMs can also guide optimal sensor\nplacement, reducing the number of sensors from an initial candidate set. The\ndatasets produced during the iterative training process are also leveraged for\nconducting a linear stability analysis through a modified dynamic mode\ndecomposition approach. The results demonstrate the effectiveness of\ncomputationally inexpensive neural networks in modeling, controlling, and\nenabling stability analysis of nonlinear systems, providing insights into the\nsystem behaviour and offering potential for stabilization of complex fluid\nsystems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:52:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["D\u00e9da","Tarc\u00edsio",""],["Wolf","William",""],["Dawson","Scott",""]]}
{"id":"2308.13030","submitter":"Qian Song","authors":"Ayres Freitas and Qian Song","title":"Probing dark sector fermions in Higgs precision studies and direct\n  searches","comments":"28 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the discovery prospect of simplified fermionic\ndark sectors models through Higgs precision measurements at $e^+e^-$ colliders\nand direct searches at hadron colliders. These models extend the Standard Model\nwith two Majorana or Dirac fermions that are singlets, doublets or triplets\nunder the weak SU(2) group. For all models, we consider two scenarios where the\nlightest new fermion is either stable, or where it decays into other visible\nfinal states. For the Higgs precision observables we primarily focus on\n$\\sigma(e^+e^-\\to ZH)$, which can deviate from the Standard Model through\none-loop corrections involving the new fermions. Deviations of 0.5\\% or more,\nwhich could be observable at future $e^+e^-$ colliders, are found for TeV-scale\ndark sector masses. By combining the constraints from the oblique parameters,\n$\\text{Br}(H\\to\\gamma\\gamma)$, and direct production of the new fermions at the\nLHC, a comprehensive understanding of the discovery potential of these models\ncan be achieved. In both scenarios, there exist some parameter regions where\nthe Higgs precision measurements can provide complementary information to\ndirect LHC searches.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:55:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Freitas","Ayres",""],["Song","Qian",""]]}
{"id":"2308.13031","submitter":"Zhongkai Tao","authors":"Yuchen Mao, Sung-Jin Oh, Zhongkai Tao","title":"Initial data gluing in the asymptotically flat regime via solution\n  operators with prescribed support properties","comments":"30 pages, 1 figure. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give new proofs of general relativistic initial data gluing results on\nunit-scale annuli based on explicit solution operators for the linearized\nconstraint equation around the flat case with prescribed support properties.\nThese results retrieve and optimize - in terms of positivity, regularity, size\nand/or spatial decay requirements - a number of known theorems concerning\nasymptotically flat initial data, including Kerr exterior gluing by\nCorvino-Schoen and Chru\\'sciel-Delay, interior gluing (or \"fill-in\") by\nBieri-Chru\\'sciel, and obstruction-free gluing by Czimek-Rodnianski. In\nparticular, our proof of the strengthened obstruction-free gluing theorem\nrelies on purely spacelike techniques, rather than null gluing as in the\noriginal approach.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:57:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mao","Yuchen",""],["Oh","Sung-Jin",""],["Tao","Zhongkai",""]]}
{"id":"2308.13032","submitter":"Bohdan Pavlyshenko","authors":"Bohdan M. Pavlyshenko","title":"Financial News Analytics Using Fine-Tuned Llama 2 GPT Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CE cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper considers the possibility to fine-tune Llama 2 Large Language Model\n(LLM) for the multitask analysis of financial news. For fine-tuning, the\nPEFT/LoRA based approach was used. In the study, the model was fine-tuned for\nthe following tasks: analysing a text from financial market perspectives,\nhighlighting main points of a text, summarizing a text and extracting named\nentities with appropriate sentiments. The obtained results show that the\nfine-tuned Llama 2 model can perform a multitask financial news analysis with a\nspecified structure of response, part of response can be a structured text and\nanother part of data can have JSON format for further processing. Extracted\nsentiments for named entities can be considered as predictive features in\nsupervised machine learning models with quantitative target variables.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:58:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pavlyshenko","Bohdan M.",""]]}
{"id":"2308.13033","submitter":"Panpan Zhang","authors":"Yelie Yuan, Jun Yan, Panpan Zhang","title":"A Strength and Sparsity Preserving Algorithm for Generating Weighted,\n  Directed Networks with Predetermined Assortativity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Degree-preserving rewiring is a widely used technique for generating\nunweighted networks with given assortativity, but for weighted networks, it is\nunclear how an analog would preserve the strengths and other critical network\nfeatures such as sparsity level. This study introduces a novel approach for\nrewiring weighted networks to achieve desired directed assortativity. The\nmethod utilizes a mixed integer programming framework to establish a target\nnetwork with predetermined assortativity coefficients, followed by an efficient\nrewiring algorithm termed \"strength and sparsity preserving rewiring\" (SSPR).\nSSPR retains the node strength distributions and network sparsity after\nrewiring. It is also possible to accommodate additional properties like edge\nweight distribution with extra computational cost. The optimization scheme can\nbe used to determine feasible assortativity ranges for an initial network. The\neffectiveness of the proposed SSPR algorithm is demonstrated through its\napplication to two classes of popular network models.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:59:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yuan","Yelie",""],["Yan","Jun",""],["Zhang","Panpan",""]]}
{"id":"2308.13034","submitter":"Tomer Levin","authors":"Gadi Fibich and Tomer Levin","title":"Funnel Theorems for Spreading on Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive novel analytic tools for the discrete Bass model, which models the\ndiffusion of new products on networks. We prove that the probability that any\ntwo nodes adopt by time t, is greater than or equal to the product of the\nprobabilities that each of the two nodes adopts by time t. We introduce the\nnotion of an \"influential node\", and use it to determine whether the above\ninequality is strict or an equality. We then use the above inequality to prove\nthe \"funnel inequality\", which relates the adoption probability of a node to\nthe product of its adoption probability on two sub-networks. We introduce the\nnotion of a \"funnel node\", and use it to determine whether the funnel\ninequality is strict or an equality. The above analytic tools can be exptended\nto epidemiological models on networks.\n  We then use the funnel theorems to derive a new inequality for diffusion on\ncircles and a new explicit expression for the adoption probabilities of nodes\non two-sided line, and to prove that the adoption level on one-sided lines is\nstrictly slower than on anisotropic two-sided lines, and that the adoption\nlevel on multi-dimensional Cartesian networks is bounded from below by that on\none-dimensional networks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:59:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fibich","Gadi",""],["Levin","Tomer",""]]}
{"id":"2308.13035","submitter":"Sanjana Srivastava","authors":"Shan Guleria, Benjamin Schwartz, Yash Sharma, Philip Fernandes, James\n  Jablonski, Sodiq Adewole, Sanjana Srivastava, Fisher Rhoads, Michael Porter,\n  Michelle Yeghyayan, Dylan Hyatt, Andrew Copland, Lubaina Ehsan, Donald Brown,\n  Sana Syed","title":"The intersection of video capsule endoscopy and artificial intelligence:\n  addressing unique challenges using machine learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Introduction: Technical burdens and time-intensive review processes limit the\npractical utility of video capsule endoscopy (VCE). Artificial intelligence\n(AI) is poised to address these limitations, but the intersection of AI and VCE\nreveals challenges that must first be overcome. We identified five challenges\nto address. Challenge #1: VCE data are stochastic and contains significant\nartifact. Challenge #2: VCE interpretation is cost-intensive. Challenge #3: VCE\ndata are inherently imbalanced. Challenge #4: Existing VCE AIMLT are\ncomputationally cumbersome. Challenge #5: Clinicians are hesitant to accept\nAIMLT that cannot explain their process.\n  Methods: An anatomic landmark detection model was used to test the\napplication of convolutional neural networks (CNNs) to the task of classifying\nVCE data. We also created a tool that assists in expert annotation of VCE data.\nWe then created more elaborate models using different approaches including a\nmulti-frame approach, a CNN based on graph representation, and a few-shot\napproach based on meta-learning.\n  Results: When used on full-length VCE footage, CNNs accurately identified\nanatomic landmarks (99.1%), with gradient weighted-class activation mapping\nshowing the parts of each frame that the CNN used to make its decision. The\ngraph CNN with weakly supervised learning (accuracy 89.9%, sensitivity of\n91.1%), the few-shot model (accuracy 90.8%, precision 91.4%, sensitivity\n90.9%), and the multi-frame model (accuracy 97.5%, precision 91.5%, sensitivity\n94.8%) performed well. Discussion: Each of these five challenges is addressed,\nin part, by one of our AI-based models. Our goal of producing high performance\nusing lightweight models that aim to improve clinician confidence was achieved.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:00:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Guleria","Shan",""],["Schwartz","Benjamin",""],["Sharma","Yash",""],["Fernandes","Philip",""],["Jablonski","James",""],["Adewole","Sodiq",""],["Srivastava","Sanjana",""],["Rhoads","Fisher",""],["Porter","Michael",""],["Yeghyayan","Michelle",""],["Hyatt","Dylan",""],["Copland","Andrew",""],["Ehsan","Lubaina",""],["Brown","Donald",""],["Syed","Sana",""]]}
{"id":"2308.13036","submitter":"Matey Neykov","authors":"Matey Neykov","title":"Signal Detection with Quadratically Convex Orthosymmetric Constraints","comments":"2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with signal detection in Gaussian noise under\nquadratically convex orthosymmetric (QCO) constraints. Specifically the null\nhypothesis assumes no signal, whereas the alternative considers signal which is\nseparated in Euclidean norm from zero, and belongs to the QCO constraint. Our\nmain result establishes the minimax rate of the separation radius between the\nnull and alternative purely in terms of the geometry of the QCO constraint --\nwe argue that the Kolmogorov widths of the constraint determine the critical\nradius. This is similar to the estimation problem with QCO constraints, which\nwas first established by Donoho et al. (1990); however, as expected, the\ncritical separation radius is smaller compared to the minimax optimal\nestimation rate. Thus signals may be detectable even when they cannot be\nreliably estimated.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:02:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Neykov","Matey",""]]}
{"id":"2308.13037","submitter":"Nolan Dickson","authors":"Nolan Dickson, Peter J. Smith, Vincent H\\'enault-Brunet, Mark Gieles,\n  Holger Baumgardt","title":"Multimass modelling of Milky Way globular clusters -- II. present-day\n  black hole populations","comments":"18 pages, 9 figures, submitted to MNRAS. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Populations of stellar-mass black holes (BHs) in globular clusters (GCs)\ninfluence their dynamical evolution and have important implications on one of\nthe main formation channels for gravitational wave sources. Inferring the size\nof these populations remains difficult, however. In this work, multimass models\nof 34 Milky Way GCs, first presented in Dickson et al., are used to explore the\npresent-day BH populations of a large sample of clusters. Direct constraints on\nboth the total and visible mass components provided by several observables\nallow these models to accurately determine the distribution of the dark mass\n(including BHs) within clusters, as we demonstrate in a proof-of-concept\nfitting of the models to mock observations extracted from Monte Carlo cluster\nmodels. New constraints on the BH population retained to the present-day in\neach cluster are inferred from our models. We find that BH mass fractions\nranging from 0 to 1 per cent of the total mass are typically required to\nexplain the observations, except for Omega Cen, for which we infer a mass\nfraction of 5 per cent, in agreement with previous works. Relationships between\nthe dark remnant populations and other cluster parameters are examined,\ndemonstrating a clear anti-correlation between the amount of BHs and mass\nsegregation between visible stars, as well as a correlation between remnant\nmass fractions and the dynamical age of clusters. Our inferred BH populations\nare in good agreement overall with other recent studies using different\nmethodologies, but with notable discrepancies for individual clusters.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:03:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dickson","Nolan",""],["Smith","Peter J.",""],["H\u00e9nault-Brunet","Vincent",""],["Gieles","Mark",""],["Baumgardt","Holger",""]]}
{"id":"2308.13038","submitter":"Patrick Diaba-Nuhoho","authors":"Patrick Diaba-Nuhoho","title":"The role of PHF5A in cancer: A review and update","comments":"18 pages, 1 figure, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO q-bio.CB q-bio.MN","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  PHF5A is a member of the zinc-finger proteins. To advance knowledge on their\nrole in carcinogenesis, data from experimental studies, animal models and\nclinical studies in different tumorigenesis have been reviewed. Furthermore,\nPHF5A as an oncogenic function, is frequently expressed in tumor cells and a\npotential prognostic marker for different cancers. PHF5A is implicated in the\nregulation of cancer cell proliferation, invasion, migration and metastasis.\nKnockdown of PHF5A prevented the invasion and metastasis of tumor cells. Here,\nthe role of PHF5A in different cancers and their possible mechanism in relation\nto recent literature is reviewed and discussed. However, there is an open\npromising perspective to their therapeutic management for different cancer\ntypes.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:05:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Diaba-Nuhoho","Patrick",""]]}
{"id":"2308.13039","submitter":"Rachel Fernandes","authors":"Rachel B. Fernandes, Kevin K. Hardegree-Ullman, Ilaria Pascucci, Galen\n  J. Bergsten, Gijs D. Mulders, Katia Cunha, Eric E. Mamajek, Kyle A. Pearson,\n  Gregory A. Feiden, and Jason L. Curtis","title":"Using Photometrically-Derived Properties of Young Stars to Refine TESS's\n  Transiting Young Planet Survey Completeness","comments":"16 pages, 5 Figures, 3 Tables. Revised and resubmitted to AJ after a\n  favorable referee report. Co-First Authors","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The demographics of young exoplanets can shed light onto their formation and\nevolution processes. Exoplanet properties are derived from the properties of\ntheir host stars. As such, it is important to accurately characterize the host\nstars since any systematic biases in their derivation can negatively impact the\nderivation of planetary properties. Here, we present a uniform catalog of\nphotometrically-derived stellar effective temperatures, luminosities, radii,\nand masses for 4,865 young (<1 Gyr) stars in 31 nearby clusters and moving\ngroups within 200 pc. We compared our photometrically-derived properties to a\nsubset of those derived from spectra, and found them to be in good agreement.\nWe also investigated the effect of stellar properties on the detection\nefficiency of transiting short-period young planets with TESS as calculated in\nFernandes et al. 2022, and found an overall increase in the detection\nefficiency when the new photometrically derived properties were taken into\naccount. Most notably, there is a 1.5 times increase in the detection\nefficiencies for sub-Neptunes/Neptunes (1.8-6 Re) implying that, for our sample\nof young stars, better characterization of host star properties can lead to the\nrecovery of more small transiting planets. Our homogeneously derived catalog of\nupdated stellar properties, along with a larger unbiased stellar sample and\nmore detections of young planets, will be a crucial input to the accurate\nestimation of the occurrence rates of young short-period planets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:09:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fernandes","Rachel B.",""],["Hardegree-Ullman","Kevin K.",""],["Pascucci","Ilaria",""],["Bergsten","Galen J.",""],["Mulders","Gijs D.",""],["Cunha","Katia",""],["Mamajek","Eric E.",""],["Pearson","Kyle A.",""],["Feiden","Gregory A.",""],["Curtis","Jason L.",""]]}
{"id":"2308.13040","submitter":"Abdulrahman Ahmed","authors":"Abdulrahman A. Ahmed, M. Amin Rahimian, Mark S. Roberts","title":"Estimating Treatment Effects Using Costly Simulation Samples from a\n  Population-Scale Model of Opioid Use Disorder","comments":"To be presented in IEEE International Conference on Biomedical and\n  Health Informatics 2023, repository link:\n  https://github.com/abdulrahmanfci/intervention-estimation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.SI stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large-scale models require substantial computational resources for analysis\nand studying treatment conditions. Specifically, estimating treatment effects\nusing simulations may require a lot of infeasible resources to allocate at\nevery treatment condition. Therefore, it is essential to develop efficient\nmethods to allocate computational resources for estimating treatment effects.\nAgent-based simulation allows us to generate highly realistic simulation\nsamples. FRED (A Framework for Reconstructing Epidemiological Dynamics) is an\nagent-based modeling system with a geospatial perspective using a synthetic\npopulation constructed based on the U.S. census data. Given its synthetic\npopulation, FRED simulations present a baseline for comparable results from\ndifferent treatment conditions and treatment conditions. In this paper, we show\nthree other methods for estimating treatment effects. In the first method, we\nresort to brute-force allocation, where all treatment conditions have an equal\nnumber of samples with a relatively large number of simulation runs. In the\nsecond method, we try to reduce the number of simulation runs by customizing\nindividual samples required for each treatment effect based on the width of\nconfidence intervals around the mean estimates. In the third method, we use a\nregression model, which allows us to learn across the treatment conditions such\nthat simulation samples allocated for a treatment condition will help better\nestimate treatment effects in other conditions. We show that the\nregression-based methods result in a comparable estimate of treatment effects\nwith less computational resources. The reduced variability and faster\nconvergence of model-based estimates come at the cost of increased bias, and\nthe bias-variance trade-off can be controlled by adjusting the number of model\nparameters (e.g., including higher-order interaction terms in the regression\nmodel).\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:09:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ahmed","Abdulrahman A.",""],["Rahimian","M. Amin",""],["Roberts","Mark S.",""]]}
{"id":"2308.13041","submitter":"Dunja Pucher","authors":"Janez Povh and Dunja Pucher","title":"Advancing stable set problem solutions through quantum annealers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We assess the performance of D-wave quantum solvers for solving the stable\nset problem in a graph, one of the most studied NP-hard problems. We perform\ncomputations on some instances from the literature with up to 125 vertices and\ncompare the quality of the obtained solutions with known optimum solutions. It\nturns out that the hybrid solver gives very good results, while the Quantum\nProcessing Unit solver shows rather modest performance overall.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 07:18:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Povh","Janez",""],["Pucher","Dunja",""]]}
{"id":"2308.13042","submitter":"Qi Feng","authors":"Qi Feng, Hubert P. H. Shum, Shigeo Morishima","title":"Enhancing Perception and Immersion in Pre-Captured Environments through\n  Learning-Based Eye Height Adaptation","comments":"10 pages, 13 figures, 3 tables, submitted to ISMAR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pre-captured immersive environments using omnidirectional cameras provide a\nwide range of virtual reality applications. Previous research has shown that\nmanipulating the eye height in egocentric virtual environments can\nsignificantly affect distance perception and immersion. However, the influence\nof eye height in pre-captured real environments has received less attention due\nto the difficulty of altering the perspective after finishing the capture\nprocess. To explore this influence, we first propose a pilot study that\ncaptures real environments with multiple eye heights and asks participants to\njudge the egocentric distances and immersion. If a significant influence is\nconfirmed, an effective image-based approach to adapt pre-captured real-world\nenvironments to the user's eye height would be desirable. Motivated by the\nstudy, we propose a learning-based approach for synthesizing novel views for\nomnidirectional images with altered eye heights. This approach employs a\nmultitask architecture that learns depth and semantic segmentation in two\nformats, and generates high-quality depth and semantic segmentation to\nfacilitate the inpainting stage. With the improved omnidirectional-aware\nlayered depth image, our approach synthesizes natural and realistic visuals for\neye height adaptation. Quantitative and qualitative evaluation shows favorable\nresults against state-of-the-art methods, and an extensive user study verifies\nimproved perception and immersion for pre-captured real-world environments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:14:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Feng","Qi",""],["Shum","Hubert P. H.",""],["Morishima","Shigeo",""]]}
{"id":"2308.13043","submitter":"Yong Yang","authors":"Anakin Dey, Kolton O'Neal, Duc Van Khanh Tran, Camron Upshur, Yong\n  Yang","title":"Classifying Primitive Solvable Permutation Groups of Rank 5 and 6","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $G$ be a finite solvable permutation group acting faithfully and\nprimitively on a finite set $\\Omega$.\n  Let $G_0$ be the stabilizer of a point $\\alpha \\in \\Omega$\n  The rank of $G$ is defined as the number of orbits of $G_0$ in $\\Omega$,\nincluding the trivial orbit $\\{\\alpha\\}$.\n  In this paper, we completely classify the cases where $G$ has rank 5 and 6,\ncontinuing the previous works on classifying groups of rank 4 or lower.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:23:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dey","Anakin",""],["O'Neal","Kolton",""],["Tran","Duc Van Khanh",""],["Upshur","Camron",""],["Yang","Yong",""]]}
{"id":"2308.13044","submitter":"Lakshmi Pradeep Chitta","authors":"L. P. Chitta, A. N. Zhukov, D. Berghmans, H. Peter, S. Parenti, S.\n  Mandal, R. Aznar Cuadrado, U. Sch\\\"uhle, L. Teriaca, F. Auch\\`ere, K.\n  Barczynski, \\'E. Buchlin, L. Harra, E. Kraaikamp, D. M. Long, L. Rodriguez,\n  C. Schwanitz, P. J. Smith, C. Verbeeck, D. B. Seaton","title":"Picoflare jets power the solar wind emerging from a coronal hole on the\n  Sun","comments":"This is the author's version of the work. The definitive version was\n  published in Science on 24 August 2023","journal-ref":"Science 381, 867-872 (2023)","doi":"10.1126/science.ade5801","report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Coronal holes are areas on the Sun with open magnetic field lines. They are a\nsource region of the solar wind, but how the wind emerges from coronal holes is\nnot known. We observed a coronal hole using the Extreme Ultraviolet Imager on\nthe Solar Orbiter spacecraft. We identified jets on scales of a few hundred\nkilometers, which last 20 to 100 seconds and reach speeds of ~100 kilometers\nper second. The jets are powered by magnetic reconnection and have kinetic\nenergy in the picoflare range. They are intermittent but widespread within the\nobserved coronal hole. We suggest that such picoflare jets could produce enough\nhigh-temperature plasma to sustain the solar wind and that the wind emerges\nfrom coronal holes as a highly intermittent outflow at small scales.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:23:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chitta","L. P.",""],["Zhukov","A. N.",""],["Berghmans","D.",""],["Peter","H.",""],["Parenti","S.",""],["Mandal","S.",""],["Cuadrado","R. Aznar",""],["Sch\u00fchle","U.",""],["Teriaca","L.",""],["Auch\u00e8re","F.",""],["Barczynski","K.",""],["Buchlin","\u00c9.",""],["Harra","L.",""],["Kraaikamp","E.",""],["Long","D. M.",""],["Rodriguez","L.",""],["Schwanitz","C.",""],["Smith","P. J.",""],["Verbeeck","C.",""],["Seaton","D. B.",""]]}
{"id":"2308.13045","submitter":"Armanpreet Pannu","authors":"Armanpreet Pannu, Han Liu, Amr S. Helmy and Hesham El Gamal","title":"Single Photon Quantum Ranging: When Sequential Decoding Meets High\n  Dimensional Entanglement","comments":"Submitted to NPJ Quantum information for peer review","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the quantum ranging problem in the low noise level per mode and\nlow reflectivity (high loss) regime. We focus on single photon transmission\nstrategies and propose a novel approach that combines high dimensional time-bin\nentanglement at the transmitter with a carefully constructed sequential\ndecision rule at the detector. Our analytical results establish the significant\nperformance gains that can be leveraged from this approach in a range of\noperating parameters, as compared to the single photon classical approach, the\ntwo-mode squeezed vacuum ranging scheme proposed earlier, and even the\nblock-based classical scheme. One can attribute this performance gain to 1) the\nability of the high dimensional time-bin entangled signaling to offer a very\nfine range resolution with a single transmitted photon and 2) the ability of\nthe sequential decision rule to minimize the average number of transmitted\nphoton subject to a constraint on the probability of error. While our analysis\nis limited to the low energy/low noise regime, we conjecture that the proposed\napproach's superior performance extends to a wider range of scenarios which\nshould motivate further analytical and experimental investigations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:24:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pannu","Armanpreet",""],["Liu","Han",""],["Helmy","Amr S.",""],["Gamal","Hesham El",""]]}
{"id":"2308.13046","submitter":"Abdulkadir Senol","authors":"H. Denizli, A. Senol, M. K\\\"oksal","title":"Probing the electromagnetic properties of the neutrinos at future lepton\n  colliders","comments":"17 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we explore the non-standard $\\nu\\bar{\\nu}\\gamma \\gamma$\ncouplings parametrized by dimension-seven operators via $e^{+}e^{-} \\to\n\\nu\\bar{\\nu}\\gamma$ process at the FCC-ee/CEPC and\n$\\mu^{+}\\mu^{-}\\to\\nu\\bar{\\nu}\\gamma$ process at the Muon Colliders. For the\ndetailed Monte Carlo simulation, all signal and relevant background events are\nproduced within the framework of Madgraph where non-standard\n$\\nu\\bar{\\nu}\\gamma \\gamma$ couplings are implemented. After passing through\nPythia for parton showering and hadronization, detector effects are included\nvia tuned corresponding detector cards for each collider in Delphes. Projected\nsensitivities on $\\nu\\bar{\\nu}\\gamma \\gamma$ couplings are obtained at a\n5$\\sigma$ confidence level without and with $5\\%$ systematic uncertainties for\nthe FCC-ee/CEPC and the Muon Colliders, showcasing the complementarity between\nlepton colliders. Our best limit on the anomalous $\\nu\\bar{\\nu}\\gamma \\gamma$\ncouplings even with 5\\% systematic uncertainties for muon collider with\n$\\sqrt{s}=10$ TeV and $L_{int}=3$ ab$^{-1}$ are found to be thirteen orders of\nmagnitude stronger than the upper bound obtained from rare decay\n$Z\\to\\gamma\\gamma\\nu\\bar{\\nu}$ analysis using LEP data.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:27:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Denizli","H.",""],["Senol","A.",""],["K\u00f6ksal","M.",""]]}
{"id":"2308.13047","submitter":"Thanh Vinh Vo","authors":"Thanh Vinh Vo, Young lee, Tze-Yun Leong","title":"Federated Learning of Causal Effects from Incomplete Observational Data","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Decentralized and incomplete data sources are prevalent in real-world\napplications, posing a formidable challenge for causal inference. These sources\ncannot be consolidated into a single entity owing to privacy constraints, and\nthe presence of missing values within them can potentially introduce bias to\nthe causal estimands. We introduce a new approach for federated causal\ninference from incomplete data, enabling the estimation of causal effects from\nmultiple decentralized and incomplete data sources. Our approach disentangles\nthe loss function into multiple components, each corresponding to a specific\ndata source with missing values. Our approach accounts for the missing data\nunder the missing at random assumption, while also estimating higher-order\nstatistics of the causal estimands. Our method recovers the conditional\ndistribution of missing confounders given the observed confounders from the\ndecentralized data sources to identify causal effects. Our framework estimates\nheterogeneous causal effects without the sharing of raw training data among\nsources, which helps to mitigate privacy risks. The efficacy of our approach is\ndemonstrated through a collection of simulated and real-world instances,\nillustrating its potential and practicality.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:27:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Vo","Thanh Vinh",""],["lee","Young",""],["Leong","Tze-Yun",""]]}
{"id":"2308.13048","submitter":"Jonathan Squire","authors":"Jonathan Squire and Romain Meyrand and Matthew W. Kunz","title":"Electron-ion heating partition in imbalanced solar-wind turbulence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A likely candidate mechanism to heat the solar corona and solar wind is\nlow-frequency \"Alfv\\'enic\" turbulence sourced by magnetic fluctuations near the\nsolar surface. Depending on its properties, such turbulence can heat different\nspecies via different mechanisms, and the comparison of theoretical predictions\nto observed temperatures, wind speeds, anisotropies, and their variation with\nheliocentric radius provides a sensitive test of this physics. Here we explore\nthe importance of normalized cross helicity, or imbalance, for controlling\nsolar-wind heating, since it a key parameter of magnetized turbulence and\nvaries systematically with wind speed and radius. Based on a hybrid-kinetic\nsimulation in which the forcing's imbalance decreases with time -- a crude\nmodel for a plasma parcel entrained in the outflowing wind -- we demonstrate\nhow significant changes to the turbulence and heating result from the \"helicity\nbarrier\" effect. Its dissolution at low imbalance causes its characteristic\nfeatures -- strong perpendicular ion heating with a steep \"transition-range\"\ndrop in electromagnetic fluctuation spectra -- to disappear, driving more\nenergy into electrons and parallel ion heat, and halting the emission of\nion-scale waves. These predictions seem to agree with a diverse array of\nsolar-wind observations, offering to explain a variety of complex correlations\nand features within a single theoretical framework.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:31:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Squire","Jonathan",""],["Meyrand","Romain",""],["Kunz","Matthew W.",""]]}
{"id":"2308.13049","submitter":"Mattie Fellows","authors":"Mattie Fellows, Brandon Kaplowitz, Christian Schroeder de Witt and\n  Shimon Whiteson","title":"Bayesian Exploration Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bayesian reinforcement learning (RL) offers a principled and elegant approach\nfor sequential decision making under uncertainty. Most notably, Bayesian agents\ndo not face an exploration/exploitation dilemma, a major pathology of\nfrequentist methods. A key challenge for Bayesian RL is the computational\ncomplexity of learning Bayes-optimal policies, which is only tractable in toy\ndomains. In this paper we propose a novel model-free approach to address this\nchallenge. Rather than modelling uncertainty in high-dimensional state\ntransition distributions as model-based approaches do, we model uncertainty in\na one-dimensional Bellman operator. Our theoretical analysis reveals that\nexisting model-free approaches either do not propagate epistemic uncertainty\nthrough the MDP or optimise over a set of contextual policies instead of all\nhistory-conditioned policies. Both approximations yield policies that can be\narbitrarily Bayes-suboptimal. To overcome these issues, we introduce the\nBayesian exploration network (BEN) which uses normalising flows to model both\nthe aleatoric uncertainty (via density estimation) and epistemic uncertainty\n(via variational inference) in the Bellman operator. In the limit of complete\noptimisation, BEN learns true Bayes-optimal policies, but like in variational\nexpectation-maximisation, partial optimisation renders our approach tractable.\nEmpirical results demonstrate that BEN can learn true Bayes-optimal policies in\ntasks where existing model-free approaches fail.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:35:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fellows","Mattie",""],["Kaplowitz","Brandon",""],["de Witt","Christian Schroeder",""],["Whiteson","Shimon",""]]}
{"id":"2308.13050","submitter":"Shashidhar Reddy Javaji","authors":"Shashidhar Reddy Javaji, Krutika Sarode","title":"Multi-BERT for Embeddings for Recommendation System","comments":"5 pages, 1 figure, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a novel approach for generating document embeddings\nusing a combination of Sentence-BERT (SBERT) and RoBERTa, two state-of-the-art\nnatural language processing models. Our approach treats sentences as tokens and\ngenerates embeddings for them, allowing the model to capture both\nintra-sentence and inter-sentence relations within a document. We evaluate our\nmodel on a book recommendation task and demonstrate its effectiveness in\ngenerating more semantically rich and accurate document embeddings. To assess\nthe performance of our approach, we conducted experiments on a book\nrecommendation task using the Goodreads dataset. We compared the document\nembeddings generated using our MULTI-BERT model to those generated using SBERT\nalone. We used precision as our evaluation metric to compare the quality of the\ngenerated embeddings. Our results showed that our model consistently\noutperformed SBERT in terms of the quality of the generated embeddings.\nFurthermore, we found that our model was able to capture more nuanced semantic\nrelations within documents, leading to more accurate recommendations. Overall,\nour results demonstrate the effectiveness of our approach and suggest that it\nis a promising direction for improving the performance of recommendation\nsystems\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:36:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Javaji","Shashidhar Reddy",""],["Sarode","Krutika",""]]}
{"id":"2308.13051","submitter":"Daisuke Uchida","authors":"Daisuke Uchida and Karthik Duraisamy","title":"Extracting Koopman Operators for Prediction and Control of Non-linear\n  Dynamics Using Two-stage Learning and Oblique Projections","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Koopman operator framework provides a perspective that non-linear\ndynamics can be described through the lens of linear operators acting on\nfunction spaces. As the framework naturally yields linear embedding models,\nthere have been extensive efforts to utilize it for control, where linear\ncontroller designs in the embedded space can be applied to control possibly\nnonlinear dynamics. However, it is challenging to successfully deploy this\nmodeling procedure in a wide range of applications. In this work, some of the\nfundamental limitations of linear embedding models are addressed. We show a\nnecessary condition for a linear embedding model to achieve zero modeling\nerror, highlighting a trade-off relation between the model expressivity and a\nrestriction on the model structure to allow the use of linear systems theories\nfor nonlinear dynamics. To address these limitations, neural network-based\nmodeling is proposed based on linear embedding with oblique projection, which\nis derived from a weak formulation of projection-based linear operator\nlearning. We train the proposed model using a two-stage learning procedure,\nwherein the features and operators are initialized with orthogonal projection,\nfollowed by the main training process in which test functions characterizing\nthe oblique projection are learned from data. The first stage achieves an\noptimality ensured by the orthogonal projection and the second stage improves\nthe generalizability to various tasks by optimizing the model with the oblique\nprojection. We demonstrate the effectiveness of the proposed method over other\ndata-driven modeling methods by providing comprehensive numerical evaluations\nwhere four tasks are considered targeting three different systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:40:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Uchida","Daisuke",""],["Duraisamy","Karthik",""]]}
{"id":"2308.13052","submitter":"Davide Ceneda","authors":"Davide Ceneda, Christopher Collins, Mennatallah El-Assady, Silvia\n  Miksch, Christian Tominski, Alessio Arleo","title":"A Heuristic Approach for Dual Expert/End-User Evaluation of Guidance in\n  Visual Analytics","comments":"Accepted to IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Guidance can support users during the exploration and analysis of complex\ndata. Previous research focused on characterizing the theoretical aspects of\nguidance in visual analytics and implementing guidance in different scenarios.\nHowever, the evaluation of guidance-enhanced visual analytics solutions remains\nan open research question. We tackle this question by introducing and\nvalidating a practical evaluation methodology for guidance in visual analytics.\nWe identify eight quality criteria to be fulfilled and collect expert feedback\non their validity. To facilitate actual evaluation studies, we derive two sets\nof heuristics. The first set targets heuristic evaluations conducted by expert\nevaluators. The second set facilitates end-user studies where participants\nactually use a guidance-enhanced system. By following such a dual approach, the\ndifferent quality criteria of guidance can be examined from two different\nperspectives, enhancing the overall value of evaluation studies. To test the\npractical utility of our methodology, we employ it in two studies to gain\ninsight into the quality of two guidance-enhanced visual analytics solutions,\none being a work-in-progress research prototype, and the other being a publicly\navailable visualization recommender system. Based on these two evaluations, we\nderive good practices for conducting evaluations of guidance in visual\nanalytics and identify pitfalls to be avoided during such studies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:40:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ceneda","Davide",""],["Collins","Christopher",""],["El-Assady","Mennatallah",""],["Miksch","Silvia",""],["Tominski","Christian",""],["Arleo","Alessio",""]]}
{"id":"2308.13053","submitter":"Erik B\\\"orve","authors":"Erik B\\\"orve, Nikolce Murgovski, and Leo Laine","title":"Interaction-Aware Trajectory Prediction and Planning in Dense Highway\n  Traffic using Distributed Model Predictive Control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.RO cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we treat optimal trajectory planning for an autonomous vehicle\n(AV) operating in dense traffic, where vehicles closely interact with each\nother. To tackle this problem, we present a novel framework that couples\ntrajectory prediction and planning in multi-agent environments, using\ndistributed model predictive control. A demonstration of our framework is\npresented in simulation, employing a trajectory planner using non-linear model\npredictive control. We analyze performance and convergence of our framework,\nsubject to different prediction errors. The results indicate that the obtained\nlocally optimal solutions are improved, compared with decoupled prediction and\nplanning.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:41:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["B\u00f6rve","Erik",""],["Murgovski","Nikolce",""],["Laine","Leo",""]]}
{"id":"2308.13054","submitter":"Greg Bodwin","authors":"Aaron Bernstein, Greg Bodwin, Nicole Wein","title":"Are there graphs whose shortest path structure requires large edge\n  weights?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aspect ratio of a weighted graph $G$ is the ratio of its maximum edge\nweight to its minimum edge weight. Aspect ratio commonly arises as a complexity\nmeasure in graph algorithms, especially related to the computation of shortest\npaths. Popular paradigms are to interpolate between the settings of weighted\nand unweighted input graphs by incurring a dependence on aspect ratio, or by\nsimply restricting attention to input graphs of low aspect ratio.\n  This paper studies the effects of these paradigms, investigating whether\ngraphs of low aspect ratio have more structured shortest paths than graphs in\ngeneral. In particular, we raise the question of whether one can generally take\na graph of large aspect ratio and \\emph{reweight} its edges, to obtain a graph\nwith bounded aspect ratio while preserving the structure of its shortest paths.\nOur findings are:\n  - Every weighted DAG on $n$ nodes has a shortest-paths preserving graph of\naspect ratio $O(n)$. A simple lower bound shows that this is tight.\n  - The previous result does not extend to general directed or undirected\ngraphs; in fact, the answer turns out to be exponential in these settings. In\nparticular, we construct directed and undirected $n$-node graphs for which any\nshortest-paths preserving graph has aspect ratio $2^{\\Omega(n)}$.\n  We also consider the approximate version of this problem, where the goal is\nfor shortest paths in $H$ to correspond to approximate shortest paths in $G$.\nWe show that our exponential lower bounds extend even to this setting. We also\nshow that in a closely related model, where approximate shortest paths in $H$\nmust also correspond to approximate shortest paths in $G$, even DAGs require\nexponential aspect ratio.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:41:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bernstein","Aaron",""],["Bodwin","Greg",""],["Wein","Nicole",""]]}
{"id":"2308.13055","submitter":"Vladislav Cherepanov","authors":"V. Cherepanov, J. Liu, Z. Qian","title":"On the dynamics of the boundary vorticity for incompressible viscous\n  flows","comments":"16 pages, 26 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cs.NA math.AP math.NA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dynamical equation of the boundary vorticity has been obtained, which\nshows that the viscosity at a solid wall is doubled as if the fluid became more\nviscous at the boundary. For certain viscous flows the boundary vorticity can\nbe determined via the dynamical equation up to bounded errors for all time,\nwithout the need of knowing the details of the main stream flows. We then\nvalidate the dynamical equation by carrying out stochastic direct numerical\nsimulations (i.e. the random vortex method for wall-bounded incompressible\nviscous flows) by two different means of updating the boundary vorticity, one\nusing mollifiers of the Biot-Savart singular integral kernel, another using the\ndynamical equations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:42:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cherepanov","V.",""],["Liu","J.",""],["Qian","Z.",""]]}
{"id":"2308.13056","submitter":"Hadi Khalilia","authors":"Hadi Khalilia, G\\'abor Bella, Abed Alhakim Freihat, Shandy Darma,\n  Fausto Giunchiglia","title":"Lexical Diversity in Kinship Across Languages and Dialects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Languages are known to describe the world in diverse ways. Across lexicons,\ndiversity is pervasive, appearing through phenomena such as lexical gaps and\nuntranslatability. However, in computational resources, such as multilingual\nlexical databases, diversity is hardly ever represented. In this paper, we\nintroduce a method to enrich computational lexicons with content relating to\nlinguistic diversity. The method is verified through two large-scale case\nstudies on kinship terminology, a domain known to be diverse across languages\nand cultures: one case study deals with seven Arabic dialects, while the other\none with three Indonesian languages. Our results, made available as browseable\nand downloadable computational resources, extend prior linguistics research on\nkinship terminology, and provide insight into the extent of diversity even\nwithin linguistically and culturally close communities.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:49:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Khalilia","Hadi",""],["Bella","G\u00e1bor",""],["Freihat","Abed Alhakim",""],["Darma","Shandy",""],["Giunchiglia","Fausto",""]]}
{"id":"2308.13057","submitter":"Bryan Bo Cao","authors":"Bryan Bo Cao, Lawrence O'Gorman, Michael Coss, Shubham Jain","title":"Data-Side Efficiencies for Lightweight Convolutional Neural Networks","comments":"10 pages, 5 figures, 6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We examine how the choice of data-side attributes for two important visual\ntasks of image classification and object detection can aid in the choice or\ndesign of lightweight convolutional neural networks. We show by experimentation\nhow four data attributes - number of classes, object color, image resolution,\nand object scale affect neural network model size and efficiency. Intra- and\ninter-class similarity metrics, based on metric learning, are defined to guide\nthe evaluation of these attributes toward achieving lightweight models.\nEvaluations made using these metrics are shown to require 30x less computation\nthan running full inference tests. We provide, as an example, applying the\nmetrics and methods to choose a lightweight model for a robot path planning\napplication and achieve computation reduction of 66% and accuracy gain of 3.5%\nover the pre-method model.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:50:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cao","Bryan Bo",""],["O'Gorman","Lawrence",""],["Coss","Michael",""],["Jain","Shubham",""]]}
{"id":"2308.13058","submitter":"Samuel Petite","authors":"Eduardo Garibaldi, Samuel Petite and Philippe Thieullen","title":"Classification of discrete weak KAM solutions on linearly repetitive\n  quasi-periodic sets","comments":"44 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.CA math.DS math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In discrete schemes, weak KAM solutions may be interpreted as approximations\nof correctors for some Hamilton-Jacobi equations in the periodic setting. It is\nknown that correctors may not exist in the almost periodic setting. We show the\nexistence of discrete weak KAM solutions for non-degenerate and weakly twist\ninteractions in general. Furthermore, assuming equivariance with respect to a\nlinearly repetitive quasi-periodic set, we completely classify all possible\ntypes of weak KAM solutions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:57:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Garibaldi","Eduardo",""],["Petite","Samuel",""],["Thieullen","Philippe",""]]}
{"id":"2308.13059","submitter":"Sophie Lee","authors":"Sophie Y. Lee, Philipp W. A. Sch\\\"onh\\\"ofer, Sharon C. Glotzer","title":"Complex motion of steerable vesicular robots filled with active\n  colloidal rods","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While the collective motion of active particles has been studied extensively,\neffective strategies to navigate particle swarms without external guidance\nremain elusive. We introduce a method to control the trajectories of\ntwo-dimensional swarms of active rod-like particles by confining the particles\nto rigid bounding membranes (vesicles) with non-uniform curvature. We show that\nthe propelling agents spontaneously form clusters at the membrane wall and\ncollectively propel the vesicle, turning it into an active superstructure. To\nfurther guide the motion of the superstructure, we add discontinuous features\nto the rigid membrane boundary in the form of a kinked tip, which acts as a\nsteering component to direct the motion of the vesicle. We report that the\nsystem's geometrical and material properties, such as the aspect ratio and\nPeclet number of the active rods as well as the kink angle and flexibility of\nthe membrane, determine the stacking of active particles close to the kinked\nconfinement and induce a diverse set of dynamical behaviors of the\nsuperstructure, including linear and circular motion both in the direction of,\nand opposite to, the kink. From a systematic study of these various behaviors,\nwe design vesicles with switchable and reversible locomotions by tuning the\nconfinement parameters. The observed phenomena suggest a promising mechanism\nfor particle transportation and could be used as a basic element to navigate\nactive matter through complex and tortuous environments.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 19:58:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lee","Sophie Y.",""],["Sch\u00f6nh\u00f6fer","Philipp W. A.",""],["Glotzer","Sharon C.",""]]}
{"id":"2308.13060","submitter":"Lucas Fr\\'erot","authors":"Lucas Fr\\'erot, Lars Pastewka","title":"Elastic shakedown and roughness evolution in repeated elastic-plastic\n  contact","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Surface roughness emerges naturally during mechanical removal of material,\nfracture, chemical deposition, plastic deformation, indentation, and other\nprocesses. Here, we use continuum simulations to show how roughness which is\nneither Gaussian nor self-affine emerges from repeated elastic-plastic contact\nof a rough and rigid surface on a flat elastic-plastic substrate. Roughness\nprofiles change with each contact cycle, but appear to approach a steady-state\nlong before the substrate stops deforming plastically and has hence\n\"shaken-down\" elastically. We propose a simple dynamic collapse for the\nemerging power-spectral density, which shows that the multi-scale nature of the\nroughness is encoded in the first few indentations. In contrast to macroscopic\nroughness parameters, roughness at small scales and the skewness of the height\ndistribution of the resulting roughness do not show a steady-state, with the\nlatter vanishing asymptotically with contact cycle.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:00:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fr\u00e9rot","Lucas",""],["Pastewka","Lars",""]]}
{"id":"2308.13061","submitter":"Philipp Otto","authors":"Philipp Otto, Osman Do\\u{g}an, S\\\"uleyman Ta\\c{s}p{\\i}nar, Wolfgang\n  Schmid and Anil K. Bera","title":"Spatial and Spatiotemporal Volatility Models: A Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM q-fin.ST stat.OT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatial and spatiotemporal volatility models are a class of models designed\nto capture spatial dependence in the volatility of spatial and spatiotemporal\ndata. Spatial dependence in the volatility may arise due to spatial spillovers\namong locations; that is, if two locations are in close proximity, they can\nexhibit similar volatilities. In this paper, we aim to provide a comprehensive\nreview of the recent literature on spatial and spatiotemporal volatility\nmodels. We first briefly review time series volatility models and their\nmultivariate extensions to motivate their spatial and spatiotemporal\ncounterparts. We then review various spatial and spatiotemporal volatility\nspecifications proposed in the literature along with their underlying\nmotivations and estimation strategies. Through this analysis, we effectively\ncompare all models and provide practical recommendations for their appropriate\nusage. We highlight possible extensions and conclude by outlining directions\nfor future research.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:01:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Otto","Philipp",""],["Do\u011fan","Osman",""],["Ta\u015fp\u0131nar","S\u00fcleyman",""],["Schmid","Wolfgang",""],["Bera","Anil K.",""]]}
{"id":"2308.13062","submitter":"M. Caner Tol","authors":"M. Caner Tol and Berk Sunar","title":"ZeroLeak: Using LLMs for Scalable and Cost Effective Side-Channel\n  Patching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Security critical software, e.g., OpenSSL, comes with numerous side-channel\nleakages left unpatched due to a lack of resources or experts. The situation\nwill only worsen as the pace of code development accelerates, with developers\nrelying on Large Language Models (LLMs) to automatically generate code. In this\nwork, we explore the use of LLMs in generating patches for vulnerable code with\nmicroarchitectural side-channel leakages. For this, we investigate the\ngenerative abilities of powerful LLMs by carefully crafting prompts following a\nzero-shot learning approach. All generated code is dynamically analyzed by\nleakage detection tools, which are capable of pinpointing information leakage\nat the instruction level leaked either from secret dependent accesses or\nbranches or vulnerable Spectre gadgets, respectively. Carefully crafted prompts\nare used to generate candidate replacements for vulnerable code, which are then\nanalyzed for correctness and for leakage resilience. From a cost/performance\nperspective, the GPT4-based configuration costs in API calls a mere few cents\nper vulnerability fixed. Our results show that LLM-based patching is far more\ncost-effective and thus provides a scalable solution. Finally, the framework we\npropose will improve in time, especially as vulnerability detection tools and\nLLMs mature.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:04:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tol","M. Caner",""],["Sunar","Berk",""]]}
{"id":"2308.13063","submitter":"Ahmet Ege Yilmaz","authors":"A. Ege Yilmaz, Stefan Stettler, Thomas Ankenbrand, Urs Rhyner","title":"Grover Search for Portfolio Selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present explicit oracles designed to be used in Grover's algorithm to\nmatch investor preferences. Specifically, the oracles select portfolios with\nreturns and standard deviations exceeding and falling below certain thresholds,\nrespectively. One potential use case for the oracles is selecting portfolios\nwith the best Sharpe ratios. We have implemented these algorithms using quantum\nsimulators.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:08:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yilmaz","A. Ege",""],["Stettler","Stefan",""],["Ankenbrand","Thomas",""],["Rhyner","Urs",""]]}
{"id":"2308.13064","submitter":"Holly Christenson","authors":"Holly M. Christenson, George D. Becker, Anson D'Aloisio, Frederick B.\n  Davies, Yongda Zhu, Elisa Boera, Fahad Nasir, Steven R. Furlanetto, Matthew\n  A. Malkan","title":"The relationship between IGM Lyman-alpha opacity and galaxy density near\n  the end of reionization","comments":"20 pages, 17 figures. Accepted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observed scatter in the Lyman-alpha opacity of quasar sightlines at $z<6$ has\nmotivated measurements of the correlation between Ly$\\alpha$ opacity and galaxy\ndensity, as models that predict this scatter make strong and sometimes opposite\npredictions for how they should be related. Our previous work associated two\nhighly opaque Ly$\\alpha$ troughs at $z\\sim5.7$ with a deficit of Lyman-$\\alpha$\nemitting galaxies (LAEs). In this work, we survey two of the most highly\ntransmissive lines of sight at this redshift, towards the $z=6.02$ quasar SDSS\nJ1306+0356 and the $z=6.17$ quasar PSO J359-06. We find that both fields are\nunderdense in LAEs within 10 $h^{-1}$ Mpc of the quasar sightline, somewhat\nless extensive than underdensities associated with Ly$\\alpha$ troughs. We\ncombine our observations with three additional fields from the literature, and\nfind that while fields with extreme opacities are generally underdense,\nmoderate opacities span a wider density range. The results at high opacities\nare consistent with models that invoke UV background fluctuations and/or late\nreionization to explain the observed scatter in IGM Ly$\\alpha$ opacities. There\nis tension at low opacities, however, as the models tend to associate lower IGM\nLy$\\alpha$ opacities with higher densities. Although the number of fields\nsurveyed is still small, the low-opacity results may support a scenario in\nwhich the ionizing background in low-density regions increases more rapidly\nthan some models suggest after becoming ionized. Elevated gas temperatures from\nrecent reionization may also be making these regions more transparent.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:08:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Christenson","Holly M.",""],["Becker","George D.",""],["D'Aloisio","Anson",""],["Davies","Frederick B.",""],["Zhu","Yongda",""],["Boera","Elisa",""],["Nasir","Fahad",""],["Furlanetto","Steven R.",""],["Malkan","Matthew A.",""]]}
{"id":"2308.13065","submitter":"Elisa B\\\"aumer","authors":"Elisa B\\\"aumer, Vinay Tripathi, Derek S. Wang, Patrick Rall, Edward H.\n  Chen, Swarnadeep Majumder, Alireza Seif, Zlatko K. Minev","title":"Efficient Long-Range Entanglement using Dynamic Circuits","comments":"7 pages, 3 figures (main text) + 11 pages, 6 figures (appendix)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum simulation traditionally relies on unitary dynamics, inherently\nimposing efficiency constraints on the generation of intricate entangled\nstates. In principle, these limitations can be superseded by non-unitary,\ndynamic circuits. These circuits exploit measurements alongside conditional\nfeed-forward operations, providing a promising approach for long-range\nentangling gates, higher effective connectivity of near-term hardware, and more\nefficient state preparations. Here, we explore the utility of shallow dynamic\ncircuits for creating long-range entanglement on large-scale quantum devices.\nSpecifically, we study two tasks: CNOT gate teleportation between up to 101\nqubits by feeding forward 99 mid-circuit measurement outcomes, and the\npreparation of Greenberger-Horne-Zeilinger (GHZ) states with genuine\nentanglement. In the former, we observe that dynamic circuits can outperform\ntheir unitary counterparts. In the latter, by tallying instructions of compiled\nquantum circuits, we provide an error budget detailing the obstacles that must\nbe addressed to unlock the full potential of dynamic circuits. Looking forward,\nwe expect dynamic circuits to be useful for generating long-range entanglement\nin the near term on large-scale quantum devices.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:15:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["B\u00e4umer","Elisa",""],["Tripathi","Vinay",""],["Wang","Derek S.",""],["Rall","Patrick",""],["Chen","Edward H.",""],["Majumder","Swarnadeep",""],["Seif","Alireza",""],["Minev","Zlatko K.",""]]}
{"id":"2308.13066","submitter":"Chenghui Zhou","authors":"Chenghui Zhou, Barnabas Poczos","title":"Objective-Agnostic Enhancement of Molecule Properties via Multi-Stage\n  VAE","comments":"arXiv admin note: text overlap with arXiv:2212.02750","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variational autoencoder (VAE) is a popular method for drug discovery and\nvarious architectures and pipelines have been proposed to improve its\nperformance. However, VAE approaches are known to suffer from poor manifold\nrecovery when the data lie on a low-dimensional manifold embedded in a higher\ndimensional ambient space [Dai and Wipf, 2019]. The consequences of it in drug\ndiscovery are somewhat under-explored. In this paper, we explore applying a\nmulti-stage VAE approach, that can improve manifold recovery on a synthetic\ndataset, to the field of drug discovery. We experimentally evaluate our\nmulti-stage VAE approach using the ChEMBL dataset and demonstrate its ability\nto improve the property statistics of generated molecules substantially from\npre-existing methods without incorporating property predictors into the\ntraining pipeline. We further fine-tune our models on two curated and much\nsmaller molecule datasets that target different proteins. Our experiments show\nan increase in the number of active molecules generated by the multi-stage VAE\nin comparison to their one-stage equivalent. For each of the two tasks, our\nbaselines include methods that use learned property predictors to incorporate\ntarget metrics directly into the training objective and we discuss\ncomplications that arise with this methodology.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:22:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhou","Chenghui",""],["Poczos","Barnabas",""]]}
{"id":"2308.13067","submitter":"Matej Zecevic","authors":"Matej Ze\\v{c}evi\\'c and Moritz Willig and Devendra Singh Dhami and\n  Kristian Kersting","title":"Causal Parrots: Large Language Models May Talk Causality But Are Not\n  Causal","comments":"Published in Transactions in Machine Learning Research (TMLR)\n  (08/2023). Main paper: 17 pages, References: 3 pages, Appendix: 7 pages.\n  Figures: 5 main, 3 appendix. Tables: 3 main","journal-ref":"Transactions in Machine Learning Research (08/2023)","doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Some argue scale is all what is needed to achieve AI, covering even causal\nmodels. We make it clear that large language models (LLMs) cannot be causal and\ngive reason onto why sometimes we might feel otherwise. To this end, we define\nand exemplify a new subgroup of Structural Causal Model (SCM) that we call meta\nSCM which encode causal facts about other SCM within their variables. We\nconjecture that in the cases where LLM succeed in doing causal inference,\nunderlying was a respective meta SCM that exposed correlations between causal\nfacts in natural language on whose data the LLM was ultimately trained. If our\nhypothesis holds true, then this would imply that LLMs are like parrots in that\nthey simply recite the causal knowledge embedded in the data. Our empirical\nanalysis provides favoring evidence that current LLMs are even weak `causal\nparrots.'\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:23:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ze\u010devi\u0107","Matej",""],["Willig","Moritz",""],["Dhami","Devendra Singh",""],["Kersting","Kristian",""]]}
{"id":"2308.13068","submitter":"Mohamed El Amine Sehili","authors":"Mohamed El Amine Sehili and Zonghua Zhang","title":"Multivariate Time Series Anomaly Detection: Fancy Algorithms and Flawed\n  Evaluation Methodology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.PF stat.CO stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multivariate Time Series (MVTS) anomaly detection is a long-standing and\nchallenging research topic that has attracted tremendous research effort from\nboth industry and academia recently. However, a careful study of the literature\nmakes us realize that 1) the community is active but not as organized as other\nsibling machine learning communities such as Computer Vision (CV) and Natural\nLanguage Processing (NLP), and 2) most proposed solutions are evaluated using\neither inappropriate or highly flawed protocols, with an apparent lack of\nscientific foundation. So flawed is one very popular protocol, the so-called\n\\pa protocol, that a random guess can be shown to systematically outperform\n\\emph{all} algorithms developed so far. In this paper, we review and evaluate\nmany recent algorithms using more robust protocols and discuss how a normally\ngood protocol may have weaknesses in the context of MVTS anomaly detection and\nhow to mitigate them. We also share our concerns about benchmark datasets,\nexperiment design and evaluation methodology we observe in many works.\nFurthermore, we propose a simple, yet challenging, baseline algorithm based on\nPrincipal Components Analysis (PCA) that surprisingly outperforms many recent\nDeep Learning (DL) based approaches on popular benchmark datasets. The main\nobjective of this work is to stimulate more effort towards important aspects of\nthe research such as data, experiment design, evaluation methodology and result\ninterpretability, instead of putting the highest weight on the design of\nincreasingly more complex and \"fancier\" algorithms.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:24:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sehili","Mohamed El Amine",""],["Zhang","Zonghua",""]]}
{"id":"2308.13069","submitter":"Vladimir Vovk","authors":"Vladimir Vovk","title":"The diachronic Bayesian","comments":"19 pages","journal-ref":null,"doi":null,"report-no":"GTP 64","categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is well known that a Bayesian's probability forecast for the future\nobservations should form a probability measure in order to satisfy natural\nconditions of coherency. The topic of this paper is the evolution of the\nBayesian's probability measure in time. We model the process of updating the\nBayesian's beliefs in terms of prediction markets. The resulting picture is\nadapted to forecasting several steps ahead and making almost optimal decisions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:24:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Vovk","Vladimir",""]]}
{"id":"2308.13070","submitter":"Henda Mansour","authors":"Henda Mansour, Bibhushan Shakya","title":"On Particle Production from Phase Transition Bubbles","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"DESY-23-121, TTP23-033, P3H-23-056","categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While first order phase transitions (FOPTs) have been extensively studied as\npromising cosmological sources of gravitational waves, the phenomenon of\nparticle production from the dynamics of the background field during FOPTs has\nreceived relatively little attention in the literature, where it has only been\nstudied with semi-analytic estimates in some simplified settings. This paper\nprovides improved numerical studies of this effect in more realistic\nframeworks, revealing important qualitative details that have been missed in\nthe literature. We also provide easy to use analytic formulae that can be used\nto calculate particle production in generic FOPT setups.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:25:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mansour","Henda",""],["Shakya","Bibhushan",""]]}
{"id":"2308.13071","submitter":"Pu-Ting Yu","authors":"Pu-Ting Yu","title":"Frame-normalizable Sequences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA math.FA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Let $H$ be a separable Hilbert space and let $\\{x_n\\}$ be a sequence in $H$\nthat does not contain any zero elements. We say that $\\{x_n\\}$ is a\n\\emph{Bessel-normalizable} or \\emph{frame-normalizable} sequence if the\nnormalized sequence $\\{\\frac{x_n}{\\|x_n\\|}\\}$ is a Bessel sequence or a frame\nfor $H$, respectively. In this paper, several necessary and sufficient\nconditions for sequences to be frame-normalizable and not frame-normalizable\nare proved. Perturbation theorems for frame-normalizable sequences are also\nproved. As applications, we show that the Balazs-Stoeva conjecture %\\cite{BS11}\nholds for Bessel-normalizable sequences. Finally, we apply our results to\npartially answer the open question raised by Aldroubi et al.\\ %\\cite{ACMCP16}\nas to whether the iterative system $\\{\\frac{A^n x}{\\|A^nx\\|}\\}_{n\\geq 0,\\, x\\in\nS}$ associated with a normal operator $A\\colon H\\rightarrow H$ and a countable\nsubset $S$ of $H$, is a frame for $H$. In particular, if $S$ is finite, then we\nare able to show that $\\{\\frac{A^n x}{\\|A^nx\\|}\\}_{n\\geq 0,\\, x\\in S}$ is not a\nframe for $H$ whenever $\\{A^nx\\}_{n\\geq 0,\\,x\\in S}$ is a frame for $H$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:27:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yu","Pu-Ting",""]]}
{"id":"2308.13072","submitter":"Mingzhe Hu","authors":"Shaoyan Pan, Elham Abouei, Junbo Peng, Joshua Qian, Jacob F Wynne,\n  Tonghe Wang, Chih-Wei Chang, Justin Roper, Jonathon A Nye, Hui Mao, Xiaofeng\n  Yang","title":"Full-dose PET Synthesis from Low-dose PET Using High-efficiency\n  Diffusion Denoising Probabilistic Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To reduce the risks associated with ionizing radiation, a reduction of\nradiation exposure in PET imaging is needed. However, this leads to a\ndetrimental effect on image contrast and quantification. High-quality PET\nimages synthesized from low-dose data offer a solution to reduce radiation\nexposure. We introduce a diffusion-model-based approach for estimating\nfull-dose PET images from low-dose ones: the PET Consistency Model (PET-CM)\nyielding synthetic quality comparable to state-of-the-art diffusion-based\nsynthesis models, but with greater efficiency. There are two steps: a forward\nprocess that adds Gaussian noise to a full dose PET image at multiple\ntimesteps, and a reverse diffusion process that employs a PET Shifted-window\nVision Transformer (PET-VIT) network to learn the denoising procedure\nconditioned on the corresponding low-dose PETs. In PET-CM, the reverse process\nlearns a consistency function for direct denoising of Gaussian noise to a clean\nfull-dose PET. We evaluated the PET-CM in generating full-dose images using\nonly 1/8 and 1/4 of the standard PET dose. Comparing 1/8 dose to full-dose\nimages, PET-CM demonstrated impressive performance with normalized mean\nabsolute error (NMAE) of 1.233+/-0.131%, peak signal-to-noise ratio (PSNR) of\n33.915+/-0.933dB, structural similarity index (SSIM) of 0.964+/-0.009, and\nnormalized cross-correlation (NCC) of 0.968+/-0.011, with an average generation\ntime of 62 seconds per patient. This is a significant improvement compared to\nthe state-of-the-art diffusion-based model with PET-CM reaching this result 12x\nfaster. In the 1/4 dose to full-dose image experiments, PET-CM is also\ncompetitive, achieving an NMAE 1.058+/-0.092%, PSNR of 35.548+/-0.805dB, SSIM\nof 0.978+/-0.005, and NCC 0.981+/-0.007 The results indicate promising low-dose\nPET image quality improvements for clinical applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:29:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pan","Shaoyan",""],["Abouei","Elham",""],["Peng","Junbo",""],["Qian","Joshua",""],["Wynne","Jacob F",""],["Wang","Tonghe",""],["Chang","Chih-Wei",""],["Roper","Justin",""],["Nye","Jonathon A",""],["Mao","Hui",""],["Yang","Xiaofeng",""]]}
{"id":"2308.13073","submitter":"Shuja Khalid","authors":"Shuja Khalid, Frank Rudzicz","title":"SurGNN: Explainable visual scene understanding and assessment of\n  surgical skill using graph neural networks","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores how graph neural networks (GNNs) can be used to enhance\nvisual scene understanding and surgical skill assessment. By using GNNs to\nanalyze the complex visual data of surgical procedures represented as graph\nstructures, relevant features can be extracted and surgical skill can be\npredicted. Additionally, GNNs provide interpretable results, revealing the\nspecific actions, instruments, or anatomical structures that contribute to the\npredicted skill metrics. This can be highly beneficial for surgical educators\nand trainees, as it provides valuable insights into the factors that contribute\nto successful surgical performance and outcomes. SurGNN proposes two concurrent\napproaches -- one supervised and the other self-supervised. The paper also\nbriefly discusses other automated surgical skill evaluation techniques and\nhighlights the limitations of hand-crafted features in capturing the\nintricacies of surgical expertise. We use the proposed methods to achieve\nstate-of-the-art results on EndoVis19, and custom datasets. The working\nimplementation of the code can be found at https://github.com/<redacted>.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:32:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Khalid","Shuja",""],["Rudzicz","Frank",""]]}
{"id":"2308.13074","submitter":"Srivathsan Gnanasekaran Morkonda","authors":"Srivathsan G. Morkonda, Sonia Chiasson, Paul C. van Oorschot","title":"Influences of Displaying Permission-related Information on Web Single\n  Sign-On Login Decisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Web users are increasingly presented with multiple login options, including\npassword-based login and common web single sign-on (SSO) login options such as\n\"Login with Google\" and \"Login with Facebook\". There has been little focus in\nprevious studies on how users choose from a list of login options and how to\nbetter inform users about privacy issues in web SSO systems. In this paper, we\nconducted a 200-participant study to understand factors that influence\nparticipants' login decisions, and how they are affected by displaying\npermission differences across login options; permissions in SSO result in\nrelease of user personal information to third-party web sites through SSO\nidentity providers. We compare and report on login decisions made by\nparticipants before and after viewing permission-related information, examine\nself-reported responses for reasons related to their login decisions, and\nreport on the factors that motivated their choices. We find that usability\npreferences and inertia causes (habituation) were among the dominant factors\ninfluencing login decisions. After participants viewed permission-related\ninformation, many prioritised privacy over other factors, changing their login\ndecisions to more privacy-friendly alternatives. Displaying permission-related\ninformation also influenced some participants to make tradeoffs between privacy\nand usability preferences.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:35:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Morkonda","Srivathsan G.",""],["Chiasson","Sonia",""],["van Oorschot","Paul C.",""]]}
{"id":"2308.13075","submitter":"Felipe Voloch","authors":"Brendan Creutz, Jos\\'e Felipe Voloch","title":"The Brauer-Manin obstruction for nonisotrivial curves over global\n  function fields","comments":"With an appendix by Damian R\\\"ossler","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the set of rational points on a nonisotrivial curves of genus\nat least 2 over a global function field is equal to the set of adelic points\ncut out by the Brauer-Manin obstruction.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:43:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Creutz","Brendan",""],["Voloch","Jos\u00e9 Felipe",""]]}
{"id":"2308.13076","submitter":"Sayak Saha Roy","authors":"Sayak Saha Roy, Ohad Gilbar, Christina Palantza, Maxine Davis, Shirin\n  Nilizadeh","title":"Exploring Gender-Based Toxic Speech on Twitter in Context of the #MeToo\n  movement: A Mixed Methods Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The #MeToo movement has catalyzed widespread public discourse surrounding\nsexual harassment and assault, empowering survivors to share their stories and\nholding perpetrators accountable. While the movement has had a substantial and\nlargely positive influence, this study aims to examine the potential negative\nconsequences in the form of increased hostility against women and men on the\nsocial media platform Twitter. By analyzing tweets shared between October 2017\nand January 2020 by more than 47.1k individuals who had either disclosed their\nown sexual abuse experiences on Twitter or engaged in discussions about the\nmovement, we identify the overall increase in gender-based hostility towards\nboth women and men since the start of the movement. We also monitor 16 pivotal\nreal-life events that shaped the #MeToo movement to identify how these events\nmay have amplified negative discussions targeting the opposite gender on\nTwitter. Furthermore, we conduct a thematic content analysis of a subset of\ngender-based hostile tweets, which helps us identify recurring themes and\nunderlying motivations driving the expressions of anger and resentment from\nboth men and women concerning the #MeToo movement. This study highlights the\nneed for a nuanced understanding of the impact of social movements on online\ndiscourse and underscores the importance of addressing gender-based hostility\nin the digital sphere.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:45:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Roy","Sayak Saha",""],["Gilbar","Ohad",""],["Palantza","Christina",""],["Davis","Maxine",""],["Nilizadeh","Shirin",""]]}
{"id":"2308.13077","submitter":"Swetha Sirnam","authors":"Swetha Sirnam, Mamshad Nayeem Rizve, Nina Shvetsova, Hilde Kuehne,\n  Mubarak Shah","title":"Preserving Modality Structure Improves Multi-Modal Learning","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Self-supervised learning on large-scale multi-modal datasets allows learning\nsemantically meaningful embeddings in a joint multi-modal representation space\nwithout relying on human annotations. These joint embeddings enable zero-shot\ncross-modal tasks like retrieval and classification. However, these methods\noften struggle to generalize well on out-of-domain data as they ignore the\nsemantic structure present in modality-specific embeddings. In this context, we\npropose a novel Semantic-Structure-Preserving Consistency approach to improve\ngeneralizability by preserving the modality-specific relationships in the joint\nembedding space. To capture modality-specific semantic relationships between\nsamples, we propose to learn multiple anchors and represent the multifaceted\nrelationship between samples with respect to their relationship with these\nanchors. To assign multiple anchors to each sample, we propose a novel\nMulti-Assignment Sinkhorn-Knopp algorithm. Our experimentation demonstrates\nthat our proposed approach learns semantically meaningful anchors in a\nself-supervised manner. Furthermore, our evaluation on MSR-VTT and YouCook2\ndatasets demonstrates that our proposed multi-anchor assignment based solution\nachieves state-of-the-art performance and generalizes to both inand\nout-of-domain datasets. Code: https://github.com/Swetha5/Multi_Sinkhorn_Knopp\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:46:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sirnam","Swetha",""],["Rizve","Mamshad Nayeem",""],["Shvetsova","Nina",""],["Kuehne","Hilde",""],["Shah","Mubarak",""]]}
{"id":"2308.13078","submitter":"Guillermo Henry","authors":"Guillermo Henry and Jimmy Petean","title":"Negative eingenvalues of the conformal Laplacian","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $M$ be a closed differentiable manifold of dimension at least $3$. Let\n$\\Lambda_0 (M)$ be the minimun number of non-positive eigenvalues that the\nconformal Laplacian of a metric on $M$ can have. We prove that for any $k$\ngreater than or equal to $\\Lambda_0 (M)$, there exists a Riemannian metric on\n$M$ such that its conformal Laplacian has exactly $k$ negative eigenvalues.\nAlso, we discuss upper bounds for $\\Lambda_0 (M)$.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:49:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Henry","Guillermo",""],["Petean","Jimmy",""]]}
{"id":"2308.13079","submitter":"Thomas Keefe","authors":"Thomas H. Keefe and J.S. Marron","title":"Powerful Significance Testing for Unbalanced Clusters","comments":"23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Clustering methods are popular for revealing structure in data, particularly\nin the high-dimensional setting common to contemporary data science. A central\nstatistical question is, \"are the clusters really there?\" One pioneering method\nin statistical cluster validation is SigClust, but it is severely underpowered\nin the important setting where the candidate clusters have unbalanced sizes,\nsuch as in rare subtypes of disease. We show why this is the case, and propose\na remedy that is powerful in both the unbalanced and balanced settings, using a\nnovel generalization of k-means clustering. We illustrate the value of our\nmethod using a high-dimensional dataset of gene expression in kidney cancer\npatients. A Python implementation is available at\nhttps://github.com/thomaskeefe/sigclust.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:50:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Keefe","Thomas H.",""],["Marron","J. S.",""]]}
{"id":"2308.13080","submitter":"Zhite Yu","authors":"Zhite Yu","title":"Exclusive QCD Factorization and Single Transverse Polarization Phenomena\n  at High-Energy Colliders","comments":"Ph.D. thesis. 417 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This Ph.D.~thesis is divided into two distinct parts. The first part focuses\non hard exclusive scattering processes in Quantum Chromodynamics (QCD) at high\nenergies, while the second part delves into spin phenomena at the Large Hadron\nCollider (LHC).\n  Hard exclusive scattering processes play a crucial role in QCD at high\nenergies, providing unique insights into the confined partonic dynamics within\nhadrons, complementing inclusive processes. Studying these processes within the\nQCD factorization approach yields the generalized parton distribution (GPD), a\nnonperturbative parton correlation function that offers a three-dimensional\ntomographic parton image within a hadron. However, the experimental measurement\nof these processes poses significant challenges. This thesis will review the\nfactorization formalism for related processes, examine the limitations of some\nwidely used processes, and introduce two novel processes that enhance the\nsensitivity to GPD, particularly its dependence on the parton momentum fraction\n$x$.\n  The second part of the thesis centers on spin phenomena, specifically single\nspin production, at the LHC. Noting that a single transverse polarization can\nbe generated even in an unpolarized collision, this research proposes two new\njet substructure observables: one for boosted top quark jets and another for\nhigh-energy gluon jets. The observation of these phenomena paves the way for\ninnovative tools in LHC phenomenology, enabling both precision measurements and\nthe search for new physics.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:55:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yu","Zhite",""]]}
{"id":"2308.13081","submitter":"Atiyah Elsheikh","authors":"Atiyah Elsheikh","title":"Formal specification terminology for demographic agent-based models of\n  fixed-step single-clocked simulations","comments":"arXiv admin note: substantial text overlap with arXiv:2307.16548","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This document presents adequate formal terminology for the mathematical\nspecification of a subset of Agent Based Models (ABMs) in the field of\nDemography. The simulation of the targeted ABMs follows a fixed-step\nsingle-clocked pattern. The proposed terminology further improves the model\nunderstanding and can act as a stand-alone methodology for the specification\nand optionally the documentation of a significant set of (demographic) ABMs.\nNevertheless, it is imaginable the this terminology probably with further\nextensions can be merged with the largely-informal widely-used model\ndocumentation and communication O.D.D. protocol [Grimm and et al., 2020,\nAmouroux et al., 2010] to reduce many sources of ambiguity, hindering model\nreplications by other modelers. A published demographic model documentation,\nlargely simplified version of the Lone Parent Model [Gostoli and Silverman,\n2020] is separately published in [Elsheikh, 2023b] as illustration for the\nformal terminology. The model was implemented in the Julia language [Elsheikh,\n2023a] based on the Agents.jl julia package [Datseris et al., 2022].\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:57:07 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:16:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Elsheikh","Atiyah",""]]}
{"id":"2308.13082","submitter":"Jan Warchocki","authors":"Jan Warchocki, Teodor Oprescu, Yunhan Wang, Alexandru Damacus, Paul\n  Misterka, Robert-Jan Bruintjes, Attila Lengyel, Ombretta Strafforello, Jan\n  van Gemert","title":"Benchmarking Data Efficiency and Computational Efficiency of Temporal\n  Action Localization Models","comments":"Accepted to the CVEU workshop at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In temporal action localization, given an input video, the goal is to predict\nwhich actions it contains, where they begin, and where they end. Training and\ntesting current state-of-the-art deep learning models requires access to large\namounts of data and computational power. However, gathering such data is\nchallenging and computational resources might be limited. This work explores\nand measures how current deep temporal action localization models perform in\nsettings constrained by the amount of data or computational power. We measure\ndata efficiency by training each model on a subset of the training set. We find\nthat TemporalMaxer outperforms other models in data-limited settings.\nFurthermore, we recommend TriDet when training time is limited. To test the\nefficiency of the models during inference, we pass videos of different lengths\nthrough each model. We find that TemporalMaxer requires the least computational\nresources, likely due to its simple architecture.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:59:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Warchocki","Jan",""],["Oprescu","Teodor",""],["Wang","Yunhan",""],["Damacus","Alexandru",""],["Misterka","Paul",""],["Bruintjes","Robert-Jan",""],["Lengyel","Attila",""],["Strafforello","Ombretta",""],["van Gemert","Jan",""]]}
{"id":"2308.13083","submitter":"Kaustubh Roy","authors":"Kaustubh Roy and Elio J. K\\\"onig","title":"$\\mathbb{Z}_N$ lattice gauge theories with matter fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by the exotic phenomenology of certain quantum materials and recent\nadvances in programmable quantum emulators, we here study fermions and bosons\nin $\\mathbb Z_N$ lattice gauge theories. We introduce a family of exactly\nsoluble models, and characterize their orthogonal (semi-)metallic ground\nstates, the excitation spectrum, and the correlation functions. We further\nstudy integrability breaking perturbations using an appropriately derived set\nof Feynman diagrammatic rules and borrowing physics associated to Anderson's\northogonality catastrophe. In the context of the ground states, we revisit\nLuttinger's theorem following Oshikawa's flux insertion argument and\nfurthermore demonstrate the existence of a Luttinger surface of zeros in the\nfermionic Green's function. Upon inclusion of perturbations, we address the\ntransition from the orthogonal metal to the normal state by condensation of\ncertain excitations in the gauge sectors, so-called ``$e$-particles''. We\nfurthermore discuss the effect of dynamics in the dual ``$m$-particle''\nexcitations, which ultimately leads to the formation of charge-neutral hadronic\n$N$-particle bound states. We present analytical arguments for the most\nimportant phases and estimates for phase boundaries of the model. Specifically,\nand in sharp distinction to quasi-1D $\\mathbb Z_N$ lattice gauge theories,\nrenormalization group arguments imply that the phase diagram does not include\nan emergent deconfining $U(1)$ phase. Therefore, in regards to lattice QED\nproblems, $\\mathbb Z_N$ quantum emulators with $N<\\infty$ can at best be used\nfor approximate solutions at intermediate length scales.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:05:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Roy","Kaustubh",""],["K\u00f6nig","Elio J.",""]]}
{"id":"2308.13084","submitter":"Juan Pablo Alcon Apaza","authors":"Juan A. Apaza and Manass\\'es de Souza","title":"Removable singularities in the boundary for quasilinear elliptic\n  equations","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we are interested in to study removability of a singular set in\nthe boundary for some classes of quasilinear elliptic equations. We will\napproach this question in two different ways: through an asymptotic behavior at\nthe infinity of the solutions, or through conditions in the Sobolev norm of\nsolutions along the direction of the singular set.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:09:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Apaza","Juan A.",""],["de Souza","Manass\u00e9s",""]]}
{"id":"2308.13085","submitter":"Camila Olarte Parra","authors":"Camila Olarte Parra, Rhian M. Daniel, David Wright and Jonathan W.\n  Bartlett","title":"Estimating hypothetical estimands with causal inference and missing data\n  estimators in a diabetes trial","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The recently published ICH E9 addendum on estimands in clinical trials\nprovides a framework for precisely defining the treatment effect that is to be\nestimated, but says little about estimation methods. Here we report analyses of\na clinical trial in type 2 diabetes, targeting the effects of randomised\ntreatment, handling rescue treatment and discontinuation of randomised\ntreatment using the so-called hypothetical strategy. We show how this can be\nestimated using mixed models for repeated measures, multiple imputation,\ninverse probability of treatment weighting, G-formula and G-estimation. We\ndescribe their assumptions and practical details of their implementation using\npackages in R. We report the results of these analyses, broadly finding similar\nestimates and standard errors across the estimators. We discuss various\nconsiderations relevant when choosing an estimation approach, including\ncomputational time, how to handle missing data, whether to include post\nintercurrent event data in the analysis, whether and how to adjust for\nadditional time-varying confounders, and whether and how to model different\ntypes of ICE separately.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:10:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Parra","Camila Olarte",""],["Daniel","Rhian M.",""],["Wright","David",""],["Bartlett","Jonathan W.",""]]}
{"id":"2308.13086","submitter":"Sudeep Pasricha","authors":"Sirui Qi, Dejan Milojicic, Cullen Bash, Sudeep Pasricha","title":"SHIELD: Sustainable Hybrid Evolutionary Learning Framework for Carbon,\n  Wastewater, and Energy-Aware Data Center Management","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.LG cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Today's cloud data centers are often distributed geographically to provide\nrobust data services. But these geo-distributed data centers (GDDCs) have a\nsignificant associated environmental impact due to their increasing carbon\nemissions and water usage, which needs to be curtailed. Moreover, the energy\ncosts of operating these data centers continue to rise. This paper proposes a\nnovel framework to co-optimize carbon emissions, water footprint, and energy\ncosts of GDDCs, using a hybrid workload management framework called SHIELD that\nintegrates machine learning guided local search with a decomposition-based\nevolutionary algorithm. Our framework considers geographical factors and\ntime-based differences in power generation/use, costs, and environmental\nimpacts to intelligently manage workload distribution across GDDCs and data\ncenter operation. Experimental results show that SHIELD can realize 34.4x\nspeedup and 2.1x improvement in Pareto Hypervolume while reducing the carbon\nfootprint by up to 3.7x, water footprint by up to 1.8x, energy costs by up to\n1.3x, and a cumulative improvement across all objectives (carbon, water, cost)\nof up to 4.8x compared to the state-of-the-art.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:11:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Qi","Sirui",""],["Milojicic","Dejan",""],["Bash","Cullen",""],["Pasricha","Sudeep",""]]}
{"id":"2308.13087","submitter":"H\\'ector Jard\\'on-S\\'anchez","authors":"H\\'ector Jard\\'on-S\\'anchez","title":"Applications of tree decompositions and accessibility to treeability of\n  Borel graphs","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A framework to handle tree decompositions of the components of a Borel graph\nin a Borel fashion is introduced, along the lines of Tserunyan's Stallings\nTheorem for equivalence relations arXiv:1805.09506. This setting leads to a\nnotion of accessibility for Borel graphs, together with a treeability\ncriterion. This criterion is applied to show that, in particular, Borel\nequivalence relations associated to Borel graphs with accessible planar\nconnected components are measure treeable, generalising results of Conley,\nGaboriau, Marks, and Tucker-Drob arXiv:2104.07431 and Timar arXiv:1910.01307.\nIt is also proven that uniformly locally finite Borel graphs with components of\nfinite tree-width yield Borel treeable equivalence relations. Our results imply\nthat p.m.p countable Borel equivalence relations with measured property (T) do\nnot admit locally finite graphings with planar components a.s.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:12:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jard\u00f3n-S\u00e1nchez","H\u00e9ctor",""]]}
{"id":"2308.13088","submitter":"Henry Williams","authors":"Aakaash Salvaji, Harry Taylor, David Valencia, Trevor Gee, Henry\n  Williams","title":"Racing Towards Reinforcement Learning based control of an Autonomous\n  Formula SAE Car","comments":"Accepted at the Australasian Conference on Robotics and Automation\n  (ACRA 2022)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  With the rising popularity of autonomous navigation research, Formula Student\n(FS) events are introducing a Driverless Vehicle (DV) category to their event\nlist. This paper presents the initial investigation into utilising Deep\nReinforcement Learning (RL) for end-to-end control of an autonomous FS race car\nfor these competitions. We train two state-of-the-art RL algorithms in\nsimulation on tracks analogous to the full-scale design on a Turtlebot2\nplatform. The results demonstrate that our approach can successfully learn to\nrace in simulation and then transfer to a real-world racetrack on the physical\nplatform. Finally, we provide insights into the limitations of the presented\napproach and guidance into the future directions for applying RL toward\nfull-scale autonomous FS racing.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:16:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Salvaji","Aakaash",""],["Taylor","Harry",""],["Valencia","David",""],["Gee","Trevor",""],["Williams","Henry",""]]}
{"id":"2308.13089","submitter":"Pranav Narayanan Venkit","authors":"Pranav Narayanan Venkit","title":"Towards a Holistic Approach: Understanding Sociodemographic Biases in\n  NLP Models using an Interdisciplinary Lens","comments":null,"journal-ref":null,"doi":"10.1145/3600211.3604754","report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The rapid growth in the usage and applications of Natural Language Processing\n(NLP) in various sociotechnical solutions has highlighted the need for a\ncomprehensive understanding of bias and its impact on society. While research\non bias in NLP has expanded, several challenges persist that require attention.\nThese include the limited focus on sociodemographic biases beyond race and\ngender, the narrow scope of analysis predominantly centered on models, and the\ntechnocentric implementation approaches. This paper addresses these challenges\nand advocates for a more interdisciplinary approach to understanding bias in\nNLP. The work is structured into three facets, each exploring a specific aspect\nof bias in NLP.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:19:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Venkit","Pranav Narayanan",""]]}
{"id":"2308.13090","submitter":"Kostas Mouloudakis","authors":"K. Mouloudakis, F. Vouzinas, A. Margaritakis, A. Koutsimpela, G.\n  Mouloudakis, V. Koutrouli, M. Skotiniotis, G. P. Tsironis, M. Loulakis, M. W.\n  Mitchell, G. Vasilakis, I. K. Kominis","title":"Inter-species spin-noise correlations in hot atomic vapors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report an experimental and theoretical study of spin noise correlations in\na $^{87}$Rb-$^{133}$Cs unpolarized alkali-metal vapor dominated by\nspin-exchange collisions. We observe strong unequal-time inter-species\ncorrelations and account for these with a first-principles theoretical model.\nSince the two atomic species have different spin precession frequencies, the\ndual-species vapor enables the use of an additional experimental handle, the\napplied magnetic field, for untangling various sub-types of spin correlations.\nIn particular, the measured cross-correlation and auto-correlation spectra shed\nlight on a number of spin-dynamic effects involving intra-atom, inter-atom,\nintra-species and inter-species correlations. Cross-correlation coefficients\nexceeding $60\\%$ have been observed at low-magnetic fields, where the two spin\nspecies couple strongly via spin-exchange collisions. The understanding of such\nspontaneously generated correlations can motivate the design of\nquantum-enhanced measurements with single or multi-species spin-polarized\nalkali-metal vapors used in quantum sensing applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:23:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mouloudakis","K.",""],["Vouzinas","F.",""],["Margaritakis","A.",""],["Koutsimpela","A.",""],["Mouloudakis","G.",""],["Koutrouli","V.",""],["Skotiniotis","M.",""],["Tsironis","G. P.",""],["Loulakis","M.",""],["Mitchell","M. W.",""],["Vasilakis","G.",""],["Kominis","I. K.",""]]}
{"id":"2308.13091","submitter":"Laxmi Parida","authors":"Saugata Basu and Laxmi Parida","title":"Quantum Analog of Shannon's Lower Bound Theorem","comments":"Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Shannon proved that almost all Boolean functions require a circuit of size\n$\\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in\nthe classical case the number of quantum circuits of any fixed size that we\nallow is uncountably infinite. Our main tool is a classical result in real\nalgebraic geometry bounding the number of realizable sign conditions of any\nfinite set of real polynomials in many variables.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:31:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Basu","Saugata",""],["Parida","Laxmi",""]]}
{"id":"2308.13092","submitter":"Andrew Tasman Powis","authors":"Andrew T. Powis, and Igor D. Kaganovich","title":"Accuracy of the Explicit Energy-Conserving Particle-in-Cell Method for\n  Under-resolved Simulations of Capacitively Coupled Plasma Discharges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The traditional explicit electrostatic momentum-conserving Particle-in-cell\nalgorithm requires strict resolution of the electron Debye length to deliver\nnumerical accuracy. The explicit electrostatic energy-conserving\nParticle-in-Cell algorithm alleviates this constraint with minimal modification\nto the traditional algorithm, retaining its simplicity and ease of\nparallelization and acceleration on modern supercomputing architectures. In\nthis article we apply the algorithm to model a one-dimensional radio-frequency\ncapacitively coupled plasma discharge relevant to industrial applications. The\nenergy-conserving approach closely matches the results from the\nmomentum-conserving algorithm and retains accuracy even for cell sizes up to 8x\nthe electron Debye length. For even larger cells the algorithm loses accuracy\ndue to poor resolution of steep gradients in the radio-frequency sheath. This\ncan be amended by introducing a non-uniform grid, which allows for accurate\nsimulations with 9.4x fewer cells than the fully resolved case, an improvement\nthat will be compounded in higher-dimensional simulations. We therefore\nconsider the explicit energy-conserving algorithm as a promising approach to\nsignificantly reduce the computational cost of full-scale device simulations\nand a pathway to delivering kinetic simulation capabilities of use to industry.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:32:36 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 16:59:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Powis","Andrew T.",""],["Kaganovich","Igor D.",""]]}
{"id":"2308.13093","submitter":"Omkar Parkhi","authors":"Nikhil Raina, Guruprasad Somasundaram, Kang Zheng, Steve Saarinen,\n  Jeff Messiner, Mark Schwesinger, Luis Pesqueira, Ishita Prasad, Edward\n  Miller, Prince Gupta, Mingfei Yan, Richard Newcombe, Carl Ren, Omkar M Parkhi","title":"EgoBlur: Responsible Innovation in Aria","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Project Aria pushes the frontiers of Egocentric AI with large-scale\nreal-world data collection using purposely designed glasses with privacy first\napproach. To protect the privacy of bystanders being recorded by the glasses,\nour research protocols are designed to ensure recorded video is processed by an\nAI anonymization model that removes bystander faces and vehicle license plates.\nDetected face and license plate regions are processed with a Gaussian blur such\nthat these personal identification information (PII) regions are obscured. This\nprocess helps to ensure that anonymized versions of the video is retained for\nresearch purposes. In Project Aria, we have developed a state-of-the-art\nanonymization system EgoBlur. In this paper, we present extensive analysis of\nEgoBlur on challenging datasets comparing its performance with other\nstate-of-the-art systems from industry and academia including extensive\nResponsible AI analysis on recently released Casual Conversations V2 dataset.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:36:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Raina","Nikhil",""],["Somasundaram","Guruprasad",""],["Zheng","Kang",""],["Saarinen","Steve",""],["Messiner","Jeff",""],["Schwesinger","Mark",""],["Pesqueira","Luis",""],["Prasad","Ishita",""],["Miller","Edward",""],["Gupta","Prince",""],["Yan","Mingfei",""],["Newcombe","Richard",""],["Ren","Carl",""],["Parkhi","Omkar M",""]]}
{"id":"2308.13094","submitter":"Takamichi Miyata Ph.D.","authors":"Takamichi Miyata","title":"Interpretable Image Quality Assessment via CLIP with Multiple\n  Antonym-Prompt Pairs","comments":"2pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  No reference image quality assessment (NR-IQA) is a task to estimate the\nperceptual quality of an image without its corresponding original image. It is\neven more difficult to perform this task in a zero-shot manner, i.e., without\ntask-specific training. In this paper, we propose a new zero-shot and\ninterpretable NRIQA method that exploits the ability of a pre-trained\nvisionlanguage model to estimate the correlation between an image and a textual\nprompt. The proposed method employs a prompt pairing strategy and multiple\nantonym-prompt pairs corresponding to carefully selected descriptive features\ncorresponding to the perceptual image quality. Thus, the proposed method is\nable to identify not only the perceptual quality evaluation of the image, but\nalso the cause on which the quality evaluation is based. Experimental results\nshow that the proposed method outperforms existing zero-shot NR-IQA methods in\nterms of accuracy and can evaluate the causes of perceptual quality\ndegradation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:37:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Miyata","Takamichi",""]]}
{"id":"2308.13095","submitter":"Elena Lanina","authors":"A. Anokhina, E. Lanina, and A. Morozov","title":"Towards tangle calculus for Khovanov polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.GT math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide new evidence that the tangle calculus and \"evolution\" are\napplicable to the Khovanov polynomials for families of long braids inside the\nknot diagram. We show that jumps in evolution, peculiar for superpolynomials,\nare much less abundant than it was originally expected. Namely, for torus and\ntwist satellites of a fixed companion knot, the main (most complicated)\ncontribution does not jump, all jumps are concentrated in the torus and twist\npart correspondingly, where these jumps are necessary to make the Khovanov\npolynomial positive. Among other things, this opens a way to define a jump-free\npart of the colored Khovanov polynomials, which differs from the naive colored\npolynomial just \"infinitesimally\". The separation between jumping and smooth\nparts involves a combination of Rasmussen index and a new knot invariant, which\nwe call \"Thickness\".\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:41:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Anokhina","A.",""],["Lanina","E.",""],["Morozov","A.",""]]}
{"id":"2308.13096","submitter":"Shashank Pathrudkar","authors":"Shashank Pathrudkar, Ponkrshnan Thiagarajan, Shivang Agarwal, Amartya\n  S. Banerjee, Susanta Ghosh","title":"Electronic Structure Prediction of Multi-million Atom Systems Through\n  Uncertainty Quantification Enabled Transfer Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.dis-nn physics.comp-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ground state electron density - obtainable using Kohn-Sham Density\nFunctional Theory (KS-DFT) simulations - contains a wealth of material\ninformation, making its prediction via machine learning (ML) models attractive.\nHowever, the computational expense of KS-DFT scales cubically with system size\nwhich tends to stymie training data generation, making it difficult to develop\nquantifiably accurate ML models that are applicable across many scales and\nsystem configurations. Here, we address these fundamental challenges using\nBayesian neural networks and employ transfer learning to leverage the\nmulti-scale nature of the training data. Our ML models employ descriptors\ninvolving simple scalar products, comprehensively sample system configurations\nthrough thermalization, and quantify uncertainty in electron density\npredictions. We show that our models incur significantly lower data generation\ncosts while allowing confident - and when verifiable, accurate - predictions\nfor a wide variety of bulk systems well beyond training, including systems with\ndefects, different alloy compositions, and at unprecedented, multi-million-atom\nscales.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:41:29 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pathrudkar","Shashank",""],["Thiagarajan","Ponkrshnan",""],["Agarwal","Shivang",""],["Banerjee","Amartya S.",""],["Ghosh","Susanta",""]]}
{"id":"2308.13097","submitter":"Taaha Khan","authors":"Taaha Khan","title":"CompaCT: Fractal-Based Heuristic Pixel Segmentation for Lossless\n  Compression of High-Color DICOM Medical Images","comments":"(8/24/2023) v1a: 16 pages, 9 figures, Word PDF","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Medical image compression is a widely studied field of data processing due to\nits prevalence in modern digital databases. This domain requires a high color\ndepth of 12 bits per pixel component for accurate analysis by physicians,\nprimarily in the DICOM format. Standard raster-based compression of images via\nfiltering is well-known; however, it remains suboptimal in the medical domain\ndue to non-specialized implementations. This study proposes a lossless medical\nimage compression algorithm, CompaCT, that aims to target spatial features and\npatterns of pixel concentration for dynamically enhanced data processing. The\nalgorithm employs fractal pixel traversal coupled with a novel approach of\nsegmentation and meshing between pixel blocks for preprocessing. Furthermore,\ndelta and entropy coding are applied to this concept for a complete compression\npipeline. The proposal demonstrates that the data compression achieved via\nfractal segmentation preprocessing yields enhanced image compression results\nwhile remaining lossless in its reconstruction accuracy. CompaCT is evaluated\nin its compression ratios on 3954 high-color CT scans against the efficiency of\nindustry-standard compression techniques (i.e., JPEG2000, RLE, ZIP, PNG). Its\nreconstruction performance is assessed with error metrics to verify lossless\nimage recovery after decompression. The results demonstrate that CompaCT can\ncompress and losslessly reconstruct medical images, being 37% more\nspace-efficient than industry-standard compression systems.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:43:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Khan","Taaha",""]]}
{"id":"2308.13098","submitter":"Erik Vigren","authors":"Erik Vigren, Anders I. Eriksson, Niklas J. T. Edberg, Colin Snodgrass","title":"A Potential Aid in the Target Selection for the Comet Interceptor\n  Mission","comments":"Accepted for publication in Planetary and Space Science","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The upcoming Comet Interceptor mission involves a parking phase around the\nSun-Earth L2 point before transferring to intercept the orbit of a long period\ncomet, interstellar object or a back-up target in the form of a short-period\ncomet. The target is not certain to be known before the launch in 2029. During\nthe parking phase there may thus arise a scenario wherein a decision needs to\nbe taken of whether to go for a particular comet or whether to discard that\noption in the hope that a better target will appear within a reasonable time\nframe later on. We present an expectation value-based formalism that could aid\nin the associated decision making provided that outlined requirements for its\nimplementation exist.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:57:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Vigren","Erik",""],["Eriksson","Anders I.",""],["Edberg","Niklas J. T.",""],["Snodgrass","Colin",""]]}
{"id":"2308.13099","submitter":"Shashidhar Reddy Javaji","authors":"Krutika Sarode, Shashidhar Reddy Javaji","title":"Hybrid Genetic Algorithm and Hill Climbing Optimization for the Neural\n  Network","comments":"5 pages, 1 fig, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.AI cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a hybrid model combining genetic algorithm and hill\nclimbing algorithm for optimizing Convolutional Neural Networks (CNNs) on the\nCIFAR-100 dataset. The proposed model utilizes a population of chromosomes that\nrepresent the hyperparameters of the CNN model. The genetic algorithm is used\nfor selecting and breeding the fittest chromosomes to generate new offspring.\nThe hill climbing algorithm is then applied to the offspring to further\noptimize their hyperparameters. The mutation operation is introduced to\ndiversify the population and to prevent the algorithm from getting stuck in\nlocal optima. The Genetic Algorithm is used for global search and exploration\nof the search space, while Hill Climbing is used for local optimization of\npromising solutions. The objective function is the accuracy of the trained\nneural network on the CIFAR-100 test set. The performance of the hybrid model\nis evaluated by comparing it with the standard genetic algorithm and\nhill-climbing algorithm. The experimental results demonstrate that the proposed\nhybrid model achieves better accuracy with fewer generations compared to the\nstandard algorithms. Therefore, the proposed hybrid model can be a promising\napproach for optimizing CNN models on large datasets.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:03:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sarode","Krutika",""],["Javaji","Shashidhar Reddy",""]]}
{"id":"2308.13100","submitter":"Ankur Gupta","authors":"Filipe Henrique, Pawel J. Zuk and Ankur Gupta","title":"Kirchhoff's Laws for Electric-Double-Layer Charging in Arbitrary Porous\n  Networks","comments":"27 pages and 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the dynamics of electric-double-layer (EDL) charging in porous\nmedia is essential for advancements in next-generation energy storage devices.\nDue to the high computational demands of direct numerical simulations and a\nlack of interfacial boundary conditions for reduced-order models, the current\nunderstanding of EDL charging is limited to simple geometries. Here, we present\na theoretical framework to predict EDL charging in arbitrary networks of long\npores in the Debye-H\\\"uckel limit without restrictions on EDL thickness and\npore radii. We demonstrate that electrolyte transport is described by\nKirchhoff's laws in terms of the electrochemical potential of charge (the\nvalence-weighted average of the ion electrochemical potentials) instead of the\nelectric potential. By employing this equivalent circuit representation with\nmodified Kirchhoff's laws, our methodology accurately captures the spatial and\ntemporal dependencies of charge density and electric potential, matching\nresults obtained from computationally intensive direct numerical simulations.\nOur framework provides results up to five orders of magnitude faster, enabling\nthe efficient simulation of thousands of pores within a day. We employ the\nframework to study the impact of pore connectivity and polydispersity on\nelectrode charging dynamics for pore networks and discuss how these factors\naffect the timescale, energy density, and power density of the capacitive\ncharging. The scalability and versatility of our methodology make it a rational\ntool for designing 3D-printed electrodes and for interpreting geometric effects\non electrode impedance spectroscopy measurements.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:10:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Henrique","Filipe",""],["Zuk","Pawel J.",""],["Gupta","Ankur",""]]}
{"id":"2308.13101","submitter":"Sonja Panjkov","authors":"Sonja Panjkov, Katie Auchettl, Benjamin J. Shappee, Aaron Do, Laura A.\n  Lopez, John F. Beacom","title":"Probing the Soft X-ray Properties and Multi-Wavelength Variability of\n  SN2023ixf and its Progenitor","comments":"27 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a detailed analysis of nearly two decades of optical/UV and X-ray\ndata to study the multi-wavelength pre-explosion properties and post-explosion\nX-ray properties of nearby SN2023ixf located in M101. We find no evidence of\nprecursor activity in the optical to UV down to a luminosity of $\\lesssim\n7\\times10^{4}\\, \\rm L_{\\odot}$, while X-ray observations covering nearly 18\nyears prior to explosion show no evidence of luminous precursor X-ray emission\ndown to an absorbed 0.3 - 10.0 keV X-ray luminosity of $\\sim6\\times10^{36}$ erg\ns$^{-1}$. Extensive Swift observations taken post-explosion did not detect soft\nX-ray emission from SN2023ixf within the first $\\sim$3.3 days after first\nlight, which suggests a mass-loss rate for the progenitor of\n$\\lesssim5\\times10^{-4}\\,\\rm M_{\\odot}$ yr$^{-1}$ or a radius of\n$\\lesssim4\\times10^{15}$ cm for the circumstellar material. Our analysis also\nsuggests that if the progenitor underwent a mass-loss episode, this had to\noccur $>$ 0.5 - 1.5 years prior to explosion, consistent with previous\nestimates. Swift detected soft X-rays from SN2023ixf $\\sim4.25$ days after\nfirst light, and it rose to a peak luminosity of $\\sim10^{39}$ erg s$^{-1}$\nafter 10 days and has maintained this luminosity for nearly 50 days post first\nlight. This peak luminosity is lower than expected, given the evidence that\nSN2023ixf is interacting with dense material. However, this might be a natural\nconsequence of an asymmetric circumstellar medium. X-ray spectra derived from\nmerging all Swift observations over the first 50 days are best described by a\ntwo-component bremsstrahlung model consisting of a heavily absorbed and hotter\ncomponent similar to that found using NuSTAR, and a less-absorbed, cooler\ncomponent. We suggest that this soft component arises from cooling of the\nforward shock similar to that found in Type IIn SN2010jl.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:20:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Panjkov","Sonja",""],["Auchettl","Katie",""],["Shappee","Benjamin J.",""],["Do","Aaron",""],["Lopez","Laura A.",""],["Beacom","John F.",""]]}
{"id":"2308.13102","submitter":"Stuart Raby","authors":"Herb Clemens and Stuart Raby","title":"The Absence of Observable Proton Decay in a Global $SU(5)$ F-theory\n  Model","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We begin with an $E_{8}\\times E_{8}$ Heterotic model broken to an\n$SU(5)_{gauge} \\times U(1)_{X}$ and a twin $SU(5)_{gauge} \\times U(1)_{X}$,\nwhere one $SU(5)$ and its spectrum is identified as the visible sector while\nthe other can be identified as a hidden twin sector. In both cases we obtain\nthe minimal supersymmetric standard model (MSSM) spectrum after Wilson-line\nsymmetry-breaking enhanced by a low energy R-parity and $\\mathbb{Z}_4^R$\nsymmetry. We argue that there will not be any observable proton decay in this\nmodel\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:27:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Clemens","Herb",""],["Raby","Stuart",""]]}
{"id":"2308.13103","submitter":"James Gardner","authors":"James W. Gardner, Ling Sun, Ssohrab Borhanian, Paul D. Lasky, Eric\n  Thrane, David E. McClelland, and Bram J. J. Slagmolen","title":"Multi-messenger astronomy with a Southern-Hemisphere gravitational-wave\n  observatory","comments":"v1, 13 pages, 7 figures. Submitted to PRD on August 24 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Joint observations of gravitational waves and electromagnetic counterparts\nwill answer questions about cosmology, gamma-ray bursts, and the behaviour of\nmatter at supranuclear densities. The addition of a Southern-Hemisphere\ngravitational-wave observatory to proposed global networks creates a longer\nbaseline, which is beneficial for sky localisation. We analyse how an\nobservatory in Australia can enhance the multi-messenger astronomy capabilities\nof future networks. We estimate the number of binary neutron star mergers with\njoint observations of gravitational waves and kilonova counterparts detectable\nby the Vera C. Rubin Observatory. First, we consider a network of upgrades to\ncurrent observatories. Adding an Australian observatory to a three-observatory\nnetwork (comprising two observatories in the USA and one in Europe) boosts the\nrate of joint observations from $2.5^{+4.5}_{-2.0}$ per year to\n$5.6^{+10}_{-4.5}$ per year (a factor of two improvement). Then, we consider a\nnetwork of next-generation observatories. Adding a $20$ km Australian\nobservatory to a global network of a Cosmic Explorer $40$ km in the USA and an\nEinstein Telescope in Europe only marginally increases the rate from\n$40^{+71}_{-32}$ per year to $44^{+79}_{-35}$ per year (a factor of 1.1\nimprovement). The addition of an Australian observatory, however, ensures that\nat least two observatories are online far more often. When the Cosmic Explorer\n$40$ km is offline for a major upgrade, the Australian observatory increases\nthe joint observation rate from $0.5^{+0.8}_{-0.4}$ per year to\n$38^{+68}_{-30}$ per year (a factor of 82 improvement). When the Einstein\nTelescope is offline, the joint observation rate increases from\n$0.2^{+0.3}_{-0.1}$ per year to $19^{+34}_{-15}$ per year (a factor of 113\nimprovement). We sketch out the broader science case for a Southern-Hemisphere\ngravitational-wave observatory.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:36:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gardner","James W.",""],["Sun","Ling",""],["Borhanian","Ssohrab",""],["Lasky","Paul D.",""],["Thrane","Eric",""],["McClelland","David E.",""],["Slagmolen","Bram J. J.",""]]}
{"id":"2308.13104","submitter":"Mohsen Nayebi Kerdabadi","authors":"Mohsen Nayebi Kerdabadi, Arya Hadizadeh Moghaddam, Bin Liu, Mei Liu,\n  Zijun Yao","title":"Contrastive Learning of Temporal Distinctiveness for Survival Analysis\n  in Electronic Health Records","comments":"This paper has been accepted for publication at the CIKM 2023\n  conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Survival analysis plays a crucial role in many healthcare decisions, where\nthe risk prediction for the events of interest can support an informative\noutlook for a patient's medical journey. Given the existence of data censoring,\nan effective way of survival analysis is to enforce the pairwise temporal\nconcordance between censored and observed data, aiming to utilize the time\ninterval before censoring as partially observed time-to-event labels for\nsupervised learning. Although existing studies mostly employed ranking methods\nto pursue an ordering objective, contrastive methods which learn a\ndiscriminative embedding by having data contrast against each other, have not\nbeen explored thoroughly for survival analysis. Therefore, in this paper, we\npropose a novel Ontology-aware Temporality-based Contrastive Survival (OTCSurv)\nanalysis framework that utilizes survival durations from both censored and\nobserved data to define temporal distinctiveness and construct negative sample\npairs with adjustable hardness for contrastive learning. Specifically, we first\nuse an ontological encoder and a sequential self-attention encoder to represent\nthe longitudinal EHR data with rich contexts. Second, we design a temporal\ncontrastive loss to capture varying survival durations in a supervised setting\nthrough a hardness-aware negative sampling mechanism. Last, we incorporate the\ncontrastive task into the time-to-event predictive task with multiple loss\ncomponents. We conduct extensive experiments using a large EHR dataset to\nforecast the risk of hospitalized patients who are in danger of developing\nacute kidney injury (AKI), a critical and urgent medical condition. The\neffectiveness and explainability of the proposed model are validated through\ncomprehensive quantitative and qualitative studies.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:36:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kerdabadi","Mohsen Nayebi",""],["Moghaddam","Arya Hadizadeh",""],["Liu","Bin",""],["Liu","Mei",""],["Yao","Zijun",""]]}
{"id":"2308.13105","submitter":"Bethan S Gregory","authors":"Bethan S. Gregory, Michael S. Chaffin, Rodney D. Elliott, Justin\n  Deighan, Hannes Gr\\\"oller, Eryn M. Cangi","title":"Nonthermal hydrogen loss at Mars: Contributions of photochemical\n  mechanisms to escape and identification of key processes","comments":"47 pages, 4 figures, 3 tables. Accepted manuscript. An edited version\n  of this paper was published by AGU","journal-ref":"Journal of Geophysical Research: Planets, 128(8), p.e2023JE007802\n  (2023)","doi":"10.1029/2023JE007802","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Hydrogen loss to space is a key control on the evolution of the Martian\natmosphere and the desiccation of the red planet. Thermal escape is thought to\nbe the dominant loss process, but both forward modeling studies and remote\nsensing observations have indicated the presence of a second,\nhigher-temperature \"nonthermal\" or \"hot\" hydrogen component, some fraction of\nwhich also escapes. Exothermic reactions and charge/momentum exchange processes\nproduce hydrogen atoms with energy above the escape energy, but H loss via many\nof these mechanisms has never been studied, and the relative importance of\nthermal and nonthermal escape at Mars remains uncertain. Here we estimate\nhydrogen escape fluxes via 47 mechanisms, using newly-developed escape\nprobability profiles. We find that HCO$^+$ dissociative recombination is the\nmost important of the mechanisms, accounting for 30-50% of the nonthermal\nescape. The reaction CO$_2^+$ + H$_2$ is also important, producing roughly as\nmuch escaping H as momentum exchange between hot O and H. Total nonthermal\nescape from the mechanisms considered amounts to 39% (27%) of thermal escape,\nfor low (high) solar activity. Our escape probability profiles are applicable\nto any thermospheric hot H production mechanism and can be used to explore\nseasonal and longer-term variations, allowing for a deeper understanding of\ndesiccation drivers over various timescales. We highlight the most important\nmechanisms and suggest that some may be important at Venus, where nonthermal\nescape dominates and much of the literature centers on charge exchange\nreactions, which do not result in significant escape in this study.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:40:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gregory","Bethan S.",""],["Chaffin","Michael S.",""],["Elliott","Rodney D.",""],["Deighan","Justin",""],["Gr\u00f6ller","Hannes",""],["Cangi","Eryn M.",""]]}
{"id":"2308.13106","submitter":"Caleb Donovick","authors":"Caleb Donovick, Ross Daly, Jackson Melchert, Lenny Truong, Priyanka\n  Raina, Pat Hanrahan, Clark Barrett","title":"PEak: A Single Source of Truth for Hardware Design and Verification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL cs.AR cs.LO","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Domain-specific languages for hardware can significantly enhance designer\nproductivity, but sometimes at the cost of ease of verification. On the other\nhand, ISA specification languages are too static to be used during early stage\ndesign space exploration. We present PEak, an open-source hardware design and\nspecification language, which aims to improve both design productivity and\nverification capability. PEak does this by providing a single source of truth\nfor functional models, formal specifications, and RTL. PEak has been used in\nseveral academic projects, and PEak-generated RTL has been included in three\nfabricated hardware accelerators. In these projects, the formal capabilities of\nPEak were crucial for enabling both novel design space exploration techniques\nand automated compiler synthesis.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:44:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Donovick","Caleb",""],["Daly","Ross",""],["Melchert","Jackson",""],["Truong","Lenny",""],["Raina","Priyanka",""],["Hanrahan","Pat",""],["Barrett","Clark",""]]}
{"id":"2308.13107","submitter":"Edward Yu","authors":"Eyvindur A. Palsson, Edward Yu","title":"On Optimal Point Sets Determining Distinct Triangles","comments":"15 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Erd\\H{o}s and Fishburn studied the maximum number of points in the plane that\nspan $k$ distances and classified these configurations, as an inverse problem\nof the Erd\\H{o}s distinct distances problem. We consider the analogous problem\nfor triangles. Past work has obtained the optimal sets for one and two distinct\ntriangles in the plane. In this paper, we resolve a conjecture that at most six\npoints in the plane can span three distinct triangles, and obtain the hexagon\nas the unique configuration that achieves this. We also provide evidence that\noptimal sets cannot be on the square lattice in the general case.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:45:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Palsson","Eyvindur A.",""],["Yu","Edward",""]]}
{"id":"2308.13108","submitter":"Hanpu Liu","authors":"Hanpu Liu, Xue-Ning Bai","title":"The Dusty Rossby Wave Instability (DRWI): Linear Analysis and\n  Simulations of Turbulent Dust-Trapping Rings in Protoplanetary Discs","comments":"27 pages, 17 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent numerical simulations have revealed that dust clumping and\nplanetesimal formation likely proceed in ring-like disc substructures, where\ndust gets trapped in weakly turbulent pressure maxima. The streaming\ninstability has difficulty operating in such rings with external turbulence and\nno pressure gradient. To explore potential paths to planetesimal formation in\nthis context, we analyse the stability of turbulent dust-trapping ring under\nthe shearing sheet framework. We self-consistently establish the pressure\nmaximum and the dust ring in equilibrium, the former via a balance of external\nforcing versus viscosity and the latter via dust drift versus turbulent\ndiffusion. We find two types of $\\gtrsim H$-scale instabilities ($H$ being the\npressure scale height), which we term the dusty Rossby wave instability (DRWI).\nType I is generalised from the standard RWI, which is stationary at the\npressure maximum and dominates in relatively sharp pressure bumps. Type II is a\nnewly identified travelling mode that requires the presence of dust. It can\noperate in relatively mild bumps, including many that are stable to the\nstandard RWI, and its growth rate is largely determined by the equilibrium gas\nand dust density gradients. We further conduct two-fluid simulations that\nverify the two types of the DRWI. While Type I leads strong to dust\nconcentration into a large gas vortex similar to the standard RWI, the dust\nring is preserved in Type II, and meanwhile exhibiting additional clumping\nwithin the ring. The DRWI suggests a promising path towards formation of\nplanetesimals/planetary embryos and azimuthally asymmetric dust structure from\nturbulent dust-trapping rings.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:47:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Hanpu",""],["Bai","Xue-Ning",""]]}
{"id":"2308.13109","submitter":"Magdalena Birowska","authors":"Mi{\\l}osz Rybak, Paulo E. Faria Junior, Tomasz Wo\\'zniak, Pawe{\\l}\n  Scharoch, Jaroslav Fabian, Magdalena Birowska","title":"Magneto-optical anisotropies of 2D antiferromagnetic MPX$_3$ from first\n  principles","comments":"20 pages, 8 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Here we systematically investigate the impact of the spin direction on the\nelectronic and optical properties of transition metal phosphorus\ntrichalcogenides (MPX$_3$, M=Mn, Ni, Fe; X=S, Se) exhibiting various\nantiferromagnetic arrangement within the 2D limit. Our analysis based on the\ndensity functional theory and versatile formalism of Bethe-Salpeter equation\nreveals larger exciton binding energies for MPS$_3$ (up to 1.1 eV in air) than\nMPSe$_3$(up to 0.8 eV in air), exceeding the values of transition metal\ndichalcogenides (TMDs). For the (Mn,Fe)PX$_3$ we determine the optically active\nband edge transitions, revealing that they are sensitive to in-plane magnetic\norder, irrespective of the type of chalcogen atom. We predict the anistropic\neffective masses and the type of linear polarization as an important\nfingerprints for sensing the type of magnetic AFM arrangements. Furthermore, we\nidentify the spin-orientation-dependent features such as the valley splitting,\nthe effective mass of holes, and the exciton binding energy. In particular, we\ndemonstrate that for MnPX$_3$ (X=S, Se) a pair of non equivalent K+ and K-\npoints exists yielding the valley splittings that strongly depend on the\ndirection of AFM aligned spins. Notably, for the out-of-plane direction of\nspins, two distinct peaks are expected to be visible below the absorption\nonset, whereas one peak should emerge for the in-plane configuration of spins.\nThese spin-dependent features provide an insight into spin flop transitions of\n2D materials. Finally, we propose a strategy how the spin valley polarization\ncan be realized in 2D AFM within honeycomb lattice.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 22:55:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rybak","Mi\u0142osz",""],["Junior","Paulo E. Faria",""],["Wo\u017aniak","Tomasz",""],["Scharoch","Pawe\u0142",""],["Fabian","Jaroslav",""],["Birowska","Magdalena",""]]}
{"id":"2308.13110","submitter":"\\c{C}a\\u{g}{\\i}n Ararat","authors":"\\c{C}a\\u{g}{\\i}n Ararat, Jin Ma","title":"Path-Regularity and Martingale Properties of Set-Valued Stochastic\n  Integrals","comments":"47 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we study the path-regularity and martingale properties of the\nset-valued stochastic integrals defined in our previous work Ararat et al.\n(2023). Such integrals have some fundamental differences from the well-known\nAumann-It\\^{o} stochastic integrals, and are much better suitable for\nrepresenting set-valued martingales, whence potentially useful in the study of\nset-valued backward stochastic differential equations. However, similar to the\nAumann-It\\^{o} integral, the new integral is only a set-valued submartingale in\ngeneral, and there is very limited knowledge about the path regularity of the\nrelated indefinite integral, much less the sufficient conditions under which\nthe integral is a true martingale. In this paper, we first establish the\nexistence of right- and left-continuous modifications of set-valued\nsubmartingales in continuous time, and apply the results to set-valued\nstochastic integrals. Moreover, we show that a set-valued stochastic integral\nyields a martingale if and only if the set of terminal values of the stochastic\nintegrals associated to the integrand is closed and decomposable. Finally, as a\nparticular example, we study the set-valued martingale in the form of the\nconditional expectation of a set-valued random variable. We show that when the\nrandom variable is a convex random polytope, the conditional expectation of a\nvertex stays as a vertex of the set-valued conditional expectation if and only\nif the random polytope has a deterministic normal fan.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:02:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ararat","\u00c7a\u011f\u0131n",""],["Ma","Jin",""]]}
{"id":"2308.13111","submitter":"Adam Yang","authors":"Adam X. Yang, Maxime Robeyns, Xi Wang, Laurence Aitchison","title":"Bayesian low-rank adaptation for large language models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Parameter-efficient fine-tuning (PEFT) has emerged as a new paradigm for\ncost-efficient fine-tuning of large language models (LLMs), with low-rank\nadaptation (LoRA) being a widely adopted choice. However, fine-tuned LLMs often\nbecome overconfident especially when fine-tuned on small datasets. Bayesian\nmethods, with their inherent ability to estimate uncertainty, serve as potent\ntools to mitigate overconfidence and enhance calibration. In this work, we\nintroduce Laplace-LoRA, a straightforward yet effective Bayesian method, which\napplies the Laplace approximation to the LoRA parameters and, considerably\nboosts the calibration of fine-tuned LLMs.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:06:21 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 00:38:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Adam X.",""],["Robeyns","Maxime",""],["Wang","Xi",""],["Aitchison","Laurence",""]]}
{"id":"2308.13112","submitter":"Kleuton Antunes Lopes Lima","authors":"F. F. Monteiro, K. A. L. Lima, L. A. Ribeiro Junior","title":"Predicting Psi-BN: computational insights into its mechanical,\n  electronic, and optical characteristics","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computational materials are pivotal in advancing our understanding of\ndistinct material classes and their properties, offering valuable insights in\npredicting novel structures and complementing experimental approaches. In this\ncontext, Psi-graphene is a stable two-dimensional carbon allotrope composed of\n5-6-7 carbon rings theoretically predicted recently. Using density functional\ntheory (DFT) calculations, we explored its boron nitride counterpart's\nmechanical, electronic, and optical characteristics (Psi-BN). Our results\nindicate that Psi-BN possesses a band gap of 4.59 eV at the HSE06 level. Phonon\ncalculations and ab initio molecular dynamics simulations demonstrated that\nthis material has excellent structural and dynamic stability. Moreover, its\nformation energy is -7.48 eV. Psi-BN exhibited strong ultraviolet activity,\nsuggesting its potential as an efficient UV collector. Furthermore, we\ndetermined critical mechanical properties of Psi-BN, such as the elastic\nstiffness constants, Young's modulus (250-300 GPa), and Poisson ratio (0.7),\nproviding valuable insights into its mechanical behavior.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:08:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Monteiro","F. F.",""],["Lima","K. A. L.",""],["Junior","L. A. Ribeiro",""]]}
{"id":"2308.13113","submitter":"Daniel Linford","authors":"Daniel Linford","title":"On the Boundary of the Cosmos","comments":"47 pages","journal-ref":"2023, Foundations of Physics","doi":"10.1007/s10701-023-00718-6","report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intuitively, the totality of physical reality -- the Cosmos -- has a\nbeginning only if (i) all parts of the Cosmos agree on the direction of time\n(the Direction Condition) and (ii) there is a boundary to the past of all\nnon-initial spacetime points such that there are no spacetime points to the\npast of the boundary (the Boundary Condition). Following a distinction\npreviously introduced by J. Brian Pitts, the Boundary Condition can be\nconceived of in two distinct ways: either topologically, i.e., in terms of a\nclosed boundary, or metrically, i.e., in terms of the Cosmos having a finite\npast. This article proposes that the Boundary Condition should be posed\ndisjunctively, modifies and improves upon the metrical conception of the\nCosmos's beginning in light of a series of surprising yet simple thought\nexperiments, and suggests that the Direction and Boundary Conditions should be\nthought of as more fundamental to the concept of the Cosmos's beginning than\nclassical Big Bang cosmology.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:32:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Linford","Daniel",""]]}
{"id":"2308.13114","submitter":"Youssef Touail","authors":"Youssef Touail, Amine Jaid, Driss El Moutawakil","title":"Fixed points for $F$-expanding mappings in the sense of measures of\n  noncompactness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we model with measures of noncompactness the well-known\nconcept of F-expanding mappings given by Gornicki (Fixed Point Theory Appl\n2017, 9 (2016)). Our results are proved by weakening some assumptions on F and\nwithout using the surjectivity. Moreover, the paper contains some examples and\nan application to the Volterra-integral equation.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:35:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Touail","Youssef",""],["Jaid","Amine",""],["Moutawakil","Driss El",""]]}
{"id":"2308.13115","submitter":"Byung Gyu Chae","authors":"Byung Gyu Chae","title":"Spatial resolution enhancement in holographic imaging via angular\n  spectrum expansion","comments":"6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Improvements to the spatial resolution and field-of-view of observed images\nare actively investigated in optical microscopy. However, accomplishing both\nsimultaneously is challenging because of a tradeoff relationship between them.\nDigital holography numerically restores three-dimensional image information\nusing optically captured diffracted waves. We propose that high-resolution\nimages could be acquired over a wide field view irrespective of the complexity\nof holographic imaging systems. The crucial idea is that the numerical aperture\n(NA) of digital hologram can be extended in terms of the expansion process of\nangular spectrum by arranging replicas in the reciprocal space. Only a low-NA\nhologram captured over a wide field restores high-resolution images when using\nan optimization algorithm including spectrum expansion process. This phenomenon\nresults from the fact that the replication patterns of optical kernel functions\nin both real and Fourier spaces correlate to higher angular spectra. Numerical\nsimulations and optical experiments are performed to verify our scheme.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:38:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chae","Byung Gyu",""]]}
{"id":"2308.13116","submitter":"Kevin Krahn","authors":"Kevin Krahn, Derrick Tate, Andrew C. Lamicela","title":"Sentence Embedding Models for Ancient Greek Using Multilingual Knowledge\n  Distillation","comments":"Paper accepted for publication at the First Workshop on Ancient\n  Language Processing (ALP) 2023; 10 pages, 3 figures, 9 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Contextual language models have been trained on Classical languages,\nincluding Ancient Greek and Latin, for tasks such as lemmatization,\nmorphological tagging, part of speech tagging, authorship attribution, and\ndetection of scribal errors. However, high-quality sentence embedding models\nfor these historical languages are significantly more difficult to achieve due\nto the lack of training data. In this work, we use a multilingual knowledge\ndistillation approach to train BERT models to produce sentence embeddings for\nAncient Greek text. The state-of-the-art sentence embedding approaches for\nhigh-resource languages use massive datasets, but our distillation approach\nallows our Ancient Greek models to inherit the properties of these models while\nusing a relatively small amount of translated sentence data. We build a\nparallel sentence dataset using a sentence-embedding alignment method to align\nAncient Greek documents with English translations, and use this dataset to\ntrain our models. We evaluate our models on translation search, semantic\nsimilarity, and semantic retrieval tasks and investigate translation bias. We\nmake our training and evaluation datasets freely available at\nhttps://github.com/kevinkrahn/ancient-greek-datasets .\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:38:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Krahn","Kevin",""],["Tate","Derrick",""],["Lamicela","Andrew C.",""]]}
{"id":"2308.13117","submitter":"Oliver Hoidn","authors":"Oliver Hoidn, Aashwin Mishra, Apurva Mehta","title":"Probabilistic Mixture Model-Based Spectral Unmixing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Identifying pure components in mixtures is a common yet challenging problem.\nThis unmixing process requires that mixing preserves the identity of the\ncomponents (endmembers), i.e., mixing is linear, and the endmembers must be\nspectrally distinct. Even with these requirements met, extracting the\nendmembers from a single mixture may be impossible; an ensemble of mixtures\nwith sufficient diversity is needed. Several spectral unmixing approaches have\nbeen proposed, many of which are connected to hyperspectral imaging. However,\nmost of them assume highly diverse collections of mixtures and extremely\nlow-loss spectroscopic measurements. Additionally, these frameworks do not\nincorporate the uncertainty inherent in unmixing. We propose a probabilistic\ninference approach that explicitly incorporates noise and uncertainty, enabling\nus to unmix endmembers in collections of mixtures with limited diversity. We\nuse a Bayesian mixture model to jointly extract endmember spectra and mixing\nparameters while explicitly modeling observation noise and the resulting\ninference uncertainties. We obtain approximate distributions over endmember\ncoordinates for each set of observed spectra while remaining robust to\ninference biases from the lack of pure observations and presence of\nnon-isotropic Gaussian noise. Access to reliable uncertainties on the unmixing\nsolutions would enable robust solutions as well as informed decision making.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:46:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hoidn","Oliver",""],["Mishra","Aashwin",""],["Mehta","Apurva",""]]}
{"id":"2308.13118","submitter":"Helen Zhou","authors":"Helen Zhou, Sercan O. Arik, Jingtao Wang","title":"Business Metric-Aware Forecasting for Inventory Management","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time-series forecasts play a critical role in business planning. However,\nforecasters typically optimize objectives that are agnostic to downstream\nbusiness goals and thus can produce forecasts misaligned with business\npreferences. In this work, we demonstrate that optimization of conventional\nforecasting metrics can often lead to sub-optimal downstream business\nperformance. Focusing on the inventory management setting, we derive an\nefficient procedure for computing and optimizing proxies of common downstream\nbusiness metrics in an end-to-end differentiable manner. We explore a wide\nrange of plausible cost trade-off scenarios, and empirically demonstrate that\nend-to-end optimization often outperforms optimization of standard\nbusiness-agnostic forecasting metrics (by up to 45.7% for a simple scaling\nmodel, and up to 54.0% for an LSTM encoder-decoder model). Finally, we discuss\nhow our findings could benefit other business contexts.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:49:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhou","Helen",""],["Arik","Sercan O.",""],["Wang","Jingtao",""]]}
{"id":"2308.13119","submitter":"Thiago Filipe Da Silva","authors":"Terence Gaffney and Thiago da Silva","title":"The generic equivalence among the Lipschitz saturation of a sheaf of\n  modules","comments":"arXiv admin note: substantial text overlap with arXiv:2012.12239","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we extend the concept of the Lipschitz saturation of an ideal\nto the context of modules in some different ways, and we prove they are\ngenerically equivalent.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 23:54:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gaffney","Terence",""],["da Silva","Thiago",""]]}
{"id":"2308.13120","submitter":"Nicol\\'as Andruskiewitsch","authors":"Nicol\\'as Andruskiewitsch","title":"On infinite-dimensional Hopf algebras","comments":"Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is a survey on pointed Hopf algebras with finite Gelfand-Kirillov\ndimension and related aspects of the theory of infinite-dimensional Hopf\nalgebras.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:09:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Andruskiewitsch","Nicol\u00e1s",""]]}
{"id":"2308.13121","submitter":"Sachithra Weerasooriya","authors":"Sachi Weerasooriya, Mia Sauda Bovill, Matthew A. Taylor, Andrew J.\n  Benson, Cameron Leahy","title":"Devouring The Centaurus A Satellites: Modeling Dwarf Galaxies with\n  Galacticus","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For the first time, systematic studies of dwarf galaxies are being conducted\nthroughout the Local Volume, including Centaurus A (NGC 5128), which is the\nnearest elliptical galaxy. Given Centaurus As mass (roughly ten times that of\nthe Milky Way), AGN activity, and recent major mergers, investigating these\ndwarfs and their star formation physics is imperative. However, simulating the\nfaintest dwarfs in a massive galaxy like Centaurus A with sufficient resolution\nin a hydrodynamic simulation is computationally expensive and currently\nunfeasible. In this study, we seek to reproduce Centaurus A dwarfs using the\nsame star formation physics as the Milky Way. We employ the semi-analytic model\nGalacticus to model dwarfs within a 600 kpc region. Utilizing astrophysical\nprescriptions and parameters matching the Milky Way satellites, we explore\npredictions for various properties and star formation histories (SFHs) to\ninvestigate environmental effects. We also reproduce cumulative luminosity and\nluminosity metallicity relations consistent with observations for the overall\nCentaurus A satellite population, while predicting half-light radii, velocity\ndispersion, and SFHs for the dwarf galaxies in Centaurus A. The agreement\nbetween our predicted SFHs for Centaurus A dwarfs and those of the Milky Way\nimplies the presence of universal processes governing star formation in these\ngalaxies. Overall, our findings shed light on the star formation physics of\ndwarf galaxies in the Centaurus A system, revealing insights into their\nproperties and dependence on the host environment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:11:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Weerasooriya","Sachi",""],["Bovill","Mia Sauda",""],["Taylor","Matthew A.",""],["Benson","Andrew J.",""],["Leahy","Cameron",""]]}
{"id":"2308.13122","submitter":"Maximilian Schlosshauer","authors":"Meng-Wei Chen, Owen Young, Maximilian Schlosshauer, M. Beck","title":"Protective measurements of photon polarization using a temporal pointer","comments":"9 pages, 6 figures, identical to published version","journal-ref":"Phys. Rev. A 108, 022420 (2023)","doi":"10.1103/PhysRevA.108.022420","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We experimentally demonstrate protective measurements by weakly coupling the\npolarization of a single-photon-level field to a measurement pointer that\ncorresponds to the arrival time of the photon. By using an optical loop, we\nimplement a variable, controlled number (1-9) of protection and measurement\nstages. We demonstrate the measurement of expectation values of photon\npolarization by measuring arrival times while simultaneously protecting the\npolarization state. No knowledge of the initial photon state is required or\navailable in our experiment, demonstrating that protective measurements provide\na genuine information gain that cannot simply be reduced to a priori\ninformation about the protection procedure.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:14:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Meng-Wei",""],["Young","Owen",""],["Schlosshauer","Maximilian",""],["Beck","M.",""]]}
{"id":"2308.13123","submitter":"Bokai Liu","authors":"Bokai Liu, Weizhuo Lu, Xiaoyue Hu, Chao Zhang, Cuixia Wang, Yilin Qu,\n  Thomas Olofsson","title":"Multiscale modeling of thermal properties in Polyurethane incorporated\n  with phase change materials composites: A case study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE cs.NA math.NA physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Polyurethane (PU) is an ideal thermal insulation material due to its\nexcellent thermal properties. The incorporation of Phase Change Materials\n(PCMs) capsules into Polyurethane (PU) has been shown to be effective in\nbuilding envelopes. This design can significantly increase the stability of the\nindoor thermal environment and reduce the fluctuation of indoor air\ntemperature. We develop a multiscale model of a PU-PCM foam composite and study\nthe thermal conductivity of this material. Later, the design of materials can\nbe optimized by obtaining thermal conductivity. We conduct a case study based\non the performance of this optimized material to fully consider the thermal\ncomfort of the occupants of a building envelope with the application of PU-PCMs\ncomposites in a single room. At the same time, we also predict the energy\nconsumption of this case. All the outcomes show that this design is promising,\nenabling the passive design of building energy and significantly improving\noccupants' comfort.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:29:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Bokai",""],["Lu","Weizhuo",""],["Hu","Xiaoyue",""],["Zhang","Chao",""],["Wang","Cuixia",""],["Qu","Yilin",""],["Olofsson","Thomas",""]]}
{"id":"2308.13124","submitter":"Md. Abu Jafar Pikul","authors":"S. Chowdhury, M. A. S. Akanda, M. A. J. Pikul, M.T. Islam, and Tai Min","title":"Thermal effect on microwave pulse driven magnetization switching of\n  Stoner particle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently it has been demonstrated that the cosine chirp microwave pulse\n(CCMP) is capable of achieving fast and energy-efficient magnetization-reversal\nof a nanoparticle with zero-Temperature. However, we investigate the finite\ntemperature, $T$ effect on the CCMP-driven magnetization reversal using the\nframework of the stochastic Landau Lifshitz Gilbert equation. At finite\nTemperature, we obtain the CCMP-driven fast and energy-efficient reversal and\nhence estimate the maximal temperature, $T_{max}$ at which the magnetization\nreversal is valid. $T_{max}$ increases with increasing the nanoparticle\ncross-sectional area/shape anisotropy up to a certain value, and afterward\n$T_{max}$ decreases with the further increment of nanoparticle cross-sectional\narea/shape anisotropy. This is because of demagnetization/shape anisotropy\nfield opposes the magnetocrystalline anisotropy, i.e., reduces the energy\nbarrier which separates the two stable states. For smaller cross-sectional\narea/shape anisotropy, the controlling parameters of CCMP show decreasing trend\nwith temperature. We also find that with the increment easy-plane\nshape-anisotropy, the required initial frequency of CCMP significantly reduces.\nFor the larger volume of nanoparticles, the parameters of CCMP remains constant\nfor a wide range of temperature which are desired for the device application.\nTherefore, The above findings might be useful to realize the CCMP-driven fast\nand energy-efficient magnetization reversal in realistic conditions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:30:32 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chowdhury","S.",""],["Akanda","M. A. S.",""],["Pikul","M. A. J.",""],["Islam","M. T.",""],["Min","Tai",""]]}
{"id":"2308.13125","submitter":"John Hoang","authors":"John Hoang, Zihe Zheng, Aiden Zelakiewicz, Peter Xiangyuan Ma, and\n  Bryan Brzycki","title":"Exploring the Use of Generative AI in the Search for Extraterrestrial\n  Intelligence (SETI)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.pop-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The search for extraterrestrial intelligence (SETI) is a field that has long\nbeen within the domain of traditional signal processing techniques. However,\nwith the advent of powerful generative AI models, such as GPT-3, we are now\nable to explore new ways of analyzing SETI data and potentially uncover\npreviously hidden signals. In this work, we present a novel approach for using\ngenerative AI to analyze SETI data, with focus on data processing and machine\nlearning techniques. Our proposed method uses a combination of deep learning\nand generative models to analyze radio telescope data, with the goal of\nidentifying potential signals from extraterrestrial civilizations. We also\ndiscuss the challenges and limitations of using generative AI in SETI, as well\nas potential future directions for this research. Our findings suggest that\ngenerative AI has the potential to significantly improve the efficiency and\neffectiveness of the search for extraterrestrial intelligence, and we encourage\nfurther exploration of this approach in the SETI community. (Disclosure: For\nthe purpose of demonstration, the abstract and title were generated by ChatGPT\nand slightly modified by the lead author.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:36:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hoang","John",""],["Zheng","Zihe",""],["Zelakiewicz","Aiden",""],["Ma","Peter Xiangyuan",""],["Brzycki","Bryan",""]]}
{"id":"2308.13126","submitter":"Benjamin Hardy","authors":"Benjamin M. Hardy, Gary Drake, Shuyang Chai, Bibek Dhakal, Jonathan B.\n  Martin, Junzhong Xu, Mark D. Does, Adam W. Anderson, Xinqiang Yan, John C.\n  Gore","title":"A Cryogenic Tune and Match Circuit for Magnetic Resonance Microscopy at\n  15.2T","comments":"33 pages, 10 figures, 1 table, 4 supplemental figures, 1 supplemental\n  table","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Signal to noise ratios (SNR) in magnetic resonance microscopy images are\nlimited by acquisition times and the decreasing number of spins in smaller\nvoxels. Significant SNR gains from cooling of the RF receiver are only realized\nwhen the Johnson noise generated within the RF hardware is large compared to\nthe electromagnetic noise produced by the sample. Cryogenic cooling of imaging\nprobes is common in high field systems but proves difficult to insulate the\nsample from extreme temperatures. We designed a chamber to cool only the tune\nand match circuitry to show it is possible to achieve much of the available SNR\ngain available for cooled coils. We designed a microcoil circuit to resonate at\n650 MHz for imaging on a 15.2 T scanner. Surface loops and solenoids of varying\ndiameters were tested to determine the largest diameter coil that demonstrated\nsignificant SNR gains from cooling. A liquid N2 cryochamber was designed to\ncool the circuitry while leaving the RF coil in ambient air. As the cryochamber\nwas filled with liquid N2, Q-factors were measured on the bench while\nmonitoring the coil's surface temperature. Improvements of SNR on images of\nsolutions were demonstrated via cooling the tune and match circuit in the\nmagnet bore. At 650 MHz, loops and solenoids < 3 mm in diameter showed\nsignificant improvements in quality factor on the bench. The resistance of the\nvariable capacitors and the coaxial cable were measured to be 45% and 32% of\nroom temperature values near the Larmor frequency. Images obtained with a 2\nturn, 3 mm diameter loop with the matching circuit at room temperature and then\ncooled with liquid nitrogen demonstrated SNR improvements of a factor of 2. By\ncooling the tune and match circuit and leaving the surface loop in ambient air,\nSNR was improved by a factor of 2. The results are significant because it\nallows for more space to insulate the sample from extreme temperatures.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:39:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hardy","Benjamin M.",""],["Drake","Gary",""],["Chai","Shuyang",""],["Dhakal","Bibek",""],["Martin","Jonathan B.",""],["Xu","Junzhong",""],["Does","Mark D.",""],["Anderson","Adam W.",""],["Yan","Xinqiang",""],["Gore","John C.",""]]}
{"id":"2308.13127","submitter":"William Wood Ph.D","authors":"William Alexander Wood, Thomas Marsh, Henning Sirringhaus","title":"JISA: A Polymorphic Test-and-Measurement Automation Library","comments":"Submitted to SoftwareX, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JISA is a software library, written in Java, aimed at providing an easy,\nflexible and standardised means of creating experimental control software for\nphysical sciences researchers. Specifically, with an emphasis on enabling\nmeasurement code to be written in an instrument-agnostic way, allowing such\nroutines to be reused across multiple different setups without requiring\nmodification. Additionally, it provides a simple means of recording and\nhandling data, as well as pre-built graphical user interface (GUI) \"blocks\" to\nenable the relatively easy creation of graphical control systems. Together\nthese allow users to quickly piece together test-and-measurement programs with\ncoherent user interfaces, without requiring much experience of such things.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:40:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wood","William Alexander",""],["Marsh","Thomas",""],["Sirringhaus","Henning",""]]}
{"id":"2308.13128","submitter":"Yikun Li","authors":"Yikun Li, Mohamed Soliman, Paris Avgeriou, Maarten van Ittersum","title":"DebtViz: A Tool for Identifying, Measuring, Visualizing, and Monitoring\n  Self-Admitted Technical Debt","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Technical debt, specifically Self-Admitted Technical Debt (SATD), remains a\nsignificant challenge for software developers and managers due to its potential\nto adversely affect long-term software maintainability. Although various\napproaches exist to identify SATD, tools for its comprehensive management are\nnotably lacking. This paper presents DebtViz, an innovative SATD tool designed\nto automatically detect, classify, visualize and monitor various types of SATD\nin source code comments and issue tracking systems. DebtViz employs a\nConvolutional Neural Network-based approach for detection and a deconvolution\ntechnique for keyword extraction. The tool is structured into a back-end\nservice for data collection and pre-processing, a SATD classifier for data\ncategorization, and a front-end module for user interaction. DebtViz not only\nmakes the management of SATD more efficient but also provides in-depth insights\ninto the state of SATD within software systems, fostering informed\ndecision-making on managing it. The scalability and deployability of DebtViz\nalso make it a practical tool for both developers and managers in diverse\nsoftware development environments. The source code of DebtViz is available at\nhttps://github.com/yikun-li/visdom-satd-management-system and the demo of\nDebtViz is at https://youtu.be/QXH6Bj0HQew.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:05:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Yikun",""],["Soliman","Mohamed",""],["Avgeriou","Paris",""],["van Ittersum","Maarten",""]]}
{"id":"2308.13129","submitter":"Emad Fallahzadeh","authors":"Emad Fallahzadeh (1), Amir Hossein Bavand (1), and Peter C. Rigby (1)\n  ((1) Concordia University, Montreal, Quebec, Canada)","title":"Accelerating Continuous Integration with Parallel Batch Testing","comments":null,"journal-ref":null,"doi":"10.1145/3611643.3616255","report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continuous integration at scale is costly but essential to software\ndevelopment. Various test optimization techniques including test selection and\nprioritization aim to reduce the cost. Test batching is an effective\nalternative, but overlooked technique. This study evaluates parallelization's\neffect by adjusting machine count for test batching and introduces two novel\napproaches.\n  We establish TestAll as a baseline to study the impact of parallelism and\nmachine count on feedback time. We re-evaluate ConstantBatching and introduce\nDynamicBatching, which adapts batch size based on the remaining changes in the\nqueue. We also propose TestCaseBatching, enabling new builds to join a batch\nbefore full test execution, thus speeding up continuous integration. Our\nevaluations utilize Ericsson's results and 276 million test outcomes from\nopen-source Chrome, assessing feedback time, execution reduction, and providing\naccess to Chrome project scripts and data.\n  The results reveal a non-linear impact of test parallelization on feedback\ntime, as each test delay compounds across the entire test queue.\nConstantBatching, with a batch size of 4, utilizes up to 72% fewer machines to\nmaintain the actual average feedback time and provides a constant execution\nreduction of up to 75%. Similarly, DynamicBatching maintains the actual average\nfeedback time with up to 91% fewer machines and exhibits variable execution\nreduction of up to 99%. TestCaseBatching holds the line of the actual average\nfeedback time with up to 81% fewer machines and demonstrates variable execution\nreduction of up to 67%. We recommend practitioners use DynamicBatching and\nTestCaseBatching to reduce the required testing machines efficiently. Analyzing\nhistorical data to find the threshold where adding more machines has minimal\nimpact on feedback time is also crucial for resource-effective testing.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:09:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fallahzadeh","Emad","","Concordia University, Montreal, Quebec, Canada"],["Bavand","Amir Hossein","","Concordia University, Montreal, Quebec, Canada"],["Rigby","Peter C.","","Concordia University, Montreal, Quebec, Canada"]]}
{"id":"2308.13130","submitter":"James Shook","authors":"James M. Shook","title":"Packing a Degree Sequence Realization With A Graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two simple $n$-vertex graphs $G_{1}$ and $G_{2}$, with respective maximum\ndegrees $\\Delta_{1}$ and $\\Delta_{2}$, are said to pack if $G_{1}$ is\nisomorphic to a subgraph of the complement of $G_{2}$. The BEC conjecture by\nBollob\\'{a}s, Eldridge, and Catlin, states that if\n$(\\Delta_{1}+1)(\\Delta_{2}+1)\\leq n+1$, then $G_{1}$ and $G_{2}$ pack. The BEC\nconjecture is true when $\\Delta_{1}=2$ and has been confirmed for a few other\nclasses of graphs with various conditions on $\\Delta_{1}$, $\\Delta_{2}$, or\n$n$. We show that if \\[(\\Delta_{1}+1)(\\Delta_{2}+1)\\leq\nn+\\min\\{\\Delta_{1},\\Delta_{2}\\},\\] then there exists a simple graph with an\nidentical degree sequence as $G_{1}$ that packs with $G_{2}$. However, except\nfor a few cases, we show that this bound is not sharp. As a consequence of our\nwork, we confirm the BEC conjecture if $G_{1}$ is the vertex disjoint union of\na unigraph and a forest $F$ such that either $F$ has at least $\\Delta_{2}+1$\ncomponents or at most $2\\Delta_{2}-1$ edges.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:10:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shook","James M.",""]]}
{"id":"2308.13131","submitter":"Songbai Chen","authors":"Yunzhu Wei, Songbai Chen, Jiliang Jing","title":"Thick accretion disk configurations around a compact object in the\n  brane-world scenario","comments":"13 pages, 7 figures, Accepted by Commun. Theor. Phys","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have studied equipotential surfaces of a thick accretion disk around a\nCasadio-Fabbri-Mazzacurati (CFM) compact object in the brane-world scenario,\nwhich owns a mass parameter together with a parameterized post-newtonian (PPN)\nparameter. With the increase of the PPN parameter, the size of the thick\naccretion disk decreases, but the corresponding Roche lobe size increases.\nThus, the larger PPN parameter yields the larger region of existing bound disk\nstructures where the fluid is not accreted into the central wormhole. Moreover,\nwith the increase of the PPN parameter, the position of the Roche lobe\ngradually moves away from the central compact object, the thickness of the\nregion enclosed by the Roche lobe decreases near the compact object, but\nincreases in the region far from the compact object. Our results also show that\nthe pressure gradient in the disk decreases with the PPN parameter. These\neffects of the PPN parameter on thick accretion disk could help to further\nunderstand compact objects in brane-world scenario.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:26:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wei","Yunzhu",""],["Chen","Songbai",""],["Jing","Jiliang",""]]}
{"id":"2308.13132","submitter":"Yongjie Wang","authors":"Zhihua Chang, Yongjie Wang","title":"Braided tensor products and polynomial invariants for the quantum queer\n  superalgebra","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The classical invariant theory for the queer Lie superalgebra\n$\\mathfrak{q}_n$ investigates its invariants in the supersymmetric algebra\n$$\\mathcal{U}_{s,l}^{r,k}:=\\mathrm{Sym}\\left(V^{\\oplus r}\\oplus \\Pi(V)^{\\oplus\nk}\\oplus V^{*\\oplus s}\\oplus \\Pi(V^*)^{\\oplus l} \\right),$$ where\n$V=\\mathbb{C}^{n|n}$ is the natural supermodule, $V^*$ is its dual and $\\Pi$ is\nthe parity reversing functor. This paper aims to construct a quantum analogue\n$\\mathcal{B}^{r,k}_{s,l}$ of $\\mathcal{U}_{s,l}^{r,k}$ and to explore the\nquantum queer superalgebra $\\mathrm{U}_q(\\mathfrak{q}_n)$-invariants in\n$\\mathcal{B}^{r,k}_{s,l}$.\n  The strategy involves braided tensor products of the quantum analogues\n$\\mathsf{A}_{r,n}$, $\\mathsf{A}_{k,n}^{\\Pi}$ of the supersymmetric algebras\n$\\mathrm{Sym}\\left(V^{\\oplus r}\\right)$, $\\mathrm{Sym}\\left(\\Pi(V)^{\\oplus\nk}\\right)$, and their dual partners $\\bar{\\mathsf{A}}_{s,n}$, and\n$\\bar{\\mathsf{A}}_{l,n}^{\\Pi}$. These braided tensor products are defined using\nexplicit braiding operator due to the absence of a universal R-matrix for\n$\\mathrm{U}_q(\\mathfrak{q}_n)$. Furthermore, we obtain an isomorphism between\nthe braided tensor product $\\mathsf{A}_{r,n}\\otimes\\mathsf{A}_{k,n}$ and\n$\\mathsf{A}_{r+k,n}$, an isomorphism between $\\mathsf{A}_{k,n}^{\\Pi}$ and\n$\\mathsf{A}_{k,n}$, as well as the corresponding isomorphisms for their dual\nparts. Consequently, the $\\mathrm{U}_q(\\mathfrak{q}_n)$-supermodule\nsuperalgebra $\\mathcal{B}^{r,k}_{s,l}$ is identified with\n$\\mathcal{B}^{r+k,0}_{s+l,0}$. This allows us to obtain a set of generators of\n$\\mathrm{U}_q(\\mathfrak{q}_n)$-invariants in $\\mathcal{B}^{r,k}_{s,l}$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:50:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chang","Zhihua",""],["Wang","Yongjie",""]]}
{"id":"2308.13133","submitter":"Guangyang Wu","authors":"Guangyang Wu, Xiaohong Liu, Kunming Luo, Xi Liu, Qingqing Zheng,\n  Shuaicheng Liu, Xinyang Jiang, Guangtao Zhai, Wenyi Wang","title":"AccFlow: Backward Accumulation for Long-Range Optical Flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent deep learning-based optical flow estimators have exhibited impressive\nperformance in generating local flows between consecutive frames. However, the\nestimation of long-range flows between distant frames, particularly under\ncomplex object deformation and large motion occlusion, remains a challenging\ntask. One promising solution is to accumulate local flows explicitly or\nimplicitly to obtain the desired long-range flow. Nevertheless, the\naccumulation errors and flow misalignment can hinder the effectiveness of this\napproach. This paper proposes a novel recurrent framework called AccFlow, which\nrecursively backward accumulates local flows using a deformable module called\nas AccPlus. In addition, an adaptive blending module is designed along with\nAccPlus to alleviate the occlusion effect by backward accumulation and rectify\nthe accumulation error. Notably, we demonstrate the superiority of backward\naccumulation over conventional forward accumulation, which to the best of our\nknowledge has not been explicitly established before. To train and evaluate the\nproposed AccFlow, we have constructed a large-scale high-quality dataset named\nCVO, which provides ground-truth optical flow labels between adjacent and\ndistant frames. Extensive experiments validate the effectiveness of AccFlow in\nhandling long-range optical flow estimation. Codes are available at\nhttps://github.com/mulns/AccFlow .\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:51:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Guangyang",""],["Liu","Xiaohong",""],["Luo","Kunming",""],["Liu","Xi",""],["Zheng","Qingqing",""],["Liu","Shuaicheng",""],["Jiang","Xinyang",""],["Zhai","Guangtao",""],["Wang","Wenyi",""]]}
{"id":"2308.13134","submitter":"Kai Murai","authors":"Masahiro Kawasaki, Kai Murai","title":"Enhancement of gravitational waves at Q-ball decay including non-linear\n  density perturbations","comments":"20 pages, 6 figures","journal-ref":null,"doi":null,"report-no":"TU-1208","categories":"astro-ph.CO gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The existence of a stochastic gravitational wave background is indicated by\nthe recent pulsar timing array (PTA) experiments. We study the enhanced\nproduction of second-order gravitational waves from the scalar perturbations\nwhen the universe experiences a transition from the early matter-dominated era\nto the radiation-dominated era due to Q-ball decay. We extend the analysis in\nprevious work by including the frequency range where density perturbations go\nnon-linear and find that the resultant gravitational wave spectrum can be\nconsistent with that favored by the recent PTA experiment results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:04:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kawasaki","Masahiro",""],["Murai","Kai",""]]}
{"id":"2308.13135","submitter":"Patrick Emedom-Nnamdi","authors":"Patrick Emedom-Nnamdi, Timothy R. Smith, Jukka-Pekka Onnela, and\n  Junwei Lu","title":"Nonparametric Additive Value Functions: Interpretable Reinforcement\n  Learning with an Application to Surgical Recovery","comments":"28 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a nonparametric additive model for estimating interpretable value\nfunctions in reinforcement learning. Learning effective adaptive clinical\ninterventions that rely on digital phenotyping features is a major for concern\nmedical practitioners. With respect to spine surgery, different post-operative\nrecovery recommendations concerning patient mobilization can lead to\nsignificant variation in patient recovery. While reinforcement learning has\nachieved widespread success in domains such as games, recent methods heavily\nrely on black-box methods, such neural networks. Unfortunately, these methods\nhinder the ability of examining the contribution each feature makes in\nproducing the final suggested decision. While such interpretations are easily\nprovided in classical algorithms such as Least Squares Policy Iteration, basic\nlinearity assumptions prevent learning higher-order flexible interactions\nbetween features. In this paper, we present a novel method that offers a\nflexible technique for estimating action-value functions without making\nexplicit parametric assumptions regarding their additive functional form. This\nnonparametric estimation strategy relies on incorporating local kernel\nregression and basis expansion to obtain a sparse, additive representation of\nthe action-value function. Under this approach, we are able to locally\napproximate the action-value function and retrieve the nonlinear, independent\ncontribution of select features as well as joint feature pairs. We validate the\nproposed approach with a simulation study, and, in an application to spine\ndisease, uncover recovery recommendations that are inline with related clinical\nknowledge.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:05:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Emedom-Nnamdi","Patrick",""],["Smith","Timothy R.",""],["Onnela","Jukka-Pekka",""],["Lu","Junwei",""]]}
{"id":"2308.13136","submitter":"Xin Cheng","authors":"X. Cheng, C. Xing, G. Aulanier, S. K. Solanki, H. Peter, and M. D.\n  Ding","title":"Deciphering The Slow-rise Precursor of a Major Coronal Mass Ejection","comments":"18 pages, 12 figures (7 in main and 5 in appendix), accepted for\n  publication in ApJ Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Coronal mass ejections (CMEs) are explosive plasma phenomena prevalently\noccurring on the Sun and probably on other magnetically active stars. However,\nhow their pre-eruptive configuration evolves toward the main explosion remains\nelusive. Here, based on comprehensive observations of a long-duration precursor\nin an event on 2012 March 13, we determine that the heating and slow rise of\nthe pre-eruptive hot magnetic flux rope (MFR) are achieved through a precursor\nreconnection located above cusp-shaped high-temperature precursor loops. It is\nobserved that the hot MFR threads are built up continually with their middle\ninitially showing an \"M\" shape and then being separated from the cusp of\nprecursor loops, causing the slow rise of the entire MFR. The slow rise in\ncombination with thermal-dominated hard X-ray source concentrated at the top of\nthe precursor loops shows that the precursor reconnection is much weaker than\nthe flare reconnection of the main eruption. We also perform a\nthree-dimensional magnetohydrodynamics simulation that reproduces the early\nevolution of the MFR transiting from the slow to fast rise. It is also\ndisclosed that it is the magnetic tension force pertinent to \"M\"-shaped threads\nthat drives the slow rise, which, however, evolves into a magnetic pressure\ngradient dominated regime responsible for the rapid-acceleration eruption.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:09:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cheng","X.",""],["Xing","C.",""],["Aulanier","G.",""],["Solanki","S. K.",""],["Peter","H.",""],["Ding","M. D.",""]]}
{"id":"2308.13137","submitter":"Wenqi Shao","authors":"Wenqi Shao, Mengzhao Chen, Zhaoyang Zhang, Peng Xu, Lirui Zhao,\n  Zhiqian Li, Kaipeng Zhang, Peng Gao, Yu Qiao, Ping Luo","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language\n  Models","comments":"A differentiable quantization method for LLM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have revolutionized natural language processing\ntasks. However, their practical deployment is hindered by their immense memory\nand computation requirements. Although recent post-training quantization (PTQ)\nmethods are effective in reducing memory footprint and improving the\ncomputational efficiency of LLM, they hand-craft quantization parameters, which\nleads to low performance and fails to deal with extremely low-bit quantization.\nTo tackle this issue, we introduce an Omnidirectionally calibrated Quantization\n(OmniQuant) technique for LLMs, which achieves good performance in diverse\nquantization settings while maintaining the computational efficiency of PTQ by\nefficiently optimizing various quantization parameters. OmniQuant comprises two\ninnovative components including Learnable Weight Clipping (LWC) and Learnable\nEquivalent Transformation (LET). LWC modulates the extreme values of weights by\noptimizing the clipping threshold. Meanwhile, LET tackles activation outliers\nby shifting the challenge of quantization from activations to weights through a\nlearnable equivalent transformation. Operating within a differentiable\nframework using block-wise error minimization, OmniQuant can optimize the\nquantization process efficiently for both weight-only and weight-activation\nquantization. For instance, the LLaMA-2 model family with the size of 7-70B can\nbe processed with OmniQuant on a single A100-40G GPU within 1-16 hours using\n128 samples. Extensive experiments validate OmniQuant's superior performance\nacross diverse quantization configurations such as W4A4, W6A6, W4A16, W3A16,\nand W2A16. Additionally, OmniQuant demonstrates effectiveness in\ninstruction-tuned models and delivers notable improvements in inference speed\nand memory reduction on real devices. Codes and models are available at\n\\url{https://github.com/OpenGVLab/OmniQuant}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:28:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shao","Wenqi",""],["Chen","Mengzhao",""],["Zhang","Zhaoyang",""],["Xu","Peng",""],["Zhao","Lirui",""],["Li","Zhiqian",""],["Zhang","Kaipeng",""],["Gao","Peng",""],["Qiao","Yu",""],["Luo","Ping",""]]}
{"id":"2308.13138","submitter":"Nicholas Vlamis","authors":"Justin Lanier and Nicholas G. Vlamis","title":"Homeomorphism groups of 2-manifolds with the virtual Rokhlin property","comments":"25 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DS math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce and motivate the definition of the virtual Rokhlin property for\ntopological groups. We then classify the 2-manifolds whose homeomorphism groups\nhave the virtual Rokhlin property. We also establish the analogous result for\nmapping class groups of 2-manifolds.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:30:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lanier","Justin",""],["Vlamis","Nicholas G.",""]]}
{"id":"2308.13139","submitter":"Hui Ye","authors":"Hui Ye, Rajshekhar Sunderraman, Shihao Ji","title":"MatchXML: An Efficient Text-label Matching Framework for Extreme\n  Multi-label Text Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The eXtreme Multi-label text Classification(XMC) refers to training a\nclassifier that assigns a text sample with relevant labels from an extremely\nlarge-scale label set (e.g., millions of labels). We propose MatchXML, an\nefficient text-label matching framework for XMC. We observe that the label\nembeddings generated from the sparse Term Frequency-Inverse Document\nFrequency(TF-IDF) features have several limitations. We thus propose label2vec\nto effectively train the semantic dense label embeddings by the Skip-gram\nmodel. The dense label embeddings are then used to build a Hierarchical Label\nTree by clustering. In fine-tuning the pre-trained encoder Transformer, we\nformulate the multi-label text classification as a text-label matching problem\nin a bipartite graph. We then extract the dense text representations from the\nfine-tuned Transformer. Besides the fine-tuned dense text embeddings, we also\nextract the static dense sentence embeddings from a pre-trained Sentence\nTransformer. Finally, a linear ranker is trained by utilizing the sparse TF-IDF\nfeatures, the fine-tuned dense text representations and static dense sentence\nfeatures. Experimental results demonstrate that MatchXML achieves\nstate-of-the-art accuracy on five out of six datasets. As for the speed,\nMatchXML outperforms the competing methods on all the six datasets. Our source\ncode is publicly available at https://github.com/huiyegit/MatchXML.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:32:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ye","Hui",""],["Sunderraman","Rajshekhar",""],["Ji","Shihao",""]]}
{"id":"2308.13140","submitter":"Feihan Li","authors":"Weiye Zhao, Yifan Sun, Feihan Li, Rui Chen, Tianhao Wei, Changliu Liu","title":"Learn With Imagination: Safe Set Guided State-wise Constrained Policy\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep reinforcement learning (RL) excels in various control tasks, yet the\nabsence of safety guarantees hampers its real-world applicability. In\nparticular, explorations during learning usually results in safety violations,\nwhile the RL agent learns from those mistakes. On the other hand, safe control\ntechniques ensure persistent safety satisfaction but demand strong priors on\nsystem dynamics, which is usually hard to obtain in practice. To address these\nproblems, we present Safe Set Guided State-wise Constrained Policy Optimization\n(S-3PO), a pioneering algorithm generating state-wise safe optimal policies\nwith zero training violations, i.e., learning without mistakes. S-3PO first\nemploys a safety-oriented monitor with black-box dynamics to ensure safe\nexploration. It then enforces a unique cost for the RL agent to converge to\noptimal behaviors within safety constraints. S-3PO outperforms existing methods\nin high-dimensional robotics tasks, managing state-wise constraints with zero\ntraining violation. This innovation marks a significant stride towards\nreal-world safe RL deployment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:33:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Weiye",""],["Sun","Yifan",""],["Li","Feihan",""],["Chen","Rui",""],["Wei","Tianhao",""],["Liu","Changliu",""]]}
{"id":"2308.13141","submitter":"Madhumitha Selvaraj","authors":"Madhu Selvaraj, Gias Uddin","title":"A Large-Scale Study of IoT Security Weaknesses and Vulnerabilities in\n  the Wild","comments":"38 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Internet of Things (IoT) is defined as the connection between places and\nphysical objects (i.e., things) over the internet/network via smart computing\ndevices. We observed that IoT software developers share solutions to\nprogramming questions as code examples on three Stack Exchange Q&A sites: Stack\nOverflow (SO), Arduino, and Raspberry Pi. Previous research studies found\nvulnerabilities/weaknesses in C/C++ code examples shared in Stack Overflow.\nHowever, the studies did not investigate C/C++ code examples related to IoT.\nThe studies investigated SO code examples only. In this paper, we conduct a\nlarge-scale empirical study of all IoT C/C++ code examples shared in the three\nStack Exchange sites, i.e., SO, Arduino, and Raspberry Pi. From the 11,329\nobtained code snippets from the three sites, we identify 29 distinct CWE\n(Common Weakness Enumeration) types in 609 snippets. These CWE types can be\ncategorized into 8 general weakness categories, and we observe that evaluation,\nmemory, and initialization related weaknesses are the most common to be\nintroduced by users when posting programming solutions. Furthermore, we find\nthat 39.58% of the vulnerable code snippets contain instances of CWE types that\ncan be mapped to real-world occurrences of those CWE types (i.e. CVE\ninstances). The most number vulnerable IoT code examples was found in Arduino,\nfollowed by SO, and Raspberry Pi. Memory type vulnerabilities are on the rise\nin the sites. For example, from the 3595 mapped CVE instances, we find that\n28.99% result in Denial of Service (DoS) errors, which is particularly harmful\nfor network reliant IoT devices such as smart cars. Our study results can guide\nvarious IoT stakeholders to be aware of such vulnerable IoT code examples and\nto inform IoT researchers during their development of tools that can help\nprevent developers the sharing of such vulnerable code examples in the sites.\n[Abridged].\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:34:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Selvaraj","Madhu",""],["Uddin","Gias",""]]}
{"id":"2308.13142","submitter":"Tianyi Zhang","authors":"Tianyi Zhang, Zheng Wang, Jing Huang, Mohiuddin Muhammad Tasnim, Wei\n  Shi","title":"A Survey of Diffusion Based Image Generation Models: Issues and Their\n  Solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Recently, there has been significant progress in the development of large\nmodels. Following the success of ChatGPT, numerous language models have been\nintroduced, demonstrating remarkable performance. Similar advancements have\nalso been observed in image generation models, such as Google's Imagen model,\nOpenAI's DALL-E 2, and stable diffusion models, which have exhibited impressive\ncapabilities in generating images. However, similar to large language models,\nthese models still encounter unresolved challenges. Fortunately, the\navailability of open-source stable diffusion models and their underlying\nmathematical principles has enabled the academic community to extensively\nanalyze the performance of current image generation models and make\nimprovements based on this stable diffusion framework. This survey aims to\nexamine the existing issues and the current solutions pertaining to image\ngeneration models.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:35:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Tianyi",""],["Wang","Zheng",""],["Huang","Jing",""],["Tasnim","Mohiuddin Muhammad",""],["Shi","Wei",""]]}
{"id":"2308.13143","submitter":"Amgad Rezk PhD","authors":"Hossein Alijani, Philipp Reineck, Robert Komljenovic, Salvy Russo, Mei\n  Xian Low, Sivacarendran Balendhran, Kenneth Crozier, Sumeet Walia, Geoff. R.\n  Nash, Leslie Y. Yeo, and Amgad R. Rezk","title":"The Acoustophotoelectric Effect: Efficient Phonon-Photon-Electron\n  Coupling in Zero-Voltage-Biased 2D SnS$_2$ for Broadband Photodetection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Two-dimensional (2D) layered metal dichalcogenides constitute a promising\nclass of materials for photodetector applications due to their excellent\noptoelectronic properties. The most common photodetectors, which work on the\nprinciple of photoconductive or photovoltaic effects, however, require either\nthe application of external voltage biases or built-in electric fields, which\nmakes it challenging to simultaneously achieve high responsivities across\nbroadband wavelength excitation - especially beyond the material's nominal band\ngap - while producing low dark currents. In this work, we report the discovery\nof an intricate phonon-photon-electron coupling - which we term the\nacoustophotoelectric effect - in SnS$_2$ that facilitates efficient\nphotodetection through the application of 100-MHz-order propagating surface\nacoustic waves (SAWs). This effect not only reduces the band gap of SnS$_2$,\nbut also provides the requisite momentum for indirect band gap transition of\nthe photoexcited charge carriers, to enable broadband photodetection beyond the\nvisible light range, whilst maintaining pA-order dark currents - remarkably\nwithout the need for any external voltage bias. More specifically, we show in\nthe infrared excitation range that it is possible to achieve up to eight orders\nof magnitude improvement in the material's photoresponsivity compared to that\npreviously reported for SnS$_2$-based photodetectors, in addition to exhibiting\nsuperior performance compared to most other 2D materials reported to date for\nphotodetection.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:36:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Alijani","Hossein",""],["Reineck","Philipp",""],["Komljenovic","Robert",""],["Russo","Salvy",""],["Low","Mei Xian",""],["Balendhran","Sivacarendran",""],["Crozier","Kenneth",""],["Walia","Sumeet",""],["Nash","Geoff. R.",""],["Yeo","Leslie Y.",""],["Rezk","Amgad R.",""]]}
{"id":"2308.13144","submitter":"Renyou Xu","authors":"Renyou Xu, Hui Zhang, Yuhao Jiang, Houyi Cheng, Yunfei Xie, Yuxuan\n  Yao, Danrong Xiong, Zhaozhao Zhu, Xiaobai Ning, Runze Chen, Yan Huang, Shijie\n  Xu, Jianwang Cai, Yong Xu, Tao Liu, and Weisheng Zhao","title":"Giant orbit-to-charge conversion induced via the inverse orbital Hall\n  effect","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the orbit-to-charge conversion in YIG/Pt/nonmagnetic material\n(NM) trilayer heterostructures. With the additional Ru layer on the top of\nYIG/Pt stacks, the charge current signal increases nearly an order of magnitude\nin both longitudinal spin Seebeck effect (SSE) and spin pumping (SP)\nmeasurements. Through thickness dependence studies of the Ru metal layer and\ntheoretical model, we quantitatively clarify different contributions of the\nincreased SSE signal that mainly comes from the inverse orbital Hall effect\n(IOHE) of Ru, and partially comes from the orbital sink effect in the Ru layer.\nA similar enhancement of SSE(SP) signals is also observed when Ru is replaced\nby other materials (Ta, W, and Cu), implying the universality of the IOHE in\ntransition metals. Our findings not only suggest a more efficient generation of\nthe charge current via the orbital angular moment channel but also provides\ncrucial insights into the interplay among charge, spin, and orbit.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:43:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xu","Renyou",""],["Zhang","Hui",""],["Jiang","Yuhao",""],["Cheng","Houyi",""],["Xie","Yunfei",""],["Yao","Yuxuan",""],["Xiong","Danrong",""],["Zhu","Zhaozhao",""],["Ning","Xiaobai",""],["Chen","Runze",""],["Huang","Yan",""],["Xu","Shijie",""],["Cai","Jianwang",""],["Xu","Yong",""],["Liu","Tao",""],["Zhao","Weisheng",""]]}
{"id":"2308.13145","submitter":"Luis Iv\\'an Hern\\'andez Ru\\'iz","authors":"Luis Iv\\'an Hern\\'andez Ru\\'iz","title":"Results for convergence rates associated with renewal processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Via a coupling argument, it is proved that the solution to a renewal equation\nhas a power law decay rate in the case of a spread out interarrival\ndistribution. By the regenerative property, the convergence in distribution for\nthe recurrence times of the renewal process is established as well as that of\nthe compensator of the renewal counting process. All results are proved under\nmild assumptions of existence of moments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:44:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ru\u00edz","Luis Iv\u00e1n Hern\u00e1ndez",""]]}
{"id":"2308.13146","submitter":"Monica Gallegos-Garcia","authors":"Monica Gallegos-Garcia, Jonatan Jacquemin-Ide, Vicky Kalogera","title":"Angular Momentum Loss During Stable Mass Transfer onto a Compact object:\n  the Effect of Mass Loss via Accretion Disk Winds","comments":"submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use an analytic framework to calculate the evolution of binary orbits\nunder a physically-motivated model that accounts for angular momentum loss\nassociated with winds from an accretion disk around the compact objected\naccretor. Our prescription considers wind mass ejection from the surface of an\naccretion disk, accounting for a radial mass-loss dependence across the disk\nsurface. We compare this to the standard prescription of angular momentum loss\nassociated with isotropic mass loss from the vicinity of the accretor. The\nangular momentum loss from a disk-wind is always larger. For mass ratios, $q$,\nbetween $2$--$10$, angular momentum loss via a disk wind is $\\simeq3$--$40$\ntimes greater than the standard prescription. For the majority of mass ratios\nand disk properties, accounting for the disk wind can result in considerably\nsmaller orbital separations compared to the standard formalism; the differences\nbeing $\\simeq 60\\%$ depending on how long the effect is integrated for. We\nconclude that it is important to consider the effects of angular momentum loss\nfrom a disk wind when evolving binary orbits.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:44:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gallegos-Garcia","Monica",""],["Jacquemin-Ide","Jonatan",""],["Kalogera","Vicky",""]]}
{"id":"2308.13147","submitter":"Lyndon Benke","authors":"Lyndon Benke, Tim Miller, Michael Papasimeon, and Nir Lipovetzky","title":"Diverse, Top-k, and Top-Quality Planning Over Simulators","comments":"This paper has been accepted at the 26th European Conference on\n  Artificial Intelligence (ECAI 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Diverse, top-k, and top-quality planning are concerned with the generation of\nsets of solutions to sequential decision problems. Previously this area has\nbeen the domain of classical planners that require a symbolic model of the\nproblem instance. This paper proposes a novel alternative approach that uses\nMonte Carlo Tree Search (MCTS), enabling application to problems for which only\na black-box simulation model is available. We present a procedure for\nextracting bounded sets of plans from pre-generated search trees in best-first\norder, and a metric for evaluating the relative quality of paths through a\nsearch tree. We demonstrate this approach on a path-planning problem with\nhidden information, and suggest adaptations to the MCTS algorithm to increase\nthe diversity of generated plans. Our results show that our method can generate\ndiverse and high-quality plan sets in domains where classical planners are not\napplicable.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:55:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Benke","Lyndon",""],["Miller","Tim",""],["Papasimeon","Michael",""],["Lipovetzky","Nir",""]]}
{"id":"2308.13148","submitter":"Xiang-Gen Xia Prof.","authors":"Xiang-Gen Xia","title":"Understanding Turbo Codes: A Signal Processing Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study turbo codes from the digital signal processing point\nof view by defining turbo codes over the complex field. It is known that\niterative decoding and interleaving between concatenated parallel codes are two\nkey elements that make turbo codes perform significantly better than the\nconventional error control codes. This is analytically illustrated in this\npaper by showing that the decoded noise mean power in the iterative decoding\ndecreases when the number of iterations increases, as long as the interleaving\ndecorrelates the noise after each iterative decoding step. An analytic\ndecreasing rate and the limit of the decoded noise mean power are given. The\nlimit of the decoded noise mean power of the iterative decoding of a turbo code\nwith two parallel codes with their rates less than 1/2 is one third of the\nnoise power before the decoding, which can not be achieved by any non-turbo\ncodes with the same rate. From this study, the role of designing a good\ninterleaver can also be clearly seen.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:03:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xia","Xiang-Gen",""]]}
{"id":"2308.13149","submitter":"Liangtai Sun","authors":"Liangtai Sun, Yang Han, Zihan Zhao, Da Ma, Zhennan Shen, Baocai Chen,\n  Lu Chen and Kai Yu","title":"SciEval: A Multi-Level Large Language Model Evaluation Benchmark for\n  Scientific Research","comments":"12 pages, 17 figures, 12 tables. Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, there has been growing interest in using Large Language Models\n(LLMs) for scientific research. Numerous benchmarks have been proposed to\nevaluate the ability of LLMs for scientific research. However, current\nbenchmarks are mostly based on pre-collected objective questions. This design\nsuffers from data leakage problem and lacks the evaluation of subjective Q/A\nability. In this paper, we propose SciEval, a comprehensive and\nmulti-disciplinary evaluation benchmark to address these issues. Based on\nBloom's taxonomy, SciEval covers four dimensions to systematically evaluate\nscientific research ability. In particular, we design a \"dynamic\" subset based\non scientific principles to prevent evaluation from potential data leakage.\nBoth objective and subjective questions are included in SciEval. These\ncharacteristics make SciEval a more effective benchmark for scientific research\nability evaluation of LLMs. Comprehensive experiments on most advanced LLMs\nshow that, although GPT-4 achieves SOTA performance compared to other LLMs,\nthere is still substantial room for improvement, especially for dynamic\nquestions. The data and codes are now publicly available.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:05:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sun","Liangtai",""],["Han","Yang",""],["Zhao","Zihan",""],["Ma","Da",""],["Shen","Zhennan",""],["Chen","Baocai",""],["Chen","Lu",""],["Yu","Kai",""]]}
{"id":"2308.13150","submitter":"Suxing Liu","authors":"Suxing Liu","title":"Enhancing Breast Cancer Classification Using Transfer ResNet with\n  Lightweight Attention Mechanism","comments":"6 pages, 4 figures,6 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning models have revolutionized image classification by learning\ncomplex feature hierarchies in raw pixel data. This paper introduces an image\nclassification method based on the ResNet model, and introduces a lightweight\nattention mechanism framework to improve performance. The framework optimizes\nfeature representation, enhances classification capabilities, and improves\nfeature discriminativeness. We verified the effectiveness of the algorithm on\nthe Breakhis dataset, showing its superior performance in many aspects. Not\nonly in terms of conventional models, our method also shows advantages on\nstate-of-the-art methods such as contemporary visual transformers. Significant\nimprovements have been achieved in metrics such as precision, accuracy, recall,\nF1-score, and G-means, while also performing well in terms of convergence time.\nThese results strengthen the performance of the algorithm and solidify its\napplication prospects in practical image classification tasks. Keywords: ResNet\nmodel, Lightweight attention mechanism\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:08:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Suxing",""]]}
{"id":"2308.13151","submitter":"Yusheng Luo","authors":"Yusheng Luo, Yongquan Zhang","title":"Circle packings, renormalizations and subdivision rules","comments":"67 pages, 23 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we use iterations of skinning maps on Teichm\\\"uller spaces to\nstudy circle packings. This allows us to develop a renormalization theory for\ncircle packings whose nerves satisfy certain subdivision rules. We characterize\nwhen the skinning map has bounded image. Under the corresponding condition, we\nprove that the renormalization operator is uniformly contracting. This allows\nus to give complete answers for the existence and moduli problems for such\ncircle packings. The exponential contraction has many consequences. In\nparticular, we prove that homeomorphisms between any two such circle packings\nare asymptotically conformal.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:09:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Luo","Yusheng",""],["Zhang","Yongquan",""]]}
{"id":"2308.13152","submitter":"Thuy Le","authors":"Thuy T. Le, Linh V. Nguyen, Loc H. Nguyen, Hyunha Park","title":"The time dimensional reduction method to determine the initial\n  conditions without the knowledge of damping coefficients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper aims to reconstruct the initial condition of a hyperbolic equation\nwith an unknown damping coefficient. Our approach involves approximating the\nhyperbolic equation's solution by its truncated Fourier expansion in the time\ndomain and using a polynomial-exponential basis. This truncation process\nfacilitates the elimination of the time variable, consequently, yielding a\nsystem of quasi-linear elliptic equations. To globally solve the system without\nneeding an accurate initial guess, we employ the Carleman contraction\nprinciple. We provide several numerical examples to illustrate the efficacy of\nour method. The method not only delivers precise solutions but also showcases\nremarkable computational efficiency.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:11:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Le","Thuy T.",""],["Nguyen","Linh V.",""],["Nguyen","Loc H.",""],["Park","Hyunha",""]]}
{"id":"2308.13153","submitter":"Jiayi Wen","authors":"Jiayi Wen","title":"Occupational Retirement and Pension Reform: The Roles of Physical and\n  Cognitive Health","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Despite increasing cognitive demands of jobs, knowledge about the role of\nhealth in retirement has centered on its physical dimensions. This paper\nestimates a dynamic programming model of retirement that incorporates multiple\nhealth dimensions, allowing differential effects on labor supply across\noccupations. Results show that the effect of cognitive health surges\nexponentially after age 65, and it explains a notable share of employment\ndeclines in cognitively demanding occupations. Under pension reforms, physical\nconstraint mainly impedes manual workers from delaying retirement, whereas\ncognitive constraint dampens the response of clerical and professional workers.\nMultidimensional health thus unevenly exacerbate welfare losses across\noccupations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:13:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wen","Jiayi",""]]}
{"id":"2308.13154","submitter":"Kejin Wei","authors":"Ye Chen, Chunfeng Huang, Shuyi Huang, Zhenrong Zhang and Kejin Wei","title":"Qubit-based distributed frame synchronization for quantum key\n  distribution","comments":"Any comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum key distribution (QKD) is a method that enables two remote parties to\nshare a secure key string. Clock synchronization between two parties is a\ncrucial step in the normal operation of QKD. Qubit-based synchronization can\nachieve clock synchronization by transmitting quantum states between two remote\nparties, eliminating the necessity for hardware synchronization and thereby\ngreatly reducing the hardware requirements of a QKD system. Nonetheless,\nclassical qubit-based synchronization exhibits poor performance in continuous\nand high-loss systems, hindering its wide applicability in various scenarios.\nWe propose a qubit-based distributed frame synchronization method that can\nachieve time recovery in a continuously running system and resist higher\nlosses. Experimental results show that the proposed method outperforms the\nadvanced qubit-based synchronization method Qubit4Sync in a continuously\nrunning system. We believe our method is applicable to a broad range of QKD\nscenarios, including drone-based QKD and quantum network construction.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:17:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Ye",""],["Huang","Chunfeng",""],["Huang","Shuyi",""],["Zhang","Zhenrong",""],["Wei","Kejin",""]]}
{"id":"2308.13155","submitter":"Simone Mariano","authors":"Simone Mariano, Riccardo Bertollo, Romain Postoyan, Luca Zaccarian","title":"Hybrid coupling rules for leaderless heterogeneous oscillators: uniform\n  global asymptotic and finite-time synchronization","comments":"Keywords: Cyber-physical systems, synchronization, hybrid dynamical\n  systems, multi-agent systems, uniform stability, finite-time stability,\n  Lyapunov methods","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the engineering scenario where the objective is to synchronize\nheterogeneous oscillators in a distributed fashion. The internal dynamics of\neach oscillator are general enough to capture their time-varying natural\nfrequency as well as physical couplings and unknown bounded terms. A\ncommunication layer is set in place to allow the oscillators to exchange\nsynchronizing coupling actions through a tree-like leaderless network. In\nparticular, we present a class of hybrid coupling rules depending only on local\ninformation to ensure uniform global practical or asymptotic synchronization,\nwhich is impossible to obtain by using the Kuramoto model customarily used in\nthe literature. We further show that the synchronization set can be made\nuniformly globally prescribed finite-time stable by selecting the coupling\nfunction to be discontinuous at the origin. Novel mathematical tools on\nnon-pathological functions and set-valued Lie derivatives are developed to\ncarry out the stability analysis. The effectiveness of the approach is\nillustrated in simulations where we apply our synchronizing hybrid coupling\nrules to models of power grids previously used in the literature.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:20:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mariano","Simone",""],["Bertollo","Riccardo",""],["Postoyan","Romain",""],["Zaccarian","Luca",""]]}
{"id":"2308.13156","submitter":"Jiayi Wen","authors":"Jiayi Wen, Haili Huang","title":"Parental Health Penalty on Adult Children's Employment: Gender\n  Difference and Long-Term Consequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper examines the long-term gender-specific impacts of parental health\nshocks on adult children's employment in China. We build up an inter-temporal\ncooperative framework to analyze household work decisions in response to\nparental health deterioration. Then employing an event-study approach, we\nestablish a causal link between parental health shocks and a notable decline in\nfemale employment rates. Male employment, however, remains largely unaffected.\nThis negative impact shows no abatement up to eight years that are observable\nby the sample. These findings indicate the consequence of \"growing old before\ngetting rich\" for developing countries.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:29:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wen","Jiayi",""],["Huang","Haili",""]]}
{"id":"2308.13157","submitter":"Ishmeet Kaur","authors":"Ishmeet Kaur andAdwaita Janardhan Jadhav","title":"Federated Learning in IoT: a Survey from a Resource-Constrained\n  Perspective","comments":"Presented and accepted at The IEEE 2023 International Conference on\n  Artificial Intelligence, Robotics, Signal and Image Processing (AIRoSIP)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The IoT ecosystem is able to leverage vast amounts of data for intelligent\ndecision-making. Federated Learning (FL), a decentralized machine learning\ntechnique, is widely used to collect and train machine learning models from a\nvariety of distributed data sources. Both IoT and FL systems can be\ncomplementary and used together. However, the resource-constrained nature of\nIoT devices prevents the widescale deployment FL in the real world. This\nresearch paper presents a comprehensive survey of the challenges and solutions\nassociated with implementing Federated Learning (FL) in resource-constrained\nInternet of Things (IoT) environments, viewed from 2 levels, client and server.\nWe focus on solutions regarding limited client resources, presence of\nheterogeneous client data, server capacity, and high communication costs, and\nassess their effectiveness in various scenarios. Furthermore, we categorize the\nsolutions based on the location of their application, i.e., the IoT client, and\nthe FL server. In addition to a comprehensive review of existing research and\npotential future directions, this paper also presents new evaluation metrics\nthat would allow researchers to evaluate their solutions on\nresource-constrained IoT devices.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:31:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jadhav","Ishmeet Kaur andAdwaita Janardhan",""]]}
{"id":"2308.13158","submitter":"Qiong Li","authors":"Xiaofeng Xue, Haokun Mao and Qiong Li","title":"DAG-ACFL: Asynchronous Clustered Federated Learning based on DAG-DLT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Federated learning (FL) aims to collaboratively train a global model while\nensuring client data privacy. However, FL faces challenges from the non-IID\ndata distribution among clients. Clustered FL (CFL) has emerged as a promising\nsolution, but most existing CFL frameworks adopt synchronous frameworks lacking\nasynchrony. An asynchronous CFL framework called SDAGFL based on directed\nacyclic graph distributed ledger techniques (DAG-DLT) was proposed, but its\ncomplete decentralization leads to high communication and storage costs. We\npropose DAG-ACFL, an asynchronous clustered FL framework based on directed\nacyclic graph distributed ledger techniques (DAG-DLT). We first detail the\ncomponents of DAG-ACFL. A tip selection algorithm based on the cosine\nsimilarity of model parameters is then designed to aggregate models from\nclients with similar distributions. An adaptive tip selection algorithm\nleveraging change-point detection dynamically determines the number of selected\ntips. We evaluate the clustering and training performance of DAG-ACFL on\nmultiple datasets and analyze its communication and storage costs. Experiments\nshow the superiority of DAG-ACFL in asynchronous clustered FL. By combining\nDAG-DLT with clustered FL, DAG-ACFL realizes robust, decentralized and private\nmodel training with efficient performance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:35:29 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xue","Xiaofeng",""],["Mao","Haokun",""],["Li","Qiong",""]]}
{"id":"2308.13159","submitter":"Liying Tao","authors":"Liying Tao and Tengfei Zhao","title":"Almost sure scattering for defocusing energy critical Hartree equation\n  on $\\R^5$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the defocusing energy-critical Hartree equation $i\\pa_tu+\\Delta\nu=(|\\cdot|^{-4}\\ast|u|^2)u$ in spatial dimension $d=5$ and prove almost sure\nscattering with initial data $u_0\\in H^s_x(\\R^5)$ for any $s\\in\\R$. The proof\nrelies on the modified interaction Morawetz estimate, the stability theories,\nthe ``Narrowed'' Wiener randomization. We are inspired to consider this problem\nby the work of Shen-Soffer-Wu \\cite{Shen-Soffer-Wu 1}, which treated the\nanalogous problem for the energy-critical Schr\\\"{o}dinger equation. The new\ningredient in this paper are that we take an alternative proof to give the\ninteraction Morawetz estimate. And the nonlocal nonlinearity term will bring\nsome difficulties.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:39:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tao","Liying",""],["Zhao","Tengfei",""]]}
{"id":"2308.13160","submitter":"Junliang Shen","authors":"Davesh Maulik, Junliang Shen, Qizheng Yin","title":"Perverse filtrations and Fourier transforms","comments":"55 pages; comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the interaction between Fourier-Mukai transforms and perverse\nfiltrations for a certain class of dualizable abelian fibrations.\nMultiplicativity of the perverse filtration and the \"Perverse $\\supset$ Chern\"\nphenomenon for these abelian fibrations are immediate consequences of our\ntheory. We also show that our class of fibrations include families of\ncompactified Jacobians of integral locally planar curves.\n  Applications include the following: (a) we prove the motivic decomposition\nconjecture for this class (including compactified Jacobian fibrations), which\ngeneralizes Deninger-Murre's theorem for abelian schemes; (b) we provide a new\nproof of the P=W conjecture for $\\mathrm{GL}_r$; (c) we prove half of the P=C\nconjecture concerning refined BPS invariants for the local $\\mathbb{P}^2$; (d)\nwe show that the perverse filtration for the compactified Jacobian associated\nwith an integral locally planar curve is multiplicative, which generalizes a\nresult of Oblomkov-Yun for homogeneous singularities.\n  Our techniques combine Arinkin's autoduality for coherent categories, Ng\\^o's\nsupport theorem for the decomposition theorem, Adams operations in operational\nK-theory, and Corti-Hanamura's theory of relative Chow motives.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:41:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Maulik","Davesh",""],["Shen","Junliang",""],["Yin","Qizheng",""]]}
{"id":"2308.13161","submitter":"Miaolan Xie","authors":"Katya Scheinberg and Miaolan Xie","title":"Stochastic Adaptive Regularization Method with Cubics: A High\n  Probability Complexity Bound","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a high probability complexity bound for a stochastic adaptive\nregularization method with cubics, also known as regularized Newton method. The\nmethod makes use of stochastic zeroth-, first- and second-order oracles that\nsatisfy certain accuracy and reliability assumptions. Such oracles have been\nused in the literature by other stochastic adaptive methods, such as trust\nregion and line search. These oracles capture many settings, such as expected\nrisk minimization, simulation optimization, and others. In this paper, we give\nthe first high probability iteration bound for stochastic cubic regularization,\nand show that just as in the deterministic case, it is superior to other\nstochastic adaptive methods.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:46:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Scheinberg","Katya",""],["Xie","Miaolan",""]]}
{"id":"2308.13162","submitter":"Yuichi Oyama","authors":"Yuichi Oyama","title":"Toward the confirmation of atmospheric neutrino oscillations","comments":"15 pages, 11 figures, accepted by Prog. Theor. Exp. Phys. as a paper\n  for \"A special issue in memory of Masatoshi Koshiba, a pioneer in\n  experimental particle physics and astrophysics\"","journal-ref":null,"doi":"10.1093/ptep/ptad097","report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The atmospheric muon neutrino deficit, which was possible evidence of\n$\\nu_\\mu \\leftrightarrow \\nu_\\tau$ oscillation, was reported by the Kamiokande\nexperiment from 1988. Many experimental efforts were made to examine the\nKamiokande results. Experiments which contributed to the confirmation of\n$\\nu_\\mu \\leftrightarrow \\nu_\\tau$ oscillation are reviewed. Especially,\nlong-baseline neutrino-oscillation experiments are described in detail.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:52:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Oyama","Yuichi",""]]}
{"id":"2308.13163","submitter":"Timothy J. K. Ng","authors":"Timothy J. K. Ng (1) and Nan Chen (1) and Fu Zhang (1) ((1) MaRS\n  Laboratory, Dept. of Mechanical Engineering, The University of Hong Kong)","title":"Snapp: An Agile Robotic Fish with 3-D Maneuverability for Open Water\n  Swim","comments":"8 pages, 17 figures, to be publish in IEEE Robotics and Automation\n  Letters The accompanying video can be found at this link:\n  https://youtu.be/1bGmlN0Jriw","journal-ref":null,"doi":"10.1109/LRA.2023.3308015","report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fish exhibit impressive locomotive performance and agility in complex\nunderwater environments, using their undulating tails and pectoral fins for\npropulsion and maneuverability. Replicating these abilities in robotic fish is\nchallenging; existing designs focus on either fast swimming or directional\ncontrol at limited speeds, mainly within a confined environment. To address\nthese limitations, we designed Snapp, an integrated robotic fish capable of\nswimming in open water with high speeds and full 3-dimensional maneuverability.\nA novel cyclic-differential method is layered on the mechanism. It integrates\npropulsion and yaw-steering for fast course corrections. Two independent\npectoral fins provide pitch and roll control. We evaluated Snapp in open water\nenvironments. We demonstrated significant improvements in speed and\nmaneuverability, achieving swimming speeds of 1.5 m/s (1.7 Body Lengths per\nsecond) and performing complex maneuvers, such as a figure-8 and S-shape\ntrajectory. Instantaneous yaw changes of 15$^{\\circ}$ in 0.4 s, a minimum turn\nradius of 0.85 m, and maximum pitch and roll rates of 3.5 rad/s and 1 rad/s,\nrespectively, were recorded. Our results suggest that Snapp's swimming\ncapabilities have excellent practical prospects for open seas and contribute\nsignificantly to developing agile robotic fishes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 03:59:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ng","Timothy J. K.",""],["Chen","Nan",""],["Zhang","Fu",""]]}
{"id":"2308.13164","submitter":"Xunpeng Yi","authors":"Xunpeng Yi, Han Xu, Hao Zhang, Linfeng Tang, Jiayi Ma","title":"Diff-Retinex: Rethinking Low-light Image Enhancement with A Generative\n  Diffusion Model","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we rethink the low-light image enhancement task and propose a\nphysically explainable and generative diffusion model for low-light image\nenhancement, termed as Diff-Retinex. We aim to integrate the advantages of the\nphysical model and the generative network. Furthermore, we hope to supplement\nand even deduce the information missing in the low-light image through the\ngenerative network. Therefore, Diff-Retinex formulates the low-light image\nenhancement problem into Retinex decomposition and conditional image\ngeneration. In the Retinex decomposition, we integrate the superiority of\nattention in Transformer and meticulously design a Retinex Transformer\ndecomposition network (TDN) to decompose the image into illumination and\nreflectance maps. Then, we design multi-path generative diffusion networks to\nreconstruct the normal-light Retinex probability distribution and solve the\nvarious degradations in these components respectively, including dark\nillumination, noise, color deviation, loss of scene contents, etc. Owing to\ngenerative diffusion model, Diff-Retinex puts the restoration of low-light\nsubtle detail into practice. Extensive experiments conducted on real-world\nlow-light datasets qualitatively and quantitatively demonstrate the\neffectiveness, superiority, and generalization of the proposed method.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:03:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yi","Xunpeng",""],["Xu","Han",""],["Zhang","Hao",""],["Tang","Linfeng",""],["Ma","Jiayi",""]]}
{"id":"2308.13165","submitter":"Ruibing Hou","authors":"Ruibing Hou, Hong Chang, Bingpeng Ma, Shiguang Shan and Xilin Chen","title":"Dual Compensation Residual Networks for Class Imbalanced Learning","comments":"20 pages","journal-ref":"IEEE Transactions on Pattern Analysis and Machine Intelligence\n  (TPAMI,2023)","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning generalizable representation and classifier for class-imbalanced\ndata is challenging for data-driven deep models. Most studies attempt to\nre-balance the data distribution, which is prone to overfitting on tail classes\nand underfitting on head classes. In this work, we propose Dual Compensation\nResidual Networks to better fit both tail and head classes. Firstly, we propose\ndual Feature Compensation Module (FCM) and Logit Compensation Module (LCM) to\nalleviate the overfitting issue. The design of these two modules is based on\nthe observation: an important factor causing overfitting is that there is\nsevere feature drift between training and test data on tail classes. In\ndetails, the test features of a tail category tend to drift towards feature\ncloud of multiple similar head categories. So FCM estimates a multi-mode\nfeature drift direction for each tail category and compensate for it.\nFurthermore, LCM translates the deterministic feature drift vector estimated by\nFCM along intra-class variations, so as to cover a larger effective\ncompensation space, thereby better fitting the test features. Secondly, we\npropose a Residual Balanced Multi-Proxies Classifier (RBMC) to alleviate the\nunder-fitting issue. Motivated by the observation that re-balancing strategy\nhinders the classifier from learning sufficient head knowledge and eventually\ncauses underfitting, RBMC utilizes uniform learning with a residual path to\nfacilitate classifier learning. Comprehensive experiments on Long-tailed and\nClass-Incremental benchmarks validate the efficacy of our method.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:06:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hou","Ruibing",""],["Chang","Hong",""],["Ma","Bingpeng",""],["Shan","Shiguang",""],["Chen","Xilin",""]]}
{"id":"2308.13166","submitter":"Chen Yan","authors":"Chen Yan and Alexandre Reiffers-Masson","title":"Certainty Equivalence Control-Based Heuristics in Multi-Stage Convex\n  Stochastic Optimization Problems","comments":"69 pages, 5 figures, submitted to Operations Research","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine a multi-stage stochastic optimization problem characterized by\nstagewise-independent, decision-dependent noises with strict constraints. The\nproblem assumes convexity in that, following a specific relaxation, it\ntransforms into a deterministic convex program. The relaxation process is\ninspired by the principle of Certainty Equivalence Control, which substitutes\nuncertainties with their nominal values and requires the hard constraints to be\nsatisfied only in an expected sense. Utilizing the solutions obtained from\nthese convex programs, we propose two universal methodologies --\nre-solving-based and projection-based -- to formulate feasible policies\nrelevant to the original problem. These methodologies are subsequently\namalgamated to develop a hybrid policy, equipped with a tuning parameter that\nmanages the frequency of re-solving. We derive upper bounds on the gap between\nthe performance of these heuristic policies and the optimal one. Under the\nLipschitz-type regularity of the model, these bounds are proportional to the\nsquare root of the stochastic noise variance. Assuming additional\n$C^2$-smoothness regularity, an alternative bound, proportional to the variance\nof the stochastic noise, can be established -- providing a refinement when\nvariances are small. We also delve into the issues concerning the exponential\ngrowth of a multiplicative constant in these bounds with respect to the stage\nnumber. Our model strives to lay a comprehensive framework for dynamic\nsequential decision-making in the presence of uncertainties, incorporating\nclassic problems from inventory management and Markovian bandits, while also\naccommodating a wider spectrum of stochastic optimization challenges.\nSpecifically, we illustrate our methods on a network utility maximization\nproblem through numerical experiments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:09:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yan","Chen",""],["Reiffers-Masson","Alexandre",""]]}
{"id":"2308.13167","submitter":"Bhawesh Mishra","authors":"Bhawesh Mishra","title":"Almost No Finite Subset of Integers Contains a $q^{th}$ Power Modulo\n  Almost Every Prime","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $q$ be a prime. We give an elementary proof of the fact that for any\n$k\\in\\mathbb{N}$, the proportion of $k$-element subsets of $\\mathbb{Z}$ that\ncontain a $q^{th}$ power modulo almost every prime, is zero. This result holds\nregardless of whether the proportion is measured additively or\nmultiplicatively. More specifically, the number of $k$-element subsets of $[-N,\nN]\\cap\\mathbb{Z}$ that contain a $q^{th}$ power modulo almost every prime is no\nlarger than $a_{q,k} N^{k-(1-\\frac{1}{q})}$, for some positive constant\n$a_{q,k}$. Furthermore, the number of $k$-element subsets of $\\{\\pm\np_{1}^{e_{1}} p_{2}^{e_{2}} \\cdots p_{N}^{e_{N}} : 0 \\leq e_{1}, e_{2}, \\ldots,\ne_{N}\\leq N\\}$ that contain a $q^{th}$ power modulo almost every prime is no\nlarger than $m_{q,k} \\frac{N^{Nk}}{q^{N}}$ for some positive constant\n$m_{q,k}$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:10:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mishra","Bhawesh",""]]}
{"id":"2308.13168","submitter":"Zekun Li","authors":"Zekun Li, Lei Qi, Yinghuan Shi, Yang Gao","title":"IOMatch: Simplifying Open-Set Semi-Supervised Learning with Joint\n  Inliers and Outliers Utilization","comments":"Accepted by ICCV 2023, selected for an Oral presentation","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semi-supervised learning (SSL) aims to leverage massive unlabeled data when\nlabels are expensive to obtain. Unfortunately, in many real-world applications,\nthe collected unlabeled data will inevitably contain unseen-class outliers not\nbelonging to any of the labeled classes. To deal with the challenging open-set\nSSL task, the mainstream methods tend to first detect outliers and then filter\nthem out. However, we observe a surprising fact that such approach could result\nin more severe performance degradation when labels are extremely scarce, as the\nunreliable outlier detector may wrongly exclude a considerable portion of\nvaluable inliers. To tackle with this issue, we introduce a novel open-set SSL\nframework, IOMatch, which can jointly utilize inliers and outliers, even when\nit is difficult to distinguish exactly between them. Specifically, we propose\nto employ a multi-binary classifier in combination with the standard closed-set\nclassifier for producing unified open-set classification targets, which regard\nall outliers as a single new class. By adopting these targets as open-set\npseudo-labels, we optimize an open-set classifier with all unlabeled samples\nincluding both inliers and outliers. Extensive experiments have shown that\nIOMatch significantly outperforms the baseline methods across different\nbenchmark datasets and different settings despite its remarkable simplicity.\nOur code and models are available at https://github.com/nukezil/IOMatch.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:14:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Zekun",""],["Qi","Lei",""],["Shi","Yinghuan",""],["Gao","Yang",""]]}
{"id":"2308.13169","submitter":"Yanping Liu","authors":"Yanping Liu (1 and 2), Yang Jiao (3 and 4), Qihui Fan (5), Xinwei Li\n  (1 and 2), Zhichao Liu (1 and 2), Jun Hu (6), Jianwei Shuai (7,8 and 9), Liyu\n  Liu (10), Zhangyong Li (1 and 2)","title":"Morphological entropy encodes cellular migration strategies on multiple\n  length scales","comments":"17 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph q-bio.CB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cell migration is crucial to many physiological and pathological processes.\nDuring migration, a cell adapts its morphology, including the overall\nmorphology and nucleus morphology, in response to various cues in complex\nmicroenvironments, e.g. topotaxis and chemotaxis. Thus, cellular morphology\ndynamics can encode migration strategies based on which various migration\nmechanisms can be inferred. However, how to decipher cell migration mechanisms\nencoded in the morphology dynamics remains a challenging problem. Here we\nintroduce a novel universal metric, namely cell morphological entropy (CME), by\ncombining parametric morphological analysis with Shannon entropy. The utility\nof CME, which accurately quantifies the complex cellular morphology on multiple\nlength scales through the deviation from the perfect circular shape, is\ndemonstrated using a variety of normal and tumorous cell lines in distinct in\nvitro microenvironments. Our results reveal that 1) the effects of geometric\nconstraints on cell nucleus, 2) the emerging interplays of MCF-10A cells\nmigrating on collagen gel, and 3) the critical transition of tumor spheroid\nfrom proliferation to invasion. The analysis indicates that the CME offers a\nphysically interpretable and efficient tool to quantify morphology on multiple\nlength scales in real-time, which provides more insights into cell migration,\nand further contributing to the understanding of the diverse behavioral modes\nas well as collective cell motility in more complex microenvironment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:14:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Yanping","","1 and 2"],["Jiao","Yang","","3 and 4"],["Fan","Qihui","","1 and 2"],["Li","Xinwei","","1 and 2"],["Liu","Zhichao","","1 and 2"],["Hu","Jun","","7,8 and 9"],["Shuai","Jianwei","","7,8 and 9"],["Liu","Liyu","","1 and 2"],["Li","Zhangyong","","1 and 2"]]}
{"id":"2308.13170","submitter":"Angana Borah","authors":"Angana Borah, Daria Pylypenko, Cristina Espana-Bonet, Josef van\n  Genabith","title":"Measuring Spurious Correlation in Classification: 'Clever Hans' in\n  Translationese","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent work has shown evidence of 'Clever Hans' behavior in high-performance\nneural translationese classifiers, where BERT-based classifiers capitalize on\nspurious correlations, in particular topic information, between data and target\nclassification labels, rather than genuine translationese signals.\nTranslationese signals are subtle (especially for professional translation) and\ncompete with many other signals in the data such as genre, style, author, and,\nin particular, topic. This raises the general question of how much of the\nperformance of a classifier is really due to spurious correlations in the data\nversus the signals actually targeted for by the classifier, especially for\nsubtle target signals and in challenging (low resource) data settings. We focus\non topic-based spurious correlation and approach the question from two\ndirections: (i) where we have no knowledge about spurious topic information and\nits distribution in the data, (ii) where we have some indication about the\nnature of spurious topic correlations. For (i) we develop a measure from first\nprinciples capturing alignment of unsupervised topics with target\nclassification labels as an indication of spurious topic information in the\ndata. We show that our measure is the same as purity in clustering and propose\na 'topic floor' (as in a 'noise floor') for classification. For (ii) we\ninvestigate masking of known spurious topic carriers in classification. Both\n(i) and (ii) contribute to quantifying and (ii) to mitigating spurious\ncorrelations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:19:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Borah","Angana",""],["Pylypenko","Daria",""],["Espana-Bonet","Cristina",""],["van Genabith","Josef",""]]}
{"id":"2308.13171","submitter":"Zhaoping Xiong","authors":"Zhaoping Xiong, Xiaopeng Cui, Xinyuan Lin, Feixiao Ren, Bowen Liu,\n  Yunting Li, Manhong Yung and Nan Qiao","title":"Q-Drug: a Framework to bring Drug Design into Quantum Space using Deep\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph q-bio.MN q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Optimizing the properties of molecules (materials or drugs) for stronger\ntoughness, lower toxicity, or better bioavailability has been a long-standing\nchallenge. In this context, we propose a molecular optimization framework\ncalled Q-Drug (Quantum-inspired optimization algorithm for Drugs) that\nleverages quantum-inspired algorithms to optimize molecules on discrete binary\ndomain variables. The framework begins by encoding the molecules into binary\nembeddings using a discrete VAE. The binary embeddings are then used to\nconstruct an Ising energy-like objective function, over which the\nstate-of-the-art quantum-inspired optimization algorithm is adopted to find the\noptima. The binary embeddings corresponding to the optima are decoded to obtain\nthe optimized molecules. We have tested the framework for optimizing drug\nmolecule properties and have found that it outperforms other molecular\noptimization methods, finding molecules with better properties in 1/20th to\n1/10th of the time previously required. The framework can also be deployed\ndirectly on various quantum computing equipment, such as laser pulses CIMs,\nFPGA Ising Machines, and quantum computers based on quantum annealing, among\nothers. Our work demonstrates a new paradigm that leverages the advantages of\nquantum computing and AI to solve practically useful problems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:26:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xiong","Zhaoping",""],["Cui","Xiaopeng",""],["Lin","Xinyuan",""],["Ren","Feixiao",""],["Liu","Bowen",""],["Li","Yunting",""],["Yung","Manhong",""],["Qiao","Nan",""]]}
{"id":"2308.13172","submitter":"Neha Makhija","authors":"Neha Makhija","title":"Discovering Dichotomies for Problems in Database Theory","comments":"4 pages, Appeared in VLDB23 PhD Workshop\n  (https://ceur-ws.org/Vol-3452/paper3.pdf)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dichotomy theorems, which characterize the conditions under which a problem\ncan be solved efficiently, have helped identify important tractability borders\nfor as probabilistic query evaluation, view maintenance, query containment\n(among many more problems). However, dichotomy theorems for many such problems\nremain elusive under key settings such as bag semantics or for queries with\nself-joins. This work aims to unearth dichotomies for fundamental problems in\nreverse data management and knowledge representation. We use a novel approach\nto discovering dichotomies: instead of creating dedicated algorithms for easy\n(PTIME) and hard cases (NP-complete), we devise unified algorithms that are\nguaranteed to terminate in PTIME for easy cases. Using this approach, we\ndiscovered new tractable cases for the problem of minimal factorization of\nprovenance formulas as well as dichotomies under bag semantics for the problems\nof resilience and causal responsibility\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:42:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Makhija","Neha",""]]}
{"id":"2308.13173","submitter":"Yangyang Shi","authors":"Mei-Yuh Hwang, Yangyang Shi, Ankit Ramchandani, Guan Pang, Praveen\n  Krishnan, Lucas Kabela, Frank Seide, Samyak Datta, Jun Liu","title":"DISGO: Automatic End-to-End Evaluation for Scene Text OCR","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper discusses the challenges of optical character recognition (OCR) on\nnatural scenes, which is harder than OCR on documents due to the wild content\nand various image backgrounds. We propose to uniformly use word error rates\n(WER) as a new measurement for evaluating scene-text OCR, both end-to-end (e2e)\nperformance and individual system component performances. Particularly for the\ne2e metric, we name it DISGO WER as it considers Deletion, Insertion,\nSubstitution, and Grouping/Ordering errors. Finally we propose to utilize the\nconcept of super blocks to automatically compute BLEU scores for e2e OCR\nmachine translation. The small SCUT public test set is used to demonstrate WER\nperformance by a modularized OCR system.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:45:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hwang","Mei-Yuh",""],["Shi","Yangyang",""],["Ramchandani","Ankit",""],["Pang","Guan",""],["Krishnan","Praveen",""],["Kabela","Lucas",""],["Seide","Frank",""],["Datta","Samyak",""],["Liu","Jun",""]]}
{"id":"2308.13174","submitter":"Zhe Wang","authors":"Zhe Wang, Shoukun Sun, Xiang Que, Xiaogang Ma","title":"Interactive segmentation in aerial images: a new benchmark and an open\n  access web-based tool","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In recent years, deep learning has emerged as a powerful approach in remote\nsensing applications, particularly in segmentation and classification\ntechniques that play a crucial role in extracting significant land features\nfrom satellite and aerial imagery. However, only a limited number of papers\nhave discussed the use of deep learning for interactive segmentation in land\ncover classification tasks. In this study, we aim to bridge the gap between\ninteractive segmentation and remote sensing image analysis by conducting a\nbenchmark study on various deep learning-based interactive segmentation models.\nWe assessed the performance of five state-of-the-art interactive segmentation\nmethods (SimpleClick, FocalClick, Iterative Click Loss (ICL), Reviving\nIterative Training with Mask Guidance for Interactive Segmentation (RITM), and\nSegment Anything (SAM)) on two high-resolution aerial imagery datasets. To\nenhance the segmentation results without requiring multiple models, we\nintroduced the Cascade-Forward Refinement (CFR) approach, an innovative\ninference strategy for interactive segmentation. We evaluated these interactive\nsegmentation methods on various land cover types, object sizes, and band\ncombinations in remote sensing. Surprisingly, the popularly discussed method,\nSAM, proved to be ineffective for remote sensing images. Conversely, the\npoint-based approach used in the SimpleClick models consistently outperformed\nthe other methods in all experiments. Building upon these findings, we\ndeveloped a dedicated online tool called RSISeg for interactive segmentation of\nremote sensing data. RSISeg incorporates a well-performing interactive model,\nfine-tuned with remote sensing data. Additionally, we integrated the SAM model\ninto this tool. Compared to existing interactive segmentation tools, RSISeg\noffers strong interactivity, modifiability, and adaptability to remote sensing\ndata.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:49:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Zhe",""],["Sun","Shoukun",""],["Que","Xiang",""],["Ma","Xiaogang",""]]}
{"id":"2308.13175","submitter":"Chao Chen","authors":"Chao Chen, Yu-Shen Liu, Zhizhong Han","title":"GridPull: Towards Scalability in Learning Implicit Representations from\n  3D Point Clouds","comments":"13pages,14figures. Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning implicit representations has been a widely used solution for surface\nreconstruction from 3D point clouds. The latest methods infer a distance or\noccupancy field by overfitting a neural network on a single point cloud.\nHowever, these methods suffer from a slow inference due to the slow convergence\nof neural networks and the extensive calculation of distances to surface\npoints, which limits them to small scale points. To resolve the scalability\nissue in surface reconstruction, we propose GridPull to improve the efficiency\nof learning implicit representations from large scale point clouds. Our novelty\nlies in the fast inference of a discrete distance field defined on grids\nwithout using any neural components. To remedy the lack of continuousness\nbrought by neural networks, we introduce a loss function to encourage\ncontinuous distances and consistent gradients in the field during pulling\nqueries onto the surface in grids near to the surface. We use uniform grids for\na fast grid search to localize sampled queries, and organize surface points in\na tree structure to speed up the calculation of distances to the surface. We do\nnot rely on learning priors or normal supervision during optimization, and\nachieve superiority over the latest methods in terms of complexity and\naccuracy. We evaluate our method on shape and scene benchmarks, and report\nnumerical and visual comparisons with the latest methods to justify our\neffectiveness and superiority. The code is available at\nhttps://github.com/chenchao15/GridPull.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:52:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Chao",""],["Liu","Yu-Shen",""],["Han","Zhizhong",""]]}
{"id":"2308.13176","submitter":"Chao Wu","authors":"Chao Wu, Peng Chen, Baiqiao Yin, Zijuan Lin, Chen Jiang, Di Yu,\n  Changhong Zou, Chunwang Lui","title":"Using Adamic-Adar Index Algorithm to Predict Volunteer Collaboration:\n  Less is More","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Social networks exhibit a complex graph-like structure due to the uncertainty\nsurrounding potential collaborations among participants. Machine learning\nalgorithms possess generic outstanding performance in multiple real-world\nprediction tasks. However, whether machine learning algorithms outperform\nspecific algorithms designed for graph link prediction remains unknown to us.\nTo address this issue, the Adamic-Adar Index (AAI), Jaccard Coefficient (JC)\nand common neighbour centrality (CNC) as representatives of graph-specific\nalgorithms were applied to predict potential collaborations, utilizing data\nfrom volunteer activities during the Covid-19 pandemic in Shenzhen city, along\nwith the classical machine learning algorithms such as random forest, support\nvector machine, and gradient boosting as single predictors and components of\nensemble learning. This paper introduces that the AAI algorithm outperformed\nthe traditional JC and CNC, and other machine learning algorithms in analyzing\ngraph node attributes for this task.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:52:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Chao",""],["Chen","Peng",""],["Yin","Baiqiao",""],["Lin","Zijuan",""],["Jiang","Chen",""],["Yu","Di",""],["Zou","Changhong",""],["Lui","Chunwang",""]]}
{"id":"2308.13177","submitter":"Tiancheng Zhao","authors":"Yiyang Yao, Peng Liu, Tiancheng Zhao, Qianqian Zhang, Jiajia Liao,\n  Chunxin Fang, Kyusong Lee, Qing Wang","title":"How to Evaluate the Generalization of Detection? A Benchmark for\n  Comprehensive Open-Vocabulary Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Object detection (OD) in computer vision has made significant progress in\nrecent years, transitioning from closed-set labels to open-vocabulary detection\n(OVD) based on large-scale vision-language pre-training (VLP). However, current\nevaluation methods and datasets are limited to testing generalization over\nobject types and referral expressions, which do not provide a systematic,\nfine-grained, and accurate benchmark of OVD models' abilities. In this paper,\nwe propose a new benchmark named OVDEval, which includes 9 sub-tasks and\nintroduces evaluations on commonsense knowledge, attribute understanding,\nposition understanding, object relation comprehension, and more. The dataset is\nmeticulously created to provide hard negatives that challenge models' true\nunderstanding of visual and linguistic input. Additionally, we identify a\nproblem with the popular Average Precision (AP) metric when benchmarking models\non these fine-grained label datasets and propose a new metric called\nNon-Maximum Suppression Average Precision (NMS-AP) to address this issue.\nExtensive experimental results show that existing top OVD models all fail on\nthe new tasks except for simple object types, demonstrating the value of the\nproposed dataset in pinpointing the weakness of current OVD models and guiding\nfuture research. Furthermore, the proposed NMS-AP metric is verified by\nexperiments to provide a much more truthful evaluation of OVD models, whereas\ntraditional AP metrics yield deceptive results. Data is available at\n\\url{https://github.com/om-ai-lab/OVDEval}\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 04:54:32 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yao","Yiyang",""],["Liu","Peng",""],["Zhao","Tiancheng",""],["Zhang","Qianqian",""],["Liao","Jiajia",""],["Fang","Chunxin",""],["Lee","Kyusong",""],["Wang","Qing",""]]}
{"id":"2308.13178","submitter":"Yibo Wang","authors":"Yibo Wang, Yunhu Ye, Yuanpeng Mao, Yanwei Yu and Yuanping Song","title":"Self-supervised Scene Text Segmentation with Object-centric Layered\n  Representations Augmented by Text Regions","comments":null,"journal-ref":null,"doi":"10.1145/3503161.3548315","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text segmentation tasks have a very wide range of application values, such as\nimage editing, style transfer, watermark removal, etc.However, existing public\ndatasets are of poor quality of pixel-level labels that have been shown to be\nnotoriously costly to acquire, both in terms of money and time. At the same\ntime, when pretraining is performed on synthetic datasets, the data\ndistribution of the synthetic datasets is far from the data distribution in the\nreal scene. These all pose a huge challenge to the current pixel-level text\nsegmentation algorithms.To alleviate the above problems, we propose a\nself-supervised scene text segmentation algorithm with layered decoupling of\nrepresentations derived from the object-centric manner to segment images into\ntexts and background. In our method, we propose two novel designs which include\nRegion Query Module and Representation Consistency Constraints adapting to the\nunique properties of text as complements to Auto Encoder, which improves the\nnetwork's sensitivity to texts.For this unique design, we treat the\npolygon-level masks predicted by the text localization model as extra input\ninformation, and neither utilize any pixel-level mask annotations for training\nstage nor pretrain on synthetic datasets.Extensive experiments show the\neffectiveness of the method proposed. On several public scene text datasets,\nour method outperforms the state-of-the-art unsupervised segmentation\nalgorithms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:00:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Yibo",""],["Ye","Yunhu",""],["Mao","Yuanpeng",""],["Yu","Yanwei",""],["Song","Yuanping",""]]}
{"id":"2308.13179","submitter":"Kaito Noro","authors":"Kaito Noro, Wolfgang Bentz, Ian C. Clo\\\"et, Teruyuki Kitabayashi","title":"Composite octet baryons in a relativistic mean field description of\n  nuclear and neutron star matter","comments":"21 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the properties of composite octet baryons in the nuclear medium\nand neutron star matter. The internal quark-diquark structure of the octet\nbaryons and the equations of state of nuclear matter and neutron star matter in\nthe mean field approximation are described by using the three-flavor\nNambu--Jona-Lasinio (NJL) model as an effective quark theory of QCD. After\nintroducing our model, we first discuss the properties of single baryons and\ntheir effective meson exchange interactions in symmetric nuclear matter by\nusing concepts of Fermi liquid theory. Several model independent implications\nof this description are derived, and illustrated by numerical results obtained\nin our model. Second, we extend the model description to high baryon densities,\nand investigate the equation of state of neutron star matter and the resulting\nstar masses. We find that the so called hyperon puzzle persists also for the\ncase of composite hadrons. To get more information on this point, we also\ninvestigate the role of 6-fermi and 8-fermi interactions, in addition to the\nstandard 4-fermi interactions. The strengths of those higher order fermi\ninteractions is determined so as not to spoil the saturation properties of\nnuclear matter. Among them, an interaction characterized by a product of four\nquark current operators plays a special role to stabilize the stars over a\nlarge region of central baryon densities, although it has little effect on the\nmaximum star masses.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:01:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Noro","Kaito",""],["Bentz","Wolfgang",""],["Clo\u00ebt","Ian C.",""],["Kitabayashi","Teruyuki",""]]}
{"id":"2308.13180","submitter":"Jieun Kim","authors":"Jieun Kim, Muqing Yu, Jung-Woo Lee, Shun-Li Shang, Gi-Yeop Kim, Pratap\n  Pal, Jinsol Seo, Neil Campbell, Kitae Eom, Ranjani Ramachandran, Mark S.\n  Rzchowski, Sang Ho Oh, Si-Young Choi, Zi-Kui Liu, Jeremy Levy, Chang-Beom Eom","title":"Electronic-grade epitaxial (111) KTaO3 heterostructures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  KTaO3 has recently attracted attention as a model system to study the\ninterplay of quantum paraelectricity, spin-orbit coupling, and\nsuperconductivity. However, the high and low vapor pressures of potassium and\ntantalum present processing challenges to creating interfaces clean enough to\nreveal the intrinsic quantum properties. Here, we report superconducting\nheterostructures based on electronic-grade epitaxial (111) KTaO3 thin films.\nElectrical and structural characterizations reveal that two-dimensional\nelectron gas at the heterointerface between amorphous LaAlO3 and KTaO3 thin\nfilm exhibits significantly higher electron mobility, superconducting\ntransition temperature and critical current density than those in bulk single\ncrystal KTaO3-based heterostructures owing to cleaner interface in KTaO3 thin\nfilms. Our hybrid approach may enable epitaxial growth of other alkali\nmetal-based oxides that lie beyond the capabilities of conventional methods.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:17:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kim","Jieun",""],["Yu","Muqing",""],["Lee","Jung-Woo",""],["Shang","Shun-Li",""],["Kim","Gi-Yeop",""],["Pal","Pratap",""],["Seo","Jinsol",""],["Campbell","Neil",""],["Eom","Kitae",""],["Ramachandran","Ranjani",""],["Rzchowski","Mark S.",""],["Oh","Sang Ho",""],["Choi","Si-Young",""],["Liu","Zi-Kui",""],["Levy","Jeremy",""],["Eom","Chang-Beom",""]]}
{"id":"2308.13181","submitter":"Akshat Pandey","authors":"Steven A. Kivelson, Akshat Pandey, Anisha G. Singh, Aharon Kapitulnik,\n  Ian R. Fisher","title":"Emergent $\\mathbb{Z}_2$ symmetry near a CDW multicritical point","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the critical behavior associated with incommensurate\nunidirectional charge-density-wave ordering in a weakly orthorhombic system\nsubject to uniaxial strain as an experimentally significant example of\n$U(1)\\times U(1)$ multicriticality. We show that, depending on microscopic\ndetails, the phase diagram can have qualitatively different structures which\ncan involve a vestigial meta-nematic critical point, a pair of tricritical\npoints, a decoupled tetracritical point, or (at least at mean-field level) a\nbicritical point. We analyze the emergent symmetries in the critical regime and\nfind that these can -- at least in some cases -- involve an emergent\n$\\mathbb{Z}_2$ order parameter symmetry.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:21:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kivelson","Steven A.",""],["Pandey","Akshat",""],["Singh","Anisha G.",""],["Kapitulnik","Aharon",""],["Fisher","Ian R.",""]]}
{"id":"2308.13182","submitter":"Shikha Dubey","authors":"Shikha Dubey, Tushar Kataria, Beatrice Knudsen, and Shireen Y.\n  Elhabian","title":"Structural Cycle GAN for Virtual Immunohistochemistry Staining of Gland\n  Markers in the Colon","comments":"Accepted to MICCAI Workshop 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the advent of digital scanners and deep learning, diagnostic operations\nmay move from a microscope to a desktop. Hematoxylin and Eosin (H&E) staining\nis one of the most frequently used stains for disease analysis, diagnosis, and\ngrading, but pathologists do need different immunohistochemical (IHC) stains to\nanalyze specific structures or cells. Obtaining all of these stains (H&E and\ndifferent IHCs) on a single specimen is a tedious and time-consuming task.\nConsequently, virtual staining has emerged as an essential research direction.\nHere, we propose a novel generative model, Structural Cycle-GAN (SC-GAN), for\nsynthesizing IHC stains from H&E images, and vice versa. Our method expressly\nincorporates structural information in the form of edges (in addition to color\ndata) and employs attention modules exclusively in the decoder of the proposed\ngenerator model. This integration enhances feature localization and preserves\ncontextual information during the generation process. In addition, a structural\nloss is incorporated to ensure accurate structure alignment between the\ngenerated and input markers. To demonstrate the efficacy of the proposed model,\nexperiments are conducted with two IHC markers emphasizing distinct structures\nof glands in the colon: the nucleus of epithelial cells (CDX2) and the\ncytoplasm (CK818). Quantitative metrics such as FID and SSIM are frequently\nused for the analysis of generative models, but they do not correlate\nexplicitly with higher-quality virtual staining results. Therefore, we propose\ntwo new quantitative metrics that correlate directly with the virtual staining\nspecificity of IHC markers.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:24:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dubey","Shikha",""],["Kataria","Tushar",""],["Knudsen","Beatrice",""],["Elhabian","Shireen Y.",""]]}
{"id":"2308.13183","submitter":"Nicol\\'as Ayobi","authors":"Cristina Gonz\\'alez, Nicol\\'as Ayobi, Felipe Escall\\'on, Laura\n  Baldovino-Chiquillo, Maria Wilches-Mogoll\\'on, Donny Pasos, Nicole Ram\\'irez,\n  Jose Pinz\\'on, Olga Sarmiento, D Alex Quistberg, Pablo Arbel\\'aez","title":"STRIDE: Street View-based Environmental Feature Detection and Pedestrian\n  Collision Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a novel benchmark to study the impact and relationship\nof built environment elements on pedestrian collision prediction, intending to\nenhance environmental awareness in autonomous driving systems to prevent\npedestrian injuries actively. We introduce a built environment detection task\nin large-scale panoramic images and a detection-based pedestrian collision\nfrequency prediction task. We propose a baseline method that incorporates a\ncollision prediction module into a state-of-the-art detection model to tackle\nboth tasks simultaneously. Our experiments demonstrate a significant\ncorrelation between object detection of built environment elements and\npedestrian collision frequency prediction. Our results are a stepping stone\ntowards understanding the interdependencies between built environment\nconditions and pedestrian safety.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:25:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gonz\u00e1lez","Cristina",""],["Ayobi","Nicol\u00e1s",""],["Escall\u00f3n","Felipe",""],["Baldovino-Chiquillo","Laura",""],["Wilches-Mogoll\u00f3n","Maria",""],["Pasos","Donny",""],["Ram\u00edrez","Nicole",""],["Pinz\u00f3n","Jose",""],["Sarmiento","Olga",""],["Quistberg","D Alex",""],["Arbel\u00e1ez","Pablo",""]]}
{"id":"2308.13184","submitter":"Milad Tatar Mamaghani","authors":"Milad Tatar Mamaghani, Xiangyun Zhou, Nan Yang, A. Lee Swindlehurst,\n  and H. Vincent Poor","title":"Performance Analysis of Finite Blocklength Transmissions Over Wiretap\n  Fading Channels: An Average Information Leakage Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physical-layer security (PLS) is a promising technique to complement\ncommunication security in beyond-5G wireless networks. However, PLS\ndevelopments in current research are often based on the ideal assumption of\ninfinite coding blocklengths or perfect knowledge of the wiretap link's channel\nstate information (CSI). In this work, we study the performance of finite\nblocklength (FBL) transmissions using a new secrecy metric - the average\ninformation leakage (AIL). We evaluate the exact and approximate AIL with\narbitrary signaling and fading channels, assuming that the eavesdropper's\ninstantaneous CSI is unknown. We then conduct case studies that use artificial\nnoise (AN) beamforming to thoroughly analyze the AIL in both Rayleigh and\nRician fading channels. The accuracy of the analytical expressions is verified\nthrough extensive simulations, and various insights regarding the impact of key\nsystem parameters on the AIL are obtained. Particularly, our results reveal\nthat allowing a small level of AIL can potentially lead to significant\nreliability improvements. To improve the system performance, we formulate and\nsolve an average secrecy throughput (AST) optimization problem via both\nnon-adaptive and adaptive design strategies. Our findings highlight the\nsignificance of blocklength design and AN power allocation, as well as the\nimpact of their trade-off on the AST.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:31:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mamaghani","Milad Tatar",""],["Zhou","Xiangyun",""],["Yang","Nan",""],["Swindlehurst","A. Lee",""],["Poor","H. Vincent",""]]}
{"id":"2308.13185","submitter":"HongTao Wang","authors":"Hongtao Wang, Yong Shi","title":"The mid-infrared variability of the SDSS optical quasars","comments":"13 pages, 10 figures, published in RAA","journal-ref":null,"doi":"10.1088/1674-4527/20/2/21","report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on the Seventh Data Release (DR7) quasar catalog from the Sloan Digital\nSky Survey, we investigate the variability of optical quasars in W1, W2, W3 and\nW4 bands of the Wide-field Infrared Survey Explorer (WISE) and the Near-Earth\nObject Wide-field Infrared Survey Explorer (NEOWISE). Adopting the structure\nfunction method, we calculate the structure function ($\\rm\\delta t$=1 yr) which\nshows no obvious correlations with the bolometric luminosity, the black hole\nmass and the Eddington ratio. The ensemble structure functions in W1 and W2\nbands show that the SF slopes are steeper than those in previous studies which\nmay be caused by different cadence and observational epoch number. We further\ninvestigate the relation of variability amplitude $\\sigma_m$ between\nmid-infrared band and optical band, but no obvious correlation is found. No\ncorrelation is found between W1-W2 and g-r color. We think the mid-infrared\nemission of quasars may be smoothed out by the extended dust distribution, thus\nleading to no obvious correlation. For the radio-loud quasar sub-sample, we\nfurther analyze the relation between the variability amplitude in the\nmid-infrared band and the radio luminosity at 6 cm, but no obvious correlations\nare found, which indicate the mid-infrared emission contributed from the\nsynchrotron radiation of the relativistic jet is very weak.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:33:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Hongtao",""],["Shi","Yong",""]]}
{"id":"2308.13186","submitter":"Chaman  Lal Wangneo","authors":"C L Wangneo","title":"On Gabriel Quotient Rings","comments":"12 pages. arXiv admin note: substantial text overlap with\n  arXiv:1912.02509","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper the following theorem is proved.Let R be a prime Noetherian\nring with krull dimension R equal to n where n is a positive integer.Let Q be\nthe Goldie quotient ring of R.For a fixed positive integer m less than n let Cm\nbe the set of elements c of R With krull dimension R/cR less than m. Call g as\nthe m-gabriel filter if g is the family of right ideals I of R with krull\ndimension R/I less than m.Then we construct an extension ring R(m) of R having\nthe following properties (i) R(m) is a subring of Q with identity element 1 of\nR.(ii)If u(R(m)) is the set of units of R(m) then u(R(m) intersection R equals\nthe set cm. We call R(m) as the m-Gabriel quotient ring of R.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:35:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wangneo","C L",""]]}
{"id":"2308.13187","submitter":"Hasan Sariba\\c{s}","authors":"Hasan Saribas, Cagri Yesil, Serdarcan Dilbaz, Halit Orenbas","title":"MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the increasing complexity and scale of click-through rate (CTR)\nprediction tasks in online advertising and recommendation systems, accurately\nestimating the importance of features has become a critical aspect of\ndeveloping effective models. In this paper, we propose an attention-based\napproach that leverages max and mean pooling operations, along with a bit-wise\nattention mechanism, to enhance feature importance estimation in CTR\nprediction. Traditionally, pooling operations such as max and mean pooling have\nbeen widely used to extract relevant information from features. However, these\noperations can lead to information loss and hinder the accurate determination\nof feature importance. To address this challenge, we propose a novel attention\narchitecture that utilizes a bit-based attention structure that emphasizes the\nrelationships between all bits in features, together with maximum and mean\npooling. By considering the fine-grained interactions at the bit level, our\nmethod aims to capture intricate patterns and dependencies that might be\noverlooked by traditional pooling operations. To examine the effectiveness of\nthe proposed method, experiments have been conducted on three public datasets.\nThe experiments demonstrated that the proposed method significantly improves\nthe performance of the base models to achieve state-of-the-art results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:40:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Saribas","Hasan",""],["Yesil","Cagri",""],["Dilbaz","Serdarcan",""],["Orenbas","Halit",""]]}
{"id":"2308.13188","submitter":"Molla Ahamed","authors":"Molla Basir Ahamed","title":"Generalized Bohr inequalities for certain classes of functions and their\n  applications","comments":"22","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $ \\mathcal{B}:=\\{f(z)=\\sum_{n=0}^{\\infty}a_nz^n\\; \\mbox{with}\\;\n|f(z)|<1\\;\\mbox{for all}\\; z\\in\\mathbb{D}\\} $. The improved version of the\nclassical Bohr's inequality \\cite{Bohr-1914} states that if $ f\\in\\mathcal{B}\n$, then the associated majorant series $\nM_f(r):=\\sum_{n=0}^{\\infty}|a_n|r^n\\leq 1 $ holds for $ |z|=r\\leq 1/3 $ and the\nconstant $ 1/3 $ cannot be improved. Bohr's original theorem and its subsequent\ngeneralizations remain active fields of study, driving investigations in a wide\nrange of function spaces. In this paper, first we establish a generalized Bohr\ninequality for the class $\\mathcal{B}$ by allowing a sequence\n$\\{\\varphi_n(r)\\}_{n=0}^{\\infty}$ of non-negative continuous functions on $[0,\n1)$ in the place of $\\{r^n\\}_{n=0}^{\\infty}$ of the majorant series $M_f(r)$\nintroducing a weighted sequence of non-negative continuous functions\n$\\{\\Phi_n(r)\\}_{n=0}^{\\infty}$ on $[0, 1)$. Secondly, as a generalization, we\nobtain a refined version of the Bohr inequality for a certain class\n$\\tilde{G}^0_{\\mathcal{H}}(\\beta)$ of harmonic mappings. All the results are\nproved to be sharp.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:41:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ahamed","Molla Basir",""]]}
{"id":"2308.13189","submitter":"Tianshi Xu","authors":"Tianshi Xu, Meng Li, Runsheng Wang, Ru Huang","title":"Falcon: Accelerating Homomorphically Encrypted Convolutions for\n  Efficient Private Mobile Network Inference","comments":"8 pages. ICCAD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Efficient networks, e.g., MobileNetV2, EfficientNet, etc, achieves\nstate-of-the-art (SOTA) accuracy with lightweight computation. However,\nexisting homomorphic encryption (HE)-based two-party computation (2PC)\nframeworks are not optimized for these networks and suffer from a high\ninference overhead. We observe the inefficiency mainly comes from the packing\nalgorithm, which ignores the computation characteristics and the communication\nbottleneck of homomorphically encrypted depthwise convolutions. Therefore, in\nthis paper, we propose Falcon, an effective dense packing algorithm for\nHE-based 2PC frameworks. Falcon features a zero-aware greedy packing algorithm\nand a communication-aware operator tiling strategy to improve the packing\ndensity for depthwise convolutions. Compared to SOTA HE-based 2PC frameworks,\ne.g., CrypTFlow2, Iron and Cheetah, Falcon achieves more than 15.6x, 5.1x and\n1.8x latency reduction, respectively, at operator level. Meanwhile, at network\nlevel, Falcon allows for 1.4% and 4.2% accuracy improvement over Cheetah on\nCIFAR-100 and TinyImagenet datasets with iso-communication, respecitvely.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:48:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xu","Tianshi",""],["Li","Meng",""],["Wang","Runsheng",""],["Huang","Ru",""]]}
{"id":"2308.13190","submitter":"Ary Rodriguez-Gonzalez","authors":"Ary Rodr\\'iguez-Gonz\\'alez, Miriam Pe\\~na, Liliana\n  Hern\\'andez-Mart\\'inez, Francisco Ruiz-Escobedo, Alejandro Raga, Grazyna\n  Stasinka and Jorge Ivan Castorena","title":"Numerical models of planetary nebulae with different episodes of mass\n  ejection: the particular case of HuBi 1","comments":"accepted","journal-ref":"ApJ, 2023","doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have studied the evolution of HuBi 1-like planetary nebulae, considering\nseveral stages of mass injection. We have carried out numerical ionization+1D\nhydrodynamics+atomic/ionic rate models with our code Coral 1D to reproduce\nplanetary nebulae that present multiple shells produced by different ejection\nevents around the ionizing source. Furthermore, we are interested in comparing\nnumerical simulations with H$\\alpha$ and [NII]$\\lambda$6584 emission structures\nand the position-velocity diagrams observed in HuBi 1. This object also has a\nphase where it has drastically decreased the injection of ionized photons\nejected from the source. The result of these different stages of ejection is a\nnebula with intense [NII] line emission in the inner part of the planetary\nnebula and an extended HII recombination line emission around the central zone.\nThe model for HuBi 1 shows the capability of our code to explain the\nhydrodynamical and photoionization evolution in ionization nebulae. This is our\nfirst step with a 1D code to study these two physical phenomena at the same\ntime.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:52:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rodr\u00edguez-Gonz\u00e1lez","Ary",""],["Pe\u00f1a","Miriam",""],["Hern\u00e1ndez-Mart\u00ednez","Liliana",""],["Ruiz-Escobedo","Francisco",""],["Raga","Alejandro",""],["Stasinka","Grazyna",""],["Castorena","Jorge Ivan",""]]}
{"id":"2308.13191","submitter":"Jiawen Xie","authors":"Jiawen Xie, Pengyu Cheng, Xiao Liang, Yong Dai, Nan Du","title":"Chunk, Align, Select: A Simple Long-sequence Processing Method for\n  Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Although dominant in natural language processing, transformer-based models\nremain challenged by the task of long-sequence processing, because the\ncomputational cost of self-attention operations in transformers swells\nquadratically with the input sequence length. To alleviate the complexity of\nlong-sequence processing, we propose a simple framework to enable the\noffthe-shelf pre-trained transformers to process much longer sequences, while\nthe computation and memory costs remain growing linearly with the input\nsequence lengths. More specifically, our method divides each long-sequence\ninput into a batch of chunks, then aligns the interchunk information during the\nencoding steps, and finally selects the most representative hidden states from\nthe encoder for the decoding process. To extract inter-chunk semantic\ninformation, we align the start and end token embeddings among chunks in each\nencoding transformer block. To learn an effective hidden selection policy, we\ndesign a dual updating scheme inspired by reinforcement learning, which regards\nthe decoders of transformers as environments, and the downstream performance\nmetrics as the rewards to evaluate the hidden selection actions. Our empirical\nresults on real-world long-text summarization and reading comprehension tasks\ndemonstrate effective improvements compared to prior longsequence processing\nbaselines.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:52:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xie","Jiawen",""],["Cheng","Pengyu",""],["Liang","Xiao",""],["Dai","Yong",""],["Du","Nan",""]]}
{"id":"2308.13192","submitter":"Adrian Groza","authors":"Stefan Morar, Adrian Groza, Mihai Pomarlan","title":"Formalising Natural Language Quantifiers for Human-Robot Interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a method for formalising quantifiers in natural language in the\ncontext of human-robot interactions. The solution is based on first-order logic\nextended with capabilities to represent the cardinality of variables, operating\nsimilarly to generalised quantifiers. To demonstrate the method, we designed an\nend-to-end system able to receive input as natural language, convert it into a\nformal logical representation, evaluate it, and return a result or send a\ncommand to a simulated robot.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:05:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Morar","Stefan",""],["Groza","Adrian",""],["Pomarlan","Mihai",""]]}
{"id":"2308.13193","submitter":"Steffen Winter","authors":"Tillmann Bosch, Steffen Winter","title":"On the radial growth of ballistic aggregation and other aggregation\n  models","comments":"22 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For a class of aggregation models on the integer lattice $\\mathbb{Z}^d$,\n$d\\geq 2$, in which clusters are formed by particles arriving one after the\nother and sticking irreversibly where they first hit the cluster, including the\nclassical model of diffusion-limited aggregation (DLA), we study the growth of\nthe clusters. We observe that a method of Kesten used to obtain an almost sure\nupper bound on the radial growth in the DLA model generalizes to a large class\nof such models. We use it in particular to prove such a bound for the so-called\nballistic model, in which the arriving particles travel along straight lines.\nOur bound implies that the fractal dimension of ballistic aggregation clusters\nin $\\mathbb{Z}^2$ is 2, which proves a long standing conjecture in the physics\nliterature.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:16:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bosch","Tillmann",""],["Winter","Steffen",""]]}
{"id":"2308.13194","submitter":"Ivan Kassal","authors":"Jacob T. Willson, Daniel Balzer, Ivan Kassal","title":"Fast and Accurate Simulations of Partially Delocalised Charge Separation\n  in Organic Semiconductors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Accurate computational screening of candidate materials promises to\naccelerate the discovery of higher-efficiency organic photovoltaics (OPVs).\nHowever, modelling charge separation in OPVs is challenging because accurate\nmodels must include disorder, polaron formation, and charge delocalisation.\nDelocalised kinetic Monte Carlo (dKMC) includes these three essential\ningredients, but it suffers from high computational cost. Recently, we\ndeveloped jumping kinetic Monte Carlo (jKMC), a computationally cheap and\naccurate model of delocalised charge transport that models transport over a\nlattice of identical, spherical polarons. Here, we extend jKMC to describe the\nseparation of a charge-transfer state, showing that this simplified approach\ncan reproduce the considerable improvements in charge-separation efficiencies\ncaused by delocalisation and first seen in dKMC. The low computational cost and\nsimplicity of jKMC allows it to be applied to parameter regimes intractable by\ndKMC, and ensures jKMC can be easily incorporated into any existing KMC model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:19:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Willson","Jacob T.",""],["Balzer","Daniel",""],["Kassal","Ivan",""]]}
{"id":"2308.13195","submitter":"David Torregrosa-Bel\\'en","authors":"Woosuk L. Jung, David Torregrosa-Bel\\'en, Henry Wolkowicz","title":"Preconditioning for Generalized Jacobians with the $\\omega$-Condition\n  Number","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Preconditioning is essential in iterative methods for solving linear systems\nof equations. We study a nonclassic matrix condition number, the\n$\\omega$-condition number, in the context of optimal conditioning for low rank\nupdating of positive definite matrices. For a positive definite matrix, this\ncondition measure is the ratio of the arithmetic and geometric means of the\neigenvalues. In particular, we concentrate on linear systems with low rank\nupdates of positive definite matrices which are close to singular. These\nsystems arise in the contexts of nonsmooth Newton methods using generalized\nJacobians. We derive an explicit formula for the optimal\n$\\omega$-preconditioned update in this framework.\n  Evaluating or estimating the classical condition number $\\kappa$ can be\nexpensive. We show that the $\\omega$-condition number can be evaluated exactly\nfollowing a Cholesky or LU factorization and it estimates the actual condition\nof a linear system significantly better. Moreover, our empirical results show a\nsignificant decrease in the number of iterations required for a requested\naccuracy in the residual during an iterative method, i.e., these results\nconfirm the efficacy of using the $\\omega$-condition number compared to the\nclassical condition number.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:20:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jung","Woosuk L.",""],["Torregrosa-Bel\u00e9n","David",""],["Wolkowicz","Henry",""]]}
{"id":"2308.13196","submitter":"Priyadarshi Mukherjee","authors":"Priyadarshi Mukherjee, Constantinos Psomas, Ioannis Krikidis","title":"Chaotic Waveform-based Signal Design for Noncoherent SWIPT Receivers","comments":"This work has been submitted to an IEEE journal for possible\n  publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper proposes a chaotic waveform-based multi-antenna receiver design\nfor simultaneous wireless information and power transfer (SWIPT). Particularly,\nwe present a differential chaos shift keying (DCSK)-based SWIPT multiantenna\nreceiver architecture, where each antenna switches between information transfer\n(IT) and energy harvesting (EH) modes depending on the receiver's requirements.\nWe take into account a generalized frequency-selective Nakagami-m fading model\nas well as the nonlinearities of the EH process to derive closed-form\nanalytical expressions for the associated bit error rate (BER) and the\nharvested direct current (DC), respectively. We show that, both depend on the\nparameters of the transmitted waveform and the number of receiver antennas\nbeing utilized in the IT and EH mode. We investigate a trade-off in terms of\nthe BER and energy transfer by introducing a novel achievable `success rate -\nharvested energy' region. Moreover, we demonstrate that energy and information\ntransfer are two conflicting tasks and hence, a single waveform cannot be\nsimultaneously optimal for both IT and EH. Accordingly, we propose appropriate\ntransmit waveform designs based on the application specific requirements of\nacceptable BER or harvested DC or both. Numerical results demonstrate the\nimportance of chaotic waveform-based signal design and its impact on the\nproposed receiver architecture.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:22:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mukherjee","Priyadarshi",""],["Psomas","Constantinos",""],["Krikidis","Ioannis",""]]}
{"id":"2308.13197","submitter":"Molla Ahamed","authors":"Molla Basir Ahamed and Taimur Rahman","title":"Generalized weighted composition-differentiation operators on weighted\n  Bergman spaces","comments":"25","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $ \\mathcal{H}(\\mathbb{D}) $ be the class of all holomorphic functions in\nthe unit disk $ \\mathbb{D} $. We aim to explore the complex symmetry exhibited\nby generalized weighted composition-differentiation operators, denoted as\n$L_{n, \\psi, \\phi}$ and is defined by \\begin{align*}\n  L_{n, \\psi, \\phi}:=\\sum_{k=1}^{n}c_kD_{k, \\psi_k, \\phi},\\; \\mbox{where }\\;\nc_k\\in\\mathbb{C}\\; \\mbox{for}\\; k=1, 2, \\ldots, n, \\end{align*} where $ D_{k,\n\\psi, \\phi}f(z):=\\psi(z)f^{(k)}(\\phi(z)),\\; f\\in\n\\mathcal{A}^2_{\\alpha}(\\mathbb{D}), $ in the reproducing kernel Hilbert space,\nlabeled as $\\mathcal{A}^2_{\\alpha}(\\mathbb{D})$, which encompasses analytic\nfunctions defined on the unit disk $\\mathbb{D}$. By deriving a condition that\nis both necessary and sufficient, we provide insights into the $ C_{\\mu, \\eta}\n$-symmetry exhibited by $L_{n, \\psi, \\phi}$. The explicit conditions for which\nthe operator T is Hermitian and normal are obtained through our investigation.\nAdditionally, we conduct an in-depth analysis of the spectral properties of $\nL_{n, \\psi, \\phi} $ under the assumption of $ C_{\\mu, \\eta} $-symmetry and\nthoroughly examine the kernel of the adjoint operator of $L_{n, \\psi, \\phi}$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:25:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ahamed","Molla Basir",""],["Rahman","Taimur",""]]}
{"id":"2308.13198","submitter":"Chen Yuheng","authors":"Yuheng Chen, Pengfei Cao, Yubo Chen, Kang Liu, Jun Zhao","title":"Journey to the Center of the Knowledge Neurons: Discoveries of\n  Language-Independent Knowledge Neurons and Degenerate Knowledge Neurons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pre-trained language models (PLMs) contain vast amounts of factual knowledge,\nbut how the knowledge is stored in the parameters remains unclear. This paper\ndelves into the complex task of understanding how factual knowledge is stored\nin multilingual PLMs, and introduces the Architecture-adapted Multilingual\nIntegrated Gradients method, which successfully localizes knowledge neurons\nmore precisely compared to current methods, and is more universal across\nvarious architectures and languages. Moreover, we conduct an in-depth\nexploration of knowledge neurons, leading to the following two important\ndiscoveries: (1) The discovery of Language-Independent Knowledge Neurons, which\nstore factual knowledge in a form that transcends language. We design\ncross-lingual knowledge editing experiments, demonstrating that the PLMs can\naccomplish this task based on language-independent neurons; (2) The discovery\nof Degenerate Knowledge Neurons, a novel type of neuron showing that different\nknowledge neurons can store the same fact. Its property of functional overlap\nendows the PLMs with a robust mastery of factual knowledge. We design\nfact-checking experiments, proving that the degenerate knowledge neurons can\nhelp the PLMs to detect wrong facts. Experiments corroborate these findings,\nshedding light on the mechanisms of factual knowledge storage in multilingual\nPLMs, and contribute valuable insights to the field. The source code will be\nmade publicly available for further research.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:26:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Yuheng",""],["Cao","Pengfei",""],["Chen","Yubo",""],["Liu","Kang",""],["Zhao","Jun",""]]}
{"id":"2308.13199","submitter":"Qirong Yao","authors":"Qirong Yao, Hyunjin Jung, Kijeong Kong, Chandan De, Jaeyoung Kim,\n  Jonathan D. Denlinger, and Han Woong Yeom","title":"Robust Luttinger liquid state of 1D Dirac fermions in a van der Waals\n  system Nb$_9$Si$_4$Te$_{18}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the Tomonaga-Luttinger liquid (TLL) behavior in fully degenerate\n1D Dirac fermions. A ternary van der Waals material Nb$_9$Si$_4$Te$_{18}$\nincorporates in-plane NbTe$_2$ chains, which produce a 1D Dirac band crossing\nFermi energy. Tunneling conductance of electrons confined within NbTe2 chains\nis found to be substantially suppressed at Fermi energy, which follows a power\nlaw with a universal temperature scaling, hallmarking a TLL state. The obtained\nLuttinger parameter of ~0.15 indicates strong electron-electron interaction.\nThe TLL behavior is found to be robust against atomic-scale defects, which\nmight be related to the Dirac electron nature. These findings, as combined with\nthe tunability of the compound and the merit of a van der Waals material, offer\na robust, tunable, and integrable platform to exploit non-Fermi liquid physics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:26:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yao","Qirong",""],["Jung","Hyunjin",""],["Kong","Kijeong",""],["De","Chandan",""],["Kim","Jaeyoung",""],["Denlinger","Jonathan D.",""],["Yeom","Han Woong",""]]}
{"id":"2308.13200","submitter":"Sven Ahrens","authors":"Yang Wang, Sven Ahrens","title":"Parameter space investigation for spin-dependent electron diffraction in\n  the Kapitza-Dirac effect","comments":"9 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We demonstrate that spin-dependent electron diffraction is possible for a\nsmooth range transverse electron momenta in a two-photon Bragg scattering\nscenario of the Kapitza-Dirac effect. Our analysis is rendered possible by\nintroducing a generalized specification for quantifying spin-dependent\ndiffraction, yielding an optimization problem which is solved by making use of\na Newton gradient iteration scheme. With this procedure, we investigate the\nspin-dependent effect for different transverse electron momenta and different\nlaser polarizations of the standing light wave the Kapitza-Dirac scattering.\nThe possibility for using arbitrary low transverse electron momenta, when\nsetting up a spin-dependent Kapitza-Dirac experiment allows longer interaction\ntimes of the electron with the laser and therefore enables less constraining\nparameters for an implementation of the effect.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:35:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Yang",""],["Ahrens","Sven",""]]}
{"id":"2308.13201","submitter":"Md Mohaimenuzzaman","authors":"Md Mohaimenuzzaman, Christoph Bergmeir and Bernd Meyer","title":"Deep Active Audio Feature Learning in Resource-Constrained Environments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.CV eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The scarcity of labelled data makes training Deep Neural Network (DNN) models\nin bioacoustic applications challenging. In typical bioacoustics applications,\nmanually labelling the required amount of data can be prohibitively expensive.\nTo effectively identify both new and current classes, DNN models must continue\nto learn new features from a modest amount of fresh data. Active Learning (AL)\nis an approach that can help with this learning while requiring little\nlabelling effort. Nevertheless, the use of fixed feature extraction approaches\nlimits feature quality, resulting in underutilization of the benefits of AL. We\ndescribe an AL framework that addresses this issue by incorporating feature\nextraction into the AL loop and refining the feature extractor after each round\nof manual annotation. In addition, we use raw audio processing rather than\nspectrograms, which is a novel approach. Experiments reveal that the proposed\nAL framework requires 14.3%, 66.7%, and 47.4% less labelling effort on\nbenchmark audio datasets ESC-50, UrbanSound8k, and InsectWingBeat,\nrespectively, for a large DNN model and similar savings on a\nmicrocontroller-based counterpart. Furthermore, we showcase the practical\nrelevance of our study by incorporating data from conservation biology\nprojects.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:45:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mohaimenuzzaman","Md",""],["Bergmeir","Christoph",""],["Meyer","Bernd",""]]}
{"id":"2308.13202","submitter":"Dohyun Kim","authors":"Dohyun Kim, Miguel R. Castellanos, Robert W. Heath Jr","title":"Joint Band Assignment and Beam Management using Hierarchical\n  Reinforcement Learning for Multi-Band Communication","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multi-band operation in wireless networks can improve data rates by\nleveraging the benefits of propagation in different frequency ranges.\nDistinctive beam management procedures in different bands complicate band\nassignment because they require considering not only the channel quality but\nalso the associated beam management overhead. Reinforcement learning (RL) is a\npromising approach for multi-band operation as it enables the system to learn\nand adjust its behavior through environmental feedback. In this paper, we\nformulate a sequential decision problem to jointly perform band assignment and\nbeam management. We propose a method based on hierarchical RL (HRL) to handle\nthe complexity of the problem by separating the policies for band selection and\nbeam management. We evaluate the proposed HRL-based algorithm on a realistic\nchannel generated based on ray-tracing simulators. Our results show that the\nproposed approach outperforms traditional RL approaches in terms of reduced\nbeam training overhead and increased data rates under a realistic vehicular\nchannel.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:53:32 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kim","Dohyun",""],["Castellanos","Miguel R.",""],["Heath","Robert W.","Jr"]]}
{"id":"2308.13203","submitter":"Stefano Scopel","authors":"Sunghyun Kang (CQUeST and Sogang U.), Arpan Kar (CQUeST and Sogang U.)\n  and Stefano Scopel (CQUeST and Sogang U.)","title":"Halo-independent bounds on Inelastic Dark Matter","comments":"28 pages and 10 figures","journal-ref":null,"doi":null,"report-no":"CQUeST-2023-0723","categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss halo-independent constraints on the Inelastic Dark Matter\nscenario, in which a Weakly Interaction Massive Particle (WIMP) state $\\chi$\nwith mass $m_\\chi$ interacts with nuclear targets by upscattering to a heavier\nstate $\\chi^{\\prime}$ with mass $m_\\chi+\\delta$. In order to do so we adopt the\nsingle-stream method, that exploits the complementarity of Direct Detection\n(DD) and Capture in the Sun to extend the experimental sensitivity to the full\nrange of incoming WIMP speeds. We show that a non-vanishing mass splitting\n$\\delta$ modifies such range, and that for particular combinations of $m_\\chi$\nand $\\delta$ the complementarity between the two detection techniques required\nby the method is lost. Specifically, assuming for the escape velocity in our\nGalaxy $u_{esc}$ the reference value $u_{esc}^{ref}$ = 560 km/s a\nhalo-independent bound is possible when $\\delta\\lesssim$ 510 keV for a\nSpin-Independent interaction and when $\\delta\\lesssim$ 245 keV for a\nSpin-Dependent interaction (with the Spin-Independent value slightly reduced to\n$\\delta\\lesssim$ 490 keV when $u_{esc}>u_{esc}^{ref}$). We find that in the\nlow-mass regime the bound from capture in the Sun is always more constraining\nthan that for DD and is sufficient alone to provide a halo-independent\nconstraint, while for large WIMP masses the halo-independent bound is given by\na combination of capture in the Sun and DD. In this latter case, while for\nincreasing values of $\\delta$ the sensitivity range of initial speeds of the\nWIMP is reduced for both DD and capture in the Sun, such effect is more\npronounced for DD than for capture. We also find that, for $u_{esc}$ =\n$u_{esc}^{ref}$, unless the mass of the target used in DD is larger than about\nfour times that of the target driving capture in the Sun, DD does not play any\nrole in the determination of the maximal value of $\\delta$ for which a\nhalo-independent bound is possible.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:58:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kang","Sunghyun","","CQUeST and Sogang U."],["Kar","Arpan","","CQUeST and Sogang U."],["Scopel","Stefano","","CQUeST and Sogang U."]]}
{"id":"2308.13204","submitter":"Shreyas Goyal","authors":"Shreyas Goyal, Jagath C. Rajapakse","title":"Self-supervised learning for hotspot detection and isolation from\n  thermal images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Hotspot detection using thermal imaging has recently become essential in\nseveral industrial applications, such as security applications, health\napplications, and equipment monitoring applications. Hotspot detection is of\nutmost importance in industrial safety where equipment can develop anomalies.\nHotspots are early indicators of such anomalies. We address the problem of\nhotspot detection in thermal images by proposing a self-supervised learning\napproach. Self-supervised learning has shown potential as a competitive\nalternative to their supervised learning counterparts but their application to\nthermography has been limited. This has been due to lack of diverse data\navailability, domain specific pre-trained models, standardized benchmarks, etc.\nWe propose a self-supervised representation learning approach followed by\nfine-tuning that improves detection of hotspots by classification. The SimSiam\nnetwork based ensemble classifier decides whether an image contains hotspots or\nnot. Detection of hotspots is followed by precise hotspot isolation. By doing\nso, we are able to provide a highly accurate and precise hotspot\nidentification, applicable to a wide range of applications. We created a novel\nlarge thermal image dataset to address the issue of paucity of easily\naccessible thermal images. Our experiments with the dataset created by us and a\npublicly available segmentation dataset show the potential of our approach for\nhotspot detection and its ability to isolate hotspots with high accuracy. We\nachieve a Dice Coefficient of 0.736, the highest when compared with existing\nhotspot identification techniques. Our experiments also show self-supervised\nlearning as a strong contender of supervised learning, providing competitive\nmetrics for hotspot detection, with the highest accuracy of our approach being\n97%.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:59:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Goyal","Shreyas",""],["Rajapakse","Jagath C.",""]]}
{"id":"2308.13205","submitter":"Haizhou Zhao","authors":"Haizhou Zhao, Lei Yu, Siying Qin, Yurui Jin, Yuqing Chen","title":"Design and Control of a Bio-inspired Wheeled Bipedal Robot","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Wheeled bipedal robots have the capability to execute agile and versatile\nlocomotion tasks in unknown terrains, with balancing being a key criteria in\nevaluating their dynamic performance. This paper focuses on enhancing the\nbalancing performance of wheeled bipedal robots through innovations in both\nhardware and software aspects. A bio-inspired mechanical design, inspired by\nthe human barbell squat, is proposed and implemented to achieve an efficient\ndistribution of load onto the limb joints. This design improves knee torque\njoint efficiency and facilitates control over the distribution of the center of\nmass (CoM). Meanwhile, a customized balance model, namely the wheeled linear\ninverted pendulum (wLIP), is developed. The wLIP surpasses other alternatives\nby providing a more accurate estimation of wheeled robot dynamics while\nensuring balancing stability. Experimental results demonstrate that the robot\nis capable of maintaining balance while manipulating pelvis states and CoM\nvelocity; furthermore, it exhibits robustness against external disturbances and\nunknown terrains.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:00:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Haizhou",""],["Yu","Lei",""],["Qin","Siying",""],["Jin","Yurui",""],["Chen","Yuqing",""]]}
{"id":"2308.13206","submitter":"Sagar Soni V","authors":"A. H. Hasmani, Sagar V. Soni and Ravi Panchal","title":"Electromagnetic Multipoles for Morris-Thorne Wormhole","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Wormholes are interesting space-time structures connecting two asymptotic\nregions found in a universe or multiverse and are solutions to Einstein's field\nequations. These objects have many interesting features as far as physics is\nconcerned. Morris and Thorne introduced traversable wormholes, which increases\nthe possibility of space-time travel. In this work, the wave equation of the\nMorris-Thorne wormhole has been derived by the technique of differential forms.\nThe solution of the wave equation for a particular choice of red-shift function\nand shape function is obtained. The potential has also been computed in order\nto analyze electromagnetic fields. The behavior of electromagnetic multipoles\nis expressed and investigated in their behavior at the wormhole's throat.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:03:29 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hasmani","A. H.",""],["Soni","Sagar V.",""],["Panchal","Ravi",""]]}
{"id":"2308.13207","submitter":"Anmol Nayak","authors":"Anmol Nayak and Hari Prasad Timmapathini","title":"LLM2KB: Constructing Knowledge Bases using instruction tuned context\n  aware Large Language Models","comments":"16 pages, 1 figure, LM-KBC 2023 Challenge at International Semantic\n  Web Conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The advent of Large Language Models (LLM) has revolutionized the field of\nnatural language processing, enabling significant progress in various\napplications. One key area of interest is the construction of Knowledge Bases\n(KB) using these powerful models. Knowledge bases serve as repositories of\nstructured information, facilitating information retrieval and inference tasks.\nOur paper proposes LLM2KB, a system for constructing knowledge bases using\nlarge language models, with a focus on the Llama 2 architecture and the\nWikipedia dataset. We perform parameter efficient instruction tuning for\nLlama-2-13b-chat and StableBeluga-13B by training small injection models that\nhave only 0.05 % of the parameters of the base models using the Low Rank\nAdaptation (LoRA) technique. These injection models have been trained with\nprompts that are engineered to utilize Wikipedia page contexts of subject\nentities fetched using a Dense Passage Retrieval (DPR) algorithm, to answer\nrelevant object entities for a given subject entity and relation. Our best\nperforming model achieved an average F1 score of 0.6185 across 21 relations in\nthe LM-KBC challenge held at the ISWC 2023 conference.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:04:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Nayak","Anmol",""],["Timmapathini","Hari Prasad",""]]}
{"id":"2308.13208","submitter":"Michele Ceriotti","authors":"Kevin K. Huguenin-Dumittan, Philip Loche, Ni Haoran and Michele\n  Ceriotti","title":"Physics-inspired Equivariant Descriptors of Non-bonded Interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most of the existing machine-learning schemes applied to atomic-scale\nsimulations rely on a local description of the geometry of a structure, and\nstruggle to model effects that are driven by long-range physical interactions.\nEfforts to overcome these limitations have focused on the direct incorporation\nof electrostatics, which is the most prominent effect, often relying on\narchitectures that mirror the functional form of explicit physical models.\nIncluding other forms of non-bonded interactions, or predicting properties\nother than the interatomic potential, requires ad hoc modifications. We propose\nan alternative approach that extends the long-distance equivariant (LODE)\nframework to generate local descriptors of an atomic environment that resemble\nnon-bonded potentials with arbitrary asymptotic behaviors, ranging from\npoint-charge electrostatics to dispersion forces. We show that the LODE\nformalism is amenable to a direct physical interpretation in terms of a\ngeneralized multipole expansion, that simplifies its implementation and reduces\nthe number of descriptors needed to capture a given asymptotic behavior. These\ngeneralized LODE features provide improved extrapolation capabilities when\ntrained on structures dominated by a given asymptotic behavior, but do not help\nin capturing the wildly different energy scales that are relevant for a more\nheterogeneous data set. This approach provides a practical scheme to\nincorporate different types of non-bonded interactions, and a framework to\ninvestigate the interplay of physical and data-related considerations that\nunderlie this challenging modeling problem.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:04:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Huguenin-Dumittan","Kevin K.",""],["Loche","Philip",""],["Haoran","Ni",""],["Ceriotti","Michele",""]]}
{"id":"2308.13209","submitter":"Xavier Fern\\'andez-Real","authors":"Xavier Fern\\'andez-Real, Hui Yu","title":"Generic properties in free boundary problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we show the generic uniqueness of minimizers for a large class\nof energies, including the Alt-Caffarelli and Alt-Phillips functionals.\n  We then prove the generic regularity of free boundaries for minimizers of the\none-phase Alt-Caffarelli and Alt-Phillips functionals, for a monotone family of\nboundary data $\\{\\varphi_t\\}_{t\\in(-1,1)}$. More precisely, we show that for a\nco-countable subset of $\\{\\varphi_t\\}_{t\\in(-1,1)}$, minimizers have smooth\nfree boundaries in $\\mathbb{R}^5$ for the Alt-Caffarelli and in $\\mathbb{R}^3$\nfor the Alt-Phillips functional. In general dimensions, we show that the\nsingular set is one dimension smaller than expected for almost every boundary\ndatum in $\\{\\varphi_t\\}_{t\\in(-1,1)}$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:06:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fern\u00e1ndez-Real","Xavier",""],["Yu","Hui",""]]}
{"id":"2308.13210","submitter":"Aftab Ahmad A","authors":"Aftab Ahmad, Muhammad Azher, Alfredo Raya","title":"Robust features of QCD phase diagram through a Contact Interaction model\n  for quarks: A view from the effective potential","comments":"17,13","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Our research delves into the QCD phase diagram in the temperature $T$ and\nquark chemical potential $\\mu$ plane. We use a unique confining contact\ninteraction effective model of quark dynamics that maintains the QCD symmetry\nintact. By embedding the model into a Schwinger-Dyson equations framework,\nwithin a Landau gauge rainbow-ladder-like truncation, we derive the gap\nequation. In order to accurately regulate the said equation, we utilize the\nSchwinger optimal time regularization scheme. We further derive the effective\npotential of the model by integrating the gap equation over the dynamical mass,\nwhich along with the confining length scale serve as parameters for the chiral\nand confinement deconfinement phase transitions, respectively. A cross-over\ntransition is observed at low $\\mu$ and above a critical value of the\ntemperature $T_c$, whilst a first order phase transition is found for low $T$\nat high density. The critical end point is estimated to be located at\n$(\\mu_{E}/T_{c,0}=1.6, T_{E}/T_{c,0}=0.42)$, which falls within the range of\nother QCD effective models predictions. $T_{c,0} =208$ MeV is the critical\ntemperature at vanishing $\\mu$. Screening effects of the medium which dilute\nthe strength of the effective coupling are considered by including the vacuum\npolarization contribution due to quarks at high temperatures into the\nframework. It locates the critical end point at $( \\mu^{E}_{c}/T_c \\approx2.6,\nT^{E}_{c}/T_c \\approx 0.57)$, which hints for a deeper analysis of screening\neffects on models of this kind.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:11:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ahmad","Aftab",""],["Azher","Muhammad",""],["Raya","Alfredo",""]]}
{"id":"2308.13211","submitter":"Yang Li","authors":"Cheng Zhong, Yicheng Ding, Husai Wang, Jikai Chen, Jian Wang, Yang Li","title":"Model predictive control strategy in waked wind farms for optimal\n  fatigue loads","comments":"Accepted by Electric Power Systems Research","journal-ref":"Electric Power Systems Research 224 (2023) 109793","doi":"10.1016/j.epsr.2023.109793","report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid growth of wind power penetration, wind farms (WFs) are\nrequired to implement frequency regulation that active power control to track a\ngiven power reference. Due to the wake interaction of the wind turbines (WTs),\nthere is more than one solution to distributing power reference among the\noperating WTs, which can be exploited as an optimization problem for the second\ngoal, such as fatigue load alleviation. In this paper, a closed-loop model\npredictive controller is developed that minimizes the wind farm tracking\nerrors, the dynamical fatigue load, and and the load equalization. The\ncontroller is evaluated in a mediumfidelity model. A 64 WTs simulation case\nstudy is used to demonstrate the control performance for different penalty\nfactor settings. The results indicated the WF can alleviate dynamical fatigue\nload and have no significant impact on power tracking. However, the uneven load\ndistribution in the wind turbine system poses challenges for maintenance. By\nadding a trade-off between the load equalization and dynamical fatigue load,\nthe load differences between WTs are significantly reduced, while the dynamical\nfatigue load slightly increases when selecting a proper penalty factor.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:13:42 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhong","Cheng",""],["Ding","Yicheng",""],["Wang","Husai",""],["Chen","Jikai",""],["Wang","Jian",""],["Li","Yang",""]]}
{"id":"2308.13212","submitter":"Yang Liu","authors":"Yang Liu, Jiashun Cheng, Haihong Zhao, Tingyang Xu, Peilin Zhao, Fugee\n  Tsung, Jia Li, Yu Rong","title":"Physics-Inspired Neural Graph ODE for Long-term Dynamical Simulation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Simulating and modeling the long-term dynamics of multi-object physical\nsystems is an essential and challenging task. Current studies model the\nphysical systems utilizing Graph Neural Networks (GNNs) with equivariant\nproperties. Specifically, they model the dynamics as a sequence of discrete\nstates with a fixed time interval and learn a direct mapping for all the two\nadjacent states. However, this direct mapping overlooks the continuous nature\nbetween the two states. Namely, we have verified that there are countless\npossible trajectories between two discrete dynamic states in current GNN-based\ndirect mapping models. This issue greatly hinders the model generalization\nability, leading to poor performance of the long-term simulation. In this\npaper, to better model the latent trajectory through discrete supervision\nsignals, we propose a Physics-Inspired Neural Graph ODE (PINGO) algorithm. In\nPINGO, to ensure the uniqueness of the trajectory, we construct a\nPhysics-Inspired Neural ODE framework to update the latent trajectory.\nMeanwhile, to effectively capture intricate interactions among objects, we use\na GNN-based model to parameterize Neural ODE in a plug-and-play manner.\nFurthermore, we prove that the discrepancy between the learned trajectory of\nPIGNO and the true trajectory can be theoretically bounded. Extensive\nexperiments verify our theoretical findings and demonstrate that our model\nyields an order-of-magnitude improvement over the state-of-the-art baselines,\nespecially on long-term predictions and roll-out errors.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:15:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Yang",""],["Cheng","Jiashun",""],["Zhao","Haihong",""],["Xu","Tingyang",""],["Zhao","Peilin",""],["Tsung","Fugee",""],["Li","Jia",""],["Rong","Yu",""]]}
{"id":"2308.13213","submitter":"Yuto Nakajima","authors":"Yuto Nakajima","title":"Transversal family of non-autonomous conformal iterated function systems","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study Non-autonomous Iterated Function Systems (NIFSs) with overlaps. A\nNIFS on a compact subset $X\\subset\\mathbb{R}^m$ is a sequence\n$\\Phi=(\\{\\phi^{(j)}_{i}\\}_{i\\in I^{(j)}})_{j=1}^{\\infty}$ of collections of\nuniformly contracting maps $\\phi^{(j)}_{i}: X\\rightarrow X$, where $I^{(j)}$ is\na finite set. In comparison to usual iterated function systems, we allow the\ncontractions $\\phi^{(j)}_{i}$ applied at each step $j$ to depend on $j$. In\nthis paper, we focus on a family of parameterized NIFSs on $\\mathbb{R}^m$.\nHere, we do not assume the open set condition. We show that if a $d-$parameter\nfamily of such systems satisfies the transversality condition, then for almost\nevery parameter value the Hausdorff dimension of the limit set is the minimum\nof $m$ and the Bowen dimension. Moreover, we give an example of a family\n$\\{\\Phi_t\\}_{t\\in U}$ of parameterized NIFSs such that $\\{\\Phi_t\\}_{t\\in U}$\nsatisfies the transversality condition but $\\Phi_t$ does not satisfy the open\nset condition for any $t\\in U$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:17:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Nakajima","Yuto",""]]}
{"id":"2308.13214","submitter":"Tao Li","authors":"Tao Li and Qing-Wen Wang and Xin-Fang Zhang","title":"Gl-QFOM and Gl-QGMRES: two efficient algorithms for quaternion linear\n  systems with multiple right-hand sides","comments":"24pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose the global quaternion full orthogonalization\n(Gl-QFOM) and global quaternion generalized minimum residual (Gl-QGMRES)\nmethods, which are built upon global orthogonal and oblique projections onto a\nquaternion matrix Krylov subspace, for solving quaternion linear systems with\nmultiple right-hand sides. We first develop the global quaternion Arnoldi\nprocedure to preserve the quaternion Hessenberg form during the iterations. We\nthen establish the convergence analysis of the proposed methods, and show how\nto apply them to solve the Sylvester quaternion matrix equation. Numerical\nexamples are provided to illustrate the effectiveness of our methods compared\nwith the traditional Gl-FOM and Gl-GMRES iterations for the real\nrepresentations of the original linear systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:24:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Tao",""],["Wang","Qing-Wen",""],["Zhang","Xin-Fang",""]]}
{"id":"2308.13215","submitter":"Pierre Laclau","authors":"Pierre Laclau, St\\'ephane Bonnet (Heudiasyc), Bertrand Ducourthial\n  (Heudiasyc), Xiaoting Li, Trista Lin","title":"Predictive Network Configuration with Hierarchical Spectral Clustering\n  for Software Defined Vehicles","comments":null,"journal-ref":"2023 IEEE 97th Vehicular Technology Conference (VTC2023-Spring),\n  Vehicular Technology Society, Jun 2023, Florence, Italy. pp.1-5","doi":"10.1109/VTC2023-Spring57618.2023.10199920","report-no":null,"categories":"cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The increasing connectivity and autonomy of vehicles has led to a growing\nneed for dynamic and real-time adjustments to software and network\nconfigurations. Software Defined Vehicles (SDV) have emerged as a potential\nsolution to adapt to changing user needs with continuous updates and onboard\nreconfigurations to offer infotainment, connected, and background services such\nas cooperative driving. However, network configuration management in SDVs\nremains a significant challenge, particularly in the context of shared\nEthernet-based in-vehicle networks. Traditional worst-case static configuration\nmethods cannot efficiently allocate network resources while ensuring Quality of\nService (QoS) guarantees for each network flow within the physical topology\ncapabilities. In this work, we propose a configuration generation methodology\nthat addresses these limitations by dynamically switching between pre-computed\noffboard configurations downloaded to the vehicle. Simulation results are\npresented and future work is discussed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:27:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Laclau","Pierre","","Heudiasyc"],["Bonnet","St\u00e9phane","","Heudiasyc"],["Ducourthial","Bertrand","","Heudiasyc"],["Li","Xiaoting",""],["Lin","Trista",""]]}
{"id":"2308.13216","submitter":"Tomasz Szostok","authors":"Tomasz Szostok","title":"A generalization of a theorem of Brass and Schmeisser","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $n$ be an odd positive integer. It was proved by Brass and Schmeisser\nthat for every quadrature $$\\mathcal{Q}=\\alpha_1f(x_1)+\\dots+\\alpha_mf(x_m),$$\n(with positive weights) of order at least $n+1$ and for every $n-$convex\nfunction $f,$ the value of $Q$ on $f$ lies between the values of Gauss and\nLobatto quadratures of order $n+1$ calculated for the same function $f$. We\ngeneralize this result in two directions, replacing $Q$ by an integral with\nrespect to a given measure and allowing the number $n$ to any positive integer\n(for even $n$ Radau quadratures replace Gauss and Lobatto ones\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:27:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Szostok","Tomasz",""]]}
{"id":"2308.13217","submitter":"Masoud Mokhtari","authors":"Masoud Mokhtari, Neda Ahmadi, Teresa S. M. Tsang, Purang Abolmaesumi,\n  Renjie Liao","title":"GEMTrans: A General, Echocardiography-based, Multi-Level Transformer\n  Framework for Cardiovascular Diagnosis","comments":"To be published in MLMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Echocardiography (echo) is an ultrasound imaging modality that is widely used\nfor various cardiovascular diagnosis tasks. Due to inter-observer variability\nin echo-based diagnosis, which arises from the variability in echo image\nacquisition and the interpretation of echo images based on clinical experience,\nvision-based machine learning (ML) methods have gained popularity to act as\nsecondary layers of verification. For such safety-critical applications, it is\nessential for any proposed ML method to present a level of explainability along\nwith good accuracy. In addition, such methods must be able to process several\necho videos obtained from various heart views and the interactions among them\nto properly produce predictions for a variety of cardiovascular measurements or\ninterpretation tasks. Prior work lacks explainability or is limited in scope by\nfocusing on a single cardiovascular task. To remedy this, we propose a General,\nEcho-based, Multi-Level Transformer (GEMTrans) framework that provides\nexplainability, while simultaneously enabling multi-video training where the\ninter-play among echo image patches in the same frame, all frames in the same\nvideo, and inter-video relationships are captured based on a downstream task.\nWe show the flexibility of our framework by considering two critical tasks\nincluding ejection fraction (EF) and aortic stenosis (AS) severity detection.\nOur model achieves mean absolute errors of 4.15 and 4.84 for single and\ndual-video EF estimation and an accuracy of 96.5 % for AS detection, while\nproviding informative task-specific attention maps and prototypical\nexplainability.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:30:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mokhtari","Masoud",""],["Ahmadi","Neda",""],["Tsang","Teresa S. M.",""],["Abolmaesumi","Purang",""],["Liao","Renjie",""]]}
{"id":"2308.13218","submitter":"Bang Yang","authors":"Bang Yang, Fenglin Liu, Xian Wu, Yaowei Wang, Xu Sun, and Yuexian Zou","title":"MultiCapCLIP: Auto-Encoding Prompts for Zero-Shot Multilingual Visual\n  Captioning","comments":"ACL'2023, 13 pages, 4 figures","journal-ref":null,"doi":"10.18653/v1/2023.acl-long.664","report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Supervised visual captioning models typically require a large scale of images\nor videos paired with descriptions in a specific language (i.e., the\nvision-caption pairs) for training. However, collecting and labeling\nlarge-scale datasets is time-consuming and expensive for many scenarios and\nlanguages. Therefore, sufficient labeled pairs are usually not available. To\ndeal with the label shortage problem, we present a simple yet effective\nzero-shot approach MultiCapCLIP that can generate visual captions for different\nscenarios and languages without any labeled vision-caption pairs of downstream\ndatasets. In the training stage, MultiCapCLIP only requires text data for\ninput. Then it conducts two main steps: 1) retrieving concept prompts that\npreserve the corresponding domain knowledge of new scenarios; 2) auto-encoding\nthe prompts to learn writing styles to output captions in a desired language.\nIn the testing stage, MultiCapCLIP instead takes visual data as input directly\nto retrieve the concept prompts to generate the final visual descriptions. The\nextensive experiments on image and video captioning across four benchmarks and\nfour languages (i.e., English, Chinese, German, and French) confirm the\neffectiveness of our approach. Compared with state-of-the-art zero-shot and\nweakly-supervised methods, our method achieves 4.8% and 21.5% absolute\nimprovements in terms of BLEU@4 and CIDEr metrics. Our code is available at\nhttps://github.com/yangbang18/MultiCapCLIP.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:32:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yang","Bang",""],["Liu","Fenglin",""],["Wu","Xian",""],["Wang","Yaowei",""],["Sun","Xu",""],["Zou","Yuexian",""]]}
{"id":"2308.13219","submitter":"Yongzheng Zhu","authors":"Yongzheng Zhu, Weizhen Kong, Jian Deng and Xin Bian","title":"Physics-informed neural networks for unsteady incompressible flows with\n  time-dependent moving boundaries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physics-informed neural networks (PINNs) employed in fluid mechanics deal\nprimarily with stationary boundaries. This hinders the capability to address a\nwide range of flow problems involving moving bodies. To this end, we propose a\nnovel extension, which enables PINNs to solve incompressible flows with\ntime-dependent moving boundaries. More specifically, we impose Dirichlet\nconstraints of velocity at the moving interfaces and define new loss functions\nfor the corresponding training points. Moreover, we refine training points for\nflows around the moving boundaries for accuracy. This effectively enforces the\nno-slip condition of the moving boundaries. With an initial condition, the\nextended PINNs solve unsteady flow problems with time-dependent moving\nboundaries and still have the flexibility to leverage partial data to\nreconstruct the entire flow field. Therefore, the extended version inherits the\namalgamation of both physics and data from the original PINNs. With a series of\ntypical flow problems, we demonstrate the effectiveness and accuracy of the\nextended PINNs. The proposed concept allows for solving inverse problems as\nwell, which calls for further investigations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:33:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhu","Yongzheng",""],["Kong","Weizhen",""],["Deng","Jian",""],["Bian","Xin",""]]}
{"id":"2308.13220","submitter":"Huyuan Chen","authors":"Huyuan Chen, Yihong Du, Feng Zhou","title":"Improved Lerey inequality and Trudinger-Moser type inequality involving\n  the Leray potential","comments":"34 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We obtain three types of results in this paper. Firstly we improve Leray's\ninequality by providing several types of reminder terms, secondly we introduce\nseveral Hilbert spaces based on these improved Leray inequalities and discuss\ntheir embedding properties, thirdly we obtain some Trudinger-Moser type\ninequalities in the unit ball of R2 associated with the norms of these Hilbert\nspaces where the Leray potential is used. Our approach is based on analysis of\nradially symmetric functions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:34:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Huyuan",""],["Du","Yihong",""],["Zhou","Feng",""]]}
{"id":"2308.13221","submitter":"Shengchao Li","authors":"Shengchao Alfred Li","title":"A Steady Loop Current Does Not Radiate","comments":"17 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  According to mainstream electrodynamics, a steady loop current does not\nradiate. Edward, Kenyon, and Lemon took the approximated electric field formula\n(the magnetic one is trivial) for a moving point charge and showed that the\nelectric field of a steady loop current could be partitioned into a static\nfield falling with the square of distance and an integral of an exact\ndifferential (also called total differential, full differential, or perfect\ndifferential), thus no radiation was omitted. Inspired by their work, we do the\nsame to the electric and magnetic fields without approximation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:38:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Shengchao Alfred",""]]}
{"id":"2308.13222","submitter":"Krzysztof M. Graczyk","authors":"Krzysztof M. Graczyk and Kornel Witkowski","title":"Bayesian Reasoning for Physics Informed Neural Networks","comments":"19 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cs.LG physics.flu-dyn stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Physics informed neural network (PINN) approach in Bayesian formulation is\npresented. We adopt the Bayesian neural network framework formulated by MacKay\n(Neural Computation 4 (3) (1992) 448). The posterior densities are obtained\nfrom Laplace approximation. For each model (fit), the so-called evidence is\ncomputed. It is a measure that classifies the hypothesis. The most optimal\nsolution has the maximal value of the evidence. The Bayesian framework allows\nus to control the impact of the boundary contribution to the total loss.\nIndeed, the relative weights of loss components are fine-tuned by the Bayesian\nalgorithm. We solve heat, wave, and Burger's equations. The obtained results\nare in good agreement with the exact solutions. All solutions are provided with\nthe uncertainties computed within the Bayesian framework.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:38:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Graczyk","Krzysztof M.",""],["Witkowski","Kornel",""]]}
{"id":"2308.13223","submitter":"Minda Zhao","authors":"Minda Zhao, Chaoyi Zhao, Xinyue Liang, Lincheng Li, Zeng Zhao, Zhipeng\n  Hu, Changjie Fan, Xin Yu","title":"EfficientDreamer: High-Fidelity and Robust 3D Creation via\n  Orthogonal-view Diffusion Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While the image diffusion model has made significant strides in text-driven\n3D content creation, it often falls short in accurately capturing the intended\nmeaning of the text prompt, particularly with respect to direction information.\nThis shortcoming gives rise to the Janus problem, where multi-faced 3D models\nare produced with the guidance of such diffusion models. In this paper, we\npresent a robust pipeline for generating high-fidelity 3D content with\northogonal-view image guidance. Specifically, we introduce a novel 2D diffusion\nmodel that generates an image consisting of four orthogonal-view sub-images for\nthe given text prompt. The 3D content is then created with this diffusion\nmodel, which enhances 3D consistency and provides strong structured semantic\npriors. This addresses the infamous Janus problem and significantly promotes\ngeneration efficiency. Additionally, we employ a progressive 3D synthesis\nstrategy that results in substantial improvement in the quality of the created\n3D contents. Both quantitative and qualitative evaluations show that our method\ndemonstrates a significant improvement over previous text-to-3D techniques.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:39:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Minda",""],["Zhao","Chaoyi",""],["Liang","Xinyue",""],["Li","Lincheng",""],["Zhao","Zeng",""],["Hu","Zhipeng",""],["Fan","Changjie",""],["Yu","Xin",""]]}
{"id":"2308.13224","submitter":"Minoo Kamrani","authors":"Nahid Jamshidi, Minoo Kamrani, Kristian Debrabant","title":"Exponential Euler method for stiff stochastic differential equations\n  with additive fractional Brownian noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss a system of stochastic differential equations with a stiff linear\nterm and additive noise driven by fractional Brownian motions (fBms) with Hurst\nparameter H>1/2, which arise e. g., from spatial approximations of stochastic\npartial differential equations. For their numerical approximation, we present\nan exponential Euler scheme and show that it converges in the strong sense with\nan exact rate close to the Hurst parameter H. Further, based on [2], we\nconclude the existence of a unique stationary solution of the exponential Euler\nscheme that is pathwise asymptotically stable.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:41:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jamshidi","Nahid",""],["Kamrani","Minoo",""],["Debrabant","Kristian",""]]}
{"id":"2308.13225","submitter":"Qingyao Shuai","authors":"Qingyao Shuai, Chi Zhang, Kaizhi Yang, Xuejin Chen","title":"DPF-Net: Combining Explicit Shape Priors in Deformable Primitive Field\n  for Unsupervised Structural Reconstruction of 3D Objects","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised methods for reconstructing structures face significant\nchallenges in capturing the geometric details with consistent structures among\ndiverse shapes of the same category. To address this issue, we present a novel\nunsupervised structural reconstruction method, named DPF-Net, based on a new\nDeformable Primitive Field (DPF) representation, which allows for high-quality\nshape reconstruction using parameterized geometric primitives. We design a\ntwo-stage shape reconstruction pipeline which consists of a primitive\ngeneration module and a primitive deformation module to approximate the target\nshape of each part progressively. The primitive generation module estimates the\nexplicit orientation, position, and size parameters of parameterized geometric\nprimitives, while the primitive deformation module predicts a dense deformation\nfield based on a parameterized primitive field to recover shape details. The\nstrong shape prior encoded in parameterized geometric primitives enables our\nDPF-Net to extract high-level structures and recover fine-grained shape details\nconsistently. The experimental results on three categories of objects in\ndiverse shapes demonstrate the effectiveness and generalization ability of our\nDPF-Net on structural reconstruction and shape segmentation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:50:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shuai","Qingyao",""],["Zhang","Chi",""],["Yang","Kaizhi",""],["Chen","Xuejin",""]]}
{"id":"2308.13226","submitter":"Pawel Pieranski","authors":"Pawel Pieranski (LPS), Maria Helena Godinho","title":"Flexo-electricity of the dowser texture","comments":null,"journal-ref":"Soft Matter, 2019, 15 (7), pp.1469-1480","doi":"10.1039/C8SM02329H","report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The persistent quasi-planar nematic texture known also as the dowser texture\nis characterized by a 2D unitary vector field d. We show here that the dowser\ntexture is sensitive, in first order, to electric fields. This property is due\nto the flexo-electric polarisation P collinear with d expected from R.B.\nMeyer's considerations on flexo-electricity in nematics. It is pointed out that\ndue to the flexo-electric polarisation nematic monopoles can be manipulated by\nelectric fields of appropriated geometry.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:54:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pieranski","Pawel","","LPS"],["Godinho","Maria Helena",""]]}
{"id":"2308.13227","submitter":"Pheiroijam Wilina","authors":"Ph. Wilina and N. Nimai Singh","title":"Neutrino mass model based on $\\Delta(27)$ symmetry and its implications","comments":"23 pages, 36 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Implication of neutrino mass model based on $\\Delta$(27) discrete flavor\nsymmetry, on parameters of neutrino oscillations, CP violation and effective\nneutrino masses is studied using type-I seesaw mechanism. The Standard Model\nparticle content is extended by adding two additional Higgs doublets, three\nright-handed neutrinos and two scalar triplets under $\\Delta$(27) symmetry\npredicting diagonal charged lepton mass matrix. This can generate the desired\ndeviation from $\\mu - \\tau$ symmetry. The resulting neutrino oscillation\nparameters are well agreed with the latest global fit oscillation data. The sum\nof the three absolute neutrino mass eigenvalues, $\\sum\\limits_{i}|m_{i}|$\n(i=1,2,3) is found to be consistent with that of the value given by latest\nPlanck cosmological data, $\\sum\\limits_{i}|m_{i}|<$0.12 eV. The model further\npredicts effective neutrino masses for neutrinoless double beta decay, 3.9 meV\n$\\leq m_{ee}\\leq$ 30.7 meV, tritium beta decay, 8.7 meV $\\leq m_{\\beta}\\leq$\n30.6 meV, Jarlskog invariant, $J_{CP}=\\pm 0.02196$ for CP violation, baryon\nasymmetry $Y_{B}=8.95\\times 10^{-10}$ for normal hierarchical case and also\n49.5 meV $\\leq m_{ee}\\leq$ 51.7 meV, 49.48 meV $\\leq m_{\\beta}\\leq$ 51.4 meV,\n$J_{CP}=\\pm 0.02191$, $Y_{B}=1.28\\times 10^{-7}$ for inverted hierarchical case\nrespectively.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:56:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wilina","Ph.",""],["Singh","N. Nimai",""]]}
{"id":"2308.13228","submitter":"Winston Maxwell","authors":"Winston Maxwell (SES, IP Paris, I3 SES, NOS), Bruno Dumas","title":"Meaningful XAI Based on User-Centric Design Methodology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report first takes stock of XAI-related requirements appearing in\nvarious EU directives, regulations, guidelines, and CJEU case law. This\nanalysis of existing requirements will permit us to have a clearer vision of\nthe purposes, the ``why'', of XAI, which we separate into five categories:\ncontestability, empowerment/redressing information asymmetries, control over\nsystem performance, evaluation of algorithmic decisions, and public\nadministration transparency. The analysis of legal requirements also permits us\nto create four categories of recipients for explainability: data science teams;\nhuman operators of the system; persons affected by algorithmic decisions, and\nregulators/judges/auditors. Lastly, we identify four main operational contexts\nfor explainability: XAI for the upstream design and testing phase; XAI for\nhuman-on-the-loop control; XAI for human-in-the-loop control; and XAI for\nex-post challenges and investigations.Second, we will present user-centered\ndesign methodology, which takes the purposes, the recipients and the\noperational context into account in order to develop optimal XAI\nsolutions.Third, we will suggest a methodology to permit suppliers and users of\nhigh-risk AI applications to propose local XAI solutions that are effective in\nthe sense of being ``meaningful'', for example, useful in light of the\noperational, safety and fundamental rights contexts. The process used to\ndevelop these ``meaningful'' XAI solutions will be based on user-centric design\nprinciples examined in the second part.Fourth, we will suggest that the\nEuropean Commission issue guidelines to provide a harmonised approach to\ndefining ``meaningful'' explanations based on the purposes, audiences and\noperational contexts of AI systems. These guidelines would apply to the AI Act,\nbut also to the other EU texts requiring explanations for algorithmic systems\nand results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:00:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Maxwell","Winston","","SES, IP Paris, I3 SES, NOS"],["Dumas","Bruno",""]]}
{"id":"2308.13229","submitter":"Cheng-Che Cheng","authors":"Cheng-Che Cheng, Min-Xuan Qiu, Chen-Kuo Chiang, Shang-Hong Lai","title":"ReST: A Reconfigurable Spatial-Temporal Graph Model for Multi-Camera\n  Multi-Object Tracking","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-Camera Multi-Object Tracking (MC-MOT) utilizes information from\nmultiple views to better handle problems with occlusion and crowded scenes.\nRecently, the use of graph-based approaches to solve tracking problems has\nbecome very popular. However, many current graph-based methods do not\neffectively utilize information regarding spatial and temporal consistency.\nInstead, they rely on single-camera trackers as input, which are prone to\nfragmentation and ID switch errors. In this paper, we propose a novel\nreconfigurable graph model that first associates all detected objects across\ncameras spatially before reconfiguring it into a temporal graph for Temporal\nAssociation. This two-stage association approach enables us to extract robust\nspatial and temporal-aware features and address the problem with fragmented\ntracklets. Furthermore, our model is designed for online tracking, making it\nsuitable for real-world applications. Experimental results show that the\nproposed graph model is able to extract more discriminating features for object\ntracking, and our model achieves state-of-the-art performance on several public\ndatasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:02:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cheng","Cheng-Che",""],["Qiu","Min-Xuan",""],["Chiang","Chen-Kuo",""],["Lai","Shang-Hong",""]]}
{"id":"2308.13230","submitter":"V. T. Renard","authors":"F. Mesple, N. R. Walet, G. Trambly de Laissardi\\`ere, F. Guinea, D.\n  Dosenovic, H. Okuno, C. Paillet, A. Michon, C. Chapelier, V. T. Renard","title":"Giant atomic swirl in graphene bilayers with biaxial heterostrain","comments":null,"journal-ref":null,"doi":"10.1002/adma.202306312","report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The study of moir\\'e engineering started with the advent of van der Waals\nheterostructures in which stacking two-dimensional layers with different\nlattice constants leads to a moir\\'e pattern controlling their electronic\nproperties. The field entered a new era when it was found that adjusting the\ntwist between two graphene layers led to strongly-correlated-electron physics\nand topological effects associated with atomic relaxation. Twist is now used\nroutinely to adjust the properties of two-dimensional materials. Here, we\ninvestigate a new type of moir\\'e superlattice in bilayer graphene when one\nlayer is biaxially strained with respect to the other - so-called biaxial\nheterostrain. Scanning tunneling microscopy measurements uncover spiraling\nelectronic states associated with a novel symmetry-breaking atomic\nreconstruction at small biaxial heterostrain. Atomistic calculations using\nexperimental parameters as inputs reveal that a giant atomic swirl forms around\nregions of aligned stacking to reduce the mechanical energy of the bilayer.\nTight-binding calculations performed on the relaxed structure show that the\nobserved electronic states decorate spiraling domain wall solitons as required\nby topology. This study establishes biaxial heterostrain as an important\nparameter to be harnessed for the next step of moir\\'e engineering in van der\nWaals multilayers.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:02:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mesple","F.",""],["Walet","N. R.",""],["de Laissardi\u00e8re","G. Trambly",""],["Guinea","F.",""],["Dosenovic","D.",""],["Okuno","H.",""],["Paillet","C.",""],["Michon","A.",""],["Chapelier","C.",""],["Renard","V. T.",""]]}
{"id":"2308.13231","submitter":"Milou van Rijnbach","authors":"Milou van Rijnbach and Dumitru Vlad Berlea and Valerio Dao and Martin\n  Ga\\v{z}i and Phil Allport and Ignacio Asensi Tortajada and Prafulla Behera\n  and Daniela Bortoletto and Craig Buttar and Florian Dachs and Ganapati Dash\n  and Dominik Dobrijevi\\'c and Lucian Fasselt and Leyre Flores Sanz de Acedo\n  and Andrea Gabrielli and Vicente Gonz\\'alez and Giuliano Gustavino and\n  Pranati Jana and Heinz Pernegger and Petra Riedler and Heidi Sandaker and\n  Carlos Solans S\\'anchez and Walter Snoeys and Tomislav Suligoj and Marcos\n  V\\'azquez N\\'u\\~nez and Anusree Vijay and Julian Weick and Steven Worm and\n  Abdelhak M. Zoubir","title":"Radiation Hardness of MALTA2 Monolithic CMOS Sensors on Czochralski\n  Substrates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  MALTA2 is the latest full-scale prototype of the MALTA family of Depleted\nMonolithic Active Pixel Sensors (DMAPS) produced in Tower Semiconductor 180 nm\nCMOS technology. In order to comply with the requirements of High Energy\nPhysics (HEP) experiments, various process modifications and front-end changes\nhave been implemented to achieve low power consumption, reduce Random Telegraph\nSignal (RTS) noise, and optimise the charge collection geometry. Compared to\nits predecessors, MALTA2 targets the use of a high-resistivity, thick\nCzochralski (Cz) substrates in order to demonstrate radiation hardness in terms\nof detection efficiency and timing resolution up to 3E15 1 MeV neq/cm2 with\nbackside metallisation to achieve good propagation of the bias voltage. This\nmanuscript shows the results that were obtained with non-irradiated and\nirradiated MALTA2 samples on Cz substrates from the CERN SPS test beam campaign\nfrom 2021-2023 using the MALTA telescope.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:03:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["van Rijnbach","Milou",""],["Berlea","Dumitru Vlad",""],["Dao","Valerio",""],["Ga\u017ei","Martin",""],["Allport","Phil",""],["Tortajada","Ignacio Asensi",""],["Behera","Prafulla",""],["Bortoletto","Daniela",""],["Buttar","Craig",""],["Dachs","Florian",""],["Dash","Ganapati",""],["Dobrijevi\u0107","Dominik",""],["Fasselt","Lucian",""],["de Acedo","Leyre Flores Sanz",""],["Gabrielli","Andrea",""],["Gonz\u00e1lez","Vicente",""],["Gustavino","Giuliano",""],["Jana","Pranati",""],["Pernegger","Heinz",""],["Riedler","Petra",""],["Sandaker","Heidi",""],["S\u00e1nchez","Carlos Solans",""],["Snoeys","Walter",""],["Suligoj","Tomislav",""],["N\u00fa\u00f1ez","Marcos V\u00e1zquez",""],["Vijay","Anusree",""],["Weick","Julian",""],["Worm","Steven",""],["Zoubir","Abdelhak M.",""]]}
{"id":"2308.13232","submitter":"Nanlin Shi","authors":"Nanlin Shi, Yining Miao, Changxing Huang, Xiang Li, Yonghao Song,\n  Xiaogang Chen, Yijun Wang, Xiaorong Gao","title":"Estimating and approaching maximum information rate of noninvasive\n  visual brain-computer interface","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.IT eess.SP math.IT q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The mission of visual brain-computer interfaces (BCIs) is to enhance\ninformation transfer rate (ITR) to reach high speed towards real-life\ncommunication. Despite notable progress, noninvasive visual BCIs have\nencountered a plateau in ITRs, leaving it uncertain whether higher ITRs are\nachievable. In this study, we investigate the information rate limits of the\nprimary visual channel to explore whether we can and how we should build visual\nBCI with higher information rate. Using information theory, we estimate a\nmaximum achievable ITR of approximately 63 bits per second (bps) with a\nuniformly-distributed White Noise (WN) stimulus. Based on this discovery, we\npropose a broadband WN BCI approach that expands the utilization of stimulus\nbandwidth, in contrast to the current state-of-the-art visual BCI methods based\non steady-state visual evoked potentials (SSVEPs). Through experimental\nvalidation, our broadband BCI outperforms the SSVEP BCI by an impressive margin\nof 7 bps, setting a new record of 50 bps. This achievement demonstrates the\npossibility of decoding 40 classes of noninvasive neural responses within a\nshort duration of only 0.1 seconds. The information-theoretical framework\nintroduced in this study provides valuable insights applicable to all\nsensory-evoked BCIs, making a significant step towards the development of\nnext-generation human-machine interaction systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:05:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shi","Nanlin",""],["Miao","Yining",""],["Huang","Changxing",""],["Li","Xiang",""],["Song","Yonghao",""],["Chen","Xiaogang",""],["Wang","Yijun",""],["Gao","Xiaorong",""]]}
{"id":"2308.13233","submitter":"Yusuke Tanimura","authors":"Moemi Matsumoto, Yusuke Tanimura, and Kouichi Hagino","title":"An extension of the generator coordinate method with basis optimization","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":"KUNS-2975","categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The generator coordinate method (GCM) has been a well-known method to\ndescribe nuclear collective motions. In this method, one specifies {\\it a\npriori} the relevant collective degrees of freedom as input of the method,\nbased on empirical and/or phenomenological assumptions. We here propose a new\nextension of the GCM, in which both the basis Slater determinants and weight\nfactors are optimized according to the variational principle. Applying this\nmethod to $^{16}$O and $^{28}$Si nuclei with the Skyrme functional, we\ndemonstrate that the optimized bases correspond to excited states along a\ncollective path, unlike the conventional GCM which superposes only the local\nground states. This implies that a collective coordinate for large amplitude\ncollective motions is determined in a much more complex way than what has been\nassumed so far.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:05:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Matsumoto","Moemi",""],["Tanimura","Yusuke",""],["Hagino","Kouichi",""]]}
{"id":"2308.13234","submitter":"Yonghao Song","authors":"Yonghao Song, Bingchuan Liu, Xiang Li, Nanlin Shi, Yijun Wang,\n  Xiaorong Gao","title":"Decoding Natural Images from EEG for Object Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI eess.SP q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electroencephalogram (EEG) is a brain signal known for its high time\nresolution and moderate signal-to-noise ratio. Whether natural images can be\ndecoded from EEG has been a hot issue recently. In this paper, we propose a\nself-supervised framework to learn image representations from EEG signals.\nSpecifically, image and EEG encoders are first used to extract features from\npaired image stimuli and EEG responses. Then we employ contrastive learning to\nalign these two modalities by constraining their similarity. Additionally, we\nintroduce two plug-in-play modules that capture spatial correlations before the\nEEG encoder. Our approach achieves state-of-the-art results on the most\nextensive EEG-image dataset, with a top-1 accuracy of 15.6% and a top-5\naccuracy of 42.8% in 200-way zero-shot tasks. More importantly, extensive\nexperiments analyzing the temporal, spatial, spectral, and semantic aspects of\nEEG signals demonstrate good biological plausibility. These results offer\nvaluable insights for neural decoding and real-world applications of\nbrain-computer interfaces. The code will be released on\nhttps://github.com/eeyhsong/NICE-EEG.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:05:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Song","Yonghao",""],["Liu","Bingchuan",""],["Li","Xiang",""],["Shi","Nanlin",""],["Wang","Yijun",""],["Gao","Xiaorong",""]]}
{"id":"2308.13235","submitter":"Tong Liu","authors":"Li Li, Tong Liu, Xue-Yi Guo, He Zhang, Silu Zhao, Zhongcheng Xiang,\n  Xiaohui Song, Yu-Xiang Zhang, Kai Xu, Heng Fan, and Dongning Zheng","title":"Observation of multiple steady states with engineered dissipation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Simulating the dynamics of open quantum systems is essential in achieving\npractical quantum computation and understanding novel nonequilibrium behaviors.\nHowever, quantum simulation of a many-body system coupled to an engineered\nreservoir has yet to be fully explored in present-day experiment platforms. In\nthis work, we introduce engineered noise into a one-dimensional ten-qubit\nsuperconducting quantum processor to emulate a generic many-body open quantum\nsystem. Our approach originates from the stochastic unravellings of the master\nequation. By measuring the end-to-end correlation, we identify multiple steady\nstates stemmed from a strong symmetry, which is established on the modified\nHamiltonian via Floquet engineering. Furthermore, we find that the information\nsaved in the initial state maintains in the steady state driven by the\ncontinuous dissipation on a five-qubit chain. Our work provides a manageable\nand hardware-efficient strategy for the open-system quantum simulation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:06:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Li",""],["Liu","Tong",""],["Guo","Xue-Yi",""],["Zhang","He",""],["Zhao","Silu",""],["Xiang","Zhongcheng",""],["Song","Xiaohui",""],["Zhang","Yu-Xiang",""],["Xu","Kai",""],["Fan","Heng",""],["Zheng","Dongning",""]]}
{"id":"2308.13236","submitter":"Jingyi Zhang","authors":"Jingyi Zhang, Jiaxing Huang, Xueying Jiang, Shijian Lu","title":"Black-box Unsupervised Domain Adaptation with Bi-directional\n  Atkinson-Shiffrin Memory","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Black-box unsupervised domain adaptation (UDA) learns with source predictions\nof target data without accessing either source data or source models during\ntraining, and it has clear superiority in data privacy and flexibility in\ntarget network selection. However, the source predictions of target data are\noften noisy and training with them is prone to learning collapses. We propose\nBiMem, a bi-directional memorization mechanism that learns to remember useful\nand representative information to correct noisy pseudo labels on the fly,\nleading to robust black-box UDA that can generalize across different visual\nrecognition tasks. BiMem constructs three types of memory, including sensory\nmemory, short-term memory, and long-term memory, which interact in a\nbi-directional manner for comprehensive and robust memorization of learnt\nfeatures. It includes a forward memorization flow that identifies and stores\nuseful features and a backward calibration flow that rectifies features' pseudo\nlabels progressively. Extensive experiments show that BiMem achieves superior\ndomain adaptation performance consistently across various visual recognition\ntasks such as image classification, semantic segmentation and object detection.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:06:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Jingyi",""],["Huang","Jiaxing",""],["Jiang","Xueying",""],["Lu","Shijian",""]]}
{"id":"2308.13237","submitter":"Athanase Papadopoulos","authors":"Hideki Miyachi (KU), Ken'Ichi Ohshika, Athanase Papadopoulos","title":"On the Teichm{\\\"u}ller space of acute triangles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We continue the study of the analogue of Thurston's metric on the\nTeichm{\\\"u}ller space of Euclidean triangle which was started by Saglam and\nPapadopoulos in [1].By direct calculation, we give explicit expressions of the\ndistance function and the Finsler structure of the metric restricted to the\nsubspace of acute triangles.We deduce from the form of the Finsler unit sphere\na result on the infinitesimal rigidity of the metric.We give a description of\nthe maximal stretching loci for a family of extreme Lipschitz maps.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:14:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Miyachi","Hideki","","KU"],["Ohshika","Ken'Ichi",""],["Papadopoulos","Athanase",""]]}
{"id":"2308.13238","submitter":"Rabeetha Velsamy","authors":"Rabeetha Velsamy and Radha Ramakrishnan","title":"Twisted shift preserving operators on $L^{2}(\\mathbb{R}^{2n})$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the J map using the Zak transform associated with the Weyl\ntransform on $L^{2}(\\mathbb{R}^{2n})$. We obtain a decomposition for a twisted\nshift-invariant subspace of $L^{2}(\\mathbb{R}^{2n})$ as a direct sum of\nmutually orthogonal principal twisted shift-invariant spaces such that the\nrespective system of twisted translates forms a Parseval frame sequence. We\nestablish that the twisted shift preserving operators and the corresponding\nrange operators simultaneously share some properties in common, namely,\nself-adjoint, unitary, range of the spectrum and bounded below properties. We\nprove that the frame operator and its inverse associated with a system of\ntwisted translates of {\\varphi_s}_{s\\in Z} are shift preserving. We also show\nthat the corresponding range operators turn out to be the dual Gramian and its\ninverse associated with the collection {J\\varphi_s(. , .)}_{s\\in Z}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:15:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Velsamy","Rabeetha",""],["Ramakrishnan","Radha",""]]}
{"id":"2308.13239","submitter":"Andrei Teleman","authors":"Andrei Teleman (I2M)","title":"The Newlander-Nirenberg Theorem for principal bundles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $G$ be an arbitrary (not necessarily isomorphic to a closed subgroup of\n$\\mathrm{GL}(r,\\mathbb{C})$) complex Lie group, $U$ a complex manifold and\n$p:P\\to U$ a $\\mathcal{C}^\\infty$ principal $G$-bundle on $U$. We introduce and\nstudy the space $\\mathcal{J}^\\kappa_P$ of bundle almost complex structures of\nH{\\\"o}lder class $\\mathcal{C}^\\kappa$ on $P$. To any $J\\in\n\\mathcal{J}^\\kappa_P$ we associate an $\\mathrm{Ad}(P)$-valued form\n$\\mathfrak{f}_J$ of type (0,2) on $U$ which should be interpreted as the\nobstruction to the integrability of $J$. For $\\kappa\\geq 1$ we have\n$\\mathfrak{f}_J\\in\\mathcal{C}^{\\kappa-1}(U,\\bigwedge\\hspace{-3.5pt}^{0,2}_{\\,\\,U}\\otimes\\mathrm{Ad}(P))$\nwhereas, for $\\kappa\\in[0,1)$, $\\mathfrak{f}_J$ is a form with distribution\ncoefficients. Let $J\\in \\mathcal{J}^\\kappa_P$ with $\\kappa\\in\n(0,+\\infty]\\setminus\\mathbb{N}$. We prove that $J$ admits locally\n$J$-pseudo-holomorphic sections of class $\\mathcal{C}^{\\kappa+1}$ if and only\nif $\\mathfrak{f}_J=0$. If this is the case, $J$ defines a holomorphic reduction\nof the underlying $\\mathcal{C}^{\\kappa+1}$-bundle of $P$ in the sense of the\ntheory of principal bundles on complex manifolds. The proof is based on\nclassical regularity results for the $\\bar\\partial$-Neumann operator on\ncompact, strictly pseudo-convex complex manifolds with boundary.The result will\nbe used in forthcoming articles dedicated to moduli spaces of holomorphic\nbundles (on a compact complex manifold $X$) framed along a real hypersurface\n$S\\subset X$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:18:43 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 13:21:50 GMT"},{"version":"v3","created":"Tue, 29 Aug 2023 08:16:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Teleman","Andrei","","I2M"]]}
{"id":"2308.13240","submitter":"Erwan Rousseau","authors":"Erwan Rousseau (UBO, LMBA), Carlo Gasbarri (UNISTRA UFR MI, IRMA),\n  Amos Turchet, Julie Tzu-Yueh Wang","title":"Simply connectedness and hyperbolicity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CV math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize to arbitrary dimension our previous construction of simply\nconnected weakly-special but not special varieties. We show that they satisfy\nthe function field and complex analytic part of Campana's conjecture. Moreover,\nwe give the first examples, in any dimension, of smooth simply connected\nnonisotrivial projective varieties of general type that satisfy the function\nfield Lang's conjecture.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:19:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rousseau","Erwan","","UBO, LMBA"],["Gasbarri","Carlo","","UNISTRA UFR MI, IRMA"],["Turchet","Amos",""],["Wang","Julie Tzu-Yueh",""]]}
{"id":"2308.13241","submitter":"Kai Chong Lei","authors":"Kai Chong Lei, Kit Wa Sou, Wang Sing Chan, Jiayi Yan, Siqi Ping,\n  Dengfeng Peng, Wenbo Ding, Xiao-Ping Zhang","title":"WSTac: Interactive Surface Perception based on Whisker-Inspired and\n  Self-Illuminated Vision-Based Tactile Sensor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern Visual-Based Tactile Sensors (VBTSs) use cost-effective cameras to\ntrack elastomer deformation, but struggle with ambient light interference.\nSolutions typically involve using internal LEDs and blocking external light,\nthus adding complexity. Creating a VBTS resistant to ambient light with just a\ncamera and an elastomer remains a challenge. In this work, we introduce WStac,\na self-illuminating VBTS comprising a mechanoluminescence (ML) whisker\nelastomer, camera, and 3D printed parts. The ML whisker elastomer, inspired by\nthe touch sensitivity of vibrissae, offers both light isolation and high ML\nintensity under stress, thereby removing the necessity for additional LED\nmodules. With the incorporation of machine learning, the sensor effectively\nutilizes the dynamic contact variations of 25 whiskers to successfully perform\ntasks like speed regression, directional identification, and texture\nclassification. Videos are available at: https://sites.google.com/view/wstac/.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:21:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lei","Kai Chong",""],["Sou","Kit Wa",""],["Chan","Wang Sing",""],["Yan","Jiayi",""],["Ping","Siqi",""],["Peng","Dengfeng",""],["Ding","Wenbo",""],["Zhang","Xiao-Ping",""]]}
{"id":"2308.13242","submitter":"Sruthi Gorantla","authors":"Sruthi Gorantla, Eshaan Bhansali, Amit Deshpande, Anand Louis","title":"Optimizing Group-Fair Plackett-Luce Ranking Models for Relevance and\n  Ex-Post Fairness","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In learning-to-rank (LTR), optimizing only the relevance (or the expected\nranking utility) can cause representational harm to certain categories of\nitems. Moreover, if there is implicit bias in the relevance scores, LTR models\nmay fail to optimize for true relevance. Previous works have proposed efficient\nalgorithms to train stochastic ranking models that achieve fairness of exposure\nto the groups ex-ante (or, in expectation), which may not guarantee\nrepresentation fairness to the groups ex-post, that is, after realizing a\nranking from the stochastic ranking model. Typically, ex-post fairness is\nachieved by post-processing, but previous work does not train stochastic\nranking models that are aware of this post-processing.\n  In this paper, we propose a novel objective that maximizes expected relevance\nonly over those rankings that satisfy given representation constraints to\nensure ex-post fairness. Building upon recent work on an efficient sampler for\nex-post group-fair rankings, we propose a group-fair Plackett-Luce model and\nshow that it can be efficiently optimized for our objective in the LTR\nframework.\n  Experiments on three real-world datasets show that our group-fair algorithm\nguarantees fairness alongside usually having better relevance compared to the\nLTR baselines. In addition, our algorithm also achieves better relevance than\npost-processing baselines, which also ensures ex-post fairness. Further, when\nimplicit bias is injected into the training data, our algorithm typically\noutperforms existing LTR baselines in relevance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:27:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gorantla","Sruthi",""],["Bhansali","Eshaan",""],["Deshpande","Amit",""],["Louis","Anand",""]]}
{"id":"2308.13243","submitter":"Clifford M. Will","authors":"Fatemeh Taherasghari and Clifford M. Will","title":"Compact binary systems in Einstein-Aether gravity: Direct integration of\n  the relaxed field equations to 2.5 post-Newtonian order","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Einstein-Aether theory is an alternative theory of gravity in which the\nspacetime metric is supplemented by a long-range timelike vector field (the\n``aether'' field). Here, for the first time, we apply the full formalism of\npost-Minkowskian theory and of the Direct Integration of the Relaxed Einstein\nEquations (DIRE), to this theory of gravity, with the goal of deriving\nequations of motion and gravitational waveforms for orbiting compact bodies to\nhigh orders in a post-Newtonian expansion. Because the aether field is\nconstrained to have unit norm, a naive application of post-Minkowskian theory\nleads to contributions to the effective energy momentum tensor that are {\\em\nlinear} in the perturbative fields. We show that a suitable redefinition of\nfields using an array of ``superpotentials'' can eliminate such linear terms to\nany desired post-Newtonian order, resulting in flat spacetime wave equations\nfor all fields, with sources consisting of matter terms and terms quadratic and\nhigher in the fields. As an initial application of this new method, and as a\nfoundation for obtaining the equations of motion for compact binaries, we\nobtain explicit solutions of the relaxed equations sufficient to obtain the\nmetric in the near zone through 2.5 post-Newtonian order, or $O[(v/c)^5]$\nbeyond the Newtonian approximation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:32:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Taherasghari","Fatemeh",""],["Will","Clifford M.",""]]}
{"id":"2308.13244","submitter":"Yanghao Liu","authors":"Yanghao Liu, Fangda Guo, Bingbing Xu, Peng Bao, Huawei Shen, Xueqi\n  Cheng","title":"Significant-attributed Community Search in Heterogeneous Information\n  Networks","comments":"14 pages, 11figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Community search is a personalized community discovery problem aimed at\nfinding densely-connected subgraphs containing the query vertex. In particular,\nthe search for communities with high-importance vertices has recently received\na great deal of attention. However, existing works mainly focus on conventional\nhomogeneous networks where vertices are of the same type, but are not\napplicable to heterogeneous information networks (HINs) composed of multi-typed\nvertices and different semantic relations, such as bibliographic networks. In\nthis paper, we study the problem of high-importance community search in HINs. A\nnovel community model is introduced, named heterogeneous significant community\n(HSC), to unravel the closely connected vertices of the same type with high\nattribute values through multiple semantic relationships. An HSC not only\nmaximizes the exploration of indirect relationships across entities of the\nanchor-type but incorporates their significance. To search the HSCs, we first\ndevelop online algorithms by exploiting both segmented-based meta-path\nexpansion and significance increment. Specially, a solution space reuse\nstrategy based on structural nesting is designed to boost the efficiency. In\naddition, we further devise a two-level index to support searching HSCs in\noptimal time, based on which a space-efficient compact index is proposed.\nExtensive experiments on real-world large-scale HINs demonstrate that our\nsolutions are effective and efficient for searching HSCs, and the index-based\nalgorithms are 2-4 orders of magnitude faster than online algorithms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:32:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Yanghao",""],["Guo","Fangda",""],["Xu","Bingbing",""],["Bao","Peng",""],["Shen","Huawei",""],["Cheng","Xueqi",""]]}
{"id":"2308.13245","submitter":"Zhenfeng Fan","authors":"Zhenfeng Fan, Zhiheng Zhang, Shuang Yang, Chongyang Zhong, Min Cao,\n  Shihong Xia","title":"Unpaired Multi-domain Attribute Translation of 3D Facial Shapes with a\n  Square and Symmetric Geometric Map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While impressive progress has recently been made in image-oriented facial\nattribute translation, shape-oriented 3D facial attribute translation remains\nan unsolved issue. This is primarily limited by the lack of 3D generative\nmodels and ineffective usage of 3D facial data. We propose a learning framework\nfor 3D facial attribute translation to relieve these limitations. Firstly, we\ncustomize a novel geometric map for 3D shape representation and embed it in an\nend-to-end generative adversarial network. The geometric map represents 3D\nshapes symmetrically on a square image grid, while preserving the neighboring\nrelationship of 3D vertices in a local least-square sense. This enables\neffective learning for the latent representation of data with different\nattributes. Secondly, we employ a unified and unpaired learning framework for\nmulti-domain attribute translation. It not only makes effective usage of data\ncorrelation from multiple domains, but also mitigates the constraint for hardly\naccessible paired data. Finally, we propose a hierarchical architecture for the\ndiscriminator to guarantee robust results against both global and local\nartifacts. We conduct extensive experiments to demonstrate the advantage of the\nproposed framework over the state-of-the-art in generating high-fidelity facial\nshapes. Given an input 3D facial shape, the proposed framework is able to\nsynthesize novel shapes of different attributes, which covers some downstream\napplications, such as expression transfer, gender translation, and aging. Code\nat https://github.com/NaughtyZZ/3D_facial_shape_attribute_translation_ssgmap.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:37:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fan","Zhenfeng",""],["Zhang","Zhiheng",""],["Yang","Shuang",""],["Zhong","Chongyang",""],["Cao","Min",""],["Xia","Shihong",""]]}
{"id":"2308.13246","submitter":"Tianchi Cai","authors":"Tianchi Cai, Shenliao Bao, Jiyan Jiang, Shiji Zhou, Wenpeng Zhang,\n  Lihong Gu, Jinjie Gu, Guannan Zhang","title":"Model-free Reinforcement Learning with Stochastic Reward Stabilization\n  for Recommender Systems","comments":"SIGIR '23","journal-ref":null,"doi":"10.1145/3539618.3592022","report-no":null,"categories":"cs.LG cs.IR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Model-free RL-based recommender systems have recently received increasing\nresearch attention due to their capability to handle partial feedback and\nlong-term rewards. However, most existing research has ignored a critical\nfeature in recommender systems: one user's feedback on the same item at\ndifferent times is random. The stochastic rewards property essentially differs\nfrom that in classic RL scenarios with deterministic rewards, which makes\nRL-based recommender systems much more challenging. In this paper, we first\ndemonstrate in a simulator environment where using direct stochastic feedback\nresults in a significant drop in performance. Then to handle the stochastic\nfeedback more efficiently, we design two stochastic reward stabilization\nframeworks that replace the direct stochastic feedback with that learned by a\nsupervised model. Both frameworks are model-agnostic, i.e., they can\neffectively utilize various supervised models. We demonstrate the superiority\nof the proposed frameworks over different RL-based recommendation baselines\nwith extensive experiments on a recommendation simulator as well as an\nindustrial-level recommender system.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:42:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cai","Tianchi",""],["Bao","Shenliao",""],["Jiang","Jiyan",""],["Zhou","Shiji",""],["Zhang","Wenpeng",""],["Gu","Lihong",""],["Gu","Jinjie",""],["Zhang","Guannan",""]]}
{"id":"2308.13247","submitter":"Yurii A. Neretin","authors":"Yury A. Neretin","title":"Oligomorphic groups and ultrahomogeneous cubic spaces over finite fields","comments":"18p","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CT math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that for certain class of oligomorphic groups there is a version of\nmultiplication of double cosets in Ismagilov--Olshanski sense. Categories of\n(reduced) double cosets are realized as certain categories of partial\nbijections. As an example, we consider the ultrahomogeneous linear space\n$\\mathcal{Z}$ of countable dimension over a finite field equipped with a cubic\nform. The group $G$ of automorphisms of $\\mathcal{Z}$ is an oligomorphic group,\nwe describe its open subgroups. According Tsankov, this gives a classification\nof its unitary representations. The category of reduced double cosets is the\ncategory of partial linear bijections of finite-dimensional cubic spaces\npreserving cubic forms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:49:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Neretin","Yury A.",""]]}
{"id":"2308.13248","submitter":"Waqas Ahmed","authors":"Waqas Ahmed, Talal Ahmed Chowdhury, Salah Nasri and Shaikh Saad","title":"Gravitational waves from metastable cosmic strings in Pati-Salam model\n  in light of new pulsar timing array data","comments":"10 pages and 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE gr-qc hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A series of pulsar timing arrays (PTAs) recently observed gravitational waves\nat the nanohertz frequencies. Motivated by this remarkable result, we present a\nnovel class of Pati-Salam models that give rise to a network of metastable\ncosmic strings, offering a plausible explanation for the observed PTA data.\nBesides, we introduce a hybrid inflationary scenario to eliminate magnetic\nmonopoles that arise during the spontaneous symmetry breaking of the Pati-Salam\ngauge group to the Standard Model. The resulting scalar spectral index is\ncompatible with Planck data, and the tensor-to-scalar ratio is anticipated to\nbe extremely small. Moreover, we incorporate a non-thermal leptogenesis to\ngenerate the required baryon asymmetry in our framework. Finally, the\ngravitational wave spectra generated by the metastable cosmic strings not only\ncorrespond to signals observed in recent PTAs, including NANOGrav, but are also\nwithin the exploration capacity of both present and future ground-based and\nspace-based experiments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:53:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ahmed","Waqas",""],["Chowdhury","Talal Ahmed",""],["Nasri","Salah",""],["Saad","Shaikh",""]]}
{"id":"2308.13249","submitter":"Yunzhu Pan","authors":"Yunzhu Pan, Nian Li, Chen Gao, Jianxin Chang, Yanan Niu, Yang Song,\n  Depeng Jin, Yong Li","title":"Learning and Optimization of Implicit Negative Feedback for Industrial\n  Short-video Recommender System","comments":"Accepted by CIKM'23","journal-ref":null,"doi":"10.1145/3583780.3615482","report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Short-video recommendation is one of the most important recommendation\napplications in today's industrial information systems. Compared with other\nrecommendation tasks, the enormous amount of feedback is the most typical\ncharacteristic. Specifically, in short-video recommendation, the\neasiest-to-collect user feedback is from the skipping behaviors, which leads to\ntwo critical challenges for the recommendation model. First, the skipping\nbehavior reflects implicit user preferences, and thus it is challenging for\ninterest extraction. Second, the kind of special feedback involves multiple\nobjectives, such as total watching time, which is also very challenging. In\nthis paper, we present our industrial solution in Kuaishou, which serves\nbillion-level users every day. Specifically, we deploy a feedback-aware\nencoding module which well extracts user preference taking the impact of\ncontext into consideration. We further design a multi-objective prediction\nmodule which well distinguishes the relation and differences among different\nmodel objectives in the short-video recommendation. We conduct extensive online\nA/B testing, along with detailed and careful analysis, which verifies the\neffectiveness of our solution.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:54:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pan","Yunzhu",""],["Li","Nian",""],["Gao","Chen",""],["Chang","Jianxin",""],["Niu","Yanan",""],["Song","Yang",""],["Jin","Depeng",""],["Li","Yong",""]]}
{"id":"2308.13250","submitter":"Shimin Zhang","authors":"Shimin Zhang, Qu Yang, Chenxiang Ma, Jibin Wu, Haizhou Li, Kay Chen\n  Tan","title":"TC-LIF: A Two-Compartment Spiking Neuron Model for Long-term Sequential\n  Modelling","comments":"arXiv admin note: substantial text overlap with arXiv:2307.07231","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The identification of sensory cues associated with potential opportunities\nand dangers is frequently complicated by unrelated events that separate useful\ncues by long delays. As a result, it remains a challenging task for\nstate-of-the-art spiking neural networks (SNNs) to establish long-term temporal\ndependency between distant cues. To address this challenge, we propose a novel\nbiologically inspired Two-Compartment Leaky Integrate-and-Fire spiking neuron\nmodel, dubbed TC-LIF. The proposed model incorporates carefully designed\nsomatic and dendritic compartments that are tailored to facilitate learning\nlong-term temporal dependencies. Furthermore, a theoretical analysis is\nprovided to validate the effectiveness of TC-LIF in propagating error gradients\nover an extended temporal duration. Our experimental results, on a diverse\nrange of temporal classification tasks, demonstrate superior temporal\nclassification capability, rapid training convergence, and high energy\nefficiency of the proposed TC-LIF model. Therefore, this work opens up a myriad\nof opportunities for solving challenging temporal processing tasks on emerging\nneuromorphic computing systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:54:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Shimin",""],["Yang","Qu",""],["Ma","Chenxiang",""],["Wu","Jibin",""],["Li","Haizhou",""],["Tan","Kay Chen",""]]}
{"id":"2308.13251","submitter":"Istv\\'an Mikl\\'os","authors":"Andras Hubai, Tamas Robert Mezei, Ferenc Beres, Andras Benczur, Istvan\n  Miklos","title":"Constructing and sampling partite, $3$-uniform hypergraphs with given\n  degree sequence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Partite, $3$-uniform hypergraphs are $3$-uniform hypergraphs in which each\nhyperedge contains exactly one point from each of the $3$ disjoint vertex\nclasses. We consider the degree sequence problem of partite, $3$-uniform\nhypergraphs, that is, to decide if such a hypergraph with prescribed degree\nsequences exists. We prove that this decision problem is NP-complete in\ngeneral, and give a polynomial running time algorithm for third almost-regular\ndegree sequences, that is, when each degree in one of the vertex classes is $k$\nor $k-1$ for some fixed $k$, and there is no restriction for the other two\nvertex classes. We also consider the sampling problem, that is, to uniformly\nsample partite, $3$-uniform hypergraphs with prescribed degree sequences. We\npropose a Parallel Tempering method, where the hypothetical energy of the\nhypergraphs measures the deviation from the prescribed degree sequence. The\nmethod has been implemented and tested on synthetic and real data. It can also\nbe applied for $\\chi^2$ testing of contingency tables. We have shown that this\nhypergraph-based $\\chi^2$ test is more sensitive than the standard $\\chi^2$\ntest. The extra sensitivity is especially advantageous on small data sets,\nwhere the proposed Parallel Tempering method shows promising performance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:55:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hubai","Andras",""],["Mezei","Tamas Robert",""],["Beres","Ferenc",""],["Benczur","Andras",""],["Miklos","Istvan",""]]}
{"id":"2308.13252","submitter":"Hannah Dr\\\"oge","authors":"Hannah Dr\\\"oge, Zorah L\\\"ahner, Yuval Bahat, Onofre Martorell, Felix\n  Heide, Michael M\\\"oller","title":"Kissing to Find a Match: Efficient Low-Rank Permutation Representation","comments":"13 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Permutation matrices play a key role in matching and assignment problems\nacross the fields, especially in computer vision and robotics. However, memory\nfor explicitly representing permutation matrices grows quadratically with the\nsize of the problem, prohibiting large problem instances. In this work, we\npropose to tackle the curse of dimensionality of large permutation matrices by\napproximating them using low-rank matrix factorization, followed by a\nnonlinearity. To this end, we rely on the Kissing number theory to infer the\nminimal rank required for representing a permutation matrix of a given size,\nwhich is significantly smaller than the problem size. This leads to a drastic\nreduction in computation and memory costs, e.g., up to $3$ orders of magnitude\nless memory for a problem of size $n=20000$, represented using $8.4\\times10^5$\nelements in two small matrices instead of using a single huge matrix with\n$4\\times 10^8$ elements. The proposed representation allows for accurate\nrepresentations of large permutation matrices, which in turn enables handling\nlarge problems that would have been infeasible otherwise. We demonstrate the\napplicability and merits of the proposed approach through a series of\nexperiments on a range of problems that involve predicting permutation\nmatrices, from linear and quadratic assignment to shape matching problems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:59:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dr\u00f6ge","Hannah",""],["L\u00e4hner","Zorah",""],["Bahat","Yuval",""],["Martorell","Onofre",""],["Heide","Felix",""],["M\u00f6ller","Michael",""]]}
{"id":"2308.13253","submitter":"Kevin Ollmann","authors":"Kevin Ollmann, Sebastian Wolf, Moritz Lietzow and Thomas A. Stuber","title":"Impact of hot exozodiacal dust on the polarimetric analysis of close-in\n  exoplanets","comments":"Accepted for publication in Astronomy \\& Astrophysics. 14 pages, 13\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hot exozodiacal dust (HEZD) found around main-sequence stars through\ninterferometric observations in the photometric bands H to L is located close\nto the dust sublimation radius, potentially at orbital radii comparable to\nthose of close-in exoplanets. Consequently, HEZD has a potential influence on\nthe analysis of the scattered-light polarization of close-in exoplanets and\nvice versa. We analyze the impact of HEZD on the polarimetric characterization\nof close-in exoplanets. This study is motivated in particular by the recently\nproven feasibility of exoplanet polarimetry. Applying the 3D Monte Carlo\nradiative transfer code POLARIS in an extended and optimized version for\nradiative transfer in exoplanetary atmospheres and an analytical tool for\nmodeling the HEZD, we simulated and compared the polarization characteristics\nof the wavelength-dependent scattered-light polarization of HEZD and close-in\nexoplanets. The varied parameters are the planetary phase angle\n($0^\\circ-180^\\circ$), the dust grain radius ($0.02\\ \\mu$m $- \\ 10\\ \\mu$m), the\nHEZD mass ($10^{-10}$$\\rm{M}_{\\oplus}$ $-\\ 10^{-8}$$\\rm{M}_{\\oplus}$), the\norbital inclination ($0^\\circ-90^\\circ$), the composition of the planetary\natmosphere (Mie and Rayleigh scattering atmosphere), the orbital radius of the\nHEZD ($0.02$ au $-\\ 0.4$ au), and the planetary orbital radius ($0.01$ au $-\\\n0.05$ au). The dust grain radius has the strongest influence on the\npolarimetric analysis due to its significant impact on the wavelength-dependent\npolarization characteristics and the total order of magnitude of the\nscattered-light polarization. In certain scenarios, the scattered-light\npolarization of the HEZD even exceeds that of the close-in exoplanet.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:59:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ollmann","Kevin",""],["Wolf","Sebastian",""],["Lietzow","Moritz",""],["Stuber","Thomas A.",""]]}
{"id":"2308.13254","submitter":"Masaki Kawamoto","authors":"Masaki Kawamoto and Haruya Mizutani","title":"Modified scattering for nonlinear Schr\\\"odinger equations with\n  long-range potentials","comments":"24pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the final state problem for the nonlinear Schr\\\"{o}dinger equation\nwith a critical long-range nonlinearity and a long-range linear potential.\nGiven a prescribed asymptotic profile which is different from the free\nevolution, we construct a unique global solution scattering to the profile. In\nparticular, the existence of the modified wave operators is obtained for\nsufficiently localized small scattering data. The class of potential includes a\nrepulsive long-range potential with a short-range perturbation, especially the\npositive Coulomb potential in two and three space dimensions. The asymptotic\nprofile is constructed by combining Yafaev's type linear modifier [41]\nassociated with the long-range part of the potential and the nonlinear modifier\nintroduced by Ozawa [32]. Finally, we also show that one can replace Yafaev's\ntype modifier by Dollard's type modifier under a slightly stronger decay\nassumption on the long-range potential. This is the first positive result on\nthe modified scattering for the nonlinear Schr\\\"{o}dinger equation in the case\nwhen both of the nonlinear term and the linear potential are of long-range\ntype.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:59:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kawamoto","Masaki",""],["Mizutani","Haruya",""]]}
{"id":"2308.13255","submitter":"Allan Lo","authors":"Deepak Bal and Louis DeBiasio and Allan Lo","title":"A lower bound on the multicolor size-Ramsey numbers of paths in\n  hypergraphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $r$-color size-Ramsey number of a $k$-uniform hypergraph~$H$, denoted by\n$\\hat{R}_r(H)$, is the minimum number of edges in a $k$-uniform hypergraph $G$\nsuch that for every $r$-coloring of the edges of $G$ there exists a\nmonochromatic copy of $H$. When $H$ is a graph path, it is known that\n$\\Omega(r^2n)=\\hat{R}_r(P_n)=O((r^2\\log r)n)$ with the best bounds essentially\ndue to Krivelevich. Letzter, Pokrovskiy, and Yepremyan~\\cite{LPY} recently\nproved that, for the $k$-uniform tight path $P_{n}^{(k)}$,\n$\\hat{R}_r(P_{n}^{(k)})=O_{r,k}(n)$.\n  We consider the problem of giving a lower bound on $\\hat{R}_r(P_{n}^{(k)})$\n(for fixed $k$ and growing $r$). We show that\n$\\hat{R}_r(P_n^{(k)})=\\Omega_k(r^kn)$. In the case $k=3$, we give a more\nprecise estimate which in particular improves the best known lower bound for\n$2$ colors due to Winter; i.e. we show $\\hat{R}(P^{(3)}_{n})\\geq\n\\frac{28}{9}n-30$. All of our results above generalize to $\\ell$-overlapping\n$k$-uniform paths $P_{n}^{(k, \\ell)}$. In general we have $\\hat{R}_r (\nP_{n}^{(k, \\ell)} ) = \\Omega_k( r^{\\left\\lfloor \\frac{k}{k-\\ell} \\right\\rfloor\n} n)$, and when $1\\leq \\ell\\leq \\frac{k}{2}$ we have $\\hat{R}_r(P_{n}^{(k,\n\\ell)})=\\Omega_k(r^{2}n)$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:01:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bal","Deepak",""],["DeBiasio","Louis",""],["Lo","Allan",""]]}
{"id":"2308.13256","submitter":"Suzie Cro","authors":"Suzie Cro, James H Roger, James R Carpenter","title":"Multiple imputation of partially observed data after\n  treatment-withdrawal","comments":"16 pages, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ICH E9(R1) Addendum (International Council for Harmonization 2019)\nsuggests treatment-policy as one of several strategies for addressing\nintercurrent events such as treatment withdrawal when defining an estimand.\nThis strategy requires the monitoring of patients and collection of primary\noutcome data following termination of randomized treatment. However, when\npatients withdraw from a study before nominal completion this creates true\nmissing data complicating the analysis. One possible way forward uses multiple\nimputation to replace the missing data based on a model for outcome on and off\ntreatment prior to study withdrawal, often referred to as retrieved dropout\nmultiple imputation. This article explores a novel approach to parameterizing\nthis imputation model so that those parameters which may be difficult to\nestimate have mildly informative Bayesian priors applied during the imputation\nstage. A core reference-based model is combined with a compliance model, using\nboth on- and off- treatment data to form an extended model for the purposes of\nimputation. This alleviates the problem of specifying a complex set of analysis\nrules to accommodate situations where parameters which influence the estimated\nvalue are not estimable or are poorly estimated, leading to unrealistically\nlarge standard errors in the resulting analysis.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:01:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cro","Suzie",""],["Roger","James H",""],["Carpenter","James R",""]]}
{"id":"2308.13257","submitter":"Ulises Rodriguez Dominguez","authors":"Ulises Rodr\\'iguez-Dom\\'inguez and Hideaki Shimazaki","title":"Alternating Shrinking Higher-order Interactions for Sparse Neural\n  Population Activity","comments":"5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neurons in living things work cooperatively and efficiently to process\nincoming sensory information, often exhibiting sparse and widespread population\nactivity involving structured higher-order interactions. While there are\nstatistical models based on continuous probability distributions for neurons'\nsparse firing rates, how the spiking activities of a large number of\ninteracting neurons result in the sparse and widespread population activity\nremains unknown. Here, for homogeneous (0,1) binary neurons, we provide\nsufficient conditions under which their spike-count population distribution\nconverges to a sparse widespread distribution of the population spike rate in\nan infinitely large population of neurons. Following the conditions, we propose\nnew models belonging to an exponential family distribution in which the sign\nand magnitude of neurons' higher-order interactions alternate and shrink as the\norder increases. The distributions exhibit parameter-dependent sparsity on a\nbounded support for the population firing rate. The theory serves as a building\nblock for developing prior distributions and neurons' non-linearity for\nspike-based sparse coding.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:12:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rodr\u00edguez-Dom\u00ednguez","Ulises",""],["Shimazaki","Hideaki",""]]}
{"id":"2308.13258","submitter":"Alexandr Buryak","authors":"Alexandr Buryak, Paolo Rossi","title":"Intersection numbers with Pixton's class and the noncommutative KdV\n  hierarchy","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Pixton class is a nonhomogeneous cohomology class on the moduli space of\nstable curves $\\overline{\\mathcal{M}}_{g,n}$, with nontrivial terms in degree\n$0,2,4,\\ldots,2g$, whose top degree part coincides with the double ramification\ncycle. In this paper, we prove our conjecture from a previous work, claiming\nthat the generating series of intersection numbers of the Pixton class with\nmonomials in the psi-classes gives a solution of the noncommutative KdV\nhierarchy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:16:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Buryak","Alexandr",""],["Rossi","Paolo",""]]}
{"id":"2308.13259","submitter":"Keheng Wang","authors":"Keheng Wang, Feiyu Duan, Sirui Wang, Peiguang Li, Yunsen Xian,\n  Chuantao Yin, Wenge Rong, Zhang Xiong","title":"Knowledge-Driven CoT: Exploring Faithful Reasoning in LLMs for\n  Knowledge-intensive Question Answering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Equipped with Chain-of-Thought (CoT), Large language models (LLMs) have shown\nimpressive reasoning ability in various downstream tasks. Even so, suffering\nfrom hallucinations and the inability to access external knowledge, LLMs often\ncome with incorrect or unfaithful intermediate reasoning steps, especially in\nthe context of answering knowledge-intensive tasks such as KBQA. To alleviate\nthis issue, we propose a framework called Knowledge-Driven Chain-of-Thought\n(KD-CoT) to verify and modify reasoning traces in CoT via interaction with\nexternal knowledge, and thus overcome the hallucinations and error propagation.\nConcretely, we formulate the CoT rationale process of LLMs into a structured\nmulti-round QA format. In each round, LLMs interact with a QA system that\nretrieves external knowledge and produce faithful reasoning traces based on\nretrieved precise answers. The structured CoT reasoning of LLMs is facilitated\nby our developed KBQA CoT collection, which serves as in-context learning\ndemonstrations and can also be utilized as feedback augmentation to train a\nrobust retriever. Extensive experiments on WebQSP and ComplexWebQuestion\ndatasets demonstrate the effectiveness of proposed KD-CoT in task-solving\nreasoning generation, which outperforms the vanilla CoT ICL with an absolute\nsuccess rate of 8.0% and 5.1%. Furthermore, our proposed feedback-augmented\nretriever outperforms the state-of-the-art baselines for retrieving knowledge,\nachieving significant improvement in Hit performance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:23:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Keheng",""],["Duan","Feiyu",""],["Wang","Sirui",""],["Li","Peiguang",""],["Xian","Yunsen",""],["Yin","Chuantao",""],["Rong","Wenge",""],["Xiong","Zhang",""]]}
{"id":"2308.13260","submitter":"Songhua Li","authors":"Songhua Li and Lingjie Duan","title":"Approximation Algorithms to Enhance Social Sharing of Fresh\n  Point-of-Interest Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DM cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In location-based social networks (LBSNs), such as Gowalla and Waze, users\nsense urban point-of-interest (PoI) information (e.g., restaurants' queue\nlength and real-time traffic conditions) in the vicinity and share such\ninformation with friends in online social networks. Given each user's social\nconnections and the severe lags in disseminating fresh PoI to all users, major\nLBSNs aim to enhance users' social PoI sharing by selecting a subset $k$ out of\nall $m$ users as hotspots and broadcasting their PoI information to the entire\nuser community. This motivates us to study a new combinatorial optimization\nproblem by integrating two urban sensing and online social networks. We prove\nthat this problem is NP-hard and also renders existing approximation solutions\nnot viable. Through analyzing the interplay effects between the sensing and\nsocial networks, we successfully transform the involved PoI-sharing process\nacross two networks to matrix computations for deriving a closed-form objective\nand present a polynomial-time algorithm to ensure\n($1-\\frac{m-2}{m}(\\frac{k-1}{k})^k$) approximation of the optimum. Furthermore,\nwe allow each selected user to move around and sense more PoI information to\nshare. To this end, we propose an augmentation-adaptive algorithm, which\nbenefits from a resource-augmented technique and achieves bounded\napproximation, ranging from $\\frac{1}{k}(1-\\frac{1}{e})$ to $1-\\frac{1}{e}>\n0.632$ by adjusting our augmentation factors. %Particularly when all sensing\nnodes are associated with users, we devise, by leveraging our\naugmentation-adaptive algorithm as a subroutine, an algorithm that eliminates\nthe need for augmentation while still ensuring a satisfactory approximation\n$1-\\frac{m-2}{m}(\\frac{k-1}{k})^k$. Finally, our theoretical results are\ncorroborated by our simulation findings using both synthetic and real-world\ndatasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:24:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Songhua",""],["Duan","Lingjie",""]]}
{"id":"2308.13261","submitter":"Alexander Florian Jercher","authors":"Alexander F. Jercher, Luca Marchetti, Andreas G. A. Pithis","title":"Scalar Cosmological Perturbations from Quantum Entanglement within\n  Lorentzian Quantum Gravity","comments":"44 + 18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive the dynamics of (isotropic) scalar perturbations from the\nmean-field hydrodynamics of full Lorentzian quantum gravity, as described by a\ntwo-sector (timelike and spacelike) Barrett-Crane group field theory (GFT)\nmodel. The rich causal structure of this model allows us to consistently\nimplement in the quantum theory the causal properties of a physical Lorentzian\nreference frame composed of four minimally coupled, massless, and free scalar\nfields. Using this frame, we are able to effectively construct relational\nobservables that are used to recover macroscopic cosmological quantities. In\nparticular, small isotropic scalar inhomogeneities emerge as a result of\n(relational) nearest-neighbor two-body entanglement between degrees of freedom\nof the underlying quantum gravity theory. The dynamical equations we obtain for\ngeometric and matter perturbations show agreement with those of classical\ngeneral relativity in the long-wavelength, super-horizon limit. In general,\ndeviations become important for sub-horizon modes, which seem to be naturally\nassociated with a trans-Planckian regime in our physical reference frame. We\nargue that these trans-Planckian corrections are quantum gravitational in\nnature. However, we explicitly show that for some physically interesting\nsolutions these quantum gravity effects can be quite small, leading to a very\ngood agreement with the classical GR behavior.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:25:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jercher","Alexander F.",""],["Marchetti","Luca",""],["Pithis","Andreas G. A.",""]]}
{"id":"2308.13262","submitter":"Adrian Lison","authors":"Adrian Lison, Sam Abbott, Jana Huisman, Tanja Stadler","title":"Generative Bayesian modeling to nowcast the effective reproduction\n  number from line list data with missing symptom onset dates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The time-varying effective reproduction number $R_t$ is a widely used\nindicator of transmission dynamics during infectious disease outbreaks. Timely\nestimates of $R_t$ can be obtained from observations close to the original date\nof infection, such as the date of symptom onset. However, these data often have\nmissing information and are subject to right truncation. Previous methods have\naddressed these problems independently by first imputing missing onset dates,\nthen adjusting truncated case counts, and finally estimating the effective\nreproduction number. This stepwise approach makes it difficult to propagate\nuncertainty and can introduce subtle biases during real-time estimation due to\nthe continued impact of assumptions made in previous steps. In this work, we\nintegrate imputation, truncation adjustment, and $R_t$ estimation into a single\ngenerative Bayesian model, allowing direct joint inference of case counts and\n$R_t$ from line list data with missing symptom onset dates. We then use this\nframework to compare the performance of nowcasting approaches with different\nstepwise and generative components on synthetic line list data for multiple\noutbreak scenarios and across different epidemic phases. We find that under\nlong reporting delays, intermediate smoothing, as is common practice in\nstepwise approaches, can bias nowcasts of case counts and $R_t$, which is\navoided in a joint generative approach due to shared regularization of all\nmodel components. On incomplete line list data, a fully generative approach\nenables the quantification of uncertainty due to missing onset dates without\nthe need for an initial multiple imputation step. In a real-world comparison\nusing hospitalization line list data from the COVID-19 pandemic in Switzerland,\nwe observe the same qualitative differences between approaches. Our generative\nmodeling components have been integrated into the R package epinowcast.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:27:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lison","Adrian",""],["Abbott","Sam",""],["Huisman","Jana",""],["Stadler","Tanja",""]]}
{"id":"2308.13263","submitter":"Aris Dimou","authors":"Aris Dimou, Ankita Biswas, Anna Gruenebohm","title":"Ab initio based study on atomic ordering in {(Ba, Sr)}TiO$_3$","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  \\ We combine density functional theory and molecular dynamics simulations to\ninvestigate the impact of Sr concentration and atomic ordering on the\nstructural and ferroelectric properties of (Ba, Sr)TiO$_3$. On one hand, the\nmacroscopic structural properties are rather insensitive to atomic ordering. On\nthe other hand, the Curie temperature and polarization differ by $9$\\% and\n$17$\\% for different symmetries of the Sr distribution, respectively. Local\nordering of Sr induces preferential polarization directions and influences the\nrelative stability of the three ferroelectric phases.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:29:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dimou","Aris",""],["Biswas","Ankita",""],["Gruenebohm","Anna",""]]}
{"id":"2308.13264","submitter":"Anna Muranova","authors":"Florian Fischer, Matthias Keller, Anna Muranova, Noema Nicolussi","title":"Capacity of infinite graphs over non-Archimedean ordered fields","comments":"29 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article we study the notion of capacity of a vertex for infinite\ngraphs over non-Archimedean fields. In contrast to graphs over the real field\nmonotone limits do not need to exist. Thus, in our situation next to positive\nand null capacity there is a third case of divergent capacity. However, we show\nthat either of these cases is independent of the choice of the vertex and is\ntherefore a global property for connected graphs. The capacity is shown to\nconnect the minimization of the energy, solutions of the Dirichlet problem and\nexistence of a Green's function. We furthermore give sufficient criteria in\nform of a Nash-Williams test, study the relation to Hardy inequalities and\ndiscuss the existence of positive superharmonic functions. Finally, we\ninvestigate the analytic features of the transition operator in relation to the\ninverse of the Laplace operator.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:35:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fischer","Florian",""],["Keller","Matthias",""],["Muranova","Anna",""],["Nicolussi","Noema",""]]}
{"id":"2308.13265","submitter":"Zahra Taghiyarrenani Ms","authors":"Zahra Taghiyarrenani, Abdallah Abdallah, Slawomir Nowaczyk, Sepideh\n  Pashami","title":"Heterogeneous Federated Learning via Personalized Generative Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Federated Learning (FL) allows several clients to construct a common global\nmachine-learning model without having to share their data. FL, however, faces\nthe challenge of statistical heterogeneity between the client's data, which\ndegrades performance and slows down the convergence toward the global model. In\nthis paper, we provide theoretical proof that minimizing heterogeneity between\nclients facilitates the convergence of a global model for every single client.\nThis becomes particularly important under empirical concept shifts among\nclients, rather than merely considering imbalanced classes, which have been\nstudied until now. Therefore, we propose a method for knowledge transfer\nbetween clients where the server trains client-specific generators. Each\ngenerator generates samples for the corresponding client to remove the conflict\nwith other clients' models. Experiments conducted on synthetic and real data,\nalong with a theoretical study, support the effectiveness of our method in\nconstructing a well-generalizable global model by reducing the conflict between\nlocal models.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:37:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Taghiyarrenani","Zahra",""],["Abdallah","Abdallah",""],["Nowaczyk","Slawomir",""],["Pashami","Sepideh",""]]}
{"id":"2308.13266","submitter":"Yuanyou Xu","authors":"Yuanyou Xu, Zongxin Yang, Yi Yang","title":"Integrating Boxes and Masks: A Multi-Object Framework for Unified Visual\n  Tracking and Segmentation","comments":"Accepted to ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tracking any given object(s) spatially and temporally is a common purpose in\nVisual Object Tracking (VOT) and Video Object Segmentation (VOS). Joint\ntracking and segmentation have been attempted in some studies but they often\nlack full compatibility of both box and mask in initialization and prediction,\nand mainly focus on single-object scenarios. To address these limitations, this\npaper proposes a Multi-object Mask-box Integrated framework for unified\nTracking and Segmentation, dubbed MITS. Firstly, the unified identification\nmodule is proposed to support both box and mask reference for initialization,\nwhere detailed object information is inferred from boxes or directly retained\nfrom masks. Additionally, a novel pinpoint box predictor is proposed for\naccurate multi-object box prediction, facilitating target-oriented\nrepresentation learning. All target objects are processed simultaneously from\nencoding to propagation and decoding, as a unified pipeline for VOT and VOS.\nExperimental results show MITS achieves state-of-the-art performance on both\nVOT and VOS benchmarks. Notably, MITS surpasses the best prior VOT competitor\nby around 6% on the GOT-10k test set, and significantly improves the\nperformance of box initialization on VOS benchmarks. The code is available at\nhttps://github.com/yoxu515/MITS.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:37:51 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 12:02:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Yuanyou",""],["Yang","Zongxin",""],["Yang","Yi",""]]}
{"id":"2308.13267","submitter":"Nilakantha Meher","authors":"Nilakantha Meher, Eilon Poem, Tom\\'a\\v{s} Opatrn\\'y, Ofer Firstenberg,\n  Gershon Kurizki","title":"Supersensitive phase estimation by thermal light in nonlinear\n  interferometers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By consensus, estimation of phase delay between interferometer arms may\nexhibit an error below the standard quantum (shot-noise) limit if the input is\nan entangled two-mode state, e.g., a N00N state. We show, by contrast, that\nsuch super-sensitive phase estimation is achievable by incoherent, e.g.,\nthermal, input in an interferometer with Kerr-nonlinear two-mode coupler. Not\nless remarkably, the Heisenberg precision bound is attainable and even\nsurpassed in such nonlinear interferometers even for small nonlinear\nphase-shifts per photon pair or for significant photon loss. Feasible mode\ncouplers with giant Kerr nonlinearity that stems either from dipole-dipole\ninteractions of Rydberg polaritons in a cold atomic gas, or from\ncavity-enhanced dispersive atom-field interactions, may exploit such effects to\nsubstantially advance interferometric phase microscopy using incoherent, faint\nlight sources.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:38:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Meher","Nilakantha",""],["Poem","Eilon",""],["Opatrn\u00fd","Tom\u00e1\u0161",""],["Firstenberg","Ofer",""],["Kurizki","Gershon",""]]}
{"id":"2308.13268","submitter":"Hamed Masoumi","authors":"Hamed Masoumi, Michel Verhaegen and Nitin Jonathan Myers","title":"In-sector Compressive Beam Alignment for MmWave and THz Radios","comments":"30 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beam alignment is key in enabling millimeter wave and terahertz radios to\nachieve their capacity. Due to the use of large arrays in these systems, the\ncommon exhaustive beam scanning results in a substantial training overhead.\nPrior work has addressed this issue, by developing compressive sensing\n(CS)-based methods which exploit channel sparsity to achieve faster beam\nalignment. Unfortunately, standard CS techniques employ wide beams and suffer\nfrom a low signal-to-noise ratio (SNR) in the channel measurements. To solve\nthis challenge, we develop an IEEE 802.11ad/ay compatible technique that takes\nan in-sector approach for CS. In our method, the angle domain channel is\npartitioned into several sectors, and the channel within the best sector is\nestimated for beam alignment. The essence of our framework lies in the\nconstruction of a low-resolution beam codebook to identify the best sector and\nin the design of the CS matrix for in-sector channel estimation. Our beam\ncodebook illuminates distinct non-overlapping sectors and can be realized with\nlow-resolution phased arrays. We show that the proposed codebook results in a\nhigher received SNR than the state-of-the-art sector sweep codebooks.\nFurthermore, our optimized CS matrix achieves a better in-sector channel\nreconstruction than comparable benchmarks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:42:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Masoumi","Hamed",""],["Verhaegen","Michel",""],["Myers","Nitin Jonathan",""]]}
{"id":"2308.13269","submitter":"Guanhua Ye","authors":"Guanhua Ye, Tong Chen, Quoc Viet Hung Nguyen, Hongzhi Yin","title":"Heterogeneous Decentralized Machine Unlearning with Seed Model\n  Distillation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As some recent information security legislation endowed users with\nunconditional rights to be forgotten by any trained machine learning model,\npersonalized IoT service providers have to put unlearning functionality into\ntheir consideration. The most straightforward method to unlearn users'\ncontribution is to retrain the model from the initial state, which is not\nrealistic in high throughput applications with frequent unlearning requests.\nThough some machine unlearning frameworks have been proposed to speed up the\nretraining process, they fail to match decentralized learning scenarios. In\nthis paper, we design a decentralized unlearning framework called HDUS, which\nuses distilled seed models to construct erasable ensembles for all clients.\nMoreover, the framework is compatible with heterogeneous on-device models,\nrepresenting stronger scalability in real-world applications. Extensive\nexperiments on three real-world datasets show that our HDUS achieves\nstate-of-the-art performance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:42:54 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 08:09:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ye","Guanhua",""],["Chen","Tong",""],["Nguyen","Quoc Viet Hung",""],["Yin","Hongzhi",""]]}
{"id":"2308.13270","submitter":"Amir Belder","authors":"Amir Belder, Refael Vivanti, Ayellet Tal","title":"A Game of Bundle Adjustment -- Learning Efficient Convergence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Bundle adjustment is the common way to solve localization and mapping. It is\nan iterative process in which a system of non-linear equations is solved using\ntwo optimization methods, weighted by a damping factor. In the classic\napproach, the latter is chosen heuristically by the Levenberg-Marquardt\nalgorithm on each iteration. This might take many iterations, making the\nprocess computationally expensive, which might be harmful to real-time\napplications. We propose to replace this heuristic by viewing the problem in a\nholistic manner, as a game, and formulating it as a reinforcement-learning\ntask. We set an environment which solves the non-linear equations and train an\nagent to choose the damping factor in a learned manner. We demonstrate that our\napproach considerably reduces the number of iterations required to reach the\nbundle adjustment's convergence, on both synthetic and real-life scenarios. We\nshow that this reduction benefits the classic approach and can be integrated\nwith other bundle adjustment acceleration methods.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:44:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Belder","Amir",""],["Vivanti","Refael",""],["Tal","Ayellet",""]]}
{"id":"2308.13271","submitter":"Kjeld Eikema","authors":"Elmer L. Gr\\\"undeman, Vincent Barb\\'e, Andr\\'es Mart\\'inez de Velasco,\n  Charlaine Roth, Mathieu Collombon, Julian J. Krauth, Laura S. Dreissen,\n  Richard Ta\\\"ieb, Kjeld S. E. Eikema","title":"Laser Excitation of the 1S-2S Transition in Singly-Ionized Helium","comments":"Main paper 6 pages with 4 figures, supplementary 4 pages with 5\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Precision laser spectroscopy in the extreme ultraviolet of the 1S-2S\ntwo-photon transition in singly-ionized helium is a promising route for tests\nof fundamental physics. We demonstrate laser excitation of this transition in\nan atomic beam of $^3$He, based on an amplified frequency comb pulse at 790 nm\ncombined with its 25$^{\\text{th}}$ harmonic at 32 nm. A clear resonance is\nobserved with a maximum excitation probability of close to 10$^{-4}$ per pulse,\nand the results are well described by our simulations. This paves the way for\nhigh-precision Ramsey-comb spectroscopy of a single helium ion in a Paul trap.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:47:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gr\u00fcndeman","Elmer L.",""],["Barb\u00e9","Vincent",""],["de Velasco","Andr\u00e9s Mart\u00ednez",""],["Roth","Charlaine",""],["Collombon","Mathieu",""],["Krauth","Julian J.",""],["Dreissen","Laura S.",""],["Ta\u00efeb","Richard",""],["Eikema","Kjeld S. E.",""]]}
{"id":"2308.13272","submitter":"Jinsu Kim","authors":"Shinsuke Kawai, Jinsu Kim","title":"Probing inflationary moduli space with gravitational waves","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the spectrum of gravitational waves arising from primordial\ninflation in the presence of a string-theoretical higher curvature correction,\nspecifically, the Gauss-Bonnet coupling term for the inflaton (modulus) field.\nWe show that if the modulus field exhibits a wall-crossing like behavior in the\nmoduli space, there can be a period of Gauss-Bonnet coupling term domination\nduring the usual slow-roll. This phenomenon is potentially detectable as the\ngravitational wave spectrum exhibits a characteristic peak caused by the brief\ndomination of the Gauss-Bonnet coupling term. We explore the possibility of\nmeasuring such gravitational waves with pulsar timing array experiments such as\nNANOGrav, and future space-borne interferometers such as LISA, DECIGO, and\nTaiji.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:50:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kawai","Shinsuke",""],["Kim","Jinsu",""]]}
{"id":"2308.13273","submitter":"Jiaming Shen","authors":"Jiaming Shen, Kun Hu, Wei Bao, Chang Wen Chen, Zhiyong Wang","title":"Bridging the Gap: Fine-to-Coarse Sketch Interpolation Network for\n  High-Quality Animation Sketch Inbetweening","comments":"7pages,6figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 2D animation workflow is typically initiated with the creation of\nkeyframes using sketch-based drawing. Subsequent inbetweens (i.e., intermediate\nsketch frames) are crafted through manual interpolation for smooth animations,\nwhich is a labor-intensive process. Thus, the prospect of automatic animation\nsketch interpolation has become highly appealing. However, existing video\ninterpolation methods are generally hindered by two key issues for sketch\ninbetweening: 1) limited texture and colour details in sketches, and 2)\nexaggerated alterations between two sketch keyframes. To overcome these issues,\nwe propose a novel deep learning method, namely Fine-to-Coarse Sketch\nInterpolation Network (FC-SIN). This approach incorporates multi-level guidance\nthat formulates region-level correspondence, sketch-level correspondence and\npixel-level dynamics. A multi-stream U-Transformer is then devised to\ncharacterize sketch inbewteening patterns using these multi-level guides\nthrough the integration of both self-attention and cross-attention mechanisms.\nAdditionally, to facilitate future research on animation sketch inbetweening,\nwe constructed a large-scale dataset - STD-12K, comprising 30 sketch animation\nseries in diverse artistic styles. Comprehensive experiments on this dataset\nconvincingly show that our proposed FC-SIN surpasses the state-of-the-art\ninterpolation methods. Our code and dataset will be publicly available.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:51:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shen","Jiaming",""],["Hu","Kun",""],["Bao","Wei",""],["Chen","Chang Wen",""],["Wang","Zhiyong",""]]}
{"id":"2308.13274","submitter":"Nick Brown","authors":"Gabriel Rodriguez-Canal, Nick Brown, Tim Dykes, Jessica R. Jones,\n  Utz-Uwe Haus","title":"Fortran High-Level Synthesis: Reducing the barriers to accelerating HPC\n  codes on FPGAs","comments":"Author accepted version to appear in 33rd International Conference on\n  Field-Programmable Logic and Applications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years the use of FPGAs to accelerate scientific applications has\ngrown, with numerous applications demonstrating the benefit of FPGAs for high\nperformance workloads. However, whilst High Level Synthesis (HLS) has\nsignificantly lowered the barrier to entry in programming FPGAs by enabling\nprogrammers to use C++, a major challenge is that most often these codes are\nnot originally written in C++. Instead, Fortran is the lingua franca of\nscientific computing and-so it requires a complex and time consuming initial\nstep to convert into C++ even before considering the FPGA.\n  In this paper we describe work enabling Fortran for AMD Xilinx FPGAs by\nconnecting the LLVM Flang front end to AMD Xilinx's LLVM back end. This enables\nprogrammers to use Fortran as a first-class language for programming FPGAs, and\nas we demonstrate enjoy all the tuning and optimisation opportunities that HLS\nC++ provides. Furthermore, we demonstrate that certain language features of\nFortran make it especially beneficial for programming FPGAs compared to C++.\nThe result of this work is a lowering of the barrier to entry in using FPGAs\nfor scientific computing, enabling programmers to leverage their existing\ncodebase and language of choice on the FPGA directly.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:51:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rodriguez-Canal","Gabriel",""],["Brown","Nick",""],["Dykes","Tim",""],["Jones","Jessica R.",""],["Haus","Utz-Uwe",""]]}
{"id":"2308.13275","submitter":"Birabar Ranjit Nanda","authors":"Mayank Gupta, S. Satpathy, and B. R. K. Nanda","title":"Effective tight-binding Hamiltonian for the low-energy electronic\n  structure of the Cu-doped lead apatite and the parent compound","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the origin of the formation of narrow bands in LK-99\n(Pb$_{9}$Cu(PO$_4$)$_6$O) and the parent compound without the Cu doping using\ndensity functional theory calculations and model Hamiltonian studies. Explicit\nanalytical expressions are given for a nearest-neighbor tight-binding (TB)\nHamiltonian in the momentum space for both the parent and the LK-99 compound,\nwhich can serve as an effective model to study various quantum phenomena\nincluding superconductivity. The parent material is an insulator with the\nbuckle oxygen atom on the stacked triangular lattice forming the topmost bands,\nwell-separated from the remaining oxygen band manifold. The $C_3$\nsymmetry-driven two-band TB model describes these two bands quite well. These\nbands survive in the Cu-doped, LK-99, though with drastically altered band\ndispersion due to the Cu-O interaction. A similar two-band model involving the\nCu $xz$ and $yz$ orbitals broadly describes the top two valence bands of LK-99.\nHowever, the band dispersions of both the Cu and O bands are much better\ndescribed by the four-band TB model incorporating the Cu-O interactions on the\nbuckled honeycomb lattice. We comment on the possible mechanisms of\nsuperconductivity in LK-99. even though the actual T$_c$ may be much smaller\nthan reported, and suggest that interstitial Cu clusters leading to broad bands\nmight have a role to play\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:51:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gupta","Mayank",""],["Satpathy","S.",""],["Nanda","B. R. K.",""]]}
{"id":"2308.13276","submitter":"Bonan Kou","authors":"Zhongkai Zhao, Bonan Kou, Mohamed Yilmaz Ibrahim, Muhao Chen, Tianyi\n  Zhang","title":"Knowledge-Based Version Incompatibility Detection for Deep Learning","comments":"12 pages, FSE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Version incompatibility issues are rampant when reusing or reproducing deep\nlearning models and applications. Existing techniques are limited to library\ndependency specifications declared in PyPI. Therefore, these techniques cannot\ndetect version issues due to undocumented version constraints or issues\ninvolving hardware drivers or OS. To address this challenge, we propose to\nleverage the abundant discussions of DL version issues from Stack Overflow to\nfacilitate version incompatibility detection. We reformulate the problem of\nknowledge extraction as a Question-Answering (QA) problem and use a pre-trained\nQA model to extract version compatibility knowledge from online discussions.\nThe extracted knowledge is further consolidated into a weighted knowledge graph\nto detect potential version incompatibilities when reusing a DL project. Our\nevaluation results show that (1) our approach can accurately extract version\nknowledge with 84% accuracy, and (2) our approach can accurately identify 65%\nof known version issues in 10 popular DL projects with a high precision (92%),\nwhile two state-of-the-art approaches can only detect 29% and 6% of these\nissues with 33% and 17% precision respectively.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:53:26 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 14:13:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Zhongkai",""],["Kou","Bonan",""],["Ibrahim","Mohamed Yilmaz",""],["Chen","Muhao",""],["Zhang","Tianyi",""]]}
{"id":"2308.13277","submitter":"Harriet Apel","authors":"Harriet Apel, Nou\\'edyn Baspin","title":"Simulating LDPC code Hamiltonians on 2D lattices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While LDPC codes have been demonstrated with desirable error correcting\nproperties, this has come at a cost of diverging from the geometrical\nconstraints of many hardware platforms. Viewing codes as the groundspace of a\nHamiltonian, we consider engineering a simulation Hamiltonian reproducing some\nrelevant features of the code. Techniques from Hamiltonian simulation theory\nare used to build a simulation of LDPC codes using only 2D nearest-neighbour\ninteractions at the cost of an energy penalty polynomial in the system size. We\nderive guarantees for the simulation that allows us to approximately reproduce\nthe ground state of the code Hamiltonian, approximating a $[[N,\n\\Omega(\\sqrt{N}), \\Omega(\\sqrt{N})]]$ code in 2D. The key ingredient is a new\nconstructive tool to simulate an $l$-long interaction between two qubits by a\n1D chain of $l$ nearest-neighbour interacting qubits using $\\mathrm{poly}( l)$\ninteraction strengths. This is an exponential advantage over the existing\ngadgets for this routine which facilitates the first $\\epsilon$-simulation of\n\\emph{arbitrary sparse} Hamiltonian on $n$ qubits with a Hamiltonian on a 2D\nlattice of $O(n^2)$ qubits with interaction strengths scaling as\n$O\\left(\\mathrm{poly}(n,1/\\epsilon)\\right)$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:59:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Apel","Harriet",""],["Baspin","Nou\u00e9dyn",""]]}
{"id":"2308.13278","submitter":"Achkan Salehi","authors":"Achkan Salehi and Stephane Doncieux","title":"Integrating LLMs and Decision Transformers for Language Grounded\n  Generative Quality-Diversity","comments":"16 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quality-Diversity is a branch of stochastic optimization that is often\napplied to problems from the Reinforcement Learning and control domains in\norder to construct repertoires of well-performing policies/skills that exhibit\ndiversity with respect to a behavior space. Such archives are usually composed\nof a finite number of reactive agents which are each associated to a unique\nbehavior descriptor, and instantiating behavior descriptors outside of that\ncoarsely discretized space is not straight-forward. While a few recent works\nsuggest solutions to that issue, the trajectory that is generated is not easily\ncustomizable beyond the specification of a target behavior descriptor. We\npropose to jointly solve those problems in environments where semantic\ninformation about static scene elements is available by leveraging a Large\nLanguage Model to augment the repertoire with natural language descriptions of\ntrajectories, and training a policy conditioned on those descriptions. Thus,\nour method allows a user to not only specify an arbitrary target behavior\ndescriptor, but also provide the model with a high-level textual prompt to\nshape the generated trajectory. We also propose an LLM-based approach to\nevaluating the performance of such generative agents. Furthermore, we develop a\nbenchmark based on simulated robot navigation in a 2d maze that we use for\nexperimental validation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:00:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Salehi","Achkan",""],["Doncieux","Stephane",""]]}
{"id":"2308.13279","submitter":"Lars Doorenbos","authors":"Lars Doorenbos, Pablo M\\'arquez-Neila, Raphael Sznitman, Pascal Mettes","title":"Hyperbolic Random Forests","comments":"Code available at https://github.com/LarsDoorenbos/HoroRF","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hyperbolic space is becoming a popular choice for representing data due to\nthe hierarchical structure - whether implicit or explicit - of many real-world\ndatasets. Along with it comes a need for algorithms capable of solving\nfundamental tasks, such as classification, in hyperbolic space. Recently,\nmultiple papers have investigated hyperbolic alternatives to hyperplane-based\nclassifiers, such as logistic regression and SVMs. While effective, these\napproaches struggle with more complex hierarchical data. We, therefore, propose\nto generalize the well-known random forests to hyperbolic space. We do this by\nredefining the notion of a split using horospheres. Since finding the globally\noptimal split is computationally intractable, we find candidate horospheres\nthrough a large-margin classifier. To make hyperbolic random forests work on\nmulti-class data and imbalanced experiments, we furthermore outline a new\nmethod for combining classes based on their lowest common ancestor and a\nclass-balanced version of the large-margin loss. Experiments on standard and\nnew benchmarks show that our approach outperforms both conventional random\nforest algorithms and recent hyperbolic classifiers.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:01:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Doorenbos","Lars",""],["M\u00e1rquez-Neila","Pablo",""],["Sznitman","Raphael",""],["Mettes","Pascal",""]]}
{"id":"2308.13280","submitter":"Christian Lessig","authors":"Christian Lessig, Ilaria Luise, Bing Gong, Michael Langguth, Scarlet\n  Stadler, Martin Schultz","title":"AtmoRep: A stochastic model of atmosphere dynamics using large scale\n  representation learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.AI cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The atmosphere affects humans in a multitude of ways, from loss of life due\nto adverse weather effects to long-term social and economic impacts on\nsocieties. Computer simulations of atmospheric dynamics are, therefore, of\ngreat importance for the well-being of our and future generations. Here, we\npropose AtmoRep, a novel, task-independent stochastic computer model of\natmospheric dynamics that can provide skillful results for a wide range of\napplications. AtmoRep uses large-scale representation learning from artificial\nintelligence to determine a general description of the highly complex,\nstochastic dynamics of the atmosphere from the best available estimate of the\nsystem's historical trajectory as constrained by observations. This is enabled\nby a novel self-supervised learning objective and a unique ensemble that\nsamples from the stochastic model with a variability informed by the one in the\nhistorical record. The task-independent nature of AtmoRep enables skillful\nresults for a diverse set of applications without specifically training for\nthem and we demonstrate this for nowcasting, temporal interpolation, model\ncorrection, and counterfactuals. We also show that AtmoRep can be improved with\nadditional data, for example radar observations, and that it can be extended to\ntasks such as downscaling. Our work establishes that large-scale neural\nnetworks can provide skillful, task-independent models of atmospheric dynamics.\nWith this, they provide a novel means to make the large record of atmospheric\nobservations accessible for applications and for scientific inquiry,\ncomplementing existing simulations based on first principles.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:02:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lessig","Christian",""],["Luise","Ilaria",""],["Gong","Bing",""],["Langguth","Michael",""],["Stadler","Scarlet",""],["Schultz","Martin",""]]}
{"id":"2308.13281","submitter":"Maciej Ber\\k{e}sewicz","authors":"Maciej Ber\\k{e}sewicz and Marcin Szymkowiak","title":"A note on joint calibration estimators for totals and quantiles","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we combine calibration for population totals proposed by\nDeville and S\\\"arndal (1992) with calibration for population quantiles\nintroduced by Harms and Duchesne (2006). We also extend the pseudo-empirical\nlikelihood method proposed by Chen, Sitter, and Wu (2002). This approach\nextends the calibration equations for totals by adding relevant constraints on\nquantiles of continuous variables observed in the data. The proposed approach\ncan be easily applied to handle non-response and data integration problems, and\nresults in a single vector of weights. Furthermore, it is a multipurpose\nsolution, i.e. it makes it possible to improve estimates of means, totals and\nquantiles for a variable of interest in one step. In a limited simulation\nstudy, we compare the proposed joint approach with standard calibration,\ncalibration using empirical likelihood and the correctly specified inverse\nprobability weighting estimator. Open source software implementing the proposed\nmethod is available.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:04:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ber\u0119sewicz","Maciej",""],["Szymkowiak","Marcin",""]]}
{"id":"2308.13282","submitter":"Yuning Jiang","authors":"Xinliang Dai and Junyi Zhai and Yuning Jiang and Colin N. Jones and\n  Veit Hagenmeyer","title":"Distributed AC Optimal Power Flow for Generic Integrated\n  Transmission-Distribution Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Coordination of transmission and distribution power systems is increasingly\ncritical in the context of the ongoing energy transition. However, traditional\ncentralized energy management faces challenges related to privacy and/or\nsovereignty concerns, leading to growing research interests in distributed\napproaches. Nevertheless, solving distributed AC optimal power flow (OPF)\nproblems encounters difficulties due to their nonlinearity and nonconvexity,\nmaking it challenging for state-of-the-art distributed approaches. To solve\nthis issue, the present paper focuses on investigating the distributed AC OPF\nproblem of generic integrated transmission-distribution (ITD) systems,\nconsidering complex grid topology, by employing a new variant of the Augmented\nLagrangian based Alternating Direction Inexact Newton method (ALADIN). In\ncontrast to the standard ALADIN, we introduce a second-order correction into\nALADIN to enhance its numerical robustness and properly convexify distribution\nsubproblems within the ALADIN framework for computing efficiency. Moreover, a\nrigorous proof shows that the locally quadratic convergence rate can be\npreserved for solving the resulting distributed nonconvex problems. Extensive\nnumerical simulations with varying problem sizes and grid topologies\ndemonstrate the effectiveness of the proposed algorithm, outperforming\nstate-of-the-art approaches in terms of numerical robustness, convergence\nspeed, and scalability.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:09:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dai","Xinliang",""],["Zhai","Junyi",""],["Jiang","Yuning",""],["Jones","Colin N.",""],["Hagenmeyer","Veit",""]]}
{"id":"2308.13283","submitter":"Stergios Amarantidis","authors":"Stergios Amarantidis, Jose Afonso, Israel Matute, Duncan Farrah, A. M.\n  Hopkins, Hugo Messias, Ciro Pappalardo, N. Seymour","title":"Tracing obscured galaxy build-up at high redshift using deep radio\n  surveys","comments":"16 pages, 8 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A fundamental question of extra-galactic astronomy that is yet to be fully\nunderstood, concerns the evolution of the star formation rate (SFR) and\nsupermassive black hole (SMBH) activity with cosmic time, as well as their\ninterplay and how it impacts galaxy evolution. A primary focus that could shed\nmore light on these questions is the study of merging systems, comprising\nhighly star-forming galaxies (SFGs) and active galactic nuclei (AGN) at the\nearliest stages of galactic formation. However, it is essential to explore\ncomplementary selection methods across multiple wavelengths. The primary\nobjective of this study is to conduct a comprehensive analysis of a sample of\nhigh-redshift ($z>3$) far-infrared (far-IR) and radio-emitting galaxies in the\nhighest possible spatial resolution. In order to select the galactic population\nof our interest, we selected galaxies that present relatively compact radio\nmorphologies at 1.4 GHz as well as a far-IR spectrum that peaks in flux at\n$\\lambda \\geq 350 \\, \\mu m$. For these selection criteria, we used the COSMOS\nand ECDF-S fields, which provide high spectral and spatial resolution at a\nmulti-wavelength scale. We derived a sample of eight galaxies that were\nidentified either photometrically or spectroscopically at $z>3$ from literature\nstudies and by our team. A thorough investigation of available optical,\nnear-IR, and millimetre (mm) imaging reveals a possible merging scenario in\nfive out of eight cases in our sample. Additionally, available multi-wavelength\nphotometry strongly suggests active star formation at the $10^3 \\,\nM_{\\odot}/yr$ level in massive systems co-hosting an active SMBH. Comparison of\nthese results with previous studies, suggests that our selection method\npreferentially identifies galaxies hosting an active SMBH, as well as a strong\nSFG component, resulting in high SFR and IR luminosity.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:09:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Amarantidis","Stergios",""],["Afonso","Jose",""],["Matute","Israel",""],["Farrah","Duncan",""],["Hopkins","A. M.",""],["Messias","Hugo",""],["Pappalardo","Ciro",""],["Seymour","N.",""]]}
{"id":"2308.13284","submitter":"Waleed Aziz","authors":"Aween Karim, Azad Amen and Waleed Aziz","title":"Integrability of a Family of Lotka--Volterra Three Species Biological\n  System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this study is to analyze the integrability problem of\nLotka--Volterra three species biological system. The system which considered in\nthis work is a biological plausibility or a chemical model. The system has a\ncomplex dynamical behavior because it is chaotic system. We, first show that\nthe system is a complete integrable when two of the involved parameters in the\nsystem are zero. Second, thorough invariant algebraic surfaces and exponential\nfactors, the nonintegrability problems have been investigated. Particularly, we\nshow the non-existence of polynomial, rational, formal series, and Darboux\nfirst integrals when parameters are strictly positive.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:11:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Karim","Aween",""],["Amen","Azad",""],["Aziz","Waleed",""]]}
{"id":"2308.13285","submitter":"Chen Li","authors":"Chen Li, Hao Cai and XianYang Jiang","title":"Refine Neutrino Events Reconstruction with BEiT-3","comments":"11 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE hep-ex hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neutrino Events Reconstruction has always been crucial for IceCube Neutrino\nObservatory. In the Kaggle competition \"IceCube -- Neutrinos in Deep Ice\", many\nsolutions use Transformer. We present ISeeCube, a pure Transformer model based\non torchscale (the backbone of BEiT-3). Our model has the potential to reach\nstate-of-the-art. By using torchscale, the lines of code drop sharply by about\n80% and a lot of new methods can be tested by simply adjusting configs. Also, a\nrelatively primitive loss function Mean Squared Error (MSE) can work really\nwell. Since the model is simple enough, it also has the potential to be used\nfor more purposes such as energy reconstruction, and many new methods such as\ncombining it with GraphNeT can be tested more easily. The code and pretrained\nmodels are available at https://github.com/ChenLi2049/ISeeCube\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:21:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Chen",""],["Cai","Hao",""],["Jiang","XianYang",""]]}
{"id":"2308.13286","submitter":"Haibo Jin","authors":"Haibo Jin, Haoxuan Che, Hao Chen","title":"Unsupervised Domain Adaptation for Anatomical Landmark Detection","comments":"Accepted to MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, anatomical landmark detection has achieved great progresses on\nsingle-domain data, which usually assumes training and test sets are from the\nsame domain. However, such an assumption is not always true in practice, which\ncan cause significant performance drop due to domain shift. To tackle this\nproblem, we propose a novel framework for anatomical landmark detection under\nthe setting of unsupervised domain adaptation (UDA), which aims to transfer the\nknowledge from labeled source domain to unlabeled target domain. The framework\nleverages self-training and domain adversarial learning to address the domain\ngap during adaptation. Specifically, a self-training strategy is proposed to\nselect reliable landmark-level pseudo-labels of target domain data with dynamic\nthresholds, which makes the adaptation more effective. Furthermore, a domain\nadversarial learning module is designed to handle the unaligned data\ndistributions of two domains by learning domain-invariant features via\nadversarial training. Our experiments on cephalometric and lung landmark\ndetection show the effectiveness of the method, which reduces the domain gap by\na large margin and outperforms other UDA methods consistently. The code is\navailable at https://github.com/jhb86253817/UDA_Med_Landmark.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:22:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jin","Haibo",""],["Che","Haoxuan",""],["Chen","Hao",""]]}
{"id":"2308.13287","submitter":"Lina Guo","authors":"Lina Guo, Yuanyuan Wang, Tongda Xu, Jixiang Luo, Dailan He, Zhenjun\n  Ji, Shanshan Wang, Yang Wang, Hongwei Qin","title":"Efficient Learned Lossless JPEG Recompression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  JPEG is one of the most popular image compression methods. It is beneficial\nto compress those existing JPEG files without introducing additional\ndistortion. In this paper, we propose a deep learning based method to further\ncompress JPEG images losslessly. Specifically, we propose a Multi-Level\nParallel Conditional Modeling (ML-PCM) architecture, which enables parallel\ndecoding in different granularities. First, luma and chroma are processed\nindependently to allow parallel coding. Second, we propose pipeline parallel\ncontext model (PPCM) and compressed checkerboard context model (CCCM) for the\neffective conditional modeling and efficient decoding within luma and chroma\ncomponents. Our method has much lower latency while achieves better compression\nratio compared with previous SOTA. After proper software optimization, we can\nobtain a good throughput of 57 FPS for 1080P images on NVIDIA T4 GPU.\nFurthermore, combined with quantization, our approach can also act as a lossy\nJPEG codec which has obvious advantage over SOTA lossy compression methods in\nhigh bit rate (bpp$>0.9$).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:23:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Guo","Lina",""],["Wang","Yuanyuan",""],["Xu","Tongda",""],["Luo","Jixiang",""],["He","Dailan",""],["Ji","Zhenjun",""],["Wang","Shanshan",""],["Wang","Yang",""],["Qin","Hongwei",""]]}
{"id":"2308.13288","submitter":"Maru\\v{s}a Brada\\v{c}","authors":"Maru\\v{s}a Brada\\v{c}, Victoria Strait, Lamiya Mowla, Kartheik G.\n  Iyer, Ga\\\"el Noirot, Chris Willott, Gabe Brammer, Roberto Abraham, Yoshihisa\n  Asada, Guillaume Desprez, Vince Estrada-Carpenter, Anishya Harshan, Nicholas\n  S. Martis, Jasleen Matharu, Adam Muzzin, Gregor Rihtar\\v{s}i\\v{c}, Ghassan T.\n  E. Sarrouh, and Marcin Sawicki","title":"Star Formation at the Epoch of Reionization with CANUCS: The ages of\n  stellar populations in MACS1149-JD1","comments":"This is the version of the article before peer review or editing, as\n  submitted by an author to ApJLetters","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present measurements of stellar populations properties of a z = 9.1\ngravitationally lensed galaxy MACS1149-JD1 using deep JWST NIRISS slitless\nspectroscopy as well as NIRISS and NIRCam imaging from the CAnadian NIRISS\nUnbiased Cluster Survey (CANUCS). The galaxy is split into four components.\nThree magnified (${\\mu}$ ~ 17) star-forming components are unresolved, giving\nintrinsic sizes of < 50pc. In addition, the underlying extended component\ncontains the bulk of the stellar mass, formed the majority of its stars ~ 50Myr\nearlier than the other three components and is not the site of the most active\nstar formation currently. The NIRISS and NIRCam resolved photometry does not\nconfirm a strong Balmer break previously seen in Spitzer. The NIRISS grism\nspectrum has been extracted for the entire galaxy and shows a clear continuum\nand Lyman-break, with no Lyman-${\\alpha}$ detected.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:25:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Brada\u010d","Maru\u0161a",""],["Strait","Victoria",""],["Mowla","Lamiya",""],["Iyer","Kartheik G.",""],["Noirot","Ga\u00ebl",""],["Willott","Chris",""],["Brammer","Gabe",""],["Abraham","Roberto",""],["Asada","Yoshihisa",""],["Desprez","Guillaume",""],["Estrada-Carpenter","Vince",""],["Harshan","Anishya",""],["Martis","Nicholas S.",""],["Matharu","Jasleen",""],["Muzzin","Adam",""],["Rihtar\u0161i\u010d","Gregor",""],["Sarrouh","Ghassan T. E.",""],["Sawicki","Marcin",""]]}
{"id":"2308.13289","submitter":"Sascha Frey","authors":"Sascha Frey, Kang Li, Peer Nagy, Silvia Sapora, Chris Lu, Stefan\n  Zohren, Jakob Foerster and Anisoara Calinescu","title":"JAX-LOB: A GPU-Accelerated limit order book simulator to unlock large\n  scale reinforcement learning for trading","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR cs.AI cs.CE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Financial exchanges across the world use limit order books (LOBs) to process\norders and match trades. For research purposes it is important to have large\nscale efficient simulators of LOB dynamics. LOB simulators have previously been\nimplemented in the context of agent-based models (ABMs), reinforcement learning\n(RL) environments, and generative models, processing order flows from\nhistorical data sets and hand-crafted agents alike. For many applications,\nthere is a requirement for processing multiple books, either for the\ncalibration of ABMs or for the training of RL agents. We showcase the first\nGPU-enabled LOB simulator designed to process thousands of books in parallel,\nwith a notably reduced per-message processing time. The implementation of our\nsimulator - JAX-LOB - is based on design choices that aim to best exploit the\npowers of JAX without compromising on the realism of LOB-related mechanisms. We\nintegrate JAX-LOB with other JAX packages, to provide an example of how one may\naddress an optimal execution problem with reinforcement learning, and to share\nsome preliminary results from end-to-end RL training on GPUs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:26:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Frey","Sascha",""],["Li","Kang",""],["Nagy","Peer",""],["Sapora","Silvia",""],["Lu","Chris",""],["Zohren","Stefan",""],["Foerster","Jakob",""],["Calinescu","Anisoara",""]]}
{"id":"2308.13290","submitter":"J\\k{e}drzej Garnek PhD","authors":"J\\k{e}drzej Garnek","title":"$p$-group Galois covers of curves in characteristic $p$ II","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $k$ be an algebraically closed field of characteristic $p > 0$ and let\n$G$ be a finite $p$-group. The results of Harbater, Katz and Gabber associate a\n$G$-cover of the projective line ramified only over $\\infty$ to every\n$k$-linear action of $G$ on $k[[t]]$. In this paper we relate the HKG-covers to\nthe classical problem of determining the equivariant structure of cohomologies\nof a curve with an action of a $p$-group. To this end, we present a new way of\ncomputing cohomologies of HKG-covers. As an application of our results, we\ncompute the equivariant structure of the de~Rham cohomology of Klein four\ncovers in characteristic~$2$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:33:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Garnek","J\u0119drzej",""]]}
{"id":"2308.13291","submitter":"Gabriele Bressanini","authors":"Gabriele Bressanini, Hyukjoon Kwon and M.S. Kim","title":"Gaussian boson sampling at finite temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gaussian boson sampling (GBS) is a promising candidate for an experimental\ndemonstration of quantum advantage using photons. However, sufficiently large\nnoise might hinder a GBS implementation from entering the regime where quantum\nspeedup is achievable. Here, we investigate how thermal noise affects the\nclassical intractability of generic quantum optical sampling experiments, GBS\nbeing a particular instance of the latter. We do so by establishing sufficient\nconditions for an efficient simulation to be feasible, expressed in the form of\ninequalities between the relevant parameters that characterize the system and\nits imperfections. We demonstrate that the addition of thermal noise has the\neffect of tightening the constraints on the remaining noise parameters,\nrequired to show quantum advantage. Furthermore, we show that there exist a\nthreshold temperature at which any quantum sampling experiment becomes\nclassically simulable, and provide an intuitive physical interpretation by\nrelating this occurrence with the disappearance of the quantum state's\nnon-classical properties.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:33:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bressanini","Gabriele",""],["Kwon","Hyukjoon",""],["Kim","M. S.",""]]}
{"id":"2308.13292","submitter":"Andy Gray","authors":"Andy Gray, Alma Rahat, Tom Crick, and Stephen Lindsay","title":"A Bayesian Active Learning Approach to Comparative Judgement","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Assessment is a crucial part of education. Traditional marking is a source of\ninconsistencies and unconscious bias, placing a high cognitive load on the\nassessors. An approach to address these issues is comparative judgement (CJ).\nIn CJ, the assessor is presented with a pair of items and is asked to select\nthe better one. Following a series of comparisons, a rank is derived using a\nranking model, for example, the BTM, based on the results. While CJ is\nconsidered a reliable method for marking, there are concerns around\ntransparency, and the ideal number of pairwise comparisons to generate a\nreliable estimation of the rank order is not known. Additionally, there have\nbeen attempts to generate a method of selecting pairs that should be compared\nnext in an informative manner, but some existing methods are known to have\ncreated their own bias within results inflating the reliability metric used. As\na result, a random selection approach is usually deployed.\n  We propose a novel Bayesian approach to CJ (BCJ) for determining the ranks of\ncompared items alongside a new way to select the pairs to present to the\nmarker(s) using active learning (AL), addressing the key shortcomings of\ntraditional CJ. Furthermore, we demonstrate how the entire approach may provide\ntransparency by providing the user insights into how it is making its decisions\nand, at the same time, being more efficient. Results from our experiments\nconfirm that the proposed BCJ combined with entropy-driven AL pair-selection\nmethod is superior to other alternatives. We also find that the more\ncomparisons done, the more accurate BCJ becomes, which solves the issue the\ncurrent method has of the model deteriorating if too many comparisons are\nperformed. As our approach can generate the complete predicted rank\ndistribution for an item, we also show how this can be utilised in devising a\npredicted grade, guided by the assessor.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:33:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gray","Andy",""],["Rahat","Alma",""],["Crick","Tom",""],["Lindsay","Stephen",""]]}
{"id":"2308.13293","submitter":"Adam Balcerzak","authors":"Adam Balcerzak, Tomasz Denkiewicz, Mateusz Lisaj","title":"Are we survivors of the sudden past singularity?","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we investigate the viability of cosmological models featuring\na type II singularity that occurs during the past evolution of the Universe. We\nconstruct a scenario in which the singularity arises and then constrain the\nmodel parameters using observational data from Type Ia Supernovae, Cosmic\nChronometers, and Gamma Ray Bursts. We find that the resulting cosmological\nmodels based on scenarios with the past type II singularity cannot be excluded\nby kinematical tests using current observations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:34:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Balcerzak","Adam",""],["Denkiewicz","Tomasz",""],["Lisaj","Mateusz",""]]}
{"id":"2308.13294","submitter":"Piotr Bialas","authors":"Piotr Bialas, Piotr Korcyl, Tomasz Stebel","title":"Training normalizing flows with computationally intensive target\n  probability distributions","comments":"15 pages, 5 figures, 4 tables, 3 listings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cond-mat.stat-mech hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning techniques, in particular the so-called normalizing flows,\nare becoming increasingly popular in the context of Monte Carlo simulations as\nthey can effectively approximate target probability distributions. In the case\nof lattice field theories (LFT) the target distribution is given by the\nexponential of the action. The common loss function's gradient estimator based\non the \"reparametrization trick\" requires the calculation of the derivative of\nthe action with respect to the fields. This can present a significant\ncomputational cost for complicated, non-local actions like e.g. fermionic\naction in QCD. In this contribution, we propose an estimator for normalizing\nflows based on the REINFORCE algorithm that avoids this issue. We apply it to\ntwo dimensional Schwinger model with Wilson fermions at criticality and show\nthat it is up to ten times faster in terms of the wall-clock time as well as\nrequiring up to $30\\%$ less memory than the reparameterization trick estimator.\nIt is also more numerically stable allowing for single precision calculations\nand the use of half-float tensor cores. We present an in-depth analysis of the\norigins of those improvements. We believe that these benefits will appear also\noutside the realm of the LFT, in each case where the target probability\ndistribution is computationally intensive.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:40:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bialas","Piotr",""],["Korcyl","Piotr",""],["Stebel","Tomasz",""]]}
{"id":"2308.13295","submitter":"Xinchao Jiang","authors":"Xinchao Jiang, Xin Wang, Ziming Wen, Hu Wang","title":"Resolution-independent generative models based on operator learning for\n  physics-constrained Bayesian inverse problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Bayesian inference approach is widely used to tackle inverse problems due\nto its versatile and natural ability to handle ill-posedness. However, it often\nfaces challenges when dealing with situations involving continuous fields or\nlarge-resolution discrete representations (high-dimensional). Moreover, the\nprior distribution of unknown parameters is commonly difficult to be\ndetermined. In this study, an Operator Learning-based Generative Adversarial\nNetwork (OL-GAN) is proposed and integrated into the Bayesian inference\nframework to handle these issues. Unlike most Bayesian approaches, the\ndistinctive characteristic of the proposed method is to learn the joint\ndistribution of parameters and responses. By leveraging the trained generative\nmodel, the posteriors of the unknown parameters can theoretically be\napproximated by any sampling algorithm (e.g., Markov Chain Monte Carlo, MCMC)\nin a low-dimensional latent space shared by the components of the joint\ndistribution. The latent space is typically a simple and easy-to-sample\ndistribution (e.g., Gaussian, uniform), which significantly reduces the\ncomputational cost associated with the Bayesian inference while avoiding prior\nselection concerns. Furthermore, incorporating operator learning enables\nresolution-independent in the generator. Predictions can be obtained at desired\ncoordinates, and inversions can be performed even if the observation data are\nmisaligned with the training data. Finally, the effectiveness of the proposed\nmethod is validated through several numerical experiments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:41:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jiang","Xinchao",""],["Wang","Xin",""],["Wen","Ziming",""],["Wang","Hu",""]]}
{"id":"2308.13296","submitter":"Ghazal Kalhor","authors":"Ghazal Kalhor, Hannah Gardner, Ingmar Weber, Ridhi Kashyap","title":"Gender Gaps in Online Social Connectivity, Promotion and Relocation\n  Reports on LinkedIn","comments":"Accepted and forthcoming at the International AAAI Conference on Web\n  and Social Media (ICWSM) 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Online professional social networking platforms provide opportunities to\nexpand networks strategically for job opportunities and career advancement. A\nlarge body of research shows that women's offline networks are less\nadvantageous than men's. How online platforms such as LinkedIn may reflect or\nreproduce gendered networking behaviours, or how online social connectivity may\naffect outcomes differentially by gender is not well understood. This paper\nanalyses aggregate, anonymised data from almost 10 million LinkedIn users in\nthe UK and US information technology (IT) sector collected from the site's\nadvertising platform to explore how being connected to Big Tech companies\n('social connectivity') varies by gender, and how gender, age, seniority and\nsocial connectivity shape the propensity to report job promotions or\nrelocations. Consistent with previous studies, we find there are fewer women\ncompared to men on LinkedIn in IT. Furthermore, female users are less likely to\nbe connected to Big Tech companies than men. However, when we further analyse\nrecent promotion or relocation reports, we find women are more likely than men\nto have reported a recent promotion at work, suggesting high-achieving women\nmay be self-selecting onto LinkedIn. Even among this positively selected group,\nthough, we find men are more likely to report a recent relocation. Social\nconnectivity emerges as a significant predictor of promotion and relocation\nreports, with an interaction effect between gender and social connectivity\nindicating the payoffs to social connectivity for promotion and relocation\nreports are larger for women. This suggests that online networking has the\npotential for larger impacts for women, who experience greater disadvantage in\ntraditional networking contexts, and calls for further research to understand\ndifferential impacts of online networking for socially disadvantaged groups.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:43:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kalhor","Ghazal",""],["Gardner","Hannah",""],["Weber","Ingmar",""],["Kashyap","Ridhi",""]]}
{"id":"2308.13297","submitter":"Damir Ferizovi\\'c","authors":"Damir Ferizovi\\'c","title":"Uniform distribution via lattices: from point sets to sequences","comments":"20 pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work we construct many sequences $S=S^\\Box_{b,d}$, or\n$S=S^\\boxplus_{b,d}$ in the $d$--dimensional unit hypercube, which for $d=1$\nare (generalized) van der Corput sequences or Niederreiter's $(0,1)$-sequences\nin base $b$ respectively. Further, we introduce the notion of $f$-sublinearity\nand use it to define discrepancy functions which subsume the notion of\n$L^p$-discrepancy, Wasserstein $p$-distance, and many more methods to compare\nempirical measures to an underlying base measure.\n  We will relate bounds for a given discrepancy functions $\\mathscr{D}$ of the\nmultiset of projected lattice sets $P(b^{-m}\\mathbb{Z}^d$), to bounds of\n$\\mathscr{D}(Z_N)$, i.e. the initial segments of the sequence $Z=P(S)$ for any\n$N\\in\\mathbb{N}$. We show that this relation holds in any dimension $d$, for\nany map $P$ defined on a hypercube, and any discrepancy function as introduced\nin this work for which bounds on $P(b^{-m}\\mathbb{Z}^d+v$) can be obtained.\n  We apply this theorem in $d=1$ to obtain bounds for the $L^p$--discrepancy of\nvan der Corput and Niederreiter (0,1) sequences in terms of digit sums for all\n$0<p\\leq \\infty$. In $d=2$ an application of our construction yields many\nsequences on the two-sphere, such that the initial segments $Z_N$ have low\n$L^\\infty$--discrepancy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:44:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ferizovi\u0107","Damir",""]]}
{"id":"2308.13298","submitter":"Yuning Jiang","authors":"Jiali Wang and Yuning Jiang and Xin Liu and Ting Wang and Yuanming Shi","title":"Federated Linear Bandit Learning via Over-the-Air Computation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP stat.ML","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we investigate federated contextual linear bandit learning\nwithin a wireless system that comprises a server and multiple devices. Each\ndevice interacts with the environment, selects an action based on the received\nreward, and sends model updates to the server. The primary objective is to\nminimize cumulative regret across all devices within a finite time horizon. To\nreduce the communication overhead, devices communicate with the server via\nover-the-air computation (AirComp) over noisy fading channels, where the\nchannel noise may distort the signals. In this context, we propose a customized\nfederated linear bandits scheme, where each device transmits an analog signal,\nand the server receives a superposition of these signals distorted by channel\nnoise. A rigorous mathematical analysis is conducted to determine the regret\nbound of the proposed scheme. Both theoretical analysis and numerical\nexperiments demonstrate the competitive performance of our proposed scheme in\nterms of regret bounds in various settings.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:47:37 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 04:21:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Jiali",""],["Jiang","Yuning",""],["Liu","Xin",""],["Wang","Ting",""],["Shi","Yuanming",""]]}
{"id":"2308.13299","submitter":"Berend van Wachem","authors":"Berend van Wachem, Hani Elmestikawy, Victor Ch\\'eron","title":"Microstructure-based prediction of hydrodynamic forces in stationary\n  particle assemblies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the work, we derive novel hydrodynamic force models to describe the\ninteraction of a flow with particles in an assembly when only an averaged\nresolution of the flow is available. These force models are able to predict the\naverage drag on the particle assembly, as well as the deviations from the\naverage drag force and the lift force for each individual particle in the\nassembly. To achieve this, PR-DNS of various particle assemblies and flow\nregimes are carried out, varying the particle volume fraction up to 0.6, and\nthe mean particle flow Reynolds number up to 300. To characterize the structure\nof the particles in the assembly, a Voronoi tessellation is carried out, and a\nnumber of scalars, vectors and tensors are defined based upon this\ntessellation. The microstructure informed hydrodynamic force models are based\non symbolic regressions of these quantities derived from the Voronoi\ntessellation, the global particle volume fraction of the particle assembly and\nthe flow regime represented by the Reynolds number, and the forces on the\nindividual particles in the assembly.\n  The resulting hydrodynamic force models are single expressions can be\ndirectly employed in a Lagrangian particle tracking (LPT) or computational\nfluid dynamics/discrete element model (CFD/DEM) framework. By comparing the\nresults of the newly proposed hydrodynamic force models with an averaged force\nmodel, as is usually adopted in Lagrangian particle tracking simulations, we\nshow that a significant increase in accuracy can be achieved, without\nsignificantly increasing the cost of the simulation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:50:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["van Wachem","Berend",""],["Elmestikawy","Hani",""],["Ch\u00e9ron","Victor",""]]}
{"id":"2308.13300","submitter":"Shen Ren","authors":"Shen Ren, Haosen Shi","title":"Learning Compact Neural Networks with Deep Overparameterised Multitask\n  Learning","comments":"Accepted for IJCAI2023 workshop, 1st International Workshop on\n  Generalizing from Limited Resources in the Open World","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Compact neural network offers many benefits for real-world applications.\nHowever, it is usually challenging to train the compact neural networks with\nsmall parameter sizes and low computational costs to achieve the same or better\nmodel performance compared to more complex and powerful architecture. This is\nparticularly true for multitask learning, with different tasks competing for\nresources. We present a simple, efficient and effective multitask learning\noverparameterisation neural network design by overparameterising the model\narchitecture in training and sharing the overparameterised model parameters\nmore effectively across tasks, for better optimisation and generalisation.\nExperiments on two challenging multitask datasets (NYUv2 and COCO) demonstrate\nthe effectiveness of the proposed method across various convolutional networks\nand parameter sizes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:51:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ren","Shen",""],["Shi","Haosen",""]]}
{"id":"2308.13301","submitter":"Songhua Li","authors":"Songhua Li and Lingjie Duan","title":"On Incentivizing Social Information Sharing in Routing Games","comments":"38 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a new incentive problem of social information sharing for\nlocation-based services (e.g., Waze and Yelp). The problem aims to crowdsource\na mass of mobile users to learn massive point-of-interest (PoI) information\nwhile traveling and share it with each other as a public good. Given that\ncrowdsourced users mind their own travel costs and possess various preferences\nover the PoI information along different paths, we formulate the problem as a\nnon-atomic routing game with positive network externalities. We first show by\nprice of anarchy (PoA) analysis that, in the absence of any incentive design,\nusers' selfish routing on the path with the lowest cost will limit information\ndiversity and lead to an arbitrarily large efficiency loss from the social\noptimum. This motivates us to explore effective incentive mechanisms to remedy\nwhile upholding individual rationality, incentive compatibility, and budget\nbalance to ensure practical feasibility. We start by presenting an adaptive\ninformation restriction (AIR) mechanism that dynamically customizes restriction\nfractions, depending on the real user flows along different paths, to govern\nusers' access to the shared PoI aggregation. We show that AIR achieves a PoA of\n0.25 for homogeneous users (of identical PoI preferences over paths) and 0.125\nfor heterogeneous users in a typical network of two parallel paths. Further, we\npropose a side-payment mechanism (ASP) that adaptively charges or rewards users\nalong certain paths. With those charges and rewards well-tailored, ASP\nsignificantly improves the PoA to 1 (optimal) and 0.5 for homogeneous and\nheterogeneous users in the two-path network, respectively. For a generalized\nnetwork of multiple parallel paths, we further advance ASP to be able to\nguarantee a PoA of 0.5. Additionally, our theoretical results are well\ncorroborated by our numerical findings.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:52:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Songhua",""],["Duan","Lingjie",""]]}
{"id":"2308.13302","submitter":"Dominic Bowman","authors":"Dominic M. Bowman, Jennifer van Saders, Jorick S. Vink","title":"The Structure and Evolution of Stars: Introductory Remarks","comments":"Accepted for publication to Galaxies. Introductory chapter to Special\n  Issue:\n  https://www.mdpi.com/journal/galaxies/special_issues/star_structure_evolution","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this introductory chapter of the Special Issue entitled `The Structure and\nEvolution of Stars', we highlight the recent major progress made in our\nunderstanding in the physics that governs stellar interiors. In so doing, we\ncombine insight from observations, 1D evolutionary modelling and 2+3D rotating\n(magneto)hydrodynamical simulations. Therefore, a complete and compelling\npicture of the necessary ingredients in state-of-the-art stellar structure\ntheory and areas in which improvements still need to be made are\ncontextualised. Additionally, the over-arching perspective that links all the\nthemes of subsequent chapters is presented.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:53:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bowman","Dominic M.",""],["van Saders","Jennifer",""],["Vink","Jorick S.",""]]}
{"id":"2308.13303","submitter":"Songhua Li","authors":"Songhua Li and Lingjie Duan","title":"Age of Information Diffusion on Social Networks: Optimizing Multi-Stage\n  Seeding Strategies","comments":"A long abstract of this work will appear at MobiHoc 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DM cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To promote viral marketing, major social platforms (e.g., Facebook\nMarketplace and Pinduoduo) repeatedly select and invite different users (as\nseeds) in online social networks to share fresh information about a product or\nservice with their friends. Thereby, we are motivated to optimize a multi-stage\nseeding process of viral marketing in social networks and adopt the recent\nnotions of the peak and the average age of information (AoI) to measure the\ntimeliness of promotion information received by network users. Our problem is\ndifferent from the literature on information diffusion in social networks,\nwhich limits to one-time seeding and overlooks AoI dynamics or information\nreplacement over time. As a critical step, we manage to develop closed-form\nexpressions that characterize and trace AoI dynamics over any social network.\nFor the peak AoI problem, we first prove the NP-hardness of our multi-stage\nseeding problem by a highly non-straightforward reduction from the dominating\nset problem, and then present a new polynomial-time algorithm that achieves\ngood approximation guarantees (e.g., less than 2 for linear network topology).\nTo minimize the average AoI, we also prove that our problem is NP-hard by\nproperly reducing it from the set cover problem. Benefiting from our two-side\nbound analysis on the average AoI objective, we build up a new framework for\napproximation analysis and link our problem to a much simplified sum-distance\nminimization problem. This intriguing connection inspires us to develop another\npolynomial-time algorithm that achieves a good approximation guarantee.\nAdditionally, our theoretical results are well corroborated by experiments on a\nreal social network.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 10:54:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Songhua",""],["Duan","Lingjie",""]]}
{"id":"2308.13304","submitter":"Benjamin Schreiber","authors":"B. A. Schreiber, J. Denholm, F. Jaeckle, M. J. Arends, K. M. Branson,\n  C.-B. Sch\\\"onlieb, E. J. Soilleux","title":"Bang and the Artefacts are Gone! Rapid Artefact Removal and Tissue\n  Segmentation in Haematoxylin and Eosin Stained Biopsies","comments":"4 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present H&E Otsu thresholding, a scheme for rapidly detecting tissue in\nwhole-slide images (WSIs) that eliminates a wide range of undesirable artefacts\nsuch as pen marks and scanning artefacts. Our method involves obtaining a\nbid-modal representation of a low-magnification RGB overview image which\nenables simple Otsu thresholding to separate tissue from background and\nartefacts. We demonstrate our method on WSIs prepared from a wide range of\ninstitutions and WSI digital scanners, each containing substantial artefacts\nthat cause other methods to fail. The beauty of our approach lies in its\nsimplicity: manipulating RGB colour space and using Otsu thresholding allows\nfor the rapid removal of artefacts and segmentation of tissue.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:04:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Schreiber","B. A.",""],["Denholm","J.",""],["Jaeckle","F.",""],["Arends","M. J.",""],["Branson","K. M.",""],["Sch\u00f6nlieb","C. -B.",""],["Soilleux","E. J.",""]]}
{"id":"2308.13305","submitter":"Xiuwei Chen","authors":"Xiuwei Chen, Xiaobin Chang","title":"Dynamic Residual Classifier for Class Incremental Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rehearsal strategy is widely used to alleviate the catastrophic\nforgetting problem in class incremental learning (CIL) by preserving limited\nexemplars from previous tasks. With imbalanced sample numbers between old and\nnew classes, the classifier learning can be biased. Existing CIL methods\nexploit the long-tailed (LT) recognition techniques, e.g., the adjusted losses\nand the data re-sampling methods, to handle the data imbalance issue within\neach increment task. In this work, the dynamic nature of data imbalance in CIL\nis shown and a novel Dynamic Residual Classifier (DRC) is proposed to handle\nthis challenging scenario. Specifically, DRC is built upon a recent advance\nresidual classifier with the branch layer merging to handle the model-growing\nproblem. Moreover, DRC is compatible with different CIL pipelines and\nsubstantially improves them. Combining DRC with the model adaptation and fusion\n(MAF) pipeline, this method achieves state-of-the-art results on both the\nconventional CIL and the LT-CIL benchmarks. Extensive experiments are also\nconducted for a detailed analysis. The code is publicly available.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:07:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Xiuwei",""],["Chang","Xiaobin",""]]}
{"id":"2308.13306","submitter":"Christoph Laaber","authors":"Christoph Laaber, Tao Yue, Shaukat Ali, Thomas Schwitalla, Jan F.\n  Nyg{\\aa}rd","title":"Challenges of Testing an Evolving Cancer Registration Support System in\n  Practice","comments":"5 pages, 1 figure; accepted to the industry forum at the 45th\n  IEEE/ACM International Conference on Software Engineering (ICSE '23)","journal-ref":null,"doi":"10.1109/ICSE-Companion58688.2023.00102","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cancer Registry of Norway (CRN) is a public body responsible for\ncapturing and curating cancer patient data histories to provide a unified\naccess to research data and statistics for doctors, patients, and policymakers.\nFor this purpose, CRN develops and operates a complex, constantly-evolving, and\nsocio-technical software system. Recently, machine learning (ML) algorithms\nhave been introduced into this system to augment the manual decisions made by\nhumans with automated decision support from learned models. To ensure that the\nsystem is correct and robust and cancer patients' data are properly handled and\ndo not violate privacy concerns, automated testing solutions are being\ndeveloped. In this paper, we share the challenges that we identified when\ndeveloping automated testing solutions at CRN. Such testing potentially impacts\nthe quality of cancer data for years to come, which is also used by the\nsystem's stakeholders to make critical decisions. The challenges identified are\nnot specific to CRN but are also valid in the context of other healthcare\nregistries. We also provide some details on initial solutions that we are\ninvestigating to solve the identified challenges.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:09:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Laaber","Christoph",""],["Yue","Tao",""],["Ali","Shaukat",""],["Schwitalla","Thomas",""],["Nyg\u00e5rd","Jan F.",""]]}
{"id":"2308.13307","submitter":"Doreen Jirak","authors":"Jasmin Bernotat, Doreen Jirak, Eduardo Benitez Sandoval, Francisco\n  Cruz, Alessandra Sciutti","title":"Asch Meets HRI: Human Conformity to Robot Groups","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a research outline that aims at investigating group dynamics and\npeer pressure in the context of industrial robots. Our research plan was\nmotivated by the fact that industrial robots became already an integral part of\nhuman-robot co-working. However, industrial robots have been sparsely\nintegrated into research on robot credibility, group dynamics, and potential\nusers' tendency to follow a robot's indication. Therefore, we aim to transfer\nthe classic Asch experiment (see \\cite{Asch_51}) into HRI with industrial\nrobots. More precisely, we will test to what extent participants follow a\nrobot's response when confronted with a group (vs. individual) industrial robot\narms (vs. human) peers who give a false response. We are interested in\nhighlighting the effects of group size, perceived robot credibility,\npsychological stress, and peer pressure in the context of industrial robots.\nWith the results of this research, we hope to highlight group dynamics that\nmight underlie HRI in industrial settings in which numerous robots already work\nclosely together with humans in shared environments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:14:24 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Bernotat","Jasmin",""],["Jirak","Doreen",""],["Sandoval","Eduardo Benitez",""],["Cruz","Francisco",""],["Sciutti","Alessandra",""]]}
{"id":"2308.13308","submitter":"Panayiotis Stavrinos","authors":"Christos Savvopoulos and Panayiotis Stavrinos","title":"Anisotropic Conformal Dark Gravity on the Lorentz Tangent Bundle\n  Spacetime","comments":"22 pages, 3 figures","journal-ref":"Physical Review D 108, 044048 (2023)","doi":"10.1103/PhysRevD.108.044048","report-no":null,"categories":"gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work we investigate the anisotropic conformal structure of the\ngravitational field incorporating dark gravity in a generalized Lagrange\ngeometric framework on the Lorentz tangent bundle and we present two\napplications; the anisotropic conformal Minkowski spacetime and the anisotropic\nconformal FLRW cosmology. In the first application, the conformal factor\ninduces an anisotropic conformal de-Sitter-like space with extra curvature\nwhich causes extra gravity and allows for Sasaki-type Finsler-like structures\nwhich could potentially describe certain gravitational phenomena in a more\nextended form. The cosmological properties of the model are also studied using\na FLRW metric structure for the underlying base manifold in the second\napplication, where we derive generalized Friedmann-like equations for the\nhorizontal subspace of the Lorentz tangent bundle spacetime that reduce under\ncertain conditions to those given by A. Triantafyllopoulos and P. C. Stavrinos\n(2018) [Class. Quantum Grav. 35 085011] as well as those of general relativity.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:15:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Savvopoulos","Christos",""],["Stavrinos","Panayiotis",""]]}
{"id":"2308.13309","submitter":"Rahul Datta","authors":"Rahul Datta, Michael K. Brewer, Jullianna Denes Couto, Joseph Eimer,\n  Yunyang Li, Zhilei Xu, Aamir Ali, John W. Appel, Charles L. Bennett, Ricardo\n  Bustos, David T. Chuss, Joseph Cleary, Sumit Dahal, Francisco Espinoza,\n  Thomas Essinger-Hileman, Pedro Flux\\'a, Kathleen Harrington, Kyle Helson,\n  Jeffrey Iuliano, John Karakla, Tobias A. Marriage, Sasha Novack, Carolina\n  N\\'u\\~nez, Ivan L. Padilla, Lucas Parker, Matthew A. Petroff, Rodrigo Reeves,\n  Karwan Rostem, Rui Shi, Deniz A. N. Valle, Duncan J. Watts, Janet L. Weiland,\n  Edward J. Wollack, Lingzhen Zeng","title":"Cosmology Large Angular Scale Surveyor (CLASS): 90 GHz Telescope\n  Pointing, Beam Profile, Window Function, and Polarization Performance","comments":"24 pages, 18 figures, submitted to ApJS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cosmology Large Angular Scale Surveyor (CLASS) is a telescope array that\nobserves the cosmic microwave background (CMB) over ~75% of the sky from the\nAtacama Desert, Chile, at frequency bands centered near 40, 90, 150, and 220\nGHz. CLASS measures the large angular scale CMB polarization to constrain the\ntensor-to-scalar ratio and the optical depth to last scattering. This paper\npresents the optical characterization of the 90GHz telescope, which has been\nobserving since July 2018. Observations of the Moon establish the pointing\nwhile dedicated observations of Jupiter are used for beam calibration. The\nstandard deviations of the pointing error in azimuth, elevation, and boresight\nangle are 1.3, 2.1, and 2.0 arcminutes, respectively, over the first 3 years of\nobservations. This corresponds to a pointing uncertainty ~7% of the beam's full\nwidth at half maximum (FWHM). The effective azimuthally-symmetrized 1D beam\nestimated at 90 GHz from per detector intensity beam maps has a FWHM of\n0.614+/-0.003 deg and a solid angle of 136.3+/-0.6(stats.)+/-1.1(sys.) usr\nintegrated to a radius of 4 deg. The corresponding beam window function drops\nto b_ell^2 = 0.92, 0.70, 0.14 at ell = 30, 100, 300, respectively, with\nrelative uncertainties < 2% for ell < 200. Far-sidelobes are studied using\ndetector-centered intensity maps of the Moon and measured to be at a level of\n10^-3 or below relative to the peak. The polarization angle of Tau A estimated\nfrom preliminary survey maps is 149.6+/-0.2(stats.) deg in equatorial\ncoordinates consistent with prior measurements. Instrumental\ntemperature-to-polarization (T-to-P) leakage is measured at a 95% confidence\nupper limit of (1.7+/-0.1) x 10^-3 in single detector demodulated data using\nobservations of Jupiter and the Moon. Using pair-differenced demodulated data,\na 95% confidence upper limit of 3.6 x 10^-4 is obtained on the T-to-P leakage.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:16:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Datta","Rahul",""],["Brewer","Michael K.",""],["Couto","Jullianna Denes",""],["Eimer","Joseph",""],["Li","Yunyang",""],["Xu","Zhilei",""],["Ali","Aamir",""],["Appel","John W.",""],["Bennett","Charles L.",""],["Bustos","Ricardo",""],["Chuss","David T.",""],["Cleary","Joseph",""],["Dahal","Sumit",""],["Espinoza","Francisco",""],["Essinger-Hileman","Thomas",""],["Flux\u00e1","Pedro",""],["Harrington","Kathleen",""],["Helson","Kyle",""],["Iuliano","Jeffrey",""],["Karakla","John",""],["Marriage","Tobias A.",""],["Novack","Sasha",""],["N\u00fa\u00f1ez","Carolina",""],["Padilla","Ivan L.",""],["Parker","Lucas",""],["Petroff","Matthew A.",""],["Reeves","Rodrigo",""],["Rostem","Karwan",""],["Shi","Rui",""],["Valle","Deniz A. N.",""],["Watts","Duncan J.",""],["Weiland","Janet L.",""],["Wollack","Edward J.",""],["Zeng","Lingzhen",""]]}
{"id":"2308.13310","submitter":"Mario Damasso","authors":"M. Damasso, J. Rodrigues, A. Castro-Gonz\\'alez, B. Lavie, J. Davoult,\n  M. R. Zapatero Osorio, J. Dou, S. G. Sousa, J. E. Owen, P. Sossi, V.\n  Adibekyan, H. Osborn, Z. Leinhardt, Y. Alibert, C. Lovis, E. Delgado Mena, A.\n  Sozzetti, S. C. C. Barros, D. Bossini, C. Ziegler, D. R. Ciardi, E. C.\n  Matthews, P. J. Carter, J. Lillo-Box, A. Su\\'arez Mascare\\~no, S. Cristiani,\n  F. Pepe, R. Rebolo, N. C. Santos, C. Allende Prieto, S. Benatti, F. Bouchy,\n  C. Brice\\~no, P. Di Marcantonio, V. D'Odorico, X. Dumusque, J. A. Egger, D.\n  Ehrenreich, J. Faria, P. Figueira, R. G\\'enova Santos, E. J. Gonzales, J. I.\n  Gonz\\'alez Hern\\'andez, N. Law, G. Lo Curto, A. W. Mann, C. J. A. P. Martins,\n  A. Mehner, G. Micela, P. Molaro, N. J. Nunes, E. Palle, E. Poretti, J. E.\n  Schlieder, S. Udry","title":"A compact multi-planet system transiting HIP 29442 (TOI-469) discovered\n  by TESS and ESPRESSO. Radial velocities lead to the detection of transits\n  with low signal-to-noise ratio","comments":"Accepted for publication on A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We followed-up with ESPRESSO the K0V star HIP 29442 (TOI-469), already known\nto host a validated sub-Neptune companion TOI-469.01. We aim to verify the\nplanetary nature of TOI-469.01. We modelled radial velocity and photometric\ntime series to measure the dynamical mass, radius, and ephemeris, and to\ncharacterise the internal structure and composition of TOI-469.01. We confirmed\nthe planetary nature of TOI-469.01. Thanks to ESPRESSO we discovered two\nadditional close-in companions. We also detected their low signal-to-noise\ntransit signals in the TESS light curve. HIP 29442 is a compact multi-planet\nsystem, and the three planets have orbital periods $P_{\\rm orb,\nb}=13.63083\\pm0.00003$, $P_{\\rm orb, c}=3.53796\\pm0.00003$, and $P_{\\rm orb,\nd}=6.42975^{+0.00009}_{-0.00010}$ days, and we measured their masses with high\nprecision: $m_{\\rm p, b}=9.6\\pm0.8~M_{\\oplus}$, $m_{\\rm p,\nc}=4.5\\pm0.3~M_{\\oplus}$, and $m_{\\rm p, d}=5.1\\pm0.4~M_{\\oplus}$. We measured\nradii and bulk densities of all the planets (the 3$\\sigma$ confidence intervals\nare shown in parenthesis): $R_{\\rm p, b}=3.48^{+0.07 (+0.19)}_{-0.08 (-0.28)}\n~R_{\\oplus}$ and $\\rho_{\\rm p, b}=1.3\\pm0.2 (0.3) g~cm^{-3}$; $R_{\\rm p,\nc}=1.58^{+0.10 (+0.30)}_{-0.11 (-0.34)}~R_{\\oplus}$ and $\\rho_{\\rm p,\nc}=6.3^{+1.7 (+6.0)}_{-1.3 (-2.7)} g~cm^{-3}$; $R_{\\rm p,\nd}=1.37\\pm0.11^{(+0.32)}_{(-0.43)}~R_{\\oplus}$ and $\\rho_{\\rm p, d}=11.0^{+3.4\n(+21.0)}_{-2.4 (-6.3)} g~cm^{-3}$. We used the more conservative 3$\\sigma$\nconfidence intervals for the radii as input to the interior structure\nmodelling. We find that HIP 29442 $b$ appears as a typical sub-Neptune, likely\nsurrounded by a gas layer of pure H-He with a mass of $0.27^{+0.24}_{-0.17}\nM_{\\oplus}$ and a thickness of $1.4\\pm0.5 R_{\\oplus}$. For the innermost\ncompanions HIP 29442 $c$ HIP 29442 $d$, the model supports an Earth-like\ncomposition.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:22:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Damasso","M.",""],["Rodrigues","J.",""],["Castro-Gonz\u00e1lez","A.",""],["Lavie","B.",""],["Davoult","J.",""],["Osorio","M. R. Zapatero",""],["Dou","J.",""],["Sousa","S. G.",""],["Owen","J. E.",""],["Sossi","P.",""],["Adibekyan","V.",""],["Osborn","H.",""],["Leinhardt","Z.",""],["Alibert","Y.",""],["Lovis","C.",""],["Mena","E. Delgado",""],["Sozzetti","A.",""],["Barros","S. C. C.",""],["Bossini","D.",""],["Ziegler","C.",""],["Ciardi","D. R.",""],["Matthews","E. C.",""],["Carter","P. J.",""],["Lillo-Box","J.",""],["Mascare\u00f1o","A. Su\u00e1rez",""],["Cristiani","S.",""],["Pepe","F.",""],["Rebolo","R.",""],["Santos","N. C.",""],["Prieto","C. Allende",""],["Benatti","S.",""],["Bouchy","F.",""],["Brice\u00f1o","C.",""],["Di Marcantonio","P.",""],["D'Odorico","V.",""],["Dumusque","X.",""],["Egger","J. A.",""],["Ehrenreich","D.",""],["Faria","J.",""],["Figueira","P.",""],["Santos","R. G\u00e9nova",""],["Gonzales","E. J.",""],["Hern\u00e1ndez","J. I. Gonz\u00e1lez",""],["Law","N.",""],["Curto","G. Lo",""],["Mann","A. W.",""],["Martins","C. J. A. P.",""],["Mehner","A.",""],["Micela","G.",""],["Molaro","P.",""],["Nunes","N. J.",""],["Palle","E.",""],["Poretti","E.",""],["Schlieder","J. E.",""],["Udry","S.",""]]}
{"id":"2308.13311","submitter":"Francesco Sannino","authors":"Borut Bajc, Manuel Del Piano, Francesco Sannino","title":"UV finite GUT with SUSY Breaking","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide an example of an ultraviolet finite supersymmetric grand unified\ntheory of safe rather than free nature endowed with a supersymmetric dynamical\nbreaking mechanism. Our results simultaneously enlarge the number of\nultraviolet consistent supersymmetric grand unified theories while providing a\nrelevant example of how to achieve a consistent ultraviolet safe extension of\nthe Standard Model enjoying the benefits of grand unified theories.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:26:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bajc","Borut",""],["Del Piano","Manuel",""],["Sannino","Francesco",""]]}
{"id":"2308.13312","submitter":"Arunima Banerjee Dr.","authors":"K. Aditya, Arunima Banerjee, Peter Kamphuis, Aleksandr Mosenkov,\n  Dmitry Makarov, Sviatoslav Borisov","title":"\\HI{} 21cm observations and dynamical modelling of the thinnest galaxy:\n  FGC 2366","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Superthin galaxies are bulgeless low surface brightness galaxies with\nunusually high major-to-minor axes ratio of the stellar disc, i.e.,$10<a/b<20$.\nWe present Giant Metrewave Radio Telescope (GMRT) \\HI{} 21cm radio-synthesis\nobservations of FGC 2366, the thinnest galaxy known with $a/b=21.6$. Employing\nthe 3-D tilted-ring modelling using Fully Automated TiRiFiC (FAT), we determine\nthe structure and kinematics of the \\HI{} gas disc, obtaining an asymptotic\nrotational velocity equal to 100 \\kms and a total \\HI{} mass equal to 10$^9\nM_{\\odot}$. Using $z$-band stellar photometry, we obtain a central surface\nbrightness of 22.8 mag ${\\rm{arcsec}}^{-2}$, a disc scale length of 2.6 kpc,\nand a scaleheight of 260 pc. Next, we determine the dark matter density profile\nby constructing a mass model and find that an NFW dark matter halo best fits\nthe steeply-rising rotation curve. With the above mass inventory in place, we\nfinally construct the dynamical model of the stellar disc of FGC 2366 using the\nstellar dynamical code \"AGAMA\". To identify the key physical mechanisms\nresponsible for the superthin vertical structure, we carry out a Principal\nComponent Analysis of the data corresponding to all the relevant dynamical\nparameters and $a/b$ for a sample of superthin and extremely thin galaxies\nstudied so far. We note that the first two principal components explain 80$\\%$\nof the variation in the data, and the significant contribution is from the\ncompactness of the mass distribution, which is fundamentally responsible for\nthe existence of superthin stellar discs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:26:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Aditya","K.",""],["Banerjee","Arunima",""],["Kamphuis","Peter",""],["Mosenkov","Aleksandr",""],["Makarov","Dmitry",""],["Borisov","Sviatoslav",""]]}
{"id":"2308.13313","submitter":"Jie Cai","authors":"Jie Cai, Yinren Shou, Yixing Geng, Liqi Han, Xinlu Xu, Shuangchung\n  Wen, Baifei Shen, Jinqing Yu, Xueqing Yan","title":"Extremely powerful and frequency-tunable terahertz pulses from a\n  table-top laser-plasma wiggler","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The production of broadband, terawatt terahertz (THz) pulses has been\ndemonstrated by irradiating relativistic lasers on solid targets. However, the\ngeneration of extremely powerful, narrow-band, and frequency-tunable THz pulses\nremains a challenge. Here, we present a novel approach for such THz pulses, in\nwhich a plasma wiggler is elaborated by a table-top laser and a near-critical\ndensity plasma. In such a wiggler, the laser-accelerated electrons emit THz\nradiations with a period closely related to the plasma thickness. Theoretical\nmodel and numerical simulations predict a THz pulse with a laser-THz energy\nconversion over 2.0$\\%$, an ultra-strong field exceeding 80 GV/m, a divergence\nangle approximately 20$^\\circ$, and a center-frequency tunable from 4.4 to 1.5\nTHz, can be generated from a laser of 430 mJ. Furthermore, we demonstrate that\nthis method can work across a wide range of laser and plasma parameters,\noffering potential for future applications with extremely powerful THz pulse.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:32:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cai","Jie",""],["Shou","Yinren",""],["Geng","Yixing",""],["Han","Liqi",""],["Xu","Xinlu",""],["Wen","Shuangchung",""],["Shen","Baifei",""],["Yu","Jinqing",""],["Yan","Xueqing",""]]}
{"id":"2308.13314","submitter":"Paulo Jorge Silva Ferreira","authors":"Paulo J.S. Ferreira, Jo\\~ao Mendes Moreira, Jo\\~ao M.P. Cardoso","title":"A Study on Hyperparameters Configurations for an Efficient Human\n  Activity Recognition System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human Activity Recognition (HAR) has been a popular research field due to the\nwidespread of devices with sensors and computational power (e.g., smartphones\nand smartwatches). Applications for HAR systems have been extensively\nresearched in recent literature, mainly due to the benefits of improving\nquality of life in areas like health and fitness monitoring. However, since\npersons have different motion patterns when performing physical activities, a\nHAR system must adapt to user characteristics to maintain or improve accuracy.\nMobile devices, such as smartphones, used to implement HAR systems, have\nlimited resources (e.g., battery life). They also have difficulty adapting to\nthe device's constraints to work efficiently for long periods. In this work, we\npresent a kNN-based HAR system and an extensive study of the influence of\nhyperparameters (window size, overlap, distance function, and the value of k)\nand parameters (sampling frequency) on the system accuracy, energy consumption,\nand inference time. We also study how hyperparameter configurations affect the\nmodel's user and activity performance. Experimental results show that adapting\nthe hyperparameters makes it possible to adjust the system's behavior to the\nuser, the device, and the target service. These results motivate the\ndevelopment of a HAR system capable of automatically adapting the\nhyperparameters for the user, the device, and the service.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:35:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ferreira","Paulo J. S.",""],["Moreira","Jo\u00e3o Mendes",""],["Cardoso","Jo\u00e3o M. P.",""]]}
{"id":"2308.13315","submitter":"Harish Tayyar Madabushi PhD","authors":"Harish Tayyar Madabushi and Laurence Romain and Petar Milin and Dagmar\n  Divjak","title":"Construction Grammar and Language Models","comments":"Accepted for publication in The Cambridge Handbook of Construction\n  Grammar, edited by Mirjam Fried and Kiki Nikiforidou. To appear in 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recent progress in deep learning and natural language processing has given\nrise to powerful models that are primarily trained on a cloze-like task and\nshow some evidence of having access to substantial linguistic information,\nincluding some constructional knowledge. This groundbreaking discovery presents\nan exciting opportunity for a synergistic relationship between computational\nmethods and Construction Grammar research. In this chapter, we explore three\ndistinct approaches to the interplay between computational methods and\nConstruction Grammar: (i) computational methods for text analysis, (ii)\ncomputational Construction Grammar, and (iii) deep learning models, with a\nparticular focus on language models. We touch upon the first two approaches as\na contextual foundation for the use of computational methods before providing\nan accessible, yet comprehensive overview of deep learning models, which also\naddresses reservations construction grammarians may have. Additionally, we\ndelve into experiments that explore the emergence of constructionally relevant\ninformation within these models while also examining the aspects of\nConstruction Grammar that may pose challenges for these models. This chapter\naims to foster collaboration between researchers in the fields of natural\nlanguage processing and Construction Grammar. By doing so, we hope to pave the\nway for new insights and advancements in both these fields.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:37:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Madabushi","Harish Tayyar",""],["Romain","Laurence",""],["Milin","Petar",""],["Divjak","Dagmar",""]]}
{"id":"2308.13316","submitter":"Roberto Flammini Dr","authors":"Oreste De Luca, Igor A. Shvets, Sergey V. Eremeev, Ziya S. Aliev,\n  Marek Kopciuszynski, Alexey Barinov, Fabio Ronci, Stefano Colonna, Evgueni V.\n  Chulkov, Raffaele G. Agostino, Marco Papagno, Roberto Flammini","title":"Is the topological surface state floating on top of a thick lead layer?\n  The case of the Pb/Bi2Se3 interface","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.other","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The puzzling question about the floating of the topological surface state on\ntop of a thick Pb layer, has now possibly been answered. A study of the\ninterface made by Pb on Bi2Se3 for different temperature and adsorbate coverage\ncondition, allowed us to demonstrate that the evidence reported in the\nliterature can be related to the surface diffusion phenomenon exhibited by the\nPb atoms, which leaves the substrate partially uncovered. Comprehensive density\nfunctional theory calculations show that despite the specific arrangement of\nthe atoms at the interface, the topological surface state cannot float on top\nof the adlayer but rather tends to move inward within the substrate.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:39:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["De Luca","Oreste",""],["Shvets","Igor A.",""],["Eremeev","Sergey V.",""],["Aliev","Ziya S.",""],["Kopciuszynski","Marek",""],["Barinov","Alexey",""],["Ronci","Fabio",""],["Colonna","Stefano",""],["Chulkov","Evgueni V.",""],["Agostino","Raffaele G.",""],["Papagno","Marco",""],["Flammini","Roberto",""]]}
{"id":"2308.13317","submitter":"Aline Ioste Rodrigheri","authors":"Aline Ioste","title":"Transforming the Output of Generative Pre-trained Transformer: The\n  Influence of the PGI Framework on Attention Dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper presents a novel approach named Persona-Grouping-Intelligence\n(PGI), which has been crafted to tackle the challenges posed by GPT models when\napplied to real-world business issues. PGI leverages the inherent capabilities\nof the GPT model to comprehend intricate language structures and generate\nresponses that are contextually relevant. The experiment occurred in a business\nscenario where human intelligence was being underutilized due to less optimized\nbusiness processes. The primary objective of this approach is to leverage GPT\nmodels to reduce the workload on humans in tasks that are extensive,\nmonotonous, and repetitive. Instead, the focus is redirected toward\ndecision-making activities. Remarkably, the experiment yielded an accuracy rate\nof 93.81% in validating 4,000 responses generated by the model, underscoring\nthe effectiveness of the PGI strategies. Effectively addressing the issue of\nunderutilized human intelligence, this paradigm shift aligns business\nenvironments with dynamic machine intelligence, enabling them to navigate the\nintricacies of real-world challenges. This approach facilitates the practical\nutilization of these models to tackle actual problems. The methodology offers\nan opportunity to reshape the fundamental structure of business processes by\nseamlessly integrating human decision-making with adaptable machine\nintelligence. Consequently, this optimization enhances operational efficiency\nand elevates strategic decision-making across diverse business contexts.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:41:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ioste","Aline",""]]}
{"id":"2308.13318","submitter":"Elisa Maiettini","authors":"Shiva Hanifi, Elisa Maiettini, Maria Lombardi, Lorenzo Natale","title":"iCub Detecting Gazed Objects: A Pipeline Estimating Human Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores the role of eye gaze in human-robot interactions and\nproposes a novel system for detecting objects gazed by the human using solely\nvisual feedback. The system leverages on face detection, human attention\nprediction, and online object detection, and it allows the robot to perceive\nand interpret human gaze accurately, paving the way for establishing joint\nattention with human partners. Additionally, a novel dataset collected with the\nhumanoid robot iCub is introduced, comprising over 22,000 images from ten\nparticipants gazing at different annotated objects. This dataset serves as a\nbenchmark for evaluating the performance of the proposed pipeline. The paper\nalso includes an experimental analysis of the pipeline's effectiveness in a\nhuman-robot interaction setting, examining the performance of each component.\nFurthermore, the developed system is deployed on the humanoid robot iCub, and a\nsupplementary video showcases its functionality. The results demonstrate the\npotential of the proposed approach to enhance social awareness and\nresponsiveness in social robotics, as well as improve assistance and support in\ncollaborative scenarios, promoting efficient human-robot collaboration. The\ncode and the collected dataset will be released upon acceptance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:45:07 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hanifi","Shiva",""],["Maiettini","Elisa",""],["Lombardi","Maria",""],["Natale","Lorenzo",""]]}
{"id":"2308.13319","submitter":"Ming Yan","authors":"Ming Yan, Junjie Chen, Jie M. Zhang, Xuejie Cao, Chen Yang, Mark\n  Harman","title":"COCO: Testing Code Generation Systems via Concretized Instructions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Code generation systems have been extensively developed in recent years to\ngenerate source code based on natural language instructions. However, despite\ntheir advancements, these systems still face robustness issues where even\nslightly different instructions can result in significantly different code\nsemantics. Robustness is critical for code generation systems, as it can have\nsignificant impacts on software development, software quality, and trust in the\ngenerated code. Although existing testing techniques for general text-to-text\nsoftware can detect some robustness issues, they are limited in effectiveness\ndue to ignoring the characteristics of code generation systems. In this work,\nwe propose a novel technique COCO to test the robustness of code generation\nsystems. It exploits the usage scenario of code generation systems to make the\noriginal programming instruction more concrete by incorporating features known\nto be contained in the original code. A robust system should maintain code\nsemantics for the concretized instruction, and COCO detects robustness\ninconsistencies when it does not. We evaluated COCO on eight advanced code\ngeneration systems, including commercial tools such as Copilot and ChatGPT,\nusing two widely-used datasets. Our results demonstrate the effectiveness of\nCOCO in testing the robustness of code generation systems, outperforming two\ntechniques adopted from general text-to-text software testing by 466.66% and\n104.02%, respectively. Furthermore, concretized instructions generated by COCO\ncan help reduce robustness inconsistencies by 18.35% to 53.91% through\nfine-tuning.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:49:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yan","Ming",""],["Chen","Junjie",""],["Zhang","Jie M.",""],["Cao","Xuejie",""],["Yang","Chen",""],["Harman","Mark",""]]}
{"id":"2308.13320","submitter":"Jishnu Mukhoti","authors":"Jishnu Mukhoti, Yarin Gal, Philip H.S. Torr, Puneet K. Dokania","title":"Fine-tuning can cripple your foundation model; preserving features may\n  be the solution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pre-trained foundation models, owing primarily to their enormous capacity and\nexposure to vast amount of training data scraped from the internet, enjoy the\nadvantage of storing knowledge about plenty of real-world concepts. Such models\nare typically fine-tuned on downstream datasets to produce remarkable\nstate-of-the-art performances. While various fine-tuning methods have been\ndevised and are shown to be highly effective, we observe that a fine-tuned\nmodel's ability to recognize concepts on tasks $\\textit{different}$ from the\ndownstream one is reduced significantly compared to its pre-trained\ncounterpart. This is clearly undesirable as a huge amount of time and money\nwent into learning those very concepts in the first place. We call this\nundesirable phenomenon \"concept forgetting\" and via experiments show that most\nend-to-end fine-tuning approaches suffer heavily from this side effect. To this\nend, we also propose a rather simple fix to this problem by designing a method\ncalled LDIFS (short for $\\ell_2$ distance in feature space) that simply\npreserves the features of the original foundation model during fine-tuning. We\nshow that LDIFS significantly reduces concept forgetting without having\nnoticeable impact on the downstream task performance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:49:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mukhoti","Jishnu",""],["Gal","Yarin",""],["Torr","Philip H. S.",""],["Dokania","Puneet K.",""]]}
{"id":"2308.13321","submitter":"Racquel Fygenson","authors":"Racquel Fygenson, Steven Franconeri, Enrico Bertini","title":"The Arrangement of Marks Impacts Afforded Messages: Ordering,\n  Partitioning, Spacing, and Coloring in Bar Charts","comments":"9 pages, 6 figures, to appear at IEEE VIS 2023 and in TVCG.\n  respectively","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data visualizations present a massive number of potential messages to an\nobserver. One might notice that one group's average is larger than another's,\nor that a difference in values is smaller than a difference between two others,\nor any of a combinatorial explosion of other possibilities. The message that a\nviewer tends to notice--the message that a visualization 'affords'--is strongly\naffected by how values are arranged in a chart, e.g., how the values are\ncolored or positioned. Although understanding the mapping between a chart's\narrangement and what viewers tend to notice is critical for creating guidelines\nand recommendation systems, current empirical work is insufficient to lay out\nclear rules. We present a set of empirical evaluations of how different\nmessages--including ranking, grouping, and part-to-whole relationships--are\nafforded by variations in ordering, partitioning, spacing, and coloring of\nvalues, within the ubiquitous case study of bar graphs. In doing so, we\nintroduce a quantitative method that is easily scalable, reviewable, and\nreplicable, laying groundwork for further investigation of the effects of\narrangement on message affordances across other visualizations and tasks.\nPre-registration and all supplemental materials are available at\nhttps://osf.io/np3q7 and https://osf.io/bvy95 .\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:51:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fygenson","Racquel",""],["Franconeri","Steven",""],["Bertini","Enrico",""]]}
{"id":"2308.13322","submitter":"Caio Henrique Silva de Souza","authors":"Josnei Antonio Novacoski, Caio Henrique Silva de Souza","title":"Parametrizations of subsets of the space of valuations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we present different ways to parametrize subsets of the space\nof valuations on $K[x]$ extending a given valuation on $K$. We discuss the\nmethods using pseudo-Cauchy sequences and approximation types. The method\npresented here is slightly different than the ones in the literature and we\nbelieve that our approach is more accurate.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:52:54 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Novacoski","Josnei Antonio",""],["de Souza","Caio Henrique Silva",""]]}
{"id":"2308.13323","submitter":"Shuangjie Xu","authors":"Xuechao Chen, Shuangjie Xu, Xiaoyi Zou, Tongyi Cao, Dit-Yan Yeung, Lu\n  Fang","title":"SVQNet: Sparse Voxel-Adjacent Query Network for 4D Spatio-Temporal LiDAR\n  Semantic Segmentation","comments":"Received by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  LiDAR-based semantic perception tasks are critical yet challenging for\nautonomous driving. Due to the motion of objects and static/dynamic occlusion,\ntemporal information plays an essential role in reinforcing perception by\nenhancing and completing single-frame knowledge. Previous approaches either\ndirectly stack historical frames to the current frame or build a 4D\nspatio-temporal neighborhood using KNN, which duplicates computation and\nhinders realtime performance. Based on our observation that stacking all the\nhistorical points would damage performance due to a large amount of redundant\nand misleading information, we propose the Sparse Voxel-Adjacent Query Network\n(SVQNet) for 4D LiDAR semantic segmentation. To take full advantage of the\nhistorical frames high-efficiently, we shunt the historical points into two\ngroups with reference to the current points. One is the Voxel-Adjacent\nNeighborhood carrying local enhancing knowledge. The other is the Historical\nContext completing the global knowledge. Then we propose new modules to select\nand extract the instructive features from the two groups. Our SVQNet achieves\nstate-of-the-art performance in LiDAR semantic segmentation of the\nSemanticKITTI benchmark and the nuScenes dataset.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:53:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Xuechao",""],["Xu","Shuangjie",""],["Zou","Xiaoyi",""],["Cao","Tongyi",""],["Yeung","Dit-Yan",""],["Fang","Lu",""]]}
{"id":"2308.13324","submitter":"Yanyan Huang","authors":"Yanyan Huang, Weiqin Zhao, Shujun Wang, Yu Fu, Yuming Jiang, Lequan Yu","title":"ConSlide: Asynchronous Hierarchical Interaction Transformer with\n  Breakup-Reorganize Rehearsal for Continual Whole Slide Image Analysis","comments":"To be appeared in ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Whole slide image (WSI) analysis has become increasingly important in the\nmedical imaging community, enabling automated and objective diagnosis,\nprognosis, and therapeutic-response prediction. However, in clinical practice,\nthe ever-evolving environment hamper the utility of WSI analysis models. In\nthis paper, we propose the FIRST continual learning framework for WSI analysis,\nnamed ConSlide, to tackle the challenges of enormous image size, utilization of\nhierarchical structure, and catastrophic forgetting by progressive model\nupdating on multiple sequential datasets. Our framework contains three key\ncomponents. The Hierarchical Interaction Transformer (HIT) is proposed to model\nand utilize the hierarchical structural knowledge of WSI. The\nBreakup-Reorganize (BuRo) rehearsal method is developed for WSI data replay\nwith efficient region storing buffer and WSI reorganizing operation. The\nasynchronous updating mechanism is devised to encourage the network to learn\ngeneric and specific knowledge respectively during the replay stage, based on a\nnested cross-scale similarity learning (CSSL) module. We evaluated the proposed\nConSlide on four public WSI datasets from TCGA projects. It performs best over\nother state-of-the-art methods with a fair WSI-based continual learning setting\nand achieves a better trade-off of the overall performance and forgetting on\nprevious task\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:58:25 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Huang","Yanyan",""],["Zhao","Weiqin",""],["Wang","Shujun",""],["Fu","Yu",""],["Jiang","Yuming",""],["Yu","Lequan",""]]}
{"id":"2308.13325","submitter":"Grigori Olshanski","authors":"Grigori Olshanski and Nikita Safonkin","title":"Remarks on Yangian-type algebras and double Poisson brackets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math-ph math.MP math.QA math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This short note is an announcement of results. We continue the study of\nYangian-type algebras initiated in the paper arXiv:2208.04809. These algebras\nshare a number of properties of the Yangians of type A but are more massive. We\nrefine and substantially enlarge the construction of that paper. A direct link\nwith the class of linear double Poisson brackets on the free associative\nalgebras (Pichereau and Van de Weyer, arXiv:math/0701837) is also established.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:58:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Olshanski","Grigori",""],["Safonkin","Nikita",""]]}
{"id":"2308.13326","submitter":"Kopo Marvin Ramokapane","authors":"Kopo M. Ramokapane and Awais Rashid","title":"ExD: Explainable Deletion","comments":"16 pages, 3 figures, New Security Paradigms Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper focuses on a critical yet often overlooked aspect of data in\ndigital systems and services-deletion. Through a review of existing literature\nwe highlight the challenges that user face when attempting to delete data from\nsystems and services, the lack of transparency in how such requests are handled\nor processed and the lack of clear assurance that the data has been deleted. We\nhighlight that this not only impacts users' agency over their data but also\nposes issues with regards to compliance with fundamental legal rights such as\nthe right to be forgotten. We propose a new paradign-explainable deletion-to\nimprove users' agency and control over their data and enable systems to deliver\neffective assurance, transparency and compliance. We discuss the properties\nrequired of such explanations and their relevance and benefit for various\nindividuals and groups involved or having an interest in data deletion\nprocesses and implications. We discuss various design implications pertaining\nto explainable deletion and present a research agenda for the community.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 11:59:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ramokapane","Kopo M.",""],["Rashid","Awais",""]]}
{"id":"2308.13327","submitter":"Jaehyun So","authors":"Jaehyun So, Youngjoon Han","title":"3D Face Alignment Through Fusion of Head Pose Information and Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ability of humans to infer head poses from face shapes, and vice versa,\nindicates a strong correlation between the two. Accordingly, recent studies on\nface alignment have employed head pose information to predict facial landmarks\nin computer vision tasks. In this study, we propose a novel method that employs\nhead pose information to improve face alignment performance by fusing said\ninformation with the feature maps of a face alignment network, rather than\nsimply using it to initialize facial landmarks. Furthermore, the proposed\nnetwork structure performs robust face alignment through a dual-dimensional\nnetwork using multidimensional features represented by 2D feature maps and a 3D\nheatmap. For effective dense face alignment, we also propose a prediction\nmethod for facial geometric landmarks through training based on knowledge\ndistillation using predicted keypoints. We experimentally assessed the\ncorrelation between the predicted facial landmarks and head pose information,\nas well as variations in the accuracy of facial landmarks with respect to the\nquality of head pose information. In addition, we demonstrated the\neffectiveness of the proposed method through a competitive performance\ncomparison with state-of-the-art methods on the AFLW2000-3D, AFLW, and BIWI\ndatasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:01:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["So","Jaehyun",""],["Han","Youngjoon",""]]}
{"id":"2308.13328","submitter":"Konstantin Ushenin","authors":"Nikita Markov, Konstantin Ushenin, Yakov Bozhko, Olga Solovyova","title":"Compressor-Based Classification for Atrial Fibrillation Detection","comments":"This paper is sent for review at the IEEE conference, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Atrial fibrillation (AF) is one of the most common arrhythmias with\nchallenging public health implications. Automatic detection of AF episodes is\ntherefore one of the most important tasks in biomedical engineering. In this\npaper, we apply the recently introduced method of compressor-based text\nclassification to the task of AF detection (binary classification between heart\nrhythms). We investigate the normalised compression distance applied to\n$\\Delta$RR and RR-interval sequences, the configuration of the k-Nearest\nNeighbour classifier, and an optimal window length. We achieve good\nclassification results (avg. sensitivity = 97.1%, avg. specificity = 91.7%,\nbest sensitivity of 99.8%, best specificity of 97.6% with 5-fold\ncross-validation). Obtained performance is close to the best specialised AF\ndetection algorithms. Our results suggest that gzip classification, originally\nproposed for texts, is suitable for biomedical data and continuous stochastic\nsequences in general.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:02:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Markov","Nikita",""],["Ushenin","Konstantin",""],["Bozhko","Yakov",""],["Solovyova","Olga",""]]}
{"id":"2308.13329","submitter":"Satoshi Mishima","authors":"Toru Goto, Satoshi Mishima, Tetsuo Shindou","title":"Flavor physics in SU(5) GUT with a 45 scalar representation","comments":"28 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"KEK-TH-2543, KU-PH-036","categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a realistic SU(5) grand unified model, where a 45 representation of\nscalar fields is added to the Georgi-Glashow model in order to realize the\ngauge coupling unification and the masses and mixing of quarks and leptons. The\ngauge coupling unification together with constraints from proton decay implies\nmass splittings in scalar representations. We assume that an SU(2) triplet\ncomponent of the 45 scalar, which is called $S_3$ leptoquark, has a TeV-scale\nmass, and color-sextet and color-octet ones have masses of the order of $10^6$\nGeV. We calculate one-loop beta functions for Yukawa couplings in the model,\nand derive the low-energy values of the $S_3$ Yukawa couplings which are\nconsistent with the grand unification. We provide predictions for lepton-flavor\nviolation and lepton-flavor-universality violation induced by the $S_3$\nleptoquark, and find that current and future experiments have a chance to find\na footprint of our SU(5) model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:04:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Goto","Toru",""],["Mishima","Satoshi",""],["Shindou","Tetsuo",""]]}
{"id":"2308.13330","submitter":"Qu Luo","authors":"Qu Luo, Zilong Liu, Gaojie Chen and Pei Xiao","title":"Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sparse code multiple access (SCMA) is a promising technique for the enabling\nof massive connectivity in future machine-type communication networks, but it\nsuffers from a limited diversity order which is a bottleneck for significant\nimprovement of error performance. This paper aims for enhancing the signal\nspace diversity of sparse code multiple access (SCMA) by introducing quadrature\ncomponent delay to the transmitted codeword of a downlink SCMA system in\nRayleigh fading channels. Such a system is called SSD-SCMA throughout this\nwork. By looking into the average mutual information (AMI) and the pairwise\nerror probability (PEP) of the proposed SSD-SCMA, we develop novel codebooks by\nmaximizing the derived AMI lower bound and a modified minimum product distance\n(MMPD), respectively. The intrinsic asymptotic relationship between the AMI\nlower bound and proposed MMPD based codebook designs is revealed. Numerical\nresults show significant error performance improvement in the both uncoded and\ncoded SSD-SCMA systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:05:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Luo","Qu",""],["Liu","Zilong",""],["Chen","Gaojie",""],["Xiao","Pei",""]]}
{"id":"2308.13331","submitter":"Jan-Aike Term\\\"ohlen","authors":"Jan-Aike Term\\\"ohlen, Timo Bartels, Tim Fingscheidt","title":"A Re-Parameterized Vision Transformer (ReVT) for Domain-Generalized\n  Semantic Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The task of semantic segmentation requires a model to assign semantic labels\nto each pixel of an image. However, the performance of such models degrades\nwhen deployed in an unseen domain with different data distributions compared to\nthe training domain. We present a new augmentation-driven approach to domain\ngeneralization for semantic segmentation using a re-parameterized vision\ntransformer (ReVT) with weight averaging of multiple models after training. We\nevaluate our approach on several benchmark datasets and achieve\nstate-of-the-art mIoU performance of 47.3% (prior art: 46.3%) for small models\nand of 50.1% (prior art: 47.8%) for midsized models on commonly used benchmark\ndatasets. At the same time, our method requires fewer parameters and reaches a\nhigher frame rate than the best prior art. It is also easy to implement and,\nunlike network ensembles, does not add any computational complexity during\ninference.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:06:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Term\u00f6hlen","Jan-Aike",""],["Bartels","Timo",""],["Fingscheidt","Tim",""]]}
{"id":"2308.13332","submitter":"Guo-Feng Zhang Dr","authors":"Xiao Zheng, Ai-Ling Ji, Guo-Feng Zhang","title":"Stronger Reverse Uncertainty Relation for Multiple Incompatible\n  Observables","comments":"10 pages, 2 figures","journal-ref":"Phys. Scr. 98 (2023) 065113","doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Recently,D.Mondal et.al[Phys. Rev. A. 95, 052117(2017)]creatively introduce a\nnew interesting concept of reverse uncertainty relation which indicates that\none cannot only prepare quantum states with joint small uncertainty, but also\nwith joint great uncertainty for incompatible observables. However, the\nuncertainty upper bound they constructed cannot express the essence of this\nconcept well, i.e., the upper bound will go to infinity in some cases even for\nincompatible observables. Here, we construct a new reverse uncertainty relation\nand successfully fix this \"infinity\" problem. Also, it is found that the\nreverse uncertainty relation and the normal uncertainty relation are the same\nin essential, and they both can be unified by the same theoretical framework.\nMoreover, taking advantage of this unified framework, one can construct a\nreverse uncertainty relation for multiple observables with any tightness\nrequired. Meanwhile, the application of the new uncertainty relation in purity\ndetection is discussed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:07:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zheng","Xiao",""],["Ji","Ai-Ling",""],["Zhang","Guo-Feng",""]]}
{"id":"2308.13333","submitter":"Emmanuel Blazquez","authors":"Emmanuel Blazquez, Dario Izzo, Francesco Biscani, Roger Walker, Franco\n  Perez-Lissi","title":"Small Celestial Body Exploration with CubeSat Swarms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO astro-ph.EP astro-ph.IM cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents a large-scale simulation study investigating the\ndeployment and operation of distributed swarms of CubeSats for interplanetary\nmissions to small celestial bodies. Utilizing Taylor numerical integration and\nadvanced collision detection techniques, we explore the potential of large\nCubeSat swarms in capturing gravity signals and reconstructing the internal\nmass distribution of a small celestial body while minimizing risks and Delta V\nbudget. Our results offer insight into the applicability of this approach for\nfuture deep space exploration missions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:09:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Blazquez","Emmanuel",""],["Izzo","Dario",""],["Biscani","Francesco",""],["Walker","Roger",""],["Perez-Lissi","Franco",""]]}
{"id":"2308.13334","submitter":"Guo-Feng Zhang Dr","authors":"Jie Xu, Xiao Zheng, Ai-Ling Ji, Guo-Feng Zhang","title":"Dynamics Investigation of the quantum-control-assisted multipartite\n  uncertainty relation in Heisenberg model with Dzyaloshinski-Moriya\n  interaction","comments":"10 pages, 7 figures","journal-ref":"Phys. Scr. 98 (2023) 065106","doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Recently, Zheng constructs a quantum-control-assisted multipartite\nvariance-based uncertainty relation, which successfully extends the conditional\nuncertainty relation to the multipartite case [Annalen der physik, 533, 2100014\n(2021)]. We here investigate the dynamics of the new uncertainty relation in\nthe Heisenberg system with the Dzyaloshinski-Moriya interaction. It is found\nthat, different from entanglement, the mixedness of the system has an\ninteresting single-valued relationship with the tightness and lower bound of\nthe uncertainty relation. This single-valued relationship indicates that the\ntightness and lower bound of the uncertainty relation can be written as the\nfunctional form of the mixedness. Moreover, the single-valued relationship with\nthe mixedness is the common nature of conditional uncertainty relations, and\nhas no relationship with the form of the uncertainty relations. Also, the\ncomparison between the new conditional variance-based uncertainty relation and\nthe existing entropic one has been made.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:11:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xu","Jie",""],["Zheng","Xiao",""],["Ji","Ai-Ling",""],["Zhang","Guo-Feng",""]]}
{"id":"2308.13335","submitter":"Alessio Savini","authors":"Michelle Bucher and Alessio Savini","title":"Kernels in measurable cohomology for transitive actions","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.KT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a connected semisimple Lie group $G$, Monod has recently proved that\nthe measurable cohomology of the $G$-action $H^*_m(G \\curvearrowright G/P)$ on\nthe Furstenberg boundary $G/P$, where $P$ is a minimal parabolic subgroup, maps\nsurjectively on the measurable cohomology of $G$ through the evaluation on a\nfixed basepoint. Additionally, the kernel of this map depends entirely on the\ninvariant cohomology of a maximal split torus. In this paper we show a similar\nresult for a fixed subgroup $L<P$ such that the stabilizer of almost every pair\nof points in $G/L$ is compact. More precisely, we show that the cohomology of\nthe $G$-action $H^p_m(G \\curvearrowright G/L)$ maps surjectively onto\n$H^p_m(G)$ with a kernel isomorphic to $H^{p-1}_m(L)$. Examples of such groups\nare given either by any term of the derived series of the unipotent radical $N$\nof $P$ or by a maximal split torus $A$. We conclude the paper by computing\nexplicitly some cocycles on quotients of $\\mathrm{SL}(2,\\mathbb{K})$ for\n$\\mathbb{K}=\\mathbb{R}, \\mathbb{C}$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:12:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bucher","Michelle",""],["Savini","Alessio",""]]}
{"id":"2308.13336","submitter":"Jiyuan Shen","authors":"Chang Hu, Tingfei Li, Jiyuan Shen, Yongqun Xu","title":"An Explicit Expression of Generation Function for One-Loop Tensor\n  Reduction","comments":"50pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  This work introduces an explicit expression for the generation function for\nthe reduction of an $n$-gon to an $(n-k)$-gon. A novel recursive relation of\ngeneration function is formulated based on Feynman Parametrization in\nprojective space, involving a single ordinary differential equation. The\nexplicit formulation of generation functions provides crucial insights into the\ncomplex analytic structure inherent in loop amplitudes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:13:09 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 09:04:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Chang",""],["Li","Tingfei",""],["Shen","Jiyuan",""],["Xu","Yongqun",""]]}
{"id":"2308.13337","submitter":"Michele Masseroni","authors":"Michele Masseroni, Tingyu Qu, Takashi Taniguchi, Kenji Watanabe,\n  Thomas Ihn, and Klaus Ensslin","title":"Evidence of the Coulomb gap in the density of states of MoS$_2$","comments":"Data repository: https://doi.org/10.3929/ethz-b-000592153","journal-ref":"Phys. Rev. Research 5, 013113 (2023)","doi":"10.1103/PhysRevResearch.5.013113","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  $\\mathrm{MoS_2}$ is an emergent van der Waals material that shows promising\nprospects in semiconductor industry and optoelectronic applications. However,\nits electronic properties are not yet fully understood. In particular, the\nnature of the insulating state at low carrier density deserves further\ninvestigation, as it is important for fundamental research and applications. In\nthis study, we investigate the insulating state of a dual-gated exfoliated\nbilayer $\\mathrm{MoS_2}$ field-effect transistor by performing magnetotransport\nexperiments. We observe positive and non-saturating magnetoresistance, in a\nregime where only one band contributes to electron transport. At low electron\ndensity ($\\sim 1.4\\times 10^{12}~\\mathrm{cm^{-2}}$) and a perpendicular\nmagnetic field of 7 Tesla, the resistance exceeds by more than one order of\nmagnitude the zero field resistance and exponentially drops with increasing\ntemperature. We attribute this observation to strong electron localization.\nBoth temperature and magnetic field dependence can, at least qualitatively, be\ndescribed by the Efros-Shklovskii law, predicting the formation of a Coulomb\ngap in the density of states due to Coulomb interactions. However, the\nlocalization length obtained from fitting the temperature dependence exceeds by\nmore than one order of magnitude the one obtained from the magnetic field\ndependence. We attribute this discrepancy to the presence of a nearby metallic\ngate, which provides electrostatic screening and thus reduces long-range\nCoulomb interactions. The result of our study suggests that the insulating\nstate of $\\mathrm{MoS_2}$ originates from a combination of disorder-driven\nelectron localization and Coulomb interactions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:14:15 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 06:14:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Masseroni","Michele",""],["Qu","Tingyu",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Ihn","Thomas",""],["Ensslin","Klaus",""]]}
{"id":"2308.13338","submitter":"Kevish Napal","authors":"K. K. Napal, P. S. Piva, A. L. Gower","title":"Effective T-matrix of a cylinder filled with a random 2 dimensional\n  particulate","comments":"27 pages, 13 images","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When a wave, such as sound or light, scatters within a densely packed\nparticulate, it can be rescattered many times between the particles, which is\ncalled multiple scattering. Multiple scattering can be unavoidable when: trying\nto use sound waves to measure a dense particulate, such as a composite with\nreinforcing fibers. Here we solve from first principles multiple scattering of\nscalar waves, including acoustic, for any frequency from a set of 2D particles\nconfined in a circular area. This case has not been solved yet, and its\nsolution is important to perform numerical validation, as particles within a\ncylinder require only a finite number of particles to perform direct numerical\nsimulations. The method we use involves ensemble averaging over particle\nconfigurations, which leads us to deduce an effective T-matrix for the whole\ncylinder, which can be used to easily describe the scattering from any incident\nwave. In the specific case when the particles are monopole scatters, the\nexpression of this effective T-matrix simplifies and reduces to the T-matrix of\na homogeneous cylinder with an effective wavenumber $k_\\star$. To validate our\ntheoretical predictions we develop an efficient Monte Carlo method and conclude\nthat our theoretical predictions are highly accurate for a broad range of\nfrequencies.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:14:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Napal","K. K.",""],["Piva","P. S.",""],["Gower","A. L.",""]]}
{"id":"2308.13339","submitter":"Wee Teck Gan","authors":"Petar Bakic, Wee Teck Gan and Gordan Savin","title":"Similitude exceptional theta correspondences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.NT math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct and develop a similitude version of exceptional theta\ncorrespondences and show that the Howe duality theorem follows from that for\nthe \"isometry\" case. We also extend basic tools such as the seesaw identity\nassociated to seesaw dual pairs to the similitude setting.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:16:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bakic","Petar",""],["Gan","Wee Teck",""],["Savin","Gordan",""]]}
{"id":"2308.13340","submitter":"Xueling Feng","authors":"Yan Sun, Xueling Feng, Liyan Ma, Long Hu, Mark Nixon","title":"TriGait: Aligning and Fusing Skeleton and Silhouette Gait Data via a\n  Tri-Branch Network","comments":"Accepted by IJCB 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gait recognition is a promising biometric technology for identification due\nto its non-invasiveness and long-distance. However, external variations such as\nclothing changes and viewpoint differences pose significant challenges to gait\nrecognition. Silhouette-based methods preserve body shape but neglect internal\nstructure information, while skeleton-based methods preserve structure\ninformation but omit appearance. To fully exploit the complementary nature of\nthe two modalities, a novel triple branch gait recognition framework, TriGait,\nis proposed in this paper. It effectively integrates features from the skeleton\nand silhouette data in a hybrid fusion manner, including a two-stream network\nto extract static and motion features from appearance, a simple yet effective\nmodule named JSA-TC to capture dependencies between all joints, and a third\nbranch for cross-modal learning by aligning and fusing low-level features of\ntwo modalities. Experimental results demonstrate the superiority and\neffectiveness of TriGait for gait recognition. The proposed method achieves a\nmean rank-1 accuracy of 96.0% over all conditions on CASIA-B dataset and 94.3%\naccuracy for CL, significantly outperforming all the state-of-the-art methods.\nThe source code will be available at https://github.com/feng-xueling/TriGait/.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:19:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sun","Yan",""],["Feng","Xueling",""],["Ma","Liyan",""],["Hu","Long",""],["Nixon","Mark",""]]}
{"id":"2308.13341","submitter":"Elena Filandri","authors":"Alessia Nasoni, Elena Filandri, Luca Girlanda","title":"Relativistic constraints on 3N contact interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we analyze the relativistic corrections to the leading order\nthree-nucleon (3N) contact interactions. These boost corrections are derived\nfirst from the nonrelativistic reduction of covariant Lagrangians and later\nfrom the Poincar\\'e algebra constraints on nonrelativistic theories. We show\nthat in order to describe the 3N potential in reference frames other than the\ncenter-of-mass frame, the inclusion of five additional terms with fixed\ncoefficients is required. These terms will be relevant in systems with mass\nnumber A>3. How they will affect EFT calculations of binding energies and\nscattering observables in these systems should be investigated.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:21:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Nasoni","Alessia",""],["Filandri","Elena",""],["Girlanda","Luca",""]]}
{"id":"2308.13342","submitter":"Iain Moffatt","authors":"Criel Merino, Iain Moffatt and Steven Noble","title":"The critical group of a combinatorial map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the appearance of embeddings in the theory of chip firing and\nthe critical group of a graph, we introduce a version of the critical group (or\nsandpile group) for combinatorial maps, that is, for graphs embedded in\norientable surfaces. We provide several definitions of our critical group, by\napproaching it through analogues of the cycle-cocycle matrix, the Laplacian\nmatrix, and as the group of critical states of a chip firing game (or sandpile\nmodel) on the edges of a map.\n  Our group can be regarded as a perturbation of the classical critical group\nof its underlying graph by topological information, and it agrees with the\nclassical critical group in the plane case. Its cardinality is equal to the\nnumber of spanning quasi-trees in a connected map, just as the cardinality of\nthe classical critical group is equal to the number of spanning trees of a\nconnected graph.\n  Our approach exploits the properties of principally unimodular matrices and\nthe methods of delta-matroid theory.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:26:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Merino","Criel",""],["Moffatt","Iain",""],["Noble","Steven",""]]}
{"id":"2308.13343","submitter":"Mahendran N","authors":"Mahendran N","title":"Squeeze aggregated excitation network","comments":"8 pages, 5 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Convolutional neural networks have spatial representations which read\npatterns in the vision tasks. Squeeze and excitation links the channel wise\nrepresentations by explicitly modeling on channel level. Multi layer\nperceptrons learn global representations and in most of the models it is used\noften at the end after all convolutional layers to gather all the information\nlearned before classification. We propose a method of inducing the global\nrepresentations within channels to have better performance of the model. We\npropose SaEnet, Squeeze aggregated excitation network, for learning global\nchannelwise representation in between layers. The proposed module takes\nadvantage of passing important information after squeeze by having aggregated\nexcitation before regaining its shape. We also introduce a new idea of having a\nmultibranch linear(dense) layer in the network. This learns global\nrepresentations from the condensed information which enhances the\nrepresentational power of the network. The proposed module have undergone\nextensive experiments by using Imagenet and CIFAR100 datasets and compared with\nclosely related architectures. The analyzes results that proposed models\noutputs are comparable and in some cases better than existing state of the art\narchitectures.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:30:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["N","Mahendran",""]]}
{"id":"2308.13344","submitter":"Markus Holzmann","authors":"Jussi Behrndt, Markus Holzmann, Christian Stelzer","title":"Approximation of Dirac operators with $\\boldsymbol{\\delta}$-shell\n  potentials in the norm resolvent sense","comments":"58 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper the approximation of Dirac operators with general\n$\\delta$-shell potentials supported on $C^2$-curves in $\\mathbb{R}^2$ or\n$C^2$-surfaces in $\\mathbb{R}^3$, which may be bounded or unbounded, is\nstudied. It is shown under suitable conditions on the weight of the\n$\\delta$-interaction that a family of Dirac operators with regular, squeezed\npotentials converges in the norm resolvent sense to the Dirac operator with the\n$\\delta$-shell interaction.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:31:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Behrndt","Jussi",""],["Holzmann","Markus",""],["Stelzer","Christian",""]]}
{"id":"2308.13345","submitter":"Keqi Deng","authors":"Keqi Deng, Philip C. Woodland","title":"Decoupled Structure for Improved Adaptability of End-to-End Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although end-to-end (E2E) trainable automatic speech recognition (ASR) has\nshown great success by jointly learning acoustic and linguistic information, it\nstill suffers from the effect of domain shifts, thus limiting potential\napplications. The E2E ASR model implicitly learns an internal language model\n(LM) which characterises the training distribution of the source domain, and\nthe E2E trainable nature makes the internal LM difficult to adapt to the target\ndomain with text-only data To solve this problem, this paper proposes decoupled\nstructures for attention-based encoder-decoder (Decoupled-AED) and neural\ntransducer (Decoupled-Transducer) models, which can achieve flexible domain\nadaptation in both offline and online scenarios while maintaining robust\nintra-domain performance. To this end, the acoustic and linguistic parts of the\nE2E model decoder (or prediction network) are decoupled, making the linguistic\ncomponent (i.e. internal LM) replaceable. When encountering a domain shift, the\ninternal LM can be directly replaced during inference by a target-domain LM,\nwithout re-training or using domain-specific paired speech-text data.\nExperiments for E2E ASR models trained on the LibriSpeech-100h corpus showed\nthat the proposed decoupled structure gave 15.1% and 17.2% relative word error\nrate reductions on the TED-LIUM 2 and AESRC2020 corpora while still maintaining\nperformance on intra-domain data.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:31:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Deng","Keqi",""],["Woodland","Philip C.",""]]}
{"id":"2308.13346","submitter":"Sayar Karmakar","authors":"Kejin Wu and Sayar Karmakar","title":"GARHCX-NoVaS: A Model-free Approach to Incorporate Exogenous Variables","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we further explore the forecasting ability of a recently\nproposed normalizing and variance-stabilizing (NoVaS) transformation after\nwrapping exogenous variables. In practice, especially in the area of financial\neconometrics, extra knowledge such as fundamentals- and sentiments-based\ninformation could be beneficial to improve the prediction accuracy of market\nvolatility if they are incorporated into the forecasting process. In a\nclassical approach, people usually apply GARCHX-type methods to include the\nexogenous variables. Being a Model-free prediction method, NoVaS has been shown\nto be more accurate and stable than classical GARCH-type methods. We are\ninterested in whether the novel NoVaS method can also sustain its superiority\nafter exogenous covariates are taken into account. We provide the NoVaS\ntransformation based on GARCHX model and then claim the corresponding\nprediction procedure with exogenous variables existing. Also, simulation\nstudies verify that the NoVaS method still outperforms traditional methods,\nespecially for long-term time aggregated predictions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:35:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Kejin",""],["Karmakar","Sayar",""]]}
{"id":"2308.13347","submitter":"Stephen Serjeant","authors":"Stephen Serjeant, Tom J.L.C. Bakx","title":"Objects in JWST's mirrors are closer than they appear","comments":"Submitted (revised version); 4 pages, one figure","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The James Webb Space Telescope (JWST) has revealed extremely distant galaxies\nat unprecedentedly early cosmic epochs from its deep imaging using the\ntechnique of photometric redshift estimation, with its subsequent spectroscopy\nconfirming their redshifts unambiguously, demonstrating the ability of JWST to\nprobe the earliest galaxies, one of its major scientific goals. However, as\nlarger samples continue to be followed up spectroscopically, it has become\napparent that nearly all photometric redshifts at these epochs are biased high\nwith confidence >>99%, for as yet unclear reasons. Here we show that this is\nthe same statistical effect that was predicted in different contexts by Sir\nArthur Eddington in 1913, in that there exist more lower redshift galaxies to\nbe scattered upwards than the reverse. The bias depends on the shape of the\nintrinsic redshift distribution, but as an approximate heuristic, all\nultra-high photometric redshift estimates must be corrected downwards by up to\none standard deviation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:38:53 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Serjeant","Stephen",""],["Bakx","Tom J. L. C.",""]]}
{"id":"2308.13348","submitter":"Aleksey Fedorov","authors":"Sergey R. Usmanov, Gleb V. Salakhov, Anton A. Bozhedarov, Evgeniy O.\n  Kiktenko, Aleksey K. Fedorov","title":"Quantum and quantum-inspired optimization for an in-core fuel management\n  problem","comments":"8+3 pages, 4+2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Operation management of nuclear power plants consists of several\ncomputationally hard problems. Searching for an in-core fuel loading pattern is\namong them. The main challenge of this combinatorial optimization problem is\nthe exponential growth of the search space with a number of loading elements.\nHere we study a reloading problem in a Quadratic Unconstrained Binary\nOptimization (QUBO) form. Such a form allows us to apply various techniques,\nincluding quantum annealing, classical simulated annealing, and\nquantum-inspired algorithms in order to find fuel reloading patterns for\nseveral realistic configurations of nuclear reactors. We present the results of\nbenchmarking the in-core fuel management problem in the QUBO form using the\naforementioned computational techniques. This work demonstrates potential\napplications of quantum computers and quantum-inspired algorithms in the energy\nindustry.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:40:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Usmanov","Sergey R.",""],["Salakhov","Gleb V.",""],["Bozhedarov","Anton A.",""],["Kiktenko","Evgeniy O.",""],["Fedorov","Aleksey K.",""]]}
{"id":"2308.13349","submitter":"Joan Sola","authors":"Joan Sol\\`a Peracaula","title":"The dynamics of vacuum, gravity and matter: Implications on the\n  fundamental constants","comments":"25 pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The possibility that the vacuum energy density (VED), $\\rho_{\\rm vac}$, could\nbe time dependent in the expanding Universe is intuitively more reasonable than\njust a rigid cosmological constant for the entire cosmic history. The dynamics\nof $\\rho_{\\rm vac}=\\rho_{\\rm vac}(H)$ as a function of the Hubble rate, $H(t)$,\nmost likely contributes to alleviate cosmological problems and tensions, having\nalso implications on the so-called fundamental `constants' of Nature, which\nshould be slowly drifting with the cosmic expansion owing to the fluctuations\nof the quantum vacuum. This includes the gravitational `constant' $G$, but also\nthe gauge and Yukawa couplings as well as the particle masses themselves (both\nof dark matter and baryonic matter). The subtle exchange of energy involved is\nthe basis for the ``micro and macro connection''. Herein, I discuss not only\nthis connection as a possibility but show that it is in fact a generic\nprediction of QFT in cosmological spacetime which is fully compatible with\ngeneral covariance. This fact has not been pointed out until recently when an\nappropriate renormalization framework for the VED has been found which is free\nfrom the usual conundrums associated with the cosmological constant problem.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:43:11 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Peracaula","Joan Sol\u00e0",""]]}
{"id":"2308.13350","submitter":"Maico Felipe Silva Ribeiro","authors":"Maico Ribeiro, Ivan Santamaria and Thiago da Silva","title":"Some remarks about $\\rho$-regularity for real analytic maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we discuss the concept of $\\rho$-regularity of analytic map\ngerms and its close relationship with the existence of locally trivial smooth\nfibrations, known as the Milnor fibrations. The presence of a Thom regular\nstratification or the Milnor condition (b) at the origin, indicates the\ntransversality of the fibers of the map G with respect to the levels of a\nfunction $\\rho$, which guarantees $\\rho$-regularity. Consequently, both\nconditions are crucial for the presence of open book structures and the Milnor\nfibrations. The work aims to provide a comprehensive overview of the main\nresults concerning the existence of Thom regular stratifications and the Milnor\ncondition (b) for germs of analytic maps. It presents strategies and criteria\nto identify and ensure these regularity conditions and discusses situations\nwhere they may not be satisfied. The goal is to understand the presence and\nlimitations of these conditions in various contexts.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:46:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ribeiro","Maico",""],["Santamaria","Ivan",""],["da Silva","Thiago",""]]}
{"id":"2308.13351","submitter":"Huijie Zheng","authors":"Yong-Hong Yu, Rui-Zhi Zhang, Yue Xu, Xiu-Qi Chen, Huijie Zheng, Quan\n  Li, Ren-Bao Liu, Xin-Yu Pan, Dmitry Budker, and Gang-Qin Liu","title":"Optically Detected Magnetic Resonance of Nitrogen-Vacancy Centers in\n  Diamond under Weak Laser Excitation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As promising quantum sensors, nitrogen-vacancy (NV) centers in diamond have\nbeen widely used in frontier studies in condensed matter physics, material\nsciences, and life sciences. In practical applications, weak laser excitation\nis favorable as it reduces the side effects of laser irradiation, for example,\nphototoxicity and heating. Here we report a combined theoretical and\nexperimental study of optically detected magnetic resonance (ODMR) of NV-center\nensembles under weak 532-nm laser excitation. In this regime, both the width\nand splitting of ODMR spectra decrease with increasing laser power. This power\ndependence is reproduced with a model considering laser-induced charge\nneutralization of NV--N+ pairs in the diamond lattice. These results are\nimportant for understanding and designing NV-based quantum sensing in\nlight-sensitive applications.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:47:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yu","Yong-Hong",""],["Zhang","Rui-Zhi",""],["Xu","Yue",""],["Chen","Xiu-Qi",""],["Zheng","Huijie",""],["Li","Quan",""],["Liu","Ren-Bao",""],["Pan","Xin-Yu",""],["Budker","Dmitry",""],["Liu","Gang-Qin",""]]}
{"id":"2308.13352","submitter":"Lilach Goren Huber","authors":"Markus Ulmer, Jannik Zgraggen, and Lilach Goren Huber","title":"A Generic Machine Learning Framework for Fully-Unsupervised Anomaly\n  Detection with Contaminated Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Anomaly detection (AD) tasks have been solved using machine learning\nalgorithms in various domains and applications. The great majority of these\nalgorithms use normal data to train a residual-based model, and assign anomaly\nscores to unseen samples based on their dissimilarity with the learned normal\nregime. The underlying assumption of these approaches is that anomaly-free data\nis available for training. This is, however, often not the case in real-world\noperational settings, where the training data may be contaminated with a\ncertain fraction of abnormal samples. Training with contaminated data, in turn,\ninevitably leads to a deteriorated AD performance of the residual-based\nalgorithms.\n  In this paper we introduce a framework for a fully unsupervised refinement of\ncontaminated training data for AD tasks. The framework is generic and can be\napplied to any residual-based machine learning model. We demonstrate the\napplication of the framework to two public datasets of multivariate time series\nmachine data from different application fields. We show its clear superiority\nover the naive approach of training with contaminated data without refinement.\nMoreover, we compare it to the ideal, unrealistic reference in which\nanomaly-free data would be available for training. Since the approach exploits\ninformation from the anomalies, and not only from the normal regime, it is\ncomparable and often outperforms the ideal baseline as well.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:47:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ulmer","Markus",""],["Zgraggen","Jannik",""],["Huber","Lilach Goren",""]]}
{"id":"2308.13353","submitter":"Marko Kuzmanovi\\'c","authors":"Marko Kuzmanovi\\'c, Isak Bj\\\"orkman, John J. McCord, Shruti Dogra, and\n  Gheorghe Sorin Paraoanu","title":"High-fidelity robust qubit control by phase-modulated pulses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a set of robust and high-fidelity pulses that realize paradigmatic\noperations such as the transfer of the ground state population into the excited\nstate and arbitrary $X/Y$ rotations on the Bloch sphere. These pulses are based\non the phase modulation of the control field. We implement these operations on\na transmon qubit, demonstrating resilience against deviations in the drive\namplitude of more than $\\approx 20\\%$ and/or detuning from the qubit transition\nfrequency in the order of $10~\\mathrm{MHz}$. The concept and modulation scheme\nis straightforward to implement and it is compatible with other\nquantum-technology experimental platforms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:49:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kuzmanovi\u0107","Marko",""],["Bj\u00f6rkman","Isak",""],["McCord","John J.",""],["Dogra","Shruti",""],["Paraoanu","Gheorghe Sorin",""]]}
{"id":"2308.13354","submitter":"Jonathan Katzy","authors":"Jonathan Katzy and Maliheh Izadi and Arie van Deursen","title":"On the Impact of Language Selection for Training and Evaluating\n  Programming Language Models","comments":"Accepted to 2023 IEEE 23rd International Working Conference on Source\n  Code Analysis and Manipulation (SCAM), NIER track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.CL cs.LG cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent advancements in Transformer-based Language Models have\ndemonstrated significant potential in enhancing the multilingual capabilities\nof these models. The remarkable progress made in this domain not only applies\nto natural language tasks but also extends to the domain of programming\nlanguages. Despite the ability of these models to learn from multiple\nlanguages, evaluations typically focus on particular combinations of the same\nlanguages. In this study, we evaluate the similarity of programming languages\nby analyzing their representations using a CodeBERT-based model. Our\nexperiments reveal that token representation in languages such as C++, Python,\nand Java exhibit proximity to one another, whereas the same tokens in languages\nsuch as Mathematica and R display significant dissimilarity. Our findings\nsuggest that this phenomenon can potentially result in performance challenges\nwhen dealing with diverse languages. Thus, we recommend using our similarity\nmeasure to select a diverse set of programming languages when training and\nevaluating future models.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:57:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Katzy","Jonathan",""],["Izadi","Maliheh",""],["van Deursen","Arie",""]]}
{"id":"2308.13355","submitter":"Hai Dang","authors":"Hai Dang, Frederik Brudy, George Fitzmaurice, Fraser Anderson","title":"WorldSmith: Iterative and Expressive Prompting for World Building with a\n  Generative AI","comments":"User Interface Software and Technology 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Crafting a rich and unique environment is crucial for fictional\nworld-building, but can be difficult to achieve since illustrating a world from\nscratch requires time and significant skill. We investigate the use of recent\nmulti-modal image generation systems to enable users iteratively visualize and\nmodify elements of their fictional world using a combination of text input,\nsketching, and region-based filling. WorldSmith enables novice world builders\nto quickly visualize a fictional world with layered edits and hierarchical\ncompositions. Through a formative study (4 participants) and first-use study\n(13 participants) we demonstrate that WorldSmith offers more expressive\ninteractions with prompt-based models. With this work, we explore how creatives\ncan be empowered to leverage prompt-based generative AI as a tool in their\ncreative process, beyond current \"click-once\" prompting UI paradigms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:03:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dang","Hai",""],["Brudy","Frederik",""],["Fitzmaurice","George",""],["Anderson","Fraser",""]]}
{"id":"2308.13356","submitter":"Sheekar Banerjee","authors":"Sheekar Banerjee and Md. Kamrul Hasan Monir","title":"CEIMVEN: An Approach of Cutting Edge Implementation of Modified Versions\n  of EfficientNet (V1-V2) Architecture for Breast Cancer Detection and\n  Classification from Ultrasound Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Undoubtedly breast cancer identifies itself as one of the most widespread and\nterrifying cancers across the globe. Millions of women are getting affected\neach year from it. Breast cancer remains the major one for being the reason of\nlargest number of demise of women. In the recent time of research, Medical\nImage Computing and Processing has been playing a significant role for\ndetecting and classifying breast cancers from ultrasound images and mammograms,\nalong with the celestial touch of deep neural networks. In this research, we\nfocused mostly on our rigorous implementations and iterative result analysis of\ndifferent cutting-edge modified versions of EfficientNet architectures namely\nEfficientNet-V1 (b0-b7) and EfficientNet-V2 (b0-b3) with ultrasound image,\nnamed as CEIMVEN. We utilized transfer learning approach here for using the\npre-trained models of EfficientNet versions. We activated the hyper-parameter\ntuning procedures, added fully connected layers, discarded the unprecedented\noutliers and recorded the accuracy results from our custom modified\nEfficientNet architectures. Our deep learning model training approach was\nrelated to both identifying the cancer affected areas with region of interest\n(ROI) techniques and multiple classifications (benign, malignant and normal).\nThe approximate testing accuracies we got from the modified versions of\nEfficientNet-V1 (b0- 99.15%, b1- 98.58%, b2- 98.43%, b3- 98.01%, b4- 98.86%,\nb5- 97.72%, b6- 97.72%, b7- 98.72%) and EfficientNet-V2 (b0- 99.29%, b1-\n99.01%, b2- 98.72%, b3- 99.43%) are showing very bright future and strong\npotentials of deep learning approach for the successful detection and\nclassification of breast cancers from the ultrasound images at a very early\nstage.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:05:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Banerjee","Sheekar",""],["Monir","Md. Kamrul Hasan",""]]}
{"id":"2308.13357","submitter":"Francesca Tombari","authors":"Lucia Ferrari, Patrizio Frosini, Nicola Quercioli, Francesca Tombari","title":"A topological model for partial equivariance in deep learning and data\n  analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.AT","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this article, we propose a topological model to encode partial\nequivariance in neural networks. To this end, we introduce a class of\noperators, called P-GENEOs, that change data expressed by measurements,\nrespecting the action of certain sets of transformations, in a non-expansive\nway. If the set of transformations acting is a group, then we obtain the\nso-called GENEOs. We then study the spaces of measurements, whose domains are\nsubject to the action of certain self-maps, and the space of P-GENEOs between\nthese spaces. We define pseudo-metrics on them and show some properties of the\nresulting spaces. In particular, we show how such spaces have convenient\napproximation and convexity properties.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:06:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ferrari","Lucia",""],["Frosini","Patrizio",""],["Quercioli","Nicola",""],["Tombari","Francesca",""]]}
{"id":"2308.13358","submitter":"Mattia Merluzzi","authors":"Mattia Merluzzi, Miltiadis C. Filippou, Leonardo Gomes Baltar, Markus\n  D. Muek, Emilio Calvanese Strinati","title":"6G goal-oriented communications: How to coexist with legacy systems?","comments":"This paper has been submitted to the IEEE Open Journal of the\n  Communication society","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  6G will connect heterogeneous intelligent agents to make them operate complex\ncooperative tasks. When connecting intelligence, two main research questions\narise to identify how AI and ML models behave depending on: i) their input data\nquality, affected by errors induced by interference and additive noise during\nwireless communication; ii) their contextual effectiveness and resilience to\ninterpret and exploit the meaning behind the data. Both questions are within\nthe realm of semantic and goal-oriented communications. With this paper we\ninvestigate how to effectively share spectrum resources between a legacy\ncommunication system and a new goal-oriented edge intelligence one.\nSpecifically, we address the scenario of an eMBB service, i.e., a user\nuploading a video stream, interfering with an edge inference system, in which a\nuser uploads images to a Mobile Edge Host that runs a classification task. Our\nobjective is to achieve, through cooperation, the highest eMBB service data\nrate, subject to a targeted goal-effectiveness of the edge inference service,\nnamely the probability of confident inference on time. We first formalize a\ngeneral definition of a goal in the context of wireless communications. This\nincludes the goal-effectiveness, as well as that of goal cost . We argue and\nshow, through numerical evaluations, that communication reliability and\ngoal-effectiveness are not straightforwardly linked. Then, after a performance\nevaluation aiming to clarify the difference between communication performance\nand goal-effectiveness, a long-term optimization problem is formulated and\nsolved via Lyapunov optimization tools, to guarantee the desired performance.\nFinally, our numerical results assess the advantages of the proposed\noptimization, and the superiority of the goal-oriented strategy against\nbaseline 5G compliant legacy approaches, under both stationary and\nnon-stationary environments.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:07:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Merluzzi","Mattia",""],["Filippou","Miltiadis C.",""],["Baltar","Leonardo Gomes",""],["Muek","Markus D.",""],["Strinati","Emilio Calvanese",""]]}
{"id":"2308.13359","submitter":"Fernando Reis","authors":"Fernando Reis, Maico Ribeiro, Euripedes da Silva","title":"Topology of first integrals via Milnor fibrations II","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.AP math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This survey is the continuation of a series of works aimed at applying tools\nfrom Singularity Theory to Differential Equations. More precisely, we utilize\nthe powerfull Milnor's Fibration Theory to give geometric-topological\nclassifications of first integrals of differential systems. In the previous\npaper, systems of first-order quasilinear partial differential equations were\nexamined, focusing on the case of an isolated singularity. Now, we address both\ncases of isolated and \\textit{non-isolated singularities} for more general\ndynamical systems (namely, \\textit{foliations}) that admit at least one first\nintegral. For this, we utilize recently established connections between\nharmonic morphisms and Milnor fibrations to provide topological and geometric\ndescriptions of the foliations under consideration. In particular, we apply\nthese results to analyze the graph of solutions of some quasilinear systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:10:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Reis","Fernando",""],["Ribeiro","Maico",""],["da Silva","Euripedes",""]]}
{"id":"2308.13360","submitter":"Tom Banks","authors":"Tom Banks","title":"Holography for Small Values of the Cosmological Constant","comments":"LaTeX, 27 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"RUNHETC-2023-36","categories":"hep-th gr-qc quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review recent work on holography for finite area causal diamonds and\nexplore its implications for the description of such diamonds in the\nAnti-deSitter space Conformal Field Theory correspondence. We argue that the\nalgebra of operators in a finite area diamond is well defined in a UV cutoff\ntensor network construction, but is not related in any simple way to any\ninfinite von Neumann sub-algebra of the boundary algebra or its cross product.\nOur argument relies on a novel construction of tensor networks that preserves\nrotation invariance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:10:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Banks","Tom",""]]}
{"id":"2308.13361","submitter":"Roman Oleinik","authors":"Roman D. Oleinik","title":"Asymptotic relations of the Bourgain-Brezis-Mironescu type for mappings\n  between singular spaces","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the asymptotic behavior of families of Bourgain-Brezis-Mironescu\ntype nonlocal functionals for mappings from metric measure spaces to arbitrary\nmetric spaces. As the first outcome, we obtain a characterization of Sobolev\nmaps and of maps of bounded variation via such functionals. As the second\noutcome, we establish precise expressions of the limits of such functionals for\nSobolev maps. All this provides an extension of several\nBourgain-Brezis-Mironescu type results to the entirely singular setting.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:13:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Oleinik","Roman D.",""]]}
{"id":"2308.13362","submitter":"The ATLAS Collaboration","authors":"ATLAS Collaboration","title":"Electron and photon efficiencies in LHC Run 2 with the ATLAS experiment","comments":"61 pages in total, author list starting page 43, 20 figures, 2\n  tables, submitted to JHEP. All figures including auxiliary figures are\n  available at\n  http://atlas.web.cern.ch/Atlas/GROUPS/PHYSICS/PAPERS/EGAM-2021-01","journal-ref":null,"doi":null,"report-no":"CERN-EP-2023-182","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precision measurements of electron reconstruction, identification, and\nisolation efficiencies and photon identification efficiencies are presented.\nThey use the full Run 2 data of $pp$ collisions at a centre-of-mass energy of\n13 TeV, corresponding to an integrated luminosity of 139 $\\mathrm{fb}^{-1}$\ncollected by the ATLAS experiment during the years 2015-2018. The measured\nelectron identification efficiencies have uncertainties that are around 30%-50%\nsmaller than the previous Run 2 results due to an improved methodology and the\ninclusion of more data. A better pile-up subtraction method leads to electron\nisolation efficiencies that are more independent of the amount of pile-up\nactivity. Updated photon identification efficiencies are also presented, using\nthe full Run 2 data. When compared to the previous measurement, a 30%-40%\nsmaller uncertainty is observed on the photon identification efficiencies,\nthanks to the increased amount of available data.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:13:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["ATLAS Collaboration","",""]]}
{"id":"2308.13363","submitter":"Jonathan Cui","authors":"Jonathan Cui, David A. Araujo, Suman Saha, Md. Faisal Kabir","title":"CS-Mixer: A Cross-Scale Vision MLP Model with Spatial-Channel Mixing","comments":"8 page, 5 figures, developed under Penn State University's\n  Multi-Campus Research Experience for Undergraduates Symposium, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite their simpler information fusion designs compared with Vision\nTransformers and Convolutional Neural Networks, Vision MLP architectures have\ndemonstrated strong performance and high data efficiency in recent research.\nHowever, existing works such as CycleMLP and Vision Permutator typically model\nspatial information in equal-size spatial regions and do not consider\ncross-scale spatial interactions. Further, their token mixers only model 1- or\n2-axis correlations, avoiding 3-axis spatial-channel mixing due to its\ncomputational demands. We therefore propose CS-Mixer, a hierarchical Vision MLP\nthat learns dynamic low-rank transformations for spatial-channel mixing through\ncross-scale local and global aggregation. The proposed methodology achieves\ncompetitive results on popular image recognition benchmarks without incurring\nsubstantially more compute. Our largest model, CS-Mixer-L, reaches 83.2% top-1\naccuracy on ImageNet-1k with 13.7 GFLOPs and 94 M parameters.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:18:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cui","Jonathan",""],["Araujo","David A.",""],["Saha","Suman",""],["Kabir","Md. Faisal",""]]}
{"id":"2308.13364","submitter":"Dror Varolin","authors":"Dror Varolin","title":"Positivity of Singular Hermitian Metrics for Holomorphic Vector Bundles","comments":"Comments are welcome and would be appreciated","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a notion of Nakano and Demailly positivity for singular\nHermitian metrics of holomorphic vector bundles. Our definitions support the\nusual H\\\"ormander and Nadel type vanishing theorems with estimates, at least on\nessentially Stein manifolds. As an application, we establish a sharp\nOhsawa-Takegoshi type $L^2$ extension theorem. We use the method of Berndtsson\nand Lempert to prove the latter theorem, and for this purpose we require a\nBerndtsson-type positivity theorem for holomorphic vector bundles, which we\nalso prove.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:22:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Varolin","Dror",""]]}
{"id":"2308.13365","submitter":"Xuyuan Li","authors":"Xuyuan Li, Zengqiang Shang, Jian Liu, Hua Hua, Peiyang Shi, Pengyuan\n  Zhang","title":"Expressive paragraph text-to-speech synthesis with multi-step\n  variational autoencoder","comments":"5 pages, 1 figure, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks have been able to generate high-quality single-sentence\nspeech with substantial expressiveness. However, it remains a challenge\nconcerning paragraph-level speech synthesis due to the need for coherent\nacoustic features while delivering fluctuating speech styles. Meanwhile,\ntraining these models directly on over-length speech leads to a deterioration\nin the quality of synthesis speech. To address these problems, we propose a\nhigh-quality and expressive paragraph speech synthesis system with a multi-step\nvariational autoencoder. Specifically, we employ multi-step latent variables to\ncapture speech information at different grammatical levels before utilizing\nthese features in parallel to generate speech waveform. We also propose a\nthree-step training method to improve the decoupling ability. Our model was\ntrained on a single-speaker French audiobook corpus released at Blizzard\nChallenge 2023. Experimental results underscore the significant superiority of\nour system over baseline models.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:22:42 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 13:08:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Xuyuan",""],["Shang","Zengqiang",""],["Liu","Jian",""],["Hua","Hua",""],["Shi","Peiyang",""],["Zhang","Pengyuan",""]]}
{"id":"2308.13366","submitter":"Ching-Yu Huang","authors":"Feng-Li Lin and Ching-Yu Huang","title":"Work statistics for Quantum Spin Chains: characterizing quantum phase\n  transitions, benchmarking time evolution, and examining passivity of quantum\n  states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study three aspects of work statistics in the context of the fluctuation\ntheorem for the quantum spin chains by numerical methods based on\nmatrix-product states. First, we elaborate that the work done on the spin-chain\nby a sudden quench can be used to characterize the quantum phase transitions\n(QPT). We further obtain the numerical results to demonstrate its capability of\ncharacterizing the QPT of both Landau-Ginzbrug types, such as the Ising chain,\nor topological types, such as the Haldane chain. Second, we propose to use the\nfluctuation theorem, such as Jarzynski's equality, which relates the real-time\ncorrelator to the ratio of the thermal partition functions, as a benchmark\nindicator for the numerical real-time evolving methods. Third, we study the\npassivity of ground and thermal states of quantum spin chains under some cyclic\nimpulse processes. We verify the passivity of thermal states. Furthermore, we\nfind that some ground states in the Ising-like chain, with less overall spin\norder from spontaneous or explicit symmetry breaking, can be active so that\nthey can be exploited for quantum engines.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:22:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lin","Feng-Li",""],["Huang","Ching-Yu",""]]}
{"id":"2308.13367","submitter":"Minh-Tan Pham","authors":"Oscar David Rafael Narvaez Luces, Minh-Tan Pham, Quentin Poterek,\n  R\\'emi Braun","title":"Burnt area extraction from high-resolution satellite images based on\n  anomaly detection","comments":"10 pages, accepted to the MACLEAN workshop of ECML/PKDD 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Wildfire detection using satellite images is a widely studied task in remote\nsensing with many applications to fire delineation and mapping. Recently, deep\nlearning methods have become a scalable solution to automate this task,\nespecially in the field of unsupervised learning where no training data is\navailable. This is particularly important in the context of emergency risk\nmonitoring where fast and effective detection is needed, generally based on\nhigh-resolution satellite data. Among various approaches, Anomaly Detection\n(AD) appears to be highly potential thanks to its broad applications in\ncomputer vision, medical imaging, as well as remote sensing. In this work, we\nbuild upon the framework of Vector Quantized Variational Autoencoder (VQ-VAE),\na popular reconstruction-based AD method with discrete latent spaces, to\nperform unsupervised burnt area extraction. We integrate VQ-VAE into an\nend-to-end framework with an intensive post-processing step using dedicated\nvegetation, water and brightness indexes. Our experiments conducted on\nhigh-resolution SPOT-6/7 images provide promising results of the proposed\ntechnique, showing its high potential in future research on unsupervised burnt\narea extraction.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:25:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Luces","Oscar David Rafael Narvaez",""],["Pham","Minh-Tan",""],["Poterek","Quentin",""],["Braun","R\u00e9mi",""]]}
{"id":"2308.13368","submitter":"Ga\\\"el Buldgen","authors":"G. Buldgen, A. Noels, V. A. Baturin, A. V. Oreshina, S.V. Ayukov, R.\n  Scuflaire, A. M. Amarsi, and N. Grevesse","title":"Helioseismic determination of the solar metal mass fraction","comments":"Accepted for publication in A&A, online materials available on demand\n  or on publisher website","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Context. The metal mass fraction of the Sun Z is a key constraint in solar\nmodelling, but its value is still under debate. The standard solar chemical\ncomposition of the late 2000s have the ratio of metals to hydrogen Z/X =\n0.0181, with a small increase to 0.0187 in 2021, as inferred from 3D non-LTE\nspectroscopy. However, more recent work on a horizontally and temporally\naveraged <3D> model claim Z/X = 0.0225, consistent with the high values of\ntwenty-five years ago based on 1D LTE spectroscopy. Aims. We aim to determine a\nprecise and robust value of the solar metal mass fraction from helioseismic\ninversions, thus providing independent constraints from spectroscopic methods.\nMethods. We devise a detailed seismic reconstruction technique of the solar\nenvelope, combining multiple inversions and equations of state to accurately\nand precisely determine the metal mass fraction value. Results. We show that a\nlow value of the solar metal mass fraction corresponding to Z/X = 0.0187 is\nfavoured by helioseismic constraints and that a higher metal mass fraction\ncorresponding to Z/X = 0.0225 are strongly rejected by helioseismic data.\nConclusions. We conclude that direct measurement of the metal mass fraction in\nthe solar envelope favours a low metallicity, in line with the 3D non-LTE\nspectroscopic determination of 2021. A high metal mass fraction as measured\nusing a <3D> model in 2022 is disfavoured by helioseismology for all modern\nequations of state used to model the solar convective envelope.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:29:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Buldgen","G.",""],["Noels","A.",""],["Baturin","V. A.",""],["Oreshina","A. V.",""],["Ayukov","S. V.",""],["Scuflaire","R.",""],["Amarsi","A. M.",""],["Grevesse","N.",""]]}
{"id":"2308.13369","submitter":"Lin Geng Foo","authors":"Lin Geng Foo, Jia Gong, Hossein Rahmani, Jun Liu","title":"Distribution-Aligned Diffusion for Human Mesh Recovery","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recovering a 3D human mesh from a single RGB image is a challenging task due\nto depth ambiguity and self-occlusion, resulting in a high degree of\nuncertainty. Meanwhile, diffusion models have recently seen much success in\ngenerating high-quality outputs by progressively denoising noisy inputs.\nInspired by their capability, we explore a diffusion-based approach for human\nmesh recovery, and propose a Human Mesh Diffusion (HMDiff) framework which\nframes mesh recovery as a reverse diffusion process. We also propose a\nDistribution Alignment Technique (DAT) that injects input-specific distribution\ninformation into the diffusion process, and provides useful prior knowledge to\nsimplify the mesh recovery task. Our method achieves state-of-the-art\nperformance on three widely used datasets. Project page:\nhttps://gongjia0208.github.io/HMDiff/.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:29:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Foo","Lin Geng",""],["Gong","Jia",""],["Rahmani","Hossein",""],["Liu","Jun",""]]}
{"id":"2308.13370","submitter":"Fernando Reis","authors":"Fernando Louren\\c{c}o, Eur\\'ipedes da Silva and Fernando Reis","title":"On flags of holomorphic foliations associated with singular second-order\n  ordinary differential equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.CV math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider germs of holomorphic vector fields at the origin of\n$\\mathbb{C}^3$, with non-isolated singularities that are tangent to a\nholomorphic foliation of codimension one. This configuration is known as a\n$2$-flag of foliations. The focus is on cases where this geometric structure\noriginates from second-order ordinary differential equations. We investigate\nthe behavior of the singular sets associated with the foliations under\nconsideration. Furthermore, we present a classification for second-order\nequations that admit a $2$-flag of foliations. Finally, we propose a general\nmethod for constructing germs of $2$-flags of foliations at the origin of\n$\\mathbb{C}^n$, with suitable properties of the singular sets, and we conclude\nby demonstrating that under generic assumptions, every equation of order\ngreater than or equal to two is associated formally with a germ of 2-flag of\nholomorphic foliations at $(\\mathbb{C}^3,0)$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:29:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Louren\u00e7o","Fernando",""],["da Silva","Eur\u00edpedes",""],["Reis","Fernando",""]]}
{"id":"2308.13371","submitter":"Behrad TaghiBeyglou","authors":"Behrad TaghiBeyglou and Fatemeh Bagheri","title":"EOG Artifact Removal from Single and Multi-channel EEG Recordings\n  through the combination of Long Short-Term Memory Networks and Independent\n  Component Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Introduction: Electroencephalogram (EEG) signals have gained significant\npopularity in various applications due to their rich information content.\nHowever, these signals are prone to contamination from various sources of\nartifacts, notably the electrooculogram (EOG) artifacts caused by eye\nmovements. The most effective approach to mitigate EOG artifacts involves\nrecording EOG signals simultaneously with EEG and employing blind source\nseparation techniques, such as independent component analysis (ICA).\nNevertheless, the availability of EOG recordings is not always feasible,\nparticularly in pre-recorded datasets. Objective: In this paper, we present a\nnovel methodology that combines a long short-term memory (LSTM)-based neural\nnetwork with ICA to address the challenge of EOG artifact removal from\ncontaminated EEG signals. Approach: Our approach aims to accomplish two primary\nobjectives: 1) estimate the horizontal and vertical EOG signals from the\ncontaminated EEG data, and 2) employ ICA to eliminate the estimated EOG signals\nfrom the EEG, thereby producing an artifact-free EEG signal. Main results: To\nevaluate the performance of our proposed method, we conducted experiments on a\npublicly available dataset comprising recordings from 27 participants. We\nemployed well-established metrics such as mean squared error, mean absolute\nerror, and mean error to assess the quality of our artifact removal technique.\nSignificance: Furthermore, we compared the performance of our approach with two\nstate-of-the-art deep learning-based methods reported in the literature,\ndemonstrating the superior performance of our proposed methodology.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:32:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["TaghiBeyglou","Behrad",""],["Bagheri","Fatemeh",""]]}
{"id":"2308.13372","submitter":"Dietmar Weinmann","authors":"Ga\\\"etan J. Percebois, Antonio Lacerda-Santos, Boris Brun, Benoit\n  Hackens, Xavier Waintal, Dietmar Weinmann","title":"Reconstructing the potential configuration in a high-mobility\n  semiconductor heterostructure with scanning gate microscopy","comments":"23 pages, 12 figures, Submission to SciPost","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The weak disorder potential seen by the electrons of a two-dimensional\nelectron gas in high-mobility semiconductor heterostructures leads to\nfluctuations in the physical properties and can be an issue for nanodevices. In\nthis paper, we show that a scanning gate microscopy (SGM) image contains\ninformation about the disorder potential, and that a machine learning approach\nbased on SGM data can be used to determine the disorder. We reconstruct the\nelectric potential of a sample from its experimental SGM data and validate the\nresult through an estimate of its accuracy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:33:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Percebois","Ga\u00ebtan J.",""],["Lacerda-Santos","Antonio",""],["Brun","Boris",""],["Hackens","Benoit",""],["Waintal","Xavier",""],["Weinmann","Dietmar",""]]}
{"id":"2308.13373","submitter":"Santiago Cepeda Dr.","authors":"Sergio Garcia-Garcia, Santiago Cepeda, Dominik Muller, Alejandra\n  Mosteiro, Ramon Torne, Silvia Agudo, Natalia de la Torre, Ignacio Arrese,\n  Rosario Sarabia","title":"Enhanced Mortality Prediction In Patients With Subarachnoid Haemorrhage\n  Using A Deep Learning Model Based On The Initial CT Scan","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  PURPOSE: Subarachnoid hemorrhage (SAH) entails high morbidity and mortality\nrates. Convolutional neural networks (CNN), a form of deep learning, are\ncapable of generating highly accurate predictions from imaging data. Our\nobjective was to predict mortality in SAH patients by processing the initial CT\nscan on a CNN based algorithm.\n  METHODS: Retrospective multicentric study of a consecutive cohort of patients\nwith SAH between 2011-2022. Demographic, clinical and radiological variables\nwere analyzed. Pre-processed baseline CT scan images were used as the input for\ntraining a CNN using AUCMEDI Framework. Our model's architecture leverages the\nDenseNet-121 structure, employing transfer learning principles. The output\nvariable was mortality in the first three months. Performance of the model was\nevaluated by statistical parameters conventionally used in studies involving\nartificial intelligence methods.\n  RESULTS: Images from 219 patients were processed, 175 for training and\nvalidation of the CNN and 44 for its evaluation. 52%(115/219) of patients were\nfemale, and the median age was 58(SD=13.06) years. 18.5%(39/219) were\nidiopathic SAH. Mortality rate was 28.5%(63/219). The model showed good\naccuracy at predicting mortality in SAH patients exclusively using the images\nof the initial CT scan (Accuracy=74%, F1=75% and AUC=82%). CONCLUSION: Modern\nimage processing techniques based on AI and CNN make possible to predict\nmortality in SAH patients with high accuracy using CT scan images as the only\ninput. These models might be optimized by including more data and patients\nresulting in better training, development and performance on tasks which are\nbeyond the skills of conventional clinical knowledge.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:33:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Garcia-Garcia","Sergio",""],["Cepeda","Santiago",""],["Muller","Dominik",""],["Mosteiro","Alejandra",""],["Torne","Ramon",""],["Agudo","Silvia",""],["de la Torre","Natalia",""],["Arrese","Ignacio",""],["Sarabia","Rosario",""]]}
{"id":"2308.13374","submitter":"E. V. Chimanski","authors":"E. V. Chimanski, E. J. In, J. E. Escher, S. P\\'eru, W. Younes","title":"Addressing nuclear structure challenges in the Zr isotopes with\n  self-consistent Gogny-Force HFB and QRPA predictions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Zirconium isotopes exhibit structural properties that present multiple\nchallenges to nuclear theory. To shed light on the underlying causes of the\nobservations, and to test the predictive power of a state-of-the-art nuclear\nstructure approach, we have completed a large number of calculations of ground\nand excited-state properties of Zr isotopes. We performed systematic\ncalculations of ground state properties for the $^{78-122}$Zr isotopes, using\nan axially-symmetric, deformed Hartree-Fock-Bogoliubov (HFB) framework. For\nselected spherical and deformed nuclei, we have also predicted excited state\nproperties, utilizing the Quasiparticle Random Phase Approximation (QRPA). We\nuse a self-consistent approach that employs the same Gogny D1M force at both\nthe HFB and QRPA levels. Our approach complements and extends earlier studies\ncarried out using density-functional-based methods. Notably, we included the\ncomplete Coulomb interaction also in the pairing fields, i.e. we treat terms\nexactly that are approximated in typical calculations with Gogny D1 and D2\ninteraction families. The impact of these terms on the pairing energies, the\nbinding energy, charge radius shifts, and on the evolution of the energy\nsurface with neutron number is discussed. We compare this with the effect of\nusing the D1S force and discuss the resulting shape predictions for $^{80}$Zr\nand $^{96,98}$Zr. For $^{90,96,98}$Zr, we perform QRPA calculations, implement\nangular-momentum symmetry restoration, and study both low-lying and\ngiant-resonance states. For the deformed $^{98}$Zr nucleus, we confirm the\nexistence of coupling between monopole and quadrupole excitations through the\n$K^{\\pi} = 0^{+}$ QRPA components and demonstrate an analogous dipole-octupole\ncoupling through the $K^{\\pi} = 0^{-}$ and $K^{\\pi} = 1^{-}$ components.\nIntrinsic transition densities and associated radial projections illustrate the\ncoupling.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:34:04 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chimanski","E. V.",""],["In","E. J.",""],["Escher","J. E.",""],["P\u00e9ru","S.",""],["Younes","W.",""]]}
{"id":"2308.13375","submitter":"Sergi Juli\\`a-Farr\\'e","authors":"Javier Arg\\\"uello-Luengo and Manfred J. Mark and Francesca Ferlaino\n  and Maciej Lewenstein and Luca Barbiero and Sergi Juli\\`a-Farr\\'e","title":"Stabilization of Hubbard-Thouless pumps through nonlocal fermionic\n  repulsion","comments":"6.5 pages, 4 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thouless pumping represents a powerful concept to probe quantized topological\ninvariants in quantum systems. We explore this mechanism in a generalized\nRice-Mele Fermi-Hubbard model characterized by the presence of competing onsite\nand intersite interactions. Contrary to recent experimental and theoretical\nresults, showing a breakdown of quantized pumping induced by the onsite\nrepulsion, we prove that sufficiently large intersite interactions allow for an\ninteraction-induced recovery of Thouless pumps. Our analysis further reveals\nthat the occurrence of stable topological transport at large interactions is\nconnected to the presence of a spontaneous bond-order-wave in the ground-state\nphase diagram of the model. Finally, we discuss a concrete experimental setup\nbased on ultracold magnetic atoms in an optical lattice to realize the newly\nintroduced Thouless pump. Our results provide a new mechanism to stabilize\nThouless pumps in interacting quantum systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:34:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Arg\u00fcello-Luengo","Javier",""],["Mark","Manfred J.",""],["Ferlaino","Francesca",""],["Lewenstein","Maciej",""],["Barbiero","Luca",""],["Juli\u00e0-Farr\u00e9","Sergi",""]]}
{"id":"2308.13376","submitter":"Julian Kattinger","authors":"Julian Kattinger, Mike Kornely, Julian Ehrler, Christian Bonten and\n  Marc Kreutzbruck","title":"Analysis of melting and flow in the hot-end of a material extrusion 3D\n  printer using X-ray computed tomography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents in-situ X-ray computed tomography (CT) experiments used\nto study the flow behavior within a conventional hot-end of a fused filament\nfabrication printer. Three types of experiments were performed to better\nunderstand the melt and flow behavior. In one experiment, 360{\\deg} CT scans\nwere conducted, focusing on the air gap between the filament and the nozzle\nwall. In a second experiment, the flow profile inside the nozzle was studied\nusing radiography. To provide a good contrast to the surrounding nozzle\nmaterial, filament was prepared containing small amounts of tungsten powder as\na contrast agent. During a third test, the extruder forces were measured and\ncompared with the X-ray results and the predictions of a numerical simulation.\nThe CT scans showed that at higher filament speeds, less area of the nozzle\nwall is in contact with the melt. This means that a larger part of the barrel\nsection is occupied by an air gap between the solid filament and the nozzle\nwall. In contrast to the filament speed, the influence of the heater\ntemperature shows no discernible effect on the part of the nozzle filled with\nmelt. Radiographic evaluation of the velocity profile revealed a parabolic\ndistribution under the studied conditions, closely matching numerical\nsimulations modeling the flow as isothermal and non-Newtonian. The study's\nfindings offer potential for improving nozzle design. Furthermore, the\npresented experimental method can serve as a valuable tool for future\nvalidation of more complex numerical simulations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:37:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kattinger","Julian",""],["Kornely","Mike",""],["Ehrler","Julian",""],["Bonten","Christian",""],["Kreutzbruck","Marc",""]]}
{"id":"2308.13377","submitter":"Julien du Crest","authors":"Julien Du Crest, Francisco Garcia-Herrero, Mehdi Mhalla, Valentin\n  Savin, Javier Valls","title":"Layered Decoding of Quantum LDPC Codes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We address the problem of performing message-passing-based decoding of\nquantum LDPC codes under hardware latency limitations. We propose a novel way\nto do layered decoding that suits quantum constraints and outperforms flooded\nscheduling, the usual scheduling on parallel architectures. A generic\nconstruction is given to construct layers of hypergraph product codes. In the\nprocess, we introduce two new notions, t-covering layers which is a\ngeneralization of the usual layer decomposition, and a new scheduling called\nrandom order scheduling. Numerical simulations show that the random ordering is\nof independent interest as it helps relieve the high error floor typical of\nmessage-passing decoders on quantum codes for both layered and serial decoding\nwithout the need for post-processing.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:37:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Crest","Julien Du",""],["Garcia-Herrero","Francisco",""],["Mhalla","Mehdi",""],["Savin","Valentin",""],["Valls","Javier",""]]}
{"id":"2308.13378","submitter":"Epifanio G. Virga Prof.","authors":"Epifanio G. Virga","title":"Pure measure of bending for soft plates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper, originally motivated by a question raised by Wood and Hanna [Soft\nMatter, 15, 2411 (2019)], shows that pure measures of bending for soft plates\ncan be defined by introducing the class of bending-neutral deformations, finite\nincremental changes of the plate's shape bearing no further bending. This class\nof deformations is subject to a geometric compatibility condition, which is\nfully characterized. A tensorial pure measure of bending, which is accordingly\ninvariant under bending-neutral deformations, is described in details. The\ngeneral notion of pure measure of bending could be of use to formulate direct\ntheories for soft plates, were stretching and bending energies to be kept\nseparate.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:38:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Virga","Epifanio G.",""]]}
{"id":"2308.13379","submitter":"Ramesh Bhandari","authors":"R. Bhandari, G. Bollen, T. Brunner, N. D. Gamage, A. Hamaker,\n  Z.Hockenbery, M. Horana Gamage, D. K. Keblbeck, K. G. Leach, D. Puentes, M.\n  Redshaw, R. Ringle, S. Schwarz, C. S. Sumithrarachchi, and I. Yandow","title":"First direct $^{7}$Be electron capture $Q$-value measurement towards\n  high-precision BSM neutrino physics searches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report the first direct measurement of the nuclear electron capture (EC)\ndecay $Q$-value of $^{7}$Be $\\rightarrow$ $^{7}$Li via high-precision Penning\ntrap mass spectrometry (PTMS). This was performed using the LEBIT Penning trap\nlocated at the National Superconducting Cyclotron Laboratory/Facility for Rare\nIsotope Beams (NSCL/FRIB) using the newly commissioned Batch-Mode Ion-Source\n(BMIS) to deliver the unstable $^{7}$Be$^{+}$ samples. With a measured value of\n$Q_{EC}$ = 861.963(23) keV this result is also three times more precise than\nany previous determination of this quantity. This improved precision, and\naccuracy of the $^7$Be EC decay $Q$-value is critical for ongoing experiments\nthat measure the recoiling nucleus in this system as a signature to search for\nbeyond Standard Model (BSM) neutrino physics using $^7$Be-doped superconducting\nsensors.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:47:33 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bhandari","R.",""],["Bollen","G.",""],["Brunner","T.",""],["Gamage","N. D.",""],["Hamaker","A.",""],["Hockenbery","Z.",""],["Gamage","M. Horana",""],["Keblbeck","D. K.",""],["Leach","K. G.",""],["Puentes","D.",""],["Redshaw","M.",""],["Ringle","R.",""],["Schwarz","S.",""],["Sumithrarachchi","C. S.",""],["Yandow","I.",""]]}
{"id":"2308.13380","submitter":"Marco Forgione","authors":"Marco Forgione, Filippo Pura, Dario Piga","title":"In-context learning for model-free system identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In traditional system identification, we estimate a model of an unknown\ndynamical system based on given input/output sequences and available physical\nknowledge. Yet, is it also possible to understand the intricacies of dynamical\nsystems not solely from their input/output patterns, but by observing the\nbehavior of other systems within the same class? This central question drives\nthe study presented in this paper.\n  In response to this query, we introduce a novel paradigm for system\nidentification, addressing two primary tasks: one-step-ahead prediction and\nmulti-step simulation. Unlike conventional methods, we do not directly estimate\na model for the specific system. Instead, we pretrain a meta model that\nrepresents a class of dynamical systems. This meta model is trained from a\npotentially infinite stream of synthetic data, generated by systems randomly\nextracted from a certain distribution. At its core, the meta model serves as an\nimplicit representation of the main characteristics of a class of dynamical\nsystems. When provided with a brief context from a new system - specifically, a\nshort input/output sequence - the meta model implicitly discerns its dynamics,\nenabling predictions of its behavior.\n  The proposed approach harnesses the power of Transformer architectures,\nrenowned for their in-context learning capabilities in Natural Language\nProcessing tasks. For one-step prediction, a GPT-like decoder-only architecture\nis utilized, whereas the simulation problem employs an encoder-decoder\nstructure.\n  Initial experimental results affirmatively answer our foundational question,\nopening doors to fresh research avenues in system identification.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:50:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Forgione","Marco",""],["Pura","Filippo",""],["Piga","Dario",""]]}
{"id":"2308.13381","submitter":"Jiabao Gao","authors":"Jiabao Gao, Xiaoming Cheng, Geoffrey Ye Li","title":"Deep Unfolding-Based Channel Estimation for Wideband TeraHertz\n  Near-Field Massive MIMO Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The combination of Terahertz (THz) and massive multiple-input multiple-output\n(MIMO) is promising to meet the increasing data rate demand of future wireless\ncommunication systems thanks to the huge bandwidth and spatial degrees of\nfreedom. However, unique channel features such as the near-field beam split\neffect make channel estimation particularly challenging in THz massive MIMO\nsystems. On one hand, adopting the conventional angular domain transformation\ndictionary designed for low-frequency far-field channels will result in\ndegraded channel sparsity and destroyed sparsity structure in the transformed\ndomain. On the other hand, most existing compressive sensing-based channel\nestimation algorithms cannot achieve high performance and low complexity\nsimultaneously. To alleviate these issues, in this paper, we first adopt\nfrequency-dependent near-field dictionaries to maintain good channel sparsity\nand sparsity structure in the transformed domain under the near-field beam\nsplit effect. Then, a deep unfolding-based wideband THz massive MIMO channel\nestimation algorithm is proposed. In each iteration of the unitary approximate\nmessage passing-sparse Bayesian learning algorithm, the optimal update rule is\nlearned by a deep neural network (DNN), whose structure is customized to\neffectively exploit the inherent channel patterns. Furthermore, a mixed\ntraining method based on novel designs of the DNN structure and the loss\nfunction is developed to effectively train data from different system\nconfigurations. Simulation results validate the superiority of the proposed\nalgorithm in terms of performance, complexity, and robustness.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:51:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gao","Jiabao",""],["Cheng","Xiaoming",""],["Li","Geoffrey Ye",""]]}
{"id":"2308.13382","submitter":"Zengqun Zhao","authors":"Zengqun Zhao, Ioannis Patras","title":"Prompting Visual-Language Models for Dynamic Facial Expression\n  Recognition","comments":"Accepted at BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a novel visual-language model called DFER-CLIP, which is\nbased on the CLIP model and designed for in-the-wild Dynamic Facial Expression\nRecognition (DFER). Specifically, the proposed DFER-CLIP consists of a visual\npart and a textual part. For the visual part, based on the CLIP image encoder,\na temporal model consisting of several Transformer encoders is introduced for\nextracting temporal facial expression features, and the final feature embedding\nis obtained as a learnable \"class\" token. For the textual part, we use as\ninputs textual descriptions of the facial behaviour that is related to the\nclasses (facial expressions) that we are interested in recognising -- those\ndescriptions are generated using large language models, like ChatGPT. This, in\ncontrast to works that use only the class names and more accurately captures\nthe relationship between them. Alongside the textual description, we introduce\na learnable token which helps the model learn relevant context information for\neach expression during training. Extensive experiments demonstrate the\neffectiveness of the proposed method and show that our DFER-CLIP also achieves\nstate-of-the-art results compared with the current supervised DFER methods on\nthe DFEW, FERV39k, and MAFW benchmarks. Code is publicly available at\nhttps://github.com/zengqunzhao/DFER-CLIP.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:52:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Zengqun",""],["Patras","Ioannis",""]]}
{"id":"2308.13383","submitter":"Thoralf Mildenberger","authors":"Thoralf Mildenberger","title":"Assessing Keyness using Permutation Tests","comments":"Software available under https://github.com/thmild/keyperm","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a resampling-based approach for assessing keyness in corpus\nlinguistics based on suggestions by Gries (2006, 2022). Traditional approaches\nbased on hypothesis tests (e.g. Likelihood Ratio) model the copora as\nindependent identically distributed samples of tokens. This model does not\naccount for the often observed uneven distribution of occurences of a word\nacross a corpus. When occurences of a word are concentrated in few documents,\nlarge values of LLR and similar scores are in fact much more likely than\naccounted for by the token-by-token sampling model, leading to false positives.\n  We replace the token-by-token sampling model by a model where corpora are\nsamples of documents rather than tokens, which is much closer to the way\ncorpora are actually assembled. We then use a permutation approach to\napproximate the distribution of a given keyness score under the null hypothesis\nof equal frequencies and obtain p-values for assessing significance. We do not\nneed any assumption on how the tokens are organized within or across documents,\nand the approach works with basically *any* keyness score. Hence, appart from\nobtaining more accurate p-values for scores like LLR, we can also assess\nsignificance for e.g. the logratio which has been proposed as a measure of\neffect size.\n  An efficient implementation of the proposed approach is provided in the `R`\npackage `keyperm` available from github.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:52:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mildenberger","Thoralf",""]]}
{"id":"2308.13384","submitter":"Xhek Turkeshi","authors":"Piotr Sierant and Xhek Turkeshi","title":"Entanglement and absorbing state transitions in $(d+1)$-dimensional\n  stabilizer circuits","comments":"10 pages, Comments are welcome! \"11th Workshop on Quantum Chaos and\n  Localisation Phenomena\" Warsaw, May 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the influence of feedback operations on the dynamics of\n$(d+1)$-dimensional monitored random quantum circuit. Competition between\nunitary dynamics and measurements leads to an entanglement phase transition,\nwhile the feedback steers the dynamics towards an absorbing state, yielding an\nabsorbing state phase transition. Building on previous results in one spatial\ndimension [Phys. Rev. Lett. 130, 120402 (2023)], we discuss the interplay\nbetween the two types of transitions for $d \\ge 2$ in the presence of (i)\nshort-range feedback operations or (ii) additional global control operations.\nIn both cases, the absorbing state transition belongs to the $d$-dimensional\ndirected percolation universality class. In contrast, the entanglement\ntransition depends on the feedback operation type and reveals the dynamics'\ninequivalent features. The entanglement and absorbing state phase transition\nremain separated for short-range feedback operations. When global control\noperations are applied, we find the two critical points coinciding;\nnevertheless, the universality class may still differ, depending on the choice\nof the control operation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:55:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sierant","Piotr",""],["Turkeshi","Xhek",""]]}
{"id":"2308.13385","submitter":"Bruno Kh\\'elifi","authors":"B. Kh\\'elifi, R. Zanin, K. Kosack, L. Olivera-Nieto, J. Schnabel (for\n  the VODF Steering Committee)","title":"The Very-high-energy Open Data Format: towards a shared, open data\n  format in very-high-energy astronomy","comments":"Proceedings paper presented at the 38th International Cosmic Ray\n  Conference (ICRC2023), held 26 July - 3 August, 2023, in Nagoya, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In very-high-energy (VHE) gamma-ray astronomy, the community is converging\ntowards the use of a common open data format, called \"Data formats for\nGamma-ray Astronomy\", for the high-level data products. This format is in use\nfor ground-based TeV observatories like H.E.S.S., MAGIC or HAWC, some of whom\nplan to openly release high-level data products. These efforts are parallel to\nthe development and use of open analysis software such as the Gammapy package.\nThis open initiative has shown that it is possible to define common standards\neven without governance. With the advent of open VHE observatories (e.g. CTAO,\nKM3NeT) and an increase in both multi-wavelength and multi-messenger studies,\nsuch standards should evolve to support all of VHE multi-messenger\nastrophysics. For these reasons, a new initiative has been created to specify\nformats of high-level data from very and ultra high energy gamma-ray facilities\nand from VHE neutrino detectors. It also aims to better respect the FAIR\nprinciples and the IVOA recommendations.This communication will present the\nVery-high-energy Open Data Format (VODF) project that has been established by\neleven VHE astroparticle facilities. Its structure, its organisation and its\ngoal will be presented. Anchored in Open Science, our goal is to solicit\ncomments and future contributions from the VHE astrophysics community.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:57:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kh\u00e9lifi","B.","","for\n  the VODF Steering Committee"],["Zanin","R.","","for\n  the VODF Steering Committee"],["Kosack","K.","","for\n  the VODF Steering Committee"],["Olivera-Nieto","L.","","for\n  the VODF Steering Committee"],["Schnabel","J.","","for\n  the VODF Steering Committee"]]}
{"id":"2308.13386","submitter":"Yuxiao Luo","authors":"Yuxiao Luo, Ziyu Lyu, Xingyu Huang","title":"TFDNet: Time-Frequency Enhanced Decomposed Network for Long-term Time\n  Series Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Long-term time series forecasting is a vital task and has a wide range of\nreal applications. Recent methods focus on capturing the underlying patterns\nfrom one single domain (e.g. the time domain or the frequency domain), and have\nnot taken a holistic view to process long-term time series from the\ntime-frequency domains. In this paper, we propose a Time-Frequency Enhanced\nDecomposed Network (TFDNet) to capture both the long-term underlying patterns\nand temporal periodicity from the time-frequency domain. In TFDNet, we devise a\nmulti-scale time-frequency enhanced encoder backbone and develop two separate\ntrend and seasonal time-frequency blocks to capture the distinct patterns\nwithin the decomposed trend and seasonal components in multi-resolutions.\nDiverse kernel learning strategies of the kernel operations in time-frequency\nblocks have been explored, by investigating and incorporating the potential\ndifferent channel-wise correlation patterns of multivariate time series.\nExperimental evaluation of eight datasets from five benchmark domains\ndemonstrated that TFDNet is superior to state-of-the-art approaches in both\neffectiveness and efficiency.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:01:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Luo","Yuxiao",""],["Lyu","Ziyu",""],["Huang","Xingyu",""]]}
{"id":"2308.13387","submitter":"Yuxia Wang","authors":"Yuxia Wang, Haonan Li, Xudong Han, Preslav Nakov, Timothy Baldwin","title":"Do-Not-Answer: A Dataset for Evaluating Safeguards in LLMs","comments":"18 pages, 9 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the rapid evolution of large language models (LLMs), new and\nhard-to-predict harmful capabilities are emerging. This requires developers to\nbe able to identify risks through the evaluation of \"dangerous capabilities\" in\norder to responsibly deploy LLMs. In this work, we collect the first\nopen-source dataset to evaluate safeguards in LLMs, and deploy safer\nopen-source LLMs at a low cost. Our dataset is curated and filtered to consist\nonly of instructions that responsible language models should not follow. We\nannotate and assess the responses of six popular LLMs to these instructions.\nBased on our annotation, we proceed to train several BERT-like classifiers, and\nfind that these small classifiers can achieve results that are comparable with\nGPT-4 on automatic safety evaluation. Warning: this paper contains example data\nthat may be offensive, harmful, or biased.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:02:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Yuxia",""],["Li","Haonan",""],["Han","Xudong",""],["Nakov","Preslav",""],["Baldwin","Timothy",""]]}
{"id":"2308.13388","submitter":"Shuning Xu","authors":"Shuning Xu, Binbin Song, Xiangyu Chen, and Jiantao Zhou","title":"Direction-aware Video Demoireing with Temporal-guided Bilateral Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Moire patterns occur when capturing images or videos on screens, severely\ndegrading the quality of the captured images or videos. Despite the recent\nprogresses, existing video demoireing methods neglect the physical\ncharacteristics and formation process of moire patterns, significantly limiting\nthe effectiveness of video recovery. This paper presents a unified framework,\nDTNet, a direction-aware and temporal-guided bilateral learning network for\nvideo demoireing. DTNet effectively incorporates the process of moire pattern\nremoval, alignment, color correction, and detail refinement. Our proposed DTNet\ncomprises two primary stages: Frame-level Direction-aware Demoireing and\nAlignment (FDDA) and Tone and Detail Refinement (TDR). In FDDA, we employ\nmultiple directional DCT modes to perform the moire pattern removal process in\nthe frequency domain, effectively detecting the prominent moire edges. Then,\nthe coarse and fine-grained alignment is applied on the demoired features for\nfacilitating the utilization of neighboring information. In TDR, we propose a\ntemporal-guided bilateral learning pipeline to mitigate the degradation of\ncolor and details caused by the moire patterns while preserving the restored\nfrequency information in FDDA. Guided by the aligned temporal features from\nFDDA, the affine transformations for the recovery of the ultimate clean frames\nare learned in TDR. Extensive experiments demonstrate that our video demoireing\nmethod outperforms state-of-the-art approaches by 2.3 dB in PSNR, and also\ndelivers a superior visual experience.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:04:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Xu","Shuning",""],["Song","Binbin",""],["Chen","Xiangyu",""],["Zhou","Jiantao",""]]}
{"id":"2308.13389","submitter":"Bruno Kh\\'elifi","authors":"B. Kh\\'elifi, R. Terrier, A. Donath, A. Sinha, Q. Remy, F. Pintore\n  (for the Gammapy team)","title":"Gammapy: present status and future roadmap","comments":"Proceedings paper presented at the 38th International Cosmic Ray\n  Conference (ICRC2023), held 26 July - 3 August, 2023, in Nagoya, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Since its start in 2014, the lightweight open source Python library Gammapy\nhas come a long way to become a popular data analysis package for high-energy\nastrophysics. Selected as the official CTAO Science Analysis tool, it is also\nan approved analysis software within the H.E.S.S. and MAGIC collaborations. The\nfirst long-term version, Gammapy v1.0 was released on late 2022. It is\ncompliant with several well-established data conventions in high-energy\nastrophysics, and provides serialised data products that are interoperable with\nother software. Event lists and instrument response functions curated within\nthe same format from various instruments can be reduced to data binned in\nenergy, time or spatial coordinates. Thereafter, the flux and morphology of one\nor more gamma-ray sources can be estimated using Poisson maximum likelihood\nfitting and assuming a variety of spectral, temporal and spatial models. Flux\npoints, likelihood profiles and light curves extractions are supported. Complex\nuser defined likelihoods and models can also be implemented. In this\ncontribution, we will highlight the main features of Gammapy v1.0, including\ndata reduction and analysis examples from different space and ground-based\ninstruments, applications of various background rejection techniques, and a\nsimultaneous fitting across multiple instruments with astrophysical models. We\nwill also present our plans for the future, showcasing new features such as the\nsupport of different event types, unbinned likelihood analysis, spectral\nunfolding and transient source detections. In addition to an improved API with\ndistributed computing for scalable analysis, enhanced support for all-sky\ninstruments like Fermi-LAT and HAWC is foreseen.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:04:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kh\u00e9lifi","B.","","for the Gammapy team"],["Terrier","R.","","for the Gammapy team"],["Donath","A.","","for the Gammapy team"],["Sinha","A.","","for the Gammapy team"],["Remy","Q.","","for the Gammapy team"],["Pintore","F.","","for the Gammapy team"]]}
{"id":"2308.13390","submitter":"Ankit Gupta","authors":"Ankit Gupta and P. S. Burada","title":"Separation of interacting active particles in an asymmetric channel","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the diffusive behaviour of interacting active particles\n(self-propelled) with mass $m$ in an asymmetric channel. The particles are\nsubjected to an external oscillatory force along the length of the channel. In\nthis setup, particles may exhibit rectification. In the absence of interaction,\nthe mean velocity $\\langle v \\rangle$ of the particles shows a maximum at\nmoderate $m$ values. It means that particles of moderate $m$ have higher\nvelocities than the others. However, by incorporating short-range interaction\nbetween the particles, $\\langle v \\rangle$ exhibits an additional peak at lower\n$m$ values, indicating that particles of lower and moderate m can be separated\nsimultaneously from the rest. Furthermore, by tuning the interaction strength,\nthe self-propelled velocity, and the parameters of the oscillatory force, one\ncan selectively separate the particles of lower $m$, moderate $m$, or both.\nEmpirical relations for estimating the optimal mass as a function of these\nparameters are discussed. These findings are beneficial for separating the\nparticles of selective $m$ from the rest of the particles.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:06:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gupta","Ankit",""],["Burada","P. S.",""]]}
{"id":"2308.13391","submitter":"Sekhar Baishya","authors":"Sekhar Jyoti Baishya","title":"On groups with a given central factor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have classified, upto isoclinism, certain groups with a given central\nfactor. As an application, we classify, upto isoclinism, groups having at the\nmost nine element centralizers. Among other results of independent interest, we\nhave classified, upto isoclinism, groups having a central factor of order\n$p^3$, $p$ a prime. All these improves some previous results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:07:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Baishya","Sekhar Jyoti",""]]}
{"id":"2308.13392","submitter":"Zheng Gao","authors":"Zheng Gao, Chen Feng, Ioannis Patras","title":"Self-Supervised Representation Learning with Cross-Context Learning\n  between Global and Hypercolumn Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Whilst contrastive learning yields powerful representations by matching\ndifferent augmented views of the same instance, it lacks the ability to capture\nthe similarities between different instances. One popular way to address this\nlimitation is by learning global features (after the global pooling) to capture\ninter-instance relationships based on knowledge distillation, where the global\nfeatures of the teacher are used to guide the learning of the global features\nof the student. Inspired by cross-modality learning, we extend this existing\nframework that only learns from global features by encouraging the global\nfeatures and intermediate layer features to learn from each other. This leads\nto our novel self-supervised framework: cross-context learning between global\nand hypercolumn features (CGH), that enforces the consistency of instance\nrelations between low- and high-level semantics. Specifically, we stack the\nintermediate feature maps to construct a hypercolumn representation so that we\ncan measure instance relations using two contexts (hypercolumn and global\nfeature) separately, and then use the relations of one context to guide the\nlearning of the other. This cross-context learning allows the model to learn\nfrom the differences between the two contexts. The experimental results on\nlinear classification and downstream tasks show that our method outperforms the\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:08:07 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gao","Zheng",""],["Feng","Chen",""],["Patras","Ioannis",""]]}
{"id":"2308.13393","submitter":"Hashim A. Hashim","authors":"Hashim A. Hashim, Abdelrahman E. E. Eltoukhy, Kyriakos G. Vamvoudakis","title":"UWB Ranging and IMU Data Fusion: Overview and Nonlinear Stochastic\n  Filter for Inertial Navigation","comments":"IEEE Transactions on Intelligent Transportation Systems","journal-ref":null,"doi":"10.1109/TITS.2023.3309288","report-no":null,"categories":"eess.SY cs.RO cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a nonlinear stochastic complementary filter design for\ninertial navigation that takes advantage of a fusion of Ultra-wideband (UWB)\nand Inertial Measurement Unit (IMU) technology ensuring semi-global uniform\nultimate boundedness (SGUUB) of the closed loop error signals in mean square.\nThe proposed filter estimates the vehicle's orientation, position, linear\nvelocity, and noise covariance. The filter is designed to mimic the nonlinear\nnavigation motion kinematics and is posed on a matrix Lie Group, the extended\nform of the Special Euclidean Group $\\mathbb{SE}_{2}\\left(3\\right)$. The Lie\nGroup based structure of the proposed filter provides unique and global\nrepresentation avoiding singularity (a common shortcoming of Euler angles) as\nwell as non-uniqueness (a common limitation of unit-quaternion). Unlike\nKalman-type filters, the proposed filter successfully addresses IMU measurement\nnoise considering unknown upper-bounded covariance. Although the navigation\nestimator is proposed in a continuous form, the discrete version is also\npresented. Moreover, the unit-quaternion implementation has been provided in\nthe Appendix. Experimental validation performed using a publicly available\nreal-world six-degrees-of-freedom (6 DoF) flight dataset obtained from an\nunmanned Micro Aerial Vehicle (MAV) illustrating the robustness of the proposed\nnavigation technique. Keywords: Sensor-fusion, Inertial navigation,\nUltra-wideband ranging, Inertial measurement unit, Stochastic differential\nequation, Stability, Localization, Observer design.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:08:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hashim","Hashim A.",""],["Eltoukhy","Abdelrahman E. E.",""],["Vamvoudakis","Kyriakos G.",""]]}
{"id":"2308.13394","submitter":"Alexander Pate","authors":"Alexander Pate, Matthew Sperrin, Richard D. Riley, Niels Peek, Tjeerd\n  Van Staa, Jamie C. Sergeant, Mamas A. Mamas, Gregory Y. H. Lip, Martin O\n  Flaherty, Michael Barrowman, Iain Buchan, Glen P. Martin","title":"Calibration plots for multistate risk predictions models: an overview\n  and simulation comparing novel approaches","comments":"Pre-print for article currently under review","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Introduction. There is currently no guidance on how to assess the calibration\nof multistate models used for risk prediction. We introduce several techniques\nthat can be used to produce calibration plots for the transition probabilities\nof a multistate model, before assessing their performance in the presence of\nnon-informative and informative censoring through a simulation.\n  Methods. We studied pseudo-values based on the Aalen-Johansen estimator,\nbinary logistic regression with inverse probability of censoring weights\n(BLR-IPCW), and multinomial logistic regression with inverse probability of\ncensoring weights (MLR-IPCW). The MLR-IPCW approach results in a calibration\nscatter plot, providing extra insight about the calibration. We simulated data\nwith varying levels of censoring and evaluated the ability of each method to\nestimate the calibration curve for a set of predicted transition probabilities.\nWe also developed evaluated the calibration of a model predicting the incidence\nof cardiovascular disease, type 2 diabetes and chronic kidney disease among a\ncohort of patients derived from linked primary and secondary healthcare\nrecords.\n  Results. The pseudo-value, BLR-IPCW and MLR-IPCW approaches give unbiased\nestimates of the calibration curves under non-informative censoring. These\nmethods remained unbiased in the presence of informative censoring, unless the\nmechanism was strongly informative, with bias concentrated in the areas of\npredicted transition probabilities of low density.\n  Conclusions. We recommend implementing either the pseudo-value or BLR-IPCW\napproaches to produce a calibration curve, combined with the MLR-IPCW approach\nto produce a calibration scatter plot, which provides additional information\nover either of the other methods.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:09:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pate","Alexander",""],["Sperrin","Matthew",""],["Riley","Richard D.",""],["Peek","Niels",""],["Van Staa","Tjeerd",""],["Sergeant","Jamie C.",""],["Mamas","Mamas A.",""],["Lip","Gregory Y. H.",""],["Flaherty","Martin O",""],["Barrowman","Michael",""],["Buchan","Iain",""],["Martin","Glen P.",""]]}
{"id":"2308.13395","submitter":"Hedongliang Liu","authors":"Hedongliang Liu, Cornelia Ott, Felix Ulmer","title":"A Gr\\\"obner Approach to Dual-Containing Cyclic Left Module\n  $(\\theta,\\delta)$-Codes $Rg/Rf\\subset R/Rf$ over Finite Commutative Frobenius\n  Rings","comments":"19 pages, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.DM math.IT math.QA math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a skew polynomial ring $R=A[X;\\theta,\\delta]$ where $A$ is a commutative\nfrobenius ring, $\\theta$ an endomorphism of $A$ and $\\delta$ a\n$\\theta$-derivation of $A$, we consider cyclic left module codes\n$\\mathcal{C}=Rg/Rf\\subset R/Rf$ where $g$ is a left and right divisor of $f$ in\n$R$. In this paper we derive a parity check matrix when $A$ is a finite\ncommutative frobenius ring using only the framework of skew polynomial rings.\nWe consider rings $A=B[a_1,\\ldots,a_s]$ which are free $B$-algebras where the\nrestriction of $\\delta$ and $\\theta$ to $B$ are polynomial maps. If a Gr\\\"obner\nbasis can be computed over $B$, then we show that all Euclidean and Hermitian\ndual-containing codes $\\mathcal{C}=Rg/Rf\\subset R/Rf$ can be computed using a\nGr\\\"obner basis. We also give an algorithm to test if the dual code is again a\ncyclic left module code. We illustrate our approach for rings of order $4$ with\nnon-trivial endomorphism and the Galois ring of characteristic $4$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:13:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Hedongliang",""],["Ott","Cornelia",""],["Ulmer","Felix",""]]}
{"id":"2308.13396","submitter":"Denis Garoli","authors":"Douaki Ali, Stuber Annina, Hengsteler Julien, Momotenko Dmitry, Rogers\n  David M., Rocchia Walter, Hirst Jonathan D., Nakatsuka Nako, Garoli Denis","title":"Theoretical Analysis of Divalent Cation Effects on Aptamer Recognition\n  of Neurotransmitter Targets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aptamer-based sensing of small molecules such as dopamine and serotonin in\nthe brain, requires characterization of the specific aptamer sequences in\nsolutions mimicking the in vivo environment with physiological ionic\nconcentrations. In particular, divalent cations (Mg2+ and Ca2+) present in\nbrain fluid, have been shown to affect the conformational dynamics of aptamers\nupon target recognition. Thus, for biosensors that transduce aptamer structure\nswitching as the signal response, it is critical to interrogate the influence\nof divalent cations on each unique aptamer sequence. Herein, we demonstrate the\npotential of molecular dynamics simulations to predict the behaviour of\ndopamine and serotonin aptamers on sensor surfaces. The simulations enable\nmolecular-level visualization of aptamer conformational changes that, in some\ncases, are significantly influenced by divalent cations. The correlations of\ntheoretical simulations with experimental findings validate the potential for\nmolecular dynamics simulations to predict aptamer-specific behaviors on\nbiosensors\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:17:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ali","Douaki",""],["Annina","Stuber",""],["Julien","Hengsteler",""],["Dmitry","Momotenko",""],["M.","Rogers David",""],["Walter","Rocchia",""],["D.","Hirst Jonathan",""],["Nako","Nakatsuka",""],["Denis","Garoli",""]]}
{"id":"2308.13397","submitter":"Nicolas Del Grosso","authors":"Nicol\\'as F. Del Grosso, Fernando C. Lombardo, Francisco D.\n  Mazzitelli, Paula I. Villar","title":"Adiabatic Shortcuts Completion in Quantum Field Theory: Annihilation of\n  Created Particles","comments":"17 pages, 8 figures","journal-ref":"Entropy 2023, 25(9), 1249","doi":"10.3390/e25091249","report-no":null,"categories":"quant-ph cond-mat.other hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shortcuts to adiabaticity (STA) are relevant in the context of quantum\nsystems, particularly regarding their control when they are subjected to\ntime-dependent external conditions. In this paper, we investigate the\ncompletion of a nonadiabatic evolution into a shortcut to adiabaticity for a\nquantum field confined within a one-dimensional cavity containing two movable\nmirrors. Expanding upon our prior research, we characterize the field's state\nusing two Moore functions that enables us to apply reverse engineering\ntechniques in constructing the STA. Regardless of the initial evolution, we\nachieve a smooth extension of the Moore functions that implements the STA. This\nextension facilitates the computation of the mirrors' trajectories based on the\naforementioned functions. Additionally, we draw attention to the existence of a\ncomparable problem within nonrelativistic quantum mechanics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:19:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Del Grosso","Nicol\u00e1s F.",""],["Lombardo","Fernando C.",""],["Mazzitelli","Francisco D.",""],["Villar","Paula I.",""]]}
{"id":"2308.13398","submitter":"Horatiu Stefan Nastase","authors":"Matheus Cravo and Horatiu Nastase","title":"3-point function of currents for holographic cosmology and monopole\n  non-Gaussianities","comments":"29 pages+Appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we present the calculation of the three-point function in\nmomentum space of currents for a $SO(3)$ global symmetry, in a\nthree-dimensional toy model within phenomenological holographic cosmology.\nSince the two-point function gives, via electric-magnetic duality, the\nresolution of the cosmological monopole problem, the three-point function is\nrelated to the monopole non-Gaussianities. We check that the final result is UV\nand IR finite and satisfies the transverse Ward identities and consider the\n$k_1\\ll k_2,k_3$ case, relevant for cosmology. We also show that the two-loop\nresult for the 3-point function is completely independent of the explicit form\nof the potential, meaning that, like the solution to the monopole problem, also\nthe non-Gaussianities are universal within the phenomenological holographic\ncosmology.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:21:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cravo","Matheus",""],["Nastase","Horatiu",""]]}
{"id":"2308.13399","submitter":"Alexander Tsvetkov","authors":"Alexander Tsvetkov, Alon Kipnis","title":"EntropyRank: Unsupervised Keyphrase Extraction via Side-Information\n  Optimization for Language Model-based Text Compression","comments":null,"journal-ref":"ICML 2023 Workshop Neural Compression: From Information Theory to\n  Applications","doi":null,"report-no":null,"categories":"cs.CL cs.IT cs.LG math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose an unsupervised method to extract keywords and keyphrases from\ntexts based on a pre-trained language model (LM) and Shannon's information\nmaximization. Specifically, our method extracts phrases having the highest\nconditional entropy under the LM. The resulting set of keyphrases turns out to\nsolve a relevant information-theoretic problem: if provided as side\ninformation, it leads to the expected minimal binary code length in compressing\nthe text using the LM and an entropy encoder. Alternately, the resulting set is\nan approximation via a causal LM to the set of phrases that minimize the\nentropy of the text when conditioned upon it. Empirically, the method provides\nresults comparable to the most commonly used methods in various keyphrase\nextraction benchmark challenges.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:23:40 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 18:28:13 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tsvetkov","Alexander",""],["Kipnis","Alon",""]]}
{"id":"2308.13400","submitter":"Wojciech Brzezicki","authors":"Wojciech Brzezicki and Timo Hyart","title":"Geometric and conventional contributions to superfluid weight in the\n  minimal models for superconducting copper-doped lead apatite","comments":"12 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The density functional theory calculations and tight-binding models for the\ncopper-doped lead apatite support flat bands, which could be susceptible to the\nemergence of high-temperature superconductivity. We develop theory for the\ngeometric contribution of the superfluid weight arising from the momentum-space\ntopology of the Bloch wave functions of these flat bands, and we compare our\nresults to the paradigmatic case of $s$-wave superconductivity on an isolated\ntopological flat band. We show that, in contrast to the standard paradigm of\nflat-band superconductivity, there does not exist any lower bound for the\nsuperfluid weight in these models. Moreover, although the nontrivial quantum\ngeometries of the normal state bands are the same when the superconductivity\nappears in the ferromagnetic and paramagnetic phases, the emerging\nsuperconducting phases have very different superfluid weights. In the case of\nsuperconductivity appearing on the spin-polarized bands the superfluid weight\nvaries a lot as a function of model parameters. On the other hand, if the\nsuperconductivity emerges in the paramagnetic phase the superfluid weight is\nrobustly large and it contains a significant geometric component.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:23:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Brzezicki","Wojciech",""],["Hyart","Timo",""]]}
{"id":"2308.13401","submitter":"Carla Binucci","authors":"Carla Binucci, Aaron B\\\"ungener, Giuseppe Di Battista, Walter Didimo,\n  Vida Dujmovi\\'c, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin,\n  Alessandra Tappini","title":"Min-$k$-planar Drawings of Graphs","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of nonplanar drawings of graphs with restricted crossing\nconfigurations is a well-established topic in graph drawing, often referred to\nas beyond-planar graph drawing. One of the most studied types of drawings in\nthis area are the $k$-planar drawings $(k \\geq 1)$, where each edge cannot\ncross more than $k$ times. We generalize $k$-planar drawings, by introducing\nthe new family of min-$k$-planar drawings. In a min-$k$-planar drawing edges\ncan cross an arbitrary number of times, but for any two crossing edges, one of\nthe two must have no more than $k$ crossings. We prove a general upper bound on\nthe number of edges of min-$k$-planar drawings, a finer upper bound for $k=3$,\nand tight upper bounds for $k=1,2$. Also, we study the inclusion relations\nbetween min-$k$-planar graphs (i.e., graphs admitting min-$k$-planar drawings)\nand $k$-planar graphs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:24:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Binucci","Carla",""],["B\u00fcngener","Aaron",""],["Di Battista","Giuseppe",""],["Didimo","Walter",""],["Dujmovi\u0107","Vida",""],["Hong","Seok-Hee",""],["Kaufmann","Michael",""],["Liotta","Giuseppe",""],["Morin","Pat",""],["Tappini","Alessandra",""]]}
{"id":"2308.13402","submitter":"Fei Wang","authors":"Fei Wang, Yang Zhang, Zhijie Wang, Haoxiong Zhang, Xi Wu, Changhua\n  Bao, Jia Li, Pu Yu, Shuyun Zhou","title":"Ionic liquid gating induced self-intercalation of transition metal\n  chalcogenides","comments":null,"journal-ref":"Nat. Commun. 14, 4945 (2023)","doi":"10.1038/s41467-023-40591-5","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ionic liquids provide versatile pathways for controlling the structures and\nproperties of quantum materials. Previous studies have reported electrostatic\ngating of nanometre-thick flakes leading to emergent superconductivity,\ninsertion or extraction of protons and oxygen ions in perovskite oxide films\nenabling the control of different phases and material properties, and\nintercalation of large-sized organic cations into layered crystals giving\naccess to tailored superconductivity. Here, we report an ionic-liquid gating\nmethod to form three-dimensional transition metal monochalcogenides (TMMCs) by\ndriving the metals dissolved from layered transition metal dichalcogenides\n(TMDCs) into the van der Waals gap. We demonstrate the successful\nself-intercalation of PdTe$_2$ and NiTe$_2$, turning them into high-quality\nPdTe and NiTe single crystals, respectively. Moreover, the monochalcogenides\nexhibit distinctive properties from dichalcogenides. For instance, the\nself-intercalation of PdTe$_2$ leads to the emergence of superconductivity in\nPdTe. Our work provides a synthesis pathway for TMMCs by means of ionic liquid\ngating driven self-intercalation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:24:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Fei",""],["Zhang","Yang",""],["Wang","Zhijie",""],["Zhang","Haoxiong",""],["Wu","Xi",""],["Bao","Changhua",""],["Li","Jia",""],["Yu","Pu",""],["Zhou","Shuyun",""]]}
{"id":"2308.13403","submitter":"Benoit Merle","authors":"Hendrik Holz, Benoit Merle","title":"Novel nanoindentation strain rate sweep method for investigating the\n  strain rate sensitivity of materials and its hysteresis at the nanoscale","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new method to continuously measure the hardness while sweeping\nthrough orders of magnitudes of strain rates within a single experiment. While\nnanoindentation already allows the determination of the strain rate sensitivity\nof materials by means of strain rate jump tests, these are typically limited to\nfew discrete strain rates. With the new method, the strain rate sensitivity and\nactivation volume can be measured continuously as a function of the strain\nrate. Applications to fused silica, Zn-22%Al superplastic alloy, single\ncrystalline aluminum various nanocrystalline metals and a palladium-based\nmetallic glass are shown. A strain rate history dependence is evidenced, which\nis reminiscent of findings from macroscopic compression testing. The newly\ndeveloped method will enable the investigation of this strain rate history\ndependence, which is of considerable importance for the interpretation of the\nrecently developed nanoindentation impact tests and possibly also for\nnanoindentation creep testing, where the strain rate intrinsically varies\nwithin one experiment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:25:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Holz","Hendrik",""],["Merle","Benoit",""]]}
{"id":"2308.13404","submitter":"Chong Zeng","authors":"Chong Zeng and Guojun Chen and Yue Dong and Pieter Peers and Hongzhi\n  Wu and Xin Tong","title":"Relighting Neural Radiance Fields with Shadow and Highlight Hints","comments":"Accepted to SIGGRAPH 2023. Author's version. Project page:\n  https://nrhints.github.io/","journal-ref":"ACM SIGGRAPH 2023 Conference Proceedings","doi":"10.1145/3588432.3591482","report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel neural implicit radiance representation for free\nviewpoint relighting from a small set of unstructured photographs of an object\nlit by a moving point light source different from the view position. We express\nthe shape as a signed distance function modeled by a multi layer perceptron. In\ncontrast to prior relightable implicit neural representations, we do not\ndisentangle the different reflectance components, but model both the local and\nglobal reflectance at each point by a second multi layer perceptron that, in\naddition, to density features, the current position, the normal (from the\nsigned distace function), view direction, and light position, also takes shadow\nand highlight hints to aid the network in modeling the corresponding high\nfrequency light transport effects. These hints are provided as a suggestion,\nand we leave it up to the network to decide how to incorporate these in the\nfinal relit result. We demonstrate and validate our neural implicit\nrepresentation on synthetic and real scenes exhibiting a wide variety of\nshapes, material properties, and global illumination light transport.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:27:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zeng","Chong",""],["Chen","Guojun",""],["Dong","Yue",""],["Peers","Pieter",""],["Wu","Hongzhi",""],["Tong","Xin",""]]}
{"id":"2308.13405","submitter":"Will FitzGerald","authors":"Will FitzGerald","title":"Pushing, blocking and polynuclear growth","comments":"14 pages, 2 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a discrete-time model for random interface growth which admits\nexact formulas and converges to the Polynuclear growth model in a particular\nlimit. The height of the interface is initially flat and the evolution involves\nthe addition of islands of height one according to a Poisson point process of\nnucleation events. The boundaries of these islands then spread in a stochastic\nmanner, rather than at deterministic speed as in the Polynuclear growth model.\nThe one-point distribution and multi-time distributions agree with\npoint-to-line last passage percolation times in a geometric environment. An\nalternative interpretation for the growth model can be given through\ninteracting particle systems experiencing pushing and blocking interactions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:27:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["FitzGerald","Will",""]]}
{"id":"2308.13406","submitter":"Bikram Adhikari","authors":"Bikram Adhikari","title":"Using Visual and Vehicular Sensors for Driver Behavior Analysis: A\n  Survey","comments":"10 pages, 2 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Risky drivers account for 70% of fatal accidents in the United States. With\nrecent advances in sensors and intelligent vehicular systems, there has been\nsignificant research on assessing driver behavior to improve driving\nexperiences and road safety. This paper examines the various techniques used to\nanalyze driver behavior using visual and vehicular data, providing an overview\nof the latest research in this field. The paper also discusses the challenges\nand open problems in the field and offers potential recommendations for future\nresearch. The survey concludes that integrating vision and vehicular\ninformation can significantly enhance the accuracy and effectiveness of driver\nbehavior analysis, leading to improved safety measures and reduced traffic\naccidents.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:33:59 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Adhikari","Bikram",""]]}
{"id":"2308.13407","submitter":"Mathias Zambach","authors":"Mathias Zambach, Miriam Var\\'on, Matti Knaapila, Ziwei Ouyang, Marco\n  Beleggia, and Cathrine Frandsen","title":"High-susceptibility nanoparticles for micro-inductor core materials","comments":"10 pages, 5 figures, 1 table, 20 numbered equations","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  According to the laws of magnetism, the shape of magnetically soft objects\nlimits the effective susceptibility. For example, spherical soft magnets cannot\ndisplay an effective susceptibility larger than 3. Although true for\nmacroscopic multi-domain magnetic materials, we show that magnetic\nnanoparticles in a single-domain state do not suffer from this limitation. This\nis a consequence of the particle moment being forced to saturation by the\npredominance of exchange forces, and only allowed to rotate coherently in\nresponse to thermal and/or applied fields. We apply statistical mechanics to\ndetermine the static and dynamic susceptibility of single-domain particles as a\nfunction of size, temperature and material parameters. Our calculations reveal\nthat spherical single-domain particles with large saturation magnetisation and\nsmall magneto-crystalline anisotropy, e.g. FeNi particles, can have very a\nlarge susceptibility of 200 or more. We further show that susceptibility and\nlosses can be tuned by particle easy axis alignment with the applied field in\ncase of uniaxial anisotropy, but not for particles with cubic anisotropy. Our\nmodel is validated experimentally by comparison with measurements on\nnanocomposites containing spherical 11$\\pm$3 nm $\\gamma$-Fe$_2$O$_3$ particles\nup to 45 vol% finely dispersed in a polymer matrix. In agreement with the\ncalculations for this specific material, the measured susceptibility of the\ncomposites is up to 17 ($\\gg$3) and depends linearly on the volume fraction of\nparticles. Based on these results, we predict that nanocomposites of 30 vol% of\nsuperparamagnetic FeNi particles in an insulating non-magnetic matrix can have\na sufficiently large susceptibility to be used as micro-inductor core materials\nin the MHz frequency range, while maintaining losses below state-of-the-art\nferrites.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:35:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zambach","Mathias",""],["Var\u00f3n","Miriam",""],["Knaapila","Matti",""],["Ouyang","Ziwei",""],["Beleggia","Marco",""],["Frandsen","Cathrine",""]]}
{"id":"2308.13408","submitter":"Saroj Dash Prof. Dr.","authors":"Bing Zhao, Lakhan Bainsla, Roselle Ngaloy, Peter Svedlindh, Saroj P.\n  Dash","title":"Coexistence of non-trivial van der Waals magnetic orders enable\n  field-free spin-orbit torque switching at room temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The discovery of van der Waals (vdW) materials exhibiting non-trivial and\ntunable magnetic interactions at room temperature can give rise to exotic\nmagnetic states, which are not readily attainable with conventional materials.\nSuch vdW magnets can provide a unique platform for studying new magnetic\nphenomena and realising magnetization dynamics for energy-efficient and\nnon-volatile spintronic memory and logic technologies. Recent developments in\nvdW magnets have revealed their potential to enable spin-orbit torque (SOT)\ninduced magnetization dynamics. However, the deterministic and field-free SOT\nswitching of vdW magnets at room temperature has been lacking, prohibiting\ntheir potential applications. Here, we demonstrate magnetic field-free and\ndeterministic SOT switching of a vdW magnet (Co0.5Fe0.5)5GeTe2 (CFGT) at room\ntemperature, capitalizing on its non-trivial intrinsic magnetic ordering. We\ndiscover a coexistence of ferromagnetic and antiferromagnetic orders in CFGT at\nroom temperature, inducing an intrinsic exchange bias and canted perpendicular\nmagnetism. The resulting canted perpendicular magnetization of CFGT introduces\nsymmetry breaking, facilitating successful magnetic field-free magnetization\nswitching in the CFGT/Pt heterostructure devices. Furthermore, the SOT-induced\nmagnetization dynamics and their efficiency are evaluated using 2nd harmonic\nHall measurements. This advancement opens new avenues for investigating tunable\nmagnetic phenomena in vdW material heterostructures and realizing field-free\nSOT-based spintronic technologies.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:37:46 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Bing",""],["Bainsla","Lakhan",""],["Ngaloy","Roselle",""],["Svedlindh","Peter",""],["Dash","Saroj P.",""]]}
{"id":"2308.13409","submitter":"Yang Wan","authors":"Yang Wan, Rafael D. Gonz\\'alez-Cruz, Diane Hoffman-Kim, Haneesh Kesari","title":"A mechanics theory for the exploration of a high-throughput, sterile 3D\n  $\\textit{in vitro}$ traumatic brain injury model","comments":"30 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.bio-ph q-bio.NC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Brain injuries resulting from mechanical trauma represent an ongoing global\npublic health issue. Several $\\textit{in vitro}$ and $\\textit{in vivo}$ models\nfor traumatic brain injury (TBI) continue to be developed for delineating the\nvarious complex pathophysiological processes involved in its onset and\nprogression. Developing an $\\textit{in vitro}$ TBI model that is based on\ncortical spheroids is especially of great interest currently because they can\nreplicate key aspects of $\\textit{in vivo}$ brain tissue, including its\nelectrophysiology, physicochemical microenvironment, and extracellular matrix\ncomposition. Being able to mechanically deform the spheroids is a key\nrequirement in any effective $\\textit{in vitro}$ TBI model. The spheroids'\nshape and size, however, make mechanically loading them, especially in a\nhigh-throughput, sterile, and reproducible manner, quite challenging. To\naddress this challenge, we present an idea for a spheroid-based, $\\textit{in\nvitro}$ TBI model in which the spheroids are mechanically loaded by being spun\nby a centrifuge. (An experimental demonstration of this new idea will be\npublished shortly elsewhere.) An issue that can limit its utility and scope is\nthat imaging techniques used in 2D and 3D $\\textit{in vitro}$ TBI models cannot\nbe readily applied in it to determine spheroid strains. In order to address\nthis issue, we developed a continuum mechanics-based theory to estimate the\nspheroids' strains when they are being spun at a constant angular velocity. The\nmechanics theory, while applicable here to a special case of the\ncentrifuge-based TBI model, is also of general value since it can help with the\nfurther exploration and development of TBI models.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:38:13 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wan","Yang",""],["Gonz\u00e1lez-Cruz","Rafael D.",""],["Hoffman-Kim","Diane",""],["Kesari","Haneesh",""]]}
{"id":"2308.13410","submitter":"Valeria Giustarini","authors":"Valeria Giustarini, Sara Ugolini","title":"Maximal theories of product logic","comments":"This is a preprint","journal-ref":"EUSFLAT AGOP 2023. Lecture Notes in Computer Science, vol 14069.\n  Springer, Cham (2023)","doi":"10.1007/978-3-031-39965-7_42","report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Product logic is one of the main fuzzy logics arising from a continuous\nt-norm, and its equivalent algebraic semantics is the variety of product\nalgebras. In this contribution, we study maximal filters of product algebras,\nand their relation with product hoops. The latter constitute the variety of\n0-free subreducts of product algebras. Given any product hoop, we construct a\nproduct algebra of which the product hoop is (isomorphic to) a maximal filter.\nThis entails that product hoops coincide exactly with the maximal filters of\nproduct algebras, seen as residuated lattices. In this sense, we characterize\nthe equational theory of maximal filters of product algebras.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:38:34 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Giustarini","Valeria",""],["Ugolini","Sara",""]]}
{"id":"2308.13411","submitter":"Yan Luo","authors":"Yan Luo, Min Shi, Yu Tian, Tobias Elze, Mengyu Wang","title":"Harvard Glaucoma Detection and Progression: A Multimodal Multitask\n  Dataset and Generalization-Reinforced Semi-Supervised Learning","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Glaucoma is the number one cause of irreversible blindness globally. A major\nchallenge for accurate glaucoma detection and progression forecasting is the\nbottleneck of limited labeled patients with the state-of-the-art (SOTA) 3D\nretinal imaging data of optical coherence tomography (OCT). To address the data\nscarcity issue, this paper proposes two solutions. First, we develop a novel\ngeneralization-reinforced semi-supervised learning (SSL) model called pseudo\nsupervisor to optimally utilize unlabeled data. Compared with SOTA models, the\nproposed pseudo supervisor optimizes the policy of predicting pseudo labels\nwith unlabeled samples to improve empirical generalization. Our pseudo\nsupervisor model is evaluated with two clinical tasks consisting of glaucoma\ndetection and progression forecasting. The progression forecasting task is\nevaluated both unimodally and multimodally. Our pseudo supervisor model\ndemonstrates superior performance than SOTA SSL comparison models. Moreover,\nour model also achieves the best results on the publicly available LAG fundus\ndataset. Second, we introduce the Harvard Glaucoma Detection and Progression\n(Harvard-GDP) Dataset, a multimodal multitask dataset that includes data from\n1,000 patients with OCT imaging data, as well as labels for glaucoma detection\nand progression. This is the largest glaucoma detection dataset with 3D OCT\nimaging data and the first glaucoma progression forecasting dataset that is\npublicly available. Detailed sex and racial analysis are provided, which can be\nused by interested researchers for fairness learning studies. Our released\ndataset is benchmarked with several SOTA supervised CNN and transformer deep\nlearning models. The dataset and code are made publicly available via\n\\url{https://ophai.hms.harvard.edu/datasets/harvard-gdp1000}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:38:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Luo","Yan",""],["Shi","Min",""],["Tian","Yu",""],["Elze","Tobias",""],["Wang","Mengyu",""]]}
{"id":"2308.13412","submitter":"Simone Castellan","authors":"Simone Castellan","title":"$\\hbar$-Vertex algebras and chiralization of star products","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math-ph math.MP math.RA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce the notion of a $\\hbar$-vertex algebra, which is an algebraic\nstructure similar to a vertex algebra, with a deformed translation covariance\naxiom. We study the structure theory of $\\hbar$-vertex algebras, highlighting\nsimilarities with the structure theory of vertex algebras. We prove results\nanalogous to Goddard's Uniqueness Theorem, Reconstruction Theorem, Borcherds\nIdentity and OPE Expansion Formula. We also introduce the related notions of a\n$\\hbar$-Lie conformal algebra and of a $\\hbar$-Poisson vertex algebra. The main\nexample of $\\hbar$-vertex algebras are vertex algebras with deformed vertex\noperators $Y_\\hbar(a,z)=(1+\\hbar z)^{\\Delta_a}Y(a,z)$, where $\\Delta_a$ is the\neigenvalue of a Hamiltonian operator $H$. We simplify the construction of the\nZhu algebra using the formalism of $\\hbar$-vertex algebras. As a further\napplication of the theory developed in the first part of the paper, we discuss\nthe chiralization of classical star-products. We compute explicit formulae for\nthe chiralization of a class of star-products, including the Moyal-Weyl and the\nGutt star-products. Putting $\\hbar=0$, these formulae yield explicit formulae\nfor deformation quantizations of a class of Poisson vertex algebras.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:42:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Castellan","Simone",""]]}
{"id":"2308.13413","submitter":"Sofia Ribeiro","authors":"Sofia Ribeiro, Javier Aizpurua, Ruben Esteban","title":"Influence of direct dipole-dipole interactions on the optical response\n  of 2D materials in extremely inhomogeneous infrared cavity fields","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A two-dimensional (2D) material, formed for example by a self-assembled\nmolecular monolayer or by a single layer of a Van der Walls material, can\ncouple efficiently with photonic nanocavities, potentially reaching the strong\ncoupling regime. The coupling can be modelled using classical harmonic\noscillator models or cavity quantum electrodynamics Hamiltonians that often\nneglect the direct dipole-dipole interactions within the monolayer. Here, we\ndiagonalize the full Hamiltonian of the system, including these direct\ndipole-dipole interactions. The main effect on the optical properties of a\ntypical 2D system is simply to renormalize the effective energy of the bright\ncollective excitation of the monolayer that couples with the nanophotonic mode.\nOn the other hand, we show that for situations of extreme field confinement,\nlarge transition dipole moments and low losses, fully including the direct\ndipole-dipole interactions is critical to correctly capture the optical\nresponse, with many collective states participating in it. To quantify this\nresult, we propose a simple equation that indicates the condition for which the\ndirect interactions strongly modify the optical response.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:42:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ribeiro","Sofia",""],["Aizpurua","Javier",""],["Esteban","Ruben",""]]}
{"id":"2308.13414","submitter":"Arunima Mandal","authors":"Arunima Mandal, Yuanhang Shao, Xiuwen Liu","title":"Automatic Historical Stock Price Dataset Generation Using Python","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the dynamic political and economic environments, the ever-changing stock\nmarkets generate large amounts of data daily. Acquiring up-to-date data is\ncrucial to enhancing predictive precision in stock price behavior studies.\nHowever, preparing the dataset manually can be challenging and time-demanding.\nThe stock market analysis usually revolves around specific indices such as\nS&P500, Nasdaq, Dow Jones, the New York Stock Exchange (NYSE), etc. It is\nnecessary to analyze all the companies of any particular index. While raw data\nare accessible from diverse financial websites, these resources are tailored\nfor individual company data retrieval and there is a big gap between what is\navailable and what is needed to generate large datasets. Python emerges as a\nvaluable tool for comprehensively collecting all constituent stocks within a\ngiven index. While certain online sources offer code snippets for limited\ndataset generation, a comprehensive and unified script is yet to be developed\nand publicly available. Therefore, we present a comprehensive and consolidated\ncode resource that facilitates the extraction of updated datasets for any\nparticular time period and for any specific stock market index and closes the\ngap. The code is available at\nhttps://github.com/amp1590/automatic_stock_data_collection.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:44:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mandal","Arunima",""],["Shao","Yuanhang",""],["Liu","Xiuwen",""]]}
{"id":"2308.13415","submitter":"Tiarna Lee","authors":"Tiarna Lee, Esther Puyol-Ant\\'on, Bram Ruijsink, Keana Aitcheson,\n  Miaojing Shi, Andrew P. King","title":"An investigation into the impact of deep learning model choice on sex\n  and race bias in cardiac MR segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In medical imaging, artificial intelligence (AI) is increasingly being used\nto automate routine tasks. However, these algorithms can exhibit and exacerbate\nbiases which lead to disparate performances between protected groups. We\ninvestigate the impact of model choice on how imbalances in subject sex and\nrace in training datasets affect AI-based cine cardiac magnetic resonance image\nsegmentation. We evaluate three convolutional neural network-based models and\none vision transformer model. We find significant sex bias in three of the four\nmodels and racial bias in all of the models. However, the severity and nature\nof the bias varies between the models, highlighting the importance of model\nchoice when attempting to train fair AI-based segmentation models for medical\nimaging tasks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:55:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lee","Tiarna",""],["Puyol-Ant\u00f3n","Esther",""],["Ruijsink","Bram",""],["Aitcheson","Keana",""],["Shi","Miaojing",""],["King","Andrew P.",""]]}
{"id":"2308.13416","submitter":"Ensheng Shi","authors":"Ensheng Shi, Fengji Zhang, Yanlin Wang, Bei Chen, Lun Du, Hongyu\n  Zhang, Shi Han, Dongmei Zhang, Hongbin Sun","title":"SoTaNa: The Open-Source Software Development Assistant","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software development plays a crucial role in driving innovation and\nefficiency across modern societies. To meet the demands of this dynamic field,\nthere is a growing need for an effective software development assistant.\nHowever, existing large language models represented by ChatGPT suffer from\nlimited accessibility, including training data and model weights. Although\nother large open-source models like LLaMA have shown promise, they still\nstruggle with understanding human intent. In this paper, we present SoTaNa, an\nopen-source software development assistant. SoTaNa utilizes ChatGPT to generate\nhigh-quality instruction-based data for the domain of software engineering and\nemploys a parameter-efficient fine-tuning approach to enhance the open-source\nfoundation model, LLaMA. We evaluate the effectiveness of \\our{} in answering\nStack Overflow questions and demonstrate its capabilities. Additionally, we\ndiscuss its capabilities in code summarization and generation, as well as the\nimpact of varying the volume of generated data on model performance. Notably,\nSoTaNa can run on a single GPU, making it accessible to a broader range of\nresearchers. Our code, model weights, and data are public at\n\\url{https://github.com/DeepSoftwareAnalytics/SoTaNa}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:56:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Shi","Ensheng",""],["Zhang","Fengji",""],["Wang","Yanlin",""],["Chen","Bei",""],["Du","Lun",""],["Zhang","Hongyu",""],["Han","Shi",""],["Zhang","Dongmei",""],["Sun","Hongbin",""]]}
{"id":"2308.13417","submitter":"Sean Lawley","authors":"Hyunjoong Kim and Sean D Lawley","title":"Cover times of many diffusive or subdiffusive searchers","comments":"22 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cover times measure the speed of exhaustive searches which require the\nexploration of an entire spatial region(s). Applications include the immune\nsystem hunting pathogens, animals collecting food, robotic demining or\ncleaning, and computer search algorithms. Mathematically, a cover time is the\nfirst time a random searcher(s) comes within a specified \"detection radius\" of\nevery point in the target region (often the entire spatial domain). Due to\ntheir many applications and their fundamental probabilistic importance, cover\ntimes have been extensively studied in the physics and probability literatures.\nThis prior work has generally studied cover times of a single searcher with a\nvanishing detection radius or a large target region. This prior work has\nfurther claimed that cover times for multiple searchers can be estimated by a\nsimple rescaling of the cover time of a single searcher. In this paper, we\nstudy cover times of many diffusive or subdiffusive searchers and show that\nprior estimates break down as the number of searchers grows. We prove a rather\nuniversal formula for all the moments of such cover times in the many searcher\nlimit that depends only on (i) the searcher's characteristic (sub)diffusivity\nand (ii) a certain geodesic distance between the searcher starting location(s)\nand the farthest point in the target. This formula is otherwise independent of\nthe detection radius, space dimension, target size, and domain size. We\nillustrate our results in several examples and compare them to detailed\nstochastic simulations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:00:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kim","Hyunjoong",""],["Lawley","Sean D",""]]}
{"id":"2308.13418","submitter":"Lukas Blecher","authors":"Lukas Blecher, Guillem Cucurull, Thomas Scialom, Robert Stojnic","title":"Nougat: Neural Optical Understanding for Academic Documents","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Scientific knowledge is predominantly stored in books and scientific\njournals, often in the form of PDFs. However, the PDF format leads to a loss of\nsemantic information, particularly for mathematical expressions. We propose\nNougat (Neural Optical Understanding for Academic Documents), a Visual\nTransformer model that performs an Optical Character Recognition (OCR) task for\nprocessing scientific documents into a markup language, and demonstrate the\neffectiveness of our model on a new dataset of scientific documents. The\nproposed approach offers a promising solution to enhance the accessibility of\nscientific knowledge in the digital age, by bridging the gap between\nhuman-readable documents and machine-readable text. We release the models and\ncode to accelerate future work on scientific text recognition.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:03:36 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Blecher","Lukas",""],["Cucurull","Guillem",""],["Scialom","Thomas",""],["Stojnic","Robert",""]]}
{"id":"2308.13419","submitter":"Roberta Angelini","authors":"R. Angelini, P. Giura, G. Monaco, G. Ruocco, F. Sette, and R. Verbeni","title":"Structural and Microscopic Relaxation Processes in Liquid Hydrogen\n  Fluoride","comments":"6 pages, 5 figures,","journal-ref":"Physical Review Letters 88, 255503 (2002)","doi":"10.1103/PhysRevLett.88.255503","report-no":null,"categories":"cond-mat.soft cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The high frequency collective dynamics of liquid hydrogen fluoride is studied\nby inelastic x-ray scattering on the coexistence curve at T = 239 K. The\ncomparison with existing molecular dynamics simulations shows the existence of\ntwo active relaxation processes with characteristic time scales in the\nsubpicosecond range. The observed scenario is very similar to that found in\nliquid water. This suggests that hydrogen bonded liquids behave similarly to\nother very different systems as simple and glass forming liquids, thus\nindicating that these two relaxation processes are universal features of the\nliquid state.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:04:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Angelini","R.",""],["Giura","P.",""],["Monaco","G.",""],["Ruocco","G.",""],["Sette","F.",""],["Verbeni","R.",""]]}
{"id":"2308.13420","submitter":"Yan-Jie Song","authors":"Yanjie Song, Yutong Wu, Yangyang Guo, Ran Yan, P. N. Suganthan, Yue\n  Zhang, Witold Pedrycz, Yingwu Chen, Swagatam Das, Rammohan Mallipeddi,\n  Oladayo Solomon Ajani","title":"Reinforcement Learning-assisted Evolutionary Algorithm: A Survey and\n  Research Opportunities","comments":"26 pages, 16 figures","journal-ref":null,"doi":null,"report-no":"SWEVO-S-2023-00771","categories":"cs.NE cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Evolutionary algorithms (EA), a class of stochastic search methods based on\nthe principles of natural evolution, have received widespread acclaim for their\nexceptional performance in various real-world optimization problems. While\nresearchers worldwide have proposed a wide variety of EAs, certain limitations\nremain, such as slow convergence speed and poor generalization capabilities.\nConsequently, numerous scholars actively explore improvements to algorithmic\nstructures, operators, search patterns, etc., to enhance their optimization\nperformance. Reinforcement learning (RL) integrated as a component in the EA\nframework has demonstrated superior performance in recent years. This paper\npresents a comprehensive survey on integrating reinforcement learning into the\nevolutionary algorithm, referred to as reinforcement learning-assisted\nevolutionary algorithm (RL-EA). We begin with the conceptual outlines of\nreinforcement learning and the evolutionary algorithm. We then provide a\ntaxonomy of RL-EA. Subsequently, we discuss the RL-EA integration method, the\nRL-assisted strategy adopted by RL-EA, and its applications according to the\nexisting literature. The RL-assisted procedure is divided according to the\nimplemented functions including solution generation, learnable objective\nfunction, algorithm/operator/sub-population selection, parameter adaptation,\nand other strategies. Finally, we analyze potential directions for future\nresearch. This survey serves as a rich resource for researchers interested in\nRL-EA as it overviews the current state-of-the-art and highlights the\nassociated challenges. By leveraging this survey, readers can swiftly gain\ninsights into RL-EA to develop efficient algorithms, thereby fostering further\nadvancements in this emerging field.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:06:05 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 00:34:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Song","Yanjie",""],["Wu","Yutong",""],["Guo","Yangyang",""],["Yan","Ran",""],["Suganthan","P. N.",""],["Zhang","Yue",""],["Pedrycz","Witold",""],["Chen","Yingwu",""],["Das","Swagatam",""],["Mallipeddi","Rammohan",""],["Ajani","Oladayo Solomon",""]]}
{"id":"2308.13421","submitter":"Wei Qian","authors":"Jia Li, Wei Qian, Kun Li, Qi Li, Dan Guo, Meng Wang","title":"Exploiting Diverse Feature for Multimodal Sentiment Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present our solution to the MuSe-Personalisation\nsub-challenge in the MuSe 2023 Multimodal Sentiment Analysis Challenge. The\ntask of MuSe-Personalisation aims to predict the continuous arousal and valence\nvalues of a participant based on their audio-visual, language, and\nphysiological signal modalities data. Considering different people have\npersonal characteristics, the main challenge of this task is how to build\nrobustness feature presentation for sentiment prediction. To address this\nissue, we propose exploiting diverse features. Specifically, we proposed a\nseries of feature extraction methods to build a robust representation and model\nensemble. We empirically evaluate the performance of the utilized method on the\nofficially provided dataset. \\textbf{As a result, we achieved 3rd place in the\nMuSe-Personalisation sub-challenge.} Specifically, we achieve the results of\n0.8492 and 0.8439 for MuSe-Personalisation in terms of arousal and valence CCC.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:06:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Jia",""],["Qian","Wei",""],["Li","Kun",""],["Li","Qi",""],["Guo","Dan",""],["Wang","Meng",""]]}
{"id":"2308.13422","submitter":"Ren-Xin Zhao","authors":"Ren-Xin Zhao and Jinjing Shi and Xuelong Li","title":"QKSAN: A Quantum Kernel Self-Attention Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-Attention Mechanism (SAM) is skilled at extracting important information\nfrom the interior of data to improve the computational efficiency of models.\nNevertheless, many Quantum Machine Learning (QML) models lack the ability to\ndistinguish the intrinsic connections of information like SAM, which limits\ntheir effectiveness on massive high-dimensional quantum data. To address this\nissue, a Quantum Kernel Self-Attention Mechanism (QKSAM) is introduced, which\ncombines the data representation benefit of Quantum Kernel Methods (QKM) with\nthe efficient information extraction capability of SAM. A Quantum Kernel\nSelf-Attention Network (QKSAN) framework is built based on QKSAM, with Deferred\nMeasurement Principle (DMP) and conditional measurement techniques, which\nreleases half of the quantum resources with probabilistic measurements during\ncomputation. The Quantum Kernel Self-Attention Score (QKSAS) determines the\nmeasurement conditions and reflects the probabilistic nature of quantum\nsystems. Finally, four QKSAN models are deployed on the Pennylane platform to\nperform binary classification on MNIST images. The best-performing among the\nfour models is assessed for noise immunity and learning ability. Remarkably,\nthe potential learning benefit of partial QKSAN models over classical deep\nlearning is that they require few parameters for a high return of 98\\% $\\pm$\n1\\% test and train accuracy, even with highly compressed images. QKSAN lays the\nfoundation for future quantum computers to perform machine learning on massive\namounts of data, while driving advances in areas such as quantum Natural\nLanguage Processing (NLP).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:08:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Ren-Xin",""],["Shi","Jinjing",""],["Li","Xuelong",""]]}
{"id":"2308.13423","submitter":"Pierre Wulles","authors":"Pierre Wulles, Sergey E. Skipetrov","title":"Topological photonic band gaps in honeycomb atomic arrays","comments":"18 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The spectrum of excitations a two-dimensional, planar honeycomb lattice of\ntwo-level atoms coupled by the in-plane electromagnetic field may exhibit band\ngaps that can be opened either by applying an external magnetic field or by\nbreaking the symmetry between the two triangular sublattices of which the\nhoneycomb one is a superposition. We establish the conditions of band gap\nopening, compute the width of the gap, and characterize its topological\nproperty by a topological index (Chern number). The topological nature of the\nband gap leads to inversion of the population imbalance between the two\ntriangular sublattices for modes with frequencies near band edges. It also\nprohibits a transition to the trivial limit of infinitely spaced,\nnoninteracting atoms without closing the spectral gap. Surrounding the lattice\nby a Fabry-P\\'erot cavity with small intermirror spacing $d < {\\pi}/k_0$ ,\nwhere $k_0$ is the free-space wave number at the atomic resonance frequency,\nrenders the system Hermitian by suppressing the leakage of energy out of the\natomic plane without modifying its topological properties. In contrast, a\nlarger $d$ allows for propagating optical modes that are built up due to\nreflections at the cavity mirrors and have frequencies inside the band gap of\nthe free-standing lattice, thus closing the latter.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:08:49 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 09:53:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wulles","Pierre",""],["Skipetrov","Sergey E.",""]]}
{"id":"2308.13424","submitter":"Ray Li","authors":"Omar Alrabiah, Venkatesan Guruswami, Ray Li","title":"AG codes have no list-decoding friends: Approaching the generalized\n  Singleton bound requires exponential alphabets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.DM math.CO math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A simple, recently observed generalization of the classical Singleton bound\nto list-decoding asserts that rate $R$ codes are not list-decodable using\nlist-size $L$ beyond an error fraction $\\tfrac{L}{L+1} (1-R)$ (the Singleton\nbound being the case of $L=1$, i.e., unique decoding). We prove that in order\nto approach this bound for any fixed $L >1$, one needs exponential alphabets.\nSpecifically, for every $L>1$ and $R\\in(0,1)$, if a rate $R$ code can be\nlist-of-$L$ decoded up to error fraction $\\tfrac{L}{L+1} (1-R -\\varepsilon)$,\nthen its alphabet must have size at least $\\exp(\\Omega_{L,R}(1/\\varepsilon))$.\nThis is in sharp contrast to the situation for unique decoding where certain\nfamilies of rate $R$ algebraic-geometry (AG) codes over an alphabet of size\n$O(1/\\varepsilon^2)$ are unique-decodable up to error fraction\n$(1-R-\\varepsilon)/2$.\n  Our lower bound is tight up to constant factors in the exponent -- with high\nprobability random codes (or, as shown recently, even random linear codes) over\n$\\exp(O_L(1/\\varepsilon))$-sized alphabets, can be list-of-$L$ decoded up to\nerror fraction $\\tfrac{L}{L+1} (1-R -\\varepsilon)$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:09:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Alrabiah","Omar",""],["Guruswami","Venkatesan",""],["Li","Ray",""]]}
{"id":"2308.13425","submitter":"Ishak Cheniouni","authors":"Ishak Cheniouni, Soulaimane Berkane, and Abdelhamid Tayebi","title":"Safe and Quasi-Optimal Autonomous Navigation in Environments with Convex\n  Obstacles","comments":"arXiv admin note: substantial text overlap with arXiv:2302.12309","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a continuous feedback control strategy that steers a point-mass\nvehicle safely to a destination, in a quasi-optimal manner, in sphere worlds.\nThe main idea consists in avoiding each obstacle via the shortest path within\nthe cone enclosing the obstacle and moving straight toward the target when the\nvehicle has a clear line of sight to the target location. In particular, almost\nglobal asymptotic stability of the target location is achieved in\ntwo-dimensional (2D) environments under a particular assumption on the\nobstacles configuration. We also propose a reactive (sensor-based) approach,\nsuitable for real-time implementations in a priori unknown 2D environments with\nsufficiently curved convex obstacles, guaranteeing almost global asymptotic\nstability of the target location. Simulation results are presented to\nillustrate the effectiveness of the proposed approach.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:09:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cheniouni","Ishak",""],["Berkane","Soulaimane",""],["Tayebi","Abdelhamid",""]]}
{"id":"2308.13426","submitter":"Cristian Sierra C.F.Sierra","authors":"Peter Athron, R. Martinez and Cristian Sierra","title":"$B$ meson anomalies and large $B^{+}\\to K^{+}\\nu\\bar{\\nu}$ in\n  non-universal $U(1)^\\prime$ models","comments":"10 pages, 5 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In view of both the latest LHCb measurement of $R_{K^{(*)}}$ and the newly\n$2.8\\sigma$ deviation reported by Belle II on $B^{+}\\to K^{+}\\nu\\bar{\\nu}$\ndecays, we present a fit to the $B$ meson anomalies for various one and two\ndimensional hypothesis including complex Wilson coefficients. We show in a\nmodel-independent way that the generic non-universal $U(1)^{\\prime}$ extensions\nof the SM, without flavour violation, fail to simultaneously fit those\nobservables and corroborate that they can modify $\\mathrm{BR}(B^{+}\\to\nK^{+}\\nu\\bar{\\nu})$ up to only a $10\\%$. In view of this deficit, we propose a\nnew way in which those models can accommodate the data at tree level by\nintroducing lepton flavour violating couplings and non-diagonal elements of the\ncharged lepton mixing matrix, with implications in future charged lepton\nflavour violation searches.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:09:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Athron","Peter",""],["Martinez","R.",""],["Sierra","Cristian",""]]}
{"id":"2308.13427","submitter":"Martin Grundner","authors":"Martin Grundner, Tizian Blatz, John Sous, Ulrich Schollw\\\"ock and\n  Sebastian Paeckel","title":"Cooper-Paired Bipolaronic Superconductors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Light-mass bipolarons in off-diagonally coupled electron-phonon systems\nprovide a potential route to bipolaronic high-Tc superconductivity. While there\nhas been numerical progress in the physically relevant limit of slow phonons,\nmore insights are needed to fully understand to what extent this mechanism\nsurvives at finite densities and in different regimes. We address these\nquestions using advanced tensor-network methods applied to the\nSu-Schrieffer-Heeger model. Studying both the spectral properties of isolated\nbipolarons as well as the pairing correlations at small finite densities, we\nfind evidence that the conventional picture of bipolarons as molecular bound\nstates which undergo Bose-Einstein condensation may need to be reconsidered.\nInstead, our findings suggest correlation-driven formation of a fragmented\ncondensate with spatially separated polaron pairs, stabilized by strong\nrepulsive electron-electron interactions at moderate values of the\nelectron-phonon coupling. These spatially modulated charge clouds exhibit\npairing with a typical length-scale set by the Fermi momentum.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:10:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Grundner","Martin",""],["Blatz","Tizian",""],["Sous","John",""],["Schollw\u00f6ck","Ulrich",""],["Paeckel","Sebastian",""]]}
{"id":"2308.13428","submitter":"Sunil Chebolu","authors":"Sunil K. Chebolu, Jonathan Merzel, J\\'an Min\\'a\\v{c}, Tung T. Nguyen,\n  Federico Pasini, Nguy\\^en Duy T\\^an","title":"On the arithmetic of the join rings over finite fields","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.NT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Given a collection $\\{ G_i\\}_{i=1}^d$ of finite groups and a ring $R$, we\nhave previously introduced and studied certain foundational properties of the\njoin ring $\\mathcal{J}_{G_1, G_2, \\ldots, G_d}(R)$. This ring bridges two\nextreme worlds: matrix algebras $M_n(R)$ on one end and group algebras $RG$ on\nthe other. The construction of this ring was motivated by various problems in\ngraph theory, network theory, nonlinear dynamics, and neuroscience. In this\npaper, we continue our investigations of this ring, focussing more on its\narithmetic properties. We begin by constructing a generalized augmentation map\nthat gives a structural decomposition of this ring. This decomposition allows\nus to compute the zeta function of the join of group rings. We show that the\njoin of group rings is a natural home for studying the concept of simultaneous\nprimitive roots for a given set of primes. This concept is related to the order\nof the unit group of the join of group rings. Finally, we characterize the join\nof group rings over finite fields with the property that the order of every\nunit divides a fixed number. Remarkably, Mersenne and Fermat primes\nunexpectedly emerge within the context of this exploration.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:13:29 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chebolu","Sunil K.",""],["Merzel","Jonathan",""],["Min\u00e1\u010d","J\u00e1n",""],["Nguyen","Tung T.",""],["Pasini","Federico",""],["T\u00e2n","Nguy\u00ean Duy",""]]}
{"id":"2308.13429","submitter":"Bin Lin","authors":"Bin Lin, Gregorio Robles","title":"Investigating the Impact of Vocabulary Difficulty and Code Naturalness\n  on Program Comprehension","comments":"Accepted at ICSME 2023 Registered Reports Track","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Context: Developers spend most of their time comprehending source code during\nsoftware development. Automatically assessing how readable and understandable\nsource code is can provide various benefits in different tasks, such as task\ntriaging and code reviews. While several studies have proposed approaches to\npredict software readability and understandability, most of them only focus on\nlocal characteristics of source code. Besides, the performance of\nunderstandability prediction is far from satisfactory.\n  Objective: In this study, we aim to assess readability and understandability\nfrom the perspective of language acquisition. More specifically, we would like\nto investigate whether code readability and understandability are correlated\nwith the naturalness and vocabulary difficulty of source code.\n  Method: To assess code naturalness, we adopted the cross-entropy metric,\nwhile we use a manually crafted list of code elements with their assigned\nadvancement levels to assess the vocabulary difficulty. We will conduct a\nstatistical analysis to understand their correlations and analyze whether code\nnaturalness and vocabulary difficulty can be used to improve the performance of\ncode readability and understandability prediction methods. The study will be\nconducted on existing datasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:15:00 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lin","Bin",""],["Robles","Gregorio",""]]}
{"id":"2308.13430","submitter":"Ryu Ikeda","authors":"Ryu Ikeda, Seikou Kato, Kei-Ichi Kondo, Akihiro Shibata","title":"Gauge-independent transition separating confinement-Higgs phase in the\n  lattice SU(2) gauge-fundamental scalar model","comments":"27 pages, 15 figures","journal-ref":null,"doi":null,"report-no":"CHIBA-EP-259, KEK Preprint 2023-27","categories":"hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  According to the conventional studies, the lattice SU(2) gauge-scalar model\nwith a single scalar field in the fundamental representation of the gauge group\nhas a single confinement-Higgs phase where Confinement and Higgs regions are\nsubregions of an analytically continued single phase and there are no\nthermodynamic phase transitions, which is a well-known consequence of the\nOsterwalder-Seiler-Fradkin-Shenker theorem. In this paper, however, we show\nthat we can define new type of gauge-invariant operators by combining the\noriginal fundamental scalar field and the so-called color-direction field which\nis obtained by change of field variables based on the gauge-covariant\ndecomposition of the gauge field due to Cho-Duan-Ge-Shabanov and Faddeev-Niemi.\nBy performing the numerical simulations on the lattice without any gauge\nfixing, we find a new transition line detected by the new gauge-invariant\noperators which completely separate the confinement-Higgs phase into two parts,\nconfinement phase and the Higgs phase, in the strong gauge coupling, while it\nagrees with the conventional thermodynamic transition line in the weak gauge\ncoupling. All results are obtained in the gauge-independent way, since no gauge\nfixing has been imposed in the numerical simulations. Moreover, we give a\nphysical interpretation for the new transition from the viewpoint of the\nrealization of a global symmetry.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:22:40 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Ikeda","Ryu",""],["Kato","Seikou",""],["Kondo","Kei-Ichi",""],["Shibata","Akihiro",""]]}
{"id":"2308.13431","submitter":"Theodor Misiakiewicz Mr.","authors":"Theodor Misiakiewicz, Andrea Montanari","title":"Six Lectures on Linearized Neural Networks","comments":"77 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In these six lectures, we examine what can be learnt about the behavior of\nmulti-layer neural networks from the analysis of linear models. We first recall\nthe correspondence between neural networks and linear models via the so-called\nlazy regime. We then review four models for linearized neural networks: linear\nregression with concentrated features, kernel ridge regression, random feature\nmodel and neural tangent model. Finally, we highlight the limitations of the\nlinear theory and discuss how other approaches can overcome them.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:23:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Misiakiewicz","Theodor",""],["Montanari","Andrea",""]]}
{"id":"2308.13432","submitter":"Kyle Miller","authors":"Kyle G. Miller, Jacob R. Pierce, Manfred V. Ambat, Jessica L. Shaw,\n  Kale Weichman, Warren B. Mori, Dustin H. Froula, and John P. Palastro","title":"Dephasingless laser wakefield acceleration in the bubble regime","comments":"18 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.acc-ph physics.comp-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Laser wakefield accelerators (LWFAs) have electric fields that are orders of\nmagnitude larger than those of conventional accelerators, promising an\nattractive, small-scale alternative for next-generation light sources and\nlepton colliders. The maximum energy gain in a single-stage LWFA is limited by\ndephasing, which occurs when the trapped particles outrun the accelerating\nphase of the wakefield. Here, we demonstrate that a single space-time\nstructured laser pulse can be used for ionization injection and electron\nacceleration over many dephasing lengths in the bubble regime. Simulations of a\ndephasingless laser wakefield accelerator driven by a 6.2-J laser pulse show 25\npC of injected charge accelerated over 20 dephasing lengths (1.3 cm) to a\nmaximum energy of 2.1 GeV. The space-time structured laser pulse features an\nultrashort, programmable-trajectory focus. Accelerating the focus, reducing the\nfocused spot-size variation, and mitigating unwanted self-focusing stabilize\nthe electron acceleration, which improves beam quality and leads to projected\nenergy gains of 125 GeV in a single, sub-meter stage driven by a 500-J pulse.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:25:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Miller","Kyle G.",""],["Pierce","Jacob R.",""],["Ambat","Manfred V.",""],["Shaw","Jessica L.",""],["Weichman","Kale",""],["Mori","Warren B.",""],["Froula","Dustin H.",""],["Palastro","John P.",""]]}
{"id":"2308.13433","submitter":"Tom Westermann","authors":"Tom Westermann, Milapji Singh Gill, Alexander Fay","title":"Representing Timed Automata and Timing Anomalies of Cyber-Physical\n  Production Systems in Knowledge Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Model-Based Anomaly Detection has been a successful approach to identify\ndeviations from the expected behavior of Cyber-Physical Production Systems.\nSince manual creation of these models is a time-consuming process, it is\nadvantageous to learn them from data and represent them in a generic formalism\nlike timed automata. However, these models - and by extension, the detected\nanomalies - can be challenging to interpret due to a lack of additional\ninformation about the system. This paper aims to improve model-based anomaly\ndetection in CPPS by combining the learned timed automaton with a formal\nknowledge graph about the system. Both the model and the detected anomalies are\ndescribed in the knowledge graph in order to allow operators an easier\ninterpretation of the model and the detected anomalies. The authors\nadditionally propose an ontology of the necessary concepts. The approach was\nvalidated on a five-tank mixing CPPS and was able to formally define both\nautomata model as well as timing anomalies in automata execution.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:25:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Westermann","Tom",""],["Gill","Milapji Singh",""],["Fay","Alexander",""]]}
{"id":"2308.13434","submitter":"Jason Hindes","authors":"Jason Hindes, Ira B. Schwartz, and Melvyn Tyloo","title":"Large and small fluctuations in oscillator networks from heterogeneous\n  and correlated noise","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS cond-mat.dis-nn nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Oscillatory networks subjected to noise are broadly used to model physical\nand technological systems. Due to their nonlinear coupling, such networks\ntypically have multiple stable and unstable states that a network might visit\ndue to noise. In this manuscript, we focus on the assessment of fluctuations\nresulting from heterogeneous and correlated noise inputs on Kuramoto model\nnetworks. We evaluate the typical, small fluctuations near synchronized states\nand connect the network variance to the overlap between stable modes of\nsynchronization and the input noise covariance. Going beyond small to large\nfluctuations, we introduce the indicator mode approximation, that projects the\ndynamics onto a single amplitude dimension. Such an approximation allows for\nestimating rates of fluctuations to saddle instabilities, resulting in phase\nslips between connected oscillators. Statistics for both regimes are quantified\nin terms of effective noise amplitudes that are compared and contrasted for\nseveral noise models. Bridging the gap between small and large fluctuations, we\nshow that a larger network variance does not necessarily lead to higher rates\nof large fluctuations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:28:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hindes","Jason",""],["Schwartz","Ira B.",""],["Tyloo","Melvyn",""]]}
{"id":"2308.13435","submitter":"Vincenzo Sapienza","authors":"Vincenzo Sapienza, Marco Miceli, Oleh Petruk, Aya Bamba, Salvatore\n  Orlando, Fabrizio Bocchino and Giovanni Peres","title":"Unraveling the Effects of Dense Medium on a Near to Bohm-Limit\n  Acceleration in Kepler's SNR","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC\n  2023), 8 pages, 2 figures, 2 tables","journal-ref":null,"doi":"10.22323/1.444.0843","report-no":"PoS(ICRC2023)843","categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The maximum energy of electrons accelerated by supernova remnants (SNR) is\ntypically limited by radiative losses. In this scenario, the synchrotron\ncooling time scale is equal to the acceleration time scale. On the other hand,\nthe low propagation speed of a shock in a dense medium is expected to result in\nan extended acceleration time scale, thus inducing a decrease in the maximum\nelectron energy for a given SNR age and in the X-ray nonthermal flux. The young\nKepler's SNR shows an enhanced efficiency of the acceleration process, which is\nclose to the Bohm limit in the north of its shell, where the shock is slowed\ndown by a dense circumstellar medium. Conversely, in the south, where no\ninteraction with a dense medium is evident and the shock speed is high, the\nacceleration proceeds with a higher Bohm factor. To investigate this scenario,\nwe studied the temporal evolution of the non-thermal emission, taking advantage\nof two Chandra X-ray observations of Kepler's SNR (performed in 2006 and 2014).\nWe analyzed the spectra of different filaments both in the north and south of\nthe shell, and measured their proper motion. We found a region with low shock\nvelocity where we measured a significant decrease in flux from 2006 to 2014.\nThis could be the first evidence of fading synchrotron emission in Kepler's\nSNR. This result suggests that under a certain threshold of shock speed the\nacceleration process could exit the loss-limited regime.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:33:01 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sapienza","Vincenzo",""],["Miceli","Marco",""],["Petruk","Oleh",""],["Bamba","Aya",""],["Orlando","Salvatore",""],["Bocchino","Fabrizio",""],["Peres","Giovanni",""]]}
{"id":"2308.13436","submitter":"Yongding Tian","authors":"Matthijs A. Reukers, Yongding Tian, Zaid Al-Ars, Peter Hofstee,\n  Matthijs Brobbel, Johan Peltenburg, Jeroen van Straten","title":"An Intermediate Representation for Composable Typed Streaming Dataflow\n  Designs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Tydi is an open specification for streaming dataflow designs in digital\ncircuits, allowing designers to express how composite and variable-length data\nstructures are transferred over streams using clear, data-centric types. These\ndata types are extensively used in a many application domains, such as big data\nand SQL applications. This way, Tydi provides a higher-level method for\ndefining interfaces between components as opposed to existing bit and\nbyte-based interface specifications. In this paper, we introduce an open-source\nintermediate representation (IR) which allows for the declaration of Tydi's\ntypes. The IR enables creating and connecting components with Tydi Streams as\ninterfaces, called Streamlets. It also lets backends for synthesis and\nsimulation retain high-level information, such as documentation. Types and\nStreamlets can be easily reused between multiple projects, and Tydi's streams\nand type hierarchy can be used to define interface contracts, which aid\ncollaboration when designing a larger system. The IR codifies the rules and\nproperties established in the Tydi specification and serves to complement\ncomputation-oriented hardware design tools with a data-centric view on\ninterfaces. To support different backends and targets, the IR is focused on\nexpressing interfaces, and complements behavior described by hardware\ndescription languages and other IRs. Additionally, a testing syntax for the\nverification of inputs and outputs against abstract streams of data, and for\nsubstituting interdependent components, is presented which allows for the\nspecification of behavior. To demonstrate this IR, we have created a grammar,\nparser, and query system, and paired these with a backend targeting VHDL.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:33:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Reukers","Matthijs A.",""],["Tian","Yongding",""],["Al-Ars","Zaid",""],["Hofstee","Peter",""],["Brobbel","Matthijs",""],["Peltenburg","Johan",""],["van Straten","Jeroen",""]]}
{"id":"2308.13437","submitter":"Chi Chen","authors":"Chi Chen, Ruoyu Qin, Fuwen Luo, Xiaoyue Mi, Peng Li, Maosong Sun, Yang\n  Liu","title":"Position-Enhanced Visual Instruction Tuning for Multimodal Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Multimodal Large Language Models (MLLMs) that enable Large Language\nModels (LLMs) to interpret images through visual instruction tuning have\nachieved significant success. However, existing visual instruction tuning\nmethods only utilize image-language instruction data to align the language and\nimage modalities, lacking a more fine-grained cross-modal alignment. In this\npaper, we propose Position-enhanced Visual Instruction Tuning (PVIT), which\nextends the functionality of MLLMs by integrating an additional region-level\nvision encoder. This integration promotes a more detailed comprehension of\nimages for the MLLM. In addition, to efficiently achieve a fine-grained\nalignment between the vision modules and the LLM, we design multiple data\ngeneration strategies to construct an image-region-language instruction\ndataset. Finally, we present both quantitative experiments and qualitative\nanalysis that demonstrate the superiority of the proposed model. Code and data\nwill be released at https://github.com/THUNLP-MT/PVIT.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:33:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Chen","Chi",""],["Qin","Ruoyu",""],["Luo","Fuwen",""],["Mi","Xiaoyue",""],["Li","Peng",""],["Sun","Maosong",""],["Liu","Yang",""]]}
{"id":"2308.13438","submitter":"Denis Patterson Dr","authors":"Denis D. Patterson, Simon A. Levin, A. Carla Staver, and Jonathan D.\n  Touboul","title":"Pattern Formation in Mesic Savannas","comments":"27 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyze a spatially extended version of a well-known model of\nforest-savanna dynamics, which presents as a system of nonlinear partial\nintegro-differential equations, and study necessary conditions for\npattern-forming bifurcations. Analytically, we show that homogeneous solutions\ndominate the dynamics of the standard forest-savanna model, regardless of the\nlength scales of the various spatial processes considered. However, several\ndifferent pattern-forming scenarios are possible upon including spatial\nresource limitation, such as competition for water, soil nutrients, or\nherbivory effects. Using numerical simulations and continuation, we study the\nnature of the resulting patterns as a function of system parameters and length\nscales, uncovering subcritical pattern-forming bifurcations and observing\nsignificant regions of multistability for realistic parameter regimes. Finally,\nwe discuss our results in the context of extant savanna-forest modeling efforts\nand highlight ongoing challenges in building a unifying mathematical model for\nsavannas across different rainfall levels.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:35:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Patterson","Denis D.",""],["Levin","Simon A.",""],["Staver","A. Carla",""],["Touboul","Jonathan D.",""]]}
{"id":"2308.13439","submitter":"Jason Hindes","authors":"Jason Hindes, Luis Mier-y-Teran-Romero, Ira B. Schwartz, and Michael\n  Assaf","title":"Outbreak-size distributions under fluctuating rates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the effect of noisy infection (contact) and recovery rates on the\ndistribution of outbreak sizes in the stochastic SIR model. The rates are\nmodeled as Ornstein-Uhlenbeck processes with finite correlation time and\nvariance, which we illustrate using outbreak data from the RSV 2019-2020 season\nin the US. In the limit of large populations, we find analytical solutions for\nthe outbreak-size distribution in the long-correlated (adiabatic) and\nshort-correlated (white) noise regimes, and demonstrate that the distribution\ncan be highly skewed with significant probabilities for large fluctuations away\nfrom mean-field theory. Furthermore, we assess the relative contribution of\ndemographic and reaction-rate noise on the outbreak-size variance, and show\nthat demographic noise becomes irrelevant in the presence of slowly varying\nreaction-rate noise but persists for large system sizes if the noise is fast.\nFinally, we show that the crossover to the white-noise regime typically occurs\nfor correlation times that are on the same order as the characteristic recovery\ntime in the model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:35:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hindes","Jason",""],["Mier-y-Teran-Romero","Luis",""],["Schwartz","Ira B.",""],["Assaf","Michael",""]]}
{"id":"2308.13440","submitter":"Frederic Teppe","authors":"S. S. Krishtopenko, A. V. Ikonnikov, B. Jouault, and F. Teppe","title":"Disorder-induced phase transitions in double HgTe quantum wells","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By using the self-consistent Born approximation, we investigate disorder\neffect induced by short-range impurities on the band-gap of a seminal\ntwo-dimensional (2D) system, whose phase diagram contains trivial,\nsingle-band-inverted and double-band-inverted states. Following the\ndensity-of-states (DOS) evolution, we demonstrate multiple closings and\nopenings of the band-gap with the increase of the disorder strength.\nCalculations of the spectral function describing the quasiparticles at the\n$\\Gamma$ point of the Brillouin zone evidence that the observed band-gap\nbehavior is unambiguously caused by the topological phase transitions due to\nthe mutual inversions between the first and second electron-like and hole-like\nsubbands. We also find that an increase in the disorder strength in the\ndouble-inverted state always leads to the band-gap closing due to the overlap\nof the tails of DOS from conduction and valence subbands.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:37:03 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Krishtopenko","S. S.",""],["Ikonnikov","A. V.",""],["Jouault","B.",""],["Teppe","F.",""]]}
{"id":"2308.13441","submitter":"Yuta Sato","authors":"Yuta Sato","title":"Mesh-Wise Prediction of Demographic Composition from Satellite Images\n  Using Multi-Head Convolutional Neural Network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Population aging is one of the most serious problems in certain countries. In\norder to implement its countermeasures, understanding its rapid progress is of\nurgency with a granular resolution. However, a detailed and rigorous survey\nwith high frequency is not feasible due to the constraints of financial and\nhuman resources. Nowadays, Deep Learning is prevalent for pattern recognition\nwith significant accuracy, with its application to remote sensing. This paper\nproposes a multi-head Convolutional Neural Network model with transfer learning\nfrom pre-trained ResNet50 for estimating mesh-wise demographics of Japan as one\nof the most aged countries in the world, with satellite images from\nLandsat-8/OLI and Suomi NPP/VIIRS-DNS as inputs and census demographics as\nlabels. The trained model was performed on a testing dataset with a test score\nof at least 0.8914 in $\\text{R}^2$ for all the demographic composition groups,\nand the estimated demographic composition was generated and visualised for 2022\nas a non-census year.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:41:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sato","Yuta",""]]}
{"id":"2308.13442","submitter":"Reza Azad","authors":"Reza Azad, Amirhossein Kazerouni, Alaa Sulaiman, Afshin Bozorgpour,\n  Ehsan Khodapanah Aghdam, Abin Jose, Dorit Merhof","title":"Unlocking Fine-Grained Details with Wavelet-based High-Frequency\n  Enhancement in Transformers","comments":"Accepted in MICCAI 2023 workshop MLMI","journal-ref":"MICCAI 2023 workshop","doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Medical image segmentation is a critical task that plays a vital role in\ndiagnosis, treatment planning, and disease monitoring. Accurate segmentation of\nanatomical structures and abnormalities from medical images can aid in the\nearly detection and treatment of various diseases. In this paper, we address\nthe local feature deficiency of the Transformer model by carefully re-designing\nthe self-attention map to produce accurate dense prediction in medical images.\nTo this end, we first apply the wavelet transformation to decompose the input\nfeature map into low-frequency (LF) and high-frequency (HF) subbands. The LF\nsegment is associated with coarse-grained features while the HF components\npreserve fine-grained features such as texture and edge information. Next, we\nreformulate the self-attention operation using the efficient Transformer to\nperform both spatial and context attention on top of the frequency\nrepresentation. Furthermore, to intensify the importance of the boundary\ninformation, we impose an additional attention map by creating a Gaussian\npyramid on top of the HF components. Moreover, we propose a multi-scale context\nenhancement block within skip connections to adaptively model inter-scale\ndependencies to overcome the semantic gap among stages of the encoder and\ndecoder modules. Throughout comprehensive experiments, we demonstrate the\neffectiveness of our strategy on multi-organ and skin lesion segmentation\nbenchmarks. The implementation code will be available upon acceptance.\n\\href{https://github.com/mindflow-institue/WaveFormer}{GitHub}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:42:19 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Azad","Reza",""],["Kazerouni","Amirhossein",""],["Sulaiman","Alaa",""],["Bozorgpour","Afshin",""],["Aghdam","Ehsan Khodapanah",""],["Jose","Abin",""],["Merhof","Dorit",""]]}
{"id":"2308.13443","submitter":"Tapio Kurkinen","authors":"Tapio Kurkinen, Jarkko Siltakoski","title":"Intrinsic Harnack's inequality for a general nonlinear parabolic\n  equation in non-divergence form","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove the intrinsic Harnack's inequality for a general form of a parabolic\nequation that generalizes both the standard parabolic $p$-Laplace equation and\nthe normalized version arising from stochastic game theory. We prove each\nresult for the optimal range of exponents and ensure that we get stable\nconstants.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:43:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kurkinen","Tapio",""],["Siltakoski","Jarkko",""]]}
{"id":"2308.13444","submitter":"Eugenia Usenko Leonidovna","authors":"Evgeniya Usenko, Alexander Glamazda, Anastasiia Svidzerska, Vladimir\n  Valeev, Anna Laguta, Sergey Petrushenko, Victor Karachevtsev","title":"DNA-TiO$_{2}$ nanoparticle nanoassembies: effect of temperature and\n  nanoparticles concentration on aggregation","comments":"14 pages, 5 figures","journal-ref":"J. Nanopart. Res., Vol. 25, Article number: 113 (2023)","doi":"10.1007/s11051-023-05770-x","report-no":null,"categories":"physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  TiO$_{2}$ nanoparticles (NPs) have unique photocatalytic properties, which\nare used in food industries, medicine, biosensorics, and solar energy\nconversion. Since the toxic properties of TiO$_{2}$ NPs have been\ninsufficiently studied, additional information on the molecular mechanisms of\ntheir biological action on the structure and stability of biological\nmacromolecules is needed, especially concerning DNA. In this work exploiting\nthe differential UV-visible spectroscopy, the effect of the heating (from 20\ntill 90 $^0$C) and concentration of TiO$_{2}$ NPs ((1-3)$\\times$10$^-$$^4$ M)\non a conformation of native DNA adsorbed on TiO$_{2}$ NPs in a buffer solution\n(pH 5) is studied. Analysis of dynamic light scattering (DLS) data for the\nDNA:TiO$_{2}$ NPs suspension revealed that when the temperature increases the\nseparated DNA:TiO$_{2}$ NP nanoassemblies form nanoaggregates. Correlation\nbetween the thermal dependency of the DLS data and thermal DNA denaturation\nmeasurements indicated that the appearance of the single-stranded unwound\nregions in double-stranded DNA in the suspension with temperature rise promotes\nthe effective formation of the DNA:TiO$_{2}$ NPs nanoaggregates.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:43:49 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Usenko","Evgeniya",""],["Glamazda","Alexander",""],["Svidzerska","Anastasiia",""],["Valeev","Vladimir",""],["Laguta","Anna",""],["Petrushenko","Sergey",""],["Karachevtsev","Victor",""]]}
{"id":"2308.13445","submitter":"Marco Benedetti","authors":"Marco Benedetti and Louis Carillo and Enzo Marinari and Marc M\\`ezard","title":"Eigenvector Dreaming","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Among the performance-enhancing procedures for Hopfield-type networks that\nimplement associative memory, Hebbian Unlearning (or dreaming) strikes for its\nsimplicity and its clear biological interpretation. Yet, it does not easily\nlend itself to a clear analytical understanding. Here we show how Hebbian\nUnlearning can be effectively described in terms of a simple evolution of the\nspectrum and the eigenvectors of the coupling matrix. We use these ideas to\ndesign new dreaming algorithms that are effective from a computational point of\nview, and are analytically far more transparent than the original scheme.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 16:18:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Benedetti","Marco",""],["Carillo","Louis",""],["Marinari","Enzo",""],["M\u00e8zard","Marc",""]]}
{"id":"2308.13446","submitter":"Chen Li","authors":"Chen Li, Jelle S. Kaastra, Liyi Gu, Missagh Mehdipour","title":"Density calculations of NGC 3783 warm absorbers using a time-dependent\n  photoionization model","comments":"Accepted for publication in A&A, 13 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Outflowing wind as one type of AGN feedback, which involves noncollimated\nionized winds prevalent in Seyfert-1 AGNs, impacts their host galaxy by\ncarrying kinetic energy outwards. However, the distance of the outflowing wind\nis poorly constrained due to a lack of direct imaging observations, which\nlimits our understanding of their kinetic power and therefore makes the impact\non the local galactic environment unclear. One potential approach involves a\ndetermination of the density of the ionized plasma, making it possible to\nderive the distance using the ionization parameter {\\xi}, which can be measured\nbased on the ionization state. Here, by applying a new time-dependent\nphotoionization model, tpho, in SPEX, we define a new approach, the tpho-delay\nmethod, to calculate/predict a detectable density range for warm absorbers of\nNGC 3783. The tpho model solves self-consistently the time-dependent ionic\nconcentrations, which enables us to study delayed states of the plasma in\ndetail. We show that it is crucial to model the non-equilibrium effects\naccurately for the delayed phase, where the non-equilibrium and equilibrium\nmodels diverge significantly. Finally, we calculate the crossing time to\nconsider the effect of the transverse motion of the outflow on the intrinsic\nluminosity variation. It is expected that future spectroscopic observations\nwith more sensitive instruments will provide more accurate constraints on the\noutflow density, and thereby on the feedback energetics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:47:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Chen",""],["Kaastra","Jelle S.",""],["Gu","Liyi",""],["Mehdipour","Missagh",""]]}
{"id":"2308.13447","submitter":"wilfrid azan","authors":"Wilfrid Azan (COACTIS, BETA), Yuan Li (COACTIS)","title":"Scientific knowledge production of blockchain: A bibliometric and\n  lexicometric review","comments":null,"journal-ref":"Gestion 2000, 2023, 40 (1), pp.37 {\\`a} 57","doi":null,"report-no":null,"categories":"cs.DL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While recent reviews of blockchain technology have focused on the latest\ndevelopments in cryptocurrency and their derivative impacts, less attention has\nbeen given to analysing their knowledge paths and boundaries based on past\nresearch to guide their development. To address this gap, we conducted both a\nbibliometric study of 2525 articles and a lexicometric study of 123 articles.\nThe bibliometric study provided holistic insights into the evolution and\ndistribution of blockchain research, including influential researchers and\ncountries, discipline composition, knowledge development trends, and emerging\nfrontiers. The lexicometric study identified the boundary concept structure\nwith a quantitative textual approach, extracting the strongest signifying\nepistemic communities. Our findings indicate that blockchain research draws\nfrom four major disciplines, making it a multidisciplinary field. With the\nincreasing maturity and development of technological infrastructure, the\napplication and management of blockchain become increasingly relevant issues.\nOur analysis suggests that blockchain can be considered more of a boundary\nobject than a disruptive change from knowledge perspectives. Therefore, this\npaper proposes a comprehensive understanding of the development path and\nepistemic concepts of blockchain research.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 09:19:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Azan","Wilfrid","","COACTIS, BETA"],["Li","Yuan","","COACTIS"]]}
{"id":"2308.13448","submitter":"Christoph Adelsberger","authors":"Christoph Adelsberger, Stefano Bosco, Jelena Klinovaja, and Daniel\n  Loss","title":"Valley-free silicon fins by shear strain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electron spins confined in silicon quantum dots are promising candidates for\nlarge-scale quantum computers. However, the degeneracy of the conduction band\nof bulk silicon introduces additional levels dangerously close to the window of\ncomputational energies, where the quantum information can leak. The energy of\nthe valley states - typically 0.1 meV - depends on hardly controllable\natomistic disorder and still constitutes a fundamental limit to the scalability\nof these architectures. In this work, we introduce designs of CMOS-compatible\nsilicon fin field-effect transistors that enhance the energy gap to\nnon-computational states by more than one order of magnitude. Our devices\ncomprise realistic silicon-germanium nanostructures with a large shear strain,\nwhere troublesome valley degrees of freedom are completely removed. The energy\nof non-computational states is therefore not affected by unavoidable atomistic\ndisorder and can further be tuned in-situ by applied electric fields. Our\ndesign ideas are directly applicable to a variety of setups and will offer a\nblueprint towards silicon-based large-scale quantum processors.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:50:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Adelsberger","Christoph",""],["Bosco","Stefano",""],["Klinovaja","Jelena",""],["Loss","Daniel",""]]}
{"id":"2308.13449","submitter":"Sungbae Chun","authors":"Aibek Bekbayev, Sungbae Chun, Yerzat Dulat, James Yamazaki","title":"The Poison of Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  From the perspective of content safety issues, alignment has shown to limit\nlarge language models' (LLMs) harmful content generation. This intentional\nmethod of reinforcing models to not respond to certain user inputs seem to be\npresent in many modern open-source instruction tuning datasets such as\nOpenAssistant or Guanaco. We introduce a novel insight to an instruction-tuned\nmodel's performance affected by the presence of alignment in supervised\nfine-tuning dataset. To be specific, we noticed that alignment acts as if it is\npoisoning the instruction dataset. Experimentally, we demonstrate that aligned\nanswers significantly worsen the performance of the resulting fine-tuned\nmodel's on various reasoning benchmarks such as Big Bench (BBH), Massive\nMultitask Language Understanding (MMLU), Human Eval, and Discrete Reasoning\nOver Paragraphs (DROP), performing worse than the counterpart tuned without\nalignment by 4-33%.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:51:15 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bekbayev","Aibek",""],["Chun","Sungbae",""],["Dulat","Yerzat",""],["Yamazaki","James",""]]}
{"id":"2308.13451","submitter":"Zhirui Li","authors":"Zhirui Li, Ben Johnson, Daniel L. Sussman, Carey E. Priebe and Vince\n  Lyzinski","title":"Gotta match 'em all: Solution diversification in graph matching matched\n  filters","comments":"36 pages, 12 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG math.CO stat.AP stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel approach for finding multiple noisily embedded template\ngraphs in a very large background graph. Our method builds upon the\ngraph-matching-matched-filter technique proposed in Sussman et al., with the\ndiscovery of multiple diverse matchings being achieved by iteratively\npenalizing a suitable node-pair similarity matrix in the matched filter\nalgorithm. In addition, we propose algorithmic speed-ups that greatly enhance\nthe scalability of our matched-filter approach. We present theoretical\njustification of our methodology in the setting of correlated Erdos-Renyi\ngraphs, showing its ability to sequentially discover multiple templates under\nmild model conditions. We additionally demonstrate our method's utility via\nextensive experiments both using simulated models and real-world dataset,\ninclude human brain connectomes and a large transactional knowledge base.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:53:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Li","Zhirui",""],["Johnson","Ben",""],["Sussman","Daniel L.",""],["Priebe","Carey E.",""],["Lyzinski","Vince",""]]}
{"id":"2308.13452","submitter":"Ilya Kondratyev","authors":"Ilya V. Kondratyev, Veronika V. Ivanova, Sergey A. Zhuravitskii, Artem\n  S. Argenchiev, Nikolay N. Skryabin, Ivan V. Dyakonov, Suren A. Fldzhyan,\n  Mikhail Yu. Saygin, Stanislav S. Straupe, Alexander A. Korneev, Sergei P.\n  Kulik","title":"Large-scale error-tolerant programmable interferometer fabricated by\n  femtosecond laser writing","comments":"14 pages, 11 figures, 1 Table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a programmable 8-port interferometer with the recently proposed\nerror-tolerant architecture capable of performing a broad class of\ntransformations. The interferometer has been fabricated with femtosecond laser\nwriting and it is the largest programmable interferometer of this kind to date.\nWe have demonstrated its advantageous error tolerance by showing an operation\nin a broad wavelength range from $920$ to $980$ nm, which is particularly\nrelevant for quantum photonics due to efficient photon sources. Our work\nhighlights the importance of developing novel architectures of programmable\nphotonics for information processing.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:54:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kondratyev","Ilya V.",""],["Ivanova","Veronika V.",""],["Zhuravitskii","Sergey A.",""],["Argenchiev","Artem S.",""],["Skryabin","Nikolay N.",""],["Dyakonov","Ivan V.",""],["Fldzhyan","Suren A.",""],["Saygin","Mikhail Yu.",""],["Straupe","Stanislav S.",""],["Korneev","Alexander A.",""],["Kulik","Sergei P.",""]]}
{"id":"2308.13453","submitter":"David Steinmann","authors":"David Steinmann, Wolfgang Stammer, Felix Friedrich, Kristian Kersting","title":"Learning to Intervene on Concept Bottlenecks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While traditional deep learning models often lack interpretability, concept\nbottleneck models (CBMs) provide inherent explanations via their concept\nrepresentations. Specifically, they allow users to perform interventional\ninteractions on these concepts by updating the concept values and thus\ncorrecting the predictive output of the model. Traditionally, however, these\ninterventions are applied to the model only once and discarded afterward. To\nrectify this, we present concept bottleneck memory models (CB2M), an extension\nto CBMs. Specifically, a CB2M learns to generalize interventions to appropriate\nnovel situations via a two-fold memory with which it can learn to detect\nmistakes and to reapply previous interventions. In this way, a CB2M learns to\nautomatically improve model performance from a few initially obtained\ninterventions. If no prior human interventions are available, a CB2M can detect\npotential mistakes of the CBM bottleneck and request targeted interventions. In\nour experimental evaluations on challenging scenarios like handling\ndistribution shifts and confounded training data, we illustrate that CB2M are\nable to successfully generalize interventions to unseen data and can indeed\nidentify wrongly inferred concepts. Overall, our results show that CB2M is a\ngreat tool for users to provide interactive feedback on CBMs, e.g., by guiding\na user's interaction and requiring fewer interventions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:54:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Steinmann","David",""],["Stammer","Wolfgang",""],["Friedrich","Felix",""],["Kersting","Kristian",""]]}
{"id":"2308.13454","submitter":"Pascal Gutjahr","authors":"Pascal Gutjahr, Jean-Marco Alameddine, Alexander Sandrock, Jan\n  Soedingrekso, Mirco H\\\"unnefeld and Wolfgang Rhode","title":"The Relevance of Muon Deflections for Neutrino Telescopes","comments":"8 pages, 5 figures, ICRC 2023, published in PoS","journal-ref":null,"doi":"10.22323/1.444.1197","report-no":null,"categories":"hep-ex physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large-scale neutrino telescopes have the primary objective to detect and\ncharacterize neutrino sources in the universe. These experiments rely on the\ndetection of charged leptons produced in the interaction of neutrinos with\nnuclei. Angular resolutions are estimated to be better than 1 degree, which is\nachieved by the reconstruction of muons. This angular resolution is a measure\nof the accuracy with which the direction of incoming neutrinos can be\ndetermined. Since muons can traverse distances of several kilometers through\nmedia, the original muon direction can differ from the muon direction inside\nthe detector due to deflections by stochastic interactions and multiple\nscattering. In this contribution, a recently published study of muon\ndeflections based on the simulation tool PROPOSAL is presented. Muons with\nvarious energies are propagated through different media over several distances.\nData-Monte-Carlo comparisons as well as comparisons to the simulation tools\nMUSIC and Geant4 are performed. Finally, the impact of muon deflections on\nlarge-scale neutrino telescopes is discussed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:01:24 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gutjahr","Pascal",""],["Alameddine","Jean-Marco",""],["Sandrock","Alexander",""],["Soedingrekso","Jan",""],["H\u00fcnnefeld","Mirco",""],["Rhode","Wolfgang",""]]}
{"id":"2308.13455","submitter":"Ilay Hoshen","authors":"Ilay Hoshen and Wojciech Samotij","title":"Simonovits's theorem in random graphs","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $H$ be a graph with $\\chi(H) = r+1$. Simonovits's theorem states that, if\n$H$ is edge-critical, the unique largest $H$-free subgraph of $K_n$ is its\nlargest $r$-partite subgraph, provided that $n$ is sufficiently large. We show\nthat the same holds with $K_n$ replaced by the binomial random graph $G_{n,p}$\nwhenever $H$ is also strictly $2$-balanced and $p \\ge (\\theta_H+o(1))\nn^{-\\frac{1}{m_2(H)}} (\\log n)^{\\frac{1}{e_H-1}}$ for some explicit constant\n$\\theta_H$, which we believe to be optimal. This (partially) resolves a\nconjecture of DeMarco and Kahn.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:02:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hoshen","Ilay",""],["Samotij","Wojciech",""]]}
{"id":"2308.13456","submitter":"Ben Heuer","authors":"Ben Heuer, Annette Werner, Mingjia Zhang","title":"$p$-adic Simpson correspondences for principal bundles in abelian\n  settings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore generalizations of the $p$-adic Simpson correspondence on smooth\nproper rigid spaces to principal bundles under rigid group varieties $G$. For\ncommutative $G$, we prove that such a correspondence exists if and only if the\nLie group logarithm is surjective. Second, we treat the case of general $G$\nwhen $X$ is itself an ordinary abelian variety, in which case we prove a\ngeneralisation of Faltings' ``small'' correspondence to general rigid groups.\nOn abeloid varieties, we also prove an analog of the classical Corlette-Simpson\ncorrespondence for principal bundles under linear algebraic groups.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:03:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Heuer","Ben",""],["Werner","Annette",""],["Zhang","Mingjia",""]]}
{"id":"2308.13457","submitter":"Kendra Killpatrick","authors":"Kendra Killpatrick","title":"Super FiboCatalan Numbers and Generalized FiboCatalan Numbers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Catalan observed in 1874 that the numbers $S(m,n) = \\frac{(2m)! (2n)!}{m! n!\n(m+n)!}$, now called the super Catalan numbers, are integers but there is still\nno known combinatorial interpretation for them in general, although\ninterpretations have been given for the case $m=2$ and for $S(m, m+s)$ for $0\n\\leq s \\leq 3$. In this paper, we define the super FiboCatalan numbers\n$S(m,n)_F = \\frac{F_{2m}! F_{2n}!}{F_m! F_n! F_{m+n}!}$ and prove they are\nintegers for $m=1$ and $m=2$. In addition, we prove that $S(m, m+s)_F$ is an\ninteger for $0 \\leq s \\leq 4$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:04:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Killpatrick","Kendra",""]]}
{"id":"2308.13458","submitter":"Lorenzo Corti","authors":"Lorenzo Corti and Jie Yang","title":"ARTIST: ARTificial Intelligence for Simplified Text","comments":"6 pages, 1 figure. Presented at the 'Generative AI and HCI' workshop\n  (https://generativeaiandhci.github.io/) at CHI 2023 in Hamburg, Germany","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Complex text is a major barrier for many citizens when accessing public\ninformation and knowledge. While often done manually, Text Simplification is a\nkey Natural Language Processing task that aims for reducing the linguistic\ncomplexity of a text while preserving the original meaning. Recent advances in\nGenerative Artificial Intelligence (AI) have enabled automatic text\nsimplification both on the lexical and syntactical levels. However, as\napplications often focus on English, little is understood about the\neffectiveness of Generative AI techniques on low-resource languages such as\nDutch. For this reason, we carry out empirical studies to understand the\nbenefits and limitations of applying generative technologies for text\nsimplification and provide the following outcomes: 1) the design and\nimplementation for a configurable text simplification pipeline that\norchestrates state-of-the-art generative text simplification models, domain and\nreader adaptation, and visualisation modules; 2) insights and lessons learned,\nshowing the strengths of automatic text simplification while exposing the\nchallenges in handling cultural and commonsense knowledge. These outcomes\nrepresent a first step in the exploration of Dutch text simplification and shed\nlight on future endeavours both for research and practice.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:06:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Corti","Lorenzo",""],["Yang","Jie",""]]}
{"id":"2308.13459","submitter":"Philip Ilten","authors":"Christan Bierlich, Philip Ilten, Tony Menzo, Stephen Mrenna, Manuel\n  Szewc, Michael K. Wilkinson, Ahmed Youssef, Jure Zupan","title":"Reweighting Monte Carlo Predictions and Automated Fragmentation\n  Variations in Pythia 8","comments":"17 pages, 7 figures, public code available","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-414-CSAID","categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work reports on a method for uncertainty estimation in simulated\ncollider-event predictions. The method is based on a Monte Carlo-veto\nalgorithm, and extends previous work on uncertainty estimates in parton showers\nby including uncertainty estimates for the Lund string-fragmentation model.\nThis method is advantageous from the perspective of simulation costs: a single\nensemble of generated events can be reinterpreted as though it was obtained\nusing a different set of input parameters, where each event now is accompanied\nwith a corresponding weight. This allows for a robust exploration of the\nuncertainties arising from the choice of input model parameters, without the\nneed to rerun full simulation pipelines for each input parameter choice. Such\nexplorations are important when determining the sensitivities of precision\nphysics measurements. Accompanying code is available at\nhttps://gitlab.com/uchep/mlhad-weights-validation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:06:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bierlich","Christan",""],["Ilten","Philip",""],["Menzo","Tony",""],["Mrenna","Stephen",""],["Szewc","Manuel",""],["Wilkinson","Michael K.",""],["Youssef","Ahmed",""],["Zupan","Jure",""]]}
{"id":"2308.13460","submitter":"Marko Maljkovic","authors":"Marko Maljkovic, Gustav Nilsson, and Nikolas Geroliminis","title":"Learning How to Price Charging in Electric Ride-Hailing Markets","comments":"Extended version of the paper accepted to the IEEE Conference on\n  Decision and Control (CDC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the electrification of ride-hailing fleets, there will be a need to\nincentivize where and when the ride-hailing vehicles should charge. In this\nwork, we assume that a central authority wants to control the distribution of\nthe vehicles and can do so by selecting charging prices. Since there will\nlikely be more than one ride-hailing company in the market, we model the\nproblem as a single-leader multiple-follower Stackelberg game. The followers,\ni.e., the companies, compete about the charging resources under given prices\nprovided by the leader. We present a learning algorithm based on the concept of\ncontextual bandits that allows the central authority to find an efficient\npricing strategy. We also show how the exploratory phase of the learning can be\nimproved if the leader has some partial knowledge about the companies'\nobjective functions. The efficiency of the proposed algorithm is demonstrated\nin a simulated case study for the city of Shenzhen, China.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:09:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Maljkovic","Marko",""],["Nilsson","Gustav",""],["Geroliminis","Nikolas",""]]}
{"id":"2308.13461","submitter":"Elizabeth Gonzalez Dr.","authors":"Elizabeth Johana Gonzalez, Agust\\'in Rodriguez-Medrano, Luis Alberto\n  Pereyra, Diego Garc\\'ia Lambas","title":"Cluster halo shapes in CDM and SIDM models: Unveiling the DM particle\n  nature using a weak lensing approach","comments":"15 pages, 13 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Self-interacting dark matter (SIDM) is an alternative to the standard\ncollisionless cold dark matter model (CDM), allowing for interactions between\nthe dark matter particles through the introduction of a self-scattering\ncross-section. However, the observable effects between these two scenarios are\nhard to detect. In this work we present a detailed analysis of an application\nof galaxy-galaxy lensing to measure with high precision the shapes of cluster\nhalos and how this approach can be used to obtain information regarding the\nnature of the dark matter particle. Using two sets of simulated data, SIDM and\nCDM simulations, we compute stacked shear maps centred on several subsets of\nhalos with masses $\\gtrsim 10^{13.5} M_\\odot$. From these maps, we obtain the\nquadrupole profiles related to the mean elongation of the particle distribution\nfrom which the shape parameters are derived. Accounting for a radial shape\nvariation, this technique provides an enhancement of the observed differences\nbetween the simulated data-sets which successfully differentiate between the\ntwo cosmological scenarios. In particular, we obtain a larger slope of the\nshape-radial relation for the halos identified in the SIDM simulation, which\nare rounder towards the centre. Also, as approaching to the mean virial radius,\nthe projected semi-axis ratios converge to similar values than in the CDM\nsimulation. Moreover, we account for the impact of the neighbouring mass, where\na more strongly elongated distributions is found for the halos in the SIDM\nsimulation, indicating that under dark matter self interaction, the large scale\nstructure imprints a more coherent accretion process.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:09:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gonzalez","Elizabeth Johana",""],["Rodriguez-Medrano","Agust\u00edn",""],["Pereyra","Luis Alberto",""],["Lambas","Diego Garc\u00eda",""]]}
{"id":"2308.13462","submitter":"Gert de Cooman","authors":"Gert de Cooman and Floris Persiau and Jasper De Bock","title":"Randomness and imprecision: from supermartingales to randomness tests","comments":"40 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalise the randomness test definitions in the literature for both the\nMartin-L\\\"of and Schnorr randomness of a series of binary outcomes, in order to\nallow for interval-valued rather than merely precise forecasts for these\noutcomes. We show that the resulting randomness notions are, under some\ncomputability and non-degeneracy conditions on the forecasts, equivalent to the\nmartingale-theoretic versions we introduced in earlier papers. In addition, we\nprove that our generalised notion of Martin-L\\\"of randomness can be\ncharacterised by universal supermartingales and universal randomness tests.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:09:51 GMT"}],"update_date":"2023-08-28","authors_parsed":[["de Cooman","Gert",""],["Persiau","Floris",""],["De Bock","Jasper",""]]}
{"id":"2308.13463","submitter":"Philipp Sch\\\"utte","authors":"Philipp Sch\\\"utte, Tobias Weich","title":"Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces\n  -- A Numerical Algorithm via Weighted Zeta Functions","comments":"52 pages, 25 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a numerical algorithm for the computation of invariant Ruelle\ndistributions on convex co-compact hyperbolic surfaces. This is achieved by\nexploiting the connection between invariant Ruelle distributions and residues\nof meromorphically continued weighted zeta functions established by the authors\ntogether with Barkhofen (2021). To make this applicable for numerics we express\nthe weighted zeta as the logarithmic derivative of a suitable parameter\ndependent Fredholm determinant similar to Borthwick (2014). As an additional\ndifficulty our transfer operator has to include a contracting direction which\nwe account for with techniques developed by Rugh (1992). We achieve a further\nimprovement in convergence speed for our algorithm in the case of surfaces with\nadditional symmetries by proving and applying a symmetry reduction of weighted\nzeta functions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:10:09 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sch\u00fctte","Philipp",""],["Weich","Tobias",""]]}
{"id":"2308.13464","submitter":"Bin Liu","authors":"Jeremias Gonzalez, Ajay Gopinathan, and Bin Liu","title":"Symmetry-group-protected microfluidics for multiplexed stress-free\n  manipulations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn cond-mat.soft physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern micromanipulation techniques typically involve trapping using\nelectromagnetic, acoustic or flow fields that produce stresses on the trapped\nparticles thereby precluding stress-free manipulations. Here, we show that by\nemploying polyhedral symmetries in a multichannel microfluidic design, we can\nseparate the tasks of displacing and trapping a particle into two distinct sets\nof flow operations, each characterized and protected by their unique groups of\nsymmetries. By combining only the displacing uniform flow modes to entrain and\nmove targeted particles in arbitrary directions, we were able to realize\nsymmetry-protected, stress-free micromanipulation in 3D. Furthermore, we\nengineered complex, microscale paths by programming and controlling the flow\nwithin each channel in real-time, resulting in multiple particles\nsimultaneously following desired paths in the absence of any supervision or\nfeedback. Our work therefore provides a general symmetry-group-based framework\nfor understanding and engineering microfluidics and a novel platform for 3D\nstress-free manipulations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:10:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gonzalez","Jeremias",""],["Gopinathan","Ajay",""],["Liu","Bin",""]]}
{"id":"2308.13465","submitter":"Tim A. Butcher","authors":"Tim A. Butcher, Nicholas W. Phillips, Chun-Chien Chiu, Chia-Chun Wei,\n  Sheng-Zhu Ho, Yi-Chun Chen, Erik Fr\\\"ojdh, Filippo Baruffaldi, Maria Carulla,\n  Jiaguo Zhang, Anna Bergamaschi, Carlos A. F. Vaz, Armin Kleibert, Simone\n  Finizio, Jan-Chi Yang, Shih-Wen Huang and J\\\"org Raabe","title":"Ptychographic nanoscale imaging of the magnetoelectric coupling in\n  freestanding BiFeO$_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Soft X-ray ptychography was employed to simultaneously image the\nferroelectric and antiferromagnetic domains in an 80 nm thick freestanding\nmultiferroic BiFeO$_3$. The antiferromagnetic spin cycloid was resolved by\nreconstructing the resonant elastic X-ray scattering and visualised together\nwith mosaic-like ferroelectric domains in a linear dichroic contrast image at\nthe Fe L$_3$ edge. The measurements reveal a near perfect coupling between the\nmagnetic and ferroelectric ordering by which the propagation direction of the\nspin cycloid is locked orthogonally to the ferroelectric polarisation. The\nresults provide a direct visualisation of the strong magnetoelectric coupling\nin BiFeO$_3$ and of its fine multiferroic domain structure, emphasising the\npotential of high resolution ptychographic imaging in opening new possibilities\nfor the study of multiferroics and non-collinear magnetic materials with soft\nX-rays.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:10:28 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Butcher","Tim A.",""],["Phillips","Nicholas W.",""],["Chiu","Chun-Chien",""],["Wei","Chia-Chun",""],["Ho","Sheng-Zhu",""],["Chen","Yi-Chun",""],["Fr\u00f6jdh","Erik",""],["Baruffaldi","Filippo",""],["Carulla","Maria",""],["Zhang","Jiaguo",""],["Bergamaschi","Anna",""],["Vaz","Carlos A. F.",""],["Kleibert","Armin",""],["Finizio","Simone",""],["Yang","Jan-Chi",""],["Huang","Shih-Wen",""],["Raabe","J\u00f6rg",""]]}
{"id":"2308.13466","submitter":"Guangji Bai","authors":"Guangji Bai, Ziyang Yu, Zheng Chai, Yue Cheng, Liang Zhao","title":"Staleness-Alleviated Distributed GNN Training via Online\n  Dynamic-Embedding Prediction","comments":"Preprint. Do not distribute. arXiv admin note: text overlap with\n  arXiv:2206.00057","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the recent success of Graph Neural Networks (GNNs), it remains\nchallenging to train GNNs on large-scale graphs due to neighbor explosions. As\na remedy, distributed computing becomes a promising solution by leveraging\nabundant computing resources (e.g., GPU). However, the node dependency of graph\ndata increases the difficulty of achieving high concurrency in distributed GNN\ntraining, which suffers from the massive communication overhead. To address it,\nHistorical value approximation is deemed a promising class of distributed\ntraining techniques. It utilizes an offline memory to cache historical\ninformation (e.g., node embedding) as an affordable approximation of the exact\nvalue and achieves high concurrency. However, such benefits come at the cost of\ninvolving dated training information, leading to staleness, imprecision, and\nconvergence issues. To overcome these challenges, this paper proposes SAT\n(Staleness-Alleviated Training), a novel and scalable distributed GNN training\nframework that reduces the embedding staleness adaptively. The key idea of SAT\nis to model the GNN's embedding evolution as a temporal graph and build a model\nupon it to predict future embedding, which effectively alleviates the staleness\nof the cached historical embedding. We propose an online algorithm to train the\nembedding predictor and the distributed GNN alternatively and further provide a\nconvergence analysis. Empirically, we demonstrate that SAT can effectively\nreduce embedding staleness and thus achieve better performance and convergence\nspeed on multiple large-scale graph datasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:10:44 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bai","Guangji",""],["Yu","Ziyang",""],["Chai","Zheng",""],["Cheng","Yue",""],["Zhao","Liang",""]]}
{"id":"2308.13467","submitter":"Nancy Tyagi","authors":"Nancy Tyagi, Surjodeep Sarkar, Manas Gaur","title":"Leveraging Knowledge and Reinforcement Learning for Enhanced Reliability\n  of Language Models","comments":"Accepted at CIKM'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Natural Language Processing(NLP) community has been using crowd sourcing\ntechniques to create benchmark datasets such as General Language Understanding\nand Evaluation(GLUE) for training modern Language Models such as BERT. GLUE\ntasks measure the reliability scores using inter annotator metrics i.e. Cohens\nKappa. However, the reliability aspect of LMs has often been overlooked. To\ncounter this problem, we explore a knowledge-guided LM ensembling approach that\nleverages reinforcement learning to integrate knowledge from ConceptNet and\nWikipedia as knowledge graph embeddings. This approach mimics human annotators\nresorting to external knowledge to compensate for information deficits in the\ndatasets. Across nine GLUE datasets, our research shows that ensembling\nstrengthens reliability and accuracy scores, outperforming state of the art.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:11:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Tyagi","Nancy",""],["Sarkar","Surjodeep",""],["Gaur","Manas",""]]}
{"id":"2308.13468","submitter":"Filippo Giuliani","authors":"Filippo Giuliani","title":"Sobolev instability in the cubic NLS equation with convolution\n  potentials on irrational tori","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we prove the existence of solutions to the cubic NLS equation\nwith convolution potentials on two dimensional irrational tori undergoing an\narbitrarily large growth of Sobolev norms as time evolves. Our results apply\nalso to the case of square (and rational) tori. We weaken the regularity\nassumptions on the convolution potentials, required in a previous work by\nGuardia (Comm. Math. Phys., 2014) for the square case, to obtain the\n$H^s$-instability ($s>1$) of the elliptic equilibrium $u=0$. We also provide\nthe existence of solutions $u(t)$ with arbitrarily small $L^2$ norm which\nachieve a prescribed growth, say $\\| u(T)\\|_{H^s}\\geq K \\| u(0)\\|_{H^s}, K\\gg\n1$, within a time $T$ satisfying polynomial estimates, namely $0<T\\le K^c$ for\nsome $c>0$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:12:16 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Giuliani","Filippo",""]]}
{"id":"2308.13469","submitter":"Xinyang Huang","authors":"Xinyang Huang, Chuang Zhu, Wenkai Chen","title":"RestNet: Boosting Cross-Domain Few-Shot Segmentation with Residual\n  Transformation Network","comments":"BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cross-domain few-shot segmentation (CD-FSS) aims to achieve semantic\nsegmentation in previously unseen domains with a limited number of annotated\nsamples. Although existing CD-FSS models focus on cross-domain feature\ntransformation, relying exclusively on inter-domain knowledge transfer may lead\nto the loss of critical intra-domain information. To this end, we propose a\nnovel residual transformation network (RestNet) that facilitates knowledge\ntransfer while retaining the intra-domain support-query feature information.\nSpecifically, we propose a Semantic Enhanced Anchor Transform (SEAT) module\nthat maps features to a stable domain-agnostic space using advanced semantics.\nAdditionally, an Intra-domain Residual Enhancement (IRE) module is designed to\nmaintain the intra-domain representation of the original discriminant space in\nthe new space. We also propose a mask prediction strategy based on prototype\nfusion to help the model gradually learn how to segment. Our RestNet can\ntransfer cross-domain knowledge from both inter-domain and intra-domain without\nrequiring additional fine-tuning. Extensive experiments on ISIC, Chest X-ray,\nand FSS-1000 show that our RestNet achieves state-of-the-art performance. Our\ncode will be available soon.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:13:22 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Huang","Xinyang",""],["Zhu","Chuang",""],["Chen","Wenkai",""]]}
{"id":"2308.13470","submitter":"Daria Ghilli","authors":"Mauro Bambi, Daria Ghilli, Fausto Gozzi, Marta Leocata","title":"Optimal Planning in Habit Formation Models with Multiple Goods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, on the line e.g. of [COW00]) we investigate a model with habit\nformation and two types of substitute goods. Such family of models, even in the\ncase of 1 good, are difficult to study since their utility function is not\nconcave in the interesting cases (see e.g. [BG20]), hence the first order\nconditions are not sufficient. We introduce and explain the model and provide\nsome first results using the dynamic programming approach. Such results will\nform a solid ground over which a deep study of the features of the solutions\ncan be performed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:15:21 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Bambi","Mauro",""],["Ghilli","Daria",""],["Gozzi","Fausto",""],["Leocata","Marta",""]]}
{"id":"2308.13471","submitter":"Huibin Chang","authors":"Zhifang Liu, Baochen Sun, Xue-Cheng Tai, Qi Wang, and Huibin Chang","title":"A Fast Minimization Algorithm for the Euler Elastica Model Based on a\n  Bilinear Decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Euler Elastica (EE) model with surface curvature can generate\nartifact-free results compared with the traditional total variation\nregularization model in image processing. However, strong nonlinearity and\nsingularity due to the curvature term in the EE model pose a great challenge\nfor one to design fast and stable algorithms for the EE model. In this paper,\nwe propose a new, fast, hybrid alternating minimization (HALM) algorithm for\nthe EE model based on a bilinear decomposition of the gradient of the\nunderlying image and prove the global convergence of the minimizing sequence\ngenerated by the algorithm under mild conditions. The HALM algorithm comprises\nthree sub-minimization problems and each is either solved in the closed form or\napproximated by fast solvers making the new algorithm highly accurate and\nefficient. We also discuss the extension of the HALM strategy to deal with\ngeneral curvature-based variational models, especially with a Lipschitz smooth\nfunctional of the curvature. A host of numerical experiments are conducted to\nshow that the new algorithm produces good results with much-improved efficiency\ncompared to other state-of-the-art algorithms for the EE model. As one of the\nbenchmarks, we show that the average running time of the HALM algorithm is at\nmost one-quarter of that of the fast operator-splitting-based\nDeng-Glowinski-Tai algorithm.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:15:38 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Liu","Zhifang",""],["Sun","Baochen",""],["Tai","Xue-Cheng",""],["Wang","Qi",""],["Chang","Huibin",""]]}
{"id":"2308.13472","submitter":"Georg Herink","authors":"Julia A. Lang, Sarah R. Hutter, Alfred Leitenstorfer, Georg Herink","title":"Controlling Dual-Comb Soliton Motion inside a single Fiber Laser Cavity","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrafast science builds on dynamic compositions of precisely timed light\npulses1 and evolving sequences of pulses are observed inside almost every\nmode-locked laser. However, the underlying physics remains barely controlled\nand utilized until now. Here, we demonstrate the fast and deterministic control\nof soliton motion for the generation of programmable ultrashort pulse patterns\nfrom a dual-comb mode-locked Er:fiber laser. Specifically, we harness\nintra-cavity modulation of individual solitons and their laser-intrinsic\ndynamics to facilitate the rapid tuning of two interlaced soliton combs. Upon\nextra-cavity temporal recombination of both combs, we obtain reconfigurable\npulse patterns at arbitrary delays. Using high-throughput real-time spectral\ninterferometry, we resolve the short-range inter-soliton motion upon external\nstimuli and we demonstrate the high-speed sweeping of picosecond\npump-probe-delays and programmable free-form trajectories. This work introduces\na novel approach to soliton control and paves the way for ultrafast instruments\nat unprecedented high tuning, cycling and acquisition speeds.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:17:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lang","Julia A.",""],["Hutter","Sarah R.",""],["Leitenstorfer","Alfred",""],["Herink","Georg",""]]}
{"id":"2308.13473","submitter":"Carter Sifferman","authors":"Carter Sifferman, Yeping Wang, Mohit Gupta, and Michael Gleicher","title":"Unlocking the Performance of Proximity Sensors by Utilizing Transient\n  Histograms","comments":"Accepted for publication at IEEE Robotics and Automation Letters\n  (RA-L)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide methods which recover planar scene geometry by utilizing the\ntransient histograms captured by a class of close-range time-of-flight (ToF)\ndistance sensor. A transient histogram is a one dimensional temporal waveform\nwhich encodes the arrival time of photons incident on the ToF sensor.\nTypically, a sensor processes the transient histogram using a proprietary\nalgorithm to produce distance estimates, which are commonly used in several\nrobotics applications. Our methods utilize the transient histogram directly to\nenable recovery of planar geometry more accurately than is possible using only\nproprietary distance estimates, and consistent recovery of the albedo of the\nplanar surface, which is not possible with proprietary distance estimates\nalone. This is accomplished via a differentiable rendering pipeline, which\nsimulates the transient imaging process, allowing direct optimization of scene\ngeometry to match observations. To validate our methods, we capture 3,800\nmeasurements of eight planar surfaces from a wide range of viewpoints, and show\nthat our method outperforms the proprietary-distance-estimate baseline by an\norder of magnitude in most scenarios. We demonstrate a simple robotics\napplication which uses our method to sense the distance to and slope of a\nplanar surface from a sensor mounted on the end effector of a robot arm.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:20:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sifferman","Carter",""],["Wang","Yeping",""],["Gupta","Mohit",""],["Gleicher","Michael",""]]}
{"id":"2308.13474","submitter":"Prasita Mukherjee","authors":"Prasita Mukherjee and Haoteng Yin","title":"OCTAL: Graph Representation Learning for LTL Model Checking","comments":"arXiv admin note: substantial text overlap with arXiv:2207.11649","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Model Checking is widely applied in verifying the correctness of complex and\nconcurrent systems against a specification. Pure symbolic approaches while\npopular, suffer from the state space explosion problem due to cross product\noperations required that make them prohibitively expensive for large-scale\nsystems and/or specifications. In this paper, we propose to use graph\nrepresentation learning (GRL) for solving linear temporal logic (LTL) model\nchecking, where the system and the specification are expressed by a B{\\\"u}chi\nautomaton and an LTL formula, respectively. A novel GRL-based framework \\model,\nis designed to learn the representation of the graph-structured system and\nspecification, which reduces the model checking problem to binary\nclassification. Empirical experiments on two model checking scenarios show that\n\\model achieves promising accuracy, with up to $11\\times$ overall speedup\nagainst canonical SOTA model checkers and $31\\times$ for satisfiability\nchecking alone.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 15:11:18 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Mukherjee","Prasita",""],["Yin","Haoteng",""]]}
{"id":"2308.13475","submitter":"Riccardo Fantoni Dr.","authors":"John R. Klauder and Riccardo Fantoni","title":"A modest redirection of quantum field theory solves all current problems","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Standard quantization using, for example, path integration of field theory\nmodels, includes paths of momentum and field reach infinity in the Hamiltonian\ndensity, while the Hamiltonian itself remains finite. That fact causes\nconsiderable difficulties. In this paper, we represent $\\pi(x)$ by\n$k(x)/\\phi(x)$. To insure proper values for $\\pi(x)$ it is necessary to\nrestrict $0<|\\phi(x)|<\\infty$ as well as $0\\leq|k(x)|<\\infty$. Indeed that\nleads to Hamiltonian densities in which $\\phi(x)^p$, where $p$ can be even\nintegers between $4$ and $\\infty$. This leads to a completely satisfactory\nquantization of field theories using situations that involve scaled behavior\nleading to an unexpected, $\\hbar^2/\\hat{\\phi}(x)^2$ which arises only in the\nquantum aspects. Indeed, it is fair to claim that this symbol change leads to\nvalid field theory quantizations.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 03:47:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Klauder","John R.",""],["Fantoni","Riccardo",""]]}
{"id":"2308.13476","submitter":"Vandana Dwarka","authors":"Vandana Dwarka and Cornelis Vuik","title":"Stand-alone Multigrid for Helmholtz Revisited: Towards Convergence Using\n  Standard Components","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Getting standard multigrid to work efficiently for the high-frequency\nHelmholtz equation has been an open problem in applied mathematics for years.\nMuch effort has been dedicated to finding solution methods which can use\nmultigrid components to obtain solvers with a linear time complexity. In this\nwork we present one among the first stand-alone multigrid solvers for the 2D\nHelmholtz equation using both a constant and non-constant wavenumber model\nproblem. We use standard smoothing techniques and do not impose any\nrestrictions on the number of grid points per wavelength on the coarse-grid. As\na result we are able to obtain a full V- and W-cycle algorithm. The key\nfeatures of the algorithm are the use of higher-order inter-grid transfer\noperators combined with a complex constant in the coarsening process. Using\nweighted-Jacobi smoothing, we obtain a solver which is $h-$independent and\nscales linearly with the wavenumber $k$. Numerical results using 1 to 5\nGMRES(3) smoothing steps approach $k-$ and $h-$ independent convergence, when\ncombined with the higher-order inter-grid transfer operators and a small or\neven zero complex shift. The proposed algorithm provides an important step\ntowards the perpetuating branch of research in finding scalable solvers for\nchallenging wave propagation problems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:28:50 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dwarka","Vandana",""],["Vuik","Cornelis",""]]}
{"id":"2308.13477","submitter":"George Filippatos","authors":"George Filippatos (for the JEM-EUSO Collaboration)","title":"EUSO-SPB2 Fluorescence Telescope in-flight performance and preliminary\n  results","comments":null,"journal-ref":null,"doi":"10.22323/1.444.0251","report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Extreme Universe Space Observatory on a Super Pressure Balloon II\n(EUSO-SPB2) launched from Wanaka, New Zealand on May 13th 2023. Consisting of\ntwo optical telescopes, EUSO-SPB2 aimed to search for very high energy\nneutrinos (E>PeV) via Cherenkov radiation, and ultra high energy cosmic rays\n(UHECRs, E>EeV) via ultraviolet fluorescence. Building on the EUSO-Balloon\n(2014) and EUSO-SPB1 (2017) missions, the Fluorescence Telescope (FT) comprises\n108 multi-anode photomultiplier tubes at the focus of a one meter entrance\ndiameter Schmidt telescope. The FT pointed down at the atmosphere below the\nSPB's altitude of 33 km. The mission duration was planned to reach up to 100\ndays. Prior to flight, the instrument was extensively tested in the laboratory\nand in the field. These measurements, combined with simulations led to an\nexpected peak energy sensitivity around 3 EeV. Combined with a\nthree-times-larger field-of-view than previous EUSO balloon missions, this\nresulted in an expected observation rate of one UHECR shower per ten hours of\nobservation. The FT was expected to perform the first measurement of UHECRs via\nfluorescence from sub-orbital space, but was unable to, due to a shortened\nflight. Nonetheless, these observations of EUSO-SPB2 serve as a stepping stone\nto future satellite-based missions, such as the Probe of Extreme MultiMessenger\nAstrophysics (POEMMA), with enormous exposure to the highest energy cosmic rays\nwith all sky coverage. In this contribution we will discuss the performance of\nthe FT in flight as well as preliminary results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:29:57 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Filippatos","George","","for the JEM-EUSO Collaboration"]]}
{"id":"2308.13478","submitter":"Sarka Stejskalova","authors":"Radek Honzik and Sarka Stejskalova","title":"Generalized cardinal invariants for an inaccessible $\\kappa$ with\n  compactness at $\\kappa^{++}$","comments":"19 pages, submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the relationship between non-trivial values of generalized cardinal\ninvariants at an inaccessible cardinal $\\kappa$ and compactness principles at\n$\\kappa^{++}$. We show that if the existence of a supercompact cardinal\n$\\kappa$ with a weakly compact cardinal $\\lambda$ above $\\kappa$ is consistent,\nthen the following are consistent as well (where $\\mathfrak{t}(\\kappa)$ and\n$\\mathfrak{u}(\\kappa)$ are the tower number and the ultrafilter number,\nrespectively):\n  (i) There is an inaccessible cardinal $\\kappa$ such that $\\kappa^+ <\n\\mathfrak{t}(\\kappa)= \\mathfrak{u}(\\kappa)< 2^\\kappa$ and stationary reflection\nand the disjoint stationary sequence property at $\\kappa^{++}$ hold.\n  (ii) There is an inaccessible cardinal $\\kappa$ such that $\\kappa^+ =\n\\mathfrak{t}(\\kappa) < \\mathfrak{u}(\\kappa)< 2^\\kappa$ and the principles in\n(i) hold plus the tree property at $\\kappa^{++}$ and the negation of the weak\nKurepa Hypothesis at $\\kappa^+$.\n  The cardinals $\\mathfrak{u}(\\kappa)$ and $2^\\kappa$ can have any reasonable\nvalues in these models. We compute several other values of cardinal invariants,\nsuch $\\mathfrak{a}(\\kappa)$ and $\\mathfrak{b}(\\kappa)$, and the invariants of\nthe meager ideal (they are all equal to $\\mathfrak{u}(\\kappa)$). In (ii), we\ncompute $\\mathfrak{p}(\\kappa) = \\mathfrak{t}(\\kappa) = \\kappa^+$ by observing\nthat the $\\kappa^+$-distributive quotient of the Mitchell forcing adds a tower\nof size $\\kappa^+$.\n  As a corollary of the construction, we obtain that (i) and (ii) are also true\nfor $\\kappa = \\omega$ (starting with a weakly compact cardinal in the ground\nmodel).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:32:37 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Honzik","Radek",""],["Stejskalova","Sarka",""]]}
{"id":"2308.13479","submitter":"Samuel Rhys Cox","authors":"Samuel Rhys Cox, Ashraf Abdul and Wei Tsang Ooi","title":"Prompting a Large Language Model to Generate Diverse Motivational\n  Messages: A Comparison with Human-Written Messages","comments":"3 pages, 1 figure, 1 table, to be published in Proceedings of the\n  11th International Conference on Human-Agent Interaction (ACM HAI'23)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models (LLMs) are increasingly capable and prevalent, and can\nbe used to produce creative content. The quality of content is influenced by\nthe prompt used, with more specific prompts that incorporate examples generally\nproducing better results. On from this, it could be seen that using\ninstructions written for crowdsourcing tasks (that are specific and include\nexamples to guide workers) could prove effective LLM prompts. To explore this,\nwe used a previous crowdsourcing pipeline that gave examples to people to help\nthem generate a collectively diverse corpus of motivational messages. We then\nused this same pipeline to generate messages using GPT-4, and compared the\ncollective diversity of messages from: (1) crowd-writers, (2) GPT-4 using the\npipeline, and (3 & 4) two baseline GPT-4 prompts. We found that the LLM prompts\nusing the crowdsourcing pipeline caused GPT-4 to produce more diverse messages\nthan the two baseline prompts. We also discuss implications from messages\ngenerated by both human writers and LLMs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:35:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Cox","Samuel Rhys",""],["Abdul","Ashraf",""],["Ooi","Wei Tsang",""]]}
{"id":"2308.13480","submitter":"Manuel Maarek","authors":"L\\'eon McGregor, Manuel Maarek, Hans-Wolfgang Loidl","title":"Communicating on Security within Software Development Issue Tracking","comments":"9th Workshop on Security Information Workers WSIW 2023 - Co-located\n  Workshop at SOUPS 2023, Anaheim, United States","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During software development, balancing security and non security issues is\nchallenging. We focus on security awareness and approaches taken by\nnon-security experts using software development issue trackers when considering\nsecurity. We first analyse interfaces from prominent issue trackers to see how\nthey support security communication and how they integrate security scoring.\nThen, we investigate through a small scale user study what criteria developers\ntake when prioritising issues, in particular observing their attitudes to\nsecurity.\n  We find projects make reference to CVSS summaries (Common Vulnerability\nScoring System), often alongside CVE reports (Common Vulnerabilities and\nExposures), but issue trackers do not often have interfaces designed for this.\nUsers in our study were not comfortable with CVSS analysis, though were able to\nreason in a manner compatible with CVSS. Detailed explanations and advice were\nseen as helpful in making security decisions. This suggests that adding\nimprovements to communication through CVSS-like questioning in issue tracking\nsoftware can elicit better security interactions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:38:27 GMT"}],"update_date":"2023-08-28","authors_parsed":[["McGregor","L\u00e9on",""],["Maarek","Manuel",""],["Loidl","Hans-Wolfgang",""]]}
{"id":"2308.13481","submitter":"George Filippatos","authors":"George Filippatos and Mikhail Zotov (for the JEM-EUSO Collaboration)","title":"Machine Learning for the EUSO-SPB2 Fluorescence Telescope Data Analysis","comments":null,"journal-ref":null,"doi":"10.22323/1.444.0234","report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Extreme Universe Space Observatory on a Super Pressure Balloon 2\n(EUSO-SPB2) is the most advanced balloon mission undertaken by the JEM-EUSO\ncollaboration. EUSO-SPB2 is built on the experience of previous stratosphere\nmissions, EUSO-Balloon and EUSO-SPB, and of the Mini-EUSO space mission\ncurrently active onboard the International Space Station. EUSO- SPB2 is\nequipped with two instruments: a fluorescence telescope aimed at registering\nultra-high energy cosmic rays (UHECRs) with an energy above 2 EeV and a\nCherenkov telescope built to measure direct Cherenkov emission from cosmic rays\nwith energies above 1 PeV. The EUSO-SPB2 mission will provide pioneering\nobservations on the path towards a space-based multi-messenger observatory. As\nsuch, a special attention was paid to the development of triggers and other\nsoftware aimed at comprehensive data analysis. A whole number of methods based\non machine learning (ML) and neural networks was developed during the\nconstruction of the experiment and a few others are under active development.\nHere we provide a brief review of the ML-based methods already implemented in\nthe instrument and the ground software and report preliminary results on the\nML-based reconstruction of UHECR parameters for the fluorescence telescope.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:40:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Filippatos","George","","for the JEM-EUSO Collaboration"],["Zotov","Mikhail","","for the JEM-EUSO Collaboration"]]}
{"id":"2308.13482","submitter":"Lenhard Ng","authors":"Robert Lipshitz, Lenhard Ng","title":"Torsion in linearized contact homology for Legendrian knots","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present examples of Legendrian knots in $\\mathbb{R}^3$ that have\nlinearized Legendrian contact homology over $\\mathbb{Z}$ containing torsion. As\na consequence, we show that there exist augmentations of Legendrian knots over\n$\\mathbb{Z}$ that are not induced by exact Lagrangian fillings, even though\ntheir mod $2$ reductions are.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:41:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lipshitz","Robert",""],["Ng","Lenhard",""]]}
{"id":"2308.13483","submitter":"Benedikt Gocke","authors":"Benedikt Gocke (on behalf of the ATLAS Collaboration)","title":"Highlights on top quark physics with the ATLAS experiment at the LHC","comments":"Talk presented at the International Workshop on Future Linear\n  Colliders (LCWS 2023), 15-19 May 2023. C23-05-15.3","journal-ref":null,"doi":null,"report-no":"ATL-PHYS-PROC-2023-045","categories":"hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The large top-quark samples collected with the ATLAS experiment at the LHC\nhave yielded measurements of the inclusive \\ttbar production cross section of\nunprecedented precision and differential measurements in new kinematic\nregimes.They have also enabled new measurements of top-quark properties that\nwere previously inaccessible, enabled the observation of many rare top-quark\nproduction processes predicted by the Standard Model and boosted searches for\nflavour-changing-neutral-current interactions of the top-quark, that are\nheavily suppressed in the SM. In this contribution the highlights of the ATLAS\ntop-quark physics program are presented, as well as projections of the expected\nsensitivity after the High Luminosity phase of the LHC. Talk presented at the\nInternational Workshop on Future Linear Colliders (LCWS 2023), 15-19 May 2023.\nC23-05-15.3.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:46:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Gocke","Benedikt","","on behalf of the ATLAS Collaboration"]]}
{"id":"2308.13484","submitter":"Roman Gorbachev","authors":"Wendong Wang, Nicholas Clark, Matthew Hamer, Amy Carl, Endre Tovari,\n  Sam Sullivan-Allsop, Evan Tillotson, Yunze Gao, Hugo de Latour, Francisco\n  Selles, James Howarth, Eli G. Castanon, Mingwei Zhou, Haoyu Bai, Xiao Li,\n  Astrid Weston, Kenji Watanabe, Takashi Taniguchi, Cecilia Mattevi, Thomas H.\n  Bointon, Paul V. Wiper, Andrew J. Strudwick, Leonid A. Ponomarenko, Andrey\n  Kretinin, Sarah J. Haigh, Alex Summerfield, Roman Gorbachev","title":"Ultra-clean assembly of van der Waals heterostructures","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Layer-by-layer assembly of van der Waals (vdW) heterostructures underpins new\ndiscoveries in solid state physics, material science and chemistry. Despite the\nsuccesses, all current 2D material (2DM) transfer techniques rely on the use of\npolymers which limit the cleanliness, ultimate electronic performance, and\npotential for optoelectronic applications of the heterostructures. In this\narticle, we present a novel polymer-free platform for rapid and facile\nheterostructure assembly which utilises re-usable flexible silicon nitride\nmembranes. We demonstrate that this allows fast and reproducible production of\n2D heterostructures using both exfoliated and CVD-grown materials with perfect\ninterfaces free from interlayer contamination and correspondingly excellent\nelectronic behaviour, limited only by the size and intrinsic quality of the\ncrystals used. Furthermore, removing the need for polymeric carriers allows new\npossibilities for vdW heterostructure fabrication: assembly at high\ntemperatures up to 600{\\deg}C, and in different environments including\nultra-high vacuum (UHV) and when the materials are fully submerged in liquids.\nWe demonstrate UHV heterostructure assembly for the first time, and show the\nreliable creation of graphene moir\\'e superlattices with more than an order of\nmagnitude improvement in their structural homogeneity. We believe that broad\nadaptation of our novel inorganic 2D materials assembly strategy will allow\nrealisation of the full potential of vdW heterostructures as a platform for new\nphysics and advanced optoelectronic technologies.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:47:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wang","Wendong",""],["Clark","Nicholas",""],["Hamer","Matthew",""],["Carl","Amy",""],["Tovari","Endre",""],["Sullivan-Allsop","Sam",""],["Tillotson","Evan",""],["Gao","Yunze",""],["de Latour","Hugo",""],["Selles","Francisco",""],["Howarth","James",""],["Castanon","Eli G.",""],["Zhou","Mingwei",""],["Bai","Haoyu",""],["Li","Xiao",""],["Weston","Astrid",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Mattevi","Cecilia",""],["Bointon","Thomas H.",""],["Wiper","Paul V.",""],["Strudwick","Andrew J.",""],["Ponomarenko","Leonid A.",""],["Kretinin","Andrey",""],["Haigh","Sarah J.",""],["Summerfield","Alex",""],["Gorbachev","Roman",""]]}
{"id":"2308.13485","submitter":"Jo\\~ao Pedro De Souza Gomes Da Costa","authors":"F\\'abio Botler, Wanderson Lomenha, Jo\\~ao Pedro de Souza","title":"On nonrepetitive colorings of paths and cycles","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We say that a sequence $a_1 \\cdots a_{2t}$ of integers is repetitive if $a_i\n= a_{i+t}$ for every $i\\in\\{1,\\ldots,t\\}$. A walk in a graph $G$ is a sequence\n$v_1 \\cdots v_r$ of vertices of $G$ in which $v_iv_{i+1}\\in E(G)$ for every\n$i\\in\\{1,\\ldots,r-1\\}$. Given a $k$-coloring $c\\colon V(G)\\to\\{1,\\ldots,k\\}$ of\n$V(G)$, we say that $c$ is walk-nonrepetitive (resp. stroll-nonrepetitive) if\nfor every $t\\in\\mathbb{N}$ and every walk $v_1\\cdots v_{2t}$ the sequence\n$c(v_1) \\cdots c(v_{2t})$ is not repetitive unless $v_i = v_{i+t}$ for every\n$i\\in\\{1,\\ldots,t\\}$ (resp. unless $v_i = v_{i+t}$ for some\n$i\\in\\{1,\\ldots,t\\}$). The walk (resp. stroll) chromatic number $\\sigma(G)$\n(resp. $\\rho(G)$) of $G$ is the minimum $k$ for which $G$ has a\nwalk-nonrepetitive (resp. stroll-nonrepetitive) $k$-coloring. Let $C_n$ and\n$P_n$ denote, respectively, the cycle and the path with $n$ vertices. In this\npaper we present three results that answer questions posed by Bar\\'at and Wood\nin 2008: (i) $\\sigma(C_n) = 4$ whenever $n\\geq 4$ and $n \\notin\\{5,7\\}$; (ii)\n$\\rho(P_n) = 3$ if $3\\leq n\\leq 21$ and $\\rho(P_n) = 4$ otherwise; and (iii)\n$\\rho(C_n) = 4$, whenever $n \\notin\\{3,4,6,8\\}$, and $\\rho(C_n) = 3$ otherwise.\nIn particular, (ii) improves bounds on $n$ obtained by Tao in 2023.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:49:48 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Botler","F\u00e1bio",""],["Lomenha","Wanderson",""],["de Souza","Jo\u00e3o Pedro",""]]}
{"id":"2308.13486","submitter":"Steven Willoughby","authors":"Steven Willoughby","title":"On the Practicality of Dynamic Updates in Fast Searchable Encryption","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DB cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Searchable encrypted (SE) indexing systems are a useful tool for utilizing\ncloud services to store and manage sensitive information. However, much of the\nwork on SE systems to date has remained theoretical. In order to make them of\npractical use, more work is needed to develop optimal protocols and working\nmodels for them. This includes, in particular, the creation of a working update\nmodel in order to maintain an encrypted index of a dynamic document set such as\nan email inbox. I have created a working, real-world end-to-end SE\nimplementation that satisfies these needs, including the first empirical\nperformance evaluation of the dynamic SE update operation. In doing so, I show\na viable path to move from the theoretical concepts described by previous\nresearchers to a future production-worthy implementation and identify issues\nfor follow-on investigation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:50:02 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Willoughby","Steven",""]]}
{"id":"2308.13487","submitter":"Yalong Yang","authors":"Gunnar Reiske, Sungwon In, Yalong Yang","title":"Multi-Focus Querying of the Human Genome Information on Desktop and in\n  Virtual Reality: an Evaluation","comments":"To be published at ISMAR 2023 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The human genome is incredibly information-rich, consisting of approximately\n25,000 protein-coding genes spread out over 3.2 billion nucleotide base pairs\ncontained within 24 unique chromosomes. The genome is important in maintaining\nspatial context, which assists in understanding gene interactions and\nrelationships. However, existing methods of genome visualization that utilize\nspatial awareness are inefficient and prone to limitations in presenting gene\ninformation and spatial context. This study proposed an innovative approach to\ngenome visualization and exploration utilizing virtual reality. To determine\nthe optimal placement of gene information and evaluate its essentiality in a VR\nenvironment, we implemented and conducted a user study with three different\ninteraction methods. Two interaction methods were developed in virtual reality\nto determine if gene information is better suited to be embedded within the\nchromosome ideogram or separate from the ideogram. The final ideogram\ninteraction method was performed on a desktop and served as a benchmark to\nevaluate the potential benefits associated with the use of VR. Our study\nfindings reveal a preference for VR, despite longer task completion times. In\naddition, the placement of gene information within the visualization had a\nnotable impact on the ability of a user to complete tasks. Specifically, gene\ninformation embedded within the chromosome ideogram was better suited for\nsingle target identification and summarization tasks, while separating gene\ninformation from the ideogram better supported region comparison tasks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:51:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Reiske","Gunnar",""],["In","Sungwon",""],["Yang","Yalong",""]]}
{"id":"2308.13488","submitter":"Dilek Yalcinkaya","authors":"Dilek M. Yalcinkaya, Khalid Youssef, Bobak Heydari, Orlando Simonetti,\n  Rohan Dharmakumar, Subha Raman, Behzad Sharif","title":"Temporal Uncertainty Localization to Enable Human-in-the-loop Analysis\n  of Dynamic Contrast-enhanced Cardiac MRI Datasets","comments":"Accepted for publication in MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamic contrast-enhanced (DCE) cardiac magnetic resonance imaging (CMRI) is\na widely used modality for diagnosing myocardial blood flow (perfusion)\nabnormalities. During a typical free-breathing DCE-CMRI scan, close to 300\ntime-resolved images of myocardial perfusion are acquired at various contrast\n\"wash in/out\" phases. Manual segmentation of myocardial contours in each\ntime-frame of a DCE image series can be tedious and time-consuming,\nparticularly when non-rigid motion correction has failed or is unavailable.\nWhile deep neural networks (DNNs) have shown promise for analyzing DCE-CMRI\ndatasets, a \"dynamic quality control\" (dQC) technique for reliably detecting\nfailed segmentations is lacking. Here we propose a new space-time uncertainty\nmetric as a dQC tool for DNN-based segmentation of free-breathing DCE-CMRI\ndatasets by validating the proposed metric on an external dataset and\nestablishing a human-in-the-loop framework to improve the segmentation results.\nIn the proposed approach, we referred the top 10% most uncertain segmentations\nas detected by our dQC tool to the human expert for refinement. This approach\nresulted in a significant increase in the Dice score (p<0.001) and a notable\ndecrease in the number of images with failed segmentation (16.2% to 11.3%)\nwhereas the alternative approach of randomly selecting the same number of\nsegmentations for human referral did not achieve any significant improvement.\nOur results suggest that the proposed dQC framework has the potential to\naccurately identify poor-quality segmentations and may enable efficient\nDNN-based analysis of DCE-CMRI in a human-in-the-loop pipeline for clinical\ninterpretation and reporting of dynamic CMRI datasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:55:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yalcinkaya","Dilek M.",""],["Youssef","Khalid",""],["Heydari","Bobak",""],["Simonetti","Orlando",""],["Dharmakumar","Rohan",""],["Raman","Subha",""],["Sharif","Behzad",""]]}
{"id":"2308.13489","submitter":"Bryce Frederickson","authors":"Bryce Frederickson and Liana Yepremyan","title":"Vector space Ramsey numbers and weakly Sidorenko affine configurations","comments":"19 pages, 1 figure","journal-ref":"Proceedings of the 12th European Conference on Combinatorics,\n  Graph Theory and Applications (2023) 450-456","doi":"10.5817/CZ.MUNI.EUROCOMB23-062","report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For $B \\subseteq \\mathbb F_q^m$, the $n$-th affine extremal number of $B$ is\nthe maximum cardinality of a set $A \\subseteq \\mathbb F_q^n$ with no subset\nwhich is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for\nany $B \\subseteq \\mathbb F_q^m$, the $n$-th affine extremal number of $B$ is\n$o(q^n)$ as $n \\to \\infty$. By counting affine homomorphisms between subsets of\n$\\mathbb F_q^n$, we derive new bounds and give new proofs of some previously\nknown bounds for certain affine extremal numbers. At the same time, we\nestablish corresponding supersaturation results. We connect these bounds to\ncertain Ramsey-type numbers in vector spaces over finite fields. For $s,t \\geq\n1$, let $R_q(s,t)$ denote the minimum $n$ such that in every red-blue coloring\nof the one-dimensional subspaces of $\\mathbb F_q^n$, there is either a red\n$s$-dimensional subspace or a blue $t$-dimensional subspace of $\\mathbb F_q^n$.\nThe existence of these numbers is a special case of a well-known theorem of\nGraham, Leeb, Rothschild. We improve the best known upper bounds on $R_2(2,t)$,\n$R_3(2,t)$, $R_2(t,t)$, and $R_3(t,t)$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:03:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Frederickson","Bryce",""],["Yepremyan","Liana",""]]}
{"id":"2308.13490","submitter":"Sami Abu-El-Haija","authors":"Phitchaya Mangpo Phothilimthana, Sami Abu-El-Haija, Kaidi Cao, Bahare\n  Fatemi, Charith Mendis, Bryan Perozzi","title":"TpuGraphs: A Performance Prediction Dataset on Large Tensor\n  Computational Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Precise hardware performance models play a crucial role in code\noptimizations. They can assist compilers in making heuristic decisions or aid\nautotuners in identifying the optimal configuration for a given program. For\nexample, the autotuner for XLA, a machine learning compiler, discovered 10-20%\nspeedup on state-of-the-art models serving substantial production traffic at\nGoogle. Although there exist a few datasets for program performance prediction,\nthey target small sub-programs such as basic blocks or kernels. This paper\nintroduces TpuGraphs, a performance prediction dataset on full tensor programs,\nrepresented as computational graphs, running on Tensor Processing Units (TPUs).\nEach graph in the dataset represents the main computation of a machine learning\nworkload, e.g., a training epoch or an inference step. Each data sample\ncontains a computational graph, a compilation configuration, and the execution\ntime of the graph when compiled with the configuration. The graphs in the\ndataset are collected from open-source machine learning programs, featuring\npopular model architectures, e.g., ResNet, EfficientNet, Mask R-CNN, and\nTransformer. TpuGraphs provides 25x more graphs than the largest graph property\nprediction dataset (with comparable graph sizes), and 770x larger graphs on\naverage compared to existing performance prediction datasets on machine\nlearning programs. This graph-level prediction task on large graphs introduces\nnew challenges in learning, ranging from scalability, training efficiency, to\nmodel quality.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:04:35 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Phothilimthana","Phitchaya Mangpo",""],["Abu-El-Haija","Sami",""],["Cao","Kaidi",""],["Fatemi","Bahare",""],["Mendis","Charith",""],["Perozzi","Bryan",""]]}
{"id":"2308.13491","submitter":"Dvij Kalaria","authors":"Dvij Kalaria, Qin Lin and John M. Dolan","title":"Towards Optimal Head-to-head Autonomous Racing with Curriculum\n  Reinforcement Learning","comments":"Submitted to MAD games IROS workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Head-to-head autonomous racing is a challenging problem, as the vehicle needs\nto operate at the friction or handling limits in order to achieve minimum lap\ntimes while also actively looking for strategies to overtake/stay ahead of the\nopponent. In this work we propose a head-to-head racing environment for\nreinforcement learning which accurately models vehicle dynamics. Some previous\nworks have tried learning a policy directly in the complex vehicle dynamics\nenvironment but have failed to learn an optimal policy. In this work, we\npropose a curriculum learning-based framework by transitioning from a simpler\nvehicle model to a more complex real environment to teach the reinforcement\nlearning agent a policy closer to the optimal policy. We also propose a control\nbarrier function-based safe reinforcement learning algorithm to enforce the\nsafety of the agent in a more effective way while not compromising on\noptimality.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:05:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kalaria","Dvij",""],["Lin","Qin",""],["Dolan","John M.",""]]}
{"id":"2308.13492","submitter":"Yubiao Yue","authors":"Yubiao Yue, Xiaoqiang Shi, Li Qin, Xinyue Zhang, Yanmei Chen, Jialong\n  Xu, Zipei Zheng, Yujun Cao, Di Liu, Zhenzhang Li, Yang Li","title":"Ultrafast-and-Ultralight ConvNet-Based Intelligent Monitoring System for\n  Diagnosing Early-Stage Mpox Anytime and Anywhere","comments":"This paper has been submitted to Neurocomputing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the lack of more efficient diagnostic tools for monkeypox, its spread\nremains unchecked, presenting a formidable challenge to global health. While\nthe high efficacy of deep learning models for monkeypox diagnosis has been\ndemonstrated in related studies, the overlook of inference speed, the parameter\nsize and diagnosis performance for early-stage monkeypox renders the models\ninapplicable in real-world settings. To address these challenges, we proposed\nan ultrafast and ultralight network named Fast-MpoxNet. Fast-MpoxNet possesses\nonly 0.27M parameters and can process input images at 68 frames per second\n(FPS) on the CPU. To counteract the diagnostic performance limitation brought\nabout by the small model capacity, it integrates the attention-based feature\nfusion module and the multiple auxiliary losses enhancement strategy for better\ndetecting subtle image changes and optimizing weights. Using transfer learning\nand five-fold cross-validation, Fast-MpoxNet achieves 94.26% Accuracy on the\nMpox dataset. Notably, its recall for early-stage monkeypox achieves 93.65%. By\nadopting data augmentation, our model's Accuracy rises to 98.40% and attains a\nPracticality Score (A new metric for measuring model practicality in real-time\ndiagnosis application) of 0.80. We also developed an application system named\nMpox-AISM V2 for both personal computers and mobile phones. Mpox-AISM V2\nfeatures ultrafast responses, offline functionality, and easy deployment,\nenabling accurate and real-time diagnosis for both the public and individuals\nin various real-world settings, especially in populous settings during the\noutbreak. Our work could potentially mitigate future monkeypox outbreak and\nilluminate a fresh paradigm for developing real-time diagnostic tools in the\nhealthcare field.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:06:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yue","Yubiao",""],["Shi","Xiaoqiang",""],["Qin","Li",""],["Zhang","Xinyue",""],["Chen","Yanmei",""],["Xu","Jialong",""],["Zheng","Zipei",""],["Cao","Yujun",""],["Liu","Di",""],["Li","Zhenzhang",""],["Li","Yang",""]]}
{"id":"2308.13493","submitter":"Gilles Felber","authors":"Gilles Felber","title":"A Restriction Norm Problem for Siegel Modular Forms","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish an asymptotic formula with a power-saving error of the\n$L^2$-norm of Siegel cusp forms of degree 2 in an average sense when restricted\nto the imaginary axis. The result is consistent with the Mass Equidistribution\nConjecture for Siegel modular forms and the Lindel\\\"of Hypothesis for some\ntwisted Koecher-Maass series. Along the way, we perform a careful analysis of\nthe Kitaoka formula of degree 2.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:09:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Felber","Gilles",""]]}
{"id":"2308.13494","submitter":"Matthew Dutson","authors":"Matthew Dutson, Yin Li, Mohit Gupta","title":"Eventful Transformers: Leveraging Temporal Redundancy in Vision\n  Transformers","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vision Transformers achieve impressive accuracy across a range of visual\nrecognition tasks. Unfortunately, their accuracy frequently comes with high\ncomputational costs. This is a particular issue in video recognition, where\nmodels are often applied repeatedly across frames or temporal chunks. In this\nwork, we exploit temporal redundancy between subsequent inputs to reduce the\ncost of Transformers for video processing. We describe a method for identifying\nand re-processing only those tokens that have changed significantly over time.\nOur proposed family of models, Eventful Transformers, can be converted from\nexisting Transformers (often without any re-training) and give adaptive control\nover the compute cost at runtime. We evaluate our method on large-scale\ndatasets for video object detection (ImageNet VID) and action recognition\n(EPIC-Kitchens 100). Our approach leads to significant computational savings\n(on the order of 2-4x) with only minor reductions in accuracy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:10:12 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dutson","Matthew",""],["Li","Yin",""],["Gupta","Mohit",""]]}
{"id":"2308.13495","submitter":"Sushmanth Reddy Mereddy","authors":"Sushmanth reddy, Jyothi Swaroop Reddy","title":"Open Gaze: Open Source eye tracker for smartphone devices using Deep\n  Learning","comments":"26 pages , 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Eye tracking has been a pivotal tool in diverse fields such as vision\nresearch, language analysis, and usability assessment. The majority of prior\ninvestigations, however, have concentrated on expansive desktop displays\nemploying specialized, costly eye tracking hardware that lacks scalability.\nRemarkably little insight exists into ocular movement patterns on smartphones,\ndespite their widespread adoption and significant usage. In this manuscript, we\npresent an open-source implementation of a smartphone-based gaze tracker that\nemulates the methodology proposed by a GooglePaper (whose source code remains\nproprietary). Our focus is on attaining accuracy comparable to that attained\nthrough the GooglePaper's methodology, without the necessity for supplementary\nhardware. Through the integration of machine learning techniques, we unveil an\naccurate eye tracking solution that is native to smartphones. Our approach\ndemonstrates precision akin to the state-of-the-art mobile eye trackers, which\nare characterized by a cost that is two orders of magnitude higher. Leveraging\nthe vast MIT GazeCapture dataset, which is available through registration on\nthe dataset's website, we successfully replicate crucial findings from previous\nstudies concerning ocular motion behavior in oculomotor tasks and saliency\nanalyses during natural image observation. Furthermore, we emphasize the\napplicability of smartphone-based gaze tracking in discerning reading\ncomprehension challenges. Our findings exhibit the inherent potential to\namplify eye movement research by significant proportions, accommodating\nparticipation from thousands of subjects with explicit consent. This\nscalability not only fosters advancements in vision research, but also extends\nits benefits to domains such as accessibility enhancement and healthcare\napplications.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:10:22 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:01:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["reddy","Sushmanth",""],["Reddy","Jyothi Swaroop",""]]}
{"id":"2308.13496","submitter":"Tesary Lin","authors":"Tesary Lin and Avner Strulov-Shlain","title":"Choice Architecture, Privacy Valuations, and Selection Bias in Consumer\n  Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study how choice architecture that companies deploy during data collection\ninfluences consumers' privacy valuations. Further, we explore how this\ninfluence affects the quality of data collected, including both volume and\nrepresentativeness. To this end, we run a large-scale choice experiment to\nelicit consumers' valuation for their Facebook data while randomizing two\ncommon choice frames: default and price anchor. An opt-out default decreases\nvaluations by 14-22% compared to opt-in, while a \\$0-50 price anchor decreases\nvaluations by 37-53% compared to a \\$50-100 anchor. Moreover, in some consumer\nsegments, the susceptibility to frame influence negatively correlates with\nconsumers' average valuation. We find that conventional frame optimization\npractices that maximize the volume of data collected can have opposite effects\non its representativeness. A bias-exacerbating effect emerges when consumers'\nprivacy valuations and frame effects are negatively correlated. On the other\nhand, a volume-maximizing frame may also mitigate the bias by getting a high\npercentage of consumers into the sample data, thereby improving its coverage.\nWe demonstrate the magnitude of the volume-bias trade-off in our data and argue\nthat it should be a decision-making factor in choice architecture design.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:11:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Lin","Tesary",""],["Strulov-Shlain","Avner",""]]}
{"id":"2308.13497","submitter":"Sakayo Toadoum Sari He","authors":"Sakayo Toadoum Sari and Angela Fan and Lema Logamou Seknewna","title":"Ngambay-French Neural Machine Translation (sba-Fr)","comments":"Accepted at RANLP 2023 - International Workshop NLP tools and\n  resources for translation and interpreting applications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In Africa, and the world at large, there is an increasing focus on developing\nNeural Machine Translation (NMT) systems to overcome language barriers. NMT for\nLow-resource language is particularly compelling as it involves learning with\nlimited labelled data. However, obtaining a well-aligned parallel corpus for\nlow-resource languages can be challenging. The disparity between the\ntechnological advancement of a few global languages and the lack of research on\nNMT for local languages in Chad is striking. End-to-end NMT trials on\nlow-resource Chad languages have not been attempted. Additionally, there is a\ndearth of online and well-structured data gathering for research in Natural\nLanguage Processing, unlike some African languages. However, a guided approach\nfor data gathering can produce bitext data for many Chadian language\ntranslation pairs with well-known languages that have ample data. In this\nproject, we created the first sba-Fr Dataset, which is a corpus of\nNgambay-to-French translations, and fine-tuned three pre-trained models using\nthis dataset. Our experiments show that the M2M100 model outperforms other\nmodels with high BLEU scores on both original and original+synthetic data. The\npublicly available bitext dataset can be used for research purposes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:13:20 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Sari","Sakayo Toadoum",""],["Fan","Angela",""],["Seknewna","Lema Logamou",""]]}
{"id":"2308.13498","submitter":"Lucas Berry","authors":"Lucas Berry, David Meger","title":"Escaping the Sample Trap: Fast and Accurate Epistemic Uncertainty\n  Estimation with Pairwise-Distance Estimators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work introduces a novel approach for epistemic uncertainty estimation\nfor ensemble models using pairwise-distance estimators (PaiDEs). These\nestimators utilize the pairwise-distance between model components to establish\nbounds on entropy and uses said bounds as estimates for information-based\ncriterion. Unlike recent deep learning methods for epistemic uncertainty\nestimation, which rely on sample-based Monte Carlo estimators, PaiDEs are able\nto estimate epistemic uncertainty up to 100$\\times$ faster, over a larger space\n(up to 100$\\times$) and perform more accurately in higher dimensions. To\nvalidate our approach, we conducted a series of experiments commonly used to\nevaluate epistemic uncertainty estimation: 1D sinusoidal data, Pendulum-v0,\nHopper-v2, Ant-v2 and Humanoid-v2. For each experimental setting, an Active\nLearning framework was applied to demonstrate the advantages of PaiDEs for\nepistemic uncertainty estimation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:13:42 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Berry","Lucas",""],["Meger","David",""]]}
{"id":"2308.13499","submitter":"Bask{\\i}n \\c{S}enba\\c{s}lar","authors":"Bask{\\i}n \\c{S}enba\\c{s}lar, Pilar Luiz, Wolfgang H\\\"onig, and Gaurav\n  S. Sukhatme","title":"MRNAV: Multi-Robot Aware Planning and Control Stack for Collision and\n  Deadlock-free Navigation in Cluttered Environments","comments":"8 pages, 4 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-robot collision-free and deadlock-free navigation in cluttered\nenvironments with static and dynamic obstacles is a fundamental problem for\nmany applications. We introduce MRNAV, a framework for planning and control to\neffectively navigate in such environments. Our design utilizes short, medium,\nand long horizon decision making modules with qualitatively different\nproperties, and defines the responsibilities of them. The decision making\nmodules complement each other and provide the effective navigation capability.\nMRNAV is the first hierarchical approach combining these three levels of\ndecision making modules and explicitly defining their responsibilities. We\nimplement our design for simulated multi-quadrotor flight. In our evaluations,\nwe show that all three modules are required for effective navigation in diverse\nsituations. We show the long-term executability of our approach in an eight\nhour long wall time (six hour long simulation time) uninterrupted simulation\nwithout collisions or deadlocks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:13:45 GMT"}],"update_date":"2023-08-28","authors_parsed":[["\u015eenba\u015flar","Bask\u0131n",""],["Luiz","Pilar",""],["H\u00f6nig","Wolfgang",""],["Sukhatme","Gaurav S.",""]]}
{"id":"2308.13500","submitter":"Hideaki Hakoshima","authors":"Hideaki Hakoshima, Suguru Endo, Kaoru Yamamoto, Yuichiro Matsuzaki,\n  Nobuyuki Yoshioka","title":"Localized Virtual Purification","comments":"29 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analog and digital quantum simulators can efficiently simulate quantum\nmany-body systems that appear in natural phenomena. However, experimental\nlimitations of near-term devices still make it challenging to perform the\nentire process of quantum simulation. The purification-based quantum simulation\nmethods can alleviate the limitations in experiments such as the cooling\ntemperature and noise from the environment, while this method has the drawback\nthat it requires global entangled measurement with a prohibitively large number\nof measurements that scales exponentially with the system size. In this Letter,\nwe propose that we can overcome these problems by restricting the entangled\nmeasurements to the vicinity of the local observables to be measured, when the\nlocality of the system can be exploited. We provide theoretical guarantees that\nthe global purification operation can be replaced with local operations under\nsome conditions, in particular for the task of cooling and error mitigation. We\nfurthermore give a numerical verification that the localized purification is\nvalid even when conditions are not satisfied. Our method bridges the\nfundamental concept of locality with quantum simulators, and therefore expected\nto open a path to unexplored quantum many-body phenomena.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:19:26 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hakoshima","Hideaki",""],["Endo","Suguru",""],["Yamamoto","Kaoru",""],["Matsuzaki","Yuichiro",""],["Yoshioka","Nobuyuki",""]]}
{"id":"2308.13501","submitter":"Kyoya Hashibori","authors":"Kyoya Hashibori","title":"On the boundedness of the geodesic curvature measure of a regular curve\n  passing through a cross cap singularity","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2015, Hasegawa, Honda, Naokawa, Saji, Umehara, and Yamada defined\nintrinsic cross cap singularities, which are generalizations of cross cap\nsingularities, and proved the Gauss-Bonnet type formula for surfaces without\nboundary that admit these singularities. In this paper, we prove the\nboundedness of geodesic curvature measures of a regular curve passing through\nan intrinsic cross cap singularity and generalize the Gauss-Bonnet type formula\nby Hasegawa et al. to the case of surfaces with boundary. Also, we give\nconditions for the boundedness of the geodesic curvature at an intrinsic cross\ncap singularity.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:20:09 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 11:36:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hashibori","Kyoya",""]]}
{"id":"2308.13502","submitter":"Pablo Macedo","authors":"Sebastian Hincapie, John A. Calderon, Carlos E. Borda, Alejandro\n  Duque, Pablo Macedo, Juan P. Gallego","title":"Real-Time Simulations To Validate The Impact Of M-SSSC Devices On\n  Protection Coordination In Power Systems","comments":"Paper accepted in the XIX ERIAC - CIGRE Iberoamerican Regional\n  Meeting- CIGRE Brazil in section Technical Works -C4. Link to paper:\n  https://www.xixeriac.com.br/artigos-apresentacoes","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper analyzes the impact of the integration of the Modular Static\nSynchronous Series Compensator (M-SSSC) solution that will be deployed in the\nSanta Marta 220 kV (Colombian substation) by using real-time simulations with\nHardware in the Loop (HIL) technique, over the protection coordination schemes\nin the area of influence. The results show that the M-SSSC devices can be\nsuccessfully coordinated with the protection schemes, mitigating overloads\nthrough the transmission lines during steady state and contingencies, while\navoiding potential harmful interactions with the grid and, most importantly,\nwith protection devices. This behavior is achieved by using overcurrent\ndetection logics implemented on M-SSSC devices that trip fast-acting Silicon\nControlled Rectifiers (SCRs) that cease the voltage injection in less than 5 ms\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:21:14 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Hincapie","Sebastian",""],["Calderon","John A.",""],["Borda","Carlos E.",""],["Duque","Alejandro",""],["Macedo","Pablo",""],["Gallego","Juan P.",""]]}
{"id":"2308.13503","submitter":"Pranav Balaji","authors":"Pranav Balaji, Abhijit Das, Srijan Das, Antitza Dantcheva","title":"Attending Generalizability in Course of Deep Fake Detection by Exploring\n  Multi-task Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work explores various ways of exploring multi-task learning (MTL)\ntechniques aimed at classifying videos as original or manipulated in\ncross-manipulation scenario to attend generalizability in deep fake scenario.\nThe dataset used in our evaluation is FaceForensics++, which features 1000\noriginal videos manipulated by four different techniques, with a total of 5000\nvideos. We conduct extensive experiments on multi-task learning and contrastive\ntechniques, which are well studied in literature for their generalization\nbenefits. It can be concluded that the proposed detection model is quite\ngeneralized, i.e., accurately detects manipulation methods not encountered\nduring training as compared to the state-of-the-art.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:28:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Balaji","Pranav",""],["Das","Abhijit",""],["Das","Srijan",""],["Dantcheva","Antitza",""]]}
{"id":"2308.13504","submitter":"Ian Colbert","authors":"Ian Colbert, Alessandro Pappalardo, Jakoba Petri-Koenig","title":"A2Q: Accumulator-Aware Quantization with Guaranteed Overflow Avoidance","comments":"arXiv admin note: substantial text overlap with arXiv:2301.13376","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present accumulator-aware quantization (A2Q), a novel weight quantization\nmethod designed to train quantized neural networks (QNNs) to avoid overflow\nwhen using low-precision accumulators during inference. A2Q introduces a unique\nformulation inspired by weight normalization that constrains the L1-norm of\nmodel weights according to accumulator bit width bounds that we derive. Thus,\nin training QNNs for low-precision accumulation, A2Q also inherently promotes\nunstructured weight sparsity to guarantee overflow avoidance. We apply our\nmethod to deep learning-based computer vision tasks to show that A2Q can train\nQNNs for low-precision accumulators while maintaining model accuracy\ncompetitive with a floating-point baseline. In our evaluations, we consider the\nimpact of A2Q on both general-purpose platforms and programmable hardware.\nHowever, we primarily target model deployment on FPGAs because they can be\nprogrammed to fully exploit custom accumulator bit widths. Our experimentation\nshows accumulator bit width significantly impacts the resource efficiency of\nFPGA-based accelerators. On average across our benchmarks, A2Q offers up to a\n2.3x reduction in resource utilization over 32-bit accumulator counterparts\nwith 99.2% of the floating-point model accuracy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:28:58 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Colbert","Ian",""],["Pappalardo","Alessandro",""],["Petri-Koenig","Jakoba",""]]}
{"id":"2308.13505","submitter":"Jiaming Zhang","authors":"Jiaming Zhang, Yutao Cui, Gangshan Wu, Limin Wang","title":"Joint Modeling of Feature, Correspondence, and a Compressed Memory for\n  Video Object Segmentation","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current prevailing Video Object Segmentation (VOS) methods usually perform\ndense matching between the current and reference frames after extracting their\nfeatures. One on hand, the decoupled modeling restricts the targets information\npropagation only at high-level feature space. On the other hand, the pixel-wise\nmatching leads to a lack of holistic understanding of the targets. To overcome\nthese issues, we propose a unified VOS framework, coined as JointFormer, for\njoint modeling the three elements of feature, correspondence, and a compressed\nmemory. The core design is the Joint Block, utilizing the flexibility of\nattention to simultaneously extract feature and propagate the targets\ninformation to the current tokens and the compressed memory token. This scheme\nallows to perform extensive information propagation and discriminative feature\nlearning. To incorporate the long-term temporal targets information, we also\ndevise a customized online updating mechanism for the compressed memory token,\nwhich can prompt the information flow along the temporal dimension and thus\nimprove the global modeling capability. Under the design, our method achieves a\nnew state-of-art performance on DAVIS 2017 val/test-dev (89.7% and 87.6%) and\nYouTube-VOS 2018/2019 val (87.0% and 87.0%) benchmarks, outperforming existing\nworks by a large margin.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:30:08 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Jiaming",""],["Cui","Yutao",""],["Wu","Gangshan",""],["Wang","Limin",""]]}
{"id":"2308.13506","submitter":"Daniel Deutsch","authors":"Daniel Deutsch and Juraj Juraska and Mara Finkelstein and Markus\n  Freitag","title":"Training and Meta-Evaluating Machine Translation Evaluation Metrics at\n  the Paragraph Level","comments":"Removing extra \"and\" from author list","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As research on machine translation moves to translating text beyond the\nsentence level, it remains unclear how effective automatic evaluation metrics\nare at scoring longer translations. In this work, we first propose a method for\ncreating paragraph-level data for training and meta-evaluating metrics from\nexisting sentence-level data. Then, we use these new datasets to benchmark\nexisting sentence-level metrics as well as train learned metrics at the\nparagraph level. Interestingly, our experimental results demonstrate that using\nsentence-level metrics to score entire paragraphs is equally as effective as\nusing a metric designed to work at the paragraph level. We speculate this\nresult can be attributed to properties of the task of reference-based\nevaluation as well as limitations of our datasets with respect to capturing all\ntypes of phenomena that occur in paragraph-level translations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:31:46 GMT"},{"version":"v2","created":"Mon, 28 Aug 2023 17:46:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Deutsch","Daniel",""],["Juraska","Juraj",""],["Finkelstein","Mara",""],["Freitag","Markus",""]]}
{"id":"2308.13507","submitter":"Jie JW Wu PhD","authors":"Jie JW Wu","title":"Does Asking Clarifying Questions Increases Confidence in Generated Code?\n  On the Communication Skills of Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have significantly improved the ability to\nperform tasks in the field of code generation. However, there is still a gap\nbetween LLMs being capable coders and being top-tier software engineers. Based\non the observation that top-level software engineers often ask clarifying\nquestions to reduce ambiguity in both requirements and coding solutions, we\nargue that the same should be applied to LLMs for code generation tasks. By\nasking probing questions in various topics before generating the final code,\nthe challenges of programming with LLMs, such as unclear intent specification,\nlack of computational thinking, and undesired code quality, may be alleviated.\nThis, in turn, increases confidence in the generated code. In this work, we\nexplore how to leverage better communication skills to achieve greater\nconfidence in generated code. We propose a communication-centered process that\nuses an LLM-generated communicator to identify issues with high ambiguity or\nlow confidence in problem descriptions and generated code. We then ask\nclarifying questions to obtain responses from users for refining the code.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:33:05 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Wu","Jie JW",""]]}
{"id":"2308.13508","submitter":"Allison Strom","authors":"Allison L. Strom, Gwen C. Rudie, Ryan F. Trainor, Gabriel B. Brammer,\n  Michael V. Maseda, Menelaos Raptis, Noah S. J. Rogers, Charles C. Steidel,\n  Yuguang Chen, David R. Law","title":"CECILIA: The Faint Emission Line Spectrum of z~2-3 Star-forming Galaxies","comments":"Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first results from CECILIA, a Cycle 1 JWST NIRSpec/MSA program\nthat uses ultra-deep ~30 hour G235M/F170LP observations to target multiple\nelectron temperature-sensitive auroral lines in the spectra of 33 galaxies at\nz~1-3. Using a subset of 23 galaxies, we construct two ~600 object-hour\ncomposite spectra, both with and without the stellar continuum, and use these\nto investigate the characteristic rest-optical (5700-8500 Angstrom) spectrum of\nstar-forming galaxies at the peak epoch of cosmic star formation. Emission\nlines of eight different elements (H, He, N, O, Si, S, Ar, and Ni) are\ndetected, with most of these features observed to be <3% the strength of\nH-alpha. We report the characteristic strength of three auroral lines\n([NII]5756, [SIII]6313, and [OII]7322,7332), as well as other semi-strong and\nfaint emission lines, including forbidden [NiII]7380,7414 and the OI 8449\nrecombination line, some of which have never before been observed outside of\nthe local universe. Using these measurements, we find T_e[NII]=13630+/-2540$ K,\nrepresenting the first measurement of electron temperature using [NII] in the\nhigh-redshift universe. We also see evidence for broad line emission with a\nFWHM of ~544 km/s; the broad component of H-alpha is 6.01-28.31% the strength\nof the narrow component and likely arises from star-formation driven outflows.\nFinally, we briefly comment on the feasibility of obtaining large samples of\nfaint emission lines using JWST in the future.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:38:31 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Strom","Allison L.",""],["Rudie","Gwen C.",""],["Trainor","Ryan F.",""],["Brammer","Gabriel B.",""],["Maseda","Michael V.",""],["Raptis","Menelaos",""],["Rogers","Noah S. J.",""],["Steidel","Charles C.",""],["Chen","Yuguang",""],["Law","David R.",""]]}
{"id":"2308.13509","submitter":"Naga Manasa Vempati","authors":"Benjamin Jaye, Mishko Mitkovski, Manasa N. Vempati","title":"A sharp sufficient condition for mobile sampling in terms of surface\n  density","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide the sharp surface density threshold to guarantee mobile sampling\nin terms of the surface density of the set.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:39:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Jaye","Benjamin",""],["Mitkovski","Mishko",""],["Vempati","Manasa N.",""]]}
{"id":"2308.13510","submitter":"Pritish Kamath","authors":"Matthew Dawson, Badih Ghazi, Pritish Kamath, Kapil Kumar, Ravi Kumar,\n  Bo Luan, Pasin Manurangsi, Nishanth Mundru, Harikesh Nair, Adam Sealfon,\n  Shengyu Zhu","title":"Optimizing Hierarchical Queries for the Attribution Reporting API","comments":"Appeared at AdKDD 2023 workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the task of performing hierarchical queries based on summary reports\nfrom the {\\em Attribution Reporting API} for ad conversion measurement. We\ndemonstrate that methods from optimization and differential privacy can help\ncope with the noise introduced by privacy guardrails in the API. In particular,\nwe present algorithms for (i) denoising the API outputs and ensuring\nconsistency across different levels of the tree, and (ii) optimizing the\nprivacy budget across different levels of the tree. We provide an experimental\nevaluation of the proposed algorithms on public datasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:44:56 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Dawson","Matthew",""],["Ghazi","Badih",""],["Kamath","Pritish",""],["Kumar","Kapil",""],["Kumar","Ravi",""],["Luan","Bo",""],["Manurangsi","Pasin",""],["Mundru","Nishanth",""],["Nair","Harikesh",""],["Sealfon","Adam",""],["Zhu","Shengyu",""]]}
{"id":"2308.13511","submitter":"Sohrab Rahvar","authors":"Shahin Rouhani and Sohrab Rahvar","title":"MOG as symmetry breaking in Scalar-Vector-Tensor gravity","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Modified Gravity Model (MOG) has been proposed as a solution to the dark\nmatter problem, but it does not meet the gauge invariant condition. The aim of\nthis work is to propose a gauge-invariant theory, which suggests that symmetry\ncan break at a low temperature in the Universe, leading to the MOG theory. This\ntheory has the potential to alter the dynamics of the early and late Universe\nand naturally produce cosmological inflation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:45:30 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Rouhani","Shahin",""],["Rahvar","Sohrab",""]]}
{"id":"2308.13512","submitter":"Tomasz Kanas","authors":"Tomasz Kanas, Krzysztof Rzadca","title":"A Poisson-Based Approximation Algorithm for Stochastic Bin Packing of\n  Bernoulli Items","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A cloud scheduler packs tasks onto machines with contradictory goals of (1)\nusing the machines as efficiently as possible while (2) avoiding overloading\nthat might result in CPU throttling or out-of-memory errors. We take a\nstochastic approach that models the uncertainty of tasks' resource requirements\nby random variables. We focus on a little-explored case of items, each having a\nBernoulli distribution that corresponds to tasks that are either idle or need a\ncertain CPU share. RPAP, our online approximation algorithm, upper-bounds a\nsubset of items by Poisson distributions. Unlike existing algorithms for\nBernoulli items that prove the approximation ratio only up to a multiplicative\nconstant, we provide a closed-form expression. We derive RPAPC, a combined\napproach having the same theoretical guarantees as RPAP. In simulations,\nRPAPC's results are close to FFR, a greedy heuristic with no worst-case\nguarantees; RPAPC slightly outperforms FFR on datasets with small items.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:46:39 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Kanas","Tomasz",""],["Rzadca","Krzysztof",""]]}
{"id":"2308.13513","submitter":"Tianyi Zhao","authors":"Tianyi Zhao, Hui Hu and Lu Cheng","title":"Unveiling the Role of Message Passing in Dual-Privacy Preservation on\n  GNNs","comments":"CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph Neural Networks (GNNs) are powerful tools for learning representations\non graphs, such as social networks. However, their vulnerability to privacy\ninference attacks restricts their practicality, especially in high-stake\ndomains. To address this issue, privacy-preserving GNNs have been proposed,\nfocusing on preserving node and/or link privacy. This work takes a step back\nand investigates how GNNs contribute to privacy leakage. Through theoretical\nanalysis and simulations, we identify message passing under structural bias as\nthe core component that allows GNNs to \\textit{propagate} and \\textit{amplify}\nprivacy leakage. Building upon these findings, we propose a principled\nprivacy-preserving GNN framework that effectively safeguards both node and link\nprivacy, referred to as dual-privacy preservation. The framework comprises\nthree major modules: a Sensitive Information Obfuscation Module that removes\nsensitive information from node embeddings, a Dynamic Structure Debiasing\nModule that dynamically corrects the structural bias, and an Adversarial\nLearning Module that optimizes the privacy-utility trade-off. Experimental\nresults on four benchmark datasets validate the effectiveness of the proposed\nmodel in protecting both node and link privacy while preserving high utility\nfor downstream tasks, such as node classification.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:46:43 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhao","Tianyi",""],["Hu","Hui",""],["Cheng","Lu",""]]}
{"id":"2308.13514","submitter":"Lily Zhang","authors":"Lily H. Zhang, Menelaos Konstantinidis, Marie-Ab\\`ele Bind, Donald B.\n  Rubin","title":"Towards more scientific meta-analyses","comments":"Oral presentation at Cochrane Colloquium 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Meta-analysis can be a critical part of the research process, often serving\nas the primary analysis on which the practitioners, policymakers, and\nindividuals base their decisions. However, current literature synthesis\napproaches to meta-analysis typically estimate a different quantity than what\nis implicitly intended; concretely, standard approaches estimate the average\neffect of a treatment for a population of imperfect studies, rather than the\ntrue scientific effect that would be measured in a population of hypothetical\nperfect studies. We advocate for an alternative method, called response-surface\nmeta-analysis, which models the relationship between the quality of the study\ndesign as predictor variables and its reported estimated effect size as the\noutcome variable in order to estimate the effect size obtained by the\nhypothetical ideal study. The idea was first introduced by Rubin several\ndecades ago, and here we provide a practical implementation. First, we\nreintroduce the idea of response-surface meta-analysis, highlighting its focus\non a scientifically-motivated estimand while proposing a straightforward\nimplementation. Then we compare the approach to traditional meta-analysis\ntechniques used in practice. We then implement response-surface meta-analysis\nand contrast its results with existing literature-synthesis approaches on both\nsimulated data and a real-world example published by the Cochrane\nCollaboration. We conclude by detailing the primary challenges in the\nimplementation of response-surface meta-analysis and offer some suggestions to\ntackle these challenges.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:49:41 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Zhang","Lily H.",""],["Konstantinidis","Menelaos",""],["Bind","Marie-Ab\u00e8le",""],["Rubin","Donald B.",""]]}
{"id":"2308.13515","submitter":"Xiaowei Yu","authors":"Xiaowei Yu, Lu Zhang, Dajiang Zhu, Tianming Liu","title":"Robust Core-Periphery Constrained Transformer for Domain Adaptation","comments":"Core-Periphery, ViT, Unsupervised domain adaptation","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised domain adaptation (UDA) aims to learn transferable\nrepresentation across domains. Recently a few UDA works have successfully\napplied Transformer-based methods and achieved state-of-the-art (SOTA) results.\nHowever, it remains challenging when there exists a large domain gap between\nthe source and target domain. Inspired by humans' exceptional transferability\nabilities to adapt knowledge from familiar to uncharted domains, we try to\napply the universally existing organizational structure in the human functional\nbrain networks, i.e., the core-periphery principle to design the Transformer\nand improve its UDA performance. In this paper, we propose a novel\nbrain-inspired robust core-periphery constrained transformer (RCCT) for\nunsupervised domain adaptation, which brings a large margin of performance\nimprovement on various datasets. Specifically, in RCCT, the self-attention\noperation across image patches is rescheduled by an adaptively learned weighted\ngraph with the Core-Periphery structure (CP graph), where the information\ncommunication and exchange between images patches are manipulated and\ncontrolled by the connection strength, i.e., edge weight of the learned\nweighted CP graph. Besides, since the data in domain adaptation tasks can be\nnoisy, to improve the model robustness, we intentionally add perturbations to\nthe patches in the latent space to ensure generating robust learned weighted\ncore-periphery graphs. Extensive evaluations are conducted on several widely\ntested UDA benchmarks. Our proposed RCCT consistently performs best compared to\nexisting works, including 88.3\\% on Office-Home, 95.0\\% on Office-31, 90.7\\% on\nVisDA-2017, and 46.0\\% on DomainNet.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:49:52 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Yu","Xiaowei",""],["Zhang","Lu",""],["Zhu","Dajiang",""],["Liu","Tianming",""]]}
{"id":"2308.13516","submitter":"Sergio Ernesto Aguilar Gutierrez","authors":"Sergio E. Aguilar-Gutierrez, Ricardo Esp\\'indola, Edward K.\n  Morvan-Benhaim","title":"A teleportation protocol in Schwarzschild-de Sitter space","comments":"16 pages + appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new information transfer protocol for de Sitter space, using\nblack holes as energy reservoirs. We consider antipodal observers in pure de\nSitter space in the Bunch-Davis state. They can store Hawking modes from the\ncosmological horizon in a box. Alternatively, due to thermal fluctuations in de\nSitter space, pair-creation black holes can proceed and form the needed energy\nreservoir. We focus on the Nariai case, corresponding to an equilibrium state.\nOnce it happens, energy pulses can be then released into the black hole's\ninterior, opening a traversable wormhole. We provide bounds for the amount of\ninformation that can be transferred. Specializing to (1+1)-dimensions, we\nexplore how the teleportation protocol leads to an explicit geometric\ndescription of the information transmitted through an island region. The\nprotocol uncovers quantum information aspects of de Sitter space, independent\nof a particular realization of de Sitter space holography.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:49:55 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Aguilar-Gutierrez","Sergio E.",""],["Esp\u00edndola","Ricardo",""],["Morvan-Benhaim","Edward K.",""]]}
{"id":"2308.13517","submitter":"Yihao Fang","authors":"Yihao Fang, Xianzhi Li, Stephen W. Thomas, Xiaodan Zhu","title":"ChatGPT as Data Augmentation for Compositional Generalization: A Case\n  Study in Open Intent Detection","comments":null,"journal-ref":"Proceedings of the Joint Workshop of the 5th Financial Technology\n  and Natural Language Processing (FinNLP) and 2nd Multimodal AI For Financial\n  Forecasting (Muffin), Macao, August 20, 2023","doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Open intent detection, a crucial aspect of natural language understanding,\ninvolves the identification of previously unseen intents in user-generated\ntext. Despite the progress made in this field, challenges persist in handling\nnew combinations of language components, which is essential for compositional\ngeneralization. In this paper, we present a case study exploring the use of\nChatGPT as a data augmentation technique to enhance compositional\ngeneralization in open intent detection tasks. We begin by discussing the\nlimitations of existing benchmarks in evaluating this problem, highlighting the\nneed for constructing datasets for addressing compositional generalization in\nopen intent detection tasks. By incorporating synthetic data generated by\nChatGPT into the training process, we demonstrate that our approach can\neffectively improve model performance. Rigorous evaluation of multiple\nbenchmarks reveals that our method outperforms existing techniques and\nsignificantly enhances open intent detection capabilities. Our findings\nunderscore the potential of large language models like ChatGPT for data\naugmentation in natural language understanding tasks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:51:23 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Fang","Yihao",""],["Li","Xianzhi",""],["Thomas","Stephen W.",""],["Zhu","Xiaodan",""]]}
{"id":"2308.13518","submitter":"Yi Li","authors":"Song He and Yi Li","title":"Holographic Euclidean thermal correlator","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we compute holographic Euclidean thermal correlators of the\nstress tensor and $U(1)$ current from the AdS planar black hole. To this end,\nwe set up perturbative boundary value problems for Einstein's gravity and\nMaxwell theory in the spirit of Gubser-Klebanov-Polyakov-Witten, with\nappropriate gauge fixing and regularity boundary conditions at the horizon of\nthe black hole. The linearized Einstein equation and Maxwell equation in the\nblack hole background are related to the Heun equation of degenerate local\nmonodromy. Leveraging the connection relation of local solutions of the Heun\nequation, we partly solve the boundary value problem and obtain exact two-point\nthermal correlators for $U(1)$ current and stress tensor in the scalar and\nshear channel.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:54:17 GMT"}],"update_date":"2023-08-28","authors_parsed":[["He","Song",""],["Li","Yi",""]]}
{"id":"2308.13519","submitter":"Michael Stessin","authors":"Michael Stessin","title":"Spectral rigidity for infinitesimal generators of representations of\n  twisted $S_{\\nu}U(2)$","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove spectral rigidity theorems for the infinitesimal generators of\nrepresentations of twisted $S_\\nu U(2)$ groups\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:57:06 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Stessin","Michael",""]]}
{"id":"2308.13520","submitter":"Erin Motherway","authors":"Erin Motherway (1), Aaron M. Geller (2), Anna C. Childs (2), Claire\n  Zwicker (3) and Ted von Hippel (1)","title":"Tracing the Origins of Mass Segregation in M35: Evidence for\n  Primordially Segregated Binaries","comments":"7 pages, 4 figures, submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  M35 is a young open cluster and home to an extensive binary population. Using\nGaia DR3, Pan-STARRS, and 2MASS photometry with the Bayesian statistical\nsoftware, BASE-9, we derive precise cluster parameters, identify single and\nbinary cluster members, and extract their masses. We identify 571 binaries down\nto Gaia G = 20.3 and a lower-limit on the binary frequency of f_b = 0.41 +/-\n0.02. We extend the binary demographics by many magnitudes faint-ward of\nprevious (radial-velocity) studies of this cluster and further away from the\ncluster center (1.78-degrees, roughly 10 core radii). We find the binary stars\nto be more centrally concentrated than the single stars in the cluster.\nFurthermore, we find strong evidence for mass segregation within the binary\npopulation itself, with progressively more massive binary samples becoming more\nand more centrally concentrated. For the single stars, we find weaker evidence\nfor mass segregation; only the most massive single stars (> 2.5MSun) appear\nmore centrally concentrated. Given the cluster age of ~200 Myr, and our derived\nhalf-mass relaxation time for the cluster of 230 +/- 84 Myr, we estimate ~47%\nof the binary stars and ~12% of single stars in the cluster have had time to\nbecome dynamically mass segregated. Importantly, when we investigate only stars\nwith mass segregation timescales greater than the cluster age, we still find\nthe binaries to be more centrally concentrated than the singles, suggesting the\nbinaries may have formed with a primordially different spatial distribution\nthan the single stars.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:59:10 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Motherway","Erin",""],["Geller","Aaron M.",""],["Childs","Anna C.",""],["Zwicker","Claire",""],["von Hippel","Ted",""]]}
{"id":"2308.13521","submitter":"Dmytro Karvatskyi","authors":"Mykola Pratsiovytyi and Dmytro Karvatskyi","title":"Cantorvals as sets of subsums for a series connected with trigonometric\n  functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study properties of the set of subsums for a convergent series $ k_1 \\sin\nx + \\dots + k_m \\sin x +\\dots + k_1\\sin x^n +\\dots + k_m \\sin x^n + \\dots $,\nwhere $k_1, k_2, k_3,\\dots,k_m$ are fixed positive integers and $0<x<1$.\nDepends on parameter $x$ this set can be a finite union of closed intervals or\nCantor-type set or even Cantorval.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:59:47 GMT"}],"update_date":"2023-08-28","authors_parsed":[["Pratsiovytyi","Mykola",""],["Karvatskyi","Dmytro",""]]}
{"id":"2308.13524","submitter":"Giovanni Modanese","authors":"L. Gamberale, G. Modanese","title":"Numerical Simulations Unveil Superradiant Coherence in a Lattice of\n  Charged Quantum Oscillators","comments":"20 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A system of ${N_{osc}}$ charged oscillators interacting with the\nelectromagnetic field, spatially confined in a 3D lattice of sub-wavelength\ndimension, can condense into a superradiant coherent state if appropriate\ndensity and frequency conditions are met. In this state, the common frequency\n$\\omega$ of the oscillators and the plasma frequency $\\omega_p$ of the charges\nare combined into a frequency $\\omega'=\\sqrt{\\omega^2+\\omega_p^2}$ that is\noff-shell with respect to the wavelength of the photon modes involved,\npreventing them from propagating outside the material. Unlike other atomic\ncavity systems, the frequency $\\omega$ in this case is not determined by the\ncavity itself but is defined by the periodic electrostatic potential that\nconfines the charged particles in the lattice. Additionally, the\nelectromagnetic modes involved have wave vectors distributed in all spatial\ndirections, resulting in a significant increase in coupling. The analytical\nstudy of this system can be carried out in the limit of large ${N_{osc}}$ by\nsearching for an approximation of the ground state via suitable coherent trial\nstates. Alternatively, numerical simulations can be employed for smaller\n${N_{osc}}$. In the numerical approach, it is possible to go beyond the\nRotating Wave Approximation (RWA) and introduce a dissipation term for the\nphoton modes. This dissipation term can account for the ohmic quench in a metal\nand also consider photon losses at the boundary of the material. By utilizing\nnumerical solutions and Monte Carlo simulations, the presence of condensation\nhas been confirmed, and an energy gap of a few electron volts (eV) per particle\nhas been observed in typical metal crystals with protons bound to tetrahedral\nor octahedral sites.\n","versions":[{"version":"v1","created":"Tue, 1 Aug 2023 18:23:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gamberale","L.",""],["Modanese","G.",""]]}
{"id":"2308.13525","submitter":"Paulo Roberto Bueno Professor","authors":"La\\'is Cristine Lopes, Edgar Pinz\\'on, Gabriela Dias-da-Silva, Gustavo\n  Troiano Feliciano and Paulo Roberto Bueno","title":"Electrochemical Measurement of the Electronic Structure of Graphene via\n  Quantum Mechanical Rate Spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum-rate theory defines a quantum mechanical rate $\\nu$ that complies\nwith the Planck--Einstein relationship $E = h\\nu$, where $\\nu = e^2/hC_q$ is a\nfrequency associated with the quantum capacitance $C_q$, and $E = e^2/C_q$ is\nthe energy associated with $\\nu$. Previously, this definition of $\\nu$ was\nsuccessfully employed to define a quantum mechanical meaning for the\nelectron-transfer (ET) rate constant of redox reactions, wherein faradaic\nelectric currents involved with ET reactions were demonstrated to be governed\nby relativistic quantum electrodynamics at room\ntemperature~\\citep{Bueno-2023-3}. This study demonstrated that the definition\nof $\\nu$ entails the relativistic quantum electrodynamics phenomena\nintrinsically related to the perturbation of the density-of-states $\\left(\ndn/dE \\right) = C_q/e^2$ by an external harmonic oscillatory potential energy\nvariation. On this basis, the electronic structure of graphene embedded in an\nelectrolyte environment was computed. The electronic structure measured using\nquantum-rate spectroscopy (QRS) is in good agreement with that measured through\nangle-resolved photo-emission spectroscopy (ARPES) or calculated via\ncomputational density-functional theory (DFT) methods. Electrochemical QRS has\nevident experimental advantages over ARPES. For instance, QRS enables obtaining\nthe electronic structure of graphene at room temperature and in an electrolyte\nenvironment, whereas ARPES requires low temperature and ultrahigh-vacuum\nconditions. Furthermore, QRS can operate \\textit{in-situ} using a hand-held,\ninexpensive piece of equipment, whereas ARPES necessarily requires expensive\nand cumbersome apparatus.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 11:28:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lopes","La\u00eds Cristine",""],["Pinz\u00f3n","Edgar",""],["Dias-da-Silva","Gabriela",""],["Feliciano","Gustavo Troiano",""],["Bueno","Paulo Roberto",""]]}
{"id":"2308.13526","submitter":"Mayeul Arminjon","authors":"Mayeul Arminjon","title":"Interstellar radiation as a Maxwell field: improved numerical scheme and\n  application to the spectral energy density","comments":"39 pages, including 15 figures. Journal version is open access, see\n  DOI","journal-ref":"Open Physics 21, 20220253 (2023)","doi":"10.1515/phys-2022-0253","report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The existing models of the interstellar radiation field (ISRF) do not produce\na Maxwell field. Here, the recent model of the ISRF as a Maxwell field is\nimproved by considering separately the different frequencies at the stage of\nthe fitting. Using this improved procedure: (i) It is checked in detail that\nthe model does predict extremely high values of the spectral energy density\n(SED) on the axis of a galaxy, that however decrease very rapidly when $\\rho $,\nthe distance to the axis, is increased from zero. (ii) The difference between\nthe SED values (with $\\rho =1\\,$kpc or $8\\,$kpc), as predicted either by this\nmodel or by a recent radiation transfer model, is reduced significantly. (iii)\nThe slower decrease of the SED with increasing altitude $z$, as compared with\nthe radiation transfer model, is confirmed. We also calculate the evolutions of\nthe SED at large $\\rho $. We interpret these evolutions by determining\nasymptotic expansions of the SED at large $z$, and also ones at large $\\rho $.\n","versions":[{"version":"v1","created":"Fri, 4 Aug 2023 13:39:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Arminjon","Mayeul",""]]}
{"id":"2308.13527","submitter":"Wytler Cordeiro Dos Santos","authors":"Wytler Cordeiro dos Santos","title":"The congruence of spacelike curves of tachyons with respective\n  energy-momentum tensor of perfect fluid type","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Special Relativity allows the possibility of a class of particles, known\ntachyons, that have spacelike 4-velocities, i.e., which move with velocity\ngreater than speed of light in vacuum. In this existence frame, the tachyons\nhave energy and momentum and they must contribute to the gravitational field\nthrough by the means of the energy-momentum tensor. The superluminal perfect\nfluid tensor is obtained assuming the framework Lagrangian formalism and\nspacelike 4-velocities flowlines of tachyons with energy density. The perfect\nfluid of tachyons gives rise a positive energy density and a form of negative\npressure, which according to various cosmological theoretical results, it is\nassociated with dark energy.\n","versions":[{"version":"v1","created":"Sun, 6 Aug 2023 01:23:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Santos","Wytler Cordeiro dos",""]]}
{"id":"2308.13528","submitter":"David Jackson","authors":"David J. Jackson","title":"Generalised Proper Time and the Universal Bootstrap","comments":"84 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The generalisation of proper time, as an alternative to models with extra\ndimensions of space, has been proposed as the source of the elementary\nstructures of matter. Direct connections with the Standard Model of particle\nphysics together with dark sector candidates can be attained in this manner,\nthrough the additional components and symmetry breaking pattern identified on\nextracting the substructure of the local 4-dimensional spacetime form. In this\npaper we focus more on the extended and global properties of the theory, both\nin relation to amalgamating gravity with quantum theory and to broader\ncosmological issues. Contrast will be made with both early S-matrix bootstrap\nmodels and more recent cosmological bootstrap techniques. With time playing a\ncentral role in the new theory we describe how a 'universal bootstrap' can be\nconstructed and elaborate upon the implications.\n","versions":[{"version":"v1","created":"Tue, 8 Aug 2023 14:55:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jackson","David J.",""]]}
{"id":"2308.13529","submitter":"Christian Y. Cardall","authors":"Christian Y. Cardall","title":"A unified perspective on Poincar\\'e and Galilei relativity: I. Special\n  relativity","comments":"39 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A semantic adjustment to what physicists mean by the terms `special\nrelativity' and `general relativity' is suggested, which prompts a conceptual\nshift to a more unified perspective on physics governed by the Poincar\\'e group\nand physics governed by the Galilei group. After exploring the limits of a\nunified perspective available in the setting of 4-dimensional spacetime, a\nparticular central extension of the Poincar\\'e group -- analogous to the\nBargmann group that is a central extension of the Galilei group -- is presented\nthat deepens a unified perspective on Poincar\\'e and Galilei physics in a\n5-dimensional spacetime setting. The immediate focus of this paper is classical\nphysics on affine 4-dimensional and 5-dimensional spacetimes (`special\nrelativity' as redefined here), including the electrodynamics that gave rise to\nPoincar\\'e physics in the first place; but the results here may suggest the\nexistence of a `Galilei general relativity' more extensive than generally\nknown, to be pursued in the sequel.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 00:55:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cardall","Christian Y.",""]]}
{"id":"2308.13530","submitter":"Ion Simaciu","authors":"Ion Simaciu, Zoltan Borsos, Viorel Drafta and Gheorghe Dumitrescu","title":"Quantitative analysis of secondary Bjerkenes forces in various liquids","comments":"15 pages, 12 tables, 11 graphs","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerically calculating the interaction forces between two free bubbles under\nthe action of a background of random acoustic radiation, we highlight the\ncontributions of radiative coefficient and absorption damping coefficient to\nthe size of these forces.It is quantitatively demonstrated, for different radii\nof the oscillating bubbles, that the scattering absorption forces and the\nscattering scattering forces are close in magnitude.For superfluid helium, the\nforces change direction, oscillatingly, and the ratio of the forces is much\nless than one.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 09:49:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Simaciu","Ion",""],["Borsos","Zoltan",""],["Drafta","Viorel",""],["Dumitrescu","Gheorghe",""]]}
{"id":"2308.13531","submitter":"Zihua Weng","authors":"Zi-Hua Weng","title":"Some spin textures relevant to magnetic moments in the octonion spaces","comments":"9 pages","journal-ref":"AIP Advances, Vol. 13, No. 8, id: 085016 (2023)","doi":"10.1063/5.0159101","report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The paper aims to apply the octonions to explore the contribution of some\ninfluence factors to magnetic moments, revealing the connection among the\ninfluence factors and spin texture. J. C. Maxwell was the first to introduce\nthe quaternions to describe the electromagnetic theory. The subsequent scholars\nutilize the quaternions and octonions to study the gravitational and\nelectromagnetic theories and so forth. The paper adopts the octonions to\nresearch the gravitational and electromagnetic fields, including the octonion\nangular momentum, torque, and force and so on. When the octonion force is equal\nto zero under some circumstances, it is able to achieve eight equations\nindependent of each other. In particular, one of eight independent equations\nreveals the interrelation between the second-torque and the divergence of\nmagnetic moments. One of its deductions is that the directions, magnitudes and\nfrequencies of some terms are capable of impacting the orientation and vortex\nof magnetic moments, altering the frequency of magnetic vortex clusters. It\nmeans that the spin textures are relevant to some external influence factors.\nSome terms may have an influence on the arrangements of spin textures. The\nstudy will be helpful for understanding the physical properties of magnetic\nskyrmions and merons.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 00:57:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Weng","Zi-Hua",""]]}
{"id":"2308.13532","submitter":"Clement Cren","authors":"Cl\\'ement Cren (LAMA)","title":"Filtered Calculus and crossed products by R-actions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.DG math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show an isomorphism between the kernel of the C*-algebra of the tangent\ngroupoid of a filtered manifold and the crossed product of the order 0\npseudodifferential operators in the associated filtered calculus by a natural\nR-action. This isomorphism is constructed in the same way as in the classical\npseudodifferential calculus by Debord and Skandalis. The proof however relies\non a structure result for the C*-algebra of graded nilpotent Lie groups which\ndid not appear in the commutative case. A consequence of this structure result\nis a decomposition of the principal symbol algebra, generalizing the\ndecomposition of Epstein and Melrose in the case of contact manifolds.\n","versions":[{"version":"v1","created":"Thu, 10 Aug 2023 08:19:52 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 07:49:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cren","Cl\u00e9ment","","LAMA"]]}
{"id":"2308.13533","submitter":"Stefano Bellucci","authors":"Stefano Bellucci, Fabio Cardone and Fabio Pistella","title":"A review of experiments reporting non-conventional phenomena in nuclear\n  matter aiming at identifying common features in view of possible\n  interpretation","comments":"41 pages, Keywords: nuclear matter experiments; systematic\n  reproducibility of experiments; generalization of the Einstein relativity\n  theory; energy densification; Deformed Space Time theory; energy thresholds;\n  energy density in the space-time (volume and time interval)","journal-ref":"Symmetry 2023, 15, 1507","doi":"10.3390/sym15081507","report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The purpose of the present paper is to clarify, as far as it is possible, the\noverall picture of experimental results in the field of non-conventional\nphenomena in nuclear matter published in scientific literature, accumulated in\nthe last decades and still missing a widely accepted interpretation. While\ncompleteness of the collection of the experiments is not among the aims of the\neffort, focus is put on adopting a more comprehensive and integral approach\nthrough the analysis of the different experimental layouts and the different\nresults, searching for common features and analogous factual outcomes in order\nto obtain a consistent reading of a lot of experimental evidences that appear,\nuntil now, lacking a classification in a logic catalogue which might be\ncompared to a sort of building and not to a collection of single stones.\nParticular attention is put on the issue of reproducibility of experiments and\non the reasons why such a limitation is a frequent characteristic of many\nexperimental activities reported in published papers. This approach is\ninnovative as compared with those already available in the scientific\nliterature. In a synoptical table a comprehensive classification is given of\nthe twenty experiments examined in terms of type of evidences that are\nascertained by the experimenters in their published papers but are unexpected\naccording to well established physical theories. Examples of such unexpected\nevidences (named also non-conventional or weird) are: excess heat generation,\nisotope production, reduction of radioactivity levels, and production of\nneutrons or alpha particles.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 12:02:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bellucci","Stefano",""],["Cardone","Fabio",""],["Pistella","Fabio",""]]}
{"id":"2308.13534","submitter":"Arsalan Shahid","authors":"Ahtsham Zafar, Venkatesh Balavadhani Parthasarathy, Chan Le Van, Saad\n  Shahid, Aafaq Iqbal khan, Arsalan Shahid","title":"Building Trust in Conversational AI: A Comprehensive Review and Solution\n  Architecture for Explainable, Privacy-Aware Systems using LLMs and Knowledge\n  Graph","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Conversational AI systems have emerged as key enablers of human-like\ninteractions across diverse sectors. Nevertheless, the balance between\nlinguistic nuance and factual accuracy has proven elusive. In this paper, we\nfirst introduce LLMXplorer, a comprehensive tool that provides an in-depth\nreview of over 150 Large Language Models (LLMs), elucidating their myriad\nimplications ranging from social and ethical to regulatory, as well as their\napplicability across industries. Building on this foundation, we propose a\nnovel functional architecture that seamlessly integrates the structured\ndynamics of Knowledge Graphs with the linguistic capabilities of LLMs.\nValidated using real-world AI news data, our architecture adeptly blends\nlinguistic sophistication with factual rigour and further strengthens data\nsecurity through Role-Based Access Control. This research provides insights\ninto the evolving landscape of conversational AI, emphasizing the imperative\nfor systems that are efficient, transparent, and trustworthy.\n","versions":[{"version":"v1","created":"Sun, 13 Aug 2023 22:47:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zafar","Ahtsham",""],["Parthasarathy","Venkatesh Balavadhani",""],["Van","Chan Le",""],["Shahid","Saad",""],["khan","Aafaq Iqbal",""],["Shahid","Arsalan",""]]}
{"id":"2308.13535","submitter":"Yaoguang Zheng","authors":"Wen-Xiang Chen, Yao-Guang Zheng","title":"The possibility of the no-hair theorem being violated","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, one of my articles presented intriguing findings on the\nsuperradiant stability of Kerr black holes. These findings drew conclusions\nthat appear to challenge the established ``No Hair Theorem\". As is widely\nknown, the ``No Hair Theorem\" stems from the principles of general relativity.\nIn this paper, we thoroughly examine the nexus between Bell's theorem and the\nuncertainty principle. By delving deep into the theoretical underpinnings of\nboth concepts, we illustrate that Bell's theorem occupies a more foundational\nstance within the landscape of uncertainty. This gives rise to a particular\nprobability, shedding light on why the no-hair theorem might not hold in the\nface of quantum effects. It's possible that while the no-hair theorem remains\nvalid, the combined effects of classical and quantum mechanics introduce\nadditional variations to the three parameters of the black hole. This nuance\ncould represent a modest advancement in cosmological research.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 03:25:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Wen-Xiang",""],["Zheng","Yao-Guang",""]]}
{"id":"2308.13536","submitter":"Katsuhiko Hayashi","authors":"Katsuhiko Hayashi and Kazuma Onishi","title":"Implicit ZCA Whitening Effects of Linear Autoencoders for Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recently, in the field of recommendation systems, linear regression\n(autoencoder) models have been investigated as a way to learn item similarity.\nIn this paper, we show a connection between a linear autoencoder model and ZCA\nwhitening for recommendation data. In particular, we show that the dual form\nsolution of a linear autoencoder model actually has ZCA whitening effects on\nfeature vectors of items, while items are considered as input features in the\nprimal problem of the autoencoder/regression model. We also show the\ncorrectness of applying a linear autoencoder to low-dimensional item vectors\nobtained using embedding methods such as Item2vec to estimate item-item\nsimilarities. Our experiments provide preliminary results indicating the\neffectiveness of whitening low-dimensional item embeddings.\n","versions":[{"version":"v1","created":"Tue, 15 Aug 2023 07:58:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hayashi","Katsuhiko",""],["Onishi","Kazuma",""]]}
{"id":"2308.13537","submitter":"Junwei Pan","authors":"Liangcai Su, Junwei Pan, Ximei Wang, Xi Xiao, Shijie Quan, Xihua Chen,\n  Jie Jiang","title":"STEM: Unleashing the Power of Embeddings for Multi-task Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-task learning (MTL) has gained significant popularity in recommendation\nsystems as it enables the simultaneous optimization of multiple objectives. A\nkey challenge in MTL is the occurrence of negative transfer, where the\nperformance of certain tasks deteriorates due to conflicts between tasks.\nExisting research has explored negative transfer by treating all samples as a\nwhole, overlooking the inherent complexities within them. To this end, we delve\ninto the intricacies of samples by splitting them based on the relative amount\nof positive feedback among tasks. Surprisingly, negative transfer still occurs\nin existing MTL methods on samples that receive comparable feedback across\ntasks. It is worth noting that existing methods commonly employ a\nshared-embedding paradigm, and we hypothesize that their failure can be\nattributed to the limited capacity of modeling diverse user preferences across\ntasks using such universal embeddings.\n  In this paper, we introduce a novel paradigm called Shared and Task-specific\nEMbeddings (STEM) that aims to incorporate both shared and task-specific\nembeddings to effectively capture task-specific user preferences. Under this\nparadigm, we propose a simple model STEM-Net, which is equipped with shared and\ntask-specific embedding tables, along with a customized gating network with\nstop-gradient operations to facilitate the learning of these embeddings.\nRemarkably, STEM-Net demonstrates exceptional performance on comparable\nsamples, surpassing the Single-Task Like model and achieves positive transfer.\nComprehensive evaluation on three public MTL recommendation datasets\ndemonstrates that STEM-Net outperforms state-of-the-art models by a substantial\nmargin, providing evidence of its effectiveness and superiority.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 12:38:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Liangcai",""],["Pan","Junwei",""],["Wang","Ximei",""],["Xiao","Xi",""],["Quan","Shijie",""],["Chen","Xihua",""],["Jiang","Jie",""]]}
{"id":"2308.13538","submitter":"M Charity","authors":"M Charity, Yash Bhartia, Daniel Zhang, Ahmed Khalifa, and Julian\n  Togelius","title":"A Preliminary Study on a Conceptual Game Feature Generation and\n  Recommendation System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a system used to generate game feature suggestions\nbased on a text prompt. Trained on the game descriptions of almost 60k games,\nit uses the word embeddings of a small GLoVe model to extract features and\nentities found in thematically similar games which are then passed through a\ngenerator model to generate new features for a user's prompt. We perform a\nshort user study comparing the features generated from a fine-tuned GPT-2\nmodel, a model using the ConceptNet, and human-authored game features. Although\nhuman suggestions won the overall majority of votes, the GPT-2 model\noutperformed the human suggestions in certain games. This system is part of a\nlarger game design assistant tool that is able to collaborate with users at a\nconceptual level.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 21:20:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Charity","M",""],["Bhartia","Yash",""],["Zhang","Daniel",""],["Khalifa","Ahmed",""],["Togelius","Julian",""]]}
{"id":"2308.13539","submitter":"David Young-Jae Kim","authors":"David Y.J. Kim","title":"Redefining Computer Science Education: Code-Centric to Natural Language\n  Programming with AI-Based No-Code Platforms","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper delves into the evolving relationship between humans and computers\nin the realm of programming. Historically, programming has been a dialogue\nwhere humans meticulously crafted communication to suit machine understanding,\nshaping the trajectory of computer science education. However, the advent of\nAI-based no-code platforms is revolutionizing this dynamic. Now, humans can\nconverse in their natural language, expecting machines to interpret and act.\nThis shift has profound implications for computer science education. As\neducators, it's imperative to integrate this new dynamic into curricula. In\nthis paper, we've explored several pertinent research questions in this\ntransformation, which demand continued inquiry and adaptation in our\neducational strategies.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 02:44:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","David Y. J.",""]]}
{"id":"2308.13540","submitter":"Zhutian Chen","authors":"Zhutian Chen, Daniele Chiappalupi, Tica Lin, Yalong Yang, Johanna\n  Beyer, Hanspeter Pfister","title":"RL-LABEL: A Deep Reinforcement Learning Approach Intended for AR Label\n  Placement in Dynamic Scenarios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.GR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Labels are widely used in augmented reality (AR) to display digital\ninformation. Ensuring the readability of AR labels requires placing them\nocclusion-free while keeping visual linkings legible, especially when multiple\nlabels exist in the scene. Although existing optimization-based methods, such\nas force-based methods, are effective in managing AR labels in static\nscenarios, they often struggle in dynamic scenarios with constantly moving\nobjects. This is due to their focus on generating layouts optimal for the\ncurrent moment, neglecting future moments and leading to sub-optimal or\nunstable layouts over time. In this work, we present RL-LABEL, a deep\nreinforcement learning-based method for managing the placement of AR labels in\nscenarios involving moving objects. RL-LABEL considers the current and\npredicted future states of objects and labels, such as positions and\nvelocities, as well as the user's viewpoint, to make informed decisions about\nlabel placement. It balances the trade-offs between immediate and long-term\nobjectives. Our experiments on two real-world datasets show that RL-LABEL\neffectively learns the decision-making process for long-term optimization,\noutperforming two baselines (i.e., no view management and a force-based method)\nby minimizing label occlusions, line intersections, and label movement\ndistance. Additionally, a user study involving 18 participants indicates that\nRL-LABEL excels over the baselines in aiding users to identify, compare, and\nsummarize data on AR labels within dynamic scenes.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 14:23:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Zhutian",""],["Chiappalupi","Daniele",""],["Lin","Tica",""],["Yang","Yalong",""],["Beyer","Johanna",""],["Pfister","Hanspeter",""]]}
{"id":"2308.13541","submitter":"Huiyuan Chen","authors":"Huiyuan Chen, Xiaoting Li, Vivian Lai, Chin-Chia Michael Yeh, Yujie\n  Fan, Yan Zheng, Mahashweta Das, Hao Yang","title":"Adversarial Collaborative Filtering for Free","comments":null,"journal-ref":null,"doi":"10.1145/3604915.3608771","report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Collaborative Filtering (CF) has been successfully used to help users\ndiscover the items of interest. Nevertheless, existing CF methods suffer from\nnoisy data issue, which negatively impacts the quality of recommendation. To\ntackle this problem, many prior studies leverage adversarial learning to\nregularize the representations of users/items, which improves both\ngeneralizability and robustness. Those methods often learn adversarial\nperturbations and model parameters under min-max optimization framework.\nHowever, there still have two major drawbacks: 1) Existing methods lack\ntheoretical guarantees of why adding perturbations improve the model\ngeneralizability and robustness; 2) Solving min-max optimization is\ntime-consuming. In addition to updating the model parameters, each iteration\nrequires additional computations to update the perturbations, making them not\nscalable for industry-scale datasets.\n  In this paper, we present Sharpness-aware Collaborative Filtering (SharpCF),\na simple yet effective method that conducts adversarial training without extra\ncomputational cost over the base optimizer. To achieve this goal, we first\nrevisit the existing adversarial collaborative filtering and discuss its\nconnection with recent Sharpness-aware Minimization. This analysis shows that\nadversarial training actually seeks model parameters that lie in neighborhoods\naround the optimal model parameters having uniformly low loss values, resulting\nin better generalizability. To reduce the computational overhead, SharpCF\nintroduces a novel trajectory loss to measure the alignment between current\nweights and past weights. Experimental results on real-world datasets\ndemonstrate that our SharpCF achieves superior performance with almost zero\nadditional computational cost comparing to adversarial training.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 19:25:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Huiyuan",""],["Li","Xiaoting",""],["Lai","Vivian",""],["Yeh","Chin-Chia Michael",""],["Fan","Yujie",""],["Zheng","Yan",""],["Das","Mahashweta",""],["Yang","Hao",""]]}
{"id":"2308.13542","submitter":"Thommen George Karimpanal","authors":"Thommen George Karimpanal, Laknath Buddhika Semage, Santu Rana, Hung\n  Le, Truyen Tran, Sunil Gupta and Svetha Venkatesh","title":"LaGR-SEQ: Language-Guided Reinforcement Learning with Sample-Efficient\n  Querying","comments":"18 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have recently demonstrated their impressive\nability to provide context-aware responses via text. This ability could\npotentially be used to predict plausible solutions in sequential decision\nmaking tasks pertaining to pattern completion. For example, by observing a\npartial stack of cubes, LLMs can predict the correct sequence in which the\nremaining cubes should be stacked by extrapolating the observed patterns (e.g.,\ncube sizes, colors or other attributes) in the partial stack. In this work, we\nintroduce LaGR (Language-Guided Reinforcement learning), which uses this\npredictive ability of LLMs to propose solutions to tasks that have been\npartially completed by a primary reinforcement learning (RL) agent, in order to\nsubsequently guide the latter's training. However, as RL training is generally\nnot sample-efficient, deploying this approach would inherently imply that the\nLLM be repeatedly queried for solutions; a process that can be expensive and\ninfeasible. To address this issue, we introduce SEQ (sample efficient\nquerying), where we simultaneously train a secondary RL agent to decide when\nthe LLM should be queried for solutions. Specifically, we use the quality of\nthe solutions emanating from the LLM as the reward to train this agent. We show\nthat our proposed framework LaGR-SEQ enables more efficient primary RL\ntraining, while simultaneously minimizing the number of queries to the LLM. We\ndemonstrate our approach on a series of tasks and highlight the advantages of\nour approach, along with its limitations and potential future research\ndirections.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 02:07:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Karimpanal","Thommen George",""],["Semage","Laknath Buddhika",""],["Rana","Santu",""],["Le","Hung",""],["Tran","Truyen",""],["Gupta","Sunil",""],["Venkatesh","Svetha",""]]}
{"id":"2308.13543","submitter":"Chen Liang","authors":"Chen Liang","title":"Towards Ubiquitous Intelligent Hand Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The development of ubiquitous computing and sensing devices has brought about\nnovel interaction scenarios such as mixed reality and IoT (e.g., smart home),\nwhich pose new demands for the next generation of natural user interfaces\n(NUI). Human hand, benefit for the large degree-of-freedom, serves as a medium\nthrough which people interact with the external world in their daily lives,\nthus also being regarded as the main entry of NUI. Unfortunately, current hand\ntracking system is largely confined on first perspective vision-based\nsolutions, which suffer from optical artifacts and are not practical in\nubiquitous environments. In my thesis, I rethink this problem by analyzing the\nunderlying logic in terms of sensor, behavior, and semantics, constituting a\nresearch framework for achieving ubiquitous intelligent hand interaction. Then\nI summarize my previous research topics and illustrated the future research\ndirections based on my research framework.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 07:52:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liang","Chen",""]]}
{"id":"2308.13544","submitter":"Julien Mercier","authors":"Julien Mercier (Lab-Sticc_decide, Ubs, Hes-So, Hes-So, Heig-Vd), N.\n  Chabloz (Hes-So, Heig-Vd, Hes-So), G. Dozot (Hes-So, Heig-Vd, Hes-So), C.\n  Audrin, O. Ertz (Hes-So, Heig-Vd, Hes-So), E. Bocher (Lab-Sticc_decide,\n  Lab-Sticc), D. Rappo (Hes-So, Heig-Vd, Hes-So)","title":"Impact of geolocation data on augmented reality usability: A comparative\n  user test","comments":null,"journal-ref":"International Archives of the Photogrammetry, Remote Sensing and\n  Spatial Information Sciences, 2023, XLVIII-4/W7-2023, pp.133-140","doi":"10.5194/isprs-archives-XLVIII-4-W7-2023-133-2023","report-no":null,"categories":"cs.HC cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Abstract. While the use of location-based augmented reality (AR) for\neducation has demonstrated benefits on participants' motivation, engagement,\nand on their physical activity, geolocation data inaccuracy causes augmented\nobjects to jitter or drift, which is a factor in downgrading user experience.\nWe developed a free and open source web AR application and conducted a\ncomparative user test (n = 54) in order to assess the impact of geolocation\ndata on usability, exploration, and focus. A control group explored\nbiodiversity in nature using the system in combination with embedded GNSS data,\nand an experimental group used an external module for RTK data. During the\ntest, eye tracking data, geolocated traces, and in-app user-triggered events\nwere recorded. Participants answered usability questionnaires (SUS, UEQ,\nHARUS).We found that the geolocation data the RTK group was exposed to was less\naccurate in average than that of the control group. The RTK group reported\nlower usability scores on all scales, of which 5 out of 9 were significant,\nindicating that inaccurate data negatively predicts usability. The GNSS group\nwalked more than the RTK group, indicating a partial effect on exploration. We\nfound no significant effect on interaction time with the screen, indicating no\nspecific relation between data accuracy and focus. While RTK data did not allow\nus to better the usability of location-based AR interfaces, results allow us to\nassess our system's overall usability as excellent, and to define optimal\noperating conditions for future use with pupils.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 11:25:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mercier","Julien","","Lab-Sticc_decide, Ubs, Hes-So, Hes-So, Heig-Vd"],["Chabloz","N.","","Hes-So, Heig-Vd, Hes-So"],["Dozot","G.","","Hes-So, Heig-Vd, Hes-So"],["Audrin","C.","","Hes-So, Heig-Vd, Hes-So"],["Ertz","O.","","Hes-So, Heig-Vd, Hes-So"],["Bocher","E.","","Lab-Sticc_decide,\n  Lab-Sticc"],["Rappo","D.","","Hes-So, Heig-Vd, Hes-So"]]}
{"id":"2308.13545","submitter":"Md Rafi Ur Rashid","authors":"Md. Rafi-Ur-Rashid, Sami Azam, Mirjam Jonkman","title":"Feature Extraction Using Deep Generative Models for Bangla Text\n  Classification on a New Comprehensive Dataset","comments":"To be submitted in Heliyon Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The selection of features for text classification is a fundamental task in\ntext mining and information retrieval. Despite being the sixth most widely\nspoken language in the world, Bangla has received little attention due to the\nscarcity of text datasets. In this research, we collected, annotated, and\nprepared a comprehensive dataset of 212,184 Bangla documents in seven different\ncategories and made it publicly accessible. We implemented three deep learning\ngenerative models: LSTM variational autoencoder (LSTM VAE), auxiliary\nclassifier generative adversarial network (AC-GAN), and adversarial autoencoder\n(AAE) to extract text features, although their applications are initially found\nin the field of computer vision. We utilized our dataset to train these three\nmodels and used the feature space obtained in the document classification task.\nWe evaluated the performance of the classifiers and found that the adversarial\nautoencoder model produced the best feature space.\n","versions":[{"version":"v1","created":"Mon, 21 Aug 2023 22:18:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rafi-Ur-Rashid","Md.",""],["Azam","Sami",""],["Jonkman","Mirjam",""]]}
{"id":"2308.13546","submitter":"Jingyun Huang","authors":"Jingyun Huang, Mengting Liu, Chad E. Forbes","title":"Functional Graph Contrastive Learning of Hyperscanning EEG Reveals\n  Emotional Contagion Evoked by Stereotype-Based Stressors","comments":"13 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study delves into the intricacies of emotional contagion and its impact\non performance within dyadic interactions. Specifically, it focuses on the\ncontext of stereotype-based stress (SBS) during collaborative problem-solving\ntasks among female pairs. Through an exploration of emotional contagion, the\nresearch seeks to unveil its underlying mechanisms and effects. Leveraging\nEEG-based hyperscanning technology, the study introduces an innovative approach\nknown as functional Graph Contrastive Learning (fGCL), which extracts\nsubject-invariant representations of neural activity patterns. These\nrepresentations are further subjected to analysis using the Dynamic Graph\nClassification (DGC) model, aimed at dissecting the process of emotional\ncontagion. By scrutinizing brain synchronization and connectivity, the study\nreveals the intricate interplay between emotional contagion and cognitive\nfunctioning. The results underscore the substantial role of emotional contagion\nin shaping the trajectories of participants' performance during collaborative\ntasks in the presence of SBS conditions. Overall, this research contributes\ninvaluable insights into the neural underpinnings of emotional contagion,\nthereby enriching our comprehension of the complexities underlying social\ninteractions and emotional dynamics.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 09:04:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Jingyun",""],["Liu","Mengting",""],["Forbes","Chad E.",""]]}
{"id":"2308.13547","submitter":"Antonio A. Valido","authors":"Antonio A. Valido, Mattia Coccolo, and Miguel A.F. Sanju\\'an","title":"Time-delayed Duffing oscillator in an active bath","comments":"12+1 pages, 10 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech nlin.CD physics.bio-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the last decades active particles have attracted an incipient\nattention as they have been observed in a broad class of scenarios, ranging\nfrom bacterial suspension in living systems to artificial swimmers in\nnonequilibirum systems. The main feature of these particles is that they are\nable to gain kinetic energy from the environment, which is widely modeled by a\nstochastic process due to both (Gaussian) white and Ornstein-Uhlenbeck noises.\nIn the present work, we study the nonlinear dynamics of the forced,\ntime-delayed Duffing oscillator subject to these noises, paying special\nattention to their impact upon the maximum oscillations amplitude and\ncharacteristic frequency of the steady state for different values of the time\ndelay and the driving force. Overall, our results indicate that the role of the\ntime delay is substantially modified with respect to the situation without\nnoise. For instance, we show that the oscillations amplitude grows with\nincreasing noise strength when the time delay acts as a damping term in absence\nof noise, whereas the trajectories eventually become aperiodic when the\noscillations are sustained by the time delay. In short, the interplay among the\nnoises, forcing and time delay gives rise to a rich dynamics: a regular and\nperiodic motion is destroyed or restored owing to the competition between the\nnoise and the driving force depending on time delay values, whereas an erratic\nmotion insensitive to the driving force emerges when the time delay makes the\nmotion aperiodic.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 14:20:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Valido","Antonio A.",""],["Coccolo","Mattia",""],["Sanju\u00e1n","Miguel A. F.",""]]}
{"id":"2308.13548","submitter":"Arpan Tripathi","authors":"Ahad Shams, Douglas Summers-Stay, Vsevolod Metelsky, Arpan Tripathi,\n  Karan Malhotra","title":"Towards a Holodeck-style Simulation Game","comments":"18 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce Infinitia, a simulation game system that uses generative image\nand language models at play time to reshape all aspects of the setting and NPCs\nbased on a short description from the player, in a way similar to how settings\nare created on the fictional Holodeck. Building off the ideas of the Generative\nAgents paper, our system introduces gameplay elements, such as infinite\ngenerated fantasy worlds, controllability of NPC behavior, humorous dialogue,\ncost & time efficiency, collaboration between players and elements of\nnon-determinism among in-game events. Infinitia is implemented in the Unity\nengine with a server-client architecture, facilitating the addition of exciting\nfeatures by community developers in the future. Furthermore, it uses a\nmultiplayer framework to allow humans to be present and interact in the\nsimulation. The simulation will be available in open-alpha shortly at\nhttps://infinitia.ai/ and we are looking forward to building upon it with the\ncommunity.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 19:19:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shams","Ahad",""],["Summers-Stay","Douglas",""],["Metelsky","Vsevolod",""],["Tripathi","Arpan",""],["Malhotra","Karan",""]]}
{"id":"2308.13549","submitter":"Sadaf Ghaffari","authors":"Marcia Moraes, Sadaf Ghaffari, Yanye Luther, and James Folkestad","title":"Combining Automatic Coding and Instructor Input to Generate ENA\n  Visualizations for Asynchronous Online Discussion","comments":"15 pages, 4 figures, 6 Tables, appearing in ICQE 2023 proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Asynchronous online discussions are a common fundamental tool to facilitate\nsocial interaction in hybrid and online courses. However, instructors lack the\ntools to accomplish the overwhelming task of evaluating asynchronous online\ndiscussion activities. In this paper we present an approach that uses Latent\nDirichlet Analysis (LDA) and the instructor's keywords to automatically extract\ncodes from a relatively small dataset. We use the generated codes to build an\nEpistemic Network Analysis (ENA) model and compare this model with a previous\nENA model built by human coders. The results show that there is no statistical\ndifference between the two models. We present an analysis of these models and\ndiscuss the potential use of ENA as a visualization to help instructors\nevaluating asynchronous online discussions.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 20:42:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Moraes","Marcia",""],["Ghaffari","Sadaf",""],["Luther","Yanye",""],["Folkestad","James",""]]}
{"id":"2308.13550","submitter":"Ying-Ju Chen","authors":"Fadel M. Megahed, Ying-Ju Chen, Inez Zwetsloot, Sven Knoth, Douglas C.\n  Montgomery, and L. Allison Jones-Farmer","title":"AI and the Future of Work in Statistical Quality Control: Insights from\n  a First Attempt to Augmenting ChatGPT with an SQC Knowledge Base (ChatSQC)","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce ChatSQC, an innovative chatbot system that combines the power of\nOpenAI's Large Language Models (LLM) with a specific knowledge base in\nStatistical Quality Control (SQC). Our research focuses on enhancing LLMs using\nspecific SQC references, shedding light on how data preprocessing parameters\nand LLM selection impact the quality of generated responses. By illustrating\nthis process, we hope to motivate wider community engagement to refine LLM\ndesign and output appraisal techniques. We also highlight potential research\nopportunities within the SQC domain that can be facilitated by leveraging\nChatSQC, thereby broadening the application spectrum of SQC. A primary goal of\nour work is to equip practitioners with a tool capable of generating precise\nSQC-related responses, thereby democratizing access to advanced SQC knowledge.\nTo continuously improve ChatSQC, we ask the SQC community to provide feedback,\nhighlight potential issues, request additional features, and/or contribute via\npull requests through our public GitHub repository. Additionally, the team will\ncontinue to explore adding supplementary reference material that would further\nimprove the contextual understanding of the chatbot. Overall, ChatSQC serves as\na testament to the transformative potential of AI within SQC, and we hope it\nwill spur further advancements in the integration of AI in this field.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 22:37:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Megahed","Fadel M.",""],["Chen","Ying-Ju",""],["Zwetsloot","Inez",""],["Knoth","Sven",""],["Montgomery","Douglas C.",""],["Jones-Farmer","L. Allison",""]]}
{"id":"2308.13551","submitter":"Siyue Yao","authors":"Siyue Yao, Mingjie Sun, Bingliang Li, Fengyu Yang, Junle Wang, Ruimao\n  Zhang","title":"Dance with You: The Diversity Controllable Dancer Generation via\n  Diffusion Models","comments":"Accepted by ACM MM","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, digital humans for interpersonal interaction in virtual\nenvironments have gained significant attention. In this paper, we introduce a\nnovel multi-dancer synthesis task called partner dancer generation, which\ninvolves synthesizing virtual human dancers capable of performing dance with\nusers. The task aims to control the pose diversity between the lead dancer and\nthe partner dancer. The core of this task is to ensure the controllable\ndiversity of the generated partner dancer while maintaining temporal\ncoordination with the lead dancer. This scenario varies from earlier research\nin generating dance motions driven by music, as our emphasis is on\nautomatically designing partner dancer postures according to pre-defined\ndiversity, the pose of lead dancer, as well as the accompanying tunes. To\nachieve this objective, we propose a three-stage framework called\nDance-with-You (DanY). Initially, we employ a 3D Pose Collection stage to\ncollect a wide range of basic dance poses as references for motion generation.\nThen, we introduce a hyper-parameter that coordinates the similarity between\ndancers by masking poses to prevent the generation of sequences that are\nover-diverse or consistent. To avoid the rigidity of movements, we design a\nDance Pre-generated stage to pre-generate these masked poses instead of filling\nthem with zeros. After that, a Dance Motion Transfer stage is adopted with\nleader sequences and music, in which a multi-conditional sampling formula is\nrewritten to transfer the pre-generated poses into a sequence with a partner\nstyle. In practice, to address the lack of multi-person datasets, we introduce\nAIST-M, a new dataset for partner dancer generation, which is publicly\navailiable. Comprehensive evaluations on our AIST-M dataset demonstrate that\nthe proposed DanY can synthesize satisfactory partner dancer results with\ncontrollable diversity.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 15:54:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yao","Siyue",""],["Sun","Mingjie",""],["Li","Bingliang",""],["Yang","Fengyu",""],["Wang","Junle",""],["Zhang","Ruimao",""]]}
{"id":"2308.13552","submitter":"Andrew Wentzel","authors":"Andrew Wentzel, Lauren Levine, Vipul Dhariwal, Zahra Fatemi, Barbara\n  Di Eugenio, Andrew Rojecki, Elena Zheleva, G.Elisabeta Marai","title":"A Lens to Pandemic Stay at Home Attitudes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We describe the design process and the challenges we met during a rapid\nmulti-disciplinary pandemic project related to stay-at-home orders and social\nmedia moral frames. Unlike our typical design experience, we had to handle a\nsteeper learning curve, emerging and continually changing datasets, as well as\nunder-specified design requirements, persistent low visual literacy, and an\nextremely fast turnaround for new data ingestion, prototyping, testing and\ndeployment. We describe the lessons learned through this experience.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:21:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wentzel","Andrew",""],["Levine","Lauren",""],["Dhariwal","Vipul",""],["Fatemi","Zahra",""],["Di Eugenio","Barbara",""],["Rojecki","Andrew",""],["Zheleva","Elena",""],["Marai","G. Elisabeta",""]]}
{"id":"2308.13553","submitter":"Satoshi Kondo","authors":"Satoshi Kondo, Satoshi Kasai, Kousuke Hirasawa","title":"Synthesizing 3D computed tomography from MRI or CBCT using 2.5D deep\n  neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Deep learning techniques, particularly convolutional neural networks (CNNs),\nhave gained traction for synthetic computed tomography (sCT) generation from\nMagnetic resonance imaging (MRI), Cone-beam computed tomography (CBCT) and PET.\nIn this report, we introduce a method to syn-thesize CT from MRI or CBCT. Our\nmethod is based on multi-slice (2.5D) CNNs. 2.5D CNNs offer distinct advantages\nover 3D CNNs when dealing with volumetric data. In the experiments, we evaluate\nthe performance of our method for two tasks, MRI-to-sCT and CBCT-to-sCT\ngeneration. Target organs for both tasks are brain and pelvis.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 21:36:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kondo","Satoshi",""],["Kasai","Satoshi",""],["Hirasawa","Kousuke",""]]}
{"id":"2308.13554","submitter":"Denis Liu","authors":"Denis Liu","title":"A Systematic Study on Quantifying Bias in GAN-Augmented Data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative adversarial networks (GANs) have recently become a popular data\naugmentation technique used by machine learning practitioners. However, they\nhave been shown to suffer from the so-called mode collapse failure mode, which\nmakes them vulnerable to exacerbating biases on already skewed datasets,\nresulting in the generated data distribution being less diverse than the\ntraining distribution. To this end, we address the problem of quantifying the\nextent to which mode collapse occurs. This study is a systematic effort focused\non the evaluation of state-of-the-art metrics that can potentially quantify\nbiases in GAN-augmented data. We show that, while several such methods are\navailable, there is no single metric that quantifies bias exacerbation reliably\nover the span of different image domains.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 22:19:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Denis",""]]}
{"id":"2308.13555","submitter":"Eduardo G. Altmann","authors":"Lachlan Burton, Holger Dullin, and Eduardo G. Altmann","title":"Probabilistic description of dissipative chaotic scattering","comments":"11 pages, 5 figures; For associated repository with codes, see\n  https://github.com/LnBn/DissipativeScattering","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech nlin.CD physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the extent to which the probabilistic properties of a chaotic\nscattering system with dissipation can be understood from the properties of the\ndissipation-free system. For large energies $E$, a fully chaotic scattering\nleads to an exponential decay of the survival probability $P(t) \\sim e^{-\\kappa\nt}$ with an escape rate $\\kappa$ that decreases with $E$. Dissipation\n$\\gamma>0$ leads to the appearance of different finite-time regimes in $P(t)$.\nWe show how these different regimes can be understood for small $\\gamma\\ll 1$\nand $t\\gg 1/\\kappa_0$ from the effective escape rate\n$\\kappa_\\gamma(t)=\\kappa_0(E(t))$ (including the non-hyperbolic regime) until\nthe energy reaches a critical value $E_c$ at which no escape is possible. More\ngenerally, we argue that for small dissipation $\\gamma$ and long times $t$ the\nsurviving trajectories in the dissipative system are distributed according to\nthe conditionally invariant measure of the conservative system at the\ncorresponding energy $E(t)<E(0)$. Quantitative predictions of our general\ntheory are compared with numerical simulations in the Henon-Heiles model.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 12:19:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Burton","Lachlan",""],["Dullin","Holger",""],["Altmann","Eduardo G.",""]]}
{"id":"2308.13556","submitter":"Alexandre Kosyak","authors":"Alexandre Kosyak","title":"The height of an infinite parallelotope is infinite","comments":"18 pages. arXiv admin note: substantial text overlap with\n  arXiv:2307.11198","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show that $\\frac{\\Gamma(f_0,f_1,\\dots,f_m)}\n{\\Gamma(f_1,\\dots,f_m)}=\\infty$ for $m+1$ vectors having the properties that no\nnon-trivial linear combination of them belongs to $l_2(\\mathbb N)$. This\nproperty is essential in the proof of the irreducibility of unitary\nrepresentations of some infinite-dimensional groups.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 13:25:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kosyak","Alexandre",""]]}
{"id":"2308.13557","submitter":"Makoto Shimizu","authors":"Makoto Shimizu, Junya Otsuki, Harald O. Jeschke","title":"Magnetic fluctuations in Pb$_9$Cu(PO$_4$)$_6$O","comments":"6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The hope that copper doped lead apatite Pb$_9$Cu(PO$_4$)$_6$O is a\nroom-temperature superconductor has largely been dashed by global research\nefforts. Nevertheless, according to the current state of knowledge, the\nmaterial has interesting magnetic properties, and research groups around the\nworld have prepared high quality samples. We use a fluctuation exchange\napproximation (FLEX) approach to study the magnetic tendencies in\nPb$_9$Cu(PO$_4$)$_6$O. We find ferromagnetic fluctuations very close to the\nfilling of the stoichiometric compound which can be understood from Fermi\nsurface nesting at the M point. This is similar to the one-band triangular\nlattice Hamiltonian at three-quarter filling. Interestingly, the special kz\ndependence of the Pb$_9$Cu(PO$_4$)$_6$O band structure makes it very sensitive\nto doping. Only slight charge doping switches between antiferromagnetic and\nferromagnetic fluctuations. If the material could become superconducting, it\nmight be easily switchable between singlet and triplet superconductivity.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:42:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shimizu","Makoto",""],["Otsuki","Junya",""],["Jeschke","Harald O.",""]]}
{"id":"2308.13558","submitter":"Yassine Himeur","authors":"Yassine Himeur, Iraklis Varlamis, Hamza Kheddar, Abbes Amira, Shadi\n  Atalla, Yashbir Singh, Faycal Bensaali and Wathiq Mansoor","title":"Federated Learning for Computer Vision","comments":"30 pages, 13 figures and 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computer Vision (CV) is playing a significant role in transforming society by\nutilizing machine learning (ML) tools for a wide range of tasks. However, the\nneed for large-scale datasets to train ML models creates challenges for\ncentralized ML algorithms. The massive computation loads required for\nprocessing and the potential privacy risks associated with storing and\nprocessing data on central cloud servers put these algorithms under severe\nstrain. To address these issues, federated learning (FL) has emerged as a\npromising solution, allowing privacy preservation by training models locally\nand exchanging them to improve overall performance. Additionally, the\ncomputational load is distributed across multiple clients, reducing the burden\non central servers. This paper presents, to the best of the authors' knowledge,\nthe first review discussing recent advancements of FL in CV applications,\ncomparing them to conventional centralized training paradigms. It provides an\noverview of current FL applications in various CV tasks, emphasizing the\nadvantages of FL and the challenges of implementing it in CV. To facilitate\nthis, the paper proposes a taxonomy of FL techniques in CV, outlining their\napplications and security threats. It also discusses privacy concerns related\nto implementing blockchain in FL schemes for CV tasks and summarizes existing\nprivacy preservation methods. Moving on, the paper identifies open research\nchallenges and potential future research directions to further exploit the\npotential of FL and blockchain in CV applications.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 16:05:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Himeur","Yassine",""],["Varlamis","Iraklis",""],["Kheddar","Hamza",""],["Amira","Abbes",""],["Atalla","Shadi",""],["Singh","Yashbir",""],["Bensaali","Faycal",""],["Mansoor","Wathiq",""]]}
{"id":"2308.13559","submitter":"Vikas Ramachandra","authors":"Vikas Ramachandra and Mohit Sethi","title":"Machine Unlearning for Causal Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning models play a vital role in making predictions and deriving\ninsights from data and are being increasingly used for causal inference. To\npreserve user privacy, it is important to enable the model to forget some of\nits learning/captured information about a given user (machine unlearning). This\npaper introduces the concept of machine unlearning for causal inference,\nparticularly propensity score matching and treatment effect estimation, which\naims to refine and improve the performance of machine learning models for\ncausal analysis given the above unlearning requirements. The paper presents a\nmethodology for machine unlearning using a neural network-based propensity\nscore model. The dataset used in the study is the Lalonde dataset, a widely\nused dataset for evaluating the effectiveness i.e. the treatment effect of job\ntraining programs. The methodology involves training an initial propensity\nscore model on the original dataset and then creating forget sets by\nselectively removing instances, as well as matched instance pairs. based on\npropensity score matching. These forget sets are used to evaluate the retrained\nmodel, allowing for the elimination of unwanted associations. The actual\nretraining of the model is performed using the retain set. The experimental\nresults demonstrate the effectiveness of the machine unlearning approach. The\ndistribution and histogram analysis of propensity scores before and after\nunlearning provide insights into the impact of the unlearning process on the\ndata. This study represents the first attempt to apply machine unlearning\ntechniques to causal inference.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:27:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ramachandra","Vikas",""],["Sethi","Mohit",""]]}
{"id":"2308.13560","submitter":"Michael Glass","authors":"Michael Glass, Sugato Bagchi, Oktie Hassanzadeh, Gaetano Rossiello,\n  Alfio Gliozzo","title":"Open Government Data Corpus for Table Search","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Increasing amounts of structured data can provide value for research and\nbusiness if the relevant data can be located. Often the data is in a data lake\nwithout a consistent schema, making locating useful data challenging. Table\nsearch is a growing research area, but existing benchmarks have been limited to\ndisplayed tables. Tables sized and formatted for display in a Wikipedia page or\nArXiv paper are considerably different from data tables in both scale and\nstyle. By using metadata associated with open data from government portals, we\ncreate the first dataset to benchmark search over data tables at scale. We\ndemonstrate three styles of table-to-table related table search. The three\nnotions of table relatedness are: tables produced by the same organization,\ntables distributed as part of the same dataset, and tables with a high degree\nof overlap in the annotated tags. The keyword tags provided with the metadata\nalso permit the automatic creation of a keyword search over tables benchmark.\nWe provide baselines on this dataset using existing methods including\ntraditional and neural approaches.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 18:33:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Glass","Michael",""],["Bagchi","Sugato",""],["Hassanzadeh","Oktie",""],["Rossiello","Gaetano",""],["Gliozzo","Alfio",""]]}
{"id":"2308.13561","submitter":"Kiran Somasundaram","authors":"Kiran Somasundaram, Jing Dong, Huixuan Tang, Julian Straub, Mingfei\n  Yan, Michael Goesele, Jakob Julian Engel, Renzo De Nardi, Richard Newcombe","title":"Project Aria: A New Tool for Egocentric Multi-Modal AI Research","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Egocentric, multi-modal data as available on future augmented reality (AR)\ndevices provides unique challenges and opportunities for machine perception.\nThese future devices will need to be all-day wearable in a socially acceptable\nform-factor to support always available, context-aware and personalized AI\napplications. Our team at Meta Reality Labs Research built the Aria device, an\negocentric, multi-modal data recording and streaming device with the goal to\nfoster and accelerate research in this area. In this paper, we describe the\nAria device hardware including its sensor configuration and the corresponding\nsoftware tools that enable recording and processing of such data.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 20:42:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Somasundaram","Kiran",""],["Dong","Jing",""],["Tang","Huixuan",""],["Straub","Julian",""],["Yan","Mingfei",""],["Goesele","Michael",""],["Engel","Jakob Julian",""],["De Nardi","Renzo",""],["Newcombe","Richard",""]]}
{"id":"2308.13562","submitter":"Nasibe Alipour rad","authors":"Hossein Safari, Nasibe Alipour, Hamed Ghaderi and Pardis Garavand","title":"Zernike moments descript of solar and astronomical features: Python code","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to the massive increase in astronomical images (such as James Webb and\nSolar Dynamic Observatory), automatic image description is essential for solar\nand astronomical. Zernike moments (ZMs) are unique due to the orthogonality and\ncompleteness of Zernike polynomials (ZPs); hence valuable to convert a\ntwo-dimensional image to one-dimensional series of complex numbers. The\nmagnitude of ZMs is rotation invariant, and by applying image normalization,\nscale and translation invariants can be made, which are helpful properties for\ndescribing solar and astronomical images. In this package, we describe the\ncharacteristics of ZMs via several examples of solar (large and small scale)\nfeatures and astronomical images. ZMs can describe the structure and morphology\nof objects in an image to apply machine learning to identify and track the\nfeatures in several disciplines.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 21:14:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Safari","Hossein",""],["Alipour","Nasibe",""],["Ghaderi","Hamed",""],["Garavand","Pardis",""]]}
{"id":"2308.13563","submitter":"Maroa Mumtarin","authors":"Maroa Mumtarin, Md Samiullah Chowdhury, Jonathan Wood","title":"Large Language Models in Analyzing Crash Narratives -- A Comparative\n  Study of ChatGPT, BARD and GPT-4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.IR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In traffic safety research, extracting information from crash narratives\nusing text analysis is a common practice. With recent advancements of large\nlanguage models (LLM), it would be useful to know how the popular LLM\ninterfaces perform in classifying or extracting information from crash\nnarratives. To explore this, our study has used the three most popular publicly\navailable LLM interfaces- ChatGPT, BARD and GPT4. This study investigated their\nusefulness and boundaries in extracting information and answering queries\nrelated to accidents from 100 crash narratives from Iowa and Kansas. During the\ninvestigation, their capabilities and limitations were assessed and their\nresponses to the queries were compared. Five questions were asked related to\nthe narratives: 1) Who is at-fault? 2) What is the manner of collision? 3) Has\nthe crash occurred in a work-zone? 4) Did the crash involve pedestrians? and 5)\nWhat are the sequence of harmful events in the crash? For questions 1 through\n4, the overall similarity among the LLMs were 70%, 35%, 96% and 89%,\nrespectively. The similarities were higher while answering direct questions\nrequiring binary responses and significantly lower for complex questions. To\ncompare the responses to question 5, network diagram and centrality measures\nwere analyzed. The network diagram from the three LLMs were not always similar\nalthough they sometimes have the same influencing events with high in-degree,\nout-degree and betweenness centrality. This study suggests using multiple\nmodels to extract viable information from narratives. Also, caution must be\npracticed while using these interfaces to obtain crucial safety related\ninformation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:09:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mumtarin","Maroa",""],["Chowdhury","Md Samiullah",""],["Wood","Jonathan",""]]}
{"id":"2308.13564","submitter":"Sokbae Lee","authors":"Xiaohong Chen, Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin,\n  Myunghyun Song","title":"SGMM: Stochastic Approximation to Generalized Method of Moments","comments":"45 pages, 4 tables, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM cs.LG math.ST stat.CO stat.ML stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new class of algorithms, Stochastic Generalized Method of\nMoments (SGMM), for estimation and inference on (overidentified) moment\nrestriction models. Our SGMM is a novel stochastic approximation alternative to\nthe popular Hansen (1982) (offline) GMM, and offers fast and scalable\nimplementation with the ability to handle streaming datasets in real time. We\nestablish the almost sure convergence, and the (functional) central limit\ntheorem for the inefficient online 2SLS and the efficient SGMM. Moreover, we\npropose online versions of the Durbin-Wu-Hausman and Sargan-Hansen tests that\ncan be seamlessly integrated within the SGMM framework. Extensive Monte Carlo\nsimulations show that as the sample size increases, the SGMM matches the\nstandard (offline) GMM in terms of estimation accuracy and gains over\ncomputational efficiency, indicating its practical value for both large-scale\nand online datasets. We demonstrate the efficacy of our approach by a proof of\nconcept using two well known empirical examples with large sample sizes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 00:22:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Xiaohong",""],["Lee","Sokbae",""],["Liao","Yuan",""],["Seo","Myung Hwan",""],["Shin","Youngki",""],["Song","Myunghyun",""]]}
{"id":"2308.13565","submitter":"Tong Xie","authors":"Tong Xie, Yuwei Wan, Wei Huang, Zhenyu Yin, Yixuan Liu, Shaozhou Wang,\n  Qingyuan Linghu, Chunyu Kit, Clara Grazian, Wenjie Zhang, Imran Razzak, Bram\n  Hoex","title":"DARWIN Series: Domain Specific Large Language Models for Natural Science","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Emerging tools bring forth fresh approaches to work, and the field of natural\nscience is no different. In natural science, traditional manual, serial, and\nlabour-intensive work is being augmented by automated, parallel, and iterative\nprocesses driven by artificial intelligence-based experimental automation and\nmore. To add new capabilities in natural science, enabling the acceleration and\nenrichment of automation of the discovery process, we present DARWIN, a series\nof tailored LLMs for natural science, mainly in physics, chemistry, and\nmaterial science. This series relies on open-source LLM, incorporating\nstructured and unstructured scientific knowledge from public datasets and\nliterature. We fine-tuned the models using over 60,000 instruction data points,\nemphasizing factual correctness. During the fine-tuning, we introduce the\nScientific Instruction Generation (SIG) model, automating instruction\ngeneration from scientific texts. This eliminates the need for manual\nextraction or domain-specific knowledge graphs and efficiently injects\nscientific knowledge into the model. We also explore multi-task training\nstrategies, revealing interconnections between scientific tasks. DARWIN series\nnot only achieves state-of-the-art results on various scientific tasks but also\ndiminishes reliance on closed-source AI models. Our research showcases the\nability of LLM in the scientific domain, with the overarching goal of fostering\nprosperity within the broader AI for science community.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:40:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xie","Tong",""],["Wan","Yuwei",""],["Huang","Wei",""],["Yin","Zhenyu",""],["Liu","Yixuan",""],["Wang","Shaozhou",""],["Linghu","Qingyuan",""],["Kit","Chunyu",""],["Grazian","Clara",""],["Zhang","Wenjie",""],["Razzak","Imran",""],["Hoex","Bram",""]]}
{"id":"2308.13566","submitter":"Bin Wang","authors":"Zhiyuan Zhao, Linke Ouyang, Bin Wang, Siyuan Huang, Pan Zhang, Xiaoyi\n  Dong, Jiaqi Wang, Conghui He","title":"MLLM-DataEngine: An Iterative Refinement Approach for MLLM","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the great advance of Multimodal Large Language Models (MLLMs) in both\ninstruction dataset building and benchmarking, the independence of training and\nevaluation makes current MLLMs hard to further improve their capability under\nthe guidance of evaluation results with a relatively low human cost. In this\npaper, we propose MLLM-DataEngine, a novel closed-loop system that bridges data\ngeneration, model training, and evaluation. Within each loop iteration, the\nMLLM-DataEngine first analyze the weakness of the model based on the evaluation\nresults, then generate a proper incremental dataset for the next training\niteration and enhance the model capability iteratively. Compared with previous\ndata collection methods which are separate from the benchmarking, the data\ngenerated by MLLM-DataEngine shows better targeting, quality, and correctness.\nFor targeting, we propose an Adaptive Bad-case Sampling module, which adjusts\nthe ratio of different types of data within each incremental dataset based on\nthe benchmarking results. For quality, we resort to GPT-4 to generate\nhigh-quality data with each given data type. For correctness, prompt design is\ncritical for the data generation results. Rather than previous hand-crafted\nprompt, we propose an Interactive Prompt Optimization strategy, which optimizes\nthe prompt with the multi-round interaction between human and GPT, and improve\nthe correctness of generated data greatly. Through extensive experiments, we\nfind our MLLM-DataEngine could boost the MLLM capability in a targeted and\nautomatic manner, with only a few human participation. The MLLM-DataEngine will\nbe released and we hope it could be a general solution for the following MLLMs\nbuilding.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:41:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Zhiyuan",""],["Ouyang","Linke",""],["Wang","Bin",""],["Huang","Siyuan",""],["Zhang","Pan",""],["Dong","Xiaoyi",""],["Wang","Jiaqi",""],["He","Conghui",""]]}
{"id":"2308.13567","submitter":"Paul Seidel","authors":"Daniel Pomerleano, Paul Seidel","title":"The quantum connection, Fourier-Laplace transform, and families of\n  A-infinity-categories","comments":"151 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consider monotone symplectic manifolds containing a smooth anticanonical\ndivisor. Contingent on conjectures which relate quantum cohomology to the\nsymplectic cohomology of the divisor complement (a la\nBorman-Sheridan-Varolgunes), we show that the quantum connection has unramified\nexponential type. The argument involves wrapped Fukaya categories, the\nregularity theorem of Petrov-Vaintrob-Vologodsky in noncommutative geometry,\nand a new categorical interpretation of the Fourier-Laplace transform of\nD-modules.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 01:44:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pomerleano","Daniel",""],["Seidel","Paul",""]]}
{"id":"2308.13568","submitter":"Debaditya Shome","authors":"Debaditya Shome, Pritam Sarkar, Ali Etemad","title":"Region-Disentangled Diffusion Model for High-Fidelity PPG-to-ECG\n  Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The high prevalence of cardiovascular diseases (CVDs) calls for accessible\nand cost-effective continuous cardiac monitoring tools. Despite\nElectrocardiography (ECG) being the gold standard, continuous monitoring\nremains a challenge, leading to the exploration of Photoplethysmography (PPG),\na promising but more basic alternative available in consumer wearables. This\nnotion has recently spurred interest in translating PPG to ECG signals. In this\nwork, we introduce Region-Disentangled Diffusion Model (RDDM), a novel\ndiffusion model designed to capture the complex temporal dynamics of ECG.\nTraditional Diffusion models like Denoising Diffusion Probabilistic Models\n(DDPM) face challenges in capturing such nuances due to the indiscriminate\nnoise addition process across the entire signal. Our proposed RDDM overcomes\nsuch limitations by incorporating a novel forward process that selectively adds\nnoise to specific regions of interest (ROI) such as QRS complex in ECG signals,\nand a reverse process that disentangles the denoising of ROI and non-ROI\nregions. Quantitative experiments demonstrate that RDDM can generate\nhigh-fidelity ECG from PPG in as few as 10 diffusion steps, making it highly\neffective and computationally efficient. Additionally, to rigorously validate\nthe usefulness of the generated ECG signals, we introduce CardioBench, a\ncomprehensive evaluation benchmark for a variety of cardiac-related tasks\nincluding heart rate and blood pressure estimation, stress classification, and\nthe detection of atrial fibrillation and diabetes. Our thorough experiments\nshow that RDDM achieves state-of-the-art performance on CardioBench. To the\nbest of our knowledge, RDDM is the first diffusion model for cross-modal\nsignal-to-signal translation in the bio-signal domain.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 02:44:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shome","Debaditya",""],["Sarkar","Pritam",""],["Etemad","Ali",""]]}
{"id":"2308.13569","submitter":"Xin Gao","authors":"Xin Gao, Cem Sazara","title":"Discovering Mental Health Research Topics with Topic Modeling","comments":"Workshop on Interpretable ML in Healthcare at International\n  Conference on Machine Learning (ICML)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Mental health significantly influences various aspects of our daily lives,\nand its importance has been increasingly recognized by the research community\nand the general public, particularly in the wake of the COVID-19 pandemic. This\nheightened interest is evident in the growing number of publications dedicated\nto mental health in the past decade. In this study, our goal is to identify\ngeneral trends in the field and pinpoint high-impact research topics by\nanalyzing a large dataset of mental health research papers. To accomplish this,\nwe collected abstracts from various databases and trained a customized\nSentence-BERT based embedding model leveraging the BERTopic framework. Our\ndataset comprises 96,676 research papers pertaining to mental health, enabling\nus to examine the relationships between different topics using their abstracts.\nTo evaluate the effectiveness of the model, we compared it against two other\nstate-of-the-art methods: Top2Vec model and LDA-BERT model. The model\ndemonstrated superior performance in metrics that measure topic diversity and\ncoherence. To enhance our analysis, we also generated word clouds to provide a\ncomprehensive overview of the machine learning models applied in mental health\nresearch, shedding light on commonly utilized techniques and emerging trends.\nFurthermore, we provide a GitHub link* to the dataset used in this paper,\nensuring its accessibility for further research endeavors.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:25:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Xin",""],["Sazara","Cem",""]]}
{"id":"2308.13570","submitter":"Dianhui Wang","authors":"Dianhui Wang and Matthew J. Felicetti","title":"Stochastic Configuration Machines for Industrial Artificial Intelligence","comments":"23 pages, 7 figures, 12 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time predictive modelling with desired accuracy is highly expected in\nindustrial artificial intelligence (IAI), where neural networks play a key\nrole. Neural networks in IAI require powerful, high-performance computing\ndevices to operate a large number of floating point data. Based on stochastic\nconfiguration networks (SCNs), this paper proposes a new randomized learner\nmodel, termed stochastic configuration machines (SCMs), to stress effective\nmodelling and data size saving that are useful and valuable for industrial\napplications. Compared to SCNs and random vector functional-link (RVFL) nets\nwith binarized implementation, the model storage of SCMs can be significantly\ncompressed while retaining favourable prediction performance. Besides the\narchitecture of the SCM learner model and its learning algorithm, as an\nimportant part of this contribution, we also provide a theoretical basis on the\nlearning capacity of SCMs by analysing the model's complexity. Experimental\nstudies are carried out over some benchmark datasets and three industrial\napplications. The results demonstrate that SCM has great potential for dealing\nwith industrial data analytics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:52:41 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 02:01:13 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Dianhui",""],["Felicetti","Matthew J.",""]]}
{"id":"2308.13571","submitter":"Zinovy Malkin","authors":"Zinovy Malkin","title":"On the most reliable value of the Galactic aberration constant","comments":null,"journal-ref":"Res. Notes AAS, 2023, Vol. 7(6), id. 133","doi":"10.3847/2515-5172/ace050","report-no":null,"categories":"astro-ph.IM astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Galactic aberration (GA) is a small effect in proper motions of celestial\nobjects with an amplitude of about 5 $\\mu$as/yr already noticeable in highly\naccurate astrometric observations such as VLBI and Gaia. However accurate\naccounting for this effect faces difficulty caused by the uncertainty in the GA\namplitude (GA constant). Its estimates derived from VLBI and Gaia data\nprocessing differ significantly, so it would be very desirable to involve\nanother independent method to solve the problem of inconsistency between these\ntwo methods. Such a method, that we consider in this paper, is using\ndetermination of the Galactic rotation parameters by methods of stellar\nastronomy. The result obtained in this study showed that the GA constant\nestimate obtained from stellar astronomy is closer to the estimate obtained\nfrom Gaia.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 05:57:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Malkin","Zinovy",""]]}
{"id":"2308.13572","submitter":"Veera Narayana Mannam Mr","authors":"M V Narayana, Devendra Jalihal, Shiva Nagendra","title":"EEATC: A Novel Calibration Approach for Low-cost Sensors","comments":"Accepted for IEEE sensors Journal","journal-ref":null,"doi":"10.1109/JSEN.2023.3304366","report-no":null,"categories":"eess.SP cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low-cost sensors (LCS) are affordable, compact, and often portable devices\ndesigned to measure various environmental parameters, including air quality.\nThese sensors are intended to provide accessible and cost-effective solutions\nfor monitoring pollution levels in different settings, such as indoor, outdoor\nand moving vehicles. However, the data produced by LCS is prone to various\nsources of error that can affect accuracy. Calibration is a well-known\nprocedure to improve the reliability of the data produced by LCS, and several\ndevelopments and efforts have been made to calibrate the LCS. This work\nproposes a novel Estimated Error Augmented Two-phase Calibration\n(\\textit{EEATC}) approach to calibrate the LCS in stationary and mobile\ndeployments. In contrast to the existing approaches, the \\textit{EEATC}\ncalibrates the LCS in two phases, where the error estimated in the first phase\ncalibration is augmented with the input to the second phase, which helps the\nsecond phase to learn the distributional features better to produce more\naccurate results. We show that the \\textit{EEATC} outperforms well-known\nsingle-phase calibration models such as linear regression models (single\nvariable linear regression (SLR) and multiple variable linear regression (MLR))\nand Random forest (RF) in stationary and mobile deployments. To test the\n\\textit{EEATC} in stationary deployments, we have used the Community Air Sensor\nNetwork (CAIRSENSE) data set approved by the United States Environmental\nProtection Agency (USEPA), and the mobile deployments are tested with the\nreal-time data obtained from SensurAir, an LCS device developed and deployed on\nmoving vehicle in Chennai, India.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 06:34:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Narayana","M V",""],["Jalihal","Devendra",""],["Nagendra","Shiva",""]]}
{"id":"2308.13573","submitter":"Ivan Heibi","authors":"Ivan Heibi and Silvio Peroni","title":"Retractions in Arts and Humanities: an Analysis of the Retraction\n  Notices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this work is to understand the retraction phenomenon in the arts\nand humanities domain through an analysis of the retraction notices: formal\ndocuments stating and describing the retraction of a particular publication.\nThe retractions and the corresponding notices are identified using the data\nprovided by Retraction Watch. Our methodology for the analysis combines a\nmetadata analysis and a content analysis (mainly performed using a topic\nmodeling process) of the retraction notices. Considering 343 cases of\nretraction, we found that many retraction notices are neither identifiable nor\nfindable. In addition, these were not always separated from the original\npapers, introducing ambiguity in understanding how these notices were perceived\nby the community (i.e., cited). Also, we noticed that there is no systematic\nway to write a retraction notice. Indeed, some retraction notices presented a\ncomplete discussion of the reasons for retraction, while others tended to be\nmore direct and succinct. We have also reported many notices having similar\ntext while addressing different retractions. We think a further study with a\nlarger collection should be done using the same methodology to confirm and\ninvestigate our findings further.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 08:20:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Heibi","Ivan",""],["Peroni","Silvio",""]]}
{"id":"2308.13574","submitter":"Dr. Goutam Manna","authors":"Arijit Panda, Goutam Manna, Saibal Ray, Maxim Khlopov and Md. Rabiul\n  Islam","title":"Gravitational collapse in generalized K-essence emergent Vaidya\n  spacetime via $f(\\bar{R},\\bar{T})$ gravity","comments":"15 pages, 8 figures, 2 tables, Suggestions are encouraged","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study focuses on investigating the collapse possibilities of the\ngeneralized emergent Vaidya spacetime within the framework of $f(\\bar{R},\n\\bar{T})$ gravity, specifically in the setting of K-essence theory. The\nDirac-Born-Infeld type non-standard Lagrangian is used in this work to\ndetermine the emergent metric $\\bar{G}_{\\mu\\nu}$, which is not conformally\nequal to the usual gravitational metric. Here, we employ the function\n$f(\\bar{R}, \\bar{T})$ to represent the additive character of the emergent Ricci\nscalar ($\\bar{R}$) and trace of the emergent energy-momentum tensor\n($\\bar{T}$). In our analysis, it can be shown that certain selections of\n$f(\\bar{R}, \\bar{T})$ can lead to the presence of a naked singularity resulting\nfrom gravitational collapse. Additionally, alternative choices of $f(\\bar{R},\n\\bar{T})$ were found to yield an accelerating universe primarily governed by\ndark energy. In addition, the investigation revealed the existence of both\npositive and negative masses, which can be understood as a gravitational\ndipole. It is also found that the K-essence theory has the potential to serve\nas both a dark energy framework and a simple gravitational theory at the same\ntime, allowing for the investigation of a wide range of cosmological phenomena.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:33:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Panda","Arijit",""],["Manna","Goutam",""],["Ray","Saibal",""],["Khlopov","Maxim",""],["Islam","Md. Rabiul",""]]}
{"id":"2308.13575","submitter":"Ting Jiang","authors":"Ting Jiang, Zheng Gao, Yizhao Chen, Zihe Hu, Ming Tang","title":"FrFT based estimation of linear and nonlinear impairments using Vision\n  Transformer","comments":"15 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AI physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To comprehensively assess optical fiber communication system conditions, it\nis essential to implement joint estimation of the following four critical\nimpairments: nonlinear signal-to-noise ratio (SNRNL), optical signal-to-noise\nratio (OSNR), chromatic dispersion (CD) and differential group delay (DGD).\nHowever, current studies only achieve identifying a limited number of\nimpairments within a narrow range, due to limitations in network capabilities\nand lack of unified representation of impairments. To address these challenges,\nwe adopt time-frequency signal processing based on fractional Fourier transform\n(FrFT) to achieve the unified representation of impairments, while employing a\nTransformer based neural networks (NN) to break through network performance\nlimitations. To verify the effectiveness of the proposed estimation method, the\nnumerical simulation is carried on a 5-channel\npolarization-division-multiplexed quadrature phase shift keying (PDM-QPSK) long\nhaul optical transmission system with the symbol rate of 50 GBaud per channel,\nthe mean absolute error (MAE) for SNRNL, OSNR, CD, and DGD estimation is 0.091\ndB, 0.058 dB, 117 ps/nm, and 0.38 ps, and the monitoring window ranges from\n0~20 dB, 10~30 dB, 0~51000 ps/nm, and 0~100 ps, respectively. Our proposed\nmethod achieves accurate estimation of linear and nonlinear impairments over a\nbroad range, representing a significant advancement in the field of optical\nperformance monitoring (OPM).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 09:59:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiang","Ting",""],["Gao","Zheng",""],["Chen","Yizhao",""],["Hu","Zihe",""],["Tang","Ming",""]]}
{"id":"2308.13576","submitter":"Shrutendra Harsola","authors":"Sourav Prosad and Viswa Datha Polavarapu and Shrutendra Harsola","title":"An Ensemble Approach to Personalized Real Time Predictive Writing for\n  Experts","comments":"ACM SIGKDD Workshop on Machine Learning in Finance, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Completing a sentence, phrase or word after typing few words / characters is\nvery helpful for Intuit financial experts, while taking notes or having a live\nchat with users, since they need to write complex financial concepts more\nefficiently and accurately many times in a day. In this paper, we tie together\ndifferent approaches like large language models, traditional Markov Models and\nchar level models to create an end-to-end system to provide personalised\nsentence/word auto-complete suggestions to experts, under strict latency\nconstraints. Proposed system can auto-complete sentences, phrases or words\nwhile writing with personalisation and can be trained with very less data and\nresources with good efficiency. Our proposed system is not only efficient and\npersonalized but also robust as it leverages multiple machine learning\ntechniques along with transfer learning approach to fine tune large language\nmodel with Intuit specific data. This ensures that even in cases of rare or\nunusual phrases, the system can provide relevant auto-complete suggestions in\nnear real time. Survey has showed that this system saves expert note-taking\ntime and boosts expert confidence in their communication with teammates and\nclients. Since enabling this predictive writing feature for QBLive experts,\nmore than a million keystrokes have been saved based on these suggestions. We\nhave done comparative study for our ensemble choice. Moreover this feature can\nbe integrated with any product which has writing facility within a very short\nperiod of time.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 12:45:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Prosad","Sourav",""],["Polavarapu","Viswa Datha",""],["Harsola","Shrutendra",""]]}
{"id":"2308.13577","submitter":"Phil Sidney Ostheimer","authors":"Phil Ostheimer, Mayank Nagda, Marius Kloft, Sophie Fellenz","title":"Text Style Transfer Evaluation Using Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text Style Transfer (TST) is challenging to evaluate because the quality of\nthe generated text manifests itself in multiple aspects, each of which is hard\nto measure individually: style transfer accuracy, content preservation, and\noverall fluency of the text. Human evaluation is the gold standard in TST\nevaluation; however, it is expensive, and the results are difficult to\nreproduce. Numerous automated metrics are employed to assess performance in\nthese aspects, serving as substitutes for human evaluation. However, the\ncorrelation between many of these automated metrics and human evaluations\nremains unclear, raising doubts about their effectiveness as reliable\nbenchmarks. Recent advancements in Large Language Models (LLMs) have\ndemonstrated their ability to not only match but also surpass the average human\nperformance across a wide range of unseen tasks. This suggests that LLMs have\nthe potential to serve as a viable alternative to human evaluation and other\nautomated metrics. We assess the performance of different LLMs on TST\nevaluation by employing multiple input prompts and comparing their results. Our\nfindings indicate that (even zero-shot) prompting correlates strongly with\nhuman evaluation and often surpasses the performance of (other) automated\nmetrics. Additionally, we propose the ensembling of prompts and show it\nincreases the robustness of TST evaluation.This work contributes to the ongoing\nefforts in evaluating LLMs on diverse tasks, which includes a discussion of\nfailure cases and limitations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:07:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ostheimer","Phil",""],["Nagda","Mayank",""],["Kloft","Marius",""],["Fellenz","Sophie",""]]}
{"id":"2308.13578","submitter":"Farhad Arpanaei","authors":"Farhad Arpanaei, Mahdi Ranjbar Zefreh, Jos\\'e Alberto Hern\\'andez,\n  Behnam Shariati, Johannes Fischer, Jos\\'e Manuel Rivas-Moscoso, Filipe\n  Jim\\'enez, Juan Pedro Fern\\'andez-Palacios, David Larrabeiti","title":"Launch Power Optimization for Dynamic Elastic Optical Networks over C+L\n  Bands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose an algorithm for calculating the optimum launch power over the\nentire C+L bands by maximizing the cumulative link GSNR of a channel plan built\nupon multiple modulation formats, with application to dynamic EONs. Exact\nlast-fit spectrum assignment proves to outperform exact first-fit in terms of\naverage GSNR at arrival time.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:23:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Arpanaei","Farhad",""],["Zefreh","Mahdi Ranjbar",""],["Hern\u00e1ndez","Jos\u00e9 Alberto",""],["Shariati","Behnam",""],["Fischer","Johannes",""],["Rivas-Moscoso","Jos\u00e9 Manuel",""],["Jim\u00e9nez","Filipe",""],["Fern\u00e1ndez-Palacios","Juan Pedro",""],["Larrabeiti","David",""]]}
{"id":"2308.13579","submitter":"Farhad Arpanaei","authors":"Farhad Arpanaei, Jos\\'e Manuel Rivas-Moscoso, Mahdi Ranjbar Zefreh,\n  Jos\\'e Alberto Hern\\'andez, Juan Pedro Fern\\'andez-Palacios, David Larrabeiti","title":"A Comparative Study on Routing Selection Algorithms for Dynamic Planning\n  of EONs over C+L Bands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of three routing selection algorithms is compared in terms of\nbandwidth blocking probability, quality of transmission, and run time in EONs\nover the C+L band. The min-max frequency algorithm shows the best performance\non all metrics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 13:30:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Arpanaei","Farhad",""],["Rivas-Moscoso","Jos\u00e9 Manuel",""],["Zefreh","Mahdi Ranjbar",""],["Hern\u00e1ndez","Jos\u00e9 Alberto",""],["Fern\u00e1ndez-Palacios","Juan Pedro",""],["Larrabeiti","David",""]]}
{"id":"2308.13580","submitter":"K Aditya","authors":"K Aditya","title":"HI 21 cm observations and dynamical models of superthin galaxies","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The primary objective of this thesis is to identify the key dynamical\nmechanisms responsible for the superthin stellar discs. We use HI 21cm\nradio-synthesis observations and stellar photometry to construct detailed\ndynamical models of a sample of superthin galaxies to determine the primary\nmechanism responsible for the existence of superthin stellar discs in these\ngalaxies. Our study is based on a sample of superthin galaxies with $\\rm 10<\na/b < 16$ for which H1 21cm radio-synthesis data were already available in the\nliterature. In addition, we had the two thinnest galaxies in our sample with\n$\\rm a/b \\sim 21$, for which we carried out Giant Meterwave Radio Telescope\n(GMRT) 21cm radio-synthesis observations. To identify the physical mechanism\nprimarily responsible for the superthin vertical structure, we carry out a\nPrincipal Component Analysis of the following dynamical parameters: 1) Dark\nmatter dominance at inner galactocentric radii given by\n$V_{\\rm{rot}}/{(R_{c}/R_{d})}$, 2) the ratio of the vertical-to-radial stellar\nvelocity dispersion $(\\sigma_{z,s}/\\sigma_{R,s})$, 3) Disc dynamical stability\nagainst local axisymmetric perturbations $Q_{RW}$, 4) Specific angular momentum\nof the disc $(j_{*})$, along with $a/b$ for all superthins and the extremely\nthin galaxies. We note that the first two principal components explain $\\sim$\n80$\\%$ of the variation in the data, and the major contributions are from\n$a/b$, $Q_{RW}$ and $V_{\\rm{rot}}/{(R_{c}/R_{d})}$. This possibly indicates\nthat high values of the disc dynamical stability and dark matter dominance at\ninner galactocentric radii are fundamentally responsible for the superthin\nstellar discs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:42:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aditya","K",""]]}
{"id":"2308.13581","submitter":"Mehdi Miri","authors":"Mehdi Miri","title":"Quantum model of hydrogen-like atoms in hilbert space by introducing the\n  creation and annihilation operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purely algebraic technique associated with the creation and annihilation\noperators to resolve the radial equation of Hydrogen-like atoms (HLA) for\ngenerating the bound energy spectrum and the corresponding wave functions is\nsuitable for many calculations in quantum physics. However, the analytical\napproach with series is extensively used based on wave mechanics theory in most\nof quantum textbooks. Indeed, much More complete than the old solution of\nSchr\\\"odinger's time-independent differential equation (TISE), one can simply\nearn all quantum information of a system by using the operational method. In\naddition to earlier two models, including the quantum harmonic oscillator and\nthe total angular momentum, it can undoubtedly be a third fundamental model to\nsolve Schr\\\"odinger's eigenvalue equation of the HLA systems in Hilbert space\nsimilar to the harmonic oscillator. We will illustrate how systematically\nmaking an appropriate groundwork to discover the coherent states can lead to\nproviding the energy quantization and normalized radial wave functions attached\nto the matrix representation without additional assumptions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 14:42:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Miri","Mehdi",""]]}
{"id":"2308.13582","submitter":"Masateru Tsunoda","authors":"Yuta Yamasaki, Nikolay Fedorov, Masateru Tsunoda, Akito Monden, Amjed\n  Tahir, Kwabena Ebo Bennin, Koji Toda, Keitaro Nakasai","title":"Software Defect Prediction by Online Learning Considering Defect\n  Overlooking","comments":"2 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Building defect prediction models based on online learning can enhance\nprediction accuracy. It continuously rebuilds a new prediction model when\nadding a new data point. However, predicting a module as \"non-defective\" (i.e.,\nnegative prediction) can result in fewer test cases for such modules.\nTherefore, defects can be overlooked during testing, even when the module is\ndefective. The erroneous test results are used as learning data by online\nlearning, which could negatively affect prediction accuracy. In our experiment,\nwe demonstrate this negative influence on prediction accuracy.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:02:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yamasaki","Yuta",""],["Fedorov","Nikolay",""],["Tsunoda","Masateru",""],["Monden","Akito",""],["Tahir","Amjed",""],["Bennin","Kwabena Ebo",""],["Toda","Koji",""],["Nakasai","Keitaro",""]]}
{"id":"2308.13583","submitter":"Roberto S. Costas-Santos","authors":"Howard S. Cohl and Roberto S. Costas-Santos","title":"Orthogonality of the big $-1$ Jacobi polynomials for non-standard\n  parameters","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The big $-1$ Jacobi polynomials $(Q_n^{(0)}(x;\\alpha,\\beta,c))_n$ have been\nclassically defined for $\\alpha,\\beta\\in(-1,\\infty)$, $c\\in(-1,1)$. We extend\nthis family so that wider sets of parameters are allowed, i.e., they are\nnon-standard. Assuming initial conditions $Q^{(0)}_0(x)=1$,\n$Q^{(0)}_{-1}(x)=0$, we consider the big $-1$ Jacobi polynomials as monic\northogonal polynomials which therefore satisfy the following three-term\nrecurrence relation \\[ xQ^{(0)}_n(x)=Q^{(0)}_{n+1}(x)+b_{n} Q^{(0)}_n(x)+ u_{n}\nQ^{(0)}_{n-1}(x), \\quad n=0, 1, 2,\\ldots. \\] For standard parameters, the\ncoefficients $u_n>0$ for all $n$. We discuss the situation where Favard's\ntheorem cannot be directly applied for some positive integer $n$ such that\n$u_n=0$. We express the big $-1$ Jacobi polynomials for non-standard parameters\nas a product of two polynomials. Using this factorization, we obtain a bilinear\nform with respect to which these polynomials are orthogonal.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:17:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cohl","Howard S.",""],["Costas-Santos","Roberto S.",""]]}
{"id":"2308.13584","submitter":"Axel Donath","authors":"Axel Donath, R\\'egis Terrier, Quentin Remy, Atreyee Sinha, Cosimo\n  Nigro, Fabio Pintore, Bruno Kh\\'elifi, Laura Olivera-Nieto, Jose Enrique\n  Ruiz, Kai Br\\\"ugge, Maximilian Linhoff, Jose Luis Contreras, Fabio Acero,\n  Arnau Aguasca-Cabot, David Berge, Pooja Bhattacharjee, Johannes Buchner,\n  Catherine Boisson, David Carreto Fidalgo, Andrew Chen, Mathieu de Bony de\n  Lavergne, Jos\\'e Vin\\'icius de Miranda Cardoso, Christoph Deil, Matthias\n  F\\\"u{\\ss}ling, Stefan Funk, Luca Giunti, Jim Hinton, L\\'ea Jouvin, Johannes\n  King, Julien Lefaucheur, Marianne Lemoine-Goumard, Jean-Philippe Lenain,\n  Rub\\'en L\\'opez-Coto, Lars Mohrmann, Daniel Morcuende, Sebastian Panny,\n  Maxime Regeard, Lab Saha, Hubert Siejkowski, Aneta Siemiginowska, Brigitta M.\n  Sip\\H{o}cz, Tim Unbehaun, Christopher van Eldik, Thomas Vuillaume, and\n  Roberta Zanin","title":"Gammapy: A Python package for gamma-ray astronomy","comments":"26 pages, 16 figures","journal-ref":null,"doi":"10.1051/0004-6361/202346488","report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we present Gammapy, an open-source Python package for the\nanalysis of astronomical $\\gamma$-ray data, and illustrate the functionalities\nof its first long-term-support release, version 1.0. Built on the modern Python\nscientific ecosystem, Gammapy provides a uniform platform for reducing and\nmodeling data from different $\\gamma$-ray instruments for many analysis\nscenarios. Gammapy complies with several well-established data conventions in\nhigh-energy astrophysics, providing serialized data products that are\ninteroperable with other software packages. Starting from event lists and\ninstrument response functions, Gammapy provides functionalities to reduce these\ndata by binning them in energy and sky coordinates. Several techniques for\nbackground estimation are implemented in the package to handle the residual\nhadronic background affecting $\\gamma$-ray instruments. After the data are\nbinned, the flux and morphology of one or more $\\gamma$-ray sources can be\nestimated using Poisson maximum likelihood fitting and assuming a variety of\nspectral, temporal, and spatial models. Estimation of flux points, likelihood\nprofiles, and light curves is also supported. After describing the structure of\nthe package, we show, using publicly available $\\gamma$-ray data, the\ncapabilities of Gammapy in multiple traditional and novel $\\gamma$-ray analysis\nscenarios, such as spectral and spectro-morphological modeling and estimations\nof a spectral energy distribution and a light curve. Its flexibility and power\nare displayed in a final multi-instrument example, where datasets from\ndifferent instruments, at different stages of data reduction, are\nsimultaneously fitted with an astrophysical flux model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:25:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Donath","Axel",""],["Terrier","R\u00e9gis",""],["Remy","Quentin",""],["Sinha","Atreyee",""],["Nigro","Cosimo",""],["Pintore","Fabio",""],["Kh\u00e9lifi","Bruno",""],["Olivera-Nieto","Laura",""],["Ruiz","Jose Enrique",""],["Br\u00fcgge","Kai",""],["Linhoff","Maximilian",""],["Contreras","Jose Luis",""],["Acero","Fabio",""],["Aguasca-Cabot","Arnau",""],["Berge","David",""],["Bhattacharjee","Pooja",""],["Buchner","Johannes",""],["Boisson","Catherine",""],["Fidalgo","David Carreto",""],["Chen","Andrew",""],["de Lavergne","Mathieu de Bony",""],["Cardoso","Jos\u00e9 Vin\u00edcius de Miranda",""],["Deil","Christoph",""],["F\u00fc\u00dfling","Matthias",""],["Funk","Stefan",""],["Giunti","Luca",""],["Hinton","Jim",""],["Jouvin","L\u00e9a",""],["King","Johannes",""],["Lefaucheur","Julien",""],["Lemoine-Goumard","Marianne",""],["Lenain","Jean-Philippe",""],["L\u00f3pez-Coto","Rub\u00e9n",""],["Mohrmann","Lars",""],["Morcuende","Daniel",""],["Panny","Sebastian",""],["Regeard","Maxime",""],["Saha","Lab",""],["Siejkowski","Hubert",""],["Siemiginowska","Aneta",""],["Sip\u0151cz","Brigitta M.",""],["Unbehaun","Tim",""],["van Eldik","Christopher",""],["Vuillaume","Thomas",""],["Zanin","Roberta",""]]}
{"id":"2308.13585","submitter":"Ahmed Missaoui","authors":"Ahmed Missaoui, Cemalettin Ozturk, Barry O'Sullivan, Michele Garraffa","title":"Energy Efficient Manufacturing Scheduling: A Systematic Literature\n  Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The social context in relation to energy policies, energy supply, and\nsustainability concerns as well as advances in more energy-efficient\ntechnologies is driving a need for a change in the manufacturing sector. The\nmain purpose of this work is to provide a research framework for\nenergy-efficient scheduling (EES) which is a very active research area with\nmore than 500 papers published in the last 10 years. The reason for this\ninterest is mostly due to the economic and environmental impact of considering\nenergy in production scheduling. In this paper, we present a systematic\nliterature review of recent papers in this area, provide a classification of\nthe problems studied, and present an overview of the main aspects and\nmethodologies considered as well as open research challenges.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:07:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Missaoui","Ahmed",""],["Ozturk","Cemalettin",""],["O'Sullivan","Barry",""],["Garraffa","Michele",""]]}
{"id":"2308.13586","submitter":"Kamran Ullah Mr","authors":"Kamran Ullah, Muhammad Tahir Naseem, Ozgur E. Mustecaplioglu","title":"Macroscopic distant magnon modes entanglement via a squeezed drive","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.atm-clus physics.atom-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The generation of robust entanglement in quantum system arrays is a crucial\naspect of realizing efficient quantum information processing. Recently, the\nfield of quantum magnonics has garnered significant attention as a promising\nplatform for advancing in this direction. In our proposed scheme, we utilize a\none-dimensional array of coupled cavities, with each cavity housing a single\nyttrium iron garnet (YIG) sphere coupled to the cavity mode through magnetic\ndipole interaction. To induce entanglement between YIGs, we employ a squeezed\nvacuum drive, providing the necessary nonlinearity. Our results demonstrate the\nsuccessful generation of bipartite and tripartite entanglement between distant\nmagnon modes across the entire array, all achieved through a single control\ndrive. Furthermore, the steady-state entanglement between magnon modes is\nrobust against magnon dissipation rates and environment temperature. Our\nresults may find applications of cavity-magnon arrays in quantum information\nprocessing and quantum communication systems.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:14:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ullah","Kamran",""],["Naseem","Muhammad Tahir",""],["Mustecaplioglu","Ozgur E.",""]]}
{"id":"2308.13587","submitter":"Kashif Ishaq","authors":"Kashif Ishaq, Sidra Fareed","title":"Mitigation Techniques for Cyber Attacks: A Systematic Mapping Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the wake of the arrival of digital media, the Internet, the web, and\nonline social media, a flood of new cyber security research questions have\nemerged. There is a lot of money being lost around the world because of\ncyber-attacks. As a result, cyber security has emerged as one of the world's\nmost complex and pressing issues. Cyber security experts from both industry and\nacademia institutions are now analyzing current cyber-attacks occurring around\nthe world and developing various strategies to defend systems from possible\ncyber-threats and attacks. This paper examines recent cyber security attacks as\nwell as the financial losses incurred as a result of the growing number of\ncyber-attacks. Our findings indicate that the majority of the research chosen\nfor this study focused solely on a small number of widespread security flaws,\nsuch as malware, phishing, and denial-of-service attacks. A total of over 50\nmajor studies that have been published in reputable academic journals and\nconferences have been chosen for additional examination. A taxonomy of\ncyber-attacks elements that is based on the context of use in various\nenvironments has also been suggested, in addition to a review of the most\nrecent studies on countermeasures for cyber-attacks being the state of the art.\nLastly, the research gaps in terms of open issues have been described in order\nto offer potential future directions for the researchers working in the field\nof cyber security.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:37:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ishaq","Kashif",""],["Fareed","Sidra",""]]}
{"id":"2308.13588","submitter":"Fan Lei","authors":"Fan Lei, Yuxin Ma, Stewart Fotheringham, Elizabeth Mack, Ziqi Li,\n  Mehak Sachdeva, Sarah Bardin and Ross Maciejewski","title":"GeoExplainer: A Visual Analytics Framework for Spatial Modeling\n  Contextualization and Report Generation","comments":"12 pages, 7 figures, accepted by IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Geographic regression models of various descriptions are often applied to\nidentify patterns and anomalies in the determinants of spatially distributed\nobservations. These types of analyses focus on answering why questions about\nunderlying spatial phenomena, e.g., why is crime higher in this locale, why do\nchildren in one school district outperform those in another, etc.? Answers to\nthese questions require explanations of the model structure, the choice of\nparameters, and contextualization of the findings with respect to their\ngeographic context. This is particularly true for local forms of regression\nmodels which are focused on the role of locational context in determining human\nbehavior. In this paper, we present GeoExplainer, a visual analytics framework\ndesigned to support analysts in creating explanative documentation that\nsummarizes and contextualizes their spatial analyses. As analysts create their\nspatial models, our framework flags potential issues with model parameter\nselections, utilizes template-based text generation to summarize model outputs,\nand links with external knowledge repositories to provide annotations that help\nto explain the model results. As analysts explore the model results, all\nvisualizations and annotations can be captured in an interactive report\ngeneration widget. We demonstrate our framework using a case study modeling the\ndeterminants of voting in the 2016 US Presidential Election.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:55:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lei","Fan",""],["Ma","Yuxin",""],["Fotheringham","Stewart",""],["Mack","Elizabeth",""],["Li","Ziqi",""],["Sachdeva","Mehak",""],["Bardin","Sarah",""],["Maciejewski","Ross",""]]}
{"id":"2308.13589","submitter":"Kashif Ishaq","authors":"Kashif Ishaq, Hafiz Ahsan Javed","title":"Implementing Snort Intrusion Prevention System (IPS) for Network\n  Forensic Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The security trade confidentiality, integrity and availability are the main\npillar of the information systems as every organization emphasize of the\nsecurity. From last few decades, digital data is the main asset for every\ndigital or non-digital organization. The proliferation of easily accessible\nattack software on the internet has lowered the barrier for individuals without\nhacking skills to engage in malicious activities. An Industrial organization\noperates a server that (Confluence) serves as a learning platform for newly\nhired employees or Management training officers, thereby making it vulnerable\nto potential attacks using readily available internet-based software. To\nmitigate this risk, it is essential to implement a security system capable of\ndetecting and preventing attacks, as well as conducting investigations. This\nresearch project aims to develop a comprehensive security system that can\ndetect attack attempts, initiate preventive measures, and carry out\ninvestigations by analyzing attack logs. The study adopted a survey methodology\nand spanned a period of four months, from March 1, 2023, to June 31, 2023. The\noutcome of this research is a robust security system that effectively\nidentifies attack attempts, blocks the attacker's IP address, and employs\nnetwork forensic techniques for investigation purposes. The findings indicate\nthat deploying Snort in IPS mode on PfSense enables the detection of attacks\ntargeting e-learning servers, triggering automatic preventive measures such as\nIP address blocking. The alerts generated by Snort facilitate investigative\nactions through network forensics, allowing for accurate reporting on the\ndetrimental effects of the attacks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 16:59:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ishaq","Kashif",""],["Javed","Hafiz Ahsan",""]]}
{"id":"2308.13590","submitter":"Maha Driss","authors":"Maha Driss","title":"LSTM-based QoE Evaluation for Web Microservices' Reputation Scoring","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sentiment analysis is the task of mining the authors' opinions about specific\nentities. It allows organizations to monitor different services in real time\nand act accordingly. Reputation is what is generally said or believed about\npeople or things. Informally, reputation combines the measure of reliability\nderived from feedback, reviews, and ratings gathered from users, which reflect\ntheir quality of experience (QoE) and can either increase or harm the\nreputation of the provided services. In this study, we propose to perform\nsentiment analysis on web microservices reviews to exploit the provided\ninformation to assess and score the microservices' reputation. Our proposed\napproach uses the Long Short-Term Memory (LSTM) model to perform sentiment\nanalysis and the Net Brand Reputation (NBR) algorithm to assess reputation\nscores for microservices. This approach is tested on a set of more than 10,000\nreviews related to 15 Amazon Web microservices, and the experimental results\nhave shown that our approach is more accurate than existing approaches, with an\naccuracy and precision of 93% obtained after applying an oversampling strategy\nand a resulting reputation score of the considered microservices community of\n89%.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:23:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Driss","Maha",""]]}
{"id":"2308.13591","submitter":"Eduard Fosch-Villaronga","authors":"Eduard Fosch-Villaronga and Gianclaudio Malgieri","title":"Queering the ethics of AI","comments":"28 pages, book chapter in Fosch-Villaronga, E. & Malgieri, G. (2024).\n  Queering the ethics of AI. In: Gunkel, D. J. (2024) Handbook on the Ethics of\n  Artificial Intelligence. Edward Elgar Publishing, forthcoming","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This book chapter delves into the pressing need to \"queer\" the ethics of AI\nto challenge and re-evaluate the normative suppositions and values that\nunderlie AI systems. The chapter emphasizes the ethical concerns surrounding\nthe potential for AI to perpetuate discrimination, including binarism, and\namplify existing inequalities due to the lack of representative datasets and\nthe affordances and constraints depending on technology readiness. The chapter\nargues that a critical examination of the neoliberal conception of equality\nthat often underpins non-discrimination law is necessary and cannot stress more\nthe need to create alternative interdisciplinary approaches that consider the\ncomplex and intersecting factors that shape individuals' experiences of\ndiscrimination. By exploring such approaches centering on intersectionality and\nvulnerability-informed design, the chapter contends that designers and\ndevelopers can create more ethical AI systems that are inclusive, equitable,\nand responsive to the needs and experiences of all individuals and communities,\nparticularly those who are most vulnerable to discrimination and harm.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:26:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fosch-Villaronga","Eduard",""],["Malgieri","Gianclaudio",""]]}
{"id":"2308.13592","submitter":"Yassine Himeur","authors":"Yassine Habchi, Yassine Himeur, Hamza Kheddar, Abdelkrim Boukabou,\n  Shadi Atalla, Ammar Chouchane, Abdelmalik Ouamane, and Wathiq Mansoor","title":"AI in Thyroid Cancer Diagnosis: Techniques, Trends, and Future\n  Directions","comments":"30 pages, 16 figures and 10 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CY cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There has been a growing interest in creating intelligent diagnostic systems\nto assist medical professionals in analyzing and processing big data for the\ntreatment of incurable diseases. One of the key challenges in this field is\ndetecting thyroid cancer, where advancements have been made using machine\nlearning (ML) and big data analytics to evaluate thyroid cancer prognosis and\ndetermine a patient's risk of malignancy. This review paper summarizes a large\ncollection of articles related to artificial intelligence (AI)-based techniques\nused in the diagnosis of thyroid cancer. Accordingly, a new classification was\nintroduced to classify these techniques based on the AI algorithms used, the\npurpose of the framework, and the computing platforms used. Additionally, this\nstudy compares existing thyroid cancer datasets based on their features. The\nfocus of this study is on how AI-based tools can support the diagnosis and\ntreatment of thyroid cancer, through supervised, unsupervised, or hybrid\ntechniques. It also highlights the progress made and the unresolved challenges\nin this field. Finally, the future trends and areas of focus in this field are\ndiscussed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:27:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Habchi","Yassine",""],["Himeur","Yassine",""],["Kheddar","Hamza",""],["Boukabou","Abdelkrim",""],["Atalla","Shadi",""],["Chouchane","Ammar",""],["Ouamane","Abdelmalik",""],["Mansoor","Wathiq",""]]}
{"id":"2308.13593","submitter":"William DeRocco","authors":"William DeRocco, Nolan Smyth, Stefano Profumo","title":"Constraints on sub-terrestrial free-floating planets from Subaru\n  microlensing observations","comments":"10 pages, 7 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.GA hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The abundance of protoplanetary bodies ejected from their parent star system\nis presently poorly-constrained. With only two existing optical observations of\ninterstellar objects in the $10^{8} - 10^{10}$ kg mass range and a small number\nof robust microlensing observations of free-floating planets (FFPs) in the\n$10^{24} - 10^{25}$ kg mass range, there is a large range of masses for which\nthere are no existing measurements of the unbound population. The three primary\nmicrolensing surveys currently searching for FFPs operate at a cadence greater\nthan 15 minutes, which limits their ability to observe events associated with\nbodies with a mass much below an Earth mass. We demonstrate that existing\nhigh-cadence observations of M31 with the Subaru Hyper Suprime-Cam place the\nbest direct constraints at present on the abundance of unbound objects at\nsub-terrestrial masses, with peak sensitivity at $10^{-4}~M_\\oplus$ for Milky\nWay lenses and $10^{-1}~M_\\oplus$ for lenses in M31. For a fiducial\n$\\frac{dn}{dM}\\propto M^{-2}$ mass distribution, we find that the abundance of\nunbound objects is constrained to $n_\\text{unbound} < 4.4 \\times 10^{7}\n~\\rm{pc}^{-3}$ for masses within 1 dex of $10^{-4}~M_\\oplus$. Additionally, we\ncompute limits on an artificial ``monochromatic'' distribution of unbound\nobjects and compare to existing literature, demonstrating that the assumed\nspatial distribution of lenses has very significant consequences for the\nsensitivity of microlensing surveys. Our limits place robust constraints on the\nunbound population in the sub-terrestrial mass range and motivate new\nobservational strategies for microlensing surveys.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["DeRocco","William",""],["Smyth","Nolan",""],["Profumo","Stefano",""]]}
{"id":"2308.13594","submitter":"\\'Alvaro Pastor Guti\\'errez","authors":"Florian Goertz and \\'Alvaro Pastor-Guti\\'errez","title":"New Phases of the Standard Model Higgs Potential","comments":"7 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present evidence for new phases of the Standard Model Higgs potential. We\nstudy the Standard Model physical trajectory accounting for the Higgs curvature\nmass with the mass-dependent functional renormalisation group. New unstable and\nnon-trivially stable phases are found at energies above the Planck scale and\nbelow the Abelian Landau pole. While the first aggravates the well-known\nmetastable phase and threatens the viability of the Standard Model extrapolated\nto arbitrary scales, the latter can provide a well-defined ultraviolet\ncompletion. We investigate the phase diagram as a function of the top quark\npole mass and study the effect of new physics through a scalar singlet portal\ncoupling. The new non-trivial phase appears below the Planck scale in scenarios\nseeking stable trajectories. These findings have a significant impact on\nexisting model building.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Goertz","Florian",""],["Pastor-Guti\u00e9rrez","\u00c1lvaro",""]]}
{"id":"2308.13595","submitter":"Yvette Cendes","authors":"Yvette Cendes, Edo Berger, Kate D. Alexander, Ryan Chornock, Raffaella\n  Margutti, Brian Metzger, Mark H. Wieringa, Michael F. Bietenholz, Aprajita\n  Hajela, Tanmoy Laskar, Michael C. Stroh, Giacomo Terreran","title":"Ubiquitous Late Radio Emission from Tidal Disruption Events","comments":"30 pages. Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present radio observations of 23 optically-discovered tidal disruption\nevents (TDEs) on timescales of about 500-3200 days post-discovery. We detect 9\nnew TDEs that did not have detectable radio emission at earlier times,\nindicating a late-time brightening after several hundred (and up to 2300 days);\nan additional 6 TDEs exhibit radio emission whose origin is ambiguous or may be\nattributed to the host galaxy or an AGN. We also report new rising components\nin two TDEs previously detected in the radio (iPTF16fnl and AT2019dsg) at ~1000\ndays. While the radio emission in some of the detected TDEs peaked on a\ntimescale of ~2-4 years, more than half of the sample still shows rising\nemission. The range of luminosities for the sample is 10^37-10^39 erg/s, about\ntwo orders of magnitude below the radio luminosity of the relativistic TDE\nSw1644+57. Our data set indicates that about 40% of all optical TDEs are\ndetected in the radio hundreds to thousands of days after discovery, and that\nthis is probably more common than early radio emission peaking at ~100 days.\nUsing an equipartition analysis, we find evidence for a delayed launch of the\nradio-emitting outflows, with delay timescales of ~500-2000 days, inferred\nvelocities of ~0.02-0.15c, and kinetic energies of ~10^47-10^49 erg. We rule\nout off-axis relativistic jets as a viable explanation for this population, and\nconclude delayed outflows are a more likely explanation, such as from delayed\ndisk formation. Finally, we find comparable densities in the circumnuclear\nenvironments of these TDEs as for those with early radio emission, and find the\nTDEs still rising in luminosity are consistent with free expansion. We conclude\nthat late radio emission marks a fairly ubiquitous but heretofore overlooked\nphase of TDE evolution.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cendes","Yvette",""],["Berger","Edo",""],["Alexander","Kate D.",""],["Chornock","Ryan",""],["Margutti","Raffaella",""],["Metzger","Brian",""],["Wieringa","Mark H.",""],["Bietenholz","Michael F.",""],["Hajela","Aprajita",""],["Laskar","Tanmoy",""],["Stroh","Michael C.",""],["Terreran","Giacomo",""]]}
{"id":"2308.13596","submitter":"Jo\\~ao Barata","authors":"Jo\\~ao Barata, Wenjie Gong, Raju Venugopalan","title":"Realtime dynamics of hyperon spin correlations from string fragmentation\n  in a deformed four-flavor Schwinger model","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-polarizing weak decays of $\\Lambda$-hyperons provide unique insight into\nthe role of entanglement in the fragmentation of QCD strings through\nmeasurements of the spin correlations of $\\Lambda{\\bar \\Lambda}$-pairs produced\nin collider experiments. The simplest quantum field theory representing the\nunderlying parton dynamics is the four-flavor massive Schwinger model plus an\neffective spin-flip term, where the flavors are mapped to light (up/down) and\nheavy (strange) quarks and their spins. This construction provides a novel way\nto explore hyperon spin-correlations in 1+1-dimensions. We investigate the\nevolution of these correlations for different string configurations that are\nsensitive to the rich structure of the model Hamiltonian.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barata","Jo\u00e3o",""],["Gong","Wenjie",""],["Venugopalan","Raju",""]]}
{"id":"2308.13597","submitter":"Michele Burrello","authors":"Stavros Athanasiou, Ida E. Nielsen, Matteo M. Wauters and Michele\n  Burrello","title":"Thouless pumping in Josephson junction arrays","comments":"26 pages, 12 figures","journal-ref":null,"doi":null,"report-no":"NBI QDEV 2023","categories":"cond-mat.mes-hall cond-mat.supr-con quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in fabrication techniques have enabled unprecedented\nclean interfaces and gate tunability in semiconductor-superconductor\nheterostructures. Inspired by these developments, we propose protocols to\nrealize Thouless quantum pumping in electrically tunable Josephson junction\narrays. We analyze, in particular, the implementation of the Rice-Mele and the\nHarper-Hofstadter pumping schemes, whose realization would validate these\nsystems as flexible platforms for quantum simulations. We investigate\nnumerically the long-time behavior of chains of controllable superconducting\nislands in the Coulomb-blockaded regime. Our findings provide new insights into\nthe dynamics of periodically driven interacting systems and highlight the\nrobustness of Thouless pumping with respect to boundary effects typical of\nsuperconducting circuits.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Athanasiou","Stavros",""],["Nielsen","Ida E.",""],["Wauters","Matteo M.",""],["Burrello","Michele",""]]}
{"id":"2308.13598","submitter":"Giulia Perotti","authors":"G. Perotti, J. K. J{\\o}rgensen, W. R. M. Rocha, A. Plunkett, E. Artur\n  de la Villarmois, L. E. Kristensen, M. Sewi{\\l}o, P. Bjerkeli, H. J. Fraser,\n  S. B. Charnley","title":"Linking ice and gas in the Coronet cluster in Corona Australis","comments":"20 pages, 17 figures, accepted for publication in Astronomy &\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the journey from the cloud to the disc, the chemical composition of\nthe protostellar envelope material can be either preserved or processed to\nvarying degrees depending on the surrounding physical environment. This works\naims to constrain the interplay of solid (ice) and gaseous methanol (CH$_3$OH)\nin the outer regions of protostellar envelopes located in the Coronet cluster\nin Corona Australis (CrA), and assess the importance of irradiation by the\nHerbig Ae/Be star R CrA. CH$_3$OH is a prime test-case as it predominantly\nforms as a consequence of the solid-gas interplay (hydrogenation of condensed\nCO molecules onto the grain surfaces) and it plays an important role in future\ncomplex molecular processing. We present 1.3 mm Submillimeter Array (SMA) and\nAtacama Pathfinder Experiment (APEX) observations towards the envelopes of four\nlow-mass protostars in the Coronet. Eighteen molecular transitions of seven\nspecies are identified. We calculate CH$_3$OH gas-to-ice ratios in this\nstrongly irradiated cluster and compare them with ratios determined towards\nprotostars located in less irradiated regions such as the Serpens SVS 4 cluster\nin Serpens Main and the Barnard 35A cloud in the $\\lambda$ Orionis region. The\nCH$_3$OH gas-to-ice ratios in the Coronet vary by one order of magnitude (from\n1.2$\\times$10$^{-4}$ to 3.1$\\times$10$^{-3}$) which is similar to less\nirradiated regions as found in previous studies. We find that the CH$_3$OH\ngas-to-ice ratios estimated in these three regions are remarkably similar\ndespite the different UV radiation field intensities and formation histories.\nThis result suggests that the overall CH$_3$OH chemistry in the outer regions\nof low-mass envelopes is relatively independent of variations in the physical\nconditions and hence that it is set during the prestellar stage.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Perotti","G.",""],["J\u00f8rgensen","J. K.",""],["Rocha","W. R. M.",""],["Plunkett","A.",""],["de la Villarmois","E. Artur",""],["Kristensen","L. E.",""],["Sewi\u0142o","M.",""],["Bjerkeli","P.",""],["Fraser","H. J.",""],["Charnley","S. B.",""]]}
{"id":"2308.13599","submitter":"Niusha Ahvazi","authors":"Niusha Ahvazi, Andrew Benson, Laura V. Sales, Ethan O. Nadler, Sachi\n  Weerasooriya, Xiaolong Du, Mia Sauda Bovill","title":"A comprehensive model for the formation and evolution of the faintest\n  Milky Way dwarf satellites","comments":"20 pages, 11 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we modify the semi-analytic model Galacticus in order to\naccurately reproduce the observed properties of dwarf galaxies in the Milky\nWay. We find that reproducing observational determinations of the halo\noccupation fraction and mass-metallicity relation for dwarf galaxies requires\nus to include H$_2$ cooling, an updated UV background radiation model, and to\nintroduce a model for the metal content of the intergalactic medium. By\nfine-tuning various model parameters and incorporating empirical constraints,\nwe have tailored the model to match the statistical properties of Milky Way\ndwarf galaxies, such as their luminosity function and size$-$mass relation. We\nhave validated our modified semi-analytic framework by undertaking a\ncomparative analysis of the resulting galaxy-halo connection. We predict a\ntotal of $300 ^{+75} _{-99}$ satellites with an absolute $V$-band magnitude\n(M$_{V}$) less than $0$ within $300$ kpc from our Milky Way-analogs. The\nfraction of subhalos that host a galaxy at least this bright drops to $50\\%$ by\na halo peak mass of $\\sim 8.9 \\times 10^{7}$ M$_{\\odot}$, consistent with the\noccupation fraction inferred from the latest observations of Milky Way\nsatellite population.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ahvazi","Niusha",""],["Benson","Andrew",""],["Sales","Laura V.",""],["Nadler","Ethan O.",""],["Weerasooriya","Sachi",""],["Du","Xiaolong",""],["Bovill","Mia Sauda",""]]}
{"id":"2308.13600","submitter":"Takahiro Sudoh","authors":"Takahiro Sudoh, John F. Beacom","title":"Where is the End of the Cosmic-Ray Electron Spectrum?","comments":"Main text 10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.GA hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Detecting the end of the cosmic-ray (CR) electron spectrum would provide\nimportant new insights. While we know that Milky Way sources can accelerate\nelectrons up to at least $\\sim$1~PeV, the observed CR electron spectrum at\nEarth extends only up to 5~TeV (possibly 20~TeV), a large discrepancy. The\nquestion of the end of the CR electron spectrum has received relatively little\nattention, despite its importance. We take a comprehensive approach, showing\nthat there are multiple steps at which the observed CR electron spectrum could\nbe cut off. At the highest energies, the accelerators may not have sufficient\nluminosity, or the sources may not allow sufficient escape, or propagation to\nEarth may not be sufficiently effective, or present detectors may not have\nsufficient sensitivity. For each step, we calculate a rough range of\npossibilities. Although all of the inputs are uncertain, a clear vista of\nexciting opportunities emerges. We outline strategies for progress based on CR\nelectron observations and auxiliary multi-messenger observations. In addition\nto advancing our understanding of CRs in the Milky Way, progress will also\nsharpen sensitivity to dark matter annihilation or decay.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sudoh","Takahiro",""],["Beacom","John F.",""]]}
{"id":"2308.13601","submitter":"Andrew Hardy","authors":"Andrew Hardy, Anjishnu Bose, and Arun Paramekanti","title":"Nematic order in topological SYK models","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.dis-nn cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a class of multi-orbital models based on those proposed by\nVenderbos, Hu, and Kane which exhibit an interplay of topology, interactions,\nand fermion incoherence. In the non-interacting limit, these models exhibit\ntrivial and Chern insulator phases with Chern number $C \\geq 1$ bands as\ndetermined by the relative angular momentum of the participating orbitals.\nThese quantum anomalous Hall insulator phases are separated by topological\ntransitions protected by crystalline rotation symmetry, featuring Dirac or\nquadratic band-touching points. Here we study the impact of Sachdev-Ye-Kitaev\n(SYK) type interactions on these lattice models. Given the random interactions,\nthese models display `average symmetries' upon disorder averaging, including a\ncharge conjugation symmetry, so they behave as interacting models in\ntopological class $\\mathbf{D}$ enriched by crystalline rotation symmetry. The\nphase diagram of this model features a non-Fermi liquid at high temperature and\nan exciton condensate with nematic transport at low temperature. We present\nresults for the free-energy, spectral functions, and the anomalous Hall\nresistivity as a function of temperature and tuning parameters. Our results are\nbroadly relevant to correlated topological matter in multiorbital systems, and\nmay also be viewed, with a suitable particle hole transformation, as an\nexploration of strong interaction effects on mean-field topological\nsuperconductors. \\end{abstract}\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hardy","Andrew",""],["Bose","Anjishnu",""],["Paramekanti","Arun",""]]}
{"id":"2308.13602","submitter":"Arvind Dattatrey","authors":"Arvind K. Dattatrey, R. K. S. Yadav, Annapurni Subramaniam, Ravi S.\n  Singh","title":"UVIT/AstroSat Investigation of a low luminous Blue Straggler Star in NGC\n  362: Detection of extremely low mass white dwarf as companion","comments":"6 pages, 2 figures, Submitted: 31 May, 2023 and Accepted: 26 July\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In the present study, we identified an extremely low-mass white dwarf as a\ncompanion to a low luminous blue straggler star within the Galactic globular\ncluster NGC 362. To conduct the analysis, we utilized data obtained from\nvarious sources, including AstroSat Ultra Violet Imaging Telescope, UVOT, and\nthe 2.2-m ESO telescope. By examining the spectral energy distribution of the\nblue straggler star candidate, we successfully identified an extremely low mass\nwhite dwarf as its binary companion. We determined the effective temperature,\nradius, and luminosity for both, the extremely low-mass white dwarf and the\nblue straggler star candidate. Specifically, the extremely low-mass white dwarf\nexhibits an effective temperature of 15000 K, a radius of 0.17 Rsun, a\nluminosity of 1.40 Lsun, and a mass range of 0.19-0.20 Msun. Furthermore, the\nposition of the straggler star within the cluster suggests their formation via\nthe Case A/B mass-transfer mechanism in a low-density environment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dattatrey","Arvind K.",""],["Yadav","R. K. S.",""],["Subramaniam","Annapurni",""],["Singh","Ravi S.",""]]}
{"id":"2308.13603","submitter":"Patrick Banner","authors":"Patrick Banner, Deniz Kurdak, Yaxin Li, Alan Migdall, J. V. Porto, S.\n  L. Rolston","title":"Number-State Tomography with a Single Single-Photon Avalanche Detector","comments":"10 pages, 5 figures plus supplementary 23 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present a methodology for performing photon number-state tomography with\nonly one single-photon avalanche detector (SPAD). The methodology, which is\ncost-effective and easy to implement, uses a detector model with measurable\nparameters together with maximum-likelihood analysis. We achieve excellent\nagreement between known input pulses and their reconstructions for coherent\nstates with up to $\\approx 10$ photons and peak input photon rates up to\nseveral Mcounts/s. We maintain good agreement for coherent pulses with peak\ninput photon rates of over 40 Mcounts/s, greater than one photon per detector\ndead time. For anti-bunched light, the reconstructed and independently measured\nvalues of $g^{(2)}(0)$ are also consistent. Our algorithm is applicable to\ncoherent pulses and non-classical light with $g^{(2)}(0) < 1$, whose total\npulse width is at least a few detector dead times. These results, achieved with\nsingle commercially available SPADs, provide an inexpensive number-state\ntomography method and expand the capabilities of single-photon detectors.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:00:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Banner","Patrick",""],["Kurdak","Deniz",""],["Li","Yaxin",""],["Migdall","Alan",""],["Porto","J. V.",""],["Rolston","S. L.",""]]}
{"id":"2308.13604","submitter":"Hanlin Sun","authors":"Hanlin Sun, Rajat Kumar Panda, Roberto Verdel, Alex Rodriguez,\n  Marcello Dalmonte and Ginestra Bianconi","title":"Network science Ising states of matter","comments":"17 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cs.SI physics.data-an physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Network science provides very powerful tools for extracting information from\ninteracting data. Although recently the unsupervised detection of phases of\nmatter using machine learning has raised significant interest, the full\nprediction power of network science has not yet been systematically explored in\nthis context. Here we fill this gap by providing an in-depth statistical,\ncombinatorial, geometrical and topological characterization of 2D Ising\nsnapshot networks (IsingNets) extracted from Monte Carlo simulations of the 2D\nIsing model at different temperatures, going across the phase transition. Our\nanalysis reveals the complex organization properties of IsingNets in both the\nferromagnetic and paramagnetic phases and demonstrates the significant\ndeviations of the IsingNets with respect to randomized null models. In\nparticular percolation properties of the IsingNets reflect the existence of the\nsymmetry between configurations with opposite magnetization below the critical\ntemperature and the very compact nature of the two emerging giant clusters\nrevealed by our persistent homology analysis of the IsingNets. Moreover, the\nIsingNets display a very broad degree distribution and significant\ndegree-degree correlations and weight-degree correlations demonstrating that\nthey encode relevant information present in the configuration space of the 2D\nIsing model. The geometrical organization of the critical IsingNets is\nreflected in their spectral properties deviating from the one of the null\nmodel. This work reveals the important insights that network science can bring\nto the characterization of phases of matter. The set of tools described hereby\ncan be applied as well to numerical and experimental data.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:01:03 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 08:12:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Sun","Hanlin",""],["Panda","Rajat Kumar",""],["Verdel","Roberto",""],["Rodriguez","Alex",""],["Dalmonte","Marcello",""],["Bianconi","Ginestra",""]]}
{"id":"2308.13605","submitter":"Joseph Baron","authors":"Joseph W. Baron","title":"A path integral approach to sparse non-Hermitian random matrices","comments":"15 pages, 11 figures, plus supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The theory of large random matrices has proved an invaluable tool for the\nstudy of systems with disordered interactions in many quite disparate research\nareas. Widely applicable results, such as the celebrated elliptic law for dense\nrandom matrices, allow one to deduce the statistical properties of the\ninteractions in a complex dynamical system that permit stability. However, such\nsimple and universal results have so far proved difficult to come by in the\ncase of sparse random matrices. Here, we present a new approach, which maps the\nhermitized resolvent of a random matrix onto the response functions of a linear\ndynamical system. The response functions are then evaluated using a path\nintegral formalism, enabling one to construct Feynman diagrams and perform a\nperturbative analysis. This approach provides simple closed-form expressions\nfor the eigenvalue spectrum, allowing one to derive modified versions of the\nclassic elliptic and semi-circle laws that take into account the sparse\ncorrection. Additionally, in order to demonstrate the broad utility of the path\nintegral framework, we derive a non-Hermitian generalization of the\nMarchenko-Pastur law, and we also show how one can handle non-negligible\nhigher-order statistics (i.e. non-Gaussian statistics) in dense ensembles.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:01:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baron","Joseph W.",""]]}
{"id":"2308.13606","submitter":"Mohammed Khalil","authors":"Quentin Henry, Mohammed Khalil","title":"Spin effects in gravitational waveforms and fluxes for binaries on\n  eccentric orbits to the third post-Newtonian order","comments":"36 pages, 2 figures, 3 ancillary files","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Compact binaries can have non-negligible orbital eccentricities in the\nfrequency band of ground-based gravitational-wave detectors, depending on their\nastrophysical formation channels. To accurately determine the parameters of\nsuch systems, waveform models need to incorporate eccentricity effects. In this\npaper, we consider an eccentric binary of spinning nonprecessing compact\nobjects, and derive the energy and angular momentum fluxes at infinity, as well\nas the gravitational waveform modes to the third post-Newtonian order. The\nnovel results of this paper include the next-to-leading order instantaneous\nspin-orbit and spin-spin contributions to the waveform modes, in addition to\nthe hereditary (tail and memory) contributions to the modes and fluxes for\neccentric orbits. The instantaneous contributions are derived for generic\nmotion, while the hereditary contributions are computed in a small-eccentricity\nexpansion, but we consider a resummation that makes them valid for large\neccentricities. We employ a quasi-Keplerian parametrization of the motion using\nharmonic coordinates and the covariant spin-supplementary condition, which\ncomplements some results in the literature in other coordinates. Our results\ncan be useful in improving the accuracy of waveform models for spinning\nbinaries on eccentric orbits.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:02:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Henry","Quentin",""],["Khalil","Mohammed",""]]}
{"id":"2308.13607","submitter":"Jernej Rudi Fin\\v{z}gar","authors":"Jernej Rudi Fin\\v{z}gar, Aron Kerschbaumer, Martin J. A. Schuetz,\n  Christian B. Mendl, Helmut G. Katzgraber","title":"Quantum-Informed Recursive Optimization Algorithms","comments":"17 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.CO math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose and implement a family of quantum-informed recursive optimization\n(QIRO) algorithms for combinatorial optimization problems. Our approach\nleverages quantum resources to obtain information that is used in\nproblem-specific classical reduction steps that recursively simplify the\nproblem. These reduction steps address the limitations of the quantum component\nand ensure solution feasibility in constrained optimization problems.\nAdditionally, we use backtracking techniques to further improve the performance\nof the algorithm without increasing the requirements on the quantum hardware.\nWe demonstrate the capabilities of our approach by informing QIRO with\ncorrelations from classical simulations of shallow (depth $p=1$) circuits of\nthe quantum approximate optimization algorithm (QAOA), solving instances of\nmaximum independent set and maximum satisfiability problems with hundreds of\nvariables. We also demonstrate how QIRO can be deployed on a neutral atom\nquantum processor available online on Amazon Braket to find large independent\nsets of graphs. In summary, our scheme achieves results comparable to classical\nheuristics, such as simulated annealing and greedy algorithms, even with\nrelatively weak quantum resources. Furthermore, enhancing the quality of these\nquantum resources improves the performance of the algorithms, highlighting the\npotential of QIRO. Notably, the modular nature of QIRO offers various avenues\nfor modifications, positioning our work as a blueprint for designing a broader\nclass of hybrid quantum-classical algorithms for combinatorial optimization.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:02:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fin\u017egar","Jernej Rudi",""],["Kerschbaumer","Aron",""],["Schuetz","Martin J. A.",""],["Mendl","Christian B.",""],["Katzgraber","Helmut G.",""]]}
{"id":"2308.13608","submitter":"Mohamed Benarous","authors":"Benarous Mohamed, Hocine Ahmed and Mehedi Atika","title":"Generalized stability conditions for binary bose mixtures","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Considering both interspecies and intraspecies fluctuations in ultracold\nbose-bose mixtures, we derive generalized stability conditions against collapse\nand phase separation. Furthermore, by examining the energy density of the\nsystem, we show that new LHY-like effects may enforce or destroy the stability\naccording to the excitation branch, therefore, permitting or prohibiting the\nexistence of droplet states.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:04:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mohamed","Benarous",""],["Ahmed","Hocine",""],["Atika","Mehedi",""]]}
{"id":"2308.13609","submitter":"Alessio Mansutti","authors":"R\\'emy Defossez, Christoph Haase, Alessio Mansutti, Guillermo A. Perez","title":"Integer Programming with GCD Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the non-linear extension of integer programming with greatest common\ndivisor constraints of the form $\\gcd(f,g) \\sim d$, where $f$ and $g$ are\nlinear polynomials, $d$ is a positive integer, and $\\sim$ is a relation among\n$\\leq, =, \\neq$ and $\\geq$. We show that the feasibility problem for these\nsystems is in NP, and that an optimal solution minimizing a linear objective\nfunction, if it exists, has polynomial bit length. To show these results, we\nidentify an expressive fragment of the existential theory of the integers with\naddition and divisibility that admits solutions of polynomial bit length. It\nwas shown by Lipshitz [Trans. Am. Math. Soc., 235, pp. 271-283, 1978] that this\ntheory adheres to a local-to-global principle in the following sense: a formula\n$\\Phi$ is equi-satisfiable with a formula $\\Psi$ in this theory such that\n$\\Psi$ has a solution if and only if $\\Psi$ has a solution modulo every prime\n$p$. We show that in our fragment, only a polynomial number of primes of\npolynomial bit length need to be considered, and that the solutions modulo\nprime numbers can be combined to yield a solution to $\\Phi$ of polynomial bit\nlength. As a technical by-product, we establish a Chinese-remainder-type\ntheorem for systems of congruences and non-congruences showing that solution\nsizes do not depend on the magnitude of the moduli of non-congruences.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:07:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Defossez","R\u00e9my",""],["Haase","Christoph",""],["Mansutti","Alessio",""],["Perez","Guillermo A.",""]]}
{"id":"2308.13610","submitter":"Sina Zare Pakzad","authors":"Sina Zare Pakzad and Mohammad Nasr Esfahani and B. Erdem Alaca","title":"Investigation of the Bending Behavior in Silicon Nanowires: A\n  Nanomechanical Modeling Perspective","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Nanowires play a pivotal role across a spectrum of disciplines such as\nnanoelectromechanical systems, nanoelectronics, and energy applications. As\nnanowires continue to diminish in dimensions, their mechanical characteristics\nare increasingly influenced by surface attributes. This research delves into\nthe elastic properties of silicon nanowires, which vary in dimensions and\ncrystal orientations, employing diverse nanomechanical models. Through\nmolecular dynamics simulations and the application of five models namely,\nHeidelberg, Hudson, Zhan, SimpZP, and ExtZP, the analysis of force-deflection\nresponses reveals the intricate interplay among elastic properties, crystal\norientation, and the chosen model. To accurately account for unreconstructed\nstates, surface properties are examined for different silicon surface\norientations. Each crystal orientation exhibits distinct trends, with surface\nproperties showing a substantial influence on estimated elasticity. A thorough\ngrasp of surface effects and anisotropic properties is crucial for unraveling\nnanowire mechanics. This study drives both the understanding of size-dependent\nbehaviors and the enhancement of insights into nanoscale surface\ncharacteristics of silicon nanowires.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:07:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pakzad","Sina Zare",""],["Esfahani","Mohammad Nasr",""],["Alaca","B. Erdem",""]]}
{"id":"2308.13611","submitter":"Prabhat Solanki","authors":"Biplob Bhattacherjee, Partha Konar, Vishal Singh Ngairangbam, Prabhat\n  Solanki","title":"LLPNet: Graph Autoencoder for Triggering Light Long-Lived Particles at\n  HL-LHC","comments":"28 pages, 14 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the search for exotic events involving displaced particles at HL-LHC, the\ntriggering at the level-1 (L1) system will pose a significant challenge. This\nis particularly relevant in scenarios where low mass long-lived particles\n(LLPs) are coupled to a Standard Model (SM)-like 125 GeV Higgs boson and they\ndecay into jets. The complexity arises from the low hadronic activity resulting\nfrom LLP decay, and the existing triggers' inability to efficiently select\ndisplaced events. This study introduces a novel machine learning approach to\naddress this challenge, utilizing a lightweight autoencoder architecture\ndesigned for low latency requirements at L1. Focusing on light LLPs with decay\nlengths ranging from 1 to 100 cm, this approach employs \"Edge convolution\" on\nL1 reconstructed tracks. The results show notable signal acceptance at the\npermissible background rate, primarily originating from minimum bias and QCD\ndi-jet events. For LLPs of mass 10, 30, and 50 GeV at decay length of 5 cm, the\nsignal efficiencies are 33%, 70%, and 80%, respectively. At a 50 cm decay\nlength, these efficiencies are 20%, 39%, and 45% for the same respective\nmasses.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:12:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhattacherjee","Biplob",""],["Konar","Partha",""],["Ngairangbam","Vishal Singh",""],["Solanki","Prabhat",""]]}
{"id":"2308.13612","submitter":"Chenqiu Zhao","authors":"Chenqiu Zhao, Guanfang Dong, Anup Basu","title":"Is Deep Learning Network Necessary for Image Generation?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, images are considered samples from a high-dimensional distribution,\nand deep learning has become almost synonymous with image generation. However,\nis a deep learning network truly necessary for image generation? In this paper,\nwe investigate the possibility of image generation without using a deep\nlearning network, motivated by validating the assumption that images follow a\nhigh-dimensional distribution. Since images are assumed to be samples from such\na distribution, we utilize the Gaussian Mixture Model (GMM) to describe it. In\nparticular, we employ a recent distribution learning technique named as\nMonte-Carlo Marginalization to capture the parameters of the GMM based on image\nsamples. Moreover, we also use the Singular Value Decomposition (SVD) for\ndimensionality reduction to decrease computational complexity. During our\nevaluation experiment, we first attempt to model the distribution of image\nsamples directly to verify the assumption that images truly follow a\ndistribution. We then use the SVD for dimensionality reduction. The principal\ncomponents, rather than raw image data, are used for distribution learning.\nCompared to methods relying on deep learning networks, our approach is more\nexplainable, and its performance is promising. Experiments show that our images\nhave a lower FID value compared to those generated by variational\nauto-encoders, demonstrating the feasibility of image generation without deep\nlearning networks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:14:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Chenqiu",""],["Dong","Guanfang",""],["Basu","Anup",""]]}
{"id":"2308.13613","submitter":"Kashif Ishaq","authors":"Kashif Ishaq, Fatima Khan","title":"Block Chain in the IoT industry: A Systematic Literature Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The possibility of block chain innovation revolutionizing business operations\nand interpersonal interactions in Industry 4.0 is becoming more widely\nacknowledged. Industry 4.0 and the Industrial Internet of Things (IoT) are\namong the new application fields. As a result, the purpose of this article is\nto investigate the block chain applications that are already being used in IoT\nand Industry 4.0. In particular, it looks at current research trends in various\nIoT applications, addressing problems, concerns, and potential future uses of\nintegrating block chain technology. This article also includes a thorough\ndiscussion of the key elements of block chain databases, including Merkle\ntrees, transaction management, sharding, long-term memory, and short-term\nmemory. In order to do this, more than 46 pertinent primary research that have\nbeen published in reputable journals have been chosen for additional\nexamination. The workflow of a block chain network utilizing IoT is also\ndemonstrated, demonstrating how IoT devices communicate with one another and\nhow they contribute to the network's overall operation. The taxonomy diagram\nbelow serves to illustrate the contribution.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:14:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ishaq","Kashif",""],["Khan","Fatima",""]]}
{"id":"2308.13614","submitter":"Charles-\\'Edouard Boukar\\'e","authors":"Charles-\\'Edouard Boukar\\'e, Daphn\\'e Lemasquerier, Nicolas Cowan,\n  Henri Samuel, and James Badro","title":"Lava planets interior dynamics govern the long-term evolution of their\n  magma oceans","comments":"12 pages, 4 figures. Supplementary informations are included","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.flu-dyn physics.geo-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lava planets are rocky exoplanets that orbit so close to their host star that\ntheir day-side is hot enough to melt silicate rock. Their short orbital periods\nensure that lava planets are tidally locked into synchronous rotation, with\npermanent day and night hemispheres. Such asymmetric magma oceans have no\nanalogs in the Solar System and will exhibit novel fluid dynamics.\n  Here we report numerical simulations of lava planet interiors showing that\nsolid-liquid fractionation in the planetary interior has a major impact on the\ncompositional structure and evolution of the planet. We explored two styles of\ndynamics that depend primarily on the interior thermal state : 1) a hot fully\nmolten interior, and 2) a mostly solid interior with a shallow day-side magma\nocean.\n  In the hot interior scenario, the atmosphere reflects the planet's bulk\nsilicate composition and the night-side crust is gravitationally unstable and\nconstantly replenished. In the cool interior scenario, the distilled atmosphere\nwill lack Na, K and FeO, and the night-side mantle is entirely solid, with a\ncold surface. These two end-member cases can be distinguished with observations\nfrom the James Webb Space Telescope, offering an avenue to probe the diversity\nof terrestrial exoplanet evolutions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:15:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Boukar\u00e9","Charles-\u00c9douard",""],["Lemasquerier","Daphn\u00e9",""],["Cowan","Nicolas",""],["Samuel","Henri",""],["Badro","James",""]]}
{"id":"2308.13615","submitter":"Mikhail Kirilin","authors":"Mikhail Kirilin (1), Carsten Burstedde (1) ((1) INS, Rheinische\n  Friedrich-Wilhelms-Universit\\\"at Bonn, Bonn, Germany)","title":"Alternative quadrant representations with Morton index and AVX2\n  vectorization for AMR algorithms within the p4est software library","comments":"10 pages, 7 figures and 12 algorithms, submitted to Proceedings of\n  the 2024 SIAM Conference on Parallel Processing for Scientific Computing\n  (PP). For reprodusing results use branches\n  https://github.com/cburstedde/p4est/tree/p4est-virtual and\n  https://github.com/cburstedde/libsc/tree/feature-sc3 and executable\n  build_dir>/example/timings/p8est3_p3time","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a technical enhancement within the p4est software for parallel\nadaptive mesh refinement. In p4est primitives are stored as octants in three\nand quadrants in two dimensions. While, classically, they are encoded by the\nnative approach using its spatial and refinement level, any other\nmathematically equivalent encoding might be used instead.\n  Recognizing this, we add two alternative representations to the classical,\nexplicit version, based on a long monotonic index and 128-bit AVX quad\nintegers, respectively. The first one requires changes in logic for low-level\nquadrant manipulating algorithms, while the other exploits data level\nparallelism and requires algorithms to be adapted to SIMD instructions. The\nresultant algorithms and data structures lead to higher performance and lesser\nmemory usage in comparison with the standard baseline.\n  We benchmark selected algorithms on a cluster with two Intel(R) Xeon(R) Gold\n6130 Skylake family CPUs per node, which provides support for AVX2 extensions,\n192 GB RAM per node, and up to 512 computational cores in total.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 14:05:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kirilin","Mikhail",""],["Burstedde","Carsten",""]]}
{"id":"2308.13616","submitter":"Firas Fredj","authors":"Firas Fredj, Amal Feriani, Amine Mezghani, Ekram Hossain","title":"Channel Estimation in RIS-Enabled mmWave Wireless Systems: A Variational\n  Inference Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a variational inference (VI)-based channel state information (CSI)\nestimation approach in a fully-passive reconfigurable intelligent surface\n(RIS)-aided mmWave single-user single-input multiple-output (SIMO)\ncommunication system. Specifically, we first propose a VI-based joint channel\nestimation method to estimate the user-equipment (UE) to RIS (UE-RIS) and RIS\nto base station (RIS-BS) channels using uplink training signals in a passive\nRIS setup. However, updating the phase-shifts based on the instantaneous CSI\n(I-CSI) leads to a high signaling overhead especially due to the short\ncoherence block of the UE-RIS channel. Therefore, to reduce the signaling\ncomplexity, we propose a VI-based method to estimate the RIS-BS channel along\nwith the covariance matrix of the UE-RIS channel that remains quasi-static for\na longer period than the instantaneous UE-RIS channel. In the VI framework, we\napproximate the posterior of the channel gains/covariance matrix with\nconvenient distributions given the received uplink training signals. Then, the\nlearned distributions, which are close to the true posterior distributions in\nterms of Kullback-Leibler divergence, are leveraged to obtain the maximum a\nposteriori (MAP) estimation of the considered CSI. The simulation results\ndemonstrate that MAP channel estimation using approximated posteriors yields a\ncapacity that is close to the one achieved with true posteriors, thus\ndemonstrating the effectiveness of the proposed methods. Furthermore, our\nresults show that estimating the channel covariance matrix improves the\nspectral efficiency by reducing the pilot signaling required to obtain the\nphase-shifts for the RIS elements in a channel-varying environment.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:18:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fredj","Firas",""],["Feriani","Amal",""],["Mezghani","Amine",""],["Hossain","Ekram",""]]}
{"id":"2308.13617","submitter":"Krishna Naidoo","authors":"Krishna Naidoo","title":"Signs of a non-zero equation-of-state for Dark Matter","comments":"Invited chapter for the edited book Hubble Constant Tension (Eds. E.\n  Di Valentino and D. Brout, Springer Singapore, expected in 2024)","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate how a changing and negative equation-of-state (EoS) for dark\nmatter can alleviate cosmic tensions and explain the integrated Sachs-Wolfe\n(ISW) void anomaly. We discuss the effect of the model on the cosmic expansion\nhistory, growth of structure and the ISW. We show that a negative EoS at late\ntimes is able to produce a larger Hubble constant and smaller $\\sigma_{8}$,\nwhich can explain both cosmological tensions. Furthermore, the model uniquely\npredicts larger ISW at low redshift, a prediction which is in agreement with\nobservations of larger ISW from voids. The preference for a negative EoS for\ndark matter at late times is indicative of a unified dark sector and degenerate\nwith models of dark matter and dark energy interaction. Future measurements of\nthe ISW from cosmic voids can provide a unique test for this solution to\ntensions in cosmology, should they continue to persist.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:30:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Naidoo","Krishna",""]]}
{"id":"2308.13618","submitter":"Oliver Butterley","authors":"Oliver Butterley","title":"Exponential mixing for singular skew-products","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study skew-products of the form $(x,u) \\mapsto (fx, u + \\varphi(x))$ where\n$f$ is a non-uniformly expanding map on a manifold $X$ and $\\varphi: X \\to\n\\mathbb{S}^1$ is piecewise $\\mathcal{C}^1$. If the systems satisfies mild\nassumptions (in particular singular behaviour of $\\varphi$ is permitted) then\nwe prove that the map mixes exponentially with respect to the unique SRB\nmeasure. This extends previous results by allowing singular behaviour in the\nfibre map.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:30:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Butterley","Oliver",""]]}
{"id":"2308.13619","submitter":"Mustapha Maamache","authors":"Mustapha Maamache and Nour El Houda Absi","title":"On the {\\eta} pseudo PT symmetry theory for non-Hermitian Hamiltonians:\n  time-independent systems","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The {\\eta} pseudo PT symmetry theory, denoted by the symbol {\\eta}, explores\nthe conditions under which non-Hermitian Hamiltonians can possess real spectra\ndespite the violation of PT symmetry, that is the adjoint of H, denoted\nH^{{\\dag}} is expressed as H^{{\\dag}}=PTHPT. This theory introduces a new\nsymmetry operator, {\\eta}=PT{\\eta}, which acts on the Hilbert space. The {\\eta}\npseudo PT symmetry condition requires the Hamiltonian to commute with the\n{\\eta} operator, leading to real eigenvalues. We discuss some general\nimplications of our results for the coupled non hermitian harmonic oscillator.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:31:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Maamache","Mustapha",""],["Absi","Nour El Houda",""]]}
{"id":"2308.13620","submitter":"Roland Kawakami","authors":"Wenyi Zhou, Alexander J. Bishop, Xiyue S. Zhang, Katherine Robinson,\n  Igor Lyalin, Ziling Li, Ryan Bailey-Crandell, Thow Min Jerald Cham, Shuyu\n  Cheng, Yunqiu Kelly Luo, Daniel C. Ralph, David A. Muller, and Roland K.\n  Kawakami","title":"Tuning the Curie temperature of a 2D magnet/topological insulator\n  heterostructure to above room temperature by epitaxial growth","comments":"8 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Heterostructures of two-dimensional (2D) van der Waals (vdW) magnets and\ntopological insulators (TI) are of substantial interest as candidate materials\nfor efficient spin-torque switching, quantum anomalous Hall effect, and chiral\nspin textures. However, since many of the vdW magnets have Curie temperatures\nbelow room temperature, we want to understand how materials can be modified to\nstabilize their magnetic ordering to higher temperatures. In this work, we\nutilize molecular beam epitaxy to systematically tune the Curie temperature\n($T_C$) in thin film Fe$_3$GeTe$_2$/Bi$_2$Te$_3$ from bulk-like values\n($\\sim$220 K) to above room temperature by increasing the growth temperature\nfrom 300 $^\\circ$C to 375 $^\\circ$C. For samples grown at 375 $^\\circ$C,\ncross-sectional scanning transmission electron microscopy (STEM) reveals the\nspontaneous formation of different Fe$_m$Ge$_n$Te$_2$ compositions (e.g.\nFe$_5$Ge$_2$Te$_2$ and Fe$_7$Ge$_6$Te$_2$) as well as intercalation in the vdW\ngaps, which are possible origins of the enhanced Curie temperature. This\nobservation paves the way for developing various Fe$_m$Ge$_n$Te$_2$/TI\nheterostructures with novel properties.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:31:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Wenyi",""],["Bishop","Alexander J.",""],["Zhang","Xiyue S.",""],["Robinson","Katherine",""],["Lyalin","Igor",""],["Li","Ziling",""],["Bailey-Crandell","Ryan",""],["Cham","Thow Min Jerald",""],["Cheng","Shuyu",""],["Luo","Yunqiu Kelly",""],["Ralph","Daniel C.",""],["Muller","David A.",""],["Kawakami","Roland K.",""]]}
{"id":"2308.13621","submitter":"Maria Camarca","authors":"Maria Camarca, Katherine de Kleer, Bryan Butler, Alex B. Akins,\n  Alexander Thelen, Imke de Pater, Mark A. Gurwell, Arielle Moullet","title":"Thermal properties of the leading hemisphere of Callisto inferred from\n  ALMA observations","comments":"13 pages, 7 figures","journal-ref":"Planet. Sci. J. 4 142 (2023)","doi":"10.3847/PSJ/aceb68","report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a thermal observation of Callisto's leading hemisphere obtained\nusing the Atacama Large Millimeter/submillimeter Array (ALMA) at 0.87 mm (343\nGHz). The angular resolution achieved for this observation was\n$\\sim$$0.16^{\\prime\\prime}$, which for Callisto at the time of this observation\n($D\\sim 1.05^{\\prime\\prime}$) was equivalent to $\\sim$6 elements across the\nsurface. Our disk-integrated brightness temperature of 116 $\\pm$ 5 K (8.03\n$\\pm$ 0.40 Jy) is consistent with prior disk-integrated observations. Global\nsurface properties were derived from the observation using a thermophysical\nmodel (de Kleer et al. 2021) constrained by spacecraft data. We find that\nmodels parameterized by two thermal inertia components more accurately fit the\ndata than single thermal inertia models. Our best-fit global parameters adopt a\nlower thermal inertia of 15-50\n$\\text{J}\\:\\text{m}^{-2}\\:\\text{K}^{-1}\\:\\text{s}^{-1/2}$ and a higher thermal\ninertia component of 1200-2000\n$\\text{J}\\:\\text{m}^{-2}\\:\\text{K}^{-1}\\:\\text{s}^{-1/2}$, with retrieved\nmillimeter emissivities of 0.89-0.91. We identify several thermally anomalous\nregions, including spots $\\sim$3 K colder than model predictions co-located\nwith the Valhalla impact basin and a complex of craters in the southern\nhemisphere; this indicates the presence of materials possessing either a higher\nthermal inertia or a lower emissivity. A warm region confined to the\nmid-latitudes in these leading hemisphere data may be indicative of regolith\nproperty changes due to exogenic sculpting.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:36:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Camarca","Maria",""],["de Kleer","Katherine",""],["Butler","Bryan",""],["Akins","Alex B.",""],["Thelen","Alexander",""],["de Pater","Imke",""],["Gurwell","Mark A.",""],["Moullet","Arielle",""]]}
{"id":"2308.13622","submitter":"J.V. Seidel","authors":"J. V. Seidel and B. Prinoth and E. Knudstrup and H. J. Hoeijmakers and\n  J. J. Zanazzi and S. Albrecht","title":"Detection of atmospheric species and dynamics in the bloated hot Jupiter\n  WASP-172~b with ESPRESSO","comments":"Accepted for publication in A&A, joint first authors Seidel and\n  Prinoth, 11 pages, 16 figures, 2 tables, 1 appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The population of strongly irradiated Jupiter-sized planets has no equivalent\nin the Solar System. It is characterised by strongly bloated atmospheres and\natmospheric large-scale heights. Recent space-based observations of SO2\nphotochemistry demonstrated the knowledge that can be gained from detailed\natmospheric studies of these unusual planets about Earth's uniqueness. Aims.\nHere we explore the atmosphere of WASP-172b a similar planet in temperature and\nbloating to the recently studied HD~149026~b. In this work, we characterise the\natmospheric composition and subsequently the atmospheric dynamics of this prime\ntarget. Methods. We observed a particular transit of WASP-172b in front of its\nhost star with ESO's ESPRESSO spectrograph and analysed the spectra obtained\nbefore during and after transit. Results. We detect the absorption of starlight\nby WASP-172b's atmosphere by sodium (5.6sigma), hydrogen (19.5sigma) and\nobtained a tentative detection of iron (4.1sigma). We detect strong - yet\nvarying - blue shifts, relative to the planetary rest frame, of all of these\nabsorption features. This allows for a preliminary study of the atmospheric\ndynamics of WASP-172b. Conclusions. With only one transit, we were able to\ndetect a wide variety of species, clearly tracking different atmospheric layers\nwith possible jets. WASP-172b is a prime follow-up target for a more in-depth\ncharacterisation both for ground and space-based observatories. If the\ndetection of Fe is confirmed, this may suggest that radius inflation is an\nimportant determinant for the detectability of Fe in hot Jupiters, as several\nnon-detections of Fe have been published for planets that are hotter but less\ninflated than WASP-172b.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:38:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Seidel","J. V.",""],["Prinoth","B.",""],["Knudstrup","E.",""],["Hoeijmakers","H. J.",""],["Zanazzi","J. J.",""],["Albrecht","S.",""]]}
{"id":"2308.13623","submitter":"Kayol Mayer","authors":"Heitor dos Santos Sousa, Jonathan Aguiar Soares, Kayol Soares Mayer,\n  Dalton Soares Arantes","title":"CVNN-based Channel Estimation and Equalization in OFDM Systems Without\n  Cyclic Prefix","comments":"XLI Simp\\'osio Brasileiro de Telecomunica\\c{c}\\~oes e Processamento\n  Digital de Sinais - SBrT 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In modern communication systems operating with Orthogonal Frequency-Division\nMultiplexing (OFDM), channel estimation requires minimal complexity with\none-tap equalizers. However, this depends on cyclic prefixes, which must be\nsufficiently large to cover the channel impulse response. Conversely, the use\nof cyclic prefix (CP) decreases the useful information that can be conveyed in\nan OFDM frame, thereby degrading the spectral efficiency of the system. In this\ncontext, we study the impact of CPs on channel estimation with complex-valued\nneural networks (CVNNs). We show that the phase-transmittance radial basis\nfunction neural network offers superior results, in terms of required energy\nper bit, compared to classical minimum mean-squared error and least squares\nalgorithms in scenarios without CP.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:40:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sousa","Heitor dos Santos",""],["Soares","Jonathan Aguiar",""],["Mayer","Kayol Soares",""],["Arantes","Dalton Soares",""]]}
{"id":"2308.13624","submitter":"Shivam Saxena Dr.","authors":"Shivam Saxena, Hany Farag, Khunsha Nasr, Leigh St. Hilaire","title":"Field Testing of Residential Bidirectional Electric Vehicle Charger for\n  Power System Applications","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Bidirectional electric vehicle (EV) charging is a technology that is gaining\nrapid popularity due to its ability to provide economic and environmental\nbenefits to both EV owners and power system operators (PSOs). Using the EV as a\nflexible source of energy, an EV owner can provide power to homes/buildings, or\neven participate in grid services such as demand response and frequency\nregulation. However, there is a lack of real-world testing and validation for\nbidirectional charging technology, particularly in the residential segment. As\nsuch, this paper presents real-world field testing of a bidirectional EV\ncharger deployed in a home. Control software is developed to dispatch the EV\naccording to static setpoints, as well as automated load following, and its\naccuracy and responsiveness is reported on. The results of the testing with the\ncharger and 2019 Nissan Leaf combination indicates a responsiveness of 6-8\nseconds and accuracy of over 99%, which suggests feasible participation for\napplications such as load following, arbitrage, and demand response.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:41:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Saxena","Shivam",""],["Farag","Hany",""],["Nasr","Khunsha",""],["Hilaire","Leigh St.",""]]}
{"id":"2308.13625","submitter":"C\\'esar Fosco","authors":"Aitor Fern\\'andez and C. D. Fosco","title":"Quantum friction for a scalar model: spatial dependence and higher\n  orders","comments":"12 pages, LaTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use a perturbative approach to evaluate transition amplitudes\ncorresponding to quantum friction, for a scalar model describing an atom which\nmoves at a constant velocity, close to a material plane. In particular, we\npresent results on the probability density per unit time of exciting degrees of\nfreedom on specific regions of the plane. This allows one to know spatial\nfeatures of the effect which could have practical relevance, for instance, for\nthe design of nanodevices.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:43:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fern\u00e1ndez","Aitor",""],["Fosco","C. D.",""]]}
{"id":"2308.13626","submitter":"Yunyong Ko","authors":"Myung-Hwan Jang, Yunyong Ko, Hyuck-Moo Gwon, Ikhyeon Jo, Yongjun Park,\n  Sang-Wook Kim","title":"SAGE: A Storage-Based Approach for Scalable and Efficient Sparse\n  Generalized Matrix-Matrix Multiplication","comments":"11 pages, 9 figures, 5 tables, CIKM","journal-ref":null,"doi":"10.1145/3583780.3615044","report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Sparse generalized matrix-matrix multiplication (SpGEMM) is a fundamental\noperation for real-world network analysis. With the increasing size of\nreal-world networks, the single-machine-based SpGEMM approach cannot perform\nSpGEMM on large-scale networks, exceeding the size of main memory (i.e., not\nscalable). Although the distributed-system-based approach could handle\nlarge-scale SpGEMM based on multiple machines, it suffers from severe\ninter-machine communication overhead to aggregate results of multiple machines\n(i.e., not efficient). To address this dilemma, in this paper, we propose a\nnovel storage-based SpGEMM approach (SAGE) that stores given networks in\nstorage (e.g., SSD) and loads only the necessary parts of the networks into\nmain memory when they are required for processing via a 3-layer architecture.\nFurthermore, we point out three challenges that could degrade the overall\nperformance of SAGE and propose three effective strategies to address them: (1)\nblock-based workload allocation for balancing workloads across threads, (2)\nin-memory partial aggregation for reducing the amount of unnecessarily\ngenerated storage-memory I/Os, and (3) distribution-aware memory allocation for\npreventing unexpected buffer overflows in main memory. Via extensive\nevaluation, we verify the superiority of SAGE over existing SpGEMM methods in\nterms of scalability and efficiency.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:47:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jang","Myung-Hwan",""],["Ko","Yunyong",""],["Gwon","Hyuck-Moo",""],["Jo","Ikhyeon",""],["Park","Yongjun",""],["Kim","Sang-Wook",""]]}
{"id":"2308.13627","submitter":"Qingyang Seiyo Wang","authors":"Qingyang Wang and Susanne F. Yelin","title":"Inter-Particle Correlations in the Dissipative Phase Transition of a\n  Collective Spin Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In open quantum systems undergoing phase transitions, the intricate interplay\nbetween unitary and dissipative processes leaves many information-theoretic\nproperties opaque. We are here interested in interparticle correlations within\nsuch systems, specifically examining quantum entanglement, quantum discord, and\nclassical correlation within the steady state of a driven-dissipative\ncollective spin model. This model is renowned for, counterintuitively, its\ntransition from a high-purity to a low-purity state with decreasing\ndissipation. Our investigation, rooted in numerical analysis using PPT\ncriteria, underscores that entanglement reaches its zenith precisely at the\nphase transition juncture. Intriguingly, even within the mesoscopic scale near\nthe transition point, entanglement endures across both phases, despite the open\nnature of the model. Notably, when employing traditional pairwise entanglement\nmeasures tailored to this model, detecting entanglement in the low-purity phase\nhas proven elusive. In stark contrast, quantum discord and its variations chart\nan alternate trajectory, ascending monotonically as the system progresses into\nthe low-purity phase. Consequently, lowered dissipation amplifies quantum\ncorrelation, yet it engenders entanglement solely in proximity to the\ntransition point.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:48:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Qingyang",""],["Yelin","Susanne F.",""]]}
{"id":"2308.13628","submitter":"Jiayin Zhu","authors":"Jiayin Zhu, Zhuoran Zhao, Linlin Yang, Angela Yao","title":"HiFiHR: Enhancing 3D Hand Reconstruction from a Single Image via\n  High-Fidelity Texture","comments":"Accepted to DAGM German Conference on Pattern Recognition 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present HiFiHR, a high-fidelity hand reconstruction approach that utilizes\nrender-and-compare in the learning-based framework from a single image, capable\nof generating visually plausible and accurate 3D hand meshes while recovering\nrealistic textures. Our method achieves superior texture reconstruction by\nemploying a parametric hand model with predefined texture assets, and by\nestablishing a texture reconstruction consistency between the rendered and\ninput images during training. Moreover, based on pretraining the network on an\nannotated dataset, we apply varying degrees of supervision using our pipeline,\ni.e., self-supervision, weak supervision, and full supervision, and discuss the\nvarious levels of contributions of the learned high-fidelity textures in\nenhancing hand pose and shape estimation. Experimental results on public\nbenchmarks including FreiHAND and HO-3D demonstrate that our method outperforms\nthe state-of-the-art hand reconstruction methods in texture reconstruction\nquality while maintaining comparable accuracy in pose and shape estimation. Our\ncode is available at https://github.com/viridityzhu/HiFiHR.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:48:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Jiayin",""],["Zhao","Zhuoran",""],["Yang","Linlin",""],["Yao","Angela",""]]}
{"id":"2308.13630","submitter":"Lijun Wang","authors":"Lijun Wang, Hongyu Zhao, Xiaodan Fan","title":"Degrees of Freedom: Search Cost and Self-consistency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Model degrees of freedom ($\\df$) is a fundamental concept in statistics\nbecause it quantifies the flexibility of a fitting procedure and is\nindispensable in model selection. The $\\df$ is often intuitively equated with\nthe number of independent variables in the fitting procedure. But for adaptive\nregressions that perform variable selection (e.g., the best subset\nregressions), the model $\\df$ is larger than the number of selected variables.\nThe excess part has been defined as the \\emph{search degrees of freedom}\n($\\sdf$) to account for model selection. However, this definition is limited\nsince it does not consider fitting procedures in augmented space, such as\nsplines and regression trees; and it does not use the same fitting procedure\nfor $\\sdf$ and $\\df$. For example, the lasso's $\\sdf$ is defined through the\n\\emph{relaxed} lasso's $\\df$ instead of the lasso's $\\df$.\n  Here we propose a \\emph{modified search degrees of freedom} ($\\msdf$) to\ndirectly account for the cost of searching in the original or augmented space.\nSince many fitting procedures can be characterized by a linear operator, we\ndefine the search cost as the effort to determine such a linear operator. When\nwe construct a linear operator for the lasso via the iterative ridge\nregression, $\\msdf$ offers a new perspective for its search cost. For some\ncomplex procedures such as the multivariate adaptive regression splines (MARS),\nthe search cost needs to be pre-determined to serve as a tuning parameter for\nthe procedure itself, but it might be inaccurate. To investigate the inaccurate\npre-determined search cost, we develop two concepts, \\emph{nominal} $\\df$ and\n\\emph{actual} $\\df$, and formulate a property named \\emph{self-consistency}\nwhen there is no gap between the \\emph{nominal} $\\df$ and the \\emph{actual}\n$\\df$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:55:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Lijun",""],["Zhao","Hongyu",""],["Fan","Xiaodan",""]]}
{"id":"2308.13631","submitter":"Andres Almeida","authors":"Andres Almeida, Steven R. Majewski, David L. Nidever, Knut A.G. Olsen,\n  Antonela Monachesi, Nitya Kallivayalil, Sten Hasselquist, Yumi Choi, Joshua\n  T. Povick, John C. Wilson, Doug Geisler, Richard R. Lane, Christian\n  Nitschelm, Jennifer S. Sobeck and Guy S. Stringfellow","title":"Exploring the Origin of the Distance Bimodality of Stars in the\n  Periphery of the Small Magellanic Cloud with APOGEE and Gaia","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Magellanic Cloud system represents a unique laboratory for study of both\ninteracting dwarf galaxies and the ongoing process of the formation of the\nMilky Way and its halo. We focus on one aspect of this complex, 3 body\ninteraction - the dynamical perturbation of the Small Magellanic Cloud (SMC) by\nthe Large Magellanic Cloud (LMC), and specifically potential tidal effects on\nthe SMC's eastern side. Using Gaia astrometry and the precise radial velocities\nand multi-element chemical abundances from APOGEE-2 DR17, we explore the\nwell-known distance bimodality on the eastern side of the SMC. Through\nestimated stellar distances, proper motions, and radial velocities, we\ncharacterize the kinematics of the two populations in the bimodality and\ncompare their properties with those of SMC populations elsewhere. Moreover,\nwhile all regions explored by APOGEE seem to show a single chemical enrichment\nhistory, the metallicity distribution function (MDF), of the \"far\" stars on the\neastern periphery of the SMC is found to resemble that for the more metal-poor\nfields of the western periphery, whereas the MDF for the \"near\" stars on the\neastern periphery resembles that for stars in the SMC center. The closer\neastern periphery stars also show radial velocities (corrected for SMC rotation\nand bulk motion) that are, on average, approaching us relative to all other SMC\npopulations sampled. We interpret these trends as evidence that the near stars\non the eastern side of the SMC represent material pulled out of the central SMC\nas part of its tidal interaction with the LMC.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:57:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Almeida","Andres",""],["Majewski","Steven R.",""],["Nidever","David L.",""],["Olsen","Knut A. G.",""],["Monachesi","Antonela",""],["Kallivayalil","Nitya",""],["Hasselquist","Sten",""],["Choi","Yumi",""],["Povick","Joshua T.",""],["Wilson","John C.",""],["Geisler","Doug",""],["Lane","Richard R.",""],["Nitschelm","Christian",""],["Sobeck","Jennifer S.",""],["Stringfellow","Guy S.",""]]}
{"id":"2308.13632","submitter":"Haoyu Li","authors":"Haoyu Li, Liuhui Wang, Qizhi Chen, Jianan Ji, Yuhan Wu, Yikai Zhao,\n  Tong Yang, Aditya Akella","title":"ChainedFilter: Combining Membership Filters by Chain Rule","comments":"SIGMOD 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.DS cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Membership (membership query / membership testing) is a fundamental problem\nacross databases, networks and security. However, previous research has\nprimarily focused on either approximate solutions, such as Bloom Filters, or\nexact methods, like perfect hashing and dictionaries, without attempting to\ndevelop a an integral theory. In this paper, we propose a unified and complete\ntheory, namely chain rule, for general membership problems, which encompasses\nboth approximate and exact membership as extreme cases. Building upon the chain\nrule, we introduce a straightforward yet versatile algorithm framework, namely\nChainedFilter, to combine different elementary filters without losing\ninformation. Our evaluation results demonstrate that ChainedFilter performs\nwell in many applications: (1) it requires only 26% additional space over the\ntheoretical lower bound for implicit static dictionary, (2) it requires only\n0.22 additional bit per item over the theoretical lower bound for lossless data\ncompression, (3) it reduces up to 31% external memory access than raw Cuckoo\nHashing, (4) it reduces up to 36% P99 tail point query latency than Bloom\nFilter under the same space cost in RocksDB database, and (5) it reduces up to\n99.1% filter space than original Learned Bloom Filter.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:58:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Haoyu",""],["Wang","Liuhui",""],["Chen","Qizhi",""],["Ji","Jianan",""],["Wu","Yuhan",""],["Zhao","Yikai",""],["Yang","Tong",""],["Akella","Aditya",""]]}
{"id":"2308.13633","submitter":"Lyndon Duong","authors":"Lyndon R. Duong, Eero P. Simoncelli, Dmitri B. Chklovskii, David\n  Lipshutz","title":"Adaptive whitening with fast gain modulation and slow synaptic\n  plasticity","comments":"18 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neurons in early sensory areas rapidly adapt to changing sensory statistics,\nboth by normalizing the variance of their individual responses and by reducing\ncorrelations between their responses. Together, these transformations may be\nviewed as an adaptive form of statistical whitening. Existing mechanistic\nmodels of adaptive whitening exclusively use either synaptic plasticity or gain\nmodulation as the biological substrate for adaptation; however, on their own,\neach of these models has significant limitations. In this work, we unify these\napproaches in a normative multi-timescale mechanistic model that adaptively\nwhitens its responses with complementary computational roles for synaptic\nplasticity and gain modulation. Gains are modified on a fast timescale to adapt\nto the current statistical context, whereas synapses are modified on a slow\ntimescale to learn structural properties of the input statistics that are\ninvariant across contexts. Our model is derived from a novel multi-timescale\nwhitening objective that factorizes the inverse whitening matrix into basis\nvectors, which correspond to synaptic weights, and a diagonal matrix, which\ncorresponds to neuronal gains. We test our model on synthetic and natural\ndatasets and find that the synapses learn optimal configurations over long\ntimescales that enable the circuit to adaptively whiten neural responses on\nshort timescales exclusively using gain modulation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:58:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Duong","Lyndon R.",""],["Simoncelli","Eero P.",""],["Chklovskii","Dmitri B.",""],["Lipshutz","David",""]]}
{"id":"2308.13634","submitter":"Masaaki Matsuda","authors":"S. E. Dissanayake, M. Matsuda, K. Yoshimi, S. Kasamatsu, F. Ye, S.\n  Chi, W. Steinhardt, G. Fabbris, S. Haravifard, J.-G. Cheng, J.-Q. Yan, J.\n  Gouchi, and Y. Uwatoko","title":"Helical magnetic state in the vicinity of the pressure-induced\n  superconducting phase in MnP","comments":"15 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  MnP is a metal that shows successive magnetic transitions from paramagnetic\nto ferromagnetic and helical magnetic phases at ambient pressure with\ndecreasing temperature. With applied pressure, the magnetic transition\ntemperatures decrease and superconductivity appears around 8 GPa where the\nmagnetic order is fully suppressed and the quantum critical behavior is\nobserved. These results suggest that MnP is an unconventional superconductor in\nwhich magnetic fluctuations may be relevant to the superconducting pairing\nmechanism. In order to elucidate the magnetic ground state adjacent to the\nsuperconducting phase first discovered in Mn-based materials, high-pressure\nneutron diffraction measurements have been performed in hydrostatic pressure up\nto 7.5 GPa. The helical magnetic structure with the propagation vector along\nthe $b$ axis, reported previously at 3.8 GPa, was found to be robust up to 7.5\nGPa. First principles and classical Monte Carlo calculations have also been\nperformed to understand how the pressure-driven magnetic phase transitions are\ncoupled with change of the exchange interactions. The calculations, which\nqualitatively reproduce the magnetic structures as a function of pressure,\nsuggest that the exchange interactions change drastically with applied pressure\nand the further-neighbor interactions become more influential at high\npressures. Combining the experimental and theoretical results, we describe the\ndetail of exchange interactions in the vicinity of the superconducting phase\nwhich is critical to understand the pairing mechanism of the unconventional\nsuperconductivity in MnP.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 18:59:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dissanayake","S. E.",""],["Matsuda","M.",""],["Yoshimi","K.",""],["Kasamatsu","S.",""],["Ye","F.",""],["Chi","S.",""],["Steinhardt","W.",""],["Fabbris","G.",""],["Haravifard","S.",""],["Cheng","J. -G.",""],["Yan","J. -Q.",""],["Gouchi","J.",""],["Uwatoko","Y.",""]]}
{"id":"2308.13635","submitter":"Nir Gadish","authors":"Nir Gadish","title":"Letter-braiding: a universal bridge between combinatorial group theory\n  and topology","comments":"56 pages with references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.AT math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We define invariants of words in arbitrary groups, measuring how letters in a\nword are interleaving, perfectly detecting the dimension series of a group.\nThese are the letter-braiding invariants. On free groups, braiding invariants\ncoincide with coefficients in the Magnus expansion. In contrast with such\ncoefficients, our invariants are defined on all groups and over any PID. They\nrespect products in the group and are complete with respect to the dimension\nseries, so serve as the coefficients of a universal multiplicative finite-type\ninvariant, depending functorially on the group.\n  Letter-braiding invariants arise out of analyzing the bar construction on a\ncochain model of a space with a prescribed fundamental group. This approach\nspecializes to simplicial presentations of a group as well as to more geometric\ncontexts, which we illustrate.\n  As an application, we define a Johnson style filtration and a Johnson\nhomomorphism on the automorphisms of any group.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:04:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gadish","Nir",""]]}
{"id":"2308.13636","submitter":"Rajat Panda","authors":"Rajat K. Panda, Roberto Verdel, Alex Rodriguez, Hanlin Sun, Ginestra\n  Bianconi and Marcello Dalmonte","title":"Non-parametric learning critical behavior in Ising partition functions:\n  PCA entropy and intrinsic dimension","comments":"Corrected affiliation information","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn physics.data-an","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide and critically analyze a framework to learn critical behavior in\nclassical partition functions through the application of non-parametric methods\nto data sets of thermal configurations. We illustrate our approach in phase\ntransitions in 2D and 3D Ising models. First, we extend previous studies on the\nintrinsic dimension of 2D partition function data sets, by exploring the effect\nof volume in 3D Ising data. We find that as opposed to 2D systems for which\nthis quantity has been successfully used in unsupervised characterizations of\ncritical phenomena, in the 3D case its estimation is far more challenging. To\ncircumvent this limitation, we then use the principal component analysis (PCA)\nentropy, a \"Shannon entropy\" of the normalized spectrum of the covariance\nmatrix. We find a striking qualitative similarity to the thermodynamic entropy,\nwhich the PCA entropy approaches asymptotically. The latter allows us to\nextract -- through a conventional finite-size scaling analysis with modest\nlattice sizes -- the critical temperature with less than $1\\%$ error for both\n2D and 3D models while being computationally efficient. The PCA entropy can\nreadily be applied to characterize correlations and critical phenomena in a\nhuge variety of many-body problems and suggests a (direct) link between\neasy-to-compute quantities and entropies.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:06:22 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:37:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Panda","Rajat K.",""],["Verdel","Roberto",""],["Rodriguez","Alex",""],["Sun","Hanlin",""],["Bianconi","Ginestra",""],["Dalmonte","Marcello",""]]}
{"id":"2308.13637","submitter":"Stephen Wu","authors":"Wenhui Hou, Ahmad Azizimanesh, Aditya Dey, Yufeng Yang, Wuxiucheng\n  Wang, Chen Shao, Hui Wu, Hesam Askari, Sobhit Singh, Stephen M. Wu","title":"Strain Engineering for High-Performance Phase Change Memristors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A new mechanism for memristive switching in 2D materials is through\nelectric-field controllable electronic/structural phase transitions, but these\ndevices have not outperformed status quo 2D memristors. Here, we report a\nhigh-performance bipolar phase change memristor from strain engineered\nmultilayer 1T'-MoTe$_{2}$ that now surpasses the performance metrics (on/off\nratio, switching voltage, switching speed) of all 2D memristive devices,\nachieved without forming steps. Using process-induced strain engineering, we\ndirectly pattern stressed metallic contacts to induce a semimetallic to\nsemiconducting phase transition in MoTe2 forming a self-aligned vertical\ntransport memristor with semiconducting MoTe$_{2}$ as the active region. These\ndevices utilize strain to bring them closer to the phase transition boundary\nand achieve ultra-low ~90 mV switching voltage, ultra-high ~10$^8$ on/off\nratio, 5 ns switching, and retention of over 10$^5$ s. Engineered tunability of\nthe device switching voltage and on/off ratio is also achieved by varying the\nsingle process parameter of contact metal film force (film stress $\\times$ film\nthickness).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:09:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hou","Wenhui",""],["Azizimanesh","Ahmad",""],["Dey","Aditya",""],["Yang","Yufeng",""],["Wang","Wuxiucheng",""],["Shao","Chen",""],["Wu","Hui",""],["Askari","Hesam",""],["Singh","Sobhit",""],["Wu","Stephen M.",""]]}
{"id":"2308.13638","submitter":"John Bally","authors":"John Bally and Bo Reipurth","title":"HH 80/81: Structure and Kinematics of the Fastest Protostellar Outflow","comments":"42 pages, 26 Figures. To be published in The Astrophysical Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hubble Space Telescope images obtained in 2018 are combined with archival HST\ndata taken in 1995 to detect changes and measure proper motions in the HH 80/81\nshock complex which is powered by the fastest known jet driven by a forming\nstar, the massive object IRAS 18162-2048. Some persistent features close to the\nradio jet axis have proper motions grater than 1,000 km/s away from IRAS\n18162-2048. About 3 to 5 parsecs downstream from the IRAS source and beyond HH\n80/81, H-alpha emission traces the rim of a parsec-scale bubble blown by the\njet. Lower speed motions are seen in [Sii] away from the jet axis; these\nfeatures have a large component of motion at right-angles to the jet. We\nidentify new HH objects and H2 shocks in the counterflow opposite HH 80/81. The\nnortheastern counterflow to HH 80/81 exhibits an extended but faint complex of\n2.12 um H2 shocks. The inner portion of the outflow is traced by dim 1.64 um\n[Feii] emission. The full extent of this outflow is at least 1,500\" (about 10\npc in projection at a distance of 1.4 kpc). We speculate about the conditions\nresponsible for the production of the ultra-fast jet and the absence of\nprominent large-scale molecular outflow lobes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:11:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bally","John",""],["Reipurth","Bo",""]]}
{"id":"2308.13639","submitter":"J\\'an Karab\\'a\\v{s}","authors":"J\\'an Karab\\'a\\v{s} and Edita M\\'a\\v{c}ajov\\'a and Roman Nedela and\n  Martin \\v{S}koviera","title":"Cubic graphs with colouring defect 3","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The colouring defect of a cubic graph is the smallest number of edges left\nuncovered by any set of three perfect matchings. While $3$-edge-colourable\ngraphs have defect $0$, those that cannot be $3$-edge-coloured (that is,\nsnarks) are known to have defect at least $3$. In this paper we focus on the\nstructure and properties of snarks with defect $3$. For such snarks we develop\na theory of reductions similar to standard reductions of short cycles and small\ncuts in general snarks. We prove that every snark with defect $3$ can be\nreduced to a snark with defect $3$ which is either nontrivial (cyclically\n$4$-edge-connected and of girth at least $5$) or to one that arises from a\nnontrivial snark of defect greater than $3$ by inflating a vertex lying on a\nsuitable $5$-cycle to a triangle. The proofs rely on a detailed analysis of\nFano flows associated with triples of perfect matchings leaving exactly three\nuncovered edges. In the final part of the paper we discuss application of our\nresults to the conjectures of Berge and Fulkerson, which provide the main\nmotivation for our research.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:17:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Karab\u00e1\u0161","J\u00e1n",""],["M\u00e1\u010dajov\u00e1","Edita",""],["Nedela","Roman",""],["\u0160koviera","Martin",""]]}
{"id":"2308.13640","submitter":"Soukaina Zayat","authors":"Darine Al-Mniny and Soukaina Zayat","title":"About subdivisions of four blocks cycles $C(k_1,1,k_3,1)$ in digraphs\n  with large chromatic number","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A cycle with four blocks $C(k_{1}, k_{2},k_{3},k_{4})$ is an oriented cycle\nformed of four blocks of lengths $k_{1}, k_{2}, k_{3}$ and $k_{4}$\nrespectively. Recently, Cohen et al. conjectured that for every positive\nintegers $k_{1}, k_{2}, k_{3}, k_{4}$, there is an integer\n$g(k_{1},k_{2},k_{3},k_{4})$ such that every strongly connected digraph $D$\ncontaining no subdivisions of $C(k_{1},k_{2},k_{3},k_{4})$ has a chromatic\nnumber at most $g(k_{1},k_{2},k_{3},k_{4})$. This conjecture is confirmed by\nCohen et al. for the case of $C(1,1,1,1)$ and by Al-Mniny for the case of\n$C(k_1,1,1,1)$. In this paper, we affirm Cohen et al.'s conjecture for the case\nwhere $k_2=k_4=1$, namely $g(k_1,1,k_3,1) =O({(k_1+k_3)}^2)$. Moreover, we show\nthat if in addition $D$ is Hamiltonian, then the chromatic number of $D$ is at\nmost $6k$, with $k=\\textrm{max}\\{k_1,k_3\\}.$\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:20:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Al-Mniny","Darine",""],["Zayat","Soukaina",""]]}
{"id":"2308.13641","submitter":"Wentao Wu","authors":"Tarique Siddiqui, Wentao Wu","title":"ML-Powered Index Tuning: An Overview of Recent Progress and Open\n  Challenges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The scale and complexity of workloads in modern cloud services have brought\ninto sharper focus a critical challenge in automated index tuning -- the need\nto recommend high-quality indexes while maintaining index tuning scalability.\nThis challenge is further compounded by the requirement for automated index\nimplementations to introduce minimal query performance regressions in\nproduction deployments, representing a significant barrier to achieving\nscalability and full automation. This paper directs attention to these\nchallenges within automated index tuning and explores ways in which machine\nlearning (ML) techniques provide new opportunities in their mitigation. In\nparticular, we reflect on recent efforts in developing ML techniques for\nworkload selection, candidate index filtering, speeding up index configuration\nsearch, reducing the amount of query optimizer calls, and lowering the chances\nof performance regressions. We highlight the key takeaways from these efforts\nand underline the gaps that need to be closed for their effective functioning\nwithin the traditional index tuning framework. Additionally, we present a\npreliminary cross-platform design aimed at democratizing index tuning across\nmultiple SQL-like systems -- an imperative in today's continuously expanding\ndata system landscape. We believe our findings will help provide context and\nimpetus to the research and development efforts in automated index tuning.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:20:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Siddiqui","Tarique",""],["Wu","Wentao",""]]}
{"id":"2308.13642","submitter":"Aswath Babu H","authors":"Naman S, Gaurang B, Neel S, and Aswath Babu H","title":"The Potential of Quantum Techniques for Stock Price Prediction","comments":"RASSE2023 IEEE","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explored the potential applications of various Quantum Algorithms for\nstock price prediction by conducting a series of experimental simulations using\nboth Classical as well as Quantum Hardware. Firstly, we extracted various stock\nprice indicators, such as Moving Averages (MA), Average True Range (ATR), and\nAroon, to gain insights into market trends and stock price movements. Next, we\nemployed Quantum Annealing (QA) for feature selection and Principal Component\nAnalysis (PCA) for dimensionality reduction. Further, we transformed the stock\nprice prediction task essentially into a classification problem. We trained the\nQuantum Support Vector Machine (QSVM) to predict price movements (whether up or\ndown) contrasted their performance with classical models and analyzed their\naccuracy on a dataset formulated using Quantum Annealing and PCA individually.\nWe focused on the stock price prediction and binary classification of stock\nprices for four different companies, namely Apple, Visa, Johnson and Jonson,\nand Honeywell. We primarily used the real-time stock data of the raw stock\nprices of these companies. We compared various Quantum Computing techniques\nwith their classical counterparts in terms of accuracy and F-score of the\nprediction model. Through these experimental simulations, we shed light on the\npotential advantages and limitations of Quantum Algorithms in stock price\nprediction and contribute to the growing body of knowledge at the intersection\nof Quantum Computing and Finance.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:26:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["S","Naman",""],["B","Gaurang",""],["S","Neel",""],["H","Aswath Babu",""]]}
{"id":"2308.13643","submitter":"Arnab Laha","authors":"Arnab Laha, Adam Miranowicz, R. K. Varshney, and Somnath Ghosh","title":"Correlated Nonreciprocity around Conjugate Exceptional Points","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The occurrence of exceptional points (EPs) is a fascinating non-Hermitian\nfeature of open systems. A level-repulsion phenomenon between two complex\nstates of an open system can be realized by positioning an EP and its\ntime-reversal (T) conjugate pair in the underlying parameter space. Here, we\nreport the fascinating nonreciprocal response of such two conjugate EPs by\nusing a dual-mode planar waveguide system having two T-symmetric active\nvariants concerning the transverse gain-loss profiles. We specifically reveal a\ncomprehensive all-optical scheme to achieve correlative nonreciprocal light\ndynamics by using the reverse chirality of two dynamically encircled conjugate\nEPs in the presence of local nonlinearity. A specific nonreciprocal correlation\nbetween two designed T-symmetric waveguide variants is established in terms of\ntheir unidirectional transfer of light with a precise selection of modes. Here,\nthe unconventional reverse chiral properties of two conjugate EPs allow the\nnonreciprocal transmission of two selective modes in the opposite directions of\nthe underlying waveguide variants. An explicit dependence of the nonlinearity\nlevel on a significant enhancement of the nonreciprocity in terms of an\nisolation ratio is explored by investigating the effects of both local\nKerr-type and saturable nonlinearities (considered separately). The physical\ninsights and implications of harnessing the properties of conjugate EPs in\nnonlinear optical systems can enable the growth and development of a versatile\nplatform for building nonreciprocal components and devices.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:27:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Laha","Arnab",""],["Miranowicz","Adam",""],["Varshney","R. K.",""],["Ghosh","Somnath",""]]}
{"id":"2308.13644","submitter":"Kaushik Dayal","authors":"Janel Chua, Mina Karimi, Patrick Kozlowski, Mehrdad Massoudi, Santosh\n  Narasimhachary, Kai Kadau, George Gazonas, Kaushik Dayal","title":"Deformation Decomposition versus Energy Decomposition for Chemo- and\n  Poro- Mechanics","comments":null,"journal-ref":"Journal of Applied Mechanics, Vol. 91, 014501, 2024","doi":"10.1115/1.4062967","report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We briefly compare the structure of two classes of popular models used to\ndescribe poro- and chemo- mechanics wherein a fluid phase is transported within\na solid phase. The multiplicative deformation decomposition has been\nsuccessfully used to model permanent inelastic shape change in plasticity,\nsolid-solid phase transformation, and thermal expansion, which has motivated\nits application to poro- and chemo- mechanics. However, the energetic\ndecomposition provides a more transparent structure and advantages, such as to\ncouple to phase-field fracture, for models of poro- and chemo- mechanics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:33:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chua","Janel",""],["Karimi","Mina",""],["Kozlowski","Patrick",""],["Massoudi","Mehrdad",""],["Narasimhachary","Santosh",""],["Kadau","Kai",""],["Gazonas","George",""],["Dayal","Kaushik",""]]}
{"id":"2308.13645","submitter":"Vincent Dumoulin","authors":"Vincent Dumoulin, Wenjing Rao, and Natasha Devroye","title":"Active learning for fast and slow modeling attacks on Arbiter PUFs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modeling attacks, in which an adversary uses machine learning techniques to\nmodel a hardware-based Physically Unclonable Function (PUF) pose a great threat\nto the viability of these hardware security primitives. In most modeling\nattacks, a random subset of challenge-response-pairs (CRPs) are used as the\nlabeled data for the machine learning algorithm. Here, for the arbiter-PUF, a\ndelay based PUF which may be viewed as a linear threshold function with random\nweights (due to manufacturing imperfections), we investigate the role of active\nlearning in Support Vector Machine (SVM) learning. We focus on challenge\nselection to help SVM algorithm learn ``fast'' and learn ``slow''. Our methods\nconstruct challenges rather than relying on a sample pool of challenges as in\nprior work. Using active learning to learn ``fast'' (less CRPs revealed, higher\naccuracies) may help manufacturers learn the manufactured PUFs more\nefficiently, or may form a more powerful attack when the attacker may query the\nPUF for CRPs at will. Using active learning to select challenges from which\nlearning is ``slow'' (low accuracy despite a large number of revealed CRPs) may\nprovide a basis for slowing down attackers who are limited to overhearing CRPs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:34:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dumoulin","Vincent",""],["Rao","Wenjing",""],["Devroye","Natasha",""]]}
{"id":"2308.13646","submitter":"Md Yousuf Harun","authors":"Md Yousuf Harun, Jhair Gallardo, Christopher Kanan","title":"GRASP: A Rehearsal Policy for Efficient Online Continual Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual learning (CL) in deep neural networks (DNNs) involves incrementally\naccumulating knowledge in a DNN from a growing data stream. A major challenge\nin CL is that non-stationary data streams cause catastrophic forgetting of\npreviously learned abilities. Rehearsal is a popular and effective way to\nmitigate this problem, which is storing past observations in a buffer and\nmixing them with new observations during learning. This leads to a question:\nWhich stored samples should be selected for rehearsal? Choosing samples that\nare best for learning, rather than simply selecting them at random, could lead\nto significantly faster learning. For class incremental learning, prior work\nhas shown that a simple class balanced random selection policy outperforms more\nsophisticated methods. Here, we revisit this question by exploring a new sample\nselection policy called GRASP. GRASP selects the most prototypical (class\nrepresentative) samples first and then gradually selects less prototypical\n(harder) examples to update the DNN. GRASP has little additional compute or\nmemory overhead compared to uniform selection, enabling it to scale to large\ndatasets. We evaluate GRASP and other policies by conducting CL experiments on\nthe large-scale ImageNet-1K and Places-LT image classification datasets. GRASP\noutperforms all other rehearsal policies. Beyond vision, we also demonstrate\nthat GRASP is effective for CL on five text classification datasets.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:34:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Harun","Md Yousuf",""],["Gallardo","Jhair",""],["Kanan","Christopher",""]]}
{"id":"2308.13647","submitter":"Dimitra Koutroumpa","authors":"Dimitra Koutroumpa","title":"Solar wind ion charge state distributions and compound cross sections\n  for solar wind charge exchange X-ray emission","comments":"Accepted for publication in the Earth and Planetary Physics - SMILE\n  Special Issue","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Solar Wind Charge eXchange X-ray (SWCX) emission in the heliosphere and\nEarth's exosphere is a hard to avoid signal in soft X-ray observations of\nastrophysical targets. On the other hand, the X-ray imaging possibilities\noffered by the SWCX process has led to an increasing number of future dedicated\nspace missions for investigating the solar wind-terrestrial interactions and\nmagnetospheric interfaces. In both cases, accurate modelling of the SWCX\nemission is key to correctly interpret its signal, and remove it from\nobservations, when needed. In this paper, we compile solar wind abundance\nmeasurements from ACE for different solar wind types, and atomic data from\nliterature, including charge exchange cross-sections and emission\nprobabilities, used for calculating the compound cross-section $\\alpha$ for the\nSWCX X-ray emission. We calculate $\\alpha$ values for charge-exchange with H\nand He, relevant to soft X-ray energy bands (0.1 - 2.0 keV) for various solar\nwind types and solar cycle conditions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:35:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Koutroumpa","Dimitra",""]]}
{"id":"2308.13648","submitter":"Snigdaa Sethuram","authors":"Snigdaa S. Sethuram, Rachel K. Cochrane, Christopher C. Hayward,\n  Viviana Acquaviva, Francisco Villaescusa-Navarro, Gergo Popping, John H. Wise","title":"Emulating Radiative Transfer with Artificial Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Forward-modeling observables from galaxy simulations enables direct\ncomparisons between theory and observations. To generate synthetic spectral\nenergy distributions (SEDs) that include dust absorption, re-emission, and\nscattering, Monte Carlo radiative transfer is often used in post-processing on\na galaxy-by-galaxy basis. However, this is computationally expensive,\nespecially if one wants to make predictions for suites of many cosmological\nsimulations. To alleviate this computational burden, we have developed a\nradiative transfer emulator using an artificial neural network (ANN),\nANNgelina, that can reliably predict SEDs of simulated galaxies using a small\nnumber of integrated properties of the simulated galaxies: star formation rate,\nstellar and dust masses, and mass-weighted metallicities of all star particles\nand of only star particles with age <10 Myr. Here, we present the methodology\nand quantify the accuracy of the predictions. We train the ANN on SEDs computed\nfor galaxies from the IllustrisTNG project's TNG50 cosmological\nmagnetohydrodynamical simulation. ANNgelina is able to predict the SEDs of\nTNG50 galaxies in the ultraviolet (UV) to millimetre regime with a typical\nmedian absolute error of ~7 per cent. The prediction error is the greatest in\nthe UV, possibly due to the viewing-angle dependence being greatest in this\nwavelength regime. Our results demonstrate that our ANN-based emulator is a\npromising computationally inexpensive alternative for forward-modeling galaxy\nSEDs from cosmological simulations.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:35:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sethuram","Snigdaa S.",""],["Cochrane","Rachel K.",""],["Hayward","Christopher C.",""],["Acquaviva","Viviana",""],["Villaescusa-Navarro","Francisco",""],["Popping","Gergo",""],["Wise","John H.",""]]}
{"id":"2308.13649","submitter":"Yuli Wang","authors":"Yuli Wang, Peiyu Duan, Zhangxing Bian, Anqi Feng, Yuan Xue","title":"Efficient Annotation for Medical Image Analysis: A One-Pass Selective\n  Annotation Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Annotating biomedical images for supervised learning is a complex and\nlabor-intensive task due to data diversity and its intricate nature. In this\npaper, we propose an innovative method, the efficient one-pass selective\nannotation (EPOSA), that significantly reduces the annotation burden while\nmaintaining robust model performance. Our approach employs a variational\nautoencoder (VAE) to extract salient features from unannotated images, which\nare subsequently clustered using the DBSCAN algorithm. This process groups\nsimilar images together, forming distinct clusters. We then use a two-stage\nsample selection algorithm, called representative selection (RepSel), to form a\nselected dataset. The first stage is a Markov Chain Monte Carlo (MCMC) sampling\ntechnique to select representative samples from each cluster for annotations.\nThis selection process is the second stage, which is guided by the principle of\nmaximizing intra-cluster mutual information and minimizing inter-cluster mutual\ninformation. This ensures a diverse set of features for model training and\nminimizes outlier inclusion. The selected samples are used to train a VGG-16\nnetwork for image classification. Experimental results on the Med-MNIST dataset\ndemonstrate that our proposed EPOSA outperforms random selection and other\nstate-of-the-art methods under the same annotation budget, presenting a\npromising direction for efficient and effective annotation in medical image\nanalysis.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:37:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yuli",""],["Duan","Peiyu",""],["Bian","Zhangxing",""],["Feng","Anqi",""],["Xue","Yuan",""]]}
{"id":"2308.13650","submitter":"Alan Legg","authors":"Alan R. Legg","title":"Ellipses and Polynomial-to-Polynomial Mapping of Weighted Szego\n  Projections","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We take a look at weighted Szego projections on ellipses and ellipsoids in\nlight of some known results of real and complex potential theory. We show that\non planar ellipses there is a weighted Szego projection taking polynomials to\npolynomials without increasing degree.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:37:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Legg","Alan R.",""]]}
{"id":"2308.13651","submitter":"Giang Nguyen","authors":"Giang Nguyen, Valerie Chen, Anh Nguyen","title":"AdvisingNets: Learning to Distinguish Correct and Wrong Classifications\n  via Nearest-Neighbor Explanations","comments":"Under Review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Besides providing insights into how an image classifier makes its\npredictions, nearest-neighbor examples also help humans make more accurate\ndecisions. Yet, leveraging this type of explanation to improve both human-AI\nteam accuracy and classifier's accuracy remains an open question. In this\npaper, we aim to increase both types of accuracy by (1) comparing the input\nimage with post-hoc, nearest-neighbor explanations using a novel network\n(AdvisingNet), and (2) employing a new reranking algorithm. Over different\nbaseline models, our method consistently improves the image classification\naccuracy on CUB-200 and Cars-196 datasets. Interestingly, we also reach the\nstate-of-the-art human-AI team accuracy on CUB-200 where both humans and an\nAdvisingNet make decisions on complementary subsets of images.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:40:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen","Giang",""],["Chen","Valerie",""],["Nguyen","Anh",""]]}
{"id":"2308.13652","submitter":"Howard Cohl","authors":"Howard S. Cohl and Roberto S. Costas-Santos","title":"Multi-integral representations for Jacobi functions of the first and\n  second kind","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  One may consider the generalization of Jacobi polynomials and the Jacobi\nfunction of the second kind to a general function where the index is allowed to\nbe a complex number instead of a non-negative integer. These functions are\nreferred to as Jacobi functions. In a similar fashion as associated Legendre\nfunctions, these break into two categories, functions which are analytically\ncontinued from the real line segment $(-1,1)$ and those continued from the real\nray $(1, \\infty)$. Using properties of Gauss hypergeometric functions, we\nderive multi-derivative and multi-integral representations for the Jacobi\nfunctions of the first and second kind.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:51:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cohl","Howard S.",""],["Costas-Santos","Roberto S.",""]]}
{"id":"2308.13653","submitter":"Francesco Caravelli","authors":"Francesco Caravelli and Yen Ting Lin","title":"On the combinatorics of Lotka-Volterra equations","comments":"27 single column pages+epsilon, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech math-ph math.CO math.MP nlin.AO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study an approach to obtaining the exact formal solution of the 2-species\nLotka-Volterra equation based on combinatorics and generating functions. By\nemploying a combination of Carleman linearization and Mori-Zwanzig reduction\ntechniques, we transform the nonlinear equations into a linear system, allowing\nfor the derivation of a formal solution. The Mori-Zwanzig reduction reduces to\nan expansion which we show can be interpreted as a directed and weighted\nlattice path walk, which we use to obtain a representation of the system\ndynamics as walks of fixed length. The exact solution is then shown to be\ndependent on the generator of weighted walks. We show that the generator can be\nobtained by the solution of PDE which in turn is equivalent to a particular\nKoopman evolution of nonlinear observables.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:52:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Caravelli","Francesco",""],["Lin","Yen Ting",""]]}
{"id":"2308.13654","submitter":"Felipe Montealegre-Mora","authors":"Felipe Montealegre-Mora, Marcus Lapeyrolerie, Melissa Chapman, Abigail\n  G. Keller, Carl Boettiger","title":"Pretty darn good control: when are approximate solutions better than\n  approximate models","comments":"24 pages, 14 figures. Accepted to the Bulletin of Mathematical\n  Biology","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing methods for optimal control struggle to deal with the complexity\ncommonly encountered in real-world systems, including dimensionality, process\nerror, model bias and data heterogeneity. Instead of tackling these system\ncomplexities directly, researchers have typically sought to simplify models to\nfit optimal control methods. But when is the optimal solution to an\napproximate, stylized model better than an approximate solution to a more\naccurate model? While this question has largely gone unanswered owing to the\ndifficulty of finding even approximate solutions for complex models, recent\nalgorithmic and computational advances in deep reinforcement learning (DRL)\nmight finally allow us to address these questions. DRL methods have to date\nbeen applied primarily in the context of games or robotic mechanics, which\noperate under precisely known rules. Here, we demonstrate the ability for DRL\nalgorithms using deep neural networks to successfully approximate solutions\n(the \"policy function\" or control rule) in a non-linear three-variable model\nfor a fishery without knowing or ever attempting to infer a model for the\nprocess itself. We find that the reinforcement learning agent discovers an\neffective simplification of the problem to obtain an interpretable control\nrule. We show that the policy obtained with DRL is both more profitable and\nmore sustainable than any constant mortality policy -- the standard family of\npolicies considered in fishery management.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 19:58:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Montealegre-Mora","Felipe",""],["Lapeyrolerie","Marcus",""],["Chapman","Melissa",""],["Keller","Abigail G.",""],["Boettiger","Carl",""]]}
{"id":"2308.13655","submitter":"Diksha Garg","authors":"Diksha Garg, Mary Hall Reno","title":"Atmospheric muon fluxes at sub-orbital neutrino detectors","comments":"8 pages, 6 figures, Proceedings for International Cosmic Ray\n  Conference (ICRC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Very-high-energy and ultra-high-energy neutrinos are messengers of energetic\nsources in the universe. Sub-orbital and satellite-based neutrino telescopes\nemploy detectors of the atmospheric Cherenkov emission from extensive air\nshowers (EASs) generated by charged particles. These Cherenkov detectors can be\npointed below or above the Earth's limb. Cherenkov emissions produced from\ndirections below the limb are from upward-going EASs produced in the atmosphere\nsourced by Earth-skimming neutrinos. When the Cherenkov telescope is pointed\nslightly above the Earth's limb, signals from EASs are initiated by cosmic ray\ninteractions in the atmosphere. For sub-orbital detectors, muons produced from\ncosmic rays in the atmosphere can directly hit the Cherenkov telescope. Using a\nsemi-analytic technique with cascade equations for atmospheric particle fluxes,\nwe quantify the atmospheric muon flux that reaches sub-orbital telescopes like\nExtreme Universe Space Observatory Super Pressure Balloon 2 (EUSO-SPB2). We\nassess this potential background to the EAS signals. The calculation technique\nmay also provide an understanding of the evolution of the muon content in\nindividual EAS.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:01:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Garg","Diksha",""],["Reno","Mary Hall",""]]}
{"id":"2308.13656","submitter":"Alexei Rybkin","authors":"Alexei Rybkin","title":"Trace formulas revisited and a new representation of KdV solutions with\n  short-range initial data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.MP","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We put forward a new approach to Deift-Trubowitz type trace formulas for the\n1D Schrodinger operator with potentials that are summable with the first moment\n(short-range potentials). We prove that these formulas are preserved under the\nKdV flow whereas the class of short-range potentials is not. Finally, we show\nthat our formulas are well-suited to study the dispersive smoothing effect.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:05:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rybkin","Alexei",""]]}
{"id":"2308.13657","submitter":"James Worrell","authors":"Florian Luca, Joel Ouaknine, James Worrell","title":"Transcendence of Sturmian Numbers over an Algebraic Base","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider numbers of the form\n  $S_\\beta(\\boldsymbol{u}):=\\sum_{n=0}^\\infty \\frac{u_n}{\\beta^n}$ for\n  $\\boldsymbol{u}=\\langle u_n \\rangle_{n=0}^\\infty$ a Sturmian\n  sequence over a binary alphabet and $\\beta$ an algebraic number with\n  $|\\beta|>1$. We show that every such number is transcendental.\n  More generally, for a given base~$\\beta$ and given irrational\n  number~$\\theta$ we characterise the\n  $\\overline{\\mathbb{Q}}$-linear independence of sets of the form\n  $\\left\\{ 1,\n  S_\\beta(\\boldsymbol{u}^{(1)}),\\ldots,S_\\beta(\\boldsymbol{u}^{(k)})\n  \\right\\}$, where $\\boldsymbol{u}^{(1)},\\ldots,\\boldsymbol{u}^{(k)}$ are\n  Sturmian sequences having slope $\\theta$.\n  We give an application of our main result to the theory of dynamical\n  systems, showing that for a contracted rotation on the unit circle\n  with algebraic slope, its limit set is either finite or consists\n  exclusively of transcendental elements other than its endpoints $0$\n  and $1$. This confirms a conjecture of Bugeaud, Kim, Laurent, and\n  Nogueira.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:12:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luca","Florian",""],["Ouaknine","Joel",""],["Worrell","James",""]]}
{"id":"2308.13658","submitter":"Rhys Howard","authors":"Enrik Maci, Rhys Howard, Lars Kunze","title":"Generating and Explaining Corner Cases Using Learnt Probabilistic Lane\n  Graphs","comments":"8 Pages, 3 Figures, 1 Table, To be published in the Proceedings of\n  the 26th IEEE International Conference on Intelligent Transport Systems\n  (2023), Adjusted final submission version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Validating the safety of Autonomous Vehicles (AVs) operating in open-ended,\ndynamic environments is challenging as vehicles will eventually encounter\nsafety-critical situations for which there is not representative training data.\nBy increasing the coverage of different road and traffic conditions and by\nincluding corner cases in simulation-based scenario testing, the safety of AVs\ncan be improved. However, the creation of corner case scenarios including\nmultiple agents is non-trivial. Our approach allows engineers to generate\nnovel, realistic corner cases based on historic traffic data and to explain why\nsituations were safety-critical. In this paper, we introduce Probabilistic Lane\nGraphs (PLGs) to describe a finite set of lane positions and directions in\nwhich vehicles might travel. The structure of PLGs is learnt directly from\nspatio-temporal traffic data. The graph model represents the actions of the\ndrivers in response to a given state in the form of a probabilistic policy. We\nuse reinforcement learning techniques to modify this policy and to generate\nrealistic and explainable corner case scenarios which can be used for assessing\nthe safety of AVs.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:17:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Maci","Enrik",""],["Howard","Rhys",""],["Kunze","Lars",""]]}
{"id":"2308.13659","submitter":"Diksha Garg","authors":"Diksha Garg, Mary Hall Reno, Sameer Patel, Alexander Ruestle, Yosui\n  Akaike, Luis A. Anchordoqui, Douglas R. Bergman, Isaac Buckland, Austin L.\n  Cummings, Johannes Eser, Fred Garcia, Claire Gu\\'epin, Tobias Heibges, Andrew\n  Ludwig, John F. Krizmanic, Simon Mackovjak, Eric Mayotte, Sonja Mayotte,\n  Angela V. Olinto, Thomas C. Paul, Andr\\'es Romero-Wolf, Fr\\'ed\\'eric Sarazin,\n  Tonia M. Venters, Lawrence Wiencke, Stephanie Wissel","title":"Neutrino propagation through Earth: modeling uncertainties using\n  nuPyProp","comments":"9 pages, 6 figures, Proceedings for International Cosmic Ray\n  Conference (ICRC) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Using the Earth as a neutrino converter, tau neutrino fluxes from\nastrophysical point sources can be detected by tau-lepton-induced extensive air\nshowers (EASs). Both muon neutrino and tau neutrino induced upward-going EAS\nsignals can be detected by terrestrial, sub-orbital and satellite-based\ninstruments. The sensitivity of these neutrino telescopes can be evaluated with\nthe nuSpaceSim package, which includes the nuPyProp simulation package. The\nnuPyProp package propagates neutrinos ($\\nu_\\mu$, $\\nu_\\tau$) through the Earth\nto produce the corresponding charged leptons (muons and tau-leptons). We use\nnuPyProp to quantify the uncertainties from Earth density models, tau\ndepolarization effects and photo-nuclear electromagnetic energy loss models in\nthe charged lepton exit probabilities and their spectra. The largest\nuncertainties come from electromagnetic energy loss modeling, with as much as a\n20-50% difference between the models. We compare nuPyProp results with other\nsimulation package results.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:21:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Garg","Diksha",""],["Reno","Mary Hall",""],["Patel","Sameer",""],["Ruestle","Alexander",""],["Akaike","Yosui",""],["Anchordoqui","Luis A.",""],["Bergman","Douglas R.",""],["Buckland","Isaac",""],["Cummings","Austin L.",""],["Eser","Johannes",""],["Garcia","Fred",""],["Gu\u00e9pin","Claire",""],["Heibges","Tobias",""],["Ludwig","Andrew",""],["Krizmanic","John F.",""],["Mackovjak","Simon",""],["Mayotte","Eric",""],["Mayotte","Sonja",""],["Olinto","Angela V.",""],["Paul","Thomas C.",""],["Romero-Wolf","Andr\u00e9s",""],["Sarazin","Fr\u00e9d\u00e9ric",""],["Venters","Tonia M.",""],["Wiencke","Lawrence",""],["Wissel","Stephanie",""]]}
{"id":"2308.13660","submitter":"Qurrat-Ul-Ain Nadeem","authors":"Omran Abbas, Qurrat-Ul-Ain Nadeem, Lo\\\"ic Markley, and Anas Chaaban","title":"Unit Cell Phase-Frequency Profile Optimization in RIS-Assisted Wide-Band\n  OFDM Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The reflection characteristics of a reconfigurable intelligent surface (RIS)\ndepend on the phase response of the constituent unit cells, which is\nnecessarily frequency dependent. This paper investigates the role of an RIS\nconstituting unit cells with different phase-frequency profiles in a wide-band\northogonal frequency division multiplexing (OFDM) system to improve the\nachievable rate. We first propose a mathematical model for the phase-frequency\nrelationship parametrized by the phase-frequency profile's slope and\nphase-shift corresponding to a realizable resonant RIS unit cell. Then,\nmodelling each RIS element with $b$ control bits, we propose a method for\nselecting the parameter pairs to obtain a set of $2^b$ phase-frequency\nprofiles. The proposed method yields an RIS design that outperforms existing\ndesigns over a wide range of user locations in a single-input, single-output\n(SISO) OFDM system. We then propose a low-complexity optimization algorithm to\nmaximize the data rate through the joint optimization of (a) power allocations\nacross the sub-carriers and (b) phase-frequency profile for each RIS unit cell\nfrom the available set. The analysis is then extended to a multi-user\nmultiple-input single-output (MISO) OFDM scenario. Numerical results show an\nimprovement in the coverage and achievable rates under the proposed framework\nas compared to single-slope phase-frequency profiles.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:23:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Abbas","Omran",""],["Nadeem","Qurrat-Ul-Ain",""],["Markley","Lo\u00efc",""],["Chaaban","Anas",""]]}
{"id":"2308.13661","submitter":"Yao Fu","authors":"Yao Fu, Run Peng, Honglak Lee","title":"Go Beyond Imagination: Maximizing Episodic Reachability with World\n  Models","comments":"Published in the 40th International Conference on Machine Learning","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient exploration is a challenging topic in reinforcement learning,\nespecially for sparse reward tasks. To deal with the reward sparsity, people\ncommonly apply intrinsic rewards to motivate agents to explore the state space\nefficiently. In this paper, we introduce a new intrinsic reward design called\nGoBI - Go Beyond Imagination, which combines the traditional lifelong novelty\nmotivation with an episodic intrinsic reward that is designed to maximize the\nstepwise reachability expansion. More specifically, we apply learned world\nmodels to generate predicted future states with random actions. States with\nmore unique predictions that are not in episodic memory are assigned high\nintrinsic rewards. Our method greatly outperforms previous state-of-the-art\nmethods on 12 of the most challenging Minigrid navigation tasks and improves\nthe sample efficiency on locomotion tasks from DeepMind Control Suite.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:30:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fu","Yao",""],["Peng","Run",""],["Lee","Honglak",""]]}
{"id":"2308.13662","submitter":"Hoda Eldardiry","authors":"Humaid Ahmed Desai, Amr Hilal, Hoda Eldardiry","title":"Resource-Efficient Federated Learning for Heterogenous and\n  Resource-Constrained Environments","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated Learning (FL) is a privacy-enforcing sub-domain of machine learning\nthat brings the model to the user's device for training, avoiding the need to\nshare personal data with a central server. While existing works address data\nheterogeneity, they overlook other challenges in FL, such as device\nheterogeneity and communication efficiency. In this paper, we propose RE-FL, a\nnovel approach that tackles computational and communication challenges in\nresource-constrained devices. Our variable pruning technique optimizes resource\nutilization by adapting pruning to each client's computational capabilities. We\nalso employ knowledge distillation to reduce bandwidth consumption and\ncommunication rounds. Experimental results on image classification tasks\ndemonstrate the effectiveness of our approach in resource-constrained\nenvironments, maintaining data privacy and performance while accommodating\nheterogeneous model architectures.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:33:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Desai","Humaid Ahmed",""],["Hilal","Amr",""],["Eldardiry","Hoda",""]]}
{"id":"2308.13663","submitter":"Paula Mercurio","authors":"Paula Mercurio and Di Liu","title":"Network Embedding Using Sparse Approximations of Random Walks","comments":"20 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose an efficient numerical implementation of Network\nEmbedding based on commute times, using sparse approximation of a diffusion\nprocess on the network obtained by a modified version of the diffusion wavelet\nalgorithm. The node embeddings are computed by optimizing the cross entropy\nloss via the stochastic gradient descent method with sampling of\nlow-dimensional representations of green functions. We demonstrate the efficacy\nof this method for data clustering and multi-label classification through\nseveral examples, and compare its performance over existing methods in terms of\nefficiency and accuracy. Theoretical issues justifying the scheme are also\ndiscussed.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:35:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mercurio","Paula",""],["Liu","Di",""]]}
{"id":"2308.13664","submitter":"Renato Leme","authors":"Renato Leme and Marcelo Coniglio and Bruno Lopes","title":"Intuitionism with Truth Tables: A Decision Procedure for IPC Based on\n  RNMatrix","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper provides a new decision procedure for intuitionistic propositional\nlogic (IPC) based on restricted non-deterministic matrix and proves its\nsoundness and completeness.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:39:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Leme","Renato",""],["Coniglio","Marcelo",""],["Lopes","Bruno",""]]}
{"id":"2308.13665","submitter":"Giacomo Ortali","authors":"Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio\n  Montecchiani, Giacomo Ortali","title":"On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity","comments":"Appears in the Proceedings of the 31st International Symposium on\n  Graph Drawing and Network Visualization (GD 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing planar orthogonal drawings with the minimum number of bends is one\nof the most relevant topics in Graph Drawing. The problem is known to be\nNP-hard, even when we want to test the existence of a rectilinear planar\ndrawing, i.e., an orthogonal drawing without bends (Garg and Tamassia, 2001).\nFrom the parameterized complexity perspective, the problem is fixed-parameter\ntractable when parameterized by the sum of three parameters: the number of\nbends, the number of vertices of degree at most two, and the treewidth of the\ninput graph (Di Giacomo et al., 2022). We improve this last result by showing\nthat the problem remains fixed-parameter tractable when parameterized only by\nthe number of vertices of degree at most two plus the number of bends. As a\nconsequence, rectilinear planarity testing lies in \\FPT~parameterized by the\nnumber of vertices of degree at most two.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:39:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Didimo","Walter",""],["Di Giacomo","Emilio",""],["Liotta","Giuseppe",""],["Montecchiani","Fabrizio",""],["Ortali","Giacomo",""]]}
{"id":"2308.13666","submitter":"Corinne Fletcher","authors":"C. Fletcher, J. Wood, R. Hamburg, P. Veres, C. M. Hui, E. Bissaldi, M.\n  S. Briggs, E. Burns, W. H. Cleveland, M. M. Giles, A. Goldstein, B. A.\n  Hristov, D. Kocevski, S. Lesage, B. Mailyan, C. Malacaria, S. Poolakkil, A.\n  von Kienlin, C. A. Wilson-Hodge, The Fermi Gamma-ray Burst Monitor Team, M.\n  Crnogor\\v{c}evi\\'c, J. DeLaunay, A. Tohuvavohu, R. Caputo, S. B. Cenko, S.\n  Laha, T. Parsotan, R. Abbott, H. Abe, F. Acernese, K. Ackley, N. Adhikari, R.\n  X. Adhikari, V. K. Adkins, V. B. Adya, C. Affeldt, D. Agarwal, M. Agathos, K.\n  Agatsuma, N. Aggarwal, O. D. Aguiar, L. Aiello, A. Ain, P. Ajith, T. Akutsu,\n  S. Albanesi, R. A. Alfaidi, A. Allocca, P. A. Altin, A. Amato, C. Anand, S.\n  Anand, A. Ananyeva, S. B. Anderson, W. G. Anderson, M. Ando, T. Andrade, N.\n  Andres, M. Andr\\'es-Carcasona, T. Andr\\'ic, S. V. Angelova, S. Ansoldi, J. M.\n  Antelis, S. Antier, T. Apostolatos, E. Z. Appavuravther, S. Appert, S. K.\n  Apple, K. Arai, A. Araya, M. C. Araya, J. S. Areeda, M. Ar\\`ene, N. Aritomi,\n  N. Arnaud, M. Arogeti, S. M. Aronson, K. G. Arun, H. Asada, Y. Asali, G.\n  Ashton, Y. Aso, M. Assiduo, S. Assis de Souza Melo, S. M. Aston, P. Astone,\n  F. Aubin, K. AultONeal, C. Austin, S. Babak, F. Badaracco, M. K. M. Bader, C.\n  Badger, S. Bae, Y. Bae, A. M. Baer, S. Bagnasco, Y. Bai, J. Baird, R. Bajpai,\n  T. Baka, M. Ball, G. Ballardin, S. W. Ballmer, A. Balsamo, G. Baltus, S.\n  Banagiri, B. Banerjee, D. Bankar, J. C. Barayoga, C. Barbieri, B. C. Barish,\n  D. Barker, P. Barneo, F. Barone, B. Barr, L. Barsotti, M. Barsuglia, D.\n  Barta, J. Bartlett, M. A. Barton, I. Bartos, S. Basak, R. Bassiri, A. Basti,\n  M. Bawaj, J. C. Bayley, M. Bazzan, B. R. Becher, B. Becsy, V. M. Bedakihale,\n  F. Beirnaert, M. Bejger, I. Belahcene, V. Benedetto, D. Beniwal, M. G.\n  Benjamin, T. F. Bennett, J. D. Bentley, M. BenYaala, S. Bera, M. Berbel, F.\n  Bergamin, B. K. Berger, S. Bernuzzi, C. P. L. Berry, D. Bersanetti, A.\n  Bertolini, J. Betzwieser, D. Beveridge, R. Bhandare, A. V. Bhandari, U.\n  Bhardwaj, R. Bhatt, D. Bhattacharjee, S. Bhaumik, A. Bianchi, I. A. Bilenko,\n  G. Billingsley, S. Bini, R. Birney, O. Birnholtz, S. Biscans, M. Bischi, S.\n  Biscoveanu, A. Bisht, B. Biswas, M. Bitossi, M. A. Bizouard, J. K. Blackburn,\n  C. D. Blair, D. G. Blair, R. M. Blair, F. Bobba, N. Bode, M. Bo\\\"er, G.\n  Bogaert, M. Boldrini, G. N. Bolingbroke, L. D. Bonavena, F. Bondu, E.\n  Bonilla, R. Bonnand, P. Booker, B. A. Boom, R. Bork, V. Boschi, N. Bose, S.\n  Bose, V. Bossilkov, V. Boudart, Y. Bouffanais, A. Bozzi, C. Bradaschia, P. R.\n  Brady, A. Bramley, A. Branch, M. Branchesi, J. E. Brau, M. Breschi, T.\n  Briant, J. H. Briggs, A. Brillet, M. Brinkmann, P. Brockill, A. F. Brooks, J.\n  Brooks, D. D. Brown, S. Brunett, G. Bruno, R. Bruntz, J. Bryant, F. Bucci, T.\n  Bulik, H. J. Bulten, A. Buonanno, K. Burtnyk, R. Buscicchio, D. Buskulic, C.\n  Buy, R. L. Byer, G. S. Cabourn Davies, G. Cabras, R. Cabrita, L. Cadonati, M.\n  Caesar, G. Cagnoli, C. Cahillane, J. Calder\\`on Bustillo, J. D. Callaghan, T.\n  A. Callister, E. Calloni, J. Cameron, J. B. Camp, M. Canepa, S. Canevarolo,\n  M. Cannavacciuolo, K. C. Cannon, H. Cao, Z. Cao, E. Capocasa, E. Capote, G.\n  Carapella, F. Carbognani, M. Carlassara, J. B. Carlin, M. F. Carney, M.\n  Carpinelli, G. Carrillo, G. Carullo, T. L. Carver, J. Casanueva D\\'iaz, C.\n  Casentini, G. Castaldi, S. Caudill, M. Cavagli\\`a, F. Cavalier, R. Cavalieri,\n  G. Cella, P. Cerd\\'a-Dur\\'an, E. Cesarini, W. Chaibi, S. Chalathadka\n  Subrahmanya, E. Champion, C. H. Chan, C. Chan, C. L. Chan, K. Chan, M. Chan,\n  K. Chandra, I. P. Chang, P. Chanial, S. Chao, C. Chapman-Bird, P. Charlton,\n  E. A. Chase, E. Chassande-Mottin, C. Chatterjee, Debarati Chatterjee, Deep\n  Chatterjee, M. Chaturvedi, S. Chaty, C. Chen, D. Chen, H. Y. Chen, J. Chen,\n  K. Chen, X. Chen, Y. B. Chen, Y. R. Chen, Z. Chen, H. Cheng, C. K. Cheong, H.\n  Y. Cheung, H. Y. Chia, F. Chiadini, C. Y. Chiang, G. Chiarini, R. Chierici,\n  A. Chincarini, M. L. Chiofalo, A. Chiummo, R. K. Choudhary, S. Choudhary, N.\n  Christensen, Q. Chu, Y. K. Chu, S. S. Y. Chua, K. W. Chung, G. Ciani, P.\n  Ciecielag, M. Cie\\'slar, M. Cifaldi, A. A. Ciobanu, R. Ciolfi, F. Cipriano,\n  F. Clara, J. A. Clark, P. Clearwater, S. Clesse, F. Cleva, E. Coccia, E.\n  Codazzo, P. F. Cohadon, D. E. Cohen, M. Colleoni, C. G. Collette, A. Colombo,\n  M. Colpi, C. M. Compton, M. Constancio Jr., L. Conti, S. J. Cooper, P.\n  Corban, T. R. Corbitt, I. Cordero-Carri\\'on, S. Corezzi, K. R. Corley, N. J.\n  Cornish, D. Corre, A. Corsi, S. Cortese, C. A. Costa, R. Cotesta, R.\n  Cottingham, M. W. Coughlin, J. P. Coulon, S. T. Countryman, B. Cousins, P.\n  Couvares, D. M. Coward, M. J. Cowart, D. C. Coyne, R. Coyne, J. D. E.\n  Creighton, T. D. Creighton, A. W. Criswell, M. Croquette, S. G. Crowder, J.\n  R. Cudell, T. J. Cullen, A. Cumming, R. Cummings, L. Cunningham, E. Cuoco, M.\n  Cury lo, P. Dabadie, T. Dal Canton, S. Dall'Osso, G. D\\'alya, A. Dana, B.\n  D'Angelo, S. Danilishin, S. D'Antonio, K. Danzmann, C. Darsow-Fromm, A.\n  Dasgupta, L. E. H. Datrier, Sayak Datta, Sayantani Datta, V. Dattilo, I.\n  Dave, M. Davier, D. Davis, M. C. Davis, E. J. Daw, R. Dean, D. DeBra, M.\n  Deenadayalan, J. Degallaix, M. De Laurentis, S. Del\\'eglise, V. Del Favero,\n  F. De Lillo, N. De Lillo, D. Dell'Aquila, W. Del Pozzo, L. M. DeMarchi, F. De\n  Matteis, V. D'Emilio, N. Demos, T. Dent, A. Depasse, R. De Pietri, R. De\n  Rosa, C. De Rossi, R. DeSalvo, R. De Simone, S. Dhurandhar, M. C. D'iaz, N.\n  A. Didio, T. Dietrich, L. Di Fiore, C. Di Fronzo, C. Di Giorgio, F. Di\n  Giovanni, M. Di Giovanni, T. Di Girolamo, A. Di Lieto, A. Di Michele, B.\n  Ding, S. Di Pace, I. Di Palma, F. Di Renzo, A. K. Divakarla, A. Dmitriev, Z.\n  Doctor, L. Donahue, L. D'Onofrio, F. Donovan, K. L. Dooley, S. Doravari, M.\n  Drago, J. C. Driggers, Y. Drori, J. G. Ducoin, P. Dupej, U. Dupletsa, O.\n  Durante, D. D'Urso, P. A. Duverne, S. E. Dwyer, C. Eassa, P. J. Easter, M.\n  Ebersold, T. Eckhardt, G. Eddolls, B. Edelman, T. B. Edo, O. Edy, A. Effler,\n  S. Eguchi, J. Eichholz, S. S. Eikenberry, M. Eisenmann, R. A. Eisenstein, A.\n  Ejlli, E. Engelby, Y. Enomoto, L. Errico, R. C. Essick, H. Estell\\'es, D.\n  Estevez, Z. Etienne, T. Etzel, M. Evans, T. M. Evans, T. Evstafyeva, B. E.\n  Ewing, F. Fabrizi, F. Faedi, V. Fafone, H. Fair, S. Fairhurst, P. C. Fan, A.\n  M. Farah, S. Farinon, B. Farr, W. M. Farr, E. J. Fauchon-Jones, G. Favaro, M.\n  Favata, M. Fays, M. Fazio, J. Feicht, M. M. Fejer, E. Fenyvesi, D. L.\n  Ferguson, A. Fernandez-Galiana, I. Ferrante, T. A. Ferreira, F. Fidecaro, P.\n  Figura, A. Fiori, I. Fiori, M. Fishbach, R. P. Fisher, R. Fittipaldi, V.\n  Fiumara, R. Flaminio, E. Floden, H. K. Fong, J. A. Font, B. Fornal, P. W. F.\n  Forsyth, A. Franke, S. Frasca, F. Frasconi, J. P. Freed, Z. Frei, A. Freise,\n  O. Freitas, R. Frey, P. Fritschel, V. V. Frolov, G. G. Fronz\\'e, Y. Fujii, Y.\n  Fujikawa, Y. Fujimoto, P. Fulda, M. Fyffe, H. A. Gabbard, W. E. Gabella, B.\n  U. Gadre, J. R. Gair, J. Gais, S. Galaudage, R. Gamba, D. Ganapathy, A.\n  Ganguly, D. Gao, S. G. Gaonkar, B. Garaventa, C. Garc\\'ia N\\'u\\~nez, C.\n  Garc\\'ia-Quir\\'os, F. Garufi, B. Gateley, V. Gayathri, G. G. Ge, G. Gemme, A.\n  Gennai, J. George, O. Gerberding, L. Gergely, P. Gewecke, S. Ghonge, Abhirup\n  Ghosh, Archisman Ghosh, Shaon Ghosh, Shrobana Ghosh, Tathagata Ghosh, B.\n  Giacomazzo, L. Giacoppo, J. A. Giaime, K. D. Giardina, D. R. Gibson, C. Gier,\n  M. Giesler, P. Giri, F. Gissi, S. Gkaitatzis, J. Glanzer, A. E. Gleckl, P.\n  Godwin, E. Goetz, R. Goetz, N. Gohlke, J. Golomb, B. Goncharov, G. Gonzalez,\n  M. Gosselin, R. Gouaty, D. W. Gould, S. Goyal, B. Grace, A. Grado, V. Graham,\n  M. Granata, V. Granata, A. Grant, S. Gras, P. Grassia, C. Gray, R. Gray, G.\n  Greco, A. C. Green, R. Green, A. M. Gretarsson, E. M. Gretarsson, D.\n  Griffith, W. L. Griffiths, H. L. Griggs, G. Grignani, A. Grimaldi, E. Grimes,\n  S. J. Grimm, H. Grote, S. Grunewald, P. Gruning, A. S. Gruson, D. Guerra, G.\n  M. Guidi, A. R. Guimaraes, G. Guixe, H. K. Gulati, A. M. Gunny, H. K. Guo, Y.\n  Guo, Anchal Gupta, Anuradha Gupta, I. M. Gupta, P. Gupta, S. K. Gupta, R.\n  Gustafson, F. Guzman, S. Ha, I. P. W. Hadiputrawan, L. Haegel, S. Haino, O.\n  Halim, E. D. Hall, E. Z. Hamilton, G. Hammond, W. B. Han, M. Haney, J. Hanks,\n  C. Hanna, M. D. Hannam, O. Hannuksela, H. Hansen, T. J. Hansen, J. Hanson, T.\n  Harder, K. Haris, J. Harms, G. M. Harry, I. W. Harry, D. Hartwig, K.\n  Hasegawa, B. Haskell, C. J. Haster, J. S. Hathaway, K. Hattori, K. Haughian,\n  H. Hayakawa, K. Hayama, F. J. Hayes, J. Healy, A. Heidmann, A. Heidt, M. C.\n  Heintze, J. Heinze, J. Heinzel, H. Heitmann, F. Hellman, P. Hello, A. F.\n  Helmling-Cornell, G. Hemming, M. Hendry, I. S. Heng, E. Hennes, J. Hennig, M.\n  H. Hennig, C. Henshaw, A. G. Hernandez, F. Hernandez Vivanco, M. Heurs, A. L.\n  Hewitt, S. Higginbotham, S. Hild, P. Hill, Y. Himemoto, A. S. Hines, N.\n  Hirata, C. Hirose, T. C. Ho, S. Hochheim, D. Hofman, J. N. Hohmann, D. G.\n  Holcomb, N. A. Holland, I. J. Hollows, Z. J. Holmes, K. Holt, D. E. Holz, Q.\n  Hong, J. Hough, S. Hourihane, E. J. Howell, C. G. Hoy, D. Hoyland, A. Hreibi,\n  B. H. Hsieh, H. F. Hsieh, C. Hsiung, Y. Hsu, H. Y. Huang, P. Huang, Y. C.\n  Huang, Y. J. Huang, Yiting Huang, Yiwen Huang, M. T. H\\\"ubner, A. D. Huddart,\n  B. Hughey, D. C. Y. Hui, V. Hui, S. Husa, S. H. Huttner, R. Huxford, T.\n  Huynh-Dinh, S. Ide, B. Idzkowski, A. Iess, K. Inayoshi, Y. Inoue, P. Iosif,\n  M. Isi, K. Isleif, K. Ito, Y. Itoh, B. R. Iyer, V. JaberianHamedan, T.\n  Jacqmin, P. E. Jacquet, S. J. Jadhav, S. P. Jadhav, T. Jain, A. L. James, A.\n  Z. Jan, K. Jani, J. Janquart, K. Janssens, N. N. Janthalur, P. Jaranowski, D.\n  Jariwala, R. Jaume, A. C. Jenkins, K. Jenner, C. Jeon, W. Jia, J. Jiang, H.\n  B. Jin, G. R. Johns, R. Johnston, A. W. Jones, D. I. Jones, P. Jones, R.\n  Jones, P. Joshi, L. Ju, A. Jue, P. Jung, K. Jung, J. Junker, V. Juste, K.\n  Kaihotsu, T. Kajita, M. Kakizaki, C. V. Kalaghatgi, V. Kalogera, B. Kamai, M.\n  Kamiizumi, N. Kanda, S. Kandhasamy, G. Kang, J. B. Kanner, Y. Kao, S. J.\n  Kapadia, D. P. Kapasi, C. Karathanasis, S. Karki, R. Kashyap, M. Kasprzack,\n  W. Kastaun, T. Kato, S. Katsanevas, E. Katsavounidis, W. Katzman, T. Kaur, K.\n  Kawabe, K. Kawaguchi, F. K\\'ef\\'elian, D. Keitel, J. S. Key, S. Khadka, F. Y.\n  Khalili, S. Khan, T. Khanam, E. A. Khazanov, N. Khetan, M. Khursheed, N.\n  Kijbunchoo, A. Kim, C. Kim, J. C. Kim, J. Kim, K. Kim, W. S. Kim, Y. M. Kim,\n  C. Kimball, N. Kimura, M. Kinley-Hanlon, R. Kirchhoff, J. S. Kissel, S.\n  Klimenko, T. Klinger, A. M. Knee, T. D. Knowles, N. Knust, E. Knyazev, Y.\n  Kobayashi, P. Koch, G. Koekoek, K. Kohri, K. Kokeyama, S. Koley, P.\n  Kolitsidou, M. Kolstein, K. Komori, V. Kondrashov, A. K. H. Kong, A. Kontos,\n  N. Koper, M. Korobko, M. Kovalam, N. Koyama, D. B. Kozak, C. Kozakai, V.\n  Kringel, N. V. Krishnendu, A. Kr\\'olak, G. Kuehn, F. Kuei, P. Kuijer, S.\n  Kulkarni, A. Kumar, Prayush Kumar, Rahul Kumar, Rakesh Kumar, J. Kume, K.\n  Kuns, Y. Kuromiya, S. Kuroyanagi, K. Kwak, G. Lacaille, P. Lagabbe, D. Laghi,\n  E. Lalande, M. Lalleman, T. L. Lam, A. Lamberts, M. Landry, B. B. Lane, R. N.\n  Lang, J. Lange, B. Lantz, I. La Rosa, A. Lartaux-Vollard, P. D. Lasky, M.\n  Laxen, A. Lazzarini, C. Lazzaro, P. Leaci, S. Leavey, S. LeBohec, Y. K.\n  Lecoeuche, E. Lee, H. M. Lee, H. W. Lee, K. Lee, R. Lee, I. N. Legred, J.\n  Lehmann, A. Lemaitre, M. Lenti, M. Leonardi, E. Leonova, N. Leroy, N.\n  Letendre, C. Levesque, Y. Levin, J. N. Leviton, K. Leyde, A. K. Y. Li, B. Li,\n  J. Li, K. L. Li, P. Li, T. G. F. Li, X. Li, C. Y. Lin, E. T. Lin, F. K. Lin,\n  F. L. Lin, H. L. Lin, L. C. C. Lin, F. Linde, S. D. Linker, J. N. Linley, T.\n  B. Littenberg, G. C. Liu, J. Liu, K. Liu, X. Liu, F. Llamas, R. K. L. Lo, T.\n  Lo, L. T. London, A. Longo, D. Lopez, M. Lopez Portilla, M. Lorenzini, V.\n  Loriette, M. Lormand, G. Losurdo, T. P. Lott, J. D. Lough, C. O. Lousto, G.\n  Lovelace, J. F. Lucaccioni, H. L\\\"uck, D. Lumaca, A. P. Lundgren, L. W. Luo,\n  J. E. Lynam, M. Maarif, R. Macas, J. B. Machtinger, M. MacInnis, D. M.\n  Macleod, I. A. O. MacMillan, A. Macquet, I. Maga\\~na Hernandez, C. Magazz\\`u,\n  R. M. Magee, R. Maggiore, M. Magnozzi, S. Mahesh, E. Majorana, I. Maksimovic,\n  S. Maliakal, A. Malik, N. Man, V. Mandic, V. Mangano, G. L. Mansell, M.\n  Manske, M. Mantovani, M. Mapelli, F. Marchesoni, D. Mar\\'in Pina, F. Marion,\n  Z. Mark, S. M\\'arka, Z. M\\'arka, C. Markakis, A. S. Markosyan, A. Markowitz,\n  E. Maros, A. Marquina, S. Marsat, F. Martelli, I. W. Martin, R. M. Martin, M.\n  Martinez, V. A. Martinez, V. Martinez, K. Martinovic, D. V. Martynov, E. J.\n  Marx, H. Masalehdan, K. Mason, E. Massera, A. Masserot, M. Masso-Reid, S.\n  Mastrogiovanni, A. Matas, M. Mateu-Lucena, F. Matichard, M. Matiushechkina,\n  N. Mavalvala, J. J. McCann, R. McCarthy, D. E. McClelland, P. K. McClincy, S.\n  McCormick, L. McCuller, G. I. McGhee, S. C. McGuire, C. McIsaac, J. McIver,\n  T. McRae, S. T. McWilliams, D. Meacher, M. Mehmet, A. K. Mehta, Q. Meijer, A.\n  Melatos, D. A. Melchor, G. Mendell, A. Menendez-Vazquez, C. S. Menoni, R. A.\n  Mercer, L. Mereni, K. Merfeld, E. L. Merilh, J. D. Merritt, M. Merzougui, S.\n  Meshkov, C. Messenger, C. Messick, P. M. Meyers, F. Meylahn, A. Mhaske, A.\n  Miani, H. Miao, I. Michaloliakos, C. Michel, Y. Michimura, H. Middleton, D.\n  P. Mihaylov, L. Milano, A. L. Miller, A. Miller, B. Miller, M. Millhouse, J.\n  C. Mills, E. Milotti, Y. Minenkov, N. Mio, Ll. M. Mir, M. Miravet-Ten\\'es, A.\n  Mishkin, C. Mishra, T. Mishra, T. Mistry, S. Mitra, V. P. Mitrofanov, G.\n  Mitselmakher, R. Mittleman, O. Miyakawa, K. Miyo, S. Miyoki, Geoffrey Mo, L.\n  M. Modafferi, E. Moguel, K. Mogushi, S. R. P. Mohapatra, S. R. Mohite, I.\n  Molina, M. Molina-Ruiz, M. Mondin, M. Montani, C. J. Moore, J. Moragues, D.\n  Moraru, F. Morawski, A. More, C. Moreno, G. Moreno, Y. Mori, S. Morisaki, N.\n  Morisue, Y. Moriwaki, B. Mours, C. M. Mow-Lowry, S. Mozzon, F. Muciaccia,130,\n  Arunava Mukherjee, D. Mukherjee, Soma Mukherjee, Subroto Mukherjee, Suvodip\n  Mukherjee, N. Mukund, A. Mullavey, J. Munch, E. A. Muniz, P. G. Murray, R.\n  Musenich, S. Muusse, S. L. Nadji, K. Nagano, A. Nagar, K. Nakamura, H.\n  Nakano, M. Nakano, Y. Nakayama, V. Napolano, I. Nardecchia, H. Narola, L.\n  Naticchioni, B. Nayak, R. K. Nayak, B. F. Neil, J. Neilson, A. Nelson, T. J.\n  N. Nelson, M. Nery, P. Neubauer, A. Neunzert, K. Y. Ng, S. W. S. Ng, C.\n  Nguyen, P. Nguyen, T. Nguyen, L. Nguyen Quynh, J. Ni, W. T. Ni, S. A.\n  Nichols, T. Nishimoto, A. Nishizawa, S. Nissanke, E. Nitoglia, F. Nocera, M.\n  Norman, C. North, S. Nozaki, G. Nurbek, L. K. Nuttall, Y. Obayashi, J.\n  Oberling, B. D. O'Brien, J. O'Dell, E. Oelker, W. Ogaki, G. Oganesyan, J. J.\n  Oh, K. Oh, S. H. Oh, M. Ohashi, T. Ohashi, M. Ohkawa, F. Ohme, H. Ohta, M. A.\n  Okada, Y. Okutani, C. Olivetto, K. Oohara, R. Oram, B. O'Reilly, R. G.\n  Ormiston, N. D. Ormsby, R. O'Shaughnessy, E. O'Shea, S. Oshino, S. Ossokine,\n  C. Osthelder, S. Otabe, D. J. Ottaway, H. Overmier, A. E. Pace, G. Pagano, R.\n  Pagano, M. A. Page, G. Pagliaroli, A. Pai, S. A. Pai, S. Pal, J. R. Palamos,\n  O. Palashov, C. Palomba, H. Pan, K. C. Pan, P. K. Panda, P. T. H. Pang, C.\n  Pankow, F. Pannarale, B. C. Pant, F. H. Panther, F. Paoletti, A. Paoli, A.\n  Paolone, G. Pappas, A. Parisi, H. Park, J. Park, W. Parker, D. Pascucci, A.\n  Pasqualetti, R. Passaquieti, D. Passuello, M. Patel, M. Pathak, B.\n  Patricelli, A. S. Patron, S. Paul, E. Payne, M. Pedraza, R. Pedurand, M.\n  Pegoraro, A. Pele, F. E. Pena Arellano, S. Penano, S. Penn, A. Perego, A.\n  Pereira, T. Pereira, C. J. Perez, C. P\\`erigois, C. C. Perkins, A. Perreca,\n  S. Perri\\'es, D. Pesios, J. Petermann, D. Petterson, H. P. Pfeiffer, H. Pham,\n  K. A. Pham, K. S. Phukon, H. Phurailatpam, O. J. Piccinni, M. Pichot, M.\n  Piendibene, F. Piergiovanni, L. Pierini, V. Pierro, G. Pillant, M. Pillas, F.\n  Pilo, L. Pinard, C. Pineda-Bosque, I. M. Pinto, M. Pinto, B. J. Piotrzkowski,\n  K. Piotrzkowski, M. Pirello, M. D. Pitkin, A. Placidi, E. Placidi, M. L.\n  Planas, W. Plastino, C. Pluchar, R. Poggiani, E. Polini, D. Y. T. Pong, S.\n  Ponrathnam, E. K. Porter, R. Poulton, A. Poverman, J. Powell, M. Pracchia, T.\n  Pradier, A. K. Prajapati, K. Prasai, R. Prasanna, G. Pratten, M. Principe, G.\n  A. Prodi, L. Prokhorov, P. Prosposito, L. Prudenzi, A. Puecher, M. Punturo,\n  F. Puosi, P. Puppo, M. Purrer, H. Qi, N. Quartey, V. Quetschke, P. J.\n  Quinonez, R. Quitzow-James, F. J. Raab, G. Raaijmakers, H. Radkins, N.\n  Radulesco, P. Raffai, S. X. Rail, S. Raja, C. Rajan, K. E. Ramirez, T. D.\n  Ramirez, A. Ramos-Buades, J. Rana, P. Rapagnani, A. Ray, V. Raymond, N. Raza,\n  M. Razzano, J. Read, L. A. Rees, T. Regimbau, L. Rei, S. Reid, S. W. Reid, D.\n  H. Reitze, P. Relton, A. Renzini, P. Rettegno, B. Revenu, A. Reza, M. Rezac,\n  F. Ricci, D. Richards, J. W. Richardson, L. Richardson, G. Riemenschneider,\n  K. Riles, S. Rinaldi, K. Rink, N. A. Robertson, R. Robie, F. Robinet, A.\n  Rocchi, S. Rodriguez, L. Rolland, J. G. Rollins, M. Romanelli, R. Romano, C.\n  L. Romel, A. Romero, I. M. Romero-Shaw, J. H. Romie, S. Ronchini, L. Rosa, C.\n  A. Rose, D. Rosinska, M. P. Ross, S. Rowan, S. J. Rowlinson, S. Roy, Santosh\n  Roy, Soumen Roy, D. Rozza, P. Ruggi, K. Ruiz-Rocha, K. Ryan, S. Sachdev, T.\n  Sadecki, J. Sadiq, S. Saha, Y. Saito, K. Sakai, M. Sakellariadou, S. Sakon,\n  O. S. Salafia, F. Salces-Carcoba, L. Salconi, M. Saleem, F. Salemi, A.\n  Samajdar, E. J. Sanchez, J. H. Sanchez, L. E. Sanchez, N. Sanchis-Gual, J. R.\n  Sanders, A. Sanuy, T. R. Saravanan, N. Sarin, B. Sassolas, H. Satari, O.\n  Sauter, R. L. Savage, V. Savant, T. Sawada, H. L. Sawant, S. Sayah, D.\n  Schaetzl, M. Scheel, J. Scheuer, M. G. Schiworski, P. Schmidt, S. Schmidt, R.\n  Schnabel, M. Schneewind, R. M. S. Schofield, A. Schonbeck, B. W. Schulte, B.\n  F. Schutz, E. Schwartz, J. Scott, S. M. Scott, M. Seglar-Arroyo, Y.\n  Sekiguchi, D. Sellers, A. S. Sengupta, D. Sentenac, E. G. Seo, V. Sequino, A.\n  Sergeev, Y. Setyawati, T. Shaffer, M. S. Shahriar, M. A. Shaikh, B. Shams, L.\n  Shao, A. Sharma, P. Sharma, P. Shawhan, N. S. Shcheblanov, A. Sheela, Y.\n  Shikano, M. Shikauchi, H. Shimizu, K. Shimode, H. Shinkai, T. Shishido, A.\n  Shoda, D. H. Shoemaker, D. M. Shoemaker, S. ShyamSundar, M. Sieniawska, D.\n  Sigg, L. Silenzi, L. P. Singer, D. Singh, M. K. Singh, N. Singh, A. Singha,\n  A. M. Sintes, V. Sipala, V. Skliris, B. J. J. Slagmolen, T. J. Slaven-Blair,\n  J. Smetana, J. R. Smith, L. Smith, R. J. E. Smith, J. Soldateschi, S. N.\n  Somala, K. Somiya, I. Song, K. Soni, S. Soni, V. Sordini, F. Sorrentino, N.\n  Sorrentino, R. Soulard, T. Souradeep, E. Sowell, V. Spagnuolo, A. P. Spencer,\n  M. Spera, P. Spinicelli, A. K. Srivastava, V. Srivastava, K. Staats, C.\n  Stachie, F. Stachurski, D. A. Steer, J. Steinlechner, S. Steinlechner, N.\n  Stergioulas, D. J. Stops, M. Stover, K. A. Strain, L. C. Strang, G. Stratta,\n  M. D. Strong, A. Strunk, R. Sturani, A. L. Stuver, M. Suchenek, S. Sudhagar,\n  V. Sudhir, R. Sugimoto, H. G. Suh, A. G. Sullivan, T. Z. Summerscales, L.\n  Sun, S. Sunil, A. Sur, J. Suresh, P. J. Sutton, Takamasa Suzuki, Takanori\n  Suzuki, Toshikazu Suzuki, B. L. Swinkels, M. J. Szczepa\\'nczyk, P. Szewczyk,\n  M. Tacca, H. Tagoshi, S. C. Tait, H. Takahashi, R. Takahashi, S. Takano, H.\n  Takeda, M. Takeda, C. J. Talbot, C. Talbot, K. Tanaka, Taiki Tanaka, Takahiro\n  Tanaka, A. J. Tanasijczuk, S. Tanioka, D. B. Tanner, D. Tao, L. Tao, R. D.\n  Tapia, E. N. Tapia San Martin, C. Taranto, A. Taruya, J. D. Tasson, R.\n  Tenorio, J. E. S. Terhune, L. Terkowski, M. P. Thirugnanasambandam, M.\n  Thomas, P. Thomas, E. E. Thompson, J. E. Thompson, S. R. Thondapu, K. A.\n  Thorne, E. Thrane, Shubhanshu Tiwari, Srishti Tiwari, V. Tiwari, A. M.\n  Toivonen, A. E. Tolley, T. Tomaru, T. Tomura, M. Tonelli, Z. Tornasi, A.\n  Torres-Forne, C. I. Torrie, I. Tosta e Melo, D. Toyra, A. Trapananti, F.\n  Travasso, G. Traylor, M. Trevor, M. C. Tringali, A. Tripathee, L. Troiano, A.\n  Trovato, L. Trozzo, R. J. Trudeau, D. Tsai, K. W. Tsang, T. Tsang, J. S.\n  Tsao, M. Tse, R. Tso, S. Tsuchida, L. Tsukada, D. Tsuna, T. Tsutsui, K.\n  Turbang, M. Turconi, D. Tuyenbayev, A. S. Ubhi, T. Uchiyama, R. P. Udall, A.\n  Ueda, T. Uehara, K. Ueno, G. Ueshima, C. S. Unnikrishnan, A. L. Urban, T.\n  Ushiba, A. Utina, G. Vajente, A. Vajpeyi, G. Valdes, M. Valentini, V. Valsan,\n  N. van Bakel, M. van Beuzekom, M. van Dael, J. F. J. van den Brand, C. Van\n  Den Broeck, D. C. Vander-Hyde, H. van Haevermaet, J. V. van Heijningen, M. H.\n  P. M. van Putten, N. van Remortel, M. Vardaro, A. F. Vargas, V. Varma, M.\n  Vasuth, A. Vecchio, G. Vedovato, J. Veitch, P. J. Veitch, J. Venneberg, G.\n  Venugopalan, D. Verkindt, P. Verma, Y. Verma, S. M. Vermeulen, D. Veske, F.\n  Vetrano, A. Vicere, S. Vidyant, A. D. Viets, A. Vijaykumar, V. Villa-Ortega,\n  J. Y. Vinet, A. Virtuoso, S. Vitale, H. Vocca, E. R. G. von Reis, J. S. A.\n  von Wrangel, C. Vorvick, S. P. Vyatchanin, L. E. Wade, M. Wade, K. J. Wagner,\n  R. C. Walet, M. Walker, G. S. Wallace, L. Wallace, J. Wang, J. Z. Wang, W. H.\n  Wang, R. L. Ward, J. Warner, M. Was, T. Washimi, N. Y. Washington, J. Watchi,\n  B. Weaver, C. R. Weaving, S. A. Webster, M. Weinert, A. J. Weinstein, R.\n  Weiss, C. M. Weller, R. A. Weller, F. Wellmann, L. Wen, P. Wessels, K. Wette,\n  J. T. Whelan, D. D. White, B. F. Whiting, C. Whittle, D. Wilken, D. Williams,\n  M. J. Williams, A. R. Williamson, J. L. Willis, B. Willke, D. J. Wilson, C.\n  C. Wipf, T. Wlodarczyk, G. Woan, J. Woehler,34, J. K. Wofford, D. Wong, I. C.\n  F. Wong, M. Wright, C. Wu, D. S. Wu, H. Wu, D. M. Wysocki L. Xiao, T.\n  Yamada,288 H. Yamamoto, K. Yamamoto, T. Yamamoto, K. Yamashita, R. Yamazaki,\n  F. W. Yang, K. Z. Yang, L. Yang, Y. C. Yang, Y. Yang, Yang Yang, M. J. Yap,\n  D. W. Yeeles, S. W. Yeh, A. B. Yelikar, M. Ying, J. Yokoyama, T. Yokozawa, J.\n  Yoo, T. Yoshioka, Hang Yu, Haocun Yu, H. Yuzurihara, A. Zadrozny, M. Zanolin,\n  S. Zeidler, T. Zelenova, J.P. Zendri, M. Zevin, M. Zhan, H. Zhang, J. Zhang,\n  L. Zhang, R. Zhang, T. Zhang, Y. Zhang, C. Zhao, G. Zhao, Y. Zhao, Yue Zhao,\n  R. Zhou, Z. Zhou, X. J. Zhu, Z. H. Zhu, A. B. Zimmerman, M. E. Zucker, J.\n  Zweizig, The LIGO Scientific Collaboration, the Virgo Collaboration, the\n  KAGRA Collaboration","title":"A Joint Fermi-GBM and Swift-BAT Analysis of Gravitational-Wave\n  Candidates from the Third Gravitational-wave Observing Run","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present Fermi Gamma-ray Burst Monitor (Fermi-GBM) and Swift Burst Alert\nTelescope (Swift-BAT) searches for gamma-ray/X-ray counterparts to\ngravitational wave (GW) candidate events identified during the third observing\nrun of the Advanced LIGO and Advanced Virgo detectors. Using Fermi-GBM on-board\ntriggers and sub-threshold gamma-ray burst (GRB) candidates found in the\nFermi-GBM ground analyses, the Targeted Search and the Untargeted Search, we\ninvestigate whether there are any coincident GRBs associated with the GWs. We\nalso search the Swift-BAT rate data around the GW times to determine whether a\nGRB counterpart is present. No counterparts are found. Using both the Fermi-GBM\nTargeted Search and the Swift-BAT search, we calculate flux upper limits and\npresent joint upper limits on the gamma-ray luminosity of each GW. Given these\nlimits, we constrain theoretical models for the emission of gamma-rays from\nbinary black hole mergers.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:39:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fletcher","C.",""],["Wood","J.",""],["Hamburg","R.",""],["Veres","P.",""],["Hui","C. M.",""],["Bissaldi","E.",""],["Briggs","M. S.",""],["Burns","E.",""],["Cleveland","W. H.",""],["Giles","M. M.",""],["Goldstein","A.",""],["Hristov","B. A.",""],["Kocevski","D.",""],["Lesage","S.",""],["Mailyan","B.",""],["Malacaria","C.",""],["Poolakkil","S.",""],["von Kienlin","A.",""],["Wilson-Hodge","C. A.",""],["Team","The Fermi Gamma-ray Burst Monitor",""],["Crnogor\u010devi\u0107","M.",""],["DeLaunay","J.",""],["Tohuvavohu","A.",""],["Caputo","R.",""],["Cenko","S. B.",""],["Laha","S.",""],["Parsotan","T.",""],["Abbott","R.",""],["Abe","H.",""],["Acernese","F.",""],["Ackley","K.",""],["Adhikari","N.",""],["Adhikari","R. X.",""],["Adkins","V. K.",""],["Adya","V. B.",""],["Affeldt","C.",""],["Agarwal","D.",""],["Agathos","M.",""],["Agatsuma","K.",""],["Aggarwal","N.",""],["Aguiar","O. D.",""],["Aiello","L.",""],["Ain","A.",""],["Ajith","P.",""],["Akutsu","T.",""],["Albanesi","S.",""],["Alfaidi","R. A.",""],["Allocca","A.",""],["Altin","P. A.",""],["Amato","A.",""],["Anand","C.",""],["Anand","S.",""],["Ananyeva","A.",""],["Anderson","S. B.",""],["Anderson","W. G.",""],["Ando","M.",""],["Andrade","T.",""],["Andres","N.",""],["Andr\u00e9s-Carcasona","M.",""],["Andr\u00edc","T.",""],["Angelova","S. V.",""],["Ansoldi","S.",""],["Antelis","J. M.",""],["Antier","S.",""],["Apostolatos","T.",""],["Appavuravther","E. Z.",""],["Appert","S.",""],["Apple","S. K.",""],["Arai","K.",""],["Araya","A.",""],["Araya","M. C.",""],["Areeda","J. S.",""],["Ar\u00e8ne","M.",""],["Aritomi","N.",""],["Arnaud","N.",""],["Arogeti","M.",""],["Aronson","S. M.",""],["Arun","K. G.",""],["Asada","H.",""],["Asali","Y.",""],["Ashton","G.",""],["Aso","Y.",""],["Assiduo","M.",""],["Melo","S. Assis de Souza",""],["Aston","S. M.",""],["Astone","P.",""],["Aubin","F.",""],["AultONeal","K.",""],["Austin","C.",""],["Babak","S.",""],["Badaracco","F.",""],["Bader","M. K. M.",""],["Badger","C.",""],["Bae","S.",""],["Bae","Y.",""],["Baer","A. M.",""],["Bagnasco","S.",""],["Bai","Y.",""],["Baird","J.",""],["Bajpai","R.",""],["Baka","T.",""],["Ball","M.",""],["Ballardin","G.",""],["Ballmer","S. W.",""],["Balsamo","A.",""],["Baltus","G.",""],["Banagiri","S.",""],["Banerjee","B.",""],["Bankar","D.",""],["Barayoga","J. C.",""],["Barbieri","C.",""],["Barish","B. C.",""],["Barker","D.",""],["Barneo","P.",""],["Barone","F.",""],["Barr","B.",""],["Barsotti","L.",""],["Barsuglia","M.",""],["Barta","D.",""],["Bartlett","J.",""],["Barton","M. A.",""],["Bartos","I.",""],["Basak","S.",""],["Bassiri","R.",""],["Basti","A.",""],["Bawaj","M.",""],["Bayley","J. C.",""],["Bazzan","M.",""],["Becher","B. R.",""],["Becsy","B.",""],["Bedakihale","V. M.",""],["Beirnaert","F.",""],["Bejger","M.",""],["Belahcene","I.",""],["Benedetto","V.",""],["Beniwal","D.",""],["Benjamin","M. G.",""],["Bennett","T. F.",""],["Bentley","J. D.",""],["BenYaala","M.",""],["Bera","S.",""],["Berbel","M.",""],["Bergamin","F.",""],["Berger","B. K.",""],["Bernuzzi","S.",""],["Berry","C. P. L.",""],["Bersanetti","D.",""],["Bertolini","A.",""],["Betzwieser","J.",""],["Beveridge","D.",""],["Bhandare","R.",""],["Bhandari","A. V.",""],["Bhardwaj","U.",""],["Bhatt","R.",""],["Bhattacharjee","D.",""],["Bhaumik","S.",""],["Bianchi","A.",""],["Bilenko","I. A.",""],["Billingsley","G.",""],["Bini","S.",""],["Birney","R.",""],["Birnholtz","O.",""],["Biscans","S.",""],["Bischi","M.",""],["Biscoveanu","S.",""],["Bisht","A.",""],["Biswas","B.",""],["Bitossi","M.",""],["Bizouard","M. A.",""],["Blackburn","J. K.",""],["Blair","C. D.",""],["Blair","D. G.",""],["Blair","R. M.",""],["Bobba","F.",""],["Bode","N.",""],["Bo\u00ebr","M.",""],["Bogaert","G.",""],["Boldrini","M.",""],["Bolingbroke","G. N.",""],["Bonavena","L. D.",""],["Bondu","F.",""],["Bonilla","E.",""],["Bonnand","R.",""],["Booker","P.",""],["Boom","B. A.",""],["Bork","R.",""],["Boschi","V.",""],["Bose","N.",""],["Bose","S.",""],["Bossilkov","V.",""],["Boudart","V.",""],["Bouffanais","Y.",""],["Bozzi","A.",""],["Bradaschia","C.",""],["Brady","P. R.",""],["Bramley","A.",""],["Branch","A.",""],["Branchesi","M.",""],["Brau","J. E.",""],["Breschi","M.",""],["Briant","T.",""],["Briggs","J. H.",""],["Brillet","A.",""],["Brinkmann","M.",""],["Brockill","P.",""],["Brooks","A. F.",""],["Brooks","J.",""],["Brown","D. D.",""],["Brunett","S.",""],["Bruno","G.",""],["Bruntz","R.",""],["Bryant","J.",""],["Bucci","F.",""],["Bulik","T.",""],["Bulten","H. J.",""],["Buonanno","A.",""],["Burtnyk","K.",""],["Buscicchio","R.",""],["Buskulic","D.",""],["Buy","C.",""],["Byer","R. L.",""],["Davies","G. S. Cabourn",""],["Cabras","G.",""],["Cabrita","R.",""],["Cadonati","L.",""],["Caesar","M.",""],["Cagnoli","G.",""],["Cahillane","C.",""],["Bustillo","J. Calder\u00f2n",""],["Callaghan","J. D.",""],["Callister","T. A.",""],["Calloni","E.",""],["Cameron","J.",""],["Camp","J. B.",""],["Canepa","M.",""],["Canevarolo","S.",""],["Cannavacciuolo","M.",""],["Cannon","K. C.",""],["Cao","H.",""],["Cao","Z.",""],["Capocasa","E.",""],["Capote","E.",""],["Carapella","G.",""],["Carbognani","F.",""],["Carlassara","M.",""],["Carlin","J. B.",""],["Carney","M. F.",""],["Carpinelli","M.",""],["Carrillo","G.",""],["Carullo","G.",""],["Carver","T. L.",""],["D\u00edaz","J. Casanueva",""],["Casentini","C.",""],["Castaldi","G.",""],["Caudill","S.",""],["Cavagli\u00e0","M.",""],["Cavalier","F.",""],["Cavalieri","R.",""],["Cella","G.",""],["Cerd\u00e1-Dur\u00e1n","P.",""],["Cesarini","E.",""],["Chaibi","W.",""],["Subrahmanya","S. Chalathadka",""],["Champion","E.",""],["Chan","C. H.",""],["Chan","C.",""],["Chan","C. L.",""],["Chan","K.",""],["Chan","M.",""],["Chandra","K.",""],["Chang","I. P.",""],["Chanial","P.",""],["Chao","S.",""],["Chapman-Bird","C.",""],["Charlton","P.",""],["Chase","E. A.",""],["Chassande-Mottin","E.",""],["Chatterjee","C.",""],["Chatterjee","Debarati",""],["Chatterjee","Deep",""],["Chaturvedi","M.",""],["Chaty","S.",""],["Chen","C.",""],["Chen","D.",""],["Chen","H. Y.",""],["Chen","J.",""],["Chen","K.",""],["Chen","X.",""],["Chen","Y. B.",""],["Chen","Y. R.",""],["Chen","Z.",""],["Cheng","H.",""],["Cheong","C. K.",""],["Cheung","H. Y.",""],["Chia","H. Y.",""],["Chiadini","F.",""],["Chiang","C. Y.",""],["Chiarini","G.",""],["Chierici","R.",""],["Chincarini","A.",""],["Chiofalo","M. L.",""],["Chiummo","A.",""],["Choudhary","R. K.",""],["Choudhary","S.",""],["Christensen","N.",""],["Chu","Q.",""],["Chu","Y. K.",""],["Chua","S. S. Y.",""],["Chung","K. W.",""],["Ciani","G.",""],["Ciecielag","P.",""],["Cie\u015blar","M.",""],["Cifaldi","M.",""],["Ciobanu","A. A.",""],["Ciolfi","R.",""],["Cipriano","F.",""],["Clara","F.",""],["Clark","J. A.",""],["Clearwater","P.",""],["Clesse","S.",""],["Cleva","F.",""],["Coccia","E.",""],["Codazzo","E.",""],["Cohadon","P. F.",""],["Cohen","D. E.",""],["Colleoni","M.",""],["Collette","C. G.",""],["Colombo","A.",""],["Colpi","M.",""],["Compton","C. M.",""],["Constancio","M.","Jr."],["Conti","L.",""],["Cooper","S. J.",""],["Corban","P.",""],["Corbitt","T. R.",""],["Cordero-Carri\u00f3n","I.",""],["Corezzi","S.",""],["Corley","K. R.",""],["Cornish","N. J.",""],["Corre","D.",""],["Corsi","A.",""],["Cortese","S.",""],["Costa","C. A.",""],["Cotesta","R.",""],["Cottingham","R.",""],["Coughlin","M. W.",""],["Coulon","J. P.",""],["Countryman","S. T.",""],["Cousins","B.",""],["Couvares","P.",""],["Coward","D. M.",""],["Cowart","M. J.",""],["Coyne","D. C.",""],["Coyne","R.",""],["Creighton","J. D. E.",""],["Creighton","T. D.",""],["Criswell","A. W.",""],["Croquette","M.",""],["Crowder","S. G.",""],["Cudell","J. R.",""],["Cullen","T. J.",""],["Cumming","A.",""],["Cummings","R.",""],["Cunningham","L.",""],["Cuoco","E.",""],["lo","M. Cury",""],["Dabadie","P.",""],["Canton","T. Dal",""],["Dall'Osso","S.",""],["D\u00e1lya","G.",""],["Dana","A.",""],["D'Angelo","B.",""],["Danilishin","S.",""],["D'Antonio","S.",""],["Danzmann","K.",""],["Darsow-Fromm","C.",""],["Dasgupta","A.",""],["Datrier","L. E. H.",""],["Datta","Sayak",""],["Datta","Sayantani",""],["Dattilo","V.",""],["Dave","I.",""],["Davier","M.",""],["Davis","D.",""],["Davis","M. C.",""],["Daw","E. J.",""],["Dean","R.",""],["DeBra","D.",""],["Deenadayalan","M.",""],["Degallaix","J.",""],["De Laurentis","M.",""],["Del\u00e9glise","S.",""],["Del Favero","V.",""],["De Lillo","F.",""],["De Lillo","N.",""],["Dell'Aquila","D.",""],["Del Pozzo","W.",""],["DeMarchi","L. M.",""],["De Matteis","F.",""],["D'Emilio","V.",""],["Demos","N.",""],["Dent","T.",""],["Depasse","A.",""],["De Pietri","R.",""],["De Rosa","R.",""],["De Rossi","C.",""],["DeSalvo","R.",""],["De Simone","R.",""],["Dhurandhar","S.",""],["D'iaz","M. C.",""],["Didio","N. A.",""],["Dietrich","T.",""],["Di Fiore","L.",""],["Di Fronzo","C.",""],["Di Giorgio","C.",""],["Di Giovanni","F.",""],["Di Giovanni","M.",""],["Di Girolamo","T.",""],["Di Lieto","A.",""],["Di Michele","A.",""],["Ding","B.",""],["Di Pace","S.",""],["Di Palma","I.",""],["Di Renzo","F.",""],["Divakarla","A. K.",""],["Dmitriev","A.",""],["Doctor","Z.",""],["Donahue","L.",""],["D'Onofrio","L.",""],["Donovan","F.",""],["Dooley","K. L.",""],["Doravari","S.",""],["Drago","M.",""],["Driggers","J. C.",""],["Drori","Y.",""],["Ducoin","J. G.",""],["Dupej","P.",""],["Dupletsa","U.",""],["Durante","O.",""],["D'Urso","D.",""],["Duverne","P. A.",""],["Dwyer","S. E.",""],["Eassa","C.",""],["Easter","P. J.",""],["Ebersold","M.",""],["Eckhardt","T.",""],["Eddolls","G.",""],["Edelman","B.",""],["Edo","T. B.",""],["Edy","O.",""],["Effler","A.",""],["Eguchi","S.",""],["Eichholz","J.",""],["Eikenberry","S. S.",""],["Eisenmann","M.",""],["Eisenstein","R. A.",""],["Ejlli","A.",""],["Engelby","E.",""],["Enomoto","Y.",""],["Errico","L.",""],["Essick","R. C.",""],["Estell\u00e9s","H.",""],["Estevez","D.",""],["Etienne","Z.",""],["Etzel","T.",""],["Evans","M.",""],["Evans","T. M.",""],["Evstafyeva","T.",""],["Ewing","B. E.",""],["Fabrizi","F.",""],["Faedi","F.",""],["Fafone","V.",""],["Fair","H.",""],["Fairhurst","S.",""],["Fan","P. C.",""],["Farah","A. M.",""],["Farinon","S.",""],["Farr","B.",""],["Farr","W. M.",""],["Fauchon-Jones","E. J.",""],["Favaro","G.",""],["Favata","M.",""],["Fays","M.",""],["Fazio","M.",""],["Feicht","J.",""],["Fejer","M. M.",""],["Fenyvesi","E.",""],["Ferguson","D. L.",""],["Fernandez-Galiana","A.",""],["Ferrante","I.",""],["Ferreira","T. A.",""],["Fidecaro","F.",""],["Figura","P.",""],["Fiori","A.",""],["Fiori","I.",""],["Fishbach","M.",""],["Fisher","R. P.",""],["Fittipaldi","R.",""],["Fiumara","V.",""],["Flaminio","R.",""],["Floden","E.",""],["Fong","H. K.",""],["Font","J. A.",""],["Fornal","B.",""],["Forsyth","P. W. F.",""],["Franke","A.",""],["Frasca","S.",""],["Frasconi","F.",""],["Freed","J. P.",""],["Frei","Z.",""],["Freise","A.",""],["Freitas","O.",""],["Frey","R.",""],["Fritschel","P.",""],["Frolov","V. V.",""],["Fronz\u00e9","G. G.",""],["Fujii","Y.",""],["Fujikawa","Y.",""],["Fujimoto","Y.",""],["Fulda","P.",""],["Fyffe","M.",""],["Gabbard","H. A.",""],["Gabella","W. E.",""],["Gadre","B. U.",""],["Gair","J. R.",""],["Gais","J.",""],["Galaudage","S.",""],["Gamba","R.",""],["Ganapathy","D.",""],["Ganguly","A.",""],["Gao","D.",""],["Gaonkar","S. G.",""],["Garaventa","B.",""],["N\u00fa\u00f1ez","C. Garc\u00eda",""],["Garc\u00eda-Quir\u00f3s","C.",""],["Garufi","F.",""],["Gateley","B.",""],["Gayathri","V.",""],["Ge","G. G.",""],["Gemme","G.",""],["Gennai","A.",""],["George","J.",""],["Gerberding","O.",""],["Gergely","L.",""],["Gewecke","P.",""],["Ghonge","S.",""],["Ghosh","Abhirup",""],["Ghosh","Archisman",""],["Ghosh","Shaon",""],["Ghosh","Shrobana",""],["Ghosh","Tathagata",""],["Giacomazzo","B.",""],["Giacoppo","L.",""],["Giaime","J. A.",""],["Giardina","K. D.",""],["Gibson","D. R.",""],["Gier","C.",""],["Giesler","M.",""],["Giri","P.",""],["Gissi","F.",""],["Gkaitatzis","S.",""],["Glanzer","J.",""],["Gleckl","A. E.",""],["Godwin","P.",""],["Goetz","E.",""],["Goetz","R.",""],["Gohlke","N.",""],["Golomb","J.",""],["Goncharov","B.",""],["Gonzalez","G.",""],["Gosselin","M.",""],["Gouaty","R.",""],["Gould","D. W.",""],["Goyal","S.",""],["Grace","B.",""],["Grado","A.",""],["Graham","V.",""],["Granata","M.",""],["Granata","V.",""],["Grant","A.",""],["Gras","S.",""],["Grassia","P.",""],["Gray","C.",""],["Gray","R.",""],["Greco","G.",""],["Green","A. C.",""],["Green","R.",""],["Gretarsson","A. M.",""],["Gretarsson","E. M.",""],["Griffith","D.",""],["Griffiths","W. L.",""],["Griggs","H. L.",""],["Grignani","G.",""],["Grimaldi","A.",""],["Grimes","E.",""],["Grimm","S. J.",""],["Grote","H.",""],["Grunewald","S.",""],["Gruning","P.",""],["Gruson","A. S.",""],["Guerra","D.",""],["Guidi","G. M.",""],["Guimaraes","A. R.",""],["Guixe","G.",""],["Gulati","H. K.",""],["Gunny","A. M.",""],["Guo","H. K.",""],["Guo","Y.",""],["Gupta","Anchal",""],["Gupta","Anuradha",""],["Gupta","I. M.",""],["Gupta","P.",""],["Gupta","S. K.",""],["Gustafson","R.",""],["Guzman","F.",""],["Ha","S.",""],["Hadiputrawan","I. P. W.",""],["Haegel","L.",""],["Haino","S.",""],["Halim","O.",""],["Hall","E. D.",""],["Hamilton","E. Z.",""],["Hammond","G.",""],["Han","W. B.",""],["Haney","M.",""],["Hanks","J.",""],["Hanna","C.",""],["Hannam","M. D.",""],["Hannuksela","O.",""],["Hansen","H.",""],["Hansen","T. J.",""],["Hanson","J.",""],["Harder","T.",""],["Haris","K.",""],["Harms","J.",""],["Harry","G. M.",""],["Harry","I. W.",""],["Hartwig","D.",""],["Hasegawa","K.",""],["Haskell","B.",""],["Haster","C. J.",""],["Hathaway","J. S.",""],["Hattori","K.",""],["Haughian","K.",""],["Hayakawa","H.",""],["Hayama","K.",""],["Hayes","F. J.",""],["Healy","J.",""],["Heidmann","A.",""],["Heidt","A.",""],["Heintze","M. C.",""],["Heinze","J.",""],["Heinzel","J.",""],["Heitmann","H.",""],["Hellman","F.",""],["Hello","P.",""],["Helmling-Cornell","A. F.",""],["Hemming","G.",""],["Hendry","M.",""],["Heng","I. S.",""],["Hennes","E.",""],["Hennig","J.",""],["Hennig","M. H.",""],["Henshaw","C.",""],["Hernandez","A. G.",""],["Vivanco","F. Hernandez",""],["Heurs","M.",""],["Hewitt","A. L.",""],["Higginbotham","S.",""],["Hild","S.",""],["Hill","P.",""],["Himemoto","Y.",""],["Hines","A. S.",""],["Hirata","N.",""],["Hirose","C.",""],["Ho","T. C.",""],["Hochheim","S.",""],["Hofman","D.",""],["Hohmann","J. N.",""],["Holcomb","D. G.",""],["Holland","N. A.",""],["Hollows","I. J.",""],["Holmes","Z. J.",""],["Holt","K.",""],["Holz","D. E.",""],["Hong","Q.",""],["Hough","J.",""],["Hourihane","S.",""],["Howell","E. J.",""],["Hoy","C. G.",""],["Hoyland","D.",""],["Hreibi","A.",""],["Hsieh","B. H.",""],["Hsieh","H. F.",""],["Hsiung","C.",""],["Hsu","Y.",""],["Huang","H. Y.",""],["Huang","P.",""],["Huang","Y. C.",""],["Huang","Y. J.",""],["Huang","Yiting",""],["Huang","Yiwen",""],["H\u00fcbner","M. T.",""],["Huddart","A. D.",""],["Hughey","B.",""],["Hui","D. C. Y.",""],["Hui","V.",""],["Husa","S.",""],["Huttner","S. H.",""],["Huxford","R.",""],["Huynh-Dinh","T.",""],["Ide","S.",""],["Idzkowski","B.",""],["Iess","A.",""],["Inayoshi","K.",""],["Inoue","Y.",""],["Iosif","P.",""],["Isi","M.",""],["Isleif","K.",""],["Ito","K.",""],["Itoh","Y.",""],["Iyer","B. R.",""],["JaberianHamedan","V.",""],["Jacqmin","T.",""],["Jacquet","P. E.",""],["Jadhav","S. J.",""],["Jadhav","S. P.",""],["Jain","T.",""],["James","A. L.",""],["Jan","A. Z.",""],["Jani","K.",""],["Janquart","J.",""],["Janssens","K.",""],["Janthalur","N. N.",""],["Jaranowski","P.",""],["Jariwala","D.",""],["Jaume","R.",""],["Jenkins","A. C.",""],["Jenner","K.",""],["Jeon","C.",""],["Jia","W.",""],["Jiang","J.",""],["Jin","H. B.",""],["Johns","G. R.",""],["Johnston","R.",""],["Jones","A. W.",""],["Jones","D. I.",""],["Jones","P.",""],["Jones","R.",""],["Joshi","P.",""],["Ju","L.",""],["Jue","A.",""],["Jung","P.",""],["Jung","K.",""],["Junker","J.",""],["Juste","V.",""],["Kaihotsu","K.",""],["Kajita","T.",""],["Kakizaki","M.",""],["Kalaghatgi","C. V.",""],["Kalogera","V.",""],["Kamai","B.",""],["Kamiizumi","M.",""],["Kanda","N.",""],["Kandhasamy","S.",""],["Kang","G.",""],["Kanner","J. B.",""],["Kao","Y.",""],["Kapadia","S. J.",""],["Kapasi","D. P.",""],["Karathanasis","C.",""],["Karki","S.",""],["Kashyap","R.",""],["Kasprzack","M.",""],["Kastaun","W.",""],["Kato","T.",""],["Katsanevas","S.",""],["Katsavounidis","E.",""],["Katzman","W.",""],["Kaur","T.",""],["Kawabe","K.",""],["Kawaguchi","K.",""],["K\u00e9f\u00e9lian","F.",""],["Keitel","D.",""],["Key","J. S.",""],["Khadka","S.",""],["Khalili","F. Y.",""],["Khan","S.",""],["Khanam","T.",""],["Khazanov","E. A.",""],["Khetan","N.",""],["Khursheed","M.",""],["Kijbunchoo","N.",""],["Kim","A.",""],["Kim","C.",""],["Kim","J. C.",""],["Kim","J.",""],["Kim","K.",""],["Kim","W. S.",""],["Kim","Y. M.",""],["Kimball","C.",""],["Kimura","N.",""],["Kinley-Hanlon","M.",""],["Kirchhoff","R.",""],["Kissel","J. S.",""],["Klimenko","S.",""],["Klinger","T.",""],["Knee","A. M.",""],["Knowles","T. D.",""],["Knust","N.",""],["Knyazev","E.",""],["Kobayashi","Y.",""],["Koch","P.",""],["Koekoek","G.",""],["Kohri","K.",""],["Kokeyama","K.",""],["Koley","S.",""],["Kolitsidou","P.",""],["Kolstein","M.",""],["Komori","K.",""],["Kondrashov","V.",""],["Kong","A. K. H.",""],["Kontos","A.",""],["Koper","N.",""],["Korobko","M.",""],["Kovalam","M.",""],["Koyama","N.",""],["Kozak","D. B.",""],["Kozakai","C.",""],["Kringel","V.",""],["Krishnendu","N. V.",""],["Kr\u00f3lak","A.",""],["Kuehn","G.",""],["Kuei","F.",""],["Kuijer","P.",""],["Kulkarni","S.",""],["Kumar","A.",""],["Kumar","Prayush",""],["Kumar","Rahul",""],["Kumar","Rakesh",""],["Kume","J.",""],["Kuns","K.",""],["Kuromiya","Y.",""],["Kuroyanagi","S.",""],["Kwak","K.",""],["Lacaille","G.",""],["Lagabbe","P.",""],["Laghi","D.",""],["Lalande","E.",""],["Lalleman","M.",""],["Lam","T. L.",""],["Lamberts","A.",""],["Landry","M.",""],["Lane","B. B.",""],["Lang","R. N.",""],["Lange","J.",""],["Lantz","B.",""],["La Rosa","I.",""],["Lartaux-Vollard","A.",""],["Lasky","P. D.",""],["Laxen","M.",""],["Lazzarini","A.",""],["Lazzaro","C.",""],["Leaci","P.",""],["Leavey","S.",""],["LeBohec","S.",""],["Lecoeuche","Y. K.",""],["Lee","E.",""],["Lee","H. M.",""],["Lee","H. W.",""],["Lee","K.",""],["Lee","R.",""],["Legred","I. N.",""],["Lehmann","J.",""],["Lemaitre","A.",""],["Lenti","M.",""],["Leonardi","M.",""],["Leonova","E.",""],["Leroy","N.",""],["Letendre","N.",""],["Levesque","C.",""],["Levin","Y.",""],["Leviton","J. N.",""],["Leyde","K.",""],["Li","A. K. Y.",""],["Li","B.",""],["Li","J.",""],["Li","K. L.",""],["Li","P.",""],["Li","T. G. F.",""],["Li","X.",""],["Lin","C. Y.",""],["Lin","E. T.",""],["Lin","F. K.",""],["Lin","F. L.",""],["Lin","H. L.",""],["Lin","L. C. C.",""],["Linde","F.",""],["Linker","S. D.",""],["Linley","J. N.",""],["Littenberg","T. B.",""],["Liu","G. C.",""],["Liu","J.",""],["Liu","K.",""],["Liu","X.",""],["Llamas","F.",""],["Lo","R. K. L.",""],["Lo","T.",""],["London","L. T.",""],["Longo","A.",""],["Lopez","D.",""],["Portilla","M. Lopez",""],["Lorenzini","M.",""],["Loriette","V.",""],["Lormand","M.",""],["Losurdo","G.",""],["Lott","T. P.",""],["Lough","J. D.",""],["Lousto","C. O.",""],["Lovelace","G.",""],["Lucaccioni","J. F.",""],["L\u00fcck","H.",""],["Lumaca","D.",""],["Lundgren","A. P.",""],["Luo","L. W.",""],["Lynam","J. E.",""],["Maarif","M.",""],["Macas","R.",""],["Machtinger","J. B.",""],["MacInnis","M.",""],["Macleod","D. M.",""],["MacMillan","I. A. O.",""],["Macquet","A.",""],["Hernandez","I. Maga\u00f1a",""],["Magazz\u00f9","C.",""],["Magee","R. M.",""],["Maggiore","R.",""],["Magnozzi","M.",""],["Mahesh","S.",""],["Majorana","E.",""],["Maksimovic","I.",""],["Maliakal","S.",""],["Malik","A.",""],["Man","N.",""],["Mandic","V.",""],["Mangano","V.",""],["Mansell","G. L.",""],["Manske","M.",""],["Mantovani","M.",""],["Mapelli","M.",""],["Marchesoni","F.",""],["Pina","D. Mar\u00edn",""],["Marion","F.",""],["Mark","Z.",""],["M\u00e1rka","S.",""],["M\u00e1rka","Z.",""],["Markakis","C.",""],["Markosyan","A. S.",""],["Markowitz","A.",""],["Maros","E.",""],["Marquina","A.",""],["Marsat","S.",""],["Martelli","F.",""],["Martin","I. W.",""],["Martin","R. M.",""],["Martinez","M.",""],["Martinez","V. A.",""],["Martinez","V.",""],["Martinovic","K.",""],["Martynov","D. V.",""],["Marx","E. J.",""],["Masalehdan","H.",""],["Mason","K.",""],["Massera","E.",""],["Masserot","A.",""],["Masso-Reid","M.",""],["Mastrogiovanni","S.",""],["Matas","A.",""],["Mateu-Lucena","M.",""],["Matichard","F.",""],["Matiushechkina","M.",""],["Mavalvala","N.",""],["McCann","J. J.",""],["McCarthy","R.",""],["McClelland","D. E.",""],["McClincy","P. K.",""],["McCormick","S.",""],["McCuller","L.",""],["McGhee","G. I.",""],["McGuire","S. C.",""],["McIsaac","C.",""],["McIver","J.",""],["McRae","T.",""],["McWilliams","S. T.",""],["Meacher","D.",""],["Mehmet","M.",""],["Mehta","A. K.",""],["Meijer","Q.",""],["Melatos","A.",""],["Melchor","D. A.",""],["Mendell","G.",""],["Menendez-Vazquez","A.",""],["Menoni","C. S.",""],["Mercer","R. A.",""],["Mereni","L.",""],["Merfeld","K.",""],["Merilh","E. L.",""],["Merritt","J. D.",""],["Merzougui","M.",""],["Meshkov","S.",""],["Messenger","C.",""],["Messick","C.",""],["Meyers","P. M.",""],["Meylahn","F.",""],["Mhaske","A.",""],["Miani","A.",""],["Miao","H.",""],["Michaloliakos","I.",""],["Michel","C.",""],["Michimura","Y.",""],["Middleton","H.",""],["Mihaylov","D. P.",""],["Milano","L.",""],["Miller","A. L.",""],["Miller","A.",""],["Miller","B.",""],["Millhouse","M.",""],["Mills","J. C.",""],["Milotti","E.",""],["Minenkov","Y.",""],["Mio","N.",""],["Mir","Ll. M.",""],["Miravet-Ten\u00e9s","M.",""],["Mishkin","A.",""],["Mishra","C.",""],["Mishra","T.",""],["Mistry","T.",""],["Mitra","S.",""],["Mitrofanov","V. P.",""],["Mitselmakher","G.",""],["Mittleman","R.",""],["Miyakawa","O.",""],["Miyo","K.",""],["Miyoki","S.",""],["Mo","Geoffrey",""],["Modafferi","L. M.",""],["Moguel","E.",""],["Mogushi","K.",""],["Mohapatra","S. R. P.",""],["Mohite","S. R.",""],["Molina","I.",""],["Molina-Ruiz","M.",""],["Mondin","M.",""],["Montani","M.",""],["Moore","C. J.",""],["Moragues","J.",""],["Moraru","D.",""],["Morawski","F.",""],["More","A.",""],["Moreno","C.",""],["Moreno","G.",""],["Mori","Y.",""],["Morisaki","S.",""],["Morisue","N.",""],["Moriwaki","Y.",""],["Mours","B.",""],["Mow-Lowry","C. M.",""],["Mozzon","S.",""],["Muciaccia","F.",""],["130","",""],["Mukherjee","Arunava",""],["Mukherjee","D.",""],["Mukherjee","Soma",""],["Mukherjee","Subroto",""],["Mukherjee","Suvodip",""],["Mukund","N.",""],["Mullavey","A.",""],["Munch","J.",""],["Muniz","E. A.",""],["Murray","P. G.",""],["Musenich","R.",""],["Muusse","S.",""],["Nadji","S. L.",""],["Nagano","K.",""],["Nagar","A.",""],["Nakamura","K.",""],["Nakano","H.",""],["Nakano","M.",""],["Nakayama","Y.",""],["Napolano","V.",""],["Nardecchia","I.",""],["Narola","H.",""],["Naticchioni","L.",""],["Nayak","B.",""],["Nayak","R. K.",""],["Neil","B. F.",""],["Neilson","J.",""],["Nelson","A.",""],["Nelson","T. J. N.",""],["Nery","M.",""],["Neubauer","P.",""],["Neunzert","A.",""],["Ng","K. Y.",""],["Ng","S. W. S.",""],["Nguyen","C.",""],["Nguyen","P.",""],["Nguyen","T.",""],["Quynh","L. Nguyen",""],["Ni","J.",""],["Ni","W. T.",""],["Nichols","S. A.",""],["Nishimoto","T.",""],["Nishizawa","A.",""],["Nissanke","S.",""],["Nitoglia","E.",""],["Nocera","F.",""],["Norman","M.",""],["North","C.",""],["Nozaki","S.",""],["Nurbek","G.",""],["Nuttall","L. K.",""],["Obayashi","Y.",""],["Oberling","J.",""],["O'Brien","B. D.",""],["O'Dell","J.",""],["Oelker","E.",""],["Ogaki","W.",""],["Oganesyan","G.",""],["Oh","J. J.",""],["Oh","K.",""],["Oh","S. H.",""],["Ohashi","M.",""],["Ohashi","T.",""],["Ohkawa","M.",""],["Ohme","F.",""],["Ohta","H.",""],["Okada","M. A.",""],["Okutani","Y.",""],["Olivetto","C.",""],["Oohara","K.",""],["Oram","R.",""],["O'Reilly","B.",""],["Ormiston","R. G.",""],["Ormsby","N. D.",""],["O'Shaughnessy","R.",""],["O'Shea","E.",""],["Oshino","S.",""],["Ossokine","S.",""],["Osthelder","C.",""],["Otabe","S.",""],["Ottaway","D. J.",""],["Overmier","H.",""],["Pace","A. E.",""],["Pagano","G.",""],["Pagano","R.",""],["Page","M. A.",""],["Pagliaroli","G.",""],["Pai","A.",""],["Pai","S. A.",""],["Pal","S.",""],["Palamos","J. R.",""],["Palashov","O.",""],["Palomba","C.",""],["Pan","H.",""],["Pan","K. C.",""],["Panda","P. K.",""],["Pang","P. T. H.",""],["Pankow","C.",""],["Pannarale","F.",""],["Pant","B. C.",""],["Panther","F. H.",""],["Paoletti","F.",""],["Paoli","A.",""],["Paolone","A.",""],["Pappas","G.",""],["Parisi","A.",""],["Park","H.",""],["Park","J.",""],["Parker","W.",""],["Pascucci","D.",""],["Pasqualetti","A.",""],["Passaquieti","R.",""],["Passuello","D.",""],["Patel","M.",""],["Pathak","M.",""],["Patricelli","B.",""],["Patron","A. S.",""],["Paul","S.",""],["Payne","E.",""],["Pedraza","M.",""],["Pedurand","R.",""],["Pegoraro","M.",""],["Pele","A.",""],["Arellano","F. E. Pena",""],["Penano","S.",""],["Penn","S.",""],["Perego","A.",""],["Pereira","A.",""],["Pereira","T.",""],["Perez","C. J.",""],["P\u00e8rigois","C.",""],["Perkins","C. C.",""],["Perreca","A.",""],["Perri\u00e9s","S.",""],["Pesios","D.",""],["Petermann","J.",""],["Petterson","D.",""],["Pfeiffer","H. P.",""],["Pham","H.",""],["Pham","K. A.",""],["Phukon","K. S.",""],["Phurailatpam","H.",""],["Piccinni","O. J.",""],["Pichot","M.",""],["Piendibene","M.",""],["Piergiovanni","F.",""],["Pierini","L.",""],["Pierro","V.",""],["Pillant","G.",""],["Pillas","M.",""],["Pilo","F.",""],["Pinard","L.",""],["Pineda-Bosque","C.",""],["Pinto","I. M.",""],["Pinto","M.",""],["Piotrzkowski","B. J.",""],["Piotrzkowski","K.",""],["Pirello","M.",""],["Pitkin","M. D.",""],["Placidi","A.",""],["Placidi","E.",""],["Planas","M. L.",""],["Plastino","W.",""],["Pluchar","C.",""],["Poggiani","R.",""],["Polini","E.",""],["Pong","D. Y. T.",""],["Ponrathnam","S.",""],["Porter","E. K.",""],["Poulton","R.",""],["Poverman","A.",""],["Powell","J.",""],["Pracchia","M.",""],["Pradier","T.",""],["Prajapati","A. K.",""],["Prasai","K.",""],["Prasanna","R.",""],["Pratten","G.",""],["Principe","M.",""],["Prodi","G. A.",""],["Prokhorov","L.",""],["Prosposito","P.",""],["Prudenzi","L.",""],["Puecher","A.",""],["Punturo","M.",""],["Puosi","F.",""],["Puppo","P.",""],["Purrer","M.",""],["Qi","H.",""],["Quartey","N.",""],["Quetschke","V.",""],["Quinonez","P. J.",""],["Quitzow-James","R.",""],["Raab","F. J.",""],["Raaijmakers","G.",""],["Radkins","H.",""],["Radulesco","N.",""],["Raffai","P.",""],["Rail","S. X.",""],["Raja","S.",""],["Rajan","C.",""],["Ramirez","K. E.",""],["Ramirez","T. D.",""],["Ramos-Buades","A.",""],["Rana","J.",""],["Rapagnani","P.",""],["Ray","A.",""],["Raymond","V.",""],["Raza","N.",""],["Razzano","M.",""],["Read","J.",""],["Rees","L. A.",""],["Regimbau","T.",""],["Rei","L.",""],["Reid","S.",""],["Reid","S. W.",""],["Reitze","D. H.",""],["Relton","P.",""],["Renzini","A.",""],["Rettegno","P.",""],["Revenu","B.",""],["Reza","A.",""],["Rezac","M.",""],["Ricci","F.",""],["Richards","D.",""],["Richardson","J. W.",""],["Richardson","L.",""],["Riemenschneider","G.",""],["Riles","K.",""],["Rinaldi","S.",""],["Rink","K.",""],["Robertson","N. A.",""],["Robie","R.",""],["Robinet","F.",""],["Rocchi","A.",""],["Rodriguez","S.",""],["Rolland","L.",""],["Rollins","J. G.",""],["Romanelli","M.",""],["Romano","R.",""],["Romel","C. L.",""],["Romero","A.",""],["Romero-Shaw","I. M.",""],["Romie","J. H.",""],["Ronchini","S.",""],["Rosa","L.",""],["Rose","C. A.",""],["Rosinska","D.",""],["Ross","M. P.",""],["Rowan","S.",""],["Rowlinson","S. J.",""],["Roy","S.",""],["Roy","Santosh",""],["Roy","Soumen",""],["Rozza","D.",""],["Ruggi","P.",""],["Ruiz-Rocha","K.",""],["Ryan","K.",""],["Sachdev","S.",""],["Sadecki","T.",""],["Sadiq","J.",""],["Saha","S.",""],["Saito","Y.",""],["Sakai","K.",""],["Sakellariadou","M.",""],["Sakon","S.",""],["Salafia","O. S.",""],["Salces-Carcoba","F.",""],["Salconi","L.",""],["Saleem","M.",""],["Salemi","F.",""],["Samajdar","A.",""],["Sanchez","E. J.",""],["Sanchez","J. H.",""],["Sanchez","L. E.",""],["Sanchis-Gual","N.",""],["Sanders","J. R.",""],["Sanuy","A.",""],["Saravanan","T. R.",""],["Sarin","N.",""],["Sassolas","B.",""],["Satari","H.",""],["Sauter","O.",""],["Savage","R. L.",""],["Savant","V.",""],["Sawada","T.",""],["Sawant","H. L.",""],["Sayah","S.",""],["Schaetzl","D.",""],["Scheel","M.",""],["Scheuer","J.",""],["Schiworski","M. G.",""],["Schmidt","P.",""],["Schmidt","S.",""],["Schnabel","R.",""],["Schneewind","M.",""],["Schofield","R. M. S.",""],["Schonbeck","A.",""],["Schulte","B. W.",""],["Schutz","B. F.",""],["Schwartz","E.",""],["Scott","J.",""],["Scott","S. M.",""],["Seglar-Arroyo","M.",""],["Sekiguchi","Y.",""],["Sellers","D.",""],["Sengupta","A. S.",""],["Sentenac","D.",""],["Seo","E. G.",""],["Sequino","V.",""],["Sergeev","A.",""],["Setyawati","Y.",""],["Shaffer","T.",""],["Shahriar","M. S.",""],["Shaikh","M. A.",""],["Shams","B.",""],["Shao","L.",""],["Sharma","A.",""],["Sharma","P.",""],["Shawhan","P.",""],["Shcheblanov","N. S.",""],["Sheela","A.",""],["Shikano","Y.",""],["Shikauchi","M.",""],["Shimizu","H.",""],["Shimode","K.",""],["Shinkai","H.",""],["Shishido","T.",""],["Shoda","A.",""],["Shoemaker","D. H.",""],["Shoemaker","D. M.",""],["ShyamSundar","S.",""],["Sieniawska","M.",""],["Sigg","D.",""],["Silenzi","L.",""],["Singer","L. P.",""],["Singh","D.",""],["Singh","M. K.",""],["Singh","N.",""],["Singha","A.",""],["Sintes","A. M.",""],["Sipala","V.",""],["Skliris","V.",""],["Slagmolen","B. J. J.",""],["Slaven-Blair","T. J.",""],["Smetana","J.",""],["Smith","J. R.",""],["Smith","L.",""],["Smith","R. J. E.",""],["Soldateschi","J.",""],["Somala","S. N.",""],["Somiya","K.",""],["Song","I.",""],["Soni","K.",""],["Soni","S.",""],["Sordini","V.",""],["Sorrentino","F.",""],["Sorrentino","N.",""],["Soulard","R.",""],["Souradeep","T.",""],["Sowell","E.",""],["Spagnuolo","V.",""],["Spencer","A. P.",""],["Spera","M.",""],["Spinicelli","P.",""],["Srivastava","A. K.",""],["Srivastava","V.",""],["Staats","K.",""],["Stachie","C.",""],["Stachurski","F.",""],["Steer","D. A.",""],["Steinlechner","J.",""],["Steinlechner","S.",""],["Stergioulas","N.",""],["Stops","D. J.",""],["Stover","M.",""],["Strain","K. A.",""],["Strang","L. C.",""],["Stratta","G.",""],["Strong","M. D.",""],["Strunk","A.",""],["Sturani","R.",""],["Stuver","A. L.",""],["Suchenek","M.",""],["Sudhagar","S.",""],["Sudhir","V.",""],["Sugimoto","R.",""],["Suh","H. G.",""],["Sullivan","A. G.",""],["Summerscales","T. Z.",""],["Sun","L.",""],["Sunil","S.",""],["Sur","A.",""],["Suresh","J.",""],["Sutton","P. J.",""],["Suzuki","Takamasa",""],["Suzuki","Takanori",""],["Suzuki","Toshikazu",""],["Swinkels","B. L.",""],["Szczepa\u0144czyk","M. J.",""],["Szewczyk","P.",""],["Tacca","M.",""],["Tagoshi","H.",""],["Tait","S. C.",""],["Takahashi","H.",""],["Takahashi","R.",""],["Takano","S.",""],["Takeda","H.",""],["Takeda","M.",""],["Talbot","C. J.",""],["Talbot","C.",""],["Tanaka","K.",""],["Tanaka","Taiki",""],["Tanaka","Takahiro",""],["Tanasijczuk","A. J.",""],["Tanioka","S.",""],["Tanner","D. B.",""],["Tao","D.",""],["Tao","L.",""],["Tapia","R. D.",""],["Martin","E. N. Tapia San",""],["Taranto","C.",""],["Taruya","A.",""],["Tasson","J. D.",""],["Tenorio","R.",""],["Terhune","J. E. S.",""],["Terkowski","L.",""],["Thirugnanasambandam","M. P.",""],["Thomas","M.",""],["Thomas","P.",""],["Thompson","E. E.",""],["Thompson","J. E.",""],["Thondapu","S. R.",""],["Thorne","K. A.",""],["Thrane","E.",""],["Tiwari","Shubhanshu",""],["Tiwari","Srishti",""],["Tiwari","V.",""],["Toivonen","A. M.",""],["Tolley","A. E.",""],["Tomaru","T.",""],["Tomura","T.",""],["Tonelli","M.",""],["Tornasi","Z.",""],["Torres-Forne","A.",""],["Torrie","C. I.",""],["Melo","I. Tosta e",""],["Toyra","D.",""],["Trapananti","A.",""],["Travasso","F.",""],["Traylor","G.",""],["Trevor","M.",""],["Tringali","M. C.",""],["Tripathee","A.",""],["Troiano","L.",""],["Trovato","A.",""],["Trozzo","L.",""],["Trudeau","R. J.",""],["Tsai","D.",""],["Tsang","K. W.",""],["Tsang","T.",""],["Tsao","J. S.",""],["Tse","M.",""],["Tso","R.",""],["Tsuchida","S.",""],["Tsukada","L.",""],["Tsuna","D.",""],["Tsutsui","T.",""],["Turbang","K.",""],["Turconi","M.",""],["Tuyenbayev","D.",""],["Ubhi","A. S.",""],["Uchiyama","T.",""],["Udall","R. P.",""],["Ueda","A.",""],["Uehara","T.",""],["Ueno","K.",""],["Ueshima","G.",""],["Unnikrishnan","C. S.",""],["Urban","A. L.",""],["Ushiba","T.",""],["Utina","A.",""],["Vajente","G.",""],["Vajpeyi","A.",""],["Valdes","G.",""],["Valentini","M.",""],["Valsan","V.",""],["van Bakel","N.",""],["van Beuzekom","M.",""],["van Dael","M.",""],["Brand","J. F. J. van den",""],["Broeck","C. Van Den",""],["Vander-Hyde","D. C.",""],["van Haevermaet","H.",""],["van Heijningen","J. V.",""],["van Putten","M. H. P. M.",""],["van Remortel","N.",""],["Vardaro","M.",""],["Vargas","A. F.",""],["Varma","V.",""],["Vasuth","M.",""],["Vecchio","A.",""],["Vedovato","G.",""],["Veitch","J.",""],["Veitch","P. J.",""],["Venneberg","J.",""],["Venugopalan","G.",""],["Verkindt","D.",""],["Verma","P.",""],["Verma","Y.",""],["Vermeulen","S. M.",""],["Veske","D.",""],["Vetrano","F.",""],["Vicere","A.",""],["Vidyant","S.",""],["Viets","A. D.",""],["Vijaykumar","A.",""],["Villa-Ortega","V.",""],["Vinet","J. Y.",""],["Virtuoso","A.",""],["Vitale","S.",""],["Vocca","H.",""],["von Reis","E. R. G.",""],["von Wrangel","J. S. A.",""],["Vorvick","C.",""],["Vyatchanin","S. P.",""],["Wade","L. E.",""],["Wade","M.",""],["Wagner","K. J.",""],["Walet","R. C.",""],["Walker","M.",""],["Wallace","G. S.",""],["Wallace","L.",""],["Wang","J.",""],["Wang","J. Z.",""],["Wang","W. H.",""],["Ward","R. L.",""],["Warner","J.",""],["Was","M.",""],["Washimi","T.",""],["Washington","N. Y.",""],["Watchi","J.",""],["Weaver","B.",""],["Weaving","C. R.",""],["Webster","S. A.",""],["Weinert","M.",""],["Weinstein","A. J.",""],["Weiss","R.",""],["Weller","C. M.",""],["Weller","R. A.",""],["Wellmann","F.",""],["Wen","L.",""],["Wessels","P.",""],["Wette","K.",""],["Whelan","J. T.",""],["White","D. D.",""],["Whiting","B. F.",""],["Whittle","C.",""],["Wilken","D.",""],["Williams","D.",""],["Williams","M. J.",""],["Williamson","A. R.",""],["Willis","J. L.",""],["Willke","B.",""],["Wilson","D. J.",""],["Wipf","C. C.",""],["Wlodarczyk","T.",""],["Woan","G.",""],["Woehler","J.",""],["34","",""],["Wofford","J. K.",""],["Wong","D.",""],["Wong","I. C. F.",""],["Wright","M.",""],["Wu","C.",""],["Wu","D. S.",""],["Wu","H.",""],["Xiao","D. M. Wysocki L.",""],["Yamada","T.",""],["Yamamoto","288 H.",""],["Yamamoto","K.",""],["Yamamoto","T.",""],["Yamashita","K.",""],["Yamazaki","R.",""],["Yang","F. W.",""],["Yang","K. Z.",""],["Yang","L.",""],["Yang","Y. C.",""],["Yang","Y.",""],["Yang","Yang",""],["Yap","M. J.",""],["Yeeles","D. W.",""],["Yeh","S. W.",""],["Yelikar","A. B.",""],["Ying","M.",""],["Yokoyama","J.",""],["Yokozawa","T.",""],["Yoo","J.",""],["Yoshioka","T.",""],["Yu","Hang",""],["Yu","Haocun",""],["Yuzurihara","H.",""],["Zadrozny","A.",""],["Zanolin","M.",""],["Zeidler","S.",""],["Zelenova","T.",""],["Zendri","J. P.",""],["Zevin","M.",""],["Zhan","M.",""],["Zhang","H.",""],["Zhang","J.",""],["Zhang","L.",""],["Zhang","R.",""],["Zhang","T.",""],["Zhang","Y.",""],["Zhao","C.",""],["Zhao","G.",""],["Zhao","Y.",""],["Zhao","Yue",""],["Zhou","R.",""],["Zhou","Z.",""],["Zhu","X. J.",""],["Zhu","Z. H.",""],["Zimmerman","A. B.",""],["Zucker","M. E.",""],["Zweizig","J.",""],["Collaboration","The LIGO Scientific",""],["Collaboration","the Virgo",""],["Collaboration","the KAGRA",""]]}
{"id":"2308.13667","submitter":"Janusz Petkowski","authors":"Sara Seager, Janusz J. Petkowski, Jingcheng Huang, Zhuchang Zhan, Sai\n  Ravela, William Bains","title":"Fully fluorinated non-carbon compounds NF3 and SF6 as ideal\n  technosignature gases","comments":"Published as a part of the special collection \"Exoplanets\" in\n  Scientific Reports","journal-ref":"Scientific Reports 13.1 (2023): 13576","doi":"10.1038/s41598-023-39972-z","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Waste gas products from technological civilizations may accumulate in an\nexoplanet atmosphere to detectable levels. We propose nitrogen trifluoride\n(NF3) and sulfur hexafluoride (SF6) as ideal technosignature gases. Earth life\navoids producing or using any N-F or S-F bond-containing molecules and makes no\nfully fluorinated molecules with any element. NF3 and SF6 may be universal\ntechnosignatures owing to their special industrial properties, which unlike\nbiosignature gases, are not species-dependent. Other key relevant qualities of\nNF3 and SF6 are: their extremely low water solubility, unique spectral\nfeatures, and long atmospheric lifetimes. NF3 has no non-human sources and was\nabsent from Earth's pre-industrial atmosphere. SF6 is released in only tiny\namounts from fluorine-containing minerals, and is likely produced in only\ntrivial amounts by volcanic eruptions. We propose a strategy to rule out SF6's\nabiotic source by simultaneous observations of SiF4, which is released by\nvolcanoes in an order of magnitude higher abundance than SF6. Other fully\nfluorinated human-made molecules are of interest, but their chemical and\nspectral properties are unavailable. We summarize why life on Earth-and perhaps\nlife elsewhere-avoids using F. We caution, however, that we cannot definitively\ndisentangle an alien biochemistry byproduct from a technosignature gas.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:48:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Seager","Sara",""],["Petkowski","Janusz J.",""],["Huang","Jingcheng",""],["Zhan","Zhuchang",""],["Ravela","Sai",""],["Bains","William",""]]}
{"id":"2308.13668","submitter":"Bradley E. Schaefer","authors":"Bradley E. Schaefer (Louisiana State University)","title":"The recurrent nova T CrB had prior eruptions observed near December 1787\n  and October 1217 AD","comments":"In press with the Journal for the History of Astronomy","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The famous recurrent nova (RN) T Coronae Borealis (T CrB) has had observed\neruptions peaking at a visual magnitude of 2.0 in the years 1866 and 1946,\nwhile a third eruption is now expected for the year 2024.4+-0.3. Each RN has\nvery similar light curves of eruptions that come with a fairly even-spacing in\ntime, for which T CrB has a recurrence timescale near 80 years. So it is\nreasonable to look backwards in time for prior eruptions, around 1786, and so\non back. I have investigated two long-lost suggestions that T CrB was seen in\neruption in the years 1217 and 1787. (1) In a catalog published in 1789, the\nReverend Francis Wollaston reports an astrometric position for a star that is\nexactly on top of T CrB. From his letters, these observations were made on at\nleast four occassions with both a large and small telescope, within a few days\nbefore 1787 December 28. Wollaston's limiting magnitude for his astrometry is\nnear 7.8 mag, so T CrB would have to have been in eruption. With other\ntransients strongly rejected, the only way that Wollaston could get the\ncoordinates was to have measured the coordinates of T CrB itself during an\neruption. (2) The 1217 event has an eyewitness report written by Abbott\nBurchard of Upsberg as a fast-rising stellar point-source (\"stella\") in Corona\nBorealis that \"shone with great light\", lasted for \"many days\", and was\nascribed as being a \"wonderful sign\". This event cannot be a report of a comet,\nbecause Burchard used the term for a star (\"stella\") and not for a comet, and\nbecause Burchard had the omen being very positive, with such being impossible\nfor comets that are universally the worst of omens. The reported event is just\nas expected for a prior eruption of T CrB, and all other possibilities are\nstrongly rejected, so the case for the 1217 eruption of T CrB is strong.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:52:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Schaefer","Bradley E.","","Louisiana State University"]]}
{"id":"2308.13669","submitter":"Lars Winther Christensen","authors":"Lars Winther Christensen, Sergio Estrada, Li Liang, Peder Thompson,\n  and Junpeng Wang","title":"One-sided Gorenstein rings","comments":"28 pp","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Distinctive characteristics of Iwanaga--Gorenstein rings are typically\nunderstood through their intrinsic symmetry. We show that several of those that\npertain to the Gorenstein global dimensions carry over to the one-sided\nsituation, even without the noetherian hypothesis. Our results yield new\nrelations among homological invariants related to the Gorenstein property, not\nonly Gorenstein global dimensions but also the suprema of projective/injective\ndimensions of injective/projective modules and finitistic dimensions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:59:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Christensen","Lars Winther",""],["Estrada","Sergio",""],["Liang","Li",""],["Thompson","Peder",""],["Wang","Junpeng",""]]}
{"id":"2308.13670","submitter":"Juyoung Yun","authors":"Juyoung Yun","title":"Linear Oscillation: The Aesthetics of Confusion for Vision Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.NE","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Activation functions are the linchpins of deep learning, profoundly\ninfluencing both the representational capacity and training dynamics of neural\nnetworks. They shape not only the nature of representations but also optimize\nconvergence rates and enhance generalization potential. Appreciating this\ncritical role, we present the Linear Oscillation (LoC) activation function,\ndefined as $f(x) = x \\times \\sin(\\alpha x + \\beta)$. Distinct from conventional\nactivation functions which primarily introduce non-linearity, LoC seamlessly\nblends linear trajectories with oscillatory deviations. The nomenclature\n``Linear Oscillation'' is a nod to its unique attribute of infusing linear\nactivations with harmonious oscillations, capturing the essence of the\n'Importance of Confusion'. This concept of ``controlled confusion'' within\nnetwork activations is posited to foster more robust learning, particularly in\ncontexts that necessitate discerning subtle patterns. Our empirical studies\nreveal that, when integrated into diverse neural architectures, the LoC\nactivation function consistently outperforms established counterparts like ReLU\nand Sigmoid. The stellar performance exhibited by the avant-garde Vision\nTransformer model using LoC further validates its efficacy. This study\nilluminates the remarkable benefits of the LoC over other prominent activation\nfunctions. It champions the notion that intermittently introducing deliberate\ncomplexity or ``confusion'' during training can spur more profound and nuanced\nlearning. This accentuates the pivotal role of judiciously selected activation\nfunctions in shaping the future of neural network training.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 20:59:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yun","Juyoung",""]]}
{"id":"2308.13671","submitter":"Mohammad Javad Rajabi","authors":"Mohammad Javad Rajabi, Morteza Mirzai, Ahmad Nickabadi","title":"Enhancing Landmark Detection in Cluttered Real-World Scenarios with\n  Vision Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Visual place recognition tasks often encounter significant challenges in\nlandmark detection due to the presence of irrelevant objects such as humans,\ncars, and trees, despite the remarkable progress achieved by previous models,\nespecially in the context of transformers. To address this issue, we propose a\nnovel method that effectively leverages the strengths of vision transformers.\nBy employing a meticulous selection process, our approach identifies and\nisolates specific patches within the image that correspond to occluding\nobjects. To evaluate the efficacy of our method, we created augmented datasets\nand conducted comprehensive testing. The results demonstrate the superior\naccuracy achieved by our proposed approach. This research contributes to the\nadvancement of landmark detection in visual place recognition and shows the\npotential of leveraging vision transformers to overcome challenges posed by\ncluttered real-world scenarios.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:01:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rajabi","Mohammad Javad",""],["Mirzai","Morteza",""],["Nickabadi","Ahmad",""]]}
{"id":"2308.13672","submitter":"Qian Xu","authors":"Qian Xu","title":"Fusion of Infrared and Visible Images based on Spatial-Channel\n  Attentional Mechanism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the study, we present AMFusionNet, an innovative approach to infrared and\nvisible image fusion (IVIF), harnessing the power of multiple kernel sizes and\nattention mechanisms. By assimilating thermal details from infrared images with\ntexture features from visible sources, our method produces images enriched with\ncomprehensive information. Distinct from prevailing deep learning\nmethodologies, our model encompasses a fusion mechanism powered by multiple\nconvolutional kernels, facilitating the robust capture of a wide feature\nspectrum. Notably, we incorporate parallel attention mechanisms to emphasize\nand retain pivotal target details in the resultant images. Moreover, the\nintegration of the multi-scale structural similarity (MS-SSIM) loss function\nrefines network training, optimizing the model for IVIF task. Experimental\nresults demonstrate that our method outperforms state-of-the-art algorithms in\nterms of quality and quantity. The performance metrics on publicly available\ndatasets also show significant improvement\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:05:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Qian",""]]}
{"id":"2308.13673","submitter":"Aksel Kaastrup Rasmussen","authors":"Babak Maboudi Afkham, Kim Knudsen, Aksel Kaastrup Rasmussen and Tanja\n  Tarvainen","title":"A Bayesian approach for consistent reconstruction of inclusions","comments":"37 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.AP stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers a Bayesian approach for inclusion detection in nonlinear\ninverse problems using two known and popular push-forward prior distributions:\nthe star-shaped and level set prior distributions. We analyze the convergence\nof the corresponding posterior distributions in a small measurement noise\nlimit. The methodology is general; it works for priors arising from any\nH\\\"older continuous transformation of Gaussian random fields and is applicable\nto a range of inverse problems. The level set and star-shaped prior\ndistributions are examples of push-forward priors under H\\\"older continuous\ntransformations that take advantage of the structure of inclusion detection\nproblems. We show that the corresponding posterior mean converges to the ground\ntruth in a proper probabilistic sense. Numerical tests on a two-dimensional\nquantitative photoacoustic tomography problem showcase the approach. The\nresults highlight the convergence properties of the posterior distributions and\nthe ability of the methodology to detect inclusions with sufficiently regular\nboundaries.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:18:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Afkham","Babak Maboudi",""],["Knudsen","Kim",""],["Rasmussen","Aksel Kaastrup",""],["Tarvainen","Tanja",""]]}
{"id":"2308.13674","submitter":"Clare C. Yu","authors":"D. L. Mickelsen, Herve M. Carruzzo, and Clare C. Yu","title":"Interacting Two-Level Systems as a Source of 1/f Noise in Silicon\n  Quantum Dot Qubits","comments":"14 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Charge noise in silicon quantum dots has been observed to have a 1/f\nspectrum. We propose a model in which a pair of quantum dots are coupled to a\n2D bath of fluctuating two level systems (TLS) that have electric dipole\nmoments and that interact with each other, i.e., with the other fluctuators.\nThese interactions are primarily via the elastic strain field. We use a 2D\nnearest-neighbor Ising spin glass to represent these elastic interactions and\nto simulate the dynamics of the bath of electric dipole fluctuators in the\npresence of a ground plane representing metal gates above the oxide layer\ncontaining the fluctuators. The interactions between the TLS cause the energy\nsplitting of individual fluctuators to change with time. We calculate the\nresulting fluctuations in the electric potential at the two quantum dots that\nlie below the oxide layer. We find that 1/f electric potential noise spectra at\nthe quantum dots and cross correlation in the noise between the two quantum\ndots are in qualitative agreement with experiment. Our simulations find that\nthe cross correlations decrease exponentially with increasing quantum dot\nseparation.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:19:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mickelsen","D. L.",""],["Carruzzo","Herve M.",""],["Yu","Clare C.",""]]}
{"id":"2308.13675","submitter":"Carlos Bertulani","authors":"C.A. Bertulani","title":"Core destruction in knockout reactions","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A model is presented to calculate projectile core destruction in knockout\nreactions. It incorporates physics arguments similar to the formulation of the\nstate of the art theory to calculate stripping and diffraction dissociation\ncross sections in heavy ion collisions with bombarding energies around 100\nMeV/nucleon and larger. It is shown that secondary collisions between the\nincoming and struck nucleons and the projectile core decrease the core survival\nprobability by as much as 9.5\\%. However, no clear evidence is found for\nreduction of the cross section with increasing binding energy of the removed\nnucleon.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:24:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bertulani","C. A.",""]]}
{"id":"2308.13676","submitter":"Pouya Pezeshkpour","authors":"Vishwas Mruthyunjaya, Pouya Pezeshkpour, Estevam Hruschka, Nikita\n  Bhutani","title":"Rethinking Language Models as Symbolic Knowledge Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Symbolic knowledge graphs (KGs) play a pivotal role in knowledge-centric\napplications such as search, question answering and recommendation. As\ncontemporary language models (LMs) trained on extensive textual data have\ngained prominence, researchers have extensively explored whether the parametric\nknowledge within these models can match up to that present in knowledge graphs.\nVarious methodologies have indicated that enhancing the size of the model or\nthe volume of training data enhances its capacity to retrieve symbolic\nknowledge, often with minimal or no human supervision. Despite these\nadvancements, there is a void in comprehensively evaluating whether LMs can\nencompass the intricate topological and semantic attributes of KGs, attributes\ncrucial for reasoning processes. In this work, we provide an exhaustive\nevaluation of language models of varying sizes and capabilities. We construct\nnine qualitative benchmarks that encompass a spectrum of attributes including\nsymmetry, asymmetry, hierarchy, bidirectionality, compositionality, paths,\nentity-centricity, bias and ambiguity. Additionally, we propose novel\nevaluation metrics tailored for each of these attributes. Our extensive\nevaluation of various LMs shows that while these models exhibit considerable\npotential in recalling factual information, their ability to capture intricate\ntopological and semantic traits of KGs remains significantly constrained. We\nnote that our proposed evaluation metrics are more reliable in evaluating these\nabilities than the existing metrics. Lastly, some of our benchmarks challenge\nthe common notion that larger LMs (e.g., GPT-4) universally outshine their\nsmaller counterparts (e.g., BERT).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:25:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mruthyunjaya","Vishwas",""],["Pezeshkpour","Pouya",""],["Hruschka","Estevam",""],["Bhutani","Nikita",""]]}
{"id":"2308.13677","submitter":"Jeffrey Hicks","authors":"Andrew Hanlon, Jeff Hicks, Oleg Lazarev","title":"Relating categorical dimensions in topology and symplectic geometry","comments":"38 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AT math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study several notions of dimension for (pre-)triangulated categories\nnaturally arising from topology and symplectic geometry. We prove new bounds on\nthese dimensions and raise several questions for further investigation. For\ninstance, we relate the Rouquier dimension of the wrapped Fukaya category of\neither the cotangent bundle of smooth manifold $M$ or more generally a\nWeinstein domain $X$ to quantities of geometric interest. These quantities\ninclude the minimum number of critical values of a Morse function on $M$, the\nLusternik-Schnirelmann category of $M$, the number of distinct action values of\na Hamiltonian diffeomorphism of $X$, and the smallest $n$ such that $X$ admits\na Weinstein embedding into $\\mathbb{R}^{2n+1}$. Along the way, we introduce a\nnotion of the Lusternik-Schnirelmann category for dg-categories and construct\nexact Lagrangian cobordisms for restriction to a Liouville subdomain.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:31:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hanlon","Andrew",""],["Hicks","Jeff",""],["Lazarev","Oleg",""]]}
{"id":"2308.13678","submitter":"Yu Ji","authors":"Xinyuan Li, Yu Ji, Yanchen Liu, Xiaochen Hu, Jinwei Ye and Changxi\n  Zheng","title":"Textureless Deformable Surface Reconstruction with Invisible Markers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Reconstructing and tracking deformable surface with little or no texture has\nposed long-standing challenges. Fundamentally, the challenges stem from\ntextureless surfaces lacking features for establishing cross-image\ncorrespondences. In this work, we present a novel type of markers to\nproactively enrich the object's surface features, and thereby ease the 3D\nsurface reconstruction and correspondence tracking. Our markers are made of\nfluorescent dyes, visible only under the ultraviolet (UV) light and invisible\nunder regular lighting condition. Leveraging the markers, we design a\nmulti-camera system that captures surface deformation under the UV light and\nthe visible light in a time multiplexing fashion. Under the UV light, markers\non the object emerge to enrich its surface texture, allowing high-quality 3D\nshape reconstruction and tracking. Under the visible light, markers become\ninvisible, allowing us to capture the object's original untouched appearance.\nWe perform experiments on various challenging scenes, including hand gestures,\nfacial expressions, waving cloth, and hand-object interaction. In all these\ncases, we demonstrate that our system is able to produce robust, high-quality\n3D reconstruction and tracking.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:35:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Xinyuan",""],["Ji","Yu",""],["Liu","Yanchen",""],["Hu","Xiaochen",""],["Ye","Jinwei",""],["Zheng","Changxi",""]]}
{"id":"2308.13679","submitter":"Jon Alvarez Justo","authors":"Jon A. Justo, Joseph Garrett, Dennis D. Langer, Marie B. Henriksen,\n  Radu T. Ionescu, and Tor A. Johansen","title":"An Open Hyperspectral Dataset with Sea-Land-Cloud Ground-Truth from the\n  HYPSO-1 Satellite","comments":"5 pages, 4 figures, to be published in IEEE Proceedings, presented at\n  WHISPERS2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hyperspectral Imaging, employed in satellites for space remote sensing, like\nHYPSO-1, faces constraints due to few labeled data sets, affecting the training\nof AI models demanding these ground-truth annotations. In this work, we\nintroduce The HYPSO-1 Sea-Land-Cloud-Labeled Dataset, an open dataset with 200\ndiverse hyperspectral images from the HYPSO-1 mission, available in both raw\nand calibrated forms for scientific research in Earth observation. Moreover, 38\nof these images from different countries include ground-truth labels at\npixel-level totaling about 25 million spectral signatures labeled for\nsea/land/cloud categories. To demonstrate the potential of the dataset and its\nlabeled subset, we have additionally optimized a deep learning model (1D Fully\nConvolutional Network), achieving superior performance to the current state of\nthe art. The complete dataset, ground-truth labels, deep learning model, and\nsoftware code are openly accessible for download at the website\nhttps://ntnu-smallsat-lab.github.io/hypso1_sea_land_clouds_dataset/ .\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:35:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Justo","Jon A.",""],["Garrett","Joseph",""],["Langer","Dennis D.",""],["Henriksen","Marie B.",""],["Ionescu","Radu T.",""],["Johansen","Tor A.",""]]}
{"id":"2308.13680","submitter":"Nabil Ibtehaz","authors":"Nabil Ibtehaz, Daisuke Kihara","title":"ACC-UNet: A Completely Convolutional UNet model for the 2020s","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This decade is marked by the introduction of Vision Transformer, a radical\nparadigm shift in broad computer vision. A similar trend is followed in medical\nimaging, UNet, one of the most influential architectures, has been redesigned\nwith transformers. Recently, the efficacy of convolutional models in vision is\nbeing reinvestigated by seminal works such as ConvNext, which elevates a ResNet\nto Swin Transformer level. Deriving inspiration from this, we aim to improve a\npurely convolutional UNet model so that it can be on par with the\ntransformer-based models, e.g, Swin-Unet or UCTransNet. We examined several\nadvantages of the transformer-based UNet models, primarily long-range\ndependencies and cross-level skip connections. We attempted to emulate them\nthrough convolution operations and thus propose, ACC-UNet, a completely\nconvolutional UNet model that brings the best of both worlds, the inherent\ninductive biases of convnets with the design decisions of transformers.\nACC-UNet was evaluated on 5 different medical image segmentation benchmarks and\nconsistently outperformed convnets, transformers, and their hybrids. Notably,\nACC-UNet outperforms state-of-the-art models Swin-Unet and UCTransNet by $2.64\n\\pm 2.54\\%$ and $0.45 \\pm 1.61\\%$ in terms of dice score, respectively, while\nusing a fraction of their parameters ($59.26\\%$ and $24.24\\%$). Our codes are\navailable at https://github.com/kiharalab/ACC-UNet.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:39:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ibtehaz","Nabil",""],["Kihara","Daisuke",""]]}
{"id":"2308.13681","submitter":"Valentina Martelli","authors":"A. Henriques, D. M. N. Oliveira, M. Baksi, M. Naveed, W. H. Brito, J.\n  Larrea-Jimen\\'ez, D. Kumah, S. Wirth, and V. Martelli","title":"Thermal conductivity of Barium Bismuthate at low temperatures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.other cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The perovskite BaBiO$_3$ crystallizes in a cubic structure and undergoes\nstructural transitions toward lower symmetry phases upon cooling. The two\nlow-temperature monoclinic phases are insulating, and the origin of this\nunexpected non-metallic character has been under debate. Both monoclinic phases\nexhibit tilting and breathing distortions, which are connected with the\ninsulating nature of this compound and may have important effects on phononic\nheat conductivity. Here, we report the first thermal conductivity measurement,\n$\\kappa$(T), in pristine polycrystalline BaBiO$_3$ from 1.5 K to 310 K. At low\nand intermediate temperatures, we observe features reminiscent of a glass-like\nbehavior, whereas at high-temperatures we find a downturn - typical of a\ncrystalline solid. We compare our findings with available data of other\nrecently investigated perovskite oxides displaying similar temperature\ndependence.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:39:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Henriques","A.",""],["Oliveira","D. M. N.",""],["Baksi","M.",""],["Naveed","M.",""],["Brito","W. H.",""],["Larrea-Jimen\u00e9z","J.",""],["Kumah","D.",""],["Wirth","S.",""],["Martelli","V.",""]]}
{"id":"2308.13682","submitter":"Federico Scavia","authors":"Alexander Merkurjev, Federico Scavia","title":"On the Massey Vanishing Conjecture and Formal Hilbert 90","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p$ be a prime number, let $G$ be a profinite group, let $\\theta\\colon\nG\\to \\mathbb{Z}_p^{\\times}$ be a continuous character, and for all $n\\geq 1$\nwrite $\\mathbb{Z}/p^n\\mathbb{Z}(1)$ for the twist of $\\mathbb{Z}/p^n\\mathbb{Z}$\nby the $G$-action. Suppose that $(G,\\theta)$ satisfies a formal version of\nHilbert's Theorem 90: for all open subgroups $H\\subset G$ and every $n\\geq 1$,\nthe map $H^1(H,\\mathbb{Z}/p^n\\mathbb{Z}(1))\\to\nH^1(H,\\mathbb{Z}/p\\mathbb{Z}(1))$ is surjective. We show that the Massey\nVanishing Conjecture for triple Massey products and some degenerate fourfold\nMassey products holds for $G$. A key step in our proof is the construction of a\nHilbert 90 module for $(G,\\theta)$: a discrete $G$-module $M$ which plays the\nrole of the Galois module $F_{\\text{sep}}^\\times$ for the absolute Galois group\nof a field $F$ of characteristic different from $p$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:50:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Merkurjev","Alexander",""],["Scavia","Federico",""]]}
{"id":"2308.13683","submitter":"Frederik Durhuus","authors":"Frederik L. Durhuus and Marco Beleggia and Cathrine Frandsen","title":"Conservation laws for interacting magnetic nanoparticles at finite\n  temperature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish a general Langevin Dynamics model of interacting, single-domain\nmagnetic nanoparticles in liquid suspension at finite temperature. The model\ncouples the LLG equation for the moment dynamics with the mechanical rotation\nand translation of the particles. Within this model, we derive expressions for\nthe instantaneous transfer of energy, linear and angular momentum between the\nparticles and with the environment. We demonstrate by numerical tests that all\nconserved quantities are fully accounted for, thus validating the model and the\ntransfer expressions. The energy transfer expressions derived here are also\nuseful analysis tools to decompose the instantaneous, non-equilibrium power\nloss at each MNP into different loss channels. To demonstrate the model\ncapabilities, we analyse simulations of MNP collisions and high-frequency\nhysteresis in terms of power and energy contributions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:52:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Durhuus","Frederik L.",""],["Beleggia","Marco",""],["Frandsen","Cathrine",""]]}
{"id":"2308.13684","submitter":"Joel Lucero-Bryan","authors":"Guram Bezhanishvili, Nick Bezhanishvili, Joel Lucero-Bryan, Jan van\n  Mill","title":"On Shehtman's Two Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide partial solutions to two problems posed by Shehtman concerning the\nmodal logic of the \\v{C}ech-Stone compactification of an ordinal space. We use\nthe Continuum Hypothesis to give a finite axiomatization of the modal logic of\n$\\beta(\\omega^2)$, thus resolving Shehtman's first problem for $n=2$. We also\ncharacterize modal logics arising from the \\v{C}ech-Stone compactification of\nan ordinal $\\gamma$ provided the Cantor normal form of $\\gamma$ satisfies an\nadditional condition. This gives a partial solution of Shehtman's second\nproblem.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:57:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bezhanishvili","Guram",""],["Bezhanishvili","Nick",""],["Lucero-Bryan","Joel",""],["van Mill","Jan",""]]}
{"id":"2308.13685","submitter":"Kiseok Yeon","authors":"Heejong Lee, Seungsu Lee, Kiseok Yeon","title":"The local solubility for homogeneous polynomials with random\n  coefficients over thin sets","comments":"All comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $d$ and $n$ be natural numbers greater or equal to $2$. Let $\\langle\n\\boldsymbol{a}, \\nu_{d,n}(\\boldsymbol{x})\\rangle\\in \\mathbb{Z}[\\boldsymbol{x}]$\nbe a homogeneous polynomial in $n$ variables of degree $d$ with integer\ncoefficients $\\boldsymbol{a}$, where $\\langle\\cdot,\\cdot\\rangle$ denotes the\ninner product, and $\\nu_{d,n}: \\mathbb{R}^n\\rightarrow \\mathbb{R}^N$ denotes\nthe Veronese embedding with $N=\\binom{n+d-1}{d}$. Consider a variety\n$V_{\\boldsymbol{a}}$ in $\\mathbb{P}^{n-1}$, defined by $\\langle \\boldsymbol{a},\n\\nu_{d,n}(\\boldsymbol{x})\\rangle=0.$ In this paper, we examine a set of these\nvarieties defined by\n  $$\\mathbb{V}^{P}_{d,n}(A)=\\{ V_{\\boldsymbol{a}}\\subset \\mathbb{P}^{n-1}|\\\nP(\\boldsymbol{a})=0,\\ \\|\\boldsymbol{a}\\|_{\\infty}\\leq A\\},$$\n  where $P\\in \\mathbb{Z}[\\boldsymbol{x}]$ is a non-singular form in $N$\nvariables of degree $k$ with $2 \\le k\\leq C({n,d})$ for some constant\n$C({n,d})$ depending at most on $n$ and $d$.\n  Suppose that $P(\\boldsymbol{a})=0$ has a nontrivial integer solution. We\nconfirm that the proportion of varieties $V_{\\boldsymbol{a}}$ in\n$\\mathbb{V}^{P}_{d,n}(A)$, which are everywhere locally soluble, converges to a\nconstant $c_P$ as $A\\rightarrow \\infty.$ In particular, if there exists\n$\\boldsymbol{b}\\in \\mathbb{Z}^N$ such that $P(\\boldsymbol{b})=0$ and the\nvariety $V_{\\boldsymbol{b}}$ in $\\mathbb{P}^{n-1}$ admits a smooth\n$\\mathbb{Q}$-rational point, the constant $c_P$ is positive.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:57:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Heejong",""],["Lee","Seungsu",""],["Yeon","Kiseok",""]]}
{"id":"2308.13686","submitter":"Olga Suvorova","authors":"V.M. Aynutdinov, V.A. Allakhverdyan, A.D. Avrorin, A.V. Avrorin, Z.\n  Barda\\v{c}ov\\'a, I.A. Belolaptikov, E.A. Bondarev, I.V. Borina, N.M. Budnev,\n  V.A. Chadymov, A.S. Chepurnov, V.Y. Dik, G.V. Domogatsky, A.A. Doroshenko, R.\n  Dvornick\\'y, A.N. Dyachok, Zh.-A.M. Dzhilkibaev, E. Eckerov\\'a, T.V. Elzhov,\n  L. Fajt, V.N. Fomin, A.R. Gafarov, K.V. Golubkov, N.S. Gorshkov, T. I. Gress,\n  K.G. Kebkal, I.V. Kharuk, E.V. Khramov, M.M. Kolbin, S.O. Koligaev, K.V.\n  Konischev, A.V. Korobchenko, A.P. Koshechkin, V.A. Kozhin, M.V. Kruglov, V.F.\n  Kulepov, Y.E. Lemeshev, M.B. Milenin, R.R. Mirgazov, D.V. Naumov, A.S.\n  Nikolaev, D.P. Petukhov, E.N. Pliskovsky, M.I. Rozanov, E.V. Ryabov, G.B.\n  Safronov, D. Seitova, B.A. Shaybonov, M.D. Shelepov, S.D. Shilkin, E.V.\n  Shirokov, F. \\v{S}imkovic, A.E. Sirenko, A.V. Skurikhin, A.G. Solovjev, M.N.\n  Sorokovikov, I. \\v{S}tekl, A.P. Stromakov, O.V. Suvorova, V.A. Tabolenko,\n  B.B. Ulzutuev, Y.V. Yablokova, D.N. Zaborov, S.I. Zavyalov, D.Y. Zvezdov A.K.\n  Erkenov, N.A. Kosogorov, Y.A. Kovalev, Y.Y. Kovalev, A.V. Plavin, A.V.\n  Popkov, A.B. Pushkarev, D.V. Semikoz, Y.V. Sotnikova, S.V. Troitsky","title":"Baikal-GVD Astrophysical Neutrino Candidate near the Blazar TXS~0506+056","comments":"9 pages, 6 figures, Contribution to the 38th International Cosmic\n  Rays Conference (ICRC2023). arXiv admin note: text overlap with\n  arXiv:2210.01650","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the observation of a rare neutrino event detected by Baikal-GVD\nin April 2021. The event GVD210418CA is the highest-energy cascade observed by\nBaikal-GVD so far from the direction below the horizon. The estimated cascade\nenergy is $224\\pm75$~TeV. The evaluated signalness parameter of GVD210418CA is\n97.1\\% using an assumption of the E$^{-2.46}$ spectrum of astrophysical\nneutrinos. The arrival direction of GVD210418CA is near the position of the\nwell-known radio blazar TXS~0506+056, with the angular distance being within a\n90\\% directional uncertainty region of the Baikal-GVD measurement. The event\nwas followed by a radio flare observed by the RATAN-600 radio telescope,\nfurther strengthening the case for the neutrino-blazar association.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 21:58:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aynutdinov","V. M.",""],["Allakhverdyan","V. A.",""],["Avrorin","A. D.",""],["Avrorin","A. V.",""],["Barda\u010dov\u00e1","Z.",""],["Belolaptikov","I. A.",""],["Bondarev","E. A.",""],["Borina","I. V.",""],["Budnev","N. M.",""],["Chadymov","V. A.",""],["Chepurnov","A. S.",""],["Dik","V. Y.",""],["Domogatsky","G. V.",""],["Doroshenko","A. A.",""],["Dvornick\u00fd","R.",""],["Dyachok","A. N.",""],["Dzhilkibaev","Zh. -A. M.",""],["Eckerov\u00e1","E.",""],["Elzhov","T. V.",""],["Fajt","L.",""],["Fomin","V. N.",""],["Gafarov","A. R.",""],["Golubkov","K. V.",""],["Gorshkov","N. S.",""],["Gress","T. I.",""],["Kebkal","K. G.",""],["Kharuk","I. V.",""],["Khramov","E. V.",""],["Kolbin","M. M.",""],["Koligaev","S. O.",""],["Konischev","K. V.",""],["Korobchenko","A. V.",""],["Koshechkin","A. P.",""],["Kozhin","V. A.",""],["Kruglov","M. V.",""],["Kulepov","V. F.",""],["Lemeshev","Y. E.",""],["Milenin","M. B.",""],["Mirgazov","R. R.",""],["Naumov","D. V.",""],["Nikolaev","A. S.",""],["Petukhov","D. P.",""],["Pliskovsky","E. N.",""],["Rozanov","M. I.",""],["Ryabov","E. V.",""],["Safronov","G. B.",""],["Seitova","D.",""],["Shaybonov","B. A.",""],["Shelepov","M. D.",""],["Shilkin","S. D.",""],["Shirokov","E. V.",""],["\u0160imkovic","F.",""],["Sirenko","A. E.",""],["Skurikhin","A. V.",""],["Solovjev","A. G.",""],["Sorokovikov","M. N.",""],["\u0160tekl","I.",""],["Stromakov","A. P.",""],["Suvorova","O. V.",""],["Tabolenko","V. A.",""],["Ulzutuev","B. B.",""],["Yablokova","Y. V.",""],["Zaborov","D. N.",""],["Zavyalov","S. I.",""],["Erkenov","D. Y. Zvezdov A. K.",""],["Kosogorov","N. A.",""],["Kovalev","Y. A.",""],["Kovalev","Y. Y.",""],["Plavin","A. V.",""],["Popkov","A. V.",""],["Pushkarev","A. B.",""],["Semikoz","D. V.",""],["Sotnikova","Y. V.",""],["Troitsky","S. V.",""]]}
{"id":"2308.13687","submitter":"Ju Li","authors":"Yang Jeong Park, Sung Eun Jerng, Jin-Sung Park, Choah Kwon, Chia-Wei\n  Hsu, Zhichu Ren, Sungroh Yoon, and Ju Li","title":"1.5 million materials narratives generated by chatbots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The advent of artificial intelligence (AI) has enabled a comprehensive\nexploration of materials for various applications. However, AI models often\nprioritize frequently encountered materials in the scientific literature,\nlimiting the selection of suitable candidates based on inherent physical and\nchemical properties. To address this imbalance, we have generated a dataset of\n1,494,017 natural language-material paragraphs based on combined OQMD,\nMaterials Project, JARVIS, COD and AFLOW2 databases, which are dominated by ab\ninitio calculations and tend to be much more evenly distributed on the periodic\ntable. The generated text narratives were then polled and scored by both human\nexperts and ChatGPT-4, based on three rubrics: technical accuracy, language and\nstructure, and relevance and depth of content, showing similar scores but with\nhuman-scored depth of content being the most lagging. The merger of\nmulti-modality data sources and large language model (LLM) holds immense\npotential for AI frameworks to help the exploration and discovery of\nsolid-state materials for specific applications.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:00:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Park","Yang Jeong",""],["Jerng","Sung Eun",""],["Park","Jin-Sung",""],["Kwon","Choah",""],["Hsu","Chia-Wei",""],["Ren","Zhichu",""],["Yoon","Sungroh",""],["Li","Ju",""]]}
{"id":"2308.13688","submitter":"Jared Greathouse","authors":"Jared Amani Greathouse, Mani Bayani, Jason Coupet","title":"Splash! Robustifying Donor Pools for Policy Studies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Policy researchers using synthetic control methods typically choose a donor\npool in part by using policy domain expertise so the untreated units are most\nlike the treated unit in the pre intervention period. This potentially leaves\nestimation open to biases, especially when researchers have many potential\ndonors. We compare how functional principal component analysis synthetic\ncontrol, forward-selection, and the original synthetic control method select\ndonors. To do this, we use Gaussian Process simulations as well as policy case\nstudies from West German Reunification, a hotel moratorium in Barcelona, and a\nsugar-sweetened beverage tax in San Francisco. We then summarize the\nimplications for policy research and provide avenues for future work.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:04:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Greathouse","Jared Amani",""],["Bayani","Mani",""],["Coupet","Jason",""]]}
{"id":"2308.13689","submitter":"Matthew Durham","authors":"Matthew Gentry Durham","title":"Cubulating Infinity in Hierarchically Hyperbolic Spaces","comments":"113 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT math.MG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the hierarchical hull of any finite set of interior points,\nhierarchy rays, and boundary points in a hierarchically hyperbolic space (HHS)\nis quasi-median quasi-isometric to a CAT(0) cube complex of bounded dimension.\nOur construction extends and refines a theorem of Behrstock-Hagen-Sisto about\nmodeling hulls of interior points and our previous work with Zalloum on\nmodeling finite sets of rays via limits of these finite models. We further\nprove that the quasi-median quasi-isometry between the hull of a finite set of\nrays or boundary points and its cubical model extends to an isomorphism between\ntheir respective hierarchical and simplicial boundaries. In this sense, we\nprove that the hierarchical boundary of any proper HHS is locally modeled by\nthe simplicial boundaries of CAT(0) cube complexes. This is a purely geometric\nstatement, allowing one to important various topologies from the cubical\nsetting. Our proof of the cubical model theorem is new, even for the interior\npoints case. In particular, we provide a concrete description of the cubical\nmodel as a cubical subcomplex of a product of simplicial trees into which the\nhierarchical data is directly encoded. Moreover, the above boundary isomorphism\nis new for all non-cubical HHSes, including mapping class groups and\nTeichm\\\"uller spaces of finite-type surfaces. As an application of our\ntechniques, we show that in most HHSes, including all hierarchically hyperbolic\ngroups, the distance between any pair of points in the top-level hyperbolic\nspace is coarsely the length of a maximal 0-separated chain of hyperplanes\nseparating them in an appropriate cubical model. For mapping class groups, this\nsays that these cubical models cubically encode distance in the curve graph of\nthe surface.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:09:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Durham","Matthew Gentry",""]]}
{"id":"2308.13690","submitter":"Junjie Zhao","authors":"Yi Gong, Zhoujian Cao, Junjie Zhao, Lijing Shao","title":"Including higher harmonics in gravitational-wave parameter estimation\n  and cosmological implications for LISA","comments":"14 pages, 11 figures, 4 tables; accepted by Physical Review D","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Massive black holes (MBHs) are crucial in shaping their host galaxies. How\nthe MBH co-evolves with its host galaxy is a pressing problem in astrophysics\nand cosmology. The valuable information carried by the binary MBH is encoded in\nthe gravitational waves (GWs), which will be detectable by the space-borne GW\ndetector LISA. In the GW data analysis, usually, only the dominant $(2,2)$ mode\nof the GW signal is considered in the parameter estimation for LISA. However,\nincluding the higher harmonics in parameter estimation can break the degeneracy\nbetween the parameters, especially for the inclination angle and luminosity\ndistance. This may enable the identification of GW signals without\nelectromagnetic counterparts, known as ''dark sirens''. Thus, incorporating\nhigher harmonics will be beneficial to resolve the Hubble tension and constrain\nthe cosmological model. In this paper, we investigate the role of higher\nharmonics in the parameter estimation for GWs emitted by binary MBHs. We\ndemonstrate that including $(3,3)$ mode can lead to a $10^3$-times improvement\nin angular resolution and a $10^4$-times improvement in luminosity distance.\nMeanwhile, our results indicate that considering higher harmonics increases the\nprobability of identifying over 70% host galaxies from $10^{-2}\\,\\rm{Gpc}^3$\ncosmological volume threshold (corresponding $10^5$ host galaxies), while the\nprobability less than 8% for only the $(2,2)$ mode. Thus, our results\nunderscore the importance of including higher modes in the GW signal from\nbinary MBHs, for LISA at least $(3,3)$ mode.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:13:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gong","Yi",""],["Cao","Zhoujian",""],["Zhao","Junjie",""],["Shao","Lijing",""]]}
{"id":"2308.13691","submitter":"Francis Bonahon","authors":"Francis Bonahon and Vijay Higgins","title":"Central elements in the $\\mathrm{SL}_d$-skein algebra of a surface","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The $\\mathrm{SL}_d$-skein algebra $\\mathcal{S}_{\\mathrm{SL}_d}^q(S)$ of a\nsurface $S$ is a certain deformation of the coordinate ring of the character\nvariety consisting of flat $\\mathrm{SL}_d$-local systems over the surface. As a\nquantum topological object, $\\mathcal{S}_{\\mathrm{SL}_d}^q(S)$ is also closely\nrelated to the HOMFLYPT polynomial invariant of knots and links in\n$\\mathbb{R}^3$. We exhibit a very rich family of central elements in this\nalgebra $\\mathcal{S}_{\\mathrm{SL}_d}^q(S)$ that appear when the quantum\nparameter $q$ is a root of unity. These central elements are obtained by\nthreading along framed links certain polynomials arising in the elementary\ntheory of symmetric functions, and related to taking powers in $\\mathrm{SL}_d$.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:18:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bonahon","Francis",""],["Higgins","Vijay",""]]}
{"id":"2308.13692","submitter":"Jiaqi Zhou","authors":"Jiaqi Zhou, Samuel Ponc\\'e, Jean-Christophe Charlier","title":"Enhanced Spin Hall Ratio in Two-Dimensional III-V Semiconductors","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Spin Hall effect plays a critical role in spintronics since it can convert\ncharge current to spin current. Using state-of-the-art ab initio calculations\nincluding quadrupole and spin-orbit coupling, the charge and spin transports\nhave been investigated in pristine and doped two-dimensional III-V\nsemiconductors. Valence bands induce a strong scattering which limits charge\nconductivity in the hole-doped system, where spin Hall conductivity is enhanced\nby the spin-orbit splitting, yielding an ultrahigh spin Hall ratio\n$\\xi\\approx0.9$ in GaAs monolayer at room temperature.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:21:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Jiaqi",""],["Ponc\u00e9","Samuel",""],["Charlier","Jean-Christophe",""]]}
{"id":"2308.13693","submitter":"Chelsea Braun M","authors":"Chelsea Braun, Samar Safi-Harb, Chris Fryer, Ping Zhou","title":"Progenitors and Explosion Properties of Supernova Remnants Hosting\n  Central Compact Objects: II. A Global Systematic Study with a Comparison to\n  Nucleosynthesis Models","comments":"29 pages, 64 figures, 17 Tables; to appear in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Core-collapse explosions of massive stars leave behind neutron stars, with a\nknown diversity that includes the \"Central Compact Objects\" (CCOs). Typified by\nthe neutron star discovered near the centre of the Cas A supernova remnant\n(SNR), CCOs have been observed to shine only in X-rays. To address their\nsupernova progenitors, we perform a systematic study of SNRs that contain a CCO\nand display X-ray emission from their shock-heated ejecta. We make use of X-ray\ndata primarily using the Chandra X-ray observatory, complemented with\nXMM-Newton. This study uses a systematic approach to the analysis of each SNR\naimed at addressing the supernova progenitor as well as the explosion\nproperties (energy and ambient density). After fitting for the ejecta\nabundances estimated from a spatially resolved spectroscopic study, we compare\nthe data to six nucleosynthesis models making predictions on supernova ejecta\nyields in core-collapse explosions. We find that the explosion models commonly\nused by the astrophysics community do not match the ejecta yields for any of\nthe SNRs, suggesting additional physics, e.g. multi-dimensional explosion\nmodels or updated progenitor structures, are required. Overall we find low-mass\n($\\leq$25 solar masses) progenitors among the massive stars population and\nlow-energy explosions ($<$10$^{51}$ ergs). We discuss degeneracies in our model\nfitting, particularly how altering the explosion energy affects the estimate of\nthe progenitor mass. Our systematic study highlights the need for improving on\nthe theoretical models for nucleosynthesis predictions as well as for\nsensitive, high-resolution spectroscopy observations to be acquired with\nnext-generation X-ray missions.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:24:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Braun","Chelsea",""],["Safi-Harb","Samar",""],["Fryer","Chris",""],["Zhou","Ping",""]]}
{"id":"2308.13694","submitter":"Matthew McDermott","authors":"Matthew McDermott and Jason Rife","title":"Correcting Motion Distortion for LIDAR HD-Map Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Because scanning-LIDAR sensors require finite time to create a point cloud,\nsensor motion during a scan warps the resulting image, a phenomenon known as\nmotion distortion or rolling shutter. Motion-distortion correction methods\nexist, but they rely on external measurements or Bayesian filtering over\nmultiple LIDAR scans. In this paper we propose a novel algorithm that performs\nsnapshot processing to obtain a motion-distortion correction. Snapshot\nprocessing, which registers a current LIDAR scan to a reference image without\nusing external sensors or Bayesian filtering, is particularly relevant for\nlocalization to a high-definition (HD) map. Our approach, which we call\nVelocity-corrected Iterative Compact Ellipsoidal Transformation (VICET),\nextends the well-known Normal Distributions Transform (NDT) algorithm to solve\njointly for both a 6 Degree-of-Freedom (DOF) rigid transform between two LIDAR\nscans and a set of 6DOF motion states that describe distortion within the\ncurrent LIDAR scan. Using experiments, we show that VICET achieves\nsignificantly higher accuracy than NDT or Iterative Closest Point (ICP)\nalgorithms when localizing a distorted raw LIDAR scan against an undistorted HD\nMap. We recommend the reader explore our open-source code and visualizations at\nhttps://github.com/mcdermatt/VICET, which supplements this manuscript.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:39:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["McDermott","Matthew",""],["Rife","Jason",""]]}
{"id":"2308.13695","submitter":"Craig Roberts","authors":"H.-Y. Xing, M. Ding, Z.-F. Cui, A. V. Pimikov, C. D. Roberts and S. M.\n  Schmidt","title":"Constraining the pion distribution amplitude using Drell-Yan reactions\n  on a proton","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"NJU-INP 077/23","categories":"hep-ph hep-ex hep-lat nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using a reaction model that incorporates pion bound state effects and\ncontinuum results for proton parton distributions and the pion distribution\namplitude, $\\varphi_\\pi$, we deliver parameter-free predictions for the $\\mu^+$\nangular distributions in $\\pi N \\to \\mu^+ \\mu^- X$ reactions on both\nunpolarised and polarised targets. The analysis indicates that such angular\ndistributions are sensitive to the pointwise form of $\\varphi_\\pi$ and suggests\nthat unpolarised targets are practically more favourable. The precision of\nextant data is insufficient for use in charting $\\varphi_\\pi$; hence, practical\ntests of this approach to charting $\\varphi_\\pi$ must await data with improved\nprecision from new-generation experiments. The reaction model yields a nonzero\nsingle-spin azimuthal asymmetry, without reference to $T$-odd parton\ndistribution functions (DFs). This may necessitate additional care when\nattempting to extract such $T$-odd DFs from data.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:44:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xing","H. -Y.",""],["Ding","M.",""],["Cui","Z. -F.",""],["Pimikov","A. V.",""],["Roberts","C. D.",""],["Schmidt","S. M.",""]]}
{"id":"2308.13696","submitter":"Yuu Jinnai","authors":"Yuu Jinnai, Tetsuro Morimura, Ukyo Honda","title":"On the Depth between Beam Search and Exhaustive Search for Text\n  Generation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Beam search and exhaustive search are two extreme ends of text decoding\nalgorithms with respect to the search depth. Beam search is limited in both\nsearch width and depth, whereas exhaustive search is a global search that has\nno such limitations. Surprisingly, beam search is not only computationally\ncheaper but also performs better than exhaustive search despite its higher\nsearch error. Plenty of research has investigated a range of beam widths, from\nsmall to large, and reported that a beam width that is neither too large nor\ntoo small is desirable. However, in terms of search depth, only the two extreme\nends, beam search and exhaustive search are studied intensively. In this paper,\nwe examine a range of search depths between the two extremes to discover the\ndesirable search depth. To this end, we introduce Lookahead Beam Search (LBS),\na multi-step lookahead search that optimizes the objective considering a fixed\nnumber of future steps. Beam search and exhaustive search are special cases of\nLBS where the lookahead depth is set to $0$ and $\\infty$, respectively. We\nempirically evaluate the performance of LBS and find that it outperforms beam\nsearch overall on machine translation tasks. The result suggests there is room\nfor improvement in beam search by searching deeper. Inspired by the analysis,\nwe propose Lookbehind Heuristic Beam Search, a computationally feasible search\nalgorithm that heuristically simulates LBS with 1-step lookahead. The empirical\nresults show that the proposed method outperforms vanilla beam search on\nmachine translation and text summarization tasks.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:57:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jinnai","Yuu",""],["Morimura","Tetsuro",""],["Honda","Ukyo",""]]}
{"id":"2308.13697","submitter":"Thomas Beechem","authors":"Jacob D. Minyard and Thomas E. Beechem","title":"Material Characteristics Governing In-Plane Phonon-Polariton Thermal\n  Conductance","comments":"16 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The material dependence of phonon-polariton based in-plane thermal\nconductance is investigated by examining systems composed of air and several\nwurtzite and zinc-blende crystals. Phonon-polariton based thermal conductance\nvaries by over an order of magnitude ($\\sim 0.5-60$ nW/K), which is similar to\nthe variation observed in the materials corresponding bulk thermal\nconductivity. Regardless of material, phonon-polaritons exhibit similar thermal\nconductance to that of phonons when layers become ultrathin (< 100 nm)\nsuggesting the generality of the effect at these length-scales. A figure of\nmerit is proposed to explain the large variation of in-plane polariton thermal\nconductance that is composed entirely of easily predicted and measured optical\nphonon energies and lifetimes. Using this figure of merit, in-plane\nphonon-polariton thermal conductance enlarges with increases in: (1) optical\nphonon energies, (2) splitting between transverse and longitudinal mode pairs,\nand (3) phonon lifetimes.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:58:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Minyard","Jacob D.",""],["Beechem","Thomas E.",""]]}
{"id":"2308.13698","submitter":"Ayman Shehata","authors":"Ghazi S. Khammsh, Shimaa I. Moustafa, Shahid Mubeen and Ayman Shehata","title":"On the fractional integrals and derivatives of Bateman's matrix\n  polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The object of this paper is to investigate the certain results involving\nBateman's matrix polynomials for integral index. We obtain some properties,\nintegral representation and recurrence relations for hypergeometric matrix\nfunction. We introduce some matrix differential equations of the three order,\nintegral transform and fractional integral formulas for hypergeometric matrix\nfunction by using the beta and Laplace transforms formula, Erdelyi Kober type\nfractional integral operators\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 22:59:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khammsh","Ghazi S.",""],["Moustafa","Shimaa I.",""],["Mubeen","Shahid",""],["Shehata","Ayman",""]]}
{"id":"2308.13699","submitter":"Kellin Pelrine","authors":"Kellin Pelrine, Anne Imouza, Zachary Yang, Jacob-Junqi Tian, Sacha\n  L\\'evy, Gabrielle Desrosiers-Brisebois, Aarash Feizi, C\\'ecile Amadoro,\n  Andr\\'e Blais, Jean-Fran\\c{c}ois Godbout, Reihaneh Rabbany","title":"Party Prediction for Twitter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A large number of studies on social media compare the behaviour of users from\ndifferent political parties. As a basic step, they employ a predictive model\nfor inferring their political affiliation. The accuracy of this model can\nchange the conclusions of a downstream analysis significantly, yet the choice\nbetween different models seems to be made arbitrarily. In this paper, we\nprovide a comprehensive survey and an empirical comparison of the current party\nprediction practices and propose several new approaches which are competitive\nwith or outperform state-of-the-art methods, yet require less computational\nresources. Party prediction models rely on the content generated by the users\n(e.g., tweet texts), the relations they have (e.g., who they follow), or their\nactivities and interactions (e.g., which tweets they like). We examine all of\nthese and compare their signal strength for the party prediction task. This\npaper lets the practitioner select from a wide range of data types that all\ngive strong performance. Finally, we conduct extensive experiments on different\naspects of these methods, such as data collection speed and transfer\ncapabilities, which can provide further insights for both applied and\nmethodological research.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:02:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pelrine","Kellin",""],["Imouza","Anne",""],["Yang","Zachary",""],["Tian","Jacob-Junqi",""],["L\u00e9vy","Sacha",""],["Desrosiers-Brisebois","Gabrielle",""],["Feizi","Aarash",""],["Amadoro","C\u00e9cile",""],["Blais","Andr\u00e9",""],["Godbout","Jean-Fran\u00e7ois",""],["Rabbany","Reihaneh",""]]}
{"id":"2308.13700","submitter":"Aniruddha Sen","authors":"Aniruddha Sen, Kenneth Goodenough, Don Towsley","title":"Multipartite Entanglement in Quantum Networks using Subgraph\n  Complementations","comments":"Proceedings of the 2023 IEEE International Conference on Quantum\n  Computing and Engineering (QCE23) (to be published)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.DS cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum networks are important for quantum communication and consist of\nentangled states that are essential for many tasks such as quantum\nteleportation, quantum key distribution, quantum sensing and quantum error\ncorrection. Graph states are a specific class of multipartite entangled states\nthat can be represented by graphs. We propose a novel approach for distributing\ngraph states across a quantum network. We show that the distribution of graph\nstates can be characterised by a system of subgraph complementations, which we\nalso relate to the minimum rank of the underlying graph and the degree of\nentanglement quantified by the Schmidt-rank of the quantum state. We analyse\nresource usage for our algorithm and show it to match or be improved in the\nnumber of qubits, bits for classical communication and EPR pairs utilised, as\ncompared to prior work. The number of local operations is efficient, and the\nresource consumption for our approach scales linearly in the number of\nvertices. This presents a quadratic improvement in completion time for several\nclasses of graph states represented by dense graphs, and implies a potential\nfor improved fidelity in the presence of noise. Common classes of graph states\nare classified along with the optimal time for their distribution using\nsubgraph complementations. We also provide a framework to similarly find the\noptimal sequence of operations to distribute an arbitrary graph state, and\nprove upper bounds along with providing approximate greedy algorithms.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:03:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sen","Aniruddha",""],["Goodenough","Kenneth",""],["Towsley","Don",""]]}
{"id":"2308.13701","submitter":"Alexander Brace","authors":"Alexander Brace, Rafael Vescovi, Ryan Chard, Nickolaus D. Saint,\n  Arvind Ramanathan, Nestor J. Zaluzec, Ian Foster","title":"Linking the Dynamic PicoProbe Analytical Electron-Optical Beam Line /\n  Microscope to Supercomputers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Dynamic PicoProbe at Argonne National Laboratory is undergoing upgrades\nthat will enable it to produce up to 100s of GB of data per day. While this\ndata is highly important for both fundamental science and industrial\napplications, there is currently limited on-site infrastructure to handle these\nhigh-volume data streams. We address this problem by providing a software\narchitecture capable of supporting large-scale data transfers to the\nneighboring supercomputers at the Argonne Leadership Computing Facility. To\nprepare for future scientific workflows, we implement two instructive use cases\nfor hyperspectral and spatiotemporal datasets, which include: (i) off-site data\ntransfer, (ii) machine learning/artificial intelligence and traditional data\nanalysis approaches, and (iii) automatic metadata extraction and cataloging of\nexperimental results. This infrastructure supports expected workloads and also\nprovides domain scientists the ability to reinterrogate data from past\nexperiments to yield additional scientific value and derive new insights.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:07:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Brace","Alexander",""],["Vescovi","Rafael",""],["Chard","Ryan",""],["Saint","Nickolaus D.",""],["Ramanathan","Arvind",""],["Zaluzec","Nestor J.",""],["Foster","Ian",""]]}
{"id":"2308.13702","submitter":"Guilherme Limberg","authors":"Guilherme Limberg, Alexander P. Ji, Rohan P. Naidu, Anirudh Chiti,\n  Silvia Rossi, Sam A. Usman, Yuan-Sen Ting, Dennis Zaritsky, Ana Bonaca, Lais\n  Borbolato, Joshua S. Speagle, Vedant Chandra, Charlie Conroy","title":"Extending the Chemical Reach of the H3 Survey: Detailed Abundances of\n  the Dwarf-galaxy Stellar Stream Wukong/LMS-1","comments":"Submitted to MNRAS. Comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first detailed chemical-abundance analysis of stars from the\ndwarf-galaxy stellar stream Wukong/LMS-1 covering a wide metallicity range\n($-3.5 < \\rm[Fe/H] \\lesssim -1.3$). We find abundance patterns that are\neffectively indistinguishable from the bulk of Indus and Jhelum, a pair of\nsmaller stellar streams proposed to be dynamically associated with\nWukong/LMS-1. We discovered a carbon-enhanced metal-poor star ($\\rm[C/Fe] >\n+0.7$ and $\\rm[Fe/H] \\sim -2.9$) in Wukong/LMS-1 with strong enhancements in\nSr, Y, and Zr, which is peculiar given its solar-level [Ba/Fe]. Wukong/LMS-1\nstars have high abundances of $\\alpha$ elements up to $\\rm[Fe/H] \\gtrsim -2$,\nwhich is expected for relatively massive dwarfs. Towards the high-metallicity\nend, Wukong/LMS-1 becomes $\\alpha$-poor, revealing that it probably experienced\nfairly standard chemical evolution. We identified a pair of N- and Na-rich\nstars in Wukong/LMS-1, reminiscent of multiple populations in globular\nclusters. This indicates that this dwarf galaxy contained at least one globular\ncluster that was completely disrupted in addition to two intact ones previously\nknown to be associated with Wukong/LMS-1, which is possibly connected to\nsimilar evidence found in Indus. From these $\\geq$3 globular clusters, we\nestimate the total mass of Wukong/LMS-1 to be ${\\approx}10^{10} M_\\odot$,\nrepresenting ${\\sim}1$% of the present-day Milky Way. Finally, the [Eu/Mg]\nratio in Wukong/LMS-1 continuously increases with metallicity, making this the\nfirst example of a dwarf galaxy where the production of $r$-process elements is\nclearly dominated by delayed sources, presumably neutron-star mergers.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:08:29 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 01:42:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Limberg","Guilherme",""],["Ji","Alexander P.",""],["Naidu","Rohan P.",""],["Chiti","Anirudh",""],["Rossi","Silvia",""],["Usman","Sam A.",""],["Ting","Yuan-Sen",""],["Zaritsky","Dennis",""],["Bonaca","Ana",""],["Borbolato","Lais",""],["Speagle","Joshua S.",""],["Chandra","Vedant",""],["Conroy","Charlie",""]]}
{"id":"2308.13703","submitter":"Sayna Ebrahimi","authors":"Nicasia Beebe-Wang, Sayna Ebrahimi, Jinsung Yoon, Sercan O. Arik,\n  Tomas Pfister","title":"PAITS: Pretraining and Augmentation for Irregularly-Sampled Time Series","comments":"Code:\n  \\url{https://github.com/google-research/google-research/tree/master/irregular_timeseries_pretraining}","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Real-world time series data that commonly reflect sequential human behavior\nare often uniquely irregularly sampled and sparse, with highly nonuniform\nsampling over time and entities. Yet, commonly-used pretraining and\naugmentation methods for time series are not specifically designed for such\nscenarios. In this paper, we present PAITS (Pretraining and Augmentation for\nIrregularly-sampled Time Series), a framework for identifying suitable\npretraining strategies for sparse and irregularly sampled time series datasets.\nPAITS leverages a novel combination of NLP-inspired pretraining tasks and\naugmentations, and a random search to identify an effective strategy for a\ngiven dataset. We demonstrate that different datasets benefit from different\npretraining choices. Compared with prior methods, our approach is better able\nto consistently improve pretraining across multiple datasets and domains. Our\ncode is available at\n\\url{https://github.com/google-research/google-research/tree/master/irregular_timeseries_pretraining}.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:21:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Beebe-Wang","Nicasia",""],["Ebrahimi","Sayna",""],["Yoon","Jinsung",""],["Arik","Sercan O.",""],["Pfister","Tomas",""]]}
{"id":"2308.13704","submitter":"Gabriel Menezes","authors":"John F. Donoghue, Gabriel Menezes","title":"Higher Derivative Sigma Models","comments":"19 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the nature of running couplings in the higher derivative linear\nand nonlinear sigma models and show that the results in dimensional\nregularization for the physical running couplings do not always match the\nvalues quoted in the literature. Heat kernel methods identify divergences\ncorrectly, but not all of these divergences are related to physical running\ncouplings. Likewise the running found using the Functional Renormalization\nGroup does not always appear as running couplings in physical processes, even\nfor the case of logarithmic running. The basic coupling of the higher\nderivative SU(N) nonlinear sigma model does not run at all at one loop, in\ncontrast to published claims for asymptotic freedom. At one loop we describe\nhow to properly identify the physical running couplings in these theories, and\nprovide revised numbers for the higher derivative nonlinear sigma model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:28:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Donoghue","John F.",""],["Menezes","Gabriel",""]]}
{"id":"2308.13705","submitter":"Alexander White","authors":"Ryan J. Gelly, Alexander D. White, Giovanni Scuri, Xing Liao, Geun Ho\n  Ahn, Bingchen Deng, Kenji Watanabe, Takashi Taniguchi, Jelena Vu\\v{c}kovi\\'c,\n  Hongkun Park","title":"An inverse-designed nanophotonic interface for excitons in atomically\n  thin materials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Efficient nanophotonic devices are essential for applications in quantum\nnetworking, optical information processing, sensing, and nonlinear optics.\nExtensive research efforts have focused on integrating two-dimensional (2D)\nmaterials into photonic structures, but this integration is often limited by\nsize and material quality. Here, we use hexagonal boron nitride (hBN), a\nbenchmark choice for encapsulating atomically thin materials, as a waveguiding\nlayer while simultaneously improving the optical quality of the embedded films.\nWhen combined with photonic inverse design, it becomes a complete nanophotonic\nplatform to interface with optically active 2D materials. Grating couplers and\nlow-loss waveguides provide optical interfacing and routing, tunable cavities\nprovide a large exciton-photon coupling to transition metal dichalcogenides\n(TMD) monolayers through Purcell enhancement, and metasurfaces enable the\nefficient detection of TMD dark excitons. This work paves the way for advanced\n2D-material nanophotonic structures for classical and quantum nonlinear optics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:29:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gelly","Ryan J.",""],["White","Alexander D.",""],["Scuri","Giovanni",""],["Liao","Xing",""],["Ahn","Geun Ho",""],["Deng","Bingchen",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Vu\u010dkovi\u0107","Jelena",""],["Park","Hongkun",""]]}
{"id":"2308.13706","submitter":"Gabriele Bellomia","authors":"Gabriele Bellomia, Carlos Mejuto-Zaera, Massimo Capone, Adriano\n  Amaricci","title":"Quasilocal entanglement across the Mott-Hubbard transition","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The possibility to directly measure, in a cold-atom quantum simulator, the\nentanglement and mutual information between a site and its environment opens\nnew perspectives on the characterization of the Mott-Hubbard metal-insulator\ntransition, in the framework of quantum information theory. In this work we\nprovide an alternative view of the Mott transition in the two-dimensional\nHubbard model in terms of suitably defined quasilocal measures of entanglement\nand correlation between two spatially separated electronic orbitals, with no\ncontribution from their environment.\n  A space-resolved analysis of Cluster Dynamical Mean-Field Theory results\nelucidates the prominent role of the nearest-neighbor entanglement in probing\nMott localization: both its lower and upper bounds sharply increase at the\nmetal-insulator transition. The two-site entanglement beyond nearest neighbors\nis shown to be quickly damped as the inter-site distance is increased.\n  These results ultimately resolve a conundrum of previous analyses based on\nthe single-site entanglement, which has been found to monotonically decrease\nwhen the interaction is increased. The quasilocal two-site entanglement\nrecovers instead the distinctive character of Mott insulators as strongly\ncorrelated quantum states, demonstrating the central role of this marker in the\ntwo-dimensional Hubbard model.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:31:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bellomia","Gabriele",""],["Mejuto-Zaera","Carlos",""],["Capone","Massimo",""],["Amaricci","Adriano",""]]}
{"id":"2308.13707","submitter":"Yuming Zhou","authors":"Xutong Liu, Yufei Zhou, Yutian Tang, Junyan Qian, Yuming Zhou","title":"Human-in-the-loop online just-in-time software defect prediction","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Online Just-In-Time Software Defect Prediction (O-JIT-SDP) uses an online\nmodel to predict whether a new software change will introduce a bug or not.\nHowever, existing studies neglect the interaction of Software Quality Assurance\n(SQA) staff with the model, which may miss the opportunity to improve the\nprediction accuracy through the feedback from SQA staff. To tackle this\nproblem, we propose Human-In-The-Loop (HITL) O-JIT-SDP that integrates feedback\nfrom SQA staff to enhance the prediction process. Furthermore, we introduce a\nperformance evaluation framework that utilizes a k-fold distributed bootstrap\nmethod along with the Wilcoxon signed-rank test. This framework facilitates\nthorough pairwise comparisons of alternative classification algorithms using a\nprequential evaluation approach. Our proposal enables continuous statistical\ntesting throughout the prequential process, empowering developers to make\nreal-time decisions based on robust statistical evidence. Through\nexperimentation across 10 GitHub projects, we demonstrate that our evaluation\nframework enhances the credibility of model evaluation, and the incorporation\nof HITL feedback elevates the prediction performance of online JIT-SDP models.\nThese advancements hold the potential to significantly enhance the value of\nO-JIT-SDP for industrial applications.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:40:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Xutong",""],["Zhou","Yufei",""],["Tang","Yutian",""],["Qian","Junyan",""],["Zhou","Yuming",""]]}
{"id":"2308.13708","submitter":"Subham Bhakta","authors":"Subham Bhakta, Srilakshmi Krishnamoorthy, and Sunil Kumar Pasupulati","title":"Modular degree and a conjecture of Watkins","comments":"23 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given an elliptic curve $E/\\mathbb{Q}$ of conductor $N$, there exists a\nsurjective morphism $\\phi_E: X_0(N) \\to E$ defined over $\\mathbb{Q}$. In this\narticle, we discuss the growth of $\\mathrm{deg}(\\phi_E)$ and shed some light on\nWatkins's conjecture, which predicts $2^{\\mathrm{rank}(E(\\mathbb{Q}))} \\mid\n\\mathrm{deg}(\\phi_E)$. Moreover, for any elliptic curve over $\\mathbb{F}_q(T)$,\nwe have an analogous modular parametrization relating to the Drinfeld modular\ncurves. In this case, we also discuss growth and the divisibility properties.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:43:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhakta","Subham",""],["Krishnamoorthy","Srilakshmi",""],["Pasupulati","Sunil Kumar",""]]}
{"id":"2308.13709","submitter":"Cullen Haselby","authors":"Cullen Haselby, Mark A. Iwen, Deanna Needell, Elizaveta Rebrova,\n  William Swartworth","title":"Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank\n  Tensor Approximation from Streamed Measurements","comments":"59 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NA math.IT math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider the problem of recovering a low-rank Tucker\napproximation to a massive tensor based solely on structured random compressive\nmeasurements. Crucially, the proposed random measurement ensembles are both\ndesigned to be compactly represented (i.e., low-memory), and can also be\nefficiently computed in one-pass over the tensor. Thus, the proposed\ncompressive sensing approach may be used to produce a low-rank factorization of\na huge tensor that is too large to store in memory with a total memory\nfootprint on the order of the much smaller desired low-rank factorization. In\naddition, the compressive sensing recovery algorithm itself (which takes the\ncompressive measurements as input, and then outputs a low-rank factorization)\nalso runs in a time which principally depends only on the size of the sought\nfactorization, making its runtime sub-linear in the size of the large tensor\none is approximating. Finally, unlike prior works related to (streaming)\nalgorithms for low-rank tensor approximation from such compressive\nmeasurements, we present a unified analysis of both Kronecker and Khatri-Rao\nstructured measurement ensembles culminating in error guarantees comparing the\nerror of our recovery algorithm's approximation of the input tensor to the best\npossible low-rank Tucker approximation error achievable for the tensor by any\npossible algorithm. We further include an empirical study of the proposed\napproach that verifies our theoretical findings and explores various trade-offs\nof parameters of interest.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:44:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Haselby","Cullen",""],["Iwen","Mark A.",""],["Needell","Deanna",""],["Rebrova","Elizaveta",""],["Swartworth","William",""]]}
{"id":"2308.13710","submitter":"Muskan Garg","authors":"Muskan Garg","title":"WellXplain: Wellness Concept Extraction and Classification in Reddit\n  Posts for Mental Health Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  During the current mental health crisis, the importance of identifying\npotential indicators of mental issues from social media content has surged.\nOverlooking the multifaceted nature of mental and social well-being can have\ndetrimental effects on one's mental state. In traditional therapy sessions,\nprofessionals manually pinpoint the origins and outcomes of underlying mental\nchallenges, a process both detailed and time-intensive. We introduce an\napproach to this intricate mental health analysis by framing the identification\nof wellness dimensions in Reddit content as a wellness concept extraction and\ncategorization challenge. We've curated a unique dataset named WELLXPLAIN,\ncomprising 3,092 entries and totaling 72,813 words. Drawing from Halbert L.\nDunn's well-regarded wellness theory, our team formulated an annotation\nframework along with guidelines. This dataset also includes human-marked\ntextual segments, offering clear reasoning for decisions made in the wellness\nconcept categorization process. Our aim in publishing this dataset and\nanalyzing initial benchmarks is to spearhead the creation of advanced language\nmodels tailored for healthcare-focused concept extraction and categorization.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:50:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Garg","Muskan",""]]}
{"id":"2308.13711","submitter":"Ishan Rajendrakumar Dave","authors":"Tristan de Blegiers, Ishan Rajendrakumar Dave, Adeel Yousaf, Mubarak\n  Shah","title":"EventTransAct: A video transformer-based framework for Event-camera\n  based action recognition","comments":"IROS 2023; The first two authors contributed equally","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recognizing and comprehending human actions and gestures is a crucial\nperception requirement for robots to interact with humans and carry out tasks\nin diverse domains, including service robotics, healthcare, and manufacturing.\nEvent cameras, with their ability to capture fast-moving objects at a high\ntemporal resolution, offer new opportunities compared to standard action\nrecognition in RGB videos. However, previous research on event camera action\nrecognition has primarily focused on sensor-specific network architectures and\nimage encoding, which may not be suitable for new sensors and limit the use of\nrecent advancements in transformer-based architectures. In this study, we\nemploy a computationally efficient model, namely the video transformer network\n(VTN), which initially acquires spatial embeddings per event-frame and then\nutilizes a temporal self-attention mechanism. In order to better adopt the VTN\nfor the sparse and fine-grained nature of event data, we design\nEvent-Contrastive Loss ($\\mathcal{L}_{EC}$) and event-specific augmentations.\nProposed $\\mathcal{L}_{EC}$ promotes learning fine-grained spatial cues in the\nspatial backbone of VTN by contrasting temporally misaligned frames. We\nevaluate our method on real-world action recognition of N-EPIC Kitchens\ndataset, and achieve state-of-the-art results on both protocols - testing in\nseen kitchen (\\textbf{74.9\\%} accuracy) and testing in unseen kitchens\n(\\textbf{42.43\\% and 46.66\\% Accuracy}). Our approach also takes less\ncomputation time compared to competitive prior approaches, which demonstrates\nthe potential of our framework \\textit{EventTransAct} for real-world\napplications of event-camera based action recognition. Project Page:\n\\url{https://tristandb8.github.io/EventTransAct_webpage/}\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:51:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["de Blegiers","Tristan",""],["Dave","Ishan Rajendrakumar",""],["Yousaf","Adeel",""],["Shah","Mubarak",""]]}
{"id":"2308.13712","submitter":"Jiawei Liu","authors":"Jiawei Liu, Qiang Wang, Huijie Fan, Yinong Wang, Yandong Tang,\n  Liangqiong Qu","title":"Residual Denoising Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Current diffusion-based image restoration methods feed degraded input images\nas conditions into the noise estimation network. However, interpreting this\ndiffusion process is challenging since it essentially generates the target\nimage from the noise. To establish a unified and more interpretable model for\nimage generation and restoration, we propose residual denoising diffusion\nmodels (RDDM). In contrast to existing diffusion models (e.g., DDPM or DDIM)\nthat focus solely on noise estimation, our RDDM predicts residuals to represent\ndirectional diffusion from the target domain to the input domain, while\nconcurrently estimating noise to account for random perturbations in the\ndiffusion process. The introduction of residuals allows us to redefine the\nforward diffusion process, wherein the target image progressively diffuses into\na purely noisy image or a noise-carrying input image, thus unifying image\ngeneration and restoration. We demonstrate that our sampling process is\nconsistent with that of DDPM and DDIM through coefficient transformation, and\npropose a partially path-independent generation process to better understand\nthe reverse process. Notably, with native support for conditional inputs, our\nRDDM enables a generic UNet, trained with only an $\\ell _1$ loss and a batch\nsize of 1, to compete with state-of-the-art image restoration methods. We\nprovide code and pre-trained models to encourage further exploration,\napplication, and development of our innovative framework\n(https://github.com/nachifur/RDDM).\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:54:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Jiawei",""],["Wang","Qiang",""],["Fan","Huijie",""],["Wang","Yinong",""],["Tang","Yandong",""],["Qu","Liangqiong",""]]}
{"id":"2308.13713","submitter":"Nicholas Irons","authors":"Nicholas J. Irons and Carlos Cinelli","title":"Causally Sound Priors for Binary Experiments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce the BREASE framework for the Bayesian analysis of randomized\ncontrolled trials with a binary treatment and a binary outcome. Approaching the\nproblem from a causal inference perspective, we propose parameterizing the\nlikelihood in terms of the baseline risk, efficacy, and side effects of the\ntreatment, along with a flexible, yet intuitive and tractable jointly\nindependent beta prior distribution on these parameters, which we show to be a\ngeneralization of the Dirichlet prior for the joint distribution of potential\noutcomes. Our approach has a number of desirable characteristics when compared\nto current mainstream alternatives: (i) it naturally induces prior dependence\nbetween expected outcomes in the treatment and control groups; (ii) as the\nbaseline risk, efficacy and side effects are quantities inherently familiar to\nclinicians, the hyperparameters of the prior are directly interpretable, thus\nfacilitating the elicitation of prior knowledge and sensitivity analysis; and\n(iii) it admits analytical formulae for the marginal likelihood, Bayes factor,\nand other posterior quantities, as well as exact posterior sampling via\nsimulation, in cases where traditional MCMC fails. Empirical examples\ndemonstrate the utility of our methods for estimation, hypothesis testing, and\nsensitivity analysis of treatment effects.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 23:58:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Irons","Nicholas J.",""],["Cinelli","Carlos",""]]}
{"id":"2308.13714","submitter":"Seyedamin Pouriyeh","authors":"Sricharan Donkada, Seyedamin Pouriyeh, Reza M. Parizi, Meng Han,\n  Nasrin Dehbozorgi, Nazmus Sakib, Quan Z. Sheng","title":"Uncovering Promises and Challenges of Federated Learning to Detect\n  Cardiovascular Diseases: A Scoping Literature Review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cardiovascular diseases (CVD) are the leading cause of death globally, and\nearly detection can significantly improve outcomes for patients. Machine\nlearning (ML) models can help diagnose CVDs early, but their performance is\nlimited by the data available for model training. Privacy concerns in\nhealthcare make it harder to acquire data to train accurate ML models.\nFederated learning (FL) is an emerging approach to machine learning that allows\nmodels to be trained on data from multiple sources without compromising the\nprivacy of the individual data owners. This survey paper provides an overview\nof the current state-of-the-art in FL for CVD detection. We review the\ndifferent FL models proposed in various papers and discuss their advantages and\nchallenges. We also compare FL with traditional centralized learning approaches\nand highlight the differences in terms of model accuracy, privacy, and data\ndistribution handling capacity. Finally, we provide a critical analysis of FL's\ncurrent challenges and limitations for CVD detection and discuss potential\navenues for future research. Overall, this survey paper aims to provide a\ncomprehensive overview of the current state-of-the-art in FL for CVD detection\nand to highlight its potential for improving the accuracy and privacy of CVD\ndetection models.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:19:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Donkada","Sricharan",""],["Pouriyeh","Seyedamin",""],["Parizi","Reza M.",""],["Han","Meng",""],["Dehbozorgi","Nasrin",""],["Sakib","Nazmus",""],["Sheng","Quan Z.",""]]}
{"id":"2308.13715","submitter":"Haven Kim","authors":"Haven Kim, Kento Watanabe, Masataka Goto, Juhan Nam","title":"A Computational Evaluation Framework for Singable Lyric Translation","comments":"ISMIR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lyric translation plays a pivotal role in amplifying the global resonance of\nmusic, bridging cultural divides, and fostering universal connections.\nTranslating lyrics, unlike conventional translation tasks, requires a delicate\nbalance between singability and semantics. In this paper, we present a\ncomputational framework for the quantitative evaluation of singable lyric\ntranslation, which seamlessly integrates musical, linguistic, and cultural\ndimensions of lyrics. Our comprehensive framework consists of four metrics that\nmeasure syllable count distance, phoneme repetition similarity, musical\nstructure distance, and semantic similarity. To substantiate the efficacy of\nour framework, we collected a singable lyrics dataset, which precisely aligns\nEnglish, Japanese, and Korean lyrics on a line-by-line and section-by-section\nbasis, and conducted a comparative analysis between singable and non-singable\nlyrics. Our multidisciplinary approach provides insights into the key\ncomponents that underlie the art of lyric translation and establishes a solid\ngroundwork for the future of computational lyric translation assessment.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:27:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Haven",""],["Watanabe","Kento",""],["Goto","Masataka",""],["Nam","Juhan",""]]}
{"id":"2308.13716","submitter":"Rahul Deshpande","authors":"Rahul Deshpande, Aman G. Kidanemariam, Ivan Marusic","title":"Pressure drag reduction via imposition of spanwise wall oscillations on\n  a rough wall","comments":"Preprint submitted to the Journal of Fluid Mechanics after first\n  revision, with 18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The present study tests the efficacy of the well-known viscous drag reduction\nstrategy of imposing spanwise wall oscillations to reduce pressure drag\ncontributions in a transitional- and fully-rough turbulent wall flow. This is\nachieved by conducting a series of direct numerical simulations of a turbulent\nflow over two-dimensional (spanwise aligned) semi-cylindrical rods, placed\nperiodically along the streamwise direction with varying streamwise spacing.\nSurface oscillations, imposed at fixed viscous-scaled actuation parameters\noptimum for smooth wall drag reduction, are found to yield substantial drag\nreduction (>25%) for all the rough wall cases, maintained at matched roughness\nReynolds numbers. While the total drag reduction is due to a drop in both\nviscous and pressure drag in the case of transitionally-rough flow (i.e. with\nlarge inter-rod spacing), it is solely associated with pressure drag reduction\nfor the fully-rough cases (i.e. with small inter-rod spacings), with the latter\nbeing reported for the first time. The study finds that pressure drag reduction\nin all cases is caused by the attenuation of the vortex shedding activity in\nthe roughness wake, in response to wall-oscillation frequencies that are of the\nsame order as the vortex shedding frequencies. Contrary to speculations from\npast studies, the present study confirms that the mechanism behind pressure\ndrag reduction, achieved via imposition of spanwise oscillations, is\nindependent from the viscous drag reduction.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:29:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Deshpande","Rahul",""],["Kidanemariam","Aman G.",""],["Marusic","Ivan",""]]}
{"id":"2308.13717","submitter":"Ricardo Fernholz","authors":"Ricardo T. Fernholz and Robert Fernholz","title":"Portfolios Generated by Contingent Claim Functions, with Applications to\n  Option Pricing","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PR q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a market of stocks represented by strictly positive continuous\nsemimartingales, a contingent claim function is a positive C^{2, 1} function of\nthe stock prices and time with a given terminal value. If a contingent claim\nfunction satisfies a certain parabolic differential equation, it will generate\na portfolio with value process that replicates the contingent claim function.\nThis parabolic differential equation is a general form of the Black-Scholes\nequation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:42:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fernholz","Ricardo T.",""],["Fernholz","Robert",""]]}
{"id":"2308.13718","submitter":"Bo Wang","authors":"Dongqi Song, Guan Wang, Zhongwang Pang, Bo Wang","title":"An underground fiber cable discrimination method based on laser\n  interferometer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The maintenance and repair of optical fiber networks often requires the\ndiscrimination of underground cables among a group of buried ones. Presently,\nthe methods commonly used are either inefficient or harmful to the fiber cable.\nIn this paper, we evaluate the effectiveness of fiber optic vibration sensing\nmethod on underground fiber cable discrimination. We find that the typical\nvibration sensing method-distributed acoustic sensing (DAS) is not suitable for\nfiber cable discrimination. Especially for long distance scenario, due to\n\"frequency grafting\" effect, the DAS method will give a false response on the\nspectrum of knock events during cable discrimination process. In response, we\npropose an underground fiber cable discrimination method based on laser\ninterferometer, and demonstrate it on the 40-km urban fiber cable connecting\nTsinghua University and Yongding Road. It can give an obvious and real response\nto the knock event, and can be used in practical applications.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:45:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Song","Dongqi",""],["Wang","Guan",""],["Pang","Zhongwang",""],["Wang","Bo",""]]}
{"id":"2308.13719","submitter":"Marta Lewicka","authors":"Marta Lewicka","title":"The Monge-Ampere system: convex integration with improved regularity in\n  dimension two and arbitrary codimension","comments":"25 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a convex integration result for the Monge-Ampere system in dimension\n$d=2$ and arbitrary codimension $k\\geq 1$. We achieve flexibility up to the\nHolder regularity $\\mathcal{C}^{1,\\frac{1}{1+ 4/k}}$, improving hence the\nprevious $\\mathcal{C}^{1,\\frac{1}{1+ 6/k}}$ regularity that followed from\nflexibility up to $\\mathcal{C}^{1,\\frac{1}{1+d(d+1)/k}}$ in our previous work,\nvalid for any $d,k\\geq 1$. The present result agrees with flexibility up to\n$\\mathcal{C}^{1,\\frac{1}{5}}$ for $d=2, k=1$ obtained by Conti, Delellis,\nSzekelyhidi, as well as with the $\\mathcal{C}^{1,\\alpha}$ result where\n$\\alpha\\to 1$ as $k\\to\\infty$, due to Kallen.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:52:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lewicka","Marta",""]]}
{"id":"2308.13720","submitter":"Suman Dutta","authors":"Vinay Vaibhav, and Suman Dutta","title":"Entropic Timescales of Dynamic Heterogeneity in Supercooled Liquid","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-Gaussian displacement distributions are universal predictors of dynamic\nheterogeneity in slowly varying environments. Here, we explore heterogeneous\ndynamics in supercooled liquid using molecular dynamics simulations and show\nthe efficiency of the information-theoretic measure in quantifying dynamic\nheterogeneity over the widely used moment-based quantifications of\nnonGaussianity. Our analysis shows that the heterogeneity quantified by the\nnegentropy is significantly different from the one obtained using the\nconventional approach that considers deviation from Gaussianity up to\nlower-order moments. Further, we extract the timescales of dynamic\nheterogeneity using the two methods and show that the differential changes\ndiverge as the system experiences strong intermittency near the glass\ntransition.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 00:57:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vaibhav","Vinay",""],["Dutta","Suman",""]]}
{"id":"2308.13721","submitter":"Wallace Tan Gian Yion","authors":"Wallace Tan Gian Yion and Zhe Wu","title":"Robust Machine Learning Modeling for Predictive Control Using\n  Lipschitz-Constrained Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks (NNs) have emerged as a state-of-the-art method for modeling\nnonlinear systems in model predictive control (MPC). However, the robustness of\nNNs, in terms of sensitivity to small input perturbations, remains a critical\nchallenge for practical applications. To address this, we develop\nLipschitz-Constrained Neural Networks (LCNNs) for modeling nonlinear systems\nand derive rigorous theoretical results to demonstrate their effectiveness in\napproximating Lipschitz functions, reducing input sensitivity, and preventing\nover-fitting. Specifically, we first prove a universal approximation theorem to\nshow that LCNNs using SpectralDense layers can approximate any 1-Lipschitz\ntarget function. Then, we prove a probabilistic generalization error bound for\nLCNNs using SpectralDense layers by using their empirical Rademacher\ncomplexity. Finally, the LCNNs are incorporated into the MPC scheme, and a\nchemical process example is utilized to show that LCNN-based MPC outperforms\nMPC using conventional feedforward NNs in the presence of training data noise.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:14:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yion","Wallace Tan Gian",""],["Wu","Zhe",""]]}
{"id":"2308.13722","submitter":"Alireza Ghods","authors":"Alireza Ghods, Trong Nghia Hoang, and Diane Cook","title":"Time-to-Pattern: Information-Theoretic Unsupervised Learning for\n  Scalable Time Series Summarization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data summarization is the process of generating interpretable and\nrepresentative subsets from a dataset. Existing time series summarization\napproaches often search for recurring subsequences using a set of manually\ndevised similarity functions to summarize the data. However, such approaches\nare fraught with limitations stemming from an exhaustive search coupled with a\nheuristic definition of series similarity. Such approaches affect the diversity\nand comprehensiveness of the generated data summaries. To mitigate these\nlimitations, we introduce an approach to time series summarization, called\nTime-to-Pattern (T2P), which aims to find a set of diverse patterns that\ntogether encode the most salient information, following the notion of minimum\ndescription length. T2P is implemented as a deep generative model that learns\ninformative embeddings of the discrete time series on a latent space\nspecifically designed to be interpretable. Our synthetic and real-world\nexperiments reveal that T2P discovers informative patterns, even in noisy and\ncomplex settings. Furthermore, our results also showcase the improved\nperformance of T2P over previous work in pattern diversity and processing\nscalability, which conclusively demonstrate the algorithm's effectiveness for\ntime series summarization.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:15:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghods","Alireza",""],["Hoang","Trong Nghia",""],["Cook","Diane",""]]}
{"id":"2308.13723","submitter":"Mario Edoardo Bertaina","authors":"M. Bertaina, M. Battisti, M. Bianciotto, K. Bolmgren, F. Fenu (for the\n  JEM-EUSO Collaboration)","title":"Implications of Mini-EUSO measurements for a space-based observation of\n  UHECRs","comments":"10 pages, 3 figures, ICRC 2023","journal-ref":null,"doi":"10.22323/1.444.0272","report-no":null,"categories":"astro-ph.IM physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mini-EUSO is the first mission of the JEM-EUSO program on board the\nInternational Space Station. It was launched in August 2019 and it is operating\nsince October 2019 being located in the Russian section (Zvezda module) of the\nstation and viewing our planet from a nadir-facing UV-transparent window. The\ninstrument is based on the concept of the original JEM-EUSO mission and\nconsists of an optical system employing two Fresnel lenses of 25 cm each and a\nfocal surface composed of 36 Multi-Anode Photomultiplier tubes, 64 channels\neach, for a total of 2304 channels with single photon counting sensitivity and\nan overall field of view of 44$\\times$44$^\\circ$. Mini-EUSO can map the\nnight-time Earth in the near UV range (predominantly between 290 nm and 430\nnm), with a spatial resolution of about 6.3 km and different temporal\nresolutions of 2.5 $\\mu$s, 320 $\\mu$s and 41 ms. Mini-EUSO observations are\nextremely important to better assess the potential of a space-based detector in\nstudying Ultra-High Energy Cosmic Rays (UHECRs) such as K-EUSO and POEMMA. In\nthis contribution we focus the attention on the results of the UV measurements\nand we place them in the context of UHECR observations from space, namely the\nestimation of exposure.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:19:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bertaina","M.","","for the\n  JEM-EUSO Collaboration"],["Battisti","M.","","for the\n  JEM-EUSO Collaboration"],["Bianciotto","M.","","for the\n  JEM-EUSO Collaboration"],["Bolmgren","K.","","for the\n  JEM-EUSO Collaboration"],["Fenu","F.","","for the\n  JEM-EUSO Collaboration"]]}
{"id":"2308.13724","submitter":"Zhehua Zhou","authors":"Zhehua Zhou, Jiayang Song, Kunpeng Yao, Zhan Shu, Lei Ma","title":"ISR-LLM: Iterative Self-Refined Large Language Model for Long-Horizon\n  Sequential Task Planning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Motivated by the substantial achievements observed in Large Language Models\n(LLMs) in the field of natural language processing, recent research has\ncommenced investigations into the application of LLMs for complex, long-horizon\nsequential task planning challenges in robotics. LLMs are advantageous in\noffering the potential to enhance the generalizability as task-agnostic\nplanners and facilitate flexible interaction between human instructors and\nplanning systems. However, task plans generated by LLMs often lack feasibility\nand correctness. To address this challenge, we introduce ISR-LLM, a novel\nframework that improves LLM-based planning through an iterative self-refinement\nprocess. The framework operates through three sequential steps: preprocessing,\nplanning, and iterative self-refinement. During preprocessing, an LLM\ntranslator is employed to convert natural language input into a Planning Domain\nDefinition Language (PDDL) formulation. In the planning phase, an LLM planner\nformulates an initial plan, which is then assessed and refined in the iterative\nself-refinement step by using a validator. We examine the performance of\nISR-LLM across three distinct planning domains. The results show that ISR-LLM\nis able to achieve markedly higher success rates in task accomplishments\ncompared to state-of-the-art LLM-based planners. Moreover, it also preserves\nthe broad applicability and generalizability of working with natural language\ninstructions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:31:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Zhehua",""],["Song","Jiayang",""],["Yao","Kunpeng",""],["Shu","Zhan",""],["Ma","Lei",""]]}
{"id":"2308.13725","submitter":"Li Gong","authors":"BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C.\n  Ai, R. Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I.\n  Balossino, Y. Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M.\n  Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A.\n  Briere, A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S.\n  A. Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C.\n  Chen, Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T.\n  Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S.\n  Cheng, S. K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H.\n  L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A.\n  Denig, I. Denysenko, M. Destefanis, F. De~Mori, B. Ding, X. X. Ding, Y. Ding,\n  Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, Z. H.\n  Duan, P. Egorov, Y.H. Y. Fan, Y. L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y.\n  Fang, R. Farinelli, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng,\n  K Fischer, M. Fritsch, C. Fritzsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Y.\n  N. Gao, Yang Gao, S. Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M.\n  Gersabeck, A Gilman, K. Goetzen, L. Gong, W. X. Gong, W. Gradl, S. Gramigna,\n  M. Greco, M. H. Gu, C. Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, M. J. Guo,\n  R. P. Guo, Y. P. Guo, A. Guskov, T. T. Han, W. Y. Han, X. Q. Hao, F. A.\n  Harris, K. K. He, K. L. He, F. H. H. Heinsius, C. H. Heinz, Y. K. Heng, C.\n  Herold, T. Holtmann, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou,\n  H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, X.\n  T. Huang, Y. P. Huang, T. Hussain, N H\\\"usken, W. Imoehl, J. Jackson, S.\n  Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L. Ji, Y. Y.\n  Ji, X. Q. Jia, Z. K. Jia, H. J. Jiang, P. C. Jiang, S. S. Jiang, T. J. Jiang,\n  X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, T.\n  Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang,\n  M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R. Kliemt, O. B. Kolcu, B.\n  Kopf, M. Kuessner, A. Kupsc, W. K\\\"uhn, J. J. Lane, P. Larin, A. Lavania, L.\n  Lavezzi, T. T. Lei, Z. H. Lei, H. Leithoff, M. Lellmann, T. Lenz, C. Li, C.\n  Li, C. H. Li, Cheng Li, D. M. Li, F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H.\n  N. Li, Hui Li, J. R. Li, J. S. Li, J. W. Li, K. L. Li, Ke Li, L. J Li, L. K.\n  Li, Lei Li, M. H. Li, P. R. Li, Q. X. Li, S. X. Li, T. Li, W. D. Li, W. G.\n  Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J. Li, C. Liang, H. Liang, H.\n  Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. Z. Liao, Y. P.\n  Liao, J. Libby, A. Limphirat, D. X. Lin, T. Lin, B. J. Liu, B. X. Liu, C.\n  Liu, C. X. Liu, F. H. Liu, Fang Liu, Feng Liu, G. M. Liu, H. Liu, H. M. Liu,\n  Huanhuan Liu, Huihui Liu, J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu,\n  Ke Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu,\n  T. Liu, W. K. Liu, W. M. Liu, X. Liu, Y. Liu, Y. Liu, Y. B. Liu, Z. A. Liu,\n  Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P.\n  Lu, Z. H. Lu, C. L. Luo, M. X. Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu,\n  F. C. Ma, H. L. Ma, J. L. Ma, L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T.\n  Ma, X. Y. Ma, Y. Ma, Y. M. Ma, F. E. Maas, M. Maggiora, S. Malde, Q. A.\n  Malik, A. Mangoni, Y. J. Mao, Z. P. Mao, S. Marcello, Z. X. Meng, J. G.\n  Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, N.\n  Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, I. B. Nikolaev, Z. Ning, S.\n  Nisar, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan, A. Pathak,\n  P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, K. Peters, J. L. Ping, R. G.\n  Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H. Qi, H. R. Qi, M. Qi, T.\n  Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q. Qin, X. P. Qin, X.\n  S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K. J. Ren, A. Rivetti,\n  M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N. Salone, A. Sarantsev, Y.\n  Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X. Y. Shan, J.\n  F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X. Y.\n  Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q. Q. Shi, R. S. Shi, X.\n  Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y. X. Song, S. Sosio, S.\n  Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F.\n  Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. Sun, Y. J. Sun, Y. Z.\n  Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J. Tang, Y. A. Tang, L. Y\n  Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H. Tian, W. H. Tian, Y.\n  Tian, Z. F. Tian, I. Uman, S. J. Wang, B. Wang, B. L. Wang, Bo Wang, C. W.\n  Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, J. P. Wang, K. Wang, L. L.\n  Wang, M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, W.\n  Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, Y. Wang, Y. D.\n  Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi Wang,\n  Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D. H. Wei, F. Weidner, S.\n  P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M. Wolke, L. Wollenberg, C.\n  Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu, Y. Wu, Y. J. Wu, Z. Wu, L.\n  Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, S. Y. Xiao, Y. L. Xiao, Z. J.\n  Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing,\n  C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, W. Xu, W. L. Xu,\n  X. P. Xu, Y. C. Xu, Z. P. Xu, Z. S. Xu, F. Yan, L. Yan, W. B. Yan, W. C. Yan,\n  X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao Yang, Y. Yang, Y. F. Yang,\n  Y. X. Yang, Yifan Yang, Z. W. Yang, Z. P. Yao, M. Ye, M. H. Ye, J. H. Yin, Z.\n  Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, T. Yu, X. D. Yu, C. Z. Yuan, L.\n  Yuan, S. C. Yuan, X. Q. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, A. A. Zafar, F.\n  R. Zeng, X. Zeng, Y. Zeng, Y. J. Zeng, X. Y. Zhai, Y. C. Zhai, Y. H. Zhan, A.\n  Q. Zhang, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, H. Zhang, H. H.\n  Zhang, H. H. Zhang, H. Q. Zhang, H. Y. Zhang, J. Zhang, J. J. Zhang, J. L.\n  Zhang, J. Q. Zhang, J. W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang,\n  Jianyu Zhang, Jiawei Zhang, L. M. Zhang, L. Q. Zhang, Lei Zhang, P. Zhang, Q.\n  Y. Zhang, Shuihan Zhang, Shulei Zhang, X. D. Zhang, X. M. Zhang, X. Y. Zhang,\n  Xuyan Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H. Zhang, Y. X. Zhang, Yan\n  Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z. Y. Zhang, Z. Y. Zhang, G.\n  Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao, Ling Zhao, M. G. Zhao, S. J.\n  Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B. Zheng, J. P.\n  Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, L. P. Zhou, X.\n  Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, J. Zhu, K. Zhu, K. J.\n  Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu, T. J. Zhu, W. J. Zhu, Y. C.\n  Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Improved measurement of the branching fractions for\n  $J/\\psi\\to\\gamma\\pi^0$, $\\gamma\\eta$ and $\\gamma\\eta^\\prime$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using a data sample of $(1.0087\\pm 0.0044)\\times 10^{10}$ $J/\\psi$ events\ncollected with the BESIII detector, the decays of $J/\\psi\\to\\gamma\\pi^{0}\n(\\eta, \\eta^\\prime)\\to\\gamma\\gamma\\gamma$ are studied. Newly measured branching\nfractions are $\\mathcal{B}$$(J/\\psi\\to\\gamma\\pi^{0})$=$(3.34\\pm 0.02\\pm\n0.09)\\times 10^{-5}$, $\\mathcal{B}$$(J/\\psi\\to\\gamma\\eta)$=$(1.096\\pm\n0.001\\pm0.019)\\times 10^{-3}$ and\n$\\mathcal{B}$$(J/\\psi\\to\\gamma\\eta^\\prime)$=$(5.40\\pm 0.01\\pm0.11)\\times\n10^{-3}$, where the first uncertainties are statistical and the second are\nsystematic. These results are consistent with the world average values within\ntwo standard deviations. The ratio of partial widths\n$\\Gamma(J/\\psi\\to\\gamma\\eta^\\prime)/\\Gamma(J/\\psi\\to\\gamma\\eta)$ is measured to\nbe $4.93 \\pm 0.13$. The singlet-octet pseudoscalar mixing angle $\\theta_P$ is\ndetermined to be $\\theta_P = -(22.11 \\pm0.26)^\\circ$ or $-(19.34 \\pm\n0.34)^\\circ$ with two different phenomenological models.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:36:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["BESIII Collaboration","",""],["Ablikim","M.",""],["Achasov","M. N.",""],["Adlarson","P.",""],["Ai","X. C.",""],["Aliberti","R.",""],["Amoroso","A.",""],["An","M. R.",""],["An","Q.",""],["Bai","Y.",""],["Bakina","O.",""],["Balossino","I.",""],["Ban","Y.",""],["Batozskaya","V.",""],["Begzsuren","K.",""],["Berger","N.",""],["Berlowski","M.",""],["Bertani","M.",""],["Bettoni","D.",""],["Bianchi","F.",""],["Bianco","E.",""],["Bortone","A.",""],["Boyko","I.",""],["Briere","R. A.",""],["Brueggemann","A.",""],["Cai","H.",""],["Cai","X.",""],["Calcaterra","A.",""],["Cao","G. F.",""],["Cao","N.",""],["Cetin","S. A.",""],["Chang","J. F.",""],["Chang","T. T.",""],["Chang","W. L.",""],["Che","G. R.",""],["Chelkov","G.",""],["Chen","C.",""],["Chen","Chao",""],["Chen","G.",""],["Chen","H. S.",""],["Chen","M. L.",""],["Chen","S. J.",""],["Chen","S. M.",""],["Chen","T.",""],["Chen","X. R.",""],["Chen","X. T.",""],["Chen","Y. B.",""],["Chen","Y. Q.",""],["Chen","Z. J.",""],["Cheng","W. S.",""],["Choi","S. K.",""],["Chu","X.",""],["Cibinetto","G.",""],["Coen","S. C.",""],["Cossio","F.",""],["Cui","J. J.",""],["Dai","H. L.",""],["Dai","J. P.",""],["Dbeyssi","A.",""],["de Boer","R. E.",""],["Dedovich","D.",""],["Deng","Z. Y.",""],["Denig","A.",""],["Denysenko","I.",""],["Destefanis","M.",""],["De~Mori","F.",""],["Ding","B.",""],["Ding","X. X.",""],["Ding","Y.",""],["Ding","Y.",""],["Dong","J.",""],["Dong","L. Y.",""],["Dong","M. Y.",""],["Dong","X.",""],["Du","M. C.",""],["Du","S. X.",""],["Duan","Z. H.",""],["Egorov","P.",""],["Fan","Y. H. Y.",""],["Fan","Y. L.",""],["Fang","J.",""],["Fang","S. S.",""],["Fang","W. X.",""],["Fang","Y.",""],["Farinelli","R.",""],["Fava","L.",""],["Feldbauer","F.",""],["Felici","G.",""],["Feng","C. Q.",""],["Feng","J. H.",""],["Fischer","K",""],["Fritsch","M.",""],["Fritzsch","C.",""],["Fu","C. D.",""],["Fu","J. L.",""],["Fu","Y. W.",""],["Gao","H.",""],["Gao","Y. N.",""],["Gao","Yang",""],["Garbolino","S.",""],["Garzia","I.",""],["Ge","P. T.",""],["Ge","Z. W.",""],["Geng","C.",""],["Gersabeck","E. M.",""],["Gilman","A",""],["Goetzen","K.",""],["Gong","L.",""],["Gong","W. X.",""],["Gradl","W.",""],["Gramigna","S.",""],["Greco","M.",""],["Gu","M. H.",""],["Guan","C. Y",""],["Guan","Z. L.",""],["Guo","A. Q.",""],["Guo","L. B.",""],["Guo","M. J.",""],["Guo","R. P.",""],["Guo","Y. P.",""],["Guskov","A.",""],["Han","T. T.",""],["Han","W. Y.",""],["Hao","X. Q.",""],["Harris","F. A.",""],["He","K. K.",""],["He","K. L.",""],["Heinsius","F. H. H.",""],["Heinz","C. H.",""],["Heng","Y. K.",""],["Herold","C.",""],["Holtmann","T.",""],["Hong","P. C.",""],["Hou","G. Y.",""],["Hou","X. T.",""],["Hou","Y. R.",""],["Hou","Z. L.",""],["Hu","H. M.",""],["Hu","J. F.",""],["Hu","T.",""],["Hu","Y.",""],["Huang","G. S.",""],["Huang","K. X.",""],["Huang","L. Q.",""],["Huang","X. T.",""],["Huang","Y. P.",""],["Hussain","T.",""],["H\u00fcsken","N",""],["Imoehl","W.",""],["Jackson","J.",""],["Jaeger","S.",""],["Janchiv","S.",""],["Jeong","J. H.",""],["Ji","Q.",""],["Ji","Q. P.",""],["Ji","X. B.",""],["Ji","X. L.",""],["Ji","Y. Y.",""],["Jia","X. Q.",""],["Jia","Z. K.",""],["Jiang","H. J.",""],["Jiang","P. C.",""],["Jiang","S. S.",""],["Jiang","T. J.",""],["Jiang","X. S.",""],["Jiang","Y.",""],["Jiao","J. B.",""],["Jiao","Z.",""],["Jin","S.",""],["Jin","Y.",""],["Jing","M. Q.",""],["Johansson","T.",""],["K.","X.",""],["Kabana","S.",""],["Kalantar-Nayestanaki","N.",""],["Kang","X. L.",""],["Kang","X. S.",""],["Kavatsyuk","M.",""],["Ke","B. C.",""],["Khoukaz","A.",""],["Kiuchi","R.",""],["Kliemt","R.",""],["Kolcu","O. B.",""],["Kopf","B.",""],["Kuessner","M.",""],["Kupsc","A.",""],["K\u00fchn","W.",""],["Lane","J. J.",""],["Larin","P.",""],["Lavania","A.",""],["Lavezzi","L.",""],["Lei","T. T.",""],["Lei","Z. H.",""],["Leithoff","H.",""],["Lellmann","M.",""],["Lenz","T.",""],["Li","C.",""],["Li","C.",""],["Li","C. H.",""],["Li","Cheng",""],["Li","D. M.",""],["Li","F.",""],["Li","G.",""],["Li","H.",""],["Li","H. B.",""],["Li","H. J.",""],["Li","H. N.",""],["Li","Hui",""],["Li","J. R.",""],["Li","J. S.",""],["Li","J. W.",""],["Li","K. L.",""],["Li","Ke",""],["Li","L. J",""],["Li","L. K.",""],["Li","Lei",""],["Li","M. H.",""],["Li","P. R.",""],["Li","Q. X.",""],["Li","S. X.",""],["Li","T.",""],["Li","W. D.",""],["Li","W. G.",""],["Li","X. H.",""],["Li","X. L.",""],["Li","Xiaoyu",""],["Li","Y. G.",""],["Li","Z. J.",""],["Liang","C.",""],["Liang","H.",""],["Liang","H.",""],["Liang","H.",""],["Liang","Y. F.",""],["Liang","Y. T.",""],["Liao","G. R.",""],["Liao","L. Z.",""],["Liao","Y. P.",""],["Libby","J.",""],["Limphirat","A.",""],["Lin","D. X.",""],["Lin","T.",""],["Liu","B. J.",""],["Liu","B. X.",""],["Liu","C.",""],["Liu","C. X.",""],["Liu","F. H.",""],["Liu","Fang",""],["Liu","Feng",""],["Liu","G. M.",""],["Liu","H.",""],["Liu","H. M.",""],["Liu","Huanhuan",""],["Liu","Huihui",""],["Liu","J. B.",""],["Liu","J. L.",""],["Liu","J. Y.",""],["Liu","K.",""],["Liu","K. Y.",""],["Liu","Ke",""],["Liu","L.",""],["Liu","L. C.",""],["Liu","Lu",""],["Liu","M. H.",""],["Liu","P. L.",""],["Liu","Q.",""],["Liu","S. B.",""],["Liu","T.",""],["Liu","W. K.",""],["Liu","W. M.",""],["Liu","X.",""],["Liu","Y.",""],["Liu","Y.",""],["Liu","Y. B.",""],["Liu","Z. A.",""],["Liu","Z. Q.",""],["Lou","X. C.",""],["Lu","F. X.",""],["Lu","H. J.",""],["Lu","J. G.",""],["Lu","X. L.",""],["Lu","Y.",""],["Lu","Y. P.",""],["Lu","Z. H.",""],["Luo","C. L.",""],["Luo","M. X.",""],["Luo","T.",""],["Luo","X. L.",""],["Lyu","X. R.",""],["Lyu","Y. F.",""],["Ma","F. C.",""],["Ma","H. L.",""],["Ma","J. L.",""],["Ma","L. L.",""],["Ma","M. M.",""],["Ma","Q. M.",""],["Ma","R. Q.",""],["Ma","R. T.",""],["Ma","X. Y.",""],["Ma","Y.",""],["Ma","Y. M.",""],["Maas","F. E.",""],["Maggiora","M.",""],["Malde","S.",""],["Malik","Q. A.",""],["Mangoni","A.",""],["Mao","Y. J.",""],["Mao","Z. P.",""],["Marcello","S.",""],["Meng","Z. X.",""],["Messchendorp","J. G.",""],["Mezzadri","G.",""],["Miao","H.",""],["Min","T. J.",""],["Mitchell","R. E.",""],["Mo","X. H.",""],["Muchnoi","N. Yu.",""],["Muskalla","J.",""],["Nefedov","Y.",""],["Nerling","F.",""],["Nikolaev","I. B.",""],["Ning","Z.",""],["Nisar","S.",""],["Niu","Y.",""],["Olsen","S. L.",""],["Ouyang","Q.",""],["Pacetti","S.",""],["Pan","X.",""],["Pan","Y.",""],["Pathak","A.",""],["Patteri","P.",""],["Pei","Y. P.",""],["Pelizaeus","M.",""],["Peng","H. P.",""],["Peters","K.",""],["Ping","J. L.",""],["Ping","R. G.",""],["Plura","S.",""],["Pogodin","S.",""],["Prasad","V.",""],["Qi","F. Z.",""],["Qi","H.",""],["Qi","H. R.",""],["Qi","M.",""],["Qi","T. Y.",""],["Qian","S.",""],["Qian","W. B.",""],["Qiao","C. F.",""],["Qin","J. J.",""],["Qin","L. Q.",""],["Qin","X. P.",""],["Qin","X. S.",""],["Qin","Z. H.",""],["Qiu","J. F.",""],["Qu","S. Q.",""],["Redmer","C. F.",""],["Ren","K. J.",""],["Rivetti","A.",""],["Rolo","M.",""],["Rong","G.",""],["Rosner","Ch.",""],["Ruan","S. N.",""],["Salone","N.",""],["Sarantsev","A.",""],["Schelhaas","Y.",""],["Schoenning","K.",""],["Scodeggio","M.",""],["Shan","K. Y.",""],["Shan","W.",""],["Shan","X. Y.",""],["Shangguan","J. F.",""],["Shao","L. G.",""],["Shao","M.",""],["Shen","C. P.",""],["Shen","H. F.",""],["Shen","W. H.",""],["Shen","X. Y.",""],["Shi","B. A.",""],["Shi","H. C.",""],["Shi","J. L.",""],["Shi","J. Y.",""],["Shi","Q. Q.",""],["Shi","R. S.",""],["Shi","X.",""],["Song","J. J.",""],["Song","T. Z.",""],["Song","W. M.",""],["Song","Y. J.",""],["Song","Y. X.",""],["Sosio","S.",""],["Spataro","S.",""],["Stieler","F.",""],["Su","Y. J.",""],["Sun","G. B.",""],["Sun","G. X.",""],["Sun","H.",""],["Sun","H. K.",""],["Sun","J. F.",""],["Sun","K.",""],["Sun","L.",""],["Sun","S. S.",""],["Sun","T.",""],["Sun","W. Y.",""],["Sun","Y.",""],["Sun","Y. J.",""],["Sun","Y. Z.",""],["Sun","Z. T.",""],["Tan","Y. X.",""],["Tang","C. J.",""],["Tang","G. Y.",""],["Tang","J.",""],["Tang","Y. A.",""],["Tao","L. Y",""],["Tao","Q. T.",""],["Tat","M.",""],["Teng","J. X.",""],["Thoren","V.",""],["Tian","W. H.",""],["Tian","W. H.",""],["Tian","Y.",""],["Tian","Z. F.",""],["Uman","I.",""],["Wang","S. J.",""],["Wang","B.",""],["Wang","B. L.",""],["Wang","Bo",""],["Wang","C. W.",""],["Wang","D. Y.",""],["Wang","F.",""],["Wang","H. J.",""],["Wang","H. P.",""],["Wang","J. P.",""],["Wang","K.",""],["Wang","L. L.",""],["Wang","M.",""],["Wang","Meng",""],["Wang","S.",""],["Wang","S.",""],["Wang","T.",""],["Wang","T. J.",""],["Wang","W.",""],["Wang","W.",""],["Wang","W. P.",""],["Wang","X.",""],["Wang","X. F.",""],["Wang","X. J.",""],["Wang","X. L.",""],["Wang","Y.",""],["Wang","Y. D.",""],["Wang","Y. F.",""],["Wang","Y. H.",""],["Wang","Y. N.",""],["Wang","Y. Q.",""],["Wang","Yaqian",""],["Wang","Yi",""],["Wang","Z.",""],["Wang","Z. L.",""],["Wang","Z. Y.",""],["Wang","Ziyi",""],["Wei","D.",""],["Wei","D. H.",""],["Weidner","F.",""],["Wen","S. P.",""],["Wenzel","C. W.",""],["Wiedner","U.",""],["Wilkinson","G.",""],["Wolke","M.",""],["Wollenberg","L.",""],["Wu","C.",""],["Wu","J. F.",""],["Wu","L. H.",""],["Wu","L. J.",""],["Wu","X.",""],["Wu","X. H.",""],["Wu","Y.",""],["Wu","Y. J.",""],["Wu","Z.",""],["Xia","L.",""],["Xian","X. M.",""],["Xiang","T.",""],["Xiao","D.",""],["Xiao","G. Y.",""],["Xiao","S. Y.",""],["Xiao","Y. L.",""],["Xiao","Z. J.",""],["Xie","C.",""],["Xie","X. H.",""],["Xie","Y.",""],["Xie","Y. G.",""],["Xie","Y. H.",""],["Xie","Z. P.",""],["Xing","T. Y.",""],["Xu","C. F.",""],["Xu","C. J.",""],["Xu","G. F.",""],["Xu","H. Y.",""],["Xu","Q. J.",""],["Xu","Q. N.",""],["Xu","W.",""],["Xu","W. L.",""],["Xu","X. P.",""],["Xu","Y. C.",""],["Xu","Z. P.",""],["Xu","Z. S.",""],["Yan","F.",""],["Yan","L.",""],["Yan","W. B.",""],["Yan","W. C.",""],["Yan","X. Q.",""],["Yang","H. J.",""],["Yang","H. L.",""],["Yang","H. X.",""],["Yang","Tao",""],["Yang","Y.",""],["Yang","Y. F.",""],["Yang","Y. X.",""],["Yang","Yifan",""],["Yang","Z. W.",""],["Yao","Z. P.",""],["Ye","M.",""],["Ye","M. H.",""],["Yin","J. H.",""],["You","Z. Y.",""],["Yu","B. X.",""],["Yu","C. X.",""],["Yu","G.",""],["Yu","J. S.",""],["Yu","T.",""],["Yu","X. D.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Yuan","S. C.",""],["Yuan","X. Q.",""],["Yuan","Y.",""],["Yuan","Z. Y.",""],["Yue","C. X.",""],["Zafar","A. A.",""],["Zeng","F. R.",""],["Zeng","X.",""],["Zeng","Y.",""],["Zeng","Y. J.",""],["Zhai","X. Y.",""],["Zhai","Y. C.",""],["Zhan","Y. H.",""],["Zhang","A. Q.",""],["Zhang","B. L.",""],["Zhang","B. X.",""],["Zhang","D. H.",""],["Zhang","G. Y.",""],["Zhang","H.",""],["Zhang","H. H.",""],["Zhang","H. H.",""],["Zhang","H. Q.",""],["Zhang","H. Y.",""],["Zhang","J.",""],["Zhang","J. J.",""],["Zhang","J. L.",""],["Zhang","J. Q.",""],["Zhang","J. W.",""],["Zhang","J. X.",""],["Zhang","J. Y.",""],["Zhang","J. Z.",""],["Zhang","Jianyu",""],["Zhang","Jiawei",""],["Zhang","L. M.",""],["Zhang","L. Q.",""],["Zhang","Lei",""],["Zhang","P.",""],["Zhang","Q. Y.",""],["Zhang","Shuihan",""],["Zhang","Shulei",""],["Zhang","X. D.",""],["Zhang","X. M.",""],["Zhang","X. Y.",""],["Zhang","Xuyan",""],["Zhang","Y.",""],["Zhang","Y.",""],["Zhang","Y. T.",""],["Zhang","Y. H.",""],["Zhang","Y. X.",""],["Zhang","Yan",""],["Zhang","Yao",""],["Zhang","Z. H.",""],["Zhang","Z. L.",""],["Zhang","Z. Y.",""],["Zhang","Z. Y.",""],["Zhao","G.",""],["Zhao","J.",""],["Zhao","J. Y.",""],["Zhao","J. Z.",""],["Zhao","Lei",""],["Zhao","Ling",""],["Zhao","M. G.",""],["Zhao","S. J.",""],["Zhao","Y. B.",""],["Zhao","Y. X.",""],["Zhao","Z. G.",""],["Zhemchugov","A.",""],["Zheng","B.",""],["Zheng","J. P.",""],["Zheng","W. J.",""],["Zheng","Y. H.",""],["Zhong","B.",""],["Zhong","X.",""],["Zhou","H.",""],["Zhou","L. P.",""],["Zhou","X.",""],["Zhou","X. K.",""],["Zhou","X. R.",""],["Zhou","X. Y.",""],["Zhou","Y. Z.",""],["Zhu","J.",""],["Zhu","K.",""],["Zhu","K. J.",""],["Zhu","L.",""],["Zhu","L. X.",""],["Zhu","S. H.",""],["Zhu","S. Q.",""],["Zhu","T. J.",""],["Zhu","W. J.",""],["Zhu","Y. C.",""],["Zhu","Z. A.",""],["Zou","J. H.",""],["Zu","J.",""]]}
{"id":"2308.13726","submitter":"Farbod Faraji","authors":"Farbod Faraji, Maryam Reza, Aaron Knoll, J. Nathan Kutz","title":"Dynamic Mode Decomposition for data-driven analysis and reduced-order\n  modelling of ExB plasmas: I. Extraction of spatiotemporally coherent patterns","comments":"21 pages, 16 figues","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this two-part article, we evaluate the utility and the generalizability of\nthe Dynamic Mode Decomposition (DMD) algorithm for data-driven analysis and\nreduced-order modelling of plasma dynamics in cross-field ExB configurations.\nThe DMD algorithm is an interpretable data-driven method that finds a best-fit\nlinear model describing the time evolution of spatiotemporally coherent\nstructures (patterns) in data. We have applied the DMD to extensive\nhigh-fidelity datasets generated using a particle-in-cell (PIC) code based on a\ncost-efficient reduced-order PIC scheme. In this part, we first provide an\noverview of the concept of DMD and its underpinning Proper Orthogonal and\nSingular Value Decomposition methods. Two of the main DMD variants are next\nintroduced. We then present and discuss the results of the DMD application in\nterms of the identification and extraction of the dominant spatiotemporal modes\nfrom high-fidelity data over a range of simulation conditions. We demonstrate\nthat the DMD variant based on variable projection optimization (OPT-DMD)\noutperforms the basic DMD method in identification of the modes underlying the\ndata, leading to notably more reliable reconstruction of the ground-truth.\nFurthermore, we show in multiple test cases that the discrete frequency\nspectrum of OPT-DMD-extracted modes is consistent with the temporal spectrum\nfrom the Fast Fourier Transform of the data. This observation implies that the\nOPT-DMD augments the conventional spectral analyses by being able to uniquely\nreveal the spatial structure of the dominant modes in the frequency spectra,\nthus, yielding more accessible, comprehensive information on the spatiotemporal\ncharacteristics of the plasma phenomena.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:37:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Faraji","Farbod",""],["Reza","Maryam",""],["Knoll","Aaron",""],["Kutz","J. Nathan",""]]}
{"id":"2308.13727","submitter":"Farbod Faraji","authors":"Farbod Faraji, Maryam Reza, Aaron Knoll, J. Nathan Kutz","title":"Dynamic Mode Decomposition for data-driven analysis and reduced-order\n  modelling of ExB plasmas: II. dynamics forecasting","comments":"14 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In part I of the article, we demonstrated that a variant of the Dynamic Mode\nDecomposition (DMD) algorithm based on variable projection optimization, called\nOptimized DMD (OPT-DMD), enables a robust identification of the dominant\nspatiotemporally coherent modes underlying the data across various test cases\nrepresenting different physical parameters in an ExB simulation configuration.\nAs the OPT-DMD can be constrained to produce stable reduced-order models (ROMs)\nby construction, in this paper, we extend the application of the OPT-DMD and\ninvestigate the capabilities of the linear ROM from this algorithm toward\nforecasting in time of the plasma dynamics in configurations representative of\nthe radial-azimuthal and axial-azimuthal cross-sections of a Hall thruster and\nover a range of simulation parameters in each test case. The predictive\ncapacity of the OPT-DMD ROM is assessed primarily in terms of short-term\ndynamics forecast or, in other words, for large ratios of training-to-test\ndata. However, the utility of the ROM for long-term dynamics forecasting is\nalso presented for an example case in the radial-azimuthal configuration. The\nmodel's predictive performance is heterogeneous across various test cases.\nNonetheless, a remarkable predictiveness is observed in the test cases that do\nnot exhibit highly transient behaviors. Moreover, in all investigated cases,\nthe error between the ground-truth and the reconstructed data from the OPT-DMD\nROM remains bounded over time within both the training and the test window. As\na result, despite its limitation in terms of generalized applicability to all\nplasma conditions, the OPT-DMD is proven as a reliable method to develop low\ncomputational cost and highly predictive data-driven reduced-order models in\nsystems with a quasi-periodic global evolution of the plasma state.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 01:48:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Faraji","Farbod",""],["Reza","Maryam",""],["Knoll","Aaron",""],["Kutz","J. Nathan",""]]}
{"id":"2308.13728","submitter":"Rafael H. Villarreal","authors":"Manuel Gonz\\'alez-Sarabia, Humberto Mu\\~noz-George, Jorge A. Ordaz,\n  Eduardo S\\'aenz-de-Cabez\\'on, Rafael H. Villarreal","title":"Indicator functions, v-numbers and Gorenstein rings in the theory of\n  projective Reed-Muller-type codes","comments":"28 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC cs.IT math.AG math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For projective Reed--Muller-type codes we give a duality criterion in terms\nof the v-number and the Hilbert function of a vanishing ideal. As an\napplication, we provide an explicit duality for projective Reed--Muller-type\ncodes corresponding to Gorenstein vanishing ideals, generalizing the known case\nwhere the vanishing ideal is a complete intersection. The theory of Gorenstein\nvanishing ideals is examined using indicator functions. For projective\nevaluation codes, we give local duality criteria inspired by that of affine\nevaluation codes. We show how to compute the regularity index of the $r$-th\ngeneralized Hamming weight function in terms of the standard indicator\nfunctions of the set of evaluation points.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:01:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gonz\u00e1lez-Sarabia","Manuel",""],["Mu\u00f1oz-George","Humberto",""],["Ordaz","Jorge A.",""],["S\u00e1enz-de-Cabez\u00f3n","Eduardo",""],["Villarreal","Rafael H.",""]]}
{"id":"2308.13729","submitter":"Yu Ge","authors":"Yu Ge, Hyowon Kim, Lennart Svensson, Henk Wymeersch, Sumei Sun","title":"Integrated Monostatic and Bistatic mmWave Sensing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Millimeter-wave (mmWave) signals provide attractive opportunities for sensing\ndue to their inherent geometrical connections to physical propagation channels.\nTwo common modalities used in mmWave sensing are monostatic and bistatic\nsensing, which are usually considered separately. By integrating these two\nmodalities, information can be shared between them, leading to improved sensing\nperformance. In this paper, we investigate the integration of monostatic and\nbistatic sensing in a 5G mmWave scenario, implement the extended Kalman-Poisson\nmulti-Bernoulli sequential filters to solve the sensing problems, and propose a\nmethod to periodically fuse user states and maps from two sensing modalities.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:02:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ge","Yu",""],["Kim","Hyowon",""],["Svensson","Lennart",""],["Wymeersch","Henk",""],["Sun","Sumei",""]]}
{"id":"2308.13730","submitter":"Yi Sheng","authors":"Yi Sheng, Junhuan Yang, Lei Yang, Yiyu Shi, Jingtongf Hu, Weiwen Jiang","title":"Muffin: A Framework Toward Multi-Dimension AI Fairness by Uniting\n  Off-the-Shelf Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Model fairness (a.k.a., bias) has become one of the most critical problems in\na wide range of AI applications. An unfair model in autonomous driving may\ncause a traffic accident if corner cases (e.g., extreme weather) cannot be\nfairly regarded; or it will incur healthcare disparities if the AI model\nmisdiagnoses a certain group of people (e.g., brown and black skin). In recent\nyears, there have been emerging research works on addressing unfairness, and\nthey mainly focus on a single unfair attribute, like skin tone; however,\nreal-world data commonly have multiple attributes, among which unfairness can\nexist in more than one attribute, called 'multi-dimensional fairness'. In this\npaper, we first reveal a strong correlation between the different unfair\nattributes, i.e., optimizing fairness on one attribute will lead to the\ncollapse of others. Then, we propose a novel Multi-Dimension Fairness\nframework, namely Muffin, which includes an automatic tool to unite\noff-the-shelf models to improve the fairness on multiple attributes\nsimultaneously. Case studies on dermatology datasets with two unfair attributes\nshow that the existing approach can achieve 21.05% fairness improvement on the\nfirst attribute while it makes the second attribute unfair by 1.85%. On the\nother hand, the proposed Muffin can unite multiple models to achieve\nsimultaneously 26.32% and 20.37% fairness improvement on both attributes;\nmeanwhile, it obtains 5.58% accuracy gain.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:04:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sheng","Yi",""],["Yang","Junhuan",""],["Yang","Lei",""],["Shi","Yiyu",""],["Hu","Jingtongf",""],["Jiang","Weiwen",""]]}
{"id":"2308.13731","submitter":"Marcel Hirt","authors":"Marcel Hirt, Vasileios Kreouzis, Petros Dellaportas","title":"Learning variational autoencoders via MCMC speed measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Variational autoencoders (VAEs) are popular likelihood-based generative\nmodels which can be efficiently trained by maximizing an Evidence Lower Bound\n(ELBO). There has been much progress in improving the expressiveness of the\nvariational distribution to obtain tighter variational bounds and increased\ngenerative performance. Whilst previous work has leveraged Markov chain Monte\nCarlo (MCMC) methods for the construction of variational densities,\ngradient-based methods for adapting the proposal distributions for deep latent\nvariable models have received less attention. This work suggests an\nentropy-based adaptation for a short-run Metropolis-adjusted Langevin (MALA) or\nHamiltonian Monte Carlo (HMC) chain while optimising a tighter variational\nbound to the log-evidence. Experiments show that this approach yields higher\nheld-out log-likelihoods as well as improved generative metrics. Our implicit\nvariational density can adapt to complicated posterior geometries of latent\nhierarchical representations arising in hierarchical VAEs.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:15:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hirt","Marcel",""],["Kreouzis","Vasileios",""],["Dellaportas","Petros",""]]}
{"id":"2308.13732","submitter":"Cheuk Yin Lee","authors":"Davar Khoshnevisan, Cheuk Yin Lee, Yimin Xiao","title":"Local times of Gaussian random fields and stochastic heat equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the local times of anisotropic Gaussian random fields satisfying\nstrong local nondeterminism with respect to an anisotropic metric. We derive\nmoment estimates and prove local and global H\\\"{o}lder conditions for the local\ntimes. As a consequence, we deduce sample path properties that are related to\nChung's law of the iterated logarithm and modulus of non-differentiability of\nthe Gaussian random fields. We apply the results to systems of stochastic heat\nequations with additive Gaussian noise and determine the exact Hausdorff\nmeasure function for the level sets of the solutions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:16:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khoshnevisan","Davar",""],["Lee","Cheuk Yin",""],["Xiao","Yimin",""]]}
{"id":"2308.13733","submitter":"Xiao Luo","authors":"Xiao Luo, Hakan Salihoglu, Zexiao Wang, Zhuo Li, Hyeonggyun Kim, Jiayu\n  Li, Bowen Yu, Shen Du, Sheng Shen","title":"Nanodevice-Enabled Near-Field Thermal Radiation between Sub-Wavelength\n  Surfaces","comments":"35 pages, 19 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cond-mat.mes-hall physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the continuous advancement of nanotechnology, nanodevices have become\ncrucial components in computing, sensing and energy conversion applications.\nHowever, the structures of nanodevices typically possess sub-wavelength\ndimensions and separations, which pose significant challenges for understanding\nenergy transport phenomena in nanodevices. Here, based on a judiciously\ndesigned thermal nanodevice, we report the first measurement of near-field\nenergy transport between two coplanar sub-wavelength structures over\ntemperature bias up to ~190 K. Our experimental results demonstrate a\nremarkable 20-fold enhancement in heat transfer beyond blackbody radiation. In\ncontrast with the well-established near-field interactions between two\nsemi-infinite bodies, the sub-wavelength confinements in nanodevices lead to\nthe increased polariton scattering and the reduction of supporting modes and\ntherefore a lower heat flow at a given separation. Our work unveils exciting\nopportunities for the rational design of nanodevices, particularly for on-chip\nnear-field energy transport, with important implications for the development of\nefficient nanodevices for energy harvesting and thermal management.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:19:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luo","Xiao",""],["Salihoglu","Hakan",""],["Wang","Zexiao",""],["Li","Zhuo",""],["Kim","Hyeonggyun",""],["Li","Jiayu",""],["Yu","Bowen",""],["Du","Shen",""],["Shen","Sheng",""]]}
{"id":"2308.13734","submitter":"Jun Meng","authors":"Jun Meng, Md Sariful Sheikh, Ryan Jacobs, Jian Liu, William O.\n  Nachlas, Xiangguo Li, Dane Morgan","title":"Computational Discovery of Fast Interstitial Oxygen Conductors","comments":"In submission","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  New highly oxygen-active materials may enhance many energy-related\ntechnologies by enabling efficient oxygen-ion transport at lower temperatures,\ne.g., below 400 Celsius. Interstitial oxygen conductors have the potential to\nrealize such performance but have received far less attention than\nvacancy-mediated conductors. Here, we combine physically-motivated structure\nand property descriptors, ab initio simulations, and experiments to demonstrate\nan approach to discover new fast interstitial oxygen conductors. Multiple new\nfamilies were found which adopt completely different structures from known\noxygen conductors. From these families, we synthesized and studied oxygen\nkinetics in La4Mn5Si4O22+d (LMS), a representative member of\nperrierite/chevkinite family. We found LMS has higher oxygen ionic conductivity\nthan the widely used yttria-stabilized ZrO2, and among the highest surface\noxygen exchange rates at intermediate temperature of known materials. The fast\noxygen kinetics is the result of simultaneously active interstitial and\ninterstitialcy diffusion pathways. This work developed and demonstrated a\npowerful approach for discovering new families of interstitial oxygen\nconductors and suggests many more such materials remain to be discovered.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:37:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meng","Jun",""],["Sheikh","Md Sariful",""],["Jacobs","Ryan",""],["Liu","Jian",""],["Nachlas","William O.",""],["Li","Xiangguo",""],["Morgan","Dane",""]]}
{"id":"2308.13735","submitter":"Quang Hieu Vo","authors":"Quang Hieu Vo, Linh-Tam Tran, Sung-Ho Bae, Lok-Won Kim and Choong Seon\n  Hong","title":"MST-compression: Compressing and Accelerating Binary Neural Networks\n  with Minimum Spanning Tree","comments":"11 pages, 9 figures, ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Binary neural networks (BNNs) have been widely adopted to reduce the\ncomputational cost and memory storage on edge-computing devices by using\none-bit representation for activations and weights. However, as neural networks\nbecome wider/deeper to improve accuracy and meet practical requirements, the\ncomputational burden remains a significant challenge even on the binary\nversion. To address these issues, this paper proposes a novel method called\nMinimum Spanning Tree (MST) compression that learns to compress and accelerate\nBNNs. The proposed architecture leverages an observation from previous works\nthat an output channel in a binary convolution can be computed using another\noutput channel and XNOR operations with weights that differ from the weights of\nthe reused channel. We first construct a fully connected graph with vertices\ncorresponding to output channels, where the distance between two vertices is\nthe number of different values between the weight sets used for these outputs.\nThen, the MST of the graph with the minimum depth is proposed to reorder output\ncalculations, aiming to reduce computational cost and latency. Moreover, we\npropose a new learning algorithm to reduce the total MST distance during\ntraining. Experimental results on benchmark models demonstrate that our method\nachieves significant compression ratios with negligible accuracy drops, making\nit a promising approach for resource-constrained edge-computing devices.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:42:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vo","Quang Hieu",""],["Tran","Linh-Tam",""],["Bae","Sung-Ho",""],["Kim","Lok-Won",""],["Hong","Choong Seon",""]]}
{"id":"2308.13736","submitter":"Zeyu Xiong","authors":"Zeyu Xiong, Weitao Wang, Jing Yu, Yue Lin, Ziyan Wang","title":"A Comprehensive Survey for Evaluation Methodologies of AI-Generated\n  Music","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI cs.HC eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, AI-generated music has made significant progress, with\nseveral models performing well in multimodal and complex musical genres and\nscenes. While objective metrics can be used to evaluate generative music, they\noften lack interpretability for musical evaluation. Therefore, researchers\noften resort to subjective user studies to assess the quality of the generated\nworks, which can be resource-intensive and less reproducible than objective\nmetrics. This study aims to comprehensively evaluate the subjective, objective,\nand combined methodologies for assessing AI-generated music, highlighting the\nadvantages and disadvantages of each approach. Ultimately, this study provides\na valuable reference for unifying generative AI in the field of music\nevaluation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:44:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiong","Zeyu",""],["Wang","Weitao",""],["Yu","Jing",""],["Lin","Yue",""],["Wang","Ziyan",""]]}
{"id":"2308.13737","submitter":"Yushu Shi","authors":"Yushu Shi, Liangliang Zhang, Kim-Anh Do, Robert J. Jenq, Christine B.\n  Peterson","title":"survivalContour: Visualizing predicted survival via colored contour\n  plots","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Advances in survival analysis have facilitated unprecedented flexibility in\ndata modeling, yet there remains a lack of tools for graphically illustrating\nthe influence of continuous covariates on predicted survival outcomes. We\npropose the utilization of a colored contour plot to depict the predicted\nsurvival probabilities over time, and provide a Shiny app and R package as\nimplementations of this tool. Our approach is capable of supporting\nconventional models, including the Cox and Fine-Gray models. However, its\ncapability shines when coupled with cutting-edge machine learning models such\nas deep neural networks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:50:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shi","Yushu",""],["Zhang","Liangliang",""],["Do","Kim-Anh",""],["Jenq","Robert J.",""],["Peterson","Christine B.",""]]}
{"id":"2308.13738","submitter":"Benyamin Ghojogh","authors":"Benyamin Ghojogh, Morteza Babaie","title":"On Philomatics and Psychomatics for Combining Philosophy and Psychology\n  with Mathematics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose the concepts of philomatics and psychomatics as hybrid\ncombinations of philosophy and psychology with mathematics. We explain four\nmotivations for this combination which are fulfilling the desire of analytical\nphilosophy, proposing science of philosophy, justifying mathematical algorithms\nby philosophy, and abstraction in both philosophy and mathematics. We enumerate\nvarious examples for philomatics and psychomatics, some of which are explained\nin more depth. The first example is the analysis of relation between the\ncontext principle, semantic holism, and the usage theory of meaning with the\nattention mechanism in mathematics. The other example is on the relations of\nPlato's theory of forms in philosophy with the holographic principle in string\ntheory, object-oriented programming, and machine learning. Finally, the\nrelation between Wittgenstein's family resemblance and clustering in\nmathematics is explained. This paper opens the door of research for combining\nphilosophy and psychology with mathematics.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:52:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghojogh","Benyamin",""],["Babaie","Morteza",""]]}
{"id":"2308.13739","submitter":"Xuhang Chen","authors":"Shenghong Luo, Xuhang Chen, Weiwen Chen, Zinuo Li, Shuqiang Wang,\n  Chi-Man Pun","title":"Devignet: High-Resolution Vignetting Removal via a Dual Aggregated\n  Fusion Transformer With Adaptive Channel Expansion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vignetting commonly occurs as a degradation in images resulting from factors\nsuch as lens design, improper lens hood usage, and limitations in camera\nsensors. This degradation affects image details, color accuracy, and presents\nchallenges in computational photography. Existing vignetting removal algorithms\npredominantly rely on ideal physics assumptions and hand-crafted parameters,\nresulting in ineffective removal of irregular vignetting and suboptimal\nresults. Moreover, the substantial lack of real-world vignetting datasets\nhinders the objective and comprehensive evaluation of vignetting removal. To\naddress these challenges, we present Vigset, a pioneering dataset for vignette\nremoval. Vigset includes 983 pairs of both vignetting and vignetting-free\nhigh-resolution ($5340\\times3697$) real-world images under various conditions.\nIn addition, We introduce DeVigNet, a novel frequency-aware Transformer\narchitecture designed for vignetting removal. Through the Laplacian Pyramid\ndecomposition, we propose the Dual Aggregated Fusion Transformer to handle\nglobal features and remove vignetting in the low-frequency domain.\nAdditionally, we introduce the Adaptive Channel Expansion Module to enhance\ndetails in the high-frequency domain. The experiments demonstrate that the\nproposed model outperforms existing state-of-the-art methods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:55:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luo","Shenghong",""],["Chen","Xuhang",""],["Chen","Weiwen",""],["Li","Zinuo",""],["Wang","Shuqiang",""],["Pun","Chi-Man",""]]}
{"id":"2308.13740","submitter":"Ze-Chun Hu","authors":"Qian-Qian Zhou, Han Zhao, Ze-Chun Hu, Renming Song","title":"Some New Results on Gaussian Product Inequalities","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The long-standing Gaussian product inequality (GPI) conjecture states that,\nfor any centered $\\mathbb{R}^n$-valued Gaussian random vector $(X_1, \\dots,\nX_n)$ and any positive reals $\\alpha_1, \\dots, \\alpha_n$, ${\\bf\nE}[\\prod_{j=1}^{n}|X_j|^{\\alpha_j}]\\ge \\prod_{j=1}^{n}{\\bf\nE}[|X_j|^{\\alpha_j}]$. In this paper, we present some related inequalities for\ncentered $\\mathbb{R}^n$-valued Gaussian random vector $(X_1, \\dots, X_n)$ when\n$\\{\\alpha_1, \\dots, \\alpha_n\\}$ contains both positive and negative numbers.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:56:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Qian-Qian",""],["Zhao","Han",""],["Hu","Ze-Chun",""],["Song","Renming",""]]}
{"id":"2308.13741","submitter":"Kei Saito","authors":"Kei Saito, Etsuo Segawa","title":"A method of approximation of discrete Schr\\\"odinger equation with the\n  normalized Laplacian by discrete-time quantum walk on graphs","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a class of continuous-time quantum walk models on graphs induced\nby a certain class of discrete-time quantum walk models with the parameter\n$\\epsilon\\in [0,1]$. Here the graph treated in this paper can be applied both\nfinite and infinite cases. The induced continuous-time quantum walk is an\nextended version of the (free) discrete-Schr\\\"odinger equation driven by the\nnormalized Laplacian: the element of the weighted Hermitian takes not only a\nscalar value but also a matrix value depending on the underlying discrete-time\nquantum walk. We show that each discrete-time quantum walk with an appropriate\nsetting of the parameter $\\epsilon$ in the long time limit identifies with its\ninduced continuous-time quantum walk and give the running time for the\ndiscrete-time to approximate the induced continuous-time quantum walk with a\nsmall error $\\delta$. We also investigate the detailed spectral information on\nthe induced continuous-time quantum walk.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 02:57:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Saito","Kei",""],["Segawa","Etsuo",""]]}
{"id":"2308.13742","submitter":"Daniel Dominik","authors":"Anton Bernshteyn, Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock","title":"DP-Coloring of Graphs from Random Covers","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  DP-coloring (also called correspondence coloring) of graphs is a\ngeneralization of list coloring that has been widely studied since its\nintroduction by Dvo\\v{r}\\'{a}k and Postle in $2015$. DP-coloring of a graph $G$\nis equivalent to an independent transversal of a DP-cover of $G$. Intuitively,\na $k$-fold DP-cover of a graph $G$ is an assignment of lists of size $k$ to the\nvertices of $G$ where the names of colors vary from edge to edge. In this\npaper, we introduce the notion of random DP-covers and study the behavior of\nDP-coloring from such random covers. We prove a series of results about the\nprobability that a graph is or is not DP-colorable from a random cover. These\nresults support the following threshold behavior on random $k$-fold DP-covers\nas $\\rho\\to\\infty$ where $\\rho$ is the maximum density of a graph: graphs are\nnon-DP-colorable with high probability when $k$ is sufficiently smaller than\n$\\rho/\\ln\\rho$, and graphs are DP-colorable with high probability when $k$ is\nsufficiently larger than $\\rho/\\ln\\rho$. Our results depend on $\\rho$ growing\nfast enough and imply a sharp threshold for dense enough graphs. For sparser\ngraphs, we analyze DP-colorability in terms of degeneracy. We also prove\nfractional DP-coloring analogs to these results.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:02:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bernshteyn","Anton",""],["Dominik","Daniel",""],["Kaul","Hemanshu",""],["Mudrock","Jeffrey A.",""]]}
{"id":"2308.13743","submitter":"Xinli Shi","authors":"Xinli Shi, Xinghuo Yu, Guanghui Wen, and Wei Ren","title":"Extended Zero-Gradient-Sum Approach for Constrained Distributed\n  Optimization with Free Initialization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper proposes an extended zero-gradient-sum (EZGS) approach for solving\nconstrained distributed optimization (DO) with free initialization. A\nNewton-based continuous-time algorithm (CTA) is first designed and then\nextended to solve constrained DO based on the EZGS method. It is shown that for\ntypical consensus protocols, the EZGS CTA can achieve\nexponential/finite/fixed/prescribed-time convergence. Particularly, the\nnonlinear consensus protocols for finite-time EZGS algorithms can have\nheterogeneous power coefficients and the input of the prescribed-time EZGS is\ncontinuous and uniformly bounded. Moreover, the barrier method is employed to\ntackle the inequality constraints. Finally, the performance of the proposed\nalgorithms is verified by numerical examples.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:08:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shi","Xinli",""],["Yu","Xinghuo",""],["Wen","Guanghui",""],["Ren","Wei",""]]}
{"id":"2308.13744","submitter":"Kazuhiko Seki","authors":"Kazuhiko Seki","title":"Fluctuation relation in continuous-time random walks driven by an\n  external field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study a fluctuation relation representing a nonequilibrium equality\nindicating that the ratio between the distribution of trajectories obtained by\nexchanging the initial and final positions is characterized by free energy\ndifferences for the duration of the trajectories.We use a continuous-time\nlattice random walk model under a general waiting-time distribution of\ntransitions to consider the fluctuation relation for noninteracting charge\ncarriers driven by an external electric field. The fluctuation relation is\nobtained irrespective of the lattice structure factor, the form of the\nwaiting-time distribution, and the presence of a reflecting boundary. In free\nspace without boundary conditions, exchanging the initial and final positions\nis equivalent to exchanging the field (or drift) directions. However, we show\nthat the exchanging field (or drift) directions are not relevant for studying\nthe fluctuation relation under the reflecting boundary condition. Because the\nfluctuation relation should hold for continuous-time random walk models, it can\nbe used to ensure internal consistency in theoretical modeling.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:08:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Seki","Kazuhiko",""]]}
{"id":"2308.13745","submitter":"Eric Gaidos","authors":"Eric Gaidos, Teruyuki Hirano","title":"CO, H$_2$O, and CH$_4$ in the Dusty Atmosphere of a $\\le$5 Myr-old\n  Exoplanet","comments":"accepted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Very young massive planets are sufficiently luminous by their internal heat\nof formation to permit detailed studies, including spectroscopy of their\natmospheres with large telescopes at sufficient resolution ($\\lambda / \\Delta\n\\lambda \\gtrsim 1000$) to identify major constituents to inform models of\nplanet formation and early evolution. We obtained 1-2.4$\\mu$m ($YJHK$) spectra\nof the planetary-mass \"b\" companion of 2MASS~J04372171+2651014, a 1-3 Myr-old M\ndwarf member of the Taurus star-forming region, and one of the youngest such\nobjects discovered to date. These indicate the presence of CO and possibly\nH$_2$O and CH$_4$ in the atmosphere, all suggesting a $T_{\\rm eff}$ of around\n1200K, characteristic of a L-T transition spectral type and consistent with\nprevious estimates based on its luminosity and age. The absence or attenuation\nof spectral features at shorter wavelengths suggests the presence of\nmicron-size dust, consistent with the object's red color. The spectrum of\n2M0437b resembles those of the HR 8799 planets, especially the innermost \"b\"\nplanet, with the exception of a pronounced flux deficit in the $H$-band of\nuncertain origin.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:11:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gaidos","Eric",""],["Hirano","Teruyuki",""]]}
{"id":"2308.13746","submitter":"Yuhao Huang","authors":"Ao Chang, Xing Tao, Xin Yang, Yuhao Huang, Xinrui Zhou, Jiajun Zeng,\n  Ruobing Huang, Dong Ni","title":"PE-MED: Prompt Enhancement for Interactive Medical Image Segmentation","comments":"Accepted by MICCAI MLMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interactive medical image segmentation refers to the accurate segmentation of\nthe target of interest through interaction (e.g., click) between the user and\nthe image. It has been widely studied in recent years as it is less dependent\non abundant annotated data and more flexible than fully automated segmentation.\nHowever, current studies have not fully explored user-provided prompt\ninformation (e.g., points), including the knowledge mined in one interaction,\nand the relationship between multiple interactions. Thus, in this paper, we\nintroduce a novel framework equipped with prompt enhancement, called PE-MED,\nfor interactive medical image segmentation. First, we introduce a Self-Loop\nstrategy to generate warm initial segmentation results based on the first\nprompt. It can prevent the highly unfavorable scenarios, such as encountering a\nblank mask as the initial input after the first interaction. Second, we propose\na novel Prompt Attention Learning Module (PALM) to mine useful prompt\ninformation in one interaction, enhancing the responsiveness of the network to\nuser clicks. Last, we build a Time Series Information Propagation (TSIP)\nmechanism to extract the temporal relationships between multiple interactions\nand increase the model stability. Comparative experiments with other\nstate-of-the-art (SOTA) medical image segmentation algorithms show that our\nmethod exhibits better segmentation accuracy and stability.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:11:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chang","Ao",""],["Tao","Xing",""],["Yang","Xin",""],["Huang","Yuhao",""],["Zhou","Xinrui",""],["Zeng","Jiajun",""],["Huang","Ruobing",""],["Ni","Dong",""]]}
{"id":"2308.13747","submitter":"Ikemefuna Agbanusi","authors":"Ikemefuna Agbanusi","title":"Extensions and Approximations","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We investigate the order of approximation when certain singular kernels when\nact on the zero-extension of functions. The results can be repurposed to give\nnon trivial estimates on the moduli of continuity of zero-extensions. Our\napproach avoids the use of Hardy type inequalities and so applies to any\nfunction in $L^p([0,1]^d)$ regardless of smoothness.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:13:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Agbanusi","Ikemefuna",""]]}
{"id":"2308.13748","submitter":"Hidefumi Kawasaki","authors":"Hidefumi Kawasaki (Kyushu University)","title":"This paper presents a new application of Borsuk-Ulam's theorem to\n  nonlinear programming","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Borsuk-Ulam's theorem is a useful tool of algebraic topology. It states that\nfor any continuous mapping $f$ from the $n$-sphere to the $n$-dimensional\nEuclidean space, there exists a pair of antipodal points such that\n$f(x)=f(-x)$. As for its applications, ham-sandwich theorem, necklace theorem\nand coloring of Kneser graph by Lov\\'{a}sz are well-known. This paper attempts\nto apply Borsuk-Ulam's theorem to nonlinear programming.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:18:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kawasaki","Hidefumi","","Kyushu University"]]}
{"id":"2308.13749","submitter":"Hongsong Wang","authors":"Hongsong Wang and Yuqi Zhang","title":"Learning Efficient Representations for Image-Based Patent Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Patent retrieval has been attracting tremendous interest from researchers in\nintellectual property and information retrieval communities in the past\ndecades. However, most existing approaches rely on textual and metadata\ninformation of the patent, and content-based image-based patent retrieval is\nrarely investigated. Based on traits of patent drawing images, we present a\nsimple and lightweight model for this task. Without bells and whistles, this\napproach significantly outperforms other counterparts on a large-scale\nbenchmark and noticeably improves the state-of-the-art by 33.5% with the mean\naverage precision (mAP) score. Further experiments reveal that this model can\nbe elaborately scaled up to achieve a surprisingly high mAP of 93.5%. Our\nmethod ranks first in the ECCV 2022 Patent Diagram Image Retrieval Challenge.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:19:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Hongsong",""],["Zhang","Yuqi",""]]}
{"id":"2308.13750","submitter":"Andr\\'es R. Vindas-Mel\\'endez","authors":"Ron Buckmire and Carrie Diaz Eaton and Joseph E. Hibdon, Jr. and\n  Jakini Kauba and Drew Lewis and Omayra Ortega and Jos\\'e L. Pab\\'on and\n  Rachel Roca and Andr\\'es R. Vindas-Mel\\'endez and Sam Zhang","title":"Quantifying Inequities and Documenting Elitism in PhD-granting\n  Mathematical Sciences Departments in the United States","comments":"15 pages, 4 figures, 3 tables, comments welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we provide an example of the application of quantitative\ntechniques, tools, and topics from mathematics and data science to analyze the\nmathematics community itself in order to quantify inequity and document\nelitism. This work is a contribution to the new and growing field recently\ntermed ``mathematics of Mathematics,'' or ``MetaMath.'' Our goal is to rebut,\nrebuke, and refute the idea that the mathematical sciences in the United States\nis a meritocracy by using data science and quantitative analysis. Using\nresearch and data about PhD-granting institutions in the United States, we\nquantify, document, and highlight inequities in departments at U.S.\ninstitutions of higher education that produce PhDs in the mathematical\nsciences. Specifically, we determine that a small fraction of mathematical\nsciences departments receive a large majority of federal funding awarded to\nsupport mathematics in the United States and that women are dramatically\nunderrepresented in these departments. Additionally, we quantify the extent to\nwhich women are underrepresented in almost all mathematical sciences\nPhD-granting institutions in the United States.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:24:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Buckmire","Ron",""],["Eaton","Carrie Diaz",""],["Hibdon,","Joseph E.","Jr."],["Kauba","Jakini",""],["Lewis","Drew",""],["Ortega","Omayra",""],["Pab\u00f3n","Jos\u00e9 L.",""],["Roca","Rachel",""],["Vindas-Mel\u00e9ndez","Andr\u00e9s R.",""],["Zhang","Sam",""]]}
{"id":"2308.13751","submitter":"Petr Navratil","authors":"P. Gysbers, P. Navratil, K. Kravvaris, G. Hupin, S. Quaglioni","title":"Ab initio investigation of the $^7$Li($p,e^+e^-$)$^8$Be process and the\n  X17 boson","comments":"31 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Observations of anomalies in the electron-positron angular correlations in\nhigh-energy decays in $^4$He, $^8$Be, and $^{12}$C have been reported recently\nby the ATOMKI collaboration. These could be explained by the creation and\nsubsequent decay of a new boson with a mass of ${\\sim}17$ MeV. Theoretical\nunderstanding of pair creation in the proton capture reactions used in these\nexperiments is important for the interpretation of the anomalies. We apply the\nab initio No-Core Shell Model with Continuum (NCSMC) to the proton capture on\n$^7$Li. The NCSMC describes both bound and unbound states in light nuclei in a\nunified way with chiral two- and three-nucleon interactions as the only input.\nWe investigate the structure of $^8$Be, the $p+^7$Li elastic scattering, the\n$^7$Li($p,\\gamma$)$^8$Be cross section and the internal pair creation\n$^7$Li($p,e^+ e^-$)$^8$Be. We discuss the impact of a proper treatment of the\ninitial scattering state on the electron-positron angular correlation spectrum\nand compare our results to available ATOMKI data sets. Finally, we calculate\n$^7$Li($p,X$)$^8$Be cross sections for several proposed models of the\nhypothetical X17 particle.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:30:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gysbers","P.",""],["Navratil","P.",""],["Kravvaris","K.",""],["Hupin","G.",""],["Quaglioni","S.",""]]}
{"id":"2308.13752","submitter":"Hadrian Quan","authors":"Hadrian Quan","title":"The wave kernel on asymptotically complex hyperbolic manifolds","comments":"21 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the behavior of the wave kernel of the Laplacian on asymptotically\ncomplex hyperbolic manifolds for finite times. We show that the wave kernel on\nsuch manifolds belongs to an appropriate class of Fourier integral operators\nand analyze its trace. This construction proves that the singularities of its\ntrace are contained in the set of lengths of closed geodesics and we obtain an\nasymptotic expansion for the trace at time zero.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:32:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Quan","Hadrian",""]]}
{"id":"2308.13753","submitter":"Jia Chen","authors":"Huichao Yan and Jia Chen","title":"Worst case tractability of $L_2$-approximation for weighted Korobov\n  spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study $L_2$-approximation problems in the worst case setting in the\nweighted Korobov spaces $H_{d,\\a,{\\bm \\ga}}$ with parameters $1\\ge \\ga_1\\ge\n\\ga_2\\ge \\cdots\\ge 0$ and $\\frac1 2<\\az_1\\le \\az_2\\le \\cdots$. We consider the\nworst case error of algorithms that use finitely many arbitrary continuous\nlinear functionals. We discuss the strongly polynomial tractability (SPT),\npolynomial tractability (PT), and $(t_1,t_2)$-weak tractability\n($(t_1,t_2)$-WT) for all $t_1>1$ and $t_2>0$ under the absolute or normalized\nerror criterion. In particular, we obtain the matching necessary and sufficient\ncondition for SPT or PT in terms of the parameters.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:33:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yan","Huichao",""],["Chen","Jia",""]]}
{"id":"2308.13754","submitter":"Jia Allen Li","authors":"Jia Li, Chongyang Tao, Zhi Jin, Fang Liu, Jia Allen Li, Ge Li","title":"ZC3: Zero-Shot Cross-Language Code Clone Detection","comments":"Accepted by the 38th IEEE/ACM International Conference on Automated\n  Software Engineering (ASE 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Developers introduce code clones to improve programming productivity. Many\nexisting studies have achieved impressive performance in monolingual code clone\ndetection. However, during software development, more and more developers write\nsemantically equivalent programs with different languages to support different\nplatforms and help developers translate projects from one language to another.\nConsidering that collecting cross-language parallel data, especially for\nlow-resource languages, is expensive and time-consuming, how designing an\neffective cross-language model that does not rely on any parallel data is a\nsignificant problem. In this paper, we propose a novel method named ZC3 for\nZero-shot Cross-language Code Clone detection. ZC3 designs the contrastive\nsnippet prediction to form an isomorphic representation space among different\nprogramming languages. Based on this, ZC3 exploits domain-aware learning and\ncycle consistency learning to further constrain the model to generate\nrepresentations that are aligned among different languages meanwhile are\ndiacritical for different types of clones. To evaluate our approach, we conduct\nextensive experiments on four representative cross-language clone detection\ndatasets. Experimental results show that ZC3 outperforms the state-of-the-art\nbaselines by 67.12%, 51.39%, 14.85%, and 53.01% on the MAP score, respectively.\nWe further investigate the representational distribution of different languages\nand discuss the effectiveness of our method.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:48:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jia",""],["Tao","Chongyang",""],["Jin","Zhi",""],["Liu","Fang",""],["Li","Jia Allen",""],["Li","Ge",""]]}
{"id":"2308.13755","submitter":"Bayu Trisedya","authors":"Bayu Distiawan Trisedya, Flora D Salim, Jeffrey Chan, Damiano Spina,\n  Falk Scholer, Mark Sanderson","title":"i-Align: an interpretable knowledge graph alignment model","comments":"Data Min Knowl Disc (2023)","journal-ref":null,"doi":"10.1007/s10618-023-00963-3","report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Knowledge graphs (KGs) are becoming essential resources for many downstream\napplications. However, their incompleteness may limit their potential. Thus,\ncontinuous curation is needed to mitigate this problem. One of the strategies\nto address this problem is KG alignment, i.e., forming a more complete KG by\nmerging two or more KGs. This paper proposes i-Align, an interpretable KG\nalignment model. Unlike the existing KG alignment models, i-Align provides an\nexplanation for each alignment prediction while maintaining high alignment\nperformance. Experts can use the explanation to check the correctness of the\nalignment prediction. Thus, the high quality of a KG can be maintained during\nthe curation process (e.g., the merging process of two KGs). To this end, a\nnovel Transformer-based Graph Encoder (Trans-GE) is proposed as a key component\nof i-Align for aggregating information from entities' neighbors (structures).\nTrans-GE uses Edge-gated Attention that combines the adjacency matrix and the\nself-attention matrix to learn a gating mechanism to control the information\naggregation from the neighboring entities. It also uses historical embeddings,\nallowing Trans-GE to be trained over mini-batches, or smaller sub-graphs, to\naddress the scalability issue when encoding a large KG. Another component of\ni-Align is a Transformer encoder for aggregating entities' attributes. This\nway, i-Align can generate explanations in the form of a set of the most\ninfluential attributes/neighbors based on attention weights. Extensive\nexperiments are conducted to show the power of i-Align. The experiments include\nseveral aspects, such as the model's effectiveness for aligning KGs, the\nquality of the generated explanations, and its practicality for aligning large\nKGs. The results show the effectiveness of i-Align in these aspects.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:48:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Trisedya","Bayu Distiawan",""],["Salim","Flora D",""],["Chan","Jeffrey",""],["Spina","Damiano",""],["Scholer","Falk",""],["Sanderson","Mark",""]]}
{"id":"2308.13756","submitter":"Eric Larson","authors":"Eric Larson","title":"On The Cohomology of $N_C(-2)$ in Positive Characteristic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $C \\subset \\mathbb{P}^3$ be a general Brill--Noether curve. A classical\nproblem is to determine when $H^0(N_C(-2)) = 0$, which controls the quadric\nsection of $C$.\n  So far this problem has only been solved in characteristic zero, in which\ncase $H^0(N_C(-2)) = 0$ with finitely many exceptions. In this note, we extend\nthese results to positive characteristic, uncovering a wealth of new exceptions\nin characteristic 2.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:52:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Larson","Eric",""]]}
{"id":"2308.13757","submitter":"Molla Ahamed","authors":"Sabir Ahammed and Molla Basir Ahamed","title":"Operator-valued analogues of multidimensional Bohr-Rogosinski\n  inequalities","comments":"19. arXiv admin note: text overlap with arXiv:2111.11713 by other\n  authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we first establish operator-valued analogues of\nmultidimensional refined Bohr inequality. Then we establish operator-valued\nanalogues of multidimensional improved Bohr inequality with a certain power of\nthe norm of the initial coefficient. Finally, we establish operator-valued\nanalogues of a multidimensional sharp version of Bohr inequality with the\ninitial coefficient being replaced by the norm value of the function. In\naddition, we establish operator-valued analogues of multidimensional improved\nBohr inequality using the quantity $S_r/\\pi$. All the results prove to be\nsharp.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:53:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ahammed","Sabir",""],["Ahamed","Molla Basir",""]]}
{"id":"2308.13758","submitter":"Mostafa Mobasher","authors":"Roshan Philip Saji, Panos Pantidis, Mostafa E. Mobasher","title":"A new displacement-controlled arc-length method for damage mechanics\n  problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The numerical solution of continuum damage mechanics (CDM) problems suffers\nfrom critical points during the material softening stage, and consequently\nexisting iterative solvers are subject to a trade-off between computational\nexpense and solution accuracy. Displacement-controlled arc-length methods were\ndeveloped to address these challenges, but are currently applicable only to\ngeometrically non-linear problems. In this work, we present a novel\ndisplacement-controlled arc-length (DAL) method for CDM problems in both local\ndamage and non-local gradient damage versions. The analytical tangent matrix is\nderived for the DAL solver in both of the local and the non-local models. In\naddition, several consistent and non-consistent implementation algorithms are\nproposed, implemented, and evaluated. Unlike existing force-controlled\narc-length solvers that monolithically scale the external force vector, the\nproposed method treats the external force vector as an independent variable and\ndetermines the position of the system on the equilibrium path based on all the\nnodal variations of the external force vector. Such a flexible approach renders\nthe proposed solver to be substantially more efficient and versatile than\nexisting solvers used in CDM problems. The considerable advantages of the\nproposed DAL algorithm are demonstrated against several benchmark 1D problems\nwith sharp snap-backs and 2D examples with various boundary conditions and\nloading scenarios, where the proposed method drastically outperforms existing\nconventional approaches in terms of accuracy, computational efficiency, and the\nability to predict the complete equilibrium path including all critical points.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 03:57:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Saji","Roshan Philip",""],["Pantidis","Panos",""],["Mobasher","Mostafa E.",""]]}
{"id":"2308.13759","submitter":"Yizhe Zhang","authors":"Yizhe Zhang, Tao Zhou, Shuo Wang, Ye Wu, Pengfei Gu, Danny Z. Chen","title":"SamDSK: Combining Segment Anything Model with Domain-Specific Knowledge\n  for Semi-Supervised Learning in Medical Image Segmentation","comments":"15 pages, 7 figures, Github: https://github.com/yizhezhang2000/SamDSK","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Segment Anything Model (SAM) exhibits a capability to segment a wide\narray of objects in natural images, serving as a versatile perceptual tool for\nvarious downstream image segmentation tasks. In contrast, medical image\nsegmentation tasks often rely on domain-specific knowledge (DSK). In this\npaper, we propose a novel method that combines the segmentation foundation\nmodel (i.e., SAM) with domain-specific knowledge for reliable utilization of\nunlabeled images in building a medical image segmentation model. Our new method\nis iterative and consists of two main stages: (1) segmentation model training;\n(2) expanding the labeled set by using the trained segmentation model, an\nunlabeled set, SAM, and domain-specific knowledge. These two stages are\nrepeated until no more samples are added to the labeled set. A novel\noptimal-matching-based method is developed for combining the SAM-generated\nsegmentation proposals and pixel-level and image-level DSK for constructing\nannotations of unlabeled images in the iterative stage (2). In experiments, we\ndemonstrate the effectiveness of our proposed method for breast cancer\nsegmentation in ultrasound images, polyp segmentation in endoscopic images, and\nskin lesion segmentation in dermoscopic images. Our work initiates a new\ndirection of semi-supervised learning for medical image segmentation: the\nsegmentation foundation model can be harnessed as a valuable tool for\nlabel-efficient segmentation learning in medical image segmentation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 04:46:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Yizhe",""],["Zhou","Tao",""],["Wang","Shuo",""],["Wu","Ye",""],["Gu","Pengfei",""],["Chen","Danny Z.",""]]}
{"id":"2308.13760","submitter":"Hui Wan","authors":"Hui Wan, Hongkang Li, Songtao Lu, Xiaodong Cui, Marina Danilevsky","title":"How Can Context Help? Exploring Joint Retrieval of Passage and\n  Personalized Context","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL cs.IR","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The integration of external personalized context information into\ndocument-grounded conversational systems has significant potential business\nvalue, but has not been well-studied. Motivated by the concept of personalized\ncontext-aware document-grounded conversational systems, we introduce the task\nof context-aware passage retrieval. We also construct a dataset specifically\ncurated for this purpose. We describe multiple baseline systems to address this\ntask, and propose a novel approach, Personalized Context-Aware Search (PCAS),\nthat effectively harnesses contextual information during passage retrieval.\nExperimental evaluations conducted on multiple popular dense retrieval systems\ndemonstrate that our proposed approach not only outperforms the baselines in\nretrieving the most relevant passage but also excels at identifying the\npertinent context among all the available contexts. We envision that our\ncontributions will serve as a catalyst for inspiring future research endeavors\nin this promising direction.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 04:49:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wan","Hui",""],["Li","Hongkang",""],["Lu","Songtao",""],["Cui","Xiaodong",""],["Danilevsky","Marina",""]]}
{"id":"2308.13761","submitter":"Axel B\\\"ucher","authors":"Axel B\\\"ucher and Torben Staud","title":"Limit theorems for non-degenerate U-statistics of block maxima for time\n  series","comments":"Main paper: 35 pages, 3 Figures. Supplement: 8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The block maxima method is a classical and widely applied statistical method\nfor time series extremes. It has recently been found that respective estimators\nwhose asymptotics are driven by empirical means can be improved by using\nsliding rather than disjoint block maxima. Similar results are derived for\ngeneral non-degenerate U-statistics of arbitrary order, in the multivariate\ntime series case. Details are worked out for selected examples: the empirical\nvariance, the probability weighted moment estimator and Kendall's tau\nstatistic. The results are also extended to the case where the underlying\nsample is piecewise stationary. The finite-sample properties are illustrated by\na Monte Carlo simulation study.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 04:51:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["B\u00fccher","Axel",""],["Staud","Torben",""]]}
{"id":"2308.13762","submitter":"Shiva Kant Tiwari","authors":"Felix Engel, Shiva Kant Tiwari, Tilman Pfau, Sebastian W\\\"uster,\n  Florian Meinert","title":"In situ observation of chemistry in Rydberg molecules within a coherent\n  solvent","comments":"11 pages and 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We often infer the state of systems in nature indirectly, for example in high\nenergy physics by recording the tracks particles leave behind in an ambient\nmedium. We adapt this principle to energies $9$ orders of magnitude smaller, to\nclassify the final state of exotic molecules after internal conversion of their\nelectronic state, through their interaction with an ambient quantum fluid,\na~Bose-Einstein condensate. The BEC is the ground-state of a million bosonic\natoms near zero temperature, and a single embedded ultra-long range Rydberg\nmolecule can coherently excite waves in this fluid, which carry tell-tale\nsignatures of its dynamics. Bond lengths exceeding a micrometer allow us to\nobserve the molecular fingerprint on the BEC in situ, via optical microscopy.\nInterpreting images in comparison with simulations shows that the molecular\nelectronic state rapidly converts from the initially excited S- and D-orbitals\nto a much more complex molecular state (called ``trilobite''), marked by a\nmaximally localized electron. This internal conversion liberates energy, such\nthat one expects final state particles to move rapidly through the medium,\nwhich is however ruled out by comparing experiment and simulations. The\nmolecule thus must strongly decelerate in the medium, for which we propose a\nplausible mechanism. Our experiment demonstrates a coherent medium that\nfacilitates and records an electronic state change of embedded exotic molecules\nin ultra-cold chemistry, with sufficient sensitivity to constrain velocities of\nfinal state particles.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 04:54:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Engel","Felix",""],["Tiwari","Shiva Kant",""],["Pfau","Tilman",""],["W\u00fcster","Sebastian",""],["Meinert","Florian",""]]}
{"id":"2308.13763","submitter":"Michel Rached Zamboni","authors":"M. Zamboni-Rached, K. Z. N\\'obrega and Mo Mojahedi","title":"Creating Light-Made Waveguides with Structured Optical Beams in\n  Nonlinear Kerr Media","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While in linear optics the subject of structured light has been a fruitful\nfield of both theoretical and applied research, its development in the arena of\nnonlinear optics has been underexplored. In this paper, we construct\nFrozen-Wave-type structured optical beams in Kerr nonlinear media, emphasizing\nthe self-defocusing case, and use them to guide and control Gaussian optical\nbeams. The results presented in this study support the expectation that\nstructured light in nonlinear media can open new venues of theoretical research\nand applications, particularly in the realms of light controlling light and for\nall-optical photonics.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 04:59:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zamboni-Rached","M.",""],["N\u00f3brega","K. Z.",""],["Mojahedi","Mo",""]]}
{"id":"2308.13764","submitter":"Jianqiang Xia","authors":"Jianqiang Xia, DianXi Shi, Ke Song, Linna Song, XiaoLei Wang,\n  Songchang Jin, Li Zhou, Yu Cheng, Lei Jin, Zheng Zhu, Jianan Li, Gang Wang,\n  Junliang Xing, Jian Zhao","title":"Unified Single-Stage Transformer Network for Efficient RGB-T Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most existing RGB-T tracking networks extract modality features in a separate\nmanner, which lacks interaction and mutual guidance between modalities. This\nlimits the network's ability to adapt to the diverse dual-modality appearances\nof targets and the dynamic relationships between the modalities. Additionally,\nthe three-stage fusion tracking paradigm followed by these networks\nsignificantly restricts the tracking speed. To overcome these problems, we\npropose a unified single-stage Transformer RGB-T tracking network, namely\nUSTrack, which unifies the above three stages into a single ViT (Vision\nTransformer) backbone with a dual embedding layer through self-attention\nmechanism. With this structure, the network can extract fusion features of the\ntemplate and search region under the mutual interaction of modalities.\nSimultaneously, relation modeling is performed between these features,\nefficiently obtaining the search region fusion features with better\ntarget-background discriminability for prediction. Furthermore, we introduce a\nnovel feature selection mechanism based on modality reliability to mitigate the\ninfluence of invalid modalities for prediction, further improving the tracking\nperformance. Extensive experiments on three popular RGB-T tracking benchmarks\ndemonstrate that our method achieves new state-of-the-art performance while\nmaintaining the fastest inference speed 84.2FPS. In particular, MPR/MSR on the\nshort-term and long-term subsets of VTUAV dataset increased by\n11.1$\\%$/11.7$\\%$ and 11.3$\\%$/9.7$\\%$.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:09:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xia","Jianqiang",""],["Shi","DianXi",""],["Song","Ke",""],["Song","Linna",""],["Wang","XiaoLei",""],["Jin","Songchang",""],["Zhou","Li",""],["Cheng","Yu",""],["Jin","Lei",""],["Zhu","Zheng",""],["Li","Jianan",""],["Wang","Gang",""],["Xing","Junliang",""],["Zhao","Jian",""]]}
{"id":"2308.13765","submitter":"Patryk Sofia Lykawka","authors":"Patryk Sofia Lykawka, Takashi Ito","title":"Is There an Earth-like Planet in the Distant Kuiper Belt?","comments":"This is the Accepted Manuscript version of an article accepted for\n  publication in The Astronomical Journal. IOP Publishing Ltd is not\n  responsible for any errors or omissions in this version of the manuscript or\n  any version derived from it. This Accepted Manuscript is published under a CC\n  BY licence. The Version of Record is available online at\n  https://doi.org/10.3847/1538-3881/aceaf0","journal-ref":"AJ 166 118 (2023)","doi":"10.3847/1538-3881/aceaf0","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The orbits of trans-Neptunian objects (TNOs) can indicate the existence of an\nundiscovered planet in the outer solar system. Here, we used N-body computer\nsimulations to investigate the effects of a hypothetical Kuiper Belt planet\n(KBP) on the orbital structure of TNOs in the distant Kuiper Belt beyond ~50\nau. We used observations to constrain model results, including the\nwell-characterized Outer Solar System Origins Survey (OSSOS). We determined\nthat an Earth-like planet (m ~ 1.5-3 Earth masses) located on a distant\n(semimajor axis a ~ 250-500 au, perihelion q ~ 200 au) and inclined (i ~ 30\ndeg) orbit can explain three fundamental properties of the distant Kuiper Belt:\na prominent population of TNOs with orbits beyond Neptune's gravitational\ninfluence (i.e., detached objects with q > 40 au), a significant population of\nhigh-i objects (i > 45 deg), and the existence of some extreme objects with\npeculiar orbits (e.g., Sedna). Furthermore, the proposed KBP is compatible with\nthe existence of identified Gyr-stable TNOs in the 2:1, 5:2, 3:1, 4:1, 5:1, and\n6:1 Neptunian mean motion resonances. These stable populations are often\nneglected in other studies. We predict the existence of an Earth-like planet\nand several TNOs on peculiar orbits in the outer solar system, which can serve\nas observationally testable signatures of the putative planet's perturbations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:14:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lykawka","Patryk Sofia",""],["Ito","Takashi",""]]}
{"id":"2308.13766","submitter":"Matt Visser","authors":"Joshua Baines (Victoria University of Wellington) and Matt Visser\n  (Victoria University of Wellington)","title":"Photon escape cones, physical and optical metrics, asymptotic and\n  near-horizon physics","comments":"32 pages; 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the explicit analytic behaviour of photon escape cones in generic\nstatic spherically symmetric spacetimes, emphasizing the interplay between the\nphysical spacetime metric and the optical metric, and the interplay between\nlarge-distance asymptotic and near-horizon physics. The circular photon orbits\n(photon spheres) are shown to be given by wormhole throats in the optical\nmetric, (not the physical metric), and the escape cone solid angle is easily\ncalculable in terms of the capture cross section, sigma_{capture}, the area of\nthe spherical 2-surfaces, and the norm of the timelike Killing vector. Under\nappropriate circumstances, for near-horizon photon emission the escape cone\nsolid angle can be related to the surface gravity kappa_H. We provide a number\nof illustrative examples, involving both black holes and wormholes, including\nsituations with multiple photon spheres.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:16:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baines","Joshua","","Victoria University of Wellington"],["Visser","Matt","","Victoria University of Wellington"]]}
{"id":"2308.13767","submitter":"Bin Xia","authors":"Bin Xia, Yulun Zhang, Shiyin Wang, Yitong Wang, Xinglong Wu, Yapeng\n  Tian, Wenming Yang, Radu Timotfe, Luc Van Gool","title":"DiffI2I: Efficient Diffusion Model for Image-to-Image Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Diffusion Model (DM) has emerged as the SOTA approach for image\nsynthesis. However, the existing DM cannot perform well on some image-to-image\ntranslation (I2I) tasks. Different from image synthesis, some I2I tasks, such\nas super-resolution, require generating results in accordance with GT images.\nTraditional DMs for image synthesis require extensive iterations and large\ndenoising models to estimate entire images, which gives their strong generative\nability but also leads to artifacts and inefficiency for I2I. To tackle this\nchallenge, we propose a simple, efficient, and powerful DM framework for I2I,\ncalled DiffI2I. Specifically, DiffI2I comprises three key components: a compact\nI2I prior extraction network (CPEN), a dynamic I2I transformer (DI2Iformer),\nand a denoising network. We train DiffI2I in two stages: pretraining and DM\ntraining. For pretraining, GT and input images are fed into CPEN$_{S1}$ to\ncapture a compact I2I prior representation (IPR) guiding DI2Iformer. In the\nsecond stage, the DM is trained to only use the input images to estimate the\nsame IRP as CPEN$_{S1}$. Compared to traditional DMs, the compact IPR enables\nDiffI2I to obtain more accurate outcomes and employ a lighter denoising network\nand fewer iterations. Through extensive experiments on various I2I tasks, we\ndemonstrate that DiffI2I achieves SOTA performance while significantly reducing\ncomputational burdens.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:18:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xia","Bin",""],["Zhang","Yulun",""],["Wang","Shiyin",""],["Wang","Yitong",""],["Wu","Xinglong",""],["Tian","Yapeng",""],["Yang","Wenming",""],["Timotfe","Radu",""],["Van Gool","Luc",""]]}
{"id":"2308.13768","submitter":"Charles O'Neill","authors":"Charles O'Neill, Jack Miller, Ioana Ciuca, Yuan-Sen Ting, Thang Bui","title":"Adversarial Fine-Tuning of Language Models: An Iterative Optimisation\n  Approach for the Generation and Detection of Problematic Content","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we tackle the emerging challenge of unintended harmful content\ngeneration in Large Language Models (LLMs) with a novel dual-stage optimisation\ntechnique using adversarial fine-tuning. Our two-pronged approach employs an\nadversarial model, fine-tuned to generate potentially harmful prompts, and a\njudge model, iteratively optimised to discern these prompts. In this\nadversarial cycle, the two models seek to outperform each other in the\nprompting phase, generating a dataset of rich examples which are then used for\nfine-tuning. This iterative application of prompting and fine-tuning allows\ncontinuous refinement and improved performance. The performance of our approach\nis evaluated through classification accuracy on a dataset consisting of\nproblematic prompts not detected by GPT-4, as well as a selection of\ncontentious but unproblematic prompts. We show considerable increase in\nclassification accuracy of the judge model on this challenging dataset as it\nundergoes the optimisation process. Furthermore, we show that a rudimentary\nmodel \\texttt{ada} can achieve 13\\% higher accuracy on the hold-out test set\nthan GPT-4 after only a few rounds of this process, and that this fine-tuning\nimproves performance in parallel tasks such as toxic comment identification.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:20:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["O'Neill","Charles",""],["Miller","Jack",""],["Ciuca","Ioana",""],["Ting","Yuan-Sen",""],["Bui","Thang",""]]}
{"id":"2308.13769","submitter":"Md Ataullha Saim","authors":"Md Ataullha and Mahedi Hassan Rabby and Mushfiqur Rahman and Tahsina\n  Bintay Azam","title":"Bengali Document Layout Analysis with Detectron2","comments":"DL Sprint 2.0 - BUET CSE Fest 2023, 4 pages, 2 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Document digitization is vital for preserving historical records, efficient\ndocument management, and advancing OCR (Optical Character Recognition)\nresearch. Document Layout Analysis (DLA) involves segmenting documents into\nmeaningful units like text boxes, paragraphs, images, and tables. Challenges\narise when dealing with diverse layouts, historical documents, and unique\nscripts like Bengali, hindered by the lack of comprehensive Bengali DLA\ndatasets. We improved the accuracy of the DLA model for Bengali documents by\nutilizing advanced Mask R-CNN models available in the Detectron2 library. Our\nevaluation involved three variants: Mask R-CNN R-50, R-101, and X-101, both\nwith and without pretrained weights from PubLayNet, on the BaDLAD dataset,\nwhich contains human-annotated Bengali documents in four categories: text\nboxes, paragraphs, images, and tables. Results show the effectiveness of these\nmodels in accurately segmenting Bengali documents. We discuss speed-accuracy\ntradeoffs and underscore the significance of pretrained weights. Our findings\nexpand the applicability of Mask R-CNN in document layout analysis, efficient\ndocument management, and OCR research while suggesting future avenues for\nfine-tuning and data augmentation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:29:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ataullha","Md",""],["Rabby","Mahedi Hassan",""],["Rahman","Mushfiqur",""],["Azam","Tahsina Bintay",""]]}
{"id":"2308.13770","submitter":"Hayata Morisaki","authors":"Hayata Morisaki, Kosuke Mitarai, Keisuke Fujii, Yuya O. Nakagawa","title":"Classical variational optimization of PREPARE circuit for quantum phase\n  estimation of quantum chemistry Hamiltonians","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a method for constructing $\\texttt{PREPARE}$ circuits for quantum\nphase estimation of a molecular Hamiltonian in quantum chemistry by using\nvariational optimization of quantum circuits solely on classical computers. The\n$\\texttt{PREPARE}$ circuit generates a quantum state which encodes the\ncoefficients of the terms in the Hamiltonian as probability amplitudes and\nplays a crucial role in the state-of-the-art efficient implementations of\nquantum phase estimation. We employ the automatic quantum circuit encoding\nalgorithm [Shirakawa $\\textit{et al.}$, arXiv:2112.14524] to construct\n$\\texttt{PREPARE}$ circuits, which requires classical simulations of quantum\ncircuits of $O(\\log N)$ qubits with $N$ being the number of qubits of the\nHamiltonian. The generated $\\texttt{PREPARE}$ circuits do not need any\nancillary qubit. We demonstrate our method by investigating the number of\n$T$-gates of the obtained $\\texttt{PREPARE}$ circuits for quantum chemistry\nHamiltonians of various molecules, which shows a constant-factor reduction\ncompared to previous approaches that do not use ancillary qubits. Since the\nnumber of available logical qubits and $T$ gates will be limited at the early\nstage of the fault-tolerant quantum computing, the proposed method is\nparticularly of use for performing the quantum phase estimation with such\nlimited capability.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:32:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Morisaki","Hayata",""],["Mitarai","Kosuke",""],["Fujii","Keisuke",""],["Nakagawa","Yuya O.",""]]}
{"id":"2308.13771","submitter":"Chaitanya J. Kulkarni","authors":"Angshuman Bhattacharya and Chaitanya J. Kulkarni","title":"Ergodic Decomposition in the Space of Unital Completely Positive Maps","comments":"26 pages, preliminary version","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The decomposition theory for states of a C*-algebra, which are invariant\nunder a group action, has been studied by using the theory of orthogonal\nmeasures on the state space. In this note, we take this approach to the space\nof unital completely positive maps from a C*-algebra $A$ into $B(H)$. We\nexamine a decomposition of unital completely positive maps that remain\ninvariant under a group action. We establish the theory in Stinespring and\nPaschke's dilation of completely positive maps. We end this note by mentioning\nsome examples of such decompositions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:36:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhattacharya","Angshuman",""],["Kulkarni","Chaitanya J.",""]]}
{"id":"2308.13772","submitter":"Shengji Tang","authors":"Shengji Tang, Peng Ye, Baopu Li, Weihao Lin, Tao Chen, Tong He, Chong\n  Yu, Wanli Ouyang","title":"Boosting Residual Networks with Group Knowledge","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent research understands the residual networks from a new perspective of\nthe implicit ensemble model. From this view, previous methods such as\nstochastic depth and stimulative training have further improved the performance\nof the residual network by sampling and training of its subnets. However, they\nboth use the same supervision for all subnets of different capacities and\nneglect the valuable knowledge generated by subnets during training. In this\nmanuscript, we mitigate the significant knowledge distillation gap caused by\nusing the same kind of supervision and advocate leveraging the subnets to\nprovide diverse knowledge. Based on this motivation, we propose a group\nknowledge based training framework for boosting the performance of residual\nnetworks. Specifically, we implicitly divide all subnets into hierarchical\ngroups by subnet-in-subnet sampling, aggregate the knowledge of different\nsubnets in each group during training, and exploit upper-level group knowledge\nto supervise lower-level subnet groups. Meanwhile, We also develop a subnet\nsampling strategy that naturally samples larger subnets, which are found to be\nmore helpful than smaller subnets in boosting performance for hierarchical\ngroups. Compared with typical subnet training and other methods, our method\nachieves the best efficiency and performance trade-offs on multiple datasets\nand network structures. The code will be released soon.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:39:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tang","Shengji",""],["Ye","Peng",""],["Li","Baopu",""],["Lin","Weihao",""],["Chen","Tao",""],["He","Tong",""],["Yu","Chong",""],["Ouyang","Wanli",""]]}
{"id":"2308.13773","submitter":"S P Suresh","authors":"R Ramanujam, Vaishnavi Sundararajan, S P Suresh","title":"Solving the insecurity problem for assertions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the symbolic verification of cryptographic protocols, a central problem is\ndeciding whether a protocol admits an execution which leaks a designated secret\nto the malicious intruder. Rusinowitch & Turuani (2003) show that, when\nconsidering finitely many sessions, this ``insecurity problem'' is NP-complete.\nCentral to their proof strategy is the observation that any execution of a\nprotocol can be simulated by one where the intruder only communicates terms of\nbounded size. However, when we consider models where, in addition to terms, one\ncan also communicate logical statements about terms, the analysis of the\ninsecurity problem becomes tricky when both these inference systems are\nconsidered together. In this paper we consider the insecurity problem for\nprotocols with logical statements that include {\\em equality on terms} and {\\em\nexistential quantification}. Witnesses for existential quantifiers may be\nunbounded, and obtaining small witness terms while maintaining equality proofs\ncomplicates the analysis considerably. We extend techniques from Rusinowitch &\nTuruani (2003) to show that this problem is also in NP.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:42:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ramanujam","R",""],["Sundararajan","Vaishnavi",""],["Suresh","S P",""]]}
{"id":"2308.13774","submitter":"Jian Zhu","authors":"Jian Zhu, Wen Cheng, Yu Cui, Chang Tang, Yuyang Dai, Yong Li, Lingfang\n  Zeng","title":"Central Similarity Multi-View Hashing for Multimedia Retrieval","comments":"accepted by the Asia Pacific Web (APWeb) and Web-Age Information\n  Management (WAIM) Joint International Conference on Web and Big Data\n  (APWeb-WAIM2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hash representation learning of multi-view heterogeneous data is the key to\nimproving the accuracy of multimedia retrieval. However, existing methods\nutilize local similarity and fall short of deeply fusing the multi-view\nfeatures, resulting in poor retrieval accuracy. Current methods only use local\nsimilarity to train their model. These methods ignore global similarity.\nFurthermore, most recent works fuse the multi-view features via a weighted sum\nor concatenation. We contend that these fusion methods are insufficient for\ncapturing the interaction between various views. We present a novel Central\nSimilarity Multi-View Hashing (CSMVH) method to address the mentioned problems.\nCentral similarity learning is used for solving the local similarity problem,\nwhich can utilize the global similarity between the hash center and samples. We\npresent copious empirical data demonstrating the superiority of gate-based\nfusion over conventional approaches. On the MS COCO and NUS-WIDE, the proposed\nCSMVH performs better than the state-of-the-art methods by a large margin (up\nto 11.41% mean Average Precision (mAP) improvement).\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:43:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Jian",""],["Cheng","Wen",""],["Cui","Yu",""],["Tang","Chang",""],["Dai","Yuyang",""],["Li","Yong",""],["Zeng","Lingfang",""]]}
{"id":"2308.13775","submitter":"Jia Allen Li","authors":"Jia Allen Li, Yongmin Li, Ge Li, Xing Hu, Xin Xia, Zhi Jin","title":"EditSum: A Retrieve-and-Edit Framework for Source Code Summarization","comments":"Accepted by the 36th IEEE/ACM International Conference on Automated\n  Software Engineering (ASE 2021)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing studies show that code summaries help developers understand and\nmaintain source code. Unfortunately, these summaries are often missing or\noutdated in software projects. Code summarization aims to generate natural\nlanguage descriptions automatically for source code. Code summaries are highly\nstructured and have repetitive patterns. Besides the patternized words, a code\nsummary also contains important keywords, which are the key to reflecting the\nfunctionality of the code. However, the state-of-the-art approaches perform\npoorly on predicting the keywords, which leads to the generated summaries\nsuffering a loss in informativeness. To alleviate this problem, this paper\nproposes a novel retrieve-and-edit approach named EditSum for code\nsummarization. Specifically, EditSum first retrieves a similar code snippet\nfrom a pre-defined corpus and treats its summary as a prototype summary to\nlearn the pattern. Then, EditSum edits the prototype automatically to combine\nthe pattern in the prototype with the semantic information of input code. Our\nmotivation is that the retrieved prototype provides a good start-point for\npost-generation because the summaries of similar code snippets often have the\nsame pattern. The post-editing process further reuses the patternized words in\nthe prototype and generates keywords based on the semantic information of input\ncode. We conduct experiments on a large-scale Java corpus and experimental\nresults demonstrate that EditSum outperforms the state-of-the-art approaches by\na substantial margin. The human evaluation also proves the summaries generated\nby EditSum are more informative and useful. We also verify that EditSum\nperforms well on predicting the patternized words and keywords.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:48:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jia Allen",""],["Li","Yongmin",""],["Li","Ge",""],["Hu","Xing",""],["Xia","Xin",""],["Jin","Zhi",""]]}
{"id":"2308.13776","submitter":"Ruyu Liu","authors":"Taiwei Zhang, Shaohua Pan, Ruyu Liu","title":"A VMiPG method for composite optimization with nonsmooth term having no\n  closed-form proximal mapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper concerns the composite optimization of minimizing the sum of a\ntwice continuously differentiable function $f$ and a nonsmooth convex function\n$g$ without closed-form proximal mapping. For this class of nonconvex and\nnonsmooth problems, with uniformly bounded positive definite variable metric\nlinear operators, we propose a line-search based variable metric inexact\nproximal gradient (VMiPG) method. This method computes in each step an inexact\nminimizer of a strongly convex model such that the difference between its\nobjective value and the optimal value is controlled by its squared distance\nfrom the current iterate, and then seeks an appropriate step-size along the\nobtained direction with an armijo line-search criterion. We justify that the\niterate sequence converges to a stationary point when $f$ and $g$ are the KL\nfunctions, and that the convergence has a local R-linear rate if the objective\nfunction has the KL property and its subdifferential mapping is metrically\nsubregular at the stationary point. The proposed VMiPG method with the variable\nmetric linear operator from the Hessian of $f$ is applied to the scenario that\n$f$ and $g$ have common composite structure, and numerical comparison with a\nstate-of-art variable metric line-search algorithm indicates that the\nHessian-based VMiPG method has a remarkable advantage in terms of the quality\nof objective values and the running time for those difficult problems such as\nhigh-dimensional fused weighted-lasso regressions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 05:53:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Taiwei",""],["Pan","Shaohua",""],["Liu","Ruyu",""]]}
{"id":"2308.13777","submitter":"Chen Bin","authors":"Bin Chen, Xuanyu Zhang, Shuai Liu, Yongbing Zhang, Jian Zhang","title":"Self-Supervised Scalable Deep Compressed Sensing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compressed sensing (CS) is a promising tool for reducing sampling costs.\nCurrent deep neural network (NN)-based CS methods face challenges in collecting\nlabeled measurement-ground truth (GT) data and generalizing to real\napplications. This paper proposes a novel $\\mathbf{S}$elf-supervised\ns$\\mathbf{C}$alable deep CS method, comprising a $\\mathbf{L}$earning scheme\ncalled $\\mathbf{SCL}$ and a family of $\\mathbf{Net}$works named\n$\\mathbf{SCNet}$, which does not require GT and can handle arbitrary sampling\nratios and matrices once trained on a partial measurement set. Our SCL contains\na dual-domain loss and a four-stage recovery strategy. The former encourages a\ncross-consistency on two measurement parts and a sampling-reconstruction\ncycle-consistency regarding arbitrary ratios and matrices to maximize\ndata/information utilization. The latter can progressively leverage common\nsignal prior in external measurements and internal characteristics of test\nsamples and learned NNs to improve accuracy. SCNet combines the explicit\nguidance from optimization algorithms with implicit regularization from\nadvanced NN blocks to learn a collaborative signal representation. Our\ntheoretical analyses and experiments on simulated and real captured data,\ncovering 1-/2-/3-D natural and scientific signals, demonstrate the\neffectiveness, superior performance, flexibility, and generalization ability of\nour method over existing self-supervised methods and its significant potential\nin competing against state-of-the-art supervised methods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:03:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Bin",""],["Zhang","Xuanyu",""],["Liu","Shuai",""],["Zhang","Yongbing",""],["Zhang","Jian",""]]}
{"id":"2308.13778","submitter":"Alexander Gepperth","authors":"Alexander Gepperth","title":"Large-scale gradient-based training of Mixtures of Factor Analyzers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gaussian Mixture Models (GMMs) are a standard tool in data analysis. However,\nthey face problems when applied to high-dimensional data (e.g., images) due to\nthe size of the required full covariance matrices (CMs), whereas the use of\ndiagonal or spherical CMs often imposes restrictions that are too severe. The\nMixture of Factor analyzers (MFA) model is an important extension of GMMs,\nwhich allows to smoothly interpolate between diagonal and full CMs based on the\nnumber of \\textit{factor loadings} $l$. MFA has successfully been applied for\nmodeling high-dimensional image data. This article contributes both a\ntheoretical analysis as well as a new method for efficient high-dimensional MFA\ntraining by stochastic gradient descent, starting from random centroid\ninitializations. This greatly simplifies the training and initialization\nprocess, and avoids problems of batch-type algorithms such\nExpectation-Maximization (EM) when training with huge amounts of data. In\naddition, by exploiting the properties of the matrix determinant lemma, we\nprove that MFA training and inference/sampling can be performed based on\nprecision matrices, which does not require matrix inversions after training is\ncompleted. At training time, the methods requires the inversion of $l\\times l$\nmatrices only. Besides the theoretical analysis and proofs, we apply MFA to\ntypical image datasets such as SVHN and MNIST, and demonstrate the ability to\nperform sample generation and outlier detection.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:12:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gepperth","Alexander",""]]}
{"id":"2308.13779","submitter":"Hiroaki Yamagiwa","authors":"Hiroaki Yamagiwa, Yusuke Takase, Hiroyuki Kambe, Ryosuke Nakamoto","title":"Zero-Shot Edge Detection with SCESAME: Spectral Clustering-based\n  Ensemble for Segment Anything Model Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a novel zero-shot edge detection with SCESAME, which\nstands for Spectral Clustering-based Ensemble for Segment Anything Model\nEstimation, based on the recently proposed Segment Anything Model (SAM). SAM is\na foundation model for segmentation tasks, and one of the interesting\napplications of SAM is Automatic Mask Generation (AMG), which generates\nzero-shot segmentation masks of an entire image. AMG can be applied to edge\ndetection, but suffers from the problem of overdetecting edges. Edge detection\nwith SCESAME overcomes this problem by three steps: (1) eliminating small\ngenerated masks, (2) combining masks by spectral clustering, taking into\naccount mask positions and overlaps, and (3) removing artifacts after edge\ndetection. We performed edge detection experiments on two datasets, BSDS500 and\nNYUDv2. Although our zero-shot approach is simple, the experimental results on\nBSDS500 showed almost identical performance to human performance and CNN-based\nmethods from seven years ago. In the NYUDv2 experiments, it performed almost as\nwell as recent CNN-based methods. These results indicate that our method has\nthe potential to be a strong baseline for future zero-shot edge detection\nmethods. Furthermore, SCESAME is not only applicable to edge detection, but\nalso to other downstream zero-shot tasks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:19:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yamagiwa","Hiroaki",""],["Takase","Yusuke",""],["Kambe","Hiroyuki",""],["Nakamoto","Ryosuke",""]]}
{"id":"2308.13780","submitter":"Sei Kato","authors":"M. Amenomori (1), S. Asano (2), Y. W. Bao (3), X. J. Bi (4), D. Chen\n  (5), T. L. Chen (6), W. Y. Chen (4), Xu Chen (4, 5), Y. Chen (3), Cirennima\n  (6), S. W. Cui (7), Danzengluobu (6), L. K. Ding (4), J. H. Fang (4, 8), K.\n  Fang (4), C. F. Feng (9), Zhaoyang Feng (4), Z. Y. Feng (10), Qi Gao (6), A.\n  Gomi (11), Q. B. Gou (4), Y. Q. Guo (4), Y. Y. Guo (4), H. H. He (4), Z. T.\n  He (7), K. Hibino (12), N. Hotta (13), Haibing Hu (6), H. B. Hu (4), K. Y. Hu\n  (4, 8), J. Huang (4), H. Y. Jia (10), L. Jiang (4), P. Jiang (5), H. B. Jin\n  (5), K. Kasahara (14), Y. Katayose (11), C. Kato (2), S. Kato (15), T.\n  Kawashima (15), K. Kawata (15), M. Kozai (16), D. Kurashige (11), Labaciren\n  (6), G. M. Le (17), A. F. Li (4, 9, 18), H. J. Li (6), W. J. Li (4, 10), Y.\n  Li (5), Y. H. Lin (4, 8), B. Liu (19), C. Liu (4), J. S. Liu (4), L. Y. Liu\n  (5), M. Y. Liu (6), W. Liu (4), X. L. Liu (5), Y.-Q. Lou (20, 21, 22), H. Lu\n  (4), X. R. Meng (6), Y. Meng (4, 8), K. Munakata (2), K. Nagaya (11), Y.\n  Nakamura (15), Y. Nakazawa (23), H. Nanjo (1), C. C. Ning (6), M. Nishizawa\n  (24), M. Ohnishi (15), S. Okukawa (11), S. Ozawa (25), L. Qian (5), X. Qian\n  (5), X. L. Qian (26), X. B. Qu (27), T. Saito (28), Y. Sakakibara (11), M.\n  Sakata (29), T. Sako (15), T. K. Sako (15), J. Shao (4, 9), M. Shibata (11),\n  A. Shiomi (23), H. Sugimoto (30), W. Takano (12), M. Takita (15), Y. H. Tan\n  (4), N. Tateyama (12), S. Torii (31), H. Tsuchiya (32), S. Udo (12), H. Wang\n  (4), Y. P. Wang (6), Wangdui (6), H. R. Wu (4), Q. Wu (6), J. L. Xu (5), L.\n  Xue (9), Z. Yang (4), Y. Q. Yao (5), J. Yin (5), Y. Yokoe (15), N. P. Yu (5),\n  A. F. Yuan (6), L. M. Zhai (5), C. P. Zhang (5), H. M. Zhang (4), J. L. Zhang\n  (4), X. Zhang (3), X. Y. Zhang (9), Y. Zhang (4), Yi Zhang (33), Ying Zhang\n  (4), S. P. Zhao (4), Zhaxisangzhu (6) and X. X. Zhou (10) ((1) Department of\n  Physics, Hirosaki University, (2) Department of Physics, Shinshu University,\n  (3) School of Astronomy and Space Science, Nanjing University, (4) Key\n  Laboratory of Particle Astrophysics, Institute of High Energy Physics,\n  Chinese Academy of Sciences, (5) National Astronomical Observatories, Chinese\n  Academy of Sciences, (6) Department of Mathematics and Physics, Tibet\n  University, (7) Department of Physics, Hebei Normal University, (8)\n  University of Chinese Academy of Sciences, (9) Institute of Frontier and\n  Interdisciplinary Science and Key Laboratory of Particle Physics and Particle\n  Irradiation (MOE), Shandong University, (10) Institute of Modern Physics,\n  SouthWest Jiaotong University, (11) Faculty of Engineering, Yokohama National\n  University, (12) Faculty of Engineering, Kanagawa University, (13) Faculty of\n  Education, Utsunomiya University, (14) Faculty of Systems Engineering,\n  Shibaura Institute of Technology, (15) Institute for Cosmic Ray Research,\n  University of Tokyo, (16) Polar Environment Data Science Center, Joint\n  Support-Center for Data Science Research, Research Organization of\n  Information and Systems, (17) National Center for Space Weather, China\n  Meteorological Administration, (18) School of Information Science and\n  Engineering, Shandong Agriculture University, (19) Department of Astronomy,\n  School of Physical Sciences, University of Science and Technology of China,\n  (20) Department of Physics and Tsinghua Centre for Astrophysics (THCA),\n  Tsinghua University, (21) Tsinghua University-National Astronomical\n  Observatories of China (NAOC) Joint Research Center for Astrophysics,\n  Tsinghua University, (22) Department of Astronomy, Tsinghua University, (23)\n  College of Industrial Technology, Nihon University, (24) National Institute\n  of Informatics, (25) National Institute of Information and Communications\n  Technology, (26) Department of Mechanical and Electrical Engineering,\n  Shangdong Management University, (27) College of Science, China University of\n  Petroleum, (28) Tokyo Metropolitan College of Industrial Technology, (29)\n  Department of Physics, Konan University, (30) Shonan Institute of Technology,\n  (31) Research Institute for Science and Engineering, Waseda University, (32)\n  Japan Atomic Energy Agency, (33) Key Laboratory of Dark Matter and Space\n  Astronomy, Purple Mountain Observatory, Chinese Academy of Sciences)","title":"Measurement of the Gamma-Ray Energy Spectrum beyond 100 TeV from the\n  HESS J1843$-$033 Region","comments":"11 pages, 4 figures, 1 table","journal-ref":null,"doi":"10.3847/1538-4357/ac6ef4","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  HESS J1843$-$033 is a very-high-energy gamma-ray source whose origin remains\nunidentified. This work presents, for the first time, the energy spectrum of\ngamma rays beyond $100\\, {\\rm TeV}$ from the HESS J1843$-$033 region using the\ndata recorded by the Tibet air shower array and its underground muon detector\narray. A gamma-ray source with an extension of $0.34^{\\circ} \\pm 0.12^{\\circ}$\nis successfully detected above $25\\, {\\rm TeV}$ at $(\\alpha,\\, \\delta) =\n(281.09^{\\circ}\\pm 0.10^{\\circ},\\, -3.76^{\\circ}\\pm 0.09^{\\circ})$ near HESS\nJ1843$-$033 with a statistical significance of $6.2\\, \\sigma$, and the source\nis named TASG J1844$-$038. The position of TASG J1844$-$038 is consistent with\nthose of HESS J1843$-$033, eHWC J1842$-$035, and LHAASO J1843$-$0338. The\nmeasured gamma-ray energy spectrum in $25\\, {\\rm TeV} < E < 130\\, {\\rm TeV}$ is\ndescribed with ${\\rm d}N/{\\rm d}E = (9.70\\pm 1.89)\\times 10^{-16} (E/40\\, {\\rm\nTeV})^{-3.26\\pm 0.30}\\, {\\rm TeV}^{-1} {\\rm cm}^{-2} {\\rm s}^{-1}$, and the\nspectral fit to the combined spectra of HESS J1843$-$033, LHAASO J1843$-$0338,\nand TASG J1844$-$038 implies the existence of a cutoff at $49.5\\pm 9.0\\, {\\rm\nTeV}$. Associations of TASG J1844-038 with SNR G28.6$-$0.1 and PSR J1844-0346\nare also discussed in detail for the first time.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:26:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amenomori","M.",""],["Asano","S.",""],["Bao","Y. W.",""],["Bi","X. J.",""],["Chen","D.",""],["Chen","T. L.",""],["Chen","W. Y.",""],["Chen","Xu",""],["Chen","Y.",""],["Cirennima","",""],["Cui","S. W.",""],["Danzengluobu","",""],["Ding","L. K.",""],["Fang","J. H.",""],["Fang","K.",""],["Feng","C. F.",""],["Feng","Zhaoyang",""],["Feng","Z. Y.",""],["Gao","Qi",""],["Gomi","A.",""],["Gou","Q. B.",""],["Guo","Y. Q.",""],["Guo","Y. Y.",""],["He","H. H.",""],["He","Z. T.",""],["Hibino","K.",""],["Hotta","N.",""],["Hu","Haibing",""],["Hu","H. B.",""],["Hu","K. Y.",""],["Huang","J.",""],["Jia","H. Y.",""],["Jiang","L.",""],["Jiang","P.",""],["Jin","H. B.",""],["Kasahara","K.",""],["Katayose","Y.",""],["Kato","C.",""],["Kato","S.",""],["Kawashima","T.",""],["Kawata","K.",""],["Kozai","M.",""],["Kurashige","D.",""],["Labaciren","",""],["Le","G. M.",""],["Li","A. F.",""],["Li","H. J.",""],["Li","W. J.",""],["Li","Y.",""],["Lin","Y. H.",""],["Liu","B.",""],["Liu","C.",""],["Liu","J. S.",""],["Liu","L. Y.",""],["Liu","M. Y.",""],["Liu","W.",""],["Liu","X. L.",""],["Lou","Y. -Q.",""],["Lu","H.",""],["Meng","X. R.",""],["Meng","Y.",""],["Munakata","K.",""],["Nagaya","K.",""],["Nakamura","Y.",""],["Nakazawa","Y.",""],["Nanjo","H.",""],["Ning","C. C.",""],["Nishizawa","M.",""],["Ohnishi","M.",""],["Okukawa","S.",""],["Ozawa","S.",""],["Qian","L.",""],["Qian","X.",""],["Qian","X. L.",""],["Qu","X. B.",""],["Saito","T.",""],["Sakakibara","Y.",""],["Sakata","M.",""],["Sako","T.",""],["Sako","T. K.",""],["Shao","J.",""],["Shibata","M.",""],["Shiomi","A.",""],["Sugimoto","H.",""],["Takano","W.",""],["Takita","M.",""],["Tan","Y. H.",""],["Tateyama","N.",""],["Torii","S.",""],["Tsuchiya","H.",""],["Udo","S.",""],["Wang","H.",""],["Wang","Y. P.",""],["Wangdui","",""],["Wu","H. R.",""],["Wu","Q.",""],["Xu","J. L.",""],["Xue","L.",""],["Yang","Z.",""],["Yao","Y. Q.",""],["Yin","J.",""],["Yokoe","Y.",""],["Yu","N. P.",""],["Yuan","A. F.",""],["Zhai","L. M.",""],["Zhang","C. P.",""],["Zhang","H. M.",""],["Zhang","J. L.",""],["Zhang","X.",""],["Zhang","X. Y.",""],["Zhang","Y.",""],["Zhang","Yi",""],["Zhang","Ying",""],["Zhao","S. P.",""],["Zhaxisangzhu","",""],["Zhou","X. X.",""]]}
{"id":"2308.13781","submitter":"Sei Kato","authors":"M. Amenomori (1), S. Asano (2), Y. W. Bao (3), X. J. Bi (4), D. Chen\n  (5), T. L. Chen (6), W. Y. Chen (4), Xu Chen (4, 5), Y. Chen (3), Cirennima\n  (6), S. W. Cui (7), Danzengluobu (6), L. K. Ding (4), J. H. Fang (4, 8), K.\n  Fang (4), C. F. Feng (9), Zhaoyang Feng (4), Z. Y. Feng (10), Qi Gao (6), A.\n  Gomi (11), Q. B. Gou (4), Y. Q. Guo (4), Y. Y. Guo (4), Y. Hayashi (2), H. H.\n  He (4), Z. T. He (7), K. Hibino (12), N. Hotta (13), Haibing Hu (6), H. B. Hu\n  (4), K. Y. Hu (4, 8), J. Huang (4), H. Y. Jia (10), L. Jiang (4), P. Jiang\n  (5), H. B. Jin (5), K. Kasahara (14), Y. Katayose (11), C. Kato (2), S. Kato\n  (15), I. Kawahara (11), T. Kawashima (15), K. Kawata (15), M. Kozai (16), D.\n  Kurashige (11), Labaciren (6), G. M. Le (17), A. F. Li (4, 9, 18), H. J. Li\n  (6), W. J. Li (4, 10), Y. Li (5), Y. H. Lin (4, 8), B. Liu (19), C. Liu (4),\n  J. S. Liu (4), L. Y. Liu (5), M. Y. Liu (6), W. Liu (4), H. Lu (4), X. R.\n  Meng (6), Y. Meng (4, 8), K. Munakata (2), K. Nagaya (11), Y. Nakamura (15),\n  Y. Nakazawa (20), H. Nanjo (1), C. C. Ning (6), M. Nishizawa (21), R. Noguchi\n  (11), M. Ohnishi (15), S. Okukawa (11), S. Ozawa (22), X. Qian (5), X. L.\n  Qian (23), X. B. Qu (24), T. Saito (25), Y. Sakakibara (11), M. Sakata (26),\n  T. Sako (15), T. K. Sako (15), T. Sasaki (12), J. Shao (4, 9), M. Shibata\n  (11), A. Shiomi (20), H. Sugimoto (27), W. Takano (12), M. Takita (15), Y. H.\n  Tan (4), N. Tateyama (12), S. Torii (28), H. Tsuchiya (29), S. Udo (12), H.\n  Wang (4), S. F. Wang (6), Y. P. Wang (6), Wangdui (6), H. R. Wu (4), Q. Wu\n  (6), J. L. Xu (5), L. Xue (9), Z. Yang (4), Y. Q. Yao (5), J. Yin (5), Y.\n  Yokoe (15), Y. L. Yu (4, 8), A. F. Yuan (6), L. M. Zhai (5), H. M. Zhang (4),\n  J. L. Zhang (4), X. Zhang (3), X. Y. Zhang (9), Y. Zhang (4), Yi Zhang (30),\n  Ying Zhang (4), S. P. Zhao (4), Zhaxisangzhu (6), X. X. Zhou (10) and Y. H.\n  Zou (4, 8) ((1) Department of Physics, Hirosaki University, (2) Department of\n  Physics, Shinshu University, (3) School of Astronomy and Space Science,\n  Nanjing University, (4) Key Laboratory of Particle Astrophysics, Institute of\n  High Energy Physics, Chinese Academy of Sciences, (5) National Astronomical\n  Observatories, Chinese Academy of Sciences, (6) Department of Mathematics and\n  Physics, Tibet University, (7) Department of Physics, Hebei Normal\n  University, (8) University of Chinese Academy of Sciences, (9) Institute of\n  Frontier and Interdisciplinary Science and Key Laboratory of Particle Physics\n  and Particle Irradiation (MOE), Shandong University, (10) Institute of Modern\n  Physics, SouthWest Jiaotong University, (11) Faculty of Engineering, Yokohama\n  National University, (12) Faculty of Engineering, Kanagawa University, (13)\n  Faculty of Education, Utsunomiya University, (14) Faculty of Systems\n  Engineering, Shibaura Institute of Technology, (15) Institute for Cosmic Ray\n  Research, University of Tokyo, (16) Polar Environment Data Science Center,\n  Joint Support-Center for Data Science Research, Research Organization of\n  Information and Systems, (17) National Center for Space Weather, China\n  Meteorological Administration, (18) School of Information Science and\n  Engineering, Shandong Agriculture University, (19) Department of Astronomy,\n  School of Physical Sciences, University of Science and Technology of China,\n  (20) College of Industrial Technology, Nihon University, (21) National\n  Institute of Informatics, (22) National Institute of Information and\n  Communications Technology, (23) Department of Mechanical and Electrical\n  Engineering, Shangdong Management University, (24) College of Science, China\n  University of Petroleum, (25) Tokyo Metropolitan College of Industrial\n  Technology, (26) Department of Physics, Konan University, (27) Shonan\n  Institute of Technology, (28) Research Institute for Science and Engineering,\n  Waseda University, (29) Japan Atomic Energy Agency, (30) Key Laboratory of\n  Dark Matter and Space Astronomy, Purple Mountain Observatory, Chinese Academy\n  of Sciences)","title":"Observation of gamma rays up to 320 TeV from the middle-aged TeV pulsar\n  wind nebula HESS J1849$-$000","comments":"10 pages, 2 figures, Accepted for publication from the Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gamma rays from HESS J1849$-$000, a middle-aged TeV pulsar wind nebula (PWN),\nare observed by the Tibet air shower array and the muon detector array. The\ndetection significance of gamma rays reaches $4.0\\, \\sigma$ and $4.4\\, \\sigma$\nlevels above 25 TeV and 100 TeV, respectively, in units of Gaussian standard\ndeviation $\\sigma$. The energy spectrum measured between $40\\, {\\rm TeV} < E <\n320\\, {\\rm TeV}$ for the first time is described with a simple power-law\nfunction of ${\\rm d}N/{\\rm d}E = (2.86 \\pm 1.44) \\times 10^{-16}(E/40\\, {\\rm\nTeV})^{-2.24 \\pm 0.41}\\, {\\rm TeV}^{-1}\\, {\\rm cm}^{-2}\\, {\\rm s}^{-1}$. The\ngamma-ray energy spectrum from the sub-TeV ($E < 1\\, {\\rm TeV}$) to sub-PeV\n($100\\, {\\rm TeV} < E < 1\\, {\\rm PeV}$) ranges including the results of\nprevious studies can be modeled with the leptonic scenario, inverse Compton\nscattering by high-energy electrons accelerated by the PWN of PSR J1849$-$0001.\nOn the other hand, the gamma-ray energy spectrum can also be modeled with the\nhadronic scenario in which gamma rays are generated from the decay of neutral\npions produced by collisions between accelerated cosmic-ray protons and the\nambient molecular cloud found in the gamma-ray emitting region. The cutoff\nenergy of cosmic-ray protons $E_{\\rm p\\, cut}$, cut is estimated at ${\\rm\nlog}_{10}(E_{\\rm p,\\, cut}/{\\rm TeV}) = 3.73^{+2.98}_{-0.66}$, suggesting that\nprotons are accelerated up to the PeV energy range. Our study thus proposes\nthat HESS J1849$-$000 should be further investigated as a new candidate for a\nGalactic PeV cosmic-ray accelerator, PeVatron.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:27:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amenomori","M.",""],["Asano","S.",""],["Bao","Y. W.",""],["Bi","X. J.",""],["Chen","D.",""],["Chen","T. L.",""],["Chen","W. Y.",""],["Chen","Xu",""],["Chen","Y.",""],["Cirennima","",""],["Cui","S. W.",""],["Danzengluobu","",""],["Ding","L. K.",""],["Fang","J. H.",""],["Fang","K.",""],["Feng","C. F.",""],["Feng","Zhaoyang",""],["Feng","Z. Y.",""],["Gao","Qi",""],["Gomi","A.",""],["Gou","Q. B.",""],["Guo","Y. Q.",""],["Guo","Y. Y.",""],["Hayashi","Y.",""],["He","H. H.",""],["He","Z. T.",""],["Hibino","K.",""],["Hotta","N.",""],["Hu","Haibing",""],["Hu","H. B.",""],["Hu","K. Y.",""],["Huang","J.",""],["Jia","H. Y.",""],["Jiang","L.",""],["Jiang","P.",""],["Jin","H. B.",""],["Kasahara","K.",""],["Katayose","Y.",""],["Kato","C.",""],["Kato","S.",""],["Kawahara","I.",""],["Kawashima","T.",""],["Kawata","K.",""],["Kozai","M.",""],["Kurashige","D.",""],["Labaciren","",""],["Le","G. M.",""],["Li","A. F.",""],["Li","H. J.",""],["Li","W. J.",""],["Li","Y.",""],["Lin","Y. H.",""],["Liu","B.",""],["Liu","C.",""],["Liu","J. S.",""],["Liu","L. Y.",""],["Liu","M. Y.",""],["Liu","W.",""],["Lu","H.",""],["Meng","X. R.",""],["Meng","Y.",""],["Munakata","K.",""],["Nagaya","K.",""],["Nakamura","Y.",""],["Nakazawa","Y.",""],["Nanjo","H.",""],["Ning","C. C.",""],["Nishizawa","M.",""],["Noguchi","R.",""],["Ohnishi","M.",""],["Okukawa","S.",""],["Ozawa","S.",""],["Qian","X.",""],["Qian","X. L.",""],["Qu","X. B.",""],["Saito","T.",""],["Sakakibara","Y.",""],["Sakata","M.",""],["Sako","T.",""],["Sako","T. K.",""],["Sasaki","T.",""],["Shao","J.",""],["Shibata","M.",""],["Shiomi","A.",""],["Sugimoto","H.",""],["Takano","W.",""],["Takita","M.",""],["Tan","Y. H.",""],["Tateyama","N.",""],["Torii","S.",""],["Tsuchiya","H.",""],["Udo","S.",""],["Wang","H.",""],["Wang","S. F.",""],["Wang","Y. P.",""],["Wangdui","",""],["Wu","H. R.",""],["Wu","Q.",""],["Xu","J. L.",""],["Xue","L.",""],["Yang","Z.",""],["Yao","Y. Q.",""],["Yin","J.",""],["Yokoe","Y.",""],["Yu","Y. L.",""],["Yuan","A. F.",""],["Zhai","L. M.",""],["Zhang","H. M.",""],["Zhang","J. L.",""],["Zhang","X.",""],["Zhang","X. Y.",""],["Zhang","Y.",""],["Zhang","Yi",""],["Zhang","Ying",""],["Zhao","S. P.",""],["Zhaxisangzhu","",""],["Zhou","X. X.",""],["Zou","Y. H.",""]]}
{"id":"2308.13782","submitter":"Fan Zhang","authors":"Fan Zhang, Kebing Jin, and Hankz Hankui Zhuo","title":"Planning with Logical Graph-based Language Model for Instruction\n  Generation","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the superior performance of large language models to generate natural\nlanguage texts, it is hard to generate texts with correct logic according to a\ngiven task, due to the difficulties for neural models to capture implied rules\nfrom free-form texts. In this paper, we propose a novel graph-based language\nmodel, Logical-GLM, to infuse logic into language models for more valid text\ngeneration and interpretability. Specifically, we first capture information\nfrom natural language instructions and construct logical bayes graphs that\ngenerally describe domains. Next, we generate logical skeletons to guide\nlanguage model training, infusing domain knowledge into language models.\nFinally, we alternately optimize the searching policy of graphs and language\nmodels until convergence. The experimental results show that Logical-GLM is\nboth effective and efficient compared with traditional language models, despite\nusing smaller-scale training data and fewer parameters. Our approach can\ngenerate instructional texts with more correct logic owing to the internalized\ndomain knowledge. Moreover, the usage of logical graphs reflects the inner\nmechanism of the language models, which improves the interpretability of\nblack-box models.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:28:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Fan",""],["Jin","Kebing",""],["Zhuo","Hankz Hankui",""]]}
{"id":"2308.13783","submitter":"Mingde Yao Yao","authors":"Mingde Yao, Jie Huang, Xin Jin, Ruikang Xu, Shenglong Zhou, Man Zhou,\n  Zhiwei Xiong","title":"Generalized Lightness Adaptation with Channel Selective Normalization","comments":"Accepted to ICCV 2023. Code: https://github.com/mdyao/CSNorm/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lightness adaptation is vital to the success of image processing to avoid\nunexpected visual deterioration, which covers multiple aspects, e.g., low-light\nimage enhancement, image retouching, and inverse tone mapping. Existing methods\ntypically work well on their trained lightness conditions but perform poorly in\nunknown ones due to their limited generalization ability. To address this\nlimitation, we propose a novel generalized lightness adaptation algorithm that\nextends conventional normalization techniques through a channel filtering\ndesign, dubbed Channel Selective Normalization (CSNorm). The proposed CSNorm\npurposely normalizes the statistics of lightness-relevant channels and keeps\nother channels unchanged, so as to improve feature generalization and\ndiscrimination. To optimize CSNorm, we propose an alternating training strategy\nthat effectively identifies lightness-relevant channels. The model equipped\nwith our CSNorm only needs to be trained on one lightness condition and can be\nwell generalized to unknown lightness conditions. Experimental results on\nmultiple benchmark datasets demonstrate the effectiveness of CSNorm in\nenhancing the generalization ability for the existing lightness adaptation\nmethods. Code is available at https://github.com/mdyao/CSNorm.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:35:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yao","Mingde",""],["Huang","Jie",""],["Jin","Xin",""],["Xu","Ruikang",""],["Zhou","Shenglong",""],["Zhou","Man",""],["Xiong","Zhiwei",""]]}
{"id":"2308.13784","submitter":"Jun-Hong An","authors":"Wan-Lu Song, Hai-Bin Liu, Bin Zhou, Wan-Li Yang, and Jun-Hong An","title":"Remote-charging and anti-aging quantum battery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum battery (QB) makes use of quantum effects to store and supply energy,\nwhich may outperform its classical counterpart. However, there are two\nchallenges in this field. One is that the environment induced decoherence\ncauses the energy loss and the aging of QB, the other is that the decreasing of\nthe charger-QB coupling strength with increasing their distance makes the\ncharging of QB become inefficiently. Here, we propose a QB scheme to realize a\nremote charging via coupling the QB and the charger to a rectangular hollow\nmetal waveguide. It is found that an ideal charging is realized as long as two\nbound states are formed in the energy spectrum of the total system consisting\nof the QB, the charger, and the electromagnetic environment in the waveguide.\nUsing the constructive role of the decoherence, our QB is immune to the aging.\nAdditionally, without resorting to the direct charger-QB interaction, our\nscheme works in a way of long-range and wireless-like charging. Effectively\novercoming the two challenges, our result supplies an insightful guideline to\nthe practical realization of QB by reservoir engineering.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:42:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Song","Wan-Lu",""],["Liu","Hai-Bin",""],["Zhou","Bin",""],["Yang","Wan-Li",""],["An","Jun-Hong",""]]}
{"id":"2308.13785","submitter":"Minheng Ni","authors":"Minheng Ni, Chenfei Wu, Xiaodong Wang, Shengming Yin, Lijuan Wang,\n  Zicheng Liu, Nan Duan","title":"ORES: Open-vocabulary Responsible Visual Synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Avoiding synthesizing specific visual concepts is an essential challenge in\nresponsible visual synthesis. However, the visual concept that needs to be\navoided for responsible visual synthesis tends to be diverse, depending on the\nregion, context, and usage scenarios. In this work, we formalize a new task,\nOpen-vocabulary Responsible Visual Synthesis (ORES), where the synthesis model\nis able to avoid forbidden visual concepts while allowing users to input any\ndesired content. To address this problem, we present a Two-stage Intervention\n(TIN) framework. By introducing 1) rewriting with learnable instruction through\na large-scale language model (LLM) and 2) synthesizing with prompt intervention\non a diffusion synthesis model, it can effectively synthesize images avoiding\nany concepts but following the user's query as much as possible. To evaluate on\nORES, we provide a publicly available dataset, baseline models, and benchmark.\nExperimental results demonstrate the effectiveness of our method in reducing\nrisks of image generation. Our work highlights the potential of LLMs in\nresponsible visual synthesis. Our code and dataset is public available.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:47:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ni","Minheng",""],["Wu","Chenfei",""],["Wang","Xiaodong",""],["Yin","Shengming",""],["Wang","Lijuan",""],["Liu","Zicheng",""],["Duan","Nan",""]]}
{"id":"2308.13786","submitter":"Yuan Zhong","authors":"Yuan Zhong, Heng Guo and Yu-Xiao Liu","title":"Kink solutions in generalized 2D dilaton gravity","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study static kink solutions in a generalized two-dimensional dilaton\ngravity model, where the kinetic term of the dilaton is generalized to be an\narbitrary function of the canonical one $\\mathcal X= -\\frac12 (\\nabla\n\\varphi)^2$, say $\\mathcal F(\\mathcal X)$, and the kink is generated by a\ncanonical scalar matter field $\\phi$. It is found that for arbitrary $\\mathcal\nF(\\mathcal X)$, the background field equations have a simple first-order\nformalism, and the linear perturbation equation can always be written as a\nSchr\\\"odinger-like equation with factorizable Hamiltonian operator. After\nchoosing appropriate $\\mathcal F(\\mathcal X)$ and superpotential, we obtain a\nsine-Gordon type kink solution with pure AdS$_2$ metric. The linear\nperturbation equation of this solution becomes exactly solvable if one of the\nmodel parameter takes a critical value.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:53:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Yuan",""],["Guo","Heng",""],["Liu","Yu-Xiao",""]]}
{"id":"2308.13787","submitter":"M. Ryleigh Davis","authors":"M. Ryleigh Davis, Michael E. Brown, Samantha K. Trumbo","title":"The Spatial Distribution of the Unidentified 2.07 \\textmu m Absorption\n  Feature on Europa and Implications for its Origin","comments":"12 pages, 3 figures, published in PSJ","journal-ref":"The Planetary Science Journal, 4, 148 (2023)","doi":"10.3847/PSJ/aced96","report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A weak absorption feature at 2.07 \\textmu m on Europa's trailing hemisphere\nhas been suggested to arise from radiolytic processing of an endogenic salt,\npossibly sourced from the interior ocean. However, if the genesis of this\nfeature requires endogenic material to be present, one might expect to find a\ncorrelation between its spatial distribution and the recently disrupted chaos\nterrains. Using archived near-infrared observations from Very Large\nTelescope/SINFONI with a $\\sim$1 nm spectral resolution and a linear spatial\nresolution $\\sim$130 km, we examine the spatial distribution of this feature in\nan effort to explore this endogenic formation hypothesis. We find that while\nthe presence of the 2.07 \\textmu m feature is strongly associated with the\nirradiation pattern on Europa's trailing hemisphere, there is no apparent\nassociation between the presence or depth of the absorption feature and\nEuropa's large-scale chaos terrain. This spatial distribution suggests that the\nformation pathway of the 2.07 \\textmu m feature on Europa is independent of any\nendogenous salts within the recent geology. Instead, we propose that the source\nof this feature may simply be a product of the radiolytic sulfur cycle or arise\nfrom some unidentified parallel irradiation process. Notably, the 2.07 \\textmu\nm absorption band is absent from the Pwyll crater ejecta blanket, suggesting\nthat radiolytic processing has not had enough time to form the species\nresponsible and placing a lower limit on the irradiation timescale. We are\nunable to find a plausible spectral match to the 2.07 \\textmu m feature within\nthe available laboratory data.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 06:58:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Davis","M. Ryleigh",""],["Brown","Michael E.",""],["Trumbo","Samantha K.",""]]}
{"id":"2308.13788","submitter":"Danilo Artigas","authors":"Danilo Artigas, Killian Martineau, Jakub Mielczarek","title":"Squeezing of light from Planck-scale physics","comments":"11 pages main text, 1 page appendix, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, the possibility of generating non-classical light due to\nPlanck-scale effects is considered. For this purpose, a widely studied model of\ndeformation of the Heisenberg uncertainty relation is applied to single-mode\nand multi-mode lights. The model leads to a deformed dispersion relation, which\nmanifests in an advancement in the time of arrival of photons. The key finding\nis that the model also leads to an oscillatory pattern of squeezing of the\nstate of light. Furthermore, while the amplitude of the oscillations is\nconstant for the energy eigenstates, it exhibits linear growth over time for\nthe coherent states with the annihilation operator eigenvalue $\\alpha \\neq0 $.\nThis second case leads to the accumulation of squeezing and phase space\ndisplacement, which can be significant for astrophysical photons. In\nparticular, for $\\alpha \\sim 1$, coherent light in the optical spectrum emitted\nat gigaparsec distances acquires squeezing with the amplitude of the order of\n$10^4$. This suggests that measurements of the non-classical properties of\nlight originating from distant astrophysical sources may open a window to test\nthese predictions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:02:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Artigas","Danilo",""],["Martineau","Killian",""],["Mielczarek","Jakub",""]]}
{"id":"2308.13789","submitter":"Xiaohui Peng","authors":"Jiajin Luo, Baojian Zhou, Yang Yu, Ping Zhang, Xiaohui Peng, Jianglei\n  Ma, Peiying Zhu, Jianmin Lu, Wen Tong","title":"Sensiverse: A dataset for ISAC study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In order to address the lack of applicable channel models for ISAC research\nand evaluation, we release Sensiverse, a dataset that can be used for ISAC\nresearch. In this paper, we present the method of generating Sensiverse,\nincluding the acquisition and formatting of the 3D scene models, the generation\nof the channel data and associations with Tx/Rx deployment. The file structure\nand usage of the dataset are also described, and finally the use of the dataset\nis illustrated with examples through the evaluation of use cases such as 3D\nenvironment reconstruction and moving targets.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:20:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luo","Jiajin",""],["Zhou","Baojian",""],["Yu","Yang",""],["Zhang","Ping",""],["Peng","Xiaohui",""],["Ma","Jianglei",""],["Zhu","Peiying",""],["Lu","Jianmin",""],["Tong","Wen",""]]}
{"id":"2308.13790","submitter":"Chaoyu Chen","authors":"Chaoyu Chen, Xin Yang, Rusi Chen, Junxuan Yu, Liwei Du, Jian Wang,\n  Xindi Hu, Yan Cao, Yingying Liu and Dong Ni","title":"FFPN: Fourier Feature Pyramid Network for Ultrasound Image Segmentation","comments":"10 pages, 5 figures, Accepted by MLMI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrasound (US) image segmentation is an active research area that requires\nreal-time and highly accurate analysis in many scenarios. The detect-to-segment\n(DTS) frameworks have been recently proposed to balance accuracy and\nefficiency. However, existing approaches may suffer from inadequate contour\nencoding or fail to effectively leverage the encoded results. In this paper, we\nintroduce a novel Fourier-anchor-based DTS framework called Fourier Feature\nPyramid Network (FFPN) to address the aforementioned issues. The contributions\nof this paper are two fold. First, the FFPN utilizes Fourier Descriptors to\nadequately encode contours. Specifically, it maps Fourier series with similar\namplitudes and frequencies into the same layer of the feature map, thereby\neffectively utilizing the encoded Fourier information. Second, we propose a\nContour Sampling Refinement (CSR) module based on the contour proposals and\nrefined features produced by the FFPN. This module extracts rich features\naround the predicted contours to further capture detailed information and\nrefine the contours. Extensive experimental results on three large and\nchallenging datasets demonstrate that our method outperforms other DTS methods\nin terms of accuracy and efficiency. Furthermore, our framework can generalize\nwell to other detection or segmentation tasks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:28:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Chaoyu",""],["Yang","Xin",""],["Chen","Rusi",""],["Yu","Junxuan",""],["Du","Liwei",""],["Wang","Jian",""],["Hu","Xindi",""],["Cao","Yan",""],["Liu","Yingying",""],["Ni","Dong",""]]}
{"id":"2308.13791","submitter":"Mahendran N","authors":"Mahendran N","title":"Handwritten image augmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this paper, we introduce Handwritten augmentation, a new data augmentation\nfor handwritten character images. This method focuses on augmenting handwritten\nimage data by altering the shape of input characters in training. The proposed\nhandwritten augmentation is similar to position augmentation, color\naugmentation for images but a deeper focus on handwritten characters.\nHandwritten augmentation is data-driven, easy to implement, and can be\nintegrated with CNN-based optical character recognition models. Handwritten\naugmentation can be implemented along with commonly used data augmentation\ntechniques such as cropping, rotating, and yields better performance of models\nfor handwritten image datasets developed using optical character recognition\nmethods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:33:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["N","Mahendran",""]]}
{"id":"2308.13792","submitter":"Seyedeh Fatemeh Razavi","authors":"Seyedeh Fatemeh Razavi, Mohammad Mahdi Mehmanchi, Reshad Hosseini,\n  Mostafa Tavassolipour","title":"Out-of-distribution detection using normalizing flows on the data\n  manifold","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A common approach for out-of-distribution detection involves estimating an\nunderlying data distribution, which assigns a lower likelihood value to\nout-of-distribution data. Normalizing flows are likelihood-based generative\nmodels providing a tractable density estimation via dimension-preserving\ninvertible transformations. Conventional normalizing flows are prone to fail in\nout-of-distribution detection, because of the well-known curse of\ndimensionality problem of the likelihood-based models. According to the\nmanifold hypothesis, real-world data often lie on a low-dimensional manifold.\nThis study investigates the effect of manifold learning using normalizing flows\non out-of-distribution detection. We proceed by estimating the density on a\nlow-dimensional manifold, coupled with measuring the distance from the\nmanifold, as criteria for out-of-distribution detection. However, individually,\neach of them is insufficient for this task. The extensive experimental results\nshow that manifold learning improves the out-of-distribution detection ability\nof a class of likelihood-based models known as normalizing flows. This\nimprovement is achieved without modifying the model structure or using\nauxiliary out-of-distribution data during training.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:35:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Razavi","Seyedeh Fatemeh",""],["Mehmanchi","Mohammad Mahdi",""],["Hosseini","Reshad",""],["Tavassolipour","Mostafa",""]]}
{"id":"2308.13793","submitter":"Gordon Owusu Boateng Dr.","authors":"Gordon Owusu Boateng and Guisong Liu","title":"Cooperative Resource Trading for Network Slicing in Industrial IoT: A\n  Multi-Agent DRL Approach","comments":"8 pages, 4 figures, conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The industrial Internet of Things (IIoT) and network slicing (NS) paradigms\nhave been envisioned as key enablers for flexible and intelligent manufacturing\nin the industry 4.0, where a myriad of interconnected machines, sensors, and\ndevices of diversified quality of service (QoS) requirements coexist. To\noptimize network resource usage, stakeholders in the IIoT network are\nencouraged to take pragmatic steps towards resource sharing. However, resource\nsharing is only attractive if the entities involved are able to settle on a\nfair exchange of resource for remuneration in a win-win situation. In this\npaper, we design an economic model that analyzes the multilateral strategic\ntrading interactions between sliced tenants in IIoT networks. We formulate the\nresource pricing and purchasing problem of the seller and buyer tenants as a\ncooperative Stackelberg game. Particularly, the cooperative game enforces\ncollaboration among the buyer tenants by coalition formation in order to\nstrengthen their position in resource price negotiations as opposed to acting\nindividually, while the Stackelberg game determines the optimal policy\noptimization of the seller tenants and buyer tenant coalitions. To achieve a\nStackelberg equilibrium (SE), a multi-agent deep reinforcement learning (MADRL)\nmethod is developed to make flexible pricing and purchasing decisions without\nprior knowledge of the environment. Simulation results and analysis prove that\nthe proposed method achieves convergence and is superior to other baselines, in\nterms of utility maximization.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:35:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Boateng","Gordon Owusu",""],["Liu","Guisong",""]]}
{"id":"2308.13794","submitter":"Jinming Cao","authors":"Qiu Zhou, Jinming Cao, Hanchao Leng, Yifang Yin, Yu Kun and Roger\n  Zimmermann","title":"SOGDet: Semantic-Occupancy Guided Multi-view 3D Object Detection","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In the field of autonomous driving, accurate and comprehensive perception of\nthe 3D environment is crucial. Bird's Eye View (BEV) based methods have emerged\nas a promising solution for 3D object detection using multi-view images as\ninput. However, existing 3D object detection methods often ignore the physical\ncontext in the environment, such as sidewalk and vegetation, resulting in\nsub-optimal performance. In this paper, we propose a novel approach called\nSOGDet (Semantic-Occupancy Guided Multi-view 3D Object Detection), that\nleverages a 3D semantic-occupancy branch to improve the accuracy of 3D object\ndetection. In particular, the physical context modeled by semantic occupancy\nhelps the detector to perceive the scenes in a more holistic view. Our SOGDet\nis flexible to use and can be seamlessly integrated with most existing\nBEV-based methods. To evaluate its effectiveness, we apply this approach to\nseveral state-of-the-art baselines and conduct extensive experiments on the\nexclusive nuScenes dataset. Our results show that SOGDet consistently enhance\nthe performance of three baseline methods in terms of nuScenes Detection Score\n(NDS) and mean Average Precision (mAP). This indicates that the combination of\n3D object detection and 3D semantic occupancy leads to a more comprehensive\nperception of the 3D environment, thereby aiding build more robust autonomous\ndriving systems. The codes are available at: https://github.com/zhouqiu/SOGDet.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:38:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Qiu",""],["Cao","Jinming",""],["Leng","Hanchao",""],["Yin","Yifang",""],["Kun","Yu",""],["Zimmermann","Roger",""]]}
{"id":"2308.13795","submitter":"Trung Nghia Le","authors":"Minh-Hien Le and Chi-Bien Chu and Khanh-Duy Le and Tam V. Nguyen and\n  Minh-Triet Tran and Trung-Nghia Le","title":"VIDES: Virtual Interior Design via Natural Language and Visual Guidance","comments":"Accepted to ISMAR 2023 (Poster paper)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interior design is crucial in creating aesthetically pleasing and functional\nindoor spaces. However, developing and editing interior design concepts\nrequires significant time and expertise. We propose Virtual Interior DESign\n(VIDES) system in response to this challenge. Leveraging cutting-edge\ntechnology in generative AI, our system can assist users in generating and\nediting indoor scene concepts quickly, given user text description and visual\nguidance. Using both visual guidance and language as the conditional inputs\nsignificantly enhances the accuracy and coherence of the generated scenes,\nresulting in visually appealing designs. Through extensive experimentation, we\ndemonstrate the effectiveness of VIDES in developing new indoor concepts,\nchanging indoor styles, and replacing and removing interior objects. The system\nsuccessfully captures the essence of users' descriptions while providing\nflexibility for customization. Consequently, this system can potentially reduce\nthe entry barrier for indoor design, making it more accessible to users with\nlimited technical skills and reducing the time required to create high-quality\nimages. Individuals who have a background in design can now easily communicate\ntheir ideas visually and effectively present their design concepts.\nhttps://sites.google.com/view/ltnghia/research/VIDES\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:41:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Le","Minh-Hien",""],["Chu","Chi-Bien",""],["Le","Khanh-Duy",""],["Nguyen","Tam V.",""],["Tran","Minh-Triet",""],["Le","Trung-Nghia",""]]}
{"id":"2308.13796","submitter":"Shuyuan Liu","authors":"Shuyuan Liu, Chongze Wang, Shichang Yao, Yu Jia, Zhenyu Zhang, and\n  Jun-Hyung Cho","title":"Driving Mechanism and Dynamic Fluctuations of Charge Density Waves in\n  the Kagome Metal ScV$_6$Sn$_6$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a new family of V-based kagome metals RV$_6$Sn$_6$ (R = Sc, Y, La), only\nScV$_6$Sn$_6$ was observed to exhibit the unusual charge density wave (CDW)\nwith a $\\sqrt{3}{\\times}\\sqrt{3}$ in-plane ordering and a tripling of the unit\ncell along the $c$-axis. However, the driving mechanism of such a\n$\\sqrt{3}{\\times}\\sqrt{3}{\\times}$3 CDW order is elusive. Here, using\nfirst-principles density-functional theory calculations, we demonstrate that\nthe $\\sqrt{3}{\\times}\\sqrt{3}{\\times}$2 or $\\sqrt{3}{\\times}\\sqrt{3}{\\times}$3\nCDW order is driven by a Jahn-Teller-like effect where the interlayer\ndimerization of Sn atoms in kagome bilayers is accompanied by a charge\nredistribution between such Sn atoms and its associated gap opening. It is\nrevealed that the free energy of the $\\sqrt{3}{\\times}\\sqrt{3}{\\times}$3 phase\nbecomes lower than that of the $\\sqrt{3}{\\times}\\sqrt{3}{\\times}$2 phase above\n$T_{\\rm CDW}$ mostly due to the emergence of a large configurational entropy.\nSuch a high-entropy phase shows dynamic fluctuations between its degenerate\nconfigurations but, as the temperature lowers below $T_{\\rm CDW}$, it can be\nkinetically trapped to release a sizable entropy. Our findings not only\nidentify the driving mechanism and order-disorder transition of the CDW in\nScV$_6$Sn$_6$ but also provide an ideal platform for investigating strong CDW\nfluctuations in V-based kagome metals.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:45:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Shuyuan",""],["Wang","Chongze",""],["Yao","Shichang",""],["Jia","Yu",""],["Zhang","Zhenyu",""],["Cho","Jun-Hyung",""]]}
{"id":"2308.13797","submitter":"Chaoqun Wang","authors":"Chaoqun Wang, Yijun Li, Xiangqian Sun, Qi Wu, Dongdong Wang and\n  Zhixiang Huang","title":"DeLELSTM: Decomposition-based Linear Explainable LSTM to Capture\n  Instantaneous and Long-term Effects in Time Series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time series forecasting is prevalent in various real-world applications.\nDespite the promising results of deep learning models in time series\nforecasting, especially the Recurrent Neural Networks (RNNs), the explanations\nof time series models, which are critical in high-stakes applications, have\nreceived little attention. In this paper, we propose a Decomposition-based\nLinear Explainable LSTM (DeLELSTM) to improve the interpretability of LSTM.\nConventionally, the interpretability of RNNs only concentrates on the variable\nimportance and time importance. We additionally distinguish between the\ninstantaneous influence of new coming data and the long-term effects of\nhistorical data. Specifically, DeLELSTM consists of two components, i.e.,\nstandard LSTM and tensorized LSTM. The tensorized LSTM assigns each variable\nwith a unique hidden state making up a matrix $\\mathbf{h}_t$, and the standard\nLSTM models all the variables with a shared hidden state $\\mathbf{H}_t$. By\ndecomposing the $\\mathbf{H}_t$ into the linear combination of past information\n$\\mathbf{h}_{t-1}$ and the fresh information $\\mathbf{h}_{t}-\\mathbf{h}_{t-1}$,\nwe can get the instantaneous influence and the long-term effect of each\nvariable. In addition, the advantage of linear regression also makes the\nexplanation transparent and clear. We demonstrate the effectiveness and\ninterpretability of DeLELSTM on three empirical datasets. Extensive experiments\nshow that the proposed method achieves competitive performance against the\nbaseline methods and provides a reliable explanation relative to domain\nknowledge.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:45:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Chaoqun",""],["Li","Yijun",""],["Sun","Xiangqian",""],["Wu","Qi",""],["Wang","Dongdong",""],["Huang","Zhixiang",""]]}
{"id":"2308.13798","submitter":"Trung Nghia Le","authors":"Khoi-Nguyen Nguyen-Ngoc and Thanh-Tung Phan-Nguyen and Khanh-Duy Le\n  and Tam V. Nguyen and Minh-Triet Tran and Trung-Nghia Le","title":"DM-VTON: Distilled Mobile Real-time Virtual Try-On","comments":"Accepted to ISMAR 2023 (Poster paper)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The fashion e-commerce industry has witnessed significant growth in recent\nyears, prompting exploring image-based virtual try-on techniques to incorporate\nAugmented Reality (AR) experiences into online shopping platforms. However,\nexisting research has primarily overlooked a crucial aspect - the runtime of\nthe underlying machine-learning model. While existing methods prioritize\nenhancing output quality, they often disregard the execution time, which\nrestricts their applications on a limited range of devices. To address this\ngap, we propose Distilled Mobile Real-time Virtual Try-On (DM-VTON), a novel\nvirtual try-on framework designed to achieve simplicity and efficiency. Our\napproach is based on a knowledge distillation scheme that leverages a strong\nTeacher network as supervision to guide a Student network without relying on\nhuman parsing. Notably, we introduce an efficient Mobile Generative Module\nwithin the Student network, significantly reducing the runtime while ensuring\nhigh-quality output. Additionally, we propose Virtual Try-on-guided Pose for\nData Synthesis to address the limited pose variation observed in training\nimages. Experimental results show that the proposed method can achieve 40\nframes per second on a single Nvidia Tesla T4 GPU and only take up 37 MB of\nmemory while producing almost the same output quality as other state-of-the-art\nmethods. DM-VTON stands poised to facilitate the advancement of real-time AR\napplications, in addition to the generation of lifelike attired human figures\ntailored for diverse specialized training tasks.\nhttps://sites.google.com/view/ltnghia/research/DMVTON\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:46:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen-Ngoc","Khoi-Nguyen",""],["Phan-Nguyen","Thanh-Tung",""],["Le","Khanh-Duy",""],["Nguyen","Tam V.",""],["Tran","Minh-Triet",""],["Le","Trung-Nghia",""]]}
{"id":"2308.13799","submitter":"Pikee Priya","authors":"Pikee Priya, Yiwei Sun, D. R.Johnson, K.P. Trumble and M. J. M.Krane","title":"Effect of Composition on Microstructural Evolution during Homogenization\n  of 7XXX Alloys","comments":"23 pages, 8 figures, Part of PhD Dissertation work by Pikee Priya at\n  Purdue University (2016)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The effect of composition on microstructure both at the length scale of the\nsecondary dendrite arm spacing and nano-sized dispersoids during homogenization\nof Al-Zn-Cu-Mg-Zr alloys has been studied. A comprehensive model that can\npredict the microstructure at both the length scales has been used for the\nstudy. The microstructure predicted has been compared to that for two\nhomogenized samples from a directionally solidified AA7050 sample and a\nreasonable match has been found. The initial as-cast microstructure for\ndifferent compositions is calculated using Scheil type solidification from\nThermo-Calc. The initial microstructure has a considerable influence on\nmicrostructural evolution during homogenization. To take advantage of the\ndecreased solid solubility of Zr in {\\alpha}-fcc, cooling rates during\nsolidification must be high enough to prevent precipitation of primary Al3Zr.\nUnder solidification with industrial cooling conditions solute rich alloys\nleads to fewer dispersoids. Based on the study, an improved composition range\nof 6-8%Zn, 1-2%Cu, 1-2%Mg and 0.1-0.15%Zr for 7XXX alloys has been proposed.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:47:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Priya","Pikee",""],["Sun","Yiwei",""],["Johnson","D. R.",""],["Trumble","K. P.",""],["Krane","M. J. M.",""]]}
{"id":"2308.13800","submitter":"Pikee Priya","authors":"Pikee Priya, Kyle Fezi, D. R. Johnson and M. J. M. Krane","title":"Radial Variation of Microstructure in a Direct-Chill Cast AA7050 Billet\n  on Homogenization","comments":"20 Pages, 8 Figures, part of the PhD Dissertation work by Pikee Priya\n  at Purdue University (2016). Cited for reference","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A \"through-process\" solidification homogenization numerical model to study\nthe microstructural evolution has been developed for AA7050 alloy. A continuum\nscale Direct Chill Casting (DCC) solidification model has been coupled with a\nmeso-scale homogenization precipitation model to evaluate the radial variation\nof microstructure in a cylindrical DC cast billet after homogenization. The\nLocal Solidification Times predicted by the DCC numerical model is used to\npredict the Secondary Dendritic Arm Spacing (SDAS) across the radius from an\nempirical relationship. It also predicts the macrosegregation used to estimate\nthe radial as-cast microstructures (phases and phase fractions) using\nThermo-Calc. Macrosegregation affects the initial and homogenized\nmicrostructures across the radius, making the surface prone to\nrecrystallization, due to lesser dispersoids and larger precipitated particles\nduring cooling, caused by lesser extent of Zenner pinning and Particle\nStimulated Nucleation (PSN) of recrystallized grains respectively.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:55:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Priya","Pikee",""],["Fezi","Kyle",""],["Johnson","D. R.",""],["Krane","M. J. M.",""]]}
{"id":"2308.13801","submitter":"Weizhi Nie","authors":"Qiang Li, Qiuyang Ma, Weizhi Nie, Anan Liu","title":"Reinforcement Learning Based Multi-modal Feature Fusion Network for\n  Novel Class Discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.MM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the development of deep learning techniques, supervised learning has\nachieved performances surpassing those of humans. Researchers have designed\nnumerous corresponding models for different data modalities, achieving\nexcellent results in supervised tasks. However, with the exponential increase\nof data in multiple fields, the recognition and classification of unlabeled\ndata have gradually become a hot topic. In this paper, we employed a\nReinforcement Learning framework to simulate the cognitive processes of humans\nfor effectively addressing novel class discovery in the Open-set domain. We\ndeployed a Member-to-Leader Multi-Agent framework to extract and fuse features\nfrom multi-modal information, aiming to acquire a more comprehensive\nunderstanding of the feature space. Furthermore, this approach facilitated the\nincorporation of self-supervised learning to enhance model training. We\nemployed a clustering method with varying constraint conditions, ranging from\nstrict to loose, allowing for the generation of dependable labels for a subset\nof unlabeled data during the training phase. This iterative process is similar\nto human exploratory learning of unknown data. These mechanisms collectively\nupdate the network parameters based on rewards received from environmental\nfeedback. This process enables effective control over the extent of exploration\nlearning, ensuring the accuracy of learning in unknown data categories. We\ndemonstrate the performance of our approach in both the 3D and 2D domains by\nemploying the OS-MN40, OS-MN40-Miss, and Cifar10 datasets. Our approach\nachieves competitive competitive results.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:55:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Qiang",""],["Ma","Qiuyang",""],["Nie","Weizhi",""],["Liu","Anan",""]]}
{"id":"2308.13802","submitter":"Weifeng Liu Dr.","authors":"Weifeng Liu, Linping Wu, Xiaowen Xu, Yuren Wang","title":"Implementing Performance Portability of High Performance Computing\n  Programs in the New Golden Age of Chip Architecture","comments":"in Chinese language","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  As an important goal of high-performance computing, the concept of\nperformance portability has been around for many years. As the failure of\nMoore's Law, it is no longer feasible to improve computer performance by simply\nincreasing the number of existing hardware. The innovation of high performance\ncomputer is imperative, which makes high-performance computers with multiple\narchitectures coexist in the production environment. For example, current\nhigh-performance computing nodes often use co-accelerators such like\ngeneral-purpose GPUs and Intel Xeon Phis to accelerate general-purpose\nprocessors. With the flourishing of deep learning, dedicated neural network\nacceleration chips are also arising. The emergence of co-accelerators with\ndifferent architectures and their wide application in high-performance\ncomputers have challenged the performance portability of programs between\nhigh-performance computers with different architectures. This article\nsummarizes the current performance portability technology from the programming\nmodel, serial code automatic parallelization, parallel code automatic\nconversion, etc. at the end of the article, it also summarizes how to use\nscientific computing function libraries to improve performance and performance\nportability of a program. Different application scenarios need different\nimplementation technologies to get performance portability. Program developers\nchoose performance portability solutions for their programs. In fact, they\nbalance programming efficiency and optimization effects under various\nconstraints.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:57:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Weifeng",""],["Wu","Linping",""],["Xu","Xiaowen",""],["Wang","Yuren",""]]}
{"id":"2308.13803","submitter":"Seyed Morteza Nabavinejad","authors":"Seyed Morteza Nabavinejad, Masoumeh Ebrahimi, Sherief Reda","title":"Throughput Maximization of DNN Inference: Batching or Multi-Tenancy?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deployment of real-time ML services on warehouse-scale infrastructures is on\nthe increase. Therefore, decreasing latency and increasing throughput of deep\nneural network (DNN) inference applications that empower those services have\nattracted attention from both academia and industry. A common solution to\naddress this challenge is leveraging hardware accelerators such as GPUs. To\nimprove the inference throughput of DNNs deployed on GPU accelerators, two\ncommon approaches are employed: Batching and Multi-Tenancy. Our preliminary\nexperiments show that the effect of these approaches on the throughput depends\non the DNN architecture. Taking this observation into account, we design and\nimplement DNNScaler which aims to maximize the throughput of interactive\nAI-powered services while meeting their latency requirements. DNNScaler first\ndetects the suitable approach (Batching or Multi-Tenancy) that would be most\nbeneficial for a DNN regarding throughput improvement. Then, it adjusts the\ncontrol knob of the detected approach (batch size for Batching and number of\nco-located instances for Multi-Tenancy) to maintain the latency while\nincreasing the throughput. Conducting an extensive set of experiments using\nwell-known DNNs from a variety of domains, several popular datasets, and a\ncutting-edge GPU, the results indicate that DNNScaler can improve the\nthroughput by up to 14x (218% on average) compared with the previously proposed\napproach, while meeting the latency requirements of the services.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 07:59:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nabavinejad","Seyed Morteza",""],["Ebrahimi","Masoumeh",""],["Reda","Sherief",""]]}
{"id":"2308.13804","submitter":"Jacob Goeree","authors":"Nicholas C Bedard and Jacob K Goeree and Ningyi Sun","title":"Multivariate Majorization in Principal-Agents Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a definition of multivariate majorization that is new to the\neconomics literature. Our majorization technique allows us to generalize Mussa\nand Rosen's (1978) \"ironing\" to a broad class of multivariate principal-agents\nproblems. Specifically, we consider adverse selection problems in which agents'\ntypes are one dimensional but informational externalities create a\nmultidimensional ironing problem. Our majorization technique applies to\ndiscrete and continuous type spaces alike and we demonstrate its usefulness for\ncontract theory and mechanism design. We further show that multivariate\nmajorization yields a natural extension of second-order stochastic dominance to\nmultiple dimensions and derive its implications for decision making under\nmultivariate risk.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:06:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bedard","Nicholas C",""],["Goeree","Jacob K",""],["Sun","Ningyi",""]]}
{"id":"2308.13805","submitter":"Dmitry Zezyulin","authors":"Dmitry A. Zezyulin","title":"Continuous families of non-Hermitian surface solitons","comments":"5 pages, 5 figures; to appear in Optics Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics nlin.PS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that surface solitons form continuous families in one-dimensional\ncomplex optical potentials of a certain shape. This result is illustrated by\nnon-Hermitian gap-surface solitons at the interface between a uniform\nconservative medium and a complex periodic potential. Surface soliton families\nare parameterized by a real propagation constant. The range of possible\npropagation constants is constrained by the relation between the continuous\nspectrum of the uniform medium and the band-gap structure of the periodic\npotential.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:09:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zezyulin","Dmitry A.",""]]}
{"id":"2308.13806","submitter":"Adi Yehoshua","authors":"Adi Yehoshua and Yael Edan","title":"Mobile robots sampling algorithms for monitoring of insects populations\n  in agricultural fields","comments":null,"journal-ref":"Vol. 22, No. 3, September 2023 of the IJSIMM journal","doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Plant diseases are major causes of production losses and may have a\nsignificant impact on the agricultural sector. Detecting pests as early as\npossible can help increase crop yields and production efficiency. Several\nrobotic monitoring systems have been developed allowing to collect data and\nprovide a greater understanding of environmental processes. An agricultural\nrobot can enable accurate timely detection of pests, by traversing the field\nautonomously and monitoring the entire cropped area within a field. However, in\nmany cases it is impossible to sample all plants due to resource limitations.\nIn this thesis, the development and evaluation of several sampling algorithms\nare presented to address the challenge of an agriculture-monitoring ground\nrobot designed to locate insects in an agricultural field, where complete\nsampling of all the plants is infeasible. Two situations were investigated in\nsimulation models that were specially developed as part of this thesis: where\nno a-priori information on the insects is available and where prior information\non the insects distributions within the field is known. For the first\nsituation, seven algorithms were tested, each utilizing an approach to sample\nthe field without prior knowledge of it. For the second situation, we present\nthe development and evaluation of a dynamic sampling algorithm which utilizes\nreal-time information to prioritize sampling at suspected points, locate hot\nspots and adapt sampling plans accordingly. The algorithm's performance was\ncompared to two existing algorithms using Tetranychidae insect data from\nprevious research. Analyses revealed that the dynamic algorithm outperformed\nthe others.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:12:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yehoshua","Adi",""],["Edan","Yael",""]]}
{"id":"2308.13807","submitter":"Oliver Rice","authors":"Oliver E.K. Rice and Anthony R. Yeates","title":"Eruptivity Criteria for Solar Coronal Flux Ropes in Magnetohydrodynamic\n  and Magnetofrictional Models","comments":"20 pages, 11 figures, 1 table. Accepted to the Astrophysical Journal\n  on 13th August 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate which scalar quantity or quantities can best predict the loss\nof equilibrium and subsequent eruption of magnetic flux ropes in the solar\ncorona. Our models are initialized with a potential magnetic arcade, which is\nthen evolved by means of two effects on the lower boundary: firstly a gradual\nshearing of the arcade, modelling differential rotation on the solar surface,\nand secondly supergranular diffusion. These result in flux cancellation at the\npolarity inversion line and the formation of a twisted flux rope. We use three\nmodel setups: full magnetohydrodynamics (MHD) in cartesian coordinates, and the\nmagnetofrictional model in both cartesian and polar coordinates. The flux ropes\nare translationally-invariant, allowing for very fast computational times and\nthus a comprehensive parameter study, comprising hundreds of simulations and\nthousands of eruptions. Similar flux rope behavior is observed using either\nmagnetofriction or MHD, and there are several scalar criteria that could be\nused as proxies for eruptivity. The most consistent predictor of eruptions in\neither model is the squared current in the axial direction of the rope,\nnormalised by the relative helicity, although a variation on the previously\nproposed 'eruptivity index' is also found to perform well in both the\nmagnetofrictional and MHD simulations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:15:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rice","Oliver E. K.",""],["Yeates","Anthony R.",""]]}
{"id":"2308.13808","submitter":"Claudio Di Sipio","authors":"Juri Di Rocco and Claudio Di Sipio","title":"ResyDuo: Combining data models and CF-based recommender systems to\n  develop Arduino projects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While specifying an IoT-based system, software developers have to face a set\nof challenges, spanning from selecting the hardware components to writing the\nactual source code. Even though dedicated development environments are in\nplace, a nonexpert user might struggle with the over-choice problem in\nselecting the proper component. By combining MDE and recommender systems, this\npaper proposes an initial prototype, called ResyDuo, to assist Arduino\ndevelopers by providing two different artifacts, i. e. , hardware components\nand software libraries. In particular, we make use of a widely adopted\ncollaborative filtering algorithm by collecting relevant information by means\nof a dedicated data model. ResyDuo can retrieve hardware components by using\ntags or existing Arduino projects stored on the ProjectHub repository. Then,\nthe system can eventually retrieve corresponding software libraries based on\nthe identified hardware devices. ResyDuo is equipped with a web-based interface\nthat allows users to easily select and configure the under-developing Arduino\nproject. To assess ResyDuos performances, we run the ten-fold crossvalidation\nby adopting the grid search strategy to optimize the hyperparameters of the\nCF-based algorithm. The conducted evaluation shows encouraging results even\nthough there is still room for improvement in terms of the examined metrics.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:21:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Di Rocco","Juri",""],["Di Sipio","Claudio",""]]}
{"id":"2308.13809","submitter":"Daniel Str\\\"uber","authors":"Daniel Str\\\"uber","title":"The complexity paradox: An analysis of modeling education through the\n  lens of complexity science","comments":"5 pages; accepted for publication at the IEEE/ACM International\n  Conference on Modeling Driven Engineering Languages and Systems (MODELS),\n  Educators Symposium","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modeling seeks to tame complexity during software development, by supporting\ndesign, analysis, and stakeholder communication. Paradoxically, experiences\nmade by educators indicate that students often perceive modeling as adding\ncomplexity, instead of reducing it. In this position paper, I analyse modeling\neducation from the lens of complexity science, a theoretical framework for the\nstudy of complex systems. I revisit pedagogical literature where complexity\nscience has been used as a framework for general education and subject-specific\neducation in disciplines such as medicine, project management, and\nsustainability. I revisit complexity-related challenges from modeling education\nliterature, discuss them in the light of complexity and present recommendations\nfor taming complexity when teaching modeling.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:22:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Str\u00fcber","Daniel",""]]}
{"id":"2308.13810","submitter":"Ji Wei Yoon","authors":"Ji Wei Yoon","title":"The Search for Stable Graphene Defect Structures: Optimized Molecular\n  Dynamics Simulations and Energetics of 55-77 Stone-Wales defects","comments":"11 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Defects in graphene are both a boon and a bane for device application - they\ncan induce uncontrollable effects but can also provide novel ways to manipulate\nthe properties of pristine graphene. For this report, we investigated graphene\nwith no defect, one and two mono-vacancies, and two di-vancancies using a\nMolecular Dynamics procedure optimized for the purpose. The defects that are\ndeemed to be energetically stable are identified and their formation mechanisms\nproposed. We also investigated interaction between two Stone-Wales 55-77\ndefects, and the formation energies of their linearly extended structures,\nalong the zigzag and armchair direction, and when they are placed in different\nrelative orientations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:25:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yoon","Ji Wei",""]]}
{"id":"2308.13811","submitter":"Jules Ellis","authors":"Jules L. Ellis","title":"The Spearman-Brown Formula and Reliabilities of Random Test Forms","comments":"35 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is shown that the psychometric test reliability, based on any true-score\nmodel with randomly sampled items and conditionally independent errors,\nconverges to 1 as the test length goes to infinity, assuming some fairly\ngeneral regularity conditions. The asymptotic rate of convergence is given by\nthe Spearman-Brown formula, and for this it is not needed that the items are\nparallel, or latent unidimensional, or even finite dimensional. Simulations\nwith the 2-parameter logistic item response theory model reveal that there can\nbe a positive bias in the reliability of short multidimensional tests, meaning\nthat applying the Spearman-Brown formula in these cases would lead to\noverprediction of the reliability that will result from lengthening the tests.\nFor short unidimensional tests under the 2-parameter logistic model the\nreliabilities are almost unbiased, meaning that application of the\nSpearman-Brown formula in these cases leads to predictions that are\napproximately unbiased.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:28:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ellis","Jules L.",""]]}
{"id":"2308.13812","submitter":"Hao Fei","authors":"Hao Fei, Shengqiong Wu, Wei Ji, Hanwang Zhang, Tat-Seng Chua","title":"Empowering Dynamics-aware Text-to-Video Diffusion with Large Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Text-to-video (T2V) synthesis has gained increasing attention in the\ncommunity, in which the recently emerged diffusion models (DMs) have\npromisingly shown stronger performance than the past approaches. While existing\nstate-of-the-art DMs are competent to achieve high-resolution video generation,\nthey may largely suffer from key limitations (e.g., action occurrence\ndisorders, crude video motions) with respect to the intricate temporal dynamics\nmodeling, one of the crux of video synthesis. In this work, we investigate\nstrengthening the awareness of video dynamics for DMs, for high-quality T2V\ngeneration. Inspired by human intuition, we design an innovative dynamic scene\nmanager (dubbed as Dysen) module, which includes (step-1) extracting from input\ntext the key actions with proper time-order arrangement, (step-2) transforming\nthe action schedules into the dynamic scene graph (DSG) representations, and\n(step-3) enriching the scenes in the DSG with sufficient and reasonable\ndetails. Taking advantage of the existing powerful LLMs (e.g., ChatGPT) via\nin-context learning, Dysen realizes (nearly) human-level temporal dynamics\nunderstanding. Finally, the resulting video DSG with rich action scene details\nis encoded as fine-grained spatio-temporal features, integrated into the\nbackbone T2V DM for video generating. Experiments on popular T2V datasets\nsuggest that our framework consistently outperforms prior arts with significant\nmargins, especially in the scenario with complex actions. Project page at\nhttps://haofei.vip/Dysen-VDM\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:31:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fei","Hao",""],["Wu","Shengqiong",""],["Ji","Wei",""],["Zhang","Hanwang",""],["Chua","Tat-Seng",""]]}
{"id":"2308.13813","submitter":"Yuhang Gao","authors":"Yuhang Gao, Mingzhe Guo, Tom Van Doorsselaere, Hui Tian, Samuel J.\n  Skirvin","title":"Modelling of transverse oscillations driven by p-modes in short coronal\n  loops","comments":"Accepted for publication in ApJ, 14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent observations have revealed two types of decayless transverse\noscillations in short coronalloops: one with short periods scaling with loop\nlengths, and the other with longer periods that exhibit a peak at around 5 min\nin the period distribution. To understand such a difference in period, we work\nin the framework of ideal MHD and model a short coronal loop embedded in an\natmosphere with density stratification from the chromosphere to the corona. An\ninclined p-mode-like driver with a period of 5 min is launched at one loop\nfootpoint. It is discovered that two types of decayless transverse oscillations\ncan be excited in the loop. We interpret the 5 min periodicity as being\ndirectly driven by the footpoint driver, while the others, with periods of\nseveral tens of seconds, are regarded as kink eigenmodes of different\nharmonics. Therefore, our simulation shows that both types of decayless\noscillations found in observations can be excited by p-modes in one short\ncoronal loop. This study extends our understanding of ubiquitous decayless\ntransverse oscillations in the corona. Furthermore, it suggests that p-modes\ncould be an important energy source for coronal heating by driving decayless\ntransverse oscillations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:35:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Yuhang",""],["Guo","Mingzhe",""],["Van Doorsselaere","Tom",""],["Tian","Hui",""],["Skirvin","Samuel J.",""]]}
{"id":"2308.13814","submitter":"Chengxin Liu","authors":"Chengxin Liu, Hao Lu, Zhiguo Cao, Tongliang Liu","title":"Point-Query Quadtree for Crowd Counting, Localization, and More","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that crowd counting can be viewed as a decomposable point querying\nprocess. This formulation enables arbitrary points as input and jointly reasons\nwhether the points are crowd and where they locate. The querying processing,\nhowever, raises an underlying problem on the number of necessary querying\npoints. Too few imply underestimation; too many increase computational\noverhead. To address this dilemma, we introduce a decomposable structure, i.e.,\nthe point-query quadtree, and propose a new counting model, termed Point quEry\nTransformer (PET). PET implements decomposable point querying via\ndata-dependent quadtree splitting, where each querying point could split into\nfour new points when necessary, thus enabling dynamic processing of sparse and\ndense regions. Such a querying process yields an intuitive, universal modeling\nof crowd as both the input and output are interpretable and steerable. We\ndemonstrate the applications of PET on a number of crowd-related tasks,\nincluding fully-supervised crowd counting and localization, partial annotation\nlearning, and point annotation refinement, and also report state-of-the-art\nperformance. For the first time, we show that a single counting model can\naddress multiple crowd-related tasks across different learning paradigms. Code\nis available at https://github.com/cxliu0/PET.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:38:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Chengxin",""],["Lu","Hao",""],["Cao","Zhiguo",""],["Liu","Tongliang",""]]}
{"id":"2308.13815","submitter":"Zhe Xiong","authors":"Zhe Xiong, Qiaoqiao Ding, Xiaoqun Zhang","title":"SyMOT-Flow: Learning optimal transport flow for two arbitrary\n  distributions with maximum mean discrepancy","comments":"14 pages article, 3 pages supplementary","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Finding a transformation between two unknown probability distributions from\nsamples is crucial for modeling complex data distributions and perform tasks\nsuch as density estimation, sample generation, and statistical inference. One\npowerful framework for such transformations is normalizing flow, which\ntransforms an unknown distribution into a standard normal distribution using an\ninvertible network. In this paper, we introduce a novel model called SyMOT-Flow\nthat trains an invertible transformation by minimizing the symmetric maximum\nmean discrepancy between samples from two unknown distributions, and we\nincorporate an optimal transport cost as regularization to obtain a\nshort-distance and interpretable transformation. The resulted transformation\nleads to more stable and accurate sample generation. We establish several\ntheoretical results for the proposed model and demonstrate its effectiveness\nwith low-dimensional illustrative examples as well as high-dimensional\ngenerative samples obtained through the forward and reverse flows.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:39:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiong","Zhe",""],["Ding","Qiaoqiao",""],["Zhang","Xiaoqun",""]]}
{"id":"2308.13816","submitter":"Antonio Briola","authors":"Antonio Briola, Yuanrong Wang, Silvia Bartolucci, Tomaso Aste","title":"Homological Convolutional Neural Networks","comments":"27 pages, 5 figures, 11 tables, 2 equations, 1 algorithm","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning methods have demonstrated outstanding performances on\nclassification and regression tasks on homogeneous data types (e.g., image,\naudio, and text data). However, tabular data still poses a challenge with\nclassic machine learning approaches being often computationally cheaper and\nequally effective than increasingly complex deep learning architectures. The\nchallenge arises from the fact that, in tabular data, the correlation among\nfeatures is weaker than the one from spatial or semantic relationships in\nimages or natural languages, and the dependency structures need to be modeled\nwithout any prior information. In this work, we propose a novel deep learning\narchitecture that exploits the data structural organization through\ntopologically constrained network representations to gain spatial information\nfrom sparse tabular data. The resulting model leverages the power of\nconvolutions and is centered on a limited number of concepts from network\ntopology to guarantee (i) a data-centric, deterministic building pipeline; (ii)\na high level of interpretability over the inference process; and (iii) an\nadequate room for scalability. We test our model on 18 benchmark datasets\nagainst 5 classic machine learning and 3 deep learning models demonstrating\nthat our approach reaches state-of-the-art performances on these challenging\ndatasets. The code to reproduce all our experiments is provided at\nhttps://github.com/FinancialComputingUCL/HomologicalCNN.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:48:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Briola","Antonio",""],["Wang","Yuanrong",""],["Bartolucci","Silvia",""],["Aste","Tomaso",""]]}
{"id":"2308.13817","submitter":"Laszlo Szalay","authors":"Kalman Gyory and Attila Petho and Laszlo Szalay","title":"Decomposable forms generated by linear recurrences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Consider $k\\ge 2$ distinct, linearly independent, homogeneous linear\nrecurrences of order $k$ satisfying the same recurrence relation. We prove that\nthe recurrences are related to a decomposable form of degree $k$, and there is\na very broad general identity with a suitable exponential expression depending\non the recurrences. This identity is a common and wide generalization of\nseveral known identities. Further, if the recurrences are integer sequences,\nthen the diophantine equation associated to the decomposable form and the\nexponential term has infinitely many integer solutions generated by the terms\nof the recurrences. We describe a method for the complete factorization of the\ndecomposable form. Both the form and its decomposition are explicitly given if\n$k=2$, and we present a typical example for $k=3$. The basic tool we use is the\nmatrix method.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 08:55:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gyory","Kalman",""],["Petho","Attila",""],["Szalay","Laszlo",""]]}
{"id":"2308.13818","submitter":"Zheng Li","authors":"Zheng Li, Xiaoyan Zhou, Zongze Li, Guanju Peng, Yuhao Guo, and Lin\n  Zhang","title":"Packet Header Recognition Utilizing an All-Optical Reservoir Based on\n  Reinforcement-Learning-Optimized Double-Ring Resonator","comments":"Journal of Selected Topics in Quantum Electronics (JSTQE),2023","journal-ref":null,"doi":"10.1109/JSTQE.2023.3307420","report-no":null,"categories":"eess.SP cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optical packet header recognition is an important signal processing task of\noptical communication networks. In this work, we propose an all-optical\nreservoir, consisting of integrated double-ring resonators (DRRs) as nodes, for\nfast and accurate optical packet header recognition. As the delay-bandwidth\nproduct (DBP) of the node is a key figure-of-merit in the reservoir, we adopt a\ndeep reinforcement learning algorithm to maximize the DBPs for various types of\nDRRs, which has the advantage of full parameter space optimization and fast\nconvergence speed. Intriguingly, the optimized DBPs of the DRRs in cascaded,\nparallel, and embedded configurations reach the same maximum value, which is\nbelieved to be the global maximum. Finally, 3-bit and 6-bit packet header\nrecognition tasks are performed with the all-optical reservoir consisting of\nthe optimized cascaded rings, which have greatly reduced chip size and the\ndesired \"flat-top\" delay spectra. Using this optical computing scheme,\nword-error rates as low as 5*10-4 and 9*10-4 are achieved for 3-bit and 6-bit\npacket header recognition tasks, respectively, which are one order of magnitude\nbetter than the previously reported values.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:00:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Zheng",""],["Zhou","Xiaoyan",""],["Li","Zongze",""],["Peng","Guanju",""],["Guo","Yuhao",""],["Zhang","Lin",""]]}
{"id":"2308.13819","submitter":"Pawan Goyal","authors":"Pawan Goyal and Igor Pontes Duff and Peter Benner","title":"Guaranteed Stable Quadratic Models and their applications in SINDy and\n  Operator Inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NA math.DS math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Scientific machine learning for learning dynamical systems is a powerful tool\nthat combines data-driven modeling models, physics-based modeling, and\nempirical knowledge. It plays an essential role in an engineering design cycle\nand digital twinning. In this work, we primarily focus on an operator inference\nmethodology that builds dynamical models, preferably in low-dimension, with a\nprior hypothesis on the model structure, often determined by known physics or\ngiven by experts. Then, for inference, we aim to learn the operators of a model\nby setting up an appropriate optimization problem. One of the critical\nproperties of dynamical systems is{stability. However, such a property is not\nguaranteed by the inferred models. In this work, we propose inference\nformulations to learn quadratic models, which are stable by design. Precisely,\nwe discuss the parameterization of quadratic systems that are locally and\nglobally stable. Moreover, for quadratic systems with no stable point yet\nbounded (e.g., Chaotic Lorenz model), we discuss an attractive trapping region\nphilosophy and a parameterization of such systems. Using those\nparameterizations, we set up inference problems, which are then solved using a\ngradient-based optimization method. Furthermore, to avoid numerical derivatives\nand still learn continuous systems, we make use of an integration form of\ndifferential equations. We present several numerical examples, illustrating the\npreservation of stability and discussing its comparison with the existing\nstate-of-the-art approach to infer operators. By means of numerical examples,\nwe also demonstrate how proposed methods are employed to discover governing\nequations and energy-preserving models.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:00:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Goyal","Pawan",""],["Duff","Igor Pontes",""],["Benner","Peter",""]]}
{"id":"2308.13820","submitter":"Qi Shen","authors":"Zichen Yuan, Qi Shen, Bingyi Zheng, Yuting Liu, Linying Jiang, Guibing\n  Guo","title":"Video and Audio are Images: A Cross-Modal Mixer for Original Data on\n  Video-Audio Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cross-modal retrieval has become popular in recent years, particularly with\nthe rise of multimedia. Generally, the information from each modality exhibits\ndistinct representations and semantic information, which makes feature tends to\nbe in separate latent spaces encoded with dual-tower architecture and makes it\ndifficult to establish semantic relationships between modalities, resulting in\npoor retrieval performance. To address this issue, we propose a novel framework\nfor cross-modal retrieval which consists of a cross-modal mixer, a masked\nautoencoder for pre-training, and a cross-modal retriever for downstream\ntasks.In specific, we first adopt cross-modal mixer and mask modeling to fuse\nthe original modality and eliminate redundancy. Then, an encoder-decoder\narchitecture is applied to achieve a fuse-then-separate task in the\npre-training phase.We feed masked fused representations into the encoder and\nreconstruct them with the decoder, ultimately separating the original data of\ntwo modalities. In downstream tasks, we use the pre-trained encoder to build\nthe cross-modal retrieval method. Extensive experiments on 2 real-world\ndatasets show that our approach outperforms previous state-of-the-art methods\nin video-audio matching tasks, improving retrieval accuracy by up to 2 times.\nFurthermore, we prove our model performance by transferring it to other\ndownstream tasks as a universal model.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:02:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Zichen",""],["Shen","Qi",""],["Zheng","Bingyi",""],["Liu","Yuting",""],["Jiang","Linying",""],["Guo","Guibing",""]]}
{"id":"2308.13821","submitter":"Zemin Liu","authors":"Zemin Liu, Yuan Li, Nan Chen, Qian Wang, Bryan Hooi, Bingsheng He","title":"A Survey of Imbalanced Learning on Graphs: Problems, Techniques, and\n  Future Directions","comments":"The collection of awesome literature on imbalanced learning on\n  graphs: https://github.com/Xtra-Computing/Awesome-Literature-ILoGs","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graphs represent interconnected structures prevalent in a myriad of\nreal-world scenarios. Effective graph analytics, such as graph learning\nmethods, enables users to gain profound insights from graph data, underpinning\nvarious tasks including node classification and link prediction. However, these\nmethods often suffer from data imbalance, a common issue in graph data where\ncertain segments possess abundant data while others are scarce, thereby leading\nto biased learning outcomes. This necessitates the emerging field of imbalanced\nlearning on graphs, which aims to correct these data distribution skews for\nmore accurate and representative learning outcomes. In this survey, we embark\non a comprehensive review of the literature on imbalanced learning on graphs.\nWe begin by providing a definitive understanding of the concept and related\nterminologies, establishing a strong foundational understanding for readers.\nFollowing this, we propose two comprehensive taxonomies: (1) the problem\ntaxonomy, which describes the forms of imbalance we consider, the associated\ntasks, and potential solutions; (2) the technique taxonomy, which details key\nstrategies for addressing these imbalances, and aids readers in their method\nselection process. Finally, we suggest prospective future directions for both\nproblems and techniques within the sphere of imbalanced learning on graphs,\nfostering further innovation in this critical area.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:11:44 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:31:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Zemin",""],["Li","Yuan",""],["Chen","Nan",""],["Wang","Qian",""],["Hooi","Bryan",""],["He","Bingsheng",""]]}
{"id":"2308.13822","submitter":"Wenxin Zhang","authors":"Santiago R. Balseiro, Will Ma, Wenxin Zhang","title":"Dynamic Pricing for Reusable Resources: The Power of Two Prices","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by real-world applications such as rental and cloud computing\nservices, we investigate pricing for reusable resources. We consider a system\nwhere a single resource with a fixed number of identical copies serves\ncustomers with heterogeneous willingness-to-pay (WTP), and the usage duration\ndistribution is general. Optimal dynamic policies are computationally\nintractable when usage durations are not memoryless, so existing literature has\nfocused on static pricing, whose steady-state reward rate converges to\noptimality at rate $\\mathcal{O}(c^{-1/2})$ when supply and demand scale with\n$c$. We show, however, that this convergence rate is suboptimal, and propose a\nclass of dynamic \"stock-dependent\" policies that 1) preserves computational\ntractability and 2) has a steady-state reward rate converging to optimality\nfaster than $c^{-1/2}$. We characterize the tight convergence rate for\nstock-dependent policies and show that they can in fact be achieved by a simple\ntwo-price policy, that sets a higher price when the stock is below some\nthreshold and a lower price otherwise. Finally, we demonstrate this \"minimally\ndynamic\" class of two-price policies to perform well numerically, even in\nnon-asymptotic settings, suggesting that a little dynamicity can go a long way.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:19:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Balseiro","Santiago R.",""],["Ma","Will",""],["Zhang","Wenxin",""]]}
{"id":"2308.13823","submitter":"Kian Wei Ng Mr","authors":"Kian Wei Ng, Yujia Gao, Shaheryar Mohammed Furqan, Zachery Yeo, Joel\n  Lau, Kee Yuan Ngiam, Eng Tat Khoo","title":"HoloPOCUS: Portable Mixed-Reality 3D Ultrasound Tracking, Reconstruction\n  and Overlay","comments":"Accepted in \"The 4th International Workshop of Advances in\n  Simplifying Medical UltraSound\" (ASMUS) - a workshop held in conjunction with\n  MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultrasound (US) imaging provides a safe and accessible solution to procedural\nguidance and diagnostic imaging. The effective usage of conventional 2D US for\ninterventional guidance requires extensive experience to project the image\nplane onto the patient, and the interpretation of images in diagnostics suffers\nfrom high intra- and inter-user variability. 3D US reconstruction allows for\nmore consistent diagnosis and interpretation, but existing solutions are\nlimited in terms of equipment and applicability in real-time navigation. To\naddress these issues, we propose HoloPOCUS - a mixed reality US system (MR-US)\nthat overlays rich US information onto the user's vision in a point-of-care\nsetting. HoloPOCUS extends existing MR-US methods beyond placing a US plane in\nthe user's vision to include a 3D reconstruction and projection that can aid in\nprocedural guidance using conventional probes. We validated a tracking pipeline\nthat demonstrates higher accuracy compared to existing MR-US works.\nFurthermore, user studies conducted via a phantom task showed significant\nimprovements in navigation duration when using our proposed methods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:28:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ng","Kian Wei",""],["Gao","Yujia",""],["Furqan","Shaheryar Mohammed",""],["Yeo","Zachery",""],["Lau","Joel",""],["Ngiam","Kee Yuan",""],["Khoo","Eng Tat",""]]}
{"id":"2308.13824","submitter":"Bendeg\\'uz Ny\\'ari","authors":"Bendeg\\'uz Ny\\'ari, Andr\\'as L\\'aszl\\'offy, G\\'abor Csire, L\\'aszl\\'o\n  Szunyogh and Bal\\'azs \\'Ujfalussy","title":"Topological superconductivity from first-principles I: Shiba band\n  structure and topological edge states of artificial spin chains","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic chains on superconductors hosting Majorna Zero Modes (MZMs)\nattracted high interest due to their possible applications in fault-tolerant\nquantum computing. However, this is hindered by the lack of a detailed,\nquantitative understanding of these systems. As a significant step forward, we\npresent a first-principles computational approach based on a microscopic\nrelativistic theory of inhomogeneous superconductors applied to an iron chain\non the top of Au-covered Nb(110) to study the Shiba band structure and the\ntopological nature of the edge states. Contrary to contemporary considerations,\nour method enables the introduction of quantities indicating band inversion\nwithout fitting parameters in realistic experimental settings, holding thus the\npower to determine the topological nature of zero energy edge states in an\naccurate ab-initio based description of the experimental systems. We confirm\nthat ferromagnetic Fe chains on Au/Nb(110) surface do not support any separated\nMZM; however, a broad range of spin-spirals can be identified with robust zero\nenergy edge states displaying signatures of MZMs. For these spirals, we explore\nthe structure of the superconducting order parameter shedding light on the\ninternally antisymmetric triplet pairing hosted by MZMs. We also reveal a\ntwo-fold effect of spin-orbit coupling: although it tends to enlarge the\ntopological phase regarding spin spiraling angles, however, it also extends the\nlocalization of MZMs. Due to the presented predictive power, our work fills a\nbig gap between the experimental efforts and theoretical models while paving\nthe way for engineering platforms for topological quantum computation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:33:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ny\u00e1ri","Bendeg\u00faz",""],["L\u00e1szl\u00f3ffy","Andr\u00e1s",""],["Csire","G\u00e1bor",""],["Szunyogh","L\u00e1szl\u00f3",""],["\u00dajfalussy","Bal\u00e1zs",""]]}
{"id":"2308.13825","submitter":"Xiaoran Liu Dr.","authors":"Zhaoqing Ding, Xuejiao Chen, Zhenzhen Wang, Qinghua Zhang, Fang Yang,\n  Jiachang Bi, Ting Lin, Zhen Wang, Xiaofeng Wu, Minghui Gu, Meng Meng, Yanwei\n  Cao, Lin Gu, Jiandi Zhang, Zhicheng Zhong, Xiaoran Liu, Jiandong Guo","title":"Magnetism and berry phase manipulation in an emergent structure of\n  perovskite ruthenate by (111) strain engineering","comments":null,"journal-ref":null,"doi":"10.1038/s41535-023-00576-5","report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interplay among symmetry of lattices, electronic correlations, and Berry\nphase of the Bloch states in solids has led to fascinating quantum phases of\nmatter. A prototypical system is the magnetic Weyl candidate SrRuO3, where\ndesigning and creating electronic and topological properties on artificial\nlattice geometry is highly demanded yet remains elusive. Here, we establish an\nemergent trigonal structure of SrRuO3 by means of heteroepitaxial strain\nengineering along the [111] crystallographic axis. Distinctive from bulk, the\ntrigonal SrRuO3 exhibits a peculiar XY-type ferromagnetic ground state, with\nthe coexistence of high-mobility holes likely from linear Weyl bands and\nlow-mobility electrons from normal quadratic bands as carriers. The presence of\nWeyl nodes are further corroborated by capturing intrinsic anomalous Hall\neffect, acting as momentum-space sources of Berry curvatures. The experimental\nobservations are consistent with our first-principles calculations, shedding\nlight on the detailed band topology of trigonal SrRuO3 with multiple pairs of\nWeyl nodes near the Fermi level. Our findings signify the essence of magnetism\nand Berry phase manipulation via lattice design and pave the way towards\nunveiling nontrivial correlated topological phenomena.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:34:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ding","Zhaoqing",""],["Chen","Xuejiao",""],["Wang","Zhenzhen",""],["Zhang","Qinghua",""],["Yang","Fang",""],["Bi","Jiachang",""],["Lin","Ting",""],["Wang","Zhen",""],["Wu","Xiaofeng",""],["Gu","Minghui",""],["Meng","Meng",""],["Cao","Yanwei",""],["Gu","Lin",""],["Zhang","Jiandi",""],["Zhong","Zhicheng",""],["Liu","Xiaoran",""],["Guo","Jiandong",""]]}
{"id":"2308.13826","submitter":"Waseem Akram","authors":"Waseem Akram, Muhayyuddin Ahmed, Lakmal Seneviratne and Irfan Hussain","title":"Evaluating Deep Learning Assisted Automated Aquaculture Net Pens\n  Inspection Using ROV","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In marine aquaculture, inspecting sea cages is an essential activity for\nmanaging both the facilities' environmental impact and the quality of the fish\ndevelopment process. Fish escape from fish farms into the open sea due to net\ndamage, which can result in significant financial losses and compromise the\nnearby marine ecosystem. The traditional inspection system in use relies on\nvisual inspection by expert divers or ROVs, which is not only laborious,\ntime-consuming, and inaccurate but also largely dependent on the level of\nknowledge of the operator and has a poor degree of verifiability. This article\npresents a robotic-based automatic net defect detection system for aquaculture\nnet pens oriented to on-ROV processing and real-time detection. The proposed\nsystem takes a video stream from an onboard camera of the ROV, employs a deep\nlearning detector, and segments the defective part of the image from the\nbackground under different underwater conditions. The system was first tested\nusing a set of collected images for comparison with the state-of-the-art\napproaches and then using the ROV inspection sequences to evaluate its\neffectiveness in real-world scenarios. Results show that our approach presents\nhigh levels of accuracy even for adverse scenarios and is adequate for\nreal-time processing on embedded platforms.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:35:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Akram","Waseem",""],["Ahmed","Muhayyuddin",""],["Seneviratne","Lakmal",""],["Hussain","Irfan",""]]}
{"id":"2308.13827","submitter":"Lasse Fischer","authors":"Lasse Fischer, Marta Bofill Roig and Werner Brannath","title":"An exhaustive ADDIS principle for online FWER control","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we consider online multiple testing with familywise error rate\n(FWER) control, where the probability of committing at least one type I error\nshall remain under control while testing a possibly infinite sequence of\nhypotheses over time. Currently, Adaptive-Discard (ADDIS) procedures seem to be\nthe most promising online procedures with FWER control in terms of power. Now,\nour main contribution is a uniform improvement of the ADDIS principle and thus\nof all ADDIS procedures. This means, the methods we propose reject as least as\nmuch hypotheses as ADDIS procedures and in some cases even more, while\nmaintaining FWER control. In addition, we show that our principle cannot be\nfurther uniformly improved. Finally, we apply the new principle to derive\nuniform improvements of the ADDIS-Spending and ADDIS-Graph.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:37:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fischer","Lasse",""],["Roig","Marta Bofill",""],["Brannath","Werner",""]]}
{"id":"2308.13828","submitter":"Marco Delbo","authors":"Marco Delbo, Chrysa Avdellidou, Kevin J. Walsh","title":"Gaia view of primitive inner-belt asteroid families: Searching for the\n  origins of asteroids Bennu and Ryugu","comments":"Accepted for publication in Astronomy and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Near-Earth asteroids Ryugu and Bennu, were visited, characterised, and\nsampled by the Hayabusa2 and OSIRIS-REx missions: remote sensing data and\nsample return analysis showed that both asteroids have primitive, hydrated and\norganic-rich compositions. The dark families of the inner main belt (IMB) that\nbelong to the spectroscopic C-complex have been claimed to be the sources of\nboth Ryugu and Bennu. Hence, there has been large effort to characterise them.\nHere we used the Gaia Data Release 3 (DR3) asteroid reflectance spectra to\ninvestigate the 11 known IMB C-complex families (Chaldaea, Chimaera, Clarissa,\nErigone, Eulalia, Klio, Polana, Primordial, Sulamitis, Svea, Tamara). For each\nfamily, we extracted the family members that have known geometric visible\nalbedo values and Gaia DR3 data and we created an average reflectance spectrum\nper family between 370 and 950 nm. The average DR3 reflectance spectra of each\nfamily were compared with the previous literature data and to Bennu's and\nRyugu's spectra. We found that DR3 reflectance spectra of the IMB C-complex\nfamilies are in general consistent with previous findings with the only\nexception of the Svea family. We also showed that the Polana and the Eulalia\nfamilies can be distinguished in the wavelength region 370 - 500 nm. Among all\nthe IMB C-complex families, we determined that the average reflectance spectra\nof the Eulalia and Polana families are the most similar to those of Bennu and\nRyugu, respectively. In particular, Eulalia family's average spectrum is a good\nmatch to Bennu's in the wavelength range 450 - 800 nm, while beyond 800 nm the\nspectrum of Bennu is bluer than that of Eulalia. Moreover, the spectrum of the\nPolana family has the smallest discrepancy against the spectrum of Ryugu,\nalthough this match is formally unsatisfactory (reduced chi^2 ~ 1.9).\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:38:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Delbo","Marco",""],["Avdellidou","Chrysa",""],["Walsh","Kevin J.",""]]}
{"id":"2308.13829","submitter":"Viktoriya Dik","authors":"V.M. Aynutdinov, V.A. Allakhverdyan, A.D. Avrorin, A.V. Avrorin, Z.\n  Barda\\v{c}ov\\'a, I.A. Belolaptikov, E.A. Bondarev, I.V. Borina, N.M. Budnev,\n  V.A. Chadymov, A.S. Chepurnov, V.Y. Dik, G.V. Domogatsky, A.A. Doroshenko, R.\n  Dvornick\\'y, A.N. Dyachok, Zh.-A.M. Dzhilkibaev, E. Eckerov\\'a, T.V. Elzhov,\n  L. Fajt, V.N. Fomin, A.R. Gafarov, K.V.Golubkov, N.S. Gorshkov, T. I. Gress,\n  K.G. Kebkal, I.V. Kharuk, E.V. Khramov, M.M. Kolbin, S.O. Koligaev, K.V.\n  Konischev, A.V. Korobchenko, A.P. Koshechkin, V.A. Kozhin, M.V. Kruglov, V.F.\n  Kulepov, Y.E. Lemeshev, M.B. Milenin, R.R. Mirgazov, D.V. Naumov, A.S.\n  Nikolaev, D.P. Petukhov, E.N. Pliskovsky, M.I. Rozanov, E.V. Ryabov, G.B.\n  Safronov, D. Seitova, B.A. Shaybonov, M.D. Shelepov, S.D. Shilkin, E.V.\n  Shirokov, F. \\v{S}imkovic, A.E. Sirenko, A.V. Skurikhin, A.G. Solovjev, M.N.\n  Sorokovikov, I. \\v{S}tekl, A.P. Stromakov, O.V. Suvorova, V.A. Tabolenko,\n  B.B. Ulzutuev, Y.V. Yablokova, D.N. Zaborov, S.I. Zavyalov, D.Y. Zvezdov","title":"Baikal-GVD Real-Time Data Processing and Follow-Up Analysis of GCN\n  Notices","comments":"9 pages, 5 figures","journal-ref":"PoS(ICRC2023)1458","doi":"10.22323/1.444.1458","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Baikal-GVD alert system was launched at the beginning of 2021. There are\nalerts for muon neutrinos (long upward-going track-like events) and all-flavour\nneutrinos (high-energy cascades). The system is able to get a preliminary\nresponse to external alerts with a temporal delay of about 3-10 minutes. The\nBaikal-GVD data processing and the results of the follow-up procedure are\ndescribed. We report on the analysis of the coincidence in time and direction\nbetween the Baikal-GVD cascade GVD20211208CA with an estimated energy of 43 TeV\nand the announced alert IceCube211208A possibly associated with a flaring state\nof the blazar PKS 0735+178.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:43:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aynutdinov","V. M.",""],["Allakhverdyan","V. A.",""],["Avrorin","A. D.",""],["Avrorin","A. V.",""],["Barda\u010dov\u00e1","Z.",""],["Belolaptikov","I. A.",""],["Bondarev","E. A.",""],["Borina","I. V.",""],["Budnev","N. M.",""],["Chadymov","V. A.",""],["Chepurnov","A. S.",""],["Dik","V. Y.",""],["Domogatsky","G. V.",""],["Doroshenko","A. A.",""],["Dvornick\u00fd","R.",""],["Dyachok","A. N.",""],["Dzhilkibaev","Zh. -A. M.",""],["Eckerov\u00e1","E.",""],["Elzhov","T. V.",""],["Fajt","L.",""],["Fomin","V. N.",""],["Gafarov","A. R.",""],["Golubkov","K. V.",""],["Gorshkov","N. S.",""],["Gress","T. I.",""],["Kebkal","K. G.",""],["Kharuk","I. V.",""],["Khramov","E. V.",""],["Kolbin","M. M.",""],["Koligaev","S. O.",""],["Konischev","K. V.",""],["Korobchenko","A. V.",""],["Koshechkin","A. P.",""],["Kozhin","V. A.",""],["Kruglov","M. V.",""],["Kulepov","V. F.",""],["Lemeshev","Y. E.",""],["Milenin","M. B.",""],["Mirgazov","R. R.",""],["Naumov","D. V.",""],["Nikolaev","A. S.",""],["Petukhov","D. P.",""],["Pliskovsky","E. N.",""],["Rozanov","M. I.",""],["Ryabov","E. V.",""],["Safronov","G. B.",""],["Seitova","D.",""],["Shaybonov","B. A.",""],["Shelepov","M. D.",""],["Shilkin","S. D.",""],["Shirokov","E. V.",""],["\u0160imkovic","F.",""],["Sirenko","A. E.",""],["Skurikhin","A. V.",""],["Solovjev","A. G.",""],["Sorokovikov","M. N.",""],["\u0160tekl","I.",""],["Stromakov","A. P.",""],["Suvorova","O. V.",""],["Tabolenko","V. A.",""],["Ulzutuev","B. B.",""],["Yablokova","Y. V.",""],["Zaborov","D. N.",""],["Zavyalov","S. I.",""],["Zvezdov","D. Y.",""]]}
{"id":"2308.13830","submitter":"Bin Shi","authors":"Bin Shi, Junjie Ma","title":"The Sampling Method for Optimal Precursors of ENSO Events","comments":"13 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph math.OC nlin.CD","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  El Ni\\~{n}o-Southern Oscillation (ENSO) is one of the significant climate\nphenomena, which appears periodically in the tropic Pacific. The intermediate\ncoupled ocean-atmosphere Zebiak-Cane (ZC) model is the first and classical one\ndesigned to numerically forecast the ENSO events. Traditionally, the\nconditional nonlinear optimal perturbation (CNOP) approach has been used to\ncapture optimal precursors in practice. In this paper, based on\nstate-of-the-art statistical machine learning techniques, we investigate the\nsampling algorithm proposed in [Shi and Sun, 2023] to obtain optimal precursors\nvia the CNOP approach in the ZC model. For the ZC model, or more generally, the\nnumerical models with dimension $\\mathrm{O}(10^4-10^5)$, the numerical\nperformance, regardless of the statically spatial patterns and the dynamical\nnonlinear time evolution behaviors as well as the corresponding quantities and\nindices, shows the high efficiency of the sampling method by comparison with\nthe traditional adjoint method. The sampling algorithm does not only reduce the\ngradient (first-order information) to the objective function value\n(zeroth-order information) but also avoids the use of the adjoint model, which\nis hard to develop in the coupled ocean-atmosphere models and the\nparameterization models. In addition, based on the key characteristic that the\nsamples are independently and identically distributed, we can implement the\nsampling algorithm by parallel computation to shorten the computation time.\nMeanwhile, we also show in the numerical experiments that the important\nfeatures of optimal precursors can be still captured even when the number of\nsamples is reduced sharply.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:44:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shi","Bin",""],["Ma","Junjie",""]]}
{"id":"2308.13831","submitter":"Bendeg\\'uz Ny\\'ari","authors":"Andr\\'as L\\'aszl\\'offy, Bendeg\\'uz Ny\\'ari, G\\'abor Csire, L\\'aszl\\'o\n  Szunyogh and Bal\\'azs \\'Ujfalussy","title":"Topological superconductivity from first-principles II: Effects from\n  manipulation of spin spirals $-$ Topological fragmentation, braiding, and\n  Quasi-Majorana Bound States","comments":"12 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent advances in electron spin resonance techniques have allowed the\nmanipulation of the spin of individual atoms, making magnetic atomic chains on\nsuperconducting hosts one of the most promising platform where topological\nsuperconductivity can be engineered. Motivated by this progress, we provide a\ndetailed, quantitative description of the effects of manipulating spins in\nrealistic nanowires by applying a first-principles-based computational approach\nto a recent experiment: an iron chain deposited on top of Au/Nb\nheterostructure. As a continuation of the first part of the paper\nexperimentally relevant computational experiments are performed in spin spiral\nchains that shed light on several concerns about practical applications and add\nnew aspects to the interpretation of recent experiments. We explore the\nstability of topological zero energy states, the formation and distinction of\ntopologically trivial and non-trivial zero energy edge states, the effect of\nlocal changes in the exchange fields, the emergence of topological\nfragmentation, and the shift of Majorana Zero Modes along the superconducting\nnanowires opening avenues toward the implementation of a braiding operation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:44:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["L\u00e1szl\u00f3ffy","Andr\u00e1s",""],["Ny\u00e1ri","Bendeg\u00faz",""],["Csire","G\u00e1bor",""],["Szunyogh","L\u00e1szl\u00f3",""],["\u00dajfalussy","Bal\u00e1zs",""]]}
{"id":"2308.13832","submitter":"Hiroaki Yamada","authors":"Hiroaki S. Yamada and Kensuke S. Ikeda","title":"Quantum Diffusion Induced by Small Quantum Chaos","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is demonstrated that quantum systems classically exhibiting strong and\nhomogeneous chaos in a bounded region of the phase space can induce a global\nquantum diffusion. As an ideal model system, a small quantum chaos with finite\nHilbert space dimension $N$ weakly coupled with $M$ additional degrees of\nfreedom which is approximated by linear systems is proposed. By twinning the\nsystem, the diffusion process in the additional modes can be numerically\ninvestigated without taking the unbounded diffusion space into account\nexplicitly. Even though $N$ is not very large, diffusion occurs in the\nadditional modes as the coupling strength increases if $M \\geq 3$. If $N$ is\nlarge enough, a definite quantum transition to diffusion takes place through a\ncritical sub-diffusion characterized by an anomalous diffusion exponent.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:47:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yamada","Hiroaki S.",""],["Ikeda","Kensuke S.",""]]}
{"id":"2308.13833","submitter":"Shoaib Ahmed","authors":"Shoaib Ahmed, Sayonto Khan, Kumudu S. Munasinghe, and Md. Farhad\n  Hossain","title":"A Cognitive Network Architecture for Vehicle-to-Network (V2N)\n  Communications over Smart Meters for URLLC","comments":"12 pages, 19 figures, IEEE format","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rapid advancement of smart city infrastructure, vehicle-to-network\n(V2N) communication has emerged as a crucial technology to enable intelligent\ntransportation systems (ITS). The investigation of new methods to improve V2N\ncommunications is sparked by the growing need for high-speed and dependable\ncommunications in vehicular networks. To achieve ultra-reliable low latency\ncommunication (URLLC) for V2N scenarios, we propose a smart meter (SM)-based\ncognitive network (CN) architecture for V2N communications. Our scheme makes\nuse of SMs' available underutilized time resources to let them serve as\ndistributed access points (APs) for V2N communications to increase reliability\nand decrease latency. We propose and investigate two algorithms for efficiently\nassociating vehicles with the appropriate SMs. Extensive simulations are\ncarried out for comprehensive performance evaluation of our proposed\narchitecture and algorithms under diverse system scenarios. Performance is\ninvestigated with particular emphasis on communication latency and reliability,\nwhich are also compared with the conventional base station (BS)-based V2N\narchitecture for further validation. The results highlight the value of\nincorporating SMs into the current infrastructure and open the door for future\nITSs to utilize more effective and dependable V2N communications.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:47:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ahmed","Shoaib",""],["Khan","Sayonto",""],["Munasinghe","Kumudu S.",""],["Hossain","Md. Farhad",""]]}
{"id":"2308.13834","submitter":"Mustapha Maamache","authors":"Mustapha Maamache","title":"On the {\\eta} pseudo PT symmetry theory for non-Hermitian Hamiltonians:\n  time-dependent systems","comments":"11 pages, Minor correction in the list and name of authors in\n  references","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the context of non-Hermitian quantum mechanics, many systems are known to\npossess a pseudo PT symmetry , i.e. the non-Hermitian Hamiltonian H is related\nto its adjoint H^{{\\dag}} via the relation, H^{{\\dag}}=PTHPT . We propose a\nderivation of pseudo PT symmetry and {\\eta} -pseudo-Hermiticity simultaneously\nfor the time dependent non-Hermitian Hamiltonians by intoducing a new metric\n{\\eta}(t)=PT{\\eta}(t) that not satisfy the time-dependent quasi-Hermiticity\nrelation but obeys the Heisenberg evolution equation. Here, we solve the\nSU(1,1) time-dependent non-Hermitian Hamiltonian and we construct a\ntime-dependent solutions by employing this new metric and discuss a concrete\nphysical applications of our results.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:57:33 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 06:41:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Maamache","Mustapha",""]]}
{"id":"2308.13835","submitter":"Pawan Goyal","authors":"Pawan Goyal and S\\\"uleyman Y{\\i}ld{\\i}z and Peter Benner","title":"Deep Learning for Structure-Preserving Universal Stable Koopman-Inspired\n  Embeddings for Nonlinear Canonical Hamiltonian Dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Discovering a suitable coordinate transformation for nonlinear systems\nenables the construction of simpler models, facilitating prediction, control,\nand optimization for complex nonlinear systems. To that end, Koopman operator\ntheory offers a framework for global linearization for nonlinear systems,\nthereby allowing the usage of linear tools for design studies. In this work, we\nfocus on the identification of global linearized embeddings for canonical\nnonlinear Hamiltonian systems through a symplectic transformation. While this\ntask is often challenging, we leverage the power of deep learning to discover\nthe desired embeddings. Furthermore, to overcome the shortcomings of Koopman\noperators for systems with continuous spectra, we apply the lifting principle\nand learn global cubicized embeddings. Additionally, a key emphasis is paid to\nenforce the bounded stability for the dynamics of the discovered embeddings. We\ndemonstrate the capabilities of deep learning in acquiring compact symplectic\ncoordinate transformation and the corresponding simple dynamical models,\nfostering data-driven learning of nonlinear canonical Hamiltonian systems, even\nthose with continuous spectra.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 09:58:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Goyal","Pawan",""],["Y\u0131ld\u0131z","S\u00fcleyman",""],["Benner","Peter",""]]}
{"id":"2308.13836","submitter":"Aljoscha Meyer MSc","authors":"Aljoscha Meyer","title":"SoK: Authenticated Prefix Relations -- A Unified Perspective On Relative\n  Time-Stamping and Append-Only Logs","comments":"16 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Secure relative timestamping and secure append-only logs are two historically\nmostly independent lines of research, which we show to be sides of the same\ncoin -- the authentication of prefix relations. From this more general\nviewpoint, we derive several complexity criteria not yet considered in previous\nliterature. We define transitive prefix authentication graphs, a graph class\nthat captures all hash-based timestamping and log designs we know of. We survey\nexisting schemes by expressing them as transitive prefix authentication graphs,\nwhich yields more compact definitions and more complete evaluations than in the\nexisting literature.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:04:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meyer","Aljoscha",""]]}
{"id":"2308.13837","submitter":"Linhao Meng","authors":"Linhao Meng, Stef van den Elzen, Nicola Pezzotti, and Anna Vilanova","title":"Class-constrained t-SNE: Combining Data Features and Class Probabilities","comments":"to appear at IEEE VIS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Data features and class probabilities are two main perspectives when, e.g.,\nevaluating model results and identifying problematic items. Class probabilities\nrepresent the likelihood that each instance belongs to a particular class,\nwhich can be produced by probabilistic classifiers or even human labeling with\nuncertainty. Since both perspectives are multi-dimensional data, dimensionality\nreduction (DR) techniques are commonly used to extract informative\ncharacteristics from them. However, existing methods either focus solely on the\ndata feature perspective or rely on class probability estimates to guide the DR\nprocess. In contrast to previous work where separate views are linked to\nconduct the analysis, we propose a novel approach, class-constrained t-SNE,\nthat combines data features and class probabilities in the same DR result.\nSpecifically, we combine them by balancing two corresponding components in a\ncost function to optimize the positions of data points and iconic\nrepresentation of classes -- class landmarks. Furthermore, an interactive\nuser-adjustable parameter balances these two components so that users can focus\non the weighted perspectives of interest and also empowers a smooth visual\ntransition between varying perspectives to preserve the mental map. We\nillustrate its application potential in model evaluation and visual-interactive\nlabeling. A comparative analysis is performed to evaluate the DR results.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:05:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meng","Linhao",""],["Elzen","Stef van den",""],["Pezzotti","Nicola",""],["Vilanova","Anna",""]]}
{"id":"2308.13838","submitter":"Han Zhang","authors":"Han Zhang, Halvin Yang and Guopeng Zhang","title":"Price-Discrimination Game for Distributed Resource Management in\n  Federated Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In vanilla federated learning (FL) such as FedAvg, the parameter server (PS)\nand multiple distributed clients can form a typical buyer's market, where the\nnumber of PS/buyers of FL services is far less than the number of\nclients/sellers. In order to improve the performance of FL and reduce the cost\nof motivating clients to participate in FL, this paper proposes to\ndifferentiate the pricing for services provided by different clients rather\nthan simply providing the same service pricing for different clients. The price\nis differentiated based on the performance improvements brought to FL and their\nheterogeneity in computing and communication capabilities. To this end, a\nprice-discrimination game (PDG) is formulated to comprehensively address the\ndistributed resource management problems in FL, including multi-objective\ntrade-off, client selection, and incentive mechanism. As the PDG is a\nmixed-integer nonlinear programming (MINLP) problem, a distributed\nsemi-heuristic algorithm with low computational complexity and low\ncommunication overhead is designed to solve it. The simulation result verifies\nthe effectiveness of the proposed approach.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:09:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Han",""],["Yang","Halvin",""],["Zhang","Guopeng",""]]}
{"id":"2308.13839","submitter":"Guopeng Li","authors":"Guopeng Li, Yiru Jiao, Simeon C. Calvert, J.W.C. van Lint","title":"A Comparative Conflict Resolution Dataset Derived from Argoverse-2:\n  Scenarios with vs. without Autonomous Vehicles","comments":"7 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  As the deployment of autonomous vehicles (AVs) becomes increasingly\nprevalent, ensuring safe and smooth interactions between AVs and other human\nagents is of critical importance. In the urban environment, how vehicles\nresolve conflicts has significant impacts on both driving safety and traffic\nefficiency. To expedite the studies on evaluating conflict resolution in\nAV-involved and AV-free scenarios at intersections, this paper presents a\nhigh-quality dataset derived from the open Argoverse-2 motion forecasting data.\nFirst, scenarios of interest are selected by applying a set of heuristic rules\nregarding post-encroachment time (PET), minimum distance, trajectory crossing,\nand speed variation. Next, the quality of the raw data is carefully examined.\nWe found that position and speed data are not consistent in Argoverse-2 data\nand its improper processing induced unnecessary errors. To address these\nspecific problems, we propose and apply a data processing pipeline to correct\nand enhance the raw data. As a result, 5k+ AV-involved scenarios and 16k+\nAV-free scenarios with smooth and consistent position, speed, acceleration, and\nheading direction data are obtained. Further assessments show that this dataset\ncomprises diverse and balanced conflict resolution regimes. This informative\ndataset provides a valuable resource for researchers and practitioners in the\nfield of autonomous vehicle assessment and regulation. The dataset is openly\navailable via https://github.com/RomainLITUD/conflict_resolution_dataset.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:15:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Guopeng",""],["Jiao","Yiru",""],["Calvert","Simeon C.",""],["van Lint","J. W. C.",""]]}
{"id":"2308.13840","submitter":"Moaad Khamlich","authors":"Moaad Khamlich and Federico Pichi and Gianluigi Rozza","title":"Optimal Transport-inspired Deep Learning Framework for Slow-Decaying\n  Problems: Exploiting Sinkhorn Loss and Wasserstein Kernel","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.LG cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reduced order models (ROMs) are widely used in scientific computing to tackle\nhigh-dimensional systems. However, traditional ROM methods may only partially\ncapture the intrinsic geometric characteristics of the data. These\ncharacteristics encompass the underlying structure, relationships, and\nessential features crucial for accurate modeling.\n  To overcome this limitation, we propose a novel ROM framework that integrates\noptimal transport (OT) theory and neural network-based methods. Specifically,\nwe investigate the Kernel Proper Orthogonal Decomposition (kPOD) method\nexploiting the Wasserstein distance as the custom kernel, and we efficiently\ntrain the resulting neural network (NN) employing the Sinkhorn algorithm. By\nleveraging an OT-based nonlinear reduction, the presented framework can capture\nthe geometric structure of the data, which is crucial for accurate learning of\nthe reduced solution manifold. When compared with traditional metrics such as\nmean squared error or cross-entropy, exploiting the Sinkhorn divergence as the\nloss function enhances stability during training, robustness against\noverfitting and noise, and accelerates convergence.\n  To showcase the approach's effectiveness, we conduct experiments on a set of\nchallenging test cases exhibiting a slow decay of the Kolmogorov n-width. The\nresults show that our framework outperforms traditional ROM methods in terms of\naccuracy and computational efficiency.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:24:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khamlich","Moaad",""],["Pichi","Federico",""],["Rozza","Gianluigi",""]]}
{"id":"2308.13841","submitter":"Wanrong He","authors":"Wanrong He, Mitchell L. Gordon, Lindsay Popowski, Michael S. Bernstein","title":"Cura: Curation at Social Media Scale","comments":"CSCW 2023","journal-ref":null,"doi":"10.1145/3610186","report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How can online communities execute a focused vision for their space? Curation\noffers one approach, where community leaders manually select content to share\nwith the community. Curation enables leaders to shape a space that matches\ntheir taste, norms, and values, but the practice is often intractable at social\nmedia scale: curators cannot realistically sift through hundreds or thousands\nof submissions daily. In this paper, we contribute algorithmic and interface\nfoundations enabling curation at scale, and manifest these foundations in a\nsystem called Cura. Our approach draws on the observation that, while curators'\nattention is limited, other community members' upvotes are plentiful and\ninformative of curators' likely opinions. We thus contribute a\ntransformer-based curation model that predicts whether each curator will upvote\na post based on previous community upvotes. Cura applies this curation model to\ncreate a feed of content that it predicts the curator would want in the\ncommunity. Evaluations demonstrate that the curation model accurately estimates\nopinions of diverse curators, that changing curators for a community results in\nclearly recognizable shifts in the community's content, and that, consequently,\ncuration can reduce anti-social behavior by half without extra moderation\neffort. By sampling different types of curators, Cura lowers the threshold to\ngenres of curated social media ranging from editorial groups to stakeholder\nroundtables to democracies.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:25:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["He","Wanrong",""],["Gordon","Mitchell L.",""],["Popowski","Lindsay",""],["Bernstein","Michael S.",""]]}
{"id":"2308.13842","submitter":"Seonwoo Kim","authors":"Seonwoo Kim","title":"Hierarchical structure of metastability in the reversible inclusion\n  process: third time scale and complete characterization","comments":"59 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article, we study the hierarchical structure of metastability in the\nreversible inclusion process. We fully characterize the third time scale of\nmetastability subject to any underlying geometry of the system and prove that\nthis is the last time scale. We also demonstrate that there are no other\nmeaningful time scales except the three identified ones. This work completes\nthe verification of the conjecture made in [7] which was partially resolved on\nthe first time scale in [7] and on the second time scale in [25]. Main tools\nare potential-theoretic approach and martingale approach to metastability; we\nthoroughly investigate the highly-complicated energy landscape of the system to\nconstruct suitable test objects to provide sharp asymptotics on capacities.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:25:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Seonwoo",""]]}
{"id":"2308.13843","submitter":"Pavel Gevorgyan","authors":"Pavel S. Gevorgyan and I. Pop","title":"Shape dimension of maps","comments":"8 pages","journal-ref":"Bul. Acad. \\c{S}tiin\\c{t}e Repub. Mold. Mat., 86:1, 3-11 (2018)","doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we define a numerical shape invariant of a continuous map\ncalled shape dimension of a map, which generalizes the shape dimension of a\ntopological space. Some basic properties and applications of this invariant are\ngiven. The question of raising the shape dimension by shape finite-dimensional\nmaps is solved. An example of a shape finite-dimensional surjective map between\nshape infinite-dimensional spaces is given.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:28:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gevorgyan","Pavel S.",""],["Pop","I.",""]]}
{"id":"2308.13844","submitter":"Zihao Zhou","authors":"Jie Yao, Zihao Zhou, Qiufeng Wang","title":"Solving Math Word Problem with Problem Type Classification","comments":"Accpected by NLPCC2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Math word problems (MWPs) require analyzing text descriptions and generating\nmathematical equations to derive solutions. Existing works focus on solving\nMWPs with two types of solvers: tree-based solver and large language model\n(LLM) solver. However, these approaches always solve MWPs by a single solver,\nwhich will bring the following problems: (1) Single type of solver is hard to\nsolve all types of MWPs well. (2) A single solver will result in poor\nperformance due to over-fitting. To address these challenges, this paper\nutilizes multiple ensemble approaches to improve MWP-solving ability. Firstly,\nWe propose a problem type classifier that combines the strengths of the\ntree-based solver and the LLM solver. This ensemble approach leverages their\nrespective advantages and broadens the range of MWPs that can be solved.\nFurthermore, we also apply ensemble techniques to both tree-based solver and\nLLM solver to improve their performance. For the tree-based solver, we propose\nan ensemble learning framework based on ten-fold cross-validation and voting\nmechanism. In the LLM solver, we adopt self-consistency (SC) method to improve\nanswer selection. Experimental results demonstrate the effectiveness of these\nensemble approaches in enhancing MWP-solving ability. The comprehensive\nevaluation showcases improved performance, validating the advantages of our\nproposed approach. Our code is available at this url:\nhttps://github.com/zhouzihao501/NLPCC2023-Shared-Task3-ChineseMWP.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:35:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yao","Jie",""],["Zhou","Zihao",""],["Wang","Qiufeng",""]]}
{"id":"2308.13845","submitter":"Neha","authors":"Neha, Nikita Dhankhar, Raul Sheldon Pinto, Rakesh Choubisa","title":"Laser-assisted (e,2e) study with twisted electron beam on H-atom","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We study the laser-assisted twisted electron beam impact ionization of the\nhydrogen atom in coplanar asymmetric geometry. We develope the theoretical\nmodel in the first Born approximation. In the presence of the laser field, we\ntreat the incident and scattered electrons as Volkov waves, the ejected\nelectron, moving in the combined field of the laser and residual ion H + , is\ndescribed by a Coulomb-Volkov wave function . In this communication, we compare\nthe angular profile of triple differential cross-section (TDCS) for\nlaser-assisted twisted electron beam incidence with the plane-wave,\nlaser-assisted plane wave, and field-free twisted electron beam for (e,2e)\nprocesses, for different orbital angular momentum (OAM) number (m l ) values.\nWe analyze the influence of the laser parameters (photon exchanged, intensity )\non the angular distribution of the TDCS. We study the (T DCS) av for\nmacroscopic target to examine the effect of opening angle {\\theta} p of the\ntwisted electron beam on the angular profile of TDCS. Our results clearly show\nthe impact of laser parameters (electric field ? and number of photon exchanged\n(l)) and twisted electron beam parameters (OAM number (m l ) and opening angle\n({\\theta} p )) on the angular distribution of TDCS.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:46:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Neha","",""],["Dhankhar","Nikita",""],["Pinto","Raul Sheldon",""],["Choubisa","Rakesh",""]]}
{"id":"2308.13846","submitter":"H{\\aa}kon R{\\o}st","authors":"H{\\aa}kon I. R{\\o}st, Simon P. Cooil, Anna Cecilie {\\AA}sland, Jinbang\n  Hu, Ayaz Ali, Takashi Taniguchi, Kenji Watanabe, Branson D. Belle, Bodil\n  Holst, Jerzy T. Sadowski, Federico Mazzola and Justin W. Wells","title":"Phonon-Mediated Quasiparticle Lifetime Renormalizations in Few-Layer\n  Hexagonal Boron Nitride","comments":"This document is the unedited Author's version of a Submitted Work\n  that was subsequently accepted for publication in Nano Letters, copyright\n  $\\copyright$ 2022 The Authors, licensed under CC-BY 4.0 after peer review. To\n  access the final edited and published work see\n  https://doi.org/10.1021/acs.nanolett.3c02086","journal-ref":"Nano Lett. 23, 16 (2023), 7539-7545","doi":"10.1021/acs.nanolett.3c02086","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding the collective behavior of the quasiparticles in solid-state\nsystems underpins the field of non-volatile electronics, including the\nopportunity to control many-body effects for well-desired physical phenomena\nand their applications. Hexagonal boron nitride (hBN) is a wide energy bandgap\nsemiconductor, showing immense potential as a platform for low-dimensional\ndevice heterostructures. It is an inert dielectric used for gated devices,\nhaving a negligible orbital hybridization when placed in contact with other\nsystems. Despite its inertness, we discover a large electron mass enhancement\nin few-layer hBN affecting the lifetime of the $\\pi$-band states. We show that\nthe renormalization is phonon-mediated and consistent with both single- and\nmultiple-phonon scattering events. Our findings thus unveil a so-far unknown\nmany-body state in a wide-bandgap insulator, having important implications for\ndevices using hBN as one of their building blocks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:47:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["R\u00f8st","H\u00e5kon I.",""],["Cooil","Simon P.",""],["\u00c5sland","Anna Cecilie",""],["Hu","Jinbang",""],["Ali","Ayaz",""],["Taniguchi","Takashi",""],["Watanabe","Kenji",""],["Belle","Branson D.",""],["Holst","Bodil",""],["Sadowski","Jerzy T.",""],["Mazzola","Federico",""],["Wells","Justin W.",""]]}
{"id":"2308.13847","submitter":"Jose E Amaro","authors":"V. L. Martinez-Consentino and J.E. Amaro","title":"Charged-current quasielastic neutrino scattering from $^{12}$C in an\n  extended superscaling model with two-nucleon emission","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The quasielastic cross-section of charged-current neutrino and antineutrino\nscattering on $^{12}$C is calculated using an improved superscaling model with\nrelativistic effective mass. Our model encompasses two-particle emission\ninduced by neutrinos, which we distinguish into two contributions. The first\ncontribution arises from meson-exchange currents, and its calculation is\nperformed at a microscopic level. The second contribution is phenomenological\nand extracted from the high-energy tail of the scaling function, assumed to be\nproduced by 2p2h mechanisms where the one-body current plays a role, such as\nshort-range correlations and interferences with MEC, final-state interaction,\netc. The model explicitly includes the modification of the relativistic\neffective mass of the nucleon within the relativistic mean field model of\nnuclear matter. The meson exchange currents are also consistently calculated\nwithin the same model. With this model, we present predictions for the neutrino\nand antineutrino cross sections of $^{12}$C that have been measured in\naccelerator experiments.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:53:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Martinez-Consentino","V. L.",""],["Amaro","J. E.",""]]}
{"id":"2308.13848","submitter":"Nikita Shanin","authors":"Nikita Shanin and Hedieh Ajam and Vasilis K. Papanikolaou and Laura\n  Cottatellucci and Robert Schober","title":"Accurate EH Modelling and Achievable Information Rate for SLIPT Systems\n  with Multi-Junction Photovoltaic Receivers","comments":"13 pages, 10 figures, submitted for possible IEEE journal\n  publication. arXiv admin note: text overlap with arXiv:2305.03524","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we study optical simultaneous lightwave information and power\ntransfer (SLIPT) systems employing photovoltaic optical receivers (RXs). To be\nable to efficiently harvest energy from broadband light, we propose to employ\nmulti-junction photovoltaic cells at the optical RX. We consider the case,\nwhere the optical RX is illuminated by ambient light, an intensity-modulated\ninformation free space optical (FSO) signal, and since the ambient light may\nnot be always present, a dedicated energy-providing broadband optical signal.\nBased on the analysis of the equivalent electrical circuit of the\nmulti-junction photovoltaic RX, we model the current flow through the\nphotovoltaic cell and derive a novel accurate and two novel approximate energy\nharvesting (EH) models for the two cases, where the optical RX is equipped with\na single and multiple p-n junctions, respectively. We derive the optimal\ndistribution of the transmit information signal that maximizes the achievable\ninformation rate. We validate the proposed EH models by circuit simulations and\nshow that the photovoltaic RXs saturate for high received signal powers. For\nsingle-junction RXs, we compare the proposed EH model with two well-known\nbaseline models and demonstrate that, in contrast to the proposed EH model,\nthey are not able to fully capture the RX non-linearity. Since multi-junction\nRXs allow a more efficient allocation of the optical power, they are more\nrobust against saturation, and thus, are able to harvest significantly more\npower and achieve higher data rates than RXs employing a single p-n junction.\nFinally, we highlight a tradeoff between the information rate and harvested\npower in SLIPT systems and demonstrate that the proposed optimal distribution\nyields significantly higher achievable information rates compared to uniformly\ndistributed transmit signals, which are optimal for linear optical information\nRXs.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:57:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shanin","Nikita",""],["Ajam","Hedieh",""],["Papanikolaou","Vasilis K.",""],["Cottatellucci","Laura",""],["Schober","Robert",""]]}
{"id":"2308.13849","submitter":"Xiucheng Wang","authors":"Jinglong Shen, Xiucheng Wang, Nan Cheng, Longfei Ma, Conghao Zhou,\n  Yuan Zhang","title":"Effectively Heterogeneous Federated Learning: A Pairing and Split\n  Learning Based Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As a promising paradigm federated Learning (FL) is widely used in\nprivacy-preserving machine learning, which allows distributed devices to\ncollaboratively train a model while avoiding data transmission among clients.\nDespite its immense potential, the FL suffers from bottlenecks in training\nspeed due to client heterogeneity, leading to escalated training latency and\nstraggling server aggregation. To deal with this challenge, a novel split\nfederated learning (SFL) framework that pairs clients with different\ncomputational resources is proposed, where clients are paired based on\ncomputing resources and communication rates among clients, meanwhile the neural\nnetwork model is split into two parts at the logical level, and each client\nonly computes the part assigned to it by using the SL to achieve forward\ninference and backward training. Moreover, to effectively deal with the client\npairing problem, a heuristic greedy algorithm is proposed by reconstructing the\noptimization of training latency as a graph edge selection problem. Simulation\nresults show the proposed method can significantly improve the FL training\nspeed and achieve high performance both in independent identical distribution\n(IID) and Non-IID data distribution.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:10:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shen","Jinglong",""],["Wang","Xiucheng",""],["Cheng","Nan",""],["Ma","Longfei",""],["Zhou","Conghao",""],["Zhang","Yuan",""]]}
{"id":"2308.13850","submitter":"Wei Wei","authors":"Yunfei Peng and Wei Wei","title":"Solutions to Equilibrium HJB Equations for Time-Inconsistent\n  Deterministic Linear Quadratic Control: Characterization and Uniqueness","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC q-fin.MF","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we study a class of HJB equations which solve for equilibria\nfor general time-inconsistent deterministic linear quadratic control problems\nwithin the intra-personal game theoretic framework, where the inconsistency\narises from non-exponential discount functions. We characterize the solutions\nto the HJB equations using a class of Riccati equations with integral terms. By\nstudying the uniqueness of solutions to the integro-differential Riccati\nequations, we prove the uniqueness of solutions to the equilibrium HJB\nequations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:12:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Peng","Yunfei",""],["Wei","Wei",""]]}
{"id":"2308.13851","submitter":"Jinrun Liu","authors":"Jinrun Liu, Xinyu Tang, Linlin Li, Panpan Chen, Yepang Liu","title":"Which is a better programming assistant? A comparative study between\n  chatgpt and stack overflow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Programmers often seek help from Q\\&A websites to resolve issues they\nencounter during programming. Stack Overflow has been a widely used platform\nfor this purpose for over a decade. Recently, revolutionary AI-powered\nplatforms like ChatGPT have quickly gained popularity among programmers for\ntheir efficient and personalized programming assistance via natural language\ninteractions. Both platforms can offer valuable assistance to programmers, but\nit's unclear which is more effective at enhancing programmer productivity. In\nour paper, we conducted an exploratory user study to compare the performance of\nStack Overflow and ChatGPT in enhancing programmer productivity. Two groups of\nstudents with similar programming abilities were instructed to use the two\nplatforms to solve three different types of programming tasks: algorithmic\nchallenges, library usage, and debugging. During the experiments, we measured\nand compared the quality of code produced and the time taken to complete tasks\nfor the two groups. The results show that, concerning code quality, ChatGPT\noutperforms Stack Overflow significantly in helping complete algorithmic and\nlibrary-related tasks, while Stack Overflow is better for debugging tasks.\nRegarding task completion speed, the ChatGPT group is obviously faster than the\nStack Overflow group in the algorithmic challenge, but the two groups have a\nsimilar performance in the other two tasks. Additionally, we conducted a\npost-experiment survey with the participants to understand how the platforms\nhave helped them complete the programming tasks. We analyzed the questionnaires\nto summarize ChatGPT and Stack Overflow's strengths and weaknesses pointed out\nby the participants. By comparing these, we identified the reasons behind the\ntwo platforms' divergent performances in programming assistance.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:25:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Jinrun",""],["Tang","Xinyu",""],["Li","Linlin",""],["Chen","Panpan",""],["Liu","Yepang",""]]}
{"id":"2308.13852","submitter":"Rahul Shastri K","authors":"Rahul Shastri and B. Prasanna Venkatesh","title":"Controlling Work Output and Coherence in Finite Time Quantum Otto\n  Engines Through Monitoring","comments":"13 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the role of diagnostic quantum measurements on the work statistics\nof a finite-time quantum Otto heat engine operated in the steady-state. We\nconsider three pointer-based measurement schemes that differ in the number of\nsystem-pointer interactions and pointer measurements. We show that the\ncoherence of the working substance and the work output of the engine can be\ncontrolled by tuning the monitoring measurements. Moreover, for a working\nsubstance consisting of a two-level system we show that while all three schemes\nreproduce the predictions of the cycle without any monitoring for the average\nwork in the limit of infinitely weak measurement, only two of the schemes can\nreproduce the two-point projective measurement results in the limit of strong\nmeasurement.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:30:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shastri","Rahul",""],["Venkatesh","B. Prasanna",""]]}
{"id":"2308.13853","submitter":"Yutao Hu","authors":"Yutao Hu, Qixiong Wang, Wenqi Shao, Enze Xie, Zhenguo Li, Jungong Han,\n  Ping Luo","title":"Beyond One-to-One: Rethinking the Referring Image Segmentation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Referring image segmentation aims to segment the target object referred by a\nnatural language expression. However, previous methods rely on the strong\nassumption that one sentence must describe one target in the image, which is\noften not the case in real-world applications. As a result, such methods fail\nwhen the expressions refer to either no objects or multiple objects. In this\npaper, we address this issue from two perspectives. First, we propose a Dual\nMulti-Modal Interaction (DMMI) Network, which contains two decoder branches and\nenables information flow in two directions. In the text-to-image decoder, text\nembedding is utilized to query the visual feature and localize the\ncorresponding target. Meanwhile, the image-to-text decoder is implemented to\nreconstruct the erased entity-phrase conditioned on the visual feature. In this\nway, visual features are encouraged to contain the critical semantic\ninformation about target entity, which supports the accurate segmentation in\nthe text-to-image decoder in turn. Secondly, we collect a new challenging but\nrealistic dataset called Ref-ZOM, which includes image-text pairs under\ndifferent settings. Extensive experiments demonstrate our method achieves\nstate-of-the-art performance on different datasets, and the Ref-ZOM-trained\nmodel performs well on various types of text inputs. Codes and datasets are\navailable at https://github.com/toggle1995/RIS-DMMI.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:39:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Yutao",""],["Wang","Qixiong",""],["Shao","Wenqi",""],["Xie","Enze",""],["Li","Zhenguo",""],["Han","Jungong",""],["Luo","Ping",""]]}
{"id":"2308.13854","submitter":"Marc Klinger","authors":"Marc Klinger (1), Andrew M. Taylor (1), Tyler Parsotan (2), Andrew\n  Beardmore (3), Sebastian Heinz (4) and Sylvia J. Zhu (1) ((1) Deutsches\n  Elektronen-Synchrotron DESY, Platanenallee 6, 15738 Zeuthen, Germany (2)\n  Astrophysics Science Division, NASA Goddard Space Flight Center, Greenbelt,\n  MD 20771, USA. (3) School of Physics and Astronomy, University of Leicester,\n  Leicester LE1 7RH, UK (4) University of Wisconsin-Madison, Madison, WI 53706,\n  USA.)","title":"The Multiwavelength Picture of GRB 221009A's Afterglow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present counts-level fits to the keV-GeV data of the early afterglow of\nthe brightest gamma-ray burst detected to date, GRB 221009A. We discuss the\ncomplexity of the data reduction due to the unprecedented brightness and the\nlocation in the Galactic plane. We find the energy spectrum to be well\ndescribed as a smoothly broken power law with a break around 10 keV and no\nindications for additional features towards GeV energies. An interpretation as\nsynchrotron emission from forward-shock accelerated and subsequently cooled\nelectrons yields three possible types of solutions: (1) a slow cooling solution\nwith low magnetic fields (few percent of a Gauss) but poorly constrained\nminimum injected electron energy (<100 GeV), (2) a fast cooling solution with\nstronger magnetic fields (few percent to few Gauss) and minimum injected\nelectron energy 10-100 GeV or (3) the transition between both regimes with low\nmagnetic fields and minimum injected electron energy around 100 GeV. Limited\nstatistics at GeV energies prevent conclusions extrapolating towards a cut-off\nor the onset of a new component at higher energies.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:39:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Klinger","Marc",""],["Taylor","Andrew M.",""],["Parsotan","Tyler",""],["Beardmore","Andrew",""],["Heinz","Sebastian",""],["Zhu","Sylvia J.",""]]}
{"id":"2308.13855","submitter":"Prasanta Kumar Muduli","authors":"Prasanta Muduli, Na\\\"emi Leo, Mingran Xu, Zheng Zhu, Jorge Puebla,\n  Christian Ortiz, Hironari Isshiki, and YoshiChika Otani","title":"Non-equilibrium spin polarisation via interfacial exchange-field spin\n  filtering","comments":"8 pages, 4 figures and 2 tables; Supplemental Material 4 pages, 3\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A key phenomenon that enables nanoscale spintronic devices is the efficient\ninter-conversion between spin and charge degrees of freedom. Here, we\nexperimentally demonstrate a pathway to generate current-induced spin\npolarization at the interface between an insulating ferromagnet and a\nnon-magnetic metal using interfacial exchange-field spin filtering. Measuring\ncurrent-in-plane giant magnetoresistance in Py$|$Cu$|$EuS trilayer Hall cross\ndevices, we induce a non-equilibrium spin polarization of\n$P_\\text{neq}^\\text{Cu|EuS}$=0.6% at a low charge current density of\n1.88$\\times$10$^3$ A/cm$^2$. This efficiency is comparable to that of\nconventional charge-to-spin conversion of spin-Hall or Rashba-Edelstein effects\nenabled by relativistic spin-orbit coupling. Interfacial exchange field\nfiltering allows operation with largely reduced power consumption and magnetic\nreconfigurability, opening new pathways to nanoscale low-power insulator\nspintronics.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:48:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Muduli","Prasanta",""],["Leo","Na\u00ebmi",""],["Xu","Mingran",""],["Zhu","Zheng",""],["Puebla","Jorge",""],["Ortiz","Christian",""],["Isshiki","Hironari",""],["Otani","YoshiChika",""]]}
{"id":"2308.13856","submitter":"Subhajit Paul","authors":"Suman Majumder, Subhajit Paul, and Wolfhard Janke","title":"Activity Induced Enhanced Diffusion of a Polymer in Poor Solvent","comments":"6 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  By means of Brownian dynamics simulations we study the steady-state dynamic\nproperties of a flexible active polymer in a poor solvent condition. Our\nresults show that the effective diffusion constant of the polymer $D_{\\rm eff}$\ngets significantly enhanced as activity increases, much like in active\nparticles. The simulation data are in agreement with a theoretically\nconstructed Rouse model of active polymer, demonstrating that irrespective of\nthe strength of activity, the long-time dynamics of the polymer chain is\ncharacterized by a universal Rouse-like scaling $D_{\\rm eff} \\sim N^{-1}$,\nwhere $N$ is the chain length.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 11:59:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Majumder","Suman",""],["Paul","Subhajit",""],["Janke","Wolfhard",""]]}
{"id":"2308.13857","submitter":"Danyang Tu","authors":"Danyang Tu, Wei Shen, Wei Sun, Xiongkuo Min, Guangtao Zhai","title":"Joint Gaze-Location and Gaze-Object Detection","comments":"Technical Report. arXiv admin note: text overlap with\n  arXiv:2203.10433","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes an efficient and effective method for joint gaze location\ndetection (GL-D) and gaze object detection (GO-D), \\emph{i.e.}, gaze following\ndetection. Current approaches frame GL-D and GO-D as two separate tasks,\nemploying a multi-stage framework where human head crops must first be detected\nand then be fed into a subsequent GL-D sub-network, which is further followed\nby an additional object detector for GO-D. In contrast, we reframe the gaze\nfollowing detection task as detecting human head locations and their gaze\nfollowings simultaneously, aiming at jointly detect human gaze location and\ngaze object in a unified and single-stage pipeline. To this end, we propose\nGTR, short for \\underline{G}aze following detection \\underline{TR}ansformer,\nstreamlining the gaze following detection pipeline by eliminating all\nadditional components, leading to the first unified paradigm that unites GL-D\nand GO-D in a fully end-to-end manner. GTR enables an iterative interaction\nbetween holistic semantics and human head features through a hierarchical\nstructure, inferring the relations of salient objects and human gaze from the\nglobal image context and resulting in an impressive accuracy. Concretely, GTR\nachieves a 12.1 mAP gain ($\\mathbf{25.1}\\%$) on GazeFollowing and a 18.2 mAP\ngain ($\\mathbf{43.3\\%}$) on VideoAttentionTarget for GL-D, as well as a 19 mAP\nimprovement ($\\mathbf{45.2\\%}$) on GOO-Real for GO-D. Meanwhile, unlike\nexisting systems detecting gaze following sequentially due to the need for a\nhuman head as input, GTR has the flexibility to comprehend any number of\npeople's gaze followings simultaneously, resulting in high efficiency.\nSpecifically, GTR introduces over a $\\times 9$ improvement in FPS and the\nrelative gap becomes more pronounced as the human number grows.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:12:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tu","Danyang",""],["Shen","Wei",""],["Sun","Wei",""],["Min","Xiongkuo",""],["Zhai","Guangtao",""]]}
{"id":"2308.13858","submitter":"Jiuyu Liu","authors":"Jiuyu Liu and Yi Ma and Rahim Tafazolli","title":"A Spatially Non-stationary Fading Channel Model for Simulation and\n  (Semi-) Analytical Study of ELAA-MIMO","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, a novel spatially non-stationary fading channel model is\nproposed for multiple-input multiple-output (MIMO) system with extremely-large\naperture service-array (ELAA). The proposed model incorporates three key\nfactors which cause the channel spatial non-stationarity: 1) link-wise\npath-loss; 2) shadowing effect; 3) line-of-sight (LoS)/non-LoS state. With\nappropriate parameter configurations, the proposed model can be used to\ngenerate computer-simulated channel data that matches the published measurement\ndata from practical ELAA-MIMO channels. Given such appealing results, the\nproposed fading channel model is employed to study the cumulative distribution\nfunction (CDF) of ELAA-MIMO channel capacity. For all of our studied scenarios,\nit is unveiled that the ELAA-MIMO channel capacity obeys the skew-normal\ndistribution. Moreover, the channel capacity is also found close to the\nGaussian or Weibull distribution, depending on users' geo-location and\ndistribution. More specifically, for single-user equivalent scenarios or\nmultiuser scenarios with short user-to-ELAA distances (e.g., 1 m), the channel\ncapacity is close to the Gaussian distribution; and for others, it is close to\nthe Weibull distribution. Finally, the proposed channel model is also employed\nto study the impact of channel spatial non-stationarity on linear MIMO\nreceivers through computer simulations. The proposed fading channel model is\navailable at https://github.com/ELAA-MIMO/non-stationary-fading-channel-model.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:26:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Jiuyu",""],["Ma","Yi",""],["Tafazolli","Rahim",""]]}
{"id":"2308.13859","submitter":"Mojtaba Golshani","authors":"Khatereh Jafari, Mojtaba Golshani and Alireza Bahrampour","title":"Long-distance high-fidelity continuous-variable quantum key distribution\n  with non-Gaussian operations: An exact closed form solution","comments":"7 pages, 9 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we derive a closed form expression for the output state of a\nCV-QKD protocol in the presence of zero-photon catalysis (ZPC) and quantum\nscissor (QS). Then, based on this closed form solution, we use direct search\nalgorithm to find the appropriate values of input state and QS parameters,\nwhich considerably enhance the range and the fidelity of a CV-QKD protocol. In\nthe special case of pure loss channel, the largest range of the protocol is\nonly 6.5% less than the fundamental limit of repeaterless quantum\ncommunication. In addition, examination of the protocol for different values of\nexcess noise, reveals that their is a trade-off between range and fidelity, and\nhigh value of fidelity can be obtained at the cost of a slight reduction in\nprotocol range.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:35:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jafari","Khatereh",""],["Golshani","Mojtaba",""],["Bahrampour","Alireza",""]]}
{"id":"2308.13860","submitter":"Lynn Heller","authors":"Indranil Biswas, Lynn Heller and Sebastian Heller","title":"Holomorphic Higgs bundles over the Teichm\\\"uller space","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AG math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study which representations $\\rho$ of the fundamental group of a compact\noriented surface $X$ admit Higgs data that depend holomorphically on the\nRiemann surface $\\Sigma\\,=\\, (X,\\, J)$ via non-abelian Hodge correspondence.\nFor representations $\\rho$ into $\\mathrm{SL}(2,\\mathbb C)$ we show that\nholomorphic dependency is equivalent to $\\rho$ being unitary. For higher ranks\nthis equivalence fails -- we show the existence of non-unitary and irreducible\nrepresentations of the fundamental group into $\\mathrm{SL}(n,\\mathbb C)$\nadmitting Higgs data that are holomorphic in $\\Sigma$, for $n$ large enough.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:36:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Biswas","Indranil",""],["Heller","Lynn",""],["Heller","Sebastian",""]]}
{"id":"2308.13861","submitter":"Cosmin I. Bercea","authors":"Cosmin I. Bercea, Esther Puyol-Ant\\'on, Benedikt Wiestler, Daniel\n  Rueckert, Julia A. Schnabel, Andrew P. King","title":"Bias in Unsupervised Anomaly Detection in Brain MRI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Unsupervised anomaly detection methods offer a promising and flexible\nalternative to supervised approaches, holding the potential to revolutionize\nmedical scan analysis and enhance diagnostic performance.\n  In the current landscape, it is commonly assumed that differences between a\ntest case and the training distribution are attributed solely to pathological\nconditions, implying that any disparity indicates an anomaly. However, the\npresence of other potential sources of distributional shift, including scanner,\nage, sex, or race, is frequently overlooked. These shifts can significantly\nimpact the accuracy of the anomaly detection task. Prominent instances of such\nfailures have sparked concerns regarding the bias, credibility, and fairness of\nanomaly detection.\n  This work presents a novel analysis of biases in unsupervised anomaly\ndetection. By examining potential non-pathological distributional shifts\nbetween the training and testing distributions, we shed light on the extent of\nthese biases and their influence on anomaly detection results. Moreover, this\nstudy examines the algorithmic limitations that arise due to biases, providing\nvaluable insights into the challenges encountered by anomaly detection\nalgorithms in accurately learning and capturing the entire range of variability\npresent in the normative distribution. Through this analysis, we aim to enhance\nthe understanding of these biases and pave the way for future improvements in\nthe field. Here, we specifically investigate Alzheimer's disease detection from\nbrain MR imaging as a case study, revealing significant biases related to sex,\nrace, and scanner variations that substantially impact the results. These\nfindings align with the broader goal of improving the reliability, fairness,\nand effectiveness of anomaly detection in medical imaging.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:39:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bercea","Cosmin I.",""],["Puyol-Ant\u00f3n","Esther",""],["Wiestler","Benedikt",""],["Rueckert","Daniel",""],["Schnabel","Julia A.",""],["King","Andrew P.",""]]}
{"id":"2308.13862","submitter":"Suqin Yuan","authors":"Suqin Yuan, Lei Feng, Tongliang Liu","title":"Late Stopping: Avoiding Confidently Learning from Mislabeled Examples","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sample selection is a prevalent method in learning with noisy labels, where\nsmall-loss data are typically considered as correctly labeled data. However,\nthis method may not effectively identify clean hard examples with large losses,\nwhich are critical for achieving the model's close-to-optimal generalization\nperformance. In this paper, we propose a new framework, Late Stopping, which\nleverages the intrinsic robust learning ability of DNNs through a prolonged\ntraining process. Specifically, Late Stopping gradually shrinks the noisy\ndataset by removing high-probability mislabeled examples while retaining the\nmajority of clean hard examples in the training set throughout the learning\nprocess. We empirically observe that mislabeled and clean examples exhibit\ndifferences in the number of epochs required for them to be consistently and\ncorrectly classified, and thus high-probability mislabeled examples can be\nremoved. Experimental results on benchmark-simulated and real-world noisy\ndatasets demonstrate that the proposed method outperforms state-of-the-art\ncounterparts.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:43:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Suqin",""],["Feng","Lei",""],["Liu","Tongliang",""]]}
{"id":"2308.13863","submitter":"Jiayu Dai","authors":"Qiyu Zeng, Bo Chen, Shen Zhang, Dongdong Kang, Han Wang, Xiaoxiang Yu,\n  and Jiayu Dai","title":"Full-scale ab initio simulations of laser-driven atomistic dynamics","comments":"4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.comp-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The coupling of excited states and ionic dynamics is the basic and\nchallenging point for the materials response at extreme conditions. In\nlaboratory, the intense laser produces transient nature and complexity with\nhighly nonequilibrium states, making it extremely difficult and interesting for\nboth experimental measurements and theoretical methods. With the inclusion of\nlaser-excited states, we extended ab initio method into the direct simulations\nof whole laser-driven microscopic dynamics from solid to liquid. We constructed\nthe framework of combining the electron-temperaturedependent deep neural\nnetwork potential energy surface with hybrid atomistic-continuum approach,\ncontrolling non-adiabatic energy exchange and atomistic dynamics, which enables\nconsistent interpretation of experimental data. By large scale ab inito\nsimulations, we demonstrate that the nonthermal effects introduced by hot\nelectrons play a dominant role in modulating the lattice dynamics,\nthermodynamic pathway, and structural transformation. We highlight that the\npresent work provides a path to realistic computational studies of laser-driven\nprocesses, thus bridging the gap between experiments and simulations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:46:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zeng","Qiyu",""],["Chen","Bo",""],["Zhang","Shen",""],["Kang","Dongdong",""],["Wang","Han",""],["Yu","Xiaoxiang",""],["Dai","Jiayu",""]]}
{"id":"2308.13864","submitter":"Tian Yang","authors":"Giulio Belletti and Tian Yang","title":"Asymptotics of quantum $6j$-symbols and generalized hyperbolic\n  tetrahedra","comments":"55 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math-ph math.MP math.QA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish the geometry behind the quantum $6j$-symbols under only the\nadmissibility conditions as in the definition of the Turaev-Viro invariants of\n$3$-manifolds. As a classification, we show that the $6$-tuples in the quantum\n$6j$-symbols give in a precise way to the dihedral angles of (1) a spherical\ntetrahedron, (2) a generalized Euclidean tetrahedron, (3) a generalized\nhyperbolic tetrahedron or (4) in the degenerate case the angles between four\noriented straight lines in the Euclidean plane. We also show that for a large\nproportion of the cases, the $6$-tuples always give the dihedral angles of a\ngeneralized hyperbolic tetrahedron and the exponential growth rate of the\ncorresponding quantum $6j$-symbols equals the suitably defined volume of this\ngeneralized hyperbolic tetrahedron. It is worth mentioning that the volume of a\ngeneralized hyperbolic tetrahedron can be negative, hence the corresponding\nsequence of the quantum $6j$-symbols could decay exponentially. This is a\nphenomenon that has never been aware of before.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:51:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Belletti","Giulio",""],["Yang","Tian",""]]}
{"id":"2308.13865","submitter":"Jinlu Li","authors":"Jinlu Li, Yanghai Yu, Weipeng Zhu","title":"Non-uniform convergence of solution for the Camassa-Holm equation in the\n  zero-filter limit","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the short note, we prove that given initial data $\\mathcal{u}_0 \\in\n\\pmb{H}^s(\\mathbb{R})$ with $s>\\frac32$ and for some $T>0$, the solution of the\nCamassa-Holm equation does not converges uniformly with respect to the initial\ndata in $\\pmb{L}^\\infty$ $(0,T;H^s(\\mathbb{R}))$ to the inviscid Burgers\nequation as the filter parameter $\\alpha$ tends to zero. This is a supplement\nto our recent result on the zero-filter limit.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:51:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jinlu",""],["Yu","Yanghai",""],["Zhu","Weipeng",""]]}
{"id":"2308.13866","submitter":"Qingyao Wu","authors":"Yukun Su, Guosheng Lin, Qingyao Wu","title":"Improving Video Violence Recognition with Human Interaction Learning on\n  3D Skeleton Point Clouds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning has proved to be very effective in video action recognition.\nVideo violence recognition attempts to learn the human multi-dynamic behaviours\nin more complex scenarios. In this work, we develop a method for video violence\nrecognition from a new perspective of skeleton points. Unlike the previous\nworks, we first formulate 3D skeleton point clouds from human skeleton\nsequences extracted from videos and then perform interaction learning on these\n3D skeleton point clouds. Specifically, we propose two types of Skeleton Points\nInteraction Learning (SPIL) strategies: (i) Local-SPIL: by constructing a\nspecific weight distribution strategy between local regional points, Local-SPIL\naims to selectively focus on the most relevant parts of them based on their\nfeatures and spatial-temporal position information. In order to capture diverse\ntypes of relation information, a multi-head mechanism is designed to aggregate\ndifferent features from independent heads to jointly handle different types of\nrelationships between points. (ii) Global-SPIL: to better learn and refine the\nfeatures of the unordered and unstructured skeleton points, Global-SPIL employs\nthe self-attention layer that operates directly on the sampled points, which\ncan help to make the output more permutation-invariant and well-suited for our\ntask. Extensive experimental results validate the effectiveness of our approach\nand show that our model outperforms the existing networks and achieves new\nstate-of-the-art performance on video violence datasets.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:55:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Yukun",""],["Lin","Guosheng",""],["Wu","Qingyao",""]]}
{"id":"2308.13867","submitter":"Mingsheng Tian","authors":"Mingsheng Tian, Zihang Zou, Da Zhang, David Barral, Kamel Bencheikh,\n  Qiongyi He, Feng-Xiao Sun, and Yu Xiang","title":"Certification of non-Gaussian Einstein-Podolsky-Rosen Steering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Non-Gaussian quantum states are a known necessary resource for reaching a\nquantum advantage and for violating Bell inequalities in continuous variable\nsystems. As one kind of manifestation of quantum correlations,\nEinstein-Podolsky-Rosen (EPR) steering enables verification of shared\nentanglement even when one of the subsystems is not characterized. However, how\nto detect and classify such an effect for non-Gaussian states is far from being\nwell understood. Here, we present an efficient non-Gaussian steering criterion\nbased on the high-order observables and conduct a systematic investigation into\nthe hierarchy of non-Gaussian steering criteria. Moreover, we apply our\ncriterion to three experimentally-relevant non-Gaussian states under realistic\nconditions and, in particular, propose a feasible scheme to create\nmulti-component cat states with tunable size by performing a suitable\nhigh-order quadrature measurement on the steering party. Our work reveals the\nfundamental characteristics of non-Gaussianity and quantum correlations, and\noffers new insights to explore their applications in quantum information\nprocessing.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:57:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tian","Mingsheng",""],["Zou","Zihang",""],["Zhang","Da",""],["Barral","David",""],["Bencheikh","Kamel",""],["He","Qiongyi",""],["Sun","Feng-Xiao",""],["Xiang","Yu",""]]}
{"id":"2308.13868","submitter":"Shashanka Kulamarva","authors":"Suresh Manjanath Hegde and Shashanka Kulamarva","title":"A Graph-Theoretic Model for a Generic Three Jug Puzzle","comments":"12 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO cs.DM math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In a classic three jug puzzle we have three jugs $A$, $B$, and $C$ with some\nfixed capacities. The jug A is fully filled with wine to its capacity. The goal\nis to divide the wine into two equal halves by pouring it from one jug to\nanother without using any other measuring devices. This particular puzzle has a\nknown solution. However, we consider a generic three jug puzzle and present an\nindependent graph theoretic model to determine whether the puzzle has a\nsolution at first place. If it has a solution, then the same can be determined\nusing this model.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 12:57:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hegde","Suresh Manjanath",""],["Kulamarva","Shashanka",""]]}
{"id":"2308.13869","submitter":"Andrew Geyko","authors":"Andrew Geyko and Amanda Bienz","title":"A Locality-Aware Sparse Dynamic Data Exchange","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Parallel architectures are continually increasing in performance and scale,\nwhile underlying algorithmic infrastructure often fail to take full advantage\nof available compute power. Within the context of MPI, irregular communication\npatterns create bottlenecks in parallel applications. For instance, sparse\nmatrix operations, and applications which rely on them, are bottlenecked by\nrequired sparse dynamic data exchanges. Assuming each process holds a subset of\nrows of the sparse matrix and corresponding vector values, every process can\neasily determine which values it must receive from other processes. However,\nprocesses do not hold enough information to determine which values to send to\nother processes. The process of forming this communication pattern requires\ndynamic data exchanges. Current algorithms for sparse dynamic data exchanges\nare bottlenecked by point-to-point communication constraints, particularly at\nlarge scales. This paper presents a novel locality-aware sparse dynamic data\nexchange which reduces the amount of costly communication, such as inter-node,\nin exchange for additional less costly messages, reducing the cost and\nimproving scalability of the method.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:00:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Geyko","Andrew",""],["Bienz","Amanda",""]]}
{"id":"2308.13870","submitter":"Tahereh Toosi","authors":"Tahereh Toosi and Elias B. Issa","title":"Brain-like representational straightening of natural movies in robust\n  feedforward neural networks","comments":"21 pages, 15 figures, published in ICLR 2023","journal-ref":"International Conference on Learning Representations (ICLR), 2023","doi":null,"report-no":null,"categories":"q-bio.NC cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Representational straightening refers to a decrease in curvature of visual\nfeature representations of a sequence of frames taken from natural movies.\nPrior work established straightening in neural representations of the primate\nprimary visual cortex (V1) and perceptual straightening in human behavior as a\nhallmark of biological vision in contrast to artificial feedforward neural\nnetworks which did not demonstrate this phenomenon as they were not explicitly\noptimized to produce temporally predictable movie representations. Here, we\nshow robustness to noise in the input image can produce representational\nstraightening in feedforward neural networks. Both adversarial training (AT)\nand base classifiers for Random Smoothing (RS) induced remarkably straightened\nfeature codes. Demonstrating their utility within the domain of natural movies,\nthese codes could be inverted to generate intervening movie frames by linear\ninterpolation in the feature space even though they were not trained on these\ntrajectories. Demonstrating their biological utility, we found that AT and RS\ntraining improved predictions of neural data in primate V1 over baseline models\nproviding a parsimonious, bio-plausible mechanism -- noise in the sensory input\nstages -- for generating representations in early visual cortex. Finally, we\ncompared the geometric properties of frame representations in these networks to\nbetter understand how they produced representations that mimicked the\nstraightening phenomenon from biology. Overall, this work elucidating emergent\nproperties of robust neural networks demonstrates that it is not necessary to\nutilize predictive objectives or train directly on natural movie statistics to\nachieve models supporting straightened movie representations similar to human\nperception that also predict V1 neural responses.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:04:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Toosi","Tahereh",""],["Issa","Elias B.",""]]}
{"id":"2308.13871","submitter":"Jiaxi Lv","authors":"Jiaxi Lv, Liang Zhang, Yi Huang, Jiancheng Huang, Shifeng Chen","title":"Graph Edit Distance Learning via Different Attention","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recently, more and more research has focused on using Graph Neural Networks\n(GNN) to solve the Graph Similarity Computation problem (GSC), i.e., computing\nthe Graph Edit Distance (GED) between two graphs. These methods treat GSC as an\nend-to-end learnable task, and the core of their architecture is the feature\nfusion modules to interact with the features of two graphs. Existing methods\nconsider that graph-level embedding is difficult to capture the differences in\nlocal small structures between two graphs, and thus perform fine-grained\nfeature fusion on node-level embedding can improve the accuracy, but leads to\ngreater time and memory consumption in the training and inference phases.\nHowever, this paper proposes a novel graph-level fusion module Different\nAttention (DiffAtt), and demonstrates that graph-level fusion embeddings can\nsubstantially outperform these complex node-level fusion embeddings. We posit\nthat the relative difference structure of the two graphs plays an important\nrole in calculating their GED values. To this end, DiffAtt uses the difference\nbetween two graph-level embeddings as an attentional mechanism to capture the\ngraph structural difference of the two graphs. Based on DiffAtt, a new GSC\nmethod, named Graph Edit Distance Learning via Different Attention (REDRAFT),\nis proposed, and experimental results demonstrate that REDRAFT achieves\nstate-of-the-art performance in 23 out of 25 metrics in five benchmark\ndatasets. Especially on MSE, it respectively outperforms the second best by\n19.9%, 48.8%, 29.1%, 31.6%, and 2.2%. Moreover, we propose a quantitative test\nRemaining Subgraph Alignment Test (RESAT) to verify that among all graph-level\nfusion modules, the fusion embedding generated by DiffAtt can best capture the\nstructural differences between two graphs.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:05:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lv","Jiaxi",""],["Zhang","Liang",""],["Huang","Yi",""],["Huang","Jiancheng",""],["Chen","Shifeng",""]]}
{"id":"2308.13872","submitter":"Gongjin Lan","authors":"Gongjin Lan, Yu Wu, Fei Hu, and Qi Hao","title":"Vision-Based Human Pose Estimation via Deep Learning: A Survey","comments":"16 pages, 4 figures","journal-ref":null,"doi":"10.1109/THMS.2022.3219242","report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human pose estimation (HPE) has attracted a significant amount of attention\nfrom the computer vision community in the past decades. Moreover, HPE has been\napplied to various domains, such as human-computer interaction, sports\nanalysis, and human tracking via images and videos. Recently, deep\nlearning-based approaches have shown state-of-the-art performance in HPE-based\napplications. Although deep learning-based approaches have achieved remarkable\nperformance in HPE, a comprehensive review of deep learning-based HPE methods\nremains lacking in the literature. In this article, we provide an up-to-date\nand in-depth overview of the deep learning approaches in vision-based HPE. We\nsummarize these methods of 2-D and 3-D HPE, and their applications, discuss the\nchallenges and the research trends through bibliometrics, and provide\ninsightful recommendations for future research. This article provides a\nmeaningful overview as introductory material for beginners to deep\nlearning-based HPE, as well as supplementary material for advanced researchers.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:14:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lan","Gongjin",""],["Wu","Yu",""],["Hu","Fei",""],["Hao","Qi",""]]}
{"id":"2308.13873","submitter":"Andrzej Borkowski PhD","authors":"Andrzej Szymon Borkowski","title":"Digital Twin conceptual framework for the O&M process of cubature\n  building objects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The broader construction industry is struggling with data loss, inefficient\nprocesses and low productivity in asset management. The remedy to these\nproblems seems to be the idea of Digital Twin (DT). However, the frameworks\nproposed so far do not always support a solution to these problems. This paper\nconducts an extensive literature review to develop a conceptual framework for\nthe Operation and Maintenance (O&M) phase for cubic facilities. The conceptual\nframework takes into account the increasingly popular Internet of Things (IoT)\nand Artificial Intelligence (AI) technologies. The presented framework, after\nappropriate modifications, can also be applied to infrastructure facilities or\ncity fragments. The paper presents limitations and directions for further\nresearch. The DT paradigm has been adopted and its adoption is ongoing. Its\nimplementation will progress in the coming years.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:16:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Borkowski","Andrzej Szymon",""]]}
{"id":"2308.13874","submitter":"Ruifang Liu","authors":"Guoyan Ao, Ruifang Liu, Jinjiang Yuan, C.T. Ng, T.C.E. Cheng","title":"Sufficient conditions for $k$-factors and spanning trees of graphs","comments":"17 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any integer $k\\geq1,$ a graph $G$ has a $k$-factor if it contains a\n$k$-regular spanning subgraph. In this paper we prove a sufficient condition in\nterms of the number of $r$-cliques to guarantee the existence of a $k$-factor\nin a graph with minimum degree at least $\\delta$, which improves the sufficient\ncondition of O \\cite{O2021} based on the number of edges. For any integer\n$k\\geq2,$ a spanning $k$-tree of a connected graph $G$ is a spanning tree in\nwhich every vertex has degree at most $k$. Motivated by the technique of Li and\nNing \\cite{Li2016}, we present a tight spectral condition for an $m$-connected\ngraph to have a spanning $k$-tree, which extends the result of Fan, Goryainov,\nHuang and Lin \\cite{Fan2021} from $m=1$ to general $m$. Let $T$ be a spanning\ntree of a connected graph. The leaf degree of $T$ is the maximum number of\nleaves adjacent to $v$ in $T$ for any $v\\in V(T)$. We provide a tight spectral\ncondition for the existence of a spanning tree with leaf degree at most $k$ in\na connected graph with minimum degree $\\delta$, where $k\\geq1$ is an integer.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:17:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ao","Guoyan",""],["Liu","Ruifang",""],["Yuan","Jinjiang",""],["Ng","C. T.",""],["Cheng","T. C. E.",""]]}
{"id":"2308.13875","submitter":"Daniele Di Pompeo","authors":"Vittorio Cortellessa, Daniele Di Pompeo, Michele Tucci","title":"Performance of Genetic Algorithms in the Context of Software Model\n  Refactoring","comments":"19th European Workshop on Performance Engineering (EPEW 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Software systems continuously evolve due to new functionalities,\nrequirements, or maintenance activities. In the context of software evolution,\nsoftware refactoring has gained a strategic relevance. The space of possible\nsoftware refactoring is usually very large, as it is given by the combinations\nof different refactoring actions that can produce software system alternatives.\nMulti-objective algorithms have shown the ability to discover alternatives by\npursuing different objectives simultaneously. Performance of such algorithms in\nthe context of software model refactoring is of paramount importance.\nTherefore, in this paper, we conduct a performance analysis of three genetic\nalgorithms to compare them in terms of performance and quality of solutions.\nOur results show that there are significant differences in performance among\nthe algorithms (e.g., PESA2 seems to be the fastest one, while NSGA-II shows\nthe least memory usage).\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:25:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cortellessa","Vittorio",""],["Di Pompeo","Daniele",""],["Tucci","Michele",""]]}
{"id":"2308.13876","submitter":"Gongjin Lan","authors":"Gongjin Lan, Zhenyu Gao, Lingyao Tong, Ting Liu","title":"Class Binarization to NeuroEvolution for Multiclass Classification","comments":"14 pages, 17 figures","journal-ref":null,"doi":"10.1007/s00521-022-07525-6","report-no":null,"categories":"cs.LG cs.NE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiclass classification is a fundamental and challenging task in machine\nlearning. The existing techniques of multiclass classification can be\ncategorized as (i) decomposition into binary (ii) extension from binary and\n(iii) hierarchical classification. Decomposing multiclass classification into a\nset of binary classifications that can be efficiently solved by using binary\nclassifiers, called class binarization, which is a popular technique for\nmulticlass classification. Neuroevolution, a general and powerful technique for\nevolving the structure and weights of neural networks, has been successfully\napplied to binary classification. In this paper, we apply class binarization\ntechniques to a neuroevolution algorithm, NeuroEvolution of Augmenting\nTopologies (NEAT), that is used to generate neural networks for multiclass\nclassification. We propose a new method that applies Error-Correcting Output\nCodes (ECOC) to design the class binarization strategies on the neuroevolution\nfor multiclass classification. The ECOC strategies are compared with the class\nbinarization strategies of One-vs-One and One-vs-All on three well-known\ndatasets Digit, Satellite, and Ecoli. We analyse their performance from four\naspects of multiclass classification degradation, accuracy, evolutionary\nefficiency, and robustness. The results show that the NEAT with ECOC performs\nhigh accuracy with low variance. Specifically, it shows significant benefits in\na flexible number of binary classifiers and strong robustness.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:26:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lan","Gongjin",""],["Gao","Zhenyu",""],["Tong","Lingyao",""],["Liu","Ting",""]]}
{"id":"2308.13877","submitter":"Suraj Rajendran","authors":"Akshay Bhalla, Suraj Rajendran","title":"Applications of machine Learning to improve the efficiency and range of\n  microbial biosynthesis: a review of state-of-art techniques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.SC cs.LG q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the modern world, technology is at its peak. Different avenues in\nprogramming and technology have been explored for data analysis, automation,\nand robotics. Machine learning is key to optimize data analysis, make accurate\npredictions, and hasten/improve existing functions. Thus, presently, the field\nof machine learning in artificial intelligence is being developed and its uses\nin varying fields are being explored. One field in which its uses stand out is\nthat of microbial biosynthesis. In this paper, a comprehensive overview of the\ndiffering machine learning programs used in biosynthesis is provided, alongside\nbrief descriptions of the fields of machine learning and microbial biosynthesis\nseparately. This information includes past trends, modern developments, future\nimprovements, explanations of processes, and current problems they face. Thus,\nthis paper's main contribution is to distill developments in, and provide a\nholistic explanation of, 2 key fields and their applicability to improve\nindustry/research. It also highlights challenges and research directions,\nacting to instigate more research and development in the growing fields.\nFinally, the paper aims to act as a reference for academics performing\nresearch, industry professionals improving their processes, and students\nlooking to understand the concept of machine learning in biosynthesis.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:27:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhalla","Akshay",""],["Rajendran","Suraj",""]]}
{"id":"2308.13878","submitter":"Clemens Sch\\\"utz","authors":"Clemens Sch\\\"utz and Kristian Kelly","title":"On negaFibonacci-esque Sequences and Their Relation to the Golden Ratio","comments":"9 pages, 1 figure, Fibonacci Quaterly","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Fibonacci sequence, $F_n = F_{n - 1} + F_{n - 2}$, and its counterpart\nfor $n < 0$, the negaFibonacci sequence, $F_{-n} = (-1)^{n + 1} \\cdot F_n$, are\namong the most studied sequences in mathematics. In this paper we will present\na new kind of sequence, the negaFibonacci-esque sequences, identified by the\nproperty that $\\omega_n = \\omega_{n - 2} - \\omega_{n - 1}$ with $\\omega_1,\n\\omega_2 \\in \\mathbb{C}$ chosen at will. We will partition this kind into\nnatural complete and complex complete negaFibonacci-esque sequences.We will\nprove that $\\frac{1}{\\phi^n}$, referred to as the principal negaFibonacci-esque\nsequence, is not only a complex complete negaFibonacci-esque sequence but also\none of the most significant. Furthermore, we will present an explicit formula\nfor all complex complete negaFibonacci-esque sequences constructed with a\ncombination of two negaFibonacci terms. We shall then conclude by connecting\nthese sequences to the golden spiral and ratio.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:33:19 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 15:21:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sch\u00fctz","Clemens",""],["Kelly","Kristian",""]]}
{"id":"2308.13879","submitter":"Sicheng Yang","authors":"Sicheng Yang, Haiwei Xue, Zhensong Zhang, Minglei Li, Zhiyong Wu,\n  Xiaofei Wu, Songcen Xu, Zonghong Dai","title":"The DiffuseStyleGesture+ entry to the GENEA Challenge 2023","comments":"7 pages, 8 figures, ICMI 2023","journal-ref":null,"doi":"10.1145/3577190.3616114","report-no":null,"categories":"cs.HC cs.AI cs.MM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce the DiffuseStyleGesture+, our solution for the\nGeneration and Evaluation of Non-verbal Behavior for Embodied Agents (GENEA)\nChallenge 2023, which aims to foster the development of realistic, automated\nsystems for generating conversational gestures. Participants are provided with\na pre-processed dataset and their systems are evaluated through crowdsourced\nscoring. Our proposed model, DiffuseStyleGesture+, leverages a diffusion model\nto generate gestures automatically. It incorporates a variety of modalities,\nincluding audio, text, speaker ID, and seed gestures. These diverse modalities\nare mapped to a hidden space and processed by a modified diffusion model to\nproduce the corresponding gesture for a given speech input. Upon evaluation,\nthe DiffuseStyleGesture+ demonstrated performance on par with the top-tier\nmodels in the challenge, showing no significant differences with those models\nin human-likeness, appropriateness for the interlocutor, and achieving\ncompetitive performance with the best model on appropriateness for agent\nspeech. This indicates that our model is competitive and effective in\ngenerating realistic and appropriate gestures for given speech. The code,\npre-trained models, and demos are available at\nhttps://github.com/YoungSeng/DiffuseStyleGesture/tree/DiffuseStyleGesturePlus/BEAT-TWH-main.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:34:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Sicheng",""],["Xue","Haiwei",""],["Zhang","Zhensong",""],["Li","Minglei",""],["Wu","Zhiyong",""],["Wu","Xiaofei",""],["Xu","Songcen",""],["Dai","Zonghong",""]]}
{"id":"2308.13880","submitter":"Hugo Parlier","authors":"Hugo Parlier and Binbin Xu","title":"A topological viewpoint on curves via intersection","comments":"43 pages, 31 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CO math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper explores the relationship between closed curves on surfaces and\ntheir intersections. Like Dehn-Thurston coordinates for simple curves, we\nexplore how to determine closed curves using the number of times they intersect\nother curves. We construct and study $k$-equivalent curves: these are distinct\ncurves that intersect all curves with $k$ self-intersection points the same\nnumber of times. We show that such curves must intersect all simple curves in\nthe same way, but that all other possible implications fail. Our methods give a\nquantitative approach to a theorem of Otal which shows that curves are\ndetermined by their intersection with all other curves. In the opposite\ndirection, we show that non-simple curves can only be distinguished by looking\nat their intersection with infinitely many curves.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:36:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Parlier","Hugo",""],["Xu","Binbin",""]]}
{"id":"2308.13881","submitter":"Wenpin Tang","authors":"Wenpin Tang and David D. Yao","title":"Transaction fee mechanism for Proof-of-Stake protocol","comments":"18 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT q-fin.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a mechanism design problem in the blockchain proof-of-stake (PoS)\nprotocol. Our main objective is to extend the transaction fee mechanism (TFM)\nrecently proposed in Chung and Shi (SODA, p.3856-3899, 2023), so as to\nincorporate a long-run utility model for the miner into the burning\nsecond-price auction mechanism $\\texttt{BSP}(\\gamma)$ proposed in Chung and Shi\n(where $\\gamma$ is a key parameter in the strict $\\gamma$-utility model that is\napplied to both miners and users). First, we derive an explicit functional form\nfor the long-run utility of the miner using a martingale approach, and reveal a\ncritical discontinuity of the utility function, namely a small deviation from\nbeing truthful will yield a discrete jump (up or down) in the miner's utility.\nWe show that because of this discontinuity the $\\texttt{BSP}(\\gamma)$ mechanism\nwill fail a key desired property in TFM, $c$-side contract proofness ($c$-SCP).\nAs a remedy, we introduce another parameter $\\theta$, and propose a new\n$\\texttt{BSP}(\\theta)$ mechanism, and prove that it satisfies all three desired\nproperties of TFM: user- and miner-incentive compatibility (UIC and MIC) as\nwell as $c$-SCP, provided the parameter $\\theta$ falls into a specific range,\nalong with a proper tick size imposed on user bids.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:41:21 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:39:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tang","Wenpin",""],["Yao","David D.",""]]}
{"id":"2308.13882","submitter":"Bart{\\l}omiej Pawlik","authors":"Jaros{\\l}aw Grytczuk, Bart{\\l}omiej Pawlik, Mariusz Pleszczy\\'nski","title":"Variations on shuffle squares","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A \\emph{square} is a word of the form $UU$, where $U$ is any finite nonempty\nword. For instance, $\\mathtt{\\color{red}{0102}\\color{blue}{0102}}$ is a square.\nA \\emph{shuffle square} is a word that can be split into two identical\n(scattered) subwords. For example,\n$\\mathtt{\\color{red}{01}\\color{blue}{0}\\color{red}{0}\\color{blue}{102}\\color{red}{2}}$\nis a shuffle square, but not a square.\n  We discuss known and new problems concerning shuffle squares. In particular,\nwe introduce generalized shuffle squares involving various types of word\nsimilarities with respect to fixed kinds of permutations (cyclic, reverse,\ndihedral, etc.).\n  We propose a number of conjectures and provide some initial results towards\nthem. For instance, we prove that every \\emph{even} binary word (i.e. a word\nwith even number of $\\mathtt{1}$'s and even number of $\\mathtt{0}$'s) is a\n\\emph{cyclic} shuffle square, meaning it splits into two subwords, one of which\nis a~cyclic permutation of the other. The same statement is no longer true over\nlarger alphabets, but it seems plausible that a similar property should hold\nwith less restricted permutation classes (depending on the alphabet size). For\ninstance, we conjecture that every even ternary word is a \\emph{dihedral}\nshuffle square, i.e. it splits into two subwords, one of which can be obtained\nfrom the other by a permutation corresponding to the~symmetry of a~regular\npolygon. We propose a general conjecture stating that a linear number of\npermutations is sufficient to express all even $k$-ary words as generalized\nshuffle squares.\n  Our discussion is complemented by some enumerative and computational\nexperiments. In particular, we determine the precise number of shuffle squares\nwith exactly two $\\mathtt{1}$'s and confirm our main conjecture for all binary\nwords of length at most $20$.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:41:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Grytczuk","Jaros\u0142aw",""],["Pawlik","Bart\u0142omiej",""],["Pleszczy\u0144ski","Mariusz",""]]}
{"id":"2308.13883","submitter":"Aditya Kasliwal","authors":"Aditya Kasliwal, Sankarshanaa Sagaram, Laven Srivastava, Pratinav\n  Seth, Adil Khan","title":"ReFuSeg: Regularized Multi-Modal Fusion for Precise Brain Tumour\n  Segmentation","comments":"Accepted at 9th edition of the Brain Lesion (BrainLes) workshop,\n  MICCAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semantic segmentation of brain tumours is a fundamental task in medical image\nanalysis that can help clinicians in diagnosing the patient and tracking the\nprogression of any malignant entities. Accurate segmentation of brain lesions\nis essential for medical diagnosis and treatment planning. However, failure to\nacquire specific MRI imaging modalities can prevent applications from operating\nin critical situations, raising concerns about their reliability and overall\ntrustworthiness. This paper presents a novel multi-modal approach for brain\nlesion segmentation that leverages information from four distinct imaging\nmodalities while being robust to real-world scenarios of missing modalities,\nsuch as T1, T1c, T2, and FLAIR MRI of brains. Our proposed method can help\naddress the challenges posed by artifacts in medical imagery due to data\nacquisition errors (such as patient motion) or a reconstruction algorithm's\ninability to represent the anatomy while ensuring a trade-off in accuracy. Our\nproposed regularization module makes it robust to these scenarios and ensures\nthe reliability of lesion segmentation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:41:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kasliwal","Aditya",""],["Sagaram","Sankarshanaa",""],["Srivastava","Laven",""],["Seth","Pratinav",""],["Khan","Adil",""]]}
{"id":"2308.13884","submitter":"Long Jiao","authors":"Long Jiao, Yao Ge, Kai Zeng, B.C. Hilburn","title":"Location Privacy and Spectrum Efficiency Enhancement in Spectrum Sharing\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we investigate the benefits of secondary user (SU) network\nbeamforming on improving primary user (PU) location privacy in spectrum sharing\nsystems, where the beamformer in the SU network is designed to suppress the\naggregate interference to improve the location privacy of PUs. We consider two\nproblems: improving SU network communication throughput subject to the\nspecified PU location privacy requirements, and enhancing PU location privacy\ngiven the quality of service (QoS) requirements of SU networks. In the first\nproblem, we provide an algorithm to achieve high data rates with the\nconstrained PU location privacy level. Numerical results show that for a given\nPU location privacy requirement, the proposed scheme is able to\ninterfere/exclude only a few SU nodes from the PU band and the network\nthroughput can be greatly improved. In the second problem, to fully explore the\npotential of SU network beamforming for enhancing PU location privacy, we\npropose a two-step scheme to decouple the beamforming and privacy zone design\nso that the PU location privacy can be improved while satisfying the SU network\nthroughput requirement. According to numerical evaluations, the proposed scheme\ncan maintain/achieve higher PU location privacy than the benchmark beamforming\nschemes while satisfying a QoS requirement for the SU network.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:48:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiao","Long",""],["Ge","Yao",""],["Zeng","Kai",""],["Hilburn","B. C.",""]]}
{"id":"2308.13885","submitter":"Yang Li","authors":"Ning Chen, Yang Liu, Yang Li","title":"Exploring Room-Temperature Superconductivity in Narrow Energy Gap\n  Semiconductors through Thermally Excited Electrons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The impact of thermally activated electrons on superconductivity within the\nrealm of narrow energy gap semiconductors is investigated, unveiling the\npotential emergence of room-temperature superconductivity without the necessity\nfor extensive doping. This novel mechanism suggests that thermal excitations\ncan influence carrier concentrations significantly, thus influencing\ncondensation and affecting superconductivity properties. In this paper, we\nexplore how the energy gap width and temperature interact to shape carrier\nconcentrations and subsequently impact the manifestation of superconducting\nbehavior.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 13:57:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Ning",""],["Liu","Yang",""],["Li","Yang",""]]}
{"id":"2308.13886","submitter":"Dapeng Zhan","authors":"Dapeng Zhan","title":"Existence and uniqueness of nonsimple multiple SLE","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove the existence and uniqueness of multiple SLE$_\\kappa$ associated\nwith any given link pattern for $\\kappa\\in (4,6]$. We also have the uniqueness\nfor $\\kappa\\in (6,8)$. The multiple SLE$_\\kappa$ law is constructed by first\ninductively constructing a $\\sigma$-finite multiple SLE$_\\kappa$ measure and\nthen normalizing the measure whenever it is finite. The total mass of the\nmeasure satisfies the conformal covariance, asymptotics and PDE for multiple\nSLE$_\\kappa$ partition functions in the literature subject to the assumption\nthat it is smooth.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:04:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhan","Dapeng",""]]}
{"id":"2308.13887","submitter":"Hermie Monterde","authors":"Bikash Bhattacharjya, Hermie Monterde, Hiranmoy Pal","title":"Quantum walks on blow-up graphs","comments":"19 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A blow-up of $n$ copies of a graph $G$ is the graph $\\overset{n}\\uplus~G$\nobtained by replacing every vertex of $G$ by an independent set of size $n$,\nwhere the copies of vertices in $G$ are adjacent in the blow-up if and only if\nthe vertices adjacent in $G$. Our goal is to investigate the existence of\nquantum state transfer on a blow-up graph $\\overset{n}\\uplus~G$, where the\nadjacency matrix is taken to be the time-independent Hamiltonian of the quantum\nsystem represented by $\\overset{n}\\uplus~G$. In particular, we establish\nnecessary and sufficient conditions for vertices in a blow-up graph to exhibit\nstrong cospectrality and various types of high probability quantum transport,\nsuch as periodicity, perfect state transfer (PST) and pretty good state\ntransfer (PGST). It turns out, if $\\overset{n}\\uplus~G$ admits PST or PGST,\nthen one must have $n=2.$ Moreover, if $G$ has an invertible adjacency matrix,\nthen we show that every vertex in $\\overset{2}\\uplus~G$ pairs up with a unique\nvertex to exhibit strong cospectrality. We then apply our results to determine\ninfinite families of graphs whose blow-ups admit PST and PGST.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:07:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhattacharjya","Bikash",""],["Monterde","Hermie",""],["Pal","Hiranmoy",""]]}
{"id":"2308.13888","submitter":"Guilherme Schardong","authors":"Guilherme Schardong, Tiago Novello, Daniel Perazzo, Hallison Paz,\n  Iurii Medvedev, Luiz Velho, Nuno Gon\\c{c}alves","title":"Neural Implicit Morphing of Face Images","comments":"17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Face morphing is one of the seminal problems in computer graphics, with\nnumerous artistic and forensic applications. It is notoriously challenging due\nto pose, lighting, gender, and ethnicity variations. Generally, this task\nconsists of a warping for feature alignment and a blending for a seamless\ntransition between the warped images.\n  We propose to leverage coordinate-based neural networks to represent such\nwarpings and blendings of face images. During training, we exploit the\nsmoothness and flexibility of such networks, by combining energy functionals\nemployed in classical approaches without discretizations. Additionally, our\nmethod is time-dependent, allowing a continuous warping, and blending of the\ntarget images.\n  During warping inference, we need both direct and inverse transformations of\nthe time-dependent warping. The first is responsible for morphing the target\nimage into the source image, while the inverse is used for morphing in the\nopposite direction. Our neural warping stores those maps in a single network\ndue to its inversible property, dismissing the hard task of inverting them.\n  The results of our experiments indicate that our method is competitive with\nboth classical and data-based neural techniques under the lens of face-morphing\ndetection approaches. Aesthetically, the resulting images present a seamless\nblending of diverse faces not yet usual in the literature.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:12:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Schardong","Guilherme",""],["Novello","Tiago",""],["Perazzo","Daniel",""],["Paz","Hallison",""],["Medvedev","Iurii",""],["Velho","Luiz",""],["Gon\u00e7alves","Nuno",""]]}
{"id":"2308.13889","submitter":"Shmuel Bialy","authors":"Amiel Sternberg, Shmuel Bialy, Alon Gurman","title":"HI in Molecular Clouds: Irradiation by FUV plus Cosmic Rays","comments":"submitted to ApJ. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We extend the analytic theory presented by Sternberg et al. 2014 and Bialy \\&\nSternberg (2016) for the production of atomic hydrogen (HI) via FUV\nphotodissociation at the boundaries of dense interstellar molecular (H$_2$)\nclouds, to also include the effects of penetrating (low-energy) cosmic-rays for\nthe growth of the total HI column densities. We compute the steady-state\nabundances of the HI and H$_2$ in one-dimensional gas slabs in which the FUV\nphotodissociation rates are reduced by depth-dependent H$_2$ self-shielding and\ndust absorption, and in which the cosmic-ray ionization rates are either\nconstant or reduced by transport effects. The solutions for the HI and H$_2$\ndensity profiles and the integrated HI columns, depend primarily on the ratios\n$I_{\\rm UV}/Rn$ and $\\zeta/Rn$, where $I_{\\rm UV}$ is the intensity of the\nphotodissociating FUV field, $\\zeta$ is the H$_2$ cosmic-ray ionization rate,\n$n$ is the hydrogen gas density, and $R$ is the dust-surface H$_2$ formation\nrate coefficient. We present computations for a wide range of FUV field\nstrengths, cosmic-ray ionization rates, and dust-to-gas ratios. We develop\nanalytic expressions for the growth of the HI column densities. For Galactic\ngiant molecular clouds (GMCs) with multiphased (warm/cold) HI envelopes, the\ninterior cosmic-ray zones will dominate the production of the HI only if $\\zeta\n\\gtrsim 4.5\\times 10^{-16} \\times (M_{\\rm GMC}/10^6 \\\nM_{\\odot})^{-1/2}$~s$^{-1}$, where $M_{\\rm GMC}$ is the GMC mass, and including\nattenuation of the cosmic-ray fluxes. For most Galactic GMCs and conditions,\nFUV photodissociation dominates over cosmic-ray ionization for the production\nof the HI column densities. Furthermore, the cosmic-rays do not affect the\nHI-to-H$_2$ transition points.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:20:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sternberg","Amiel",""],["Bialy","Shmuel",""],["Gurman","Alon",""]]}
{"id":"2308.13890","submitter":"Henry Fleischmann","authors":"Greg Bodwin and Henry Fleischmann","title":"Spanning Adjacency Oracles in Sublinear Time","comments":"30 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Suppose we are given an $n$-node, $m$-edge input graph $G$, and the goal is\nto compute a spanning subgraph $H$ on $O(n)$ edges. This can be achieved in\nlinear $O(m + n)$ time via breadth-first search. But can we hope for\n\\emph{sublinear} runtime in some range of parameters?\n  If the goal is to return $H$ as an adjacency list, there are simple lower\nbounds showing that $\\Omega(m + n)$ runtime is necessary. If the goal is to\nreturn $H$ as an adjacency matrix, then we need $\\Omega(n^2)$ time just to\nwrite down the entries of the output matrix. However, we show that neither of\nthese lower bounds still apply if instead the goal is to return $H$ as an\n\\emph{implicit} adjacency matrix, which we call an \\emph{adjacency oracle}. An\nadjacency oracle is a data structure that gives a user the illusion that an\nadjacency matrix has been computed: it accepts edge queries $(u, v)$, and it\nreturns in near-constant time a bit indicating whether $(u, v) \\in E(H)$.\n  Our main result is that one can construct an adjacency oracle for a spanning\nsubgraph on at most $(1+\\varepsilon)n$ edges, in $\\tilde{O}(n\n\\varepsilon^{-1})$ time, and that this construction time is near-optimal.\nAdditional results include constructions of adjacency oracles for\n$k$-connectivity certificates and spanners, which are similarly sublinear on\ndense-enough input graphs.\n  Our adjacency oracles are closely related to Local Computation Algorithms\n(LCAs) for graph sparsifiers; they can be viewed as LCAs with some computation\nmoved to a preprocessing step, in order to speed up queries. Our oracles imply\nthe first Local algorithm for computing sparse spanning subgraphs of general\ninput graphs in $\\tilde{O}(n)$ query time, which works by constructing our\nadjacency oracle, querying it once, and then throwing the rest of the oracle\naway. This addresses an open problem of Rubinfeld [CSR '17].\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:21:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bodwin","Greg",""],["Fleischmann","Henry",""]]}
{"id":"2308.13891","submitter":"Natalie Wang","authors":"Natalie Wang, Casey Overby Taylor","title":"Drug Interaction Vectors Neural Network: DrIVeNN","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Polypharmacy, the concurrent use of multiple drugs to treat a single\ncondition, is common in patients managing multiple or complex conditions.\nHowever, as more drugs are added to the treatment plan, the risk of adverse\ndrug events (ADEs) rises rapidly. Many serious ADEs associated with\npolypharmacy only become known after the drugs are in use. It is impractical to\ntest every possible drug combination during clinical trials. This issue is\nparticularly prevalent among older adults with cardiovascular disease (CVD)\nwhere polypharmacy and ADEs are commonly observed. In this research, our\nprimary objective was to identify key drug features to build and evaluate a\nmodel for modeling polypharmacy ADEs. Our secondary objective was to assess our\nmodel on a domain-specific case study. We developed a two-layer neural network\nthat incorporated drug features such as molecular structure, drug-protein\ninteractions, and mono drug side effects (DrIVeNN). We assessed DrIVeNN using\npublicly available side effect databases and determined Principal Component\nAnalysis (PCA) with a variance threshold of 0.95 as the most effective feature\nselection method. DrIVeNN performed moderately better than state-of-the-art\nmodels like RESCAL, DEDICOM, DeepWalk, Decagon, DeepDDI, KGDDI, and KGNN in\nterms of AUROC for the drug-drug interaction prediction task. We also conducted\na domain-specific case study centered on the treatment of cardiovascular\ndisease (CVD). When the best performing model architecture was applied to the\nCVD treatment cohort, there was a significant increase in performance from the\ngeneral model. We observed an average AUROC for CVD drug pair prediction\nincreasing from 0.826 (general model) to 0.975 (CVD specific model). Our\nfindings indicate the strong potential of domain-specific models for improving\nthe accuracy of drug-drug interaction predictions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:24:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Natalie",""],["Taylor","Casey Overby",""]]}
{"id":"2308.13892","submitter":"Slimane Larabi","authors":"Khadidja Delloul, Slimane Larabi","title":"Towards Real Time Egocentric Segment Captioning for The Blind and\n  Visually Impaired in RGB-D Theatre Images","comments":"preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In recent years, image captioning and segmentation have emerged as crucial\ntasks in computer vision, with applications ranging from autonomous driving to\ncontent analysis. Although multiple solutions have emerged to help blind and\nvisually impaired people move around their environment, few are applications\nthat help them understand and rebuild a scene in their minds through text. Most\nbuilt models focus on helping users move and avoid obstacles, restricting the\nnumber of environments blind and visually impaired people can be in.\n  In this paper, we will propose an approach that helps them understand their\nsurroundings using image captioning. The particularity of our research is that\nwe offer them descriptions with positions of regions and objects regarding them\n(left, right, front), as well as positional relationships between regions,\nwhile we aim to give them access to theatre plays by applying the solution to\nour TS-RGBD dataset.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:27:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Delloul","Khadidja",""],["Larabi","Slimane",""]]}
{"id":"2308.13893","submitter":"Duo Peng","authors":"Duo Peng, Qiuhong Ke, Yinjie Lei, Jun Liu","title":"Unsupervised Domain Adaptation via Domain-Adaptive Diffusion","comments":"11 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised Domain Adaptation (UDA) is quite challenging due to the large\ndistribution discrepancy between the source domain and the target domain.\nInspired by diffusion models which have strong capability to gradually convert\ndata distributions across a large gap, we consider to explore the diffusion\ntechnique to handle the challenging UDA task. However, using diffusion models\nto convert data distribution across different domains is a non-trivial problem\nas the standard diffusion models generally perform conversion from the Gaussian\ndistribution instead of from a specific domain distribution. Besides, during\nthe conversion, the semantics of the source-domain data needs to be preserved\nfor classification in the target domain. To tackle these problems, we propose a\nnovel Domain-Adaptive Diffusion (DAD) module accompanied by a Mutual Learning\nStrategy (MLS), which can gradually convert data distribution from the source\ndomain to the target domain while enabling the classification model to learn\nalong the domain transition process. Consequently, our method successfully\neases the challenge of UDA by decomposing the large domain gap into small ones\nand gradually enhancing the capacity of classification model to finally adapt\nto the target domain. Our method outperforms the current state-of-the-arts by a\nlarge margin on three widely used UDA datasets.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:28:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Peng","Duo",""],["Ke","Qiuhong",""],["Lei","Yinjie",""],["Liu","Jun",""]]}
{"id":"2308.13894","submitter":"Dongqi Cai","authors":"Mengwei Xu, Yaozong Wu, Dongqi Cai, Xiang Li, Shangguang Wang","title":"Federated Fine-tuning of Billion-Sized Language Models across Mobile\n  Devices","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) are transforming the landscape of mobile\nintelligence. Federated Learning (FL), a method to preserve user data privacy,\nis often employed in fine-tuning LLMs to downstream mobile tasks, an approach\nknown as FedLLM. Though recent efforts have addressed the network issue induced\nby the vast model size, they have not practically mitigated vital challenges\nconcerning integration with mobile devices, such as significant memory\nconsumption and sluggish model convergence.\n  In response to these challenges, this work introduces FwdLLM, an innovative\nFL protocol designed to enhance the FedLLM efficiency. The key idea of FwdLLM\nto employ backpropagation (BP)-free training methods, requiring devices only to\nexecute ``perturbed inferences''. Consequently, FwdLLM delivers way better\nmemory efficiency and time efficiency (expedited by mobile NPUs and an expanded\narray of participant devices). FwdLLM centers around three key designs: (1) it\ncombines BP-free training with parameter-efficient training methods, an\nessential way to scale the approach to the LLM era; (2) it systematically and\nadaptively allocates computational loads across devices, striking a careful\nbalance between convergence speed and accuracy; (3) it discriminatively samples\nperturbed predictions that are more valuable to model convergence.\nComprehensive experiments with five LLMs and three NLP tasks illustrate\nFwdLLM's significant advantages over conventional methods, including up to\nthree orders of magnitude faster convergence and a 14.6x reduction in memory\nfootprint. Uniquely, FwdLLM paves the way for federated learning of\nbillion-parameter LLMs such as LLaMA on COTS mobile devices -- a feat\npreviously unattained.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:36:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Mengwei",""],["Wu","Yaozong",""],["Cai","Dongqi",""],["Li","Xiang",""],["Wang","Shangguang",""]]}
{"id":"2308.13895","submitter":"Arnab Hazra","authors":"Shiladitya Bose and Arnab Hazra","title":"Estimating Changepoints in Extremal Dependence, Applied to Aviation\n  Stock Prices During COVID-19 Pandemic","comments":"24 pages, 6 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dependence in the tails of the joint distribution of two random variables\nis measured using chi-measure. This work is motivated by the structural changes\nin chi-measure between the daily return rates of the two largest Indian\nairlines in 2019, IndiGo and SpiceJet, during the COVID-19 pandemic. We model\nthe daily maximum return rate vectors (potentially transformed) using the\nbivariate Husler-Reiss (BHR) distribution, which is the only possible\nnon-degenerate limiting distribution of a renormalized element-wise block\nmaxima of a sequence of bivariate Gaussian random vectors. To estimate the\nchangepoint in the chi-measure of the BHR distribution, we explore the\nchangepoint detection procedures based on Likelihood Ratio Test (LRT) and\nModified Information Criterion (MIC). We obtain critical values and power\ncurves of the LRT and MIC test statistics for low through high values of\nchi-measure. We also explore the consistency of the estimators of the\nchangepoint based on LRT and MIC numerically. In our data application, the most\nprominent changepoint detected by LRT and MIC coincides with the announcement\nof the first phase of lockdown declared by the Government of India, which is\nrealistic; thus, our study would be beneficial for portfolio optimization in\nthe case of future pandemic situations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:37:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bose","Shiladitya",""],["Hazra","Arnab",""]]}
{"id":"2308.13896","submitter":"Naresh Kumar Patra","authors":"N. K. Patra, Prafulla Saxsena, B. K. Agrawal and T. K. Jha","title":"Establishing connection between neutron star properties and nuclear\n  matter parameters through a comprehensive multivariate analysis","comments":"12 Pages, 7 Figures and 2 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE gr-qc hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have attempted to mitigate the challenge of connecting the neutron star\n(NS) properties with the nuclear matter parameters that describe equations of\nstate (EoSs). The outcomes of correlations of NS properties with individual\nnuclear matter parameters are at variance. A Principal Component Analysis is\nemployed as a tool to uncover the connection between multiple nuclear matter\nparameters and the tidal deformability as well as the radius of neutron stars\nwithin the mass range of $1.2-1.8M_\\odot$. The essential EoSs for neutron star\nmatter at low densities have been derived using both uncorrelated uniform\ndistributions and minimally constrained joint posterior distributions of\nnuclear matter parameters. For higher densities ($\\rho > 0.32$fm$^{-3}$), the\nEoSs have been established through a suitable parameterization of the sound\nspeed, which consistently maintains causality and gradually approaches the\nconformal limit. Our analysis reveals that in order to account for over 90\\% of\nthe variability in NS properties, it is crucial to consider two or more\nprincipal components, emphasizing the significance of employing multivariate\nanalysis. To explain the variability in tidal deformability needs a greater\nnumber of principal components compared to those for the radius at a given NS\nmass. The contributions from iso-vector nuclear matter parameters to the tidal\ndeformability and radius of NS decrease by $\\sim$ 25\\% with the increase in\nmass of NS 1.2$M_\\odot$ to 1.8$M_\\odot$ and accordingly those of iso-scalar\nnuclear matter parameters increase.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:50:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Patra","N. K.",""],["Saxsena","Prafulla",""],["Agrawal","B. K.",""],["Jha","T. K.",""]]}
{"id":"2308.13897","submitter":"Yanqi Bao","authors":"Yanqi Bao, Tianyu Ding, Jing Huo, Wenbin Li, Yuxin Li and Yang Gao","title":"InsertNeRF: Instilling Generalizability into NeRF with HyperNet Modules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalizing Neural Radiance Fields (NeRF) to new scenes is a significant\nchallenge that existing approaches struggle to address without extensive\nmodifications to vanilla NeRF framework. We introduce InsertNeRF, a method for\nINStilling gEneRalizabiliTy into NeRF. By utilizing multiple plug-and-play\nHyperNet modules, InsertNeRF dynamically tailors NeRF's weights to specific\nreference scenes, transforming multi-scale sampling-aware features into\nscene-specific representations. This novel design allows for more accurate and\nefficient representations of complex appearances and geometries. Experiments\nshow that this method not only achieves superior generalization performance but\nalso provides a flexible pathway for integration with other NeRF-like systems,\neven in sparse input settings. Code will be available\nhttps://github.com/bbbbby-99/InsertNeRF.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:50:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bao","Yanqi",""],["Ding","Tianyu",""],["Huo","Jing",""],["Li","Wenbin",""],["Li","Yuxin",""],["Gao","Yang",""]]}
{"id":"2308.13898","submitter":"Shuzhang Zhong","authors":"Shuzhang Zhong, Meng Li, Yun Liang, Runsheng Wang, Ru Huang","title":"Memory-aware Scheduling for Complex Wired Networks with Iterative Graph\n  Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Memory-aware network scheduling is becoming increasingly important for deep\nneural network (DNN) inference on resource-constrained devices. However, due to\nthe complex cell-level and network-level topologies, memory-aware scheduling\nbecomes very challenging. While previous algorithms all suffer from poor\nscalability, in this paper, we propose an efficient memory-aware scheduling\nframework based on iterative computation graph optimization. Our framework\nfeatures an iterative graph fusion algorithm that simplifies the computation\ngraph while preserving the scheduling optimality. We further propose an integer\nlinear programming formulation together with topology-aware variable pruning to\nschedule the simplified graph efficiently. We evaluate our method against\nprior-art algorithms on different networks and demonstrate that our method\noutperforms existing techniques in all the benchmarks, reducing the peak memory\nfootprint by 13.4%, and achieving better scalability for networks with complex\nnetwork-level topologies.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:52:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Shuzhang",""],["Li","Meng",""],["Liang","Yun",""],["Wang","Runsheng",""],["Huang","Ru",""]]}
{"id":"2308.13899","submitter":"Ce Liu","authors":"Ce Liu, Ziwei Wang, Hanzhe Zhang","title":"Self-Enforced Job Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The classic two-sided many-to-one job matching model assumes that firms treat\nworkers as substitutes and workers ignore colleagues when choosing where to\nwork. Relaxing these assumptions may lead to nonexistence of stable matchings.\nHowever, matching is often not a static allocation, but an ongoing process with\nlong-lived firms and short-lived workers. We show that stability is always\nguaranteed dynamically when firms are patient, even with complementarities in\nfirm technologies and peer effects in worker preferences. While no-poaching\nagreements are anti-competitive, they can maintain dynamic stability in markets\nthat are otherwise unstable, which may contribute to their prevalence in labor\nmarkets.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 14:58:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Ce",""],["Wang","Ziwei",""],["Zhang","Hanzhe",""]]}
{"id":"2308.13900","submitter":"Evgenii Zheltonozhskii","authors":"Moshe Kimhi, Shai Kimhi, Evgenii Zheltonozhskii, Or Litany, Chaim\n  Baskin","title":"Semi-Supervised Semantic Segmentation via Marginal Contextual\n  Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present a novel confidence refinement scheme that enhances pseudo-labels\nin semi-supervised semantic segmentation. Unlike current leading methods, which\nfilter pixels with low-confidence predictions in isolation, our approach\nleverages the spatial correlation of labels in segmentation maps by grouping\nneighboring pixels and considering their pseudo-labels collectively. With this\ncontextual information, our method, named S4MC, increases the amount of\nunlabeled data used during training while maintaining the quality of the\npseudo-labels, all with negligible computational overhead. Through extensive\nexperiments on standard benchmarks, we demonstrate that S4MC outperforms\nexisting state-of-the-art semi-supervised learning approaches, offering a\npromising solution for reducing the cost of acquiring dense annotations. For\nexample, S4MC achieves a 1.29 mIoU improvement over the prior state-of-the-art\nmethod on PASCAL VOC 12 with 366 annotated images. The code to reproduce our\nexperiments is available at https://s4mcontext.github.io/\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:02:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kimhi","Moshe",""],["Kimhi","Shai",""],["Zheltonozhskii","Evgenii",""],["Litany","Or",""],["Baskin","Chaim",""]]}
{"id":"2308.13901","submitter":"Himanshu Chaudhary","authors":"Dhruv Arora, Niyaz Uddin Molla, Himanshu Chaudhary, Ujjal Debnath,\n  Farruh Atamurotov, G.Mustafa","title":"Exploring Tidal Force Effects and Shadow Constraints for\n  Schwarzschild-like Black Hole in Starobinsky-Bel-Robinson Gravity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The current manuscript deals with the tidal force effects, geodesic\ndeviation, and shadow constraints of the Schwarzschild-like black hole\ntheorised in Starobinsky-Bel-Robinson gravity exhibiting M-theory\ncompactification. In the current analysis, we explore the radial and angular\ntidal force effects on a radially in-falling particle by the central black\nhole, which is located in this spacetime. We also numerically solve the\ngeodesic deviation equation and study the variation of the geodesic separation\nvector with the radial coordinate for two nearby geodesics using suitable\ninitial conditions. All the obtained results are tested for Sag A* and M87* by\nconstraining the value of the stringy gravity parameter $\\beta$ using the\nshadow data from the event horizon telescope observations. All the results are\ncompared with Schwarzschild black hole spacetime. In our study, we found that\nboth the radial and angular tidal forces experienced by a particle switch their\ninitial behaviour and turn compressive and stretching, respectively, before\nreaching the event horizon. The geodesic deviation shows an oscillating trend\nas well for the chosen initial condition. For the constrained value of $\\beta$,\nwe see that the spacetime geometry generated by Sag A* and M87* is effectively\nsame for both Schwarzschild and Starobinsky-Bel-Robinson black hole.\nFurthermore, we also calculated the angular diameter of the shadow in\nStarobinsky-Bel-Robinson black hole and compared with the Schwarzschild black\nhole. It is observed that the angular diameter of shadow for M87* and Sgr A* in\nStarobinsky-Bel-Robinson black hole is smaller than the Schwarzschild black\nhole. The calculated results satisfy the event horizon telescope observational\nconstraints. Finally, we have concluding remarks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:03:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Arora","Dhruv",""],["Molla","Niyaz Uddin",""],["Chaudhary","Himanshu",""],["Debnath","Ujjal",""],["Atamurotov","Farruh",""],["Mustafa","G.",""]]}
{"id":"2308.13902","submitter":"Ruochen Lu","authors":"Kristi Nguyen, Eric Stolt, Weston Braun, Vakhtang Chulukhadze,\n  Jeronimo Segovia-Fernandez, Sombuddha Chakraborty, Juan Rivas-Davila, Ruochen\n  Lu","title":"Spurious-Free Lithium Niobate Bulk Acoustic Resonator for Piezoelectric\n  Power Conversion","comments":"4 pages, 6 figures, presented at IEEE IFCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, piezoelectric power conversion has shown great benefits from\nreplacing the bulky and lossy magnetic inductor in a traditional power\nconverter with a piezoelectric resonator due to its compact size and low loss.\nHowever, the converter performance is ultimately limited by existing resonator\ndesigns, specifically by moderate quality factor (Q), moderate\nelectromechanical coupling (kt2), and spurious modes near resonance. This work\nreports a spurious-free lithium niobate (LiNbO3) thickness-extensional mode\nbulk acoustic resonator design, demonstrating Q of 4000 and kt2 of 30% with a\nfractional suppressed region of 62%. We first propose a novel grounded ring\nstructure for spurious-free resonator design, then validate its performance\nexperimentally. Upon further work, this design could be extended to\napplications requiring spurious suppression, such as filters, tunable\noscillators, transformers, etc.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:16:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen","Kristi",""],["Stolt","Eric",""],["Braun","Weston",""],["Chulukhadze","Vakhtang",""],["Segovia-Fernandez","Jeronimo",""],["Chakraborty","Sombuddha",""],["Rivas-Davila","Juan",""],["Lu","Ruochen",""]]}
{"id":"2308.13903","submitter":"Raja Kumar","authors":"Raja Kumar, Jiahao Luo, Alex Pang, James Davis","title":"Disjoint Pose and Shape for 3D Face Reconstruction","comments":"ICCV workshops 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Existing methods for 3D face reconstruction from a few casually captured\nimages employ deep learning based models along with a 3D Morphable Model(3DMM)\nas face geometry prior. Structure From Motion(SFM), followed by Multi-View\nStereo (MVS), on the other hand, uses dozens of high-resolution images to\nreconstruct accurate 3D faces.However, it produces noisy and stretched-out\nresults with only two views available. In this paper, taking inspiration from\nboth these methods, we propose an end-to-end pipeline that disjointly solves\nfor pose and shape to make the optimization stable and accurate. We use a face\nshape prior to estimate face pose and use stereo matching followed by a 3DMM to\nsolve for the shape. The proposed method achieves end-to-end topological\nconsistency, enables iterative face pose refinement procedure, and show\nremarkable improvement on both quantitative and qualitative results over\nexisting state-of-the-art methods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:18:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kumar","Raja",""],["Luo","Jiahao",""],["Pang","Alex",""],["Davis","James",""]]}
{"id":"2308.13904","submitter":"Wenlong Meng","authors":"Chengkun Wei, Wenlong Meng, Zhikun Zhang, Min Chen, Minghu Zhao,\n  Wenjing Fang, Lei Wang, Zihui Zhang, Wenzhi Chen","title":"LMSanitator: Defending Prompt-Tuning Against Task-Agnostic Backdoors","comments":"To Appear in the Network and Distributed System Security (NDSS)\n  Symposium 2024, 26 February - 1 March 2024, San Diego, CA, USA","journal-ref":null,"doi":"10.14722/ndss.2024.23238","report-no":null,"categories":"cs.CL cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Prompt-tuning has emerged as an attractive paradigm for deploying large-scale\nlanguage models due to its strong downstream task performance and efficient\nmultitask serving ability. Despite its wide adoption, we empirically show that\nprompt-tuning is vulnerable to downstream task-agnostic backdoors, which reside\nin the pretrained models and can affect arbitrary downstream tasks. The\nstate-of-the-art backdoor detection approaches cannot defend against\ntask-agnostic backdoors since they hardly converge in reversing the backdoor\ntriggers. To address this issue, we propose LMSanitator, a novel approach for\ndetecting and removing task-agnostic backdoors on Transformer models. Instead\nof directly inversing the triggers, LMSanitator aims to inverse the predefined\nattack vectors (pretrained models' output when the input is embedded with\ntriggers) of the task-agnostic backdoors, which achieves much better\nconvergence performance and backdoor detection accuracy. LMSanitator further\nleverages prompt-tuning's property of freezing the pretrained model to perform\naccurate and fast output monitoring and input purging during the inference\nphase. Extensive experiments on multiple language models and NLP tasks\nillustrate the effectiveness of LMSanitator. For instance, LMSanitator achieves\n92.8% backdoor detection accuracy on 960 models and decreases the attack\nsuccess rate to less than 1% in most scenarios.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:21:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wei","Chengkun",""],["Meng","Wenlong",""],["Zhang","Zhikun",""],["Chen","Min",""],["Zhao","Minghu",""],["Fang","Wenjing",""],["Wang","Lei",""],["Zhang","Zihui",""],["Chen","Wenzhi",""]]}
{"id":"2308.13905","submitter":"Ruiqi Liu","authors":"Ruiqi Liu, Kexuan Li, Meng Li","title":"Estimation and Hypothesis Testing of Derivatives in Smoothing Spline\n  ANOVA Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article studies the derivatives in models that flexibly characterize the\nrelationship between a response variable and multiple predictors, with goals of\nproviding both accurate estimation and inference procedures for hypothesis\ntesting. In the setting of tensor product reproducing spaces for nonparametric\nmultivariate functions, we propose a plug-in kernel ridge regression estimator\nto estimate the derivatives of the underlying multivariate regression function\nunder the smoothing spline ANOVA model. This estimator has an analytical form,\nmaking it simple to implement in practice. We first establish $L_\\infty$ and\n$L_2$ convergence rates of the proposed estimator under general random designs.\nFor derivatives with some selected interesting orders, we provide an in-depth\nanalysis establishing the minimax lower bound, which matches the $L_2$\nconvergence rate. Additionally, motivated by a wide range of applications, we\npropose a hypothesis testing procedure to examine whether a derivative is zero.\nTheoretical results demonstrate that the proposed testing procedure achieves\nthe correct size under the null hypothesis and is asymptotically powerful under\nlocal alternatives. For ease of use, we also develop an associated bootstrap\nalgorithm to construct the rejection region and calculate the p-value, and the\nconsistency of the proposed algorithm is established. Simulation studies using\nsynthetic data and an application to a real-world dataset confirm the\neffectiveness of our methods.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:22:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Ruiqi",""],["Li","Kexuan",""],["Li","Meng",""]]}
{"id":"2308.13906","submitter":"Zixiao Zhao","authors":"Zixiao Zhao, Qinghe Du, Xiang Yao, Lei Lu, and Shijiao Zhang","title":"A Two-Dimensional Deep Network for RF-based Drone Detection and\n  Identification Towards Secure Coverage Extension","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As drones become increasingly prevalent in human life, they also raises\nsecurity concerns such as unauthorized access and control, as well as\ncollisions and interference with manned aircraft. Therefore, ensuring the\nability to accurately detect and identify between different drones holds\nsignificant implications for coverage extension. Assisted by machine learning,\nradio frequency (RF) detection can recognize the type and flight mode of drones\nbased on the sampled drone signals. In this paper, we first utilize Short-Time\nFourier. Transform (STFT) to extract two-dimensional features from the raw\nsignals, which contain both time-domain and frequency-domain information. Then,\nwe employ a Convolutional Neural Network (CNN) built with ResNet structure to\nachieve multi-class classifications. Our experimental results show that the\nproposed ResNet-STFT can achieve higher accuracy and faster convergence on the\nextended dataset. Additionally, it exhibits balanced performance compared to\nother baselines on the raw dataset.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:43:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Zixiao",""],["Du","Qinghe",""],["Yao","Xiang",""],["Lu","Lei",""],["Zhang","Shijiao",""]]}
{"id":"2308.13907","submitter":"Panchugopal Bikram","authors":"Panchugopal Bikram and Diptesh Saha","title":"On the non-commutative Neveu decomposition and stochastic ergodic\n  theorems","comments":"36 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we prove Neveu decomposition for the action of the locally\ncompact amenable semigroup of positive contractions on semifinite von Neumann\nalgebras and thus, it entirely resolves the problem for the actions of\narbitrary amenable semigroup on semifinite von Neumann algebras. We also prove\nit for amenable group actions by Markov automorphisms on any $\\sigma$-finite\nvon Neumann algebras. As an application, we obtain stochastic ergodic theorem\nfor actions of $ \\mathbb{Z}_+^d$ and $\\mathbb{R}_+^d$ for $ d \\in \\mathbb{N}$\nby positive contractions on $L^1$-spaces associated with a finite von Neumann\nalgebra. It yields the first ergodic theorem for positive contraction on\nnon-commutative $L^1$-spaces beyond the Danford-Schwartz category.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:47:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bikram","Panchugopal",""],["Saha","Diptesh",""]]}
{"id":"2308.13908","submitter":"Yun Chen","authors":"Yun Chen, Nuria Gonz\\'alez-Prelcic, Takayuki Shimizu, Hongshen Lu, and\n  Chinmay Mahabal","title":"Sparse Recovery with Attention: A Hybrid Data/Model Driven Solution for\n  High Accuracy Position and Channel Tracking at mmWave","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose first a mmWave channel tracking algorithm based on\nmultidimensional orthogonal matching pursuit algorithm (MOMP) using reduced\nsparsifying dictionaries, which exploits information from channel estimates in\nprevious frames. Then, we present an algorithm to obtain the vehicle's initial\nlocation for the current frame by solving a system of geometric equations that\nleverage the estimated path parameters. Next, we design an attention network\nthat analyzes the series of channel estimates, the vehicle's trajectory, and\nthe initial estimate of the position associated with the current frame, to\ngenerate a refined, high accuracy position estimate. The proposed system is\nevaluated through numerical experiments using realistic mmWave channel series\ngenerated by ray-tracing. The experimental results show that our system\nprovides a 2D position tracking error below 20 cm, significantly outperforming\nprevious work based on Bayesian filtering.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:49:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Yun",""],["Gonz\u00e1lez-Prelcic","Nuria",""],["Shimizu","Takayuki",""],["Lu","Hongshen",""],["Mahabal","Chinmay",""]]}
{"id":"2308.13909","submitter":"Clive Cenxin Aw","authors":"Clive Cenxin Aw, Lin Htoo Zaw, Maria Balanz\\'o-Juand\\'o and Valerio\n  Scarani","title":"Tabletop Reversibility of Processes, and Product-Preserving Maps","comments":"7 figures, 24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Irreversibility, crucial in both thermodynamics and information theory, is\nnaturally studied by comparing the evolution -- the (forward) channel -- with\nan associated reverse -- the reverse channel. There are two natural ways to\ndefine this reverse channel. Using logical inference, the reverse channel is\nthe Bayesian retrodiction (the Petz recovery map in the quantum formalism) of\nthe original one. Alternatively, we know from physics that every irreversible\nprocess can be modeled as an open system: one can then define the corresponding\nclosed system by adding a bath (\"dilation\"), trivially reverse the global\nreversible process, and finally remove the bath again. We prove that the two\nrecipes are strictly identical, both in the classical and in the quantum\nformalism, once one accounts for correlations formed between system and the\nbath. Having established this, we define and study special classes of maps:\nproduct-preserving maps (including generalized thermal maps), for which no such\nsystem-bath correlations are formed for some states; and tabletop\ntime-reversible maps, when the reverse channel can be implemented with the same\ndevices as the original one. We establish several general results connecting\nthese classes, and a very detailed characterization when both the system and\nthe bath are one qubit. In particular, we show that when reverse channels are\nwell-defined, product-preservation is a sufficient but not necessary condition\nfor tabletop reversibility; and that the preservation of local energy spectra\nis a necessary and sufficient condition to generalized thermal operations.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 15:56:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aw","Clive Cenxin",""],["Zaw","Lin Htoo",""],["Balanz\u00f3-Juand\u00f3","Maria",""],["Scarani","Valerio",""]]}
{"id":"2308.13910","submitter":"Afnan Alazbah","authors":"Afnan Alazbah, Khalid Fakeeh, Osama Rabie","title":"Exploring Human Crowd Patterns and Categorization in Video Footage for\n  Enhanced Security and Surveillance using Computer Vision and Machine Learning","comments":"8 pages, 1 figure, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Computer vision and machine learning have brought revolutionary shifts in\nperception for researchers, scientists, and the general populace. Once thought\nto be unattainable, these technologies have achieved the seemingly impossible.\nTheir exceptional applications in diverse fields like security, agriculture,\nand education are a testament to their impact. However, the full potential of\ncomputer vision remains untapped. This paper explores computer vision's\npotential in security and surveillance, presenting a novel approach to track\nmotion in videos. By categorizing motion into Arcs, Lanes,\nConverging/Diverging, and Random/Block motions using Motion Information Images\nand Blockwise dominant motion data, the paper examines different optical flow\ntechniques, CNN models, and machine learning models. Successfully achieving its\nobjectives with promising accuracy, the results can train anomaly-detection\nmodels, provide behavioral insights based on motion, and enhance scene\ncomprehension.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:09:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alazbah","Afnan",""],["Fakeeh","Khalid",""],["Rabie","Osama",""]]}
{"id":"2308.13911","submitter":"Mostafa M. Amin","authors":"Mostafa M. Amin, Rui Mao, Erik Cambria, Bj\\\"orn W. Schuller","title":"A Wide Evaluation of ChatGPT on Affective Computing Tasks","comments":"8 pages with references, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the rise of foundation models, a new artificial intelligence paradigm\nhas emerged, by simply using general purpose foundation models with prompting\nto solve problems instead of training a separate machine learning model for\neach problem. Such models have been shown to have emergent properties of\nsolving problems that they were not initially trained on. The studies for the\neffectiveness of such models are still quite limited. In this work, we widely\nstudy the capabilities of the ChatGPT models, namely GPT-4 and GPT-3.5, on 13\naffective computing problems, namely aspect extraction, aspect polarity\nclassification, opinion extraction, sentiment analysis, sentiment intensity\nranking, emotions intensity ranking, suicide tendency detection, toxicity\ndetection, well-being assessment, engagement measurement, personality\nassessment, sarcasm detection, and subjectivity detection. We introduce a\nframework to evaluate the ChatGPT models on regression-based problems, such as\nintensity ranking problems, by modelling them as pairwise ranking\nclassification. We compare ChatGPT against more traditional NLP methods, such\nas end-to-end recurrent neural networks and transformers. The results\ndemonstrate the emergent abilities of the ChatGPT models on a wide range of\naffective computing problems, where GPT-3.5 and especially GPT-4 have shown\nstrong performance on many problems, particularly the ones related to\nsentiment, emotions, or toxicity. The ChatGPT models fell short for problems\nwith implicit signals, such as engagement measurement and subjectivity\ndetection.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:10:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amin","Mostafa M.",""],["Mao","Rui",""],["Cambria","Erik",""],["Schuller","Bj\u00f6rn W.",""]]}
{"id":"2308.13912","submitter":"Daniel Lizzit","authors":"Daniel Lizzit, Thomas Bernardi and David Esseni","title":"Multi-level Operation of FeFETs Memristors: the Crucial Role of Three\n  Dimensional Effects","comments":"Proceeding of the ESSDERC2022 conference","journal-ref":"ESSDERC 2022 - IEEE 52nd European Solid-State Device Research\n  Conference (ESSDERC), Milan, Italy, 2022, pp. 344-347","doi":"10.1109/ESSDERC55479.2022.9947169","report-no":null,"categories":"cs.ET","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper investigates and compares through a comprehensive TCAD analysis 2D\nand 3D simulations for ferroelectric based FETs. We provide clear evidence that\nthe multiple read conductance values experimentally observed in FeFETs stem\nfrom source to drain percolation current paths, which are governed by the\npolarization patterns in the ferroelectric domains. Such a physical picture\nmakes 3D simulations indispensable to capture even the qualitative features of\nthe device behaviour, not to mention the quantitative aspects.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:21:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lizzit","Daniel",""],["Bernardi","Thomas",""],["Esseni","David",""]]}
{"id":"2308.13913","submitter":"Giulio Codogni","authors":"Giulio Codogni and Guido Lido","title":"Spectral Theory of Isogeny Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider finite graphs whose vertexes are supersingular elliptic curves,\npossibly with level structure, and edges are isogenies. They can be applied to\nthe study of modular forms and to isogeny based cryptography. The main result\nof this paper says that these graphs have the Ramanujan property, which means\nthat the eigenvalues of their adjacency matrices are as small as possible. We\nalso study the asymptotic distribution of the eigenvalues of the adjacency\nmatrices, the number of connected components, the automorphisms of the graphs,\nand the connection between the graphs and modular forms.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:30:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Codogni","Giulio",""],["Lido","Guido",""]]}
{"id":"2308.13914","submitter":"Bhabani Prasad Mandal Prof.","authors":"Gaurav Hajong, Ranjan Modak, Bhabani Prasad Mandal","title":"Hellmann Feynman Theorem in Non-Hermitian system","comments":"15 pages, 5 Figs","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.other hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the celebrated Hellmann-Feynman theorem (HFT) in the PT invariant\nnon-Hermitian quantum physics framework. We derive a modified version of HFT by\nchanging the definition of inner product and explicitly show that it holds good\nfor both PT broken, unbroken phases and even at the exceptional point of the\ntheory. The derivation is extremely general and works for even PT non-invariant\nHamiltonian. We consider several examples of discrete and continuum systems to\ntest our results. We find that if the eigenvalue goes through a real to complex\ntransition as a function of the Hermiticity breaking parameter, both sides of\nthe modified HFT expression diverge at that point. If that point turns out to\nbe an EP of the PT invariant quantum theory, then one also sees the divergence\nat EP. Finally, we also derive a generalized Virial theorem for non-Hermitian\nsystems using the modified HFT, which potentially can be tested in experiments.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:31:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hajong","Gaurav",""],["Modak","Ranjan",""],["Mandal","Bhabani Prasad",""]]}
{"id":"2308.13915","submitter":"Christis Katsouris","authors":"Christis Katsouris","title":"Break-Point Date Estimation for Nonstationary Autoregressive and\n  Predictive Regression Models","comments":"arXiv admin note: text overlap with arXiv:2204.01373 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this article, we study the statistical and asymptotic properties of\nbreak-point estimators in nonstationary autoregressive and predictive\nregression models for testing the presence of a single structural break at an\nunknown location in the full sample. Moreover, we investigate aspects such as\nhow the persistence properties of covariates and the location of the\nbreak-point affects the limiting distribution of the proposed break-point\nestimators.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:31:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Katsouris","Christis",""]]}
{"id":"2308.13916","submitter":"Liang Yao","authors":"Liang Yao, Jiazhen Peng, Chengsheng Mao, Yuan Luo","title":"Exploring Large Language Models for Knowledge Graph Completion","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge graphs play a vital role in numerous artificial intelligence tasks,\nyet they frequently face the issue of incompleteness. In this study, we explore\nutilizing Large Language Models (LLM) for knowledge graph completion. We\nconsider triples in knowledge graphs as text sequences and introduce an\ninnovative framework called Knowledge Graph LLM (KG-LLM) to model these\ntriples. Our technique employs entity and relation descriptions of a triple as\nprompts and utilizes the response for predictions. Experiments on various\nbenchmark knowledge graphs demonstrate that our method attains state-of-the-art\nperformance in tasks such as triple classification and relation prediction. We\nalso find that fine-tuning relatively smaller models (e.g., LLaMA-7B,\nChatGLM-6B) outperforms recent ChatGPT and GPT-4.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:51:17 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:53:34 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yao","Liang",""],["Peng","Jiazhen",""],["Mao","Chengsheng",""],["Luo","Yuan",""]]}
{"id":"2308.13917","submitter":"Khaled Alrfou","authors":"Khaled Alrfou, Tian Zhao, Amir Kordijazi","title":"Transfer Learning for Microstructure Segmentation with CS-UNet: A Hybrid\n  Algorithm with Transformer and CNN Encoders","comments":"21 pages, 8 figures, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transfer learning improves the performance of deep learning models by\ninitializing them with parameters pre-trained on larger datasets. Intuitively,\ntransfer learning is more effective when pre-training is on the in-domain\ndatasets. A recent study by NASA has demonstrated that the microstructure\nsegmentation with encoder-decoder algorithms benefits more from CNN encoders\npre-trained on microscopy images than from those pre-trained on natural images.\nHowever, CNN models only capture the local spatial relations in images. In\nrecent years, attention networks such as Transformers are increasingly used in\nimage analysis to capture the long-range relations between pixels. In this\nstudy, we compare the segmentation performance of Transformer and CNN models\npre-trained on microscopy images with those pre-trained on natural images. Our\nresult partially confirms the NASA study that the segmentation performance of\nout-of-distribution images (taken under different imaging and sample\nconditions) is significantly improved when pre-training on microscopy images.\nHowever, the performance gain for one-shot and few-shot learning is more modest\nwith Transformers. We also find that for image segmentation, the combination of\npre-trained Transformers and CNN encoders are consistently better than\npre-trained CNN encoders alone. Our dataset (of about 50,000 images) combines\nthe public portion of the NASA dataset with additional images we collected.\nEven with much less training data, our pre-trained models have significantly\nbetter performance for image segmentation. This result suggests that\nTransformers and CNN complement each other and when pre-trained on microscopy\nimages, they are more beneficial to the downstream tasks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 16:56:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alrfou","Khaled",""],["Zhao","Tian",""],["Kordijazi","Amir",""]]}
{"id":"2308.13918","submitter":"Nicholas Landry","authors":"Nicholas W. Landry, Jean-Gabriel Young, and Nicole Eikmeier","title":"The simpliciality of higher-order networks","comments":"14 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Higher-order networks are widely used to describe complex systems in which\ninteractions can involve more than two entities at once. In this paper, we\nfocus on inclusion within higher-order networks, referring to situations where\nspecific entities participate in an interaction, and subsets of those entities\nalso interact with each other. Traditional modeling approaches to higher-order\nnetworks tend to either not consider inclusion at all (e.g., hypergraph models)\nor explicitly assume perfect and complete inclusion (e.g., simplicial complex\nmodels). To allow for a more nuanced assessment of inclusion in higher-order\nnetworks, we introduce the concept of \"simpliciality\" and several corresponding\nmeasures. Contrary to current modeling practice, we show that empirically\nobserved systems rarely lie at either end of the simpliciality spectrum. In\naddition, we show that generative models fitted to these datasets struggle to\ncapture their inclusion structure. These findings suggest new modeling\ndirections for the field of higher-order network science.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:24:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Landry","Nicholas W.",""],["Young","Jean-Gabriel",""],["Eikmeier","Nicole",""]]}
{"id":"2308.13919","submitter":"Manas Sajjan","authors":"Keerthi Kumaran, Manas Sajjan, Sangchul Oh, Sabre Kais","title":"Random Projection using Random Quantum Circuits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The random sampling task performed by Google's Sycamore processor gave us a\nglimpse of the \"Quantum Supremacy era\". This has definitely shed some spotlight\non the power of random quantum circuits in this abstract task of sampling\noutputs from the (pseudo-) random circuits. In this manuscript, we explore a\npractical near-term use of local random quantum circuits in dimensional\nreduction of large low-rank data sets. We make use of the well-studied\ndimensionality reduction technique called the random projection method. This\nmethod has been extensively used in various applications such as image\nprocessing, logistic regression, entropy computation of low-rank matrices, etc.\nWe prove that the matrix representations of local random quantum circuits with\nsufficiently shorter depths ($\\sim O(n)$) serve as good candidates for random\nprojection. We demonstrate numerically that their projection abilities are not\nfar off from the computationally expensive classical principal components\nanalysis on MNIST and CIFAR-100 image data sets. We also benchmark the\nperformance of quantum random projection against the commonly used classical\nrandom projection in the tasks of dimensionality reduction of image datasets\nand computing Von Neumann entropies of large low-rank density matrices. And\nfinally using variational quantum singular value decomposition, we demonstrate\na near-term implementation of extracting the singular vectors with dominant\nsingular values after quantum random projecting a large low-rank matrix to\nlower dimensions. All such numerical experiments unequivocally demonstrate the\nability of local random circuits to randomize a large Hilbert space at\nsufficiently shorter depths with robust retention of properties of large\ndatasets in reduced dimensions.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:32:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kumaran","Keerthi",""],["Sajjan","Manas",""],["Oh","Sangchul",""],["Kais","Sabre",""]]}
{"id":"2308.13920","submitter":"Aakash Bansal","authors":"Aakash Bansal, Chia-Yi Su, Zachary Karas, Yifan Zhang, Yu Huang, Toby\n  Jia-Jun Li, and Collin McMillan","title":"Modeling Programmer Attention as Scanpath Prediction","comments":"Accepter at ASE2023 NIER Track. 4 pages + 1 page for references, 4\n  figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper launches a new effort at modeling programmer attention by\npredicting eye movement scanpaths. Programmer attention refers to what\ninformation people intake when performing programming tasks. Models of\nprogrammer attention refer to machine prediction of what information is\nimportant to people. Models of programmer attention are important because they\nhelp researchers build better interfaces, assistive technologies, and more\nhuman-like AI. For many years, researchers in SE have built these models based\non features such as mouse clicks, key logging, and IDE interactions. Yet the\nholy grail in this area is scanpath prediction -- the prediction of the\nsequence of eye fixations a person would take over a visual stimulus. A\nperson's eye movements are considered the most concrete evidence that a person\nis taking in a piece of information. Scanpath prediction is a notoriously\ndifficult problem, but we believe that the emergence of lower-cost,\nhigher-accuracy eye tracking equipment and better large language models of\nsource code brings a solution within grasp. We present an eye tracking\nexperiment with 27 programmers and a prototype scanpath predictor to present\npreliminary results and obtain early community feedback.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:35:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bansal","Aakash",""],["Su","Chia-Yi",""],["Karas","Zachary",""],["Zhang","Yifan",""],["Huang","Yu",""],["Li","Toby Jia-Jun",""],["McMillan","Collin",""]]}
{"id":"2308.13921","submitter":"Abdallah Alsammani","authors":"Adam A. E. Alflahi, Mohammed A. Y. Mohammed, Abdallah Alsammani","title":"Enhancement of database access performance by improving data consistency\n  in a non-relational database system (NoSQL)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study aims to enhance data consistency in NoSQL databases, traditionally\ndesigned with BASE properties, as opposed to the strong consistency guaranteed\nby ACID principles in RDBMS. We introduce a comprehensive four-stage\nserver-side model engineered explicitly for MongoDB. This model covers\ntransaction management, bifurcation of read and write transactions, assessment\nof transaction readiness, and transaction execution via a specialized locking\nalgorithm. Utilizing the Yahoo Cloud Services Benchmark (YCSB), particularly\nfor update-heavy workloads (A, B, and F), our model exhibited significant\nimprovements. Specifically, the average throughput, read, and update latencies\nimproved to 2864.726 ms, 32806.275 ms, and 51845.629 ms, respectively, from the\nbaseline metrics of 2914.110 ms, 26510.930 ms, and 32457.662 ms. These results\ndemonstrate the efficacy of our proposed model in enhancing consistency not\nonly in document-based NoSQL databases like MongoDB but also in other NoSQL\ndatabase variants, including key-value, graph, and wide-column stores.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:37:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alflahi","Adam A. E.",""],["Mohammed","Mohammed A. Y.",""],["Alsammani","Abdallah",""]]}
{"id":"2308.13922","submitter":"Zhiyang Liu","authors":"Zhiyang Liu, Pengyu Yin, Zhenhua Ren","title":"An Efficient FPGA-Based Accelerator for Swin Transformer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since introduced, Swin Transformer has achieved remarkable results in the\nfield of computer vision, it has sparked the need for dedicated hardware\naccelerators, specifically catering to edge computing demands. For the\nadvantages of flexibility, low power consumption, FPGAs have been widely\nemployed to accelerate the inference of convolutional neural networks (CNNs)\nand show potential in Transformer-based models. Unlike CNNs, which mainly\ninvolve multiply and accumulate (MAC) operations, Transformer involve\nnon-linear computations such as Layer Normalization (LN), Softmax, and GELU.\nThese nonlinear computations do pose challenges for accelerator design. In this\npaper, to propose an efficient FPGA-based hardware accelerator for Swin\nTransformer, we focused on using different strategies to deal with these\nnonlinear calculations and efficiently handling MAC computations to achieve the\nbest acceleration results. We replaced LN with BN, Given that Batch\nNormalization (BN) can be fused with linear layers during inference to optimize\ninference efficiency. The modified Swin-T, Swin-S, and Swin-B respectively\nachieved Top-1 accuracy rates of 80.7%, 82.7%, and 82.8% in ImageNet.\nFurthermore, We employed strategies for approximate computation to design\nhardware-friendly architectures for Softmax and GELU computations. We also\ndesigned an efficient Matrix Multiplication Unit to handle all linear\ncomputations in Swin Transformer. As a conclude, compared with CPU (AMD Ryzen\n5700X), our accelerator achieved 1.76x, 1.66x, and 1.25x speedup and achieved\n20.45x, 18.60x, and 14.63x energy efficiency (FPS/power consumption)\nimprovement on Swin-T, Swin-S, and Swin-B models, respectively. Compared to GPU\n(Nvidia RTX 2080 Ti), we achieved 5.05x, 4.42x, and 3.00x energy efficiency\nimprovement respectively. As far as we know, the accelerator we proposed is the\nfastest FPGA-based accelerator for Swin Transformer.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:41:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Zhiyang",""],["Yin","Pengyu",""],["Ren","Zhenhua",""]]}
{"id":"2308.13923","submitter":"Jianghui Ji","authors":"Xiumin Huang, Jianghui Ji, Shangfei Liu, Ruobing Dong, Su Wang","title":"Evolution of the Planetary Obliquity: The Eccentric Kozai-Lidov\n  Mechanism Coupled with Tide","comments":"18 pages, 12 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The planetary obliquity plays a significant role in determining physical\nproperties of planetary surfaces and climate. As direct detection is\nconstrained due to the present observation accuracy, kinetic theories are\nhelpful to predict the evolution of the planetary obliquity. Here the coupling\neffect between the eccentric Kozai-Lidov (EKL) effect and the equilibrium tide\nis extensively investigated, the planetary obliquity performs to follow two\nkinds of secular evolution paths, based on the conservation of total angular\nmomentum. The equilibrium timescale of the planetary obliquity\n$t_{\\mathrm{eq}}$ varies along with $r_{t}$, which is defined as the initial\ntimescale ratio of the tidal dissipation and secular perturbation. We\nnumerically derive the linear relationship between $t_{\\mathrm{eq}}$ and\n$r_{t}$ with the maximum likelihood method. The spin-axis orientation of S-type\nterrestrials orbiting M-dwarfs reverses over $90^\\circ$ when $r_{t} > 100$,\nthen enter the quasi-equilibrium state between $40^\\circ$ and $60^\\circ$, while\nthe maximum obliquity can reach $130^\\circ$ when $r_{t} > 10^4 $. Numerical\nsimulations show that the maximum obliquity increases with the semi-major axis\nratio $a_1$/$a_2$, but is not so sensitive to the eccentricity $e_2$. The\nlikelihood of obliquity flip for S-type terrestrials in general systems with\n$a_2 < 45$ AU is closely related to $m_1$. The observed potential oblique\nS-type planets HD 42936 b, GJ 86 Ab and $\\tau$ Boot Ab are explored to have a\ngreat possibility to be head-down over the secular evolution of spin.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:47:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Xiumin",""],["Ji","Jianghui",""],["Liu","Shangfei",""],["Dong","Ruobing",""],["Wang","Su",""]]}
{"id":"2308.13924","submitter":"Chen Chen","authors":"Chen Chen, Cuong Nguyen, Jane Hoffswell, Jennifer Healey, Trung Bui,\n  Nadir Weibel","title":"PaperToPlace: Transforming Instruction Documents into Spatialized and\n  Context-Aware Mixed Reality Experiences","comments":"21 pages, 23 figures, Proceedings of the 36th Annual ACM Symposium on\n  User Interface Software and Technology (UIST '23), San Francisco, CA, USA","journal-ref":null,"doi":"10.1145/3586183.3606832","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  While paper instructions are one of the mainstream medium for sharing\nknowledge, consuming such instructions and translating them into activities are\ninefficient due to the lack of connectivity with physical environment. We\npresent PaperToPlace, a novel workflow comprising an authoring pipeline, which\nallows the authors to rapidly transform and spatialize existing paper\ninstructions into MR experience, and a consumption pipeline, which\ncomputationally place each instruction step at an optimal location that is easy\nto read and do not occlude key interaction areas. Our evaluations of the\nauthoring pipeline with 12 participants demonstrated the usability of our\nworkflow and the effectiveness of using a machine learning based approach to\nhelp extracting the spatial locations associated with each steps. A second\nwithin-subject study with another 12 participants demonstrates the merits of\nour consumption pipeline by reducing efforts of context switching, delivering\nthe segmented instruction steps and offering the hands-free affordances.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:51:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Chen",""],["Nguyen","Cuong",""],["Hoffswell","Jane",""],["Healey","Jennifer",""],["Bui","Trung",""],["Weibel","Nadir",""]]}
{"id":"2308.13925","submitter":"Shamuel Auyeung","authors":"Shamuel Auyeung","title":"Adjacent Singularities, TQFTs, and Zariski's Multiplicity Conjecture","comments":"34 pages, 10 figures. arXiv admin note: text overlap with\n  arXiv:1608.07541 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We give a new proof of Zariski's multiplicity conjecture in the case of\nisolated hypersurface singularities; this was first proved by de Bobadilla-Pe\\l\nka \\cite{BobadillaPelka}. Our proof uses the TQFT structure of fixed-point\nFloer cohomology and the fact that adjacent singularities produce symplectic\ncobordisms between the Milnor fibrations of the singularities. The key\ntechnical result is to construct a chain map on Floer cochains using the\ncobordism and as a last step, apply a spectral sequence of McLean\n\\cite{McLeanLog}. This last step allows us to also recover a theorem of\nVarchenko \\cite{varchenko}.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:51:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Auyeung","Shamuel",""]]}
{"id":"2308.13926","submitter":"V. Parameswaran Nair","authors":"V.P. Nair","title":"The Schr\\\"odinger Representation and 3d Gauge Theories","comments":"134 pages, 13 figures, Expanded version of lectures at Understanding\n  Confinement: Prospects in Theoretical Physics Summer School, Institute for\n  Advanced Study, Princeton, July 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th hep-lat math-ph math.MP nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this review we consider the Hamiltonian analysis of Yang-Mills theory and\nsome variants of it in three spacetime dimensions using the Schr\\\"odinger\nrepresentation. This representation, although technically more involved than\nthe usual covariant formulation, may be better suited for some nonperturbative\nissues. Specifically for the Yang-Mills theory, we explain how to set up the\nHamiltonian formulation in terms of manifestly gauge-invariant variables and\nset up an expansion scheme for solving the Schr\\\"odinger equation. We review\nthe calculation of the string tension, the Casimir energy and the propagator\nmass and compare with the results from lattice simulations. The computation of\nthe first set of corrections to the string tension, string breaking effects,\nextensions to the Yang-Mills-Chern-Simons theory and to the supersymmetric\ncases are also discussed. We also comment on how entanglement for the vacuum\nstate can be formulated in terms of the BFK gluing formula. The review\nconcludes with a discussion of the status and prospects of this approach.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 17:52:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nair","V. P.",""]]}
{"id":"2308.13927","submitter":"Yichen Jiang","authors":"Yichen Jiang and Michael D. Porter","title":"Quantifying the Influence of User Behaviors on the Dissemination of Fake\n  News on Twitter with Multivariate Hawkes Processes","comments":"12 pages, 3 figures, journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fake news has emerged as a pervasive problem within Online Social Networks,\nleading to a surge of research interest in this area. Understanding the\ndissemination mechanisms of fake news is crucial in comprehending the\npropagation of disinformation/misinformation and its impact on users in Online\nSocial Networks. This knowledge can facilitate the development of interventions\nto curtail the spread of false information and inform affected users to remain\nvigilant against fraudulent/malicious content. In this paper, we specifically\ntarget the Twitter platform and propose a Multivariate Hawkes Point Processes\nmodel that incorporates essential factors such as user networks, response tweet\ntypes, and user stances as model parameters. Our objective is to investigate\nand quantify their influence on the dissemination process of fake news. We\nderive parameter estimation expressions using an Expectation Maximization\nalgorithm and validate them on a simulated dataset. Furthermore, we conduct a\ncase study using a real dataset of fake news collected from Twitter to explore\nthe impact of user stances and tweet types on dissemination patterns. This\nanalysis provides valuable insights into how users are influenced by or\ninfluence the dissemination process of disinformation/misinformation, and\ndemonstrates how our model can aid in intervening in this process.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:01:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiang","Yichen",""],["Porter","Michael D.",""]]}
{"id":"2308.13928","submitter":"Joaqu\\'in Mart\\'inez-Minaya","authors":"Joaqu\\'in Mart\\'inez-Minaya and Haavard Rue","title":"A flexible Bayesian tool for CoDa mixed models: logistic-normal\n  distribution with Dirichlet covariance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compositional Data Analysis (CoDa) has gained popularity in recent years.\nThis type of data consists of values from disjoint categories that sum up to a\nconstant. Both Dirichlet regression and logistic-normal regression have become\npopular as CoDa analysis methods. However, fitting this kind of multivariate\nmodels presents challenges, especially when structured random effects are\nincluded in the model, such as temporal or spatial effects.\n  To overcome these challenges, we propose the logistic-normal Dirichlet Model\n(LNDM). We seamlessly incorporate this approach into the R-INLA package,\nfacilitating model fitting and model prediction within the framework of Latent\nGaussian Models (LGMs). Moreover, we explore metrics like Deviance Information\nCriteria (DIC), Watanabe Akaike information criterion (WAIC), and\ncross-validation measure conditional predictive ordinate (CPO) for model\nselection in R-INLA for CoDa.\n  Illustrating LNDM through a simple simulated example and with an ecological\ncase study on Arabidopsis thaliana in the Iberian Peninsula, we underscore its\npotential as an effective tool for managing CoDa and large CoDa databases.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:02:15 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:28:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mart\u00ednez-Minaya","Joaqu\u00edn",""],["Rue","Haavard",""]]}
{"id":"2308.13929","submitter":"Avishai Sintov","authors":"Alon Mizrahi and Avishai Sintov","title":"TeleFMG: A Wearable Force-Myography Device for Natural Teleoperation of\n  Multi-finger Robotic Hands","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Teleoperation enables a user to perform tasks from a remote location. Hence,\nthe user can interact with a long-distance environment through the operation of\na robotic system. Often, teleoperation is required in order to perform\ndangerous tasks (e.g., work in disaster zones or in chemical plants) while\nkeeping the user out of harm's way. Nevertheless, common approaches often\nprovide cumbersome and unnatural usage. In this letter, we propose TeleFMG, an\napproach for teleoperation of a multi-finger robotic hand through natural\nmotions of the user's hand. By using a low-cost wearable Force-Myography (FMG)\ndevice, musculoskeletal activities on the user's forearm are mapped to hand\nposes which, in turn, are mimicked by a robotic hand. The mapping is performed\nby a data-based model that considers spatial positions of the sensors on the\nforearm along with temporal dependencies of the FMG signals. A set of\nexperiments show the ability of a teleoperator to control a multi-finger hand\nthrough intuitive and natural finger motion. Furthermore, transfer to new users\nis demonstrated.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:08:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mizrahi","Alon",""],["Sintov","Avishai",""]]}
{"id":"2308.13930","submitter":"Preena Samuel","authors":"Santosha Pattanayak, Preena Samuel","title":"Graded Picture Invariants and polynomial invariants for mixed tensor\n  superspaces","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we consider the mixed tensor space of a $\\mathbb Z_2$-graded\nvector space. We obtain a spanning set of invariants of the associated\nsymmetric algebra under the action of the general linear supergroup as well as\nthe queer supergroup over the Grassmann algebra. As a consequence, we give a\ngenerating set of polynomial invariants for the simultaneous adjoint action of\nthe general linear supergroup on several copies of its Lie superalgebra. We\nshow that in this special case, these turn out to be the supertrace monomials\nwhich is analogous to the results of Procesi in the classical case. A queer\nsupergroup analogue of these results is also obtained.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:09:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pattanayak","Santosha",""],["Samuel","Preena",""]]}
{"id":"2308.13931","submitter":"Aniket Bhattacharya","authors":"Swarnadeep Seth and Aniket Bhattacharya","title":"Exact current blockade maps of dsDNA bound motifs driven through a\n  solitary nanopore using electrokinetic Brownian dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report current blockade (CB) characteristics of molecular motifs residing\non a model dsDNA using electrokinetic Brownian dynamics (EKBD) and study the\nrole of the valence of the counterions as the dsDNA translocates through a\nsolitary nanopore (NP) driven by an electric field. We explicitly incorporate\nall the charges on the DNA backbone, co- and counter-ions, and investigate CB\ncharacteristics of two charged sidechain motifs exactly. Our simulation brings\nout the details of binding and unbinding of the counter-ions and the time\ndependent counter-ion condensation on the translocating DNA for mono- and\ndi-valent salt conditions. An important and less intuitive finding is that the\ndrop in the conventional (positive) current through the pore is due to the\ncondensation of the counter-ions on the translocating DNA and not so much due\nto drop in the co-ions passing through the pore. This finding aligns with\nprevious studies conducted by Tanaka et al. [Phys. Rev. Lett. 94, 148103\n(2005)], Cui [J. Phys. Chem B 114, 2015 (2010)], and Holm et al. [Phys. Rev.\nLett. 112, 018101 (2014)]. We further find that this condensation is larger for\nthe divalent ions leading to a slowing down of the translocation speed and\nyielding a longer dwell time for the motifs. Finally, we use the exact CB\ncharacteristics from the EKBD simulation to reconstruct the same CB\ncharacteristics using a volumetric ansatz on the segment inside and in the\nvicinity of the pore using on the ordinary BD model without the explicit\npresence of co- and counter-ions. Refinement of this ansatz will allow us to\nobtain the CB characteristics for longer genome fragments using low-cost\nordinary BD simulation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:11:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Seth","Swarnadeep",""],["Bhattacharya","Aniket",""]]}
{"id":"2308.13932","submitter":"Dong Luo","authors":"Dong Luo","title":"A compromised constitution of intersubjectivity from the perspective of\n  a Weylian schema","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Weyl proposed a schema for symbolic construction of scientific representation\nstarting from subjective immediate experience, and moving toward the objective\nordered manifolds of possibilities due to \"rational motives\" of comprehending\nthe world in \"the 'truly objective', exact, non-qualitative\" way. Weyl's purely\ninfinitesimal geometry may be viewed as an application of the schema.Weyl\nhimself as well as various researchers have discussed the introduction of a\nlocal coordinate system as an effort to bridge the chasm between the intuitive\nand the mathematical continuum for this schema. I argue that the introduction\nof a local coordinate system only explained the \"exact, non-qualitative\" aspect\nof the \"rational motives\", and there is also a problem of how the\nintersubjective constitution is possible. The latter was not explicitly\nexplained by Weyl, and corresponds to the \"truly objective\" aspect of \"rational\nmotives\". I argue that, a comprised intersubjective constitution could be\nachieved by a strategy of introducing an additional structure to starting\npoints for theoretical constructions. The strategy might also provide an\nexplanation for gauge invariance in Weyl's unified field theory.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:17:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luo","Dong",""]]}
{"id":"2308.13933","submitter":"Longqian Huang","authors":"Haibo Xu, Cheng Li, Mingzhe Wei, Ziwen Zhou, and Longqian Huang","title":"Illumination strategies for space-bandwidth-time product improvement in\n  Fourier ptychography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fourier ptychography (FP) is a promising technique for high-throughput\nimaging. Reconstruction algorithms and illumination paradigm are two key\naspects of FP. In this review, we mainly focus on illumination strategies in\nFP. We derive the space-bandwidth-time product (SBP-T) for the characterization\nof FP performance. Based on the analysis of SBP-T, we categorize the\nillumination strategy in FP effectively and discuss each category\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:18:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Haibo",""],["Li","Cheng",""],["Wei","Mingzhe",""],["Zhou","Ziwen",""],["Huang","Longqian",""]]}
{"id":"2308.13934","submitter":"Guying Lin","authors":"Guying Lin (1), Lei Yang (1), Congyi Zhang (1), Hao Pan (2), Yuhan\n  Ping (1), Guodong Wei (1), Taku Komura (1), John Keyser (3), Wenping Wang (3)\n  ((1) The University of Hong Kong, (2) Microsoft Research Asia, (3) Texas A&M\n  University)","title":"Patch-Grid: An Efficient and Feature-Preserving Neural Implicit Surface\n  Representation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural implicit representations are known to be more compact for depicting 3D\nshapes than traditional discrete representations. However, the neural\nrepresentations tend to round sharp corners or edges and struggle to represent\nsurfaces with open boundaries. Moreover, they are slow to train. We present a\nunified neural implicit representation, called Patch-Grid, that fits to complex\nshapes efficiently, preserves sharp features, and effectively models surfaces\nwith open boundaries and thin geometric features. Our superior efficiency comes\nfrom embedding each surface patch into a local latent volume and decoding it\nusing a shared MLP decoder, which is pretrained on various local surface\ngeometries. With this pretrained decoder fixed, fitting novel shapes and local\nshape updates can be done efficiently. The faithful preservation of sharp\nfeatures is enabled by adopting a novel merge grid to perform local\nconstructive solid geometry (CSG) combinations of surface patches in the cells\nof an adaptive Octree, yielding better robustness than using a global CSG\nconstruction as proposed in the literature. Experiments show that our\nPatch-Grid method faithfully captures shapes with complex sharp features, open\nboundaries and thin structures, and outperforms existing learning-based methods\nin both efficiency and quality for surface fitting and local shape updates.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:20:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lin","Guying",""],["Yang","Lei",""],["Zhang","Congyi",""],["Pan","Hao",""],["Ping","Yuhan",""],["Wei","Guodong",""],["Komura","Taku",""],["Keyser","John",""],["Wang","Wenping",""]]}
{"id":"2308.13935","submitter":"Ingemar Bengtsson","authors":"Ingemar Bengtsson","title":"Lars Brink and SIC_POVMs","comments":"For the Memorial Volume for Lars Brink, to be published by World\n  Scientific; 15 pages, one picture","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The notion of SIC-POVMs comes from quantum information theory, and they were\nnot on the horizon when I was Lars Brink's student in the early 80s. In the\nsummer of 2022 I told Lars that I know how to use number theoretical insights\nto construct SIC-POVMs in any Hilbert space of dimension $n^2+3$, and that the\nconstruction provides a geometric setting for some deep number theoretical\nconjectures. I will give a sketch of this development, of what it was like to\nbe Lars' student, and of what his reaction to our construction was.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:21:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bengtsson","Ingemar",""]]}
{"id":"2308.13936","submitter":"Avishai Sintov","authors":"Nadav D. Kahanowich and Avishai Sintov","title":"Learning Human-arm Reaching Motion Using IMU in Human-Robot\n  Collaboration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Many tasks performed by two humans require mutual interaction between arms\nsuch as handing-over tools and objects. In order for a robotic arm to interact\nwith a human in the same way, it must reason about the location of the human\narm in real-time. Furthermore and to acquire interaction in a timely manner,\nthe robot must be able predict the final target of the human in order to plan\nand initiate motion beforehand. In this paper, we explore the use of a low-cost\nwearable device equipped with two inertial measurement units (IMU) for learning\nreaching motion for real-time applications of Human-Robot Collaboration (HRC).\nA wearable device can replace or be complementary to visual perception in cases\nof bad lighting or occlusions in a cluttered environment. We first train a\nneural-network model to estimate the current location of the arm. Then, we\npropose a novel model based on a recurrent neural-network to predict the future\ntarget of the human arm during motion in real-time. Early prediction of the\ntarget grants the robot with sufficient time to plan and initiate motion during\nthe motion of the human. The accuracies of the models are analyzed concerning\nthe features included in the motion representation. Through experiments and\nreal demonstrations with a robotic arm, we show that sufficient accuracy is\nachieved for feasible HRC without any visual perception. Once trained, the\nsystem can be deployed in various spaces with no additional effort. The models\nexhibit high accuracy for various initial poses of the human arm. Moreover, the\ntrained models are shown to provide high success rates with additional human\nparticipants not included in the model training.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:22:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kahanowich","Nadav D.",""],["Sintov","Avishai",""]]}
{"id":"2308.13937","submitter":"Daniel Gaspar-Figueiredo","authors":"Daniel Gaspar Figueiredo, Silvia Abrah\\~ao, Marta Fern\\'andez-Diego,\n  Emilio Insfran","title":"A Comparative Study on Reward Models for UI Adaptation with\n  Reinforcement Learning","comments":"6 pages + 1 refs. 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Adapting the User Interface (UI) of software systems to user requirements and\nthe context of use is challenging. The main difficulty consists of suggesting\nthe right adaptation at the right time in the right place in order to make it\nvaluable for end-users. We believe that recent progress in Machine Learning\ntechniques provides useful ways in which to support adaptation more\neffectively. In particular, Reinforcement learning (RL) can be used to\npersonalise interfaces for each context of use in order to improve the user\nexperience (UX). However, determining the reward of each adaptation alternative\nis a challenge in RL for UI adaptation. Recent research has explored the use of\nreward models to address this challenge, but there is currently no empirical\nevidence on this type of model. In this paper, we propose a confirmatory study\ndesign that aims to investigate the effectiveness of two different approaches\nfor the generation of reward models in the context of UI adaptation using RL:\n(1) by employing a reward model derived exclusively from predictive\nHuman-Computer Interaction (HCI) models (HCI), and (2) by employing predictive\nHCI models augmented by Human Feedback (HCI&HF). The controlled experiment will\nuse an AB/BA crossover design with two treatments: HCI and HCI&HF. We shall\ndetermine how the manipulation of these two treatments will affect the UX when\ninteracting with adaptive user interfaces (AUI). The UX will be measured in\nterms of user engagement and user satisfaction, which will be operationalized\nby means of predictive HCI models and the Questionnaire for User Interaction\nSatisfaction (QUIS), respectively. By comparing the performance of two reward\nmodels in terms of their ability to adapt to user preferences with the purpose\nof improving the UX, our study contributes to the understanding of how reward\nmodelling can facilitate UI adaptation using RL.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:31:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Figueiredo","Daniel Gaspar",""],["Abrah\u00e3o","Silvia",""],["Fern\u00e1ndez-Diego","Marta",""],["Insfran","Emilio",""]]}
{"id":"2308.13938","submitter":"Yu Zhong","authors":"Songge Yang, Guangchen Liu, Yu Zhong","title":"Ab initio Investigations on the Electronic Properties and Stability of\n  Cu-Substituted Lead Apatite (LK-99) family with different doping\n  concentrations (x=0, 1, 2)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The pursuit of room-temperature ambient-pressure superconductivity in novel\nmaterials has sparked interest, with recent reports suggesting such properties\nin Cu-substituted lead apatite, known as LK-99. However, these claims lack\ncomprehensive experimental and theoretical support. In this study, we address\nthis gap by conducting ab initio calculations to explore the impact of varying\ndoping concentrations (x = 0, 1, 2) on the stability and electronic properties\nof five compounds in the LK-99 family. Our investigations confirm the isolated\nflat bands that intersect the Fermi level in LK-99 (Pb9Cu(PO4)6O:Cu<Pb(1)>). In\ncontrast, the other four parent compounds exhibit insulating behavior with wide\nband gaps. X-ray diffraction spectra based on the DFT simulations at 0K confirm\nthe presence of Cu substitution on Pb(1) sites in the originally synthesized\nLK-99 sample, while an extra peak suggests potential alternative like\nPb8Cu2(PO4)6 phases due to compositional variations in the original LK-99\nsamples. Furthermore, the LK-99 structure undergoes substantial lattice\nconstriction, resulting in a significant 5.5% reduction in volume and 6.8% in\narea of two mutually inverted triangles formed by Pb(2) atoms. Meanwhile,\nenergy calculations reveal a marginal energy preference for substituting Cu on\nPb(2) sites over Pb(1) sites, with a difference of approximately 0.010 eV per\natom (roughly 0.9645 k/mol). Intriguingly, at pressures exceeding 73 GPa,\nstability shifts towards LK-99 containing Cu substitutions on Pb(1) sites.\nDespite exhibiting higher electronic conductivity than parent compounds,\nPb9Cu(PO4)6O:Cu<Pb(1)> falls short of the conductivity levels observed in\nmetals or advanced oxide conductors with the simulation based on the Boltzmann\ntransport theory.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:37:20 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 11:11:10 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Songge",""],["Liu","Guangchen",""],["Zhong","Yu",""]]}
{"id":"2308.13939","submitter":"Bang Quan Zheng","authors":"Bang Quan Zheng, Peter M. Bentler","title":"Enhancing Model Fit Evaluation in SEM: Practical Tips for Optimizing\n  Chi-Square Tests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper underscores the vital role of the chi-square test within political\nscience research utilizing structural equation modeling (SEM). The ongoing\ndebate regarding the inclusion of chi-square test statistics alongside fit\nindices in result presentations has sparked controversy. Despite the recognized\nlimitations of relying solely on the chi-square test, its judicious application\ncan enhance its effectiveness in evaluating model fit and specification. To\nexemplify this, we present three common scenarios pertinent to political\nscience research where fit indices may inadequately address goodness-of-fit\nconcerns, while the chi-square statistic can be effectively harnessed. Through\nMonte Carlo simulations, we examine strategies for enhancing chi-square tests\nwithin these scenarios, showcasing the potential of appropriately employed\nchi-square tests to provide a comprehensive model fit assessment. Our\nrecommendation is to report both the chi-square test and fit indices, with a\npriority on precise model specification to ensure the trustworthiness of model\nfit indicators.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:49:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zheng","Bang Quan",""],["Bentler","Peter M.",""]]}
{"id":"2308.13940","submitter":"Paul-Baptiste Rubio","authors":"Paul-Baptiste Rubio and Youssef Marzouk and Matthew Parno","title":"A transport approach to sequential simulation-based inference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new transport-based approach to efficiently perform sequential\nBayesian inference of static model parameters. The strategy is based on the\nextraction of conditional distribution from the joint distribution of\nparameters and data, via the estimation of structured (e.g., block triangular)\ntransport maps. This gives explicit surrogate models for the likelihood\nfunctions and their gradients. This allow gradient-based characterizations of\nposterior density via transport maps in a model-free, online phase. This\nframework is well suited for parameter estimation in case of complex noise\nmodels including nuisance parameters and when the forward model is only known\nas a black box. The numerical application of this method is performed in the\ncontext of characterization of ice thickness with conductivity measurements.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:53:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rubio","Paul-Baptiste",""],["Marzouk","Youssef",""],["Parno","Matthew",""]]}
{"id":"2308.13941","submitter":"Alexander Sep\\'ulveda","authors":"Margareth Castillo, Felipe Rubio, Dagoberto Porras, Sonia H.\n  Contreras-Ortiz, Alexander Sep\\'ulveda","title":"A small vocabulary database of ultrasound image sequences of vocal tract\n  dynamics","comments":null,"journal-ref":"STSIVA-2019, Bucaramanga, Colombia, 2019","doi":"10.1109/STSIVA.2019.8730224","report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a new database consisting of concurrent articulatory and\nacoustic speech data. The articulatory data correspond to ultrasound videos of\nthe vocal tract dynamics, which allow the visualization of the tongue upper\ncontour during the speech production process. Acoustic data is composed of 30\nshort sentences that were acquired by a directional cardioid microphone. This\ndatabase includes data from 17 young subjects (8 male and 9 female) from the\nSantander region in Colombia, who reported not having any speech pathology.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 18:58:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Castillo","Margareth",""],["Rubio","Felipe",""],["Porras","Dagoberto",""],["Contreras-Ortiz","Sonia H.",""],["Sep\u00falveda","Alexander",""]]}
{"id":"2308.13942","submitter":"John T. Baldwin","authors":"John T. Baldwin, M.C. Laskowski, Saharon Shelah","title":"When does $\\aleph_1$-categoricity imply $\\omega$-stability?","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For an $\\aleph_1$-categorical atomic class, we clarify the space of types\nover the unique model of size $\\aleph_1$. Using these results, we prove that if\nsuch a class has a model of size $\\beth_1^+$ then it is $\\omega$-stable.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:13:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baldwin","John T.",""],["Laskowski","M. C.",""],["Shelah","Saharon",""]]}
{"id":"2308.13943","submitter":"Jinfeng Chen","authors":"Jinfeng Chen, Zhiqiang Gao, Qin Lin","title":"Robust Control Barrier Functions for Safe Control Under Uncertainty\n  Using Extended State Observer and Output Measurement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Control barrier functions-based quadratic programming (CBF-QP) is gaining\npopularity as an effective controller synthesis tool for safe control. However,\nthe provable safety is established on an accurate dynamic model and access to\nall states. To address such a limitation, this paper proposes a novel design\ncombining an extended state observer (ESO) with a CBF for safe control of a\nsystem with model uncertainty and external disturbances only using output\nmeasurement. Our approach provides a less conservative estimation error bound\nthan other disturbance observer-based CBFs. Moreover, only output measurements\nare needed to estimate the disturbances instead of access to the full state.\nThe bounds of state estimation error and disturbance estimation error are\nobtained in a unified manner and then used for robust safe control under\nuncertainty. We validate our approach's efficacy in simulations of an adaptive\ncruise control system and a Segway self-balancing scooter.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:20:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Jinfeng",""],["Gao","Zhiqiang",""],["Lin","Qin",""]]}
{"id":"2308.13944","submitter":"Nadeem Rather","authors":"Nadeem Rather, Roy B. V. B. Simorangkir, John L. Buckley, Brendan\n  O'Flynn, Salvatore Tedesco","title":"Deep learning assisted robust detection techniques for a chipless RFID\n  sensor tag","comments":"Submitted for publication to IEEE Transactions on Instrumentation and\n  Measurement","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we present a new approach for robust reading of identification\nand sensor data from chipless RFID sensor tags. For the first time, Machine\nLearning (ML) and Deep Learning (DL) regression modelling techniques are\napplied to a dataset of measured Radar Cross Section (RCS) data that has been\nderived from large-scale robotic measurements of custom-designed, 3-bit\nchipless RFID sensor tags. The robotic system is implemented using the\nfirst-of-its-kind automated data acquisition method using an ur16e\nindustry-standard robot. A large data set of 9,600 Electromagnetic (EM) RCS\nsignatures collected using the automated system is used to train and validate\nfour ML models and four 1-dimensional Convolutional Neural Network (1D CNN)\narchitectures. For the first time, we report an end-to-end design and\nimplementation methodology for robust detection of identification (ID) and\nsensing data using ML/DL models. Also, we report, for the first time, the\neffect of varying tag surface shapes, tilt angles, and read ranges that were\nincorporated into the training of models for robust detection of ID and sensing\nvalues. The results show that all the models were able to generalise well on\nthe given data. However, the 1D CNN models outperformed the conventional ML\nmodels in the detection of ID and sensing values. The best 1D CNN model\narchitectures performed well with a low Root Mean Square Error (RSME) of 0.061\n(0.87%) for tag ID and 0.0241 (3.44%) error for the capacitive sensing.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:20:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rather","Nadeem",""],["Simorangkir","Roy B. V. B.",""],["Buckley","John L.",""],["O'Flynn","Brendan",""],["Tedesco","Salvatore",""]]}
{"id":"2308.13945","submitter":"Keke Feng","authors":"Keke Feng, Caleb Bush, Olatunde Oladehin, Minhyea Lee, Ryan Baumbach","title":"Complex Antiferromagnetic Order in the Metallic Triangular Lattice\n  Compound SmAuAl$_4$Ge$_2$","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The compounds $Ln$AuAl$_4$Ge$_2$ ($Ln$ $=$ lanthanide) form in a structure\nthat features two-dimensional triangular lattices of $Ln$ ions that are stacked\nalong the crystalline $c$ axis. Together with crystal electric field effects,\nmagnetic anisotropy, and electron mediated spin exchange interactions, this\nsets the stage for the emergence of strongly correlated spin and electron\nphenomena. Here we investigate SmAuAl$_4$Ge$_2$, which exhibits weak\nparamagnetism that strongly deviates from conventional Curie-Weiss behavior.\nComplex antiferromagnetic ordering emerges at $T_{\\rm{N1}}$ $=$ 13.2 K and\n$T_{\\rm{N2}}$ $=$ 7.4 K, where heat capacity measurements show that these\ntransitions are first and second order, respectively. These measurements also\nreveal that the Sommerfeld coefficient is not enhanced compared to the\nnonmagnetic analog YAuAl$_4$Ge$_2$, consistent with the charge carrier\nquasiparticles exhibiting typical Fermi liquid behavior. The temperature\ndependent electrical resistivity follows standard metallic behavior, but\nanomalous linear magnetoresistance unexpectedly appears within the ordered\nstate. We compare these results to other $Ln$AuAl$_4$Ge$_2$ materials, which\nhave already been established as localized $f$-electron magnets that are hosts\nfor interesting magnetic and electronic phases. From this, SmAuAl$_4$Ge$_2$\nemerges as a complex quantum spin metal, inviting further investigations into\nits properties and the broader family of related materials.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:20:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Feng","Keke",""],["Bush","Caleb",""],["Oladehin","Olatunde",""],["Lee","Minhyea",""],["Baumbach","Ryan",""]]}
{"id":"2308.13946","submitter":"Likun Qin","authors":"Nan Wang, Likun Qin, Tianshuo Qiu","title":"SOK: Privacy Definitions and Classical Mechanisms in the Local Setting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper delves into the intricate landscape of privacy notions,\nspecifically honed in on the local setting. Central to our discussion is the\njuxtaposition of point-wise protection and average-case protection, offering a\ncomparative analysis that highlights the strengths and trade-offs inherent to\neach approach. Beyond this, we delineate between context-aware and context-free\nnotions, examining the implications of both in diverse application scenarios.\nThe study further differentiates between the interactive and non-interactive\nmodels, illuminating the complexities and nuances each model introduces. By\nsystematically navigating these core themes, our goal is to provide a cohesive\nframework that aids researchers and practitioners in discerning the most\nsuitable privacy notions for their specific requirements in the local setting.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:42:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Nan",""],["Qin","Likun",""],["Qiu","Tianshuo",""]]}
{"id":"2308.13947","submitter":"Reese Lance","authors":"Xiangjia Kong, Reese Lance, and Franklin Rea","title":"Homotopy groups of quasi-spheres and applications to indefinite\n  orthogonal groups","comments":"22 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this note, we present a new proof of the isomorphism $\\pi_1(SO^+(p,q))\n\\cong \\pi_1(SO(p))\\times \\pi_1(SO(q))$ using the long exact sequence associated\nto a fibration. While this formula is already known, the method of proof\npresented here fills an existing hole in the literature to naturally generalize\nan approach following the classical reduction of this formula for $q=0$,\ninvolving the homotopy groups of the $(p-1)$-sphere and a long exact sequence\narising from a fibration constructed from these spaces. To generalize for $q\n\\ne 0$, we upgrade spheres to the corresponding quasi-spheres, then analyze the\nresulting long exact sequence to obtain the isomorphism for all $p,q$. Some\nlow-dimensional inductive steps are delicate in this approach, but it is more\ndirect than other standard methods and involves some interesting calculations\nwith fundamental groups. The question of whether or not this approach would\nwork is absolutely natural, and in this paper we show that the answer is yes.\nThis particular approach avoids some difficult technical steps in other\nstandard proofs, which we review at the end. The family of spaces we consider\nare also of interest in physical applications. We remark about this direction\nto provide some context, but do not explore it in depth in this paper.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 19:43:47 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:08:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kong","Xiangjia",""],["Lance","Reese",""],["Rea","Franklin",""]]}
{"id":"2308.13948","submitter":"Peter Danchev","authors":"Andrey R. Chekhlov, Peter V. Danchev, and Patrick W. Keef","title":"Semi-Generalized Bassian Groups","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.RA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As a common non-trivial generalization of the concept of a proper generalized\nBassian group, we introduce the notion of a semi-generalized Bassian group and\ninitiate its comprehensive investigation. Precisely, we give a satisfactory\ncharacterization of these groups by showing in the cases of p-torsion groups,\ntorsion-free groups and splitting mixed groups their complete description.\nMoreover, we classify the groups with the clearly related property that every\nsubgroup is essential in a direct summand of the whole group.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:00:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chekhlov","Andrey R.",""],["Danchev","Peter V.",""],["Keef","Patrick W.",""]]}
{"id":"2308.13949","submitter":"Marco Faroni","authors":"Marco Faroni and Dmitry Berenson","title":"Motion Planning as Online Learning: A Multi-Armed Bandit Approach to\n  Kinodynamic Sampling-Based Planning","comments":"8 pages, 7 figure, accepted for publication on IEEE Robotics and\n  Automation Letters 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kinodynamic motion planners allow robots to perform complex manipulation\ntasks under dynamics constraints or with black-box models. However, they\nstruggle to find high-quality solutions, especially when a steering function is\nunavailable. This paper presents a novel approach that adaptively biases the\nsampling distribution to improve the planner's performance. The key\ncontribution is to formulate the sampling bias problem as a non-stationary\nmulti-armed bandit problem, where the arms of the bandit correspond to sets of\npossible transitions. High-reward regions are identified by clustering\ntransitions from sequential runs of kinodynamic RRT and a bandit algorithm\ndecides what region to sample at each timestep. The paper demonstrates the\napproach on several simulated examples as well as a 7-degree-of-freedom\nmanipulation task with dynamics uncertainty, suggesting that the approach finds\nbetter solutions faster and leads to a higher success rate in execution.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:11:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Faroni","Marco",""],["Berenson","Dmitry",""]]}
{"id":"2308.13950","submitter":"Gustavo Dotti","authors":"Gustavo Dotti","title":"Black hole regions containing no trapped surfaces","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A simple criterion is given to rule out the existence of closed trapped\nsurfaces in large open regions inside black holes. The proof is based on a\ncomparison theorem for null hypersurfaces due to G. Galloway.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:14:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dotti","Gustavo",""]]}
{"id":"2308.13951","submitter":"Alexander Izzo","authors":"Alexander J. Izzo","title":"A normal uniform algebra that fails to be strongly regular at a peak\n  point","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown that there exists a normal uniform algebra, on a compact\nmetrizable space, that fails to be strongly regular at some peak point. This\nanswers a 31-year-old question of Joel Feinstein. Our example is R(K) for a\ncertain compact planar set K. Furthermore, it has a totally ordered\none-parameter family of closed primary ideals whose hull is a peak point.\nGeneral results regarding lifting ideals under Cole root extensions are\nestablished. These results are applied to obtain a normal uniform algebra, on a\ncompact metrizable space, with every point a peak point but again having a\ntotally ordered one-parameter family of closed primary ideals.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:20:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Izzo","Alexander J.",""]]}
{"id":"2308.13952","submitter":"Dongyun Han","authors":"Dongyun Han, Donghoon Kim, Kangsoo Kim, Isaac Cho","title":"Exploring the Effects of VR Activities on Stress Relief: A Comparison of\n  Sitting-in-Silence, VR Meditation, and VR Smash Room","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In our lives, we encounter various stressors that may cause negative mental\nand bodily reactions to make us feel frustrated, angry, or irritated. Effective\nmethods to manage or reduce stress and anxiety are essential for a healthy\nlife, and several stress-management approaches are found to be useful for\nstress relief, such as meditation, taking a rest, walking around nature, or\neven breaking things in a smash room. Previous research has revealed that\ncertain experiences in virtual reality (VR) are effective for reducing stress\nas traditional real-world methods. However, it is still unclear how the stress\nrelief effects are associated with other factors like individual user profile\nin terms of different treatment activities. In this paper, we report our\nfindings from a formal user study that investigates the effects of two virtual\nactivities: (1) VR Meditation and (2) VR Smash Room experience, compared with a\ntraditional Sitting-in-Silence method. Our results show that VR Meditation has\na better stress relief effect compared to VR Smash Room and Sitting-in-Silence,\nand the effects of the treatments are correlated with the participants'\npersonalities. We discuss the findings and implications addressing potential\nbenefits/impacts of different stress-relief activities in VR.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:24:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Han","Dongyun",""],["Kim","Donghoon",""],["Kim","Kangsoo",""],["Cho","Isaac",""]]}
{"id":"2308.13953","submitter":"Dongyun Han","authors":"Dongyun Han, Donghoon Kim, Kangsoo Kim, Isaac Cho","title":"Investigating Psychological Ownership in a Shared AR Space: Effects of\n  Human and Object Reality and Object Controllability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Augmented reality (AR) provides users with a unique social space where\nvirtual objects are natural parts of the real world. The users can interact\nwith 3D virtual objects and virtual humans projected onto the physical\nenvironment. This work examines perceived ownership based on the reality of\nobjects and partners, as well as object controllability in a shared AR setting.\nOur formal user study with 28 participants shows a sense of possession,\ncontrol, separation, and partner presence affect their perceived ownership of a\nshared object. Finally, we discuss the findings and present a conclusion.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:28:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Han","Dongyun",""],["Kim","Donghoon",""],["Kim","Kangsoo",""],["Cho","Isaac",""]]}
{"id":"2308.13954","submitter":"Dripta S. Raychaudhuri","authors":"Dripta S. Raychaudhuri, Calvin-Khang Ta, Arindam Dutta, Rohit Lal,\n  Amit K. Roy-Chowdhury","title":"Prior-guided Source-free Domain Adaptation for Human Pose Estimation","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Domain adaptation methods for 2D human pose estimation typically require\ncontinuous access to the source data during adaptation, which can be\nchallenging due to privacy, memory, or computational constraints. To address\nthis limitation, we focus on the task of source-free domain adaptation for pose\nestimation, where a source model must adapt to a new target domain using only\nunlabeled target data. Although recent advances have introduced source-free\nmethods for classification tasks, extending them to the regression task of pose\nestimation is non-trivial. In this paper, we present Prior-guided Self-training\n(POST), a pseudo-labeling approach that builds on the popular Mean Teacher\nframework to compensate for the distribution shift. POST leverages\nprediction-level and feature-level consistency between a student and teacher\nmodel against certain image transformations. In the absence of source data,\nPOST utilizes a human pose prior that regularizes the adaptation process by\ndirecting the model to generate more accurate and anatomically plausible pose\npseudo-labels. Despite being simple and intuitive, our framework can deliver\nsignificant performance gains compared to applying the source model directly to\nthe target data, as demonstrated in our extensive experiments and ablation\nstudies. In fact, our approach achieves comparable performance to recent\nstate-of-the-art methods that use source data for adaptation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:30:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Raychaudhuri","Dripta S.",""],["Ta","Calvin-Khang",""],["Dutta","Arindam",""],["Lal","Rohit",""],["Roy-Chowdhury","Amit K.",""]]}
{"id":"2308.13955","submitter":"Dongyun Han","authors":"Dongyun Han, Isaac Cho","title":"Evaluating 3D User Interaction Techniques on Spatial Working Memory for\n  3D Scatter Plot Exploration in Immersive Analytics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This work evaluates three 3D user interaction techniques to investigate their\nvisuo-spatial working memory support for users' data exploration in immersive\nanalytics. Two techniques are the common VR locomotion technique, Walking and\nTeleportation, while the other one is Grab, an object manipulation technique.\nWe present two formal user studies in VR and AR. Our study is designed based on\nthe Corsi block-tapping Task, a psychological test for assessing visuo-spatial\nworking memory. Our study results show that Walking supports spatial memory\nbest, and Grab follows. Though Teleportation is found to support it the least,\nparticipants rated Teleportation as the easiest way to move in the VR study. We\nalso compare the Walking and Grab results in the VR and AR studies and discuss\ndifferences. At last, we discuss our limitations and future work.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:32:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Han","Dongyun",""],["Cho","Isaac",""]]}
{"id":"2308.13956","submitter":"Harry Pei","authors":"Harry Pei","title":"Reputation Effects with Endogenous Records","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A patient firm interacts with a sequence of consumers. The firm is either an\nhonest type who supplies high quality and never erases its records, or an\nopportunistic type who chooses what quality to supply and may erase its records\nat a low cost. We show that in every equilibrium, the firm has an incentive to\nbuild a reputation for supplying high quality until its continuation value\nexceeds its commitment payoff, but its ex ante payoff must be close to its\nminmax value when it has a sufficiently long lifespan. Therefore, even a small\nfraction of opportunistic types can wipe out the firm's returns from building\nreputations. Even if the honest type can commit to reveal information about its\nhistory according to any disclosure policy, the opportunistic type's payoff\ncannot exceed its equilibrium payoff when the consumers receive no information.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:45:15 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 02:03:49 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Pei","Harry",""]]}
{"id":"2308.13957","submitter":"Samar Khanna","authors":"Samar Khanna, Skanda Vaidyanath, Akash Velu","title":"Differentiable Weight Masks for Domain Transfer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the major drawbacks of deep learning models for computer vision has\nbeen their inability to retain multiple sources of information in a modular\nfashion. For instance, given a network that has been trained on a source task,\nwe would like to re-train this network on a similar, yet different, target task\nwhile maintaining its performance on the source task. Simultaneously,\nresearchers have extensively studied modularization of network weights to\nlocalize and identify the set of weights culpable for eliciting the observed\nperformance on a given task. One set of works studies the modularization\ninduced in the weights of a neural network by learning and analysing weight\nmasks. In this work, we combine these fields to study three such weight masking\nmethods and analyse their ability to mitigate \"forgetting'' on the source task\nwhile also allowing for efficient finetuning on the target task. We find that\ndifferent masking techniques have trade-offs in retaining knowledge in the\nsource task without adversely affecting target task performance.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:45:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khanna","Samar",""],["Vaidyanath","Skanda",""],["Velu","Akash",""]]}
{"id":"2308.13958","submitter":"Apoorv Dankar","authors":"Apoorv Dankar, Adeem Jassani, Kartikaeya Kumar","title":"Improving Knowledge Distillation for BERT Models: Loss Functions,\n  Mapping Methods, and Weight Tuning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The use of large transformer-based models such as BERT, GPT, and T5 has led\nto significant advancements in natural language processing. However, these\nmodels are computationally expensive, necessitating model compression\ntechniques that reduce their size and complexity while maintaining accuracy.\nThis project investigates and applies knowledge distillation for BERT model\ncompression, specifically focusing on the TinyBERT student model. We explore\nvarious techniques to improve knowledge distillation, including experimentation\nwith loss functions, transformer layer mapping methods, and tuning the weights\nof attention and representation loss and evaluate our proposed techniques on a\nselection of downstream tasks from the GLUE benchmark. The goal of this work is\nto improve the efficiency and effectiveness of knowledge distillation, enabling\nthe development of more efficient and accurate models for a range of natural\nlanguage processing tasks.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 20:59:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dankar","Apoorv",""],["Jassani","Adeem",""],["Kumar","Kartikaeya",""]]}
{"id":"2308.13959","submitter":"Jeremy Schlitt","authors":"Jeremy Schlitt","title":"Biases Towards the Zero Residue Class for Quadratic Forms in Arithmetic\n  Progressions","comments":"30 pages, 11 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine a bias towards the zero residue class for the integers represented\nby binary quadratic forms. In many cases, we are able to prove that the bias\ncomes from a secondary term in the associated asymptotic expansion (unlike\nChebyshev's bias, which lives somewhere at the level of $O(x^{1/2+\\epsilon})$.)\nIn some other cases, we are unable to prove that a bias exists, even though it\nis present numerically. We then make a conjecture on the general situation\nwhich includes the cases we could not prove. Many interesting results on the\ndistribution of the integers represented by a quadratic form -- some of which\nare of independent interest -- are proven along the way. The paper concludes\nwith some numerical data that is illustrative of the aforementioned bias.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:10:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Schlitt","Jeremy",""]]}
{"id":"2308.13960","submitter":"Jianyi Lin","authors":"Jianyi Lin","title":"Sparse Models for Machine Learning","comments":"42 pages","journal-ref":null,"doi":"10.1201/9781003283980-5","report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The sparse modeling is an evident manifestation capturing the parsimony\nprinciple just described, and sparse models are widespread in statistics,\nphysics, information sciences, neuroscience, computational mathematics, and so\non. In statistics the many applications of sparse modeling span regression,\nclassification tasks, graphical model selection, sparse M-estimators and sparse\ndimensionality reduction. It is also particularly effective in many statistical\nand machine learning areas where the primary goal is to discover predictive\npatterns from data which would enhance our understanding and control of\nunderlying physical, biological, and other natural processes, beyond just\nbuilding accurate outcome black-box predictors. Common examples include\nselecting biomarkers in biological procedures, finding relevant brain activity\nlocations which are predictive about brain states and processes based on fMRI\ndata, and identifying network bottlenecks best explaining end-to-end\nperformance. Moreover, the research and applications of efficient recovery of\nhigh-dimensional sparse signals from a relatively small number of observations,\nwhich is the main focus of compressed sensing or compressive sensing, have\nrapidly grown and became an extremely intense area of study beyond classical\nsignal processing. Likewise interestingly, sparse modeling is directly related\nto various artificial vision tasks, such as image denoising, segmentation,\nrestoration and superresolution, object or face detection and recognition in\nvisual scenes, and action recognition.\n  In this manuscript, we provide a brief introduction of the basic theory\nunderlying sparse representation and compressive sensing, and then discuss some\nmethods for recovering sparse solutions to optimization problems in effective\nway, together with some applications of sparse recovery in a machine learning\nproblem known as sparse dictionary learning.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:32:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lin","Jianyi",""]]}
{"id":"2308.13961","submitter":"Jiangjie Chen","authors":"Shuang Li, Jiangjie Chen, Siyu Yuan, Xinyi Wu, Hao Yang, Shimin Tao,\n  Yanghua Xiao","title":"Translate Meanings, Not Just Words: IdiomKB's Role in Optimizing\n  Idiomatic Translation with Language Models","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To translate well, machine translation (MT) systems and general-purposed\nlanguage models (LMs) need a deep understanding of both source and target\nlanguages and cultures. Therefore, idioms, with their non-compositional nature,\npose particular challenges for Transformer-based systems, as literal\ntranslations often miss the intended meaning. Traditional methods, which\nreplace idioms using existing knowledge bases (KBs), often lack scale and\ncontext awareness. Addressing these challenges, our approach prioritizes\ncontext awareness and scalability, allowing for offline storage of idioms in a\nmanageable KB size. This ensures efficient serving with smaller models and\nprovides a more comprehensive understanding of idiomatic expressions. We\nintroduce a multilingual idiom KB (IdiomKB) developed using large LMs to\naddress this. This KB facilitates better translation by smaller models, such as\nBLOOMZ (7.1B), Alpaca (7B), and InstructGPT (6.7B), by retrieving idioms'\nfigurative meanings. We present a novel, GPT-4-powered metric for human-aligned\nevaluation, demonstrating that IdiomKB considerably boosts model performance.\nHuman evaluations further validate our KB's quality.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:38:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Shuang",""],["Chen","Jiangjie",""],["Yuan","Siyu",""],["Wu","Xinyi",""],["Yang","Hao",""],["Tao","Shimin",""],["Xiao","Yanghua",""]]}
{"id":"2308.13962","submitter":"Iuliia Skorodumina","authors":"Iu.A. Skorodumina, G.V. Fedotov, R.W. Gothe, the CLAS Collaboration","title":"Double-pion electroproduction off protons in deuterium: quasi-free cross\n  sections and final state interactions","comments":"27 pages, 18 figures, will be sent to Phys. Rev. C","journal-ref":null,"doi":null,"report-no":"JLAB-PHY-23-3898","categories":"nucl-ex hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The single-differential and fully integrated cross sections for quasi-free\n$\\pi^{+}\\pi^{-}$ electroproduction off protons bound in deuterium have been\nextracted for the first time. The experimental data were collected at Jefferson\nLaboratory with the CLAS detector. The measurements were performed in the\nkinematic region of the invariant mass $W$ from 1.3 GeV to 1.825 GeV and photon\nvirtuality $Q^{2}$ from 0.4 GeV$^2$ to 1.0 GeV$^2$. Sufficient experimental\nstatistics allow for narrow binning in all kinematic variables, while\nmaintaining a small statistical uncertainty. The extracted cross sections were\ncompared with the corresponding cross sections off free protons, which allowed\nus to obtain an estimate of the contribution from events in which interactions\nbetween the final-state hadrons and the spectator neutron took place.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:50:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Skorodumina","Iu. A.",""],["Fedotov","G. V.",""],["Gothe","R. W.",""],["Collaboration","the CLAS",""]]}
{"id":"2308.13963","submitter":"Palash Roy","authors":"Ajmain Inqiad Alam, Palash Ranjan Roy, Farouq Al-omari, Chanchal Kumar\n  Roy, Banani Roy, Kevin Schneider","title":"GPTCloneBench: A comprehensive benchmark of semantic clones and\n  cross-language clones using GPT-3 model and SemanticCloneBench","comments":"Accepted in 39th IEEE International Conference on Software\n  Maintenance and Evolution(ICSME 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Machine learning (ML) has made BigCloneBench popular for semantic clone\ndetection tools. However, BigCloneBench only has a few Java semantic clones. In\naddition, due to the design principles of how the benchmark was created,\nimbalance issues have been identified, including the ambiguity in the\ndefinition of semantic clones. Thus, ML-based clone detection algorithms\ntrained on BigCloneBench may overlook semantic clones or report incorrect\nresults. The SemanticCloneBench features Stack Overflow clones of several\nlanguages. However, it lacks samples for ML-based clone detection. There is\nalso a marked lack of cross-language clone benchmarks. The widely used CLCDSA\ndataset lacks reusable examples that can't be used in real-world software\nsystems, making it inadequate for ML-based clone detection. The OpenAI GPT-3\nmodel has shown outstanding text production, including code generation and\nsummarization. In this paper, we used the GPT-3 model to generate a complete\nbenchmark for both semantic and cross-language clones. Using\nSemanticCloneBench's genuine language clones, we tested several prompts to see\nwhich yielded better results using GPT-3 question formulation. Then, we used\nNiCad to filter Type-1 and Type-2 clones from GPT-3 output. We used a\nGUI-assisted Clone Validator tool to manually validate all clone pairings with\nnine judges. Functionality testing and CloneCognition verified our benchmark\nhas no syntactic clones. Later, we validated SourcererCC, Oreo and CLCDSA tools\non our benchmark. The poor performance of these tools suggests GPTCloneBench\nhas no syntactic clone. From 77,207 Clone pairs of SemanticCloneBench/GPT-3\noutput, we created a benchmark with 37,149 genuine semantic clone pairs, 19,288\nfalse semantic pairs, and 20,770 cross-language clones across four languages\n(Java, C, C#, and Python).\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:50:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alam","Ajmain Inqiad",""],["Roy","Palash Ranjan",""],["Al-omari","Farouq",""],["Roy","Chanchal Kumar",""],["Roy","Banani",""],["Schneider","Kevin",""]]}
{"id":"2308.13964","submitter":"Yeqin Liu","authors":"Benjamin Gould, Yeqin Liu","title":"Cones of effective cycles on blow ups of projective spaces along\n  rational curves","comments":"14 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we examine the cones of effective cycles on blow ups of\nprojective spaces along smooth rational curves. We determine explicitly the\ncones of divisors and 1- and 2-dimensional cycles on blow ups of rational\nnormal curves, and strengthen these results in cases of low dimension.\n  Central to our results is the geometry of resolutions of the secant varieties\nof the curves which are blown up, and our computations of their effective\ncycles may be of independent interest.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 21:56:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gould","Benjamin",""],["Liu","Yeqin",""]]}
{"id":"2308.13965","submitter":"Arka Banerjee","authors":"Arka Banerjee, Boris Okun","title":"Coarse cohomology of the complement","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.AT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we define the coarse (co)homology of the complement of a\nsubspace in a metric space, generalizing the coarse (co)homology of Roe. We\ngive a model space which encodes coarse geometric structure of the complement.\nWe also introduce a new approach to coarse Poincar\\'e duality spaces. We prove\na version of coarse Alexander duality for these spaces and give a homological\ncriterion for a space to be a coarse PD($n$) space. Our approach is inspired by\nthe work of Kapovich and Kleiner, but is somewhat different, and we believe,\nsimpler.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:03:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Banerjee","Arka",""],["Okun","Boris",""]]}
{"id":"2308.13966","submitter":"Avik Kumar Das","authors":"Avik kumar Das, Sandeep Kumar Mondal, Raj Prince","title":"Multi-wavelength temporal and spectral study of PKS 0402-362","comments":"8 pages, 1 figure, The 38th International Cosmic Ray Conference\n  (ICRC2023) proceedings","journal-ref":"Proceedings of Science (ICRC2023) 790","doi":"10.22323/1.444.0790","report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the long-term behavior of the bright gamma-ray blazar PKS 0402-362.\nOver a span of approximately 12.5 years, from August 2008 to January 2021, we\ngathered Fermi-LAT temporal data and identified three distinct periods of\nintense $\\gamma$-ray activity. Notably, the second period exhibited the highest\nbrightness ever observed in this particular source. We observed most of the\n$\\gamma$-ray flare peaks to be asymmetric in profile suggesting a slow cooling\ntime of particles or the varying Doppler factor as the main cause of these\nflares. The $\\gamma$-ray spectrum is fitted with power-law and log-parabola\nmodels, and in both cases, the spectral index is very steep. The lack of time\nlags between optical-IR and $\\gamma$-ray emissions indicates the presence of a\nsingle-zone emission model. Using this information, we modeled the broadband\nSEDs with a simple one-zone leptonic model using the publicly available code\n`GAMERA'. The particle distribution index is found to be the same as expected\nin diffusive shock acceleration suggesting it as the main mechanism of particle\nacceleration to very high energy up to 4 - 6 GeV. During the different flux\nphases, we observed that the thermal disk dominates the optical emission,\nindicating that this source presents a valuable opportunity to investigate the\nconnection between the disk and the jet.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:07:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Das","Avik kumar",""],["Mondal","Sandeep Kumar",""],["Prince","Raj",""]]}
{"id":"2308.13967","submitter":"Jakub Konieczny","authors":"Melih Emin Can and Jakub Konieczny and Michal Kupsa and Dominik\n  Kwietniak","title":"Minimal and proximal examples of $\\bar{d}$-stable and\n  $\\bar{d}$-approachable shift spaces","comments":"22 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study shift spaces over a finite alphabet that can be approximated by\nmixing shifts of finite type in the sense of (pseudo)metrics connected to\nOrnstein's $\\bar{d}$ metric ($\\bar{d}$-approachable shift spaces). The class of\n$\\bar{d}$-approachable shifts can be considered as a topological analog of\nmeasure-theoretical Bernoulli systems. The notion of $\\bar{d}$-approachability\ntogether with a closely connected notion of $\\bar{d}$-shadowing were introduced\nby Konieczny, Kupsa, and Kwietniak [in \\emph{Ergodic Theory and Dynamical\nSystems}, vol. \\textbf{43} (2023), issue 3, pp. 943--970]. These notions were\ndeveloped with the aim to significantly generalize specification properties.\nIndeed, many popular variants of the specification property, including the\nclassic one and almost/weak specification property ensure\n$\\bar{d}$-approachability and $\\bar{d}$-shadowing. Here, we study further\nproperties and connections between $\\bar{d}$-shadowing and\n$\\bar{d}$-approachability. We prove that $\\bar{d}$-shadowing implies\n$\\bar{d}$-stability (a notion recently introduced by Tim Austin). We show that\nfor surjective shift spaces with the $\\bar{d}$-shadowing property the Hausdorff\npseudodistance $\\bar{d}^H$ between shift spaces induced by $\\bar{d}$ is the\nsame as the Hausdorff distance between their simiplices of invariant measures\nwith respect to the Hausdorff distance induced by the Ornstein's metric\n$\\bar{d}$ between measures. We prove that without $\\bar{d}$-shadowing this need\nnot to be true (it is known that the former distance always bounds the latter).\nWe provide examples illustrating these results including minimal examples and\nproximal examples of shift spaces with the $\\bar{d}$-shadowing property. The\nexistence of such shift spaces was announced in our earlier paper [op. cit.].\nIt shows that $\\bar{d}$-shadowing indeed generalises the specification\nproperty.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:29:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Can","Melih Emin",""],["Konieczny","Jakub",""],["Kupsa","Michal",""],["Kwietniak","Dominik",""]]}
{"id":"2308.13968","submitter":"Mojtaba A. Farahani","authors":"Mojtaba A. Farahani, Tara Eslaminokandeh","title":"Multivariate time series classification with dual attention network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  One of the topics in machine learning that is becoming more and more relevant\nis multivariate time series classification. Current techniques concentrate on\nidentifying the local important sequence segments or establishing the global\nlong-range dependencies. They frequently disregard the merged data from both\nglobal and local features, though. Using dual attention, we explore a novel\nnetwork (DA-Net) in this research to extract local and global features for\nmultivariate time series classification. The two distinct layers that make up\nDA-Net are the Squeeze-Excitation Window Attention (SEWA) layer and the Sparse\nSelf-Attention within Windows (SSAW) layer. DA- Net can mine essential local\nsequence fragments that are necessary for establishing global long-range\ndependencies based on the two expanded layers.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:47:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Farahani","Mojtaba A.",""],["Eslaminokandeh","Tara",""]]}
{"id":"2308.13969","submitter":"Sharath C Koorathota","authors":"Sharath Koorathota, Nikolas Papadopoulos, Jia Li Ma, Shruti Kumar,\n  Xiaoxiao Sun, Arunesh Mittal, Patrick Adelman, Paul Sajda","title":"Fixating on Attention: Integrating Human Eye Tracking into Vision\n  Transformers","comments":"25 pages, 9 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern transformer-based models designed for computer vision have\noutperformed humans across a spectrum of visual tasks. However, critical tasks,\nsuch as medical image interpretation or autonomous driving, still require\nreliance on human judgments. This work demonstrates how human visual input,\nspecifically fixations collected from an eye-tracking device, can be integrated\ninto transformer models to improve accuracy across multiple driving situations\nand datasets. First, we establish the significance of fixation regions in\nleft-right driving decisions, as observed in both human subjects and a Vision\nTransformer (ViT). By comparing the similarity between human fixation maps and\nViT attention weights, we reveal the dynamics of overlap across individual\nheads and layers. This overlap is exploited for model pruning without\ncompromising accuracy. Thereafter, we incorporate information from the driving\nscene with fixation data, employing a \"joint space-fixation\" (JSF) attention\nsetup. Lastly, we propose a \"fixation-attention intersection\" (FAX) loss to\ntrain the ViT model to attend to the same regions that humans fixated on. We\nfind that the ViT performance is improved in accuracy and number of training\nepochs when using JSF and FAX. These results hold significant implications for\nhuman-guided artificial intelligence.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:48:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Koorathota","Sharath",""],["Papadopoulos","Nikolas",""],["Ma","Jia Li",""],["Kumar","Shruti",""],["Sun","Xiaoxiao",""],["Mittal","Arunesh",""],["Adelman","Patrick",""],["Sajda","Paul",""]]}
{"id":"2308.13970","submitter":"Indrajeet Kumar Sinha","authors":"Indrajeet Kumar Sinha, Shekhar Verma and Krishna Pratap Singh","title":"FAM: fast adaptive meta-learning","comments":"13 Pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we propose a fast adaptive federated meta-learning (FAM)\nframework for collaboratively learning a single global model, which can then be\npersonalized locally on individual clients. Federated learning enables multiple\nclients to collaborate to train a model without sharing data. Clients with\ninsufficient data or data diversity participate in federated learning to learn\na model with superior performance. Nonetheless, learning suffers when data\ndistributions diverge. There is a need to learn a global model that can be\nadapted using client's specific information to create personalised models on\nclients is required. MRI data suffers from this problem, wherein, one, due to\ndata acquisition challenges, local data at a site is sufficient for training an\naccurate model and two, there is a restriction of data sharing due to privacy\nconcerns and three, there is a need for personalization of a learnt shared\nglobal model on account of domain shift across client sites. The global model\nis sparse and captures the common features in the MRI. This skeleton network is\ngrown on each client to train a personalised model by learning additional\nclient-specific parameters from local data. Experimental results show that the\npersonalization process at each client quickly converges using a limited number\nof epochs. The personalized client models outperformed the locally trained\nmodels, demonstrating the efficacy of the FAM mechanism. Additionally, the\nsparse parameter set to be communicated during federated learning drastically\nreduced communication overhead, which makes the scheme viable for networks with\nlimited resources.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 22:54:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sinha","Indrajeet Kumar",""],["Verma","Shekhar",""],["Singh","Krishna Pratap",""]]}
{"id":"2308.13971","submitter":"Waldemar Hebisch","authors":"Waldemar Hebisch","title":"On irreducible representations of free group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that for a suitable class of representations of free group tensor\nproducts are generically irreducible. In particular we prove that there exist\nirreducible boundary realizations with infinite dimensional fiber.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 23:12:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hebisch","Waldemar",""]]}
{"id":"2308.13972","submitter":"Rohit Hiraman Rajput","authors":"Rohit Hiraman Rajput","title":"Towards Autonomous Multi-Modal Mobility Morphobot (M4) Robot:\n  Traversability Estimation and 3D Path Planning","comments":"61 pages, masters thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This thesis enhances the autonomy of the M4 (Multi-Modal Mobility Morphobot)\nrobot, designed for Mars and rescue missions. The research enables the robot to\nautonomously select its locomotion mode and path in complex terrains. Focusing\non walking and flying modes, a Gazebo simulation, and custom\nperception-navigations pipelines are developed. Leveraging deep learning, the\nrobot determines optimal mode transitions based on a 2.5D map. Additionally, an\nenergy efficient path planner based on 2.5D mapping is implemented and\nvalidated in simulations. The contributions demonstrate scalability for future\nmode integrations. The M4 robot showcases intelligent mode switching, efficient\nnavigation, and reduced energy consumption, bringing us closer to fully\nautonomous multi-modal robots for exploration and rescue missions. This work\npaves the way for future advancements in autonomous robotics, with the ultimate\nvision of deploying the M4 robot for exploration and rescue tasks, making a\nsignificant impact in the quest for intelligent and versatile robotic systems.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 23:27:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rajput","Rohit Hiraman",""]]}
{"id":"2308.13973","submitter":"German Lugones","authors":"Mauro Mariani and Germ\\'an Lugones","title":"Quark-hadron pasta phase in neutron stars: the role of medium-dependent\n  surface and curvature tensions","comments":"16 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the properties of the hadron-quark mixed phase, often termed\nthe \\textit{pasta} phase, expected to exist in the cores of massive neutron\nstars. To construct the equations of state (EoS), we combine an analytical\nrepresentation based on the APR EoS for hadronic matter with the MIT bag model\nfeaturing vector interactions for quark matter. For modeling the mixed phase,\nwe utilize the compressible liquid drop model that consistently accounts for\nfinite-size and Coulomb effects. Unlike most previous analyses that treated\nsurface tension as a constant free parameter and neglected curvature tension,\nwe employ microphysical calculations using the multiple reflection expansion\nformalism to determine these parameters, while also ensuring their\nself-consistency with the EoS. We construct an extensive set of mixed hybrid\nEoSs by varying model parameters, solve the stellar structure equations to\nobtain neutron star mass-radius relationships, and select the models that\nsatisfy current astrophysical constraints. Our findings closely align with\ncalculations using a constant surface tension in terms of EoS stiffness and\nresulting stellar structure. However, they reveal significant differences in\nthe types of geometric structures and their prevalence ranges within the mixed\nphase. Specifically, curvature effects enhance the emergence of tubes and\nbubbles at high densities despite the large value of surface tension, while\nsuppressing the existence of drops and rods at low densities.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 23:34:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mariani","Mauro",""],["Lugones","Germ\u00e1n",""]]}
{"id":"2308.13974","submitter":"Antonella Palmese","authors":"Cole Meldorf, Antonella Palmese, Samir Salim","title":"Measuring the dust attenuation law of galaxies using photometric data","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fitting model spectral energy distributions (SED) to galaxy photometric data\nis a widely used method to recover galaxy parameters from galaxy surveys.\nHowever, the parameter space used to describe galaxies is wide and\ninterdependent, and distinctions between real and spurious correlations that\nare found between these parameters can be difficult to discern. In this work,\nwe use the SED fitting code BAGPIPES to investigate degeneracies between galaxy\nparameters and the effect of the choice of different sets of photometric bands.\nIn particular, we focus on optical to infrared wavelength coverage, and on two\nparameters describing the galaxies' dust attenuation law: $A_V$ and $\\delta$,\nwhich characterize dust column density and the slope of a flexible dust\nattenuation law, respectively. We demonstrate that 1) a degeneracy between the\nresidual (the difference between truth and recovered value) $A_V$ and star\nformation rate exists, but this is lifted when WISE bands are included; 2)\nBAGPIPES is able to accurately recover the input $A_V$ and $\\delta$\ndistributions and relations (differences in slope of less than 1.7$\\sigma$ for\na flat relation, less than 1.2$\\sigma$ for an observationally-motivated\nrelation from Salim et al. 2018) and is not introducing spurious correlations\nbetween these parameters. Our findings suggest that the information needed to\nconstrain $A_V$ and $\\delta$ well enough individually exists in the data,\nespecially when IR is added. This indicates that recent works finding a\ncorrelation between $A_V$ and $\\delta$ are not being misled by fitting\ndegeneracies from their SED fitting code.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 00:04:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meldorf","Cole",""],["Palmese","Antonella",""],["Salim","Samir",""]]}
{"id":"2308.13975","submitter":"Anton Izosimov","authors":"Anton Izosimov","title":"Planar networks and simple Lie groups beyond type A","comments":"18 pages, 18 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.CO math.SG nlin.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The general linear group $GL_{n}$, along with its adjoint simple group\n$PGL_n$, can be described by means of weighted planar networks. In this paper\nwe give a network description for simple Lie groups of types $B$ and $C$. The\ncorresponding networks are axially symmetric modulo a sequence of cluster\nmutations along the axis of symmetry. We extend to this setting the result of\nGekhtman, Shapiro, and Vainshtein on the Poisson property of Postnikov's\nboundary measurement map. We also show that $B$ and $C$ type networks with\npositive weights parametrize the totally nonnegative part of the respective\ngroup. Finally, we construct network parametrizations of double Bruhat cells in\nsymplectic and odd-dimensional orthogonal groups, and identify the\ncorresponding face weights with Fock-Goncharov cluster coordinates.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 00:06:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Izosimov","Anton",""]]}
{"id":"2308.13976","submitter":"Yu Wang","authors":"Yu Wang, Xin Xin, Zaiqiao Meng, Xiangnan He, Joemon Jose, Fuli Feng","title":"Label Denoising through Cross-Model Agreement","comments":"arXiv admin note: substantial text overlap with arXiv:2105.09605","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Learning from corrupted labels is very common in real-world machine-learning\napplications. Memorizing such noisy labels could affect the learning of the\nmodel, leading to sub-optimal performances. In this work, we propose a novel\nframework to learn robust machine-learning models from noisy labels. Through an\nempirical study, we find that different models make relatively similar\npredictions on clean examples, while the predictions on noisy examples vary\nmuch more across different models. Motivated by this observation, we propose\n\\em denoising with cross-model agreement \\em (DeCA) which aims to minimize the\nKL-divergence between the true label distributions parameterized by two machine\nlearning models while maximizing the likelihood of data observation. We employ\nthe proposed DeCA on both the binary label scenario and the multiple label\nscenario. For the binary label scenario, we select implicit feedback\nrecommendation as the downstream task and conduct experiments with four\nstate-of-the-art recommendation models on four datasets. For the multiple-label\nscenario, the downstream application is image classification on two benchmark\ndatasets. Experimental results demonstrate that the proposed methods\nsignificantly improve the model performance compared with normal training and\nother denoising methods on both binary and multiple-label scenarios.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 00:31:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yu",""],["Xin","Xin",""],["Meng","Zaiqiao",""],["He","Xiangnan",""],["Jose","Joemon",""],["Feng","Fuli",""]]}
{"id":"2308.13977","submitter":"Ji Xu","authors":"Shu-Man Hu, Wei Wang, Ji Xu and Shuai Zhao","title":"Accessing the subleading-twist $B$-meson light-cone distribution\n  amplitude with Large-Momentum Effective Theory","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Within the framework of large momentum effective theory (LaMET), we propose a\nhard-collinear factorization formula to extract the subleading-twist $B$-meson\nlight-cone distribution amplitude (LCDA) from the quasidistribution amplitude\ncalculated on the lattice. The one-loop matching coefficient and an\nintegro-differential equation governing the evolution of the quasidistribution\namplitude are derived. Our results could be useful either in evaluating the\nsubleading-twist $B$-meson LCDA on the lattice or in the understanding the\nfeasibility of LaMET on higher-twist distributions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 00:32:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Shu-Man",""],["Wang","Wei",""],["Xu","Ji",""],["Zhao","Shuai",""]]}
{"id":"2308.13978","submitter":"Redwan Ahmed Rizvee","authors":"Redwan Ahmed Rizvee, Md. Mosaddek Khan","title":"Understanding the Usage of QUBO-based Hamiltonian Function in\n  Combinatorial Optimization over Graphs: A Discussion Using Max Cut (MC)\n  Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quadratic Unconstrained Binary Optimization (QUBO) is a generic technique to\nmodel various NP-hard combinatorial optimization problems in the form of binary\nvariables. The Hamiltonian function is often used to formulate QUBO problems\nwhere it is used as the objective function in the context of optimization. In\nthis study, we investigate how reinforcement learning-based (RL) paradigms with\nthe presence of the Hamiltonian function can address combinatorial optimization\nproblems over graphs in QUBO formulations. We use Graph Neural Network (GNN) as\nthe message-passing architecture to convey the information among the nodes. We\nhave centered our discussion on QUBO formulated Max-Cut problem but the\nintuitions can be extended to any QUBO supported canonical NP-Hard\ncombinatorial optimization problems. We mainly investigate three formulations,\nMonty-Carlo Tree Search with GNN-based RL (MCTS-GNN), DQN with GNN-based RL,\nand a generic GNN with attention-based RL (GRL). Our findings state that in the\nRL-based paradigm, the Hamiltonian function-based optimization in QUBO\nformulation brings model convergence and can be used as a generic reward\nfunction. We also analyze and present the performance of our RL-based setups\nthrough experimenting over graphs of different densities and compare them with\na simple GNN-based setup in the light of constraint violation, learning\nstability and computation cost. As per one of our findings, all the\narchitectures provide a very comparable performance in sparse graphs as per the\nnumber of constraint violation whreas MCTS-GNN gives the best performance. In\nthe similar criteria, the performance significantly starts to drop both for GRL\nand simple GNN-based setups whereas MCTS-GNN and DQN shines. We also present\nthe corresponding mathematical formulations and in-depth discussion of the\nobserved characteristics during experimentations.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 00:57:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rizvee","Redwan Ahmed",""],["Khan","Md. Mosaddek",""]]}
{"id":"2308.13979","submitter":"Zihan Dong","authors":"Zihan Dong and ZhengDong Zhang","title":"Enhancing Bloodstain Analysis Through AI-Based Segmentation: Leveraging\n  Segment Anything Model for Crime Scene Investigation","comments":"KDD2023 Workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bloodstain pattern analysis plays a crucial role in crime scene\ninvestigations by providing valuable information through the study of unique\nblood patterns. Conventional image analysis methods, like Thresholding and\nContrast, impose stringent requirements on the image background and is\nlabor-intensive in the context of droplet image segmentation. The Segment\nAnything Model (SAM), a recently proposed method for extensive image\nrecognition, is yet to be adequately assessed for its accuracy and efficiency\non bloodstain image segmentation. This paper explores the application of\npre-trained SAM and fine-tuned SAM on bloodstain image segmentation with\ndiverse image backgrounds. Experiment results indicate that both pre-trained\nand fine-tuned SAM perform the bloodstain image segmentation task with\nsatisfactory accuracy and efficiency, while fine-tuned SAM achieves an overall\n2.2\\% accuracy improvement than pre-trained SAM and 4.70\\% acceleration in\nterms of speed for image recognition. Analysis of factors that influence\nbloodstain recognition is carried out. This research demonstrates the potential\napplication of SAM on bloodstain image segmentation, showcasing the\neffectiveness of Artificial Intelligence application in criminology research.\nWe release all code and demos at\n\\url{https://github.com/Zdong104/Bloodstain_Analysis_Ai_Tool}\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:11:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Zihan",""],["Zhang","ZhengDong",""]]}
{"id":"2308.13980","submitter":"Zhiqing Liu","authors":"BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C.\n  Ai, R. Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I.\n  Balossino, Y. Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M.\n  Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A.\n  Briere, A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S.\n  A. Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C.\n  Chen, Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T.\n  Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S.\n  Cheng, S. K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H.\n  L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A.\n  Denig, I. Denysenko, M. Destefanis, F. De~Mori, B. Ding, X. X. Ding, Y. Ding,\n  Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, Z. H.\n  Duan, P. Egorov, Y. L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y. Fang, R.\n  Farinelli, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, K\n  Fischer, M. Fritsch, C. Fritzsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Y. N.\n  Gao, Yang Gao, S. Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M.\n  Gersabeck, A Gilman, K. Goetzen, L. Gong, W. X. Gong, W. Gradl, S. Gramigna,\n  M. Greco, M. H. Gu, Y. T. Gu, C. Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, M.\n  J. Guo, R. P. Guo, Y. P. Guo, A. Guskov, T. T. Han, W. Y. Han, X. Q. Hao, F.\n  A. Harris, K. K. He, K. L. He, F. H. H. Heinsius, C. H. Heinz, Y. K. Heng, C.\n  Herold, T. Holtmann, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou,\n  H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, X.\n  T. Huang, Y. P. Huang, T. Hussain, N H\\\"usken, W. Imoehl, J. Jackson, S.\n  Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L. Ji, Y. Y.\n  Ji, X. Q. Jia, Z. K. Jia, H. J. Jiang, P. C. Jiang, S. S. Jiang, T. J. Jiang,\n  X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, T.\n  Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang,\n  R. Kappert, M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R. Kliemt, O. B.\n  Kolcu, B. Kopf, M. Kuessner, A. Kupsc, W. K\\\"uhn, J. J. Lane, P. Larin, A.\n  Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei, H. Leithoff, M. Lellmann, T. Lenz,\n  C. Li, C. Li, C. H. Li, Cheng Li, D. M. Li, F. Li, G. Li, H. Li, H. B. Li, H.\n  J. Li, H. N. Li, Hui Li, J. R. Li, J. S. Li, J. W. Li, K. L. Li, Ke Li, L. J\n  Li, L. K. Li, Lei Li, M. H. Li, P. R. Li, Q. X. Li, S. X. Li, T. Li, W. D.\n  Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J. Li, Z. X. Li, C.\n  Liang, H. Liang, H. Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L.\n  Z. Liao, Y. P. Liao, J. Libby, A. Limphirat, D. X. Lin, T. Lin, B. J. Liu, B.\n  X. Liu, C. Liu, C. X. Liu, F. H. Liu, Fang Liu, Feng Liu, G. M. Liu, H. Liu,\n  H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui Liu, J. B. Liu, J. L. Liu, J. Y.\n  Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L.\n  Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W. M. Liu, X. Liu, Y. Liu, Y. Liu,\n  Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, X.\n  L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, M. X. Luo, T. Luo, X. L. Luo, X.\n  R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma, J. L. Ma, L. L. Ma, M. M. Ma, Q. M.\n  Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma, Y. M. Ma, F. E. Maas, M. Maggiora,\n  S. Malde, Q. A. Malik, A. Mangoni, Y. J. Mao, Z. P. Mao, S. Marcello, Z. X.\n  Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X.\n  H. Mo, N. Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, I. B. Nikolaev,\n  Z. Ning, S. Nisar, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y.\n  Pan, A. Pathak, P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, K. Peters,\n  J. L. Ping, R. G. Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H. Qi, H.\n  R. Qi, M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q.\n  Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K.\n  J. Ren, A. Rivetti, V. Rodin, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N.\n  Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan,\n  W. Shan, X. Y. Shan, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F.\n  Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q.\n  Q. Shi, R. S. Shi, X. Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y.\n  X. Song, S. Sosio, S. Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H.\n  Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y.\n  Sun, Y. J. Sun, Y. Z. Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J.\n  Tang, Y. A. Tang, L. Y Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H.\n  Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, S. J. Wang, B. Wang, B. L.\n  Wang, Bo Wang, C. W. Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, J. P.\n  Wang, K. Wang, L. L. Wang, M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T.\n  J. Wang, W. Wang, W. Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L.\n  Wang, Y. Wang, Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang,\n  Yaqian Wang, Yi Wang, Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D.\n  H. Wei, F. Weidner, S. P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M.\n  Wolke, L. Wollenberg, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu,\n  Y. Wu, Y. J. Wu, Z. Wu, L. Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, S.\n  Y. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H.\n  Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu,\n  Q. N. Xu, W. Xu, W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, Z. S. Xu, F. Yan, L.\n  Yan, W. B. Yan, W. C. Yan, X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao\n  Yang, Y. Yang, Y. F. Yang, Y. X. Yang, Yifan Yang, Z. W. Yang, Z. P. Yao, M.\n  Ye, M. H. Ye, J. H. Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, T.\n  Yu, X. D. Yu, C. Z. Yuan, L. Yuan, S. C. Yuan, X. Q. Yuan, Y. Yuan, Z. Y.\n  Yuan, C. X. Yue, A. A. Zafar, F. R. Zeng, X. Zeng, Y. Zeng, Y. J. Zeng, X. Y.\n  Zhai, Y. C. Zhai, Y. H. Zhan, A. Q. Zhang, B. L. Zhang, B. X. Zhang, D. H.\n  Zhang, G. Y. Zhang, H. Zhang, H. H. Zhang, H. H. Zhang, H. Q. Zhang, H. Y.\n  Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W. Zhang, J. X. Zhang, J. Y.\n  Zhang, J. Z. Zhang, Jianyu Zhang, Jiawei Zhang, L. M. Zhang, L. Q. Zhang, Lei\n  Zhang, P. Zhang, Q. Y. Zhang, Shuihan Zhang, Shulei Zhang, X. D. Zhang, X. M.\n  Zhang, X. Y. Zhang, Xuyan Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H.\n  Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z. Y. Zhang, Z. Y.\n  Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao, Ling Zhao, M. G.\n  Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B.\n  Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, L.\n  P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, J. Zhu, K.\n  Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu, T. J. Zhu, W. J.\n  Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Search for the light hadron decay $\\chi_{c1}(3872) \\to\n  \\pi^{+}\\pi^{-}\\eta","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With a data sample corresponding to an integrated luminosity of\n11.5~fb$^{-1}$ collected with the BESIII detector operating at the BEPCII\nstorage ring, for the first time the light hadron decay $\\chi_{c1}(3872)\n\\rightarrow \\pi^{+}\\pi^{-}\\eta$ is searched for. While no significant signal is\nobserved, the upper limits at the 90\\% confidence level for $\\sigma[e^{+}e^{-}\n\\rightarrow \\gamma \\chi_{c1}(3872)] \\mathcal{B}[\\chi_{c1}(3872) \\rightarrow\n\\pi^{+}\\pi^{-}\\eta]$ at center-of-mass energies from 4.13 to 4.34 GeV are\ndetermined. By normalizing to the $\\chi_{c1}(3872)\\to\\pi^+\\pi^- J/\\psi$ decay\nchannel, a 90\\% confidence level upper limit for the branching fraction ratio\n$\\mathcal{R}=\\mathcal{B}[\\chi_{c1}(3872)\n\\rightarrow\\pi^{+}\\pi^{-}\\eta]/\\mathcal{B}[\\chi_{c1}(3872) \\rightarrow\n\\pi^{+}\\pi^{-} J/\\psi] < 0.28$ is given. These measurements provide important\ninputs for understanding the internal structure of the $\\chi_{c1}(3872)$\nresonance.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:11:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["BESIII Collaboration","",""],["Ablikim","M.",""],["Achasov","M. N.",""],["Adlarson","P.",""],["Ai","X. C.",""],["Aliberti","R.",""],["Amoroso","A.",""],["An","M. R.",""],["An","Q.",""],["Bai","Y.",""],["Bakina","O.",""],["Balossino","I.",""],["Ban","Y.",""],["Batozskaya","V.",""],["Begzsuren","K.",""],["Berger","N.",""],["Berlowski","M.",""],["Bertani","M.",""],["Bettoni","D.",""],["Bianchi","F.",""],["Bianco","E.",""],["Bortone","A.",""],["Boyko","I.",""],["Briere","R. A.",""],["Brueggemann","A.",""],["Cai","H.",""],["Cai","X.",""],["Calcaterra","A.",""],["Cao","G. F.",""],["Cao","N.",""],["Cetin","S. A.",""],["Chang","J. F.",""],["Chang","T. T.",""],["Chang","W. L.",""],["Che","G. R.",""],["Chelkov","G.",""],["Chen","C.",""],["Chen","Chao",""],["Chen","G.",""],["Chen","H. S.",""],["Chen","M. L.",""],["Chen","S. J.",""],["Chen","S. M.",""],["Chen","T.",""],["Chen","X. R.",""],["Chen","X. T.",""],["Chen","Y. B.",""],["Chen","Y. Q.",""],["Chen","Z. J.",""],["Cheng","W. S.",""],["Choi","S. K.",""],["Chu","X.",""],["Cibinetto","G.",""],["Coen","S. C.",""],["Cossio","F.",""],["Cui","J. J.",""],["Dai","H. L.",""],["Dai","J. P.",""],["Dbeyssi","A.",""],["de Boer","R. E.",""],["Dedovich","D.",""],["Deng","Z. Y.",""],["Denig","A.",""],["Denysenko","I.",""],["Destefanis","M.",""],["De~Mori","F.",""],["Ding","B.",""],["Ding","X. X.",""],["Ding","Y.",""],["Ding","Y.",""],["Dong","J.",""],["Dong","L. Y.",""],["Dong","M. Y.",""],["Dong","X.",""],["Du","M. C.",""],["Du","S. X.",""],["Duan","Z. H.",""],["Egorov","P.",""],["Fan","Y. L.",""],["Fang","J.",""],["Fang","S. S.",""],["Fang","W. X.",""],["Fang","Y.",""],["Farinelli","R.",""],["Fava","L.",""],["Feldbauer","F.",""],["Felici","G.",""],["Feng","C. Q.",""],["Feng","J. H.",""],["Fischer","K",""],["Fritsch","M.",""],["Fritzsch","C.",""],["Fu","C. D.",""],["Fu","J. L.",""],["Fu","Y. W.",""],["Gao","H.",""],["Gao","Y. N.",""],["Gao","Yang",""],["Garbolino","S.",""],["Garzia","I.",""],["Ge","P. T.",""],["Ge","Z. W.",""],["Geng","C.",""],["Gersabeck","E. M.",""],["Gilman","A",""],["Goetzen","K.",""],["Gong","L.",""],["Gong","W. X.",""],["Gradl","W.",""],["Gramigna","S.",""],["Greco","M.",""],["Gu","M. H.",""],["Gu","Y. T.",""],["Guan","C. Y",""],["Guan","Z. L.",""],["Guo","A. Q.",""],["Guo","L. B.",""],["Guo","M. J.",""],["Guo","R. P.",""],["Guo","Y. P.",""],["Guskov","A.",""],["Han","T. T.",""],["Han","W. Y.",""],["Hao","X. Q.",""],["Harris","F. A.",""],["He","K. K.",""],["He","K. L.",""],["Heinsius","F. H. H.",""],["Heinz","C. H.",""],["Heng","Y. K.",""],["Herold","C.",""],["Holtmann","T.",""],["Hong","P. C.",""],["Hou","G. Y.",""],["Hou","X. T.",""],["Hou","Y. R.",""],["Hou","Z. L.",""],["Hu","H. M.",""],["Hu","J. F.",""],["Hu","T.",""],["Hu","Y.",""],["Huang","G. S.",""],["Huang","K. X.",""],["Huang","L. Q.",""],["Huang","X. T.",""],["Huang","Y. P.",""],["Hussain","T.",""],["H\u00fcsken","N",""],["Imoehl","W.",""],["Jackson","J.",""],["Jaeger","S.",""],["Janchiv","S.",""],["Jeong","J. H.",""],["Ji","Q.",""],["Ji","Q. P.",""],["Ji","X. B.",""],["Ji","X. L.",""],["Ji","Y. Y.",""],["Jia","X. Q.",""],["Jia","Z. K.",""],["Jiang","H. J.",""],["Jiang","P. C.",""],["Jiang","S. S.",""],["Jiang","T. J.",""],["Jiang","X. S.",""],["Jiang","Y.",""],["Jiao","J. B.",""],["Jiao","Z.",""],["Jin","S.",""],["Jin","Y.",""],["Jing","M. Q.",""],["Johansson","T.",""],["K.","X.",""],["Kabana","S.",""],["Kalantar-Nayestanaki","N.",""],["Kang","X. L.",""],["Kang","X. S.",""],["Kappert","R.",""],["Kavatsyuk","M.",""],["Ke","B. C.",""],["Khoukaz","A.",""],["Kiuchi","R.",""],["Kliemt","R.",""],["Kolcu","O. B.",""],["Kopf","B.",""],["Kuessner","M.",""],["Kupsc","A.",""],["K\u00fchn","W.",""],["Lane","J. J.",""],["Larin","P.",""],["Lavania","A.",""],["Lavezzi","L.",""],["Lei","T. T.",""],["Lei","Z. H.",""],["Leithoff","H.",""],["Lellmann","M.",""],["Lenz","T.",""],["Li","C.",""],["Li","C.",""],["Li","C. H.",""],["Li","Cheng",""],["Li","D. M.",""],["Li","F.",""],["Li","G.",""],["Li","H.",""],["Li","H. B.",""],["Li","H. J.",""],["Li","H. N.",""],["Li","Hui",""],["Li","J. R.",""],["Li","J. S.",""],["Li","J. W.",""],["Li","K. L.",""],["Li","Ke",""],["Li","L. J",""],["Li","L. K.",""],["Li","Lei",""],["Li","M. H.",""],["Li","P. R.",""],["Li","Q. X.",""],["Li","S. X.",""],["Li","T.",""],["Li","W. D.",""],["Li","W. G.",""],["Li","X. H.",""],["Li","X. L.",""],["Li","Xiaoyu",""],["Li","Y. G.",""],["Li","Z. J.",""],["Li","Z. X.",""],["Liang","C.",""],["Liang","H.",""],["Liang","H.",""],["Liang","H.",""],["Liang","Y. F.",""],["Liang","Y. T.",""],["Liao","G. R.",""],["Liao","L. Z.",""],["Liao","Y. P.",""],["Libby","J.",""],["Limphirat","A.",""],["Lin","D. X.",""],["Lin","T.",""],["Liu","B. J.",""],["Liu","B. X.",""],["Liu","C.",""],["Liu","C. X.",""],["Liu","F. H.",""],["Liu","Fang",""],["Liu","Feng",""],["Liu","G. M.",""],["Liu","H.",""],["Liu","H. B.",""],["Liu","H. M.",""],["Liu","Huanhuan",""],["Liu","Huihui",""],["Liu","J. B.",""],["Liu","J. L.",""],["Liu","J. Y.",""],["Liu","K.",""],["Liu","K. Y.",""],["Liu","Ke",""],["Liu","L.",""],["Liu","L. C.",""],["Liu","Lu",""],["Liu","M. H.",""],["Liu","P. L.",""],["Liu","Q.",""],["Liu","S. B.",""],["Liu","T.",""],["Liu","W. K.",""],["Liu","W. M.",""],["Liu","X.",""],["Liu","Y.",""],["Liu","Y.",""],["Liu","Y. B.",""],["Liu","Z. A.",""],["Liu","Z. Q.",""],["Lou","X. C.",""],["Lu","F. X.",""],["Lu","H. J.",""],["Lu","J. G.",""],["Lu","X. L.",""],["Lu","Y.",""],["Lu","Y. P.",""],["Lu","Z. H.",""],["Luo","C. L.",""],["Luo","M. X.",""],["Luo","T.",""],["Luo","X. L.",""],["Lyu","X. R.",""],["Lyu","Y. F.",""],["Ma","F. C.",""],["Ma","H. L.",""],["Ma","J. L.",""],["Ma","L. L.",""],["Ma","M. M.",""],["Ma","Q. M.",""],["Ma","R. Q.",""],["Ma","R. T.",""],["Ma","X. Y.",""],["Ma","Y.",""],["Ma","Y. M.",""],["Maas","F. E.",""],["Maggiora","M.",""],["Malde","S.",""],["Malik","Q. A.",""],["Mangoni","A.",""],["Mao","Y. J.",""],["Mao","Z. P.",""],["Marcello","S.",""],["Meng","Z. X.",""],["Messchendorp","J. G.",""],["Mezzadri","G.",""],["Miao","H.",""],["Min","T. J.",""],["Mitchell","R. E.",""],["Mo","X. H.",""],["Muchnoi","N. Yu.",""],["Muskalla","J.",""],["Nefedov","Y.",""],["Nerling","F.",""],["Nikolaev","I. B.",""],["Ning","Z.",""],["Nisar","S.",""],["Niu","Y.",""],["Olsen","S. L.",""],["Ouyang","Q.",""],["Pacetti","S.",""],["Pan","X.",""],["Pan","Y.",""],["Pathak","A.",""],["Patteri","P.",""],["Pei","Y. P.",""],["Pelizaeus","M.",""],["Peng","H. P.",""],["Peters","K.",""],["Ping","J. L.",""],["Ping","R. G.",""],["Plura","S.",""],["Pogodin","S.",""],["Prasad","V.",""],["Qi","F. Z.",""],["Qi","H.",""],["Qi","H. R.",""],["Qi","M.",""],["Qi","T. Y.",""],["Qian","S.",""],["Qian","W. B.",""],["Qiao","C. F.",""],["Qin","J. J.",""],["Qin","L. Q.",""],["Qin","X. P.",""],["Qin","X. S.",""],["Qin","Z. H.",""],["Qiu","J. F.",""],["Qu","S. Q.",""],["Redmer","C. F.",""],["Ren","K. J.",""],["Rivetti","A.",""],["Rodin","V.",""],["Rolo","M.",""],["Rong","G.",""],["Rosner","Ch.",""],["Ruan","S. N.",""],["Salone","N.",""],["Sarantsev","A.",""],["Schelhaas","Y.",""],["Schoenning","K.",""],["Scodeggio","M.",""],["Shan","K. Y.",""],["Shan","W.",""],["Shan","X. Y.",""],["Shangguan","J. F.",""],["Shao","L. G.",""],["Shao","M.",""],["Shen","C. P.",""],["Shen","H. F.",""],["Shen","W. H.",""],["Shen","X. Y.",""],["Shi","B. A.",""],["Shi","H. C.",""],["Shi","J. L.",""],["Shi","J. Y.",""],["Shi","Q. Q.",""],["Shi","R. S.",""],["Shi","X.",""],["Song","J. J.",""],["Song","T. Z.",""],["Song","W. M.",""],["Song","Y. J.",""],["Song","Y. X.",""],["Sosio","S.",""],["Spataro","S.",""],["Stieler","F.",""],["Su","Y. J.",""],["Sun","G. B.",""],["Sun","G. X.",""],["Sun","H.",""],["Sun","H. K.",""],["Sun","J. F.",""],["Sun","K.",""],["Sun","L.",""],["Sun","S. S.",""],["Sun","T.",""],["Sun","W. Y.",""],["Sun","Y.",""],["Sun","Y. J.",""],["Sun","Y. Z.",""],["Sun","Z. T.",""],["Tan","Y. X.",""],["Tang","C. J.",""],["Tang","G. Y.",""],["Tang","J.",""],["Tang","Y. A.",""],["Tao","L. Y",""],["Tao","Q. T.",""],["Tat","M.",""],["Teng","J. X.",""],["Thoren","V.",""],["Tian","W. H.",""],["Tian","W. H.",""],["Tian","Y.",""],["Tian","Z. F.",""],["Uman","I.",""],["Wang","S. J.",""],["Wang","B.",""],["Wang","B. L.",""],["Wang","Bo",""],["Wang","C. W.",""],["Wang","D. Y.",""],["Wang","F.",""],["Wang","H. J.",""],["Wang","H. P.",""],["Wang","J. P.",""],["Wang","K.",""],["Wang","L. L.",""],["Wang","M.",""],["Wang","Meng",""],["Wang","S.",""],["Wang","S.",""],["Wang","T.",""],["Wang","T. J.",""],["Wang","W.",""],["Wang","W.",""],["Wang","W. P.",""],["Wang","X.",""],["Wang","X. F.",""],["Wang","X. J.",""],["Wang","X. L.",""],["Wang","Y.",""],["Wang","Y. D.",""],["Wang","Y. F.",""],["Wang","Y. H.",""],["Wang","Y. N.",""],["Wang","Y. Q.",""],["Wang","Yaqian",""],["Wang","Yi",""],["Wang","Z.",""],["Wang","Z. L.",""],["Wang","Z. Y.",""],["Wang","Ziyi",""],["Wei","D.",""],["Wei","D. H.",""],["Weidner","F.",""],["Wen","S. P.",""],["Wenzel","C. W.",""],["Wiedner","U.",""],["Wilkinson","G.",""],["Wolke","M.",""],["Wollenberg","L.",""],["Wu","C.",""],["Wu","J. F.",""],["Wu","L. H.",""],["Wu","L. J.",""],["Wu","X.",""],["Wu","X. H.",""],["Wu","Y.",""],["Wu","Y. J.",""],["Wu","Z.",""],["Xia","L.",""],["Xian","X. M.",""],["Xiang","T.",""],["Xiao","D.",""],["Xiao","G. Y.",""],["Xiao","S. Y.",""],["Xiao","Y. L.",""],["Xiao","Z. J.",""],["Xie","C.",""],["Xie","X. H.",""],["Xie","Y.",""],["Xie","Y. G.",""],["Xie","Y. H.",""],["Xie","Z. P.",""],["Xing","T. Y.",""],["Xu","C. F.",""],["Xu","C. J.",""],["Xu","G. F.",""],["Xu","H. Y.",""],["Xu","Q. J.",""],["Xu","Q. N.",""],["Xu","W.",""],["Xu","W. L.",""],["Xu","X. P.",""],["Xu","Y. C.",""],["Xu","Z. P.",""],["Xu","Z. S.",""],["Yan","F.",""],["Yan","L.",""],["Yan","W. B.",""],["Yan","W. C.",""],["Yan","X. Q.",""],["Yang","H. J.",""],["Yang","H. L.",""],["Yang","H. X.",""],["Yang","Tao",""],["Yang","Y.",""],["Yang","Y. F.",""],["Yang","Y. X.",""],["Yang","Yifan",""],["Yang","Z. W.",""],["Yao","Z. P.",""],["Ye","M.",""],["Ye","M. H.",""],["Yin","J. H.",""],["You","Z. Y.",""],["Yu","B. X.",""],["Yu","C. X.",""],["Yu","G.",""],["Yu","J. S.",""],["Yu","T.",""],["Yu","X. D.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Yuan","S. C.",""],["Yuan","X. Q.",""],["Yuan","Y.",""],["Yuan","Z. Y.",""],["Yue","C. X.",""],["Zafar","A. A.",""],["Zeng","F. R.",""],["Zeng","X.",""],["Zeng","Y.",""],["Zeng","Y. J.",""],["Zhai","X. Y.",""],["Zhai","Y. C.",""],["Zhan","Y. H.",""],["Zhang","A. Q.",""],["Zhang","B. L.",""],["Zhang","B. X.",""],["Zhang","D. H.",""],["Zhang","G. Y.",""],["Zhang","H.",""],["Zhang","H. H.",""],["Zhang","H. H.",""],["Zhang","H. Q.",""],["Zhang","H. Y.",""],["Zhang","J. J.",""],["Zhang","J. L.",""],["Zhang","J. Q.",""],["Zhang","J. W.",""],["Zhang","J. X.",""],["Zhang","J. Y.",""],["Zhang","J. Z.",""],["Zhang","Jianyu",""],["Zhang","Jiawei",""],["Zhang","L. M.",""],["Zhang","L. Q.",""],["Zhang","Lei",""],["Zhang","P.",""],["Zhang","Q. Y.",""],["Zhang","Shuihan",""],["Zhang","Shulei",""],["Zhang","X. D.",""],["Zhang","X. M.",""],["Zhang","X. Y.",""],["Zhang","Xuyan",""],["Zhang","Y.",""],["Zhang","Y.",""],["Zhang","Y. T.",""],["Zhang","Y. H.",""],["Zhang","Yan",""],["Zhang","Yao",""],["Zhang","Z. H.",""],["Zhang","Z. L.",""],["Zhang","Z. Y.",""],["Zhang","Z. Y.",""],["Zhao","G.",""],["Zhao","J.",""],["Zhao","J. Y.",""],["Zhao","J. Z.",""],["Zhao","Lei",""],["Zhao","Ling",""],["Zhao","M. G.",""],["Zhao","S. J.",""],["Zhao","Y. B.",""],["Zhao","Y. X.",""],["Zhao","Z. G.",""],["Zhemchugov","A.",""],["Zheng","B.",""],["Zheng","J. P.",""],["Zheng","W. J.",""],["Zheng","Y. H.",""],["Zhong","B.",""],["Zhong","X.",""],["Zhou","H.",""],["Zhou","L. P.",""],["Zhou","X.",""],["Zhou","X. K.",""],["Zhou","X. R.",""],["Zhou","X. Y.",""],["Zhou","Y. Z.",""],["Zhu","J.",""],["Zhu","K.",""],["Zhu","K. J.",""],["Zhu","L.",""],["Zhu","L. X.",""],["Zhu","S. H.",""],["Zhu","S. Q.",""],["Zhu","T. J.",""],["Zhu","W. J.",""],["Zhu","Y. C.",""],["Zhu","Z. A.",""],["Zou","J. H.",""],["Zu","J.",""]]}
{"id":"2308.13981","submitter":"Shuiyin Liu","authors":"Shuiyin Liu, Amin Sakzad","title":"Lattice Codes for CRYSTALS-Kyber","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This letter describes a lattice encoder for the NIST-recommended post-quantum\nencryption algorithm: Kyber. The key idea is to refine the analysis of Kyber\ndecoding noise. We prove that Kyber decoding noise can be bounded by a sphere.\nThis result shows the Kyber encoding problem is essentially a sphere packing in\na hypercube. Lattice codes are then constructed to ensure denser packing and a\nlower decryption failure rate (DFR). Compared with the original Kyber encoder,\nthe communication cost is reduced by up to 32.6%, the DFR is reduced by a\nfactor of up to 2^{85}. The security arguments remain the same.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:13:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Shuiyin",""],["Sakzad","Amin",""]]}
{"id":"2308.13982","submitter":"Thai Hung Le","authors":"Thanh Duc Hoang, Do Viet Tung, Duy-Hung Nguyen, Bao-Sinh Nguyen, Huy\n  Hoang Nguyen, Hung Le","title":"Universal Graph Continual Learning","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We address catastrophic forgetting issues in graph learning as incoming data\ntransits from one to another graph distribution. Whereas prior studies\nprimarily tackle one setting of graph continual learning such as incremental\nnode classification, we focus on a universal approach wherein each data point\nin a task can be a node or a graph, and the task varies from node to graph\nclassification. We propose a novel method that enables graph neural networks to\nexcel in this universal setting. Our approach perseveres knowledge about past\ntasks through a rehearsal mechanism that maintains local and global structure\nconsistency across the graphs. We benchmark our method against various\ncontinual learning baselines in real-world graph datasets and achieve\nsignificant improvement in average performance and forgetting across tasks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:19:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hoang","Thanh Duc",""],["Tung","Do Viet",""],["Nguyen","Duy-Hung",""],["Nguyen","Bao-Sinh",""],["Nguyen","Huy Hoang",""],["Le","Hung",""]]}
{"id":"2308.13983","submitter":"Tomoyuki Takenawa","authors":"Kazuma Iwase and Tomoyuki Takenawa","title":"Interpolation of mountain weather forecasts by machine learning","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in numerical simulation methods based on physical models\nhave enhanced the accuracy of weather forecasts. However, the precision\ndiminishes in complex terrains like mountainous regions due to the several\nkilometers square grid used in numerical simulations. While statistical machine\nlearning has also significantly advanced, its direct application is difficult\nto utilize physics knowledge. This paper proposes a method that employs machine\nlearning to ``interpolate'' future weather in mountainous regions using current\nobserved data and forecast data from surrounding plains. Generally, weather\nprediction relies on numerical simulations, so this approach can be considered\na hybrid method that indirectly merges numerical simulation and machine\nlearning. The use of binary cross-entropy in precipitation prediction is also\nexamined.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:32:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Iwase","Kazuma",""],["Takenawa","Tomoyuki",""]]}
{"id":"2308.13984","submitter":"Takahiro Shindo","authors":"Takahiro Shindo, Taiju Watanabe, Kein Yamada, Hiroshi Watanabe","title":"Image Coding for Machines with Object Region Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Compression technology is essential for efficient image transmission and\nstorage. With the rapid advances in deep learning, images are beginning to be\nused for image recognition as well as for human vision. For this reason,\nresearch has been conducted on image coding for image recognition, and this\nfield is called Image Coding for Machines (ICM). There are two main approaches\nin ICM: the ROI-based approach and the task-loss-based approach. The former\napproach has the problem of requiring an ROI-map as input in addition to the\ninput image. The latter approach has the problems of difficulty in learning the\ntask-loss, and lack of robustness because the specific image recognition model\nis used to compute the loss function. To solve these problems, we propose an\nimage compression model that learns object regions. Our model does not require\nadditional information as input, such as an ROI-map, and does not use\ntask-loss. Therefore, it is possible to compress images for various image\nrecognition models. In the experiments, we demonstrate the versatility of the\nproposed method by using three different image recognition models and three\ndifferent datasets. In addition, we verify the effectiveness of our model by\ncomparing it with previous methods.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 01:54:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shindo","Takahiro",""],["Watanabe","Taiju",""],["Yamada","Kein",""],["Watanabe","Hiroshi",""]]}
{"id":"2308.13985","submitter":"Yuzheng Hu","authors":"Yuzheng Hu, Ruicheng Xian, Qilong Wu, Qiuling Fan, Lang Yin, Han Zhao","title":"Revisiting Scalarization in Multi-Task Learning: A Theoretical\n  Perspective","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear scalarization, i.e., combining all loss functions by a weighted sum,\nhas been the default choice in the literature of multi-task learning (MTL)\nsince its inception. In recent years, there is a surge of interest in\ndeveloping Specialized Multi-Task Optimizers (SMTOs) that treat MTL as a\nmulti-objective optimization problem. However, it remains open whether there is\na fundamental advantage of SMTOs over scalarization. In fact, heated debates\nexist in the community comparing these two types of algorithms, mostly from an\nempirical perspective. To approach the above question, in this paper, we\nrevisit scalarization from a theoretical perspective. We focus on linear MTL\nmodels and study whether scalarization is capable of fully exploring the Pareto\nfront. Our findings reveal that, in contrast to recent works that claimed\nempirical advantages of scalarization, scalarization is inherently incapable of\nfull exploration, especially for those Pareto optimal solutions that strike the\nbalanced trade-offs between multiple tasks. More concretely, when the model is\nunder-parametrized, we reveal a multi-surface structure of the feasible region\nand identify necessary and sufficient conditions for full exploration. This\nleads to the conclusion that scalarization is in general incapable of tracing\nout the Pareto front. Our theoretical results partially answer the open\nquestions in Xin et al. (2021), and provide a more intuitive explanation on why\nscalarization fails beyond non-convexity. We additionally perform experiments\non a real-world dataset using both scalarization and state-of-the-art SMTOs.\nThe experimental results not only corroborate our theoretical findings, but\nalso unveil the potential of SMTOs in finding balanced solutions, which cannot\nbe achieved by scalarization.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:10:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Yuzheng",""],["Xian","Ruicheng",""],["Wu","Qilong",""],["Fan","Qiuling",""],["Yin","Lang",""],["Zhao","Han",""]]}
{"id":"2308.13986","submitter":"Yixiao Guo","authors":"Yixiao Guo, Pingbing Ming","title":"A Deep Learning Method for Computing Eigenvalues of the Fractional\n  Schr\\\"odinger Operator","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a novel deep learning method for computing eigenvalues of the\nfractional Schr\\\"odinger operator. Our approach combines a newly developed loss\nfunction with an innovative neural network architecture that incorporates prior\nknowledge of the problem. These improvements enable our method to handle both\nhigh-dimensional problems and problems posed on irregular bounded domains. We\nsuccessfully compute up to the first 30 eigenvalues for various fractional\nSchr\\\"odinger operators. As an application, we share a conjecture to the\nfractional order isospectral problem that has not yet been studied.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:17:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Yixiao",""],["Ming","Pingbing",""]]}
{"id":"2308.13987","submitter":"Christopher Sellgren","authors":"Chris Sellgren","title":"Studying the Properties of Soft Kaons in the LDMX ECal","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low energy photonuclear $K^{+/-}$ events have emerged as one of the most\ndifficult backgrounds for the LDMX detector to veto. This report discusses an\nextended study of the properties of soft kaons in the ECal, using a GEANT4\nparticle gun to combat the low statistics of these events. Simulations reveal\nthat the most dangerous events are those in which a kaon decays before reaching\na silicon detector layer. Threshold values are determined for the parameters of\nthe most dangerous kaon events. A study of an enhanced photonuclear sample is\nanalyzed to understand the kinematics of typical and dangerous events. A\ntheoretical model for energy loss is incorporated for corroboration and to\nprovide further predictions. The results of the three approaches of study are\nshown to provide complimentary predictions. A key result is that events with\n$E_k > 200$ MeV and $\\theta < 60^\\circ$ are expected to produce a 3-hit track\nin at least 95\\% of cases, while events on the other side of this threshold\nwill be expected to produce fewer than 3 hits in about 40\\% of all cases.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:38:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sellgren","Chris",""]]}
{"id":"2308.13988","submitter":"Haizhou Zhao","authors":"Lei Yu, Haizhou Zhao, Siying Qin, Yuqing Chen","title":"A Robot Leg with Compact Variable Stiffness Joint based on Leaf-Spring\n  Mechanism","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The legged robots with variable stiffness actuators (VSAs) can achieve\nenergy-efficient and versatile locomotion. However, equipping legged robots\nwith VSAs in real-world application is usually restricted by (i) the redundant\nmechanical structure design, (ii) limited stiffness variation range and speed,\nand (iii) high energy consumption in stiffness modulation. In this paper, we\npresent a novel Variable-Length Leaf-Spring Actuator (VLLSA) in legged robots\nthat aims to address the aforementioned limitations. The design is based on\nleaf-spring mechanism and we improve the structural design to make the proposed\nVSA (i) compact and lightweight in mechanical structure, (ii) precise in\ntheoretical modeling, and (iii) capable of modulating stiffness with wide\nrange, fast speed, and low energy consumption. Hardware experiments validate\nthat the legged robot equipped with the proposed VLLSA has compact structure,\nhigh dynamic performance and low energy consumption.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:49:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yu","Lei",""],["Zhao","Haizhou",""],["Qin","Siying",""],["Chen","Yuqing",""]]}
{"id":"2308.13989","submitter":"Junho Kim","authors":"Junho Kim, Changwoon Choi, Hojun Jang, Young Min Kim","title":"LDL: Line Distance Functions for Panoramic Localization","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce LDL, a fast and robust algorithm that localizes a panorama to a\n3D map using line segments. LDL focuses on the sparse structural information of\nlines in the scene, which is robust to illumination changes and can potentially\nenable efficient computation. While previous line-based localization approaches\ntend to sacrifice accuracy or computation time, our method effectively observes\nthe holistic distribution of lines within panoramic images and 3D maps.\nSpecifically, LDL matches the distribution of lines with 2D and 3D line\ndistance functions, which are further decomposed along principal directions of\nlines to increase the expressiveness. The distance functions provide coarse\npose estimates by comparing the distributional information, where the poses are\nfurther optimized using conventional local feature matching. As our pipeline\nsolely leverages line geometry and local features, it does not require costly\nadditional training of line-specific features or correspondence matching.\nNevertheless, our method demonstrates robust performance on challenging\nscenarios including object layout changes, illumination shifts, and large-scale\nscenes, while exhibiting fast pose search terminating within a matter of\nmilliseconds. We thus expect our method to serve as a practical solution for\nline-based localization, and complement the well-established point-based\nparadigm. The code for LDL is available through the following link:\nhttps://github.com/82magnolia/panoramic-localization.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:57:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Junho",""],["Choi","Changwoon",""],["Jang","Hojun",""],["Kim","Young Min",""]]}
{"id":"2308.13990","submitter":"Shijie Zhong","authors":"Shijie Zhong, Rui Ni","title":"On the breakup frequency of bubbles and droplets in turbulence: a\n  compilation and evaluation of experimental data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dispersed phase in liquid-liquid emulsions and air-liquid mixtures can\noften be fragmented into smaller sizes by the surrounding turbulent carrier\nphase. The critical parameter that controls this process is the breakup\nfrequency, which is defined from the breakup kernel in the population balance\nequation. The breakup frequency controls how long it takes for the dispersed\nphase reaches the terminal size distribution for given turbulence. In this\narticle, we try to summarize the key experimental results and compile the\nexisting datasets under a consistent framework to find out what is the\ncharacteristic timescale of the problem and how to account for the inner\ndensity and viscosity of the dispersed phase. Furthermore, by pointing out the\ninconsistency of existing experimental data, the key important unsolved\nquestions and related problems on the breakup frequency of bubbles and droplets\nare discussed.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:58:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Shijie",""],["Ni","Rui",""]]}
{"id":"2308.13991","submitter":"Gadwal Madhuri","authors":"G.Madhuri, Atul Negi","title":"JL-lemma derived Optimal Projections for Discriminative Dictionary\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG eess.SP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  To overcome difficulties in classifying large dimensionality data with a\nlarge number of classes, we propose a novel approach called JLSPCADL. This\npaper uses the Johnson-Lindenstrauss (JL) Lemma to select the dimensionality of\na transformed space in which a discriminative dictionary can be learned for\nsignal classification. Rather than reducing dimensionality via random\nprojections, as is often done with JL, we use a projection transformation\nmatrix derived from Modified Supervised PC Analysis (M-SPCA) with the\nJL-prescribed dimension.\n  JLSPCADL provides a heuristic to deduce suitable distortion levels and the\ncorresponding Suitable Description Length (SDL) of dictionary atoms to derive\nan optimal feature space and thus the SDL of dictionary atoms for better\nclassification. Unlike state-of-the-art dimensionality reduction-based\ndictionary learning methods, a projection transformation matrix derived in a\nsingle step from M-SPCA provides maximum feature-label consistency of the\ntransformed space while preserving the cluster structure of the original data.\nDespite confusing pairs, the dictionary for the transformed space generates\ndiscriminative sparse coefficients, with fewer training samples.\nExperimentation demonstrates that JLSPCADL scales well with an increasing\nnumber of classes and dimensionality. Improved label consistency of features\ndue to M-SPCA helps to classify better. Further, the complexity of training a\ndiscriminative dictionary is significantly reduced by using SDL.\nExperimentation on OCR and face recognition datasets shows relatively better\nclassification performance than other supervised dictionary learning\nalgorithms.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 02:59:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Madhuri","G.",""],["Negi","Atul",""]]}
{"id":"2308.13992","submitter":"William He","authors":"William He, Shivam Nadimpalli","title":"Testing Junta Truncation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC cs.DS math.PR math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the basic statistical problem of detecting truncation of the\nuniform distribution on the Boolean hypercube by juntas. More concretely, we\ngive upper and lower bounds on the problem of distinguishing between i.i.d.\nsample access to either (a) the uniform distribution over $\\{0,1\\}^n$, or (b)\nthe uniform distribution over $\\{0,1\\}^n$ conditioned on the satisfying\nassignments of a $k$-junta $f: \\{0,1\\}^n\\to\\{0,1\\}$.\n  We show that (up to constant factors) $\\min\\{2^k + \\log{n\\choose k},\n{2^{k/2}\\log^{1/2}{n\\choose k}}\\}$ samples suffice for this task and also show\nthat a $\\log{n\\choose k}$ dependence on sample complexity is unavoidable. Our\nresults suggest that testing junta truncation requires learning the set of\nrelevant variables of the junta.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:09:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["He","William",""],["Nadimpalli","Shivam",""]]}
{"id":"2308.13993","submitter":"Yongzhi Zhang","authors":"Xinhong Feng, Yongzhi Zhang, Rui Xiong, Chun Wang","title":"Comprehensive performance comparison among different types of features\n  in data-driven battery state of health estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Battery state of health (SOH), which informs the maximal available capacity\nof the battery, is a key indicator of battery aging failure. Accurately\nestimating battery SOH is a vital function of the battery management system\nthat remains to be addressed. In this study, a physics-informed Gaussian\nprocess regression (GPR) model is developed for battery SOH estimation, with\nthe performance being systematically compared with that of different types of\nfeatures and machine learning (ML) methods. The method performance is validated\nbased on 58826 cycling data units of 118 cells. Experimental results show that\nthe physics-driven ML generally estimates more accurate SOH than other\nnon-physical features under different scenarios. The physical features-based\nGPR predicts battery SOH with the errors being less than 1.1% based on 10 to 20\nmins' relaxation data. And the high robustness and generalization capability of\nthe methodology is also validated against different ratios of training and test\ndata under unseen conditions. Results also highlight the more effective\ncapability of knowledge transfer between different types of batteries with the\nphysical features and GPR. This study demonstrates the excellence of physical\nfeatures in indicating the state evolution of complex systems, and the improved\nindication performance of these features by combining a suitable ML method.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:13:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Feng","Xinhong",""],["Zhang","Yongzhi",""],["Xiong","Rui",""],["Wang","Chun",""]]}
{"id":"2308.13994","submitter":"Lu Wang","authors":"Lu Wang, Zhen Xing, Congbo Cai, Zhong Chen, Dairong Cao, Shuhui Cai","title":"DSC-MRI derived relative CBV maps synthesized from IVIM-MRI\n  data:Application in glioma IDH mutation status identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Objectives:To develop a framework for obtaining dynamic susceptibility\ncontrast magnetic resonance imaging (DSC-MRI) derived relative cerebral blood\nvolume (rCBV) maps without gadolinium-based contrast agent (GBCA) injection.\nMethods:This retrospective study included 146 patients (124 IDH wildtype; 22\nIDH mutation) diagnosed with glioma. The DSC-MRI-derived rCBV maps were\nsynthesized from intravoxel incoherent motion (IVIM) MRI data by the deep\nneural network trained only with IDH wildtype data due to thedata imbalance.\nLinear regression analysis, Pearson correlation coefficient, and Bland-Altman\nanalysis, were done to evaluate the consistency between real and synthetic rCBV\nmaps. The generalizability of the proposed framework was evaluated with IDH\nmutation data. IDH mutation status identification ability of real and synthetic\nrCBV maps was analyzed and compared using ROC analysis and the DeLong test.\nResults:Linear regression analysis shows a linear relationship between real and\nsynthetic rCBV maps with a relatively high Pearson correlation coefficient (IDH\nwildtype: Pearson P = 0.7536; IDH mutation: Pearson P = 0.8933). Bland-Altman\nanalysis between real and synthetic rCBV maps shows that almost all the data\ndistribute within the 95% limits of agreement (IDH wildtype: 19 of 20 [95%];\nIDH mutation: 19 of 20 [95%]). ROC analysis and the DeLong test show that the\nIDH mutation status identification abilities of real (AUC = 0.8375) and\nsynthetic rCBV (AUC = 0.8325) are comparable and show no significant difference\n(P = 0.9075). Conclusions:It is feasible to obtain DSC-MRI-derived rCBV maps\nwithout the injection of GBCA. The synthetic rCBV map shows high consistency\nwith real one.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:13:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Lu",""],["Xing","Zhen",""],["Cai","Congbo",""],["Chen","Zhong",""],["Cao","Dairong",""],["Cai","Shuhui",""]]}
{"id":"2308.13995","submitter":"Shanshan Wang","authors":"Ruoyou Wu, Cheng Li, Juan Zou, Shanshan Wang","title":"Generalizable Learning Reconstruction for Accelerating MR Imaging via\n  Federated Neural Architecture Search","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Heterogeneous data captured by different scanning devices and imaging\nprotocols can affect the generalization performance of the deep learning\nmagnetic resonance (MR) reconstruction model. While a centralized training\nmodel is effective in mitigating this problem, it raises concerns about privacy\nprotection. Federated learning is a distributed training paradigm that can\nutilize multi-institutional data for collaborative training without sharing\ndata. However, existing federated learning MR image reconstruction methods rely\non models designed manually by experts, which are complex and computational\nexpensive, suffering from performance degradation when facing heterogeneous\ndata distributions. In addition, these methods give inadequate consideration to\nfairness issues, namely, ensuring that the model's training does not introduce\nbias towards any specific dataset's distribution. To this end, this paper\nproposes a generalizable federated neural architecture search framework for\naccelerating MR imaging (GAutoMRI). Specifically, automatic neural architecture\nsearch is investigated for effective and efficient neural network\nrepresentation learning of MR images from different centers. Furthermore, we\ndesign a fairness adjustment approach that can enable the model to learn\nfeatures fairly from inconsistent distributions of different devices and\ncenters, and thus enforce the model generalize to the unseen center. Extensive\nexperiments show that our proposed GAutoMRI has better performances and\ngeneralization ability compared with six state-of-the-art federated learning\nmethods. Moreover, the GAutoMRI model is significantly more lightweight, making\nit an efficient choice for MR image reconstruction tasks. The code will be made\navailable at https://github.com/ternencewu123/GAutoMRI.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:16:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wu","Ruoyou",""],["Li","Cheng",""],["Zou","Juan",""],["Wang","Shanshan",""]]}
{"id":"2308.13996","submitter":"Yongzhi Zhang","authors":"Mingyuan Zhao, Yongzhi Zhang","title":"Improve in-situ life prediction and classification performance by\n  capturing both the present state and evolution rate of battery aging","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study develops a methodology by capturing both the battery aging state\nand degradation rate for improved life prediction performance. The aging state\nis indicated by six physical features of an equivalent circuit model that are\nextracted from the voltage relaxation data. And the degradation rate is\ncaptured by two features extracted from the differences between the voltage\nrelaxation curves within a moving window (for life prediction), or the\ndifferences between the capacity vs. voltage curves at different cycles (for\nlife classification). Two machine learning models, which are constructed based\non Gaussian Processes, are used to describe the relationships between these\nphysical features and battery lifetimes for the life prediction and\nclassification, respectively. The methodology is validated with the aging data\nof 74 battery cells of three different types. Experimental results show that\nbased on only 3-12 minutes' sampling data, the method with novel features\npredicts accurate battery lifetimes, with the prediction accuracy improved by\nup to 67.09% compared with the benchmark method. And the batteries are\nclassified into three groups (long, medium, and short) with an overall accuracy\nlarger than 90% based on only two adjacent cycles' information, enabling the\nhighly efficient regrouping of retired batteries.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:24:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Mingyuan",""],["Zhang","Yongzhi",""]]}
{"id":"2308.13997","submitter":"Xiaotong Fu","authors":"Jing Zhou, Xiaotong Fu, Xirong Li, Wei Feng, Zhang Zhang, Ying Ji","title":"Adaptive Fusion of Radiomics and Deep Features for Lung Adenocarcinoma\n  Subtype Recognition","comments":"7 pages, 5 figures and 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The most common type of lung cancer, lung adenocarcinoma (LUAD), has been\nincreasingly detected since the advent of low-dose computed tomography\nscreening technology. In clinical practice, pre-invasive LUAD (Pre-IAs) should\nonly require regular follow-up care, while invasive LUAD (IAs) should receive\nimmediate treatment with appropriate lung cancer resection, based on the cancer\nsubtype. However, prior research on diagnosing LUAD has mainly focused on\nclassifying Pre-IAs/IAs, as techniques for distinguishing different subtypes of\nIAs have been lacking. In this study, we proposed a multi-head attentional\nfeature fusion (MHA-FF) model for not only distinguishing IAs from Pre-IAs, but\nalso for distinguishing the different subtypes of IAs. To predict the subtype\nof each nodule accurately, we leveraged both radiomics and deep features\nextracted from computed tomography images. Furthermore, those features were\naggregated through an adaptive fusion module that can learn attention-based\ndiscriminative features. The utility of our proposed method is demonstrated\nhere by means of real-world data collected from a multi-center cohort.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:54:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Jing",""],["Fu","Xiaotong",""],["Li","Xirong",""],["Feng","Wei",""],["Zhang","Zhang",""],["Ji","Ying",""]]}
{"id":"2308.13998","submitter":"Yulin Wang","authors":"Yulin Wang, Yizeng Han, Chaofei Wang, Shiji Song, Qi Tian, Gao Huang","title":"Computation-efficient Deep Learning for Computer Vision: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over the past decade, deep learning models have exhibited considerable\nadvancements, reaching or even exceeding human-level performance in a range of\nvisual perception tasks. This remarkable progress has sparked interest in\napplying deep networks to real-world applications, such as autonomous vehicles,\nmobile devices, robotics, and edge computing. However, the challenge remains\nthat state-of-the-art models usually demand significant computational\nresources, leading to impractical power consumption, latency, or carbon\nemissions in real-world scenarios. This trade-off between effectiveness and\nefficiency has catalyzed the emergence of a new research focus: computationally\nefficient deep learning, which strives to achieve satisfactory performance\nwhile minimizing the computational cost during inference. This review offers an\nextensive analysis of this rapidly evolving field by examining four key areas:\n1) the development of static or dynamic light-weighted backbone models for the\nefficient extraction of discriminative deep representations; 2) the specialized\nnetwork architectures or algorithms tailored for specific computer vision\ntasks; 3) the techniques employed for compressing deep learning models; and 4)\nthe strategies for deploying efficient deep networks on hardware platforms.\nAdditionally, we provide a systematic discussion on the critical challenges\nfaced in this domain, such as network architecture design, training schemes,\npractical efficiency, and more realistic model compression approaches, as well\nas potential future research directions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 03:55:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yulin",""],["Han","Yizeng",""],["Wang","Chaofei",""],["Song","Shiji",""],["Tian","Qi",""],["Huang","Gao",""]]}
{"id":"2308.13999","submitter":"Wei Liu","authors":"Wei Liu and Ruoxue Wu and Ruchun Zuo","title":"A Milstein-type method for highly non-linear non-autonomous time-changed\n  stochastic differential equations","comments":"25 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A Milstein-type method is proposed for some highly non-linear non-autonomous\ntime-changed stochastic differential equations (SDEs). The spatial variables in\nthe coefficients of the time-changed SDEs satisfy the super-linear growth\ncondition and the temporal variables obey some H\\\"older's continuity condition.\nThe strong convergence in the finite time is studied and the convergence order\nis obtained.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:02:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Wei",""],["Wu","Ruoxue",""],["Zuo","Ruchun",""]]}
{"id":"2308.14000","submitter":"Xiaotong Fu","authors":"Xiaotong Fu, Xiangyu Meng, Jing Zhou, Ying Ji","title":"High-risk Factor Prediction in Lung Cancer Using Thin CT Scans: An\n  Attention-Enhanced Graph Convolutional Network Approach","comments":"7 pages, 3 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lung cancer, particularly in its advanced stages, remains a leading cause of\ndeath globally. Though early detection via low-dose computed tomography (CT) is\npromising, the identification of high-risk factors crucial for surgical mode\nselection remains a challenge. Addressing this, our study introduces an\nAttention-Enhanced Graph Convolutional Network (AE-GCN) model to classify\nwhether there are high-risk factors in stage I lung cancer based on the\npreoperative CT images. This will aid surgeons in determining the optimal\nsurgical method before the operation. Unlike previous studies that relied on 3D\npatch techniques to represent nodule spatial features, our method employs a GCN\nmodel to capture the spatial characteristics of pulmonary nodules.\nSpecifically, we regard each slice of the nodule as a graph vertex, and the\ninherent spatial relationships between slices form the edges. Then, to enhance\nthe expression of nodule features, we integrated both channel and spatial\nattention mechanisms with a pre-trained VGG model for adaptive feature\nextraction from pulmonary nodules. Lastly, the effectiveness of the proposed\nmethod is demonstrated using real-world data collected from the hospitals,\nthereby emphasizing its potential utility in the clinical practice.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:24:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fu","Xiaotong",""],["Meng","Xiangyu",""],["Zhou","Jing",""],["Ji","Ying",""]]}
{"id":"2308.14001","submitter":"Peter Blair Blakie","authors":"P. Blair Blakie","title":"Superfluid fraction tensor of a two-dimensional supersolid","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the superfluid fraction of crystalline stationary states\nwithin the framework of mean-field Gross-Pitaevskii theory. Our primary focus\nis on a two-dimensional system with a non-local soft-core interaction, where\nthe superfluid fraction is described by a rank-2 tensor. We analyze and\nestablish connections between methods for calculating the superfluid tensor\nderived from analysis of the nonclassical translational inertia and the\neffective mass. We then apply these methods for crystalline states exhibiting\ntriangular, square, and stripe geometries across a broad range of interaction\nparameters. Factors leading to an anisotropic superfluid fraction tensor are\nalso considered. We also refine the Leggett bounds for the superfluid fraction\nto an accurate approach that involves a calculation using the density profile\nover a single unit cell. We systematically compare these bounds to our full\nnumerical results, and other results in the literature. This work is of direct\nrelevance to other supersolid systems of current interest, such as supersolids\nproduced using dipolar Bose-Einstein condensates.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:24:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Blakie","P. Blair",""]]}
{"id":"2308.14002","submitter":"Janche Sang","authors":"Janche Sang and Chansu Yu","title":"Hands-on Quantum Programming Labs for EECS Students","comments":"68 pages, 29 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ed-ph cs.DC quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report presents a practical approach to teaching quantum computing to\ncomputer science students through dedicated hands-on programming labs. The labs\ncover a diverse range of topics, encompassing fundamental elements, such as\nentanglement, quantum gates and circuits, as well as advanced algorithms\nincluding Quantum Key Distribution, Deutsch and Deutsch-Jozsa Algorithms,\nSimon's algorithm, and Grover's algorithm. As educators, we aim to share our\nteaching insights and resources with fellow instructors in the field, The full\nlab handouts and program templates are provided for interested instructors.\nFurthermore, the report elucidates the rationale behind the design of each\nexperiment, enabling a deeper understanding of quantum computing.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:31:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sang","Janche",""],["Yu","Chansu",""]]}
{"id":"2308.14003","submitter":"David Jacobs","authors":"David M. Jacobs, Marko Horbatsch","title":"Fitting for the energy levels of hydrogen","comments":"6 pages of main text, 3 figures. Accepted by J. Phys. B","journal-ref":null,"doi":"10.1088/1361-6455/acf428","report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Atomic hydrogen energy levels calculated to high precision are required to\nassist experimental researchers working on spectroscopy in the pursuit of\ntesting quantum electrodynamics (QED) and probing for physics beyond the\nStandard Model. There are two important parts to the problem of computing these\nlevels: an accurate evaluation of contributions from QED and using an accurate\nvalue for the proton charge radius as an input. Recent progress on QED\ncorrections to the fine structure, as well as increasing evidence that a proton\ncharge radius in the range of 0.84 fm is favored over the previously adopted\nlarger value in the 0.88 fm range, has advanced the field, yet several\nstate-of-the-art measurements remain in contradiction with this smaller value.\nMotivated by on-going and future work in this area, we present here a simple\nparameterization for the energy levels of hydrogen at the level of hyperfine\nstructure using the so-called relativistic Ritz approach. The fitting of a\nfinite sample of QED-generated levels at low to intermediate principal quantum\nnumber, $n$, gives a generally applicable formula for \\emph{all} values of $n$\nfor each distinct angular momentum channel, given in this work up to orbital\nangular momentum number $\\ell=30$. We also provide a simple linear\nparameterization for the shift in hydrogen energy levels as a function of the\nproton radius, providing a useful cross check for extant and future measured\nenergy intervals.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:34:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jacobs","David M.",""],["Horbatsch","Marko",""]]}
{"id":"2308.14004","submitter":"Chapman Siu","authors":"Chapman Siu","title":"Online GentleAdaBoost -- Technical Report","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the online variant of GentleAdaboost, where we combine a weak\nlearner to a strong learner in an online fashion. We provide an approach to\nextend the batch approach to an online approach with theoretical justifications\nthrough application of line search. Finally we compare our online boosting\napproach with other online approaches across a variety of benchmark datasets.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:41:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Siu","Chapman",""]]}
{"id":"2308.14005","submitter":"Junho Kim","authors":"Junho Kim, Eun Sun Lee, Young Min Kim","title":"Calibrating Panoramic Depth Estimation for Practical Localization and\n  Mapping","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The absolute depth values of surrounding environments provide crucial cues\nfor various assistive technologies, such as localization, navigation, and 3D\nstructure estimation. We propose that accurate depth estimated from panoramic\nimages can serve as a powerful and light-weight input for a wide range of\ndownstream tasks requiring 3D information. While panoramic images can easily\ncapture the surrounding context from commodity devices, the estimated depth\nshares the limitations of conventional image-based depth estimation; the\nperformance deteriorates under large domain shifts and the absolute values are\nstill ambiguous to infer from 2D observations. By taking advantage of the\nholistic view, we mitigate such effects in a self-supervised way and fine-tune\nthe network with geometric consistency during the test phase. Specifically, we\nconstruct a 3D point cloud from the current depth prediction and project the\npoint cloud at various viewpoints or apply stretches on the current input image\nto generate synthetic panoramas. Then we minimize the discrepancy of the 3D\nstructure estimated from synthetic images without collecting additional data.\nWe empirically evaluate our method in robot navigation and map-free\nlocalization where our method shows large performance enhancements. Our\ncalibration method can therefore widen the applicability under various external\nconditions, serving as a key component for practical panorama-based machine\nvision systems.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 04:50:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Junho",""],["Lee","Eun Sun",""],["Kim","Young Min",""]]}
{"id":"2308.14006","submitter":"Zhenglin Chen","authors":"Zhenglin Chen, Jiaqi Yang, Likun Zhang, Haifei Guana, Zhengyang Lei,\n  Xiaopeng Zhang, Canhui Yang, Ying Zhua, Qianhui Sun, Lulu Xua, Ziheng Zhanga,\n  Sen Zeng, Chuhui Wang, Rongxu Yan, Chong Zhang, Peter E Lobie, Dongmei Yu,\n  Peiwu Qin, Can Yang Zhang","title":"Biocompatible wearable touch panel based on ionically conductive organic\n  hydrogels with anti-freezing, anti-dehydration, self-healing, and underwater\n  adhesion properties","comments":"7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Next-generation touch panels are poised to benefit from the use of\nstretchable and transparent soft ionic conductors, but these materials face\nseveral challenges in practical application, including structural damage, loss\nof functionality, and device stratification, particularly in extreme\nenvironments. To address these challenges, in this work, a biocompatible,\ntransparent, self-adhesive gelatin-PAA-based organic hydrogel (PC-OH) was\ndeveloped, the gel can adhere to the skin in both air and underwater conditions\nand also anti-freezing, anti-drying, fast self-healable (with a self-healing\ntime of less than 4s in air and underwater), long-term stable for up to 7 days\nat a wide range of temperatures, highly stretchable, and conductive over a wide\ntemperature range. Using this organic hydrogel, an organic hydrogel-based\nsurface capacitive touch system has been developed that can detect finger touch\nposition in wet environments and over a wide temperature range, demonstrating\nits ability to sense finger touch position. The wearable touch panel has been\nsuccessfully demonstrated through the ability to write text, draw figures, and\nplay electronic games, showcasing its potential use in various applications.\nThis breakthrough has significant implications for the development of\nnext-generation touch panels, particularly in the healthcare, sports, and\nentertainment industries, where reliable and versatile human-machine interfaces\nare essential.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 05:08:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Zhenglin",""],["Yang","Jiaqi",""],["Zhang","Likun",""],["Guana","Haifei",""],["Lei","Zhengyang",""],["Zhang","Xiaopeng",""],["Yang","Canhui",""],["Zhua","Ying",""],["Sun","Qianhui",""],["Xua","Lulu",""],["Zhanga","Ziheng",""],["Zeng","Sen",""],["Wang","Chuhui",""],["Yan","Rongxu",""],["Zhang","Chong",""],["Lobie","Peter E",""],["Yu","Dongmei",""],["Qin","Peiwu",""],["Zhang","Can Yang",""]]}
{"id":"2308.14007","submitter":"Orian Leitersdorf","authors":"Orian Leitersdorf, Ronny Ronen, Shahar Kvatinsky","title":"CUDA-PIM: End-to-End Integration of Digital Processing-in-Memory from\n  High-Level C++ to Microarchitectural Design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Digital processing-in-memory (PIM) architectures mitigate the memory wall\nproblem by facilitating parallel bitwise operations directly within memory.\nRecent works have demonstrated their algorithmic potential for accelerating\ndata-intensive applications; however, there remains a significant gap in the\nprogramming model and microarchitectural design. This is further exacerbated by\nthe emerging model of partitions, which significantly complicates control and\nperiphery. Therefore, inspired by NVIDIA CUDA, this paper provides an\nend-to-end architectural integration of digital memristive PIM from an abstract\nhigh-level C++ programming interface for vector operations to the low-level\nmicroarchitecture.\n  We begin by proposing an efficient microarchitecture and instruction set\narchitecture (ISA) that bridge the gap between the low-level control periphery\nand an abstraction of PIM parallelism into warps and threads. We subsequently\npropose a PIM compilation library that converts high-level C++ to ISA\ninstructions, and a PIM driver that translates ISA instructions into PIM\nmicro-operations. This drastically simplifies the development of PIM\napplications and enables PIM integration within larger existing C++ CPU/GPU\nprograms for heterogeneous computing with significant ease.\n  Lastly, we present an efficient GPU-accelerated simulator for the proposed\nPIM microarchitecture. Although slower than a theoretical PIM chip, this\nsimulator provides an accessible platform for developers to start executing and\ndebugging PIM algorithms. To validate our approach, we implement\nstate-of-the-art matrix operations and FFT PIM-based algorithms as case\nstudies. These examples demonstrate drastically simplified development without\ncompromising performance, showing the potential and significance of CUDA-PIM.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 05:12:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Leitersdorf","Orian",""],["Ronen","Ronny",""],["Kvatinsky","Shahar",""]]}
{"id":"2308.14008","submitter":"Alexander Kuntsevich","authors":"N.P. Stepina, A.O. Bazhenov, A.V. Shumilin, A.Yu. Kuntsevich, V.V.\n  Kirienko, E.S. Zhdanov, D.V. Ishchenko, O.E. Tereshchenko","title":"Indication of novel magnetoresistance mechanism in\n  (Bi,Sb)$_2$(Te,Se)$_3$ 3D topological insulator thin films","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Electron states with the spin-momentum-locked Dirac dispersion at the surface\nof a three-dimensional (3D) topological insulator are known to lead to weak\nantilocalization (WAL), i.e. low temperature and low-magnetic field quantum\ninterference-induced positive magnetoresistance (MR). In this work we report on\nthe MR measurements in (Bi,Sb)$_2$(Te,Se)$_3$ 3D topological insulator thin\nfilms epitaxially grown on Si(111), demonstrating an anomalous WAL amplitude.\nThis anomalously high amplitude of WAL can not be explained by parabolic or\nlinear MR and indicates the existence of an additional, MR mechanism. Another\nsupporting observation is not linear in the classically weak magnetic field\nHall effect in the same films. The increase of the low-field Hall coefficient,\nwith respect to the higher-field value, reaches 10$\\%$. We consistently explain\nboth transport features within a two-liquid model, where the mobility of one of\nthe components drops strongly in a weak magnetic field. We argue that this\ndependence may arise from the Zeeman field induced gap opening mechanism.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 05:23:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Stepina","N. P.",""],["Bazhenov","A. O.",""],["Shumilin","A. V.",""],["Kuntsevich","A. Yu.",""],["Kirienko","V. V.",""],["Zhdanov","E. S.",""],["Ishchenko","D. V.",""],["Tereshchenko","O. E.",""]]}
{"id":"2308.14009","submitter":"Jiamin Zhuang","authors":"Jiamin Zhuang, Jing Yu, Yang Ding, Xiangyan Qu, Yue Hu","title":"Towards Fast and Accurate Image-Text Retrieval with Self-Supervised\n  Fine-Grained Alignment","comments":"Accepted in IEEE Transactions on Multimedia (TMM)","journal-ref":"IEEE Transactions on Multimedia ( Early Access ), 29 May 2023","doi":"10.1109/TMM.2023.3280734","report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Image-text retrieval requires the system to bridge the heterogenous gap\nbetween vision and language for accurate retrieval while keeping the network\nlightweight-enough for efficient retrieval. Existing trade-off solutions mainly\nstudy from the view of incorporating cross-modal interactions with the\nindependent-embedding framework or leveraging stronger pretrained encoders,\nwhich still demand time-consuming similarity measurement or heavyweight model\nstructure in the retrieval stage. In this work, we propose an image-text\nalignment module SelfAlign on top of the independent-embedding framework, which\nimproves the retrieval accuracy while maintains the retrieval efficiency\nwithout extra supervision. SelfAlign contains two collaborative sub-modules\nthat force image-text alignment at both concept level and context level by\nself-supervised contrastive learning. It does not require cross-modal embedding\ninteractions during training while maintaining independent image and text\nencoders during retrieval. With comparable time cost, SelfAlign consistently\nboosts the accuracy of state-of-the-art non-pretraining independent-embedding\nmodels respectively by 9.1%, 4.2% and 6.6% in terms of R@sum score on\nFlickr30K, MSCOCO 1K and MS-COCO 5K datasets. The retrieval accuracy also\noutperforms most existing interactive-embedding models with orders of magnitude\ndecrease in retrieval time. The source code is available at:\nhttps://github.com/Zjamie813/SelfAlign.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 05:45:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhuang","Jiamin",""],["Yu","Jing",""],["Ding","Yang",""],["Qu","Xiangyan",""],["Hu","Yue",""]]}
{"id":"2308.14010","submitter":"Arpan Sadhukhan","authors":"Arpan Sadhukhan","title":"Shift-like graph with high odd girth and high chromatic number","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is known that shift graphs constructed by Erdos and Hajnal have some\ninteresting properties, such as being triangle-free and whose chromatic number\ncan be arbitrarily large. Given any graph $G$, we construct a completely new\ngraph $S(G)$, using the structure of the graph $G$. This can be seen as a\nabstraction of shift graphs in some sense. We discuss some interesting\nproperties of $S(G)$ that are inherited from the properties of the graph $G$.\nWe also study some structural properties of $S(G)$ that are independent from\nthe choice of $G$. As a consequence we give explicit constructions of graphs\nwith high odd girth, high chromatic number and local chromatic number bounded\nby $3$. We also prove that the $4$-hole-free induced subgraphs of the\ntriangle-free shift graphs $G_{n,2}$ have a chromatic number bounded by $4$,\nwhich improves a general bound from a recent theorem on the chromatic number of\n$H$-free induced subgraphs of high chromatic graphs, specifically in the case\nwhere $H$ is a $4$-hole.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 05:56:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sadhukhan","Arpan",""]]}
{"id":"2308.14011","submitter":"Wenjian Liu","authors":"Wenjian Liu","title":"Comment on \"Theoretical examination of QED Hamiltonian in relativistic\n  molecular orbital theory'' [J. Chem. Phys. 159, 054105 (2023)]","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The internal inconsistence and mistakes of the titled paper are analyzed in\ndepth, leading to that the conclusions therein should be revised.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:13:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Wenjian",""]]}
{"id":"2308.14012","submitter":"Shengcai Liu","authors":"Wenjie Chen, Shengcai Liu, Yew-Soon Ong, Ke Tang","title":"Neural Influence Estimator: Towards Real-time Solutions to Influence\n  Blocking Maximization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-time solutions to the influence blocking maximization (IBM) problems are\ncrucial for promptly containing the spread of misinformation. However,\nachieving this goal is non-trivial, mainly because assessing the blocked\ninfluence of an IBM problem solution typically requires plenty of expensive\nMonte Carlo simulations (MCSs). Although several approaches have been proposed\nto enhance efficiency, they still fail to achieve real-time solutions to IBM\nproblems of practical scales. This work presents a novel approach that enables\nsolving IBM problems with hundreds of thousands of nodes and edges in seconds.\nThe key idea is to construct a fast-to-evaluate surrogate model, called neural\ninfluence estimator (NIE), as a substitute for the time-intensive MCSs. To this\nend, a learning problem is formulated to build the NIE that takes the\nfalse-and-true information instance as input, extracts features describing the\ntopology and inter-relationship between two seed sets, and predicts the blocked\ninfluence. A well-trained NIE can generalize across different IBM problems\ndefined on a social network, and can be readily combined with existing IBM\noptimization algorithms such as the greedy algorithm. The experiments on 25 IBM\nproblems with up to millions of edges show that the NIE-based optimization\nmethod can be up to four orders of magnitude faster than MCSs-based\noptimization method to achieve the same solution quality. Moreover, given a\nreal-time constraint of one minute, the NIE-based method can solve IBM problems\nwith up to hundreds of thousands of nodes, which is at least one order of\nmagnitude larger than what can be solved by existing methods.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:16:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Wenjie",""],["Liu","Shengcai",""],["Ong","Yew-Soon",""],["Tang","Ke",""]]}
{"id":"2308.14013","submitter":"Jinbo Ren","authors":"Pietro Corvaja, Julian Demeio, Andrei Rapinchuk, Jinbo Ren, Umberto\n  Zannier","title":"Purely exponential parametrizations and their group-theoretic\n  applications","comments":"31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is mainly motivated by the analysis of the so-called Bounded\nGeneration property (BG) of linear groups (in characteristic $0$), which is\nknown to admit far-reaching group-theoretic implications.\n  We achieve complete answers to certain longstanding open questions about\nBounded Generation (sharpening considerably some earlier results). For\ninstance, we prove that {\\em linear groups boundedly generated by semi-simple\nelements are necessarily virtually abelian}. This is obtained as a corollary of\nsparseness of subsets which are likewise generated.\n  In the paper in fact we go further, framing (BG) in the more general context\nof (Purely) Exponential Parametrizations (PEP) for subsets of affine spaces, a\nconcept which unifies different issues. Using deep tools from Diophantine\nGeometry (including the Subspace Theorem), we systematically develop a theory\nshowing in particular that for a (PEP) set over a number field, the asymptotic\ndistribution of its points of Height at most $T$ is always $\\sim c(\\log T)^r$,\nwith certain constants $c$ and $r$. (This shape fits with a well-known\nviewpoint first put forward by Manin.)\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:16:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Corvaja","Pietro",""],["Demeio","Julian",""],["Rapinchuk","Andrei",""],["Ren","Jinbo",""],["Zannier","Umberto",""]]}
{"id":"2308.14014","submitter":"He Zhang","authors":"Yao Lyu, He Zhang, John M. Carroll","title":"Reconnecting An International Travel Network: The Personal\n  Infrastructuring Work of International Travelers in A Multi-facet Crisis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In times of crisis, international travel becomes tenuous and anxiety\nprovoking. The crisis informatics and Human-Computer Interaction (HCI)\ncommunity has paid increasing attention to the use of Information and\nCommunication Technologies (ICTs) in various crisis settings. However, little\nis known about the travelers' actual experiences in whole trips in crises. In\nthis paper, we bridge the gap by presenting a study on Chinese travelers'\nencounters in their international journeys to the US during a multifacet crisis\nand their use of ICTs to overcome difficulties in the journeys. We interviewed\n22 Chinese travelers who had successfully come to the US during the crisis. The\nfindings showed how travelers improvised to reconnect the broken international\ntravel infrastructure. We also discuss the findings with the literature on\ninfrastructure, and crisis informatics, and provide design implications for\ntravel authorities and agencies.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:22:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lyu","Yao",""],["Zhang","He",""],["Carroll","John M.",""]]}
{"id":"2308.14015","submitter":"Yifeng Liu","authors":"Yi-Feng Liu, Rui-Yao Ren, Dai-Bao Hou, Hai-Zhong Weng, Bo-Wen Wang,\n  Ke-Jie Huang, Xing Lin, Feng Liu, Chen-Hui Li, Chao-Yuan Jin","title":"Slimmed optical neural networks with multiplexed neuron sets and a\n  corresponding backpropagation training algorithm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to their intrinsic capabilities on parallel signal processing, optical\nneural networks (ONNs) have attracted extensive interests recently as a\npotential alternative to electronic artificial neural networks (ANNs) with\nreduced power consumption and low latency. Preliminary confirmation of the\nparallelism in optical computing has been widely done by applying the\ntechnology of wavelength division multiplexing (WDM) in the linear\ntransformation part of neural networks. However, inter-channel crosstalk has\nobstructed WDM technologies to be deployed in nonlinear activation in ONNs.\nHere, we propose a universal WDM structure called multiplexed neuron sets (MNS)\nwhich apply WDM technologies to optical neurons and enable ONNs to be further\ncompressed. A corresponding back-propagation (BP) training algorithm is\nproposed to alleviate or even cancel the influence of inter-channel crosstalk\non MNS-based WDM-ONNs. For simplicity, semiconductor optical amplifiers (SOAs)\nare employed as an example of MNS to construct a WDM-ONN trained with the new\nalgorithm. The result shows that the combination of MNS and the corresponding\nBP training algorithm significantly downsize the system and improve the energy\nefficiency to tens of times while giving similar performance to traditional\nONNs.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:24:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Yi-Feng",""],["Ren","Rui-Yao",""],["Hou","Dai-Bao",""],["Weng","Hai-Zhong",""],["Wang","Bo-Wen",""],["Huang","Ke-Jie",""],["Lin","Xing",""],["Liu","Feng",""],["Li","Chen-Hui",""],["Jin","Chao-Yuan",""]]}
{"id":"2308.14016","submitter":"Gabriele Oligeri","authors":"Bader Al-Sada, Alireza Sadighian, Gabriele Oligeri","title":"MITRE ATT&CK: State of the Art and Way Forward","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  MITRE ATT&CK is a comprehensive framework of adversary tactics, techniques\nand procedures based on real-world observations. It has been used as a\nfoundation for threat modelling in different sectors, such as government,\nacademia and industry. To the best of our knowledge, no previous work has been\ndevoted to the comprehensive collection, study and investigation of the current\nstate of the art leveraging the MITRE ATT&CK framework. We select and inspect\nmore than fifty major research contributions, while conducting a detailed\nanalysis of their methodology and objectives in relation to the MITRE ATT&CK\nframework. We provide a categorization of the identified papers according to\ndifferent criteria such as use cases, application scenarios, adopted\nmethodologies and the use of additional data. Finally, we discuss open issues\nand future research directions involving not only the MITRE ATT&CK framework\nbut also the fields of risk analysis and cyber-threat intelligence at large.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:26:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Al-Sada","Bader",""],["Sadighian","Alireza",""],["Oligeri","Gabriele",""]]}
{"id":"2308.14017","submitter":"Maha Driss","authors":"Safa Ben Atitallah, Maha Driss, Henda Ben Ghezala","title":"Revolutionizing Disease Diagnosis: A Microservices-Based Architecture\n  for Privacy-Preserving and Efficient IoT Data Analytics Using Federated\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning-based disease diagnosis applications are essential for accurate\ndiagnosis at various disease stages. However, using personal data exposes\ntraditional centralized learning systems to privacy concerns. On the other\nhand, by positioning processing resources closer to the device and enabling\nmore effective data analyses, a distributed computing paradigm has the\npotential to revolutionize disease diagnosis. Scalable architectures for data\nanalytics are also crucial in healthcare, where data analytics results must\nhave low latency and high dependability and reliability. This study proposes a\nmicroservices-based approach for IoT data analytics systems to satisfy privacy\nand performance requirements by arranging entities into fine-grained, loosely\nconnected, and reusable collections. Our approach relies on federated learning,\nwhich can increase disease diagnosis accuracy while protecting data privacy.\nAdditionally, we employ transfer learning to obtain more efficient models.\nUsing more than 5800 chest X-ray images for pneumonia detection from a publicly\navailable dataset, we ran experiments to assess the effectiveness of our\napproach. Our experiments reveal that our approach performs better in\nidentifying pneumonia than other cutting-edge technologies, demonstrating our\napproach's promising potential detection performance.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:31:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Atitallah","Safa Ben",""],["Driss","Maha",""],["Ghezala","Henda Ben",""]]}
{"id":"2308.14018","submitter":"Mingshuai Yao","authors":"Mingshuai Yao, Yabo Zhang, Xianhui Lin, Xiaoming Li, Wangmeng Zuo","title":"VQ-Font: Few-Shot Font Generation with Structure-Aware Enhancement and\n  Quantization","comments":"13 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Few-shot font generation is challenging, as it needs to capture the\nfine-grained stroke styles from a limited set of reference glyphs, and then\ntransfer to other characters, which are expected to have similar styles.\nHowever, due to the diversity and complexity of Chinese font styles, the\nsynthesized glyphs of existing methods usually exhibit visible artifacts, such\nas missing details and distorted strokes. In this paper, we propose a\nVQGAN-based framework (i.e., VQ-Font) to enhance glyph fidelity through token\nprior refinement and structure-aware enhancement. Specifically, we pre-train a\nVQGAN to encapsulate font token prior within a codebook. Subsequently, VQ-Font\nrefines the synthesized glyphs with the codebook to eliminate the domain gap\nbetween synthesized and real-world strokes. Furthermore, our VQ-Font leverages\nthe inherent design of Chinese characters, where structure components such as\nradicals and character components are combined in specific arrangements, to\nrecalibrate fine-grained styles based on references. This process improves the\nmatching and fusion of styles at the structure level. Both modules collaborate\nto enhance the fidelity of the generated fonts. Experiments on a collected font\ndataset show that our VQ-Font outperforms the competing methods both\nquantitatively and qualitatively, especially in generating challenging styles.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:32:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yao","Mingshuai",""],["Zhang","Yabo",""],["Lin","Xianhui",""],["Li","Xiaoming",""],["Zuo","Wangmeng",""]]}
{"id":"2308.14019","submitter":"Amir Mafi","authors":"Mozhgan Koolani, Amir Mafi and Parasto Soufivand","title":"An upper bound on stability of powers of matroidal ideals","comments":"7 pages. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.CO math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $R=K[x_1,\\ldots,x_n]$ be a polynomial ring in $n$ variables over a field\n$K$ and $I$ be a matroidal ideal of degree $d$. Let $\\astab(I)$ and $\\dstab(I)$\nbe the smallest integers $l$ and $k$, for which $\\Ass(I^l)$ and $\\depth(R/I^k)$\nstabilize, respectively. In this paper, we show that\n$\\astab(I),\\dstab(I)\\leq\\min\\{d,\\ell(I)\\}$, where $\\ell(I)$ is the analytic\nspread of $I$. Furthermore, by a counterexample we give a negative answer to\nthe conjecture of Herzog and Qureshi \\cite{HQ} about stability of matroidal\nideals.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:35:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Koolani","Mozhgan",""],["Mafi","Amir",""],["Soufivand","Parasto",""]]}
{"id":"2308.14020","submitter":"Oscar Stenhammar","authors":"Oscar Stenhammar, Gabor Fodor, Carlo Fischione","title":"A Comparison of Neural Networks for Wireless Channel Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NI eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of modern wireless communications systems depends critically\non the quality of the available channel state information (CSI) at the\ntransmitter and receiver. Several previous works have proposed concepts and\nalgorithms that help maintain high quality CSI even in the presence of high\nmobility and channel aging, such as temporal prediction schemes that employ\nneural networks. However, it is still unclear which neural network-based scheme\nprovides the best performance in terms of prediction quality, training\ncomplexity and practical feasibility. To investigate such a question, this\npaper first provides an overview of state-of-the-art neural networks applicable\nto channel prediction and compares their performance in terms of prediction\nquality. Next, a new comparative analysis is proposed for four promising neural\nnetworks with different prediction horizons. The well-known tapped delay\nchannel model recommended by the Third Generation Partnership Program is used\nfor a standardized comparison among the neural networks. Based on this\ncomparative evaluation, the advantages and disadvantages of each neural network\nare discussed and guidelines for selecting the best-suited neural network in\nchannel prediction applications are given.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:39:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Stenhammar","Oscar",""],["Fodor","Gabor",""],["Fischione","Carlo",""]]}
{"id":"2308.14021","submitter":"Volodymyr Akhmetov Dr","authors":"S.I. Denyshchenko, P.N. Fedorov, V.S. Akhmetov, A.B. Velichko and A.M.\n  Dmytrenko","title":"Determining the parameters of the spiral arms of the Galaxy from\n  kinematic tracers based on Gaia DR3 data","comments":"8 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the results of determining the parameters of the spiral arms of\nthe Galaxy using the stars Gaia DR3, whose absolute magnitude is $M_G$ < 4, and\nwhich allow tracing spiral arms at large distances from the Sun. As tracers of\nspiral arms, we use the centroids of stellar spherical regions with a radius of\n0.5 kpc, in which the deformation velocities along the coordinate axis R are\ninsignificant. These kinematic tracers cover the Galactic plane within the\nGalactocentric coordinate ranges 140{\\deg} < ${\\theta}$ < 220{\\deg} and 4 kpc <\nR < 14 kpc. The numerical values of the pitch angles of the spirals and their\nGalactocentric distances to the point of intersection of the spiral with the\ndirection of the Galactic center - the Sun are in good agreement with the\nresults of other authors. By extrapolating beyond the data we have, we present\na schematic four-arm global pattern, consisting of the Scutum-Centaurus,\nSagitarius-Carina, Perseus, Norma-Outer arms, as well as the local arm Orion.\nThe uncertainties of the determined spiral parameters confirm that the\nstructures identified are not false, but are reliable from the statistical\npoint of view.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:42:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Denyshchenko","S. I.",""],["Fedorov","P. N.",""],["Akhmetov","V. S.",""],["Velichko","A. B.",""],["Dmytrenko","A. M.",""]]}
{"id":"2308.14022","submitter":"Pietro Fre","authors":"Pietro G. Fr\\'e","title":"Lectures on resolutions \\`a la Kronheimer of orbifold singularities,\n  McKay quivers for Gauge Theories on D3 branes, and the issue of Ricci flat\n  metrics on the resolved three-folds","comments":"170 pages, about 25 figures, Lectures given at the Albert Einstein\n  Institute in Potsdam (Germany) late June, July 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.AG math.GR math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The present Lecture Notes have been prepared to back up a series of a few\nseminars given by the author at the Albert Einstein Institute in Potsdam. These\nNotes aim at reviewing a research project conducted over the last six years\nabout a quite interesting and challenging topic, namely the use of the\ngeneralized Kronheimer construction and the generalized McKay correspondence\nfor the crepant resolution $Y^\\Gamma_{[3]} \\to \\frac{\\mathbb{C}^3}{\\Gamma}$ of\norbifold singularities, $\\Gamma$ being s finite subgroup of $\\mathrm{SU(3)}$,\nas a strategic tool to construct holographic dual pairs of $\\mathcal{N}=1$\ngauge theories in $D=4$ and D3-brane solutions of type IIB supergravity. The\nproject, developed by Ugo Bruzzo with the present author, in various\nco-authorships with Massimo Bianchi, Anna Fino, Pietro Antonio Grassi, Dimitry\nMarkushevich, Dario Martelli, Mario Trigiante and Umar Shahzad, is still going\non and there are a lot of interesting unanswered questions that are illustrated\nthroughout these Lecture Notes and particularly emphasized in its last chapter.\nThe mathematical roots of this project are very robust and ramified in\ndifferential geometry, group theory and algebraic geometry. A particularly\nchallenging issue is that of constructing Ricci flat metrics on the total space\nof line-bundles over compact K\\\"ahler manifolds of real dimension four. In that\ndirection the symplectic action/angle formalism turns out to be a winning\nweapon. The ultimate goal is that of deducing all the aspects of holographic\nduality from finite group theory or, to be more precise, SU(3) finite subgroups\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 06:44:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fr\u00e9","Pietro G.",""]]}
{"id":"2308.14023","submitter":"Ashish Ramayee Asokan","authors":"Sunandini Sanyal, Ashish Ramayee Asokan, Suvaansh Bhambri, Akshay\n  Kulkarni, Jogendra Nath Kundu, R. Venkatesh Babu","title":"Domain-Specificity Inducing Transformers for Source-Free Domain\n  Adaptation","comments":"ICCV 2023. Project page: http://val.cds.iisc.ac.in/DSiT-SFDA","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conventional Domain Adaptation (DA) methods aim to learn domain-invariant\nfeature representations to improve the target adaptation performance. However,\nwe motivate that domain-specificity is equally important since in-domain\ntrained models hold crucial domain-specific properties that are beneficial for\nadaptation. Hence, we propose to build a framework that supports\ndisentanglement and learning of domain-specific factors and task-specific\nfactors in a unified model. Motivated by the success of vision transformers in\nseveral multi-modal vision problems, we find that queries could be leveraged to\nextract the domain-specific factors. Hence, we propose a novel\nDomain-specificity-inducing Transformer (DSiT) framework for disentangling and\nlearning both domain-specific and task-specific factors. To achieve\ndisentanglement, we propose to construct novel Domain-Representative Inputs\n(DRI) with domain-specific information to train a domain classifier with a\nnovel domain token. We are the first to utilize vision transformers for domain\nadaptation in a privacy-oriented source-free setting, and our approach achieves\nstate-of-the-art performance on single-source, multi-source, and multi-target\nbenchmarks\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:04:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sanyal","Sunandini",""],["Asokan","Ashish Ramayee",""],["Bhambri","Suvaansh",""],["Kulkarni","Akshay",""],["Kundu","Jogendra Nath",""],["Babu","R. Venkatesh",""]]}
{"id":"2308.14024","submitter":"Hongda Liu","authors":"Hongda Liu, Yunlong Wang, Min Ren, Junxing Hu, Zhengquan Luo, Guangqi\n  Hou, Zhenan Sun","title":"Balanced Representation Learning for Long-tailed Skeleton-based Action\n  Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Skeleton-based action recognition has recently made significant progress.\nHowever, data imbalance is still a great challenge in real-world scenarios. The\nperformance of current action recognition algorithms declines sharply when\ntraining data suffers from heavy class imbalance. The imbalanced data actually\ndegrades the representations learned by these methods and becomes the\nbottleneck for action recognition. How to learn unbiased representations from\nimbalanced action data is the key to long-tailed action recognition. In this\npaper, we propose a novel balanced representation learning method to address\nthe long-tailed problem in action recognition. Firstly, a spatial-temporal\naction exploration strategy is presented to expand the sample space\neffectively, generating more valuable samples in a rebalanced manner. Secondly,\nwe design a detached action-aware learning schedule to further mitigate the\nbias in the representation space. The schedule detaches the representation\nlearning of tail classes from training and proposes an action-aware loss to\nimpose more effective constraints. Additionally, a skip-modal representation is\nproposed to provide complementary structural information. The proposed method\nis validated on four skeleton datasets, NTU RGB+D 60, NTU RGB+D 120, NW-UCLA,\nand Kinetics. It not only achieves consistently large improvement compared to\nthe state-of-the-art (SOTA) methods, but also demonstrates a superior\ngeneralization capacity through extensive experiments. Our code is available at\nhttps://github.com/firework8/BRL.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:25:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Hongda",""],["Wang","Yunlong",""],["Ren","Min",""],["Hu","Junxing",""],["Luo","Zhengquan",""],["Hou","Guangqi",""],["Sun","Zhenan",""]]}
{"id":"2308.14025","submitter":"David Garcia-Retuerta","authors":"David Garc\\'ia-Retuerta","title":"Challenges and perspectives in LMD: comparative study and intelligent\n  mobility proposal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Last Mile Delivery (LMD) refers to the last and most inefficient part of\nthe supply chain. This is caused by the spatial distribution of disperse small\nreceiving points, the ever-growing demand for faster shipment and the new time\nconstraints of deliveries. Moreover, the small urban vehicles used for package\ndistribution make LMD the most polluting part of the supply chain. This study\ndescribes the existing methods to improve the efficiency of LMD, its challenges\nand makes a conceptual proposal. The state-of-the-art techniques are\ncategorised according to their data sources, the theoretical framework of the\nproposed models and the dynamic nature of the solutions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:26:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Garc\u00eda-Retuerta","David",""]]}
{"id":"2308.14026","submitter":"Zhihao Lu","authors":"Zhihao Lu","title":"Logarithmic gradient estimate and Universal bounds for semilinear\n  elliptic equations revisited","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use the Bernstein method to provide logarithmic gradient estimates and\nuniversal boundedness estimates for semilinear elliptic equations that satisfy\nthe subcritical index condition. Our estimates are applicable to equations on\nRiemannian manifolds with (Bakry-\\'{E}mery) Ricci curvature that is bounded\nbelow, and they are original for many concrete equations, even on Euclidean\nspaces that have been carefully investigated by numerous experts. Under the\n(Bakry-\\'{E}mery) Ricci curvature bounded below condition, we establish\nrelations among basic estimates, such as the universal boundedness estimate,\nlogarithmic gradient estimate, and Harnack inequality. Under the\n(Bakry-\\'{E}mery) Ricci curvature non-negative condition and certain mild\nassumptions, these estimates are $\\kappa$-equivalent for any $\\kappa>1$. As an\napplication, we obtain optimal pointwise estimates and Liouville theorems for\nspecific equations on Euclidean spaces.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:27:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lu","Zhihao",""]]}
{"id":"2308.14027","submitter":"Amin Farhang","authors":"Amin Farhang, Jonathan Smoker, Nick L.J. Cox, Jan Cami, Harold\n  Linnartz, Jacco Th. van Loon, Martin A. Cordiner, Peter J. Sarre, Habib G.\n  Khosroshahi, Pascale Ehrenfreund, Bernard H. Foing, Lex Kaper, Mike Laverick","title":"The EDIBLES survey VI. Searching for time variations of interstellar\n  absorption features","comments":"180 pages, 138 figures, accepted for publication in A&A journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interstellar lines observed toward stellar targets change slowly over long\ntimescales, mainly due to the proper motion of the background target relative\nto the intervening clouds. On longer timescales, the cloud's slowly changing\nphysical and chemical conditions can also cause variation. We searched for\nsystematic variations in the absorption profiles of the diffuse interstellar\nbands (DIBs) and interstellar atomic and molecular lines by comparing the\nhigh-quality data set from the ESO diffuse interstellar bands extensive\nexploration survey (EDIBLES) to older archival observations, bridging typical\ntimescales of 10 years with a maximum timescale of 22 years. We found good\narchival observations for 64 EDIBLES targets. Our analysis focused on 31 DIBs,\n7 atomic, and 5 molecular lines. We considered various systematic effects and\napplied a robust Bayesian test to establish which absorption features could\ndisplay significant variations. While systematic effects greatly complicate our\nsearch, we find evidence for variations in the profiles of the\n$\\lambda\\lambda$4727 and 5780 DIBs in a few sightlines. Toward HD~167264, we\nfind a new \\ion{Ca}{i} cloud component that appears and becomes stronger after\n2008. The same sightline furthermore displays marginal but systematic changes\nin the column densities of the atomic lines originating from the leading cloud\ncomponent in the sightline. Similar variations are seen toward HD~147933. Our\nhigh-quality spectroscopic observations and archival data show that it is\npossible to probe interstellar time variations on time scales of typically a\ndecade. Even though systematic uncertainties, as well as the generally somewhat\nlower quality of older data, complicate matters, we can conclude that time\nvariations can be made visible, both in atomic lines and DIB profiles for a few\ntargets, but that generally, these features are stable along many lines of\nsight.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:27:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Farhang","Amin",""],["Smoker","Jonathan",""],["Cox","Nick L. J.",""],["Cami","Jan",""],["Linnartz","Harold",""],["van Loon","Jacco Th.",""],["Cordiner","Martin A.",""],["Sarre","Peter J.",""],["Khosroshahi","Habib G.",""],["Ehrenfreund","Pascale",""],["Foing","Bernard H.",""],["Kaper","Lex",""],["Laverick","Mike",""]]}
{"id":"2308.14028","submitter":"Jian Wang","authors":"Peter Frankl, Jian Wang","title":"On the $C$-diversity of intersecting hypergraphs","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathcal{F}\\subset \\binom{X}{k}$ be a family consisting of $k$-subsets\nof the $n$-set $X$. Suppose that $\\mathcal{F}$ is intersecting, i.e., $F\\cap\nF'\\neq \\emptyset$ for all $F,F'\\in \\mathcal{F}$. Let $\\Delta(\\mathcal{F})$ be\nthe maximum degree of $\\mathcal{F}$. For a constant $C\\geq 1$ the\n$C$-diversity, $\\gamma_C(\\mathcal{F})$ is defined as\n$|\\mathcal{F}|-C\\Delta(\\mathcal{F})$. Define $\\mathcal{F}_{123} =\\left\\{F\\in\n\\binom{X}{k}\\colon |F\\cap \\{1,2,3\\}|=2\\right\\}$. It has $C$-diversity\n$(3-2C)\\binom{n-3}{k-2}$. The main result shows that for $1< C<\\frac{3}{2}$ and\n$n\\geq \\frac{42}{3-2C}k$, $\\gamma_C(\\mathcal{F})\\leq\n\\gamma_C(\\mathcal{F}_{123})$ with equality if and only if $\\mathcal{F}$ is\nisomorphic to $\\mathcal{F}_{123}$. For the case of ordinary diversity $(C=1)$ a\nstrong stability is proven.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:41:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Frankl","Peter",""],["Wang","Jian",""]]}
{"id":"2308.14029","submitter":"Zhenghao Liu PhD.","authors":"Zhenghao Liu, Sen Mei, Chenyan Xiong, Xiaohua Li, Shi Yu, Zhiyuan Liu,\n  Yu Gu, Ge Yu","title":"Text Matching Improves Sequential Recommendation by Reducing Popularity\n  Biases","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes Text mAtching based SequenTial rEcommendation model\n(TASTE), which maps items and users in an embedding space and recommends items\nby matching their text representations. TASTE verbalizes items and user-item\ninteractions using identifiers and attributes of items. To better characterize\nuser behaviors, TASTE additionally proposes an attention sparsity method, which\nenables TASTE to model longer user-item interactions by reducing the\nself-attention computations during encoding. Our experiments show that TASTE\noutperforms the state-of-the-art methods on widely used sequential\nrecommendation datasets. TASTE alleviates the cold start problem by\nrepresenting long-tail items using full-text modeling and bringing the benefits\nof pretrained language models to recommendation systems. Our further analyses\nillustrate that TASTE significantly improves the recommendation accuracy by\nreducing the popularity bias of previous item id based recommendation models\nand returning more appropriate and text-relevant items to satisfy users. All\ncodes are available at https://github.com/OpenMatch/TASTE.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:44:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Zhenghao",""],["Mei","Sen",""],["Xiong","Chenyan",""],["Li","Xiaohua",""],["Yu","Shi",""],["Liu","Zhiyuan",""],["Gu","Yu",""],["Yu","Ge",""]]}
{"id":"2308.14030","submitter":"Chen Shen","authors":"Chen Shen and Jun Zhang and Xinggong Liang and Zeyi Hao and Kehan Li\n  and Fan Wang and Zhenyuan Wang and Chunfeng Lian","title":"Forensic Histopathological Recognition via a Context-Aware MIL Network\n  Powered by Self-Supervised Contrastive Learning","comments":"11 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Forensic pathology is critical in analyzing death manner and time from the\nmicroscopic aspect to assist in the establishment of reliable factual bases for\ncriminal investigation. In practice, even the manual differentiation between\ndifferent postmortem organ tissues is challenging and relies on expertise,\nconsidering that changes like putrefaction and autolysis could significantly\nchange typical histopathological appearance. Developing AI-based computational\npathology techniques to assist forensic pathologists is practically meaningful,\nwhich requires reliable discriminative representation learning to capture\ntissues' fine-grained postmortem patterns. To this end, we propose a framework\ncalled FPath, in which a dedicated self-supervised contrastive learning\nstrategy and a context-aware multiple-instance learning (MIL) block are\ndesigned to learn discriminative representations from postmortem\nhistopathological images acquired at varying magnification scales. Our\nself-supervised learning step leverages multiple complementary contrastive\nlosses and regularization terms to train a double-tier backbone for\nfine-grained and informative patch/instance embedding. Thereafter, the\ncontext-aware MIL adaptively distills from the local instances a holistic\nbag/image-level representation for the recognition task. On a large-scale\ndatabase of $19,607$ experimental rat postmortem images and $3,378$ real-world\nhuman decedent images, our FPath led to state-of-the-art accuracy and promising\ncross-domain generalization in recognizing seven different postmortem tissues.\nThe source code will be released on\n\\href{https://github.com/ladderlab-xjtu/forensic_pathology}{https://github.com/ladderlab-xjtu/forensic\\_pathology}.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:47:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shen","Chen",""],["Zhang","Jun",""],["Liang","Xinggong",""],["Hao","Zeyi",""],["Li","Kehan",""],["Wang","Fan",""],["Wang","Zhenyuan",""],["Lian","Chunfeng",""]]}
{"id":"2308.14031","submitter":"Mircea Cimpoea\\c{s}","authors":"Silviu Balanescu and Mircea Cimpoeas","title":"On the q-depth of finitely generated graded modules","comments":"14 pages. arXiv admin note: text overlap with arXiv:2306.09450","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $K$ be a field, $A$ a standard graded $K$-algebra and $M$ a finitely\ngenerated graded $A$-module. Inspired by our previous works, we introduce the\ninvariant q-depth of $M$, that is $qdep(M)=\\max\\{d\\;:\\; \\sum\\limits_{j\\leq k}\n(-1)^{k-j} \\binom{d-j}{k-j} H(M,j) \\geq 0 \\text{ for all } k\\leq d\\},$ where\n$H(M,-)$ is the Hilbert function of $M$, and we prove basic results regard it.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:48:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Balanescu","Silviu",""],["Cimpoeas","Mircea",""]]}
{"id":"2308.14032","submitter":"Hai-Bing Fu","authors":"Tao Zhong, Ya-Hong Dai, Hai-Bing Fu","title":"$\\rho$-meson longitudinal leading-twist distribution amplitude revisited\n  and the $D\\to \\rho$ semileptonic decay","comments":"9 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by our previous work [Phys. Rev. D \\textbf{104}, no.1, 016021\n(2021)] on pionic leading-twist distribution amplitude (DA), we revisit\n$\\rho$-meson leading-twist longitudinal DA $\\phi_{2;\\rho}^\\|(x,\\mu)$ in this\npaper. A model proposed by Chang based on the Dyson-Schwinger equations (DSEs)\nis adopted to describe the behavior of $\\phi_{2;\\rho}^\\|(x,\\mu)$. On the other\nhand, the $\\xi$-moments of $\\phi_{2;\\rho}^\\|(x,\\mu)$ are calculated with the\nQCD sum rules in the framework of the background field theory. The sum rule\nformula for those moments are improved. More accurate values for the first five\nnonzero $\\xi$-moments at typical scale $\\mu =1, 1.4, 2, 3~{\\rm GeV}$ are given,\ne.g., at $\\mu = 1~{\\rm GeV}$, \\modi{$\\langle\\xi^2\\rangle_{2;\\rho}^\\| = 0.220(6)\n$, $\\langle\\xi^4\\rangle_{2;\\rho}^\\| = 0.103(4)$,\n$\\langle\\xi^6\\rangle_{2;\\rho}^\\| = 0.066(5)$, $\\langle\\xi^8\\rangle_{2;\\rho}^\\|\n= 0.046(4)$ and $\\langle\\xi^{10}\\rangle_{2;\\rho}^\\| = 0.035(3)$}. By fitting\nthose values with the least squares method, the DSE model for\n$\\phi_{2;\\rho}^\\|(x,\\mu)$ is determined. By taking the left-handed current\nlight-cone sum rule approach, we get the transition form factor at large recoil\nregion, {\\it i.e.} $A_1(0) = 0.498^{+0.014}_{-0.012}$,\n$A_2(0)=0.460^{+0.055}_{-0.047}$, $V(0) = 0.800^{+0.015}_{-0.014}$, and the\nratio $r_2 = 0.923^{+0.133}_{-0.119}$, $r_V = 1.607^{+0.071}_{-0.071}$. After\nmaking the extrapolation with a rapidly converging series based on\n$z(t)$-expansion, we present the decay width for the semileptonic decays\n$D\\to\\rho\\ell^+\\nu_\\ell$. Finally, the branching fractions are\n$\\mathcal{B}(D^0\\to \\rho^- e^+ \\nu_e) = 1.889^{+0.176}_{-0.170}\\pm 0.005$,\n$\\mathcal{B}(D^+ \\to \\rho^0 e^+ \\nu_e) = 2.380^{+0.221}_{-0.214}\\pm 0.012$,\n$\\mathcal{B}(D^0\\to \\rho^- \\mu^+ \\nu_\\mu) = 1.881^{+0.174}_{-0.168}\\pm 0.005$,\n$\\mathcal{B}(D^+ \\to \\rho^0 \\mu^+ \\nu_\\mu) =2.369^{+0.219}_{-0.211}\\pm 0.011$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:49:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Tao",""],["Dai","Ya-Hong",""],["Fu","Hai-Bing",""]]}
{"id":"2308.14033","submitter":"L Yashvanth","authors":"L. Yashvanth, and Chandra R. Murthy","title":"On the Impact of an IRS on the Out-of-Band Performance in Sub-6 GHz &\n  mmWave Frequencies","comments":"Extended version of arXiv:2302.12616","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Intelligent reflecting surfaces (IRSs) were introduced to enhance the\nperformance of wireless communication systems. However, from a service\nprovider's viewpoint, a concern with the use of an IRS is its effect on\nout-of-band (OOB) quality of service. Specifically, if two operators, say X and\nY, provide services in a given geographical area using non-overlapping\nfrequency bands, and if operator X uses an IRS to enhance the spectral\nefficiency (SE) of its users, does it degrade the performance of users served\nby operator Y? We answer this question by analyzing the average and\ninstantaneous performances of the OOB operator considering both sub-6 GHz and\nmmWave bands, accounting for their corresponding channel characteristics.\nSpecifically, we derive the ergodic sum-spectral efficiency achieved by the\noperators under round-robin scheduling. We also derive the outage probability\nand analyze the change in the SNR witnessed by an OOB user in the presence of\nthe IRS using stochastic dominance theory. Surprisingly, even though the IRS is\nrandomly configured from operator Y's point of view, the OOB operator still\nbenefits from the presence of the IRS, witnessing a performance enhancement for\nfree, in both sub-6 GHz and mmWave bands. This is because the IRS introduces\nadditional paths between the transmitter and receiver, increasing the overall\nsignal power arriving at the receiver and providing diversity benefits. We\nnumerically illustrate our findings and conclude that an IRS is always\nbeneficial to every operator, even when the IRS is deployed and controlled by\nonly one operator to serve its own users.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:50:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yashvanth","L.",""],["Murthy","Chandra R.",""]]}
{"id":"2308.14034","submitter":"Shen Gao","authors":"Shen Gao, Zhengliang Shi, Minghang Zhu, Bowen Fang, Xin Xin, Pengjie\n  Ren, Zhumin Chen, Jun Ma","title":"Confucius: Iterative Tool Learning from Introspection Feedback by\n  Easy-to-Difficult Curriculum","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Augmenting large language models (LLMs) with external tools has emerged as a\npromising approach to extending the capability of LLMs. Although some works\nemploy open-source LLMs for the tool learning task, most of them are trained in\na controlled environment in which LLMs only learn to execute the human-provided\ntools. However, selecting proper tools from the large toolset is also a crucial\nability for the tool learning model to be applied in real-world applications.\nExisting methods usually directly employ self-instruction methods to train the\nmodel, which ignores differences in tool complexity. In this paper, we propose\nthe Confucius, a novel tool learning framework to train LLM to use complicated\ntools in real-world scenarios, which contains two main phases: (1) We first\npropose a multi-stage learning method to teach the LLM to use various tools\nfrom an easy-to-difficult curriculum; (2) thenceforth, we propose the Iterative\nSelf-instruct from Introspective Feedback (ISIF) to dynamically construct the\ndataset to improve the ability to use the complicated tool. Extensive\nexperiments conducted on both controlled and real-world settings demonstrate\nthe superiority of our tool learning framework in the real-world application\nscenarios compared to both tuning-free (e.g. ChatGPT, Claude) and tuning-based\nbaselines (e.g. GPT4Tools).\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:53:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Shen",""],["Shi","Zhengliang",""],["Zhu","Minghang",""],["Fang","Bowen",""],["Xin","Xin",""],["Ren","Pengjie",""],["Chen","Zhumin",""],["Ma","Jun",""]]}
{"id":"2308.14035","submitter":"Kang-Hyun Lee","authors":"Kang-Hyun Lee and Gun Jin Yun","title":"Multi-plane denoising diffusion-based dimensionality expansion for\n  2D-to-3D reconstruction of microstructures with harmonized sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Acquiring reliable microstructure datasets is a pivotal step toward the\nsystematic design of materials with the aid of integrated computational\nmaterials engineering (ICME) approaches. However, obtaining three-dimensional\n(3D) microstructure datasets is often challenging due to high experimental\ncosts or technical limitations, while acquiring two-dimensional (2D)\nmicrographs is comparatively easier. To deal with this issue, this study\nproposes a novel framework for 2D-to-3D reconstruction of microstructures\ncalled Micro3Diff using diffusion-based generative models (DGMs). Specifically,\nthis approach solely requires pre-trained DGMs for the generation of 2D\nsamples, and dimensionality expansion (2D-to-3D) takes place only during the\ngeneration process (i.e., reverse diffusion process). The proposed framework\nincorporates a new concept referred to as multi-plane denoising diffusion,\nwhich transforms noisy samples (i.e., latent variables) from different planes\ninto the data structure while maintaining spatial connectivity in 3D space.\nFurthermore, a harmonized sampling process is developed to address possible\ndeviations from the reverse Markov chain of DGMs during the dimensionality\nexpansion. Combined, we demonstrate the feasibility of Micro3Diff in\nreconstructing 3D samples with connected slices that maintain morphologically\nequivalence to the original 2D images. To validate the performance of\nMicro3Diff, various types of microstructures (synthetic and experimentally\nobserved) are reconstructed, and the quality of the generated samples is\nassessed both qualitatively and quantitatively. The successful reconstruction\noutcomes inspire the potential utilization of Micro3Diff in upcoming ICME\napplications while achieving a breakthrough in comprehending and manipulating\nthe latent space of DGMs.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:57:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Kang-Hyun",""],["Yun","Gun Jin",""]]}
{"id":"2308.14036","submitter":"Qiu Yuwei","authors":"Yuwei Qiu, Kaihao Zhang, Chenxi Wang, Wenhan Luo, Hongdong Li and Zhi\n  Jin","title":"MB-TaylorFormer: Multi-branch Efficient Transformer Expanded by Taylor\n  Formula for Image Dehazing","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, Transformer networks are beginning to replace pure\nconvolutional neural networks (CNNs) in the field of computer vision due to\ntheir global receptive field and adaptability to input. However, the quadratic\ncomputational complexity of softmax-attention limits the wide application in\nimage dehazing task, especially for high-resolution images. To address this\nissue, we propose a new Transformer variant, which applies the Taylor expansion\nto approximate the softmax-attention and achieves linear computational\ncomplexity. A multi-scale attention refinement module is proposed as a\ncomplement to correct the error of the Taylor expansion. Furthermore, we\nintroduce a multi-branch architecture with multi-scale patch embedding to the\nproposed Transformer, which embeds features by overlapping deformable\nconvolution of different scales. The design of multi-scale patch embedding is\nbased on three key ideas: 1) various sizes of the receptive field; 2)\nmulti-level semantic information; 3) flexible shapes of the receptive field.\nOur model, named Multi-branch Transformer expanded by Taylor formula\n(MB-TaylorFormer), can embed coarse to fine features more flexibly at the patch\nembedding stage and capture long-distance pixel interactions with limited\ncomputational cost. Experimental results on several dehazing benchmarks show\nthat MB-TaylorFormer achieves state-of-the-art (SOTA) performance with a light\ncomputational burden. The source code and pre-trained models are available at\nhttps://github.com/FVL2020/ICCV-2023-MB-TaylorFormer.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:10:23 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:27:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Qiu","Yuwei",""],["Zhang","Kaihao",""],["Wang","Chenxi",""],["Luo","Wenhan",""],["Li","Hongdong",""],["Jin","Zhi",""]]}
{"id":"2308.14037","submitter":"Yi-Zheng Zhen","authors":"Yi-Zheng Zhen and Yingqiu Mao and Yu-Zhe Zhang and Feihu Xu and Barry\n  C. Sanders","title":"Device-Independent Quantum Key Distribution Based on the Mermin-Peres\n  Magic Square Game","comments":null,"journal-ref":null,"doi":"10.1103/PhysRevLett.131.080801","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Device-independent quantum key distribution (DIQKD) is\ninformation-theoretically secure against adversaries who possess a scalable\nquantum computer and who have supplied malicious key-establishment systems;\nhowever, the DIQKD key rate is currently too low. Consequently, we devise a\nDIQKD scheme based on the quantum nonlocal Mermin-Peres magic square game: our\nscheme asymptotically delivers DIQKD against collective attacks, even with\nnoise. Our scheme outperforms DIQKD using the Clauser-Horne-Shimony-Holt game\nwith respect to the number of game rounds, albeit not number of entangled\npairs, provided that both state visibility and detection efficiency are high\nenough.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:13:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhen","Yi-Zheng",""],["Mao","Yingqiu",""],["Zhang","Yu-Zhe",""],["Xu","Feihu",""],["Sanders","Barry C.",""]]}
{"id":"2308.14038","submitter":"Qun Wang","authors":"Xin-Li Sheng, Shi Pu, Qun Wang","title":"Momentum dependence of $\\phi$ meson's spin alignment","comments":"RevTex 4, 5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the rapidity and azimuthal angle dependences of the global spin\nalignment $\\rho_{00}$ for $\\phi$ mesons with respect to the reaction plane in\nAu+Au collisions at RHIC by the relativistic coalescence model in the spin\ntransport theory. The global spin alignment of $\\phi$ mesons arises from local\nfluctuations of strong force fields whose values are extracted from the STAR's\ndata. The calculated results show that $\\rho_{00}<1/3$ at the rapidity $Y=0$,\nand then it increases with rapidity and becomes $\\rho_{00}>1/3$ at $Y=1$. Such\na rapidity dependence is dominated by the relative motion of the $\\phi$ meson\nin the bulk matter. We also give prediction for the azimuthal angle dependence\nof $\\rho_{00}$ at different rapidities.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:19:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sheng","Xin-Li",""],["Pu","Shi",""],["Wang","Qun",""]]}
{"id":"2308.14039","submitter":"Changhao Chen","authors":"Changhao Chen, Bing Wang, Chris Xiaoxuan Lu, Niki Trigoni, Andrew\n  Markham","title":"Deep Learning for Visual Localization and Mapping: A Survey","comments":"Accepted by IEEE Transactions on Neural Networks and Learning\n  Systems. This is an updated version of arXiv:2006.12567","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning based localization and mapping approaches have recently emerged\nas a new research direction and receive significant attentions from both\nindustry and academia. Instead of creating hand-designed algorithms based on\nphysical models or geometric theories, deep learning solutions provide an\nalternative to solve the problem in a data-driven way. Benefiting from the\never-increasing volumes of data and computational power on devices, these\nlearning methods are fast evolving into a new area that shows potentials to\ntrack self-motion and estimate environmental model accurately and robustly for\nmobile agents. In this work, we provide a comprehensive survey, and propose a\ntaxonomy for the localization and mapping methods using deep learning. This\nsurvey aims to discuss two basic questions: whether deep learning is promising\nto localization and mapping; how deep learning should be applied to solve this\nproblem. To this end, a series of localization and mapping topics are\ninvestigated, from the learning based visual odometry, global relocalization,\nto mapping, and simultaneous localization and mapping (SLAM). It is our hope\nthat this survey organically weaves together the recent works in this vein from\nrobotics, computer vision and machine learning communities, and serves as a\nguideline for future researchers to apply deep learning to tackle the problem\nof visual localization and mapping.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:25:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Changhao",""],["Wang","Bing",""],["Lu","Chris Xiaoxuan",""],["Trigoni","Niki",""],["Markham","Andrew",""]]}
{"id":"2308.14040","submitter":"Anish Acharya","authors":"Anish Acharya, Shamik Gupta","title":"Tight-binding model subject to conditional resets at random times","comments":"23 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the dynamics of a quantum system subjected to a time-dependent\nand conditional resetting protocol. Namely, we ask: what happens when the\nunitary evolution of the system is repeatedly interrupted at random time\ninstants with an instantaneous reset to a specified set of reset configurations\ntaking place with a probability that depends on the current configuration of\nthe system at the instant of reset? Analyzing the protocol in the framework of\nthe so-called tight-binding model describing the hopping of a quantum particle\nto nearest-neighbour sites in a one-dimensional open lattice, we obtain\nanalytical results for the probability of finding the particle on the different\nsites of the lattice. We explore a variety of dynamical scenarios, including\nthe one in which the resetting time intervals are sampled from an exponential\nas well as from a power-law distribution, and a set-up that includes a\nFloquet-type Hamiltonian involving an external periodic forcing. Under\nexponential resetting, and in both presence and absence of the external\nforcing, the system relaxes to a stationary state characterized by localization\nof the particle around the reset sites. The choice of the reset sites plays a\ndefining role in dictating the relative probability of finding the particle at\nthe reset sites as well as in determining the overall spatial profile of the\nsite-occupation probability. Indeed, a simple choice can be engineered that\nmakes the spatial profile highly asymmetric even when the bare dynamics does\nnot involve the effect of any bias. Furthermore, analyzing the case of\npower-law resetting serves to demonstrate that the attainment of the stationary\nstate in this quantum problem is not always evident and depends crucially on\nwhether the distribution of reset time intervals has a finite or an infinite\nmean.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:27:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Acharya","Anish",""],["Gupta","Shamik",""]]}
{"id":"2308.14041","submitter":"Jae-Hyung Jeon","authors":"Sungmin Joo, Jae-Hyung Jeon","title":"Viscoelastic active diffusion governed by nonequilibrium fractional\n  Langevin equations: underdamped dynamics and ergodicity breaking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In this work, we investigate the active dynamics and ergodicity breaking of a\nnonequilibrium fractional Langevin equation (FLE) with a power-law memory\nkernel of the form $K(t)\\sim t^{-(2-2H)}$, where $1/2<H<1$ represents the Hurst\nexponent. The system is subjected to two distinct noises: a thermal noise\nsatisfying the fluctuation-dissipation theorem and an active noise\ncharacterized by an active Ornstein-Uhlenbeck process with a propulsion memory\ntime $\\tau_\\mathrm{A}$. We provide analytic solutions for the underdamped\nactive fractional Langevin equation, performing both analytical and\ncomputational investigations of dynamic observables such as velocity\nautocorrelation, the two-time position correlation, ensemble- and time-averaged\nmean-squared displacements (MSDs), and ergodicity-breaking parameters. Our\nresults reveal that the interplay between the active noise and long-time\nviscoelastic memory effect leads to unusual and complex nonequilibrium dynamics\nin the active FLE systems. Furthermore, the active FLE displays a new type of\ndiscrepancy between ensemble- and time-averaged observables. The active\ncomponent of the system exhibits ultraweak ergodicity breaking where both\nensemble- and time-averaged MSDs have the same functional form with unequal\namplitudes. However, the combined dynamics of the active and thermal components\nof the active FLE system are eventually ergodic in the infinite-time limit.\nIntriguingly, the system has a long-standing ergodicity-breaking state before\nrecovering the ergodicity. This apparent ergodicity-breaking state becomes\nexceptionally long-lived as $H\\to1$, making it difficult to observe ergodicity\nwithin practical measurement times. Our findings provide insight into related\nproblems, such as the transport dynamics for self-propelled particles in\ncrowded or polymeric media.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:33:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Joo","Sungmin",""],["Jeon","Jae-Hyung",""]]}
{"id":"2308.14042","submitter":"Meng Guo","authors":"Junjie Wang, Meng Guo and Zhongkui Li","title":"Multi-agent Coordination Under Temporal Logic Tasks and Team-Wise\n  Intermittent Communication","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MA cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multi-agent systems outperform single agent in complex collaborative tasks.\nHowever, in large-scale scenarios, ensuring timely information exchange during\ndecentralized task execution remains a challenge. This work presents an online\ndecentralized coordination scheme for multi-agent systems under complex local\ntasks and intermittent communication constraints. Unlike existing strategies\nthat enforce all-time or intermittent connectivity, our approach allows agents\nto join or leave communication networks at aperiodic intervals, as deemed\noptimal by their online task execution. This scheme concurrently determines\nlocal plans and refines the communication strategy, i.e., where and when to\ncommunicate as a team. A decentralized potential game is modeled among agents,\nfor which a Nash equilibrium is generated iteratively through online local\nsearch. It guarantees local task completion and intermittent communication\nconstraints. Extensive numerical simulations are conducted against several\nstrong baselines.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:34:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Junjie",""],["Guo","Meng",""],["Li","Zhongkui",""]]}
{"id":"2308.14043","submitter":"Giada Franceschi","authors":"Giada Franceschi, Michael Schmid, Ulrike Diebold, and Michele Riva","title":"Reconstruction changes drive surface diffusion and determine the\n  flatness of oxide surfaces","comments":"20 pages, 3 figures","journal-ref":"Journal of Vacuum Science & Technology A 40, 023206 (2022)","doi":"10.1116/6.0001704","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surface diffusion on metal oxides is key in many areas of materials\ntechnology, yet it has been scarcely explored at the atomic scale. This work\nprovides phenomenological insights from scanning tunneling microscopy on the\nlink between surface diffusion, surface atomic structure, and oxygen chemical\npotential based on three model oxide surfaces: Fe$_2$O$_3(1\\overline{1}02)$,\nLa$_{1-x}$Sr$_x$MnO$_3$(110), and In$_2$O$_3$(111). In all instances, changing\nthe oxygen chemical potential used for annealing stabilizes reconstructions of\ndifferent compositions while promoting the flattening of the surface morphology\n-- a sign of enhanced surface diffusion. It is argued that thermodynamics,\nrather than kinetics, rules surface diffusion under these conditions: The\ncomposition change of the surface reconstructions formed at differently\noxidizing conditions drives mass transport across the surface.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:39:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Franceschi","Giada",""],["Schmid","Michael",""],["Diebold","Ulrike",""],["Riva","Michele",""]]}
{"id":"2308.14044","submitter":"Maciej Ossowski","authors":"Denis Dobkowski-Ry{\\l}ko, Jerzy Lewandowski, Maciej Ossowski","title":"Isolated horizons of the Hopf bundle structure transversal to the null\n  direction, the horizon equations and embeddability in NUT-like spacetimes","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Isolated horizons that admit the Hopf bundle structure $H\\rightarrow S_2$ are\ninvestigated, however the null direction is allowed not to be tangent to the\nbundle fibres. The geometry of such horizons is characterised by data set on a\ntopological two-dimensional sphere, singular at its poles. The horizon\nequations induced by Einstein's equations are imposed. The existence of regular\nextremal horizons satisfying the vacuum (with cosmological constant) equation\nof extremality, obtained from singular solutions on the sphere is pointed out.\nAll horizons (with assumed topology and in the generic case) satisfying the\n$\\Lambda$ vacuum type D equation are derived. They are compared to the Killing\nhorizons contained in the accelerated Kerr-NUT-(Anti) de Sitter spacetimes.\nBoth families of horizons have the same dimension, but the problem of mutual\ncorrespondence needs to be better understood. If the cosmological constant\ntakes special values determined by the other parameters the bundle fibers\nbecome tangent to the null direction. As an additional but also important\nresult, spacetimes of the topology $H\\times \\mathbb{R}$ locally isometric to\nthe accelerated Kerr-NUT-(Anti) de Sitter spacetimes are constructed for every\nvalue of the mass, Kerr, NUT parameters, the cosmological constant and the\nacceleration. When the acceleration parameter is not zero, the conical\nsingularity can be removed whenever the NUT parameter does not vanish either.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:39:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dobkowski-Ry\u0142ko","Denis",""],["Lewandowski","Jerzy",""],["Ossowski","Maciej",""]]}
{"id":"2308.14045","submitter":"Linqiang Xu","authors":"Linqiang Xu, Lianqiang Xu, Qiuhui Li, Shibo Fang, Ying Li, Ying Guo,\n  Ruge Quhe, Yee Sin Ang, Jing Lu","title":"Sub-5 nm Gate-All-Around InP Nanowire Transistors Towards\n  High-Performance Devices","comments":"22 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Gate-all-around (GAA) nanowire (NW) field-effect transistor (FET) is a\npromising device architecture due to its superior gate controllability than\nthat of the conventional FinFET architecture. The significantly higher electron\nmobility of indium phosphide (InP) NW than silicon NW makes it particularly\nwell-suited for high-performance (HP) electronics applications. In this work,\nwe perform an ab initio quantum transport simulation to investigate the\nperformance limit of sub-5-nm gate length (Lg) GAA InP NW FETs. The GAA InP NW\nFETs with Lg of 4 nm can meet the International Technology Roadmap for\nSemiconductors (ITRS) requirements for HP devices from the perspective of\non-state current, delay time, and power dissipation. We also investigate the\nimpact of strain on 3-nm-Lg GAA InP NW FETs. The application of tensile strain\nresults in a remarkable increase of over 60% in the on-state current. These\nresults highlight the potential of GAA InP NW FETs for HP applications in the\nsub-5-nm Lg region.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:42:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Linqiang",""],["Xu","Lianqiang",""],["Li","Qiuhui",""],["Fang","Shibo",""],["Li","Ying",""],["Guo","Ying",""],["Quhe","Ruge",""],["Ang","Yee Sin",""],["Lu","Jing",""]]}
{"id":"2308.14046","submitter":"Si Li","authors":"Sen Hu, Si Li, Dongheng Ye, Yehao Zhou","title":"Quantum Algebra of Chern-Simons Matrix Model and Large $N$ Limit","comments":"48 pages. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA cond-mat.str-el hep-th math-ph math.MP math.RT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study the algebra of quantum observables of the Chern-Simons\nmatrix model which was originally proposed by Susskind and Polychronakos to\ndescribe electrons in fractional quantum Hall effects. We establish the\ncommutation relations for its generators and study the large $N$ limit of its\nrepresentation. We show that the large $N$ limit algebra is isomorphic to the\nuniform in $N$ algebra studied by Costello, which is conjecturally isomorphic\nto the deformed double current algebra studied by Guay. Under appropriate\nscaling limit, we show that the large $N$ limit algebra degenerates to a Lie\nalgebra which admits a surjective map to the affine Lie algebra of\n$\\mathfrak{u}(p)$. This leads to a complete proof of the large $N$ emergence of\nthe $\\mathfrak{u}(p)$ current algebra as proposed by Dorey, Tong and Turner.\nThis also suggests a rigorous derivation of edge excitation of a fractional\nquantum Hall droplet.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:54:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Sen",""],["Li","Si",""],["Ye","Dongheng",""],["Zhou","Yehao",""]]}
{"id":"2308.14047","submitter":"Francesco Pirotti","authors":"Francesco Pirotti, Alberto Guarnieri, Sebastiano Chiodini, Carlo\n  Bettanini","title":"Automatic coarse co-registration of point clouds from diverse scan\n  geometries: a test of detectors and descriptors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Point clouds are collected nowadays from a plethora of sensors, some having\nhigher accuracies and higher costs, some having lower accuracies but also lower\ncosts. Not only there is a large choice for different sensors, but also these\ncan be transported by different platforms, which can provide different scan\ngeometries. In this work we test the extraction of four different keypoint\ndetectors and three feature descriptors. We benchmark performance in terms of\ncalculation time and we assess their performance in terms of accuracy in their\nability in coarse automatic co-registration of two clouds that are collected\nwith different sensors, platforms and scan geometries. One, which we define as\nhaving the higher accuracy, and thus will be used as reference, was surveyed\nvia a UAV flight with a Riegl MiniVUX-3, the other on a bicycle with a Livox\nHorizon over a walking path with un-even ground.The novelty in this work\nconsists in comparing several strategies for fast alignment of point clouds\nfrom very different surveying geometries, as the drone has a bird's eye view\nand the bicycle a ground-based view. An added challenge is related to the lower\ncost of the bicycle sensor ensemble that, together with the rough terrain,\nreasonably results in lower accuracy of the survey. The main idea is to use\nrange images to capture a simplified version of the geometry of the surveyed\narea and then find the best features to match keypoints. Results show that NARF\nfeatures detected more keypoints and resulted in a faster co-registration\nprocedure in this scenariowhereas the accuracy of the co-registration is\nsimilar to all the combinations of keypoint detectors and features.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:55:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pirotti","Francesco",""],["Guarnieri","Alberto",""],["Chiodini","Sebastiano",""],["Bettanini","Carlo",""]]}
{"id":"2308.14048","submitter":"Forough Fazeli-Asl","authors":"Forough Fazeli-Asl and Michael Minyi Zhang","title":"A Bayesian Non-parametric Approach to Generative Models: Integrating\n  Variational Autoencoder and Generative Adversarial Networks using Wasserstein\n  and Maximum Mean Discrepancy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.AP stat.CO stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative models have emerged as a promising technique for producing\nhigh-quality images that are indistinguishable from real images. Generative\nadversarial networks (GANs) and variational autoencoders (VAEs) are two of the\nmost prominent and widely studied generative models. GANs have demonstrated\nexcellent performance in generating sharp realistic images and VAEs have shown\nstrong abilities to generate diverse images. However, GANs suffer from ignoring\na large portion of the possible output space which does not represent the full\ndiversity of the target distribution, and VAEs tend to produce blurry images.\nTo fully capitalize on the strengths of both models while mitigating their\nweaknesses, we employ a Bayesian non-parametric (BNP) approach to merge GANs\nand VAEs. Our procedure incorporates both Wasserstein and maximum mean\ndiscrepancy (MMD) measures in the loss function to enable effective learning of\nthe latent space and generate diverse and high-quality samples. By fusing the\ndiscriminative power of GANs with the reconstruction capabilities of VAEs, our\nnovel model achieves superior performance in various generative tasks, such as\nanomaly detection and data augmentation. Furthermore, we enhance the model's\ncapability by employing an extra generator in the code space, which enables us\nto explore areas of the code space that the VAE might have overlooked. With a\nBNP perspective, we can model the data distribution using an\ninfinite-dimensional space, which provides greater flexibility in the model and\nreduces the risk of overfitting. By utilizing this framework, we can enhance\nthe performance of both GANs and VAEs to create a more robust generative model\nsuitable for various applications.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 08:58:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fazeli-Asl","Forough",""],["Zhang","Michael Minyi",""]]}
{"id":"2308.14049","submitter":"Ouba\\\"ida Chouchane","authors":"Oubaida Chouchane, Michele Panariello, Chiara Galdi, Massimiliano\n  Todisco, Nicholas Evans","title":"Fairness and Privacy in Voice Biometrics:A Study of Gender Influences\n  Using wav2vec 2.0","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study investigates the impact of gender information on utility, privacy,\nand fairness in voice biometric systems, guided by the General Data Protection\nRegulation (GDPR) mandates, which underscore the need for minimizing the\nprocessing and storage of private and sensitive data, and ensuring fairness in\nautomated decision-making systems. We adopt an approach that involves the\nfine-tuning of the wav2vec 2.0 model for speaker verification tasks, evaluating\npotential gender-related privacy vulnerabilities in the process. Gender\ninfluences during the fine-tuning process were employed to enhance fairness and\nprivacy in order to emphasise or obscure gender information within the\nspeakers' embeddings. Results from VoxCeleb datasets indicate our adversarial\nmodel increases privacy against uninformed attacks, yet slightly diminishes\nspeaker verification performance compared to the non-adversarial model.\nHowever, the model's efficacy reduces against informed attacks. Analysis of\nsystem performance was conducted to identify potential gender biases, thus\nhighlighting the need for further research to understand and improve the\ndelicate interplay between utility, privacy, and equity in voice biometric\nsystems.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:04:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chouchane","Oubaida",""],["Panariello","Michele",""],["Galdi","Chiara",""],["Todisco","Massimiliano",""],["Evans","Nicholas",""]]}
{"id":"2308.14050","submitter":"Santosh Sanjeev Mr.","authors":"Santosh Sanjeev, Salwa K. Al Khatib, Mai A. Shaaban, Ibrahim Almakky,\n  Vijay Ram Papineni and Mohammad Yaqub","title":"PECon: Contrastive Pretraining to Enhance Feature Alignment between CT\n  and EHR Data for Improved Pulmonary Embolism Diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previous deep learning efforts have focused on improving the performance of\nPulmonary Embolism(PE) diagnosis from Computed Tomography (CT) scans using\nConvolutional Neural Networks (CNN). However, the features from CT scans alone\nare not always sufficient for the diagnosis of PE. CT scans along with\nelectronic heath records (EHR) can provide a better insight into the patients\ncondition and can lead to more accurate PE diagnosis. In this paper, we propose\nPulmonary Embolism Detection using Contrastive Learning (PECon), a supervised\ncontrastive pretraining strategy that employs both the patients CT scans as\nwell as the EHR data, aiming to enhance the alignment of feature\nrepresentations between the two modalities and leverage information to improve\nthe PE diagnosis. In order to achieve this, we make use of the class labels and\npull the sample features of the same class together, while pushing away those\nof the other class. Results show that the proposed work outperforms the\nexisting techniques and achieves state-of-the-art performance on the RadFusion\ndataset with an F1-score of 0.913, accuracy of 0.90 and an AUROC of 0.943.\nFurthermore, we also explore the explainability of our approach in comparison\nto other methods. Our code is publicly available at\nhttps://github.com/BioMedIA-MBZUAI/PECon.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:07:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sanjeev","Santosh",""],["Khatib","Salwa K. Al",""],["Shaaban","Mai A.",""],["Almakky","Ibrahim",""],["Papineni","Vijay Ram",""],["Yaqub","Mohammad",""]]}
{"id":"2308.14051","submitter":"Hao Wang","authors":"Cheng-Feng Pan, Hao Wang, Hongtao Wang, Parvathi Nair S, Qifeng Ruan,\n  Simon Wredh, Yujie Ke, John You En Chan, Wang Zhang, Cheng-Wei Qiu, Joel K.\n  W. Yang","title":"3D Printed Multilayer Structures for High Numerical Aperture Achromatic\n  Metalenses","comments":"37 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Flat optics consisting of nanostructures of high-refractive-index materials\nproduce lenses with thin form factors that tend to operate only at specific\nwavelengths. Recent attempts to achieve achromatic lenses uncover a trade-off\nbetween the numerical aperture (NA) and bandwidth, which limits performance.\nHere we propose a new approach to design high NA, broadband and\npolarization-insensitive multilayer achromatic metalenses (MAM). We combine\ntopology optimization and full wave simulations to inversely design MAMs and\nfabricate the structures in low-refractive-index materials by two-photon\npolymerization lithography. MAMs measuring 20 micrometer in diameter operating\nin the visible range of 400-800 nm with 0.5 NA and 0.7 NA were achieved with\nefficiencies of up to 42%. We demonstrate broadband imaging performance of the\nfabricated MAM under white light, and RGB narrowband illuminations. These\nresults highlight the potential of the 3D printed multilayer structures for\nrealizing broadband and multi-functional meta-devices with inverse design.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:10:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pan","Cheng-Feng",""],["Wang","Hao",""],["Wang","Hongtao",""],["S","Parvathi Nair",""],["Ruan","Qifeng",""],["Wredh","Simon",""],["Ke","Yujie",""],["Chan","John You En",""],["Zhang","Wang",""],["Qiu","Cheng-Wei",""],["Yang","Joel K. W.",""]]}
{"id":"2308.14052","submitter":"Digbalay Bose","authors":"Digbalay Bose, Rajat Hebbar, Tiantian Feng, Krishna Somandepalli,\n  Anfeng Xu, Shrikanth Narayanan","title":"MM-AU:Towards Multimodal Understanding of Advertisement Videos","comments":"Accepted to ACM Multimedia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Advertisement videos (ads) play an integral part in the domain of Internet\ne-commerce as they amplify the reach of particular products to a broad audience\nor can serve as a medium to raise awareness about specific issues through\nconcise narrative structures. The narrative structures of advertisements\ninvolve several elements like reasoning about the broad content (topic and the\nunderlying message) and examining fine-grained details involving the transition\nof perceived tone due to the specific sequence of events and interaction among\ncharacters. In this work, to facilitate the understanding of advertisements\nalong the three important dimensions of topic categorization, perceived tone\ntransition, and social message detection, we introduce a multimodal\nmultilingual benchmark called MM-AU composed of over 8.4K videos (147 hours)\ncurated from multiple web sources. We explore multiple zero-shot reasoning\nbaselines through the application of large language models on the ads\ntranscripts. Further, we demonstrate that leveraging signals from multiple\nmodalities, including audio, video, and text, in multimodal transformer-based\nsupervised models leads to improved performance compared to unimodal\napproaches.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:11:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bose","Digbalay",""],["Hebbar","Rajat",""],["Feng","Tiantian",""],["Somandepalli","Krishna",""],["Xu","Anfeng",""],["Narayanan","Shrikanth",""]]}
{"id":"2308.14053","submitter":"Zi-Jian Lang","authors":"Zi-Jian Lang, Sudeshna Sen, Pak Ki Henry Tsang, Kristjan Haule,\n  Vladimir Dobrosavljevi\\'c, Wei Ku","title":"Relevance of long-range screening in Mott transition examined via a\n  hydrogen lattice","comments":"5pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Mott transition, a metal-insulator transition due to strong electronic\ninteraction, is observed in many materials without an accompanying change of\nsystem symmetry. An important open question in Mott's proposal is the role of\nlong-range screening, whose drastic change across the quantum phase transition\nmay self-consistently make the transition more abrupt, toward a first-order\none. Here we investigate this effect in a model system of hydrogen atoms in a\ncubic lattice, using charge self-consistent dynamical mean-field theory that\nincorporates approximately the long-range interaction within the density\nfunctional treatment. We found that the system is well within the\ncharge-transfer regime and that the charge-transfer gap intimately related to\nthe Mott transition closes smoothly instead. This indicates that within this\napproximation, the long-range screening does not play an essential role in this\nprototypical example. We explain this finding by demonstrating analytically\nthat the obtained insulating phase in this typical case is driven by\nshort-range physics of large energy scale, and the transition is controlled by\nthe charge-transfer gap closing, both insensitive to long-range screening.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:17:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lang","Zi-Jian",""],["Sen","Sudeshna",""],["Tsang","Pak Ki Henry",""],["Haule","Kristjan",""],["Dobrosavljevi\u0107","Vladimir",""],["Ku","Wei",""]]}
{"id":"2308.14054","submitter":"Koki Shiraishi","authors":"Koki Shiraishi, Hayata Yamasaki, Mio Murao","title":"Efficient decoding of stabilizer code by single-qubit local operations\n  and classical communication","comments":"16 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a protocol for extracting distributed one-qubit quantum\ninformation encoded in a stabilizer code of multiple qubits, only by\nsingle-qubit local operations and classical communication (LOCC) without global\noperations or entanglement resources. This protocol achieves efficient\nextraction within a polynomial time in terms of the number of physical qubits.\nWe apply this protocol to a setting of quantum information splitting where a\nsubset of spatially separated parties cooperate by classical communication to\nextract quantum information shared among all the parties. For this task, our\nLOCC extraction protocol allows designing hierarchical information access\nstructures among the parties, where the minimum number of parties required to\ncooperate depends on the location of extracting the shared quantum information.\nThese results provide a fundamental building block of distributed quantum\ninformation processing that requires access to distributed quantum information\nencoded in the stabilizer codes.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:19:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shiraishi","Koki",""],["Yamasaki","Hayata",""],["Murao","Mio",""]]}
{"id":"2308.14055","submitter":"Giada Franceschi","authors":"Giada Franceschi, Pavel Koc\\'an, Andrea Conti, Sebastian Brandstetter,\n  Jan Balajka, Igor Sokolovi\\'c, Markus Valtiner, Florian Mittendorfer, Michael\n  Schmid, Martin Setv\\'in, and Ulrike Diebold","title":"Resolving the intrinsic short-range ordering of K$^+$ ions on cleaved\n  muscovite mica","comments":"23 pages, 4 figures","journal-ref":"Nature Communications, 14, 208 (2023)","doi":"10.1038/s41467-023-35872-y","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Muscovite mica, KAl$_2$(Si$_3$Al)O$_{10}$(OH)$_2$, is a common layered\nphyllosilicate with perfect cleavage planes. The atomically flat surfaces\nobtained through cleaving lend themselves to scanning probe techniques with\natomic resolution and are ideal to model minerals and clays. Despite the\nimportance of the cleaved mica surfaces, several questions remain unresolved.\nIt is established that K$^+$ ions decorate the cleaved surface, but their\nintrinsic ordering -- unaffected by the interaction with the environment -- is\nnot known. This work presents clear images of the K$^+$ distribution of cleaved\nmica obtained with low-temperature non-contact atomic force microscopy (AFM)\nunder ultra-high vacuum (UHV) conditions. The data unveil the presence of\nshort-range ordering, contrasting previous assumptions of random or fully\nordered distributions. Density functional theory (DFT) calculations and Monte\nCarlo simulations show that the substitutional subsurface Al$^{3+}$ ions have\nan important role for the surface K$^+$ ion arrangement.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:29:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Franceschi","Giada",""],["Koc\u00e1n","Pavel",""],["Conti","Andrea",""],["Brandstetter","Sebastian",""],["Balajka","Jan",""],["Sokolovi\u0107","Igor",""],["Valtiner","Markus",""],["Mittendorfer","Florian",""],["Schmid","Michael",""],["Setv\u00edn","Martin",""],["Diebold","Ulrike",""]]}
{"id":"2308.14056","submitter":"Shaowei Liu","authors":"Shaowei Liu, Yangjun Liu","title":"CTR is not Enough: a Novel Reinforcement Learning based Ranking Approach\n  for Optimizing Session Clicks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ranking is a crucial module using in the recommender system. In particular,\nthe ranking module using in our YoungTao recommendation scenario is to provide\nan ordered list of items to users, to maximize the click number throughout the\nrecommendation session for each user. However, we found that the traditional\nranking method for optimizing Click-Through rate(CTR) cannot address our\nranking scenario well, since it completely ignores user leaving, and CTR is the\noptimization goal for the one-step recommendation. To effectively undertake the\npurpose of our ranking module, we propose a long-term optimization goal, named\nas CTE (Click-Through quantity expectation), for explicitly taking the behavior\nof user leaving into account. Based on CTE, we propose an effective model\ntrained by reinforcement learning. Moreover, we build a simulation environment\nfrom offline log data for estimating PBR and CTR. We conduct extensive\nexperiments on offline datasets and an online e-commerce scenario in TaoBao.\nExperimental results show that our method can boost performance effectively\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:40:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Shaowei",""],["Liu","Yangjun",""]]}
{"id":"2308.14057","submitter":"Yanze Zhu","authors":"Yanze Zhu, Yang Liu, Qingqing Wu, Changsheng You, and Qingjiang Shi","title":"Channel Estimation By Transmitting Pilots From Reconfigurable\n  Intelligent Surface","comments":"15 pages, 13 figures, accepted by IEEE TWC","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconfigurable intelligent surface (RIS) is a promising technology for future\nwireless communication systems. Channel estimation (CE) of RIS device is a\ncritical but also challenging issue for its development. The mainstream of\nexisting CE methods is confined to the so-called cascaded channel (CscdChn)\nestimation scheme, which treats the multiplicative two-hop RIS channels as an\neffective one and measures it as a whole. This CscdChn training method suffers\nfrom severe double-fading attenuation loss, which significantly degrades the CE\naccuracy. In this paper, we propose a novel RIS-transmitting (RIS-TX) based CE\nscheme, which has lower pilot overhead than CscdChn scheme and effectively\novercomes the double-fading curse via incorporating only one single transmit\nradio frequency (RF)-chain into RIS. We develop highly efficient gradient\ndescent (GD) and penalty duality decomposition (PDD)-based solutions to resolve\nthe pilot design task for the RIS-TX CE scheme, which is a difficult quartic\noptimization problem. Our designed pilot signal outperforms the discrete\nFourier transform (DFT) sequence, which is reported to be optimal for CscdChn\nscheme. Besides, both theoretical analysis and numerical results demonstrate\nthat our proposed RIS-TX scheme exhibits distinct performance characteristics\nas opposed to its CscdChn counterpart and yields superior accuracy when RIS\ndevice is not extremely large.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:41:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Yanze",""],["Liu","Yang",""],["Wu","Qingqing",""],["You","Changsheng",""],["Shi","Qingjiang",""]]}
{"id":"2308.14058","submitter":"Guy Hacohen","authors":"Guy Hacohen, Daphna Weinshall","title":"Pruning the Unlabeled Data to Improve Semi-Supervised Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the domain of semi-supervised learning (SSL), the conventional approach\ninvolves training a learner with a limited amount of labeled data alongside a\nsubstantial volume of unlabeled data, both drawn from the same underlying\ndistribution. However, for deep learning models, this standard practice may not\nyield optimal results. In this research, we propose an alternative perspective,\nsuggesting that distributions that are more readily separable could offer\nsuperior benefits to the learner as compared to the original distribution. To\nachieve this, we present PruneSSL, a practical technique for selectively\nremoving examples from the original unlabeled dataset to enhance its\nseparability. We present an empirical study, showing that although PruneSSL\nreduces the quantity of available training data for the learner, it\nsignificantly improves the performance of various competitive SSL algorithms,\nthereby achieving state-of-the-art results across several image classification\ntasks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:45:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hacohen","Guy",""],["Weinshall","Daphna",""]]}
{"id":"2308.14059","submitter":"Guang Lin","authors":"Guang Lin and Jianhai Zhang","title":"Multi-Subdomain Adversarial Network for Cross-Subject EEG-based Emotion\n  Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.HC eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The individual difference between subjects is significant in EEG-based\nemotion recognition, resulting in the difficulty of sharing the model across\nsubjects. Previous studies use domain adaptation algorithms to minimize the\nglobal domain discrepancy while ignoring the class information, which may cause\nmisalignment of subdomains and reduce model performance. This paper proposes a\nmulti-subdomain adversarial network (MSAN) for cross-subject EEG-based emotion\nrecognition. MSAN uses adversarial training to model the discrepancy in the\nglobal domain and subdomain to reduce the intra-class distance and enlarge the\ninter-class distance. In addition, MSAN initializes parameters through a\npre-trained autoencoder to ensure the stability and convertibility of the\nmodel. The experimental results show that the accuracy of MSAN is improved by\n30.02\\% on the SEED dataset comparing with the nontransfer method.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:57:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lin","Guang",""],["Zhang","Jianhai",""]]}
{"id":"2308.14060","submitter":"Roman Karasev","authors":"Pablo Gonz\\'alez-Maz\\'on, Alfredo Hubard, Roman Karasev","title":"Weak $(1-\\epsilon)$-nets for polynomial superlevel sets","comments":"3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that for any Borel probability measure $\\mu$ on $\\mathbb R^n$ there\nexists a set $X\\subset \\mathbb R^n$ of $n+1$ points such that any $n$-variate\nquadratic polynomial $P$ that is nonnegative on $X$ (i.e. $P(x)\\geq 0$, for\nevery $x \\in X$) satisfies $\\mu\\{P\\geq 0\\}\\geq \\frac{2}{(n+1)(n+2)}$. We also\nprove that given an absolutely continuous probability measure $\\mu$ on $\\mathbb\nR^n$ and $D\\leq 2k$, for every $\\delta>0$ there exists a set $X\\subset \\mathbb\nR^n$ with $|X|\\leq \\binom{n+2k}{n}-n-1$ such that any $n$-variate polynomial\n$P$ of degree $D$ that is nonnegative on $X$ satisfies $\\mu\\{P\\geq 0\\}\\geq\n\\frac{1}{\\binom{n+2k}{n}+1} - \\delta$. These statements are analogues of the\ncelebrated centerpoint theorem, which corresponds to the case of linear\npolynomials.\n  Our results follow from new estimates on the Carath\\'eodory numbers of real\nVeronese varieties, or alternatively, from bounds on the nonnegative symmetric\nrank of real symmetric tensors.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 09:59:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gonz\u00e1lez-Maz\u00f3n","Pablo",""],["Hubard","Alfredo",""],["Karasev","Roman",""]]}
{"id":"2308.14061","submitter":"Yifeng Xu","authors":"Xin Feng, Yifeng Xu, Guangming Lu, Wenjie Pei","title":"Hierarchical Contrastive Learning for Pattern-Generalizable Image\n  Corruption Detection","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Effective image restoration with large-size corruptions, such as blind image\ninpainting, entails precise detection of corruption region masks which remains\nextremely challenging due to diverse shapes and patterns of corruptions. In\nthis work, we present a novel method for automatic corruption detection, which\nallows for blind corruption restoration without known corruption masks.\nSpecifically, we develop a hierarchical contrastive learning framework to\ndetect corrupted regions by capturing the intrinsic semantic distinctions\nbetween corrupted and uncorrupted regions. In particular, our model detects the\ncorrupted mask in a coarse-to-fine manner by first predicting a coarse mask by\ncontrastive learning in low-resolution feature space and then refines the\nuncertain area of the mask by high-resolution contrastive learning. A\nspecialized hierarchical interaction mechanism is designed to facilitate the\nknowledge propagation of contrastive learning in different scales, boosting the\nmodeling performance substantially. The detected multi-scale corruption masks\nare then leveraged to guide the corruption restoration. Detecting corrupted\nregions by learning the contrastive distinctions rather than the semantic\npatterns of corruptions, our model has well generalization ability across\ndifferent corruption patterns. Extensive experiments demonstrate following\nmerits of our model: 1) the superior performance over other methods on both\ncorruption detection and various image restoration tasks including blind\ninpainting and watermark removal, and 2) strong generalization across different\ncorruption patterns such as graffiti, random noise or other image content.\nCodes and trained weights are available at https://github.com/xyfJASON/HCL .\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:03:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Feng","Xin",""],["Xu","Yifeng",""],["Lu","Guangming",""],["Pei","Wenjie",""]]}
{"id":"2308.14062","submitter":"Karyn Le Hur","authors":"Karyn Le Hur","title":"One-Half Topological Number in Entangled Quantum Physics","comments":"5 + 1 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.str-el cond-mat.supr-con hep-th quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A topological phase can be engineered in quantum physics from the Bloch\nsphere of a spin-1/2 showing an hedgehog structure as a result of a radial\nmagnetic field. We elaborate on a relation between the formation of an\nentangled wavefunction at one pole, in a two-spins model, and an interesting\npair of one-half topological numbers. Similar to Cooper pairs in\nsuperconductors, the Einstein-Podolsky-Rosen pair or Bell state produces a half\nflux quantization, which here refers to the halved flux of the Berry curvature\non the surface. These 1/2-numbers also reveal the presence of a free Majorana\nfermion at a pole. The topological responses can be measured when driving from\nnorth to south and also from a circularly polarized field at the poles\nrevealing the quantized or half-quantized nature of the protected transverse\ncurrents. We show applications of entangled wavefunctions in band structures,\nintroducing a local topological marker in momentum space, to characterize the\ntopological response of two-dimensional semimetals in bilayer geometries.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:08:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hur","Karyn Le",""]]}
{"id":"2308.14063","submitter":"Feiyang Xiao","authors":"Hejing Zhang, Jian Guan, Qiaoxi Zhu, Feiyang Xiao, Youde Liu","title":"Anomalous Sound Detection Using Self-Attention-Based Frequency Pattern\n  Analysis of Machine Sounds","comments":"Accepted in INTERSPEECH 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Different machines can exhibit diverse frequency patterns in their emitted\nsound. This feature has been recently explored in anomaly sound detection and\nreached state-of-the-art performance. However, existing methods rely on the\nmanual or empirical determination of the frequency filter by observing the\neffective frequency range in the training data, which may be impractical for\ngeneral application. This paper proposes an anomalous sound detection method\nusing self-attention-based frequency pattern analysis and spectral-temporal\ninformation fusion. Our experiments demonstrate that the self-attention module\nautomatically and adaptively analyses the effective frequencies of a machine\nsound and enhances that information in the spectral feature representation.\nWith spectral-temporal information fusion, the obtained audio feature\neventually improves the anomaly detection performance on the DCASE 2020\nChallenge Task 2 dataset.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:21:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Hejing",""],["Guan","Jian",""],["Zhu","Qiaoxi",""],["Xiao","Feiyang",""],["Liu","Youde",""]]}
{"id":"2308.14064","submitter":"Xuan Cui","authors":"Xinyi Wang, Xuan Cui, Danxu Li, Fang Liu, Licheng Jiao","title":"Multi-model fusion for Aerial Vision and Dialog Navigation based on\n  human attention aids","comments":"4 pages, 1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Drones have been widely used in many areas of our daily lives. It relieves\npeople of the burden of holding a controller all the time and makes drone\ncontrol easier to use for people with disabilities or occupied hands. However,\nthe control of aerial robots is more complicated compared to normal robots due\nto factors such as uncontrollable height. Therefore, it is crucial to develop\nan intelligent UAV that has the ability to talk to humans and follow natural\nlanguage commands. In this report, we present an aerial navigation task for the\n2023 ICCV Conversation History. Based on the AVDN dataset containing more than\n3k recorded navigation trajectories and asynchronous human-robot conversations,\nwe propose an effective method of fusion training of Human Attention Aided\nTransformer model (HAA-Transformer) and Human Attention Aided LSTM (HAA-LSTM)\nmodel, which achieves the prediction of the navigation routing points and human\nattention. The method not only achieves high SR and SPL metrics, but also shows\na 7% improvement in GP metrics compared to the baseline model.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:32:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Xinyi",""],["Cui","Xuan",""],["Li","Danxu",""],["Liu","Fang",""],["Jiao","Licheng",""]]}
{"id":"2308.14065","submitter":"Lin Nie","authors":"Lin Nie, Huanyuan Shan, Guoliang Li, Lei Wang, Charling Tao, Qifan\n  Cui, Yushan Xie, Dezi Liu, Zekang Zhang","title":"HybPSF: Hybrid PSF reconstruction for the observed JWST NIRCam image","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The James Webb Space Telescope (JWST) ushers in a new era of astronomical\nobservation and discovery, offering unprecedented precision in a variety of\nmeasurements such as photometry, astrometry, morphology, and shear measurement.\nAccurate point spread function (PSF) models are crucial for many of these\nmeasurements. In this paper, we introduce a hybrid PSF construction method\ncalled HybPSF for JWST NIRCam imaging data. HybPSF combines the WebbPSF\nsoftware, which simulates the PSF for JWST, with observed data to produce more\naccurate and reliable PSF models. We apply this method to the SMACS J0723\nimaging data and construct supplementary structures from residuals obtained by\nsubtracting the WebbPSF PSF model from the data. Our results show that HybPSF\nsignificantly reduces discrepancies between the PSF model and the data compared\nto WebbPSF. Specifically, the PSF shape parameter ellipticity and size\ncomparisons indicate that HybPSF improves precision by a factor of\napproximately 10 for \\$R^2\\$ and \\$50\\%\\$ for \\$e\\$. This improvement has\nimportant implications for astronomical measurements using JWST NIRCam imaging\ndata.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:39:23 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:13:50 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Nie","Lin",""],["Shan","Huanyuan",""],["Li","Guoliang",""],["Wang","Lei",""],["Tao","Charling",""],["Cui","Qifan",""],["Xie","Yushan",""],["Liu","Dezi",""],["Zhang","Zekang",""]]}
{"id":"2308.14066","submitter":"Yi Lin","authors":"Xin Yang, Yi Lin, Zhiwei Wang, Xin Li, Kwang-Ting Cheng","title":"Bi-Modality Medical Image Synthesis Using Semi-Supervised Sequential\n  Generative Adversarial Networks","comments":null,"journal-ref":null,"doi":"10.1109/JBHI.2019.2922986","report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a bi-modality medical image synthesis approach\nbased on sequential generative adversarial network (GAN) and semi-supervised\nlearning. Our approach consists of two generative modules that synthesize\nimages of the two modalities in a sequential order. A method for measuring the\nsynthesis complexity is proposed to automatically determine the synthesis order\nin our sequential GAN. Images of the modality with a lower complexity are\nsynthesized first, and the counterparts with a higher complexity are generated\nlater. Our sequential GAN is trained end-to-end in a semi-supervised manner. In\nsupervised training, the joint distribution of bi-modality images are learned\nfrom real paired images of the two modalities by explicitly minimizing the\nreconstruction losses between the real and synthetic images. To avoid\noverfitting limited training images, in unsupervised training, the marginal\ndistribution of each modality is learned based on unpaired images by minimizing\nthe Wasserstein distance between the distributions of real and fake images. We\ncomprehensively evaluate the proposed model using two synthesis tasks based on\nthree types of evaluate metrics and user studies. Visual and quantitative\nresults demonstrate the superiority of our method to the state-of-the-art\nmethods, and reasonable visual quality and clinical significance. Code is made\npublicly available at\nhttps://github.com/hustlinyi/Multimodal-Medical-Image-Synthesis.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:39:33 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 04:59:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yang","Xin",""],["Lin","Yi",""],["Wang","Zhiwei",""],["Li","Xin",""],["Cheng","Kwang-Ting",""]]}
{"id":"2308.14067","submitter":"Mats Carlsson","authors":"Mats Carlsson and Bart De Pontieu","title":"An optically thin view of the solar chromosphere from observations of\n  the O I 1355{\\AA} spectral line","comments":"24 pages, 18 figures, accepted for publication in Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The O I 1355{\\AA} spectral line is one of the only optically thin lines that\nare both routinely observed and thought to be formed in the chromosphere. We\npresent analysis of a variety of observations of this line with the Interface\nRegion Imaging Spectrograph (IRIS), and compare it with other IRIS diagnostics\nas well as diagnostics of the photospheric magnetic field. We utilize special\ndeep exposure modes on IRIS and provide an overview of the statistical\nproperties of this spectral line for several different regions on the Sun. We\nanalyze the spatio-temporal variations of the line intensity, and find that it\nis often significantly enhanced when and where magnetic flux of opposite\npolarities cancel. Significant emission occurs in association with\nchromospheric spicules. Because of the optically thin nature of the O I line,\nthe non-thermal broadening can provide insight into unresolved small-scale\nmotions. We find that the non-thermal broadening is modest, with typical values\nof 5-10 km/s, and shows some center-to-limb variation, with a modest increase\ntowards the limb. The dependence with height of the intensity and line\nbroadening off-limb is compatible with the line broadening being dominated by\nthe superposition of Alfv\\'en waves on different structures. The non-thermal\nbroadening shows a modest but significant enhancement above locations that are\nin between photospheric magnetic flux concentrations in plage, i.e., where the\nmagnetic field is likely to be more inclined with respect to the line-of-sight.\nOur measurements provide strict constraints on future theoretical models of the\nchromosphere.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:48:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Carlsson","Mats",""],["De Pontieu","Bart",""]]}
{"id":"2308.14068","submitter":"Woo-Jeong Baek","authors":"Woo-Jeong Baek, Tom P. Huck, Joschka Haas, Jonas Lewandrowski, Tamim\n  Asfour, and Torsten Kr\\\"oger","title":"Uncertainty-aware Risk Assessment of Robotic Systems via Importance\n  Sampling","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we introduce a probabilistic approach to risk assessment of\nrobot systems by focusing on the impact of uncertainties. While various\napproaches to identifying systematic hazards (e.g., bugs, design flaws, etc.)\ncan be found in current literature, little attention has been devoted to\nevaluating risks in robot systems in a probabilistic manner. Existing methods\nrely on discrete notions for dangerous events and assume that the consequences\nof these can be described by simple logical operations. In this work, we\nconsider measurement uncertainties as one main contributor to the evolvement of\nrisks. Specifically, we study the impact of temporal and spatial uncertainties\non the occurrence probability of dangerous failures, thereby deriving an\napproach for an uncertainty-aware risk assessment. Secondly, we introduce a\nmethod to improve the statistical significance of our results: While the rare\noccurrence of hazardous events makes it challenging to draw conclusions with\nreliable accuracy, we show that importance sampling -- a technique that\nsuccessively generates samples in regions with sparse probability densities --\nallows for overcoming this issue. We demonstrate the validity of our novel\nuncertainty-aware risk assessment method in three simulation scenarios from the\ndomain of human-robot collaboration. Finally, we show how the results can be\nused to evaluate arbitrary safety limits of robot systems.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:57:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baek","Woo-Jeong",""],["Huck","Tom P.",""],["Haas","Joschka",""],["Lewandrowski","Jonas",""],["Asfour","Tamim",""],["Kr\u00f6ger","Torsten",""]]}
{"id":"2308.14069","submitter":"Ilya Shkredov","authors":"Ilya D. Shkredov","title":"On the distribution of quadratic residues","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In our paper, we apply additive-combinatorial methods to study the\ndistribution of the set of squares $\\mathcal{R}$ in the prime field. We obtain\nthe best upper bound on the number of gaps in $\\mathcal{R}$ at the moment and\ngeneralize this result for sets with small doubling.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:59:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shkredov","Ilya D.",""]]}
{"id":"2308.14070","submitter":"Kyoungyeon Choi","authors":"Kyoungyeon Choi, Jaewon Shin, Eunyi Lyou","title":"DETDet: Dual Ensemble Teeth Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The field of dentistry is in the era of digital transformation. Particularly,\nartificial intelligence is anticipated to play a significant role in digital\ndentistry. AI holds the potential to significantly assist dental practitioners\nand elevate diagnostic accuracy. In alignment with this vision, the 2023 MICCAI\nDENTEX challenge aims to enhance the performance of dental panoramic X-ray\ndiagnosis and enumeration through technological advancement. In response, we\nintroduce DETDet, a Dual Ensemble Teeth Detection network. DETDet encompasses\ntwo distinct modules dedicated to enumeration and diagnosis. Leveraging the\nadvantages of teeth mask data, we employ Mask-RCNN for the enumeration module.\nFor the diagnosis module, we adopt an ensemble model comprising DiffusionDet\nand DINO. To further enhance precision scores, we integrate a complementary\nmodule to harness the potential of unlabeled data. The code for our approach\nwill be made accessible at https://github.com/Bestever-choi/Evident\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:04:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Choi","Kyoungyeon",""],["Shin","Jaewon",""],["Lyou","Eunyi",""]]}
{"id":"2308.14071","submitter":"Mine Dogan","authors":"Mine Gokce Dogan, Martina Cardone, Christina Fragouli","title":"Supporting Passive Users in mmWave Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interference from active to passive users is a well-recognized challenge\nin millimeter-wave (mmWave) communications. We propose a method that enables to\nlimit the interference on passive users (whose presence may not be detected\nsince they do not transmit) with a small penalty to the throughput of active\nusers. Our approach abstracts away (in a simple, yet informative way) the\nphysical layer component and it leverages the directivity of mmWave links and\nthe available network path diversity. We provide linear programming\nformulations, lower bounds on active users rates, numerical evaluations, and we\nestablish a connection with the problem of (information theoretically) secure\ncommunication over mmWave networks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:05:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dogan","Mine Gokce",""],["Cardone","Martina",""],["Fragouli","Christina",""]]}
{"id":"2308.14072","submitter":"Xiang Liu","authors":"Ri-Qing Qian and Xiang Liu","title":"Production of charmonium $\\chi_{cJ}(2P)$ plus one $\\omega$ meson by\n  $e^+e^-$ annihilation","comments":"7 pages and 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inspired by the recent observation of $e^+e^-\\to \\omega X(3872)$ by the\nBESIII Collaboration, in this work we study the production of the charmonium\n$\\chi_{cJ}(2P)$ by $e^+e^-$ annihilation. We find that the\n$e^+e^-\\to\\omega\\chi_{c0}(2P)$ and $e^+e^-\\to \\omega\\chi_{c2}(2P)$ have sizable\nproduction rates, when taking the cross section data from $e^+e^-\\to \\omega\nX(3872)$ as the scaling point and treating the $X(3872)$ as the charmonium\n$\\chi_{c1}(2P)$. Considering that the dominant decay modes of $\\chi_{c0}$ and\n$\\chi_{c2}(2P)$ involve $D\\bar{D}$ final states, we propose that $e^+e^-\\to\n\\omega D\\bar{D}$ is an ideal process to identify $\\chi_{c0}(2P)$ and\n$\\chi_{c2}(2P)$, which is similar to the situation that happens in the\n$D\\bar{D}$ invariant mass spectrum of the $\\gamma\\gamma\\to D\\bar{D}$ and\n$B^+\\to D^+{D}^- K^+$ processes. With continuous accumulation of experimental\ndata, these proposed production processes offer a promising avenue for\nexploration by the BESIII and Belle II collaborations.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:08:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Qian","Ri-Qing",""],["Liu","Xiang",""]]}
{"id":"2308.14073","submitter":"Nitish Kumar Gupta","authors":"Nitish Kumar Gupta, Sapireddy Srinivasu, Mukesh Kumar, Anjani Kumar\n  Tiwari, Sudipta Sarkar Pal, Harshawardhan Wanare, S. Anantha Ramakrishna","title":"Direct Determination of Photonic Stopband Topological Character: A\n  Framework based on Dispersion Measurements","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ascertainment of photonic stopband absolute topological character requires\ninformation regarding the Bloch eigenfunction spatial distribution.\nConsequently, the experimental investigations predominantly restrict themselves\nto the bulk-boundary correspondence principle and the ensuing emergence of\ntopological surface state. Although capable of establishing the equivalence or\ninequivalence of bandgaps, the determination of their absolute topological\nidentity remains out of its purview. The alternate method of reflection\nphase-based identification also provides only contentious improvements owing to\nthe measurement complexities pertaining to the interferometric setups. To\ncircumvent these limitations, we resort to the Kramers-Kronig amplitude-phase\ncausality considerations and propose an experimentally conducive method for\nbandgap topological character determination directly from the parametric\nreflectance measurements. Particularly, it has been demonstrated that in case\nof one-dimensional photonic crystals, polarization-resolved dispersion\nmeasurements suffice in qualitatively determining bandgap absolute topological\nidentities. By invoking the translational invariance of the investigated\nsamples, we also define a parameter Differential Effective Mass that\nencapsulates bandgap topological identities and engenders an experimentally\ndiscernible bandgap classifier.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:36:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gupta","Nitish Kumar",""],["Srinivasu","Sapireddy",""],["Kumar","Mukesh",""],["Tiwari","Anjani Kumar",""],["Pal","Sudipta Sarkar",""],["Wanare","Harshawardhan",""],["Ramakrishna","S. Anantha",""]]}
{"id":"2308.14074","submitter":"Yangang Wang","authors":"Wei Xie, Zimeng Zhao, Shiying Li, Binghui Zuo, Yangang Wang","title":"Nonrigid Object Contact Estimation With Regional Unwrapping Transformer","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Acquiring contact patterns between hands and nonrigid objects is a common\nconcern in the vision and robotics community. However, existing learning-based\nmethods focus more on contact with rigid ones from monocular images. When\nadopting them for nonrigid contact, a major problem is that the existing\ncontact representation is restricted by the geometry of the object.\nConsequently, contact neighborhoods are stored in an unordered manner and\ncontact features are difficult to align with image cues. At the core of our\napproach lies a novel hand-object contact representation called RUPs (Region\nUnwrapping Profiles), which unwrap the roughly estimated hand-object surfaces\nas multiple high-resolution 2D regional profiles. The region grouping strategy\nis consistent with the hand kinematic bone division because they are the\nprimitive initiators for a composite contact pattern. Based on this\nrepresentation, our Regional Unwrapping Transformer (RUFormer) learns the\ncorrelation priors across regions from monocular inputs and predicts\ncorresponding contact and deformed transformations. Our experiments demonstrate\nthat the proposed framework can robustly estimate the deformed degrees and\ndeformed transformations, which makes it suitable for both nonrigid and rigid\ncontact.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:37:26 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:40:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xie","Wei",""],["Zhao","Zimeng",""],["Li","Shiying",""],["Zuo","Binghui",""],["Wang","Yangang",""]]}
{"id":"2308.14075","submitter":"Gil Shapira","authors":"Gil Shapira and Yosi Keller","title":"FaceCoresetNet: Differentiable Coresets for Face Set Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In set-based face recognition, we aim to compute the most discriminative\ndescriptor from an unbounded set of images and videos showing a single person.\nA discriminative descriptor balances two policies when aggregating information\nfrom a given set. The first is a quality-based policy: emphasizing high-quality\nand down-weighting low-quality images. The second is a diversity-based policy:\nemphasizing unique images in the set and down-weighting multiple occurrences of\nsimilar images as found in video clips which can overwhelm the set\nrepresentation. This work frames face-set representation as a differentiable\ncoreset selection problem. Our model learns how to select a small coreset of\nthe input set that balances quality and diversity policies using a learned\nmetric parameterized by the face quality, optimized end-to-end. The selection\nprocess is a differentiable farthest-point sampling (FPS) realized by\napproximating the non-differentiable Argmax operation with differentiable\nsampling from the Gumbel-Softmax distribution of distances. The small coreset\nis later used as queries in a self and cross-attention architecture to enrich\nthe descriptor with information from the whole set. Our model is\norder-invariant and linear in the input set size. We set a new SOTA to set face\nverification on the IJB-B and IJB-C datasets. Our code is publicly available.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:38:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shapira","Gil",""],["Keller","Yosi",""]]}
{"id":"2308.14076","submitter":"Chiranjibi Sitaula","authors":"Chiranjibi Sitaula, Jagannath Aryal and Avik Bhattacharya","title":"A Novel Multi-scale Attention Feature Extraction Block for Aerial Remote\n  Sensing Image Classification","comments":"The paper is under review in IEEE Geoscience and Remote Sensing\n  Letters Journal (IEEE-GRSL). This version may be deleted and/or updated based\n  on the journal's policy","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classification of very high-resolution (VHR) aerial remote sensing (RS)\nimages is a well-established research area in the remote sensing community as\nit provides valuable spatial information for decision-making. Existing works on\nVHR aerial RS image classification produce an excellent classification\nperformance; nevertheless, they have a limited capability to well-represent VHR\nRS images having complex and small objects, thereby leading to performance\ninstability. As such, we propose a novel plug-and-play multi-scale attention\nfeature extraction block (MSAFEB) based on multi-scale convolution at two\nlevels with skip connection, producing discriminative/salient information at a\ndeeper/finer level. The experimental study on two benchmark VHR aerial RS image\ndatasets (AID and NWPU) demonstrates that our proposal achieves a\nstable/consistent performance (minimum standard deviation of $0.002$) and\ncompetent overall classification performance (AID: 95.85\\% and NWPU: 94.09\\%).\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:49:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sitaula","Chiranjibi",""],["Aryal","Jagannath",""],["Bhattacharya","Avik",""]]}
{"id":"2308.14077","submitter":"Ivan Baburin","authors":"Ivan Baburin and Ryan Cotterell","title":"An Analysis of On-the-fly Determinization of Finite-state Automata","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.FL cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we establish an abstraction of on-the-fly determinization of\nfinite-state automata using transition monoids and demonstrate how it can be\napplied to bound the asymptotics. We present algebraic and combinatorial\nproperties that are sufficient for a polynomial state complexity of the\ndeterministic automaton constructed on-the-fly. A special case of our findings\nis that automata with many non-deterministic transitions almost always admit a\ndeterminization of polynomial complexity. Furthermore, we extend our ideas to\nweighted finite-state automata.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:51:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baburin","Ivan",""],["Cotterell","Ryan",""]]}
{"id":"2308.14078","submitter":"Zi-Xin Zou","authors":"Zi-Xin Zou, Weihao Cheng, Yan-Pei Cao, Shi-Sheng Huang, Ying Shan,\n  Song-Hai Zhang","title":"Sparse3D: Distilling Multiview-Consistent Diffusion for Object\n  Reconstruction from Sparse Views","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconstructing 3D objects from extremely sparse views is a long-standing and\nchallenging problem. While recent techniques employ image diffusion models for\ngenerating plausible images at novel viewpoints or for distilling pre-trained\ndiffusion priors into 3D representations using score distillation sampling\n(SDS), these methods often struggle to simultaneously achieve high-quality,\nconsistent, and detailed results for both novel-view synthesis (NVS) and\ngeometry. In this work, we present Sparse3D, a novel 3D reconstruction method\ntailored for sparse view inputs. Our approach distills robust priors from a\nmultiview-consistent diffusion model to refine a neural radiance field.\nSpecifically, we employ a controller that harnesses epipolar features from\ninput views, guiding a pre-trained diffusion model, such as Stable Diffusion,\nto produce novel-view images that maintain 3D consistency with the input. By\ntapping into 2D priors from powerful image diffusion models, our integrated\nmodel consistently delivers high-quality results, even when faced with\nopen-world objects. To address the blurriness introduced by conventional SDS,\nwe introduce the category-score distillation sampling (C-SDS) to enhance\ndetail. We conduct experiments on CO3DV2 which is a multi-view dataset of\nreal-world objects. Both quantitative and qualitative evaluations demonstrate\nthat our approach outperforms previous state-of-the-art works on the metrics\nregarding NVS and geometry reconstruction.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:52:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zou","Zi-Xin",""],["Cheng","Weihao",""],["Cao","Yan-Pei",""],["Huang","Shi-Sheng",""],["Shan","Ying",""],["Zhang","Song-Hai",""]]}
{"id":"2308.14079","submitter":"Anushka Santhika Thenuwara PhD","authors":"Anushka Thenuwara and Andrei Sidorov","title":"Developing a simulation tool to investigate a novel trapped two-state\n  Bose-Einstein condensate Ramsey interferometer driven by dipole oscillations\n  and gravitational sag","comments":"16 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph cond-mat.quant-gas quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose and explore the feasibility of a novel Ramsey interferometer\ncreated by a trapped two-state Bose-Einstein condensate (BEC) driven by dipole\noscillations and gravitational sag. The BEC is formed in a pure cigar shaped\ncompressed magnetic trap (CMT) via a dilute atom cloud of $^{87}Rb$ atoms in\nstate $\\vert F=2, m_F=+2 \\rangle$ $(\\vert +2 \\rangle)$ of the $5\n^2S_{\\frac{1}{2}}$ ground state. Here, Rmasey interferometry is performed with\nstates $\\vert F=2, m_F=+1 \\rangle$ $(\\vert +1 \\rangle)$ and $\\vert +2 \\rangle$.\nThe proposed interferometer utilises the response of atoms to the harmonic\noscillator trapping potential and the gravitational sag due to the variation in\nthe $m_F$ state. Briefly, the state $\\vert +1 \\rangle$ experiences a shallower\nradial trap with a larger gravitational sag; whereas, state $\\vert +2 \\rangle$\nexperiences a tighter radial trap with a gravitational sag which is half of\nstate $\\vert +1 \\rangle$. Due to this, a superposition between the states\n$\\vert +1 \\rangle$ and $\\vert +2 \\rangle$ experiences multipath propagation\nresulting in an interference pattern. This may be utilised to measure local\ngravitational fields and measure inter-sate scattering lengths. Here, a\ntheoretical framework is reported which is developed via the two-level system\nin combination with the Gross-Pitaevskii equation (GPE). Further, the\ndevelopment of a simulation tool via GPELabs in MATLAB that explores the prosed\ninterferometer is reported along with key insights and findings.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:53:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Thenuwara","Anushka",""],["Sidorov","Andrei",""]]}
{"id":"2308.14080","submitter":"Liang Chen Dr.","authors":"Chenglong Bao, Liang Chen, Jiahong Li","title":"The Global R-linear Convergence of Nesterov's Accelerated Gradient\n  Method with Unknown Strongly Convex Parameter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Nesterov accelerated gradient (NAG) method is an important\nextrapolation-based numerical algorithm that accelerates the convergence of the\ngradient descent method in convex optimization. When dealing with an objective\nfunction that is $\\mu$-strongly convex, selecting extrapolation coefficients\ndependent on $\\mu$ enables global R-linear convergence. In cases $\\mu$ is\nunknown, a commonly adopted approach is to set the extrapolation coefficient\nusing the original NAG method, referred to as NAG-c. This choice allows for\nachieving the optimal iteration complexity among first-order methods for\ngeneral convex problems. However, it remains an open question whether the NAG-c\nmethod exhibits global R-linear convergence for strongly convex problems. In\nthis work, we answer this question positively by establishing the Q-linear\nconvergence of certain constructed Lyapunov sequences. Furthermore, we extend\nour result to the global R-linear convergence of the accelerated proximal\ngradient method, which is employed for solving strongly convex composite\noptimization problems with nonsmooth terms in the objective function.\nInterestingly, these results contradict the findings of the continuous\ncounterpart of the NAG-c method in [Su, Boyd, and Cand\\'es, J. Mach. Learn.\nRes., 2016, 17(153), 1-43], where the convergence rate by the suggested\nordinary differential equation cannot exceed $O(1/{\\tt poly}(k))$ for strongly\nconvex functions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:56:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bao","Chenglong",""],["Chen","Liang",""],["Li","Jiahong",""]]}
{"id":"2308.14081","submitter":"Yubiao Yue","authors":"Yubiao Yue, Jun Xue, Haihua Liang, Zhenzhang Li","title":"U-SEANNet: A Simple, Efficient and Applied U-Shaped Network for\n  Diagnosing Nasal Diseases from Nasal Endoscopic Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Utilizing deep learning (DL) models to improve the early diagnosis of nasal\ndiseases from nasal endoscopic images holds paramount importance. However, the\nlack of available datasets stymies advancements in this field. Furthermore,\nexisting models fail to strike a good trade-off between model diagnosis\nperformance, model complexity and parameter size, rendering them unsuitable for\npractical application. To bridge these gaps, we created the first large-scale\nnasal endoscopy dataset, named 7-NasEID, comprising 11,352 images that span six\nnasal diseases and normal samples. Building on this, we proposed U-SEANNet, an\ninnovative architecture, underpinned by depth-wise separable convolutions.\nAdditionally, to augment its discernment capabilities for subtle variations in\ninput images, we further proposed the Global-Local Channel Feature Fusion\nModule, enabling the U-SEANNet to focus salient channel features from both\nglobal and local contexts. Notably, U-SEANNet's parameter size and GFLOPs are\nonly 0.78M and 0.21, respectively. Employing the 7-NasalEID, we conducted the\nfive-fold cross-validation on U-SEANNet, juxtaposing its performance against\nseventeen renowned architectures. The experimental results suggest U-SEANNet as\nthe state-of-the-art (SOTA) model, achieves an accuracy of 93.58%, sensitivity\nof 90.17%, and specificity of 91.27%. These findings demonstrate U-SEANNet's\nprodigious potential for diagnosing nasal diseases in practical use, providing\nthe development of efficacy nasal diseases diagnosis tools with a new insight.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 11:57:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yue","Yubiao",""],["Xue","Jun",""],["Liang","Haihua",""],["Li","Zhenzhang",""]]}
{"id":"2308.14082","submitter":"Yangang Wang","authors":"Binghui Zuo, Zimeng Zhao, Wenqian Sun, Wei Xie, Zhou Xue and Yangang\n  Wang","title":"Reconstructing Interacting Hands with Interaction Prior from Monocular\n  Images","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconstructing interacting hands from monocular images is indispensable in\nAR/VR applications. Most existing solutions rely on the accurate localization\nof each skeleton joint. However, these methods tend to be unreliable due to the\nsevere occlusion and confusing similarity among adjacent hand parts. This also\ndefies human perception because humans can quickly imitate an interaction\npattern without localizing all joints. Our key idea is to first construct a\ntwo-hand interaction prior and recast the interaction reconstruction task as\nthe conditional sampling from the prior. To expand more interaction states, a\nlarge-scale multimodal dataset with physical plausibility is proposed. Then a\nVAE is trained to further condense these interaction patterns as latent codes\nin a prior distribution. When looking for image cues that contribute to\ninteraction prior sampling, we propose the interaction adjacency heatmap (IAH).\nCompared with a joint-wise heatmap for localization, IAH assigns denser visible\nfeatures to those invisible joints. Compared with an all-in-one visible\nheatmap, it provides more fine-grained local interaction information in each\ninteraction region. Finally, the correlations between the extracted features\nand corresponding interaction codes are linked by the ViT module. Comprehensive\nevaluations on benchmark datasets have verified the effectiveness of this\nframework. The code and dataset are publicly available at\nhttps://github.com/binghui-z/InterPrior_pytorch\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:01:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zuo","Binghui",""],["Zhao","Zimeng",""],["Sun","Wenqian",""],["Xie","Wei",""],["Xue","Zhou",""],["Wang","Yangang",""]]}
{"id":"2308.14083","submitter":"Yangang Wang","authors":"Xiaohan Yuan, Cong Liu and Yangang Wang","title":"4D Myocardium Reconstruction with Decoupled Motion and Shape Model","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Estimating the shape and motion state of the myocardium is essential in\ndiagnosing cardiovascular diseases.However, cine magnetic resonance (CMR)\nimaging is dominated by 2D slices, whose large slice spacing challenges\ninter-slice shape reconstruction and motion acquisition.To address this\nproblem, we propose a 4D reconstruction method that decouples motion and shape,\nwhich can predict the inter-/intra- shape and motion estimation from a given\nsparse point cloud sequence obtained from limited slices. Our framework\ncomprises a neural motion model and an end-diastolic (ED) shape model. The\nimplicit ED shape model can learn a continuous boundary and encourage the\nmotion model to predict without the supervision of ground truth deformation,\nand the motion model enables canonical input of the shape model by deforming\nany point from any phase to the ED phase. Additionally, the constructed\nED-space enables pre-training of the shape model, thereby guiding the motion\nmodel and addressing the issue of data scarcity. We propose the first 4D\nmyocardial dataset as we know and verify our method on the proposed, public,\nand cross-modal datasets, showing superior reconstruction performance and\nenabling various clinical applications.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:08:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Xiaohan",""],["Liu","Cong",""],["Wang","Yangang",""]]}
{"id":"2308.14084","submitter":"Yuanbin Fu","authors":"Yuanbin Fu and Xiaojie Guo","title":"Practical Edge Detection via Robust Collaborative Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Edge detection, as a core component in a wide range of visionoriented tasks,\nis to identify object boundaries and prominent edges in natural images. An edge\ndetector is desired to be both efficient and accurate for practical use. To\nachieve the goal, two key issues should be concerned: 1) How to liberate deep\nedge models from inefficient pre-trained backbones that are leveraged by most\nexisting deep learning methods, for saving the computational cost and cutting\nthe model size; and 2) How to mitigate the negative influence from noisy or\neven wrong labels in training data, which widely exist in edge detection due to\nthe subjectivity and ambiguity of annotators, for the robustness and accuracy.\nIn this paper, we attempt to simultaneously address the above problems via\ndeveloping a collaborative learning based model, termed PEdger. The principle\nbehind our PEdger is that, the information learned from different training\nmoments and heterogeneous (recurrent and non recurrent in this work)\narchitectures, can be assembled to explore robust knowledge against noisy\nannotations, even without the help of pre-training on extra data. Extensive\nablation studies together with quantitative and qualitative experimental\ncomparisons on the BSDS500 and NYUD datasets are conducted to verify the\neffectiveness of our design, and demonstrate its superiority over other\ncompetitors in terms of accuracy, speed, and model size. Codes can be found at\nhttps://github.co/ForawardStar/PEdger.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:12:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fu","Yuanbin",""],["Guo","Xiaojie",""]]}
{"id":"2308.14085","submitter":"Davide Ghio","authors":"Davide Ghio, Yatin Dandi, Florent Krzakala and Lenka Zdeborov\\'a","title":"Sampling with flows, diffusion and autoregressive neural networks: A\n  spin-glass perspective","comments":"39 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent years witnessed the development of powerful generative models based on\nflows, diffusion or autoregressive neural networks, achieving remarkable\nsuccess in generating data from examples with applications in a broad range of\nareas. A theoretical analysis of the performance and understanding of the\nlimitations of these methods remain, however, challenging. In this paper, we\nundertake a step in this direction by analysing the efficiency of sampling by\nthese methods on a class of problems with a known probability distribution and\ncomparing it with the sampling performance of more traditional methods such as\nthe Monte Carlo Markov chain and Langevin dynamics. We focus on a class of\nprobability distribution widely studied in the statistical physics of\ndisordered systems that relate to spin glasses, statistical inference and\nconstraint satisfaction problems.\n  We leverage the fact that sampling via flow-based, diffusion-based or\nautoregressive networks methods can be equivalently mapped to the analysis of a\nBayes optimal denoising of a modified probability measure. Our findings\ndemonstrate that these methods encounter difficulties in sampling stemming from\nthe presence of a first-order phase transition along the algorithm's denoising\npath. Our conclusions go both ways: we identify regions of parameters where\nthese methods are unable to sample efficiently, while that is possible using\nstandard Monte Carlo or Langevin approaches. We also identify regions where the\nopposite happens: standard approaches are inefficient while the discussed\ngenerative methods work well.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:16:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghio","Davide",""],["Dandi","Yatin",""],["Krzakala","Florent",""],["Zdeborov\u00e1","Lenka",""]]}
{"id":"2308.14086","submitter":"Dun Zhou","authors":"Tingting Su, Dun Zhou","title":"The Morse Smale property for time-periodic scalar reaction-diffusion\n  equation on the circle","comments":"27 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  \\begin{abstract} We study the Morse-Smale property for the following scalar\nsemilinear parabolic equation on the circle $S^1$, \\begin{equation*}\nu_{t}=u_{xx}+f(t,u,u_{x}),\\,\\,t>0,\\,x\\in S^{1}=\\mathbb{R}/2\\pi \\mathbb{Z},\n\\end{equation*} where $f$ is a $C^2$ function and $T$-periodic in $t$. Assume\nthat the equation admits a compact global attractor $\\mathcal{A}$ and let $P$\nbe the Poincar\\'{e} map of this equation. We exclude homoclinic connection for\nhyperbolic fixed points of $P$ and prove that stable and unstable manifolds for\nany two heteroclinic hyperbolic fixed points of $P$ intersect transversely.\nFurther, this equation admits the Morse-Smale property provided that all\n$\\omega$-limit sets (in the case $f(t,u,u_x)=f(t,u,-u_x)$, the $\\omega$-limit\nset is just a fixed point) of the corresponding Poincar\\'{e} map are\nhyperbolic. \\end{abstract}\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:19:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Tingting",""],["Zhou","Dun",""]]}
{"id":"2308.14087","submitter":"Sumaya Mustofa","authors":"Sumaya Mustofa, Md Mehedi Hasan Munna, Yousuf Rayhan Emon, Golam\n  Rabbany, Md Taimur Ahad","title":"A comprehensive review on Plant Leaf Disease detection using Deep\n  learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Leaf disease is a common fatal disease for plants. Early diagnosis and\ndetection is necessary in order to improve the prognosis of leaf diseases\naffecting plant. For predicting leaf disease, several automated systems have\nalready been developed using different plant pathology imaging modalities. This\npaper provides a systematic review of the literature on leaf disease-based\nmodels for the diagnosis of various plant leaf diseases via deep learning. The\nadvantages and limitations of different deep learning models including Vision\nTransformer (ViT), Deep convolutional neural network (DCNN), Convolutional\nneural network (CNN), Residual Skip Network-based Super-Resolution for Leaf\nDisease Detection (RSNSR-LDD), Disease Detection Network (DDN), and YOLO (You\nonly look once) are described in this review. The review also shows that the\nstudies related to leaf disease detection applied different deep learning\nmodels to a number of publicly available datasets. For comparing the\nperformance of the models, different metrics such as accuracy, precision,\nrecall, etc. were used in the existing studies.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:20:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mustofa","Sumaya",""],["Munna","Md Mehedi Hasan",""],["Emon","Yousuf Rayhan",""],["Rabbany","Golam",""],["Ahad","Md Taimur",""]]}
{"id":"2308.14088","submitter":"Yi Liang","authors":"Nana Liu, Liu Tan, Kaijian Chen, Peilong Hong, Xiaoming Mo, Bingsuo\n  Zou, Yi Liang","title":"Robust autofocusing propagation in turbulence","comments":"10pages, 6figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We conducted a comprehensive study on the robust propagation of the same\nspot-size Gaussian beam (SSGB), same envelope Gaussian beam (SEGB), Circular\nAiry beam (CAB) and Circular Pearcey beam (CPB) in complex environments. Our\nfindings clearly demonstrate that autofocusing beams exhibit higher stability\nin propagation compared with the Gaussian beams. To validate our results, we\nstatistically analyze the intensity fluctuation of autofocusing beams and\nGaussian beams. The analysis reveals that the intensity fluctuations of\nautofocusing beams are significantly smaller than that of Gaussian beams.\nFurthermore, we study the variation of the coherence factor and find that the\ncoherence of autofocusing beams is better than that of Gaussian beams under\nturbulence. Additionally, we observe the change of the scintillation index (SI)\nwith the propagation distance z, and our results show that autofocusing beams\nexhibit less oscillation than Gaussian beams, indicating that autofocusing\nbeams propagate in complex environments with less distortion and fewer\nintensity fluctuation. Overall, our results suggest that autofocusing beams are\npromising for applications such as optical trapping and manipulation in complex\nenvironments. Our study provides valuable insights into the selection of stable\nbeams that exhibit high intensity and high field gradient at the focal position\nin complex environments.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:23:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Nana",""],["Tan","Liu",""],["Chen","Kaijian",""],["Hong","Peilong",""],["Mo","Xiaoming",""],["Zou","Bingsuo",""],["Liang","Yi",""]]}
{"id":"2308.14089","submitter":"Scott Fleming","authors":"Scott L. Fleming, Alejandro Lozano, William J. Haberkorn, Jenelle A.\n  Jindal, Eduardo P. Reis, Rahul Thapa, Louis Blankemeier, Julian Z. Genkins,\n  Ethan Steinberg, Ashwin Nayak, Birju S. Patel, Chia-Chun Chiang, Alison\n  Callahan, Zepeng Huo, Sergios Gatidis, Scott J. Adams, Oluseyi Fayanju,\n  Shreya J. Shah, Thomas Savage, Ethan Goh, Akshay S. Chaudhari, Nima\n  Aghaeepour, Christopher Sharp, Michael A. Pfeffer, Percy Liang, Jonathan H.\n  Chen, Keith E. Morse, Emma P. Brunskill, Jason A. Fries, Nigam H. Shah","title":"MedAlign: A Clinician-Generated Dataset for Instruction Following with\n  Electronic Medical Records","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability of large language models (LLMs) to follow natural language\ninstructions with human-level fluency suggests many opportunities in healthcare\nto reduce administrative burden and improve quality of care. However,\nevaluating LLMs on realistic text generation tasks for healthcare remains\nchallenging. Existing question answering datasets for electronic health record\n(EHR) data fail to capture the complexity of information needs and\ndocumentation burdens experienced by clinicians. To address these challenges,\nwe introduce MedAlign, a benchmark dataset of 983 natural language instructions\nfor EHR data. MedAlign is curated by 15 clinicians (7 specialities), includes\nclinician-written reference responses for 303 instructions, and provides 276\nlongitudinal EHRs for grounding instruction-response pairs. We used MedAlign to\nevaluate 6 general domain LLMs, having clinicians rank the accuracy and quality\nof each LLM response. We found high error rates, ranging from 35% (GPT-4) to\n68% (MPT-7B-Instruct), and an 8.3% drop in accuracy moving from 32k to 2k\ncontext lengths for GPT-4. Finally, we report correlations between clinician\nrankings and automated natural language generation metrics as a way to rank\nLLMs without human review. We make MedAlign available under a research data use\nagreement to enable LLM evaluations on tasks aligned with clinician needs and\npreferences.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:24:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fleming","Scott L.",""],["Lozano","Alejandro",""],["Haberkorn","William J.",""],["Jindal","Jenelle A.",""],["Reis","Eduardo P.",""],["Thapa","Rahul",""],["Blankemeier","Louis",""],["Genkins","Julian Z.",""],["Steinberg","Ethan",""],["Nayak","Ashwin",""],["Patel","Birju S.",""],["Chiang","Chia-Chun",""],["Callahan","Alison",""],["Huo","Zepeng",""],["Gatidis","Sergios",""],["Adams","Scott J.",""],["Fayanju","Oluseyi",""],["Shah","Shreya J.",""],["Savage","Thomas",""],["Goh","Ethan",""],["Chaudhari","Akshay S.",""],["Aghaeepour","Nima",""],["Sharp","Christopher",""],["Pfeffer","Michael A.",""],["Liang","Percy",""],["Chen","Jonathan H.",""],["Morse","Keith E.",""],["Brunskill","Emma P.",""],["Fries","Jason A.",""],["Shah","Nigam H.",""]]}
{"id":"2308.14090","submitter":"Michel Peyrard","authors":"Michel Peyrard","title":"What can we learn from the dynamics of the Covid-19 epidemic ?","comments":"This article has been submitted to Chaos (AIP Publishing)","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the mechanisms behind the quasi-periodic outbursts on the\nCovid-19 epidemics. Data for France and Germany show that the patterns of\noutbursts exhibit a qualitative change in early 2022, which appears in a change\nin their average period, and which is confirmed by time-frequency analysis.\nThis provides a signal which can be used to discriminate among several\nmechanisms. Two main ideas have been proposed to explain periodicity in\nepidemics. One involves memory effects and another considers exchanges between\nepidemic clusters and a reservoir of population. We test these two approaches\nin the particular case of the Covid-19 epidemics and show that the \"cluster\nmodel\" is the only one which appears to be able to explain the observed pattern\nwith realistic parameters. A last section discusses our results in the context\nof early studies of epidemics, and we stress the importance to work with models\nwith a limited number of parameters, which moreover can be sufficiently well\nestimated, to draw conclusions on the general mechanisms behind the\nobservations.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:26:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Peyrard","Michel",""]]}
{"id":"2308.14091","submitter":"Chloe-Aminata Gauvin-Ndiaye","authors":"C. Gauvin-Ndiaye, J. Leblanc, S. Marin, N. Martin, D. Lessnich,\n  A.-M.S. Tremblay","title":"The Two-Particle Self-Consistent Approach for Multiorbital models:\n  application to the Emery model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Emery model, or three-band Hubbard model, is a Hamiltonian that is\nthought to contain much of the physics of cuprate superconductors. This model\nincludes two noninteracting $p$ orbitals and one interacting $d$ orbital per\nunit cell. Few methods that can solve multiorbital interacting Hamiltonians\nreliably and efficiently exist. Here, we introduce an application of the two\nparticle self-consistent (TPSC) approach to the Emery model. We construct this\nmethod within the framework of the TPSC+DMFT method, which can be seen as a way\nto introduce nonlocal corrections to dynamical mean-field theory (DMFT). We\nshow that interacting orbital densities, rather than the noninteracting ones,\nmust be used in the calculations. For the Emery model, we find that at constant\nbare interaction $U$, the vertex for spin fluctuations, $U_{sp}$, decreases\nrapidly with filling. This may be one of the factors that contributes to\nelectron-doped cuprates appearing less correlated than hole-doped ones. More\ngenerally, our work opens the road to the application of the TPSC approach to\nspin fluctuations in multiorbital models.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:28:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gauvin-Ndiaye","C.",""],["Leblanc","J.",""],["Marin","S.",""],["Martin","N.",""],["Lessnich","D.",""],["Tremblay","A. -M. S.",""]]}
{"id":"2308.14092","submitter":"Apurva Patil","authors":"Apurva Patil, Mustafa O. Karabag, Takashi Tanaka, Ufuk Topcu","title":"Simulator-Driven Deceptive Control via Path Integral Approach","comments":"8 pages, 3 figures, CDC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a setting where a supervisor delegates an agent to perform a\ncertain control task, while the agent is incentivized to deviate from the given\npolicy to achieve its own goal. In this work, we synthesize the optimal\ndeceptive policies for an agent who attempts to hide its deviations from the\nsupervisor's policy. We study the deception problem in the continuous-state\ndiscrete-time stochastic dynamics setting and, using motivations from\nhypothesis testing theory, formulate a Kullback-Leibler control problem for the\nsynthesis of deceptive policies. This problem can be solved using backward\ndynamic programming in principle, which suffers from the curse of\ndimensionality. However, under the assumption of deterministic state dynamics,\nwe show that the optimal deceptive actions can be generated using path integral\ncontrol. This allows the agent to numerically compute the deceptive actions via\nMonte Carlo simulations. Since Monte Carlo simulations can be efficiently\nparallelized, our approach allows the agent to generate deceptive control\nactions online. We show that the proposed simulation-driven control approach\nasymptotically converges to the optimal control distribution.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:33:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Patil","Apurva",""],["Karabag","Mustafa O.",""],["Tanaka","Takashi",""],["Topcu","Ufuk",""]]}
{"id":"2308.14093","submitter":"Christian Schilling","authors":"Marcelo Forets and Christian Schilling","title":"The inverse problem for neural networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the problem of computing the preimage of a set under a neural\nnetwork with piecewise-affine activation functions. We recall an old result\nthat the preimage of a polyhedral set is again a union of polyhedral sets and\ncan be effectively computed. We show several applications of computing the\npreimage for analysis and interpretability of neural networks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:35:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Forets","Marcelo",""],["Schilling","Christian",""]]}
{"id":"2308.14094","submitter":"Igor Pshenichnov","authors":"U.A. Dmitrieva and I.A. Pshenichnov","title":"Production of various elements in ultraperipheral $^{208}$Pb-$^{208}$Pb\n  collisions at the LHC","comments":"7 pages, 3 figures","journal-ref":"Phys. Part. Nucl. Lett. 20 (2023) 1228-1231","doi":null,"report-no":null,"categories":"nucl-th nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As predicted by theory and confirmed by measurements, one, two or three\nneutrons are emitted frequently in ultraperipheral collisions (UPCs) of heavy\nrelativistic nuclei, in particular, $^{208}$Pb. The exchange of low-energy\nWeizs\\\"{a}cker--Williams photons dominates in such interactions. This leads to\nthe excitation and decay of Giant Dipole Resonances (GDR) in colliding nuclei\nbelow the proton emission threshold. Less is known about the electromagnetic\ndissociation of $^{208}$Pb induced by energetic photons leading to violent\nfragmentation of $^{208}$Pb. The UPCs of lead nuclei at the LHC were modelled\nwith Relativistic ELectromagnetic Dissociation (RELDIS) model to evaluate the\ncontribution of photonuclear reactions in the domain of quasideuteron\nabsorption and at higher photon energies. It was demonstrated that due to the\npresence of a single heavy residue in the final state mostly accompanied by\nfree protons and neutrons, the cross sections of the production of specific\nelements can be well approximated by the proton emission cross sections, which\ncan be measured in the ALICE experiment at the LHC.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:37:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dmitrieva","U. A.",""],["Pshenichnov","I. A.",""]]}
{"id":"2308.14095","submitter":"Philipp Bader","authors":"Philipp Bader","title":"Prym Representations of the Handlebody Group","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $S$ be an oriented, closed surface of genus $g.$ The mapping class group\nof $S$ is the group of orientation preserving homeomorphisms of $S$ modulo\nisotopy. In 1997, Looijenga introduced the Prym representations, which are\nvirtual representations of the mapping class group that depend on a finite,\nabelian group. Let $V$ be a genus $g$ handlebody with boundary $S$. The\nhandlebody group is the subgroup of those mapping classes of $S$ that extend\nover $V.$ The twist group is the subgroup of the handlebody group generated by\ntwists about meridians. Here, we restrict the Prym representations to the\nhandlebody group and further to the twist group. We determine the image of the\nrepresentations in the cyclic case.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:38:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bader","Philipp",""]]}
{"id":"2308.14096","submitter":"Benno van den Berg","authors":"Benno van den Berg and Marcus Briet","title":"Arrow algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we introduce arrow algebras, simple algebraic structures which\ninduce elementary toposes through the tripos-to-topos construction. This\nincludes localic toposes as well as various realizability toposes, in\nparticular, those realizability toposes which are obtained from partial\ncombinatory algebras. Since there are many examples of arrow algebras and arrow\nalgebras have a number of closure properties, including a notion of subalgebra\ngiven by a nucleus, arrow algebras provide a flexible tool for constructing\ntoposes; we illustrate this by providing some general tools for creating\ntoposes for Kreisel's modified realizability.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:50:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Berg","Benno van den",""],["Briet","Marcus",""]]}
{"id":"2308.14097","submitter":"San-Dong Guo","authors":"San-Dong Guo, Guang-Zhao Wang and Yee Sin Ang","title":"How to produce spin-splitting in antiferromagnetic materials","comments":"6 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Antiferromagnetic (AFM) materials have potential advantages for spintronics\ndue to their robustness, ultrafast dynamics, and magnetotransport effects.\nHowever, the missing spontaneous polarization and magnetization hinders the\nefficient utilization of electronic spin in these AFM materials. Here, we\npropose a simple way to produce spin-splitting in AFM materials by making the\nmagnetic atoms with opposite spin polarization locating in the different\nenvironment (surrounding atomic arrangement), which does not necessarily\nrequire the presence of spin-orbital coupling (SOC). We confirm our proposal by\nfour different types of two-dimensional (2D) AFM materials within the\nfirst-principles calculations. Our works provide a intuitional design principle\nto find or produce spin-splitting in AFM materials.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:58:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","San-Dong",""],["Wang","Guang-Zhao",""],["Ang","Yee Sin",""]]}
{"id":"2308.14098","submitter":"Henk Dijkstra","authors":"Ren\\'e M. van Westen and Henk A. Dijkstra","title":"Asymmetry of AMOC Hysteresis in a State-of-the-Art Global Climate Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study hysteresis properties of the Atlantic Meridional Overturning\nCirculation (AMOC) under a slowly-varying North Atlantic (20$^{\\circ}$N --\n50$^{\\circ}$N) freshwater flux forcing in state-of-the-art Global Climate Model\n(GCM), the Community Earth System Model. Results are presented of a full\nhysteresis simulation ($4,400$ model years) and show that there is a hysteresis\nwidth of about $0.4$ Sv. This demonstrates that an AMOC collapse and recovery\ndo not only occur in conceptual and idealised climate models, but also in a\nstate-of-the-art GCM. The AMOC recovery is about a factor six faster than the\nAMOC collapse and this asymmetry is due to the major effect of the North\nAtlantic sea-ice distribution on the AMOC recovery. The results have\nimplications for projections of possible future AMOC behaviour and for\nexplaining relatively rapid climate transitions in the geological past.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:59:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["van Westen","Ren\u00e9 M.",""],["Dijkstra","Henk A.",""]]}
{"id":"2308.14099","submitter":"Jiancheng An","authors":"Jiancheng An, and Chau Yuen","title":"Pilot Power Allocation for Channel Estimation in a Multi-RIS Aided\n  Communication System","comments":"16 pages, 5 figures, accepted by IEEE GLOBECOM 2023. arXiv admin\n  note: substantial text overlap with arXiv:2110.11534","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconfigurable intelligent surface (RIS) is a promising technology that\nenables the customization of electromagnetic propagation environments in\nnext-generation wireless networks. In this paper, we investigate the optimal\npilot power allocation during the channel estimation stage to improve the\nergodic channel gain of RIS-assisted systems under practical imperfect channel\nstate information (CSI). Specifically, we commence by deriving an explicit\nclosed-form expression of the ergodic channel gain of a multi-RIS-aided\ncommunication system that takes into account channel estimation errors. Then,\nwe formulate the pilot power allocation problem to maximize the ergodic channel\ngain under imperfect CSI, subject to the average pilot power constraint. Then,\nthe method of Lagrange multipliers is invoked to obtain the optimal pilot power\nallocation solution, which indicates that allocating more power to the pilots\nfor estimating the weak reflection channels is capable of effectively improving\nthe ergodic channel gain under imperfect CSI. Finally, extensive simulation\nresults corroborate our theoretical analysis.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 12:59:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["An","Jiancheng",""],["Yuen","Chau",""]]}
{"id":"2308.14100","submitter":"Long Bai","authors":"Guankun Wang, Long Bai, Yanan Wu, Tong Chen, Hongliang Ren","title":"Rethinking Exemplars for Continual Semantic Segmentation in Endoscopy\n  Scenes: Entropy-based Mini-Batch Pseudo-Replay","comments":"Accepted by Computers in Biology and Medicine","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Endoscopy is a widely used technique for the early detection of diseases or\nrobotic-assisted minimally invasive surgery (RMIS). Numerous deep learning\n(DL)-based research works have been developed for automated diagnosis or\nprocessing of endoscopic view. However, existing DL models may suffer from\ncatastrophic forgetting. When new target classes are introduced over time or\ncross institutions, the performance of old classes may suffer severe\ndegradation. More seriously, data privacy and storage issues may lead to the\nunavailability of old data when updating the model. Therefore, it is necessary\nto develop a continual learning (CL) methodology to solve the problem of\ncatastrophic forgetting in endoscopic image segmentation. To tackle this, we\npropose a Endoscopy Continual Semantic Segmentation (EndoCSS) framework that\ndoes not involve the storage and privacy issues of exemplar data. The framework\nincludes a mini-batch pseudo-replay (MB-PR) mechanism and a self-adaptive noisy\ncross-entropy (SAN-CE) loss. The MB-PR strategy circumvents privacy and storage\nissues by generating pseudo-replay images through a generative model.\nMeanwhile, the MB-PR strategy can also correct the model deviation to the\nreplay data and current training data, which is aroused by the significant\ndifference in the amount of current and replay images. Therefore, the model can\nperform effective representation learning on both new and old tasks. SAN-CE\nloss can help model fitting by adjusting the model's output logits, and also\nimprove the robustness of training. Extensive continual semantic segmentation\n(CSS) experiments on public datasets demonstrate that our method can robustly\nand effectively address the catastrophic forgetting brought by class increment\nin endoscopy scenes. The results show that our framework holds excellent\npotential for real-world deployment in a streaming learning manner.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:07:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Guankun",""],["Bai","Long",""],["Wu","Yanan",""],["Chen","Tong",""],["Ren","Hongliang",""]]}
{"id":"2308.14101","submitter":"Anthony Perez","authors":"Anthony Perez","title":"Superpixels algorithms through network community detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Community detection is a powerful tool from complex networks analysis that\nfinds applications in various research areas. Several image segmentation\nmethods rely for instance on community detection algorithms as a black box in\norder to compute undersegmentations, i.e. a small number of regions that\nrepresent areas of interest of the image. However, to the best of our\nknowledge, the efficiency of such an approach w.r.t. superpixels, that aim at\nrepresenting the image at a smaller level while preserving as much as possible\noriginal information, has been neglected so far. The only related work seems to\nbe the one by Liu et. al. (IET Image Processing, 2022) that developed a\nsuperpixels algorithm using a so-called modularity maximization approach,\nleading to relevant results. We follow this line of research by studying the\nefficiency of superpixels computed by state-of-the-art community detection\nalgorithms on a 4-connected pixel graph, so-called pixel-grid. We first detect\ncommunities on such a graph and then apply a simple merging procedure that\nallows to obtain the desired number of superpixels. As we shall see, such\nmethods result in the computation of relevant superpixels as emphasized by both\nqualitative and quantitative experiments, according to different widely-used\nmetrics based on ground-truth comparison or on superpixels only. We observe\nthat the choice of the community detection algorithm has a great impact on the\nnumber of communities and hence on the merging procedure. Similarly, small\nvariations on the pixel-grid may provide different results from both\nqualitative and quantitative viewpoints. For the sake of completeness, we\ncompare our results with those of several state-of-the-art superpixels\nalgorithms as computed by Stutz et al. (Computer Vision and Image\nUnderstanding, 2018).\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:13:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Perez","Anthony",""]]}
{"id":"2308.14102","submitter":"Gionni Marchetti","authors":"Gionni Marchetti","title":"Electron-electron Scattering in the Diffusive Regime and Dyakonov-Perel\n  Theory: a case study of spin decoherence in n-type GaAs","comments":"7 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We argue that in the ensemble Monte Carlo approach, the spin decoherence\ncaused by electron-electron interactions in n-type bulk GaAs at room\ntemperature, according to Dyakonov-Perel theory, is mainly induced by the\nelectron density while electron-electron scattering itself does not directly\naffect spin lifetime but instead influences it through any energy dependence of\nother scattering mechanisms as typically expected in the case of the electron\nmobility. Therefore, our analysis, which is strongly supported by Bayesian\nOccam's razor, reconciles the semiclassical Monte Carlo approach with the novel\ncomputational first-principles tool recently proposed by Xu, Habib,\nSundararaman and Ping.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:16:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Marchetti","Gionni",""]]}
{"id":"2308.14103","submitter":"Yaozong Zheng","authors":"Yaozong Zheng and Bineng Zhong and Qihua Liang and Guorong Li and\n  Rongrong Ji and Xianxian Li","title":"Towards Unified Token Learning for Vision-Language Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we present a simple, flexible and effective vision-language\n(VL) tracking pipeline, termed \\textbf{MMTrack}, which casts VL tracking as a\ntoken generation task. Traditional paradigms address VL tracking task\nindirectly with sophisticated prior designs, making them over-specialize on the\nfeatures of specific architectures or mechanisms. In contrast, our proposed\nframework serializes language description and bounding box into a sequence of\ndiscrete tokens. In this new design paradigm, all token queries are required to\nperceive the desired target and directly predict spatial coordinates of the\ntarget in an auto-regressive manner. The design without other prior modules\navoids multiple sub-tasks learning and hand-designed loss functions,\nsignificantly reducing the complexity of VL tracking modeling and allowing our\ntracker to use a simple cross-entropy loss as unified optimization objective\nfor VL tracking task. Extensive experiments on TNL2K, LaSOT, LaSOT$_{\\rm{ext}}$\nand OTB99-Lang benchmarks show that our approach achieves promising results,\ncompared to other state-of-the-arts.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:17:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zheng","Yaozong",""],["Zhong","Bineng",""],["Liang","Qihua",""],["Li","Guorong",""],["Ji","Rongrong",""],["Li","Xianxian",""]]}
{"id":"2308.14104","submitter":"Chao Qian","authors":"Chengrui Gao, Haopu Shang, Ke Xue, Dong Li, Chao Qian","title":"Towards Generalizable Neural Solvers for Vehicle Routing Problems via\n  Ensemble with Transferrable Local Policy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning has been adapted to help solve NP-hard combinatorial\noptimization problems. One prevalent way is learning to construct solutions by\ndeep neural networks, which has been receiving more and more attention due to\nthe high efficiency and less requirement for expert knowledge. However, many\nneural construction methods for Vehicle Routing Problems (VRPs) focus on\nsynthetic problem instances with limited scales and specified node\ndistributions, leading to poor performance on real-world problems which usually\ninvolve large scales together with complex and unknown node distributions. To\nmake neural VRP solvers more practical in real-world scenarios, we design an\nauxiliary policy that learns from the local transferable topological features,\nnamed local policy, and integrate it with a typical constructive policy (which\nlearns from the global information of VRP instances) to form an ensemble\npolicy. With joint training, the aggregated policies perform cooperatively and\ncomplementarily to boost generalization. The experimental results on two\nwell-known benchmarks, TSPLIB and CVRPLIB, of travelling salesman problem and\ncapacitated VRP show that the ensemble policy consistently achieves better\ngeneralization than state-of-the-art construction methods and even works well\non real-world problems with several thousand nodes.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:22:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Chengrui",""],["Shang","Haopu",""],["Xue","Ke",""],["Li","Dong",""],["Qian","Chao",""]]}
{"id":"2308.14105","submitter":"Xiujun Shu","authors":"Xiujun Shu, Wei Wen, Liangsheng Xu, Mingbao Lin, Ruizhi Qiao, Taian\n  Guo, Hanjun Li, Bei Gan, Xiao Wang, Xing Sun","title":"Unified and Dynamic Graph for Temporal Character Grouping in Long Videos","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video temporal character grouping locates appearing moments of major\ncharacters within a video according to their identities. To this end, recent\nworks have evolved from unsupervised clustering to graph-based supervised\nclustering. However, graph methods are built upon the premise of fixed affinity\ngraphs, bringing many inexact connections. Besides, they extract multi-modal\nfeatures with kinds of models, which are unfriendly to deployment. In this\npaper, we present a unified and dynamic graph (UniDG) framework for temporal\ncharacter grouping. This is accomplished firstly by a unified representation\nnetwork that learns representations of multiple modalities within the same\nspace and still preserves the modality's uniqueness simultaneously. Secondly,\nwe present a dynamic graph clustering where the neighbors of different\nquantities are dynamically constructed for each node via a cyclic matching\nstrategy, leading to a more reliable affinity graph. Thirdly, a progressive\nassociation method is introduced to exploit spatial and temporal contexts among\ndifferent modalities, allowing multi-modal clustering results to be well fused.\nAs current datasets only provide pre-extracted features, we evaluate our UniDG\nmethod on a collected dataset named MTCG, which contains each character's\nappearing clips of face and body and speaking voice tracks. We also evaluate\nour key components on existing clustering and retrieval datasets to verify the\ngeneralization ability. Experimental results manifest that our method can\nachieve promising results and outperform several state-of-the-art approaches.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:22:55 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 12:43:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shu","Xiujun",""],["Wen","Wei",""],["Xu","Liangsheng",""],["Lin","Mingbao",""],["Qiao","Ruizhi",""],["Guo","Taian",""],["Li","Hanjun",""],["Gan","Bei",""],["Wang","Xiao",""],["Sun","Xing",""]]}
{"id":"2308.14106","submitter":"Jeremy Heng","authors":"Jeremy Heng, Valentin De Bortoli, Arnaud Doucet","title":"Diffusion Schr\\\"{o}dinger Bridges for Bayesian Computation","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Denoising diffusion models are a novel class of generative models that have\nrecently become extremely popular in machine learning. In this paper, we\ndescribe how such ideas can also be used to sample from posterior distributions\nand, more generally, any target distribution whose density is known up to a\nnormalizing constant. The key idea is to consider a forward ``noising''\ndiffusion initialized at the target distribution which ``transports'' this\nlatter to a normal distribution for long diffusion times. The time-reversal of\nthis process, the ``denoising'' diffusion, thus ``transports'' the normal\ndistribution to the target distribution and can be approximated so as to sample\nfrom the target. To accelerate simulation, we show how one can introduce and\napproximate a Schr\\\"{o}dinger bridge between these two distributions, i.e. a\ndiffusion which transports the normal to the target in finite time.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:22:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Heng","Jeremy",""],["De Bortoli","Valentin",""],["Doucet","Arnaud",""]]}
{"id":"2308.14107","submitter":"Calum Brown","authors":"Calum A. Brown, Katarzyna Macieszczak, Robert L. Jack","title":"Unravelling Metastable Markovian Open Quantum Systems","comments":"18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We analyse the dynamics of metastable Markovian open quantum systems by\nunravelling their average dynamics into stochastic trajectories. We consider\nseveral examples of quantum reset processes, including a simple three-state\nmodel whose metastability is of classical type, and a two-qubit model that\nfeatures a metastable decoherence free subspace. In the three-state model, the\ntrajectories exhibit classical metastable phenomenology: fast relaxation into\ndistinct phases and slow transitions between them. This extends the existing\ncorrespondence between classical and quantum metastability. It enables the\ncomputation of committors for the quantum phases, and the mechanisms of rare\ntransitions between them. For the two-qubit model, the decoherence-free\nsubspace appears in the unravelled trajectories as a slow manifold on which the\nquantum state has a continuous slow evolution. This provides a classical\n(non-metastable) analogue of this quantum effect. We discuss the general\nimplications of these results, and we highlight the useful role of quantum\nreset processes for analysis of quantum trajectories in metastable systems.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:46:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Brown","Calum A.",""],["Macieszczak","Katarzyna",""],["Jack","Robert L.",""]]}
{"id":"2308.14108","submitter":"Giovanni Minelli","authors":"Giovanni Minelli, Matteo Poggi, Samuele Salti","title":"Depth self-supervision for single image novel view synthesis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we tackle the problem of generating a novel image from an\narbitrary viewpoint given a single frame as input. While existing methods\noperating in this setup aim at predicting the target view depth map to guide\nthe synthesis, without explicit supervision over such a task, we jointly\noptimize our framework for both novel view synthesis and depth estimation to\nunleash the synergy between the two at its best. Specifically, a shared depth\ndecoder is trained in a self-supervised manner to predict depth maps that are\nconsistent across the source and target views. Our results demonstrate the\neffectiveness of our approach in addressing the challenges of both tasks\nallowing for higher-quality generated images, as well as more accurate depth\nfor the target viewpoint.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:50:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Minelli","Giovanni",""],["Poggi","Matteo",""],["Salti","Samuele",""]]}
{"id":"2308.14109","submitter":"Ben Hayes","authors":"Ben Hayes, David Jekel, Srivatsav Kunnawalkam Elayavalli","title":"Consequences of the random matrix solution to the Peterson-Thom\n  conjecture","comments":"25 pages, zero figures. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA math.FA math.GR math.LO math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we show various new structural properties of free group factors\nusing the recent resolution (due independently to Belinschi-Capitaine and\nBordenave-Collins) of the Peterson-Thom conjecture. These results include the\nresolution to the coarseness conjecture independently due to the first-named\nauthor and Popa, a generalization of Ozawa-Popa's celebrated strong solidity\nresult using vastly more general versions of the normalizer (and in an\nultraproduct setting), a dichotomy result for intertwining of maximal amenable\nsubalgebras of interpolated free group factors, as well as application to\nultraproduct embeddings of nonamenable subalgebras of interpolated free group\nfactors.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:52:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hayes","Ben",""],["Jekel","David",""],["Elayavalli","Srivatsav Kunnawalkam",""]]}
{"id":"2308.14110","submitter":"Antonino De Martino","authors":"Antonino De Martino, Kamal Diki","title":"Gaussian RBF-kernels via Fock spaces: quaternionic and several complex\n  variables settings","comments":"to appear in Quantum Studies: Mathematics and Foundations","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper we study two extensions of the complex-valued Gaussian radial\nbasis function (RBF) kernel and discuss their connections with Fock spaces in\ntwo different settings. First, we introduce the quaternonic Gaussian RBF kernel\nconstructed using the theory of slice hyperholomorphic functions. Then, we\nconsider the case of Gaussian RBF kernels in several complex variables.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:58:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["De Martino","Antonino",""],["Diki","Kamal",""]]}
{"id":"2308.14111","submitter":"Hao Wang","authors":"Jiarong Fan, Hao Wang, Ariel Liebman","title":"MARL for Decentralized Electric Vehicle Charging Coordination with V2V\n  Energy Exchange","comments":"IEEE IECON 2023 (The 49th Annual Conference of the IEEE Industrial\n  Electronics Society)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.AI cs.MA cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Effective energy management of electric vehicle (EV) charging stations is\ncritical to supporting the transport sector's sustainable energy transition.\nThis paper addresses the EV charging coordination by considering\nvehicle-to-vehicle (V2V) energy exchange as the flexibility to harness in EV\ncharging stations. Moreover, this paper takes into account EV user experiences,\nsuch as charging satisfaction and fairness. We propose a Multi-Agent\nReinforcement Learning (MARL) approach to coordinate EV charging with V2V\nenergy exchange while considering uncertainties in the EV arrival time, energy\nprice, and solar energy generation. The exploration capability of MARL is\nenhanced by introducing parameter noise into MARL's neural network models.\nExperimental results demonstrate the superior performance and scalability of\nour proposed method compared to traditional optimization baselines. The\ndecentralized execution of the algorithm enables it to effectively deal with\npartial system faults in the charging station.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:06:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fan","Jiarong",""],["Wang","Hao",""],["Liebman","Ariel",""]]}
{"id":"2308.14112","submitter":"ZhiGuo Chen","authors":"Yueshan Xu, Junjie Wang, Bo Su, Jun Deng, Cao Peng, Chunlong Wu,\n  Qinghua Zhang, Lin Gu, Jianlin Luo, Nan Xu, Jian-gang Guo, and Zhi-Guo Chen","title":"Tightly-bound and room-temperature-stable excitons in van der Waals\n  degenerate-semiconductor Bi4O4SeCl2 with high charge-carrier density","comments":"Accepted by Communications Materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Excitons, which represent a type of quasi-particles consisting of\nelectron-hole pairs bound by the mutual Coulomb interaction, were often\nobserved in lowly-doped semiconductors or insulators. However, realizing\nexcitons in the semiconductors or insulators with high charge carrier densities\nis a challenging task. Here, we perform infrared spectroscopy, electrical\ntransport, ab initio calculation, and angle-resolved-photoemission spectroscopy\nstudies of a van der Waals degenerate-semiconductor Bi4O4SeCl2. A peak-like\nfeature (i.e., alpha peak) is present around ~ 125 meV in the optical\nconductivity spectra at low temperature T = 8 K and room temperature. After\nbeing excluded from the optical excitations of free carriers, interband\ntransitions, localized states and polarons, the alpha peak is assigned as the\nexciton absorption. Moreover, assuming the existence of weakly-bound\nexcitons--Wannier-type excitons in this material violates the\nLyddane-Sachs-Teller relation. Besides, the exciton binding energy of ~ 375\nmeV, which is about an order of magnitude larger than those of conventional\nsemiconductors, and the charge-carrier concentration of ~ 1.25 * 10^19 cm^-3,\nwhich is higher than the Mott density, further indicate that the excitons in\nthis highly-doped system should be tightly bound. Our results pave the way for\ndeveloping the optoelectronic devices based on the tightly-bound and\nroom-temperature-stable excitons in highly-doped van der Waals degenerate\nsemiconductors.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:07:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Yueshan",""],["Wang","Junjie",""],["Su","Bo",""],["Deng","Jun",""],["Peng","Cao",""],["Wu","Chunlong",""],["Zhang","Qinghua",""],["Gu","Lin",""],["Luo","Jianlin",""],["Xu","Nan",""],["Guo","Jian-gang",""],["Chen","Zhi-Guo",""]]}
{"id":"2308.14113","submitter":"Peini Guo","authors":"Peini Guo, Hong Liu, Jianbing Wu, Guoquan Wang and Tao Wang","title":"Semantic-aware Consistency Network for Cloth-changing Person\n  Re-Identification","comments":"Accepted by ACM MM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cloth-changing Person Re-Identification (CC-ReID) is a challenging task that\naims to retrieve the target person across multiple surveillance cameras when\nclothing changes might happen. Despite recent progress in CC-ReID, existing\napproaches are still hindered by the interference of clothing variations since\nthey lack effective constraints to keep the model consistently focused on\nclothing-irrelevant regions. To address this issue, we present a Semantic-aware\nConsistency Network (SCNet) to learn identity-related semantic features by\nproposing effective consistency constraints. Specifically, we generate the\nblack-clothing image by erasing pixels in the clothing area, which explicitly\nmitigates the interference from clothing variations. In addition, to fully\nexploit the fine-grained identity information, a head-enhanced attention module\nis introduced, which learns soft attention maps by utilizing the proposed\npart-based matching loss to highlight head information. We further design a\nsemantic consistency loss to facilitate the learning of high-level\nidentity-related semantic features, forcing the model to focus on semantically\nconsistent cloth-irrelevant regions. By using the consistency constraint, our\nmodel does not require any extra auxiliary segmentation module to generate the\nblack-clothing image or locate the head region during the inference stage.\nExtensive experiments on four cloth-changing person Re-ID datasets (LTCC, PRCC,\nVc-Clothes, and DeepChange) demonstrate that our proposed SCNet makes\nsignificant improvements over prior state-of-the-art approaches. Our code is\navailable at: https://github.com/Gpn-star/SCNet.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:07:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Peini",""],["Liu","Hong",""],["Wu","Jianbing",""],["Wang","Guoquan",""],["Wang","Tao",""]]}
{"id":"2308.14114","submitter":"Hao Wang","authors":"Xinyu Liang, Hao Wang","title":"Hybrid Transformer-RNN Architecture for Household Occupancy Detection\n  Using Low-Resolution Smart Meter Data","comments":"IEEE IECON 2023 (The 49th Annual Conference of the IEEE Industrial\n  Electronics Society)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Residential occupancy detection has become an enabling technology in today's\nurbanized world for various smart home applications, such as building\nautomation, energy management, and improved security and comfort.\nDigitalization of the energy system provides smart meter data that can be used\nfor occupancy detection in a non-intrusive manner without causing concerns\nregarding privacy and data security. In particular, deep learning techniques\nmake it possible to infer occupancy from low-resolution smart meter data, such\nthat the need for accurate occupancy detection with privacy preservation can be\nachieved. Our work is thus motivated to develop a privacy-aware and effective\nmodel for residential occupancy detection in contemporary living environments.\nOur model aims to leverage the advantages of both recurrent neural networks\n(RNNs), which are adept at capturing local temporal dependencies, and\ntransformers, which are effective at handling global temporal dependencies. Our\ndesigned hybrid transformer-RNN model detects residential occupancy using\nhourly smart meter data, achieving an accuracy of nearly 92\\% across households\nwith diverse profiles. We validate the effectiveness of our method using a\npublicly accessible dataset and demonstrate its performance by comparing it\nwith state-of-the-art models, including attention-based occupancy detection\nmethods.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:13:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liang","Xinyu",""],["Wang","Hao",""]]}
{"id":"2308.14115","submitter":"Zining Zhu","authors":"Zining Zhu, Haoming Jiang, Jingfeng Yang, Sreyashi Nag, Chao Zhang,\n  Jie Huang, Yifan Gao, Frank Rudzicz, Bing Yin","title":"Situated Natural Language Explanations","comments":"A previous version was presented in ACL 2023 NLRSE workshop","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Natural language is among the most accessible tools for explaining decisions\nto humans, and large pretrained language models (PLMs) have demonstrated\nimpressive abilities to generate coherent natural language explanations (NLE).\nThe existing NLE research perspectives do not take the audience into account.\nAn NLE can have high textual quality, but it might not accommodate audiences'\nneeds and preference. To address this limitation, we propose an alternative\nperspective, situated NLE, including a situated generation framework and a\nsituated evaluation framework. On the generation side, we propose simple prompt\nengineering methods that adapt the NLEs to situations. In human studies, the\nannotators preferred the situated NLEs. On the evaluation side, we set up\nautomated evaluation scores in lexical, semantic, and pragmatic categories. The\nscores can be used to select the most suitable prompts to generate NLEs.\nSituated NLE provides a perspective to conduct further research on automatic\nNLE generations.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:14:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Zining",""],["Jiang","Haoming",""],["Yang","Jingfeng",""],["Nag","Sreyashi",""],["Zhang","Chao",""],["Huang","Jie",""],["Gao","Yifan",""],["Rudzicz","Frank",""],["Yin","Bing",""]]}
{"id":"2308.14116","submitter":"Mingyu Xiao","authors":"Yuxi Liu and Mingyu Xiao","title":"An Improved Kernel and Parameterized Algorithm for Almost Induced\n  Matching","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An induced subgraph is called an induced matching if each vertex is a\ndegree-1 vertex in the subgraph. The \\textsc{Almost Induced Matching} problem\nasks whether we can delete at most $k$ vertices from the input graph such that\nthe remaining graph is an induced matching. This paper studies parameterized\nalgorithms for this problem by taking the size $k$ of the deletion set as the\nparameter. First, we prove a $6k$-vertex kernel for this problem, improving the\nprevious result of $7k$. Second, we give an $O^*(1.6957^k)$-time and\npolynomial-space algorithm, improving the previous running-time bound of\n$O^*(1.7485^k)$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:16:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Yuxi",""],["Xiao","Mingyu",""]]}
{"id":"2308.14117","submitter":"Hao Wang","authors":"Jinhao Li, Yu Hui Yuan, Qiushi Cui, Hao Wang","title":"Cross-Entropy-Based Approach to Multi-Objective Electric Vehicle\n  Charging Infrastructure Planning","comments":"IEEE I&CPS Asia 2023 (2023 IEEE IAS Industrial and Commercial Power\n  System Asia Conference)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pure electric vehicles (PEVs) are increasingly adopted to decarbonize the\ntransport sector and mitigate global warming. However, the inadequate PEV\ncharging infrastructure may hinder the further adoption of PEVs in the\nlarge-scale traffic network, which calls for effective planning solutions for\nthe charging station (CS) placement. The deployment of charging infrastructure\ninevitably increases the load on the associated power distribution network.\nTherefore, we are motivated to develop a comprehensive multi-objective\nframework for optimal CS placement in a traffic network overlaid by a\ndistribution network, considering multiple stakeholders' interested factors,\nsuch as traffic flow, PEV charging time cost, PEV travel distance, and the\nreliability of the distribution network. We leverage a cross-entropy-based\nmethod to solve the optimal CS placement and evaluate our method in a\nreal-world 183-node traffic network in Chengdu, China, overlaid by a 26-region\ndistribution network. It is demonstrated that our work provides various viable\nplanning options favoring different objectives for the stakeholders'\ndecision-making in practice.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:19:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jinhao",""],["Yuan","Yu Hui",""],["Cui","Qiushi",""],["Wang","Hao",""]]}
{"id":"2308.14118","submitter":"Kokoro Tanaka","authors":"Reiko Shinjo, Kokoro Tanaka","title":"Any link has a diagram with only triangles and quadrilaterals","comments":"8 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A link diagram can be considered as a $4$-valent graph embedded in the\n$2$-sphere and divides the sphere into complementary regions. In this paper, we\nshow that any link has a diagram with only triangles and quadrilaterals. This\nextends previous results shown by the authors and C. Adams.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:21:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shinjo","Reiko",""],["Tanaka","Kokoro",""]]}
{"id":"2308.14119","submitter":"Guy Hacohen","authors":"Noam Fluss, Guy Hacohen, Daphna Weinshall","title":"Semi-Supervised Learning in the Few-Shot Zero-Shot Scenario","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Semi-Supervised Learning (SSL) leverages both labeled and unlabeled data to\nimprove model performance. Traditional SSL methods assume that labeled and\nunlabeled data share the same label space. However, in real-world applications,\nespecially when the labeled training set is small, there may be classes that\nare missing from the labeled set. Existing frameworks aim to either reject all\nunseen classes (open-set SSL) or to discover unseen classes by partitioning an\nunlabeled set during training (open-world SSL). In our work, we construct a\nclassifier for points from both seen and unseen classes. Our approach is based\non extending an existing SSL method, such as FlexMatch, by incorporating an\nadditional entropy loss. This enhancement allows our method to improve the\nperformance of any existing SSL method in the classification of both seen and\nunseen classes. We demonstrate large improvement gains over state-of-the-art\nSSL, open-set SSL, and open-world SSL methods, on two benchmark image\nclassification data sets, CIFAR-100 and STL-10. The gains are most pronounced\nwhen the labeled data is severely limited (1-25 labeled examples per class).\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:25:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fluss","Noam",""],["Hacohen","Guy",""],["Weinshall","Daphna",""]]}
{"id":"2308.14120","submitter":"Soroosh Tayebi Arasteh","authors":"Soroosh Tayebi Arasteh, Tianyu Han, Mahshad Lotfinia, Christiane Kuhl,\n  Jakob Nikolas Kather, Daniel Truhn, Sven Nebelung","title":"Empowering Clinicians and Democratizing Data Science: Large Language\n  Models Automate Machine Learning for Clinical Studies","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  A knowledge gap persists between Machine Learning (ML) developers (e.g., data\nscientists) and practitioners (e.g., clinicians), hampering the full\nutilization of ML for clinical data analysis. We investigated the potential of\nthe chatGPT Advanced Data Analysis (ADA), an extension of GPT-4, to bridge this\ngap and perform ML analyses efficiently. Real-world clinical datasets and study\ndetails from large trials across various medical specialties were presented to\nchatGPT ADA without specific guidance. ChatGPT ADA autonomously developed\nstate-of-the-art ML models based on the original study's training data to\npredict clinical outcomes such as cancer development, cancer progression,\ndisease complications, or biomarkers such as pathogenic gene sequences.\nStrikingly, these ML models matched or outperformed their published\ncounterparts. We conclude that chatGPT ADA offers a promising avenue to\ndemocratize ML in medicine, making advanced analytics accessible to non-ML\nexperts and promoting broader applications in medical research and practice.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:28:38 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 17:52:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Arasteh","Soroosh Tayebi",""],["Han","Tianyu",""],["Lotfinia","Mahshad",""],["Kuhl","Christiane",""],["Kather","Jakob Nikolas",""],["Truhn","Daniel",""],["Nebelung","Sven",""]]}
{"id":"2308.14121","submitter":"Filip Talimdjioski","authors":"Richard J. Smith, Filip Talimdjioski","title":"Lipschitz-free spaces over properly metrisable spaces and approximation\n  properties","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $T$ be a `properly metrisable' topological space, that is, locally\ncompact, separable and metrisable. Let $\\mathcal{M}^T$ be the non-empty set of\nall proper metrics $d$ on $T$ compatible with its topology, and equip\n$\\mathcal{M}^T$ with the topology of uniform convergence, where the metrics are\nregarded as functions on $T^2$. We prove that if $T$ is uncountable then the\nset $\\mathcal{A}^T_f$ of metrics $d\\in\\mathcal{M}^T$ for which the\nLipschitz-free space $\\mathcal{F}(T,d)$ fails the approximation property is a\ndense set in $\\mathcal{M}^T$. Combining this with a result of Dalet, we\nconclude that for any properly metrisable space $T$, $\\mathcal{A}^T_f$ is\neither empty or dense in $\\mathcal{M}^T$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:30:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Smith","Richard J.",""],["Talimdjioski","Filip",""]]}
{"id":"2308.14122","submitter":"Fernando Quintao Pereira","authors":"Michael Canesche, Roland Leissa, Fernando Magno Quint\\~ao Pereira","title":"Preparing Reproducible Scientific Artifacts using Docker","comments":"15 pages. Manuscript not submitted to any conference, used as a\n  guideline for authors who want to submit artifacts to artifact evaluation\n  pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The pursuit of scientific knowledge strongly depends on the ability to\nreproduce and validate research results. It is a well-known fact that the\nscientific community faces challenges related to transparency, reliability, and\nthe reproducibility of empirical published results. Consequently, the design\nand preparation of reproducible artifacts has a fundamental role in the\ndevelopment of science. Reproducible artifacts comprise comprehensive\ndocumentation, data, and code that enable replication and validation of\nresearch findings by others. In this work, we discuss a methodology to\nconstruct reproducible artifacts based on Docker. Our presentation centers\naround the preparation of an artifact to be submitted to scientific venues that\nencourage or require this process. This report's primary audience are\nscientists working with empirical computer science; however, we believe that\nthe presented methodology can be extended to other technology-oriented\nempirical disciplines.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:36:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Canesche","Michael",""],["Leissa","Roland",""],["Pereira","Fernando Magno Quint\u00e3o",""]]}
{"id":"2308.14123","submitter":"Adam Tyc","authors":"Adam Tyc","title":"On $Z$-monodromies in embedded graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We characterize all permutations which realize as the $z$-monodromies of\nfaces in connected simple finite graphs embedded in surfaces whose duals are\nalso simple.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:40:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tyc","Adam",""]]}
{"id":"2308.14124","submitter":"Jingyang Zhao","authors":"Jingyang Zhao and Mingyu Xiao","title":"The APX-hardness of the Traveling Tournament Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem\nin sports scheduling, which asks us to design a double round-robin schedule\nsuch that each pair of teams plays one game in each other's home venue, each\nteam plays at most $k$-consecutive home games or away games, and the total\ntraveling distance of all the $n$ teams is minimized. TTP-$k$ allows a PTAS\nwhen $k=2$ and becomes APX-hard when $k\\geq n-1$. In this paper, we reduce the\ngap by showing that TTP-$k$ is APX-hard for any fixed $k\\geq3$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 14:56:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Jingyang",""],["Xiao","Mingyu",""]]}
{"id":"2308.14125","submitter":"ZhiGuo Chen","authors":"Bo Su, Yuan Huang, Yan Hui Hou, Jiawei Li, Rong Yang, Yongchang Ma,\n  Yang Yang, Guangyu Zhang, Xingjiang Zhou, Jianlin Luo, and Zhi-Guo Chen","title":"Persistence of Monoclinic Crystal Structure in Three-Dimensional\n  Second-Order Topological Insulator Candidate 1T'-MoTe2 Thin Flake without\n  Structural Phase transition","comments":"20 pages, 5 figures","journal-ref":"Advanced Science 9, 2101532 (2022)","doi":"10.1002/advs.202101532","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A van der Waals material, MoTe2 with a monoclinic 1T' crystal structure is a\ncandidate for three-dimensional (3D) second-order topological insulators\n(SOTIs) hosting gapless hinge states and insulating surface states. However,\ndue to the temperature-induced structural phase transition, the monoclinic 1T'\nstructure of MoTe2 would be transformed into the orthorhombic Td structure as\nthe temperature is lowered, which hinders the experimental verification and the\nelectronic applications of the predicted SOTI state at low temperatures. Here,\nwe present systematic Raman spectroscopy studies of the exfoliated MoTe2 thin\nflakes with variable thicknesses at different temperatures. As a spectroscopic\nsignature of the orthorhombic Td structure of MoTe2, the out-of-plane vibration\nmode D at ~ 125 cm-1 is always visible below a certain temperature in the\nmultilayer flakes thicker than ~ 27.7 nm, but vanishes in the temperature range\nfrom 80 K to 320 K when the flake thickness becomes lower than ~ 19.5 nm. The\nabsence of the out-of-plane vibration mode D in the Raman spectra here\ndemonstrates not only the disappearance of the monoclinic-to-orthorhombic phase\ntransition but also the persistence of the monoclinic 1T' structure in the\nMoTe2 thin flakes thinner than ~ 19.5 nm at low temperatures down to 80 K,\nwhich may be caused by the high enough density of the holes introduced during\nthe gold-enhanced exfoliation process and exposure to air. The MoTe2 thin\nflakes with the low-temperature monoclinic 1T' structure provide a material\nplatform for realizing SOTI states in van der Waals materials at low\ntemperatures, which paves the way for developing a new generation of electronic\ndevices based on SOTIs.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:01:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Bo",""],["Huang","Yuan",""],["Hou","Yan Hui",""],["Li","Jiawei",""],["Yang","Rong",""],["Ma","Yongchang",""],["Yang","Yang",""],["Zhang","Guangyu",""],["Zhou","Xingjiang",""],["Luo","Jianlin",""],["Chen","Zhi-Guo",""]]}
{"id":"2308.14126","submitter":"Siddharth Katageri","authors":"Siddharth Katageri, Arkadipta De, Chaitanya Devaguptapu, VSSV Prasad,\n  Charu Sharma, Manohar Kaul","title":"Synergizing Contrastive Learning and Optimal Transport for 3D Point\n  Cloud Domain Adaptation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, the fundamental problem of unsupervised domain adaptation (UDA) on\n3D point clouds has been motivated by a wide variety of applications in\nrobotics, virtual reality, and scene understanding, to name a few. The point\ncloud data acquisition procedures manifest themselves as significant domain\ndiscrepancies and geometric variations among both similar and dissimilar\nclasses. The standard domain adaptation methods developed for images do not\ndirectly translate to point cloud data because of their complex geometric\nnature. To address this challenge, we leverage the idea of multimodality and\nalignment between distributions. We propose a new UDA architecture for point\ncloud classification that benefits from multimodal contrastive learning to get\nbetter class separation in both domains individually. Further, the use of\noptimal transport (OT) aims at learning source and target data distributions\njointly to reduce the cross-domain shift and provide a better alignment. We\nconduct a comprehensive empirical study on PointDA-10 and GraspNetPC-10 and\nshow that our method achieves state-of-the-art performance on GraspNetPC-10\n(with approx 4-12% margin) and best average performance on PointDA-10. Our\nablation studies and decision boundary analysis also validate the significance\nof our contrastive learning module and OT alignment.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:03:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Katageri","Siddharth",""],["De","Arkadipta",""],["Devaguptapu","Chaitanya",""],["Prasad","VSSV",""],["Sharma","Charu",""],["Kaul","Manohar",""]]}
{"id":"2308.14127","submitter":"Florian Sch\\\"afer","authors":"Ruijia Cao and Florian Sch\\\"afer","title":"Information geometric regularization of the barotropic Euler equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A key numerical difficulty in compressible fluid dynamics is the formation of\nshock waves. Shock waves feature jump discontinuities in the velocity and\ndensity of the fluid and thus preclude the existence of classical solutions to\nthe compressible Euler equations. Weak \"entropy\" solutions are commonly defined\nby viscous regularization, but even small amounts of viscosity can\nsubstantially change the long-term behavior of the solution. In this work, we\npropose an inviscid regularization based on ideas from semidefinite programming\nand information geometry. From a Lagrangian perspective, shock formation in\nentropy solutions amounts to inelastic collisions of fluid particles. Their\ntrajectories are akin to that of projected gradient descent on a feasible set\nof nonintersecting paths. We regularize these trajectories by replacing them\nwith solution paths of interior point methods based on log determinantal\nbarrier functions. These paths are geodesic curves with respect to the\ninformation geometry induced by the barrier function. Thus, our regularization\namounts to replacing the Euclidean geometry of phase space with a suitable\ninformation geometry. We extend this idea to infinite families of paths by\nviewing Euler's equations as a dynamical system on a diffeomorphism manifold.\nOur regularization embeds this manifold into an information geometric ambient\nspace, equipping it with a geodesically complete geometry. Expressing the\nresulting Lagrangian equations in Eulerian form, we derive a regularized Euler\nequation in conservation form. Numerical experiments on one and two-dimensional\nproblems show its promise as a numerical tool.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:03:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cao","Ruijia",""],["Sch\u00e4fer","Florian",""]]}
{"id":"2308.14128","submitter":"Moshe Bensimon PhD","authors":"Ohad Boxerman, Moshe Bensimon, Shlomo Greenberg, and Yehuda Ben-Shimol","title":"A Novel Reconfigurable Vector-Processed Interleaving Algorithm for a\n  DVB-RCS2 Turbo Encoder","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.AR math.IT","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Turbo-Codes (TC) are a family of convolutional codes enabling\nForward-Error-Correction (FEC) while approaching the theoretical limit of\nchannel capacity predicted by Shannons theorem. One of the bottlenecks of a\nTurbo Encoder (TE) lies in the non-uniform interleaving stage. Interleaving\nalgorithms require stalling the input vector bits before the bit rearrangement\ncausing a delay in the overall process. This paper presents performance\nenhancement via a parallel algorithm for the interleaving stage of a Turbo\nEncoder application compliant with the DVB-RCS2 standard. The algorithm\nefficiently implements the interleaving operation while utilizing attributes of\na given DSP. We will discuss and compare a serial model for the TE, with the\npresented parallel processed algorithm. Results showed a speed-up factor of up\nto 3.4 Total-Cycles, 4.8 Write and 7.3 Read.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:10:48 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 05:46:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Boxerman","Ohad",""],["Bensimon","Moshe",""],["Greenberg","Shlomo",""],["Ben-Shimol","Yehuda",""]]}
{"id":"2308.14129","submitter":"Xi Chen","authors":"Xi Chen, Yongxiang Liao, Yun Xiong, Yao Zhang, Siwei Zhang, Jiawei\n  Zhang, Yiheng Sun","title":"SPEED: Streaming Partition and Parallel Acceleration for Temporal\n  Interaction Graph Embedding","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC cs.SI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Temporal Interaction Graphs (TIGs) are widely employed to model intricate\nreal-world systems such as financial systems and social networks. To capture\nthe dynamism and interdependencies of nodes, existing TIG embedding models need\nto process edges sequentially and chronologically. However, this requirement\nprevents it from being processed in parallel and struggle to accommodate\nburgeoning data volumes to GPU. Consequently, many large-scale temporal\ninteraction graphs are confined to CPU processing. Furthermore, a generalized\nGPU scaling and acceleration approach remains unavailable. To facilitate\nlarge-scale TIGs' implementation on GPUs for acceleration, we introduce a novel\ntraining approach namely Streaming Edge Partitioning and Parallel Acceleration\nfor Temporal Interaction Graph Embedding (SPEED). The SPEED is comprised of a\nStreaming Edge Partitioning Component (SEP) which addresses space overhead\nissue by assigning fewer nodes to each GPU, and a Parallel Acceleration\nComponent (PAC) which enables simultaneous training of different sub-graphs,\naddressing time overhead issue. Our method can achieve a good balance in\ncomputing resources, computing time, and downstream task performance. Empirical\nvalidation across 7 real-world datasets demonstrates the potential to expedite\ntraining speeds by a factor of up to 19.29x. Simultaneously, resource\nconsumption of a single-GPU can be diminished by up to 69%, thus enabling the\nmultiple GPU-based training and acceleration encompassing millions of nodes and\nbillions of edges. Furthermore, our approach also maintains its competitiveness\nin downstream tasks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:11:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Xi",""],["Liao","Yongxiang",""],["Xiong","Yun",""],["Zhang","Yao",""],["Zhang","Siwei",""],["Zhang","Jiawei",""],["Sun","Yiheng",""]]}
{"id":"2308.14130","submitter":"Qian Jiang","authors":"Qian Jiang, Feng Ren, Chenglei Wang, Zhaokun Wang, Gholamreza\n  Kefayati, Sasa Kenjeres, Kambiz Vafai, Yang Liu, Hui Tang","title":"Simulation of magnetic hyperthermia cancer treatment near a blood vessel","comments":"arXiv admin note: substantial text overlap with arXiv:2308.12652","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.med-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we conduct a study on magnetic hyperthermia treatment when a\nvessel is located near the tumor. The holistic framework is established to\nsolve the process of tumor treatment. The interstitial tissue fluid, MNP\ndistribution, temperature profile, and nanofluids are involved in the\nsimulation. The study evaluates the cancer treatment efficacy by\ncumulative-equivalent-minutes-at-43 centigrade (CEM43), a widely accepted\nthermal dose. The influence of the nearby blood vessel is investigated, and\nparameter studies about the distance to the tumor, the width of the blood\nvessel, and the vessel direction are also conducted. After that, the effects of\nthe fluid-structure interaction of moving vessel boundaries and blood rheology\nare discussed. The results demonstrate the cooling effect of a nearby blood\nvessel, and such effect reduces with the augment of the distance between the\ntumor and blood vessel. The combination of downward gravity and the cool effect\nfrom the lower horizontal vessel leads to the best performance with 97.77%\nablation in the tumor and 0.87% injury in healthy tissue at distance d = 4 mm,\nbut the cases of the vertical vessel are relatively poor. The vessel width and\nblood rheology affect the treatment by velocity gradient near the vessel wall.\nAdditionally, the moving boundary almost has no impact on treatment efficacy.\nThe simulation tool has been well-validated and the outcomes can provide a\nuseful reference to magnetic hyperthermia treatment.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:16:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiang","Qian",""],["Ren","Feng",""],["Wang","Chenglei",""],["Wang","Zhaokun",""],["Kefayati","Gholamreza",""],["Kenjeres","Sasa",""],["Vafai","Kambiz",""],["Liu","Yang",""],["Tang","Hui",""]]}
{"id":"2308.14131","submitter":"Jingyang Zhao","authors":"Jingyang Zhao and Mingyu Xiao","title":"Improved Approximation Algorithms for Multidepot Capacitated Vehicle\n  Routing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Multidepot Capacitated Vehicle Routing Problem (MCVRP) is a well-known\nvariant of the classic Capacitated Vehicle Routing Problem (CVRP), where we\nneed to route capacitated vehicles located in multiple depots to serve\ncustomers' demand such that each vehicle must return to the depot it starts,\nand the total traveling distance is minimized. There are three variants of\nMCVRP according to the property of the demand: unit-demand, splittable and\nunsplittable. We study approximation algorithms for $k$-MCVRP in metric graphs\nwhere $k$ is the capacity of each vehicle, and all three versions are APX-hard\nfor any constant $k\\geq 3$. Previously, Li and Simchi-Levi proposed a\n$(2\\alpha+1-\\alpha/k)$-approximation algorithm for splittable and unit-demand\n$k$-MCVRP and a $(2\\alpha+2-2\\alpha/k)$-approximation algorithm for\nunsplittable $k$-MCVRP, where $\\alpha=3/2-10^{-36}$ is the current best\napproximation ratio for metric TSP. Harks et al. further improved the ratio to\n4 for the unsplittable case. We give a $(4-1/1500)$-approximation algorithm for\nunit-demand and splittable $k$-MCVRP, and a $(4-1/50000)$-approximation\nalgorithm for unsplittable $k$-MCVRP. Furthermore, we give a\n$(3+\\ln2-\\max\\{\\Theta(1/\\sqrt{k}),1/9000\\})$-approximation algorithm for\nsplittable and unit-demand $k$-MCVRP, and a\n$(3+\\ln2-\\Theta(1/\\sqrt{k}))$-approximation algorithm for unsplittable\n$k$-MCVRP under the assumption that the capacity $k$ is a fixed constant. Our\nresults are based on recent progress in approximating CVRP.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:17:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Jingyang",""],["Xiao","Mingyu",""]]}
{"id":"2308.14132","submitter":"Gabriel Alon","authors":"Gabriel Alon, Michael Kamfonas","title":"Detecting Language Model Attacks with Perplexity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A novel hack involving Large Language Models (LLMs) has emerged, leveraging\nadversarial suffixes to trick models into generating perilous responses. This\nmethod has garnered considerable attention from reputable media outlets such as\nthe New York Times and Wired, thereby influencing public perception regarding\nthe security and safety of LLMs. In this study, we advocate the utilization of\nperplexity as one of the means to recognize such potential attacks. The\nunderlying concept behind these hacks revolves around appending an unusually\nconstructed string of text to a harmful query that would otherwise be blocked.\nThis maneuver confuses the protective mechanisms and tricks the model into\ngenerating a forbidden response. Such scenarios could result in providing\ndetailed instructions to a malicious user for constructing explosives or\norchestrating a bank heist. Our investigation demonstrates the feasibility of\nemploying perplexity, a prevalent natural language processing metric, to detect\nthese adversarial tactics before generating a forbidden response. By evaluating\nthe perplexity of queries with and without such adversarial suffixes using an\nopen-source LLM, we discovered that nearly 90 percent were above a perplexity\nof 1000. This contrast underscores the efficacy of perplexity for detecting\nthis type of exploit.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:20:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alon","Gabriel",""],["Kamfonas","Michael",""]]}
{"id":"2308.14133","submitter":"Weijia Feng","authors":"Weijia Feng and Lingting Zhu and Lequan Yu","title":"Cheap Lunch for Medical Image Segmentation by Fine-tuning SAM on Few\n  Exemplars","comments":"Accepted by Brain Lesion (BrainLes) workshop of International\n  Conference on Medical Image Computing and Computer Assisted Intervention\n  (MICCAI BrainLes 2023). 10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Segment Anything Model (SAM) has demonstrated remarkable capabilities of\nscaled-up segmentation models, enabling zero-shot generalization across a\nvariety of domains. By leveraging large-scale foundational models as\npre-trained models, it is a natural progression to fine-tune SAM for specific\ndomains to further enhance performances. However, the adoption of foundational\nmodels in the medical domain presents a challenge due to the difficulty and\nexpense of labeling sufficient data for adaptation within hospital systems. In\nthis paper, we introduce an efficient and practical approach for fine-tuning\nSAM using a limited number of exemplars, making it suitable for such scenarios.\nOur approach combines two established techniques from the literature: an\nexemplar-guided synthesis module and the widely recognized Low-Rank Adaptation\n(LoRA) fine-tuning strategy, serving as data-level and model-level attempts\nrespectively. Interestingly, our empirical findings suggest that SAM can be\neffectively aligned within the medical domain even with few labeled data. We\nvalidate our approach through experiments on brain tumor segmentation (BraTS)\nand multi-organ CT segmentation (Synapse). The comprehensive results underscore\nthe feasibility and effectiveness of such an approach, paving the way for the\npractical application of SAM in the medical domain.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:21:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Feng","Weijia",""],["Zhu","Lingting",""],["Yu","Lequan",""]]}
{"id":"2308.14134","submitter":"Lorenzo Beretta","authors":"Ioana O. Bercea, Lorenzo Beretta, Jonas Klausen, Jakob B{\\ae}k Tejs\n  Houen and Mikkel Thorup","title":"Locally Uniform Hashing","comments":"FOCS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hashing is a common technique used in data processing, with a strong impact\non the time and resources spent on computation. Hashing also affects the\napplicability of theoretical results that often assume access to (unrealistic)\nuniform/fully-random hash functions. In this paper, we are concerned with\ndesigning hash functions that are practical and come with strong theoretical\nguarantees on their performance.\n  To this end, we present tornado tabulation hashing, which is simple, fast,\nand exhibits a certain full, local randomness property that provably makes\ndiverse algorithms perform almost as if (abstract) fully-random hashing was\nused. For example, this includes classic linear probing, the widely used\nHyperLogLog algorithm of Flajolet, Fusy, Gandouet, Meunier [AOFA 97] for\ncounting distinct elements, and the one-permutation hashing of Li, Owen, and\nZhang [NIPS 12] for large-scale machine learning. We also provide a very\nefficient solution for the classical problem of obtaining fully-random hashing\non a fixed (but unknown to the hash function) set of $n$ keys using $O(n)$\nspace. As a consequence, we get more efficient implementations of the splitting\ntrick of Dietzfelbinger and Rink [ICALP'09] and the succinct space uniform\nhashing of Pagh and Pagh [SICOMP'08].\n  Tornado tabulation hashing is based on a simple method to systematically\nbreak dependencies in tabulation-based hashing techniques.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:28:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bercea","Ioana O.",""],["Beretta","Lorenzo",""],["Klausen","Jonas",""],["Houen","Jakob B\u00e6k Tejs",""],["Thorup","Mikkel",""]]}
{"id":"2308.14135","submitter":"Ilya Timofeyev","authors":"Yingxue Su, Brett Geiger, Ilya Timofeyev, Andreas Mang, Robert\n  Azencott","title":"Rare Events Analysis and Computation for Stochastic Evolution of\n  Bacterial Populations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we develop a computational approach for computing most likely\ntrajectories describing rare events that correspond to the emergence of\nnon-dominant genotypes. This work is based on the large deviations approach for\ndiscrete Markov chains describing the genetic evolution of large bacterial\npopulations. We demonstrate that a gradient descent algorithm developed in this\npaper results in the fast and accurate computation of most-likely trajectories\nfor a large number of bacterial genotypes. We supplement our analysis with\nextensive numerical simulations demonstrating the computational advantage of\nthe designed gradient descent algorithm over other, more simplified,\napproaches.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:29:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Yingxue",""],["Geiger","Brett",""],["Timofeyev","Ilya",""],["Mang","Andreas",""],["Azencott","Robert",""]]}
{"id":"2308.14136","submitter":"G\\'erard Besson","authors":"G\\'erard Besson, Gilles Courtois, Sa'ar Hersonsky","title":"Rigidity of flat holonomies","comments":"arXiv admin note: substantial text overlap with arXiv:1701.06883","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the existence of one horosphere in the universal cover of a\nclosed, strictly quarter pinched, negatively curved Riemannian manifold of\ndimension $n\\geq 3$ on which the stable holonomy along minimizing geodesics\ncoincide with the Riemannian parallel transport, implies that the manifold is\nhomothetic to a real hyperbolic manifold.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:33:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Besson","G\u00e9rard",""],["Courtois","Gilles",""],["Hersonsky","Sa'ar",""]]}
{"id":"2308.14137","submitter":"Raul Penaguiao","authors":"Raul Penaguiao","title":"Lecture notes on algebraic methods in combinatorics","comments":"lecture notes, 42 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  These are lecture notes of a course taken in Leipzig 2023, spring semester.\nIt deals with extremal combinatorics, algebraic methods and combinatorial\ngeometry. These are not meant to be exhaustive, and do not contain many proofs\nthat were presented in the course.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:34:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Penaguiao","Raul",""]]}
{"id":"2308.14138","submitter":"Navnath Daundkar","authors":"Navnath Daundkar and Bittu Singh","title":"Higher (equivariant) topological complexity of Milnor manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Milnor manifolds are the total spaces of projectivizations of certain vector\nbundles over projective spaces. In this paper, we compute the sharp bounds on\nthe higher topological complexity of these manifolds, and in many cases, we\ncompute its exact value. The Klein bottle is an example of a Milnor manifold.\nIt turns out that, our cohomological calculations shows, the higher topological\ncomplexity of the Klien bottle is maximal. In numerous instances, we show that\nthe difference between the higher topological complexity of Milnor manifolds\nand the higher topological complexity of the product of projective spaces (the\ntotal spaces of projectivizations of trivial vector bundles over projective\nspaces), is at most two. Finally, we compute sharp bounds on the higher\nequivariant topological complexity of Milnor manifolds, when they admit free\n$\\mathbb{Z}_2$ and circle-actions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:35:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Daundkar","Navnath",""],["Singh","Bittu",""]]}
{"id":"2308.14139","submitter":"Angela Chen","authors":"Angela Chen, Konstantinos Mitsopoulos, and Raffaele Romagnoli","title":"Reinforcement Learning-based Optimal Control and Software Rejuvenation\n  for Safe and Efficient UAV Navigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmanned autonomous vehicles (UAVs) rely on effective path planning and\ntracking control to accomplish complex tasks in various domains. Reinforcement\nLearning (RL) methods are becoming increasingly popular in control\napplications, as they can learn from data and deal with unmodelled dynamics.\nCyber-physical systems (CPSs), such as UAVs, integrate sensing, network\ncommunication, control, and computation to solve challenging problems. In this\ncontext, Software Rejuvenation (SR) is a protection mechanism that refreshes\nthe control software to mitigate cyber-attacks, but it can affect the tracking\ncontroller's performance due to discrepancies between the control software and\nthe physical system state. Traditional approaches to mitigate this effect are\nconservative, hindering the overall system performance. In this paper, we\npropose a novel approach that incorporates Deep Reinforcement Learning (Deep\nRL) into SR to design a safe and high-performing tracking controller. Our\napproach optimizes safety and performance, and we demonstrate its effectiveness\nduring UAV simulations. We compare our approach with traditional methods and\nshow that it improves the system's performance while maintaining safety\nconstraints.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:38:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Angela",""],["Mitsopoulos","Konstantinos",""],["Romagnoli","Raffaele",""]]}
{"id":"2308.14140","submitter":"Bogdan Borodin R.","authors":"Bogdan R. Borodin, Ilya A. Eliseyev, Aidar I. Galimov, Lyubov V.\n  Kotova, Mikhail V. Durnev, Tatiana V. Shubina, and Maxim V. Rakhlin","title":"Indirect-to-direct bandgap transition in few-layer $\\beta$-InSe as\n  probed by photoluminescence spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  InSe is a promising material for a next-generation of two-dimensional\nelectronic and optical devices, characteristics of which are largely determined\nby the type of band structure, direct or indirect. In general, different\nmethods can be sensitive to different peculiarities of the electronic structure\nleading to different results. In this work, we will focus on the luminescent\nproperties of few-layer $\\beta$-InSe with a thickness of 6 to 75 monolayers\n(ML). Low-temperature micro-photoluminescence ($mu$-PL) studies show a sharp\nincrease in PL intensity in the range of thicknesses from 16 to 20 monolayers,\nwhere, in addition, there is a singularity in the dependence of the work\nfunction on the thickness. Time-resolved photoluminescence spectroscopy (TRPL)\nreveals three characteristic PL decay times that differ from each other by\nabout an order of magnitude. We associate the processes underlying the two\nfaster decays with the recombination of electrons and holes between the band\nextrema, either directly or through the interband relaxation of holes. Their\ncontributions to the total PL intensity increase significantly in the same\nthickness range, 16-20 MLs. On the contrary, the slowest contribution, which we\nattribute mainly to the defect-assisted recombination, prevails at a smaller\nnumber of monolayers and then noticeably decreases. These results indicate the\nindirect-to-direct bandgap transition near 16-20 MLs, which determines the\nrange of applicability of a few-layer $\\beta$-InSe for efficient light\nemitters.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:40:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Borodin","Bogdan R.",""],["Eliseyev","Ilya A.",""],["Galimov","Aidar I.",""],["Kotova","Lyubov V.",""],["Durnev","Mikhail V.",""],["Shubina","Tatiana V.",""],["Rakhlin","Maxim V.",""]]}
{"id":"2308.14141","submitter":"Tolson Bell","authors":"Tolson Bell and Alan Frieze","title":"Giant Rainbow Trees in Sparse Random Graphs","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For any small constant $\\epsilon>0$, the Erd\\H{o}s-R\\'enyi random graph\n$G(n,\\frac{1+\\epsilon}{n})$ with high probability has a unique largest\ncomponent which contains $(1\\pm O(\\epsilon))2\\epsilon n$ vertices. Let\n$G_c(n,p)$ be obtained by assigning each edge in $G(n,p)$ a color in $[c]$\nindependently and uniformly. Cooley, Do, Erde, and Missethan proved that for\nany fixed $\\alpha>0$, $G_{\\alpha n}(n,\\frac{1+\\epsilon}{n})$ with high\nprobability contains a rainbow tree (a tree that does not repeat colors) which\ncovers $(1\\pm O(\\epsilon))\\frac{\\alpha}{\\alpha+1}\\epsilon n$ vertices, and\nconjectured that there is one which covers $(1\\pm O(\\epsilon))2\\epsilon n$. In\nthis paper, we achieve the correct leading constant and prove their conjecture\ncorrect up to a logarithmic factor in the error term, as we show that with high\nprobability $G_{\\alpha n}(n,\\frac{1+\\epsilon}{n})$ contains a rainbow tree\nwhich covers $(1\\pm O(\\epsilon\\log(1/\\epsilon)))2\\epsilon n$ vertices.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:42:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bell","Tolson",""],["Frieze","Alan",""]]}
{"id":"2308.14142","submitter":"Talay Cheema","authors":"Talay M Cheema, Carl Edward Rasmussen","title":"Integrated Variational Fourier Features for Fast Spatial Modelling with\n  Gaussian Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sparse variational approximations are popular methods for scaling up\ninference and learning in Gaussian processes to larger datasets. For $N$\ntraining points, exact inference has $O(N^3)$ cost; with $M \\ll N$ features,\nstate of the art sparse variational methods have $O(NM^2)$ cost. Recently,\nmethods have been proposed using more sophisticated features; these promise\n$O(M^3)$ cost, with good performance in low dimensional tasks such as spatial\nmodelling, but they only work with a very limited class of kernels, excluding\nsome of the most commonly used. In this work, we propose integrated Fourier\nfeatures, which extends these performance benefits to a very broad class of\nstationary covariance functions. We motivate the method and choice of\nparameters from a convergence analysis and empirical exploration, and show\npractical speedup in synthetic and real world spatial regression tasks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:44:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheema","Talay M",""],["Rasmussen","Carl Edward",""]]}
{"id":"2308.14143","submitter":"Andrey A Popov","authors":"Andrey A. Popov, Renato Zanetti","title":"Ensemble-localized Kernel Density Estimation with Applications to the\n  Ensemble Gaussian Mixture Filter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The ensemble Gaussian mixture filter (EnGMF) is a powerful filter for highly\nnon-Gaussian and non-linear models that has practical utility in the case of a\nsmall number of samples, and theoretical convergence to full Bayesian inference\nin the ensemble limit. We aim to increase the utility of the EnGMF by\nintroducing an ensemble-local notion of covariance into the kernel density\nestimation (KDE) step for the prior distribution. We prove that in the Gaussian\ncase, our new ensemble-localized KDE technique is exactly the same as more\ntraditional KDE techniques. We also show an example of a non-Gaussian\ndistribution that can fail to be approximated by canonical KDE methods, but can\nbe approximated exactly by our new KDE technique. We showcase our new KDE\ntechnique on a simple bivariate problem, showing that it has nice qualitative\nand quantitative properties, and significantly improves the estimate of the\nprior and posterior distributions for all ensemble sizes tested. We\nadditionally show the utility of the proposed methodology for sequential\nfiltering for the Lorenz '63 equations, achieving a significant reduction in\nerror, and less conservative behavior in the uncertainty estimate with respect\nto traditional techniques.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:54:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Popov","Andrey A.",""],["Zanetti","Renato",""]]}
{"id":"2308.14144","submitter":"Souvik Roy","authors":"Deep Ray and Souvik Roy","title":"Learning end-to-end inversion of circular Radon transforms in the\n  partial radial setup","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a deep learning-based computational algorithm for inversion of\ncircular Radon transforms in the partial radial setup, arising in photoacoustic\ntomography. We first demonstrate that the truncated singular value\ndecomposition-based method, which is the only traditional algorithm available\nto solve this problem, leads to severe artifacts which renders the\nreconstructed field as unusable. With the objective of overcoming this\ncomputational bottleneck, we train a ResBlock based U-Net to recover the\ninferred field that directly operates on the measured data. Numerical results\nwith augmented Shepp-Logan phantoms, in the presence of noisy full and limited\nview data, demonstrate the superiority of the proposed algorithm.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:57:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ray","Deep",""],["Roy","Souvik",""]]}
{"id":"2308.14145","submitter":"Shiao Lee","authors":"Shiao Li (Institute of Medical Technology, Peking University Health\n  Science Center, Beijing, China)","title":"Enhancement of the Prefiltered Rotationally Invariant Non-local PCA\n  Algorithm for MRI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Magnetic resonance imaging (MRI) is a non-invasive medical imaging technique\noffering high-resolution 3D images and valuable insights into human tissue\nconditions. Even at present, the refinement of denoising methods for MRI\nremains a crucial concern for improving the quality of the images. This study\naims to enhance the prefiltered rotationally invariant non-local principal\ncomponent analysis (PRI-NL-PCA) algorithm. This paper relaxed the original\nrestriction, using the particle swarm optimization and traversal method to\ndetermine the optimal parameters of the algorithm. This paper also combined the\ncomponent filters of the original algorithm and picked the most suitable\ncombination as the new collaborative algorithm. It was found that the original\nalgorithm has already achieved the best possible outcome, apart from a few\nthreshold parameters that need to be adjusted. The effective way to further\nenhance the performance is to attach only one NL-PCA filter before and after\nthe pre-filtered rotationally invariant non-local mean (PRI-NLM) filter.\nAlthough the performance of the new collaborative algorithm is still a little\nshort of advanced deep learning methods, it shows that the algorithm based on\nPCA denoising is indeed feasible. It requires only a few parameters to be\nadjusted, and it is conceivable that they can be determined directly from the\nimage, granting it a strong general capacity for various body parts, and it\nmerits further exploration. An auxiliary tool was also extracted from the new\nalgorithm, encouraging further combination of it with other state-of-the-art\nmethods to further improve their denoising performance.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 15:59:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Shiao","","Institute of Medical Technology, Peking University Health\n  Science Center, Beijing, China"]]}
{"id":"2308.14146","submitter":"Daniel Grimmer","authors":"Daniel Grimmer","title":"From Humean Laws to a Neo-Kantian Spacetime: A Dynamics-First View of\n  Topology","comments":"31 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.hist-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Do the spacetime manifolds which feature in our best scientific theories\nreflect anything metaphysically weighty in the world (e.g., any fundamental\nsubstances or relations)? Should we extend our notions of space and time beyond\nthe epistemological roles they play in helping us codify the dynamical behavior\nof matter? Kant famously answered ``No'' to both of these questions, contra\nNewton and Leibniz. This paper introduces novel technical and philosophical\nsupport for such a (Neo-)Kantian perspective on the metaphysics of space and\ntime. To begin, I will make an explicit analogy between broadly Humean views of\nlaws (e.g., Lewis, Demarest, etc.) and dynamics-first views of geometry (e.g.,\nBrown). I will then continue this line of analogous views beyond the\nmetaphysics of laws debate and the dynamical vs geometric spacetime debate by\nextending it into the context of spacetime topology. Namely, I will put forward\na dynamics-first view of topology (in answer to Norton's problem of\npre-geometry).\n  This dynamics-first view of topology is supported by some powerful new\ntechniques for topological redescription which I have recently developed in\nGrimmer (2023a) and Grimmer (2023b), namely the ISE Method. These new\ntechniques allow us to remove and replace the topological underpinnings of our\nspacetime theories just as easily as we can switch between different coordinate\nsystems. For instance, a theory set on a M\\\"obius strip might be redescribed as\nbeing set on the Euclidean plane and vice versa. Indeed, as Grimmer (2023b) has\nproved, the ISE Method gives us access to effectively every possible spacetime\nframing of a given theory's kinematical and dynamical content. Given this\noverabundance of candidate spacetime framings, it is then conceivable that one\ncan pick out a theory's topological structure via something analogous to a Best\nSystems Analysis.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:03:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Grimmer","Daniel",""]]}
{"id":"2308.14147","submitter":"Yuan Cui","authors":"Yuan Cui, Lily W. Ge, Yiren Ding, Fumeng Yang, Lane Harrison, Matthew\n  Kay","title":"Adaptive Assessment of Visualization Literacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visualization literacy is an essential skill for accurately interpreting data\nto inform critical decisions. Consequently, it is vital to understand the\nevolution of this ability and devise targeted interventions to enhance it,\nrequiring concise and repeatable assessments of visualization literacy for\nindividuals. However, current assessments, such as the Visualization Literacy\nAssessment Test (VLAT), are time-consuming due to their fixed, lengthy format.\nTo address this limitation, we develop two streamlined computerized adaptive\ntests (CATs) for visualization literacy, A-VLAT and A-CALVI, which measure the\nsame set of skills as their original versions in half the number of questions.\nSpecifically, we (1) employ item response theory (IRT) and non-psychometric\nconstraints to construct adaptive versions of the assessments, (2) finalize the\nconfigurations of adaptation through simulation, (3) refine the composition of\ntest items of A-CALVI via a qualitative study, and (4) demonstrate the\ntest-retest reliability (ICC: 0.98 and 0.98) and convergent validity\n(correlation: 0.81 and 0.66) of both CATs via four online studies. We discuss\npractical recommendations for using our CATs and opportunities for further\ncustomization to leverage the full potential of adaptive assessments. All\nsupplemental materials are available at https://osf.io/a6258/.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:08:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cui","Yuan",""],["Ge","Lily W.",""],["Ding","Yiren",""],["Yang","Fumeng",""],["Harrison","Lane",""],["Kay","Matthew",""]]}
{"id":"2308.14148","submitter":"Yin Huang","authors":"Yin Huang, Hao Hei, Jing-wen Feng, Xurong Chen, and Rong Wang","title":"Production of the newly observed $\\bar{T}_{c\\bar{s}0}$ by kaon-induced\n  reactions on a proton/neutron target","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, a new doubly charged tetraquark $T^{a}_{c\\bar{s}0}(2900)^{++}$ and\nits neutral partner $T^{a}_{c\\bar{s}0}(2900)^0$ at the invariant mass spectrum\nof $\\pi{}D_s$ were observed by the LHCb Collaboration. According to its\nproperties, such as the mass and decay width, the\n$T^{a}_{c\\bar{s}0}(2900)^{++/0}$ have been suggested to be a compact\nmulti-quark state or a hadron molecule. In order to distinguish the various\ninterpretations of the $T^{a}_{c\\bar{s}0}(2900)^{++/0}$, we investigate the\npossibility to study the $\\bar{T}^{a}_{c\\bar{s}0}(2900)$ [the antiparticle of\n$T^{a}_{c\\bar{s}0}(2900)$] by kaon-induced reactions on a proton target in an\neffective Lagrangian approach. The production mechanism is characterized by the\n$t$-channel $D$ meson exchange. Our theoretical approach is based on the\nassumption that $\\bar{T}^{a}_{c\\bar{s}0}(2900)$ can be either a\n$K^{*}D^{*}-D_s^{*}\\rho$ molecule or a compact tetraquark state. Using the\ncoupling constants of the $\\bar{T}^{a}_{c\\bar{s}0}(2900)$ to $KD$ channel\nobtained from molecule or compact tetraquark picture of the\n$\\bar{T}^{a}_{c\\bar{s}0}(2900)$, we compute the cross-sections for the process\n$K^{-}n\\to{}\\bar{T}^{a}_{c\\bar{s}0}(2900)^{--}\\Lambda^{+}_c$. The $\\bar{K}N$\ninitial state interaction mediated by Pomeron and Reggeon exchanges is also\nincluded, which reduces the production of the $\\bar{T}^{a}_{c\\bar{s}0}(2900)$.\nOur calculations show that whether $\\bar{T}^{a}_{c\\bar{s}0}(2900)$ is a\nmolecule or a compact tetraquark state, the cross-sections for the\n$K^{-}n\\to{}\\bar{T}^{a}_{c\\bar{s}0}(2900)^{--}\\Lambda^{+}_c$ reaction are of\nsimilar magnitude, ranging from approximately 0.075 nb to 0.270 nb.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:12:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Yin",""],["Hei","Hao",""],["Feng","Jing-wen",""],["Chen","Xurong",""],["Wang","Rong",""]]}
{"id":"2308.14149","submitter":"Jiacheng Lin","authors":"Kaiyuan Gao, Sunan He, Zhenyu He, Jiacheng Lin, QiZhi Pei, Jie Shao,\n  Wei Zhang","title":"Examining User-Friendly and Open-Sourced Large GPT Models: A Survey on\n  Language, Multimodal, and Scientific GPT Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative pre-trained transformer (GPT) models have revolutionized the field\nof natural language processing (NLP) with remarkable performance in various\ntasks and also extend their power to multimodal domains. Despite their success,\nlarge GPT models like GPT-4 face inherent limitations such as considerable\nsize, high computational requirements, complex deployment processes, and closed\ndevelopment loops. These constraints restrict their widespread adoption and\nraise concerns regarding their responsible development and usage. The need for\nuser-friendly, relatively small, and open-sourced alternative GPT models arises\nfrom the desire to overcome these limitations while retaining high performance.\nIn this survey paper, we provide an examination of alternative open-sourced\nmodels of large GPTs, focusing on user-friendly and relatively small models\nthat facilitate easier deployment and accessibility. Through this extensive\nsurvey, we aim to equip researchers, practitioners, and enthusiasts with a\nthorough understanding of user-friendly and relatively small open-sourced\nmodels of large GPTs, their current state, challenges, and future research\ndirections, inspiring the development of more efficient, accessible, and\nversatile GPT models that cater to the broader scientific community and advance\nthe field of general artificial intelligence. The source contents are\ncontinuously updating in https://github.com/GPT-Alternatives/gpt_alternatives.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:14:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Kaiyuan",""],["He","Sunan",""],["He","Zhenyu",""],["Lin","Jiacheng",""],["Pei","QiZhi",""],["Shao","Jie",""],["Zhang","Wei",""]]}
{"id":"2308.14150","submitter":"Mohammad Javad Mehdipour","authors":"F. Javadi and M. J. Mehdipour","title":"On the Phase Retrievable Sequences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this paper, we study phase retrievable sequences and give a\ncharacterization of phase retrievability of a sequence of bounded linear\noperators on a Hilbert space $H$; in particular, for $H=\\ell_2^d(\\Bbb{C})$. We\nalso give several approaches for constructing phase retrievable sequences.\nThen, we investigate the property of phase retrieval for $g$-frames and frames.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:17:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Javadi","F.",""],["Mehdipour","M. J.",""]]}
{"id":"2308.14151","submitter":"Michel Janssen","authors":"Michael Janas and Michel Janssen","title":"Broken arrows: Hardy-Unruh chains and quantum contextuality","comments":"Written for a special issue of Entropy","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hardy (1993) and Unruh (2018) constructed a family of non-maximally entangled\nstates of pairs of particles giving rise to correlations that cannot be\naccounted for with a local hidden-variable theory. Rather than pointing to\nviolations of some Bell inequality, however, they pointed to clashes with the\nbasic rules of logic. Specifically, they constructed these states and the\nassociated measurement settings in such a way that the outcomes will satisfy a\nset of two or three conditionals, which we call Hardy-Unruh chains, but not a\nconditional entailed by this set. Quantum mechanics avoids such broken 'if ...\nthen ...' arrows because it cannot simultaneously assign truth values to all\nconditionals involved. Measurements to determine the truth value of some\npreclude measurements to determine the truth value of others. Hardy-Unruh\nchains thus nicely illustrate quantum contextuality: which variables do and do\nnot get definite values depends on what measurements we decide to perform. We\nuse the framework inspired by Bub (2016) and Pitowsky (1989) and developed in\nJanas, Cuffaro and Janssen (2022} to construct and analyze Hardy-Unruh chains\nin terms of fictitious bananas mimicking the behavior of spin-1/2 particles.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:17:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Janas","Michael",""],["Janssen","Michel",""]]}
{"id":"2308.14152","submitter":"Abril Corona-Figueroa","authors":"Abril Corona-Figueroa, Sam Bond-Taylor, Neelanjan Bhowmik, Yona\n  Falinie A. Gaus, Toby P. Breckon, Hubert P. H. Shum, Chris G. Willcocks","title":"Unaligned 2D to 3D Translation with Conditional Vector-Quantized Code\n  Diffusion using Transformers","comments":"Camera-ready version for ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generating 3D images of complex objects conditionally from a few 2D views is\na difficult synthesis problem, compounded by issues such as domain gap and\ngeometric misalignment. For instance, a unified framework such as Generative\nAdversarial Networks cannot achieve this unless they explicitly define both a\ndomain-invariant and geometric-invariant joint latent distribution, whereas\nNeural Radiance Fields are generally unable to handle both issues as they\noptimize at the pixel level. By contrast, we propose a simple and novel 2D to\n3D synthesis approach based on conditional diffusion with vector-quantized\ncodes. Operating in an information-rich code space enables high-resolution 3D\nsynthesis via full-coverage attention across the views. Specifically, we\ngenerate the 3D codes (e.g. for CT images) conditional on previously generated\n3D codes and the entire codebook of two 2D views (e.g. 2D X-rays). Qualitative\nand quantitative results demonstrate state-of-the-art performance over\nspecialized methods across varied evaluation criteria, including fidelity\nmetrics such as density, coverage, and distortion metrics for two complex\nvolumetric imagery datasets from in real-world scenarios.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:22:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Corona-Figueroa","Abril",""],["Bond-Taylor","Sam",""],["Bhowmik","Neelanjan",""],["Gaus","Yona Falinie A.",""],["Breckon","Toby P.",""],["Shum","Hubert P. H.",""],["Willcocks","Chris G.",""]]}
{"id":"2308.14153","submitter":"Sixiang Chen","authors":"Sixiang Chen, Tian Ye, Jinbin Bai, Erkang Chen, Jun Shi, Lei Zhu","title":"Sparse Sampling Transformer with Uncertainty-Driven Ranking for Unified\n  Removal of Raindrops and Rain Streaks","comments":"Accepted by ICCV'23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the real world, image degradations caused by rain often exhibit a\ncombination of rain streaks and raindrops, thereby increasing the challenges of\nrecovering the underlying clean image. Note that the rain streaks and raindrops\nhave diverse shapes, sizes, and locations in the captured image, and thus\nmodeling the correlation relationship between irregular degradations caused by\nrain artifacts is a necessary prerequisite for image deraining. This paper aims\nto present an efficient and flexible mechanism to learn and model degradation\nrelationships in a global view, thereby achieving a unified removal of\nintricate rain scenes. To do so, we propose a Sparse Sampling Transformer based\non Uncertainty-Driven Ranking, dubbed UDR-S2Former. Compared to previous\nmethods, our UDR-S2Former has three merits. First, it can adaptively sample\nrelevant image degradation information to model underlying degradation\nrelationships. Second, explicit application of the uncertainty-driven ranking\nstrategy can facilitate the network to attend to degradation features and\nunderstand the reconstruction process. Finally, experimental results show that\nour UDR-S2Former clearly outperforms state-of-the-art methods for all\nbenchmarks.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:33:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Sixiang",""],["Ye","Tian",""],["Bai","Jinbin",""],["Chen","Erkang",""],["Shi","Jun",""],["Zhu","Lei",""]]}
{"id":"2308.14154","submitter":"Richard J. Mathar","authors":"Richard J. Mathar","title":"Integrals Associated with the Digamma Integral Representation","comments":"12 pages, no figures, C-source code in anc directory","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The definite integral with the kernel x/(x^2+b^2)/[\\exp(2\\pi x)-1] integrated\nfrom x=0 to infinity is the main term of a representation of the\nDigamma-Function psi(b), the derivative of the logarithm of the Gamma-Function.\nWe present relations within the set of integrals over x^n/(x^2+b^2)^j/[\\exp(\\mu\nx)-1]^s for small integer exponents n, j and s with the aim to reduce them all\nto Polygamma-Functions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:33:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mathar","Richard J.",""]]}
{"id":"2308.14155","submitter":"Qijiong Liu","authors":"Qijiong Liu, Jieming Zhu, Quanyu Dai, Xiao-Ming Wu","title":"Only Encode Once: Making Content-based News Recommender Greener","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large pretrained language models (PLM) have become de facto news encoders in\nmodern news recommender systems, due to their strong ability in comprehending\ntextual content. These huge Transformer-based architectures, when finetuned on\nrecommendation tasks, can greatly improve news recommendation performance.\nHowever, the PLM-based pretrain-finetune framework incurs high computational\ncost and energy consumption, primarily due to the extensive redundant\nprocessing of news encoding during each training epoch. In this paper, we\npropose the ``Only Encode Once'' framework for news recommendation (OLEO), by\ndecoupling news representation learning from downstream recommendation task\nlearning. The decoupled design makes content-based news recommender as green\nand efficient as id-based ones, leading to great reduction in computational\ncost and training resources. Extensive experiments show that our OLEO framework\ncan reduce carbon emissions by up to 13 times compared with the\nstate-of-the-art pretrain-finetune framework and maintain a competitive or even\nsuperior performance level. The source code is released for reproducibility.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:43:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Qijiong",""],["Zhu","Jieming",""],["Dai","Quanyu",""],["Wu","Xiao-Ming",""]]}
{"id":"2308.14156","submitter":"Xiao-Yun Xu","authors":"Xiao-Yun Xu, Tian-Yu Zhang, Zi-Wei Wang, Chu-Han Wang, Xian-Min Jin","title":"A Reconfigurable Photonic Processor for NP-complete Problems","comments":"32 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  NP-complete problems are widely and deeply involved in various real-life\nscenarios while still intractable to solve efficiently on conventional\ncomputers. It is of great practical significance to construct versatile\ncomputing architectures that solve NP-complete problems with computational\nadvantage. Here, we present a reconfigurable photonic processor to efficiently\nsolve a benchmark NP-complete problem, the subset sum problem (SSP). We show\nthat in the case of successive primes, the photonic processor has genuinely\nsurpassed commercial electronic processors launched recently by taking\nadvantages of the high propagation speed and vast parallelism of photons and\nstate-of-the-art integrated photonic technology. Moreover, we are able to\nprogram the photonic processor to tackle different problem instances relying on\nthe tunable integrated modules, variable split junctions, which can be used to\nbuild a fully reconfigurable architecture potentially allowing $2^{N}$\nconfigurations at most. Our experiments confirm the potential of the photonic\nprocessor as a versatile and efficient computing platform, suggesting a\npossible practical route to solving computationally hard problems at large\nscale.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 16:54:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Xiao-Yun",""],["Zhang","Tian-Yu",""],["Wang","Zi-Wei",""],["Wang","Chu-Han",""],["Jin","Xian-Min",""]]}
{"id":"2308.14157","submitter":"Alexandru Chirv\\u{a}situ L.","authors":"Alexandru Chirvasitu","title":"High powers in endomorphism rings over Dedekind domains","comments":"9 pages + references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.NT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mathbb{A}$ be a Dedekind domain and $T$ an endomorphism of a\nfinitely-generated projective $\\mathbb{A}$-module. If $T$ is an $s^{th}$ power\nin $\\mathrm{End}_{\\mathbb{A}}(M)$ for $s$ ranging over an infinite set\n$\\mathcal{S}$ of positive integers, then (a) $T$ decomposes as a direct sum of\nthe zero operator and an invertible operator on a summand of $M$ and (b) that\nsummand is semisimple or of finite order if $\\mathcal{S}$ is appropriately\nlarge (what this means depends on the structure of the additive and\nmultiplicative groups of $\\mathbb{A}$). This generalizes a result of M.\nCavachi's to the effect that the only non-singular integer matrix that is an\n$s^{th}$ power in $M_n(\\mathbb{Z})$ for all $s$ is the identity.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:02:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chirvasitu","Alexandru",""]]}
{"id":"2308.14158","submitter":"Juan Bory Reyes","authors":"Jos\\'e Oscar Gonz\\'alez-Cervantes, Isidro Paulino-Basurto, Juan\n  Bory-Reyes","title":"The Borel-Pompieu formula involving proportional fractional\n  $\\psi$-Cauchy-Riemann operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove an analog of the quaternionic Borel-Pompieu formula in the sense of\nproportional fractional $\\psi$-Cauchy-Riemann operators via Riemann-Liouville\nderivative with respect to another function.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:11:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gonz\u00e1lez-Cervantes","Jos\u00e9 Oscar",""],["Paulino-Basurto","Isidro",""],["Bory-Reyes","Juan",""]]}
{"id":"2308.14159","submitter":"Joseph Falson","authors":"Adrian Llanos, Salva Salmani-Rezaie, Jinwoong Kim, Nicholas Kioussis,\n  David A. Muller and Joseph Falson","title":"Supercell formation in epitaxial rare-earth ditelluride thin films","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Square net tellurides host an array of electronic ground states and commonly\nexhibit charge-density-wave ordering. Here we report the epitaxy of\nDyTe$_{2-\\delta}$ on atomically flat MgO (001) using molecular beam epitaxy.\nThe films are single phase and highly oriented as evidenced by transmission\nelectron microscopy and X-ray diffraction measurements. Epitaxial strain is\nevident in films and is relieved as the thickness increases up to a value of\napproximately 20 unit cells. Diffraction features associated with a supercell\nin the films are resolved which is coupled with Te-deficiency. First principles\ncalculations attribute the formation of this defect lattice to nesting\nconditions in the Fermi surface, which produce a periodic occupancy of the\nconducting Te square-net, and opens a band gap at the chemical potential. This\nwork establishes the groundwork for exploring the role of strain in tuning\nelectronic and structural phases of epitaxial square-net tellurides and related\ncompounds.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:30:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Llanos","Adrian",""],["Salmani-Rezaie","Salva",""],["Kim","Jinwoong",""],["Kioussis","Nicholas",""],["Muller","David A.",""],["Falson","Joseph",""]]}
{"id":"2308.14160","submitter":"Kamran Ali","authors":"Kamran Ali and Charles E. Hughes","title":"A Unified Transformer-based Network for multimodal Emotion Recognition","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The development of transformer-based models has resulted in significant\nadvances in addressing various vision and NLP-based research challenges.\nHowever, the progress made in transformer-based methods has not been\neffectively applied to biosensing research. This paper presents a novel Unified\nBiosensor-Vision Multi-modal Transformer-based (UBVMT) method to classify\nemotions in an arousal-valence space by combining a 2D representation of an\nECG/PPG signal with the face information. To achieve this goal, we first\ninvestigate and compare the unimodal emotion recognition performance of three\nimage-based representations of the ECG/PPG signal. We then present our UBVMT\nnetwork which is trained to perform emotion recognition by combining the 2D\nimage-based representation of the ECG/PPG signal and the facial expression\nfeatures. Our unified transformer model consists of homogeneous transformer\nblocks that take as an input the 2D representation of the ECG/PPG signal and\nthe corresponding face frame for emotion representation learning with minimal\nmodality-specific design. Our UBVMT model is trained by reconstructing masked\npatches of video frames and 2D images of ECG/PPG signals, and contrastive\nmodeling to align face and ECG/PPG data. Extensive experiments on the\nMAHNOB-HCI and DEAP datasets show that our Unified UBVMT-based model produces\ncomparable results to the state-of-the-art techniques.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:30:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ali","Kamran",""],["Hughes","Charles E.",""]]}
{"id":"2308.14161","submitter":"Lanshan He","authors":"Lanshan He, Yusheng Liu, Lisheng Wang","title":"Intergrated Segmentation and Detection Models for Dentex Challenge 2023","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dental panoramic x-rays are commonly used in dental diagnosing. With the\ndevelopment of deep learning, auto detection of diseases from dental panoramic\nx-rays can help dentists to diagnose diseases more efficiently.The Dentex\nChallenge 2023 is a competition for automatic detection of abnormal teeth along\nwith their enumeration ids from dental panoramic x-rays. In this paper, we\npropose a method integrating segmentation and detection models to detect\nabnormal teeth as well as obtain their enumeration ids.Our codes are available\nat https://github.com/xyzlancehe/DentexSegAndDet.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:44:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["He","Lanshan",""],["Liu","Yusheng",""],["Wang","Lisheng",""]]}
{"id":"2308.14162","submitter":"Greg Morrison","authors":"Greg Morrison and D. Thirumalai","title":"Scaling regimes for wormlike chains confined to cylindrical surfaces\n  under tension","comments":"17 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compute the free energy of confinement ${\\cal{F}}$ for a wormlike chain\n(WLC), with persistence length $l_p$, that is confined to the surface of a\ncylinder of radius $R$ under an external tension $f$ using a mean field\nvariational approach. For long chains, we analytically determine the behavior\nof the chain in a variety of regimes, which are demarcated by the interplay of\n$l_p$, the Odijk deflection length ($l_d=(R^2l_p)^{1/3}$), and the Pincus\nlength ($l_f = {k_BT}/{f}$, with $k_BT$ being the thermal energy). The theory\naccurately reproduces the Odijk scaling for strongly confined chains at $f=0$,\nwith ${\\cal{F}}\\sim Ll_p^{-1/3}R^{-2/3}$. For moderate values of $f$, the Odijk\nscaling is discernible only when ${l_p}\\gg R$ for strongly confined chains.\nConfinement does not significantly alter the scaling of the mean extension for\nsufficiently high tension. The theory is used to estimate unwrapping forces for\nDNA from nucleosomes.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:46:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Morrison","Greg",""],["Thirumalai","D.",""]]}
{"id":"2308.14163","submitter":"Bettina Finzel","authors":"Bettina Finzel and Simon P. Kuhn and David E. Tafler and Ute Schmid","title":"Explaining with Attribute-based and Relational Near Misses: An\n  Interpretable Approach to Distinguishing Facial Expressions of Pain and\n  Disgust","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Explaining concepts by contrasting examples is an efficient and convenient\nway of giving insights into the reasons behind a classification decision. This\nis of particular interest in decision-critical domains, such as medical\ndiagnostics. One particular challenging use case is to distinguish facial\nexpressions of pain and other states, such as disgust, due to high similarity\nof manifestation. In this paper, we present an approach for generating\ncontrastive explanations to explain facial expressions of pain and disgust\nshown in video sequences. We implement and compare two approaches for\ncontrastive explanation generation. The first approach explains a specific pain\ninstance in contrast to the most similar disgust instance(s) based on the\noccurrence of facial expressions (attributes). The second approach takes into\naccount which temporal relations hold between intervals of facial expressions\nwithin a sequence (relations). The input to our explanation generation approach\nis the output of an interpretable rule-based classifier for pain and disgust.We\nutilize two different similarity metrics to determine near misses and far\nmisses as contrasting instances. Our results show that near miss explanations\nare shorter than far miss explanations, independent from the applied similarity\nmetric. The outcome of our evaluation indicates that pain and disgust can be\ndistinguished with the help of temporal relations. We currently plan\nexperiments to evaluate how the explanations help in teaching concepts and how\nthey could be enhanced by further modalities and interaction.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:47:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Finzel","Bettina",""],["Kuhn","Simon P.",""],["Tafler","David E.",""],["Schmid","Ute",""]]}
{"id":"2308.14164","submitter":"Francesco Intoci","authors":"Francesco Intoci and Julian Sturm and Daniel Fraunholz and Apostolos\n  Pyrgelis and Colin Barschel","title":"P3LI5: Practical and Confidential Lawful Interception on the 5G Core","comments":"Accepted in the proceedings of IEEE Computer and Netowrk Security\n  (IEEE CNS) 2023. Subject to IEEE copyright policy","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lawful Interception (LI) is a legal obligation of Communication Service\nProviders (CSPs) to provide interception capabilities to Law Enforcement\nAgencies (LEAs) in order to gain insightful data from network communications\nfor criminal proceedings, e.g., network identifiers for tracking suspects. With\nthe privacy-enhancements of network identifiers in the 5th generation of mobile\nnetworks (5G), LEAs need to interact with CSPs for network identifier\nresolution. This raises new privacy issues, as untrusted CSPs are able to infer\nsensitive information about ongoing investigations, e.g., the identities of\ntheir subscribers under suspicion. In this work, we propose P3LI5, a novel\nsystem that enables LEAs to privately query CSPs for network identifier\nresolution leveraging on an information retrieval protocol, SparseWPIR, that is\nbased on private information retrieval and its weakly private version. As such,\nP3LI5 can be adapted to various operational scenarios with different\nconfidentiality or latency requirements, by selectively allowing a bounded\ninformation leakage for improved performance. We implement P3LI5 on the 5G LI\ninfrastructure using well known open-source projects and demonstrate its\nscalability to large databases while retaining low latency. To the best of our\nknowledge, P3LI5 is the first proposal for addressing the privacy issues raised\nby the mandatory requirement for LI on the 5G core network.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:57:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Intoci","Francesco",""],["Sturm","Julian",""],["Fraunholz","Daniel",""],["Pyrgelis","Apostolos",""],["Barschel","Colin",""]]}
{"id":"2308.14165","submitter":"Shreyas Chaudhari","authors":"Shreyas Chaudhari, David Arbour, Georgios Theocharous, Nikos Vlassis","title":"Distributional Off-Policy Evaluation for Slate Recommendations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recommendation strategies are typically evaluated by using previously logged\ndata, employing off-policy evaluation methods to estimate their expected\nperformance. However, for strategies that present users with slates of multiple\nitems, the resulting combinatorial action space renders many of these methods\nimpractical. Prior work has developed estimators that leverage the structure in\nslates to estimate the expected off-policy performance, but the estimation of\nthe entire performance distribution remains elusive. Estimating the complete\ndistribution allows for a more comprehensive evaluation of recommendation\nstrategies, particularly along the axes of risk and fairness that employ\nmetrics computable from the distribution. In this paper, we propose an\nestimator for the complete off-policy performance distribution for slates and\nestablish conditions under which the estimator is unbiased and consistent. This\nbuilds upon prior work on off-policy evaluation for slates and off-policy\ndistribution estimation in reinforcement learning. We validate the efficacy of\nour method empirically on synthetic data as well as on a slate recommendation\nsimulator constructed from real-world data (MovieLens-20M). Our results show a\nsignificant reduction in estimation variance and improved sample efficiency\nover prior work across a range of slate structures.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 17:58:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chaudhari","Shreyas",""],["Arbour","David",""],["Theocharous","Georgios",""],["Vlassis","Nikos",""]]}
{"id":"2308.14166","submitter":"Eyoab Bahiru","authors":"Eyoab Bahiru","title":"Algebras and their Covariant representations in quantum gravity","comments":"20 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study a physically motivated representation of an algebra of operators in\ngravitational and non gravitational theories called the covariant\nrepresentation of an algebra. This is a representation where the symmetries of\nthe operator algebra are implemented unitarily on the Hilbert space. We\nemphasize the very close similarity of this representation to the crossed\nproduct of an algebra. In fact, as an example of (and sometimes identified\nwith) a covariance algebra, the crossed product of an algebra is in one to one\ncorrespondence with the covariant representation of the algebra. This will in\nturn illuminate physically what the crossed product algebra is in the context\nof quantum gravity.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:00:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bahiru","Eyoab",""]]}
{"id":"2308.14167","submitter":"Katherine Meyer","authors":"Katherine Meyer, Horace Fusco, Collin Smith, Alanna Hoyer-Leitzel","title":"Continuation of fixed points and bifurcations from ODE to flow-kick\n  disturbance models","comments":"28 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Some ODE models treat ecological disturbance as a continuous process, even\ndisturbances such as fire that occur almost instantaneously on the timescale of\nsystem recovery. Alternatively, flow-kick models resolve disturbances as\ndiscrete impulses that change an ODE system's state periodically in time. Here\nwe compare the dynamics of continuously disturbed ODE models to those of\nflow-kick models with the same average disturbance rate. In the case that kicks\nare small and high-frequency, we find multiple similarities between continuous\nand analogous discrete disturbance models. First, we prove that flow-kick maps\ngenerate an analogous vector field in the limit as the period between kicks\napproaches zero. Second, we present conditions under which equilibria,\nsaddle-node bifurcations, and transcritical bifurcations continue from ODE to\nflow-kick systems. On the other hand, we also provide numerical evidence that\nsimilarities between continuous and discrete disturbance models can break down\nas the period between kick grows. We illustrate implications of these\ndifferences for climate change in a nonspatial Klausmeier model of vegetation\nand precipitation dynamics. We conclude that although ODEs may suffice to model\nhigh-frequency disturbances, resolving lower-frequency disturbances in time may\nbe essential to effectively predicting their effects.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:07:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meyer","Katherine",""],["Fusco","Horace",""],["Smith","Collin",""],["Hoyer-Leitzel","Alanna",""]]}
{"id":"2308.14168","submitter":"Ang\\'elica Rosario","authors":"Ang\\'elica Rosario Santos, Luis Pericchi Guerra, Hernando Mattei","title":"A Bayesian Projection of the Total Fertility Rate of Puerto Rico:\n  2020-2050","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The abrupt decline in the Total Fertility Rate (TFR) of Puerto Rico since\n2000 makes the prospect of a sustained population decline a real possibility.\nFrom 2000 to 2021 the TFR declined from 2.1 to 0.9 children per woman, one of\nthe lowest in the world. Population projections produced by the United States\nCensus Bureau and the United Nations Population Division show that the island\npopulation may decline from 3.8 millions in 2000 to slightly above 2 million by\n2050, a dramatic 47% population decline in 50 years. As dire as this prospect\nmay be, this may be an optimistic scenario. Both projections have the TFR\nincreasing to 1.5 by 2050, but a fertility projection conducted by us show that\nfertility can remain much closer to 1.0 until 2050. Bayesian Hierarchical\nProbabilistic Theory has been used by the United Nations to incorporate a way\nto measure the uncertainty and to estimate the projection parameters. However,\nthe assumption that the fertility level in countries with low fertility will\neventually increase to 2.1 has been widely criticized as unrealistic and not\nsupported by evidence. We modified the assumptions used by the United Nations\nconsidering countries with TFR similar to Puerto Rico and find that by 2050\nPuerto Rico may have a TFR of 1.1 bounded by a 95% credibility interval\n(0.56,1.77). This indicates that there may be a larger population decline than\nwhat current projections show.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:09:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Santos","Ang\u00e9lica Rosario",""],["Guerra","Luis Pericchi",""],["Mattei","Hernando",""]]}
{"id":"2308.14169","submitter":"Ryan McKenzie","authors":"Ryan McKenzie","title":"Magnetostatic modes and criticality in uniaxial magnetic materials","comments":"18 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze modes in a dipole-dipole coupled quantum magnetic material, taking\ninto consideration domain structure and other shape effects present in any real\nmagnet. We find that the soft mode governing quantum criticality in a\nnon-ellipsoidal sample is an inhomogeneous magnetostatic mode which negates\ndynamic, demagnetization-field effects. The demagnetization field is analyzed\nfrom a microscopic perspective. Furthermore, we find a magnetostatic mode\noriginating from variations in the magnetization of the sample, caused by\ndomain structure and quantum or thermal fluctuations, will be lower in energy\nthan the soft mode governing quantum criticality in the bulk of the magnet.\nExperimental evidence for these theoretical results is provided by analysis of\nelectronuclear modes in LiHoF$_4$, an archetypal dipolar quantum Ising\nmaterial, in a microwave resonator.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:16:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["McKenzie","Ryan",""]]}
{"id":"2308.14170","submitter":"Hao-Tian Liu","authors":"Hao-Tian Liu, Weipeng Chen, Jia-Xin Yin, Cai Liu, Wen Huang","title":"Diagnosing the possible chiral superconductivity in Sr$_2$RuO$_4$ and\n  beyond using supercurrent","comments":"7 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One approach to probe the still controversial superconductivity in\nSr$_2$RuO$_4$ is to apply external perturbations that break the underlying\ntetragonal crystalline symmetry. Chiral $p_x+ip_y$ and $d_{xz}+id_{yz}$ states\nrespond to such perturbations in ways that may help to distinguish them from\nother superconducting pairings. However, past experimental efforts along this\nline, using uniaxial strains and magnetic fields parallel to the RuO$_2$ plane,\nhave not been able to reach unambiguous conclusion. In this study, we propose\nto diagnose the possible chiral superconducting order in Sr$_2$RuO$_4$ using an\nalternative tetragonal-symmetry-breaking perturbation -- in-plane supercurrent.\nWe study the superconducting phase diagram as a function of both temperature\nand the applied supercurrent. Supercurrent generically splits the transition of\nthe two chiral order parameter components, and we show that the splitting can\ngive rise to visible specific heat anomalies. Furthermore, supercurrent\nparallel and anti-parallel to the unidirectional propagation of the chiral edge\nmodes impact the edge states in different manner. This difference manifests in\ntunneling spectrum, thereby providing an additional means to probe the\nchirality even when the related spontaneous edge current is vanishingly small.\nFinally, we discuss how supercurrent may help to identity other time-reversal\nsymmetry breaking superconducting states. Our proposal applies to other\ncandidate chiral superconductors.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:22:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Hao-Tian",""],["Chen","Weipeng",""],["Yin","Jia-Xin",""],["Liu","Cai",""],["Huang","Wen",""]]}
{"id":"2308.14171","submitter":"Thorben Kastenholz","authors":"Thorben Kastenholz","title":"Symplectic Groups, Mapping Class Groups and the Stability of Bounded\n  Cohomology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GR math.GT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Mapping class groups satisfy cohomological stability. In this note we show\nhow results by Bestvina and Fujiwara imply that the bounded cohomology does not\nstabilize, additionally we show that stabily polynomials in the\nMumford-Morita-Miller classes are unbounded i.e. their norm tends to infinity\nas one increases the genus. While the bounded cohomology of the symplectic\ngroup does stabilize, we show that it does not stabilize via isometries in\ndegree $2$. In order to establish this we calculate the norm of the signature\nclass in $\\mathrm{Sp}_{2h}(\\mathbb{R})$ and estimate the norm of the integral\nsignature class.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:26:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kastenholz","Thorben",""]]}
{"id":"2308.14172","submitter":"Bohan Tang","authors":"Bohan Tang, Siheng Chen, Xiaowen Dong","title":"Hypergraph Structure Inference From Data Under Smoothness Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SI eess.SP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hypergraphs are important for processing data with higher-order relationships\ninvolving more than two entities. In scenarios where explicit hypergraphs are\nnot readily available, it is desirable to infer a meaningful hypergraph\nstructure from the node features to capture the intrinsic relations within the\ndata. However, existing methods either adopt simple pre-defined rules that fail\nto precisely capture the distribution of the potential hypergraph structure, or\nlearn a mapping between hypergraph structures and node features but require a\nlarge amount of labelled data, i.e., pre-existing hypergraph structures, for\ntraining. Both restrict their applications in practical scenarios. To fill this\ngap, we propose a novel smoothness prior that enables us to design a method to\ninfer the probability for each potential hyperedge without labelled data as\nsupervision. The proposed prior indicates features of nodes in a hyperedge are\nhighly correlated by the features of the hyperedge containing them. We use this\nprior to derive the relation between the hypergraph structure and the node\nfeatures via probabilistic modelling. This allows us to develop an unsupervised\ninference method to estimate the probability for each potential hyperedge via\nsolving an optimisation problem that has an analytical solution. Experiments on\nboth synthetic and real-world data demonstrate that our method can learn\nmeaningful hypergraph structures from data more efficiently than existing\nhypergraph structure inference methods.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:28:58 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 16:57:35 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Tang","Bohan",""],["Chen","Siheng",""],["Dong","Xiaowen",""]]}
{"id":"2308.14173","submitter":"Trond Hjerpekj{\\o}n Haug","authors":"Trond Hjerpekj{\\o}n Haug, Anton Frisk Kockum and Rapha\\\"el Van Laer","title":"Quantum Resource States from Heralded Microwave-Optical Bell Pairs","comments":"8 pages (+7 pages in supplement) 3 Figures (+1 in supplement)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exploiting the strengths of different quantum hardware components may enhance\nthe capabilities of emerging quantum processors. Here, we propose and analyze a\nquantum architecture that leverages the networkability of optics, along with\nthe exquisite quantum control offered by superconducting circuits, to produce\nentangled photonic resource states. Contrary to previous proposals on\ndistributing entanglement between superconducting processors, we use\nentanglement between microwaves and optics to produce microwave-optical Bell\npairs in a dual-rail encoding from a single superconducting processor.\nMoreover, the superconducting processor allows us to deterministically entangle\nmicrowave-optical Bell pairs into larger cluster states, from which entangled\noptical photons can be extracted through measurements. Our scheme paves the way\nfor small superconducting processors to create photonic resource states for\nfault-tolerant fusion networks or cluster states. We expect that improved\nisolation of the superconducting processor from stray optical fields will allow\nthe scheme to be demonstrated using currently available hardware.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:30:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Haug","Trond Hjerpekj\u00f8n",""],["Kockum","Anton Frisk",""],["Van Laer","Rapha\u00ebl",""]]}
{"id":"2308.14174","submitter":"Subrata Mukherjee Mr","authors":"Vikash Kumar, Subrata Mukherjee and Somnath Sarangi","title":"Integrated Approach of Gearbox Fault Diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gearbox fault diagnosis is one of the most important parts in any industrial\nsystems. Failure of components inside gearbox can lead to a catastrophic\nfailure, uneven breakdown, and financial losses in industrial organization. In\nthat case intelligent maintenance of the gearbox comes into context. This paper\npresents an integrated gearbox fault diagnosis approach which can easily deploy\nin online condition monitoring. This work introduces a nonparametric data\npreprocessing technique i.e., calculus enhanced energy operator (CEEO) to\npreserve the characteristics frequencies in the noisy and inferred vibrational\nsignal. A set of time domain and spectral domain features are calculated from\nthe raw and CEEO vibration signal and inputted to the multiclass support vector\nmachine (MCSVM) to diagnose the faults on the system. An effective comparison\nbetween raw signal and CEEO signal are presented to show the impact of CEEO in\ngearbox fault diagnosis. The obtained results of this work look very promising\nand can be implemented in any type of industrial system due to its\nnonparametric nature.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:35:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kumar","Vikash",""],["Mukherjee","Subrata",""],["Sarangi","Somnath",""]]}
{"id":"2308.14175","submitter":"Enes Bektas","authors":"Enes Bektas and Fazli Can","title":"Leveraging Linear Independence of Component Classifiers: Optimizing Size\n  and Prediction Accuracy for Online Ensembles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensembles, which employ a set of classifiers to enhance classification\naccuracy collectively, are crucial in the era of big data. However, although\nthere is general agreement that the relation between ensemble size and its\nprediction accuracy, the exact nature of this relationship is still unknown. We\nintroduce a novel perspective, rooted in the linear independence of\nclassifier's votes, to analyze the interplay between ensemble size and\nprediction accuracy. This framework reveals a theoretical link, consequently\nproposing an ensemble size based on this relationship. Our study builds upon a\ngeometric framework and develops a series of theorems. These theorems clarify\nthe role of linear dependency in crafting ensembles. We present a method to\ndetermine the minimum ensemble size required to ensure a target probability of\nlinearly independent votes among component classifiers. Incorporating real and\nsynthetic datasets, our empirical results demonstrate a trend: increasing the\nnumber of classifiers enhances accuracy, as predicted by our theoretical\ninsights. However, we also identify a point of diminishing returns, beyond\nwhich additional classifiers provide diminishing improvements in accuracy.\nSurprisingly, the calculated ideal ensemble size deviates from empirical\nresults for certain datasets, emphasizing the influence of other factors. This\nstudy opens avenues for deeper investigations into the complex dynamics\ngoverning ensemble design and offers guidance for constructing efficient and\neffective ensembles in practical scenarios.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:38:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bektas","Enes",""],["Can","Fazli",""]]}
{"id":"2308.14176","submitter":"Dimitrios Kosmopoulos","authors":"Zvi Bern, Dimitrios Kosmopoulos, Andres Luna, Radu Roiban, Trevor\n  Scheopner, Fei Teng and Justin Vines","title":"Quantum Field Theory, Worldline Theory, and Spin Magnitude Change in\n  Orbital Evolution","comments":"95 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A previous paper (arxiv:2203.06202) identified a puzzle stemming from the\namplitudes-based approach to spinning bodies in general relativity: additional\nWilson coefficients appear compared to current worldline approaches to\nconservative dynamics of generic astrophysical objects, including neutron\nstars. In this paper we clarify the nature of analogous Wilson coefficients in\nthe simpler theory of electrodynamics. We analyze the original field-theory\nconstruction, identifying definite-spin states some of which have negative\nnorms, and relating the additional Wilson coefficients in the classical theory\nto transitions between different quantum spin states. We produce a new version\nof the theory which also has additional Wilson coefficients, but no\nnegative-norm states. We match, through $\\mathcal O(\\alpha^2)$ and $\\mathcal\nO(S^2)$, the Compton amplitudes of these field theories with those of a\nmodified worldline theory with extra degrees of freedom introduced by releasing\nthe spin supplementary condition. We build an effective two-body Hamiltonian\nthat matches the impulse and spin kick of the modified field theory and of the\nworldline theory, displaying additional Wilson coefficients compared to\nstandard worldline approaches. The results are then compactly expressed in\nterms of an eikonal formula. Our key conclusion is that, contrary to standard\napproaches, while the magnitude of the spin tensor is still conserved, the\nmagnitude of the spin vector can change under conserved Hamiltonian dynamics\nand this change is governed by the additional Wilson coefficients. For specific\nvalues of Wilson coefficients the results are equivalent to those from a\ndefinite spin obeying the spin supplementary condition, but for generic values\nthey are physically inequivalent. These results warrant detailed studies of the\ncorresponding issues in general relativity.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:38:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bern","Zvi",""],["Kosmopoulos","Dimitrios",""],["Luna","Andres",""],["Roiban","Radu",""],["Scheopner","Trevor",""],["Teng","Fei",""],["Vines","Justin",""]]}
{"id":"2308.14177","submitter":"Lin Geng Foo","authors":"Lin Geng Foo, Hossein Rahmani, Jun Liu","title":"AIGC for Various Data Modalities: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  AI-generated content (AIGC) methods aim to produce text, images, videos, 3D\nassets, and other media using AI algorithms. Due to its wide range of\napplications and the demonstrated potential of recent works, AIGC developments\nhave been attracting a lot of attention recently, and AIGC methods have been\ndeveloped for various data modalities, such as image, video, text, 3D shape (as\nvoxels, point clouds, meshes, and neural implicit fields), 3D scene, 3D human\navatar (body and head), 3D motion, and audio -- each presenting different\ncharacteristics and challenges. Furthermore, there have also been many\nsignificant developments in cross-modality AIGC methods, where generative\nmethods can receive conditioning input in one modality and produce outputs in\nanother. Examples include going from various modalities to image, video, 3D\nshape, 3D scene, 3D avatar (body and head), 3D motion (skeleton and avatar),\nand audio modalities. In this paper, we provide a comprehensive review of AIGC\nmethods across different data modalities, including both single-modal and\ncross-modality methods, highlighting the various challenges, representative\nworks, and recent technical directions in each setting. We also present\ncomparative results on several benchmark datasets in various modalities.\nMoreover, we also discuss the challenges and potential future research\ndirections.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:38:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Foo","Lin Geng",""],["Rahmani","Hossein",""],["Liu","Jun",""]]}
{"id":"2308.14178","submitter":"Yuning Jiang","authors":"Baiwei Guo and Yuning Jiang and Colin N. Jones and Giancarlo\n  Ferrari-Trecate","title":"Data-Driven Robust Control Using Prediction Error Bounds Based on\n  Perturbation Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  For linear systems, many data-driven control methods rely on the behavioral\nframework, using historical data of the system to predict the future\ntrajectories. However, measurement noise introduces errors in predictions. When\nthe noise is bounded, we propose a method for designing historical experiments\nthat enable the computation of an upper bound on the prediction error. This\napproach allows us to formulate a minimax control problem where robust\nconstraint satisfaction is enforced. We derive an upper bound on the\nsuboptimality gap of the resulting control input sequence compared to optimal\ncontrol utilizing accurate measurements. As demonstrated in numerical\nexperiments, the solution derived by our method can achieve constraint\nsatisfaction and a small suboptimality gap despite the measurement noise.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:45:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Baiwei",""],["Jiang","Yuning",""],["Jones","Colin N.",""],["Ferrari-Trecate","Giancarlo",""]]}
{"id":"2308.14179","submitter":"Aryaman Arora","authors":"Vedant Palit and Rohan Pandey and Aryaman Arora and Paul Pu Liang","title":"Towards Vision-Language Mechanistic Interpretability: A Causal Tracing\n  Tool for BLIP","comments":"Final version for 5th Workshop on Closing the Loop Between Vision and\n  Language (CLVL) @ ICCV 2023. 4 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mechanistic interpretability seeks to understand the neural mechanisms that\nenable specific behaviors in Large Language Models (LLMs) by leveraging\ncausality-based methods. While these approaches have identified neural circuits\nthat copy spans of text, capture factual knowledge, and more, they remain\nunusable for multimodal models since adapting these tools to the\nvision-language domain requires considerable architectural changes. In this\nwork, we adapt a unimodal causal tracing tool to BLIP to enable the study of\nthe neural mechanisms underlying image-conditioned text generation. We\ndemonstrate our approach on a visual question answering dataset, highlighting\nthe causal relevance of later layer representations for all tokens.\nFurthermore, we release our BLIP causal tracing tool as open source to enable\nfurther experimentation in vision-language mechanistic interpretability by the\ncommunity. Our code is available at\nhttps://github.com/vedantpalit/Towards-Vision-Language-Mechanistic-Interpretability.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:46:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Palit","Vedant",""],["Pandey","Rohan",""],["Arora","Aryaman",""],["Liang","Paul Pu",""]]}
{"id":"2308.14180","submitter":"Dongyeong Ko","authors":"Dongyeong Ko","title":"Min-max construction of two capillary embedded geodesics on Riemannian\n  $2$-disks","comments":"32 pages, comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we prove the existence of two capillary embedded geodesics\nwith a contact angle $\\theta \\in (0,\\pi/2)$ on Riemannian $2$-disks with\nstrictly convex boundary, where the absence of a simple closed geodesic loop\nbased on a point of boundary is given. In particular, our condition contains\nthe cases of Riemannian $2$-disks with strictly convex boundary, nonnegative\nGaussian curvature and total geodesic curvature lower bound $\\pi$ of the\nboundary. Moreover, by providing examples, we prove that our total geodesic\ncurvature condition is sharp to admit a capillary embedded geodesic with a\ncontact angle $\\theta \\in (0,\\pi/2)$ under the nonnegative interior Gaussian\ncurvature condition. We also prove the existence of Morse Index $1$ and $2$\ncapillary embedded geodesics for generic metric under the assumptions above.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 18:52:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ko","Dongyeong",""]]}
{"id":"2308.14181","submitter":"Zhining Liu","authors":"Zhining Liu, Zhichen Zeng, Ruizhong Qiu, Hyunsik Yoo, David Zhou, Zhe\n  Xu, Yada Zhu, Kommy Weldemariam, Jingrui He, Hanghang Tong","title":"Topological Augmentation for Class-Imbalanced Node Classification","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Class imbalance is prevalent in real-world node classification tasks and\noften biases graph learning models toward majority classes. Most existing\nstudies root from a node-centric perspective and aim to address the class\nimbalance in training data by node/class-wise reweighting or resampling. In\nthis paper, we approach the source of the class-imbalance bias from an\nunder-explored topology-centric perspective. Our investigation reveals that\nbeyond the inherently skewed training class distribution, the graph topology\nalso plays an important role in the formation of predictive bias: we identify\ntwo fundamental challenges, namely ambivalent and distant message-passing, that\ncan exacerbate the bias by aggravating majority-class over-generalization and\nminority-class misclassification. In light of these findings, we devise a\nlightweight topological augmentation method ToBA to dynamically rectify the\nnodes influenced by ambivalent/distant message-passing during graph learning,\nso as to mitigate the class-imbalance bias. We highlight that ToBA is a\nmodel-agnostic, efficient, and versatile solution that can be seamlessly\ncombined with and further boost other imbalance-handling techniques. Systematic\nexperiments validate the superior performance of ToBA in both promoting\nimbalanced node classification and mitigating the prediction bias between\ndifferent classes.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:01:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Zhining",""],["Zeng","Zhichen",""],["Qiu","Ruizhong",""],["Yoo","Hyunsik",""],["Zhou","David",""],["Xu","Zhe",""],["Zhu","Yada",""],["Weldemariam","Kommy",""],["He","Jingrui",""],["Tong","Hanghang",""]]}
{"id":"2308.14182","submitter":"Son The Nguyen","authors":"Son The Nguyen, Theja Tulabandhula","title":"Generative AI for Business Strategy: Using Foundation Models to Create\n  Business Strategy Tools","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generative models (foundation models) such as LLMs (large language models)\nare having a large impact on multiple fields. In this work, we propose the use\nof such models for business decision making. In particular, we combine\nunstructured textual data sources (e.g., news data) with multiple foundation\nmodels (namely, GPT4, transformer-based Named Entity Recognition (NER) models\nand Entailment-based Zero-shot Classifiers (ZSC)) to derive IT (information\ntechnology) artifacts in the form of a (sequence of) signed business networks.\nWe posit that such artifacts can inform business stakeholders about the state\nof the market and their own positioning as well as provide quantitative\ninsights into improving their future outlook.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:03:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen","Son The",""],["Tulabandhula","Theja",""]]}
{"id":"2308.14183","submitter":"Anna Pun","authors":"Zhanar Berikkyzy, Pamela E. Harris, Anna Pun, Catherine Yan, Chenchen\n  Zhao","title":"Combinatorial Identities for Vacillating Tableaux","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Vacillating tableaux are sequences of integer partitions that satisfy\nspecific conditions. The concept of vacillating tableaux stems from the\nrepresentation theory of the partition algebra and the combinatorial theory of\ncrossings and nestings of matchings and set partitions. In this paper, we\nfurther investigate the enumeration of vacillating tableaux and derive multiple\ncombinatorial identities and integer sequences relating to the number of\nvacillating tableaux, simplified vacillating tableaux, and limiting vacillating\ntableaux.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:13:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Berikkyzy","Zhanar",""],["Harris","Pamela E.",""],["Pun","Anna",""],["Yan","Catherine",""],["Zhao","Chenchen",""]]}
{"id":"2308.14184","submitter":"Maria Petropoulou","authors":"M. Petropoulou, A. Mastichiadis, G. Vasilopoulos, D. Paneque, J.\n  Becerra Gonz\\'alez, F. Zanias","title":"TeV pion bumps in the gamma-ray spectra of flaring blazars","comments":"10 pages, 7 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  (Abridged) Very high-energy (VHE, $E>100$ GeV) observations of the blazar Mrk\n501 with MAGIC in 2014 have provided evidence for an unusual narrow spectral\nfeature at about 3 TeV during an extreme X-ray flaring activity. The one-zone\nsynchrotron-self Compton scenario, widely used in blazar broadband spectral\nmodeling, fails to explain the narrow TeV component. Motivated by this rare\nobservation, we propose an alternative model for the production of narrow\nfeatures in the VHE spectra of flaring blazars. These spectral features may\nresult from the decay of neutral pions ($\\pi^0$ bumps) that are in turn\nproduced via interactions of protons (of tens of TeV energy) with energetic\nphotons, whose density increases during hard X-ray flares. We explore the\nconditions needed for the emergence of narrow $\\pi^0$ bumps in VHE blazar\nspectra during X-ray flares reaching synchrotron energies $\\sim100$ keV using\ntime-dependent radiative transfer calculations. We focus on high-synchrotron\npeaked (HSP) blazars, which consist the majority of VHE detected extragalactic\nsources. We find that synchrotron-dominated flares with peak energies\n$\\gtrsim100$ keV can be ideal periods for the search of $\\pi^0$ bumps in the\nVHE spectra of HSP blazars. Application of the model to the SED of Mrk 501 on\nMJD 56857.98 shows that the VHE spectrum of the flare is described well by the\nsum of an SSC component and a distinct $\\pi^0$ bump centered at 3 TeV. Spectral\nfitting of simulated SSC+$\\pi^0$ spectra for the Cherenkov Telescope Array\n(CTA) show that a $\\pi^0$ bump could be detected at a 5$\\sigma$ significance\nlevel with a 30-min exposure.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:20:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Petropoulou","M.",""],["Mastichiadis","A.",""],["Vasilopoulos","G.",""],["Paneque","D.",""],["Gonz\u00e1lez","J. Becerra",""],["Zanias","F.",""]]}
{"id":"2308.14185","submitter":"Paul Bilokon","authors":"Paul Alexander Bilokon and Maximilian Lucuta and Erez Shermer","title":"Semi-static Conditions in Low-latency C++ for High Frequency Trading:\n  Better than Branch Prediction Hints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PF cs.PL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conditional branches pose a challenge for code optimisation, particularly in\nlow latency settings. For better performance, processors leverage dedicated\nhardware to predict the outcome of a branch and execute the following\ninstructions speculatively, a powerful optimisation. Modern branch predictors\nemploy sophisticated algorithms and heuristics that utilise historical data and\npatterns to make predictions, and often, are extremely effective at doing so.\nConsequently, programmers may inadvertently underestimate the cost of\nmisprediction when benchmarking code with synthetic data that is either too\nshort or too predictable. While eliminating branches may not always be\nfeasible, C++20 introduced the [[likely]] and [[unlikely]] attributes that\nenable the compiler to perform spot optimisations on assembly code associated\nwith likely execution paths. Can we do better than this?\n  This work presents the development of a novel language construct, referred to\nas a semi-static condition, which enables programmers to dynamically modify the\ndirection of a branch at run-time by modifying the assembly code within the\nunderlying executable. Subsequently, we explore scenarios where the use of\nsemi-static conditions outperforms traditional conditional branching,\nhighlighting their potential applications in real-time machine learning and\nhigh-frequency trading. Throughout the development process, key considerations\nof performance, portability, syntax, and security were taken into account.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:21:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bilokon","Paul Alexander",""],["Lucuta","Maximilian",""],["Shermer","Erez",""]]}
{"id":"2308.14186","submitter":"Leonardo Ranaldi Mr","authors":"Leonardo Ranaldi, Giulia Pucci, Andre Freitas","title":"Empowering Cross-lingual Abilities of Instruction-tuned Large Language\n  Models by Translation-following demonstrations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The language ability of Large Language Models (LLMs) is often unbalanced\ntowards English because of the imbalance in the distribution of the\npre-training data. This disparity is demanded in further fine-tuning and\naffecting the cross-lingual abilities of LLMs. In this paper, we propose to\nempower Instructiontuned LLMs (It-LLMs) in languages other than English by\nbuilding semantic alignment between them. Hence, we propose CrossAlpaca, an\nIt-LLM with cross-lingual instruction-following and Translation-following\ndemonstrations to improve semantic alignment between languages. We validate our\napproach on the multilingual Question Answering (QA) benchmarks XQUAD and MLQA\nand adapted versions of MMLU and BBH. Our models, tested over six different\nlanguages, outperform the It-LLMs tuned on monolingual data. The final results\nshow that instruction tuning on non-English data is not enough and that\nsemantic alignment can be further improved by Translation-following\ndemonstrations.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:22:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ranaldi","Leonardo",""],["Pucci","Giulia",""],["Freitas","Andre",""]]}
{"id":"2308.14187","submitter":"Ivo Mihov","authors":"Ivo S. Mihov and Nikolay V. Vitanov","title":"Defying Conventional Wisdom in Spectroscopy: Power Narrowing on IBM\n  Quantum","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Power broadening $-$ the broadening of the spectral line profile of a\ntwo-state quantum transition as the amplitude of the driving field increases\n$-$ is a well-known and thoroughly examined phenomenon in spectroscopy. It\ntypically occurs in continuous-wave driving when the intensity of the radiation\nfield increases beyond the saturation intensity of the transition. In\npulsed-field excitation, linear power broadening occurs for a pulse of\nrectangular temporal shape. Pulses with smooth shapes are known to exhibit much\nless power broadening, e.g. logarithmic for a Gaussian pulse shape. It has been\npredicted, but never experimentally verified, that pulse shapes which vanish in\ntime as $\\sim |t|^{-\\lambda}$ should exhibit the opposite effect $-$ power\nnarrowing $-$ in which the post-pulse transition line width decreases as the\namplitude of the driving pulse increases. In this work, power narrowing is\ndemonstrated experimentally for a class of powers-of-Lorentzian pulse shapes on\nthe IBM Quantum processor ibmq_manila. Reduction of the line width by a factor\nof over 10 is observed when increasing the pulse area from $\\pi$ to $7\\pi$, in\na complete reversal of the power broadening paradigm. Moreover, thorough\ntheoretical and experimental study is conducted on the truncation of the pulse\nwings which introduces a (small) power-broadened term which prevents power\nnarrowing from reaching extreme values $-$ a hitherto unknown cut-off\nbroadening effect for which an explicit analytical formula is derived. In the\nabsence of other power broadening mechanisms, Lorentzian pulses truncated at\nsufficiently small values can achieve as narrow line profiles as desired.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:29:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mihov","Ivo S.",""],["Vitanov","Nikolay V.",""]]}
{"id":"2308.14188","submitter":"Zecheng Zhang","authors":"Zecheng Zhang, Christian Moya, Wing Tat Leung, Guang Lin, Hayden\n  Schaeffer","title":"Bayesian deep operator learning for homogenized to fine-scale maps for\n  multiscale PDE","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new framework for computing fine-scale solutions of multiscale\nPartial Differential Equations (PDEs) using operator learning tools. Obtaining\nfine-scale solutions of multiscale PDEs can be challenging, but there are many\ninexpensive computational methods for obtaining coarse-scale solutions.\nAdditionally, in many real-world applications, fine-scale solutions can only be\nobserved at a limited number of locations. In order to obtain approximations or\npredictions of fine-scale solutions over general regions of interest, we\npropose to learn the operator mapping from coarse-scale solutions to fine-scale\nsolutions using a limited number (and possibly noisy) observations of the\nfine-scale solutions. The approach is to train multi-fidelity homogenization\nmaps using mathematically motivated neural operators. The operator learning\nframework can efficiently obtain the solution of multiscale PDEs at any\narbitrary point, making our proposed framework a mesh-free solver. We verify\nour results on multiple numerical examples showing that our approach is an\nefficient mesh-free solver for multiscale PDEs.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:36:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Zecheng",""],["Moya","Christian",""],["Leung","Wing Tat",""],["Lin","Guang",""],["Schaeffer","Hayden",""]]}
{"id":"2308.14189","submitter":"Ginestra Bianconi","authors":"Sanjukta Krishnagopal, Ginestra Bianconi","title":"Topology and dynamics of higher-order multiplex networks","comments":"(31 pages, 7 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO cond-mat.dis-nn cs.SI physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Higher-order networks are gaining growing attention as they encode for the\nmany-body interactions present in complex systems. However, higher-order\nnetworks have the limitation that they only capture many-body interactions of\nthe same type. To tackle this challenge, here we provide a mathematical\nframework to capture the topology of higher-order multiplex networks and the\ninterplay between their topology and higher-order dynamics. In particular we\nfocus on diffusion of topological signals sustained not only by the nodes, but\nalso by the links, and the higher-dimensional simplices of multiplex simplicial\ncomplexes. We exploit the ubiquitous presence of the overlap of the simplices\nfor coupling the dynamics among the multiplex layers providing a definition of\nmultiplex Hodge Laplacians and Dirac operators. The spectral properties of\nthese operators are shown to determine the higher-order diffusion on the\nhigher-order multiplex networks, and encode for the multiplex Betti numbers.\nFinally, our numerical investigation of the spectral properties of synthetic\nand real (connectome and microbiome) multiplex simplicial complexes shows\nevidence that the coupling between the layers can either speed up or slow down\nthe higher-order diffusion of topological signals. This mathematical framework\nis very general and can be applied to study generic higher-order systems with\ninteractions of multiple types. In particular, these results might find\napplications in brain networks which are understood to be both multilayer and\nhigher-order.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:42:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Krishnagopal","Sanjukta",""],["Bianconi","Ginestra",""]]}
{"id":"2308.14190","submitter":"Imraj Singh","authors":"Imraj RD Singh, Alexander Denker, Riccardo Barbano, \\v{Z}eljko Kereta,\n  Bangti Jin, Kris Thielemans, Peter Maass, Simon Arridge","title":"Score-Based Generative Models for PET Image Reconstruction","comments":"35 pages, 16 figures, submitted to Journal of Machine Learning for\n  Biomedical Imaging (MELBA)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Score-based generative models have demonstrated highly promising results for\nmedical image reconstruction tasks in magnetic resonance imaging or computed\ntomography. However, their application to Positron Emission Tomography (PET) is\nstill largely unexplored. PET image reconstruction involves a variety of\nchallenges, including Poisson noise with high variance and a wide dynamic\nrange. To address these challenges, we propose several PET-specific adaptations\nof score-based generative models. The proposed framework is developed for both\n2D and 3D PET. In addition, we provide an extension to guided reconstruction\nusing magnetic resonance images. We validate the approach through extensive 2D\nand 3D $\\textit{in-silico}$ experiments with a model trained on\npatient-realistic data without lesions, and evaluate on data without lesions as\nwell as out-of-distribution data with lesions. This demonstrates the proposed\nmethod's robustness and significant potential for improved PET reconstruction.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:43:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Singh","Imraj RD",""],["Denker","Alexander",""],["Barbano","Riccardo",""],["Kereta","\u017deljko",""],["Jin","Bangti",""],["Thielemans","Kris",""],["Maass","Peter",""],["Arridge","Simon",""]]}
{"id":"2308.14191","submitter":"Zhiyu Qu","authors":"Zhiyu Qu and Tao Xiang and Yi-Zhe Song","title":"SketchDreamer: Interactive Text-Augmented Creative Sketch Ideation","comments":"BMVC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial Intelligence Generated Content (AIGC) has shown remarkable\nprogress in generating realistic images. However, in this paper, we take a step\n\"backward\" and address AIGC for the most rudimentary visual modality of human\nsketches. Our objective is on the creative nature of sketches, and that\ncreative sketching should take the form of an interactive process. We further\nenable text to drive the sketch ideation process, allowing creativity to be\nfreely defined, while simultaneously tackling the challenge of \"I can't\nsketch\". We present a method to generate controlled sketches using a\ntext-conditioned diffusion model trained on pixel representations of images.\nOur proposed approach, referred to as SketchDreamer, integrates a\ndifferentiable rasteriser of Bezier curves that optimises an initial input to\ndistil abstract semantic knowledge from a pretrained diffusion model. We\nutilise Score Distillation Sampling to learn a sketch that aligns with a given\ncaption, which importantly enable both text and sketch to interact with the\nideation process. Our objective is to empower non-professional users to create\nsketches and, through a series of optimisation processes, transform a narrative\ninto a storyboard by expanding the text prompt while making minor adjustments\nto the sketch input. Through this work, we hope to aspire the way we create\nvisual content, democratise the creative process, and inspire further research\nin enhancing human creativity in AIGC. The code is available at\n\\url{https://github.com/WinKawaks/SketchDreamer}.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:44:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Qu","Zhiyu",""],["Xiang","Tao",""],["Song","Yi-Zhe",""]]}
{"id":"2308.14192","submitter":"Dmitry A. Pasechnyuk","authors":"Dmitrii A. Pasechnyuk, Alexander Gasnikov, Martin Tak\\'a\\v{c}","title":"Convergence analysis of stochastic gradient descent with adaptive\n  preconditioning for non-convex and convex functions","comments":"12 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Preconditioning is a crucial operation in gradient-based numerical\noptimisation. It helps decrease the local condition number of a function by\nappropriately transforming its gradient. For a convex function, where the\ngradient can be computed exactly, the optimal linear transformation corresponds\nto the inverse of the Hessian operator, while the optimal convex transformation\nis the convex conjugate of the function. Different conditions result in\nvariations of these dependencies. Practical algorithms often employ low-rank or\nstochastic approximations of the inverse Hessian matrix for preconditioning.\nHowever, theoretical guarantees for these algorithms typically lack a\njustification for the defining property of preconditioning. This paper presents\na simple theoretical framework that demonstrates, given a smooth function and\nan available unbiased stochastic approximation of its gradient, that it is\npossible to refine the dependency of the convergence rate on the Lipschitz\nconstant of the gradient.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:52:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pasechnyuk","Dmitrii A.",""],["Gasnikov","Alexander",""],["Tak\u00e1\u010d","Martin",""]]}
{"id":"2308.14193","submitter":"Vinh Huy Khoa Vu Mr.","authors":"Pham Duy Khanh, Vu Vinh Huy Khoa, Boris S. Mordukhovich, Vo Thanh Phat","title":"Local Maximal Monotonicity in Variational Analysis and Optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The paper is devoted to a systematic study and characterizations of notions\nof local maximal monotonicity and their strong counterparts for set-valued\noperators that appear in variational analysis, optimization, and their\napplications. We obtain novel resolvent characterizations of these notions\ntogether with efficient conditions for their preservation under summation in\nbroad infinite-dimensional settings. Further characterizations of these notions\nare derived by using generalized differentiation of variational analysis in the\nframework of Hilbert spaces.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:05:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khanh","Pham Duy",""],["Khoa","Vu Vinh Huy",""],["Mordukhovich","Boris S.",""],["Phat","Vo Thanh",""]]}
{"id":"2308.14194","submitter":"Bogdan Markovych Prof.","authors":"P. Kostrobij, B. Markovych, I. Ryzha, M. Tokarchuk","title":"Generalized equations of hydrodynamics in fractional derivatives","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a general approach for obtaining the generalized transport\nequations with fractional derivatives using the Liouville equation with\nfractional derivatives for a system of classical particles and the Zubarev\nnon-equilibrium statistical operator (NSO) method within the Gibbs statistics.\nWe obtain the non-Markov equations of hydrodynamics for the non-equilibrium\naverage values of densities of particle number, momentum and energy of liquid\nin a spatially heterogeneous medium with a fractal structure. For isothermal\nprocesses ($\\beta=1/k_{B}T =const$), the non-Markov Navier-Stokes equation in\nfractional derivatives is obtained. We consider models for the frequency\ndependence of memory function (viscosity), which lead to the Navier-Stokes\nequations in fractional derivatives in space and time.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:08:40 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:13:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kostrobij","P.",""],["Markovych","B.",""],["Ryzha","I.",""],["Tokarchuk","M.",""]]}
{"id":"2308.14195","submitter":"Marius M{\\ae}hlum Halvorsen","authors":"Marius M{\\ae}hlum Halvorsen, Victor Coco, Paula Collins, Heidi\n  Sandaker, Lucia Romano","title":"Fabrication of a Silicon Electron Multiplier sensor using Metal Assisted\n  Chemical Etching and its characterisation","comments":"9 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Silicon Electron Multiplier (SiEM) sensor is a novel sensor concept that\nenables charge multiplication by high electric fields generated by embedded\nmetal electrodes within the sensor bulk. Metal assisted chemical etching\n(MacEtch) in gas phase with platinum as a catalyst has been used to fabricate\ntest structures consisting of vertically aligned silicon pillars and strips on\ntop of a silicon bulk. The pillars exceed 10 $\\mu m$ in height with a diameter\nof 1.0 $\\mu m$ and are arranged as a hexagonal lattice with a pitch of 1.5 $\\mu\nm$. Electrical characterisations through current $-$ voltage measurements\ninside a scanning electron microscope and a climate chamber have demonstrated\nthat the MacEtch process is compatible with active media and p-n junctions.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:11:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Halvorsen","Marius M\u00e6hlum",""],["Coco","Victor",""],["Collins","Paula",""],["Sandaker","Heidi",""],["Romano","Lucia",""]]}
{"id":"2308.14196","submitter":"Victor Aguirregabiria","authors":"Victor Aguirregabiria, Alessandro Iaria, Senay Sokullu","title":"Identification and Estimation of Demand Models with Endogenous Product\n  Entry and Exit","comments":"39 pages, 1 figure, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper deals with the endogeneity of firms' entry and exit decisions in\ndemand estimation. Product entry decisions lack a single crossing property in\nterms of demand unobservables, which causes the inconsistency of conventional\nmethods dealing with selection. We present a novel and straightforward two-step\napproach to estimate demand while addressing endogenous product entry. In the\nfirst step, our method estimates a finite mixture model of product entry\naccommodating latent market types. In the second step, it estimates demand\ncontrolling for the propensity scores of all latent market types. We apply this\napproach to data from the airline industry.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:13:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aguirregabiria","Victor",""],["Iaria","Alessandro",""],["Sokullu","Senay",""]]}
{"id":"2308.14197","submitter":"Peter Blanchard","authors":"Peter K. Blanchard, V. Ashley Villar, Ryan Chornock, Tanmoy Laskar,\n  Yijia Li, Joel Leja, Justin Pierel, Edo Berger, Raffaella Margutti, Kate D.\n  Alexander, Jennifer Barnes, Yvette Cendes, Tarraneh Eftekhari, Daniel Kasen,\n  Natalie LeBaron, Brian D. Metzger, James Muzerolle Page, Armin Rest, Huei\n  Sears, Daniel M. Siegel, and S. Karthik Yadavalli","title":"JWST Observations of the Extraordinary GRB 221009A Reveal an Ordinary\n  Supernova Without Signs of $r$-Process Enrichment in a Low-Metallicity Galaxy","comments":"32 pages, 14 Figures, Submitted to Nature Astronomy","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Identifying the astrophysical sites of the $r$-process, one of the primary\nmechanisms by which heavy elements are formed, is a key goal of modern\nastrophysics. The discovery of the brightest gamma-ray burst of all time, GRB\n221009A, at a relatively nearby redshift, presented the first opportunity to\nspectroscopically test the idea that $r$-process elements are produced\nfollowing the collapse of rapidly rotating massive stars. Here we present\nspectroscopic and photometric $\\textit{James Webb Space Telescope}$ (JWST)\nobservations of GRB 221009A obtained $+168$ and $+170$ rest-frame days after\nthe initial gamma-ray trigger, and demonstrate they are well-described by a\nsupernova (SN) and power-law afterglow, with no evidence for an additional\ncomponent from $r$-process emission, and that the SN component strongly\nresembles the near-infrared spectra of previous SNe, including SN 1998bw. We\nfurther find that the SN associated with GRB 221009A is slightly fainter than\nthe expected brightness of SN 1998bw at this phase, concluding that the SN is\ntherefore not an unusual GRB-SN. We infer a nickel mass of $\\approx0.09$\nM$_{\\odot}$, consistent with the lack of an obvious SN detection in the\nearly-time data. We find that the host galaxy of GRB 221009A has a very low\nmetallicity of $\\approx0.12$ Z$_{\\odot}$ and our resolved host spectrum shows\nthat GRB 221009A occurred in a unique environment in its host characterized by\nstrong H$_2$ emission lines consistent with recent star formation, which may\nhint at environmental factors being responsible for its extreme energetics.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:18:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Blanchard","Peter K.",""],["Villar","V. Ashley",""],["Chornock","Ryan",""],["Laskar","Tanmoy",""],["Li","Yijia",""],["Leja","Joel",""],["Pierel","Justin",""],["Berger","Edo",""],["Margutti","Raffaella",""],["Alexander","Kate D.",""],["Barnes","Jennifer",""],["Cendes","Yvette",""],["Eftekhari","Tarraneh",""],["Kasen","Daniel",""],["LeBaron","Natalie",""],["Metzger","Brian D.",""],["Page","James Muzerolle",""],["Rest","Armin",""],["Sears","Huei",""],["Siegel","Daniel M.",""],["Yadavalli","S. Karthik",""]]}
{"id":"2308.14198","submitter":"Adam Afandi","authors":"Adam Afandi","title":"Stationary Descendents and the Discriminant Modular Form","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The generating functions of stationary descendent Gromov-Witten invariants of\nan elliptic curve are known to be Fourier expansions of quasimodular forms.\nWhen one restricts to the subspace of forms of a fixed weight $k$, there is an\nabundance of linear relations among these generating functions. This naturally\nleads one to study the resulting linear matroid, which we refer to as the\ndescendent matroid of weight $k$. In the case of weight 12, we use this matroid\nto compute and organize all of the ways to express the discriminant modular\nform in terms of stationary descendents. As a consequence, we find a\nclosed-form expression of Ramanujan tau values in terms of Gromov-Witten\ninvariants of an elliptic curve. All computations were aided with the use of\nSage, and the classes and functions written in Sage are discussed in the\nappendix.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:21:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Afandi","Adam",""]]}
{"id":"2308.14199","submitter":"Walid Saba","authors":"Walid S. Saba","title":"Symbolic and Language Agnostic Large Language Models","comments":"4 pages - draft. arXiv admin note: substantial text overlap with\n  arXiv:2306.00017","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We argue that the relative success of large language models (LLMs) is not a\nreflection on the symbolic vs. subsymbolic debate but a reflection on employing\nan appropriate strategy of bottom-up reverse engineering of language at scale.\nHowever, due to the subsymbolic nature of these models whatever knowledge these\nsystems acquire about language will always be buried in millions of\nmicrofeatures (weights) none of which is meaningful on its own. Moreover, and\ndue to their stochastic nature, these models will often fail in capturing\nvarious inferential aspects that are prevalent in natural language. What we\nsuggest here is employing the successful bottom-up strategy in a symbolic\nsetting, producing symbolic, language agnostic and ontologically grounded large\nlanguage models.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:24:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Saba","Walid S.",""]]}
{"id":"2308.14200","submitter":"Diana Barseghyan","authors":"Juan Bory Reyes, Baruch Schneider, Diana Schneiderova (Barseghyan)","title":"Magnetic Schr\\\"{o}dinger operator with the potential supported in a\n  curved two-dimensional strip","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP math.FA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider the magnetic Schr\\\"odinger operator $H=(i \\nabla +A)^2- V$ with a\nnon-negative potential $V$ supported over a strip which is a local deformation\nof a straight one, and the magnetic field $B:=\\mathrm{rot}(A)$ is assumed to be\nnonzero and local. We show that the magnetic field does not change the\nessential spectrum of this system, and investigate a sufficient condition for\nthe discrete spectrum of $H$ to be empty.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:26:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Reyes","Juan Bory","","Barseghyan"],["Schneider","Baruch","","Barseghyan"],["Schneiderova","Diana","","Barseghyan"]]}
{"id":"2308.14201","submitter":"Yunhua Ding","authors":"Ariam J. Acevedo-Lopez, Yunhua Ding, Kaito Iwasaki, Arnaldo J. Vargas","title":"Lorentz- and CPT-violating effects in Penning traps at linear boost","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present in this work an analysis of Lorentz- and CPT-violating signals at\nlinear boost order in Penning-trap experiments. The theory of quantum\nelectrodynamics with Penning traps is revisited and the dominant shifts in the\ncyclotron and anomaly frequencies of confined particles and antiparticles are\nreproduced. To study time variations of the experimental signals at linear\nboost order, we provide a general discussion on transformations of coefficients\nfor Lorentz violation between different frames, and derive the expressions of\nthe cyclotron and anomaly frequency shifts in the Sun-centered frame. Relating\nthese frequency shifts to the charge-to-mass ratios, the $g$ factors, and their\ncomparisons between particles and antiparticles, we extract numerous new or\nimproved bounds on coefficients for Lorentz violation from existing\nPenning-trap measurements.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:34:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Acevedo-Lopez","Ariam J.",""],["Ding","Yunhua",""],["Iwasaki","Kaito",""],["Vargas","Arnaldo J.",""]]}
{"id":"2308.14202","submitter":"Wade Hindes","authors":"Wade Hindes, Reiyah Jacobs, Benjamin Keller, Albert Kim, Peter Ye,\n  Aaron Zhou","title":"On the proportion of irreducible polynomials in unicritically generated\n  semigroups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $p$ be a prime number and let $S=\\{x^p+c_1,\\dots,x^p+c_r\\}$ be a finite\nset of unicritical polynomials for some $c_1,\\dots,c_r\\in\\mathbb{Z}$. Moreover,\nassume that $S$ contains at least one irreducible polynomial over $\\mathbb{Q}$.\nThen we construct a large, explicit subset of irreducible polynomials within\nthe semigroup generated by $S$ under composition; in fact, we show that this\nsubset has positive asymptotic density within the full semigroup when we count\npolynomials by degree. In addition, when $p=2$ or $3$ we construct an infinite\nfamily of semigroups that break the local-global principle for irreducibility.\nTo do this, we use a mix of algebraic and arithmetic techniques and results,\nincluding Runge's method, the elliptic curve Chabauty method, and Fermat's Last\nTheorem.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 20:58:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hindes","Wade",""],["Jacobs","Reiyah",""],["Keller","Benjamin",""],["Kim","Albert",""],["Ye","Peter",""],["Zhou","Aaron",""]]}
{"id":"2308.14203","submitter":"Claudio Afeltra","authors":"Claudio Afeltra","title":"Rectifiability of sets of solutions of first order systems of partial\n  differential equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We find sufficient conditions on a set\n$\\mathscr{M}\\subset\\mathbf{R}^n\\times\\mathscr{L}(\\mathbf{R}^n,\\mathbf{R}^m)$\nensuring that the set of functions such that $(F(x),DF(x))\\in\\mathscr{M}$ is\nrectifiable. We also prove a more general version in which the set to which\n$DF(x)$ is costrained can depend also on $F(x))$, and show the relation with\nsome classical rigidity statements such as Liouville's theorem on conformal\nmaps\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:04:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Afeltra","Claudio",""]]}
{"id":"2308.14204","submitter":"Wolfgang Schmaltz","authors":"Wolfgang Schmaltz","title":"Pseudocycle Gromov-Witten invariants are a strict subset of polyfold\n  Gromov-Witten invariants","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a semipositive symplectic manifold, we prove that the pseudocycle\ngenus-zero Gromov-Witten invariants are equal to the polyfold genus-zero\nGromov-Witten invariants.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:08:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Schmaltz","Wolfgang",""]]}
{"id":"2308.14205","submitter":"Yuval Hovannes Khachatryan-Raziel","authors":"Yuval Khachatryan-Raziel","title":"Schur-Positive sets","comments":"Yuval Khachatryan-Raziels' PhD Thesis Bar-Ilan University 2021","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this thesis we prove Schur-positivity of certain graph families. In\naddition, we exlpor existence of cyclic descent extensions on several families\nof Schur-positive sets.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:09:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Khachatryan-Raziel","Yuval",""]]}
{"id":"2308.14206","submitter":"Matthias Mayr","authors":"Matthias Mayr, Faseeh Ahmad, Alexander Duerr, Volker Krueger","title":"Using Knowledge Representation and Task Planning for Robot-agnostic\n  Skills on the Example of Contact-Rich Wiping Tasks","comments":"7 pages, 5 figures. Accepted at 2023 IEEE International Conference on\n  Automation Science and Engineering (CASE)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The transition to agile manufacturing, Industry 4.0, and high-mix-low-volume\ntasks require robot programming solutions that are flexible. However, most\ndeployed robot solutions are still statically programmed and use stiff position\ncontrol, which limit their usefulness. In this paper, we show how a single\nrobot skill that utilizes knowledge representation, task planning, and\nautomatic selection of skill implementations based on the input parameters can\nbe executed in different contexts. We demonstrate how the skill-based control\nplatform enables this with contact-rich wiping tasks on different robot\nsystems. To achieve that in this case study, our approach needs to address\ndifferent kinematics, gripper types, vendors, and fundamentally different\ncontrol interfaces. We conducted the experiments with a mobile platform that\nhas a Universal Robots UR5e 6 degree-of-freedom robot arm with position control\nand a 7 degree-of-freedom KUKA iiwa with torque control.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:17:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mayr","Matthias",""],["Ahmad","Faseeh",""],["Duerr","Alexander",""],["Krueger","Volker",""]]}
{"id":"2308.14207","submitter":"Xinhui Li","authors":"Yujia Xie, Xinhui Li, Vince D. Calhoun","title":"Predictive Sparse Manifold Transform","comments":"Paper presented at the 1st Workshop on High-dimensional Learning\n  Dynamics (HLD) at the 40th International Conference on Machine Learning\n  (ICML) 2023, Honolulu, Hawaii, USA\n  (https://sites.google.com/view/hidimlearning), 10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present Predictive Sparse Manifold Transform (PSMT), a minimalistic,\ninterpretable and biologically plausible framework for learning and predicting\nnatural dynamics. PSMT incorporates two layers where the first sparse coding\nlayer represents the input sequence as sparse coefficients over an overcomplete\ndictionary and the second manifold learning layer learns a geometric embedding\nspace that captures topological similarity and dynamic temporal linearity in\nsparse coefficients. We apply PSMT on a natural video dataset and evaluate the\nreconstruction performance with respect to contextual variability, the number\nof sparse coding basis functions and training samples. We then interpret the\ndynamic topological organization in the embedding space. We next utilize PSMT\nto predict future frames compared with two baseline methods with a static\nembedding space. We demonstrate that PSMT with a dynamic embedding space can\nachieve better prediction performance compared to static baselines. Our work\nestablishes that PSMT is an efficient unsupervised generative framework for\nprediction of future visual stimuli.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:25:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xie","Yujia",""],["Li","Xinhui",""],["Calhoun","Vince D.",""]]}
{"id":"2308.14208","submitter":"Colleen Robichaux","authors":"Colleen Robichaux","title":"Castelnuovo-Mumford regularity for $321$-avoiding Kazhdan-Lusztig\n  varieties","comments":"23 pages, an extended abstract of this paper appears in FPSAC 2023\n  conference proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce an algorithm which combinatorially computes the\nCastelnuovo-Mumford regularity of 321-avoiding Kazhdan-Lusztig varieties using\nexcited diagrams. This extends earlier work of Rajchgot, Weigandt, and the\nauthor (2022) which computes the regularity of Grassmannian Kazhdan-Lusztig\nvarieties. Our results specialize to compute the regularity of all two-sided\nmixed ladder determinantal varieties in terms of lattice paths.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:29:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Robichaux","Colleen",""]]}
{"id":"2308.14209","submitter":"Grigory Ryabov","authors":"Grigory Ryabov","title":"On schurity of the dihedral group $\\boldsymbol{D_{2p}}$","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A finite group $G$ is called a Schur group if every $S$-ring over $G$ is\nschurian, i.e. associated in a natural way with a subgroup of $Sym(G)$ that\ncontains all right translations. One of the crucial open questions in the\n$S$-ring theory is the question on existence of an infinite family of\nnonabelian Schur groups. We prove that the dihedral group of order $2p$, where\n$p$ is a Fermat prime or prime of the form $p=4q+1$, where $q$ is also prime,\nis Schur. Towards this result, we prove nonexistence of a difference set in the\ncyclic group of order $p\\neq 13$ and classify all $S$-rings over some dihedral\ngroups.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:32:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ryabov","Grigory",""]]}
{"id":"2308.14210","submitter":"Ivan Gonoskov","authors":"Ivan Gonoskov","title":"Compact-form solution to the time-dependent Schr\\\"odinger equation with\n  an arbitrary potential","comments":"21 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.AP math.CO math.MP math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain exact solutions to the class of parabolic partial differential\nequations of arbitrary dimensionality and with arbitrary potentials. The\nsolutions are presented in a compact-form: as explicit mathematical expressions\nconsisting of finite number of standard mathematical operations with finite\n(condition-independent) number of variables in a discrete or continous region\nof consideration. The general approach to obtain the compact-form solutions\ncombines a number of methods in the fields of partial differential equations,\nenumerative combinatorics, and number theory, which we describe in detail. We\ndiscuss their advantages and perspectives for the various fields in physics,\nmathematics, and advanced calculus.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 21:43:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gonoskov","Ivan",""]]}
{"id":"2308.14211","submitter":"Yasaman Abedini","authors":"Yasaman Abedini and Abbas Heydarnoori","title":"Can GitHub Issues Help in the App Review Classifications?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  App reviews reflect various user requirements that can aid in planning\nmaintenance tasks. Recently, proposed approaches for automatically classifying\nuser reviews rely on machine learning algorithms. Devine et al. demonstrated\nthat models trained on existing labeled datasets exhibit poor performance when\npredicting new ones. Although integrating datasets improves the results to some\nextent, there is still a need for greater generalizability to be taken into\nconsideration. Therefore, a comprehensive labeled dataset is essential to train\na more precise model. This paper introduces an approach to train a more\ngeneralizable model by leveraging information from an additional source, such\nas the GitHub issue tracking system, that contains valuable information about\nuser requirements. We propose an approach that assists in augmenting labeled\ndatasets by utilizing information extracted from GitHub issues. First, we\nidentify issues concerning review intentions (bug reports, feature requests,\nand others) by examining the issue labels. Then, we analyze issue bodies and\ndefine 19 language patterns for extracting targeted information. Finally, we\naugment the manually labeled review dataset with a subset of processed issues\nthrough the Within-App, Within-Context, and Between-App Analysis methods. The\nfirst two methods train the app-specific models, and the last suits the\ngeneral-purpose models. We conducted several experiments to evaluate the\nproposed approach. Our results demonstrate that using labeled issues for data\naugmentation can improve the F1-score and recall to 13.9 and 29.9 in the bug\nreports, respectively, and to 7.5 and 13.5 for feature requests. Furthermore,\nwe identify an effective volume range of 0.3 to 0.7, which provides better\nperformance improvements.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:01:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Abedini","Yasaman",""],["Heydarnoori","Abbas",""]]}
{"id":"2308.14212","submitter":"Santosh Sanjeev Mr.","authors":"Sanoojan Baliah, Fadillah A. Maani, Santosh Sanjeev and Muhammad Haris\n  Khan","title":"Exploring the Transfer Learning Capabilities of CLIP in Domain\n  Generalization for Diabetic Retinopathy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Diabetic Retinopathy (DR), a leading cause of vision impairment, requires\nearly detection and treatment. Developing robust AI models for DR\nclassification holds substantial potential, but a key challenge is ensuring\ntheir generalization in unfamiliar domains with varying data distributions. To\naddress this, our paper investigates cross-domain generalization, also known as\ndomain generalization (DG), within the context of DR classification. DG, a\nchallenging problem in the medical domain, is complicated by the difficulty of\ngathering labeled data across different domains, such as patient demographics\nand disease stages. Some recent studies have shown the effectiveness of using\nCLIP to handle the DG problem in natural images. In this study, we investigate\nCLIP's transfer learning capabilities and its potential for cross-domain\ngeneralization in diabetic retinopathy (DR) classification. We carry out\ncomprehensive experiments to assess the efficacy and potential of CLIP in\naddressing DG for DR classification. Further, we introduce a multi-modal\nfine-tuning strategy named Context Optimization with Learnable Visual Tokens\n(CoOpLVT), which enhances context optimization by conditioning on visual\nfeatures. Our findings demonstrate that the proposed method increases the\nF1-score by 1.8% over the baseline, thus underlining its promise for effective\nDG in DR classification. Our code is publicly available at\nhttps://github.com/Sanoojan/CLIP-DRDG.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:02:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Baliah","Sanoojan",""],["Maani","Fadillah A.",""],["Sanjeev","Santosh",""],["Khan","Muhammad Haris",""]]}
{"id":"2308.14213","submitter":"Aleksandar Vakanski","authors":"Mohammad Karimzadeh, Aleksandar Vakanski, Min Xian, Boyu Zhang","title":"Post-Hoc Explainability of BI-RADS Descriptors in a Multi-task Framework\n  for Breast Cancer Detection and Segmentation","comments":"11 pages, 5 figures. Published at 2023 IEEE Workshop on MLSP","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite recent medical advancements, breast cancer remains one of the most\nprevalent and deadly diseases among women. Although machine learning-based\nComputer-Aided Diagnosis (CAD) systems have shown potential to assist\nradiologists in analyzing medical images, the opaque nature of the\nbest-performing CAD systems has raised concerns about their trustworthiness and\ninterpretability. This paper proposes MT-BI-RADS, a novel explainable deep\nlearning approach for tumor detection in Breast Ultrasound (BUS) images. The\napproach offers three levels of explanations to enable radiologists to\ncomprehend the decision-making process in predicting tumor malignancy. Firstly,\nthe proposed model outputs the BI-RADS categories used for BUS image analysis\nby radiologists. Secondly, the model employs multi-task learning to\nconcurrently segment regions in images that correspond to tumors. Thirdly, the\nproposed approach outputs quantified contributions of each BI-RADS descriptor\ntoward predicting the benign or malignant class using post-hoc explanations\nwith Shapley Values.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:07:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Karimzadeh","Mohammad",""],["Vakanski","Aleksandar",""],["Xian","Min",""],["Zhang","Boyu",""]]}
{"id":"2308.14214","submitter":"Aleksandra Sierant","authors":"Micha{\\l} Lipka, Aleksandra Sierant, Charikleia Troullinou, Morgan\n  Mitchell","title":"Multi-parameter quantum sensing and magnetic communications with a\n  hybrid dc/rf optically-pumped magnetometer","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.app-ph physics.atom-ph physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce and demonstrate a hybrid optically-pumped magnetometer (hOPM)\nthat simultaneously measures one dc field component and one rf field component\nquadrature with a single atomic spin ensemble. The hOPM achieves\nsub-pT/$\\sqrt{\\mathrm{Hz}}$ sensitivity for both dc and rf fields, and is\nlimited in sensitivity by spin projection noise at low frequencies and by\nphoton shot noise at high frequencies. We demonstrate with the hOPM a new\napplication of multi-parameter quantum sensing: background-cancelling spread\nspectrum magnetic communication. We encode a digital message as rf amplitude,\nspread among sixteen very-low and low frequency channels in a noisy magnetic\nenvironment, and observe quantum-noise-limited rf magnetic signal recovery\nenabled by quantum-noise-limited dc noise cancellation, reaching noise\nrejection of \\SI{15}{\\decibel} at \\SI{100}{\\hertz} and more than\n\\SI{20}{\\decibel} at \\SI{60}{\\hertz} and below. We measure signal fidelity\nversus signal strength and extrinsic noise in communication of a\ndigitally-encoded text message. The combination of high sensitivity,\nquantum-noise-limited performance, and real-world application potential makes\nthe hOPM an ideal system in which to study high-performance multi-parameter\nquantum sensing.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:17:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lipka","Micha\u0142",""],["Sierant","Aleksandra",""],["Troullinou","Charikleia",""],["Mitchell","Morgan",""]]}
{"id":"2308.14215","submitter":"Sushrut Ghimire","authors":"Sushrut Ghimire","title":"TimeTrail: Unveiling Financial Fraud Patterns through Temporal\n  Correlation Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the field of financial fraud detection, understanding the underlying\npatterns and dynamics is important to ensure effective and reliable systems.\nThis research introduces a new technique, \"TimeTrail,\" which employs advanced\ntemporal correlation analysis to explain complex financial fraud patterns. The\ntechnique leverages time-related insights to provide transparent and\ninterpretable explanations for fraud detection decisions, enhancing\naccountability and trust.\n  The \"TimeTrail\" methodology consists of three key phases: temporal data\nenrichment, dynamic correlation analysis, and interpretable pattern\nvisualization. Initially, raw financial transaction data is enriched with\ntemporal attributes. Dynamic correlations between these attributes are then\nquantified using innovative statistical measures. Finally, a unified\nvisualization framework presents these correlations in an interpretable manner.\nTo validate the effectiveness of \"TimeTrail,\" a study is conducted on a diverse\nfinancial dataset, surrounding various fraud scenarios. Results demonstrate the\ntechnique's capability to uncover hidden temporal correlations and patterns,\nperforming better than conventional methods in both accuracy and\ninterpretability. Moreover, a case study showcasing the application of\n\"TimeTrail\" in real-world scenarios highlights its utility for fraud detection.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:27:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghimire","Sushrut",""]]}
{"id":"2308.14216","submitter":"Adrian Caruana","authors":"Adrian Caruana, Madhushi Bandara, Katarzyna Musial, Daniel Catchpoole,\n  Paul J. Kennedy","title":"Machine Learning for Administrative Health Records: A Systematic Review\n  of Techniques and Applications","comments":null,"journal-ref":null,"doi":"10.1016/j.artmed.2023.102642","report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning provides many powerful and effective techniques for\nanalysing heterogeneous electronic health records (EHR). Administrative Health\nRecords (AHR) are a subset of EHR collected for administrative purposes, and\nthe use of machine learning on AHRs is a growing subfield of EHR analytics.\nExisting reviews of EHR analytics emphasise that the data-modality of the EHR\nlimits the breadth of suitable machine learning techniques, and pursuable\nhealthcare applications. Despite emphasising the importance of data modality,\nthe literature fails to analyse which techniques and applications are relevant\nto AHRs. AHRs contain uniquely well-structured, categorically encoded records\nwhich are distinct from other data-modalities captured by EHRs, and they can\nprovide valuable information pertaining to how patients interact with the\nhealthcare system.\n  This paper systematically reviews AHR-based research, analysing 70 relevant\nstudies and spanning multiple databases. We identify and analyse which machine\nlearning techniques are applied to AHRs and which health informatics\napplications are pursued in AHR-based research. We also analyse how these\ntechniques are applied in pursuit of each application, and identify the\nlimitations of these approaches. We find that while AHR-based studies are\ndisconnected from each other, the use of AHRs in health informatics research is\nsubstantial and accelerating. Our synthesis of these studies highlights the\nutility of AHRs for pursuing increasingly complex and diverse research\nobjectives despite a number of pervading data- and technique-based limitations.\nFinally, through our findings, we propose a set of future research directions\nthat can enhance the utility of AHR data and machine learning techniques for\nhealth informatics research.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:34:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Caruana","Adrian",""],["Bandara","Madhushi",""],["Musial","Katarzyna",""],["Catchpoole","Daniel",""],["Kennedy","Paul J.",""]]}
{"id":"2308.14217","submitter":"Xin Luna Dong","authors":"Xin Luna Dong","title":"Generations of Knowledge Graphs: The Crazy Ideas and the Business Impact","comments":null,"journal-ref":"PVLDB 2023","doi":null,"report-no":null,"categories":"cs.DB cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge Graphs (KGs) have been used to support a wide range of\napplications, from web search to personal assistant. In this paper, we describe\nthree generations of knowledge graphs: entity-based KGs, which have been\nsupporting general search and question answering (e.g., at Google and Bing);\ntext-rich KGs, which have been supporting search and recommendations for\nproducts, bio-informatics, etc. (e.g., at Amazon and Alibaba); and the emerging\nintegration of KGs and LLMs, which we call dual neural KGs. We describe the\ncharacteristics of each generation of KGs, the crazy ideas behind the scenes in\nconstructing such KGs, and the techniques developed over time to enable\nindustry impact. In addition, we use KGs as examples to demonstrate a recipe to\nevolve research ideas from innovations to production practice, and then to the\nnext level of innovations, to advance both science and business.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:35:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Xin Luna",""]]}
{"id":"2308.14218","submitter":"Igor Zelenko","authors":"Zaifeng Lin, Igor Zelenko","title":"On Eisenhart's type theorem for sub-Riemannian metrics on step $2$\n  distributions with $\\mathrm{ad}$-surjective Tanaka symbols","comments":"37 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The classical result of Eisenhart states that if a Riemannian metric $g$\nadmits a Riemannian metric that is not constantly proportional to $g$ and has\nthe same (parameterized) geodesics as $g$ in a neighborhood of a given point,\nthen $g$ is a direct product of two Riemannian metrics in this neighborhood. We\nintroduce a new class of step $2$ graded nilpotent Lie algebras, called\n$\\mathrm{ad}$-surjective, and extend the Eisenhart theorem to sub-Riemannian\nmetrics on step 2 distributions with $\\mathrm{ad}$-surjective Tanaka symbols.\nThe class of ad-surjective step 2 nilpotent Lie algebras contains a well-known\nclass of algebras of H-type as a very particular case.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:35:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lin","Zaifeng",""],["Zelenko","Igor",""]]}
{"id":"2308.14219","submitter":"Fehmi Yasin","authors":"Fehmi Sami Yasin (1), Jan Masell (1 and 2), Yoshio Takahashi (3),\n  Tetsuya Akashi (3), Norio Baba (4), Kosuke Karube (1), Daisuke Shindo (1),\n  Takahisa Arima (1 and 5), Yasujiro Taguchi (1), Yoshinori Tokura (1 and 6 and\n  7), Toshiaki Tanigaki (3), Xiuzhen Yu (1) ((1) RIKEN Center for Emergent\n  Matter Science (CEMS), Wako, Japan, (2) Institute of Theoretical Solid State\n  Physics, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany, (3)\n  Research and Development Group, Hitachi Ltd., Hatoyama, Japan, (4) Research\n  Institute for Science and Technology, Kogakuin University, Hachioji, Japan,\n  (5) Department of Advanced Materials Science, University of Tokyo, Kashiwa,\n  Japan, (6) Department of Applied Physics, University of Tokyo, Tokyo, Japan,\n  (7) Tokyo College, University of Tokyo, Tokyo, Japan)","title":"Discovery of a Bloch point quadrupole constituting hybrid topological\n  strings","comments":"11 pages, 4 main figures, 7 extended data figures, 1 extended data\n  table","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Topological magnetic (anti)skrymions are robust string-like objects heralded\nas potential components in next-generation topological spintronics devices due\nto their manipulability via low-energy stimuli such as magnetic fields, heat,\nand electric/thermal current. While these two-dimensional (2D) topological\nobjects are widely studied, intrinsically three-dimensional (3D) electron-spin\nreal-space topology remains less explored despite its prevalence in bulky\nmagnets. Here, we capture the 3D structure of antiskyrmions in a\nsingle-crystal, precision-doped (Fe_{0.63}Ni_{0.3}Pd_{0.07})_{3}P lamellae\nusing holographic vector field electron tomography at room temperature and zero\nfield. Our measurements reveal hybrid string-like solitons composed of\nskyrmions with topological number W = -1 on the lamellae's surfaces and an\nantiskyrmion (W = +1) connecting them. High resolution images uncover a Bloch\npoint (BP) quadrupole (four magnetic (anti)monopoles) positioned along the\nrectangular antiskyrmion's four corners (Bloch lines), which enable the\nobserved lengthwise topological transitions. Furthermore, we calculate and\ncompare the energy densities of hybrid strings with ideal (anti)skyrmion\nstrings using micromagnetic simulations, which suggest that this composite\n(anti)BP structure stabilizes via the subtle interplay between the\nmagnetostatic interaction and anisotropic Dzyaloshinskii-Moriya interaction.\nThe discovery of these hybrid spin textures enables topological tunabilty, a\ntunable topological Hall effect, and the suppression of skyrmion Hall motion,\ndisrupting existing paradigms within spintronics.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:38:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yasin","Fehmi Sami","","1 and 2"],["Masell","Jan","","1 and 2"],["Takahashi","Yoshio","","1 and 5"],["Akashi","Tetsuya","","1 and 5"],["Baba","Norio","","1 and 5"],["Karube","Kosuke","","1 and 5"],["Shindo","Daisuke","","1 and 5"],["Arima","Takahisa","","1 and 5"],["Taguchi","Yasujiro","","1 and 6 and\n  7"],["Tokura","Yoshinori","","1 and 6 and\n  7"],["Tanigaki","Toshiaki",""],["Yu","Xiuzhen",""]]}
{"id":"2308.14220","submitter":"Mohit Singh Chauhan","authors":"Mohit Chauhan, Mariel Ojeda-Tuz, Ryan Catarelli, Kurtis Gurley,\n  Dimitrios Tsapetis, Michael D. Shields","title":"On Active Learning for Gaussian Process-based Global Sensitivity\n  Analysis","comments":"31 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper explores the application of active learning strategies to\nadaptively learn Sobol indices for global sensitivity analysis. We demonstrate\nthat active learning for Sobol indices poses unique challenges due to the\ndefinition of the Sobol index as a ratio of variances estimated from Gaussian\nprocess surrogates. Consequently, learning strategies must either focus on\nconvergence in the numerator or the denominator of this ratio. However, rapid\nconvergence in either one does not guarantee convergence in the Sobol index. We\npropose a novel strategy for active learning that focuses on resolving the main\neffects of the Gaussian process (associated with the numerator of the Sobol\nindex) and compare this with existing strategies based on convergence in the\ntotal variance (the denominator of the Sobol index). The new strategy,\nimplemented through a new learning function termed the MUSIC (minimize\nuncertainty in Sobol index convergence), generally converges in Sobol index\nerror more rapidly than the existing strategies based on the Expected\nImprovement for Global Fit (EIGF) and the Variance Improvement for Global Fit\n(VIGF). Both strategies are compared with simple sequential random sampling and\nthe MUSIC learning function generally converges most rapidly for\nlow-dimensional problems. However, for high-dimensional problems, the\nperformance is comparable to random sampling. The new learning strategy is\ndemonstrated for a practical case of adaptive experimental design for\nlarge-scale Boundary Layer Wind Tunnel experiments.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:42:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chauhan","Mohit",""],["Ojeda-Tuz","Mariel",""],["Catarelli","Ryan",""],["Gurley","Kurtis",""],["Tsapetis","Dimitrios",""],["Shields","Michael D.",""]]}
{"id":"2308.14221","submitter":"Zinuo Li","authors":"Zinuo Li, Xuhang Chen, Chi-Man Pun, Xiaodong Cun","title":"High-Resolution Document Shadow Removal via A Large-Scale Real-World\n  Dataset and A Frequency-Aware Shadow Erasing Net","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shadows often occur when we capture the documents with casual equipment,\nwhich influences the visual quality and readability of the digital copies.\nDifferent from the algorithms for natural shadow removal, the algorithms in\ndocument shadow removal need to preserve the details of fonts and figures in\nhigh-resolution input. Previous works ignore this problem and remove the\nshadows via approximate attention and small datasets, which might not work in\nreal-world situations. We handle high-resolution document shadow removal\ndirectly via a larger-scale real-world dataset and a carefully designed\nfrequency-aware network. As for the dataset, we acquire over 7k couples of\nhigh-resolution (2462 x 3699) images of real-world document pairs with various\nsamples under different lighting circumstances, which is 10 times larger than\nexisting datasets. As for the design of the network, we decouple the\nhigh-resolution images in the frequency domain, where the low-frequency details\nand high-frequency boundaries can be effectively learned via the carefully\ndesigned network structure. Powered by our network and dataset, the proposed\nmethod clearly shows a better performance than previous methods in terms of\nvisual quality and numerical results. The code, models, and dataset are\navailable at: https://github.com/CXH-Research/DocShadow-SD7K\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:45:24 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 02:50:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Zinuo",""],["Chen","Xuhang",""],["Pun","Chi-Man",""],["Cun","Xiaodong",""]]}
{"id":"2308.14222","submitter":"Vedran Novakovi\\'c","authors":"Vedran Novakovi\\'c","title":"Accurate complex Jacobi rotations","comments":"Supplementary material is available in\n  https://github.com/venovako/AccJac and https://github.com/venovako/libpvn\n  repositories","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This note shows how to compute, to high relative accuracy under mild\nassumptions, complex Jacobi rotations for diagonalization of Hermitian matrices\nof order two, using the correctly rounded functions $\\mathtt{cr\\_hypot}$ and\n$\\mathtt{cr\\_rsqrt}$, proposed for standardization in the C programming\nlanguage as recommended by the IEEE-754 floating-point standard. The rounding\nto nearest (ties to even) and the non-stop arithmetic are assumed. The\nnumerical examples compare the observed with theoretical bounds on the relative\nerrors in the rotations' elements, and show that the maximal observed departure\nof the rotations' determinants from unity is smaller than that of the\ntransformations computed by LAPACK.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:46:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Novakovi\u0107","Vedran",""]]}
{"id":"2308.14223","submitter":"Samya Sen","authors":"Samya Sen, Rubens R. Fernandes, Randy H. Ewoldt","title":"Soft glassy materials with tunable extensibility","comments":"23 pages, 13 figures, Supplementary Information included (6 pages)","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Extensibility is beyond the paradigm of classical soft glassy materials, and\nmore broadly, yield-stress fluids. Recently, model yield-stress fluids with\nsignificant extensibility have been designed by adding polymeric phases to\nclassically viscoplastic dispersions [1, 2, 3]. However, fundamental questions\nremain about the design of and coupling between the shear and extensional\nrheology of such systems. In this work, we propose a model material, a mixture\nof soft glassy microgels and solutions of high molecular weight linear\npolymers. We establish systematic criteria for the design and thorough\nrheological characterization of such systems, both in shear and in extension.\nUsing our material, we show that it is possible to dramatically change the\nbehavior in extension with minimal change in the shear yield stress and elastic\nmodulus, thus enabling applications that exploit orthogonal modulation of shear\nand extensional material properties.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:56:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sen","Samya",""],["Fernandes","Rubens R.",""],["Ewoldt","Randy H.",""]]}
{"id":"2308.14224","submitter":"Reza Habibi","authors":"Reza Habibi, Johannes Pfau, Magy Seif El-Nasr","title":"Modeling Player Personality Factors from In-Game Behavior and Affective\n  Expression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.HC cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Developing a thorough understanding of the target audience (and/or single\nindividuals) is a key factor for success - which is exceptionally important and\npowerful for the domain of video games that can not only benefit from informed\ndecision making during development, but ideally even tailor game content,\ndifficulty and player experience while playing. The granular assessment of\nindividual personality and differences across players is a particularly\ndifficult endeavor, given the highly variant human nature, disagreement in\npsychological background models and because of the effortful data collection\nthat most often builds upon long, time-consuming and deterrent questionnaires.\nIn this work, we explore possibilities to predict a series of player\npersonality questionnaire metrics from recorded in-game behavior and extend\nrelated work by explicitly adding affective dialog decisions to the game\nenvironment which could elevate the model's accuracy. Using random forest\nregression, we predicted a wide variety of personality metrics from seven\nestablished questionnaires across 62 players over 60 minute gameplay of a\ncustomized version of the role-playing game Fallout: New Vegas. While some\npersonality variables could already be identified from reasonable underlying\nin-game actions and affective expressions, we did not find ways to predict\nothers or encountered questionable correlations that could not be justified by\ntheoretical background literature. Yet, building on the initial opportunities\nof this explorative study, we are striving to massively enlarge our data set to\nplayers from an ecologically valid industrial game environment and investigate\nthe performance of more sophisticated machine learning approaches.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 22:59:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Habibi","Reza",""],["Pfau","Johannes",""],["El-Nasr","Magy Seif",""]]}
{"id":"2308.14225","submitter":"Hector Pinedo","authors":"Dirceu Bagio and H\\'ector Pinedo","title":"Partial actions of groups on generalized matrix rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $n$ be a positive integer and $R=(M_{ij})_{1\\leq i,j\\leq n}$ be a\ngeneralized matrix ring. For each $1\\leq i,j\\leq n$, let $I_i$ be an ideal of\nthe ring $R_i:=M_{ii}$ and denote $I_{ij}=I_iM_{ij}+M_{ij}I_j$. We give\nsufficient conditions for the subset $I=(I_{ij})_{1\\leq i,j\\leq n}$ of $R$ to\nbe an ideal of $R$. Also, suppose that $\\alpha^{(i)}$ is a partial action of a\ngroup $\\mathtt{G}$ on $R_i$, for all $1\\leq i\\leq n$. We construct, under\ncertain conditions, a partial action $\\gamma$ of $\\mathtt{G}$ on $R$ such that\n$\\gamma$ restricted to $R_i$ coincides with $\\alpha^{(i)}$. We study the\nrelation between this construction and the notion of Morita equivalent partial\ngroup action given in [1]. Moreover, we investigate properties related to\nGalois theory for the extension $R^{\\gamma}\\subset R$. Some examples to\nillustrate the results are considered in the last part of the paper.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:13:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bagio","Dirceu",""],["Pinedo","H\u00e9ctor",""]]}
{"id":"2308.14226","submitter":"Alexander F. Krasnikov","authors":"A. F. Krasnikov","title":"On pro-${\\it p}$-groups with a single defining relator","comments":"6 pages, in Russian","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we establish necessary condition for the Freiheitsatz of Magnus\ncan be extended to free pro-${\\it p}$-groups\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:19:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Krasnikov","A. F.",""]]}
{"id":"2308.14227","submitter":"Shuntaro Sumita","authors":"Shuntaro Sumita, Makoto Naka, and Hitoshi Seo","title":"Fulde-Ferrell-Larkin-Ovchinnikov state induced by antiferromagnetic\n  order in $\\kappa$-type organic conductors","comments":"16 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We theoretically investigate superconductivity under a spin-split band\nstructure owing to a collinear-type antiferromagnetic order in\nquasi-two-dimensional organic compounds $\\kappa$-(BEDT-TTF)$_2X$. We find that\nthe magnetic order can induce a Fulde--Ferrell--Larkin--Ovchinnikov (FFLO)\nstate, where the Cooper pair possesses a finite center-of-mass momentum. We\nshow this from two types of analyses: (1) an effective model where simple\nintraband attractive interactions are assumed, and (2) many-body calculations\nof the repulsive Hubbard model based on the fluctuation-exchange approximation\nand the linearized Eliashberg equation. Our results show the possibility of\nrealizing the FFLO state without applying an external magnetic field.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:19:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sumita","Shuntaro",""],["Naka","Makoto",""],["Seo","Hitoshi",""]]}
{"id":"2308.14228","submitter":"Homa Nikbakht","authors":"Homa Nikbakht, Malcolm Egan, Jean-Marie Gorce, and H.Vincent Poor","title":"Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines:\n  Second-Order Achievability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A standard assumption in the design of ultra-reliable low-latency\ncommunication systems is that the duration between message arrivals is larger\nthan the number of channel uses before the decoding deadline. Nevertheless,\nthis assumption fails when messages arrive rapidly and reliability constraints\nrequire that the number of channel uses exceed the time between arrivals. In\nthis paper, we consider a broadcast setting in which a transmitter wishes to\nsend two different messages to two receivers over Gaussian channels. Messages\nhave different arrival times and decoding deadlines such that their\ntransmission windows overlap. For this setting, we propose a coding scheme that\nexploits Marton's coding strategy. We derive rigorous bounds on the achievable\nrate regions. Those bounds can be easily employed in point-to-point settings\nwith one or multiple parallel channels. In the point-to-point setting with one\nor multiple parallel channels, the proposed achievability scheme outperforms\nthe Normal Approximation, especially when the number of channel uses is smaller\nthan $200$. In the broadcast setting, our scheme agrees with Marton's strategy\nfor sufficiently large numbers of channel uses and shows significant\nperformance improvements over standard approaches based on time sharing for\ntransmission of short packets.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:20:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nikbakht","Homa",""],["Egan","Malcolm",""],["Gorce","Jean-Marie",""],["Poor","H. Vincent",""]]}
{"id":"2308.14229","submitter":"Joonhyun Yeo","authors":"J. Yeo and M. A. Moore","title":"The Replica Symmetry Broken States of some Glass Models","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.dis-nn cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have studied in detail the $M$-$p$ balanced spin glass model, which is a\ncandidate for being a model for structural glasses. Such models possess two\nkinds of broken replica states; those with one-step replica symmetry breaking\n(1RSB) and those with full replica symmetry breaking (FRSB). To determine which\narises requires studying the Landau expansion to quintic order. There are 9\nquintic order coefficients, and 5 quartic order coefficients, whose values we\ndetermine for this model. We show that it is only for $2 \\leq M < 2.4714\n\\cdots$ that the transition at mean-field level is to a state with FRSB, while\nfor larger $M$ values there is either a continuous transition to a state with\n1RSB (when $ M \\leq 3$) or a discontinuous transition for $M > 3$. The Gardner\ntransition from a 1RSB state at low temperatures to a state with FRSB also\nrequires the Landau expansion to be taken to quintic order. Our result for the\nform of FRSB in the Gardner phase is similar to that found when $2 \\leq M <\n2.4714\\cdots$, but differs from that given in the early paper of Gross et al.\n[Phys. Rev. Lett. 55, 304 (1985)]. Finally we discuss the effects of\nfluctuations on our mean-field solutions using the scheme of H\\\"{o}ller and\nRead [Phys. Rev. E 101, 042114 (2020)] and argue that such fluctuations will\nremove the continuous 1RSB transition in dimension $d$ when $8 >d \\geq 6$\nleaving just the FRSB continuous transition (and possibly also the\ndiscontinuous 1RSB transition). We suggest values for $M$ and $p$ which might\nbe used in simulations to resolve the outstanding question of whether\nfluctuation corrections can remove the discontinuous 1RSB transition.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:24:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yeo","J.",""],["Moore","M. A.",""]]}
{"id":"2308.14230","submitter":"Huy Nguyen Q","authors":"H. Dong, F. Gancedo. H. Q. Nguyen","title":"Global well-posedness for the one-phase Muskat problem in 3D","comments":"48 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with the long time dynamics of the free boundary of a\nDarcy fluid in three space dimensions, also known as the one-phase Muskat\nproblem. The dynamics of the free boundary is governed by a nonlocal fully\nnonlinear parabolic partial differential equation. It is proven that for any\nperiodic Lipschitz graph given as initial data, the problem has a unique\nglobal-in-time solution which satisfies the equation in the strong sense.\nMoreover, all H\\\"older norms of the solution decay exponentially in time. These\nresults have been previously established in two space dimensions. This paper\naddresses new challenges to extend the results to the more difficult three\ndimensional setting. The approach developed is critical in three space\ndimensions and crucially relies on Dahlberg-Kenig's $W^{1, 2+\\varepsilon}$\noptimal regularity for layer potentials together with delicate structures of\nthe Dirichlet-to-Neumann operator and layer potentials in Lipschitz domains of\n$\\mathbb{T}^2\\times \\mathbb{R}$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:26:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","H.",""],["Nguyen","F. Gancedo. H. Q.",""]]}
{"id":"2308.14231","submitter":"Xuan Wang","authors":"Xuan Wang and Jorge Cortes","title":"Efficient Reconstruction of Neural Mass Dynamics Modeled by\n  Linear-Threshold Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the data-driven reconstruction of firing rate dynamics of\nbrain activity described by linear-threshold network models. Identifying the\nsystem parameters directly leads to a large number of variables and a highly\nnon-convex objective function. Instead, our approach introduces a novel\nreformulation that incorporates biological organizational features and turns\nthe identification problem into a scalar variable optimization of a\ndiscontinuous, non-convex objective function. We prove that the minimizer of\nthe objective function is unique and establish that the solution of the\noptimization problem leads to the identification of all the desired system\nparameters. These results are the basis to introduce an algorithm to find the\noptimizer by searching the different regions corresponding to the domain of\ndefinition of the objective function. To deal with measurement noise in sampled\ndata, we propose a modification of the original algorithm whose identification\nerror is linearly bounded by the magnitude of the measurement noise. We\ndemonstrate the effectiveness of the proposed algorithms through simulations on\nsynthetic and experimental data.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:27:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Xuan",""],["Cortes","Jorge",""]]}
{"id":"2308.14232","submitter":"Seyed Reza Ahmadzadeh","authors":"S. Reza Ahmadzadeh","title":"Research Report -- Persistent Autonomy and Robot Learning Lab","comments":"5 pages, 4 figures, technical report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Robots capable of performing manipulation tasks in a broad range of missions\nin unstructured environments can develop numerous applications to impact and\nenhance human life. Existing work in robot learning has shown success in\napplying conventional machine learning algorithms to enable robots for\nreplicating rather simple manipulation tasks in manufacturing, service and\nhealthcare applications, among others. However, learning robust and versatile\nmodels for complex manipulation tasks that are inherently multi-faceted and\nnaturally intricate demands algorithmic advancements in robot learning. Our\nresearch supports the long-term goal of making robots more accessible and\nserviceable to the general public by expanding robot applications to real-world\nscenarios that require systems capable of performing complex tasks. To achieve\nthis goal, we focus on identifying and investigating knowledge gaps in robot\nlearning of complex manipulation tasks by leveraging upon human-robot\ninteraction and robot learning from human instructions. This document presents\nan overview of the recent research developments in the Persistent Autonomy and\nRobot Learning (PeARL) lab at the University of Massachusetts Lowell. Here, I\nbriefly discuss different research directions, and present a few proposed\napproaches in our most recent publications. For each proposed approach, I then\nmention potential future directions that can advance the field.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:29:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ahmadzadeh","S. Reza",""]]}
{"id":"2308.14233","submitter":"Maarten Biesheuvel","authors":"P.M. Biesheuvel, S. Porada, I. Ryzhkov, and M. Elimelech","title":"General validity of the exponential law for the effect of concentration\n  polarization in reverse osmosis in a stirred-cell geometry, including an\n  activity correction for 1:1 salt solutions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reverse osmosis (RO) is a method to desalinate water, where water containing\nsalts is pushed through a membrane while salt ions are rejected by the\nmembrane. Very important in the theory of mass transport in RO is the\nconcentration polarization (CP) layer, which develops on the upstream side of\nthe membrane because of a combination of salt convection and diffusion. Because\nof the CP-effect, the salt concentration at the membrane surface is higher than\nin the channel, and this increases the osmotic pressure there, and thus\ntransmembrane water flux is reduced (the osmotic pressure acts against water\nflux), while salt leakage through the membrane increases. So it is very\nimportant to understand and describe the CP-layer accurately. We analyze a\none-dimensional geometry, which is of relevance for a typical lab-scale RO\nsetup using small membrane coupons where the solution on the feed side of the\nmembrane is stirred. For this geometry, the standard film layer approach is\noften used that assumes a stagnant film layer of a defined thickness, which\nhowever does not exist in reality. We set up a model without that assumption\nbut including refreshment of solution because of the flow of water along the\nmembrane due to stirring. We show that the `exponential law' for the CP-layer\nthat is predicted by the the film model, also applies for this more accurate\nmodel. We further improve the model by including the activity coefficient of\nsalt ions, as described by the Bjerrum theory that is based on ion-ion\nCoulombic interactions. We show how including this activity correction leads to\na reduction of the diffusional driving force at high concentration, and thus\nthe salt concentration at the membrane further increases. However, the effect\ncan be easily included by reducing the CP-layer mass transfer coefficient by a\nfixed percentage.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:57:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Biesheuvel","P. M.",""],["Porada","S.",""],["Ryzhkov","I.",""],["Elimelech","M.",""]]}
{"id":"2308.14234","submitter":"Yanhui Chen","authors":"Y. H. Chen, M. Y. Tang, H. Shu, H. Tu","title":"An initial analysis of a strongly-lensed QSOs candidate identified by\n  LAMOST","comments":"2 tables and 4 figures, accepted by RAA on August 24, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  From 2011 to 2021, LAMOST has released a total of 76,167 quasar data. We try\nto search for gravitationally lensed QSOs by limiting coordinate differences\nand redshift differences of these QSOs. The name, brightness, spectrum,\nphotometry and other information of each QSO will be visually checked\ncarefully. Special attention should be paid to check whether there are groups\nof galaxies, gravitationally lensed arcs, Einstein crosses, or Einstein rings\nnear the QSOs. Through careful selection, we select LAMOST J160603.01+290050.8\n(A) and LAMOST J160602.81+290048.7 (B) as a candidate and perform an initial\nanalysis. The component A and B are 3.36 arc seconds apart and they display\nblue during photometric observations. The redshift values of component A and B\nare 0.2\\% different, their Gaia$\\_$g values are 1.3\\% different, and their\nugriz values are 1.0\\% or less different. For the spectra covering from 3,690\n{\\AA} to 9,100 {\\AA}, the emission lines of C\\,II, Mg, H\\,$\\gamma$, O\\,III, and\nH\\,$\\beta$ are present for both component A and B and the ratio of flux(B) to\nflux(A) from LAMOST is basically a constant, around 2.2. We accidentally find a\ngalaxy group near the component A and B. If the center of dark matter in the\ngalaxy group is at the center between component A and B, the component A and B\nare probably gravitationally lensed QSOs. We estimate that the Einstein mass is\n1.46 $\\times$ $10^{11}$ $M_{\\odot}$ and the total mass of the lens is 1.34\n$\\times$ $10^{13}$ $M_{\\odot}$. The deflection angle is 1.97 arc seconds at\npositions A and B and the velocity dispersion is 261\\,$km\\,s^{-1}$.\nTheoretically, this candidate could be a pair of fold images of a strong\nlensing system by a galaxy group, and we will investigate the possibility when\nthe redshifts of nearby galaxies are available.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:05:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Y. H.",""],["Tang","M. Y.",""],["Shu","H.",""],["Tu","H.",""]]}
{"id":"2308.14235","submitter":"Haochen Li","authors":"Haochen Li, Yi Cao, Maria Polukarov, Carmine Ventre","title":"An Empirical Analysis on Financial Market: Insights from the Application\n  of Statistical Physics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.TR q-fin.CP q-fin.MF q-fin.PR q-fin.ST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we introduce a physical model inspired by statistical physics\nfor predicting price volatility and expected returns by leveraging Level 3\norder book data. By drawing parallels between orders in the limit order book\nand particles in a physical system, we establish unique measures for the\nsystem's kinetic energy and momentum as a way to comprehend and evaluate the\nstate of limit order book. Our model goes beyond examining merely the top\nlayers of the order book by introducing the concept of 'active depth', a\ncomputationally-efficient approach for identifying order book levels that have\nimpact on price dynamics. We empirically demonstrate that our model outperforms\nthe benchmarks of traditional approaches and machine learning algorithm. Our\nmodel provides a nuanced comprehension of market microstructure and produces\nmore accurate forecasts on volatility and expected returns. By incorporating\nprinciples of statistical physics, this research offers valuable insights on\nunderstanding the behaviours of market participants and order book dynamics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:06:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Haochen",""],["Cao","Yi",""],["Polukarov","Maria",""],["Ventre","Carmine",""]]}
{"id":"2308.14236","submitter":"Pablo Su\\'arez-Serrato","authors":"Pablo Su\\'arez-Serrato","title":"A conservative Turing complete $S^4$ flow","comments":"9 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG cs.CC math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We present a Turing complete, volume preserving, smooth flow on the\n$4$-sphere.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:10:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su\u00e1rez-Serrato","Pablo",""]]}
{"id":"2308.14237","submitter":"Mattie Ji","authors":"Lev Borisov, Mattie Ji, Yanxin Lin","title":"Explicit equations of the fake projective plane $(a=7,p=2,\\emptyset,D_3\n  X_7)$","comments":"12 pages. The relevant Mathematica, Magma, Macaulay2 codes and\n  equations produced can be found in the ancillary folder and links in the\n  bibliography","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We find explicit equations of the fake projective plane\n$(a=7,p=2,\\emptyset,D_3 X_7)$, which lies in the same class as the fake\nprojective plane $(a=7,p=2,\\emptyset,D_3 2_7)$ with $21$ automorphisms whose\nequations were previously found by Borisov and Keum. The method involves\nfinding a birational model of a common Galois cover of these two surfaces.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:11:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Borisov","Lev",""],["Ji","Mattie",""],["Lin","Yanxin",""]]}
{"id":"2308.14238","submitter":"Klaus Regenauer-Lieb","authors":"Klaus Regenauer-Lieb and Manman Hu","title":"Dynamic Mechanism of Catastrophic Collapse: An New Perspective on\n  Earthquake Physics","comments":"7 pages 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The collapse of man-made and natural structures is a complex phenomenon that\nhas been studied for centuries. We propose a new approach to understanding\ncatastrophic instabilities, based on the idea that they do not occur at the\ncritical point, but rather develop out of the subcritical regime as short-lived\nextreme events. We use an extension of Onsager's reciprocal theorem to study\nthe subcritical regime, and we show that excitable systems in this regime are\nattracted to a nonlocal equilibrium that defines the maximum entropy production\nof at least two interacting phases. In most cases, these feedback systems are\narrested by dissipative processes at larger scale, but in rare cases they can\nform tensor networks of instabilities that ripple from the small scale to the\nlargest scale, forming extreme events.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:17:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Regenauer-Lieb","Klaus",""],["Hu","Manman",""]]}
{"id":"2308.14239","submitter":"Thiparat Chotibut","authors":"Apimuk Sornsaeng, Ninnat Dangniam, Thiparat Chotibut","title":"Quantum Next Generation Reservoir Computing: An Efficient Quantum\n  Algorithm for Forecasting Quantum Dynamics","comments":"14 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.dis-nn cond-mat.stat-mech cs.LG physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Next Generation Reservoir Computing (NG-RC) is a modern class of model-free\nmachine learning that enables an accurate forecasting of time series data\ngenerated by dynamical systems. We demonstrate that NG-RC can accurately\npredict full many-body quantum dynamics, instead of merely concentrating on the\ndynamics of observables, which is the conventional application of reservoir\ncomputing. In addition, we apply a technique which we refer to as skipping\nahead to predict far future states accurately without the need to extract\ninformation about the intermediate states. However, adopting a classical NG-RC\nfor many-body quantum dynamics prediction is computationally prohibitive due to\nthe large Hilbert space of sample input data. In this work, we propose an\nend-to-end quantum algorithm for many-body quantum dynamics forecasting with a\nquantum computational speedup via the block-encoding technique. This proposal\npresents an efficient model-free quantum scheme to forecast quantum dynamics\ncoherently, bypassing inductive biases incurred in a model-based approach.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:34:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sornsaeng","Apimuk",""],["Dangniam","Ninnat",""],["Chotibut","Thiparat",""]]}
{"id":"2308.14240","submitter":"Michael Cholette","authors":"Huy Truong-Ba, Sinda Rebello, Michael E. Cholette, Venkat Reddy,\n  Pietro Borghesani","title":"Track Geometry Degradation Modelling Considering Multiple Indicators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Railway infrastructure requires effective maintenance to ensure safe and\ncomfortable transportation. Among the various degradation modes, track geometry\ndeformation caused by repeated loading is a critical mechanism impacting\noperational safety. Detecting and maintaining acceptable track geometry relies\non track recording vehicles (TRVs) that inspect and record geometric\nparameters. This study aims to develop a novel track geometry degradation model\nconsidering multiple indicators and their correlation, while accounting for\nboth imperfect manual and mechanized tamping. A multi-variate Wiener model is\nformulated to capture the characteristics of track geometry degradation. To\novercome data limitations, a hierarchical Bayesian approach with Markov Chain\nMonte Carlo (MCMC) simulation is utilized. This study offers a contribution on\nthe analysis of a multi-variate predictive model which considers correlation\nbetween the degradation rates of multiple indicators, providing insights for\nrail operators and new track-monitoring systems. The performance of the models\nis rigorously validated through a real-world case study on a commuter track in\nQueensland, Australia, utilizing actual data and independent test datasets.\nThis experimental calibration and validation procedure represents a novel\ncontribution to the existing literature, offering valuable guidance for rail\nasset management and decision-making.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:46:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Truong-Ba","Huy",""],["Rebello","Sinda",""],["Cholette","Michael E.",""],["Reddy","Venkat",""],["Borghesani","Pietro",""]]}
{"id":"2308.14241","submitter":"Zehua Zeng","authors":"Zehua Zeng, Junran Yang, Dominik Moritz, Jeffrey Heer, Leilani Battle","title":"Too Many Cooks: Exploring How Graphical Perception Studies Influence\n  Visualization Recommendations in Draco","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Findings from graphical perception can guide visualization recommendation\nalgorithms in identifying effective visualization designs. However, existing\nalgorithms use knowledge from, at best, a few studies, limiting our\nunderstanding of how complementary (or contradictory) graphical perception\nresults influence generated recommendations. In this paper, we present a\npipeline of applying a large body of graphical perception results to develop\nnew visualization recommendation algorithms and conduct an exploratory study to\ninvestigate how results from graphical perception can alter the behavior of\ndownstream algorithms. Specifically, we model graphical perception results from\n30 papers in Draco -- a framework to model visualization knowledge -- to\ndevelop new recommendation algorithms. By analyzing Draco-generated algorithms,\nwe showcase the feasibility of our method to (1) identify gaps in existing\ngraphical perception literature informing recommendation algorithms, (2)\ncluster papers by their preferred design rules and constraints, and (3)\ninvestigate why certain studies can dominate Draco's recommendations, whereas\nothers may have little influence. Given our findings, we discuss the potential\nfor mutually reinforcing advancements in graphical perception and visualization\nrecommendation research.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 00:58:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zeng","Zehua",""],["Yang","Junran",""],["Moritz","Dominik",""],["Heer","Jeffrey",""],["Battle","Leilani",""]]}
{"id":"2308.14242","submitter":"Zhihan Cui Dr.","authors":"Chuanyang Jin, Songyang Zhang, Tianmin Shu, and Zhihan Cui","title":"The Cultural Psychology of Large Language Models: Is ChatGPT a Holistic\n  or Analytic Thinker?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The prevalent use of Large Language Models (LLMs) has necessitated studying\ntheir mental models, yielding noteworthy theoretical and practical\nimplications. Current research has demonstrated that state-of-the-art LLMs,\nsuch as ChatGPT, exhibit certain theory of mind capabilities and possess\nrelatively stable Big Five and/or MBTI personality traits. In addition,\ncognitive process features form an essential component of these mental models.\nResearch in cultural psychology indicated significant differences in the\ncognitive processes of Eastern and Western people when processing information\nand making judgments. While Westerners predominantly exhibit analytical\nthinking that isolates things from their environment to analyze their nature\nindependently, Easterners often showcase holistic thinking, emphasizing\nrelationships and adopting a global viewpoint. In our research, we probed the\ncultural cognitive traits of ChatGPT. We employed two scales that directly\nmeasure the cognitive process: the Analysis-Holism Scale (AHS) and the Triadic\nCategorization Task (TCT). Additionally, we used two scales that investigate\nthe value differences shaped by cultural thinking: the Dialectical Self Scale\n(DSS) and the Self-construal Scale (SCS). In cognitive process tests (AHS/TCT),\nChatGPT consistently tends towards Eastern holistic thinking, but regarding\nvalue judgments (DSS/SCS), ChatGPT does not significantly lean towards the East\nor the West. We suggest that the result could be attributed to both the\ntraining paradigm and the training data in LLM development. We discuss the\npotential value of this finding for AI research and directions for future\nresearch.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:05:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jin","Chuanyang",""],["Zhang","Songyang",""],["Shu","Tianmin",""],["Cui","Zhihan",""]]}
{"id":"2308.14243","submitter":"Jihong Zhao","authors":"Jihong Zhao, Ying Li","title":"Global Existence of Large Solutions for the 3D incompressible\n  Navier--Stokes--Poisson--Nernst--Planck Equations","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work is concerned with the global existence of large solutions to the\nthree-dimensional dissipative fluid-dynamical model, which is a strongly\ncoupled nonlinear nonlocal system characterized by the incompressible\nNavier--Stokes--Poisson--Nernst--Planck equations. Making full use of the\nalgebraic structure of the system, we obtain the global existence of solutions\nwithout smallness assumptions imposed on the third component of the initial\nvelocity field and the summation of initial densities of charged species. More\nprecisely, we prove that there exist two positive constants $c_{0}, C_{0}$ such\nthat if the initial data satisfies \\begin{align*}\n  \\big(\\|u_{0}^{h}\\|_{\\dot{B}^{-1+\\frac{3}{p}}_{p,1}}+\\|N_{0}-P_{0}\\|_{\\dot{B}^{-2+\\frac{3}{q}}_{q,1}}\n  \\big)\n  \\exp\\Big\\{C_{0}\\big(\\|u_{0}^{3}\\|_{\\dot{B}^{-1+\\frac{3}{p}}_{p,1}}^{2}+(\\|N_{0}+P_{0}\\|_{\\dot{B}^{-2+\\frac{3}{r}}_{r,1}}+1)\\exp\\big\\{C_{0}\\|u_{0}^{3}\\|_{\\dot{B}^{-1+\\frac{3}{p}}_{p,1}}\\big\\}+1\\big)\\Big\\}\n  \\leq\n  c_{0}, \\end{align*} then the incompressible\nNavier--Stokes--Poisson--Nernst--Planck equations admits a unique global\nsolution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:10:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Jihong",""],["Li","Ying",""]]}
{"id":"2308.14244","submitter":"Animesh Karnewar","authors":"Animesh Karnewar and Niloy J. Mitra and Andrea Vedaldi and David\n  Novotny","title":"HoloFusion: Towards Photo-realistic 3D Generative Modeling","comments":"ICCV 2023 conference; project page at:\n  https://holodiffusion.github.io/holofusion","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion-based image generators can now produce high-quality and diverse\nsamples, but their success has yet to fully translate to 3D generation:\nexisting diffusion methods can either generate low-resolution but 3D consistent\noutputs, or detailed 2D views of 3D objects but with potential structural\ndefects and lacking view consistency or realism. We present HoloFusion, a\nmethod that combines the best of these approaches to produce high-fidelity,\nplausible, and diverse 3D samples while learning from a collection of\nmulti-view 2D images only. The method first generates coarse 3D samples using a\nvariant of the recently proposed HoloDiffusion generator. Then, it\nindependently renders and upsamples a large number of views of the coarse 3D\nmodel, super-resolves them to add detail, and distills those into a single,\nhigh-fidelity implicit 3D representation, which also ensures view consistency\nof the final renders. The super-resolution network is trained as an integral\npart of HoloFusion, end-to-end, and the final distillation uses a new sampling\nscheme to capture the space of super-resolved signals. We compare our method\nagainst existing baselines, including DreamFusion, Get3D, EG3D, and\nHoloDiffusion, and achieve, to the best of our knowledge, the most realistic\nresults on the challenging CO3Dv2 dataset.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:19:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Karnewar","Animesh",""],["Mitra","Niloy J.",""],["Vedaldi","Andrea",""],["Novotny","David",""]]}
{"id":"2308.14245","submitter":"Peter Washington","authors":"Joe Li, Peter Washington","title":"A Comparison of Personalized and Generalized Approaches to Emotion\n  Recognition Using Consumer Wearable Devices: Machine Learning Study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CY cs.HC eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Background: Studies have shown the potential adverse health effects, ranging\nfrom headaches to cardiovascular disease, associated with long-term negative\nemotions and chronic stress. Since many indicators of stress are imperceptible\nto observers, the early detection and intervention of stress remains a pressing\nmedical need. Physiological signals offer a non-invasive method of monitoring\nemotions and are easily collected by smartwatches. Existing research primarily\nfocuses on developing generalized machine learning-based models for emotion\nclassification. Objective: We aim to study the differences between personalized\nand generalized machine learning models for three-class emotion classification\n(neutral, stress, and amusement) using wearable biosignal data. Methods: We\ndeveloped a convolutional encoder for the three-class emotion classification\nproblem using data from WESAD, a multimodal dataset with physiological signals\nfor 15 subjects. We compared the results between a subject-exclusive\ngeneralized, subject-inclusive generalized, and personalized model. Results:\nFor the three-class classification problem, our personalized model achieved an\naverage accuracy of 95.06% and F1-score of 91.71, our subject-inclusive\ngeneralized model achieved an average accuracy of 66.95% and F1-score of 42.50,\nand our subject-exclusive generalized model achieved an average accuracy of\n67.65% and F1-score of 43.05. Conclusions: Our results emphasize the need for\nincreased research in personalized emotion recognition models given that they\noutperform generalized models in certain contexts. We also demonstrate that\npersonalized machine learning models for emotion classification are viable and\ncan achieve high performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:21:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Joe",""],["Washington","Peter",""]]}
{"id":"2308.14246","submitter":"Zehua Tian","authors":"Zehua Tian, and Jiliang Jing","title":"Using nanokelvin quantum thermometry to detect timelike Unruh effect in\n  a Bose-Einstein condensate","comments":"12+2 pages, 5 figures, comments are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is found that the Unruh effect can not only arise out of the entanglement\nbetween two sets of modes spanning the left and right Rindler wedges, but also\nbetween modes spanning the future and past light cones. Furthermore, an\ninertial Unruh-DeWitt detector along a spacetime trajectory in one of these\ncones may exhibit the same thermal response to the vacuum as that of an\naccelerated detector confined in the Rindler wedge. This feature thus could be\nan alternative candidate to verify the ``Unruh effect\", termed as the timelike\nUnruh effect correspondingly. In this paper we propose to detect the timelike\nUnruh effect by using an impurity immersed in a Bose-Einstein condensate (BEC).\nThe impurity acts as the detector which interacts with the density fluctuations\nin the condensate, working as an effective quantum field. Following the\nparadigm of the emerging field of quantum thermometry, we combine quantum\nparameter estimation theory with the theory of open quantum systems to realize\na nondemolition Unruh temperature measurement in the nanokelvin (nK) regime.\nOur results demonstrate that the timelike Unruh effect can be probed using a\nstationary two-level impurity with time-dependent energy gap immersed in a BEC\nwithin current technologies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:25:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tian","Zehua",""],["Jing","Jiliang",""]]}
{"id":"2308.14247","submitter":"Zehua Zeng","authors":"Junran Yang, P\\'eter Ferenc Gyarmati, Zehua Zeng, Dominik Moritz","title":"Draco 2: An Extensible Platform to Model Visualization Design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Draco introduced a constraint-based framework to model visualization design\nin an extensible and testable form. It provides a way to abstract design\nguidelines from theoretical and empirical studies and applies the knowledge in\nautomated design tools. However, Draco is challenging to use because there is\nlimited tooling and documentation. In response, we present Draco 2, the\nsuccessor with (1) a more flexible visualization specification format, (2) a\ncomprehensive test suite and documentation, and (3) flexible and convenient\nAPIs. We designed Draco 2 to be more extensible and easier to integrate into\nvisualization systems. We demonstrate these advantages and believe that they\nmake Draco 2 a platform for future research.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:27:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Junran",""],["Gyarmati","P\u00e9ter Ferenc",""],["Zeng","Zehua",""],["Moritz","Dominik",""]]}
{"id":"2308.14248","submitter":"Huei Sears","authors":"Huei Sears, Ryan Chornock, Jay Strader, Daniel A. Perley, Peter K.\n  Blanchard, Raffaella Margutti, Nial R. Tanvir","title":"Constraints on the $z\\sim5$ Star-Forming Galaxy Luminosity Function From\n  $\\textit{Hubble Space Telescope}$ Imaging of an Unbiased and Complete Sample\n  of Long Gamma-ray Burst Host Galaxies","comments":"26 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present rest-frame UV \\textit{Hubble Space Telescope} imaging of the\nlargest and most complete sample of 23 long duration gamma-ray burst (GRB) host\ngalaxies between redshifts 4 and 6. Of these 23, we present new WFC3/F110W\nimaging for 19 of the hosts, which we combine with archival WFC3/F110W and\nWFC3/F140W imaging for the remaining four. We use the photometry of the host\ngalaxies from this sample to characterize both the rest-frame UV luminosity\nfunction (LF) and the size-luminosity relation of the sample. We find that when\nassuming the standard Schechter-function parameterization for the UV LF, the\nGRB host sample is best fit with $\\alpha = -1.30^{+0.30}_{-0.25}$ and $M_* =\n-20.33^{+0.44}_{-0.54}$ mag, which is consistent with results based on $z\\sim5$\nLyman-break galaxies. We find that $\\sim68\\%$ of our size-luminosity\nmeasurements fall within or below the same relation for Lyman-break galaxies at\n$z\\sim4$. This study observationally confirms expectations that at $z\\sim5$\nLyman-break and GRB host galaxies should trace the same population and\ndemonstrates the utility of GRBs as probes of hidden star-formation in the\nhigh-redshift universe. Under the assumption that GRBs unbiasedly trace star\nformation at this redshift, our non-detection fraction of 7/23 is consistent at\nthe $95\\%$-confidence level with $13 - 53\\%$ of star formation at redshift\n$z\\sim5$ occurring in galaxies fainter than our detection limit of $M_{1600 A}\n\\sim -18.3$ mag.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:45:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sears","Huei",""],["Chornock","Ryan",""],["Strader","Jay",""],["Perley","Daniel A.",""],["Blanchard","Peter K.",""],["Margutti","Raffaella",""],["Tanvir","Nial R.",""]]}
{"id":"2308.14249","submitter":"Kun Meng","authors":"Kun Meng, Mattie Ji, Jinyu Wang, Kexin Ding, Henry Kirveslahti, Ani\n  Eloyan, Lorin Crawford","title":"Statistical Inference on Grayscale Images via the Euler-Radon Transform","comments":"85 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tools from topological data analysis have been widely used to represent\nbinary images in many scientific applications. Methods that aim to represent\ngrayscale images (i.e., where pixel intensities instead take on continuous\nvalues) have been relatively underdeveloped. In this paper, we introduce the\nEuler-Radon transform, which generalizes the Euler characteristic transform to\ngrayscale images by using o-minimal structures and Euler integration over\ndefinable functions. Coupling the Karhunen-Loeve expansion with our proposed\ntopological representation, we offer hypothesis-testing algorithms based on the\nchi-squared distribution for detecting significant differences between two\ngroups of grayscale images. We illustrate our framework via extensive numerical\nexperiments and simulations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:54:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meng","Kun",""],["Ji","Mattie",""],["Wang","Jinyu",""],["Ding","Kexin",""],["Kirveslahti","Henry",""],["Eloyan","Ani",""],["Crawford","Lorin",""]]}
{"id":"2308.14250","submitter":"Bowen Xi","authors":"Bowen Xi, Kevin Scaria, Paulo Shakarian","title":"Rule-Based Error Detection and Correction to Operationalize Movement\n  Trajectory Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Classification of movement trajectories has many applications in\ntransportation. Supervised neural models represent the current\nstate-of-the-art. Recent security applications require this task to be rapidly\nemployed in environments that may differ from the data used to train such\nmodels for which there is little training data. We provide a neuro-symbolic\nrule-based framework to conduct error correction and detection of these models\nto support eventual deployment in security applications. We provide a suite of\nexperiments on several recent and state-of-the-art models and show an accuracy\nimprovement of 1.7% over the SOTA model in the case where all classes are\npresent in training and when 40% of classes are omitted from training, we\nobtain a 5.2% improvement (zero-shot) and 23.9% (few-shot) improvement over the\nSOTA model without resorting to retraining of the base model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:57:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xi","Bowen",""],["Scaria","Kevin",""],["Shakarian","Paulo",""]]}
{"id":"2308.14251","submitter":"Jinyong Ma","authors":"Jinyong Ma, Jihua Zhang, Yuxin Jiang, Tongmiao Fan, Matthew Parry,\n  Dragomir N. Neshev, Andrey A. Sukhorukov","title":"Polarization engineering of entangled photons from a lithium niobate\n  nonlinear metasurface","comments":"21 pages, 5 figures, journal paper","journal-ref":null,"doi":"10.1021/acs.nanolett.3c02055","report-no":null,"categories":"physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Complex polarization states of photon pairs are indispensable in various\nquantum technologies. Conventional methods for preparing desired two-photon\npolarization states are realized through bulky nonlinear crystals, which can\nrestrict the versatility and tunability of the generated quantum states due to\nthe fixed crystal nonlinear susceptibility. Here we present a solution using a\nnonlinear metasurface incorporating multiplexed silica metagratings on a\nlithium niobate film of 300 nanometer thickness. We fabricate two orthogonal\nmetagratings on a single substrate with an identical resonant wavelength,\nthereby enabling the spectral indistinguishability of the emitted photons, and\ndemonstrate in experiments that the two-photon polarization states can be\nshaped by the metagrating orientation. Leveraging this essential property, we\nformulate a theoretical approach for generating arbitrary\npolarization-entangled qutrit states by combining three metagratings on a\nsingle metasurface, allowing the encoding of desired quantum states or\ninformation. Our findings enable miniaturized optically controlled quantum\ndevices using ultrathin metasurfaces as polarization-entangled photon sources.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:59:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ma","Jinyong",""],["Zhang","Jihua",""],["Jiang","Yuxin",""],["Fan","Tongmiao",""],["Parry","Matthew",""],["Neshev","Dragomir N.",""],["Sukhorukov","Andrey A.",""]]}
{"id":"2308.14252","submitter":"Shenghai Liao","authors":"Shujun Fu, Shenghai Liao, Jingjing Gao, Shijing Song and Zhonghua Man","title":"Key technologies and application for radar and smart video fusion in\n  perimeter intrusion alarm system","comments":"submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  With the continuous development of modern science and technology, radar\ndetection, video surveillance and perimeter alarm system are more and more\nwidely used in the field of social security. This paper introduces video\nsurveillance and perimeter alarm in detail, mathematical modeling and key\ntechnologies, analyzes their fusion and application status, and puts forward\nsuggestions combined with the development trend of intelligent security system\nin the future.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:03:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fu","Shujun",""],["Liao","Shenghai",""],["Gao","Jingjing",""],["Song","Shijing",""],["Man","Zhonghua",""]]}
{"id":"2308.14253","submitter":"Alexander Titus","authors":"Alexander J. Titus and Adam H. Russell","title":"The Promise and Peril of Artificial Intelligence -- Violet Teaming\n  Offers a Balanced Path Forward","comments":"14 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial intelligence (AI) promises immense benefits across sectors, yet\nalso poses risks from dual-use potentials, biases, and unintended behaviors.\nThis paper reviews emerging issues with opaque and uncontrollable AI systems\nand proposes an integrative framework called violet teaming to develop reliable\nand responsible AI. Violet teaming combines adversarial vulnerability probing\n(red teaming) with solutions for safety and security (blue teaming) while\nprioritizing ethics and social benefit. It emerged from AI safety research to\nmanage risks proactively by design. The paper traces the evolution of red,\nblue, and purple teaming toward violet teaming, and then discusses applying\nviolet techniques to address biosecurity risks of AI in biotechnology.\nAdditional sections review key perspectives across law, ethics, cybersecurity,\nmacrostrategy, and industry best practices essential for operationalizing\nresponsible AI through holistic technical and social considerations. Violet\nteaming provides both philosophy and method for steering AI trajectories toward\nsocietal good. With conscience and wisdom, the extraordinary capabilities of AI\ncan enrich humanity. But without adequate precaution, the risks could prove\ncatastrophic. Violet teaming aims to empower moral technology for the common\nwelfare.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:10:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Titus","Alexander J.",""],["Russell","Adam H.",""]]}
{"id":"2308.14254","submitter":"Lancelot F. James","authors":"Lancelot F. James","title":"Posterior distributions of Gibbs-type priors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Gibbs type priors have been shown to be natural generalizations of Dirichlet\nprocess (DP) priors used for intricate applications of Bayesian nonparametric\nmethods. This includes applications to mixture models and to species sampling\nmodels arising in populations genetics. Notably these latter applications, and\nalso applications where power law behavior such as that arising in natural\nlanguage models are exhibited, provide instances where the DP model is wholly\ninadequate. Gibbs type priors include the DP, the also popular Pitman-Yor\nprocess and closely related normalized generalized gamma process as special\ncases. However, there is in fact a richer infinite class of such priors, where,\ndespite knowledge about the exchangeable marginal structures produced by\nsampling $n$ observations, descriptions of the corresponding posterior\ndistribution, a crucial component in Bayesian analysis, remain unknown. This\npaper presents descriptions of the posterior distributions for the general\nclass, utilizing a novel proof that leverages the exclusive Gibbs properties of\nthese models. The results are applied to several specific cases for further\nillustration.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:13:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["James","Lancelot F.",""]]}
{"id":"2308.14255","submitter":"Jihong Zhao","authors":"Jihong Zhao","title":"Global existence of large solutions for the parabolic-elliptic\n  Keller-Segel system in Besov type spaces","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate global existence of large solutions for the\nparabolic-elliptic Keller-Segel system in the homogeneous Besov type spaces. A\nclass of initial data was presented, generating a global smooth solution\nalthough the $\\dot{B}^{-2}_{\\infty,\\infty}$-norm of the initial data may be\nchosen arbitrarily large.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:16:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Jihong",""]]}
{"id":"2308.14256","submitter":"Yang Liu","authors":"Yang Liu, Cheng Yu, Lei Shang, Ziheng Wu, Xingjun Wang, Yuze Zhao, Lin\n  Zhu, Chen Cheng, Weitao Chen, Chao Xu, Haoyu Xie, Yuan Yao, Wenmeng Zhou,\n  Yingda Chen, Xuansong Xie, Baigui Sun","title":"FaceChain: A Playground for Identity-Preserving Portrait Generation","comments":"This is an ongoing work that will be consistently refined and\n  improved upon","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancement in personalized image generation have unveiled the\nintriguing capability of pre-trained text-to-image models on learning identity\ninformation from a collection of portrait images. However, existing solutions\ncan be vulnerable in producing truthful details, and usually suffer from\nseveral defects such as (i) The generated face exhibit its own unique\ncharacteristics, \\ie facial shape and facial feature positioning may not\nresemble key characteristics of the input, and (ii) The synthesized face may\ncontain warped, blurred or corrupted regions. In this paper, we present\nFaceChain, a personalized portrait generation framework that combines a series\nof customized image-generation model and a rich set of face-related perceptual\nunderstanding models (\\eg, face detection, deep face embedding extraction, and\nfacial attribute recognition), to tackle aforementioned challenges and to\ngenerate truthful personalized portraits, with only a handful of portrait\nimages as input. Concretely, we inject several SOTA face models into the\ngeneration procedure, achieving a more efficient label-tagging,\ndata-processing, and model post-processing compared to previous solutions, such\nas DreamBooth ~\\cite{ruiz2023dreambooth} , InstantBooth\n~\\cite{shi2023instantbooth} , or other LoRA-only approaches ~\\cite{hu2021lora}\n. Through the development of FaceChain, we have identified several potential\ndirections to accelerate development of Face/Human-Centric AIGC research and\napplication. We have designed FaceChain as a framework comprised of pluggable\ncomponents that can be easily adjusted to accommodate different styles and\npersonalized needs. We hope it can grow to serve the burgeoning needs from the\ncommunities. FaceChain is open-sourced under Apache-2.0 license at\n\\url{https://github.com/modelscope/facechain}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:20:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Yang",""],["Yu","Cheng",""],["Shang","Lei",""],["Wu","Ziheng",""],["Wang","Xingjun",""],["Zhao","Yuze",""],["Zhu","Lin",""],["Cheng","Chen",""],["Chen","Weitao",""],["Xu","Chao",""],["Xie","Haoyu",""],["Yao","Yuan",""],["Zhou","Wenmeng",""],["Chen","Yingda",""],["Xie","Xuansong",""],["Sun","Baigui",""]]}
{"id":"2308.14257","submitter":"Yi Zhang","authors":"Yi Zhang, Fred Tutt, Guy N. Evans, Prachi Sharma, Greg Haugstad, Ben\n  Kaiser, Justin Ramberger, Samuel Bayliff, Yu Tao, Mike Manno, Javier\n  Garcia-Barriocanal, Rafael M. Fernandes, Turan Birol, William E. Seyfried\n  Jr., and Chris Leighton","title":"Crystal-Chemical Origins of the Ultrahigh Conductivity of Metallic\n  Delafossites","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite their highly anisotropic complex-oxidic nature, certain delafossite\ncompounds (e.g., PdCoO2) are the most conductive oxides known, for reasons that\nremain poorly understood. It is widely accepted that these materials are\nsomehow ultrapure, although the methods for their growth (which produce only\nsmall crystals) are not typically capable of such. Here, we report a new\napproach to PdCoO2 crystal growth, using chemical vapor transport to achieve\norder-of-magnitude gains in size, the highest structural qualities reported,\nand record residual resistivity ratios (>440). Nevertheless, the first detailed\nmass spectrometry on these materials reveals that they are not ultrapure,\ntypically harboring 100s-of-parts-per-million impurity levels. For\ncrystal-chemical reasons that we elaborate in full, however, the majority of\nthese impurities must reside in Co-O octahedral layers, leaving the conductive\nPd sheets highly pure (~1 ppm). We thus conclude that a \"sublattice\npurification\" mechanism is essential to the ultrahigh low-temperature\nconductivity and mean-free-path of metallic delafossites.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:21:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Yi",""],["Tutt","Fred",""],["Evans","Guy N.",""],["Sharma","Prachi",""],["Haugstad","Greg",""],["Kaiser","Ben",""],["Ramberger","Justin",""],["Bayliff","Samuel",""],["Tao","Yu",""],["Manno","Mike",""],["Garcia-Barriocanal","Javier",""],["Fernandes","Rafael M.",""],["Birol","Turan",""],["Seyfried","William E.","Jr."],["Leighton","Chris",""]]}
{"id":"2308.14258","submitter":"Zitong Li","authors":"Arthur Feeney, Zitong Li, Ramin Bostanabad, Aparna Chandramowlishwaran","title":"Breaking Boundaries: Distributed Domain Decomposition with Scalable\n  Physics-Informed Neural PDE Solvers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mosaic Flow is a novel domain decomposition method designed to scale\nphysics-informed neural PDE solvers to large domains. Its unique approach\nleverages pre-trained networks on small domains to solve partial differential\nequations on large domains purely through inference, resulting in high\nreusability. This paper presents an end-to-end parallelization of Mosaic Flow,\ncombining data parallel training and domain parallelism for inference on\nlarge-scale problems. By optimizing the network architecture and data parallel\ntraining, we significantly reduce the training time for learning the Laplacian\noperator to minutes on 32 GPUs. Moreover, our distributed domain decomposition\nalgorithm enables scalable inferences for solving the Laplace equation on\ndomains 4096 times larger than the training domain, demonstrating strong\nscaling while maintaining accuracy on 32 GPUs. The reusability of Mosaic Flow,\ncombined with the improved performance achieved through the distributed-memory\nalgorithms, makes it a promising tool for modeling complex physical phenomena\nand accelerating scientific discovery.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:25:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Feeney","Arthur",""],["Li","Zitong",""],["Bostanabad","Ramin",""],["Chandramowlishwaran","Aparna",""]]}
{"id":"2308.14259","submitter":"Yixin Wang","authors":"Yixin Wang, Jifan Liang, and Xiao Ma","title":"Partially Constrained GRAND of Linear Block Codes","comments":"8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is concerned with a search-number-reduced guessing random additive\nnoise decoding (GRAND) algorithm for linear block codes, called partially\nconstrained GRAND (PC-GRAND). In contrast to the original GRAND, which guesses\nerror patterns without constraints, the PC-GRAND guesses only those error\npatterns satisfying partial constraints of the codes. In particular, the\nPC-GRAND takes partial rows of the parity-check matrix as constraints for\ngenerating candidate error patterns and the remaining rows as checks for\nvalidating the candidates. The number of searches can be reduced when the\nserial list Viterbi algorithm (SLVA) is implemented for searching over a\ntrellis specified by the partial parity-check matrix. This is confirmed by\nnumerical results. Numerical simulations are also provided for comparison with\nother decoding algorithms.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:30:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yixin",""],["Liang","Jifan",""],["Ma","Xiao",""]]}
{"id":"2308.14260","submitter":"Jun He Prof.","authors":"Dan Song, Shu Chen, Shu-Yi Kong and Jun He","title":"Possible molecular states from interactions of charmed strange baryons","comments":"2 tables, 6 figures. To be published in Chinese Physics C. arXiv\n  admin note: text overlap with arXiv:2208.01879","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we perform an investigation of possible molecular states\ncomposed of two charmed strange baryons from the $\\Xi_c^{(',*)}{\\Xi}_c^{(',*)}$\ninteraction, and their hidden-charm hidden-strange partners from the\n$\\Xi_c^{(',*)}\\bar{\\Xi}_c^{(',*)}$ interaction. With the help of the heavy\nquark chiral effective Lagrangians, the interactions of charmed strange baryons\nare described with light meson exchanges. The potential kernels are\nconstructed, and inserted into the quasipotential Bethe-Salpeter equation. The\nbound states are produced from most interactions considered, which suggests\nthat strong attractions exist widely between the charmed strange baryons.\nExperimental searching for such molecular states is suggested in future\nhigh-precision measurements.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:34:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Song","Dan",""],["Chen","Shu",""],["Kong","Shu-Yi",""],["He","Jun",""]]}
{"id":"2308.14261","submitter":"C P Premchand","authors":"C.P. Premchand, Abin Krishnan, Manikandan Raghunathan, Midhun\n  Raghunath, Reeja K.V., R. I. Sujith and Vineeth Nair","title":"Control of thermoacoustic instability through Lagrangian saddle point\n  analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a framework of Lagrangian Coherent Structures (LCS) to elucidate\nthe shear layers and coherent structures to understand the mechanism of\ngeneration of tonal sound during thermoacoustic instability. Experiments were\nperformed on a bluff-body stabilized turbulent combustor in the state of\nthermoacoustic instability. We use dynamic mode decomposition (DMD) on the\nflow-field to identify dynamical regions where the acoustic frequency is\ndominant. We find that the separating shear layer from the backward-facing step\nof the combustor envelops a cylindrical vortex in the outer recirculation zone\n(ORZ), eventually impinging on the top wall of the combustor during\nthermoacoustic instability. The production of tonal sound is due to the\nsynchronous motion of this shear layer with the shear layer emerging from the\nleading edge of the bluff-body causing the fluid to squeeze and expand between\nthem periodically. To de-synchronize the oscillations in an optimal manner, we\ntrack the Lagrangian saddle points in the shear layer emerging from the\nbackward facing step over several acoustic cycles. A passive control strategy\nis then developed by injecting a steady stream of secondary air targeting the\noptimal locations thus identified. After implementing the control action, the\nflow-field is also analysed using LCS to understand the key differences in flow\ndynamics. We find that the shear layer emerging from the dump plane are\ndeflected in a direction almost parallel to the axis of the combustor after the\ncontrol action. This deflection in turn prevents the shear layer from\nenveloping the vortex and impinging on the combustor walls, resulting in a\ndrastic reduction of the amplitude of the acoustic field.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:37:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Premchand","C. P.",""],["Krishnan","Abin",""],["Raghunathan","Manikandan",""],["Raghunath","Midhun",""],["V.","Reeja K.",""],["Sujith","R. I.",""],["Nair","Vineeth",""]]}
{"id":"2308.14262","submitter":"Dongsheng Wang","authors":"Hang Li, Kai Wang, Shijie Wei, Fan Yang, Xinyu Chen, Barry C. Sanders,\n  Dong-Sheng Wang, and Gui-Lu Long","title":"Experimental simulation of quantum superchannels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Simulating quantum physical processes has been one of the major motivations\nfor quantum information science. Quantum channels, which are completely\npositive and trace preserving processes, are the standard mathematical language\nto describe quantum evolution, while in recent years quantum superchannels have\nemerged as the substantial extension. Superchannels capture effects of quantum\nmemory and non-Markovianality more precisely, and have found broad applications\nin universal models, algorithm, metrology, discrimination tasks, as examples.\nHere, we report an experimental simulation of qubit superchannels in a nuclear\nmagnetic resonance (NMR) system with high accuracy, based on a recently\ndeveloped quantum algorithm for superchannel simulation. Our algorithm applies\nto arbitrary target superchannels, and our experiment shows the high quality of\nNMR simulators for near-term usage. Our approach can also be adapted to other\nexperimental systems and demonstrates prospects for more applications of\nsuperchannels.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:37:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Hang",""],["Wang","Kai",""],["Wei","Shijie",""],["Yang","Fan",""],["Chen","Xinyu",""],["Sanders","Barry C.",""],["Wang","Dong-Sheng",""],["Long","Gui-Lu",""]]}
{"id":"2308.14263","submitter":"Tianshi Wang","authors":"Lei Zhu, Tianshi Wang, Fengling Li, Jingjing Li, Zheng Zhang and Heng\n  Tao Shen","title":"Cross-Modal Retrieval: A Systematic Review of Methods and Future\n  Directions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the exponential surge in diverse multi-modal data, traditional uni-modal\nretrieval methods struggle to meet the needs of users demanding access to data\nfrom various modalities. To address this, cross-modal retrieval has emerged,\nenabling interaction across modalities, facilitating semantic matching, and\nleveraging complementarity and consistency between different modal data.\nAlthough prior literature undertook a review of the cross-modal retrieval\nfield, it exhibits numerous deficiencies pertaining to timeliness, taxonomy,\nand comprehensiveness. This paper conducts a comprehensive review of\ncross-modal retrieval's evolution, spanning from shallow statistical analysis\ntechniques to vision-language pre-training models. Commencing with a\ncomprehensive taxonomy grounded in machine learning paradigms, mechanisms, and\nmodels, the paper then delves deeply into the principles and architectures\nunderpinning existing cross-modal retrieval methods. Furthermore, it offers an\noverview of widely used benchmarks, metrics, and performances. Lastly, the\npaper probes the prospects and challenges that confront contemporary\ncross-modal retrieval, while engaging in a discourse on potential directions\nfor further progress in the field. To facilitate the research on cross-modal\nretrieval, we develop an open-source code repository at\nhttps://github.com/BMC-SDNU/Cross-Modal-Retrieval.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:38:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Lei",""],["Wang","Tianshi",""],["Li","Fengling",""],["Li","Jingjing",""],["Zhang","Zheng",""],["Shen","Heng Tao",""]]}
{"id":"2308.14264","submitter":"Jun He Prof.","authors":"Zuo-ming Ding and Jun He","title":"Combined analysis on nature of $X(3960)$, $\\chi_{c0}(3930)$, and\n  $X_0(4140)$","comments":"4 figures, to be published in Euro. Phys. J. C","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, a study of the $D_s\\bar{D}_s$ interaction and its couplings to\nthe channels $D\\bar{D}$ and $J/\\psi \\phi$ is performed in a quasipotential\nBethe-Salpeter equation approach. The $D_s^+{D}_s^-$ and $D^+{D}^-$ invariant\nmass spectra in three-body $B$ decays are investigated in order to understand\nthe origin of $X(3960)$, $\\chi_{c0}(3930)$, and $X_0(4140)$ structures reported\nat LHCb. With the help of effective Lagrangians, the potential kernel can be\nconstructed with meson exchanges, from which the scattering amplitudes can be\nobtained. By inserting it into the three-body decay processes, the invariant\nmass spectra can be calculated with an additional Breit-Wigner resonance\nintroduced. The $D_s^+{D}_s^-$ invariant mass spectrum in the decay process\n$B^+\\to D^+_sD^-_sK^+$ is well reproduced, and the $X(3960)$ structure can be\nexplained as a molecular state from the $D_s\\bar{D}_s$ interaction. The state\nalso exhibits as a peak in the $D^+{D}^-$ invariant mass spectrum in the decay\n$B^+\\to D^+D^-K^+$, however, it is too narrow to reproduce the experimental\nstructure around 3930~MeV. The dip around 4140~MeV in the $D_s^+{D}_s^-$\ninvariant mass spectrum can be reproduced by the additional resonance with\ninterference effect. However, a small bump instead of a dip is produced from\nthe $D_s\\bar{D}_s-J/\\psi \\phi$ coupled-channel effect, which suggests that the\n$X_0(4140)$ cannot be interpreted as the $D_s\\bar{D}_s-J/\\psi \\phi$ coupling in\nthe current model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:43:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ding","Zuo-ming",""],["He","Jun",""]]}
{"id":"2308.14265","submitter":"Masako Kishida","authors":"Masako Kishida","title":"A Risk-Aware Control: Integrating Worst-Case CVaR with Control Barrier\n  Function","comments":"under review","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper proposes a risk-aware control approach to enforce safety for\ndiscrete-time nonlinear systems subject to stochastic uncertainties. We derive\nsome useful results on the worst-case Conditional Value-at-Risk (CVaR) and\ndefine a discrete-time risk-aware control barrier function using the worst-case\nCVaR. On this basis, we present optimization-based control approaches that\nintegrate the worst-case CVaR into the control barrier function, taking into\naccount both safe set and tail risk considerations. In particular, three types\nof safe sets are discussed in detail: half-space, polytope, and ellipsoid. It\nis shown that control inputs for the half-space and polytopic safe sets can be\nobtained via quadratic programs, while control inputs for the ellipsoidal safe\nset can be computed via a semidefinite program. Through numerical examples of\nan inverted pendulum, we compare its performance with existing methods and\ndemonstrate the effectiveness of our proposed controller.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:46:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kishida","Masako",""]]}
{"id":"2308.14266","submitter":"Wen Yu Chang Morris","authors":"Wen-Yu Chang, Yun-Nung Chen","title":"SalesBot 2.0: A Human-Like Intent-Guided Chit-Chat Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In recent research on dialogue systems and corpora, there has been a\nsignificant focus on two distinct categories: task-oriented (TOD) and\nopen-domain (chit-chat) dialogues. TOD systems aim to satisfy specific user\ngoals, such as finding a movie to watch, whereas open-domain systems primarily\nfocus on generating engaging conversations. A recent study by Chiu et al.\n(2022) introduced SalesBot, which provides simulators and a dataset with\none-turn transition from chit-chat to task-oriented dialogues. However, the\npreviously generated data solely relied on BlenderBot, which raised concerns\nabout its long-turn naturalness and consistency during a conversation. To\naddress this issue, this paper aims to build SalesBot 2.0, a revised version of\nthe published data, by leveraging the commonsense knowledge of large language\nmodels (LLMs) through proper prompting. The objective is to gradually bridge\nthe gap between chit-chat and TOD towards better naturalness and consistency.\nThe newly released large-scale dataset with detailed annotations exhibits\nsmoother transitions between topics and is more human-like in terms of\nnaturalness and consistency. It can serve as a valuable resource for both\nacademic research and commercial applications. Furthermore, our proposed\nframework can be applied to generate numerous dialogues with various target\nintents.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:48:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chang","Wen-Yu",""],["Chen","Yun-Nung",""]]}
{"id":"2308.14267","submitter":"Jingyao Wang","authors":"Jingyao Wang, Zeen Song, Wenwen Qiang, Changwen Zheng","title":"Unleash Model Potential: Bootstrapped Meta Self-supervised Learning","comments":"submitted to NIPS","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The long-term goal of machine learning is to learn general visual\nrepresentations from a small amount of data without supervision, mimicking\nthree advantages of human cognition: i) no need for labels, ii) robustness to\ndata scarcity, and iii) learning from experience. Self-supervised learning and\nmeta-learning are two promising techniques to achieve this goal, but they both\nonly partially capture the advantages and fail to address all the problems.\nSelf-supervised learning struggles to overcome the drawbacks of data scarcity,\nwhile ignoring prior knowledge that can facilitate learning and generalization.\nMeta-learning relies on supervised information and suffers from a bottleneck of\ninsufficient learning. To address these issues, we propose a novel Bootstrapped\nMeta Self-Supervised Learning (BMSSL) framework that aims to simulate the human\nlearning process. We first analyze the close relationship between meta-learning\nand self-supervised learning. Based on this insight, we reconstruct tasks to\nleverage the strengths of both paradigms, achieving advantages i and ii.\nMoreover, we employ a bi-level optimization framework that alternates between\nsolving specific tasks with a learned ability (first level) and improving this\nability (second level), attaining advantage iii. To fully harness its power, we\nintroduce a bootstrapped target based on meta-gradient to make the model its\nown teacher. We validate the effectiveness of our approach with comprehensive\ntheoretical and empirical study.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:49:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Jingyao",""],["Song","Zeen",""],["Qiang","Wenwen",""],["Zheng","Changwen",""]]}
{"id":"2308.14268","submitter":"Jihao Liu","authors":"Jihao Liu, Wenfei Liu","title":"The minimal volume of surfaces of log general type with non-empty\n  non-klt locus","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that the minimal volume of surfaces of log general type, with\nnon-empty non-klt locus on the ample model, is $\\frac{1}{825}$. Furthermore,\nthe ample model $V$ achieving the minimal volume is determined uniquely up to\nisomorphism. The canonical embedding presents $V$ as a degree $86$ hypersurface\nof $\\mathbb P(6,11,25,43)$. This motivates a one-parameter deformation of $V$\nto klt stable surfaces within the weighted projective space. Consequently, we\nidentify a $\\textit{complete}$ rational curve in the corresponding moduli space\n$M_{\\frac{1}{825}}$.\n  As an important application, we deduce that the smallest accumulation point\nof the set of volumes for projective log canonical surfaces equals\n$\\frac{1}{825}$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:50:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Jihao",""],["Liu","Wenfei",""]]}
{"id":"2308.14269","submitter":"Elad Liebman","authors":"Elad Liebman, Peter Stone","title":"Utilizing Mood-Inducing Background Music in Human-Robot Interaction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Past research has clearly established that music can affect mood and that\nmood affects emotional and cognitive processing, and thus decision-making. It\nfollows that if a robot interacting with a person needs to predict the person's\nbehavior, knowledge of the music the person is listening to when acting is a\npotentially relevant feature. To date, however, there has not been any concrete\nevidence that a robot can improve its human-interactive decision-making by\ntaking into account what the person is listening to. This research fills this\ngap by reporting the results of an experiment in which human participants were\nrequired to complete a task in the presence of an autonomous agent while\nlistening to background music. Specifically, the participants drove a simulated\ncar through an intersection while listening to music. The intersection was not\nempty, as another simulated vehicle, controlled autonomously, was also crossing\nthe intersection in a different direction. Our results clearly indicate that\nsuch background information can be effectively incorporated in an agent's world\nrepresentation in order to better predict people's behavior. We subsequently\nanalyze how knowledge of music impacted both participant behavior and the\nresulting learned policy.\\setcounter{footnote}{2}\\footnote{An earlier version\nof part of the material in this paper appeared originally in the first author's\nPh.D. Dissertation~\\cite{liebman2020sequential} but it has not appeared in any\npear-reviewed conference or journal.}\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:54:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liebman","Elad",""],["Stone","Peter",""]]}
{"id":"2308.14270","submitter":"Junle Pei","authors":"Junle Pei, Xinchou Lou, Yaquan Fang, Jinfei Wu","title":"Radiative leptonic decay of heavy quarkonia","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study examines the properties of heavy quarkonia $X$ by treating them as\nbound states of $Q$ and $\\bar{Q}$, where $Q$ represents either a charm or a\nbottom quark. The branching ratios for the radiative leptonic decays\n$X\\rightarrow \\gamma l^{+} l^{-}$ are revisited and the angular and\nenergy/momentum distributions of the final state particles are analyzed in the\nrest frame of $X$. Furthermore, we apply Lorentz transformations from the rest\nframe of $X$ to the center-of-mass frame of $l^+ l^-$ to establish the\nconnection between the widths ${\\Gamma_{X \\rightarrow \\gamma l^{+} l^{-}}}$ and\n${\\Gamma_{X \\rightarrow l^{+} l^{-}}}$. The connection aligns well with those\ndocumented in the literature (divided by $2\\pi$) for various $X$ states, such\nas $J/\\Psi$, $\\Psi(2S)$, $\\Upsilon(1S)$, and $\\Upsilon(2S)$, exhibiting good\nagreements within 10\\%. However, we observe a significant disparity in the\nratio between ${\\Gamma_{\\Psi(2S) \\to \\gamma \\tau^+ \\tau^-}}$ and\n${\\Gamma_{\\Psi(2S) \\to \\tau^+ \\tau^-}}$, with our prediction being four times\nlarger than those in the literature. The outcomes derived from this study held\npractical implications in describing the QED radiative processes and contribute\nto the investigation of QCD processes associated with the decays of heavy\nquarkonia and the searches for new physics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 02:57:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pei","Junle",""],["Lou","Xinchou",""],["Fang","Yaquan",""],["Wu","Jinfei",""]]}
{"id":"2308.14271","submitter":"Sergio Mendoza","authors":"Sergio Mendoza","title":"Metric tensor at second perturbation order for spherically symmetric\n  space-times","comments":"5 pages, published in the International Journal of Geometric Methods\n  in Modern Physics","journal-ref":"International Journal of Geometric Methods in Modern Physics Vol.\n  20, No. 07, 2350107 (2023)","doi":"10.1142/S0219887823501074","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is shown in this article that if the Einstein Equivalence Principle is\nvalid on a particular metric theory of gravitation in a spherically symmetric\nspace-time, then the time metric component is not equal to the negative of the\ninverse radial one unless the underlying potential is inversely proportional to\nthe radial coordinate. At the weak field limit of approximation, a general\nformula is calculated and applied to some useful cases.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:00:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mendoza","Sergio",""]]}
{"id":"2308.14272","submitter":"Jennifer Hsia","authors":"Jennifer Hsia, Danish Pruthi, Aarti Singh, Zachary C. Lipton","title":"Goodhart's Law Applies to NLP's Explanation Benchmarks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the rising popularity of saliency-based explanations, the research\ncommunity remains at an impasse, facing doubts concerning their purpose,\nefficacy, and tendency to contradict each other. Seeking to unite the\ncommunity's efforts around common goals, several recent works have proposed\nevaluation metrics. In this paper, we critically examine two sets of metrics:\nthe ERASER metrics (comprehensiveness and sufficiency) and the EVAL-X metrics,\nfocusing our inquiry on natural language processing. First, we show that we can\ninflate a model's comprehensiveness and sufficiency scores dramatically without\naltering its predictions or explanations on in-distribution test inputs. Our\nstrategy exploits the tendency for extracted explanations and their complements\nto be \"out-of-support\" relative to each other and in-distribution inputs. Next,\nwe demonstrate that the EVAL-X metrics can be inflated arbitrarily by a simple\nmethod that encodes the label, even though EVAL-X is precisely motivated to\naddress such exploits. Our results raise doubts about the ability of current\nmetrics to guide explainability research, underscoring the need for a broader\nreassessment of what precisely these metrics are intended to capture.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:03:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hsia","Jennifer",""],["Pruthi","Danish",""],["Singh","Aarti",""],["Lipton","Zachary C.",""]]}
{"id":"2308.14273","submitter":"Shinpei Hayashi","authors":"Motoki Abe, Shinpei Hayashi","title":"RefSearch: A Search Engine for Refactoring","comments":"6 pages, ICSME 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Developers often refactor source code to improve its quality during software\ndevelopment. A challenge in refactoring is to determine if it can be applied or\nnot. To help with this decision-making process, we aim to search for past\nrefactoring cases that are similar to the current refactoring scenario. We have\ndesigned and implemented a system called RefSearch that enables users to search\nfor refactoring cases through a user-friendly query language. The system\ncollects refactoring instances using two refactoring detectors and provides a\nweb interface for querying and browsing the cases. We used four refactoring\nscenarios as test cases to evaluate the expressiveness of the query language\nand the search performance of the system. RefSearch is available at\nhttps://github.com/salab/refsearch.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:04:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Abe","Motoki",""],["Hayashi","Shinpei",""]]}
{"id":"2308.14274","submitter":"Hongye Liu","authors":"Hongye Liu, Xianhai Xie, Yang Gao, Size Li, Zhou YU","title":"Parameter-Efficient Transfer Learning for Audio-Visual-Language Tasks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pretrain-then-finetune paradigm has been widely used in various unimodal\nand multimodal tasks. However, finetuning all the parameters of a pre-trained\nmodel becomes prohibitive as the model size grows exponentially. To address\nthis issue, the adapter mechanism that freezes the pre-trained model and only\nfinetunes a few extra parameters is introduced and delivers promising results.\nMost studies on adapter architectures are dedicated to unimodal or bimodal\ntasks, while the adapter architectures for trimodal tasks have not been\ninvestigated yet. This paper introduces a novel Long Short-Term Trimodal\nAdapter (LSTTA) approach for video understanding tasks involving audio, visual,\nand language modalities. Based on the pre-trained from the three modalities,\nthe designed adapter module is inserted between the sequential blocks to model\nthe dense interactions across the three modalities. Specifically, LSTTA\nconsists of two types of complementary adapter modules, namely the long-term\nsemantic filtering module and the short-term semantic interaction module. The\nlong-term semantic filtering aims to characterize the temporal importance of\nthe video frames and the short-term semantic interaction module models local\ninteractions within short periods. Compared to previous state-of-the-art\ntrimodal learning methods pre-trained on a large-scale trimodal corpus, LSTTA\nis more flexible and can inherit any powerful unimodal or bimodal models.\nExperimental results on four typical trimodal learning tasks show the\neffectiveness of LSTTA over existing state-of-the-art methods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:13:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Hongye",""],["Xie","Xianhai",""],["Gao","Yang",""],["Li","Size",""],["YU","Zhou",""]]}
{"id":"2308.14275","submitter":"Yuki Fujii","authors":"Yuki Fujii (for the COMET Collaboration)","title":"A search for a muon to electron conversion in COMET","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The COMET experiment at J-PARC, Japan, aims to search for muon to electron\nconversion with aluminium nuclei, achieving a sensitivity four orders of\nmagnitude higher than the current upper limit at a 90% confidence level. The\nproton beam line has recently been completed, and muons have been successfully\ntransported through the curved solenoid in the Phase-alpha of the experiment.\nIn this paper, we will present preliminary results from the Phase-alpha beam\nmeasurement, the status of the intermediate sensitivity experiment (COMET\nPhase-I), and the ultimate goal of COMET Phase-II.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:13:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fujii","Yuki","","for the COMET Collaboration"]]}
{"id":"2308.14276","submitter":"Yuhan Quan","authors":"Yuhan Quan, Jingtao Ding, Chen Gao, Nian Li, Lingling Yi, Depeng Jin,\n  Yong Li","title":"Alleviating Video-Length Effect for Micro-video Recommendation","comments":"Accept by TOIS","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Micro-videos platforms such as TikTok are extremely popular nowadays. One\nimportant feature is that users no longer select interested videos from a set,\ninstead they either watch the recommended video or skip to the next one. As a\nresult, the time length of users' watching behavior becomes the most important\nsignal for identifying preferences. However, our empirical data analysis has\nshown a video-length effect that long videos are easier to receive a higher\nvalue of average view time, thus adopting such view-time labels for measuring\nuser preferences can easily induce a biased model that favors the longer\nvideos. In this paper, we propose a Video Length Debiasing Recommendation\n(VLDRec) method to alleviate such an effect for micro-video recommendation.\nVLDRec designs the data labeling approach and the sample generation module that\nbetter capture user preferences in a view-time oriented manner. It further\nleverages the multi-task learning technique to jointly optimize the above\nsamples with original biased ones. Extensive experiments show that VLDRec can\nimprove the users' view time by 1.81% and 11.32% on two real-world datasets,\ngiven a recommendation list of a fixed overall video length, compared with the\nbest baseline method. Moreover, VLDRec is also more effective in matching\nusers' interests in terms of the video content.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:15:37 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:05:51 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Quan","Yuhan",""],["Ding","Jingtao",""],["Gao","Chen",""],["Li","Nian",""],["Yi","Lingling",""],["Jin","Depeng",""],["Li","Yong",""]]}
{"id":"2308.14277","submitter":"Changyi Lin","authors":"Changyi Lin, Han Zhang, Jikai Xu, Lei Wu, Huazhe Xu","title":"9DTact: A Compact Vision-Based Tactile Sensor for Accurate 3D Shape\n  Reconstruction and Generalizable 6D Force Estimation","comments":"Project Website: https://linchangyi1.github.io/9DTact/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The advancements in vision-based tactile sensors have boosted the aptitude of\nrobots to perform contact-rich manipulation, particularly when precise\npositioning and contact state of the manipulated objects are crucial for\nsuccessful execution. In this work, we present 9DTact, a straightforward yet\nversatile tactile sensor that offers 3D shape reconstruction and 6D force\nestimation capabilities. Conceptually, 9DTact is designed to be highly compact,\nrobust, and adaptable to various robotic platforms. Moreover, it is low-cost\nand DIY-friendly, requiring minimal assembly skills. Functionally, 9DTact\nbuilds upon the optical principles of DTact and is optimized to achieve 3D\nshape reconstruction with enhanced accuracy and efficiency. Remarkably, we\nleverage the optical and deformable properties of the translucent gel so that\n9DTact can perform 6D force estimation without the participation of auxiliary\nmarkers or patterns on the gel surface. More specifically, we collect a dataset\nconsisting of approximately 100,000 image-force pairs from 175 complex objects\nand train a neural network to regress the 6D force, which can generalize to\nunseen objects. To promote the development and applications of vision-based\ntactile sensors, we open-source both the hardware and software of 9DTact as\nwell as present a 1-hour video tutorial.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:17:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lin","Changyi",""],["Zhang","Han",""],["Xu","Jikai",""],["Wu","Lei",""],["Xu","Huazhe",""]]}
{"id":"2308.14278","submitter":"Wenwen Zheng","authors":"Xuliu Yang, Xuechun Chen, Wenwen Zheng, Yu Luo","title":"Simulation Of The Microlensing Effect Near The Critical Curve Of The\n  Galaxy Cluster","comments":"17 pages, 5 figures, accepted for publication in Acta Astronomica\n  Sinica","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In the smooth mass distribution model, the critical curve represents a line\nwith magnification divergence on the image plane in a strong gravitational\nlensing system. Considering the microlensing effects caused by discrete masses,\nthe magnification map in the source plane exhibits a complex structure, which\noffers a promising way for detecting dark matter. However, simulating\nmicrolensing near the critical curve poses challenges due to magnification\ndivergence and the substantial computational demands involved. To achieve the\nrequired simulation accuracy, direct inverse ray-shooting would require\nsignificant computational resources. Therefore we applied a GPU-based code\noptimized with interpolation method to enable efficient computation on a large\nscale. Using the GPU of NVIDIA Tesla V100S PCIe 32GB, it takes approximately\n7000 seconds to calculate the effects of around 13,000 microlenses for a\nsimulation involving 1013 emitted rays. Then we generated 80 magnification\nmaps, and select 800 light curves for a statistical analysis of microcaustic\ndensity and peak magnification.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:25:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Xuliu",""],["Chen","Xuechun",""],["Zheng","Wenwen",""],["Luo","Yu",""]]}
{"id":"2308.14279","submitter":"Bo Jiao","authors":"Bo Jiao","title":"Sampling unknown large networks restricted by low sampling rates","comments":"18 pages,12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph sampling plays an important role in data mining for large networks.\nSpecifically, larger networks often correspond to lower sampling rates. Under\nthe situation, traditional traversal-based samplings for large networks usually\nhave an excessive preference for densely-connected network core nodes. Aim at\nthis issue, this paper proposes a sampling method for unknown networks at low\nsampling rates, called SLSR, which first adopts a random node sampling to\nevaluate a degree threshold, utilized to distinguish the core from periphery,\nand the average degree in unknown networks, and then runs a double-layer\nsampling strategy on the core and periphery. SLSR is simple and has a high time\nefficiency, but experimental evaluation confirms that the proposed method can\naccurately preserve many critical structures of unknown large networks at\nsampling rates not exceeding 10%.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:26:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiao","Bo",""]]}
{"id":"2308.14280","submitter":"Bonaventure F. P. Dossou","authors":"Bonaventure F. P. Dossou, Iffanice Houndayi, Pamely Zantou, Gilles\n  Hacheme","title":"FonMTL: Towards Multitask Learning for the Fon Language","comments":"Accepted at WiNLP workshop, co-located at EMNLP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Fon language, spoken by an average 2 million of people, is a truly\nlow-resourced African language, with a limited online presence, and existing\ndatasets (just to name but a few). Multitask learning is a learning paradigm\nthat aims to improve the generalization capacity of a model by sharing\nknowledge across different but related tasks: this could be prevalent in very\ndata-scarce scenarios. In this paper, we present the first explorative approach\nto multitask learning, for model capabilities enhancement in Natural Language\nProcessing for the Fon language. Specifically, we explore the tasks of Named\nEntity Recognition (NER) and Part of Speech Tagging (POS) for Fon. We leverage\ntwo language model heads as encoders to build shared representations for the\ninputs, and we use linear layers blocks for classification relative to each\ntask. Our results on the NER and POS tasks for Fon, show competitive (or\nbetter) performances compared to several multilingual pretrained language\nmodels finetuned on single tasks. Additionally, we perform a few ablation\nstudies to leverage the efficiency of two different loss combination strategies\nand find out that the equal loss weighting approach works best in our case. Our\ncode is open-sourced at https://github.com/bonaventuredossou/multitask_fon.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:26:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dossou","Bonaventure F. P.",""],["Houndayi","Iffanice",""],["Zantou","Pamely",""],["Hacheme","Gilles",""]]}
{"id":"2308.14281","submitter":"Xiujuan Li","authors":"Xiu-Juan Li and Yu-Peng Yang","title":"Signatures of the Self-organized Criticality Phenomenon in Precursors of\n  Gamma-ray bursts","comments":"Accepted for publication in ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Precursors provide important clues to the nature of gamma-ray burst (GRB)\ncentral engines and can be used to contain GRB physical processes. In this\nletter, we study the self-organized criticality in precursors of long GRBs in\nthe third Swift/BAT Catalog. We investigate the differential and cumulative\nsize distributions of 100 precursors, including peak flux, duration, rise time,\ndecay time, and quiescent time with the Markov Chain Monte Carlo technique. It\nis found that all of the distributions can be well described by power-law\nmodels and understood within the physical framework of a self-organized\ncriticality system. In addition, we inspect the cumulative distribution\nfunctions of the size differences with a q-Gaussian function. The\nscale-invariance structures of precursors further strengthen our findings.\nParticularly, similar analyses are made in 127 main bursts. The results show\nthat both precursors and main bursts can be attributed to an self-organized\ncriticality system with the spatial dimension S = 3 and driven by the similar\nmagnetically dominated process.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:29:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Xiu-Juan",""],["Yang","Yu-Peng",""]]}
{"id":"2308.14282","submitter":"Martial Longla","authors":"Martial Longla and Mous-Abou Hamadou","title":"Estimation problems for some perturbations of the independence copula","comments":"35 pages, 13 figures, 3 tables; Presented at 2023 MS-Alabama chapter\n  if ASA conference","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST math.PR stat.ME stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work provides a study of parameter estimators based on functions of\nMarkov chains generated by some perturbations of the independence copula. We\nprovide asymptotic distributions of maximum likelihood estimators and\nconfidence intervals for copula parameters of several families of copulas\nintroduced in Longla (2023). Another set of moment-like estimators is proposed\nalong with a multivariate central limit theorem, that provides their asymptotic\ndistributions. We investigate the particular case of Markov chains generated by\nsine copulas, sine-cosine copulas and the extended Farlie-Gumbel-Morgenstern\ncopula family. Some tests of independence are proposed. A simulation study is\nprovided for the three copula families of interest. This simulation proposes a\ncomparative study of the two introduced estimators and the robust estimator of\nLongla and Peligrad (2021), showing advantages of the proposed work.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:35:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Longla","Martial",""],["Hamadou","Mous-Abou",""]]}
{"id":"2308.14283","submitter":"David Cheban","authors":"David Cheban","title":"Averaging Principle on Semi-axis for Semi-linear Differential Equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We establish an averaging principle on the real semi-axis for semi-linear\nequation \\begin{equation}\\label{eqAb1} x'=\\varepsilon (\\mathcal A\nx+f(t)+F(t,x))\\nonumber \\end{equation} with unbounded closed linear operator\n$\\mathcal A$ and asymptotically Poisson stable (in particular, asymptotically\nstationary, asymptotically periodic, asymptotically quasi-periodic,\nasymptotically almost periodic, asymptotically almost automorphic,\nasymptotically recurrent) coefficients. Under some conditions we prove that\nthere exists at least one solution, which possesses the same asymptotically\nrecurrence property as the coefficients, in a small neighborhood of the\nstationary solution to the averaged equation, and this solution converges to\nthe stationary solution of averaged equation uniformly on the real semi-axis\nwhen the small parameter approaches to zero.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:43:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheban","David",""]]}
{"id":"2308.14284","submitter":"Longchao Da","authors":"Longchao Da, Minchiuan Gao, Hao Mei, Hua Wei","title":"LLM Powered Sim-to-real Transfer for Traffic Signal Control","comments":"9 pages, 7 figures. arXiv admin note: text overlap with\n  arXiv:2307.12388","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Numerous solutions are proposed for the Traffic Signal Control (TSC) tasks\naiming to provide efficient transportation and mitigate congestion waste. In\nrecent, promising results have been attained by Reinforcement Learning (RL)\nmethods through trial and error in simulators, bringing confidence in solving\ncities' congestion headaches. However, there still exist performance gaps when\nsimulator-trained policies are deployed to the real world. This issue is mainly\nintroduced by the system dynamic difference between the training simulator and\nthe real-world environments. The Large Language Models (LLMs) are trained on\nmass knowledge and proved to be equipped with astonishing inference abilities.\nIn this work, we leverage LLMs to understand and profile the system dynamics by\na prompt-based grounded action transformation. Accepting the cloze prompt\ntemplate, and then filling in the answer based on accessible context, the\npre-trained LLM's inference ability is exploited and applied to understand how\nweather conditions, traffic states, and road types influence traffic dynamics,\nbeing aware of this, the policies' action is taken and grounded based on\nrealistic dynamics, thus help the agent learn a more realistic policy. We\nconduct experiments using DQN to show the effectiveness of the proposed\nPromptGAT's ability in mitigating the performance gap from simulation to\nreality (sim-to-real).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:49:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Da","Longchao",""],["Gao","Minchiuan",""],["Mei","Hao",""],["Wei","Hua",""]]}
{"id":"2308.14285","submitter":"Thulasi K R","authors":"K. R. Thulasi, T. Duraivel, and S. Mangayarcarassy","title":"Product of prime ideals as factorization of submodules","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  For a proper submodule $N$ of a finitely generated module $M$ over a\nNoetherian ring, the product of prime ideals which occur in a regular prime\nextension filtration of $M$ over $N$ is defined as its generalized prime ideal\nfactorization in $M$. In this article, we find conditions for a product of\nprime ideals to be the generalized prime ideal factorization of a submodule of\nsome module. We show that a power of a prime ideal occurs in a generalized\nprime ideal factorization only if it is not equal to its lesser powers. Also,\nwe show that ${{\\mathfrak{p}}_1}^{r_1} \\cdots {{\\mathfrak{p}}_{n}}^{r_{n}}$ is\na generalized prime ideal factorization if and only if for each $1 \\leq i \\leq\nn$, ${{\\mathfrak{p}}_i}^{r_i}$ is the generalized prime ideal factorization of\nsome submodule of a module.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:54:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Thulasi","K. R.",""],["Duraivel","T.",""],["Mangayarcarassy","S.",""]]}
{"id":"2308.14286","submitter":"Xi Li","authors":"Longrong Yang, Xianpan Zhou, Xuewei Li, Liang Qiao, Zheyang Li, Ziwei\n  Yang, Gaoang Wang, Xi Li","title":"Bridging Cross-task Protocol Inconsistency for Distillation in Dense\n  Object Detection","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge distillation (KD) has shown potential for learning compact models\nin dense object detection. However, the commonly used softmax-based\ndistillation ignores the absolute classification scores for individual\ncategories. Thus, the optimum of the distillation loss does not necessarily\nlead to the optimal student classification scores for dense object detectors.\nThis cross-task protocol inconsistency is critical, especially for dense object\ndetectors, since the foreground categories are extremely imbalanced. To address\nthe issue of protocol differences between distillation and classification, we\npropose a novel distillation method with cross-task consistent protocols,\ntailored for the dense object detection. For classification distillation, we\naddress the cross-task protocol inconsistency problem by formulating the\nclassification logit maps in both teacher and student models as multiple\nbinary-classification maps and applying a binary-classification distillation\nloss to each map. For localization distillation, we design an IoU-based\nLocalization Distillation Loss that is free from specific network structures\nand can be compared with existing localization distillation losses. Our\nproposed method is simple but effective, and experimental results demonstrate\nits superiority over existing methods. Code is available at\nhttps://github.com/TinyTigerPan/BCKD.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:57:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Longrong",""],["Zhou","Xianpan",""],["Li","Xuewei",""],["Qiao","Liang",""],["Li","Zheyang",""],["Yang","Ziwei",""],["Wang","Gaoang",""],["Li","Xi",""]]}
{"id":"2308.14287","submitter":"Jun Le Goh","authors":"James S. Barnes, Jun Le Goh, Richard A. Shore","title":"Halin's Infinite Ray Theorems: Complexity and Reverse Mathematics:\n  Version E","comments":"51 pages, 4 figures, Version E","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for\neach $n$ then it has infinitely many pairwise disjoint rays. We analyze the\ncomplexity of this and other similar results in terms of computable and proof\ntheoretic complexity. The statement of Halin's theorem and the construction\nproving it seem very much like standard versions of compactness arguments such\nas K\\\"{o}nig's Lemma. Those results, while not computable, are relatively\nsimple. They only use arithmetic procedures or, equivalently, finitely many\niterations of the Turing jump. We show that several Halin type theorems are\nmuch more complicated. They are among the theorems of hyperarithmetic analysis.\nSuch theorems imply the ability to iterate the Turing jump along any computable\nwell ordering. Several important logical principles in this class have been\nextensively studied beginning with work of Kreisel, H. Friedman, Steel and\nothers in the 1960s and 1970s. Until now, only one purely mathematical example\nwas known. Our work provides many more and so answers Question 30 of\nMontalb\\'{a}n's Open Questions in Reverse Mathematics [2011]. Some of these\ntheorems including ones in Halin [1965] are also shown to have unusual proof\ntheoretic strength as well.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:57:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barnes","James S.",""],["Goh","Jun Le",""],["Shore","Richard A.",""]]}
{"id":"2308.14288","submitter":"Shubham Bhardwaj","authors":"Shubham Bhardwaj, Maria G. Dainotti, Sachin Venkatesh, Aditya\n  Narendra, Anish Kalsi, Enrico Rinaldi, and Agnieszka Pollo","title":"GRB Optical and X-ray Plateau Properties Classifier Using Unsupervised\n  Machine Learning","comments":"20 pages, 10 figures (one has 4 panels, two have a single panel, six\n  have 8 panels, one has 6 panels), 4 tables. Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The division of Gamma-ray bursts (GRBs) into different classes, other than\nthe \"short\" and \"long\", has been an active field of research. We investigate\nwhether GRBs can be classified based on a broader set of parameters, including\nprompt and plateau emission ones. Observational evidence suggests the existence\nof more GRB sub-classes, but results so far are either conflicting or not\nstatistically significant. The novelty here is producing a\nmachine-learning-based classification of GRBs using their observed X-rays and\noptical properties. We used two data samples: the first, composed of 203 GRBs,\nis from the Neil Gehrels Swift Observatory (Swift/XRT), and the latter,\ncomposed of 134 GRBs, is from the ground-based Telescopes and Swift/UVOT. Both\nsamples possess the plateau emission (a flat part of the light curve happening\nafter the prompt emission, the main GRB event). We have applied the Gaussian\nMixture Model (GMM) to explore multiple parameter spaces and sub-class\ncombinations to reveal if there is a match between the current observational\nsub-classes and the statistical classification. With these samples and the\nalgorithm, we spot a few micro-trends in certain cases, but we cannot conclude\nthat any clear trend exists in classifying GRBs. These microtrends could point\ntowards a deeper understanding of the physical meaning of these classes (e.g.,\na different environment of the same progenitor or different progenitors).\nHowever, a larger sample and different algorithms could achieve such goals.\nThus, this methodology can lead to deeper insights in the future.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:02:04 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 02:23:42 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Bhardwaj","Shubham",""],["Dainotti","Maria G.",""],["Venkatesh","Sachin",""],["Narendra","Aditya",""],["Kalsi","Anish",""],["Rinaldi","Enrico",""],["Pollo","Agnieszka",""]]}
{"id":"2308.14289","submitter":"Linsen Li","authors":"Linsen Li, Lorenzo De Santis, Isaac Harris, Kevin C. Chen, Ian\n  Christen, Matthew Trusheim, Yixuan Song, Yihuai Gao, Carlos Errando-Herranz,\n  Jiahui Du, Genevieve Clark, Mohamed I. Ibrahim, Gerald Gilbert, Ruonan Han\n  and Dirk Englund","title":"Heterogeneous integration of spin-photon interfaces with a scalable CMOS\n  platform","comments":"23 pages, 15 figures. Comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Color centers in diamonds have emerged as a leading solid-state platform for\nadvancing quantum technologies, satisfying the DiVincenzo criteria and recently\nachieving a quantum advantage in secret key distribution. Recent theoretical\nworks estimate that general-purpose quantum computing using local quantum\ncommunication networks will require millions of physical qubits to encode\nthousands of logical qubits, which presents a substantial challenge to the\nhardware architecture at this scale. To address the unanswered scaling problem,\nin this work, we first introduce a scalable hardware modular architecture\n\"Quantum System-on-Chip\" (QSoC) that features compact two-dimensional arrays\n\"quantum microchiplets\" (QMCs) containing tin-vacancy (SnV-) spin qubits\nintegrated on a cryogenic application-specific integrated circuit (ASIC). We\ndemonstrate crucial architectural subcomponents, including (1) QSoC fabrication\nvia a lock-and-release method for large-scale heterogeneous integration; (2) a\nhigh-throughput calibration of the QSoC for spin qubit spectral inhomogenous\nregistration; (3) spin qubit spectral tuning functionality for inhomogenous\ncompensation; (4) efficient spin-state preparation and measurement for improved\nspin and optical properties. QSoC architecture supports full connectivity for\nquantum memory arrays in a set of different resonant frequencies and offers the\npossibility for further scaling the number of solid-state physical qubits via\nlarger and denser QMC arrays and optical frequency multiplexing networking.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:06:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Linsen",""],["De Santis","Lorenzo",""],["Harris","Isaac",""],["Chen","Kevin C.",""],["Christen","Ian",""],["Trusheim","Matthew",""],["Song","Yixuan",""],["Gao","Yihuai",""],["Errando-Herranz","Carlos",""],["Du","Jiahui",""],["Clark","Genevieve",""],["Ibrahim","Mohamed I.",""],["Gilbert","Gerald",""],["Han","Ruonan",""],["Englund","Dirk",""]]}
{"id":"2308.14290","submitter":"Krzysztof Burdzy","authors":"Krzysztof Burdzy, J\\'anos Engl\\\"ander and Donald E. Marshall","title":"The spine of two-particle Fleming-Viot process in a bounded interval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the spine of the Fleming-Viot process driven by Brownian motion\nand starting with two particles in a bounded interval has a different law from\nthat of Brownian motion conditioned to stay in the interval forever.\nFurthermore, we estimate the ``extra drift.''\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:07:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Burdzy","Krzysztof",""],["Engl\u00e4nder","J\u00e1nos",""],["Marshall","Donald E.",""]]}
{"id":"2308.14291","submitter":"Kayo Kinjo","authors":"Kayo Kinjo, Akiyasu Tomoeda","title":"Comparison of gap-based and flow-based control strategies using a new\n  controlled stochastic cellular automaton model for traffic flow","comments":"18 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.CG cond-mat.stat-mech physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Autonomous vehicles are widely considered an imperative element of future\ntransportation systems, and their adoption is expected to reduce traffic\ncongestion. What is an effective vehicle control to reduce it? This study\nexplores the impact of different vehicle control strategies on traffic flow\nthrough simulations. To achieve this, we introduce a novel stochastic traffic\nflow model called the controlled stochastic optimal velocity (CSOV) model,\nwhich incorporates vehicle control effects. Two distinct control strategies are\napplied within the CSOV model: gap-based control (GC) and flow-based control\n(FC). The GC strategy regulates the velocity to equalize the gap between the\nfront and rear vehicles. Conversely, the FC strategy regulates the velocity to\nmaintain a consistent front and rear flow rate. The results show that there\nwere density regions where the GC strategy improved the flow rate. However,\nonly the GC strategy with the weak control resulted in a lower flow rate\ncompared to when there was no control. Conversely, the FC strategy consistently\nimproved the flow rate regardless of control strength, yielding more robust\nresults. Furthermore, when the two controls achieve similar flow rates, the FC\nstrategy provided a more robust velocity distribution for density change than\nthe GC strategy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:08:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kinjo","Kayo",""],["Tomoeda","Akiyasu",""]]}
{"id":"2308.14292","submitter":"Sebastien Vievard","authors":"S\\'ebastien Vievard, Manon Lallement, Elsa Huby, Sylvestre Lacour,\n  Olivier Guyon, Nemanja Jovanovic, Sergio Leon-saval, Julien Lozi, Vincent\n  Deo, Kyohoon Ahn, Nick Cvetojevic, Kevin Barjot, Guillermo Martin, Harry-Dean\n  Kenchington-Goldsmith, Gaspard Duch\\^ene, Takayuki Kotani, Franck Marchis,\n  Daniel Rouan, Michael Fitzgerald, Steph Sallum, Barnaby Norris, Chris\n  Betters, Pradip Gatkine, John Lin, Yoo Jung Kim, C\\'ecil Pham, C\\'edric\n  Cassagnettes, Adrien Billat, Motohide Tamura, Guy Perrin","title":"Photonic spectro-interferometry with SCExAO/FIRST at the Subaru\n  Telescope: towards H-alpha imaging of protoplanets","comments":"Proceedings published in SPIE optics + Photonics (2023) Session\n  \"Instrumentation for exoplanet\"","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  FIRST is a post Extreme Adaptive-Optics (ExAO) spectro-interferometer\noperating in the Visible (600-800 nm, R~400). Its exquisite angular resolution\n(a sensitivity analysis of on-sky data shows that bright companions can be\ndetected down to 0.25lambda/D) combined with its sensitivity to pupil phase\ndiscontinuities (from a few nm up to dozens of microns) makes FIRST an ideal\nself-calibrated solution for enabling exoplanet detection and characterization\nin the future. We present the latest on-sky results along with recent upgrades,\nincluding the integration and on-sky test of a new spectrograph (R~3,600)\noptimized for the detection of H-alpha emission from young exoplanets accreting\nmatter.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:16:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vievard","S\u00e9bastien",""],["Lallement","Manon",""],["Huby","Elsa",""],["Lacour","Sylvestre",""],["Guyon","Olivier",""],["Jovanovic","Nemanja",""],["Leon-saval","Sergio",""],["Lozi","Julien",""],["Deo","Vincent",""],["Ahn","Kyohoon",""],["Cvetojevic","Nick",""],["Barjot","Kevin",""],["Martin","Guillermo",""],["Kenchington-Goldsmith","Harry-Dean",""],["Duch\u00eane","Gaspard",""],["Kotani","Takayuki",""],["Marchis","Franck",""],["Rouan","Daniel",""],["Fitzgerald","Michael",""],["Sallum","Steph",""],["Norris","Barnaby",""],["Betters","Chris",""],["Gatkine","Pradip",""],["Lin","John",""],["Kim","Yoo Jung",""],["Pham","C\u00e9cil",""],["Cassagnettes","C\u00e9dric",""],["Billat","Adrien",""],["Tamura","Motohide",""],["Perrin","Guy",""]]}
{"id":"2308.14293","submitter":"Bin Liu","authors":"Bin Liu, Julio H. Braslavsky","title":"Robust Dynamic Operating Envelopes via Superellipsoid-based Convex\n  Optimisation in Unbalanced Distribution Networks","comments":"Under review by IEEE PES Engineering Letters","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Dynamic operating envelopes (DOEs) have been introduced to enable the\nintegration of distributed energy resources (DER) in electricity distribution\nnetworks via real-time management of network capacity limits. Recent research\ndemonstrates that uncertainties in the calculation of DOEs should be carefully\nconsidered to ensure network integrity while minimising curtailment of consumer\nDERs. This letter proposes a novel approach to calculating DOEs that is robust\nagainst uncertainties in the utilisation of allocated capacity limits and\ndemonstrates that the reported solution can attain close to global optimality\nperformance as compared with existing approaches.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:20:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Bin",""],["Braslavsky","Julio H.",""]]}
{"id":"2308.14294","submitter":"Hari Paudyal","authors":"Hari Paudyal, Michael E. Flatt\\'e, and Durga Paudyal","title":"Implications of the electron-phonon coupling in CuPb$_9$(PO$_4$)$_6$O\n  for high-temperature superconductivity: an \\textit{ab initio} study","comments":"5 pages and 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report $ab~initio$ calculations of the electronic and vibrational\nproperties in CuPb$_9$(PO$_4$)$_6$O, including the electron-phonon coupling\nstrength via strong-coupling Migdal-Eliashberg theory. We verify the presence\nof appealing flat electronic bands near the Fermi level, a strong hybridization\nbetween the Cu $3d$ and O $2p$ states, and soft low-energy phonons, which can\nsuggest high-temperature superconducting behavior. However, the electron-phonon\ncoupling strength appears insufficient to overcome the Coulomb repulsion\nbetween an electron pair and thus does does not support high-temperature\nsuperconductivity in CuPb$_9$(PO$_4$)$_6$O via the conventional electron-phonon\nMigdal-Eliashberg mechanism. Even neglecting Coulomb repulsion of the electron\npair we find this electron-phonon coupling suggests a superconducting\ntransition temperature less than 2~K.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:24:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Paudyal","Hari",""],["Flatt\u00e9","Michael E.",""],["Paudyal","Durga",""]]}
{"id":"2308.14295","submitter":"Taoyu Pan","authors":"Taoyu Pan","title":"Traffic Light Control with Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Traffic light control is important for reducing congestion in urban mobility\nsystems. This paper proposes a real-time traffic light control method using\ndeep Q learning. Our approach incorporates a reward function considering queue\nlengths, delays, travel time, and throughput. The model dynamically decides\nphase changes based on current traffic conditions. The training of the deep Q\nnetwork involves an offline stage from pre-generated data with fixed schedules\nand an online stage using real-time traffic data. A deep Q network structure\nwith a \"phase gate\" component is used to simplify the model's learning task\nunder different phases. A \"memory palace\" mechanism is used to address sample\nimbalance during the training process. We validate our approach using both\nsynthetic and real-world traffic flow data on a road intersecting in Hangzhou,\nChina. Results demonstrate significant performance improvements of the proposed\nmethod in reducing vehicle waiting time (57.1% to 100%), queue lengths (40.9%\nto 100%), and total travel time (16.8% to 68.0%) compared to traditional fixed\nsignal plans.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:29:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pan","Taoyu",""]]}
{"id":"2308.14296","submitter":"Yancheng Wang","authors":"Yancheng Wang, Ziyan Jiang, Zheng Chen, Fan Yang, Yingxue Zhou, Eunah\n  Cho, Xing Fan, Xiaojiang Huang, Yanbin Lu, Yingzhen Yang","title":"RecMind: Large Language Model Powered Agent For Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advancements in instructing Large Language Models (LLMs) to utilize\nexternal tools and execute multi-step plans have significantly enhanced their\nability to solve intricate tasks, ranging from mathematical problems to\ncreative writing. Yet, there remains a notable gap in studying the capacity of\nLLMs in responding to personalized queries such as a recommendation request. To\nbridge this gap, we have designed an LLM-powered autonomous recommender agent,\nRecMind, which is capable of providing precise personalized recommendations\nthrough careful planning, utilizing tools for obtaining external knowledge, and\nleveraging individual data. We propose a novel algorithm, Self-Inspiring, to\nimprove the planning ability of the LLM agent. At each intermediate planning\nstep, the LLM 'self-inspires' to consider all previously explored states to\nplan for next step. This mechanism greatly improves the model's ability to\ncomprehend and utilize historical planning information for recommendation. We\nevaluate RecMind's performance in various recommendation scenarios, including\nrating prediction, sequential recommendation, direct recommendation,\nexplanation generation, and review summarization. Our experiment shows that\nRecMind outperforms existing zero/few-shot LLM-based recommendation methods in\ndifferent recommendation tasks and achieves competitive performance to a recent\nmodel P5, which requires fully pre-train for the recommendation tasks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:31:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yancheng",""],["Jiang","Ziyan",""],["Chen","Zheng",""],["Yang","Fan",""],["Zhou","Yingxue",""],["Cho","Eunah",""],["Fan","Xing",""],["Huang","Xiaojiang",""],["Lu","Yanbin",""],["Yang","Yingzhen",""]]}
{"id":"2308.14297","submitter":"Suzana Petrovic","authors":"Suzana Petrovi\\'c, Nevena Bo\\v{z}inovi\\'c, Vladimir Raji\\'c, Danijela\n  Stanisavljevi\\'c Ninkovi\\'c, Danilo Kisi\\'c, Milena Stevanovi\\'c and Emmanuel\n  Stratakis","title":"Cell response on laser-patterned Ti/Zr/Ti and Ti/Cu/Ti multi-layer\n  systems","comments":"15 pages, 6 figures","journal-ref":"Coatings 2023, 13(6), 1107;","doi":"10.3390/coatings13061107","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Arranged patterns obtained by ultrafast laser processing on the surface of\nTi/Cu/Ti/Si and Ti/Zr/Ti/Si thin film systems are reported. Two differently\ndesigned multilayer thin films, Ti/Cu/Ti/Si and Ti/Zr/Ti/Si, were deposited on\nsilicon by the ion sputtering method. The bioactive surfaces on these systems\ninvolve the formation of laser-induced periodic surface structures (LIPSS) in\neach of the laser-written lines of mesh patterns on 5x5 mm areas. The formation\nof nano- and micro-patterns with an ultra-thin oxide film on the surfaces was\nused to observe the effects of morphology and proliferation of the MRC-5 cell\nculture line. To determine whether Ti-based thin films have a toxic effect on\nliving cells, an MTT assay was performed. The relative cytotoxic effect as a\npercentage of surviving cells showed that there was no difference in cell\nnumber between the Ti-based thin films and the control cells. There was also no\ndifference in the viability of the MRC-5 cells, except for the Ti/Cu/Ti/Si\nsystem, where there was a slight 10% decrease in cell viability.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:32:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Petrovi\u0107","Suzana",""],["Bo\u017einovi\u0107","Nevena",""],["Raji\u0107","Vladimir",""],["Ninkovi\u0107","Danijela Stanisavljevi\u0107",""],["Kisi\u0107","Danilo",""],["Stevanovi\u0107","Milena",""],["Stratakis","Emmanuel",""]]}
{"id":"2308.14298","submitter":"Chee-Kheng Chng Ck","authors":"Chee-Kheng Chng, Trent Jansen-Sturgeon, Timothy Payne, Tat-Jun Chin","title":"Direct initial orbit determination","comments":"28 pages, 17 figures, Submitted to Advances in Space Research","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Initial orbit determination (IOD) is an important early step in the\nprocessing chain that makes sense of and reconciles the multiple optical\nobservations of a resident space object. IOD methods generally operate on\nline-of-sight (LOS) vectors extracted from images of the object, hence the LOS\nvectors can be seen as discrete point samples of the raw optical measurements.\nTypically, the number of LOS vectors used by an IOD method is much smaller than\nthe available measurements (\\ie, the set of pixel intensity values), hence\ncurrent IOD methods arguably under-utilize the rich information present in the\ndata. In this paper, we propose a \\emph{direct} IOD method called D-IOD that\nfits the orbital parameters directly on the observed streak images, without\nrequiring LOS extraction. Since it does not utilize LOS vectors, D-IOD avoids\npotential inaccuracies or errors due to an imperfect LOS extraction step. Two\ninnovations underpin our novel orbit-fitting paradigm: first, we introduce a\nnovel non-linear least-squares objective function that computes the loss\nbetween the candidate-orbit-generated streak images and the observed streak\nimages. Second, the objective function is minimized with a gradient descent\napproach that is embedded in our proposed optimization strategies designed for\nstreak images. We demonstrate the effectiveness of D-IOD on a variety of\nsimulated scenarios and challenging real streak images.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:34:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chng","Chee-Kheng",""],["Jansen-Sturgeon","Trent",""],["Payne","Timothy",""],["Chin","Tat-Jun",""]]}
{"id":"2308.14299","submitter":"Keith Paarporn","authors":"Keith Paarporn, Rahul Chandan, Mahnoosh Alizadeh, Jason R. Marden","title":"Reinforcement Strategies in General Lotto Games","comments":"14 pages. arXiv admin note: text overlap with arXiv:2209.06090","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Strategic decisions are often made over multiple periods of time, wherein\ndecisions made earlier impact a competitor's success in later stages. In this\npaper, we study these dynamics in General Lotto games, a class of models\ndescribing the competitive allocation of resources between two opposing\nplayers. We propose a two-stage formulation where one of the players has\nreserved resources that can be strategically pre-allocated across the\nbattlefields in the first stage of the game as reinforcements. The players then\nsimultaneously allocate their remaining real-time resources, which can be\nrandomized, in a decisive final stage. Our main contributions provide complete\ncharacterizations of the optimal reinforcement strategies and resulting\nequilibrium payoffs in these multi-stage General Lotto games. Interestingly, we\ndetermine that real-time resources are at least twice as effective as\nreinforcement resources when considering equilibrium payoffs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:34:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Paarporn","Keith",""],["Chandan","Rahul",""],["Alizadeh","Mahnoosh",""],["Marden","Jason R.",""]]}
{"id":"2308.14300","submitter":"Bryan Briney","authors":"Sarah M. Burbach and Bryan Briney","title":"Improving antibody language models with native pairing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.BM","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Current antibody language models are limited by their use of unpaired\nantibody sequence data and the biases in publicly available antibody sequence\ndatasets, which are skewed toward antibodies against a relatively small number\nof pathogens. A recently published dataset (by Jaffe, et al) of approximately\n1.6 x 10^6 natively paired human antibody sequences from healthy donors\nrepresents by far the largest dataset of its kind and offers a unique\nopportunity to evaluate how antibody language models can be improved by\ntraining with natively paired antibody sequence data. We trained two Baseline\nAntibody Language Models (BALM), using natively paired (BALM-paired) or\nunpaired (BALM-unpaired) sequences from the Jaffe dataset. We provide evidence\nthat training with natively paired sequences substantially improves model\nperformance and that this improvement results from the model learning\nimmunologically relevant features that span the light and heavy chains. We also\nshow that ESM-2, a state-of-the-art general protein language model, learns\nsimilar cross-chain features when fine-tuned with natively paired antibody\nsequence data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:35:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Burbach","Sarah M.",""],["Briney","Bryan",""]]}
{"id":"2308.14301","submitter":"Chirag Shah","authors":"Muhammad Rahman, Sachi Figliolini, Joyce Kim, Eivy Cedeno, Charles\n  Kleier, Chirag Shah, Aman Chadha","title":"Artificial Intelligence in Career Counseling: A Test Case with ResumAI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The rise of artificial intelligence (AI) has led to various means of\nintegration of AI aimed to provide efficiency in tasks, one of which is career\ncounseling. A key part of getting a job is having a solid resume that passes\nthrough the first round of programs and recruiters. It is difficult to find\ngood resources or schedule an appointment with a career counselor to help with\nediting a resume for a specific role. With the rise of ChatGPT, Bard, and\nseveral other AI chat programs it is possible to provide specific, automated\nfeedback on various concerns to suggest places for improvement within the\ncontext of career counseling. This paper begins with a quick literature review\non the ethical considerations and limitations of AI in career counseling. The\nauthors also have created their own website service, called ResumAI, to test\nand review the functionality of an AI career counselor. The findings of this\nstudy will contribute to the understanding of chat AI ResumAI reviewer programs\nand sites. The implications of the findings for the field of career counseling,\nAI development, and ethical practice will be discussed.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:35:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rahman","Muhammad",""],["Figliolini","Sachi",""],["Kim","Joyce",""],["Cedeno","Eivy",""],["Kleier","Charles",""],["Shah","Chirag",""],["Chadha","Aman",""]]}
{"id":"2308.14302","submitter":"William Chen","authors":"William Y. Chen, Alex Lubotzky, and Pham Huu Tiep","title":"Finite simple characteristic quotients of the free group of rank 2","comments":"24 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we describe how to explicitly construct infinitely many finite\nsimple groups as characteristic quotients of the rank 2 free group $F_2$. This\nshows that a \"baby\" version of the Wiegold conjecture fails for $F_2$, and\nprovides counterexamples to two conjectures in the theory of noncongruence\nsubgroups of $\\text{SL}_2(\\mathbb{Z})$. Our main result explicitly produces,\nfor every prime power $q\\ge 7$, the groups $\\text{SL}_3(\\mathbb{F}_q)$ and\n$\\text{SU}_3(\\mathbb{F}_q)$ as characteristic quotients of $F_2$. Our strategy\nis to study specializations of the Burau representation for the braid group\n$B_4$, exploiting an exceptional relationship between $F_2$ and $B_4$ first\nobserved by Dyer, Formanek, and Grossman. Weisfeiler's strong approximation\ntheorem guarantees that our specializations are surjective for infinitely many\nprimes, but it is not effective. To make our result effective, we give another\nproof of surjectivity via a careful analysis of the maximal subgroup structures\nof $\\text{SL}_3(\\mathbb{F}_q)$ and $\\text{SU}_3(\\mathbb{F}_q)$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:35:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","William Y.",""],["Lubotzky","Alex",""],["Tiep","Pham Huu",""]]}
{"id":"2308.14303","submitter":"Sunayana Maben","authors":"Sunayana Maben, Yerra Bharat Kumar, Bacham E. Reddy, Simon W.\n  Campbell, Gang Zhao","title":"A large sample of newly-identified carbon-deficient red giants from\n  APOGEE","comments":"12 pages, 5 figures, accepted by MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Based on the APOGEE survey we conducted a search for carbon-deficient red\ngiants (CDGs). We found 103 new CDGs, increasing the number in the literature\nby more than a factor of 3. CDGs are very rare, representing $0.03$~per cent of\ngiants. They appear as an extended tail off the normal carbon distribution. We\nshow that they are found in all components of the Galaxy, contrary to previous\nfindings. The location of CDGs in the Hertzsprung-Russell diagram (HRD) shows\nthat they are primarily intermediate-mass stars ($2-4~\\rm{M}_{\\odot}$). Their\nextended distribution may indicate that CDGs can also sometimes have $M <\n2.0~\\rm{M}_{\\odot}$. We attempted to identify the evolutionary phases of the\nCDGs using stellar model tracks. We found that the bulk of the CDGs are likely\nin the subgiant branch or red clump phase, whereas other CDGs may be in the red\ngiant branch or early asymptotic giant branch phases. Degeneracy in the HRD\nmakes exact identification difficult. We examined their C, N, and O\ncompositions and confirmed previous studies showing that the envelope material\nhas undergone extensive hydrogen burning through the CN(O) cycle. The new-CDGs\nhave [C+N+O/Fe] that generally sum to zero, indicating that they started with\nscaled-solar composition. However, the previously known-CDGs generally have\n[C+N+O/Fe$] > 0.0$, indicating that some He-burning products were added to\ntheir envelopes. As to the site(s) in which this originally occurred, we do not\nfind a convincing solution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:35:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Maben","Sunayana",""],["Kumar","Yerra Bharat",""],["Reddy","Bacham E.",""],["Campbell","Simon W.",""],["Zhao","Gang",""]]}
{"id":"2308.14304","submitter":"Junze Yin","authors":"Zhao Song, Junze Yin, Lichen Zhang","title":"Solving Attention Kernel Regression Problem via Pre-conditioner","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large language models have shown impressive performance in many tasks. One of\nthe major features from the computation perspective is computing the attention\nmatrix. Previous works [Zandieh, Han, Daliri, and Karba 2023, Alman and Song\n2023] have formally studied the possibility and impossibility of approximating\nthe attention matrix. In this work, we define and study a new problem which is\ncalled the attention kernel regression problem. We show how to solve the\nattention kernel regression in the input sparsity time of the data matrix.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:37:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Song","Zhao",""],["Yin","Junze",""],["Zhang","Lichen",""]]}
{"id":"2308.14305","submitter":"Douglas Barros","authors":"Tatiana A. Michtchenko and Douglas A. Barros","title":"3D stellar motion in the axisymmetric Galactic potential and the e-z\n  resonances","comments":"9 pages, 8 figures, 2 tables. Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The full phase space information on the kinematics of a huge number of stars\nprovided by the Gaia third Data Release raises the demand for a better\nunderstanding of the 3D stellar dynamics. In this paper, we investigate the\npossible regimes of motion of stars in the axisymmetric approximation of a\nGalactic potential model. The model consists of three components: the\naxisymmetric disk, the central spheroidal bulge and the spherical halo of dark\nmatter. The axisymmetric disk is divided into stellar and gaseous disk\nsubcomponents, each one modeled by three Miyamoto-Nagai profiles. The physical\nand structural parameters of the Galaxy components are adjusted by\nobservational kinematic constraints. The phase space of the\ntwo-degrees-of-freedom model is studied by means of the Poincar\\'e and\ndynamical mapping, the dynamical spectrum method and the direct numerical\nintegrations of the Hamiltonian equations of motion. For the chosen physical\nparameters, the nearly-circular and low-altitude stellar behaviour is composed\nof two weakly coupled simple oscillations, radial and vertical motions. The\namplitudes of the vertical oscillations of these orbits are gradually\nincreasing with the growing Galactocentric distances, in concordance with the\nexponential mass decay assumed. However, for increasing planar eccentricities\nand the altitudes over the equatorial disk, new regimes of stellar motion\nemerge as a result of the beating between the radial and vertical oscillation\nfrequencies, which we refer to as e-z resonances. The corresponding resonant\nmotion produces characteristic sudden increase or decrease of the amplitude of\nthe vertical oscillation, bifurcations in the dynamical spectra and the chains\nof islands of stable motion in the phase space. The results obtained can be\nuseful in the understanding and interpretation of the features observed in the\nstellar 3D distribution around the Sun.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:41:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Michtchenko","Tatiana A.",""],["Barros","Douglas A.",""]]}
{"id":"2308.14306","submitter":"Yuansheng Ni","authors":"Yuansheng Ni, Sichao Jiang, Xinyu wu, Hui Shen, Yuli Zhou","title":"Evaluating the Robustness to Instructions of Large Language Models","comments":"In our study, erroneous data analysis inadvertently led to misleading\n  outcomes. Incorrect variables were included, distorting results. This\n  emphasizes the significance of robust data processing and analysis techniques\n  in research","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Instruction fine-tuning has risen to prominence as a potential\nmethod for enhancing the zero-shot capabilities of Large Language Models (LLMs)\non novel tasks. This technique has shown an exceptional ability to boost the\nperformance of moderately sized LLMs, sometimes even reaching performance\nlevels comparable to those of much larger model variants. The focus is on the\nrobustness of instruction-tuned LLMs to seen and unseen tasks. We conducted an\nexploration of six models including Alpaca, Vicuna, WizardLM, and Traditional\nTask-oriented Models(Flan-T5-XL/XXL, T0++) using real-world relation extraction\ndatasets as case studies. We carried out a comprehensive evaluation of these\ninstruction-following LLMs which have been tuned based on open-domain\ninstructions and task-oriented instructions. The main discussion is their\nperformance and robustness towards instructions. We have observed that in most\ncases, the model's performance in dealing with unfamiliar instructions tends to\nworsen significantly, and the robustness of the model for RE instructions\ndeteriorates compared to QA. Further, we discovered that up until a certain\nparameter size threshold (3B), the performance of the FLAN-T5 model improves as\nthe parameter count increases. The robustness of different scales of FLAN-T5\nmodels to RE instruction is worse than the robustness to QA instruction.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:57:07 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 20:10:50 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ni","Yuansheng",""],["Jiang","Sichao",""],["wu","Xinyu",""],["Shen","Hui",""],["Zhou","Yuli",""]]}
{"id":"2308.14307","submitter":"Ribhu Chopra","authors":"Sai Manikanta Rishi Rani, Ribhu Chopra, Kumar Appaiah","title":"How much Training is Needed in Downlink Cell-Free mMIMO under LoS/NLoS\n  channels?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The assumption that no LoS channels exist between wireless access\npoints~(APs) and user equipments~(UEs) becomes questionable in the context of\nthe recent developments in the direction of cell free massive multiple input\nmultiple output MIMO~(CF-mMIMO) systems. In CF-mMIMO systems, the access point\ndensity is assumed to be comparable to, or much larger than the the user\ndensity, thereby leading to the possibility of existence of LoS links between\nthe UEs and the APs, depending on the local propagation conditions. In this\npaper, we compare the rates achievable by CF-mMIMO systems under probabilistic\nLoS/ NLos channels, with and without acquiring the channel state\ninformation~(CSI) of the fast fading components. We show that, under\nsufficiently large AP densities, statistical beamforming that does not require\nthe knowledge about the fast fading components of the channels, performs almost\nat par with full beamforming, utilizing the information about the fast fading\nchannel coefficients, thus potentially avoiding the need for training during\nevery frame. We validate our results via detailed Monte Carlo simulations, and\nalso elaborate the conditions under which statistical beamforming can be\nsuccessfully employed in massive MIMO systems with LoS/ NLoS channels.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:57:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rani","Sai Manikanta Rishi",""],["Chopra","Ribhu",""],["Appaiah","Kumar",""]]}
{"id":"2308.14308","submitter":"Mingxi Tan","authors":"Mingxi Tan, Andong Tian and Ludovic Denoyer","title":"Policy Diversity for Cooperative Agents","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.MA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Standard cooperative multi-agent reinforcement learning (MARL) methods aim to\nfind the optimal team cooperative policy to complete a task. However there may\nexist multiple different ways of cooperating, which usually are very needed by\ndomain experts. Therefore, identifying a set of significantly different\npolicies can alleviate the task complexity for them. Unfortunately, there is a\ngeneral lack of effective policy diversity approaches specifically designed for\nthe multi-agent domain. In this work, we propose a method called\nMoment-Matching Policy Diversity to alleviate this problem. This method can\ngenerate different team policies to varying degrees by formalizing the\ndifference between team policies as the difference in actions of selected\nagents in different policies. Theoretically, we show that our method is a\nsimple way to implement a constrained optimization problem that regularizes the\ndifference between two trajectory distributions by using the maximum mean\ndiscrepancy. The effectiveness of our approach is demonstrated on a challenging\nteam-based shooter.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:23:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tan","Mingxi",""],["Tian","Andong",""],["Denoyer","Ludovic",""]]}
{"id":"2308.14309","submitter":"Koji Tasaka","authors":"Koji Tasaka","title":"The harmonic strength of shells of lattices and weighted theta series","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This is the write-up of a talk given in RIMS conference ``Analytic and\narithmetic aspects of automorphic representations\", where I outlined two kinds\nof different results related to the D4 lattice, obtained in a joint work with\nHirao and Nozaki. In general, from the design theoretical viewpoints, we are\ninterested in determining the harmonic strength of finite subsets on the unit\nsphere. When considering the shells of a lattice, this problem shifts to the\nnon-vanishing problem of the Fourier coefficients of elliptic cusp forms.\nVarious instances, mostly from root lattices, are listed in this note.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:25:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tasaka","Koji",""]]}
{"id":"2308.14310","submitter":"Cheng-Wei Lee","authors":"Naseem Ud Din, Cheng-Wei Lee, Geoff L. Brennecka, Prashun Gorai","title":"Defects and Oxygen Impurities in Ferroelectric Wurtzite\n  Al$_{1-x}$Sc$_x$N Alloys","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  III-nitrides and related alloys are widely used for optoelectronics and as\nacoustic resonators. Ferroelectric wurtzite nitrides are of particular interest\nbecause of their potential for direct integration with Si and wide bandgap\nsemiconductors, and unique polarization switching characteristics; such\ninterest has taken off since the first report of ferroelectric\nAl$_{1-x}$Sc$_x$N alloys. However, the coercive fields needed to switch\npolarization are on the order of MV/cm, which is 1-2 orders of magnitude larger\nthan oxide perovskite ferroelectrics. Atomic-scale point defects are known to\nimpact the dielectric properties, including breakdown fields and leakage\ncurrents, as well as ferroelectric switching. However, very little is known\nabout the native defects and impurities in Al$_{1-x}$Sc$_x$N, and their effect\non the dielectric properties. In this study, we use first-principles\ncalculations to determine the formation energetics of native defects and\nunintentional oxygen incorporation in Al$_{1-x}$Sc$_x$N. We find that nitrogen\nvacancies are the dominant native defects, and that they introduce multiple\nmid-gap states that can lead to premature dielectric breakdown in\nferroelectrics and carrier recombination in optoelectronics. Growth under\nN-rich conditions will reduce the concentration of these deep defects. We also\ninvestigate unintentional oxygen incorporation on the nitrogen site and find\nthat the substitutional defect is present in high concentrations, which can\ncontribute to increased temperature-activated leakage currents. Our findings\nprovide fundamental understanding of the defect physics in Al$_{1-x}$Sc$_x$N\nalloys, which is critical for future deployment of ferroelectric devices.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:28:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Din","Naseem Ud",""],["Lee","Cheng-Wei",""],["Brennecka","Geoff L.",""],["Gorai","Prashun",""]]}
{"id":"2308.14311","submitter":"Wenxiang Dong","authors":"Wenxiang Dong and H.Vicky Zhao","title":"Spread Control Method on Unknown Networks Based on Hierarchical\n  Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spread of infectious diseases, rumors, and harmful speech in networks can\nresult in substantial losses, underscoring the significance of studying how to\nsuppress such hazardous events. However, previous studies often assume full\nknowledge of the network structure, which is often not the case in real-world\nscenarios. In this paper, we address the challenge of controlling the\npropagation of hazardous events by removing nodes when the network structure is\nunknown. To tackle this problem, we propose a hierarchical reinforcement\nlearning method that drastically reduces the action space, making the problem\nfeasible to solve. Simulation experiments demonstrate the superiority of our\nmethod over the baseline methods. Remarkably, even though the baseline methods\npossess extensive knowledge of the network structure, while our method has no\nprior information about it, our approach still achieves better results.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:29:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Wenxiang",""],["Zhao","H. Vicky",""]]}
{"id":"2308.14312","submitter":"Yanyu Ye","authors":"Yanyu Ye, Zhengxi Zhang, Chunna Tianb, Wei wei","title":"Local-Global Pseudo-label Correction for Source-free Domain Adaptive\n  Medical Image Segmentation","comments":"30 pages,7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Domain shift is a commonly encountered issue in medical imaging solutions,\nprimarily caused by variations in imaging devices and data sources. To mitigate\nthis problem, unsupervised domain adaptation techniques have been employed.\nHowever, concerns regarding patient privacy and potential degradation of image\nquality have led to an increased focus on source-free domain adaptation. In\nthis study, we address the issue of false labels in self-training based\nsource-free domain adaptive medical image segmentation methods. To correct\nerroneous pseudo-labels, we propose a novel approach called the local-global\npseudo-label correction (LGDA) method for source-free domain adaptive medical\nimage segmentation. Our method consists of two components: An offline local\ncontext-based pseudo-label correction method that utilizes local context\nsimilarity in image space. And an online global pseudo-label correction method\nbased on class prototypes, which corrects erroneously predicted pseudo-labels\nby considering the relative distance between pixel-wise feature vectors and\nprototype vectors. We evaluate the performance of our method on three benchmark\nfundus image datasets for optic disc and cup segmentation. Our method achieves\nsuperior performance compared to the state-of-the-art approaches, even without\nusing of any source data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:29:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ye","Yanyu",""],["Zhang","Zhengxi",""],["Tianb","Chunna",""],["wei","Wei",""]]}
{"id":"2308.14313","submitter":"Zheyu Cheng","authors":"Zheyu Cheng, Yi-jun Guan, Haoran Xue, Yong Ge, Ding Jia, Yang Long,\n  Shou-qi Yuan, Hong-xiang Sun, Yidong Chong, Baile Zhang","title":"Three-dimensional flat Landau levels in an inhomogeneous acoustic\n  crystal","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  When electrons moving in two-dimensions (2D) are subjected to a strong\nuniform magnetic field, they form flat bands called Landau levels, which are\nthe basis for the quantum Hall effect. Landau levels can also arise from\npseudomagnetic fields (PMFs) induced by lattice distortions; for example,\nmechanically straining graphene causes its Dirac quasiparticles to form a\ncharacteristic set of unequally-spaced Landau levels, including a zeroth Landau\nlevel. In three-dimensional (3D) systems, there has thus far been no\nexperimental demonstration of Landau levels or any other type of flat band. For\ninstance, applying a uniform magnetic field to materials hosting Weyl\nquasiparticles, the 3D generalizations of Dirac quasiparticles, yields bands\nthat are non-flat in the direction of the field. Here, we report on the\nexperimental realization of a flat 3D Landau level in an acoustic crystal.\nStarting from a lattice whose bandstructure exhibits a nodal ring, we design an\ninhomogeneous distortion corresponding to a specific pseudomagnetic vector\npotential (PVP) that causes the nodal ring states to break up into Landau\nlevels, with a zeroth Landau level that is flat along all three directions.\nThese findings point to the possibility of using nodal ring materials to\ngenerate 3D flat bands, to access strong interactions and other interesting\nphysical regimes in 3D.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:34:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheng","Zheyu",""],["Guan","Yi-jun",""],["Xue","Haoran",""],["Ge","Yong",""],["Jia","Ding",""],["Long","Yang",""],["Yuan","Shou-qi",""],["Sun","Hong-xiang",""],["Chong","Yidong",""],["Zhang","Baile",""]]}
{"id":"2308.14314","submitter":"Tianyu Wang","authors":"Weibin Peng and Tianyu Wang","title":"The Nesterov-Spokoiny Acceleration: $o(1/k^2)$ Convergence without\n  Proximal Operations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies a variant of an accelerated gradient algorithm of Nesterov\nand Spokoiny. We call this algorithm the Nesterov-Spokoiny Acceleration (NSA).\nThe NSA algorithm satisfies the following properties for smooth convex\nprograms, 1. The sequence $\\{ \\mathbf{x}_k \\}_{k \\in \\mathbb{N}} $ governed by\nthe NSA satisfies $ \\limsup\\limits_{k \\to \\infty } k^2 ( f (\\mathbf{x}_k ) -\nf^* ) = 0 $, where $f^* > -\\infty$ is the minimum of the smooth convex function\n$f$. 2. The sequence $\\{ \\mathbf{x}_k \\}_{k \\in \\mathbb{N}} $ governed by the\nNSA satisfies $ \\liminf\\limits_{k \\to \\infty } k^2 \\log k \\log\\log k ( f\n(\\mathbf{x}_k ) - f^* ) = 0 $. 3. The sequence $\\{ \\mathbf{y}_k \\}_{k \\in\n\\mathbb{N}} $ governed by NSA satisfies $ \\liminf\\limits_{k \\to \\infty } k^3\n\\log k \\log\\log k \\| \\nabla f ( \\mathbf{y}_k ) \\|^2 = 0 $. Item 1 above is\nperhaps more important than items 2 and 3: For general smooth convex programs,\nNSA is the first gradient algorithm that achieves $o(k^{-2})$ convergence rate\nwithout proximal operations. Some extensions of the NSA algorithm are also\nstudied. Also, our study on a zeroth-order variant of NSA shows that $o(1/k^2)$\nconvergence can be achieved via estimated gradient.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:36:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Peng","Weibin",""],["Wang","Tianyu",""]]}
{"id":"2308.14315","submitter":"Guangyu Wu","authors":"Guangyu Wu, Anders Lindquist","title":"General Discrete-Time Fokker-Planck Control by Power Moments","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper, we address the so-called general Fokker-Planck control problem\nfor discrete-time first-order linear systems. Unlike conventional treatments,\nwe don't assume the distributions of the system states to be Gaussian. Instead,\nwe only assume the existence and finiteness of the first several order power\nmoments of the distributions. It is proved in the literature that there doesn't\nexist a solution, which has a form of conventional feedback control, to this\nproblem. We propose a moment representation of the system to turn the original\nproblem into a finite-dimensional one. Then a novel feedback control term,\nwhich is a mixture of a feedback term and a Markovian transition kernel term is\nproposed to serve as the control input of the moment system. The states of the\nmoment system are obtained by maximizing the smoothness of the state\ntransition. The power moments of the transition kernels are obtained by a\nconvex optimization problem, of which the solution is proved to exist and be\nunique. Then they are mapped back to the probability distributions. The control\ninputs to the original system are then obtained by sampling from the realized\ndistributions. Simulation results are provided to validate our algorithm in\ntreating the general discrete-time Fokker-Planck control problem.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:36:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wu","Guangyu",""],["Lindquist","Anders",""]]}
{"id":"2308.14316","submitter":"Haiwen Diao","authors":"Haiwen Diao, Bo Wan, Ying Zhang, Xu Jia, Huchuan Lu, Long Chen","title":"UniPT: Universal Parallel Tuning for Transfer Learning with Efficient\n  Parameter and Memory","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fine-tuning pre-trained models has emerged as a powerful technique in\nnumerous domains, owing to its ability to leverage enormous pre-existing\nknowledge and achieve remarkable performance on downstream tasks. However,\nupdating the parameters of entire networks is computationally intensive.\nAlthough state-of-the-art parameter-efficient transfer learning (PETL) methods\nsignificantly reduce the trainable parameters and storage demand, almost all of\nthem still need to back-propagate the gradients through large pre-trained\nnetworks. This memory-extensive characteristic extremely limits the\napplicability of PETL methods in real-world scenarios. To this end, we propose\na new memory-efficient PETL strategy, dubbed Universal Parallel Tuning (UniPT).\nSpecifically, we facilitate the transfer process via a lightweight learnable\nparallel network, which consists of two modules: 1) A parallel interaction\nmodule that decouples the inherently sequential connections and processes the\nintermediate activations detachedly of the pre-trained network. 2) A confidence\naggregation module that learns optimal strategies adaptively for integrating\ncross-layer features. We evaluate UniPT with different backbones (e.g.,\nVSE$\\infty$, CLIP4Clip, Clip-ViL, and MDETR) on five challenging\nvision-and-language tasks (i.e., image-text retrieval, video-text retrieval,\nvisual question answering, compositional question answering, and visual\ngrounding). Extensive ablations on ten datasets have validated that our UniPT\ncan not only dramatically reduce memory consumption and outperform the best\nmemory-efficient competitor, but also achieve higher performance than existing\nPETL methods in a low-memory scenario on different architectures. Our code is\npublicly available at: https://github.com/Paranioar/UniPT.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:38:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Diao","Haiwen",""],["Wan","Bo",""],["Zhang","Ying",""],["Jia","Xu",""],["Lu","Huchuan",""],["Chen","Long",""]]}
{"id":"2308.14317","submitter":"Xulong Zhang","authors":"Kexin Zhu, Xulong Zhang, Jianzong Wang, Ning Cheng, Jing Xiao","title":"Symbolic & Acoustic: Multi-domain Music Emotion Modeling for\n  Instrumental Music","comments":"Accepted by 19th International Conference on Advanced Data Mining and\n  Applications. (ADMA 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Music Emotion Recognition involves the automatic identification of emotional\nelements within music tracks, and it has garnered significant attention due to\nits broad applicability in the field of Music Information Retrieval. It can\nalso be used as the upstream task of many other human-related tasks such as\nemotional music generation and music recommendation. Due to existing psychology\nresearch, music emotion is determined by multiple factors such as the Timbre,\nVelocity, and Structure of the music. Incorporating multiple factors in MER\nhelps achieve more interpretable and finer-grained methods. However, most prior\nworks were uni-domain and showed weak consistency between arousal modeling\nperformance and valence modeling performance. Based on this background, we\ndesigned a multi-domain emotion modeling method for instrumental music that\ncombines symbolic analysis and acoustic analysis. At the same time, because of\nthe rarity of music data and the difficulty of labeling, our multi-domain\napproach can make full use of limited data. Our approach was implemented and\nassessed using the publicly available piano dataset EMOPIA, resulting in a\nnotable improvement over our baseline model with a 2.4% increase in overall\naccuracy, establishing its state-of-the-art performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:47:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Kexin",""],["Zhang","Xulong",""],["Wang","Jianzong",""],["Cheng","Ning",""],["Xiao","Jing",""]]}
{"id":"2308.14318","submitter":"Alexander Vishik","authors":"Alexander Vishik","title":"On torsion spaces","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The purpose of this note is to construct examples of compact torsion objects\nof ${\\cal SH}(F)$ of every $p$-level over an arbitrary field of characteristic\ndifferent from $p$. We adapt the approach of Mitchell to the algebraic\nsituation. We show that the respective level is determined by the action of the\n$v_m$-elements on the $MGL$-motive, and also prove the refinement which permits\nto distinguish isotropic Morava points of the Balmer spectrum of ${\\cal\nSH}(F)$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:51:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vishik","Alexander",""]]}
{"id":"2308.14319","submitter":"Xulong Zhang","authors":"Xulong Zhang, Jianzong Wang, Ning Cheng, Jing Xiao","title":"Voice Conversion with Denoising Diffusion Probabilistic GAN Models","comments":"Accepted by 19th International Conference on Advanced Data Mining and\n  Applications. (ADMA 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Voice conversion is a method that allows for the transformation of speaking\nstyle while maintaining the integrity of linguistic information. There are many\nresearchers using deep generative models for voice conversion tasks. Generative\nAdversarial Networks (GANs) can quickly generate high-quality samples, but the\ngenerated samples lack diversity. The samples generated by the Denoising\nDiffusion Probabilistic Models (DDPMs) are better than GANs in terms of mode\ncoverage and sample diversity. But the DDPMs have high computational costs and\nthe inference speed is slower than GANs. In order to make GANs and DDPMs more\npractical we proposes DiffGAN-VC, a variant of GANs and DDPMS, to achieve\nnon-parallel many-to-many voice conversion (VC). We use large steps to achieve\ndenoising, and also introduce a multimodal conditional GANs to model the\ndenoising diffusion generative adversarial network. According to both objective\nand subjective evaluation experiments, DiffGAN-VC has been shown to achieve\nhigh voice quality on non-parallel data sets. Compared with the CycleGAN-VC\nmethod, DiffGAN-VC achieves speaker similarity, naturalness and higher sound\nquality.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:53:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Xulong",""],["Wang","Jianzong",""],["Cheng","Ning",""],["Xiao","Jing",""]]}
{"id":"2308.14320","submitter":"Sun-Kyung Lee","authors":"Sun-Kyung Lee, Jong-Hwan Kim","title":"Video Multimodal Emotion Recognition System for Real World Applications","comments":"Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a system capable of recognizing a speaker's\nutterance-level emotion through multimodal cues in a video. The system\nseamlessly integrates multiple AI models to first extract and pre-process\nmultimodal information from the raw video input. Next, an end-to-end MER model\nsequentially predicts the speaker's emotions at the utterance level.\nAdditionally, users can interactively demonstrate the system through the\nimplemented interface.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:04:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Sun-Kyung",""],["Kim","Jong-Hwan",""]]}
{"id":"2308.14321","submitter":"Yanjun Gao","authors":"Yanjun Gao, Ruizhe Li, John Caskey, Dmitriy Dligach, Timothy Miller,\n  Matthew M. Churpek and Majid Afshar","title":"Leveraging A Medical Knowledge Graph into Large Language Models for\n  Diagnosis Prediction","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Electronic Health Records (EHRs) and routine documentation practices play a\nvital role in patients' daily care, providing a holistic record of health,\ndiagnoses, and treatment. However, complex and verbose EHR narratives overload\nhealthcare providers, risking diagnostic inaccuracies. While Large Language\nModels (LLMs) have showcased their potential in diverse language tasks, their\napplication in the healthcare arena needs to ensure the minimization of\ndiagnostic errors and the prevention of patient harm. In this paper, we outline\nan innovative approach for augmenting the proficiency of LLMs in the realm of\nautomated diagnosis generation, achieved through the incorporation of a medical\nknowledge graph (KG) and a novel graph model: Dr.Knows, inspired by the\nclinical diagnostic reasoning process. We derive the KG from the National\nLibrary of Medicine's Unified Medical Language System (UMLS), a robust\nrepository of biomedical knowledge. Our method negates the need for\npre-training and instead leverages the KG as an auxiliary instrument aiding in\nthe interpretation and summarization of complex medical concepts. Using\nreal-world hospital datasets, our experimental results demonstrate that the\nproposed approach of combining LLMs with KG has the potential to improve the\naccuracy of automated diagnosis generation. More importantly, our approach\noffers an explainable diagnostic pathway, edging us closer to the realization\nof AI-augmented diagnostic decision support systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:05:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Yanjun",""],["Li","Ruizhe",""],["Caskey","John",""],["Dligach","Dmitriy",""],["Miller","Timothy",""],["Churpek","Matthew M.",""],["Afshar","Majid",""]]}
{"id":"2308.14322","submitter":"Xulong Zhang","authors":"Xulong Zhang, Jianzong Wang, Ning Cheng, Yifu Sun, Chuanyao Zhang,\n  Jing Xiao","title":"Machine Unlearning Methodology base on Stochastic Teacher Network","comments":"Accepted by 19th International Conference on Advanced Data Mining and\n  Applications. (ADMA 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The rise of the phenomenon of the \"right to be forgotten\" has prompted\nresearch on machine unlearning, which grants data owners the right to actively\nwithdraw data that has been used for model training, and requires the\nelimination of the contribution of that data to the model. A simple method to\nachieve this is to use the remaining data to retrain the model, but this is not\nacceptable for other data owners who continue to participate in training.\nExisting machine unlearning methods have been found to be ineffective in\nquickly removing knowledge from deep learning models. This paper proposes using\na stochastic network as a teacher to expedite the mitigation of the influence\ncaused by forgotten data on the model. We performed experiments on three\ndatasets, and the findings demonstrate that our approach can efficiently\nmitigate the influence of target data on the model within a single epoch. This\nallows for one-time erasure and reconstruction of the model, and the\nreconstruction model achieves the same performance as the retrained model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:05:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Xulong",""],["Wang","Jianzong",""],["Cheng","Ning",""],["Sun","Yifu",""],["Zhang","Chuanyao",""],["Xiao","Jing",""]]}
{"id":"2308.14323","submitter":"Zexuan Zhou","authors":"Zexuan Zhou, Bingqi Ma, Jianwei Zhu, Zhizhong Kang","title":"Institutional mapping and causal analysis of avalanche vulnerable areas\n  based on multi-source data","comments":"19 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Avalanche disaster is a major natural disaster that seriously threatens the\nnational infrastructure and personnel's life safety. For a long time, the\nresearch of avalanche disaster prediction in the world is insufficient, there\nare only some basic models and basic conditions of occurrence, and there is no\nlong series and wide range of avalanche disaster prediction products. Based on\n7 different bands and different types of multi-source remote sensing data,this\nstudy combined with existing avalanche occurrence models, field investigation\nand statistical data to analyze the causes of avalanche. The U-net\nconvolutional neural network and threshold analysis were used to extract the\ndistribution of long time series avalanch-prone areas in two study areas,\nHeiluogou in Sichuan Province and along the Zangpo River in Palong, Tibet\nAutonomous Region. In addition, the relationship between earthquake magnitude\nand spatial distribution and avalanche occurrence is also analyzed in this\nstudy. This study will also continue to build a prior knowledge base of\navalanche occurrence conditions, improve the prediction accuracy of the two\nmethods, and produce products in long time series interannual avalanch-prone\nareas in southwest China, including Sichuan Province, Yunnan Province, and\nTibet Autonomous Region. The resulting products will provide high-precision\navalanche prediction and safety assurance for engineering construction and\nmountaineering activities in Southwest China.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:06:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Zexuan",""],["Ma","Bingqi",""],["Zhu","Jianwei",""],["Kang","Zhizhong",""]]}
{"id":"2308.14324","submitter":"Pengcheng Dong","authors":"Pengcheng Dong, Xiaojin Mao, Lixia Fan, Wenbo Wan, Jiande Sun","title":"CPFES: Physical Fitness Evaluation Based on Canadian Agility and\n  Movement Skill Assessment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In recent years, the assessment of fundamental movement skills integrated\nwith physical education has focused on both teaching practice and the\nfeasibility of assessment. The object of assessment has shifted from multiple\nages to subdivided ages, while the content of assessment has changed from\ncomplex and time-consuming to concise and efficient. Therefore, we apply deep\nlearning to physical fitness evaluation, we propose a system based on the\nCanadian Agility and Movement Skill Assessment (CAMSA) Physical Fitness\nEvaluation System (CPFES), which evaluates children's physical fitness based on\nCAMSA, and gives recommendations based on the scores obtained by CPFES to help\nchildren grow. We have designed a landmark detection module and a pose\nestimation module, and we have also designed a pose evaluation module for the\nCAMSA criteria that can effectively evaluate the actions of the child being\ntested. Our experimental results demonstrate the high accuracy of the proposed\nsystem.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:09:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Pengcheng",""],["Mao","Xiaojin",""],["Fan","Lixia",""],["Wan","Wenbo",""],["Sun","Jiande",""]]}
{"id":"2308.14325","submitter":"Fayin Wang","authors":"Zhao-Yang Xia, Yuan-Pei Yang, Qiao-Chu Li, Fa-Yin Wang, Bo-Yang Liu,\n  Zi-Gao Dai","title":"Polarization Evolution of Fast Radio Burst Sources in Binary Systems","comments":"24 pages, 14 figures, accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recently, some fast radio bursts (FRBs) have been reported to exhibit complex\nand diverse variations in Faraday rotation measurements (RM) and polarization,\nsuggesting that dynamically evolving magnetization environments may surround\nthem. In this paper, we investigate the Faraday conversion (FC) effect in a\nbinary system involving an FRB source and analyze the polarization evolution of\nFRBs. For an strongly magnetized high-mass companion binary (HMCB), when an FRB\nwith $\\sim100\\%$ linear polarization passes through the radial magnetic field\nof the companion star, the circular polarization (CP) component will be induced\nand oscillate symmetrically around the point with the CP degree equal to zero,\nthe rate and amplitude of the oscillation decrease as the frequency increases.\nThe very strong plasma column density in the HMCBs can cause CP to oscillate\nwith frequency at a very drastic rate, which may lead to depolarization. Near\nthe superior conjunction of the binary orbit, the DM varies significantly due\nto the dense plasma near the companion, and the significant FC also occurs in\nthis region. As the pulsar moves away from the superior conjunction, the CP\ngradually tends towards zero and then returns to its value before incidence. We\nalso investigate the effect of the rotation of the companion star. We find that\na sufficiently significant RM reversal can be produced at large magnetic\ninclinations and the RM variation is very diverse. Finally, we apply this model\nto explain some polarization observations of PSR B1744-24A and FRB 20201124A.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:09:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xia","Zhao-Yang",""],["Yang","Yuan-Pei",""],["Li","Qiao-Chu",""],["Wang","Fa-Yin",""],["Liu","Bo-Yang",""],["Dai","Zi-Gao",""]]}
{"id":"2308.14326","submitter":"Maximilian St\\\"abler","authors":"Maximilian Staebler, Frank Koester, Christoph Schlueter-Langdon","title":"Towards solving ontological dissonance using network graphs","comments":"5 pages, AMCIS 2023 proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data Spaces are an emerging concept for the trusted implementation of\ndata-based applications and business models, offering a high degree of\nflexibility and sovereignty to all stakeholders. As Data Spaces are currently\nemerging in different domains such as mobility, health or food, semantic\ninterfaces need to be identified and implemented to ensure the technical\ninteroperability of these Data Spaces. This paper consolidates data models from\n13 different domains and analyzes the ontological dissonance of these domains.\nUsing a network graph, central data models and ontology attributes are\nidentified, while the semantic heterogeneity of these domains is described\nqualitatively. The research outlook describes how these results help to connect\ndifferent Data Spaces across domains.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:10:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Staebler","Maximilian",""],["Koester","Frank",""],["Schlueter-Langdon","Christoph",""]]}
{"id":"2308.14327","submitter":"Takuya Taniguchi","authors":"Takuya Taniguchi (1 and 2), Jan Sahliger (2), and Christian H. Back\n  (2) ((1) Tohoku University, Japan, (2) Technical University of Munich,\n  Germany)","title":"Spin wave mode conversion in an in-plane magnetized microscale T-shaped\n  YIG magnonic splitter","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As one of the fundamental magnonic devices, a magnonic splitter device has\nbeen proposed and spin wave propagation in this device has been studied\nnumerically and experimentally. In the present work, we fabricated a T-shaped\nmagnonic splitter with 6 $\\mu$m-wide three arms using a 100 nm-thick yttrium\niron garnet film and, using time-resolved magneto-optic Kerr microscopy,\nobserved that spin waves split into both, the vertical and the horizontal\ndirection at the junction. Analyzing the results, we found that spin wave modes\nare converted into another during the splitting process and the splitting\nefficiency is dominantly dependent on the 1st order of incoming spin waves.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:11:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Taniguchi","Takuya","","1 and 2"],["Sahliger","Jan",""],["Back","Christian H.",""]]}
{"id":"2308.14328","submitter":"Yuanjiang Cao","authors":"Yuanjiang Cao and Quan Z. Sheng and Julian McAuley and Lina Yao","title":"Reinforcement Learning for Generative AI: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Generative AI has been a long-standing essential topic in the machine\nlearning community, which can impact a number of application areas like text\ngeneration and computer vision. The major paradigm to train a generative model\nis maximum likelihood estimation, which pushes the learner to capture and\napproximate the target data distribution by decreasing the divergence between\nthe model distribution and the target distribution. This formulation\nsuccessfully establishes the objective of generative tasks, while it is\nincapable of satisfying all the requirements that a user might expect from a\ngenerative model. Reinforcement learning, serving as a competitive option to\ninject new training signals by creating new objectives that exploit novel\nsignals, has demonstrated its power and flexibility to incorporate human\ninductive bias from multiple angles, such as adversarial learning,\nhand-designed rules and learned reward model to build a performant model.\nThereby, reinforcement learning has become a trending research field and has\nstretched the limits of generative AI in both model design and application. It\nis reasonable to summarize and conclude advances in recent years with a\ncomprehensive review. Although there are surveys in different application areas\nrecently, this survey aims to shed light on a high-level review that spans a\nrange of application areas. We provide a rigorous taxonomy in this area and\nmake sufficient coverage on various models and applications. Notably, we also\nsurveyed the fast-developing large language model area. We conclude this survey\nby showing the potential directions that might tackle the limit of current\nmodels and expand the frontiers for generative AI.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:15:14 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 01:58:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cao","Yuanjiang",""],["Sheng","Quan Z.",""],["McAuley","Julian",""],["Yao","Lina",""]]}
{"id":"2308.14329","submitter":"Jin Bok Park","authors":"Jin Bok Park, Jinkyu Lee, Muhyun Back, Hyunmin Han, David T. Ma, Sang\n  Min Won, Sung Soo Hwang, Il Yong Chun","title":"End-to-End Driving via Self-Supervised Imitation Learning Using Camera\n  and LiDAR Data","comments":"20 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In autonomous driving, the end-to-end (E2E) driving approach that predicts\nvehicle control signals directly from sensor data is rapidly gaining attention.\nTo learn a safe E2E driving system, one needs an extensive amount of driving\ndata and human intervention. Vehicle control data is constructed by many hours\nof human driving, and it is challenging to construct large vehicle control\ndatasets. Often, publicly available driving datasets are collected with limited\ndriving scenes, and collecting vehicle control data is only available by\nvehicle manufacturers. To address these challenges, this paper proposes the\nfirst self-supervised learning framework, self-supervised imitation learning\n(SSIL), that can learn E2E driving networks without using driving command data.\nTo construct pseudo steering angle data, proposed SSIL predicts a pseudo target\nfrom the vehicle's poses at the current and previous time points that are\nestimated with light detection and ranging sensors. Our numerical experiments\ndemonstrate that the proposed SSIL framework achieves comparable E2E driving\naccuracy with the supervised learning counterpart. In addition, our qualitative\nanalyses using a conventional visual explanation tool show that trained NNs by\nproposed SSIL and the supervision counterpart attend similar objects in making\npredictions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:17:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Park","Jin Bok",""],["Lee","Jinkyu",""],["Back","Muhyun",""],["Han","Hyunmin",""],["Ma","David T.",""],["Won","Sang Min",""],["Hwang","Sung Soo",""],["Chun","Il Yong",""]]}
{"id":"2308.14330","submitter":"Bin Liu","authors":"Bin Liu, Thomas Brinsmead, Stefan Westerlund, Robert Davy","title":"Calculation of Dispatchable Region for Renewables with Advanced\n  Computational Techniques","comments":"Accepted by CIGRE International Symposium, Cairns, Australia, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Dispatchable region for renewables (DRR) depicts a space for renewables that\na power system operator can manage by dispatching controllable resources. The\nDRR can be used to evaluate the distance from an operating point to a secure\nboundary and identify ramping events with the highest risk. However, existing\napproaches based on MILP reformulation or iteration-based LP algorithms may be\ncomputationally challenging. This paper investigates if advanced computation\ntechniques, including high-performance computing and parallel computing\ntechniques, can improve the computational performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:18:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Bin",""],["Brinsmead","Thomas",""],["Westerlund","Stefan",""],["Davy","Robert",""]]}
{"id":"2308.14331","submitter":"Koushik Viswanathan","authors":"Nitin Gupta and Vineet Dawara and Aloke Kumar and Koushik Viswanathan","title":"Synthetic space bricks from lunar and martian regolith via sintering","comments":"23 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The prospect of establishing extra-terrestrial habitats using in situ\nresource utilization (ISRU) constitutes a long-term goal of multiple space\nagencies around the world. In this work, we investigate sintering as a\npotential route for making building blocks -- termed synthetic space bricks --\nusing \\emph{in situ} regolith material. By systematically investigating\nsintering parameters using a numerical lattice model, coupled with experimental\nobservations and post sintering characterization, we propose a process protocol\nfor two lunar -- lunar highland simulant (LHS) and lunar mare dust simulant\n(LMS) -- and one martian (martian global simulant, MGS) simulants. The\nresulting bricks demonstrate compressive strengths of upto 45 MPa under\nuniaxial loading, depending on the simulant used. These strengths are much\ngreater than those typically mandated for structural applications under reduced\ngravity. We infer microscale sintering mechanisms at the individual particle\nlevel indirectly, by measuring temporal evolution exponents of sample\ndimensions during sintering. For all three simulants, volume diffusion appears\nto be the primary mechanism for particle coalescence. Our results clearly make\na strong case for the use of sintering as a potentially scalable method for\nconsolidating regolith into brick-like structures for load-bearing applications\nin extra-terrestrial settings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:19:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gupta","Nitin",""],["Dawara","Vineet",""],["Kumar","Aloke",""],["Viswanathan","Koushik",""]]}
{"id":"2308.14332","submitter":"Nevrez Imamoglu","authors":"Guanqun Ding and Nevrez Imamoglu and Ali Caglayan and Masahiro\n  Murakawa and Ryosuke Nakamura","title":"Attention-Guided Lidar Segmentation and Odometry Using Image-to-Point\n  Cloud Saliency Transfer","comments":"33 pages, 12 Figures, 6 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  LiDAR odometry estimation and 3D semantic segmentation are crucial for\nautonomous driving, which has achieved remarkable advances recently. However,\nthese tasks are challenging due to the imbalance of points in different\nsemantic categories for 3D semantic segmentation and the influence of dynamic\nobjects for LiDAR odometry estimation, which increases the importance of using\nrepresentative/salient landmarks as reference points for robust feature\nlearning. To address these challenges, we propose a saliency-guided approach\nthat leverages attention information to improve the performance of LiDAR\nodometry estimation and semantic segmentation models. Unlike in the image\ndomain, only a few studies have addressed point cloud saliency information due\nto the lack of annotated training data. To alleviate this, we first present a\nuniversal framework to transfer saliency distribution knowledge from color\nimages to point clouds, and use this to construct a pseudo-saliency dataset\n(i.e. FordSaliency) for point clouds. Then, we adopt point cloud-based\nbackbones to learn saliency distribution from pseudo-saliency labels, which is\nfollowed by our proposed SalLiDAR module. SalLiDAR is a saliency-guided 3D\nsemantic segmentation model that integrates saliency information to improve\nsegmentation performance. Finally, we introduce SalLONet, a self-supervised\nsaliency-guided LiDAR odometry network that uses the semantic and saliency\npredictions of SalLiDAR to achieve better odometry estimation. Our extensive\nexperiments on benchmark datasets demonstrate that the proposed SalLiDAR and\nSalLONet models achieve state-of-the-art performance against existing methods,\nhighlighting the effectiveness of image-to-LiDAR saliency knowledge transfer.\nSource code will be available at https://github.com/nevrez/SalLONet.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:22:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ding","Guanqun",""],["Imamoglu","Nevrez",""],["Caglayan","Ali",""],["Murakawa","Masahiro",""],["Nakamura","Ryosuke",""]]}
{"id":"2308.14333","submitter":"Jiawei Zhang","authors":"Jiawei Zhang, Zhongzhu Chen, Huan Zhang, Chaowei Xiao, Bo Li","title":"DiffSmooth: Certifiably Robust Learning via Diffusion Models and Local\n  Smoothing","comments":"Accepted in 32nd USENIX Security, 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion models have been leveraged to perform adversarial purification and\nthus provide both empirical and certified robustness for a standard model. On\nthe other hand, different robustly trained smoothed models have been studied to\nimprove the certified robustness. Thus, it raises a natural question: Can\ndiffusion model be used to achieve improved certified robustness on those\nrobustly trained smoothed models? In this work, we first theoretically show\nthat recovered instances by diffusion models are in the bounded neighborhood of\nthe original instance with high probability; and the \"one-shot\" denoising\ndiffusion probabilistic models (DDPM) can approximate the mean of the generated\ndistribution of a continuous-time diffusion model, which approximates the\noriginal instance under mild conditions. Inspired by our analysis, we propose a\ncertifiably robust pipeline DiffSmooth, which first performs adversarial\npurification via diffusion models and then maps the purified instances to a\ncommon region via a simple yet effective local smoothing strategy. We conduct\nextensive experiments on different datasets and show that DiffSmooth achieves\nSOTA-certified robustness compared with eight baselines. For instance,\nDiffSmooth improves the SOTA-certified accuracy from $36.0\\%$ to $53.0\\%$ under\n$\\ell_2$ radius $1.5$ on ImageNet. The code is available at\n[https://github.com/javyduck/DiffSmooth].\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:22:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Jiawei",""],["Chen","Zhongzhu",""],["Zhang","Huan",""],["Xiao","Chaowei",""],["Li","Bo",""]]}
{"id":"2308.14334","submitter":"Younggeol Cho","authors":"Youngrae Kim, Younggeol Cho, Thanh-Tung Nguyen, Dongman Lee","title":"MetaWeather: Few-Shot Weather-Degraded Image Restoration via Degradation\n  Pattern Matching","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Real-world vision tasks frequently suffer from the appearance of adverse\nweather conditions including rain, fog, snow, and raindrops in captured images.\nRecently, several generic methods for restoring weather-degraded images have\nbeen proposed, aiming to remove multiple types of adverse weather effects\npresent in the images. However, these methods have considered weather as\ndiscrete and mutually exclusive variables, leading to failure in generalizing\nto unforeseen weather conditions beyond the scope of the training data, such as\nthe co-occurrence of rain, fog, and raindrops. To this end, weather-degraded\nimage restoration models should have flexible adaptability to the current\nunknown weather condition to ensure reliable and optimal performance. The\nadaptation method should also be able to cope with data scarcity for real-world\nadaptation. This paper proposes MetaWeather, a few-shot weather-degraded image\nrestoration method for arbitrary weather conditions. For this, we devise the\ncore piece of MetaWeather, coined Degradation Pattern Matching Module (DPMM),\nwhich leverages representations from a few-shot support set by matching\nfeatures between input and sample images under new weather conditions. In\naddition, we build meta-knowledge with episodic meta-learning on top of our\nMetaWeather architecture to provide flexible adaptability. In the meta-testing\nphase, we adopt a parameter-efficient fine-tuning method to preserve the\nprebuilt knowledge and avoid the overfitting problem. Experiments on the BID\nTask II.A dataset show our method achieves the best performance on PSNR and\nSSIM compared to state-of-the-art image restoration methods. Code is available\nat (TBA).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:25:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Youngrae",""],["Cho","Younggeol",""],["Nguyen","Thanh-Tung",""],["Lee","Dongman",""]]}
{"id":"2308.14335","submitter":"Fran\\c{c}ois Bachoc","authors":"Fran\\c{c}ois Bachoc and Louis B\\'ethune and Alberto Gonz\\'alez-Sanz\n  and Jean-Michel Loubes","title":"Improved learning theory for kernel distribution regression with\n  two-stage sampling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The distribution regression problem encompasses many important statistics and\nmachine learning tasks, and arises in a large range of applications. Among\nvarious existing approaches to tackle this problem, kernel methods have become\na method of choice. Indeed, kernel distribution regression is both\ncomputationally favorable, and supported by a recent learning theory. This\ntheory also tackles the two-stage sampling setting, where only samples from the\ninput distributions are available. In this paper, we improve the learning\ntheory of kernel distribution regression. We address kernels based on\nHilbertian embeddings, that encompass most, if not all, of the existing\napproaches. We introduce the novel near-unbiased condition on the Hilbertian\nembeddings, that enables us to provide new error bounds on the effect of the\ntwo-stage sampling, thanks to a new analysis. We show that this near-unbiased\ncondition holds for three important classes of kernels, based on optimal\ntransport and mean embedding. As a consequence, we strictly improve the\nexisting convergence rates for these kernels. Our setting and results are\nillustrated by numerical experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:29:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bachoc","Fran\u00e7ois",""],["B\u00e9thune","Louis",""],["Gonz\u00e1lez-Sanz","Alberto",""],["Loubes","Jean-Michel",""]]}
{"id":"2308.14336","submitter":"Yifeng Xiong","authors":"Yifeng Xiong, Fan Liu, Marco Lops","title":"Generalized Deterministic-Random Tradeoff in Integrated Sensing and\n  Communications: The Sensing-Optimal Operating Point","comments":"7 pages, 1+4 figures, submitted to ICASSP 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Integrated sensing and communications (ISAC) has been recognized as a key\ncomponent in the envisioned 6G communication systems. Understanding the\nfundamental performance tradeoff between sensing and communication\nfunctionalities is essential for designing practical cost-efficient ISAC\nsystems. In this paper, we aim for augmenting the current understanding of the\ndeterministic-random tradeoff (DRT) between sensing and communication, by\nanalyzing the sensing-optimal operating point of the fundamental\ncapacity-distortion region. We show that the DRT exists for generic sensing\nperformance metrics that are in general not convex/concave in the ISAC\nwaveform. Especially, we elaborate on a representative non-convex performance\nmetric, namely the detection probability for target detection tasks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:30:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiong","Yifeng",""],["Liu","Fan",""],["Lops","Marco",""]]}
{"id":"2308.14337","submitter":"Jonathan Shaki","authors":"Jonathan Shaki, Sarit Kraus, Michael Wooldridge","title":"Cognitive Effects in Large Language Models","comments":"Accepted and will be published in the ECAI conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) such as ChatGPT have received enormous attention\nover the past year and are now used by hundreds of millions of people every\nday. The rapid adoption of this technology naturally raises questions about the\npossible biases such models might exhibit. In this work, we tested one of these\nmodels (GPT-3) on a range of cognitive effects, which are systematic patterns\nthat are usually found in human cognitive tasks. We found that LLMs are indeed\nprone to several human cognitive effects. Specifically, we show that the\npriming, distance, SNARC, and size congruity effects were presented with GPT-3,\nwhile the anchoring effect is absent. We describe our methodology, and\nspecifically the way we converted real-world experiments to text-based\nexperiments. Finally, we speculate on the possible reasons why GPT-3 exhibits\nthese effects and discuss whether they are imitated or reinvented.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:30:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shaki","Jonathan",""],["Kraus","Sarit",""],["Wooldridge","Michael",""]]}
{"id":"2308.14338","submitter":"Song Wang","authors":"Song Wang, Jing Ma, Lu Cheng, Jundong Li","title":"Fair Few-shot Learning with Auxiliary Sets","comments":"ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recently, there has been a growing interest in developing machine learning\n(ML) models that can promote fairness, i.e., eliminating biased predictions\ntowards certain populations (e.g., individuals from a specific demographic\ngroup). Most existing works learn such models based on well-designed fairness\nconstraints in optimization. Nevertheless, in many practical ML tasks, only\nvery few labeled data samples can be collected, which can lead to inferior\nfairness performance. This is because existing fairness constraints are\ndesigned to restrict the prediction disparity among different sensitive groups,\nbut with few samples, it becomes difficult to accurately measure the disparity,\nthus rendering ineffective fairness optimization. In this paper, we define the\nfairness-aware learning task with limited training samples as the \\emph{fair\nfew-shot learning} problem. To deal with this problem, we devise a novel\nframework that accumulates fairness-aware knowledge across different\nmeta-training tasks and then generalizes the learned knowledge to meta-test\ntasks. To compensate for insufficient training samples, we propose an essential\nstrategy to select and leverage an auxiliary set for each meta-test task. These\nauxiliary sets contain several labeled training samples that can enhance the\nmodel performance regarding fairness in meta-test tasks, thereby allowing for\nthe transfer of learned useful fairness-oriented knowledge to meta-test tasks.\nFurthermore, we conduct extensive experiments on three real-world datasets to\nvalidate the superiority of our framework against the state-of-the-art\nbaselines.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:31:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Song",""],["Ma","Jing",""],["Cheng","Lu",""],["Li","Jundong",""]]}
{"id":"2308.14339","submitter":"Ryan Brill","authors":"Ryan S. Brill, Ian J. Barnett, and Abraham J. Wyner","title":"Introducing the Multi-Brackets Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Much work in the March Madness literature has discussed how to estimate the\nprobability that any one team beats any other team. There has been strikingly\nlittle work, however, on what to do with these win probabilities. Hence we pose\nthe multi-brackets problem: given these probabilities, what is the best way to\nsubmit a set of $n$ brackets to a March Madness bracket challenge? This is an\nextremely difficult question, so we begin with a simpler situation. In\nparticular, we compare various sets of $n$ randomly sampled brackets, subject\nto different entropy ranges or levels of chalkiness (rougly, chalkier brackets\nfeature fewer upsets). We learn three lessons. First, the observed NCAA\ntournament is a \"typical\" bracket with a certain \"right\" amount of entropy\n(roughly, a \"right\" amount of upsets), not a chalky bracket. Second, to\nmaximize the expected score of a set of $n$ randomly sampled brackets, we\nshould be successively less chalky as the number of submitted brackets\nincreases. Third, to maximize the probability of winning a bracket challenge\nagainst a field of opposing brackets, we should tailor the chalkiness of our\nbrackets to the chalkiness of our opponents' brackets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:32:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Brill","Ryan S.",""],["Barnett","Ian J.",""],["Wyner","Abraham J.",""]]}
{"id":"2308.14340","submitter":"Jiaxi Li","authors":"Jiaxi Li, Guansong Pang, Ling Chen, Mohammad-Reza Namazi-Rad","title":"HRGCN: Heterogeneous Graph-level Anomaly Detection with Hierarchical\n  Relation-augmented Graph Neural Networks","comments":"12 pages, 10 figures, 6 tables. Accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work considers the problem of heterogeneous graph-level anomaly\ndetection. Heterogeneous graphs are commonly used to represent behaviours\nbetween different types of entities in complex industrial systems for capturing\nas much information about the system operations as possible. Detecting\nanomalous heterogeneous graphs from a large set of system behaviour graphs is\ncrucial for many real-world applications like online web/mobile service and\ncloud access control. To address the problem, we propose HRGCN, an unsupervised\ndeep heterogeneous graph neural network, to model complex heterogeneous\nrelations between different entities in the system for effectively identifying\nthese anomalous behaviour graphs. HRGCN trains a hierarchical\nrelation-augmented Heterogeneous Graph Neural Network (HetGNN), which learns\nbetter graph representations by modelling the interactions among all the system\nentities and considering both source-to-destination entity (node) types and\ntheir relation (edge) types. Extensive evaluation on two real-world application\ndatasets shows that HRGCN outperforms state-of-the-art competing anomaly\ndetection approaches. We further present a real-world industrial case study to\njustify the effectiveness of HRGCN in detecting anomalous (e.g., congested)\nnetwork devices in a mobile communication service. HRGCN is available at\nhttps://github.com/jiaxililearn/HRGCN.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:32:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jiaxi",""],["Pang","Guansong",""],["Chen","Ling",""],["Namazi-Rad","Mohammad-Reza",""]]}
{"id":"2308.14341","submitter":"Neuton Li","authors":"Neuton Li, Shaun Lung, Jihua Zhang, Dragomir N. Neshev, Andrey A.\n  Sukhorukov","title":"Full conversion of unpolarized to fixed-polarization light with topology\n  optimized metasurfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Conventional polarizers and polarization beam splitters have a fundamental\nlimit of 50\\% efficiency when converting unpolarized light into one specific\npolarization. Here, we overcome this restriction and achieve near-complete\nconversion of unpolarized light to a single pure polarization state at several\noutputs of topology-optimized metasurfaces. Our fabricated metasurface achieves\nan extinction ratio approaching 100, when characterized with laboratory\nmeasurements. We further demonstrate that arbitrary power splitting can be\nachieved between three or more polarized outputs, offering flexibility in\ntarget illumination. Our results provide a path toward greatly improving the\nefficiency of common unpolarized light sources in a variety of applications\nrequiring pure polarizations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:32:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Neuton",""],["Lung","Shaun",""],["Zhang","Jihua",""],["Neshev","Dragomir N.",""],["Sukhorukov","Andrey A.",""]]}
{"id":"2308.14342","submitter":"Xing-Tao An","authors":"Zhao Gong, Qing-Qing Zhang, Hui-Ying Mu, Xing-Tao An, Jian-Jun Liu","title":"Spin-polarized transport properties in magnetic moir\\'e superlattices","comments":"6 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since the discovery of the fascinating properties in magic-angle graphene,\nthe exploration of moir\\'e systems in other two-dimensional materials has\ngarnered significant attention and given rise to a field known as 'moir\\'e\nphysics'. Within this realm, magnetic van der Waals heterostructure and the\nmagnetic proximity effect in moir\\'e superlattices have also become subjects of\ngreat interest. However, the spin-polarized transport property in this moir\\'e\nstructures is still a problem to be explored. Here, we investigate the\nspin-polarized transport properties in a moir\\'e superlattices formed by a\ntwo-dimensional ferromagnet CrI_3 stacked on a monolayer BAs, where the spin\ndegeneracy is lifted because of the magnetic proximity effect associated with\nthe moir\\'e superlattices. We find that the conductance exhibits spin-resolved\nminiband transport properties at a small twist angle because of the periodic\nmoir\\'e superlattices. When the incident energy is in the spin-resolved\nminigaps, the available states are spin polarized, thus providing a\nspin-polarized current from the superlattice. Moreover, only a finite number of\nmoir\\'e period is required to obtain a net spin polarization of 100\\%. In\naddition, the interlayer distance of the heterojunction is also moir\\'e\nmodifiable, so a perpendicular electric field can be applied to modulate the\nintensity and direction of the spin polarization. Our finding points to an\nopportunity to realize spin functionalities in magnetic moir\\'e superlattices.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:39:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gong","Zhao",""],["Zhang","Qing-Qing",""],["Mu","Hui-Ying",""],["An","Xing-Tao",""],["Liu","Jian-Jun",""]]}
{"id":"2308.14343","submitter":"Diego Vallarino","authors":"Diego Vallarino","title":"Buy when? Survival machine learning model comparison for purchase timing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The value of raw data is unlocked by converting it into information and\nknowledge that drives decision-making. Machine Learning (ML) algorithms are\ncapable of analysing large datasets and making accurate predictions. Market\nsegmentation, client lifetime value, and marketing techniques have all made use\nof machine learning. This article examines marketing machine learning\ntechniques such as Support Vector Machines, Genetic Algorithms, Deep Learning,\nand K-Means. ML is used to analyse consumer behaviour, propose items, and make\nother customer choices about whether or not to purchase a product or service,\nbut it is seldom used to predict when a person will buy a product or a basket\nof products. In this paper, the survival models Kernel SVM, DeepSurv, Survival\nRandom Forest, and MTLR are examined to predict tine-purchase individual\ndecisions. Gender, Income, Location, PurchaseHistory, OnlineBehavior,\nInterests, PromotionsDiscounts and CustomerExperience all have an influence on\npurchasing time, according to the analysis. The study shows that the DeepSurv\nmodel predicted purchase completion the best. These insights assist marketers\nin increasing conversion rates.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:40:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vallarino","Diego",""]]}
{"id":"2308.14344","submitter":"Kazuhiko Seki","authors":"Sangyoub Lee, Sergey D. Traytak, and Kazuhiko Seki","title":"Persistent effects of inertia on diffusion-influenced reactions:\n  Theoretical methods and applications","comments":"2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Cattaneo-Vernotte model has been widely studied to take momentum\nrelaxation into account in transport equations. Yet, the effect of reactions on\nthe Cattaneo-Vernotte model has not been fully elucidated. At present, it is\nunclear how the current density associated with reactions can be expressed in\nthe Cattaneo-Vernotte model. Herein, we derive a modified Cattaneo-Vernotte\nmodel by applying the projection operator method to the Fokker-Planck-Kramers\nequation with a reaction sink. The same modified Cattaneo-Vernotte model can be\nderived by a Grad procedure. We show that the inertial effect influences the\nreaction rate coefficient differently depending on whether the intrinsic\nreaction rate constant in the reaction sink term depends on the solute relative\nvelocity or not. The momentum relaxation effect can be expressed by a modified\nSmoluchowski equation including a memory kernel using the Cattaneo-Vernotte\nmodel. When the intrinsic reaction rate constant is independent of the reactant\nvelocity and is localized, the modified Smoluchowski equation should be\ngeneralized to include a reaction term without a memory kernel. When the\nintrinsic reaction rate constant depends on the relative velocity of reactants,\nan additional reaction term with a memory kernel is required because of\ncompetition between the current density associated with the reaction and the\ndiffusive flux during momentum relaxation. The competition effect influences\neven the long-time reaction rate coefficient.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:40:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Sangyoub",""],["Traytak","Sergey D.",""],["Seki","Kazuhiko",""]]}
{"id":"2308.14345","submitter":"Degiorgi","authors":"M. Corasaniti, R. Yang, J.A.W. Straquadine, A. Kapitulnik, I.R.\n  Fisher, L. Degiorgi","title":"Impact of disorder in the charge-density-wave state of Pd-intercalated\n  ErTe$_3$ revealed by the electrodynamic response","comments":"16 pages, 17 figures","journal-ref":"Phys. Rev. Research 5, 033140 (2023)","doi":"10.1103/PhysRevResearch.5.033140","report-no":null,"categories":"cond-mat.str-el cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  It is a general notion that disorder, introduced by either chemical\nsubstitution or intercalation as well as by electron-irradiation, is\ndetrimental to the realisation of long-range charge-density-wave (CDW) order.\nWe study the disorder-induced suppression of the in-plane CDW orders in the\ntwo-dimensional Pd-intercalated ErTe$_3$ compositions, by exploring the real\npart of the optical conductivity with light polarised along the in-plane $a$\nand $c$ axes. Our findings reveal an anisotropic charge dynamics with respect\nto both incommensurate unidirectional CDW phases of ErTe$_3$, occurring within\nthe $ac$-plane. The anisotropic optical response gets substantially washed out\nwith Pd-intercalation, hand-in-hand with the suppression of both CDW orders.\nThe spectral weight analysis though advances the scenario, for which the CDW\nphases evolve from a (partially) depleted Fermi surface already above their\ncritical onset temperatures. We therefore argue that the long-range CDW orders\nof ErTe$_3$ tend to be progressively dwarfed by Pd-intercalation, which favours\nthe presence of short-range CDW segments for both crystallographic directions\npersisting in a broad temperature ($T$) interval up to the normal state, and\nbeing suggestive of precursor effects of the CDW orders as well as possibly\ncoexisting with superconductivity at low $T$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:40:14 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Corasaniti","M.",""],["Yang","R.",""],["Straquadine","J. A. W.",""],["Kapitulnik","A.",""],["Fisher","I. R.",""],["Degiorgi","L.",""]]}
{"id":"2308.14346","submitter":"Zhijie Bao","authors":"Zhijie Bao, Wei Chen, Shengze Xiao, Kuang Ren, Jiaao Wu, Cheng Zhong,\n  Jiajie Peng, Xuanjing Huang, Zhongyu Wei","title":"DISC-MedLLM: Bridging General Large Language Models and Real-World\n  Medical Consultation","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose DISC-MedLLM, a comprehensive solution that leverages Large\nLanguage Models (LLMs) to provide accurate and truthful medical response in\nend-to-end conversational healthcare services. To construct high-quality\nSupervised Fine-Tuning (SFT) datasets, we employ three strategies: utilizing\nmedical knowledge-graphs, reconstructing real-world dialogues, and\nincorporating human-guided preference rephrasing. These datasets are\ninstrumental in training DISC-MedLLM, surpassing existing medical LLMs in both\nsingle-turn and multi-turn consultation scenarios. Extensive experimental\nresults demonstrate the effectiveness of the proposed model in bridging the gap\nbetween general language models and real-world medical consultation.\nAdditionally, we release the constructed dataset and model weights to further\ncontribute to research and development. Further details and resources can be\nfound at https://github.com/FudanDISC/DISC-MedLLM\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:41:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bao","Zhijie",""],["Chen","Wei",""],["Xiao","Shengze",""],["Ren","Kuang",""],["Wu","Jiaao",""],["Zhong","Cheng",""],["Peng","Jiajie",""],["Huang","Xuanjing",""],["Wei","Zhongyu",""]]}
{"id":"2308.14347","submitter":"Kangrou Guo","authors":"Kangrou Guo, Eiichiro Kokubo","title":"Formation of inner planets in the presence of a Cold Jupiter: orbital\n  evolution and relative velocities of planetesimals","comments":"Accepted for publication in ApJ. 17 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the orbital evolution of planetesimals in the inner disk in\nthe presence of nebula gas and a (proto-) cold Jupiter. By varying the mass,\neccentricity, and semi-major axis of the planet, we study the dependence of the\nrelative velocities of the planetesimals on these parameters. For classic small\nplanetesimals ($10^{16}-10^{20} $g) whose mutual gravitational interaction is\nnegligible, gas drag introduces a size-dependent alignment of orbits and keeps\nthe relative velocity low for similar-size bodies, while preventing orbital\nalignment for different-size planetesimals. Regardless of the location and the\nmass ratio of the planetesimals, increasing the mass and eccentricity or\ndecreasing the orbital distance of the planet always leads to higher relative\nvelocities of planetesimals. However, for massive planetesimals, the interplay\nof viscous stirring, gas damping, and secular perturbation results in lower\nvelocity dispersion of equal-size planetesimals when the planet is more massive\nor when it is located on a closer or more eccentric orbit. The random\nvelocities of such planetesimals remain almost unperturbed when the planet is\nlocated beyond Jupiter's current orbit, or when it is less massive or less\neccentric than Jupiter. Unlike small planetesimals, such large planetesimals\ncan grow in a runaway fashion as in the unperturbed case. Our results imply\nthat the presence of a cold Jupiter does not impede the formation of inner\nrocky planets through planetesimal accretion, provided that the planetesimals\nare initially large.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:45:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Kangrou",""],["Kokubo","Eiichiro",""]]}
{"id":"2308.14348","submitter":"Xiucheng Wang","authors":"Zhaowei Wang, Zhisheng Yin, Xiucheng Wang, Nan Cheng, Yuan Zhang, Tom\n  H. Luan","title":"Label-free Deep Learning Driven Secure Access Selection in\n  Space-Air-Ground Integrated Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.CR cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In Space-air-ground integrated networks (SAGIN), the inherent openness and\nextensive broadcast coverage expose these networks to significant eavesdropping\nthreats. Considering the inherent co-channel interference due to spectrum\nsharing among multi-tier access networks in SAGIN, it can be leveraged to\nassist the physical layer security among heterogeneous transmissions. However,\nit is challenging to conduct a secrecy-oriented access strategy due to both\nheterogeneous resources and different eavesdropping models. In this paper, we\nexplore secure access selection for a scenario involving multi-mode users\ncapable of accessing satellites, unmanned aerial vehicles, or base stations in\nthe presence of eavesdroppers. Particularly, we propose a Q-network\napproximation based deep learning approach for selecting the optimal access\nstrategy for maximizing the sum secrecy rate. Meanwhile, the power optimization\nis also carried out by an unsupervised learning approach to improve the secrecy\nperformance. Remarkably, two neural networks are trained by unsupervised\nlearning and Q-network approximation which are both label-free methods without\nknowing the optimal solution as labels. Numerical results verify the efficiency\nof our proposed power optimization approach and access strategy, leading to\nenhanced secure transmission performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:48:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Zhaowei",""],["Yin","Zhisheng",""],["Wang","Xiucheng",""],["Cheng","Nan",""],["Zhang","Yuan",""],["Luan","Tom H.",""]]}
{"id":"2308.14349","submitter":"Gang Wang","authors":"Long Chen, Ying Zhou, He Zhang, Zhongnan Guo, Xiaohui Yu, Gang Wang","title":"Anisotropic and pressure tunable magnetism of titanium-based Kagome\n  ferromagnet SmTi3Bi4","comments":"Manuscript: 12 pages, 4 figures, Supporting information: 7 pages,5\n  figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Kagome magnets showing diverse topological quantum responses are crucial for\nnext-generation topological engineering. Here we report the physical properties\nof a newly discovered titanium-based Kagome ferromagnet SmTi3Bi4, mainly\nfocusing on its anisotropy and high-pressure tunability of magnetism. The\ncrystal structure of SmTi3Bi4 belongs to the RETi3Bi4 (RE = Rare earth element)\nprototype, featuring a distorted Ti Kagome lattice in TiBi layer and Sm-atomic\nzig-zag chain along the c axis. By the temperature-dependent resistivity, heat\ncapacity, and magnetic susceptibility measurements, a ferromagnetic (FM)\nordering temperature Tc is determined to be 23.2 K, above which a T-linear\nresistivity and quite large density of states near Fermi level are hinted to\nexist. A large magnetic anisotropy was observed by rotating the in-plane\nmagnetic field, showing the b axis is the easy magnetizations axis. The\nresistance under high pressure shows a suppression from 23.2 K to 8.5 K up to\n23.5 GPa first and a following little enhancement up to 44.8 GPa. Considering\nthe large in-plane magnetization between stacked Kagome lattices and tunability\nof FM order, possible topological phase transitions can be anticipated in\nSmTi3Bi4, which should be a new promising platform to explore the complex\nelectronic and magnetic phases based on Kagome lattice.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:49:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Long",""],["Zhou","Ying",""],["Zhang","He",""],["Guo","Zhongnan",""],["Yu","Xiaohui",""],["Wang","Gang",""]]}
{"id":"2308.14350","submitter":"Nobuhito Manome","authors":"Nobuhito Manome, Shuji Shinohara, Ung-il Chung","title":"Simple Modification of the Upper Confidence Bound Algorithm by\n  Generalized Weighted Averages","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The multi-armed bandit (MAB) problem is a classical problem that models\nsequential decision-making under uncertainty in reinforcement learning. In this\nstudy, we propose a new generalized upper confidence bound (UCB) algorithm\n(GWA-UCB1) by extending UCB1, which is a representative algorithm for MAB\nproblems, using generalized weighted averages, and present an effective\nalgorithm for various problem settings. GWA-UCB1 is a two-parameter\ngeneralization of the balance between exploration and exploitation in UCB1 and\ncan be implemented with a simple modification of the UCB1 formula. Therefore,\nthis algorithm can be easily applied to UCB-based reinforcement learning\nmodels. In preliminary experiments, we investigated the optimal parameters of a\nsimple generalized UCB1 (G-UCB1), prepared for comparison and GWA-UCB1, in a\nstochastic MAB problem with two arms. Subsequently, we confirmed the\nperformance of the algorithms with the investigated parameters on stochastic\nMAB problems when arm reward probabilities were sampled from uniform or normal\ndistributions and on survival MAB problems assuming more realistic situations.\nGWA-UCB1 outperformed G-UCB1, UCB1-Tuned, and Thompson sampling in most problem\nsettings and can be useful in many situations. The code is available at\nhttps://github.com/manome/python-mab.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:53:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Manome","Nobuhito",""],["Shinohara","Shuji",""],["Chung","Ung-il",""]]}
{"id":"2308.14351","submitter":"Anthony Gagaglione","authors":"Anthony M. Gaglione and Dennis Spellman","title":"An axiomatization for the universal theory of the Heisenberg group","comments":"13 pages. Published in journal of Groups, Complexity, Cryptology","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Heisenberg group, here denoted $H$, is the group of all $3\\times 3$ upper\nunitriangular matrices with entries in the ring $\\mathbb{Z}$ of integers. A.G.\nMyasnikov posed the question of whether or not the universal theory of $H$, in\nthe language of $H$, is axiomatized, when the models are restricted to\n$H$-groups, by the quasi-identities true in $H$ together with the assertion\nthat the centralizers of noncentral elements be abelian. Based on earlier\npublished partial results we here give a complete proof of a slightly stronger\nresult.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:53:32 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 00:25:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gaglione","Anthony M.",""],["Spellman","Dennis",""]]}
{"id":"2308.14352","submitter":"Rongjie Yi","authors":"Rongjie Yi, Liwei Guo, Shiyun Wei, Ao Zhou, Shangguang Wang, Mengwei\n  Xu","title":"EdgeMoE: Fast On-Device Inference of MoE-based Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) such as GPTs and LLaMa have ushered in a\nrevolution in machine intelligence, owing to their exceptional capabilities in\na wide range of machine learning tasks. However, the transition of LLMs from\ndata centers to edge devices presents a set of challenges and opportunities.\nWhile this shift can enhance privacy and availability, it is hampered by the\nenormous parameter sizes of these models, leading to impractical runtime costs.\nIn light of these considerations, we introduce EdgeMoE, the first on-device\ninference engine tailored for mixture-of-expert (MoE) LLMs, a popular variant\nof sparse LLMs that exhibit nearly constant computational complexity as their\nparameter size scales. EdgeMoE achieves both memory and computational\nefficiency by strategically partitioning the model across the storage\nhierarchy. Specifically, non-expert weights are stored in the device's memory,\nwhile expert weights are kept in external storage and are fetched into memory\nonly when they are activated. This design is underpinned by a crucial insight\nthat expert weights, though voluminous, are infrequently accessed due to sparse\nactivation patterns. To further mitigate the overhead associated with expert\nI/O swapping, EdgeMoE incorporates two innovative techniques: (1) Expert-wise\nbitwidth adaptation: This method reduces the size of expert weights with an\nacceptable level of accuracy loss. (2) Expert management: It predicts the\nexperts that will be activated in advance and preloads them into the\ncompute-I/O pipeline, thus further optimizing the process. In empirical\nevaluations conducted on well-established MoE LLMs and various edge devices,\nEdgeMoE demonstrates substantial memory savings and performance improvements\nwhen compared to competitive baseline solutions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:56:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yi","Rongjie",""],["Guo","Liwei",""],["Wei","Shiyun",""],["Zhou","Ao",""],["Wang","Shangguang",""],["Xu","Mengwei",""]]}
{"id":"2308.14353","submitter":"Baoli Zhang","authors":"Baoli Zhang, Haining Xie, Pengfan Du, Junhao Chen, Pengfei Cao, Yubo\n  Chen, Shengping Liu, Kang Liu, Jun Zhao","title":"ZhuJiu: A Multi-dimensional, Multi-faceted Chinese Benchmark for Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The unprecedented performance of large language models (LLMs) requires\ncomprehensive and accurate evaluation. We argue that for LLMs evaluation,\nbenchmarks need to be comprehensive and systematic. To this end, we propose the\nZhuJiu benchmark, which has the following strengths: (1) Multi-dimensional\nability coverage: We comprehensively evaluate LLMs across 7 ability dimensions\ncovering 51 tasks. Especially, we also propose a new benchmark that focuses on\nknowledge ability of LLMs. (2) Multi-faceted evaluation methods collaboration:\nWe use 3 different yet complementary evaluation methods to comprehensively\nevaluate LLMs, which can ensure the authority and accuracy of the evaluation\nresults. (3) Comprehensive Chinese benchmark: ZhuJiu is the pioneering\nbenchmark that fully assesses LLMs in Chinese, while also providing equally\nrobust evaluation abilities in English. (4) Avoiding potential data leakage: To\navoid data leakage, we construct evaluation data specifically for 37 tasks. We\nevaluate 10 current mainstream LLMs and conduct an in-depth discussion and\nanalysis of their results. The ZhuJiu benchmark and open-participation\nleaderboard are publicly released at http://www.zhujiu-benchmark.com/ and we\nalso provide a demo video at https://youtu.be/qypkJ89L1Ic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:56:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Baoli",""],["Xie","Haining",""],["Du","Pengfan",""],["Chen","Junhao",""],["Cao","Pengfei",""],["Chen","Yubo",""],["Liu","Shengping",""],["Liu","Kang",""],["Zhao","Jun",""]]}
{"id":"2308.14354","submitter":"Martin Lind","authors":"Martin Lind","title":"Some remarks related to the density of $\\{(b^n\\pmod\n  n)/n:n\\in\\mathbb{N}\\}$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For $b\\in\\mathbb{N}, b\\ge2$ we determine the limit points of certain subsets\nof\n  $$\n  \\left\\{\\frac{b^n\\pmod{n}}{n}:n\\in\\mathbb{N}\\right\\}.\n  $$ As a consequence, we obtain the density of the latter set in $[0,1]$, a\nresult first established in 2013 by Cilleruelo, Kumchev, Luca, Ru\\'{e} and\nShparlinski..\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 06:56:49 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:00:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lind","Martin",""]]}
{"id":"2308.14355","submitter":"Peiyan Zhang","authors":"Peiyan Zhang, Yuchen Yan, Chaozhuo Li, Senzhang Wang, Xing Xie,\n  Sunghun Kim","title":"Can Transformer and GNN Help Each Other?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although Transformer has achieved great success in natural language process\nand computer vision, it has difficulty generalizing to medium and large-scale\ngraph data for two important reasons: (i) High complexity. (ii) Failing to\ncapture the complex and entangled structure information. In graph\nrepresentation learning, Graph Neural Networks(GNNs) can fuse the graph\nstructure and node attributes but have limited receptive fields. Therefore, we\nquestion whether can we combine Transformers and GNNs to help each other. In\nthis paper, we propose a new model named TransGNN where the Transformer layer\nand GNN layer are used alternately to improve each other. Specifically, to\nexpand the receptive field and disentangle the information aggregation from\nedges, we propose using Transformer to aggregate more relevant nodes'\ninformation to improve the message passing of GNNs. Besides, to capture the\ngraph structure information, we utilize positional encoding and make use of the\nGNN layer to fuse the structure into node attributes, which improves the\nTransformer in graph data. We also propose to sample the most relevant nodes\nfor Transformer and two efficient samples update strategies to lower the\ncomplexity. At last, we theoretically prove that TransGNN is more expressive\nthan GNNs only with extra linear complexity. The experiments on eight datasets\ncorroborate the effectiveness of TransGNN on node and graph classification\ntasks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:03:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Peiyan",""],["Yan","Yuchen",""],["Li","Chaozhuo",""],["Wang","Senzhang",""],["Xie","Xing",""],["Kim","Sunghun",""]]}
{"id":"2308.14356","submitter":"Tierui Gong","authors":"Tierui Gong, Chongwen Huang, Jiguang He, Marco Di Renzo, M\\'erouane\n  Debbah, Chau Yuen","title":"A Transmit-Receive Parameter Separable Electromagnetic Channel Model for\n  LoS Holographic MIMO","comments":"Double column, 6 pages, 3 figures, 1 table, accepted by 2023 IEEE\n  Global Communications Conference (GLOBECOM 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  To support the extremely high spectral efficiency and energy efficiency\nrequirements, and emerging applications of future wireless communications,\nholographic multiple-input multiple-output (H-MIMO) technology is envisioned as\none of the most promising enablers. It can potentially bring extra\ndegrees-of-freedom for communications and signal processing, including spatial\nmultiplexing in line-of-sight (LoS) channels and electromagnetic (EM) field\nprocessing performed using specialized devices, to attain the fundamental\nlimits of wireless communications. In this context, EM-domain channel modeling\nis critical to harvest the benefits offered by H-MIMO. Existing EM-domain\nchannel models are built based on the tensor Green function, which require\nprior knowledge of the global position and/or the relative distances and\ndirections of the transmit/receive antenna elements. Such knowledge may be\ndifficult to acquire in real-world applications due to extensive measurements\nneeded for obtaining this data. To overcome this limitation, we propose a\ntransmit-receive parameter separable channel model methodology in which the\nEM-domain (or holographic) channel can be simply acquired from the\ndistance/direction measured between the center-points between the transmit and\nreceive surfaces, and the local positions between the transmit and receive\nelements, thus avoiding extensive global parameter measurements. Analysis and\nnumerical results showcase the effectiveness of the proposed channel modeling\napproach in approximating the H-MIMO channel, and achieving the theoretical\nchannel capacity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:04:30 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 16:08:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gong","Tierui",""],["Huang","Chongwen",""],["He","Jiguang",""],["Di Renzo","Marco",""],["Debbah","M\u00e9rouane",""],["Yuen","Chau",""]]}
{"id":"2308.14357","submitter":"Hari Krishna Hari Prasad","authors":"Hari Krishna Hari Prasad and Kaushik Jayaram","title":"Geometric Mechanics of Simultaneous Nonslip Contact in a Planar\n  Quadruped","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we develop a geometric framework for generating non-slip\nquadrupedal two-beat gaits. We consider a four-bar mechanism as a surrogate\nmodel for a contact state and develop the geometric tools such as shape-change\nbasis to aid in gait generation, local connection as the matrix-equation of\nmotion, and stratified panels to model net locomotion in line with previous\nwork\\cite{prasad2023contactswitch}. Standard two-beat gaits in quadrupedal\nsystems like trot divide the shape space into two equal, decoupled subspaces.\nThe subgaits generated in each subspace space are designed independently and\nwhen combined with appropriate phasing generate a two-beat gait where the\ndisplacements add up due to the geometric nature of the system. By adding\n``scaling\" and ``sliding\" control knobs to subgaits defined as flows over the\nshape-change basis, we continuously steer an arbitrary, planar quadrupedal\nsystem. This exhibits translational anisotropy when modulated using the scaling\ninputs. To characterize the steering induced by sliding inputs, we define an\naverage path curvature function analytically and show that the steering gaits\ncan be generated using a geometric nonslip contact modeling framework.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:06:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Prasad","Hari Krishna Hari",""],["Jayaram","Kaushik",""]]}
{"id":"2308.14358","submitter":"Rongchan Zhu","authors":"Martina Hofmanov\\'a, Xiaoyutao Luo, Rongchan Zhu, Xiangchan Zhu","title":"Surface quasi-geostrophic equation perturbed by derivatives of\n  space-time white noise","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a family of singular surface quasi-geostrophic equations $$\n\\partial_{t}\\theta+u\\cdot\\nabla\\theta=-\\nu\n(-\\Delta)^{\\gamma/2}\\theta+(-\\Delta)^{\\alpha/2}\\xi,\\qquad\nu=\\nabla^{\\perp}(-\\Delta)^{-1/2}\\theta, $$ on $[0,\\infty)\\times\\mathbb{T}^{2}$,\nwhere $\\nu\\geq 0$, $\\gamma\\in [0,3/2)$, $\\alpha\\in [0,1/4)$ and $\\xi$ is a\nspace-time white noise. For the first time, we establish the existence of\ninfinitely many non-Gaussian $\\bullet$ probabilistically strong solutions for\nevery initial condition in $C^{\\eta}$, $\\eta>1/2$ $\\bullet$ ergodic stationary\nsolutions The result presents a single approach applicable in the subcritical,\ncritical as well as supercritical regime in the sense of Hairer (M. Hairer, A\ntheory of regularity structures). It also applies in the particular setting\n$\\alpha=\\gamma/2$ which formally possesses a Gaussian invariant measure. In our\nproof, we first introduce a modified Da Prato--Debussche trick which, on the\none hand, permits to convert irregularity in time into irregularity in space\nand, on the other hand, increases the regularity of the linear solution.\nSecond, we develop a convex integration iteration for the corresponding\nnonlinear equation which yields non-unique non-Gaussian solutions satisfying\npowerful global-in-time estimates and generating stationary as well as ergodic\nstationary solutions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:08:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hofmanov\u00e1","Martina",""],["Luo","Xiaoyutao",""],["Zhu","Rongchan",""],["Zhu","Xiangchan",""]]}
{"id":"2308.14359","submitter":"Payal Mohapatra","authors":"Payal Mohapatra, Akash Pandey, Yueyuan Sui, Qi Zhu","title":"Effect of Attention and Self-Supervised Speech Embeddings on\n  Non-Semantic Speech Tasks","comments":"Accepted to appear at ACM Multimedia 2023 Multimedia Grand Challenges\n  Track","journal-ref":null,"doi":"10.1145/3581783.3612855","report-no":null,"categories":"cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human emotion understanding is pivotal in making conversational technology\nmainstream. We view speech emotion understanding as a perception task which is\na more realistic setting. With varying contexts (languages, demographics, etc.)\ndifferent share of people perceive the same speech segment as a non-unanimous\nemotion. As part of the ACM Multimedia 2023 Computational Paralinguistics\nChallengE (ComParE) in the EMotion Share track, we leverage their rich dataset\nof multilingual speakers and multi-label regression target of 'emotion share'\nor perception of that emotion. We demonstrate that the training scheme of\ndifferent foundation models dictates their effectiveness for tasks beyond\nspeech recognition, especially for non-semantic speech tasks like emotion\nunderstanding. This is a very complex task due to multilingual speakers,\nvariability in the target labels, and inherent imbalance in the regression\ndataset. Our results show that HuBERT-Large with a self-attention-based\nlight-weight sequence model provides 4.6% improvement over the reported\nbaseline.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:11:27 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 16:08:28 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mohapatra","Payal",""],["Pandey","Akash",""],["Sui","Yueyuan",""],["Zhu","Qi",""]]}
{"id":"2308.14360","submitter":"Bing Han","authors":"Bing Han, Junyu Dai, Xuchen Song, Weituo Hao, Xinyan He, Dong Guo,\n  Jitong Chen, Yuxuan Wang and Yanmin Qian","title":"InstructME: An Instruction Guided Music Edit And Remix Framework with\n  Latent Diffusion Models","comments":"Demo samples are available at https://musicedit.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD cs.AI eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Music editing primarily entails the modification of instrument tracks or\nremixing in the whole, which offers a novel reinterpretation of the original\npiece through a series of operations. These music processing methods hold\nimmense potential across various applications but demand substantial expertise.\nPrior methodologies, although effective for image and audio modifications,\nfalter when directly applied to music. This is attributed to music's\ndistinctive data nature, where such methods can inadvertently compromise the\nintrinsic harmony and coherence of music. In this paper, we develop InstructME,\nan Instruction guided Music Editing and remixing framework based on latent\ndiffusion models. Our framework fortifies the U-Net with multi-scale\naggregation in order to maintain consistency before and after editing. In\naddition, we introduce chord progression matrix as condition information and\nincorporate it in the semantic space to improve melodic harmony while editing.\nFor accommodating extended musical pieces, InstructME employs a chunk\ntransformer, enabling it to discern long-term temporal dependencies within\nmusic sequences. We tested InstructME in instrument-editing, remixing, and\nmulti-round editing. Both subjective and objective evaluations indicate that\nour proposed method significantly surpasses preceding systems in music quality,\ntext relevance and harmony. Demo samples are available at\nhttps://musicedit.github.io/\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:11:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Han","Bing",""],["Dai","Junyu",""],["Song","Xuchen",""],["Hao","Weituo",""],["He","Xinyan",""],["Guo","Dong",""],["Chen","Jitong",""],["Wang","Yuxuan",""],["Qian","Yanmin",""]]}
{"id":"2308.14361","submitter":"Tsubasa Kodaira","authors":"Tsubasa Kodaira, Tomotaka Katsuno, Takehiko Nose, Motoyo Itoh, Jean\n  Rabault, Mario Hoppmann, Masafumi Kimizuka, and Takuji Waseda","title":"An affordable and customizable wave buoy for the study of wave-ice\n  interactions: design concept and results from field deployments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the polar regions, the interaction between waves and ice has a crucial\nimpact on the seasonal change in the sea ice extent. However, our comprehension\nof this phenomenon is restricted by a lack of observations, which, in turn,\nresults in the exclusion of associated processes from numerical models. In\nrecent years, availability of the low-cost and accurate Inertial Motion Units\nhas enabled the development of affordable wave research devices. Despite\nadvancements in designing innovative open-source instruments optimized for\ndeployment on ice floes, their customizability and survivability remain\nlimited, especially in open waters. This study presents a novel design concept\nfor an affordable and customizable wave buoy, aimed for wave measurements in\nmarginal ice zones. The central focus of this wave buoy design is the\napplication of 3D printing as rapid prototyping technology. By utilizing the\nhigh customizability offered by 3D printing, the previously developed\nsolar-powered wave buoy was customized to install a battery pack to continue\nthe measurements in the high latitudes for more than several months.\nPreliminary results from field deployments in the Pacific and Arctic Oceans\ndemonstrate that the performance of the instruments is promising. The accuracy\nof frequency wave spectra measurements is found to be comparable to that of\nconsiderably more expensive instruments. Finally, the study concludes with a\ngeneral evaluation of using rapid prototyping technologies for buoy designs and\nproposes recommendations for future designs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:17:35 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 07:30:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kodaira","Tsubasa",""],["Katsuno","Tomotaka",""],["Nose","Takehiko",""],["Itoh","Motoyo",""],["Rabault","Jean",""],["Hoppmann","Mario",""],["Kimizuka","Masafumi",""],["Waseda","Takuji",""]]}
{"id":"2308.14362","submitter":"Ke Xiao","authors":"Ke Xiao, Tengfei Yan, Chengxin Xiao, Feng-ren Fan, Ruihuan Duan, Zheng\n  Liu, Kenji Watanabe, Takashi Taniguchi, Wang Yao, Xiaodong Cui","title":"Exciton-exciton Interaction in Monolayer MoSe$_2$ from Mutual Screening\n  of Coulomb Binding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The potential for low-threshold optical nonlinearity has received significant\nattention in the fields of photonics and conceptual optical neuron networks.\nExcitons in two-dimensional (2D) semiconductors are particularly promising in\nthis regard as reduced screening and dimensional confinement foster their\npronounced many-body interactions towards nonlinearity. However, experimental\ndetermination of the interactions remains ambiguous, as optical pumping in\ngeneral creates a mixture of excitons and unbound carriers, where the impacts\nof band gap renormalization and carrier screening on exciton energy counteract\neach other. Here by comparing the influences on exciton ground and excited\nstates energies in the photoluminescence spectroscopy of monolayer MoSe$_2$, we\nare able to identify separately the screening of Coulomb binding by the neutral\nexcitons and by charge carriers. The energy difference between exciton ground\nstate (A-1s) and excited state (A-2s) red-shifts by 5.5 meV when the neutral\nexciton density increases from 0 to $4\\times 10^{11}$ cm$^{-2}$, in contrast to\nthe blue shifts with the increase of either electron or hole density. This\nenergy difference change is attributed to the mutual screening of Coulomb\nbinding of neutral excitons, from which we extract an exciton polarizability of\n$\\alpha_{2D}^{\\rm exciton} = 2.55\\times 10^{-17}$ eV(m/V)$^2$. Our finding\nuncovers a new mechanism that dominates the repulsive part of many-body\ninteraction between neutral excitons.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:19:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xiao","Ke",""],["Yan","Tengfei",""],["Xiao","Chengxin",""],["Fan","Feng-ren",""],["Duan","Ruihuan",""],["Liu","Zheng",""],["Watanabe","Kenji",""],["Taniguchi","Takashi",""],["Yao","Wang",""],["Cui","Xiaodong",""]]}
{"id":"2308.14363","submitter":"Jinliang Yuan","authors":"Jinliang Yuan, Chen Yang, Dongqi Cai, Shihe Wang, Xin Yuan, Zeling\n  Zhang, Xiang Li, Dingge Zhang, Hanzi Mei, Xianqing Jia, Shangguang Wang,\n  Mengwei Xu","title":"Rethinking Mobile AI Ecosystem in the LLM Era","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In today's landscape, smartphones have evolved into hubs for hosting a\nmultitude of deep learning models aimed at local execution. A key realization\ndriving this work is the notable fragmentation among these models,\ncharacterized by varied architectures, operators, and implementations. This\nfragmentation imposes a significant burden on the comprehensive optimization of\nhardware, system settings, and algorithms.\n  Buoyed by the recent strides in large foundation models, this work introduces\na pioneering paradigm for mobile AI: a collaborative management approach\nbetween the mobile OS and hardware, overseeing a foundational model capable of\nserving a broad spectrum of mobile AI tasks, if not all. This foundational\nmodel resides within the NPU and remains impervious to app or OS revisions,\nakin to firmware. Concurrently, each app contributes a concise, offline\nfine-tuned \"adapter\" tailored to distinct downstream tasks. From this concept\nemerges a concrete instantiation known as \\sys. It amalgamates a curated\nselection of publicly available Large Language Models (LLMs) and facilitates\ndynamic data flow. This concept's viability is substantiated through the\ncreation of an exhaustive benchmark encompassing 38 mobile AI tasks spanning 50\ndatasets, including domains such as Computer Vision (CV), Natural Language\nProcessing (NLP), audio, sensing, and multimodal inputs. Spanning this\nbenchmark, \\sys unveils its impressive performance. It attains accuracy parity\nin 85\\% of tasks, demonstrates improved scalability in terms of storage and\nmemory, and offers satisfactory inference speed on Commercial Off-The-Shelf\n(COTS) mobile devices fortified with NPU support. This stands in stark contrast\nto task-specific models tailored for individual applications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:21:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Jinliang",""],["Yang","Chen",""],["Cai","Dongqi",""],["Wang","Shihe",""],["Yuan","Xin",""],["Zhang","Zeling",""],["Li","Xiang",""],["Zhang","Dingge",""],["Mei","Hanzi",""],["Jia","Xianqing",""],["Wang","Shangguang",""],["Xu","Mengwei",""]]}
{"id":"2308.14364","submitter":"Milan Ganai","authors":"Milan Ganai, Haichen Li, Theodore Enns, Yida Wang, Randy Huang","title":"Target-independent XLA optimization using Reinforcement Learning","comments":"Workshop on ML for Systems @ NeurIPS 2022","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An important challenge in Machine Learning compilers like XLA is multi-pass\noptimization and analysis. There has been recent interest chiefly in XLA\ntarget-dependent optimization on the graph-level, subgraph-level, and\nkernel-level phases. We specifically focus on target-independent optimization\nXLA HLO pass ordering: our approach aims at finding the optimal sequence of\ncompiler optimization passes, which is decoupled from target-dependent\noptimization. However, there is little domain specific study in pass ordering\nfor XLA HLO. To this end, we propose introducing deep Reinforcement Learning\n(RL) based search for optimal XLA HLO pass ordering. We also propose\nenhancements to the deep RL algorithms to further improve optimal search\nperformance and open the research direction for domain-specific guidance for\nRL. We create an XLA Gym experimentation framework as a tool to enable RL\nalgorithms to interact with the compiler for passing optimizations and thereby\ntrain agents. Overall, in our experimentation we observe an average of $13.3\\%$\nimprovement in operation count reduction on a benchmark of GPT-2 training\ngraphs and $10.4\\%$ improvement on a diverse benchmark including GPT-2, BERT,\nand ResNet graphs using the proposed approach over the compiler's default phase\nordering.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:23:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ganai","Milan",""],["Li","Haichen",""],["Enns","Theodore",""],["Wang","Yida",""],["Huang","Randy",""]]}
{"id":"2308.14365","submitter":"Sophie Starck","authors":"Sophie Starck, Vasiliki Sideri-Lampretsa, Jessica J. M. Ritter,\n  Veronika A. Zimmer, Rickmer Braren, Tamara T. Mueller, and Daniel Rueckert","title":"Constructing Population-Specific Atlases from Whole Body MRI:\n  Application to the UKBB","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Population atlases are commonly utilised in medical imaging to facilitate the\ninvestigation of variability across populations. Such atlases enable the\nmapping of medical images into a common coordinate system, promoting\ncomparability and enabling the study of inter-subject differences. Constructing\nsuch atlases becomes particularly challenging when working with highly\nheterogeneous datasets, such as whole-body images, where subjects show\nsignificant anatomical variations. In this work, we propose a pipeline for\ngenerating a standardised whole-body atlas for a highly heterogeneous\npopulation by partitioning the population into meaningful subgroups. We create\nsix whole-body atlases that represent a healthy population average using\nmagnetic resonance (MR) images from the UK Biobank dataset. We furthermore\nunbias them, and this way obtain a realistic representation of the population.\nIn addition to the anatomical atlases, we generate probabilistic atlases that\ncapture the distributions of abdominal fat and five abdominal organs across the\npopulation. We demonstrate different applications of these atlases, using the\ndifferences between subjects with medical conditions such as diabetes and\ncardiovascular diseases and healthy subjects from the atlas space. With this\nwork, we make the constructed anatomical and label atlases publically available\nand anticipate them to support medical research conducted on whole-body MR\nimages.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:24:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Starck","Sophie",""],["Sideri-Lampretsa","Vasiliki",""],["Ritter","Jessica J. M.",""],["Zimmer","Veronika A.",""],["Braren","Rickmer",""],["Mueller","Tamara T.",""],["Rueckert","Daniel",""]]}
{"id":"2308.14366","submitter":"Bo Zheng","authors":"Wei Wang, Bo Zheng, Jia Jia Qin, Zhi Yong Wang","title":"Identification of deuteron at BESIII","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The identification of deuteron with momentum in range of $0.52$-$0.72$\nGeV/$c$ has been studied with the specific ionization energy loss information,\nusing the data sample collected by the BESIII detector at center-of-mass\nenergies between $4.009$ and $4.946$ GeV. Clean deuteron samples are selected\nusing time of flight information. For all data samples, the deuteron\nidentification efficiencies are higher than $95\\%$, with a maximum difference\nof $(4.93\\pm0.95)\\%$ between data and MC simulation. These verify the\neffectiveness of the deuteron identification method based on the specific\nionization energy loss, and provide valuable information for the future studies\nof the processes involving deuteron in the final state at BESIII.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:28:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Wei",""],["Zheng","Bo",""],["Qin","Jia Jia",""],["Wang","Zhi Yong",""]]}
{"id":"2308.14367","submitter":"Kunlan Xiang","authors":"Haomiao Yang, Kunlan Xiang, Hongwei Li and Rongxing Lu","title":"A Comprehensive Overview of Backdoor Attacks in Large Language Models\n  within Communication Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Large Language Models (LLMs) are becoming an integral part of modern\ncommunication networks due to their superior proficiency in language\ncomprehension and generation. In the context of these networks, where limited\ndata and computing resources often necessitate the use of third-party data and\ncomputing resources, the risk of backdoor attacks becomes highly significant.\nSuch strategies may expose the model within the network to maliciously\nmanipulated training data and processing, providing an opportunity for\nattackers to embed a hidden backdoor into the model, termed a backdoor attack.\nBackdoor attack in LLMs refers to embedding a hidden backdoor in LLMs that\ncauses the model to perform normally on benign samples but exhibit degraded\nperformance on poisoned ones. This issue is particularly concerning within\ncommunication networks where reliability and security are paramount. Despite\nthe extensive research on backdoor attacks, there remains a lack of in-depth\nexploration specifically within the context of LLMs employed in communication\nnetworks, and a systematic review of such attacks is currently absent. In this\nsurvey, we systematically propose a taxonomy of backdoor attacks in LLMs as\nused in communication networks, dividing them into four major categories:\ninput-triggered, prompt-triggered, instruction-triggered, and\ndemonstration-triggered attacks. Furthermore, we conduct a comprehensive\nanalysis of the benchmark datasets within the network domain. Finally, we\nidentify potential problems and open challenges, offering valuable insights\ninto future research directions for enhancing the security and integrity of\nLLMs in communication networks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:31:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Haomiao",""],["Xiang","Kunlan",""],["Li","Hongwei",""],["Lu","Rongxing",""]]}
{"id":"2308.14368","submitter":"Xueyi Huang","authors":"Xiongfeng Zhan, Lu Lu, Xueyi Huang","title":"Distance-regular Cayley graphs over\n  $\\mathbb{Z}_{p^s}\\oplus\\mathbb{Z}_{p}$","comments":"19 pages. arXiv admin note: substantial text overlap with\n  arXiv:2202.02939","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser\nB 97 (2007) 14--33], Miklavi\\v{c} and Poto\\v{c}nik proposed the problem of\ncharacterizing distance-regular Cayley graphs, which can be viewed as an\nextension of the problem of identifying strongly regular Cayley graphs, or\nequivalently, regular partial difference sets. In this paper, all\ndistance-regular Cayley graphs over $\\mathbb{Z}_{p^s}\\oplus\\mathbb{Z}_{p}$ with\n$p$ being an odd prime are determined. It is shown that every such graph is\nisomorphic to a complete graph, a complete multipartite graph, or the line\ngraph of a transversal design $TD(r,p)$ with $2\\leq r\\leq p-1$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:35:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhan","Xiongfeng",""],["Lu","Lu",""],["Huang","Xueyi",""]]}
{"id":"2308.14369","submitter":"Nikita Moriakov","authors":"Nikita Moriakov, Jim Peters, Ritse Mann, Nico Karssemeijer, Jos van\n  Dijck, Mireille Broeders, Jonas Teuwen","title":"Improving Lesion Volume Measurements on Digital Mammograms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Lesion volume is an important predictor for prognosis in breast cancer. We\nmake a step towards a more accurate lesion volume measurement on digital\nmammograms by developing a model that allows to estimate lesion volumes on\nprocessed mammograms, which are the images routinely used by radiologists in\nclinical practice as well as in breast cancer screening and are available in\nmedical centers. Processed mammograms are obtained from raw mammograms, which\nare the X-ray data coming directly from the scanner, by applying certain\nvendor-specific non-linear transformations. At the core of our volume\nestimation method is a physics-based algorithm for measuring lesion volumes on\nraw mammograms. We subsequently extend this algorithm to processed mammograms\nvia a deep learning image-to-image translation model that produces synthetic\nraw mammograms from processed mammograms in a multi-vendor setting. We assess\nthe reliability and validity of our method using a dataset of 1778 mammograms\nwith an annotated mass. Firstly, we investigate the correlations between lesion\nvolumes computed from mediolateral oblique and craniocaudal views, with a\nresulting Pearson correlation of 0.93 [95% confidence interval (CI) 0.92 -\n0.93]. Secondly, we compare the resulting lesion volumes from true and\nsynthetic raw data, with a resulting Pearson correlation of 0.998 [95% CI 0.998\n- 0.998] . Finally, for a subset of 100 mammograms with a malign mass and\nconcurrent MRI examination available, we analyze the agreement between lesion\nvolume on mammography and MRI, resulting in an intraclass correlation\ncoefficient of 0.81 [95% CI 0.73 - 0.87] for consistency and 0.78 [95% CI 0.66\n- 0.86] for absolute agreement. In conclusion, we developed an algorithm to\nmeasure mammographic lesion volume that reached excellent reliability and good\nvalidity, when using MRI as ground truth.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:35:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Moriakov","Nikita",""],["Peters","Jim",""],["Mann","Ritse",""],["Karssemeijer","Nico",""],["van Dijck","Jos",""],["Broeders","Mireille",""],["Teuwen","Jonas",""]]}
{"id":"2308.14370","submitter":"Baptiste CHATELIER","authors":"Baptiste Chatelier (IETR, MERCE-France, INSA Rennes), Luc Le Magoarou\n  (IETR, INSA Rennes), Vincent Corlay (MERCE-France), Matthieu Crussi\\`ere\n  (IETR, INSA Rennes)","title":"Model-based learning for location-to-channel mapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Modern communication systems rely on accurate channel estimation to achieve\nefficient and reliable transmission of information. As the communication\nchannel response is highly related to the user's location, one can use a neural\nnetwork to map the user's spatial coordinates to the channel coefficients.\nHowever, these latter are rapidly varying as a function of the location, on the\norder of the wavelength. Classical neural architectures being biased towards\nlearning low frequency functions (spectral bias), such mapping is therefore\nnotably difficult to learn. In order to overcome this limitation, this paper\npresents a frugal, model-based network that separates the low frequency from\nthe high frequency components of the target mapping function. This yields an\nhypernetwork architecture where the neural network only learns low frequency\nsparse coefficients in a dictionary of high frequency components. Simulation\nresults show that the proposed neural network outperforms standard approaches\non realistic synthetic data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:39:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chatelier","Baptiste","","IETR, MERCE-France, INSA Rennes"],["Magoarou","Luc Le","","IETR, INSA Rennes"],["Corlay","Vincent","","MERCE-France"],["Crussi\u00e8re","Matthieu","","IETR, INSA Rennes"]]}
{"id":"2308.14371","submitter":"Hui Tian","authors":"Hui Tian, Chenyang Zhu, Yifei Shi, Kai Xu","title":"SuperUDF: Self-supervised UDF Estimation for Surface Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning-based surface reconstruction based on unsigned distance functions\n(UDF) has many advantages such as handling open surfaces. We propose SuperUDF,\na self-supervised UDF learning which exploits a learned geometry prior for\nefficient training and a novel regularization for robustness to sparse\nsampling. The core idea of SuperUDF draws inspiration from the classical\nsurface approximation operator of locally optimal projection (LOP). The key\ninsight is that if the UDF is estimated correctly, the 3D points should be\nlocally projected onto the underlying surface following the gradient of the\nUDF. Based on that, a number of inductive biases on UDF geometry and a\npre-learned geometry prior are devised to learn UDF estimation efficiently. A\nnovel regularization loss is proposed to make SuperUDF robust to sparse\nsampling. Furthermore, we also contribute a learning-based mesh extraction from\nthe estimated UDFs. Extensive evaluations demonstrate that SuperUDF outperforms\nthe state of the arts on several public datasets in terms of both quality and\nefficiency. Code will be released after accteptance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:40:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tian","Hui",""],["Zhu","Chenyang",""],["Shi","Yifei",""],["Xu","Kai",""]]}
{"id":"2308.14372","submitter":"Aryaman Jal","authors":"Aryaman Jal and Katharina Jochemko","title":"Polyhedral combinatorics of bisectors","comments":"33 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any polyhedral norm, the bisector of two points is a polyhedral complex.\nWe study combinatorial aspects of this complex. We investigate the sensitivity\nof the presence of labelled maximal cells in the bisector relative to the\nposition of the two points. We thereby extend work of Criado, Joswig and Santos\n(2022) who showed that for the tropical distance function the presence of\nmaximal cells is encoded by a polyhedral fan, the bisection fan. We initiate\nthe study of bisection cones and bisection fans with respect to arbitrary\npolyhedral norms. In particular, we show that the bisection fan always exists\nfor polyhedral norms in two dimensions. Furthermore, we determine the bisection\nfan of the $\\ell_{1}$-norm and the $\\ell_{\\infty}$-norm as well as the discrete\nWasserstein distance in arbitrary dimensions. Intricate combinatorial\nstructures, such as the resonance arrangement, make their appearance. We apply\nour results to obtain bounds on the combinatorial complexity of the bisectors.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:41:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jal","Aryaman",""],["Jochemko","Katharina",""]]}
{"id":"2308.14373","submitter":"Benoit PUJOL","authors":"Antoine Puisay (CRIOBE), Laetitia H\\'edouin (CRIOBE), Rosanne Pilon\n  (CRIOBE), Claire Goiran, Benoit Pujol (CRIOBE)","title":"How thermal priming of coral gametes shapes fertilization success","comments":null,"journal-ref":"Journal of Experimental Marine Biology and Ecology, 2023, 566,\n  pp.151920","doi":"10.1016/j.jembe.2023.151920","report-no":null,"categories":"q-bio.PE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Seawater temperature rise is damaging coral reef ecosystems. There is growing\nevidence for the negative impact of rising temperatures on the survival of\nadult corals and their reproductive success. However, the effect of elevated\ntemperatures on gametes remains scarcely studied. Here we tested the effect of\nthe thermal priming of gametes on the fertilization success in experimentally\ntested populations of Acropora cytherea corals in French Polynesia. As\nexpected, a temperature of 30 {\\textdegree}C (ambient +3 {\\textdegree}C)\nreduces coral fertilization success. However, the thermal exposure of gametes\nto 30 {\\textdegree}C after their release in seawater prior to fertilization\nlimited fertilization failure, with a greater impact of oocytes in comparison\nto sperm. This temperature is similar to temperatures observed in nature under\nthe changing climate. Our findings imply that the thermal priming of early life\nstages, such as gametes may play a role in maintaining the coral fertilization\nsuccess in spite of increasing seawater temperature.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:41:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Puisay","Antoine","","CRIOBE"],["H\u00e9douin","Laetitia","","CRIOBE"],["Pilon","Rosanne","","CRIOBE"],["Goiran","Claire","","CRIOBE"],["Pujol","Benoit","","CRIOBE"]]}
{"id":"2308.14374","submitter":"Byung Hyun Lee","authors":"Byung Hyun Lee, Okchul Jung, Jonghyun Choi, Se Young Chun","title":"Online Continual Learning on Hierarchical Label Expansion","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Continual learning (CL) enables models to adapt to new tasks and environments\nwithout forgetting previously learned knowledge. While current CL setups have\nignored the relationship between labels in the past task and the new task with\nor without small task overlaps, real-world scenarios often involve hierarchical\nrelationships between old and new tasks, posing another challenge for\ntraditional CL approaches. To address this challenge, we propose a novel\nmulti-level hierarchical class incremental task configuration with an online\nlearning constraint, called hierarchical label expansion (HLE). Our\nconfiguration allows a network to first learn coarse-grained classes, with data\nlabels continually expanding to more fine-grained classes in various hierarchy\ndepths. To tackle this new setup, we propose a rehearsal-based method that\nutilizes hierarchy-aware pseudo-labeling to incorporate hierarchical class\ninformation. Additionally, we propose a simple yet effective memory management\nand sampling strategy that selectively adopts samples of newly encountered\nclasses. Our experiments demonstrate that our proposed method can effectively\nuse hierarchy on our HLE setup to improve classification accuracy across all\nlevels of hierarchies, regardless of depth and class imbalance ratio,\noutperforming prior state-of-the-art works by significant margins while also\noutperforming them on the conventional disjoint, blurry and i-Blurry CL setups.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:42:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Byung Hyun",""],["Jung","Okchul",""],["Choi","Jonghyun",""],["Chun","Se Young",""]]}
{"id":"2308.14375","submitter":"Takuya Ishihara","authors":"Takuya Ishihara","title":"Bandwidth Selection for Treatment Choice with Binary Outcomes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study considers the treatment choice problem when outcome variables are\nbinary. We focus on statistical treatment rules that plug in fitted values\nbased on nonparametric kernel regression and show that optimizing two\nparameters enables the calculation of the maximum regret. Using this result, we\npropose a novel bandwidth selection method based on the minimax regret\ncriterion. Finally, we perform a numerical analysis to compare the optimal\nbandwidth choices for the binary and normally distributed outcomes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:46:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ishihara","Takuya",""]]}
{"id":"2308.14376","submitter":"Andrea Corsini","authors":"Andrea Corsini and Shanchieh Jay Yang","title":"Are Existing Out-Of-Distribution Techniques Suitable for Network\n  Intrusion Detection?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Machine learning (ML) has become increasingly popular in network intrusion\ndetection. However, ML-based solutions always respond regardless of whether the\ninput data reflects known patterns, a common issue across safety-critical\napplications. While several proposals exist for detecting Out-Of-Distribution\n(OOD) in other fields, it remains unclear whether these approaches can\neffectively identify new forms of intrusions for network security. New attacks,\nnot necessarily affecting overall distributions, are not guaranteed to be\nclearly OOD as instead, images depicting new classes are in computer vision. In\nthis work, we investigate whether existing OOD detectors from other fields\nallow the identification of unknown malicious traffic. We also explore whether\nmore discriminative and semantically richer embedding spaces within models,\nsuch as those created with contrastive learning and multi-class tasks, benefit\ndetection. Our investigation covers a set of six OOD techniques that employ\ndifferent detection strategies. These techniques are applied to models trained\nin various ways and subsequently exposed to unknown malicious traffic from the\nsame and different datasets (network environments). Our findings suggest that\nexisting detectors can identify a consistent portion of new malicious traffic,\nand that improved embedding spaces enhance detection. We also demonstrate that\nsimple combinations of certain detectors can identify almost 100% of malicious\ntraffic in our tested scenarios.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:49:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Corsini","Andrea",""],["Yang","Shanchieh Jay",""]]}
{"id":"2308.14377","submitter":"Adnan Zeb","authors":"Adnan Zeb, Yongchao Ye, Shiyao Zhang and James J. Q. Yu","title":"Meta Attentive Graph Convolutional Recurrent Network for Traffic\n  Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Traffic forecasting is a fundamental problem in intelligent transportation\nsystems. Existing traffic predictors are limited by their expressive power to\nmodel the complex spatial-temporal dependencies in traffic data, mainly due to\nthe following limitations. Firstly, most approaches are primarily designed to\nmodel the local shared patterns, which makes them insufficient to capture the\nspecific patterns associated with each node globally. Hence, they fail to learn\neach node's unique properties and diversified patterns. Secondly, most existing\napproaches struggle to accurately model both short- and long-term dependencies\nsimultaneously. In this paper, we propose a novel traffic predictor, named Meta\nAttentive Graph Convolutional Recurrent Network (MAGCRN). MAGCRN utilizes a\nGraph Convolutional Recurrent Network (GCRN) as a core module to model local\ndependencies and improves its operation with two novel modules: 1) a\nNode-Specific Meta Pattern Learning (NMPL) module to capture node-specific\npatterns globally and 2) a Node Attention Weight Generation Module (NAWG)\nmodule to capture short- and long-term dependencies by connecting the\nnode-specific features with the ones learned initially at each time step during\nGCRN operation. Experiments on six real-world traffic datasets demonstrate that\nNMPL and NAWG together enable MAGCRN to outperform state-of-the-art baselines\non both short- and long-term predictions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:49:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zeb","Adnan",""],["Ye","Yongchao",""],["Zhang","Shiyao",""],["Yu","James J. Q.",""]]}
{"id":"2308.14378","submitter":"Ruijie Yao","authors":"Ruijie Yao, Sheng Jin, Lumin Xu, Wang Zeng, Wentao Liu, Chen Qian,\n  Ping Luo, Ji Wu","title":"GKGNet: Group K-Nearest Neighbor based Graph Convolutional Network for\n  Multi-Label Image Recognition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Multi-Label Image Recognition (MLIR) is a challenging task that aims to\npredict multiple object labels in a single image while modeling the complex\nrelationships between labels and image regions. Although convolutional neural\nnetworks and vision transformers have succeeded in processing images as regular\ngrids of pixels or patches, these representations are sub-optimal for capturing\nirregular and discontinuous regions of interest. In this work, we present the\nfirst fully graph convolutional model, Group K-nearest neighbor based Graph\nconvolutional Network (GKGNet), which models the connections between semantic\nlabel embeddings and image patches in a flexible and unified graph structure.\nTo address the scale variance of different objects and to capture information\nfrom multiple perspectives, we propose the Group KGCN module for dynamic graph\nconstruction and message passing. Our experiments demonstrate that GKGNet\nachieves state-of-the-art performance with significantly lower computational\ncosts on the challenging multi-label datasets, \\ie MS-COCO and VOC2007\ndatasets. We will release the code and models to facilitate future research in\nthis area.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:50:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yao","Ruijie",""],["Jin","Sheng",""],["Xu","Lumin",""],["Zeng","Wang",""],["Liu","Wentao",""],["Qian","Chen",""],["Luo","Ping",""],["Wu","Ji",""]]}
{"id":"2308.14379","submitter":"Sudhakar Pandey","authors":"Sudhakar Pandey","title":"A Ward identity preserving approach for investigation of phonon spectrum\n  with self-energy and vertex corrections","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We propose an approach for investigating the many body effects on phonon\nspectrum in an electron-phonon coupled system by taking into account the\nelectron self-energy and vertex corrections which respect the Ward identity\nrepresenting the conservation of electronic charge. Our approach provides a\nsystematic diagrammatic expansion of the phonon self-energy\n$\\Pi(\\mathbf{q},\\omega)$ in powers of the electron-phonon scattering strength\n$(g^2)$.\n  In this approach the many body corrections to phonon spectrum vanish\nidentically in the regime of long-wavelength excitations ($\\mathbf{q}\n\\rightarrow 0$) due to an exact cancellation between the contributions arising\nfrom electron self-energy and vertex corrections. Our results demonstrate that\nthe contributions of electron self-energy and vertex corrections are not only\ncomparable but they also tend to cancel each oher so that the phonon spectrum\nremains nearly unaffected due to many body effects in the regime of\nlong-wavelength excitations ($\\mathbf{q} \\rightarrow 0$)\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:53:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pandey","Sudhakar",""]]}
{"id":"2308.14380","submitter":"Jaemin Yoo","authors":"Leman Akoglu and Jaemin Yoo","title":"Self-Supervision for Tackling Unsupervised Anomaly Detection: Pitfalls\n  and Opportunities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Self-supervised learning (SSL) is a growing torrent that has recently\ntransformed machine learning and its many real world applications, by learning\non massive amounts of unlabeled data via self-generated supervisory signals.\nUnsupervised anomaly detection (AD) has also capitalized on SSL, by\nself-generating pseudo-anomalies through various data augmentation functions or\nexternal data exposure. In this vision paper, we first underline the importance\nof the choice of SSL strategies on AD performance, by presenting evidences and\nstudies from the AD literature. Equipped with the understanding that SSL incurs\nvarious hyperparameters (HPs) to carefully tune, we present recent developments\non unsupervised model selection and augmentation tuning for SSL-based AD. We\nthen highlight emerging challenges and future opportunities; on designing new\npretext tasks and augmentation functions for different data modalities,\ncreating novel model selection solutions for systematically tuning the SSL HPs,\nas well as on capitalizing on the potential of pretrained foundation models on\nAD through effective density estimation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:55:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Akoglu","Leman",""],["Yoo","Jaemin",""]]}
{"id":"2308.14381","submitter":"Jerome Dimabayao","authors":"Jerome T. Dimabayao and Soma Purkait","title":"A variant of the congruent number problem","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A positive integer $n$ is called a $\\theta$-congruent number if there is a\ntriangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is\nequal to $\\theta$ and its area is $n\\sqrt{r^2 - s^2}$, where $0 < \\theta <\n\\pi$, $\\cos \\theta = s/r$ and $0 \\leq |s| < r$ are relatively prime integers.\nThe case $\\theta=\\pi/2$ refers to the classical congruent numbers. It is known\nthat the problem of classifying $\\theta$-congruent numbers is related to the\nexistence of rational points on the elliptic curve $y^2 =\nx(x+(r+s)n)(x-(r-s)n)$. In this paper, we deal with a variant of the congruent\nnumber problem where the cosine of a fixed angle is $\\pm \\sqrt{2}/2$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:55:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dimabayao","Jerome T.",""],["Purkait","Soma",""]]}
{"id":"2308.14382","submitter":"Koji Tasaka","authors":"Koji Tasaka","title":"Catalogue of modular relations for double zeta values","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this talk, based on my works, I overviewed the studies of modular\nrelations of multiple zeta values. Roughly speaking, modular relations are\n(homogeneous) linear relations of multiple zeta values of fixed weight whose\ncoefficients are `originated' from modular forms on (a subgroup of) the full\nmodular group. Several kinds of such relations, in particular, for double zeta\nvalues have been found up to now. It is our purpose to review these results and\nalso succinctly outline potential avenues for future research projects.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:55:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tasaka","Koji",""]]}
{"id":"2308.14383","submitter":"Yijin Li","authors":"Xinyang Liu, Yijin Li, Yanbin Teng, Hujun Bao, Guofeng Zhang, Yinda\n  Zhang, Zhaopeng Cui","title":"Multi-Modal Neural Radiance Field for Monocular Dense SLAM with a\n  Light-Weight ToF Sensor","comments":"Accepted to ICCV 2023 (Oral). Project Page:\n  https://zju3dv.github.io/tof_slam/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Light-weight time-of-flight (ToF) depth sensors are compact and\ncost-efficient, and thus widely used on mobile devices for tasks such as\nautofocus and obstacle detection. However, due to the sparse and noisy depth\nmeasurements, these sensors have rarely been considered for dense geometry\nreconstruction. In this work, we present the first dense SLAM system with a\nmonocular camera and a light-weight ToF sensor. Specifically, we propose a\nmulti-modal implicit scene representation that supports rendering both the\nsignals from the RGB camera and light-weight ToF sensor which drives the\noptimization by comparing with the raw sensor inputs. Moreover, in order to\nguarantee successful pose tracking and reconstruction, we exploit a predicted\ndepth as an intermediate supervision and develop a coarse-to-fine optimization\nstrategy for efficient learning of the implicit representation. At last, the\ntemporal information is explicitly exploited to deal with the noisy signals\nfrom light-weight ToF sensors to improve the accuracy and robustness of the\nsystem. Experiments demonstrate that our system well exploits the signals of\nlight-weight ToF sensors and achieves competitive results both on camera\ntracking and dense scene reconstruction. Project page:\n\\url{https://zju3dv.github.io/tof_slam/}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:56:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Xinyang",""],["Li","Yijin",""],["Teng","Yanbin",""],["Bao","Hujun",""],["Zhang","Guofeng",""],["Zhang","Yinda",""],["Cui","Zhaopeng",""]]}
{"id":"2308.14384","submitter":"Mattia  Zorzi","authors":"Mattia Zorzi","title":"On the identification of ARMA graphical models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The paper considers the problem to estimate a graphical model corresponding\nto an autoregressive moving-average (ARMA) Gaussian stochastic process. We\npropose a new maximum entropy covariance and cepstral extension problem and we\nshow that the problem admits an approximate solution which represents an ARMA\ngraphical model whose topology is determined by the selected entries of the\ncovariance lags considered in the extension problem. Then, we show how the\ncorresponding dual problem is connected with the maximum likelihood principle.\nSuch connection allows to design a Bayesian model and characterize an\napproximate maximum a posteriori estimator of the ARMA graphical model in the\ncase the graph topology is unknown. We test the performance of the proposed\nmethod through some numerical experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 07:59:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zorzi","Mattia",""]]}
{"id":"2308.14385","submitter":"Kejin Wei","authors":"Chunfeng Huang, Ye Chen, Tingting Luo, Wenjie He, Xin Liu, Zhenrong\n  Zhang, and Kejin Wei","title":"A cost-efficient quantum access network with qubit-based synchronization","comments":"Comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum Key Distribution (QKD) is a physical layer encryption technique that\nenables two distant parties to exchange secure keys with information-theoretic\nsecurity. In the last two decades, QKD has transitioned from laboratory\nresearch to real-world applications, including multi-user quantum access\nnetworks (QANs). This network structure allows users to share single-photon\ndetectors at a network node through time-division multiplexing, thereby\nsignificantly reducing the network cost. However, current QAN implementations\nrequire additional hardware for auxiliary tasks such as time synchronization.\nTo address this issue, we propose a cost-efficient QAN that uses qubit-based\nsynchronization. In this approach, the transmitted qubits facilitate time\nsynchronization, eliminating the need for synchronization hardware. We tested\nour scheme by implementing a network for two users and successfully achieved\naverage secure key rates of $53.84$ kbps and $71.90$ kbps for each user over a\n50-km commercial fiber spool. In addition, we investigated the capacity of the\naccess network under cross-talk and loss conditions. The simulation results\ndemonstrate that this scheme can support a QAN with 64 users with key rates up\nto 1070~bps. Our work provides a feasible and cost-effective way to implement a\nmulti-user QKD network, further promoting the widespread application of QKD.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:03:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Chunfeng",""],["Chen","Ye",""],["Luo","Tingting",""],["He","Wenjie",""],["Liu","Xin",""],["Zhang","Zhenrong",""],["Wei","Kejin",""]]}
{"id":"2308.14386","submitter":"Ze Zhou","authors":"Ze Zhou","title":"Generalizing Andreev's Theorem via circle patterns","comments":"25 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we derive an extended Circle Pattern Theorem that allows obtuse\noverlap angles. As a consequence, we characterize a broader subclass of compact\nconvex hyperbolic polyhedra which possess possibly obtuse dihedral angles and\nthus generalize Andreev's Theorem. For proofs of these results, we establish a\ndiscrete analog of the \"weak solution/regularity theory\" scheme.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:03:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Ze",""]]}
{"id":"2308.14387","submitter":"Pavan Uttarkar","authors":"Pavan A. Uttarkar, R. M. Shannon, K. Gourdji, A. T. Deller, C. K. Day,\n  S. Bhandari","title":"Searching for the spectral depolarisation of ASKAP one-off FRB sources","comments":"10 pages, 5 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fast Radio Bursts (FRBs) are extragalactic transients of (sub-)millisecond\nduration that show wide-ranging spectral, temporal, and polarimetric\nproperties. The polarimetric analysis of FRBs can be used to probe intervening\nmedia, study the emission mechanism, and test possible progenitor models. In\nparticular, low frequency depolarisation of FRBs can identify dense, turbulent,\nmagnetised, ionised plasma thought to be near the FRB progenitor. An ensemble\nof repeating FRBs has shown low-frequency depolarisation. The depolarisation is\nquantified by the parameter $\\sigma_{\\rm RM}$, which correlates with proxies\nfor both the turbulence and mean magnetic field strength of the putative\nplasma. However, while many non-repeating FRBs show comparable scattering (and\nhence inferred turbulence) to repeating FRBs, it is unclear whether their\nsurrounding environments are comparable to those of repeating FRBs. To test\nthis, we analyse the spectro-polarimetric properties of five one-off FRBs and\none repeating FRB, detected and localised by the Australian Square Kilometer\nArray Pathfinder. We search for evidence of depolarisation due to $\\sigma_{\\rm\nRM}$ and consider models where the depolarisation is intrinsic to the source.\nWe find no evidence (for or against) the sample showing spectral\ndepolarisation. Under the assumption that FRBs have multipath\npropagation-induced depolarisation, the correlation between our constraint on\n$\\sigma_{\\rm RM}$ and RM is consistent with repeating FRBs only if the values\nof $\\sigma_{\\rm RM}$ are much smaller than our upper limits. The observations\nprovide further evidence for differences in the environments and sources of\none-off and repeating FRBs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:05:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Uttarkar","Pavan A.",""],["Shannon","R. M.",""],["Gourdji","K.",""],["Deller","A. T.",""],["Day","C. K.",""],["Bhandari","S.",""]]}
{"id":"2308.14388","submitter":"Jiqiang Wang","authors":"Jiqiang Wang","title":"Biclustering Methods via Sparse Penalty","comments":"This research it still in progress and need to fix some issues","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG q-bio.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we first reviewed several biclustering methods that are used\nto identify the most significant clusters in gene expression data. Here we\nmainly focused on the SSVD(sparse SVD) method and tried a new sparse penalty\nnamed \"Prenet penalty\" which has been used only in factor analysis to gain\nsparsity. Then in the simulation study, we tried different types of generated\ndatasets (with different sparsity and dimension) and tried 1-layer\napproximation then for k-layers which shows the mixed Prenet penalty is very\neffective for non-overlapped data. Finally, we used some real gene expression\ndata to show the behavior of our methods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:07:57 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 15:13:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Wang","Jiqiang",""]]}
{"id":"2308.14389","submitter":"Priyanshu Lohar","authors":"Priyanshu Lohar, Kiran Rathi","title":"Evaluation of Non-Fungible Token (NFT)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The derivative of token standard of Ethereum blockchain, termed as Non\nFungible Token is distinguishable token. These tokens are bound with digital\nproperties that provide them unique identification which helps in fulfilling\nthe aim of distinguishable tokens. These tokens are used as an evidence of\nownership for the digital asset, with which they are bound to. And it is with\nthese non fungible tokens that the problem of proving ownership of digital\nasset is being solved and with this technique, it is with hope that developers\nare looking forward to solve many more problems of the real world with it, may\nit be providing tradability solutions for arts, real estate and many other\nsectors. During the time of writing this, the NFT has shown unpredictable\ngrowth in the recent years and this has caused the stimulation of prosperity of\nDApps(Decentralized Application).With an unpredictable growth and garnering\nattention worldwide with many mainstream key people investing in it , the NFT\nis still in developing stage and is still premature. This paper is an attempt\nto squeeze the NFT developments systematically, so the aspiring developers can\nhave the resource to start with and aid the development process further\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:12:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lohar","Priyanshu",""],["Rathi","Kiran",""]]}
{"id":"2308.14390","submitter":"Konstantinos Lampropoulos","authors":"Konstantinos Lampropoulos, Thanos Kosmidis, Serge Autexier, Milos\n  Savic, Manos Athanatos, Miltiadis Kokkonidis, Tzortzia Koutsouri, Anamaria\n  Vizitiu, Antonios Valachis, Miriam Quintero Padron","title":"ASCAPE: An open AI ecosystem to support the quality of life of cancer\n  patients","comments":null,"journal-ref":null,"doi":"10.1109/ICHI52183.2021.00054","report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The latest cancer statistics indicate a decrease in cancer-related mortality.\nHowever, due to the growing and ageing population, the absolute number of\npeople living with cancer is set to keep increasing. This paper presents\nASCAPE, an open AI infrastructure that takes advantage of the recent advances\nin Artificial Intelligence (AI) and Machine Learning (ML) to support cancer\npatients quality of life (QoL). With ASCAPE health stakeholders (e.g.\nhospitals) can locally process their private medical data and then share the\nproduced knowledge (ML models) through the open AI infrastructure.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:14:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lampropoulos","Konstantinos",""],["Kosmidis","Thanos",""],["Autexier","Serge",""],["Savic","Milos",""],["Athanatos","Manos",""],["Kokkonidis","Miltiadis",""],["Koutsouri","Tzortzia",""],["Vizitiu","Anamaria",""],["Valachis","Antonios",""],["Padron","Miriam Quintero",""]]}
{"id":"2308.14391","submitter":"Prateek Chhikara","authors":"Prateek Chhikara, Dhiraj Chaurasia, Yifan Jiang, Omkar Masur, Filip\n  Ilievski","title":"FIRE: Food Image to REcipe generation","comments":"5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Food computing has emerged as a prominent multidisciplinary field of research\nin recent years. An ambitious goal of food computing is to develop end-to-end\nintelligent systems capable of autonomously producing recipe information for a\nfood image. Current image-to-recipe methods are retrieval-based and their\nsuccess depends heavily on the dataset size and diversity, as well as the\nquality of learned embeddings. Meanwhile, the emergence of powerful\nattention-based vision and language models presents a promising avenue for\naccurate and generalizable recipe generation, which has yet to be extensively\nexplored. This paper proposes FIRE, a novel multimodal methodology tailored to\nrecipe generation in the food computing domain, which generates the food title,\ningredients, and cooking instructions based on input food images. FIRE\nleverages the BLIP model to generate titles, utilizes a Vision Transformer with\na decoder for ingredient extraction, and employs the T5 model to generate\nrecipes incorporating titles and ingredients as inputs. We showcase two\npractical applications that can benefit from integrating FIRE with large\nlanguage model prompting: recipe customization to fit recipes to user\npreferences and recipe-to-code transformation to enable automated cooking\nprocesses. Our experimental findings validate the efficacy of our proposed\napproach, underscoring its potential for future advancements and widespread\nadoption in food computing.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:14:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chhikara","Prateek",""],["Chaurasia","Dhiraj",""],["Jiang","Yifan",""],["Masur","Omkar",""],["Ilievski","Filip",""]]}
{"id":"2308.14392","submitter":"Tao Zhang","authors":"Tao Zhang, Xingye Tian, Yikang Zhou, Yu Wu, Shunping Ji, Cilin Yan,\n  Xuebo Wang, Xin Tao, Yuan Zhang, Pengfei Wan","title":"1st Place Solution for the 5th LSVOS Challenge: Video Instance\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video instance segmentation is a challenging task that serves as the\ncornerstone of numerous downstream applications, including video editing and\nautonomous driving. In this report, we present further improvements to the SOTA\nVIS method, DVIS. First, we introduce a denoising training strategy for the\ntrainable tracker, allowing it to achieve more stable and accurate object\ntracking in complex and long videos. Additionally, we explore the role of\nvisual foundation models in video instance segmentation. By utilizing a frozen\nVIT-L model pre-trained by DINO v2, DVIS demonstrates remarkable performance\nimprovements. With these enhancements, our method achieves 57.9 AP and 56.0 AP\nin the development and test phases, respectively, and ultimately ranked 1st in\nthe VIS track of the 5th LSVOS Challenge. The code will be available at\nhttps://github.com/zhang-tao-whu/DVIS.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:15:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Tao",""],["Tian","Xingye",""],["Zhou","Yikang",""],["Wu","Yu",""],["Ji","Shunping",""],["Yan","Cilin",""],["Wang","Xuebo",""],["Tao","Xin",""],["Zhang","Yuan",""],["Wan","Pengfei",""]]}
{"id":"2308.14393","submitter":"Luping Gao","authors":"Lihui Liao, Baoren Li, Dijia Zhang, Luping Gao, Mboul\\'e Ngwa, Jingmin\n  Du","title":"Research on the Influence of Underwater Environment on the Dynamic\n  Performance of the Mechanical Leg of a Deep-sea Crawling and Swimming Robot","comments":"conference for 2023 IEEE 9th International Conference on Fluid Power\n  and Mechatronics (FPM2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.RO cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The performance of underwater crawling and adjustment of the body posture for\nunderwater manipulating of the deep-sea crawling and swimming robot (DCSR) is\ndirectly influenced by the dynamic performance of the underwater mechanical\nlegs (UWML), as it serves as the executive mechanism of the DCSR. Compared with\nthe mechanical legs of legged robots working on land, the UWML of the DCSR not\nonly possesses the characteristics of the land used mechanical legs, but is\nalso affected by the influence of the deep-sea underwater working environment\n(i.e., the hydrodynamic force, viscous resistance and dynamic seal resistance).\nTo reduce these influence, firstly, the hydrodynamic force of the UWML were\nresearched based on theory and experiment, and the hydrodynamic model was\nestablished with the fitted hydrodynamic parameters. Secondly, the oil viscous\nresistance and the dynamic seal resistance were studied experimentally, and the\nchange laws of both with respect to the joint speed and the ambient pressure\n(depth of operation) were obtained. The results provide a basis for the\nsubsequent research on the structure optimization and high performance control\nof the UWML and DCSR.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:16:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liao","Lihui",""],["Li","Baoren",""],["Zhang","Dijia",""],["Gao","Luping",""],["Ngwa","Mboul\u00e9",""],["Du","Jingmin",""]]}
{"id":"2308.14394","submitter":"Valentin Bosshard","authors":"Valentin Bosshard","title":"A note on the Lagrangian cobordism group of Weinstein sectors","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this note is to show that the Lagrangian cobordism group of a\nWeinstein sector is isomorphic to its middle-dimensional singular cohomology.\nAs an application, a geometric description of Viterbo restriction for cobordism\ngroups is obtained.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:19:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bosshard","Valentin",""]]}
{"id":"2308.14395","submitter":"Rui Zhang","authors":"Rui Zhang, Hongxia Wang, Mingshan Du, Hanqing Liu, Yang Zhou, Qiang\n  Zeng","title":"UMMAFormer: A Universal Multimodal-adaptive Transformer Framework for\n  Temporal Forgery Localization","comments":"11 pages, 8 figures, 66 references. This paper has been accepted for\n  ACM MM 2023","journal-ref":"Proceedings of the 31st ACM International Conference on Multimedia\n  (MM '23), October 29-November 3, 2023","doi":"10.1145/3581783.3613767","report-no":null,"categories":"cs.MM cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The emergence of artificial intelligence-generated content (AIGC) has raised\nconcerns about the authenticity of multimedia content in various fields.\nHowever, existing research for forgery content detection has focused mainly on\nbinary classification tasks of complete videos, which has limited applicability\nin industrial settings. To address this gap, we propose UMMAFormer, a novel\nuniversal transformer framework for temporal forgery localization (TFL) that\npredicts forgery segments with multimodal adaptation. Our approach introduces a\nTemporal Feature Abnormal Attention (TFAA) module based on temporal feature\nreconstruction to enhance the detection of temporal differences. We also design\na Parallel Cross-Attention Feature Pyramid Network (PCA-FPN) to optimize the\nFeature Pyramid Network (FPN) for subtle feature enhancement. To evaluate the\nproposed method, we contribute a novel Temporal Video Inpainting Localization\n(TVIL) dataset specifically tailored for video inpainting scenes. Our\nexperiments show that our approach achieves state-of-the-art performance on\nbenchmark datasets, including Lav-DF, TVIL, and Psynd, significantly\noutperforming previous methods. The code and data are available at\nhttps://github.com/ymhzyj/UMMAFormer/.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:20:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Rui",""],["Wang","Hongxia",""],["Du","Mingshan",""],["Liu","Hanqing",""],["Zhou","Yang",""],["Zeng","Qiang",""]]}
{"id":"2308.14396","submitter":"Rafa{\\l} Filip\\'ow","authors":"Rafa{\\l} Filip\\'ow, Krzysztof Kowitz, Adam Kwela, Jacek Tryba","title":"New Hindman spaces","comments":null,"journal-ref":"Proc. Amer. Math. Soc. 150 (2022), 891-902","doi":"10.1090/proc/15720","report-no":null,"categories":"math.GN math.CO math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a method that allows to turn topological questions about Hindman\nspaces into purely combinatorial questions about the Kat\\v{e}tov order of\nideals on $\\mathbb{N}$. We also provide two applications of the method.\n  (1) We characterize $F_\\sigma$ ideals $\\mathcal{I}$ for which there is a\nHindman space which is not an $\\mathcal{I}$-space under the continuum\nhypothesis. This reduces a topological question of Albin L. Jones about\nconsistency of existence of a Hindman space which is not van der Waerden to the\nquestion whether the ideal of all non AP-sets is not below the ideal of all non\nIP-sets in the Kat\\v{e}tov order.\n  (2) Under the continuum hypothesis, we construct a Hindman space which is not\nan $\\mathcal{I}_{1/n}$-space. This answers a question posed by Jana\nFla\\v{s}kov\\'{a} at the 22nd Summer Conference on Topology and its\nApplications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:23:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Filip\u00f3w","Rafa\u0142",""],["Kowitz","Krzysztof",""],["Kwela","Adam",""],["Tryba","Jacek",""]]}
{"id":"2308.14397","submitter":"U Mong Sain Chak","authors":"U Mong Sain Chak, Md. Asib Rahman","title":"Ensemble of Anchor-Free Models for Robust Bangla Document Layout\n  Segmentation","comments":"4 pages, 5 figures, 6 Tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this research paper, we introduce a novel approach designed for the\npurpose of segmenting the layout of Bangla documents. Our methodology involves\nthe utilization of a sophisticated ensemble of YOLOv8 models, which were\ntrained for the DL Sprint 2.0 - BUET CSE Fest 2023 Competition focused on\nBangla document layout segmentation. Our primary emphasis lies in enhancing\nvarious aspects of the task, including techniques such as image augmentation,\nmodel architecture, and the incorporation of model ensembles. We deliberately\nreduce the quality of a subset of document images to enhance the resilience of\nmodel training, thereby resulting in an improvement in our cross-validation\nscore. By employing Bayesian optimization, we determine the optimal confidence\nand Intersection over Union (IoU) thresholds for our model ensemble. Through\nour approach, we successfully demonstrate the effectiveness of anchor-free\nmodels in achieving robust layout segmentation in Bangla documents.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:24:25 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 11:46:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chak","U Mong Sain",""],["Rahman","Md. Asib",""]]}
{"id":"2308.14398","submitter":"Minxi He","authors":"Minxi He, Kohei Kamada, Kyohei Mukaida","title":"Quantum Corrections to Higgs Inflation in Einstein-Cartan Gravity","comments":"31 pages, 4 figures, 3 appendices","journal-ref":null,"doi":null,"report-no":"KEK-TH-2545, KEK-Cosmo-0319, RESCEU-15/23","categories":"hep-ph astro-ph.CO gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the quantum corrections to the Higgs inflation model in\nthe context of the Einstein-Cartan (E-C) gravity in the large-$ N $ limit with\n$N$ being the number of real scalar components in Higgs. Recently, it is\nrealized that the Higgs inflation in the E-C formalism smoothly connects those\nin the metric and the Palatini formalisms in the presence of a non-minimal\ncoupling between the Higgs fields and the Nieh-Yan term. This motivates us to\ninvestigate the quantum corrections to the E-C Higgs inflation and to clarify\nhow the Ricci curvature squared $ R^2 $ induced by the quantum corrections\nsucceeds in Ultraviolet (UV)-extending the Higgs inflation in metric formalism\nwhile it fails in the Palatini case. We show that a generalized $ R^2 $-term\nrequired for the renormalization in the E-C formalism induces a new scalar\ndegree of freedom (DoF), the scalaron, which gradually decouples with the\nsystem due to its increasing mass as approaching the Palatini limit. The\npresence of the scalaron extends the UV cutoff at vacuum of the original model\nexcept for the parameter space close to the Palatini limit. This UV-extension\nis expected to solve the strong coupling problem that may exist during\n(p)reheating in the absence of the scalaron.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:24:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["He","Minxi",""],["Kamada","Kohei",""],["Mukaida","Kyohei",""]]}
{"id":"2308.14399","submitter":"Daniele Delicato Mr","authors":"D. Delicato, A. Ahmad, L. Bandiera, M. Calvo, M. Cappelli, G. Del\n  Castello, M. del Gallo Roccagiovine, M. Giammei, V. Guidi, D. Maiello, V.\n  Pettinacci, M. Romagnoni, M. Tamisari, A. Cruciani, A. Mazzolari, A.\n  Monfardini, M. Vignati","title":"Low-energy spectrum of the BULLKID detector array operated on surface","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present the first continuous operation in a surface lab of BULLKID, a\ndetector for searches of light Dark Matter and precision measurements of the\ncoherent and elastic neutrino-nucleus scattering. The detector consists of an\narray of 60 cubic silicon particle absorbers of 0.34 g each, sensed by\ncryogenic kinetic inductance detectors. The data presented focusses on one of\nthe central elements of the array and on its surrounding elements used as veto.\nThe energy spectrum resulting from an exposure of 39 hours to ambient\nbackgrounds, obtained without radiation shields, is flat at the level of\n$(2.0\\pm0.1\\,{\\rm stat.}\\pm0.2\\,{\\rm syst.})\\times10^6$ counts / keV kg days\ndown to the energy threshold of $160\\pm13$ eV. The data analysis demonstrates\nthe unique capability of rejecting backgrounds generated from interactions in\nother sites of the array, stemming from the segmented and monolithic structure\nof the detector.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:24:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Delicato","D.",""],["Ahmad","A.",""],["Bandiera","L.",""],["Calvo","M.",""],["Cappelli","M.",""],["Del Castello","G.",""],["Roccagiovine","M. del Gallo",""],["Giammei","M.",""],["Guidi","V.",""],["Maiello","D.",""],["Pettinacci","V.",""],["Romagnoni","M.",""],["Tamisari","M.",""],["Cruciani","A.",""],["Mazzolari","A.",""],["Monfardini","A.",""],["Vignati","M.",""]]}
{"id":"2308.14400","submitter":"Md Awsafur Rahman","authors":"Md Awsafur Rahman and Shaikh Anowarul Fattah","title":"Semi-Supervised Semantic Depth Estimation using Symbiotic Transformer\n  and NearFarMix Augmentation","comments":"Accepted at WACV 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In computer vision, depth estimation is crucial for domains like robotics,\nautonomous vehicles, augmented reality, and virtual reality. Integrating\nsemantics with depth enhances scene understanding through reciprocal\ninformation sharing. However, the scarcity of semantic information in datasets\nposes challenges. Existing convolutional approaches with limited local\nreceptive fields hinder the full utilization of the symbiotic potential between\ndepth and semantics. This paper introduces a dataset-invariant semi-supervised\nstrategy to address the scarcity of semantic information. It proposes the Depth\nSemantics Symbiosis module, leveraging the Symbiotic Transformer for achieving\ncomprehensive mutual awareness by information exchange within both local and\nglobal contexts. Additionally, a novel augmentation, NearFarMix is introduced\nto combat overfitting and compensate both depth-semantic tasks by strategically\nmerging regions from two images, generating diverse and structurally consistent\nsamples with enhanced control. Extensive experiments on NYU-Depth-V2 and KITTI\ndatasets demonstrate the superiority of our proposed techniques in indoor and\noutdoor environments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:33:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rahman","Md Awsafur",""],["Fattah","Shaikh Anowarul",""]]}
{"id":"2308.14401","submitter":"Zhensu Sun","authors":"Zhensu Sun, Xiaoning Du, Fu Song, Li Li","title":"CodeMark: Imperceptible Watermarking for Code Datasets against Neural\n  Code Completion Models","comments":"Accepted to FSE 2023","journal-ref":null,"doi":"10.1145/3611643.3616297","report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Code datasets are of immense value for training neural-network-based code\ncompletion models, where companies or organizations have made substantial\ninvestments to establish and process these datasets. Unluckily, these datasets,\neither built for proprietary or public usage, face the high risk of\nunauthorized exploits, resulting from data leakages, license violations, etc.\nEven worse, the ``black-box'' nature of neural models sets a high barrier for\nexternals to audit their training datasets, which further connives these\nunauthorized usages. Currently, watermarking methods have been proposed to\nprohibit inappropriate usage of image and natural language datasets. However,\ndue to domain specificity, they are not directly applicable to code datasets,\nleaving the copyright protection of this emerging and important field of code\ndata still exposed to threats. To fill this gap, we propose a method, named\nCodeMark, to embed user-defined imperceptible watermarks into code datasets to\ntrace their usage in training neural code completion models. CodeMark is based\non adaptive semantic-preserving transformations, which preserve the exact\nfunctionality of the code data and keep the changes covert against\nrule-breakers. We implement CodeMark in a toolkit and conduct an extensive\nevaluation of code completion models. CodeMark is validated to fulfill all\ndesired properties of practical watermarks, including harmlessness to model\naccuracy, verifiability, robustness, and imperceptibility.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:36:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sun","Zhensu",""],["Du","Xiaoning",""],["Song","Fu",""],["Li","Li",""]]}
{"id":"2308.14402","submitter":"Tanya Sharma","authors":"Tanya Sharma, Ayan Biswas, Jayanth Ramakrishnan, Pooja Chandravanshi,\n  and Ravindra P. Singh","title":"Mitigating the source-side channel vulnerability by characterization of\n  photon statistics","comments":"Comments and suggestions are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum key distribution (QKD) theoretically offers unconditional security.\nUnfortunately, the gap between theory and practice threatens side-channel\nattacks on practical QKD systems. Many well-known QKD protocols use weak\ncoherent laser pulses to encode the quantum information. These sources differ\nfrom ideal single photon sources and follow Poisson statistics. Many protocols,\nsuch as decoy state and coincidence detection protocols, rely on monitoring the\nphoton statistics to detect any information leakage. The accurate measurement\nand characterization of photon statistics enable the detection of adversarial\nattacks and the estimation of secure key rates, strengthening the overall\nsecurity of the QKD system. We have rigorously characterized our source to\nestimate the mean photon number employing multiple detectors for comparison\nagainst measurements made with a single detector. Furthermore, we have also\nstudied intensity fluctuations to help identify and mitigate any potential\ninformation leakage due to state preparation flaws. We aim to bridge the gap\nbetween theory and practice to achieve information-theoretic security.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:37:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sharma","Tanya",""],["Biswas","Ayan",""],["Ramakrishnan","Jayanth",""],["Chandravanshi","Pooja",""],["Singh","Ravindra P.",""]]}
{"id":"2308.14403","submitter":"Guillaume Nataf","authors":"L. F\\'eger (1), F. Giovannelli (1), G. Vats (2 and 3), J. Alves (1),\n  B. Pignon (1), E.K.H. Salje (4), I. Monot-Laffez (1), G.F. Nataf (1) ((1)\n  GREMAN UMR7347, CNRS, University of Tours, INSA Centre Val de Loire, Tours,\n  (2) Groningen Cognitive Systems and Materials Center (CogniGron), University\n  of Groningen, (3) Department of Physics and Astronomy, Katholieke\n  Universiteit Leuven, (4) Department of Earth Sciences, University of\n  Cambridge)","title":"Dense and single-phase KTaO$_{3}$ ceramics obtained by spark plasma\n  sintering","comments":"to be published in Journal of the European Ceramic Society","journal-ref":null,"doi":"10.1016/j.jeurceramsoc.2023.07.060","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Potassium tantalate (KTaO$_{3}$) is a promising material for dielectric\napplications at low temperature. However, dense and single-phase ceramics\ncannot be obtained by conventional sintering because of the evaporation of\npotassium that leads to secondary phases. Here, we demonstrate that spark\nplasma sintering is a suitable method to obtain dense and single-phase\nKTaO$_{3}$ ceramics, by optimizing three parameters: initial composition,\ntemperature, and pressure. A 2 mol% K-excess in the precursors leads to a large\ngrain growth and dense single-phase ceramics. Without K-excess, a small amount\nof secondary phase (K$_{6}$Ta$_{10.8}$O$_{30}$) is observed at the surface but\ncan be removed by polishing. At 10 K, the dielectric permittivity is 4 times\nhigher in the ceramic from the 2 mol% K-excess powder, because of the larger\ngrain size. The thermal conductivity decreases with decreasing grain size and\nstays above the thermal conductivity of KNbO$_{3}$ ceramics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:39:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["F\u00e9ger","L.","","2 and 3"],["Giovannelli","F.","","2 and 3"],["Vats","G.","","2 and 3"],["Alves","J.",""],["Pignon","B.",""],["Salje","E. K. H.",""],["Monot-Laffez","I.",""],["Nataf","G. F.",""]]}
{"id":"2308.14404","submitter":"Forouzan Farzinnejad","authors":"Forouzan Farzinnejad, Javad Rasti, Navid Khezrian, Jens Grubert","title":"The Effect of an Exergame on the Shadow Play Skill Based on Muscle\n  Memory for Young Female Participants: The Case of Forehand Drive in Table\n  Tennis","comments":"9 pages, 6 figures, The 22nd IEEE International Symposium on Mixed\n  and Augmented Reality (ISMAR)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning and practicing table tennis with traditional methods is a long,\ntedious process and may even lead to the internalization of incorrect\ntechniques if not supervised by a coach. To overcome these issues, the\npresented study proposes an exergame with the aim of enhancing young female\nnovice players' performance by boosting muscle memory, making practice more\ninteresting, and decreasing the probability of faulty training. Specifically,\nwe propose an exergame based on skeleton tracking and a virtual avatar to\nsupport correct shadow practice to learn forehand drive technique without the\npresence of a coach. We recruited 44 schoolgirls aged between 8 and 12 years\nwithout a background in playing table tennis and divided them into control and\nexperimental groups. We examined their stroke skills (via the Mott-Lockhart\ntest) and the error coefficient of their forehand drives (using a ball machine)\nin the pretest, post-test, and follow-up tests (10 days after the post-test).\nOur results showed that the experimental group had progress in the short and\nlong term, while the control group had an improvement only in the short term.\nFurther, the scale of improvement in the experimental group was significantly\nhigher than in the control group. Given that the early stages of learning,\nparticularly in girls children, are important in the internalization of\nindividual skills in would-be athletes, this method could support promoting\ncorrect training for young females.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:39:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Farzinnejad","Forouzan",""],["Rasti","Javad",""],["Khezrian","Navid",""],["Grubert","Jens",""]]}
{"id":"2308.14405","submitter":"Hendrik Hensel","authors":"Hendrik Hensel, Christoph Joergens and Markus Clemens","title":"Simulation of Permittivity and Conductivity Graded Materials for HVDC\n  GIL for Different Voltage Forms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Functionally graded materials (FGM) are applied in HVDC gas insulated lines\n(GIL) to control the electric field within the DC insulation system. In HVDC\nGIL, FGM with a spatial distribution of the electric conductivity\n(conductivity-FGM) is applied to control the electric field under DC steady\nstate condition. However, besides DC steady state, different DC conditions\noccur, e.g. DC-on process, polarity reversal and lightning impulse. Under these\nconditions conductivity-FGM is not sufficient to control the electric field,\nsince these conditions result in transient capacitive fields, where the\npermittivity is decisive for the electric field. In this paper, we suggest\ncombining conductivity-FGM and a spatial distribution of permittivity\n(permittivity-FGM) in the spacer material to control the electric field around\nDC-GIL spacer for various DC-conditions, considering nonlinear material models\nfor the insulating gas and the epoxy spacer. A variation of the spatial\ndistribution of permittivity and conductivity in the spacer is investigated in\nthis paper for an effective field reduction. The results show a reduction of\nthe electric field intensity up to 65.8 %, when conductivity/permittivity-FGM\nis applied.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:40:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hensel","Hendrik",""],["Joergens","Christoph",""],["Clemens","Markus",""]]}
{"id":"2308.14406","submitter":"Karim ZAYANA","authors":"Karim Zayana (M.E.N.E.S.R., COMELEC), R\\'egis Queruel, Pierre Michalak","title":"Infomathic","comments":"in French language","journal-ref":"Quadrature, 2023, 129","doi":null,"report-no":null,"categories":"cs.CY math.HO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since its existence, the computer tool has often supported mathematicians,\nwhether it is to implement an approximation method (numerical calculation of a\nroot, of an integral, ...) or to simulate a phenomenon (geometric in nature,\nprobabilistic, ...) to verify or establish a conjecture. But, and this is\nanother point on which we will concentrate our attention here, computing will\nalso have served the cause of mathematics by inspiring certain reasoning or by\ntaking charge of whole sections of a demonstration. We will illustrate this\nfruitful partnership with two example saccessible from high school.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:40:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zayana","Karim","","M.E.N.E.S.R., COMELEC"],["Queruel","R\u00e9gis",""],["Michalak","Pierre",""]]}
{"id":"2308.14407","submitter":"Daria Smirnova","authors":"Ekaterina O. Smolina, Lev A. Smirnov, Daniel Leykam, Franco Nori,\n  Daria A. Smirnova","title":"Identifying topology of leaky photonic lattices with machine learning","comments":"9 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.LG physics.data-an stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show how machine learning techniques can be applied for the classification\nof topological phases in leaky photonic lattices using limited measurement\ndata. We propose an approach based solely on bulk intensity measurements, thus\nexempt from the need for complicated phase retrieval procedures. In particular,\nwe design a fully connected neural network that accurately determines\ntopological properties from the output intensity distribution in dimerized\nwaveguide arrays with leaky channels, after propagation of a spatially\nlocalized initial excitation at a finite distance, in a setting that closely\nemulates realistic experimental conditions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:42:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Smolina","Ekaterina O.",""],["Smirnov","Lev A.",""],["Leykam","Daniel",""],["Nori","Franco",""],["Smirnova","Daria A.",""]]}
{"id":"2308.14408","submitter":"Daniel Brady","authors":"Daniel Brady, Michael Fleischhauer","title":"Mean-field approach to Rydberg facilitation in a gas of atoms at high\n  and low temperatures","comments":"arXiv admin note: text overlap with arXiv:2302.14145","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The excitation spread caused by Rydberg facilitation in a gas of laser driven\natoms is an interesting model system for studying epidemic dynamics. We derive\na mean-field approach to describe this facilitation process in the limits of\nhigh and low temperatures, which takes into account Rydberg blockade and the\nnetwork character of excitation spreading in a low-temperature gas. As opposed\nto previous mean-field models, our approach accurately predicts all stages of\nthe facilitation dynamics from the initial fast epidemic growth, an extended\nsaturation period, to the final relaxation phase.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:43:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Brady","Daniel",""],["Fleischhauer","Michael",""]]}
{"id":"2308.14409","submitter":"Riccardo Barbano","authors":"Riccardo Barbano, Alexander Denker, Hyungjin Chung, Tae Hoon Roh,\n  Simon Arrdige, Peter Maass, Bangti Jin, Jong Chul Ye","title":"Steerable Conditional Diffusion for Out-of-Distribution Adaptation in\n  Imaging Inverse Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Denoising diffusion models have emerged as the go-to framework for solving\ninverse problems in imaging. A critical concern regarding these models is their\nperformance on out-of-distribution (OOD) tasks, which remains an under-explored\nchallenge. Realistic reconstructions inconsistent with the measured data can be\ngenerated, hallucinating image features that are uniquely present in the\ntraining dataset. To simultaneously enforce data-consistency and leverage\ndata-driven priors, we introduce a novel sampling framework called Steerable\nConditional Diffusion. This framework adapts the denoising network specifically\nto the available measured data. Utilising our proposed method, we achieve\nsubstantial enhancements in OOD performance across diverse imaging modalities,\nadvancing the robust deployment of denoising diffusion models in real-world\napplications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:47:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barbano","Riccardo",""],["Denker","Alexander",""],["Chung","Hyungjin",""],["Roh","Tae Hoon",""],["Arrdige","Simon",""],["Maass","Peter",""],["Jin","Bangti",""],["Ye","Jong Chul",""]]}
{"id":"2308.14410","submitter":"Holger Sambale","authors":"Paul Buterus, Holger Sambale","title":"Some notes on moment inequalities for heavy-tailed distributions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the relation between moments and tails of heavy-tailed (in\nparticular, Pareto-type) distributions. We also discuss the sharpness of our\nresults in a number of examples under certain regularity conditions like\nlog-convexity. Moreover, we derive concentration bounds for polynomial chaos of\nany order $d$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:47:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Buterus","Paul",""],["Sambale","Holger",""]]}
{"id":"2308.14411","submitter":"David Van Nguyen","authors":"David V. Nguyen, Shayan Doroudi, and Daniel A. Epstein","title":"Community College Articulation Agreement Websites: Students' Suggestions\n  for New Academic Advising Software Features","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Purpose: Community college counselors and students use articulation agreement\nwebsites to (a) learn how community college courses will transfer and fulfill\nuniversity requirements and (b) develop an academic plan to prepare to\ntransfer. Compared to universities that do not have them, universities that do\nhave articulation agreements provide more transparency about course transfer.\nHowever, the literature displays conflicting results on whether articulation\nagreements improve transfer-related outcomes; perhaps one contributor to these\nconflicting research results is the subpar user experience of articulation\nagreement reports and the websites that host them. Approach: Accordingly, we\nsurveyed and interviewed California community college transfer students to\ngather their suggestions for new academic-advising-related software features\nfor the ASSIST website. ASSIST is California's official centralized repository\nof articulation agreement reports between public California community colleges\nand universities. We analyzed the open-ended survey and interview data using\nstructural coding and thematic analysis. Findings: We identified four themes\naround students' software feature suggestions for ASSIST: (a) features that\nautomate laborious academic advising tasks, (b) features to reduce ambiguity\nwith articulation agreements, (c) features to mitigate mistakes in term-by-term\ncourse planning, and (d) features to facilitate online advising from counselors\nand student peers. Originality: Our research builds on the scant literature on\nincorporating education technology into articulation agreements. Furthermore,\nsome of the suggested academic-advising-related software features (and their\nunderlying pain points) are novel and have not been discussed before in prior\nresearch.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:50:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen","David V.",""],["Doroudi","Shayan",""],["Epstein","Daniel A.",""]]}
{"id":"2308.14412","submitter":"Wangkun Xu","authors":"Wangkun Xu, Fei Teng","title":"Task-Aware Machine Unlearning and Its Application in Load Forecasting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Data privacy and security have become a non-negligible factor in load\nforecasting. Previous researches mainly focus on training stage enhancement.\nHowever, once the model is trained and deployed, it may need to `forget' (i.e.,\nremove the impact of) part of training data if the data is found to be\nmalicious or as requested by the data owner. This paper introduces machine\nunlearning algorithm which is specifically designed to remove the influence of\npart of the original dataset on an already trained forecaster. However, direct\nunlearning inevitably degrades the model generalization ability. To balance\nbetween unlearning completeness and performance degradation, a\nperformance-aware algorithm is proposed by evaluating the sensitivity of local\nmodel parameter change using influence function and sample re-weighting.\nMoreover, we observe that the statistic criterion cannot fully reflect the\noperation cost of down-stream tasks. Therefore, a task-aware machine unlearning\nis proposed whose objective is a tri-level optimization with dispatch and\nredispatch problems considered. We theoretically prove the existence of the\ngradient of such objective, which is key to re-weighting the remaining samples.\nWe test the unlearning algorithms on linear and neural network load forecasters\nwith realistic load dataset. The simulation demonstrates the balance on\nunlearning completeness and operational cost. All codes can be found at\nhttps://github.com/xuwkk/task_aware_machine_unlearning.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:50:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Xu","Wangkun",""],["Teng","Fei",""]]}
{"id":"2308.14413","submitter":"Yongqing Cai","authors":"Changmeng Huan, Yongqing Cai, Devesh R. Kripalani, Kun Zhou and\n  Qingqing Ke","title":"Abnormal behavior of preferred formation of cationic vacancy from the\n  interior in {\\gamma}-GeSe monolayer with the stereo-chemical antibonding\n  lone-pair state","comments":null,"journal-ref":"Nanoscale Horiz. 8, 404-411 (2023)","doi":"10.1039/D2NH00573E","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional (2D) materials tend to have the preferably formation of\nvacancies at the outer surface. Here, contrary to the normal notion, we reveal\na type of vacancy that thermodynamically initiates from the interior part of\nthe 2D backbone of germanium selenide ({\\gamma}-GeSe). Interestingly, the\nGe-vacancy (VGe) in the interior part of {\\gamma}-GeSe possesses the lowest\nformation energy amongst the various types of defects considered. We also find\na low diffusion barrier (1.04 eV) of VGe which is a half of those of sulfur\nvacancy in MoS2. The facile formation of mobile VGe is rooted in the\nantibonding coupling of the lone-pair Ge 4s and Se 4p states near the valence\nband maximum, which also exists in other gamma-phase MX (M=Sn, Ge; X=S, Te).\nThe VGe is accompanied by a shallow acceptor level in the band gap and induces\nstrong infrared light absorption and p-type conductivity. The VGe located in\nthe middle cationic Ge sublattice is well protected by the surface Se layers-a\nfeature that is absent in other atomically thin materials. Our work suggests\nthat the unique well-buried inner VGe, with the potential of forming\nstructurally protected ultrathin conducting filaments, may render the GeSe\nlayer an ideal platform for quantum emitting, memristive, and neuromorphic\napplications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:51:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huan","Changmeng",""],["Cai","Yongqing",""],["Kripalani","Devesh R.",""],["Zhou","Kun",""],["Ke","Qingqing",""]]}
{"id":"2308.14414","submitter":"Shuyi Zhou","authors":"Shuyi Zhou, Shuxiang Xie, Ryoichi Ishikawa, Ken Sakurada, Masaki\n  Onishi, Takeshi Oishi","title":"INF: Implicit Neural Fusion for LiDAR and Camera","comments":"Accepted to IROS 2023. (project page:\n  https://ShuyiZhou495.github.io/inf-project-page/)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Sensor fusion has become a popular topic in robotics. However, conventional\nfusion methods encounter many difficulties, such as data representation\ndifferences, sensor variations, and extrinsic calibration. For example, the\ncalibration methods used for LiDAR-camera fusion often require manual operation\nand auxiliary calibration targets. Implicit neural representations (INRs) have\nbeen developed for 3D scenes, and the volume density distribution involved in\nan INR unifies the scene information obtained by different types of sensors.\nTherefore, we propose implicit neural fusion (INF) for LiDAR and camera. INF\nfirst trains a neural density field of the target scene using LiDAR frames.\nThen, a separate neural color field is trained using camera images and the\ntrained neural density field. Along with the training process, INF both\nestimates LiDAR poses and optimizes extrinsic parameters. Our experiments\ndemonstrate the high accuracy and stable performance of the proposed method.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:51:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Shuyi",""],["Xie","Shuxiang",""],["Ishikawa","Ryoichi",""],["Sakurada","Ken",""],["Onishi","Masaki",""],["Oishi","Takeshi",""]]}
{"id":"2308.14415","submitter":"Florent Cabric","authors":"Florent Cabric, Margr\\'et Vilborg Bjarnad\\'ottir, Meng Ling,\n  Gu{\\dh}bj\\\"org Linda Rafnsd\\'ottir, Petra Isenberg","title":"Eleven Years of Gender Data Visualization: A Step Towards More Inclusive\n  Gender Representation","comments":"11 page","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an analysis of the representation of gender as a data dimension in\ndata visualizations and propose a set of considerations around visual variables\nand annotations for gender-related data. Gender is a common demographic\ndimension of data collected from study or survey participants, passengers, or\ncustomers, as well as across academic studies, especially in certain\ndisciplines like sociology. Our work contributes to multiple ongoing\ndiscussions on the ethical implications of data visualizations. By choosing\nspecific data, visual variables, and text labels, visualization designers may,\ninadvertently or not, perpetuate stereotypes and biases. Here, our goal is to\nstart an evolving discussion on how to represent data on gender in data\nvisualizations and raise awareness of the subtleties of choosing visual\nvariables and words in gender visualizations. In order to ground this\ndiscussion, we collected and coded gender visualizations and their captions\nfrom five different scientific communities (Biology, Politics, Social Studies,\nVisualisation, and Human-Computer Interaction), in addition to images from\nTableau Public and the Information Is Beautiful awards showcase. Overall we\nfound that representation types are community-specific, color hue is the\ndominant visual channel for gender data, and nonconforming gender is\nunder-represented. We end our paper with a discussion of considerations for\ngender visualization derived from our coding and the literature and\nrecommendations for large data collection bodies. A free copy of this paper and\nall supplemental materials are available at https://osf.io/v9ams/\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:51:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cabric","Florent",""],["Bjarnad\u00f3ttir","Margr\u00e9t Vilborg",""],["Ling","Meng",""],["Rafnsd\u00f3ttir","Gu\u00f0bj\u00f6rg Linda",""],["Isenberg","Petra",""]]}
{"id":"2308.14416","submitter":"Tobias Kallehauge MSc","authors":"Tobias Kallehauge, Martin Voigt Vejling, Pablo Ram\\`irez-Espinosa,\n  Kimmo Kansanen, Henk Wymeersch, Petar Popovski","title":"On the Statistical Relation of Ultra-Reliable Wireless and Location\n  Estimation","comments":"Submitted for IEEE Transactions of Wireless Communications on July\n  16th 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Location information is often used as a proxy to guarantee the performance of\na wireless communication link. However, localization errors can result in a\nsignificant mismatch with the guarantees, particularly detrimental to users\noperating the ultra-reliable low-latency communication (URLLC) regime. This\npaper unveils the fundamental statistical relations between location estimation\nuncertainty and wireless link reliability, specifically in the context of rate\nselection for ultra-reliable communication. We start with a simple\none-dimensional narrowband Rayleigh fading scenario and build towards a\ntwo-dimensional scenario in a rich scattering environment. The wireless link\nreliability is characterized by the meta-probability, the probability with\nrespect to localization error of exceeding the outage capacity, and by removing\nother sources of errors in the system, we show that reliability is sensitive to\nlocalization errors. The $\\epsilon$-outage coherence radius is defined and\nshown to provide valuable insight into the problem of location-based rate\nselection. However, it is generally challenging to guarantee reliability\nwithout accurate knowledge of the propagation environment. Finally, several\nrate-selection schemes are proposed, showcasing the problem's dynamics and\nrevealing that properly accounting for the localization error is critical to\nensure good performance in terms of reliability and achievable throughput.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:52:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kallehauge","Tobias",""],["Vejling","Martin Voigt",""],["Ram\u00ecrez-Espinosa","Pablo",""],["Kansanen","Kimmo",""],["Wymeersch","Henk",""],["Popovski","Petar",""]]}
{"id":"2308.14417","submitter":"Mariana Dutra","authors":"B. A. de Moura S., C. H. Lenzi, O. Louren\\c{c}o, M. Dutra","title":"Bayesian analysis of a relativistic hadronic model constrained by recent\n  astrophysical observations","comments":"12 pages, 11 figures, 7 tables. Accepted for publication in MNRAS","journal-ref":null,"doi":"10.1093/mnras/stad2558","report-no":null,"categories":"nucl-th astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use Bayesian analysis in order to constrain the equation of state for\nnuclear matter from astrophysical data related to the recent measurements from\nthe NICER mission, LIGO/Virgo collaboration, and probability distributions of\nmass and radius from other 12 sources, including thermonuclear busters, and\nquiescent low-mass X-ray binaries. For this purpose, we base our study on a\nrelativistic hadronic mean field model including an $\\omega-\\rho$ interaction.\nOur results indicate optimal ranges for some bulk parameters at the saturation\ndensity, namely, effective mass, incompressibility, and symmetry energy slope\n($L_0$). For instance, we find $L_0 = 50.79^{+15.16}_{-9.24}$ MeV (Case 1) and\n$L_0 = 75.06^{+8.43}_{-4.43}$ MeV (Case 2) in a $68\\%$ confidence interval for\nthe 2 cases analyzed (different input ranges for $L_0$ related to the PREX-II\ndata). The respective parametrizations are in agreement with important nuclear\nmatter constraints, as well as observational neutron star data, such as the\ndimensionless tidal deformability of the GW170817 event. From the mass-radius\ncurves obtained from these best parametrizations, we also find the ranges of\n$11.97 \\mbox{ km}\\leqslant R_{1.4}\\leqslant 12.73 \\mbox{ km}$ (Case 1) and\n$12.34 \\mbox{ km}\\leqslant R_{1.4}\\leqslant 13.06 \\mbox{ km}$ (Case 2) for the\nradius of the $1.4M_\\odot$ neutron star.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:53:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["S.","B. A. de Moura",""],["Lenzi","C. H.",""],["Louren\u00e7o","O.",""],["Dutra","M.",""]]}
{"id":"2308.14418","submitter":"Aristotelis Ballas","authors":"Aristotelis Ballas and Christos Diou","title":"Multi-Scale and Multi-Layer Contrastive Learning for Domain\n  Generalization","comments":"Manuscript under review at: IEEE Transactions on Artificial\n  Intelligence","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  During the past decade, deep neural networks have led to fast-paced progress\nand significant achievements in computer vision problems, for both academia and\nindustry. Yet despite their success, state-of-the-art image classification\napproaches fail to generalize well in previously unseen visual contexts, as\nrequired by many real-world applications. In this paper, we focus on this\ndomain generalization (DG) problem and argue that the generalization ability of\ndeep convolutional neural networks can be improved by taking advantage of\nmulti-layer and multi-scaled representations of the network. We introduce a\nframework that aims at improving domain generalization of image classifiers by\ncombining both low-level and high-level features at multiple scales, enabling\nthe network to implicitly disentangle representations in its latent space and\nlearn domain-invariant attributes of the depicted objects. Additionally, to\nfurther facilitate robust representation learning, we propose a novel objective\nfunction, inspired by contrastive learning, which aims at constraining the\nextracted representations to remain invariant under distribution shifts. We\ndemonstrate the effectiveness of our method by evaluating on the domain\ngeneralization datasets of PACS, VLCS, Office-Home and NICO. Through extensive\nexperimentation, we show that our model is able to surpass the performance of\nprevious DG methods and consistently produce competitive and state-of-the-art\nresults in all datasets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:54:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ballas","Aristotelis",""],["Diou","Christos",""]]}
{"id":"2308.14419","submitter":"Yijin Li","authors":"Yijin Li, Han Zhou, Bangbang Yang, Ye Zhang, Zhaopeng Cui, Hujun Bao,\n  Guofeng Zhang","title":"Graph-based Asynchronous Event Processing for Rapid Object Recognition","comments":"Accepted to ICCV 2021. Project Page:\n  https://zju3dv.github.io/slide_gcn/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Different from traditional video cameras, event cameras capture asynchronous\nevents stream in which each event encodes pixel location, trigger time, and the\npolarity of the brightness changes. In this paper, we introduce a novel\ngraph-based framework for event cameras, namely SlideGCN. Unlike some recent\ngraph-based methods that use groups of events as input, our approach can\nefficiently process data event-by-event, unlock the low latency nature of\nevents data while still maintaining the graph's structure internally. For fast\ngraph construction, we develop a radius search algorithm, which better exploits\nthe partial regular structure of event cloud against k-d tree based generic\nmethods. Experiments show that our method reduces the computational complexity\nup to 100 times with respect to current graph-based methods while keeping\nstate-of-the-art performance on object recognition. Moreover, we verify the\nsuperiority of event-wise processing with our method. When the state becomes\nstable, we can give a prediction with high confidence, thus making an early\nrecognition. Project page: \\url{https://zju3dv.github.io/slide_gcn/}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:59:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Yijin",""],["Zhou","Han",""],["Yang","Bangbang",""],["Zhang","Ye",""],["Cui","Zhaopeng",""],["Bao","Hujun",""],["Zhang","Guofeng",""]]}
{"id":"2308.14420","submitter":"Jose Queiruga","authors":"A. Alonso-Izquierdo, S. Navarro-Obreg\\'on, K. Oles, J. Queiruga, T.\n  Romanczukiewicz and A. Wereszczynski","title":"Semi-BPS sphaleron and its dynamics","comments":"13 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a simple field theory in which a sphaleron, i.e., a saddle-point\nparticle-like solution, forms a semi-BPS state with a background defect that is\nan impurity. This means that there is no static force between the sphaleron and\nthe impurity. Therefore such a sphaleron-impurity system is very much like\nusual BPS multi-solitons, however, still possessing an unstable direction\nallowing for its decay. We study dynamics of the sphaleron in such a system.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:03:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alonso-Izquierdo","A.",""],["Navarro-Obreg\u00f3n","S.",""],["Oles","K.",""],["Queiruga","J.",""],["Romanczukiewicz","T.",""],["Wereszczynski","A.",""]]}
{"id":"2308.14421","submitter":"Rebekah Rousi Dr","authors":"Rebekah Rousi, Ville Vakkuri","title":"Introduction to ethics in the age of digital communication","comments":"9 pages, 3 figures, Digitalizing communication in the changing world\n  report","journal-ref":null,"doi":null,"report-no":"41","categories":"cs.CY cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ethics, or moral philosophy, have existed throughout civil human history.\nEthics can be described simplistically as the study of what is good and bad or\ngood and evil. More relevant for contemporary societal discourses, are\nbehavioural understandings of ethics, and ethical practice. It is integral for\nindividuals operating in the fields of communications, design and technological\ndevelopment to grasp what ethics are, how they relate and apply to specific\ndomains, where basic principles or similarities lie from context to context,\nand where there may be differences. This article serves as an introduction to\nethics in the field of digital communication. It gives a brief overview of\napplied ethics as a practical sub-field of ethics and observes ethics in\ncontemporary professional practice from practical, research, and theoretical\nperspectives.The article also discusses the ways in which the nature of ethics\nin the field of communication has been changing, and the impact of emerging\ntechnology on these changes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:03:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rousi","Rebekah",""],["Vakkuri","Ville",""]]}
{"id":"2308.14422","submitter":"Arttu Malkam\\\"aki","authors":"Arttu Malkam\\\"aki, Ted Hsuan Yun Chen, Antti Gronow, Mikko Kivel\\\"a,\n  Juho Vesa, Tuomas Yl\\\"a-Anttila","title":"Complex coalitions: political alliances across relational contexts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Coalitions are central to politics, including government formation,\ninternational relations, and public policy. Coalitions emerge when actors\nengage one another across multiple relational contexts, but existing literature\noften approaches coalitions in singular contexts. We introduce complex\ncoalitions, a theoretical-methodological framework that emphasises the\nrelevance of multiple contexts and cross-context dependencies in coalition\npolitics. We also implement tools to statistically infer such coalition\nstructures using multilayer networks. To demonstrate the usefulness of our\napproach, we compare coalitions among Finnish organisations engaging in climate\npolitics across three con-texts: resource coordination, legacy media discourse,\nand social media communication. We show that considering coalitions as complex\nand accounting for cross-context dependencies improves the empirical validity\nof coalition studies. In our case study, the three contexts represent\ncomplementary, but not congruent, channels for enacting coalitions. In\nconclusion, we argue that the complex coalitions approach is useful for\nadvancing understanding of coalitions in different political realms.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:03:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Malkam\u00e4ki","Arttu",""],["Chen","Ted Hsuan Yun",""],["Gronow","Antti",""],["Kivel\u00e4","Mikko",""],["Vesa","Juho",""],["Yl\u00e4-Anttila","Tuomas",""]]}
{"id":"2308.14423","submitter":"Andrei Catalin Coman","authors":"Andrei C. Coman, Christos Theodoropoulos, Marie-Francine Moens, James\n  Henderson","title":"GADePo: Graph-Assisted Declarative Pooling Transformers for\n  Document-Level Relation Extraction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Document-level relation extraction aims to identify relationships between\nentities within a document. Current methods rely on text-based encoders and\nemploy various hand-coded pooling heuristics to aggregate information from\nentity mentions and associated contexts. In this paper, we replace these rigid\npooling functions with explicit graph relations by leveraging the intrinsic\ngraph processing capabilities of the Transformer model. We propose a joint\ntext-graph Transformer model, and a graph-assisted declarative pooling (GADePo)\nspecification of the input which provides explicit and high-level instructions\nfor information aggregation. This allows the pooling process to be guided by\ndomain-specific knowledge or desired outcomes but still learned by the\nTransformer, leading to more flexible and customizable pooling strategies. We\nextensively evaluate our method across diverse datasets and models, and show\nthat our approach yields promising results that are comparable to those\nachieved by the hand-coded pooling functions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:04:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Coman","Andrei C.",""],["Theodoropoulos","Christos",""],["Moens","Marie-Francine",""],["Henderson","James",""]]}
{"id":"2308.14424","submitter":"Asger Horn Brorholt","authors":"Asger Horn Brorholt and Peter Gj{\\o}l Jensen and Kim Guldstrand Larsen\n  and Florian Lorber and Christian Schilling","title":"Shielded Reinforcement Learning for Hybrid Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Safe and optimal controller synthesis for switched-controlled hybrid systems,\nwhich combine differential equations and discrete changes of the system's\nstate, is known to be intricately hard. Reinforcement learning has been\nleveraged to construct near-optimal controllers, but their behavior is not\nguaranteed to be safe, even when it is encouraged by reward engineering. One\nway of imposing safety to a learned controller is to use a shield, which is\ncorrect by design. However, obtaining a shield for non-linear and hybrid\nenvironments is itself intractable. In this paper, we propose the construction\nof a shield using the so-called barbaric method, where an approximate finite\nrepresentation of an underlying partition-based two-player safety game is\nextracted via systematically picked samples of the true transition function.\nWhile hard safety guarantees are out of reach, we experimentally demonstrate\nstrong statistical safety guarantees with a prototype implementation and UPPAAL\nSTRATEGO. Furthermore, we study the impact of the synthesized shield when\napplied as either a pre-shield (applied before learning a controller) or a\npost-shield (only applied after learning a controller). We experimentally\ndemonstrate superiority of the pre-shielding approach. We apply our technique\non a range of case studies, including two industrial examples, and further\nstudy post-optimization of the post-shielding approach.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:04:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Brorholt","Asger Horn",""],["Jensen","Peter Gj\u00f8l",""],["Larsen","Kim Guldstrand",""],["Lorber","Florian",""],["Schilling","Christian",""]]}
{"id":"2308.14425","submitter":"Roberta Angelini","authors":"Roberta Angelini, Laura Zulian, Andrei Fluerasu, Anders Madsen,\n  Giancarlo Ruocco and Barbara Ruzicka","title":"Dichotomic Aging Behaviour in a Colloidal Glass","comments":"5 pages, 5 figures","journal-ref":"Soft Matter 9, 10955 (2013)","doi":"10.1039/c3sm52173g","report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An unexpected dichotomic long time aging behaviour is observed in a glassy\ncolloidal clay suspension investigated by X-Ray Photon Correlation Spectroscopy\nand Dynamic Light Scattering. In the long time aging regime the intensity\nautocorrelations are non-exponential, following the Kohlrausch-Williams-Watts\nfunctional form with exponent bQ. We show that for spontaneously aged samples a\nstretched behaviour (\\beta_Q < 1) is always found. Surprisingly a compressed\nexponent (\\beta_Q > 1) appears only when the system is rejuvenated by\napplication of a shear field. In both cases the relaxation times scale as\nQ^{-1}. These observations shed light on the origin of compressed exponential\nbehaviour and helps in classifying previous results in the literature on\nanomalous dynamics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:05:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Angelini","Roberta",""],["Zulian","Laura",""],["Fluerasu","Andrei",""],["Madsen","Anders",""],["Ruocco","Giancarlo",""],["Ruzicka","Barbara",""]]}
{"id":"2308.14426","submitter":"Yevhenii Osadchuk","authors":"Yevhenii Osadchuk, Ognjen Jovanovic, Stenio M. Ranzini, Roman\n  Dischler, Vahid Aref, Darko Zibar, and Francesco Da Ros","title":"Low-complexity Samples versus Symbols-based Neural Network Receiver for\n  Channel Equalization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low-complexity neural networks (NNs) have successfully been applied for\ndigital signal processing (DSP) in short-reach intensity-modulated directly\ndetected optical links, where chromatic dispersion-induced impairments\nsignificantly limit the transmission distance. The NN-based equalizers are\nusually optimized independently from other DSP components, such as matched\nfiltering. This approach may result in lower equalization performance.\nAlternatively, optimizing a NN equalizer to perform functionalities of multiple\nDSP blocks may increase transmission reach while keeping the complexity low. In\nthis work, we propose a low-complexity NN that performs samples-to-symbol\nequalization, meaning that the NN-based equalizer includes match filtering and\ndownsampling. We compare it to a samples-to-sample equalization approach\nfollowed by match filtering and downsampling in terms of performance and\ncomputational complexity. Both approaches are evaluated using three different\ntypes of NNs combined with optical preprocessing. We numerically and\nexperimentally show that the proposed samples-to-symbol equalization approach\napplied for 32 GBd on-off keying (OOK) signals outperforms the samples-domain\nalternative keeping the computational complexity low. Additionally, the\ndifferent types of NN-based equalizers are compared in terms of performance\nwith respect to computational complexity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:05:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Osadchuk","Yevhenii",""],["Jovanovic","Ognjen",""],["Ranzini","Stenio M.",""],["Dischler","Roman",""],["Aref","Vahid",""],["Zibar","Darko",""],["Da Ros","Francesco",""]]}
{"id":"2308.14427","submitter":"Wei-Hsiang Shen","authors":"Wei-Hsiang Shen, Yu-An Lin, Pai-Chi Li, Meng-Lin Li","title":"Phase Aberration Correction with Adaptive Coherence-Weighted Point\n  Spread Function Restoration Filtering Technique","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phase aberration is an inherent side effect of ultrasound imaging due to the\nspeed of sound inhomogeneity nature of human tissues, resulting in focusing\nerror and reduced image contrast. This work introduces a phase aberration\ncorrection technique by leveraging a point spread function (PSF) restoration\nfilter. A convolutional neural network (CNN) is used to estimate\nphase-aberrated PSFs and design the restoration filter. In addition, we\nincorporate coherence index weighting, derived from the restoration filtering,\nto further suppress sidelobe energy. Evaluation using Field II-simulated\nphantoms showed clearer cyst borders and reduced sidelobe energy leakage after\nPSF restoration and filter-derived coherence weighting, leading to improvement\nin image contrast and quality.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:05:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shen","Wei-Hsiang",""],["Lin","Yu-An",""],["Li","Pai-Chi",""],["Li","Meng-Lin",""]]}
{"id":"2308.14428","submitter":"Tadashi Okazaki","authors":"Tadashi Okazaki, Douglas J. Smith","title":"3d exceptional gauge theories and boundary confinement","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We find boundary confining dualities of 3d $\\mathcal{N}=2$ supersymmetric\ngauge theories with exceptional gauge groups. The half-indices which enumerate\nthe boundary BPS local operators in the presence of Neumann and Dirichlet\nboundary conditions for gauge fields are identified with the Askey-Wilson type\n$q$-beta integrals and Macdonald type sums respectively. New conjectural\nidentities of $E_6$ and $E_7$ integrals and sums are derived from the boundary\nconfining dualities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:06:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Okazaki","Tadashi",""],["Smith","Douglas J.",""]]}
{"id":"2308.14429","submitter":"Xi Yan","authors":"Xi Yan, Cedric M\\\"oller and Ricardo Usbeck","title":"Biomedical Entity Linking with Triple-aware Pre-Training","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Linking biomedical entities is an essential aspect in biomedical natural\nlanguage processing tasks, such as text mining and question answering. However,\na difficulty of linking the biomedical entities using current large language\nmodels (LLM) trained on a general corpus is that biomedical entities are\nscarcely distributed in texts and therefore have been rarely seen during\ntraining by the LLM. At the same time, those LLMs are not aware of high level\nsemantic connection between different biomedical entities, which are useful in\nidentifying similar concepts in different textual contexts. To cope with\naforementioned problems, some recent works focused on injecting knowledge graph\ninformation into LLMs. However, former methods either ignore the relational\nknowledge of the entities or lead to catastrophic forgetting. Therefore, we\npropose a novel framework to pre-train the powerful generative LLM by a corpus\nsynthesized from a KG. In the evaluations we are unable to confirm the benefit\nof including synonym, description or relational information.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:06:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yan","Xi",""],["M\u00f6ller","Cedric",""],["Usbeck","Ricardo",""]]}
{"id":"2308.14430","submitter":"Shengpeng Ji","authors":"Shengpeng Ji, Jialong Zuo, Minghui Fang, Ziyue Jiang, Feiyang Chen,\n  Xinyu Duan, Baoxing Huai, Zhou Zhao","title":"TextrolSpeech: A Text Style Control Speech Corpus With Codec Language\n  Text-to-Speech Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, there has been a growing interest in the field of controllable\nText-to-Speech (TTS). While previous studies have relied on users providing\nspecific style factor values based on acoustic knowledge or selecting reference\nspeeches that meet certain requirements, generating speech solely from natural\ntext prompts has emerged as a new challenge for researchers. This challenge\narises due to the scarcity of high-quality speech datasets with natural text\nstyle prompt and the absence of advanced text-controllable TTS models. In light\nof this, 1) we propose TextrolSpeech, which is the first large-scale speech\nemotion dataset annotated with rich text attributes. The dataset comprises\n236,220 pairs of style prompt in natural text descriptions with five style\nfactors and corresponding speech samples. Through iterative experimentation, we\nintroduce a multi-stage prompt programming approach that effectively utilizes\nthe GPT model for generating natural style descriptions in large volumes. 2)\nFurthermore, to address the need for generating audio with greater style\ndiversity, we propose an efficient architecture called Salle. This architecture\ntreats text controllable TTS as a language model task, utilizing audio codec\ncodes as an intermediate representation to replace the conventional\nmel-spectrogram. Finally, we successfully demonstrate the ability of the\nproposed model by showing a comparable performance in the controllable TTS\ntask. Audio samples are available at https://sall-e.github.io/\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:06:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ji","Shengpeng",""],["Zuo","Jialong",""],["Fang","Minghui",""],["Jiang","Ziyue",""],["Chen","Feiyang",""],["Duan","Xinyu",""],["Huai","Baoxing",""],["Zhao","Zhou",""]]}
{"id":"2308.14431","submitter":"Christoph Smoch","authors":"Martin Rumpf, Stefan Simon, and Christoph Smoch","title":"Two-Scale Finite Element Approximation of a Homogenized Plate Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper studies the discretization of a homogenization and dimension\nreduction model for the elastic deformation of microstructured thin plates\nproposed by Hornung, Neukamm, and Vel\\v{c}i\\'c in 2014. Thereby, a nonlinear\nbending energy is based on a homogenized quadratic form which acts on the\nsecond fundamental form associated with the elastic deformation. Convergence is\nproven for a multi-affine finite element discretization of the involved\nthree-dimensional microscopic cell problems and a discrete Kirchhoff triangle\ndiscretization of the two-dimensional isometry-constrained macroscopic problem.\nFinally, the convergence properties are numerically verified in selected test\ncases and qualitatively compared with deformation experiments for\nmicrostructured sheets of paper.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:09:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rumpf","Martin",""],["Simon","Stefan",""],["Smoch","Christoph",""]]}
{"id":"2308.14432","submitter":"Yongqing Cai","authors":"Zheng Shu, and Yongqing Cai","title":"Thickness-dependent catalytic activity of hydrogen evolution based on\n  single atomic catalyst of Pt above MXene","comments":null,"journal-ref":"J. Phys.: Condens. Matter 35, 204001 (2023)","doi":"10.1088/1361-648X/acc22a","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hydrogen as the cleanest energy carrier is a promising alternative renewable\nresource to fossil fuels. There is an ever-increasing interest in exploring\nefficient and cost-effective approaches of hydrogen production. Recent\nexperiments have shown that single platinum atom immobilized on the metal\nvacancies of MXenes allows a high-efficient hydrogen evolution reaction (HER).\nHere using ab initio calculations, we design a series of substitutional\nPt-doped Tin+1CnTx (Tin+1CnTx-PtSA) with different thicknesses and terminations\n(n = 1, 2 and 3, Tx = O, F and OH), and investigate the quantum-confinement\neffect on the HER catalytic performance. Surprisingly, we reveal a strong\nthickness effect of the MXene layer on the HER performance. Amongst the various\nsurface-terminated derivatives, Ti2CF2-PtSA and Ti2CH2O2-PtSA are found to be\nthe best HER catalysts with the change of Gibbs free energy {\\Delta}G*H ~ 0 eV,\ncomplying with the thermoneutral condition. The ab initio molecular dynamics\nsimulations reveal that Ti2CF2-PtSA and Ti2CH2O2-PtSA possess a good\nthermodynamic stability. The present work shows that the HER catalytic activity\nof the MXene is not solely governed by the local environment of the surface\nsuch as Pt single atom. We point out the critical role of thickness control and\nsurface decoration of substrate in achieving a high-performance HER catalytical\nactivity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:17:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shu","Zheng",""],["Cai","Yongqing",""]]}
{"id":"2308.14433","submitter":"Lennart Gehrmann","authors":"Henri Darmon, Lennart Gehrmann, Michael Lipnowski","title":"Rigid meromorphic cocycles for orthogonal groups","comments":"67 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rigid meromorphic cocycles are defined in the setting of orthogonal groups of\narbitrary real signature and constructed in some instances via a $p$-adic\nanalogue of Borcherds' singular theta lift. The values of rigid meromorphic\ncocycles at special points of an associated $p$-adic symmetric space are then\nconjectured to belong to class fields of suitable global reflex fields,\nsuggesting an eventual framework for explicit class field theory beyond the\nsetting of CM fields explored in the treatise of Shimura and Taniyama.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:20:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Darmon","Henri",""],["Gehrmann","Lennart",""],["Lipnowski","Michael",""]]}
{"id":"2308.14434","submitter":"Abdalsamad Keramatfar","authors":"Atieh Bakhshandeh, Abdalsamad Keramatfar, Amir Norouzi, and Mohammad\n  Mahdi Chekidehkhoun","title":"Using ChatGPT as a Static Application Security Testing Tool","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, artificial intelligence has had a conspicuous growth in\nalmost every aspect of life. One of the most applicable areas is security code\nreview, in which a lot of AI-based tools and approaches have been proposed.\nRecently, ChatGPT has caught a huge amount of attention with its remarkable\nperformance in following instructions and providing a detailed response.\nRegarding the similarities between natural language and code, in this paper, we\nstudy the feasibility of using ChatGPT for vulnerability detection in Python\nsource code. Toward this goal, we feed an appropriate prompt along with\nvulnerable data to ChatGPT and compare its results on two datasets with the\nresults of three widely used Static Application Security Testing tools (Bandit,\nSemgrep and SonarQube). We implement different kinds of experiments with\nChatGPT and the results indicate that ChatGPT reduces the false positive and\nfalse negative rates and has the potential to be used for Python source code\nvulnerability detection.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:21:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bakhshandeh","Atieh",""],["Keramatfar","Abdalsamad",""],["Norouzi","Amir",""],["Chekidehkhoun","Mohammad Mahdi",""]]}
{"id":"2308.14435","submitter":"Asim Ghosh Mr","authors":"Asim Ghosh and Bikas K. Chakrabarti","title":"Do Successful Researchers Reach the Self-Organized Critical Point?","comments":"Invited contribution to Galam Special Issue in Physics (MDPI)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DL physics.soc-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The index of success of the researchers are now mostly measured using the\nHirsch index ($h$). Our recent precise demonstration, that statistically $h\n\\sim \\sqrt {N_c} \\sim \\sqrt {N_p}$, where $N_p$ and $N_c$ denote respectively\nthe total number of publications and total citations for the researcher,\nsuggests that average number of citations per paper ($N_c/N_p$), and hence $h$,\nare statistical numbers (Dunbar numbers) depending on the community or network\nto which the researcher belongs. We show here, extending our earlier\nobservations, that the indications of success are not reflected by the total\ncitations $N_c$, rather by the inequalities among citations from publications\nto publications. Specifically, we show that for very successful authors, the\nyearly variations in the Gini index ($g$, giving the average inequality of\ncitations for the publications) and the Kolkata index ($k$, giving the fraction\nof total citations received by the top $1 - k$ fraction of publications; $k =\n0.80$ corresponds to Pareto's 80/20 law) approach each other to $g = k \\simeq\n0.82$, signaling a precursor for the arrival of (or departure from) the\nSelf-Organized Critical (SOC) state of his/her publication statistics.\nAnalyzing the citation statistics (from Google Scholar) of thirty successful\nscientists throughout their recorded publication history, we find that the $g$\nand $k$ for very successful among them (mostly Nobel Laureates, highest rank\nStanford Cite-Scorers, and a few others) reach and hover just above (and then)\nbelow that $g = k \\simeq 0.82$ mark, while for others they remain below that\nmark. We also find that for all the lower (than the SOC mark 0.82) values of\n$k$ and $g$ fit a linear relationship $k = 1/2 + cg$, with $c = 0.39$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:21:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghosh","Asim",""],["Chakrabarti","Bikas K.",""]]}
{"id":"2308.14436","submitter":"Guanting Dong","authors":"Guanting Dong, Rumei Li, Sirui Wang, Yupeng Zhang, Yunsen Xian and\n  Weiran Xu","title":"Bridging the KB-Text Gap: Leveraging Structured Knowledge-aware\n  Pre-training for KBQA","comments":"Accepted as a short paper at CIKM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowledge Base Question Answering (KBQA) aims to answer natural language\nquestions with factual information such as entities and relations in KBs.\nHowever, traditional Pre-trained Language Models (PLMs) are directly\npre-trained on large-scale natural language corpus, which poses challenges for\nthem in understanding and representing complex subgraphs in structured KBs. To\nbridge the gap between texts and structured KBs, we propose a Structured\nKnowledge-aware Pre-training method (SKP). In the pre-training stage, we\nintroduce two novel structured knowledge-aware tasks, guiding the model to\neffectively learn the implicit relationship and better representations of\ncomplex subgraphs. In downstream KBQA task, we further design an efficient\nlinearization strategy and an interval attention mechanism, which assist the\nmodel to better encode complex subgraphs and shield the interference of\nirrelevant subgraphs during reasoning respectively. Detailed experiments and\nanalyses on WebQSP verify the effectiveness of SKP, especially the significant\nimprovement in subgraph retrieval (+4.08% H@10).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:22:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Guanting",""],["Li","Rumei",""],["Wang","Sirui",""],["Zhang","Yupeng",""],["Xian","Yunsen",""],["Xu","Weiran",""]]}
{"id":"2308.14437","submitter":"Yanyang Wang","authors":"Weiwen Wu, Yanyang Wang","title":"Data-iterative Optimization Score Model for Stable Ultra-Sparse-View CT\n  Reconstruction","comments":"11 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Score-based generative models (SGMs) have gained prominence in sparse-view CT\nreconstruction for their precise sampling of complex distributions. In\nSGM-based reconstruction, data consistency in the score-based diffusion model\nensures close adherence of generated samples to observed data distribution,\ncrucial for improving image quality. Shortcomings in data consistency\ncharacterization manifest in three aspects. Firstly, data from the optimization\nprocess can lead to artifacts in reconstructed images. Secondly, it often\nneglects that the generation model and original data constraints are\nindependently completed, fragmenting unity. Thirdly, it predominantly focuses\non constraining intermediate results in the inverse sampling process, rather\nthan ideal real images. Thus, we propose an iterative optimization data scoring\nmodel. This paper introduces the data-iterative optimization score-based model\n(DOSM), integrating innovative data consistency into the Stochastic\nDifferential Equation, a valuable constraint for ultra-sparse-view CT\nreconstruction. The novelty of this data consistency element lies in its sole\nreliance on original measurement data to confine generation outcomes,\neffectively balancing measurement data and generative model constraints.\nAdditionally, we pioneer an inference strategy that traces back from current\niteration results to ideal truth, enhancing reconstruction stability. We\nleverage conventional iteration techniques to optimize DOSM updates.\nQuantitative and qualitative results from 23 views of numerical and clinical\ncardiac datasets demonstrate DOSM's superiority over other methods. Remarkably,\neven with 10 views, our method achieves excellent performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:23:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wu","Weiwen",""],["Wang","Yanyang",""]]}
{"id":"2308.14438","submitter":"Peiwen Wu","authors":"Chengcheng Han, Peiwen Wu, Jin Min Yang, Mengchao Zhang","title":"Freeze-in bino dark matter in high scale supersymmetry","comments":"21 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore a scenario of high scale supersymmetry where all supersymmetric\nparticles except gauginos stay at a high energy scale $M_{\\rm SUSY}$ which is\nmuch larger than the reheating temperature $T_\\text{RH}$. The dark matter is\ndominated by bino component with mass around the electroweak scale and the\nobserved relic abundance is mainly generated by the freeze-in process during\nthe early universe. Considering the various constraints, we identify two\navailable scenarios in which the supersymmetric sector at an energy scale below\n$T_\\text{RH}$ consists of: a) bino; b) bino and wino. Typically, for a bino\nmass around 0.1-1 TeV and a wino mass around 2 TeV, we find that $M_{\\rm SUSY}$\nshould be around $10^{12-14}$ GeV with $T_\\text{RH}$ around $10^{4-6}$ GeV.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:24:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Han","Chengcheng",""],["Wu","Peiwen",""],["Yang","Jin Min",""],["Zhang","Mengchao",""]]}
{"id":"2308.14439","submitter":"Yongqing Cai","authors":"Zheng Shu, Hongfei Chen, Xing Liu, Huaxian Jia, Hejin Yan, Yongqing\n  Cai","title":"High-throughput screening of heterogeneous transition metal dual-atom\n  catalysts by synergistic effect for nitrate reduction to ammonia","comments":null,"journal-ref":"Adv. Funct. Mater. 2301493 (2023)","doi":"10.1002/adfm.202301493","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nitrate reduction to ammonia has attracted much attention for nitrate (NO3-)\nremoval and ammonia (NH3) production. Identifying promising catalyst for active\nnitrate electroreduction reaction (NO3RR) is critical to realize efficient\nupscaling synthesis of NH3 under low-temperature condition. For this purpose,\nby means of spin-polarized first-principles calculations, the NO3RR performance\non a series of graphitic carbon nitride (g-CN) supported double-atom catalysts\n(denoted as M1M2@g-CN) are systematically investigated. The synergistic effect\nof heterogeneous dual-metal sites can bring out tunable activity and\nselectivity for NO3RR. Amongst 21 candidates examined, FeMo@g-CN and CrMo@g-CN\npossess a high performance with low limiting potentials of -0.34 and -0.39 V,\nrespectively. The activities can be attributed to a synergistic effect of the\nM1M2 dimer d orbitals coupling with the anti-bonding orbital of NO3-. The\ndissociation of deposited FeMo and CrMo dimers into two separated monomers is\nproved to be difficult, ensuring the kinetic stability of M1M2@g-CN.\nFurthermore, the dual-metal decorated on g-CN significantly reduces the bandgap\nof g-CN and broadens the adsorption window of visible light, implying its great\npromise for photocatalysis. This work opens a new avenue for future theoretical\nand experimental design related to NO3RR photo-/electrocatalysts.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:25:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shu","Zheng",""],["Chen","Hongfei",""],["Liu","Xing",""],["Jia","Huaxian",""],["Yan","Hejin",""],["Cai","Yongqing",""]]}
{"id":"2308.14440","submitter":"Jesus Clemente-Gallardo","authors":"J. L. Alonso, C. Bouthelier-Madre, J. Clemente-Gallardo, D.\n  Mart\\'inez-Crespo and J. Pomar","title":"Effective nonlinear Ehrenfest hybrid quantum-classical dynamics","comments":"21 pages. Minor correction in the list of affiliations","journal-ref":"European Physical Journal Plus 138 649, 2023","doi":"10.1140/epjp/s13360-023-04266-w","report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The definition of a consistent evolution equation for statistical hybrid\nquantum-classical systems is still an open problem. In this paper we analyze\nthe case of Ehrenfest dynamics on systems defined by a probability density and\nidentify the relations of the non-linearity of the dynamics with the\nobstructions to define a consistent dynamics for the first quantum moment of\nthe distribution. This first quantum moment represents the physical states as a\nfamily of classically-parametrized density matrices $\\hat \\rho(\\xi)$, for $\\xi$\na classical point; and it is the most common representation of hybrid systems\nin the literature. Due to this obstruction, we consider higher order quantum\nmoments, and argue that only a finite number of them are physically measurable.\nBecause of this, we propose an effective solution for the hybrid dynamics\nproblem based on approximating the distribution by those moments and\nrepresenting the states by them.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:25:36 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:53:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alonso","J. L.",""],["Bouthelier-Madre","C.",""],["Clemente-Gallardo","J.",""],["Mart\u00ednez-Crespo","D.",""],["Pomar","J.",""]]}
{"id":"2308.14441","submitter":"Matthias K\\\"onig","authors":"Martin Beneke, Matthias K\\\"onig, Martin Link","title":"The Inverted Pendulum as a Classical Analog of the EFT Paradigm","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"TUM-HEP-1471/23","categories":"hep-ph physics.class-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The inverted pendulum is a mechanical system with a rapidly oscillating pivot\npoint. Using techniques similar in spirit to the methodology of effective field\ntheories, we derive an effective Lagrangian that allows for the systematic\ncomputation of corrections to the so-called Kapitza equation. The derivation of\nthe effective potential of the system requires non-trivial matching conditions,\nwhich need to be determined order by order in the power-counting of the\nproblem. The convergence behavior of the series is investigated on the basis of\nhigh-order results obtained by this method.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:26:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Beneke","Martin",""],["K\u00f6nig","Matthias",""],["Link","Martin",""]]}
{"id":"2308.14442","submitter":"Saniya Khan","authors":"Pascale Garaud, Saniya Khan, Justin M. Brown","title":"The combined effects of vertical and horizontal shear instabilities","comments":"25 pages, 8 figures, Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Shear instabilities can be the source of significant amounts of turbulent\nmixing in stellar radiative zones. Past attempts at modeling their effects\n(either theoretically or using numerical simulations) have focused on idealized\ngeometries where the shear is either purely vertical or purely horizontal. In\nstars, however, the shear can have arbitrary directions with respect to\ngravity. In this work, we use direct numerical simulations to investigate the\nnonlinear saturation of shear instabilities in a stably stratified fluid, where\nthe shear is sinusoidal in the horizontal direction, and either constant or\nsinusoidal in the vertical direction. We find that, in the parameter regime\nstudied here (non-diffusive, fully turbulent flow), the mean vertical shear\ndoes not play any role in controlling the dynamics of the resulting turbulence\nunless its Richardson number is smaller than one (approximately). As most\nstellar radiative regions have a Richardson number much greater than one, our\nresult implies that the vertical shear can essentially be ignored in the\ncomputation of the vertical mixing coefficient associated with shear\ninstabilities for the purpose of stellar evolution calculations, even when it\nis much larger than the horizontal shear (as in the solar tachocline, for\ninstance).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:27:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Garaud","Pascale",""],["Khan","Saniya",""],["Brown","Justin M.",""]]}
{"id":"2308.14443","submitter":"Serafino Cicerone","authors":"Serafino Cicerone, Alessia Di Fonso, Gabriele Di Stefano, Alfredo\n  Navarra, Francesco Piselli","title":"Mutual visibility in hypercube-like graphs","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Let $G$ be a graph and $X\\subseteq V(G)$. Then, vertices $x$ and $y$ of $G$\nare $X$-visible if there exists a shortest $u,v$-path where no internal\nvertices belong to $X$. The set $X$ is a mutual-visibility set of $G$ if every\ntwo vertices of $X$ are $X$-visible, while $X$ is a total mutual-visibility set\nif any two vertices from $V(G)$ are $X$-visible. The cardinality of a largest\nmutual-visibility set (resp. total mutual-visibility set) is the\nmutual-visibility number (resp. total mutual-visibility number) $\\mu(G)$ (resp.\n$\\mu_t(G)$) of $G$. It is known that computing $\\mu(G)$ is an NP-complete\nproblem, as well as $\\mu_t(G)$. In this paper, we study the (total)\nmutual-visibility in hypercube-like networks (namely, hypercubes,\ncube-connected cycles, and butterflies). Concerning computing $\\mu(G)$, we\nprovide approximation algorithms for both hypercubes and cube-connected cycles,\nwhile we give an exact formula for butterflies. Concerning computing $\\mu_t(G)$\n(in the literature, already studied in hypercubes), we provide exact formulae\nfor both cube-connected cycles and butterflies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:30:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cicerone","Serafino",""],["Di Fonso","Alessia",""],["Di Stefano","Gabriele",""],["Navarra","Alfredo",""],["Piselli","Francesco",""]]}
{"id":"2308.14444","submitter":"Stefano Pezzuto","authors":"S. Pezzuto, A. Coletta, R. S. Klessen, E. Schisano, M. Benedettini, D.\n  Elia, S. Molinari, J. D. Soler, A. Traficante","title":"A new tool to derive simultaneously exponent and extremes of power-law\n  distributions","comments":"Accepted for press in MNRAS, main journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many experimental quantities show a power-law distribution $p(x)\\propto\nx^{-\\alpha}$. In astrophysics, examples are: size distribution of dust grains\nor luminosity function of galaxies. Such distributions are characterized by the\nexponent $\\alpha$ and by the extremes $x_\\text{min}$ $x_\\text{max}$ where the\ndistribution extends. There are no mathematical tools that derive the three\nunknowns at the same time. In general, one estimates a set of $\\alpha$\ncorresponding to different guesses of $x_\\text{min}$ $x_\\text{max}$. Then, the\nbest set of values describing the observed data is selected a posteriori. In\nthis paper, we present a tool that finds contextually the three parameters\nbased on simple assumptions on how the observed values $x_i$ populate the\nunknown range between $x_\\text{min}$ and $x_\\text{max}$ for a given $\\alpha$.\nOur tool, freely downloadable, finds the best values through a non-linear\nleast-squares fit. We compare our technique with the maximum likelihood\nestimators for power-law distributions, both truncated and not. Through\nsimulated data, we show for each method the reliability of the computed\nparameters as a function of the number $N$ of data in the sample. We then apply\nour method to observed data to derive: i) the slope of the core mass function\nin the Perseus star-forming region, finding two power-law distributions:\n$\\alpha=2.576$ between $1.06\\,M_{\\sun}$ and $3.35\\,M_{\\sun}$, $\\alpha=3.39$\nbetween $3.48\\,M_{\\sun}$ and $33.4\\,M_{\\sun}$; ii) the slope of the\n$\\gamma$-ray spectrum of the blazar J0011.4+0057, extracted from the Fermi-LAT\narchive. For the latter case, we derive $\\alpha=2.89$ between 1,484~MeV and\n28.7~GeV; then we derive the time-resolved slopes using subsets 200 photons\neach.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:30:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pezzuto","S.",""],["Coletta","A.",""],["Klessen","R. S.",""],["Schisano","E.",""],["Benedettini","M.",""],["Elia","D.",""],["Molinari","S.",""],["Soler","J. D.",""],["Traficante","A.",""]]}
{"id":"2308.14445","submitter":"Spencer Jolly","authors":"Spencer W. Jolly and Pascal Kockaert","title":"Coupling to multi-mode waveguides with space-time shaped free-space\n  pulses","comments":"22 pages, 17 figures, version originally submitted","journal-ref":null,"doi":"10.1088/2040-8986/acc673","report-no":null,"categories":"physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Guided wave optics, including most prominently fiber optics and integrated\nphotonics, very often considers only one or very few spatial modes of the\nwaveguides. Despite being known and utilized for decades, multi-mode guided\nwave optics is currently rapidly increasing in parallel with technological\nimprovements and better simulation tools. The physics of multi-mode\ninteractions are usually driven by some initial energy distribution in a number\nof spatial modes. In this work we introduce how, with free-space input beams\nhaving space-time couplings, the different modes can be excited with different\ncomplex frequency or time profiles. We cover fundamentals, the coupling with a\nfew simple space-time aberrations, different waveguides, and a number of\ntechnical nuances. This concept of space-time initial conditions in multi-mode\nwaveguides will provide yet another tool to study the rich nonlinear\ninteractions in such systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:31:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jolly","Spencer W.",""],["Kockaert","Pascal",""]]}
{"id":"2308.14446","submitter":"Piotr Bozek","authors":"Tribhuban Parida and Piotr Bozek and Sandeep Chatterjee","title":"Charm balance function in relativistic heavy-ion collisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th hep-ph nucl-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate the balance function for charm in relativistic heavy-ion\ncollisions. The distribution of pairs of charm-anticharm quarks produced in\nhard processes in the early stages of the nucleus-nucleus collision evolves in\nthe dense fireball formed in the collision. The evolution of the dense matter\nis described using a relativistic viscous hydrodynamic model and the quark\ndiffusion with a Langevin equation. The evolution of the charm quark balance\nfunction from the formation of the charm-anticharm pair up to the freeze-out\ntraces the partial thermalization of the heavy quarks in the dense matter. For\nthe balance function in azimuthal angle we reproduce the collimation effect due\nto the transverse flow. The evolution in rapidity shows the thermalization of\nthe longitudinal velocity of the quark in the fluid. We provide predictions for\nthe one and two-dimensional balance functions for $D^0$-$\\bar{D^0}$ mesons\nproduced in ultarelativistic Pb+Pb collisions at $\\sqrt{s_{NN}}=5.02$ TeV. The\nshape of the charm balance function in relative rapidity is sensitive to the\nrescattering of heavy quarks in the early stages of the collision, while the\nshape of the balance function in azimuthal angle is sensitive to the\nrescattering in the latter stages.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:32:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Parida","Tribhuban",""],["Bozek","Piotr",""],["Chatterjee","Sandeep",""]]}
{"id":"2308.14447","submitter":"Roberta Angelini","authors":"Flavio Augusto de Melo Marques, Roberta Angelini, Emanuela Zaccarelli,\n  Bela Farago, Beatrice Ruta, Giancarlo Ruocco, Barbara Ruzicka","title":"Structural and microscopic relaxations in a colloidal glass","comments":"6 pages, 4 figures","journal-ref":"Soft Matter 11, 466-471 (2015)","doi":"10.1039/c4sm02010c","report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aging dynamics of a colloidal glass has been studied by multiangle\nDynamic Light Scattering, Neutron Spin Echo, X-ray Photon Correlation\nSpectroscopy and Molecular Dynamics simulations. The two relaxation processes,\nmicroscopic (fast) and structural (slow), have been investigated in an\nunprecedentedly wide range of time and length scales covering both ergodic and\nnonergodic regimes. The microscopic relaxation time remains diffusive at all\nlength scales across the glass transition scaling with wavevector Q as Q^{-2}.\nThe length-scale dependence of structural relaxation time changes from\ndiffusive, characterized by a Q^{-2}-dependence in the early stages of aging,\nto Q^{-1}- dependence in the full aging regime which marks a discontinuous\nhopping dynamics. Both regimes are associated with a stretched behaviour of the\ncorrelation functions. We expect these findings to provide a general\ndescription of both relaxations across the glass transition.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:33:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Marques","Flavio Augusto de Melo",""],["Angelini","Roberta",""],["Zaccarelli","Emanuela",""],["Farago","Bela",""],["Ruta","Beatrice",""],["Ruocco","Giancarlo",""],["Ruzicka","Barbara",""]]}
{"id":"2308.14448","submitter":"Yicheng Zhong","authors":"Yicheng Zhong, Huawei Wei, Peiji Yang, Zhisheng Wang","title":"ExpCLIP: Bridging Text and Facial Expressions via Semantic Alignment","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The objective of stylized speech-driven facial animation is to create\nanimations that encapsulate specific emotional expressions. Existing methods\noften depend on pre-established emotional labels or facial expression\ntemplates, which may limit the necessary flexibility for accurately conveying\nuser intent. In this research, we introduce a technique that enables the\ncontrol of arbitrary styles by leveraging natural language as emotion prompts.\nThis technique presents benefits in terms of both flexibility and\nuser-friendliness. To realize this objective, we initially construct a\nText-Expression Alignment Dataset (TEAD), wherein each facial expression is\npaired with several prompt-like descriptions.We propose an innovative automatic\nannotation method, supported by Large Language Models (LLMs), to expedite the\ndataset construction, thereby eliminating the substantial expense of manual\nannotation. Following this, we utilize TEAD to train a CLIP-based model, termed\nExpCLIP, which encodes text and facial expressions into semantically aligned\nstyle embeddings. The embeddings are subsequently integrated into the facial\nanimation generator to yield expressive and controllable facial animations.\nGiven the limited diversity of facial emotions in existing speech-driven facial\nanimation training data, we further introduce an effective Expression Prompt\nAugmentation (EPA) mechanism to enable the animation generator to support\nunprecedented richness in style control. Comprehensive experiments illustrate\nthat our method accomplishes expressive facial animation generation and offers\nenhanced flexibility in effectively conveying the desired style.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:35:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhong","Yicheng",""],["Wei","Huawei",""],["Yang","Peiji",""],["Wang","Zhisheng",""]]}
{"id":"2308.14449","submitter":"Ye-Fei Yuan Dr.","authors":"Yan Luo, Xiao-Jun Wu, Shu-Rui Zhang (USTC), Jian-Min Wang (IHEP), Luis\n  C. Ho (PKU) and Ye-Fei Yuan (USTC)","title":"White Dwarf--White Dwarf collisions in AGN discs via close encounters","comments":"9 pages, 10 figures","journal-ref":"MNRAS, 524, 6015-6023 (2023)","doi":"10.1093/mnras/stad2188","report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  White dwarfs (WDs) in active galactic nucleus (AGNs) discs might migrate to\nthe inner radii of the discs and form restricted three-body systems with two\nWDs moving around the central supermassive black hole (SMBH) in close orbits.\nThese systems could be dynamical unstable, which can lead to very close\nencounters or direct collisions. In this work, we use N-body simulations to\nstudy the evolution of such systems with the different initial orbital\nseparation $p$, relative orbital inclination $\\Delta{i}$ and SMBH mass $M$. It\nis found that the close encounters of WDs mainly occur at $1.1R_{\\rm H}\n\\lesssim p \\lesssim 2\\sqrt{3}R_{\\rm H}$, where $R_{\\rm H}$ is the mutual Hill\nradius. For $p<1.1R_{\\rm H}$, the majority of WDs move in horseshoe or tadpole\norbits, and only few of them with small initial orbital phase difference\nundergo close encounters. For $p=3.0R_{\\rm H}$, WD-WD collisions occur in most\nof the samples within a time of $10^5P_1$, and considerable collisions occur\nwithin a time of $t<62P_1$ for small orbital radii, where $P_1$ is the orbital\nperiod. The peak of the closest separation distribution increase and the WD-WD\ncollision fraction decreases with an increase of the relative inclination. The\nclosest separation distribution is similar in cases with the different SMBH\nmass, but the WD-WD collision fraction decreases as the mass of SMBHs\nincreases. According to our estimation, the event rate of the cosmic WD-WD\ncollision in AGN discs is about $300{\\rm Gpc^{-3}yr^{-1}}$, roughly $1\\%$ of\nthe one of the observed type Ia supernova. The corresponding electromagnetic\nemission signals can be observed by large surveys of AGNs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:41:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Luo","Yan","","USTC"],["Wu","Xiao-Jun","","USTC"],["Zhang","Shu-Rui","","USTC"],["Wang","Jian-Min","","IHEP"],["Ho","Luis C.","","PKU"],["Yuan","Ye-Fei","","USTC"]]}
{"id":"2308.14450","submitter":"Faezeh Nasrabadi","authors":"Faezeh Nasrabadi, Robert k\\\"unnemann, Hamed Nemati","title":"CryptoBap: A Binary Analysis Platform for Cryptographic Protocols","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce CryptoBap, a platform to verify weak secrecy and authentication\nfor the (ARMv8 and RISC-V) machine code of cryptographic protocols. We achieve\nthis by first transpiling the binary of protocols into an intermediate\nrepresentation and then performing a crypto-aware symbolic execution to\nautomatically extract a model of the protocol that represents all its execution\npaths. Our symbolic execution resolves indirect jumps and supports bounded\nloops using the loop-summarization technique, which we fully automate. The\nextracted model is then translated into models amenable to automated\nverification via ProVerif and CryptoVerif using a third-party toolchain. We\nprove the soundness of the proposed approach and used CryptoBap to verify\nmultiple case studies ranging from toy examples to real-world protocols,\nTinySSH, an implementation of SSH, and WireGuard, a modern VPN protocol.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:41:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nasrabadi","Faezeh",""],["k\u00fcnnemann","Robert",""],["Nemati","Hamed",""]]}
{"id":"2308.14451","submitter":"Chung-Shiang Mei","authors":"Chung-Shiang Mei and Meng-Lin Li","title":"Improved Row-Column-Addressed Array Imaging by Leveraging Ghost Echoes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Among various choices of 2-D ultrasound transducer arrays, the\nrow-column-addressed (RCA) 2-D array has shown its promise for 3-D imaging.\nHowever, RCA suffers from notable edge effects and thus receives ghost echoes,\nwhich result in ghost artifacts showing in the volumetric image. In this\nresearch, rather than discarding these ghost echoes, we consider them as\nsupportive signals and incorporate them into a postfiltering-based method to\nenhance the RCA imaging quality. Field II simulation and results of a single\nscatterer are presented in this work. The strongest ghost artifact is\nsuppressed by 23 dB and the -6 dB lateral resolution is improved from 1.06 to\n0.81 mm. The proposed method shows promising results in suppressing ghost\nartifacts and enhancing lateral resolution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:42:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mei","Chung-Shiang",""],["Li","Meng-Lin",""]]}
{"id":"2308.14452","submitter":"Kevin Moerman","authors":"Mahtab Vafaeefar, Kevin M. Moerman, Ted J. Vaughan","title":"Experimental and Computational Analysis of Energy Absorption\n  Characteristics of Three Biomimetic Lattice Structures Under Compression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The objective of this study is to evaluate the mechanical properties and\nenergy absorption characteristics of the gyroid, dual-lattice and spinodoid\nstructures, as biomimetic lattices, through finite element analysis and\nexperimental characterisation. As part of the study, gyroid and dual-lattice\nstructures at 10 percent volume fraction were 3D-printed using an elastic\nresin, and mechanically tested under uniaxial compression. Computational models\nwere calibrated to the observed experimental data and the response of higher\nvolume fraction structures were simulated in an explicit finite element solver.\nStress-strain data of groups of lattices at different volume fractions were\nstudied and energy absorption parameters including total energy absorbed per\nunit volume, energy absorption efficiency and onset of densification strain\nwere calculated. Also, the structures were characterized into bending-dominant\nand stretch-dominant structures, according to their nodal connectivity and\nGibson-and-Ashby's law. The results of the study showed that the dual-lattice\nis capable of absorbing more energy at each volume fraction cohort. However,\ngyroid structures showed higher energy absorption efficiency and the onset of\ndensification at higher strains. The spinodoid structure was found to be the\npoorest structure in terms of energy absorption, specifically at low volume\nfractions. Also, the results showed that the dual-lattice was a stretch\ndominated structure, while the gyroid structure was a bending dominated\nstructure, which may be a reason that it is a better candidate for energy\nabsorption applications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:42:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vafaeefar","Mahtab",""],["Moerman","Kevin M.",""],["Vaughan","Ted J.",""]]}
{"id":"2308.14453","submitter":"Nicholas Stephen Manton","authors":"N.S.Manton","title":"Integration Theory for Kinks and Sphalerons in One Dimension","comments":"24 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The static kink, sphaleron and kink chain solutions for a single scalar field\n$\\phi$ in one spatial dimension are reconsidered. By integration of the\nEuler--Lagrange equation, or through the Bogomolny argument, one finds that\neach of these solutions obeys a first-order field equation, an autonomous ODE\nthat can always be formally integrated. We distinguish the BPS case, where the\nrequired integral is along a contour in the $\\phi$-plane, from the semi-BPS\ncase, where the integral is along a contour in the Riemann surface\ndouble-covering the $\\phi$-plane, and is generally more complicated.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:43:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Manton","N. S.",""]]}
{"id":"2308.14454","submitter":"Arijit Manna","authors":"Arijit Manna, Sabyasachi Pal, Serena Viti, Sekhar Sinha","title":"Identification of the simplest sugar-like molecule glycolaldehyde\n  towards the hot molecular core G358.93-0.03 MM1","comments":"12 pages, 4 figures, published in Monthly Notices of the Royal\n  Astronomical Society (MNRAS)","journal-ref":"MNRAS, 525, 2229-2240 (2023)","doi":"10.1093/mnras/stad2185","report-no":null,"categories":"astro-ph.GA physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Glycolaldehyde (CH$_{2}$OHCHO) is the simplest monosaccharide sugar in the\ninterstellar medium, and it is directly involved in the origin of life via the\n'RNA world' hypothesis. We present the first detection of glycolaldehyde\n(CH$_{2}$OHCHO) towards the hot molecular core G358.93-0.03 MM1 using the\nAtacama Large Millimeter/Submillimeter Array (ALMA). The calculated column\ndensity of CH$_{2}$OHCHO towards G358.93-0.03 MM1 is\n(1.52$\\pm$0.9)$\\times$10$^{16}$ cm$^{-2}$ with an excitation temperature of\n300$\\pm$68.5 K. The derived fractional abundance of CH$_{2}$OHCHO with respect\nto H$_{2}$ is (4.90$\\pm$2.92)$\\times$10$^{-9}$, which is consistent with that\nestimated by existing two-phase warm-up chemical models. We discuss the\npossible formation pathways of CH$_{2}$OHCHO within the context of hot\nmolecular cores and hot corinos and find that CH$_{2}$OHCHO is likely formed\nvia the reactions of radical HCO and radical CH$_{2}$OH on the grain surface of\nG358.93-0.03 MM1.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:43:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Manna","Arijit",""],["Pal","Sabyasachi",""],["Viti","Serena",""],["Sinha","Sekhar",""]]}
{"id":"2308.14455","submitter":"Lyne Moser","authors":"Lyne Moser, Maru Sarazola, Paula Verdugo","title":"Internal Grothendieck construction for enriched categories","comments":"54 pages; comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a cartesian closed category $\\mathcal{V}$, we introduce an internal\ncategory of elements $\\int_\\mathcal{C} F$ associated to a $\\mathcal{V}$-functor\n$F\\colon \\mathcal{C}^{\\mathrm{op}}\\to \\mathcal{V}$. When $\\mathcal{V}$ is\nextensive, we show that this internal Grothendieck construction gives an\nequivalence of categories between $\\mathcal{V}$-functors\n$\\mathcal{C}^{\\mathrm{op}}\\to \\mathcal{V}$ and internal discrete fibrations\nover $\\mathcal{C}$, which can be promoted to an equivalence of\n$\\mathcal{V}$-categories.\n  Using this construction, we prove a representation theorem for\n$\\mathcal{V}$-categories, stating that a $\\mathcal{V}$-functor $F\\colon\n\\mathcal{C}^{\\mathrm{op}}\\to \\mathcal{V}$ is $\\mathcal{V}$-representable if and\nonly if its internal category of elements $\\int_\\mathcal{C} F$ has an internal\nterminal object. We further obtain a characterization formulated completely in\nterms of $\\mathcal{V}$-categories using shifted $\\mathcal{V}$-categories of\nelements. Moreover, in the presence of $\\mathcal{V}$-tensors, we show that it\nis enough to consider $\\mathcal{V}$-terminal objects in the underlying\n$\\mathcal{V}$-category $\\mathrm{Und}\\int_\\mathcal{C} F$ to test the\nrepresentability of a $\\mathcal{V}$-functor $F$. We apply these results to the\nstudy of weighted $\\mathcal{V}$-limits, and also obtain a novel result\ndescribing weighted $\\mathcal{V}$-limits as certain conical internal limits.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:48:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Moser","Lyne",""],["Sarazola","Maru",""],["Verdugo","Paula",""]]}
{"id":"2308.14456","submitter":"Salah Zaiem","authors":"Salah Zaiem, Youcef Kemiche, Titouan Parcollet, Slim Essid, Mirco\n  Ravanelli","title":"Speech Self-Supervised Representations Benchmarking: a Case for Larger\n  Probing Heads","comments":"11 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.LG cs.SD eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-supervised learning (SSL) leverages large datasets of unlabeled speech\nto reach impressive performance with reduced amounts of annotated data. The\nhigh number of proposed approaches fostered the emergence of comprehensive\nbenchmarks that evaluate their performance on a set of downstream tasks\nexploring various aspects of the speech signal. However, while the number of\nconsidered tasks has been growing, most proposals rely upon a single downstream\narchitecture that maps the frozen SSL representations to the task labels. This\nstudy examines how benchmarking results are affected by changes in the probing\nhead architecture. Interestingly, we found that altering the downstream\narchitecture structure leads to significant fluctuations in the performance\nranking of the evaluated models. Against common practices in speech SSL\nbenchmarking, we evaluate larger-capacity probing heads, showing their impact\non performance, inference costs, generalization and multi-level feature\nexploitation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:49:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zaiem","Salah",""],["Kemiche","Youcef",""],["Parcollet","Titouan",""],["Essid","Slim",""],["Ravanelli","Mirco",""]]}
{"id":"2308.14457","submitter":"Jia Jie Li","authors":"Jia Jie Li (SWU, Chongqing) and Armen Sedrakian (FIAS, Frankfurt and\n  U. Wroclaw)","title":"New covariant density functionals of nuclear matter for compact star\n  simulations","comments":"8 pages, 4 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th astro-ph.HE hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generate three families of extended covariant density functionals of\nnuclear matter which have varying slope of symmetry energy and skewness at\nnuclear saturation density, but otherwise share the same basic parameters\n(symmetry energy, compressibility, saturation parameters, etc.) with the\nstandard DDME2, DD2, and MPE functionals. Tables of the parameters of these new\ndensity functionals are given, that can be straightforwardly used in DDME2,\nDD2, and MPE parametrization-based codes. Furthermore, we provide tables of a\nlarge number of equation of state (81 for each family) which can be used in\nastrophysical simulations to assess the impact of variations of not-well-known\nslope of symmetry energy and skewness of nuclear system on the astrophysics of\ncompact objects. We also provide tables of computed integral parameters (mass,\nradius, and tidal deformability) which can be used, e.g., for modeling\ngravitational wave forms. Finally, for the extended DDME2-based\nparametrization, we implement a first-order phase transition to quark matter to\nobtain a family of equation of state which accommodates a phase transition to\nquark matter. Analogous Tables of the EoS and integral parameters are provided\nfor this case as well.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:50:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jia Jie","","SWU, Chongqing"],["Sedrakian","Armen","","FIAS, Frankfurt and\n  U. Wroclaw"]]}
{"id":"2308.14458","submitter":"Ye-Fei Yuan Dr.","authors":"Shu-Rui Zhang, Yan Luo, Xiao-Jun Wu (USTC), Jian-Min Wang (IHEP), Luis\n  C. Ho (PKU) and Ye-Fei Yuan (USTC)","title":"Electromagnetic signatures of white dwarf collisions in AGN discs","comments":"12 pages, 12 pages","journal-ref":"MNRAS, 524, 940-951 (2023)","doi":"10.1093/mnras/stad1855","report-no":null,"categories":"astro-ph.HE astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the inner region of the disc of an active galactic nucleus (AGN), the\ncollision of two white dwarfs (WDs) through Jacobi capture might be inevitable,\nleading to a Type Ia supernova (SN Ia) explosion. This transient event,\ninfluenced by the disc gas and the gravity of the supermassive black hole\n(SMBH), exhibits distinct characteristics compared to normal SNe Ia. The energy\nof the explosion is mainly stored in the ejecta in the form of kinetic energy.\nTypically, the ejecta is not effectively decelerated by the AGN disc and rushes\nrapidly out of the AGN disc. However, under the influence of the SMBH, most of\nthe ejecta falls back toward the AGN disc. As the fallback ejecta becomes more\ndispersed, it interacts with the disc gas, converting its kinetic energy into\nthermal energy. This results in a high-energy transient characterized by a\nrapid initial rise followed by a decay with $L\\propto t^{-2.8}$. The time-scale\nof the transient ranges from hours to weeks, depending on the mass of the SMBH.\nThis process generates high-energy radiation spanning from hard X-rays to the\nsoft $\\gamma$ range. Additionally, the subsequent damage to the disc may result\nin changing-look AGNs. Moreover, the falling back of SNe Ia ejecta onto the AGN\ndisc significantly increases the metallicity of the AGN and can even generate\nheavy elements within the AGN discs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:54:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Shu-Rui","","USTC"],["Luo","Yan","","USTC"],["Wu","Xiao-Jun","","USTC"],["Wang","Jian-Min","","IHEP"],["Ho","Luis C.","","PKU"],["Yuan","Ye-Fei","","USTC"]]}
{"id":"2308.14459","submitter":"Oleg Selyugin","authors":"O.V. Selyugin","title":"New properties of elastic $pp$ and $p\\bar{p}$ scattering at high\n  energies","comments":"7 pages, 8 figures. arXiv admin note: text overlap with\n  arXiv:1903.04976","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  Data-driving determination of the new properties of elastic scattering at\nsmall angles on the basis on all existing experimental data for $d\\sigma/dt$ of\n$pp$ and $p\\bar{p}$ at $\\sqrt{s} \\geq 540$ GeV allows us to obtain the main\ncharacteristics of the nonstandard terms of the elastic scattering amplitude.\nIt was shown that the oscillation term has a different sign for $pp$ and\n$p\\bar{p}$ reactions; hence, it is part of the Odderon amplitude. The energy\ndependence of the oscillation term and the term with an extremely large slope\nis determined. The period of the oscillation term agrees with the scaling\nproperties predicted by the Auberson - Kinoshita - Martin (AKM) theorem. The\nhigh quality quantitative description of all data at $\\sqrt{s} \\geq 540$ GeV in\nthe framework of the HEGS model supports such a phenomenon which can be\nconnected with peripheral hadron interaction.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:54:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Selyugin","O. V.",""]]}
{"id":"2308.14460","submitter":"Yuwei Zhang","authors":"Yuwei Zhang and Zhi Jin and Ying Xing and Ge Li","title":"STEAM: Simulating the InTeractive BEhavior of ProgrAMmers for Automatic\n  Bug Fixing","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bug fixing holds significant importance in software development and\nmaintenance. Recent research has made notable progress in exploring the\npotential of large language models (LLMs) for automatic bug fixing. However,\nexisting studies often overlook the collaborative nature of bug resolution,\ntreating it as a single-stage process. To overcome this limitation, we\nintroduce a novel stage-wise framework named STEAM in this paper. The objective\nof STEAM is to simulate the interactive behavior of multiple programmers\ninvolved in various stages across the bug's life cycle. Taking inspiration from\nbug management practices, we decompose the bug fixing task into four distinct\nstages: bug reporting, bug diagnosis, patch generation, and patch verification.\nThese stages are performed interactively by LLMs, aiming to imitate the\ncollaborative abilities of programmers during the resolution of software bugs.\nBy harnessing the collective contribution, STEAM effectively enhances the\nbug-fixing capabilities of LLMs. We implement STEAM by employing the powerful\ndialogue-based LLM -- ChatGPT. Our evaluation on the widely adopted bug-fixing\nbenchmark demonstrates that STEAM has achieved a new state-of-the-art level of\nbug-fixing performance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:56:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Yuwei",""],["Jin","Zhi",""],["Xing","Ying",""],["Li","Ge",""]]}
{"id":"2308.14461","submitter":"Leo Fillioux","authors":"Leo Fillioux, Emilie Gontran, J\\'er\\^ome Cartry, Jacques RR Mathieu,\n  Sabrina Bedja, Alice Boil\\`eve, Paul-Henry Courn\\`ede, Fanny Jaulin, Stergios\n  Christodoulidis, Maria Vakalopoulou","title":"Spatio-Temporal Analysis of Patient-Derived Organoid Videos Using Deep\n  Learning for the Prediction of Drug Efficacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the last ten years, Patient-Derived Organoids (PDOs) emerged as the most\nreliable technology to generate ex-vivo tumor avatars. PDOs retain the main\ncharacteristics of their original tumor, making them a system of choice for\npre-clinical and clinical studies. In particular, PDOs are attracting interest\nin the field of Functional Precision Medicine (FPM), which is based upon an\nex-vivo drug test in which living tumor cells (such as PDOs) from a specific\npatient are exposed to a panel of anti-cancer drugs. Currently, the Adenosine\nTriphosphate (ATP) based cell viability assay is the gold standard test to\nassess the sensitivity of PDOs to drugs. The readout is measured at the end of\nthe assay from a global PDO population and therefore does not capture single\nPDO responses and does not provide time resolution of drug effect. To this end,\nin this study, we explore for the first time the use of powerful large\nfoundation models for the automatic processing of PDO data. In particular, we\npropose a novel imaging-based high-throughput screening method to assess\nreal-time drug efficacy from a time-lapse microscopy video of PDOs. The\nrecently proposed SAM algorithm for segmentation and DINOv2 model are adapted\nin a comprehensive pipeline for processing PDO microscopy frames. Moreover, an\nattention mechanism is proposed for fusing temporal and spatial features in a\nmultiple instance learning setting to predict ATP. We report better results\nthan other non-time-resolved methods, indicating that the temporality of data\nis an important factor for the prediction of ATP. Extensive ablations shed\nlight on optimizing the experimental setting and automating the prediction both\nin real-time and for forecasting.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:58:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fillioux","Leo",""],["Gontran","Emilie",""],["Cartry","J\u00e9r\u00f4me",""],["Mathieu","Jacques RR",""],["Bedja","Sabrina",""],["Boil\u00e8ve","Alice",""],["Courn\u00e8de","Paul-Henry",""],["Jaulin","Fanny",""],["Christodoulidis","Stergios",""],["Vakalopoulou","Maria",""]]}
{"id":"2308.14462","submitter":"Reo Shikanai","authors":"Reo Shikanai, Masayuki Ohzeki and Kazuyuki Tanaka","title":"Traffic signal optimization using quantum annealing on real map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantum annealing machine manufactured by D-Wave Systems is expected to\nfind the optimal solution for QUBO (Quadratic Unconstrained Binary\nOptimization) accurately and quickly. This would be useful in future\napplications where real-time calculation is needed. One such application is\ntraffic signal optimization. Some studies use quantum annealing for this.\nHowever, they are formulated in unrealistic settings, such as only crossroads\non the map. Therefore, we suggest a QUBO, which can deal with T-junctions and\nmulti-forked roads. To validate the efficiency of our approach, SUMO\n(Simulation of Urban MObility) is used. This enables us to experiment with\ngeographic information data very close to the real world. We compared results\nwith those using the Gurobi Optimizer in the experiment to confirm that quantum\nannealing can find a ground state. The results show that the quantum annealing\ncannot find the ground state, but our model can reduce the time that vehicles\nwait at a red light. It is also inferior to the Gurobi Optimizer in calculation\ntime. This seems to be due to the D-Wave machine's hardware limitations and\nnoise effects, such as ambient temperature. If these problems are solved, and\nthe number of qubits is increased, the use of quantum annealing is likely to be\nsuperior in terms of the speed of calculating an optimal solution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:00:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shikanai","Reo",""],["Ohzeki","Masayuki",""],["Tanaka","Kazuyuki",""]]}
{"id":"2308.14463","submitter":"Wei He","authors":"Bo Hu, Zong-Kai Xie, Jie Lu, and Wei He","title":"Exploring wavefunction hybridization of magnon-magnon hybrid state","comments":"4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate magnon magnon hybrid states using a non Hermitian two band\nHamiltonian and the concept of wavefunction hybridization. By comparing our\nmodel with micromagnetic simulations conducted on a synthetic antiferromagnet\nwith strong magnon magnon coupling, we successfully reproduce not only the\nresonance frequencies and linewidths but also the phases and amplitudes of the\nmagnon wavefunction. The hybridization effect influences the dissipation rate,\nleading to the crossing of linewidths. Additionally, we quantify the magnon\nhybridization within a magnonic Bloch sphere, which enhances the ability to\nmanipulate hybrid magnons for coherent information processing.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:02:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Bo",""],["Xie","Zong-Kai",""],["Lu","Jie",""],["He","Wei",""]]}
{"id":"2308.14464","submitter":"Christoph Rothe","authors":"Cladia Noack, Chistoph Rothe","title":"Donut Regression Discontinuity Designs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the econometric properties of so-called donut regression\ndiscontinuity (RD) designs, a robustness exercise which involves repeating\nestimation and inference without the data points in some area around the\ntreatment threshold. This approach is often motivated by concerns that possible\nsystematic sorting of units, or similar data issues, in some neighborhood of\nthe treatment threshold might distort estimation and inference of RD treatment\neffects. We show that donut RD estimators can have substantially larger bias\nand variance than contentional RD estimators, and that the corresponding\nconfidence intervals can be substantially longer. We also provide a formal\ntesting framework for comparing donut and conventional RD estimation results.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:02:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Noack","Cladia",""],["Rothe","Chistoph",""]]}
{"id":"2308.14465","submitter":"Mohsen Asgharzadeh","authors":"Mohsen Asgharzadeh","title":"A note on $UFD$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We search for principal ideals. As a sample, let $R$ be a strongly-normal,\nalmost-factorial, and complete-intersection local ring with a prime ideal $P$\nof height one. If $depth(R/ P)\\geq dim R-2$, we show $P$ is principal. As an\nimmediate corollary, we apply some easy local cohomology arguments and reprove\na celebrated theorem of Auslander-Buchsbaum, simplified a result of Dao and\nSamuel. From this, we show the hypersurface property of rings of multiplicity\nat most three. As another application, we answer affirmatively a question\nposted by Braun.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:02:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Asgharzadeh","Mohsen",""]]}
{"id":"2308.14466","submitter":"Lee Heewon","authors":"Heewon Lee, Sangtae Ahn","title":"Improving the performance of object detection by preserving label\n  distribution","comments":"Code is available at\n  https://github.com/leeheewon-01/YOLOstratifiedKFold/tree/main","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Object detection is a task that performs position identification and label\nclassification of objects in images or videos. The information obtained through\nthis process plays an essential role in various tasks in the field of computer\nvision. In object detection, the data utilized for training and validation\ntypically originate from public datasets that are well-balanced in terms of the\nnumber of objects ascribed to each class in an image. However, in real-world\nscenarios, handling datasets with much greater class imbalance, i.e., very\ndifferent numbers of objects for each class , is much more common, and this\nimbalance may reduce the performance of object detection when predicting unseen\ntest images. In our study, thus, we propose a method that evenly distributes\nthe classes in an image for training and validation, solving the class\nimbalance problem in object detection. Our proposed method aims to maintain a\nuniform class distribution through multi-label stratification. We tested our\nproposed method not only on public datasets that typically exhibit balanced\nclass distribution but also on custom datasets that may have imbalanced class\ndistribution. We found that our proposed method was more effective on datasets\ncontaining severe imbalance and less data. Our findings indicate that the\nproposed method can be effectively used on datasets with substantially\nimbalanced class distribution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:04:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Heewon",""],["Ahn","Sangtae",""]]}
{"id":"2308.14467","submitter":"Pierre Matet","authors":"Pierre Matet","title":"A short tour of Shelah's Revised GCH Theorem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider some of the various formulations of the Revised GCH Theorem\npresented in Shelah's original paper \\cite{SheRGCH}. We compare them and\ndiscuss their meaning.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:10:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Matet","Pierre",""]]}
{"id":"2308.14468","submitter":"Hao Jiao","authors":"Hao Jiao, Bryce Cyr, and Robert Brandenberger","title":"Accretion onto Oscillating Cosmic String Loops","comments":"19 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cosmic string loops are non-linear density fluctuations which form in the\nearly universe and could play an important role in explaining many phenomena\nwhich are in tension with the standard $\\Lambda$CDM model. Hence, the details\nof the accretion process onto cosmic string loops should be studied in detail.\nMost previous works view loops as point masses and ignore the impact of a\nfinite loop size. In this work, we utilize the Zel'dovich approximation to\ncalculate the non-linear mass sourced by a static extended loop with a\ntime-averaged density profile derived from the trajectory of the loop\noscillation, and compare the result with what is obtained for a point-mass\nsource. We find that the finite size of a loop mainly affects the evolution of\nturnaround shells during the early stages of accretion, converging to the point\nmass result after a critical redshift, $z^{(II)/(III)}_{c}$. For\n$z>z^{(II)/(III)}_{c}$, the total accreted mass surrounding a loop is\nsuppressed relative to the point mass case and has a growth rate proportional\nto $(1+z)^{-3/2}$. As an immediate extension, we also qualitatively analyse the\naccretion onto moving point masses and onto moving extended loops. In addition\nto the reduction in the nonlinear mass, the loop finite size also changes the\nshape of the turnaround surface at early stages of accretion.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:14:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jiao","Hao",""],["Cyr","Bryce",""],["Brandenberger","Robert",""]]}
{"id":"2308.14469","submitter":"Tao Yang","authors":"Tao Yang, Peiran Ren, Xuansong Xie, Lei Zhang","title":"Pixel-Aware Stable Diffusion for Realistic Image Super-resolution and\n  Personalized Stylization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Realistic image super-resolution (Real-ISR) aims to reproduce perceptually\nrealistic image details from a low-quality input. The commonly used adversarial\ntraining based Real-ISR methods often introduce unnatural visual artifacts and\nfail to generate realistic textures for natural scene images. The recently\ndeveloped generative stable diffusion models provide a potential solution to\nReal-ISR with pre-learned strong image priors. However, the existing methods\nalong this line either fail to keep faithful pixel-wise image structures or\nresort to extra skipped connections to reproduce details, which requires\nadditional training in image space and limits their extension to other related\ntasks in latent space such as image stylization. In this work, we propose a\npixel-aware stable diffusion (PASD) network to achieve robust Real-ISR as well\nas personalized stylization. In specific, a pixel-aware cross attention module\nis introduced to enable diffusion models perceiving image local structures in\npixel-wise level, while a degradation removal module is used to extract\ndegradation insensitive features to guide the diffusion process together with\nimage high level information. By simply replacing the base diffusion model with\na personalized one, our method can generate diverse stylized images without the\nneed to collect pairwise training data. PASD can be easily integrated into\nexisting diffusion models such as Stable Diffusion. Experiments on Real-ISR and\npersonalized stylization demonstrate the effectiveness of our proposed\napproach. The source code and models can be found at\n\\url{https://github.com/yangxy/PASD}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:15:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Tao",""],["Ren","Peiran",""],["Xie","Xuansong",""],["Zhang","Lei",""]]}
{"id":"2308.14470","submitter":"Patrick Kennedy-Hunt","authors":"Patrick Kennedy-Hunt","title":"The Logarithmic Quot space: foundations and tropicalisation","comments":"58 pages, 6 figures. Comments welcome. A version appeared online in\n  Jan 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct a logarithmic version of the Hilbert scheme, and more generally\nthe Quot scheme, of a simple normal crossings pair. The logarithmic Quot space\nadmits a natural tropicalisation called the space of tropical supports, which\nis a functor on the category of cone complexes. The fibers of the map to the\nspace of tropical supports are algebraic. The space of tropical supports is\nrepresentable by ``piecewise linear spaces'', which are introduced here to\ngeneralise fans and cone complexes to allow non--convex geometries. The space\nof tropical supports can be seen as a polyhedral analogue of the Hilbert\nscheme. The logarithmic Quot space parameterises quotient sheaves on\nlogarithmic modifications that satisfy a natural transversality condition. We\nprove that the space it is a logarithmic algebraic space, is separated, and\nuniversally closed. The logarithmic Hilbert space parameterizes families of\nproper monomorphisms, and in this way is exactly analogous to the classical\nHilbert scheme. The new complexity of the space can then be viewed as stemming\nfrom the complexity of proper monomorphisms in logarithmic geometry. Our\nconstruction generalises the logarithmic Donaldson--Thomas space studied by\nMaulik--Ranganathan to arbitrary rank and dimension, and the good degenerations\nof Quot schemes of Li--Wu to simple normal crossings geometries.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:17:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kennedy-Hunt","Patrick",""]]}
{"id":"2308.14471","submitter":"Mumtaz Hussain","authors":"Mumtaz Hussain, Johannes Schleischitz, and Benjamin Ward","title":"Dual $p$-adic Diophantine approximation on manifolds","comments":"19 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Generalised Baker-Schmidt Problem (1970) concerns the Hausdorff measure\nof the set of $\\psi$-approximable points on a nondegenerate manifold.\nBeresnevich-Dickinson-Velani (in 2006, for the homogeneous setting) and\nBadziahin-Beresnevich-Velani (in 2013, for the inhomogeneous setting) proved\nthe divergence part of this problem for dual approximation on arbitrary\nnondegenerate manifolds. The divergence part has also been resolved for the\n$p$-adic setting by Datta-Ghosh in 2022 for the inhomogeneous setting. The\ncorresponding convergence counterpart represents a challenging open problem. In\nthis paper, we prove the homogeneous $p$-adic convergence result for\nhypersurfaces of dimension at least three with some mild regularity condition,\nas well as for some other classes of manifolds satisfying certain conditions.\nWe provide similar, slightly weaker results for the inhomogeneous setting. We\ndo not restrict to monotonic approximation functions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:18:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hussain","Mumtaz",""],["Schleischitz","Johannes",""],["Ward","Benjamin",""]]}
{"id":"2308.14472","submitter":"Roberta Angelini","authors":"R. Angelini, A. Madsen, A. Fluerasu, G. Ruocco, B. Ruzicka","title":"Aging behavior of the localization length in a colloidal glass","comments":"6 pages, 5 figures","journal-ref":"Colloids and Surfaces A: Physicochem. Eng. Aspects 460, 118-122\n  (2014)","doi":"10.1016/j.colsurfa.2014.03.087","report-no":null,"categories":"cond-mat.soft cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The localization length r_{loc} associated with a fast secondary relaxation\nin glassy Laponite is determined by X-ray photon correlation spectroscopy\n(XPCS) through a Debye-Waller fit of the non-ergodicity parameter. Quantitative\ndifferences are observed between the time dependence (aging) of r_{loc} in\nspontaneously aged and rejuvenated samples. This behavior is also reflected in\nthe calculated shear modulus which matches well with data obtained by\nrheological measurements.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:20:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Angelini","R.",""],["Madsen","A.",""],["Fluerasu","A.",""],["Ruocco","G.",""],["Ruzicka","B.",""]]}
{"id":"2308.14473","submitter":"Benjamin Joseph","authors":"Benjamin Joseph, Gregoire Loeper, Jan Obloj","title":"Joint Calibration of Local Volatility Models with Stochastic Interest\n  Rates using Semimartingale Optimal Transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF q-fin.CP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We develop and implement a non-parametric method for joint exact calibration\nof a local volatility model and a correlated stochastic short rate model using\nsemimartingale optimal transport. The method relies on the duality results\nestablished in Joseph, Loeper, and Obloj, 2023 and jointly calibrates the whole\nequity-rate dynamics. It uses an iterative approach which starts with a\nparametric model and tries to stay close to it, until a perfect calibration is\nobtained. We demonstrate the performance of our approach on market data using\nEuropean SPX options and European cap interest rate options. Finally, we\ncompare the joint calibration approach with the sequential calibration, in\nwhich the short rate model is calibrated first and frozen.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:22:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Joseph","Benjamin",""],["Loeper","Gregoire",""],["Obloj","Jan",""]]}
{"id":"2308.14474","submitter":"Shuxian Du","authors":"Shuxian Du, Yaxiu Sun and Changyi Du","title":"Causality-Based Feature Importance Quantifying Methods:PN-FI, PS-FI and\n  PNS-FI","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In current ML field models are getting larger and more complex, data we use\nare also getting larger in quantity and higher in dimension, so in order to\ntrain better models, save training time and computational resources, a good\nFeature Selection (FS) method in preprocessing stage is necessary. Feature\nimportance (FI) is of great importance since it is the basis of feature\nselection.\n  This paper creatively introduces the calculation of PNS(the probability of\nNecessity and Sufficiency) in Causality into quantifying feature importance and\ncreates new FI measuring methods: PN-FI, which means how much importance a\nfeature has in image recognition tasks, PS_FI that means how much importance a\nfeature has in image generating tasks, and PNS_FI which measures both.\n  The main body of this paper is three RCTs, with whose results we show how\nPS_FI, PN_FI and PNS_FI of three features: dog nose, dog eyes and dog mouth are\ncalculated. The FI values are intervals with tight upper and lower bounds.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:24:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Du","Shuxian",""],["Sun","Yaxiu",""],["Du","Changyi",""]]}
{"id":"2308.14475","submitter":"Mozhgan Vazifehdoostirani","authors":"Mozhgan Vazifehdoostirani, Laura Genga, Xixi Lu, Rob Verhoeven,\n  Hanneke van Laarhoven, Remco Dijkman","title":"Interactive Multi Interest Process Pattern Discovery","comments":"16 pages, 5 figures, To appear in the preceedings of 21st\n  International Conference on Business Process Management (BPM), 11-15\n  September 2023, Utrecht, the Netherlands","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Process pattern discovery methods (PPDMs) aim at identifying patterns of\ninterest to users. Existing PPDMs typically are unsupervised and focus on a\nsingle dimension of interest, such as discovering frequent patterns. We present\nan interactive multi interest driven framework for process pattern discovery\naimed at identifying patterns that are optimal according to a multi-dimensional\nanalysis goal. The proposed approach is iterative and interactive, thus taking\nexperts knowledge into account during the discovery process. The paper focuses\non a concrete analysis goal, i.e., deriving process patterns that affect the\nprocess outcome. We evaluate the approach on real world event logs in both\ninteractive and fully automated settings. The approach extracted meaningful\npatterns validated by expert knowledge in the interactive setting. Patterns\nextracted in the automated settings consistently led to prediction performance\ncomparable to or better than patterns derived considering single interest\ndimensions without requiring user defined thresholds.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:26:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vazifehdoostirani","Mozhgan",""],["Genga","Laura",""],["Lu","Xixi",""],["Verhoeven","Rob",""],["van Laarhoven","Hanneke",""],["Dijkman","Remco",""]]}
{"id":"2308.14476","submitter":"Leon Lan","authors":"Leon Lan, Jasper van Doorn, Niels A. Wouda, Arpan Rijal, Sandjai\n  Bhulai","title":"An iterative conditional dispatch algorithm for the dynamic dispatch\n  waves problem","comments":"22 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A challenge in same-day delivery operations is that delivery requests are\ntypically not known beforehand, but are instead revealed dynamically during the\nday. This uncertainty introduces a trade-off between dispatching vehicles to\nserve requests as soon as they are revealed to ensure timely delivery, and\ndelaying the dispatching decision to consolidate routing decisions with future,\ncurrently unknown requests. In this paper we study the dynamic dispatch waves\nproblem, a same-day delivery problem in which vehicles are dispatched at fixed\ndecision moments. At each decision moment, the system operator must decide\nwhich of the known requests to dispatch, and how to route these dispatched\nrequests. The operator's goal is to minimize the total routing cost while\nensuring all requests are served on time. We propose iterative conditional\ndispatch (ICD), an iterative solution construction procedure based on a sample\nscenario approach. ICD iteratively solves sample scenarios to classify requests\nto be dispatched, postponed, or undecided. The set of undecided requests\nshrinks in each iteration until a final dispatching decision is made in the\nlast iteration We develop two variants of ICD: one variant based on thresholds,\nand another variant based on similarity. A significant strength of ICD is that\nit is conceptually simple and easy to implement. This simplicity does not harm\nperformance: through rigorous numerical experiments, we show that both variants\nefficiently navigate the large state and action spaces of the dynamic dispatch\nwaves problem and quickly converge to a high-quality solution. In particular,\nthe threshold-based ICD variant improves over a greedy myopic strategy by 27.2%\non average, and outperforms methods from the literature by 0.8% on average, and\nup to 1.5% in several cases.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:27:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lan","Leon",""],["van Doorn","Jasper",""],["Wouda","Niels A.",""],["Rijal","Arpan",""],["Bhulai","Sandjai",""]]}
{"id":"2308.14477","submitter":"Zhuoqi Cheng","authors":"Zhuoqi Cheng, Simon Lyck Bj{\\ae}rt S{\\o}rensen, Mikkel Werge Olsen,\n  Ren\\'e Lynge Eriksen, Thiusius Rajeeth Savarimuthu","title":"Medical needle tip tracking based on Optical Imaging and AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep needle insertion to a target often poses a huge challenge, requiring a\ncombination of specialized skills, assistive technology, and extensive\ntraining. One of the frequently encountered medical scenarios demanding such\nexpertise includes the needle insertion into a femoral vessel in the groin.\nAfter the access to the femoral vessel, various medical procedures, such as\ncardiac catheterization and extracorporeal membrane oxygenation (ECMO) can be\nperformed. However, even with the aid of Ultrasound imaging, achieving\nsuccessful insertion can necessitate multiple attempts due to the complexities\nof anatomy and tissue deformation. To address this challenge, this paper\npresents an innovative technology for needle tip real-time tracking, aiming for\nenhanced needle insertion guidance. Specifically, our approach revolves around\nthe creation of scattering imaging using an optical fiber-equipped needle, and\nuses Convolutional Neural Network (CNN) based algorithms to enable real-time\nestimation of the needle tip's position and orientation during insertion\nprocedures. The efficacy of the proposed technology was rigorously evaluated\nthrough three experiments. The first two experiments involved rubber and bacon\nphantoms to simulate groin anatomy. The positional errors averaging 2.3+1.5mm\nand 2.0+1.2mm, and the orientation errors averaging 0.2+0.11rad and\n0.16+0.1rad. Furthermore, the system's capabilities were validated through\nexperiments conducted on fresh porcine phantom mimicking more complex\nanatomical structures, yielding positional accuracy results of 3.2+3.1mm and\norientational accuracy of 0.19+0.1rad. Given the average femoral arterial\nradius of 4 to 5mm, the proposed system is demonstrated with a great potential\nfor precise needle guidance in femoral artery insertion procedures. In\naddition, the findings highlight the broader potential applications of the\nsystem in the medical field.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:30:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheng","Zhuoqi",""],["S\u00f8rensen","Simon Lyck Bj\u00e6rt",""],["Olsen","Mikkel Werge",""],["Eriksen","Ren\u00e9 Lynge",""],["Savarimuthu","Thiusius Rajeeth",""]]}
{"id":"2308.14478","submitter":"Christian Hennig","authors":"Christian Hennig","title":"Some issues in robust clustering","comments":"11 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Some key issues in robust clustering are discussed with focus on Gaussian\nmixture model based clustering, namely the formal definition of outliers,\nambiguity between groups of outliers and clusters, the interaction between\nrobust clustering and the estimation of the number of clusters, the essential\ndependence of (not only) robust clustering on tuning decisions, and\nshortcomings of existing measurements of cluster stability when it comes to\noutliers.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:35:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hennig","Christian",""]]}
{"id":"2308.14479","submitter":"Tan Zhang","authors":"Tan Zhang, Zhongjian Wang, Jack Xin, Zhiwen Zhang","title":"A convergent interacting particle method for computing KPP front speeds\n  in random flows","comments":"36 pages, 17 figures, planning to submit for SIAM/ASA Journal on\n  Uncertainty Quantification","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We aim to efficiently compute spreading speeds of\nreaction-diffusion-advection (RDA) fronts in divergence free random flows under\nthe Kolmogorov-Petrovsky-Piskunov (KPP) nonlinearity. We study a stochastic\ninteracting particle method (IPM) for the reduced principal eigenvalue\n(Lyapunov exponent) problem of an associated linear advection-diffusion\noperator with spatially random coefficients. The Fourier representation of the\nrandom advection field and the Feynman-Kac (FK) formula of the principal\neigenvalue (Lyapunov exponent) form the foundation of our method implemented as\na genetic evolution algorithm. The particles undergo advection-diffusion, and\nmutation/selection through a fitness function originated in the FK semigroup.\nWe analyze convergence of the algorithm based on operator splitting, present\nnumerical results on representative flows such as 2D cellular flow and 3D\nArnold-Beltrami-Childress (ABC) flow under random perturbations. The 2D\nexamples serve as a consistency check with semi-Lagrangian computation. The 3D\nresults demonstrate that IPM, being mesh free and self-adaptive, is simple to\nimplement and efficient for computing front spreading speeds in the\nadvection-dominated regime for high-dimensional random flows on unbounded\ndomains where no truncation is needed.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:38:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Tan",""],["Wang","Zhongjian",""],["Xin","Jack",""],["Zhang","Zhiwen",""]]}
{"id":"2308.14480","submitter":"Hanyang Kong","authors":"Hanyang Kong, Kehong Gong, Dongze Lian, Michael Bi Mi, Xinchao Wang","title":"Priority-Centric Human Motion Generation in Discrete Latent Space","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.MM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-to-motion generation is a formidable task, aiming to produce human\nmotions that align with the input text while also adhering to human\ncapabilities and physical laws. While there have been advancements in diffusion\nmodels, their application in discrete spaces remains underexplored. Current\nmethods often overlook the varying significance of different motions, treating\nthem uniformly. It is essential to recognize that not all motions hold the same\nrelevance to a particular textual description. Some motions, being more salient\nand informative, should be given precedence during generation. In response, we\nintroduce a Priority-Centric Motion Discrete Diffusion Model (M2DM), which\nutilizes a Transformer-based VQ-VAE to derive a concise, discrete motion\nrepresentation, incorporating a global self-attention mechanism and a\nregularization term to counteract code collapse. We also present a motion\ndiscrete diffusion model that employs an innovative noise schedule, determined\nby the significance of each motion token within the entire motion sequence.\nThis approach retains the most salient motions during the reverse diffusion\nprocess, leading to more semantically rich and varied motions. Additionally, we\nformulate two strategies to gauge the importance of motion tokens, drawing from\nboth textual and visual indicators. Comprehensive experiments on the HumanML3D\nand KIT-ML datasets confirm that our model surpasses existing techniques in\nfidelity and diversity, particularly for intricate textual descriptions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:40:16 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 15:33:01 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Kong","Hanyang",""],["Gong","Kehong",""],["Lian","Dongze",""],["Mi","Michael Bi",""],["Wang","Xinchao",""]]}
{"id":"2308.14481","submitter":"Felicia Ruppel","authors":"Felicia Ruppel, Florian Faion, Claudius Gl\\\"aser and Klaus Dietmayer","title":"Group Regression for Query Based Object Detection and Tracking","comments":"Accepted for publication at the 2023 26th IEEE International\n  Conference on Intelligent Transportation Systems (ITSC 2023), Sep 24-28,\n  2023, in Bilbao, Spain","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Group regression is commonly used in 3D object detection to predict box\nparameters of similar classes in a joint head, aiming to benefit from\nsimilarities while separating highly dissimilar classes. For query-based\nperception methods, this has, so far, not been feasible. We close this gap and\npresent a method to incorporate multi-class group regression, especially\ndesigned for the 3D domain in the context of autonomous driving, into existing\nattention and query-based perception approaches. We enhance a transformer based\njoint object detection and tracking model with this approach, and thoroughly\nevaluate its behavior and performance. For group regression, the classes of the\nnuScenes dataset are divided into six groups of similar shape and prevalence,\neach being regressed by a dedicated head. We show that the proposed method is\napplicable to many existing transformer based perception approaches and can\nbring potential benefits. The behavior of query group regression is thoroughly\nanalyzed in comparison to a unified regression head, e.g. in terms of\nclass-switching behavior and distribution of the output parameters. The\nproposed method offers many possibilities for further research, such as in the\ndirection of deep multi-hypotheses tracking.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:43:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ruppel","Felicia",""],["Faion","Florian",""],["Gl\u00e4ser","Claudius",""],["Dietmayer","Klaus",""]]}
{"id":"2308.14482","submitter":"Pengzhi Gao","authors":"Pengzhi Gao, Ruiqing Zhang, Zhongjun He, Hua Wu, Haifeng Wang","title":"An Empirical Study of Consistency Regularization for End-to-End\n  Speech-to-Text Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Consistency regularization methods, such as R-Drop (Liang et al., 2021) and\nCrossConST (Gao et al., 2023), have achieved impressive supervised and\nzero-shot performance in the neural machine translation (NMT) field. Can we\nalso boost end-to-end (E2E) speech-to-text translation (ST) by leveraging\nconsistency regularization? In this paper, we conduct empirical studies on\nintra-modal and cross-modal consistency and propose two training strategies,\nSimRegCR and SimZeroCR, for E2E ST in regular and zero-shot scenarios.\nExperiments on the MuST-C benchmark show that our approaches achieve\nstate-of-the-art (SOTA) performance in most translation directions. The\nanalyses prove that regularization brought by the intra-modal consistency,\ninstead of modality gap, is crucial for the regular E2E ST, and the cross-modal\nconsistency could close the modality gap and boost the zero-shot E2E ST\nperformance.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:44:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gao","Pengzhi",""],["Zhang","Ruiqing",""],["He","Zhongjun",""],["Wu","Hua",""],["Wang","Haifeng",""]]}
{"id":"2308.14483","submitter":"ShivaSankar K.A.","authors":"ShivaSankar K.A., Arindam Das, Gaetano Lambiase, Takaaki Nomura, Yuta\n  Orikasa","title":"Probing chiral and flavored $Z^\\prime$ from cosmic bursts through\n  neutrino interactions","comments":"65 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.HE hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The origin of tiny neutrino mass is an unsolved puzzle leading to a variety\nof phenomenological aspects beyond the Standard Model (BSM). Among several\ninteresting attempts, $U(1)$ gauge extension of Standard Model (SM) is a simple\nand interesting set-up where the so-called seesaw mechanism is incarnated by\nthe addition of three generations of right-handed neutrinos followed by the\nbreaking of $U(1)$ and electroweak symmetries. Such scenarios are anomaly free\nin nature appearing with a neutral BSM gauge boson ($Z^\\prime$). In addition to\nthat, there comes another open question regarding the existence of a\nnon-luminous, hitherto unidentified object called Dark Matter (DM) originating\nfrom the measurement of its relic density. To explore properties of $Z^\\prime$,\nwe focus on chiral and flavored scenarios where $Z^\\prime-$neutrinos\ninteraction could be probed in the context of cosmic explosions like gamma-ray\nburst (GRB221009A, so far the highest energy), blazar (TXS 0506+056) and Active\ngalaxy (NGC1068) respectively. The neutrino antineutrino annihilation produces\nelectron-positron pair which could energize GRB through energy deposition.\nTaking the highest energy GRB under consideration and estimating the energy\ndeposition rates we constrain $Z^\\prime$ mass $(M_{Z^\\prime})$ and the\nadditional $U(1)$ coupling $(g_X)$ for chiral and flavored scenarios in the\nSchwarzchild, Hartle-Thorne and modified gravity frameworks. On the other hand,\nadding viable and alternative DM candidates in these models we study\nneutrino-DM scattering mediated by $Z^\\prime$ in the $t-$ channel and estimate\nconstraints on $g_X-M_{Z^\\prime}$ plane using observed data of high energy\nneutrinos from cosmic blazar and active galaxy at the IceCube experiment. We\ncompare our results with bounds obtained from different scattering, beam-dump\nand $g-2$ experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:51:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["A.","ShivaSankar K.",""],["Das","Arindam",""],["Lambiase","Gaetano",""],["Nomura","Takaaki",""],["Orikasa","Yuta",""]]}
{"id":"2308.14484","submitter":"Loukas Ilias","authors":"Loukas Ilias, Ioannis Michail Kazelidis, Dimitris Askounis","title":"Multimodal Detection of Social Spambots in Twitter using Transformers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Although not all bots are malicious, the vast majority of them are\nresponsible for spreading misinformation and manipulating the public opinion\nabout several issues, i.e., elections and many more. Therefore, the early\ndetection of social spambots is crucial. Although there have been proposed\nmethods for detecting bots in social media, there are still substantial\nlimitations. For instance, existing research initiatives still extract a large\nnumber of features and train traditional machine learning algorithms or use\nGloVe embeddings and train LSTMs. However, feature extraction is a tedious\nprocedure demanding domain expertise. Also, language models based on\ntransformers have been proved to be better than LSTMs. Other approaches create\nlarge graphs and train graph neural networks requiring in this way many hours\nfor training and access to computational resources. To tackle these\nlimitations, this is the first study employing only the user description field\nand images of three channels denoting the type and content of tweets posted by\nthe users. Firstly, we create digital DNA sequences, transform them to 3d\nimages, and apply pretrained models of the vision domain, including\nEfficientNet, AlexNet, VGG16, etc. Next, we propose a multimodal approach,\nwhere we use TwHIN-BERT for getting the textual representation of the user\ndescription field and employ VGG16 for acquiring the visual representation for\nthe image modality. We propose three different fusion methods, namely\nconcatenation, gated multimodal unit, and crossmodal attention, for fusing the\ndifferent modalities and compare their performances. Extensive experiments\nconducted on the Cresci '17 dataset demonstrate valuable advantages of our\nintroduced approaches over state-of-the-art ones reaching Accuracy up to\n99.98%.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:51:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ilias","Loukas",""],["Kazelidis","Ioannis Michail",""],["Askounis","Dimitris",""]]}
{"id":"2308.14485","submitter":"Godofredo  Iommi","authors":"Godofredo Iommi, Dalia Terhesiu, Mike Todd","title":"H\\\"older continuity of measures for heavy tail potentials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a class of potentials $\\psi$ satisfying a condition depending on the roof\nfunction of a suspension (semi)flow, we show an EKP inequality, which can be\ninterpreted as a H\\\"older continuity property in the weak${^*}$ norm of\nmeasures, with respect to the pressure of those measures, where the H\\\"older\nexponent depends on the $L^q$-space that $\\psi$ belongs to. This also captures\na new type of phase transition for intermittent (semi)flows (and maps).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:54:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Iommi","Godofredo",""],["Terhesiu","Dalia",""],["Todd","Mike",""]]}
{"id":"2308.14486","submitter":"Federico Cinus","authors":"Federico Cinus, Aristides Gionis, Francesco Bonchi","title":"Rebalancing Social Feed to Minimize Polarization and Disagreement","comments":"Accepted for publication at ACM CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3615025","report-no":null,"categories":"cs.SI cs.CY cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Social media have great potential for enabling public discourse on important\nsocietal issues. However, adverse effects, such as polarization and echo\nchambers, greatly impact the benefits of social media and call for algorithms\nthat mitigate these effects. In this paper, we propose a novel problem\nformulation aimed at slightly nudging users' social feeds in order to strike a\nbalance between relevance and diversity, thus mitigating the emergence of\npolarization, without lowering the quality of the feed. Our approach is based\non re-weighting the relative importance of the accounts that a user follows, so\nas to calibrate the frequency with which the content produced by various\naccounts is shown to the user. We analyze the convexity properties of the\nproblem, demonstrating the non-matrix convexity of the objective function and\nthe convexity of the feasible set. To efficiently address the problem, we\ndevelop a scalable algorithm based on projected gradient descent. We also prove\nthat our problem statement is a proper generalization of the undirected-case\nproblem so that our method can also be adopted for undirected social networks.\nAs a baseline for comparison in the undirected case, we develop a semidefinite\nprogramming approach, which provides the optimal solution. Through extensive\nexperiments on synthetic and real-world datasets, we validate the effectiveness\nof our approach, which outperforms non-trivial baselines, underscoring its\nability to foster healthier and more cohesive online communities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:59:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cinus","Federico",""],["Gionis","Aristides",""],["Bonchi","Francesco",""]]}
{"id":"2308.14487","submitter":"Daniel Bussell","authors":"Daniel Bussell, Camilo Andr\\'es Garc\\'ia-Trillos","title":"Deep multi-step mixed algorithm for high dimensional non-linear PDEs and\n  associated BSDEs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA q-fin.CP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new multistep deep learning-based algorithm for the resolution\nof moderate to high dimensional nonlinear backward stochastic differential\nequations (BSDEs) and their corresponding parabolic partial differential\nequations (PDE). Our algorithm relies on the iterated time discretisation of\nthe BSDE and approximates its solution and gradient using deep neural networks\nand automatic differentiation at each time step. The approximations are\nobtained by sequential minimisation of local quadratic loss functions at each\ntime step through stochastic gradient descent. We provide an analysis of\napproximation error in the case of a network architecture with weight\nconstraints requiring only low regularity conditions on the generator of the\nBSDE. The algorithm increases accuracy from its single step parent model and\nhas reduced complexity when compared to similar models in the literature.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:00:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bussell","Daniel",""],["Garc\u00eda-Trillos","Camilo Andr\u00e9s",""]]}
{"id":"2308.14488","submitter":"Jumpei Yasuda","authors":"Jumpei Yasuda","title":"Computation of the knot symmetric quandle and its application to the\n  plat index of surface-links","comments":"17 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A surface-link is a closed surface embedded in the 4-space, possibly\ndisconnected or non-orientable. Every surface-link can be presented by the plat\nclosure of a braided surface, which we call a plat form presentation. The knot\nsymmetric quandle of a surface-link $F$ is a pair of a quandle and a good\ninvolution determined from $F$. In this paper, we compute the knot symmetric\nquandle for surface-links using a plat form presentation. As an application, we\nshow that for any integers $g \\geq 0$ and $m \\geq 2$, there exists infinitely\nmany distinct surface-knots of genus $g$ whose plat indices are $m$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:01:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yasuda","Jumpei",""]]}
{"id":"2308.14489","submitter":"Fabrice Martins","authors":"Fabrice Martins (1), Daniel Schaerer (2,3), Rui Marques-Chaves (2),\n  Ankur Upadhyaya (2) ((1) LUPM, CNRS & Montpellier University, (2) Geneva\n  University, (3) IRAP, CNRS)","title":"Inferring the presence of very massive stars in local star-forming\n  regions","comments":"16 pages, 10 figures + appendix. Accepted in Astronomy and\n  Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a study aiming at detecting VMS in local star-forming region from\nthe imprint they leave on the integrated UV and optical light. We analyzed a\nsample of 27 star-forming regions and galaxies in the local Universe. We\nselected sources with a metallicity close to that of the LMC. We defined\nempirical criteria to distinguish sources dominated by VMS and Wolf-Rayet stars\n(WR), using template spectra of VMS- and WR-dominated regions. We subsequently\nbuilt population synthesis models with an updated treatment of VMS. We show\nthat the UV range alone is not sufficient to distinguish between VMS- and\nWR-dominated sources. The region of the WR bumps in the optical breaks the\ndegeneracy. In particular, the morphology of the blue bump at 4640-4686 A is a\nkey diagnostic. Beyond the prototypical R136 region we identify two galaxies\nshowing clear signatures of VMS. In two other galaxies or regions the presence\nof VMS can be suspected, as already discussed in the literature. The stellar\npopulation is clearly dominated by WR stars in seven other sources. The most\nrecent BPASS population synthesis models can neither account for the strong\nHeII 1640 emission, nor for the shape of the blue bump in VMS- and WR-dominated\nsources. Our models that include VMS more realistically reproduce the\nUV-optical spectra of VMS-dominated sources. We conclude that VMS are present\nin some local star-forming regions, but that separating them from WR-dominated\npopulations requires optical spectroscopy with a high signal-to-noise ratio. A\nhigh equivalent width of HeII 1640 is not a sufficient condition for\nidentifying VMS. Populations synthesis models need to take VMS into account by\nincorporating not only evolutionary tracks, but also dedicated spectral\nlibraries. Finally, we stress that the treatment of WR stars needs to be\nimproved as well.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:02:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Martins","Fabrice",""],["Schaerer","Daniel",""],["Marques-Chaves","Rui",""],["Upadhyaya","Ankur",""]]}
{"id":"2308.14490","submitter":"Yiqing Zhou","authors":"Yiqing Zhou, Daan Huybrechs","title":"Efficient least squares approximation and collocation methods using\n  radial basis functions","comments":"23 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We describe an efficient method for the approximation of functions using\nradial basis functions (RBFs), and extend this to a solver for boundary value\nproblems on irregular domains. The method is based on RBFs with centers on a\nregular grid defined on a bounding box, with some of the centers outside the\ncomputational domain. The equation is discretized using collocation with\noversampling, with collocation points inside the domain only, resulting in a\nrectangular linear system to be solved in a least squares sense. The goal of\nthis paper is the efficient solution of that rectangular system. We show that\nthe least squares problem splits into a regular part, which can be expedited\nwith the FFT, and a low rank perturbation, which is treated separately with a\ndirect solver. The rank of the perturbation is influenced by the irregular\nshape of the domain and by the weak enforcement of boundary conditions at\npoints along the boundary. The solver extends the AZ algorithm which was\npreviously proposed for function approximation involving frames and other\novercomplete sets. The solver has near optimal log-linear complexity for\nunivariate problems, and loses optimality for higher-dimensional problems but\nremains faster than a direct solver.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:07:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhou","Yiqing",""],["Huybrechs","Daan",""]]}
{"id":"2308.14491","submitter":"Chavdar Dangalchev","authors":"Chavdar Dangalchev","title":"Closeness of Some Line Graphs","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Closeness is an important characteristic of networks. In this article we will\ncalculate the closeness of line graphs of some basic graphs and the closeness\nof line graphs of connected by a bridge two basic graphs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:08:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dangalchev","Chavdar",""]]}
{"id":"2308.14492","submitter":"Zhongang Cai","authors":"Zhongang Cai, Liang Pan, Chen Wei, Wanqi Yin, Fangzhou Hong, Mingyuan\n  Zhang, Chen Change Loy, Lei Yang, Ziwei Liu","title":"PointHPS: Cascaded 3D Human Pose and Shape Estimation from Point Clouds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human pose and shape estimation (HPS) has attracted increasing attention in\nrecent years. While most existing studies focus on HPS from 2D images or videos\nwith inherent depth ambiguity, there are surging need to investigate HPS from\n3D point clouds as depth sensors have been frequently employed in commercial\ndevices. However, real-world sensory 3D points are usually noisy and\nincomplete, and also human bodies could have different poses of high diversity.\nTo tackle these challenges, we propose a principled framework, PointHPS, for\naccurate 3D HPS from point clouds captured in real-world settings, which\niteratively refines point features through a cascaded architecture.\nSpecifically, each stage of PointHPS performs a series of downsampling and\nupsampling operations to extract and collate both local and global cues, which\nare further enhanced by two novel modules: 1) Cross-stage Feature Fusion (CFF)\nfor multi-scale feature propagation that allows information to flow effectively\nthrough the stages, and 2) Intermediate Feature Enhancement (IFE) for\nbody-aware feature aggregation that improves feature quality after each stage.\nTo facilitate a comprehensive study under various scenarios, we conduct our\nexperiments on two large-scale benchmarks, comprising i) a dataset that\nfeatures diverse subjects and actions captured by real commercial sensors in a\nlaboratory environment, and ii) controlled synthetic data generated with\nrealistic considerations such as clothed humans in crowded outdoor scenes.\nExtensive experiments demonstrate that PointHPS, with its powerful point\nfeature extraction and processing scheme, outperforms State-of-the-Art methods\nby significant margins across the board. Homepage:\nhttps://caizhongang.github.io/projects/PointHPS/.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:10:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cai","Zhongang",""],["Pan","Liang",""],["Wei","Chen",""],["Yin","Wanqi",""],["Hong","Fangzhou",""],["Zhang","Mingyuan",""],["Loy","Chen Change",""],["Yang","Lei",""],["Liu","Ziwei",""]]}
{"id":"2308.14493","submitter":"Apurba Das","authors":"Hriday G, Pranav Saikiran Sista, Apurba Das","title":"Efficient Batch Dynamic Graphlet Counting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graphlet counting is an important problem as it has numerous applications in\nseveral fields, including social network analysis, biological network analysis,\ntransaction network analysis, etc. Most of the practical networks are dynamic.\nA graphlet is a subgraph with a fixed number of vertices and can be induced or\nnon-induced. There are several works for counting graphlets in a static network\nwhere graph topology never changes. Surprisingly, there have been no scalable\nand practical algorithms for maintaining all fixed-sized graphlets in a dynamic\nnetwork where the graph topology changes over time. We are the first to propose\nan efficient algorithm for maintaining graphlets in a fully dynamic network.\nOur algorithm is efficient because (1) we consider only the region of changes\nin the graph for updating the graphlet count, and (2) we use an efficient\nalgorithm for counting graphlets in the region of change. We show by\nexperimental evaluation that our technique is more than 10x faster than the\nbaseline approach.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:11:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["G","Hriday",""],["Sista","Pranav Saikiran",""],["Das","Apurba",""]]}
{"id":"2308.14494","submitter":"Tanay Kumar","authors":"Tanay Kumar and Mangal Kothari","title":"Insights to the Forensic Investigation of a Custom Built UAV","comments":"The presented methodology can be extended to crash analysis and other\n  scenarios. 16 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Unmanned Aerial Vehicles (UAVs) have revolutionized numerous application\nfields since their introduction. Alongside this, advancements in mechanics and\nelectronics have simplified and decreased the cost of system design. As a\nconsequence, UAVs have dominated the global market across all sectors from\nrecreational products to military applications. However, the widespread use of\nUAVs has also contributed to an increase in criminal activity involving them.\nUAVs have become a common means of delivering narcotics, arms, and ammunition,\ncollecting sensitive personal information, and snooping in restricted areas,\namong other activities. This could constitute a threat to national security.\nDespite its growing significance, UAV forensics is still a relatively\nunexplored field of study. In this paper, we present new insights on UAV\nforensic analysis in terms of preliminary analysis, accessing the digital\ncontainers of the UAV, and retrieving vital data. With the aid of a simulated\nscenario, a comprehensive methodology for the analysis of retrieved data to\nestablish conclusions on the flight path, source of origin, recover flight\ndata, and acquire media file content is presented.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:12:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kumar","Tanay",""],["Kothari","Mangal",""]]}
{"id":"2308.14495","submitter":"Thomas Michelitsch","authors":"Teo Granger, Thomas Michelitsch, Bernard Collet, Michael Bestehorn,\n  Alejandro Riascos","title":"Compartment model with retarded transition rates","comments":"Conference proceedings (Conference: From the nonlinear dynamical\n  systems theory to observational chaos, October 9-11, 2023 - Toulouse), 6\n  Pages, 3 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE physics.soc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our study is devoted to a four-compartment epidemic model of a constant\npopulation of independent random walkers. Each walker is in one of four\ncompartments (S-susceptible, C-infected but not infectious (period of\nincubation), I-infected and infectious, R-recovered and immune) characterizing\nthe states of health. The walkers navigate independently on a periodic 2D\nlattice. Infections occur by collisions of susceptible and infectious walkers.\nOnce infected, a walker undergoes the delayed cyclic transition pathway S $\\to$\nC $\\to$ I $\\to$ R $\\to$ S. The random delay times between the transitions\n(sojourn times in the compartments) are drawn from independent probability\ndensity functions (PDFs). We analyze the existence of the endemic equilibrium\nand stability of the globally healthy state and derive a condition for the\nspread of the epidemics which we connect with the basic reproduction number\n$R_0>1$. We give quantitative numerical evidence that a simple approach based\non random walkers offers an appropriate microscopic picture of the dynamics for\nthis class of epidemics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:13:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Granger","Teo",""],["Michelitsch","Thomas",""],["Collet","Bernard",""],["Bestehorn","Michael",""],["Riascos","Alejandro",""]]}
{"id":"2308.14496","submitter":"Tushar Shankar Walunj","authors":"Tushar Shankar Walunj, Shiksha Singhal, Jayakrishnan Nair and\n  Veeraruna Kavitha","title":"On the interplay between pricing, competition and QoS in ride-hailing","comments":"arXiv admin note: text overlap with arXiv:2208.01973","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.PR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We analyse a non-cooperative game between two competing ride-hailing\nplatforms, each of which is modeled as a two-sided queueing system, where\ndrivers (with a limited level of patience) are assumed to arrive according to a\nPoisson process at a fixed rate, while the arrival process of (price-sensitive)\npassengers is split across the two platforms based on Quality of Service (QoS)\nconsiderations. As a benchmark, we also consider a monopolistic scenario, where\neach platform gets half the market share irrespective of its pricing strategy.\nThe key novelty of our formulation is that the total market share is fixed\nacross the platforms. The game thus captures the competition between the\nplatforms over market share, with pricing being the lever used by each platform\nto influence its share of the market. The market share split is modeled via two\ndifferent QoS metrics: (i) probability that an arriving passenger gets a ride\n(driver availability), and (ii) probability that an arriving passenger gets an\nacceptable ride (driver availability and acceptable price). The platform aims\nto maximize the rate of revenue generated from matching drivers and passengers.\n  In each of the above settings, we analyse the equilibria associated with the\ngame in a certain limiting regime, where driver patience is scaled to infinity.\nWe also show that these equilibria remain relevant in the more practically\nmeaningful `pre-limit,' where drivers are highly (but not infinitely) patient.\nInterestingly, under the second QoS metric, we show that for a certain range of\nsystem parameters, no pure Nash equilibrium exists. Instead, we demonstrate a\nnovel solution concept called an \\textit{equilibrium cycle}, which has\ninteresting dynamic connotations. Our results highlight the interplay between\ncompetition, passenger-side price sensitivity, and passenger/driver arrival\nrates.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:15:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Walunj","Tushar Shankar",""],["Singhal","Shiksha",""],["Nair","Jayakrishnan",""],["Kavitha","Veeraruna",""]]}
{"id":"2308.14497","submitter":"Shiling Liang","authors":"Shiling Liang, Simone Pigolotti","title":"Thermodynamic bounds on time-reversal asymmetry","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantifying irreversibility of a system using finite information constitutes\na major challenge in stochastic thermodynamics. We introduce an observable that\nquantifies the time-reversal asymmetry between two states after a finite time\nlag. Our central result is a bound on the time-reversal asymmetry in terms of\nthe total cycle affinity driving the system out of equilibrium. Our result\nleads to further thermodynamic bounds on the asymmetry of directed fluxes; on\nthe asymmetry of finite-time cross-correlation; and on the cycle affinity of\ncoarse-grained dynamics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:17:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liang","Shiling",""],["Pigolotti","Simone",""]]}
{"id":"2308.14498","submitter":"Sueda Taner","authors":"Sueda Taner, Victoria Palhares, and Christoph Studer","title":"Channel Charting in Real-World Coordinates","comments":"To be presented at IEEE GLOBECOM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Channel charting is an emerging self-supervised method that maps channel\nstate information (CSI) to a low-dimensional latent space, which represents\npseudo-positions of user equipments (UEs). While this latent space preserves\nlocal geometry, i.e., nearby UEs are nearby in latent space, the\npseudo-positions are in arbitrary coordinates and global geometry is not\npreserved. In order to enable channel charting in real-world coordinates, we\npropose a novel bilateration loss for multipoint wireless systems in which only\nthe access point (AP) locations are known--no geometrical models or\nground-truth UE position information is required. The idea behind this\nbilateration loss is to compare the received power at pairs of APs in order to\ndetermine whether a UE should be placed closer to one AP or the other in latent\nspace. We demonstrate the efficacy of our method using channel vectors from a\ncommercial ray-tracer.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:19:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Taner","Sueda",""],["Palhares","Victoria",""],["Studer","Christoph",""]]}
{"id":"2308.14499","submitter":"Michael K\\\"olle","authors":"Michael K\\\"olle, Volker Walter, Ivan Shiller, Uwe Soergel","title":"Efficient and Accurate Tree Detection from 3D Point Clouds through Paid\n  Crowdsourcing","comments":"This paper can be considered an extension of the approach presented\n  by Walter et al.\n  (https://isprs-annals.copernicus.org/articles/V-4-2020/49/2020/)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurate tree detection is of growing importance in applications such as\nurban planning, forest inventory, and environmental monitoring. In this\narticle, we present an approach to creating tree maps by annotating them in 3D\npoint clouds. Point cloud representations allow the precise identification of\ntree positions, particularly stem locations, and their heights. Our method\nleverages human computational power through paid crowdsourcing, employing a web\ntool designed to enable even non-experts to effectively tackle the task. The\nprimary focus of this paper is to discuss the web tool's development and\nstrategies to ensure high-quality tree annotations despite encountering noise\nin the crowdsourced data. Following our methodology, we achieve quality\nmeasures surpassing 90% for various challenging test sets of diverse\ncomplexities. We emphasize that our tree map creation process, including\ninitial point cloud collection, can be completed within 1-2 days.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:19:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["K\u00f6lle","Michael",""],["Walter","Volker",""],["Shiller","Ivan",""],["Soergel","Uwe",""]]}
{"id":"2308.14500","submitter":"Di Yang","authors":"Di Yang, Yaohui Wang, Antitza Dantcheva, Quan Kong, Lorenzo Garattoni,\n  Gianpiero Francesca, Francois Bremond","title":"LAC: Latent Action Composition for Skeleton-based Action Segmentation","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Skeleton-based action segmentation requires recognizing composable actions in\nuntrimmed videos. Current approaches decouple this problem by first extracting\nlocal visual features from skeleton sequences and then processing them by a\ntemporal model to classify frame-wise actions. However, their performances\nremain limited as the visual features cannot sufficiently express composable\nactions. In this context, we propose Latent Action Composition (LAC), a novel\nself-supervised framework aiming at learning from synthesized composable\nmotions for skeleton-based action segmentation. LAC is composed of a novel\ngeneration module towards synthesizing new sequences. Specifically, we design a\nlinear latent space in the generator to represent primitive motion. New\ncomposed motions can be synthesized by simply performing arithmetic operations\non latent representations of multiple input skeleton sequences. LAC leverages\nsuch synthesized sequences, which have large diversity and complexity, for\nlearning visual representations of skeletons in both sequence and frame spaces\nvia contrastive learning. The resulting visual encoder has a high expressive\npower and can be effectively transferred onto action segmentation tasks by\nend-to-end fine-tuning without the need for additional temporal models. We\nconduct a study focusing on transfer-learning and we show that representations\nlearned from pre-trained LAC outperform the state-of-the-art by a large margin\non TSU, Charades, PKU-MMD datasets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:20:48 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 14:18:58 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 12:02:47 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Yang","Di",""],["Wang","Yaohui",""],["Dantcheva","Antitza",""],["Kong","Quan",""],["Garattoni","Lorenzo",""],["Francesca","Gianpiero",""],["Bremond","Francois",""]]}
{"id":"2308.14501","submitter":"Hisakazu Minakata","authors":"Hisakazu Minakata","title":"Neutrino amplitude decomposition, $S$ matrix rephasing invariance, and\n  reparametrization symmetry","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The $S$ matrix rephasing invariance is one of the fundamental principles of\nquantum mechanics that originates in its probabilistic interpretation. For a\ngiven $S$ matrix which describes neutrino oscillation, one can define the two\ndifferent rephased amplitudes $S_{\\alpha \\beta}^{ \\text{Reph-1} } \\equiv e^{ i\n(\\lambda_{1} / 2E) x} S_{\\alpha \\beta}$ and $S_{\\alpha \\beta}^{ \\text{Reph-2} }\n\\equiv e^{ i (\\lambda_{2} / 2E) x} S_{\\alpha \\beta}$, which are physically\nequivalent to each other, where $\\lambda_{k} / 2E$ denotes the energy\neigenvalue of the $k$-th mass eigenstate. The leading-order terms in $S_{\\alpha\n\\beta}^{ \\text{Reph-1} }$ and $S_{\\alpha \\beta}^{ \\text{Reph-2} }$ describe,\nrespectively, the 1-3 and 2-3 level crossings around the atmospheric-scale\nresonance. We point out that the transformation of the reparametrization (Rep)\nsymmetry obtained with ``Symmetry Finder'' maps $S_{\\alpha \\beta}^{\n\\text{Reph-1} }$ to $S_{\\alpha \\beta}^{ \\text{Reph-2} }$, and vice versa,\nproviding a local and manifest realization of the $S$ matrix rephasing\ninvariance by the Rep symmetry. It strongly suggests a quantum mechanical\nnature of the Rep symmetry. An all-order treatment of the intimate\nrelationships between the Rep symmetry and $S$ matrix rephasing invariance is\nattempted.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:21:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Minakata","Hisakazu",""]]}
{"id":"2308.14502","submitter":"Sohan Kumar Jha","authors":"Sohan Kumar Jha","title":"Superradiance scattering of scalar, electromagnetic, and gravitational\n  fields and thin accretion disk around non-commutating Kerr black hole","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the non-commutative(NC) Kerr black hole where the mass of the\ncentral object is smeared over a region of linear size $\\sqrt{b}$, $b$ is the\nstrength of the NC character of spacetime. For the spacetime under\nconsideration, we calculate the amplification factor for scalar,\nelectromagnetic, and gravitational fields, and study various properties of a\nthin accretion disk. The expression for the amplification factor is obtained\nwith the help of the asymptotic matching technique. The amplification factor is\nthen plotted against frequency for various values of the spin $a$ and the NC\nparameter $b$. We find that though the amplification factor increases with $a$\nbut decreases with $b$, the cut-off frequency up to which we have amplification\nincreases with $a$ and $b$. We then study the effect of the spin and the NC\nnature of spacetime on the energy flux, temperature distribution, emission\nspectrum, energy conversion efficiency, and the radius of the innermost stable\ncircular orbit of a thin accretion disk around the black hole with the help of\nthe steady-state Novikov-Thorne model. Our study reveals that these quantities\nincrease with the spin and the NC parameter. We also find that the disk around\nthe NC Kerr black is hotter and more luminous than that around the Kerr black\nhole and the NC Schwarzschild black hole. We can conclusively infer from our\ninvestigation that the NC nature of spacetime has a significant impact on the\nsuperradiance phenomenon as well as on various properties of thin accretion\ndisks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:22:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jha","Sohan Kumar",""]]}
{"id":"2308.14503","submitter":"Yves Auad","authors":"Yves Auad and Jassem Baaboura and Jean-Denis Blazit and Marcel Tenc\\'e\n  and Odile St\\'ephan and Mathieu Kociak and Luiz H. G. Tizei","title":"Time calibration studies for the Timepix3 hybrid pixel detector in\n  electron microscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Direct electron detection is currently revolutionizing many fields of\nelectron microscopy due to its lower noise, its reduced point-spread function,\nand its increased quantum efficiency. More specifically to this work, Timepix3\nis a hybrid-pixel direct electron detector capable of outputting temporal\ninformation of individual hits in its pixel array. Its architecture results in\na data-driven detector, also called event-based, in which individual hits\ntrigger the data off the chip for readout as fast as possible. The presence of\na pixel threshold value results in an almost readout-noise-free detector while\nalso defining the hit time of arrival and the time the signal stays over the\npixel threshold. In this work, we have performed various experiments to\ncalibrate and correct the Timepix3 temporal information, specifically in the\ncontext of electron microscopy. These include the energy calibration, and the\ntime-walk and pixel delay corrections, reaching an average temporal resolution\nthroughout the entire pixel matrix of $1.37 \\pm 0.04$ ns. Additionally, we have\nalso studied cosmic rays tracks to characterize the charge dynamics along the\nvolume of the sensor layer, allowing us to estimate the limits of the\ndetector's temporal response depending on different bias voltages, sensor\nthickness, and the electron beam ionization volume. We have estimated the\nuncertainty due to the ionization volume ranging from about 0.8 ns for 60 keV\nelectrons to 8.8 ns for 300 keV electrons.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:23:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Auad","Yves",""],["Baaboura","Jassem",""],["Blazit","Jean-Denis",""],["Tenc\u00e9","Marcel",""],["St\u00e9phan","Odile",""],["Kociak","Mathieu",""],["Tizei","Luiz H. G.",""]]}
{"id":"2308.14504","submitter":"Brandon Redding","authors":"Brandon Redding, Joseph B. Murray, Joseph D. Hart, Zheyuan Zhu, Shuo\n  S. Pang, Raktim Sarma","title":"Fiber optic computing using distributed feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.ET","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The widespread adoption of machine learning and other matrix intensive\ncomputing algorithms has inspired renewed interest in analog optical computing,\nwhich has the potential to perform large-scale matrix multiplications with\nsuperior energy scaling and lower latency than digital electronics. However,\nmost existing optical techniques rely on spatial multiplexing to encode and\nprocess data in parallel, requiring a large number of high-speed modulators and\ndetectors. More importantly, most of these architectures are restricted to\nperforming a single kernel convolution operation per layer. Here, we introduce\na fiber-optic computing architecture based on temporal multiplexing and\ndistributed feedback that performs multiple convolutions on the input data in a\nsingle layer (i.e. grouped convolutions). Our approach relies on temporally\nencoding the input data as an optical pulse train and injecting it into an\noptical fiber where partial reflectors create a series of delayed copies of the\ninput vector. In this work, we used Rayleigh backscattering in standard single\nmode fiber as the partial reflectors to encode a series of random kernel\ntransforms. We show that this technique effectively performs a random\nnon-linear projection of the input data into a higher dimensional space which\ncan facilitate a variety of computing tasks, including non-linear principal\ncomponent analysis, support vector machines, or extreme learning machines. By\nusing a passive fiber to perform the kernel transforms, this approach enables\nefficient energy scaling with orders of magnitude lower power consumption than\nGPUs, while using a high-speed modulator and detector maintains low latency and\nhigh data-throughput. Finally, our approach is readily integrated with\nfiber-optic communication links, enabling additional applications such as\nprocessing remote sensing data transmitted in the analog domain.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:29:11 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Redding","Brandon",""],["Murray","Joseph B.",""],["Hart","Joseph D.",""],["Zhu","Zheyuan",""],["Pang","Shuo S.",""],["Sarma","Raktim",""]]}
{"id":"2308.14505","submitter":"Hiroko Solvang","authors":"H. Solvang, S. Imori, M. Biuw, U. Lindstr{\\o}m, and T. Haug","title":"Categorical data analysis using discretization of continuous variables\n  to investigate associations in marine ecosystems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Understanding and predicting interactions between predators and prey and\ntheir environment are fundamental for understanding food web structure,\ndynamics, and ecosystem function in both terrestrial and marine\necosystems.Thus, estimating the conditional associations between species and\ntheir environments is important for exploring connections or cooperative links\nin the ecosystem, which in turn can help to clarify such causal relationships.\nFor this purpose, a relevant and practical statistical method is required to\nlink presence/absence observations with biomass, abundance, and physical\nquantities obtained as continuous real values.These data are sometimes sparse\nin oceanic space and too short as time series data. To meet this challenge, we\nprovide an approach based on applying categorical data analysis to\npresent/absent observations and real-number data.This approach consists of a\ntwo-step procedure for categorical data analysis:1) finding the appropriate\nthreshold to discretize the real-number data for applying an independent\ntest;and 2) identifying the best conditional probability model to investigate\nthe possible associations among the data based on a statistical information\ncriterion.We conduct a simulation study to validate our proposed approach.\nFurthermore, the approach is applied to two datasets: 1) one collected during\nan international synoptic krill survey in the Scotia Sea west of the Antarctic\nPeninsula to investigate associations among krill, fin whale (Balaenoptera\nphysalus),surface temperature, depth, slope in depth, and temperature gradient;\n2) the other collected by ecosystem surveys conducted during August-September\nin 2014 - 2017 to investigate associations among common minke whales, the\npredatory fish Atlantic cod, and their main prey groups in Arctic Ocean waters\nto the west and north of Svalbard, Norway.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:38:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Solvang","H.",""],["Imori","S.",""],["Biuw","M.",""],["Lindstr\u00f8m","U.",""],["Haug","T.",""]]}
{"id":"2308.14506","submitter":"Filippo de Feo","authors":"Filippo de Feo","title":"Stochastic optimal control problems with delays in the state and in the\n  control via viscosity solutions and an economical application","comments":"arXiv admin note: substantial text overlap with arXiv:2302.08809","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.AP math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this manuscript we consider optimal control problems of deterministic and\nstochastic differential equations with delays in the state and in the control.\nFirst we prove an equivalent Markovian reformulation on Hilbert spaces of the\nstate equation. Then, using the dynamic programming approach for\ninfinite-dimensional systems, we prove that the value function is the unique\nviscosity solution of the infinite-dimensional Hamilton Jacobi Bellman\nequation. Finally we apply this result to a stochastic optimal advertising\nproblem with delays in the state and in the control.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:46:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["de Feo","Filippo",""]]}
{"id":"2308.14507","submitter":"Yihan Zhang","authors":"Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan, Marco Mondelli","title":"Spectral Estimators for Structured Generalized Linear Models via\n  Approximate Message Passing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST cs.IT cs.LG math.IT math.PR stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of parameter estimation from observations given by a\ngeneralized linear model. Spectral methods are a simple yet effective approach\nfor estimation: they estimate the parameter via the principal eigenvector of a\nmatrix obtained by suitably preprocessing the observations. Despite their wide\nuse, a rigorous performance characterization of spectral estimators, as well as\na principled way to preprocess the data, is available only for unstructured\n(i.e., i.i.d. Gaussian and Haar) designs. In contrast, real-world design\nmatrices are highly structured and exhibit non-trivial correlations. To address\nthis problem, we consider correlated Gaussian designs which capture the\nanisotropic nature of the measurements via a feature covariance matrix\n$\\Sigma$. Our main result is a precise asymptotic characterization of the\nperformance of spectral estimators in this setting. This then allows to\nidentify the optimal preprocessing that minimizes the number of samples needed\nto meaningfully estimate the parameter. Remarkably, such an optimal spectral\nestimator depends on $\\Sigma$ only through its normalized trace, which can be\nconsistently estimated from the data. Numerical results demonstrate the\nadvantage of our principled approach over previous heuristic methods.\n  Existing analyses of spectral estimators crucially rely on the rotational\ninvariance of the design matrix. This key assumption does not hold for\ncorrelated Gaussian designs. To circumvent this difficulty, we develop a novel\nstrategy based on designing and analyzing an approximate message passing\nalgorithm whose fixed point coincides with the desired spectral estimator. Our\nmethodology is general, and opens the way to the precise characterization of\nspiked matrices and of the corresponding spectral methods in a variety of\nsettings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:49:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Yihan",""],["Ji","Hong Chang",""],["Venkataramanan","Ramji",""],["Mondelli","Marco",""]]}
{"id":"2308.14508","submitter":"Yushi Bai","authors":"Yushi Bai, Xin Lv, Jiajie Zhang, Hongchang Lyu, Jiankai Tang, Zhidian\n  Huang, Zhengxiao Du, Xiao Liu, Aohan Zeng, Lei Hou, Yuxiao Dong, Jie Tang,\n  Juanzi Li","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context\n  Understanding","comments":"18 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although large language models (LLMs) demonstrate impressive performance for\nmany language tasks, most of them can only handle texts a few thousand tokens\nlong, limiting their applications on longer sequence inputs, such as books,\nreports, and codebases. Recent works have proposed methods to improve LLMs'\nlong context capabilities by extending context windows and more sophisticated\nmemory mechanisms. However, comprehensive benchmarks tailored for evaluating\nlong context understanding are lacking. In this paper, we introduce LongBench,\nthe first bilingual, multi-task benchmark for long context understanding,\nenabling a more rigorous evaluation of long context understanding. LongBench\ncomprises 21 datasets across 6 task categories in both English and Chinese,\nwith an average length of 6,711 words (English) and 13,386 characters\n(Chinese). These tasks cover key long-text application areas including\nsingle-doc QA, multi-doc QA, summarization, few-shot learning, synthetic tasks,\nand code completion. All datasets in LongBench are standardized into a unified\nformat, allowing for effortless automatic evaluation of LLMs. Upon\ncomprehensive evaluation of 8 LLMs on LongBench, we find that: (1) Commercial\nmodel (GPT-3.5-Turbo-16k) outperforms other open-sourced models, but still\nstruggles on longer contexts. (2) Scaled position embedding and fine-tuning on\nlonger sequences lead to substantial improvement on long context understanding.\n(3) Context compression technique such as retrieval brings improvement for\nmodel with weak ability on long contexts, but the performance still lags behind\nmodels that have strong long context understanding capability. The code and\ndatasets are available at https://github.com/THUDM/LongBench.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:53:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bai","Yushi",""],["Lv","Xin",""],["Zhang","Jiajie",""],["Lyu","Hongchang",""],["Tang","Jiankai",""],["Huang","Zhidian",""],["Du","Zhengxiao",""],["Liu","Xiao",""],["Zeng","Aohan",""],["Hou","Lei",""],["Dong","Yuxiao",""],["Tang","Jie",""],["Li","Juanzi",""]]}
{"id":"2308.14509","submitter":"Fengqi Song","authors":"Jingwen Guo, Liqin Zhou, Jianyang Ding, Gexing Qu, Zhengtai Liu, Yu\n  Du, Heng Zhang, Jiajun Li, Yiying Zhang, Fuwei Zhou, Wuyi Qi, Fengyi Guo,\n  Tianqi Wang, Fucong Fei, Yaobo Huang, Tian Qian, Dawei Shen, Hongming Weng,\n  Fengqi Song","title":"Magnetic kagome materials RETi3Bi4 family with weak interlayer\n  interactions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Kagome materials have attracted a surge of research interest recently,\nespecially for the ones combining with magnetism, and the ones with weak\ninterlayer interactions which can fabricate thin devices. However, kagome\nmaterials combining both characters of magnetism and weak interlayer\ninteractions are rare. Here we investigate a new family of titanium based\nkagome materials RETi3Bi4 (RE = Eu, Gd and Sm). The flakes of nanometer\nthickness of RETi3Bi4 can be obtained by exfoliation due to the weak interlayer\ninteractions. According to magnetic measurements, out-of-plane ferromagnetism,\nout-of-plane anti-ferromagnetism, and in-plane ferromagnetism are formed for RE\n= Eu, Gd, and Sm respectively. The magnetic orders are simple and the\nsaturation magnetizations can be relatively large since the rare earth elements\nsolely provide the magnetic moments. Further by angle-resolved photoemission\nspectroscopy (ARPES) and first-principles calculations, the electronic\nstructures of RETi3Bi4 are investigated. The ARPES results are consistent with\nthe calculations, indicating the bands characteristic with kagome sublattice in\nRETi3Bi4. We expect these materials to be promising candidates for observation\nof the exotic magnetic topological phases and the related topological quantum\ntransport studies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:55:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Jingwen",""],["Zhou","Liqin",""],["Ding","Jianyang",""],["Qu","Gexing",""],["Liu","Zhengtai",""],["Du","Yu",""],["Zhang","Heng",""],["Li","Jiajun",""],["Zhang","Yiying",""],["Zhou","Fuwei",""],["Qi","Wuyi",""],["Guo","Fengyi",""],["Wang","Tianqi",""],["Fei","Fucong",""],["Huang","Yaobo",""],["Qian","Tian",""],["Shen","Dawei",""],["Weng","Hongming",""],["Song","Fengqi",""]]}
{"id":"2308.14510","submitter":"Florian Debras","authors":"B. Klein, F. Debras, J.-F. Donati, T. Hood, C. Moutou, A. Carmona, M.\n  Ould-elkhim, B. B\\'ezard, B. Charnay, P. Fouqu\\'e, A. Masson, S. Vinatier, C.\n  Baruteau, I. Boisse, X. Bonfils, A. Chiavassa, X. Delfosse, W. Dethier, G.\n  Hebrard, F. Kiefer, J. Leconte, E. Martioli, V. Parmentier, P. Petit, W.\n  Pluriel, F. Selsis, L. Teinturier, P. Tremblin, M. Turbet, O. Venot","title":"ATMOSPHERIX: I- An open source high resolution transmission spectroscopy\n  pipeline for exoplanets atmospheres with SPIRou","comments":"Accepted in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Atmospheric characterisation of exoplanets from the ground is an actively\ngrowing field of research. In this context we have created the ATMOSPHERIX\nconsortium: a research project aimed at characterizing exoplanets atmospheres\nusing ground-based high resolution spectroscopy. This paper presents the\npublicly-available data analysis pipeline and demonstrates the robustness of\nthe recovered planetary parameters from synthetic data. Simulating planetary\ntransits using synthetic transmission spectra of a hot Jupiter that were\ninjected into real SPIRou observations of the non-transiting system Gl 15 A, we\nshow that our pipeline is successful at recovering the planetary signal and\ninput atmospheric parameters. We also introduce a deep learning algorithm to\noptimise data reduction which proves to be a reliable, alternative tool to the\ncommonly used principal component analysis. We estimate the level of\nuncertainties and possible biases when retrieving parameters such as\ntemperature and composition and hence the level of confidence in the case of\nretrieval from real data. Finally, we apply our pipeline onto two real transits\nof HD~189733 b observed with SPIRou and obtain similar results than in the\nliterature. In summary, we have developed a publicly available and robust\npipeline for the forthcoming studies of the targets to be observed in the\nframework of the ATMOSPHERIX consortium, which can easily be adapted to other\nhigh resolution instruments than SPIRou (e.g. VLT-CRIRES, MAROON-X, ELT-ANDES)\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:57:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Klein","B.",""],["Debras","F.",""],["Donati","J. -F.",""],["Hood","T.",""],["Moutou","C.",""],["Carmona","A.",""],["Ould-elkhim","M.",""],["B\u00e9zard","B.",""],["Charnay","B.",""],["Fouqu\u00e9","P.",""],["Masson","A.",""],["Vinatier","S.",""],["Baruteau","C.",""],["Boisse","I.",""],["Bonfils","X.",""],["Chiavassa","A.",""],["Delfosse","X.",""],["Dethier","W.",""],["Hebrard","G.",""],["Kiefer","F.",""],["Leconte","J.",""],["Martioli","E.",""],["Parmentier","V.",""],["Petit","P.",""],["Pluriel","W.",""],["Selsis","F.",""],["Teinturier","L.",""],["Tremblin","P.",""],["Turbet","M.",""],["Venot","O.",""]]}
{"id":"2308.14511","submitter":"Florian Debras","authors":"F. Debras, B. Klein, J.-F. Donati, T. Hood, C. Moutou, A. Carmona, B.\n  Charnay, B. B\\'ezard, P. Fouqu\\'e, A. Masson, S. Vinatier, C. Baruteau, I.\n  Boisse, X. Bonfils, A. Chiavassa, X. Delfosse, G. Hebrard, J. Leconte, E.\n  Martioli, M. Ould-elkhim, V. Parmentier, P. Petit, W. Pluriel, F. Selsis, L.\n  Teinturier, P. Tremblin, M. Turbet, O. Venot","title":"ATMOSPHERIX: II- Characterising exoplanet atmospheres through\n  transmission spectroscopy with SPIRou","comments":"Accepted in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  In a companion paper, we introduced a publicly-available pipeline to\ncharacterise exoplanet atmospheres through high-resolution spectroscopy. In\nthis paper, we use this pipeline to study the biases and degeneracies that\narise in atmospheric characterisation of exoplanets in near-infrared\nground-based transmission spectroscopy. We inject synthetic planetary transits\ninto sequences of SPIRou spectra of the well known M dwarf star Gl 15 A, and\nstudy the effects of different assumptions on the retrieval. We focus on (i)\nmass and radius uncertainties, (ii) non isothermal vertical profiles and (iii)\nidentification and retrieval of multiple species. We show that the\nuncertainties on mass and radius should be accounted for in retrievals and that\ndepth-dependent temperature information can be derived from high-resolution\ntransmission spectroscopy data. Finally, we discuss the impact of selecting\nwavelength orders in the retrieval and the issues that arise when trying to\nidentify a single species in a multi-species atmospheric model. This analysis\nallows us to understand better the results obtained through transmission\nspectroscopy and their limitations in preparation to the analysis of actual\nSPIRou data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:57:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Debras","F.",""],["Klein","B.",""],["Donati","J. -F.",""],["Hood","T.",""],["Moutou","C.",""],["Carmona","A.",""],["Charnay","B.",""],["B\u00e9zard","B.",""],["Fouqu\u00e9","P.",""],["Masson","A.",""],["Vinatier","S.",""],["Baruteau","C.",""],["Boisse","I.",""],["Bonfils","X.",""],["Chiavassa","A.",""],["Delfosse","X.",""],["Hebrard","G.",""],["Leconte","J.",""],["Martioli","E.",""],["Ould-elkhim","M.",""],["Parmentier","V.",""],["Petit","P.",""],["Pluriel","W.",""],["Selsis","F.",""],["Teinturier","L.",""],["Tremblin","P.",""],["Turbet","M.",""],["Venot","O.",""]]}
{"id":"2308.14512","submitter":"Tony Lindeberg","authors":"Tony Lindeberg","title":"A time-causal and time-recursive analogue of the Gabor transform","comments":"9 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a time-causal analogue of the Gabor filter, as well as a\nboth time-causal and time-recursive analogue of the Gabor transform, where the\nproposed time-causal representations obey both temporal scale covariance and a\ncascade property with a simplifying kernel over temporal scales. The motivation\nbehind these constructions is to enable theoretically well-founded\ntime-frequency analysis over multiple temporal scales for real-time situations,\nor for physical or biological modelling situations, when the future cannot be\naccessed, and the non-causal access to future in Gabor filtering is therefore\nnot viable for a time-frequency analysis of the system.\n  We develop the theory for these representations, obtained by replacing the\nGaussian kernel in Gabor filtering with a time-causal kernel, referred to as\nthe time-causal limit kernel, which guarantees simplification properties from\nfiner to coarser levels of scales in a time-causal situation, similar as the\nGaussian kernel can be shown to guarantee over a non-causal temporal domain. In\nthese ways, the proposed time-frequency representations guarantee well-founded\ntreatment over multiple scales, in situations when the characteristic scales in\nthe signals, or physical or biological phenomena, to be analyzed may vary\nsubstantially, and additionally all steps in the time-frequency analysis have\nto be fully time-causal.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:58:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lindeberg","Tony",""]]}
{"id":"2308.14513","submitter":"Zhihao Li","authors":"Zhihao Li, Boyi Zou, Haiqin Wang, Jian Su, Dong Wang and Xinpeng Xu","title":"Deep learning-based computational method for soft matter dynamics: Deep\n  Onsager-Machlup method","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A deep learning-based computational method has been proposed for soft matter\ndynamics -- the deep Onsager-Machlup method (DOMM), which combines the brute\nforces of deep neural networks (DNNs) with the fundamental physics principle --\nOnsager-Machlup variational principle (OMVP). In the DOMM, the trial solution\nto the dynamics is constructed by DNNs that allow us to explore a rich and\ncomplex set of admissible functions. It outperforms the Ritz-type variational\nmethod where one has to impose carefully-chosen trial functions. This\ncapability endows the DOMM with the potential to solve rather complex problems\nin soft matter dynamics that involve multiple physics with multiple slow\nvariables, multiple scales, and multiple dissipative processes. Actually, the\nDOMM can be regarded as an extension of the deep Ritz method constructed using\nvariational formulations of physics models to solve static problems in physics\nas discussed in our former work [Wang et al, Soft Matter, 2022, 18, 6015-6031].\nIn this work, as the first step, we focus on the validation of the DOMM as a\nuseful computational method by using it to solve several typical soft matter\ndynamic problems: particle diffusion in dilute solutions, and two-phase\ndynamics with and without hydrodynamics. The predicted results agree very well\nwith the analytical solution or numerical solution from traditional\ncomputational methods. These results show the accuracy and convergence of DOMM\nand justify it as an alternative computational method for solving soft matter\ndynamics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:02:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Zhihao",""],["Zou","Boyi",""],["Wang","Haiqin",""],["Su","Jian",""],["Wang","Dong",""],["Xu","Xinpeng",""]]}
{"id":"2308.14514","submitter":"Ka\\u{g}an Kur\\c{s}ung\\\"oz","authors":"Ka\\u{g}an Kur\\c{s}ung\\\"oz, Halime \\\"Omr\\\"uuzun Seyrek","title":"A Decomposition of Cylindric Partitions and Cylindric Partitions into\n  Distinct Parts","comments":"Second version. Many inaccuracies are corrected thanks to Ole\n  Warnaar. 44 pages, 50+ figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that cylindric partitions are in one-to-one correspondence with a\npair which has an ordinary partition and a colored partition into distinct\nparts. Then, we show the general form of the generating function for cylindric\npartitions into distinct parts and give some examples. We prove part of a\nconjecture by Corteel, Dousse, and Uncu. The approaches and proofs are\nelementary and combinatorial.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:02:58 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:58:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kur\u015fung\u00f6z","Ka\u011fan",""],["Seyrek","Halime \u00d6mr\u00fcuzun",""]]}
{"id":"2308.14515","submitter":"Peyman Rostami","authors":"Peyman Rostami, Mathis Fricke, Simon Schubotz, Himanshu Patel, Reza\n  Azizmalayeri and G\\\"uunter K. Auernhammer","title":"Spreading of a viscoelastic drop on a solid substrate","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the spreading of viscous and viscoelastic drops on solid substrates\nwith different wettability. In the early stages of spreading, we find that the\nviscoelastic drop spreads with faster and a different power law than the\nNewtonian drop (i.e. aqueous glycerine solution) for the same zero shear rate\nviscosity. We argue that the effect of viscoelasticity is only observable for\nexperimental time scales in the order of the internal relaxation time of the\npolymer solution or longer times. Near the contact line, the effective\nviscosity is lower for the viscoelastic drop than for the Newtonian drop.\nTogether with its shear rate dependency, this difference in effective viscosity\ncan explain the different spreading dynamics. We support our experimental\nfindings with a simple perturbation model that qualitatively agrees with our\nfindings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:03:02 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 20:24:15 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rostami","Peyman",""],["Fricke","Mathis",""],["Schubotz","Simon",""],["Patel","Himanshu",""],["Azizmalayeri","Reza",""],["Auernhammer","G\u00fcunter K.",""]]}
{"id":"2308.14516","submitter":"Sophie A. Neubauer (N\\'ee Gruenbacher)","authors":"Julian Lemmel, Zahra Babaiee, Marvin Kleinlehner, Ivan Majic, Philipp\n  Neubauer, Johannes Scholz, Radu Grosu, Sophie A. Neubauer","title":"Prediction of Tourism Flow with Sparse Geolocation Data","comments":"Accepted for publication at the proceedings of the 5th International\n  Data Science Conference - iDSC2023. arXiv admin note: substantial text\n  overlap with arXiv:2206.13274","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Modern tourism in the 21st century is facing numerous challenges. Among these\nthe rapidly growing number of tourists visiting space-limited regions like\nhistorical cities, museums and bottlenecks such as bridges is one of the\nbiggest. In this context, a proper and accurate prediction of tourism volume\nand tourism flow within a certain area is important and critical for visitor\nmanagement tasks such as sustainable treatment of the environment and\nprevention of overcrowding. Static flow control methods like conventional\nlow-level controllers or limiting access to overcrowded venues could not solve\nthe problem yet. In this paper, we empirically evaluate the performance of\nstate-of-the-art deep-learning methods such as RNNs, GNNs, and Transformers as\nwell as the classic statistical ARIMA method. Granular limited data supplied by\na tourism region is extended by exogenous data such as geolocation trajectories\nof individual tourists, weather and holidays. In the field of visitor flow\nprediction with sparse data, we are thereby capable of increasing the accuracy\nof our predictions, incorporating modern input feature handling as well as\nmapping geolocation data on top of discrete POI data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:03:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lemmel","Julian",""],["Babaiee","Zahra",""],["Kleinlehner","Marvin",""],["Majic","Ivan",""],["Neubauer","Philipp",""],["Scholz","Johannes",""],["Grosu","Radu",""],["Neubauer","Sophie A.",""]]}
{"id":"2308.14517","submitter":"Bernard S. Kay","authors":"Bernard S. Kay (York)","title":"Quantum Field Theory in Curved Spacetime (2nd Edition)","comments":"35 pages, 7 figures, article prepared for the second edition of the\n  Encyclopaedia of Mathematical Physics, edited by M. Bojowald and R.J. Szabo,\n  to be published by Elsevier. arXiv admin note: text overlap with\n  arXiv:gr-qc/0601008","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The 2023 second edition of a 2006 encyclopedia article on mathematical\naspects of quantum field theory in curved spacetimes (QFTCST). Section titles\n[with titles of newly added subsections in square brackets] are: Introduction\nand preliminaries; Construction of a *-algebra for a real linear scalar field\non globally hyperbolic spacetimes and some general theorems, [More about\n(quasifree) Hadamard states]; Particle creation and the limitations of the\nparticle concept; Theory of the stress-energy tensor; More about the\nintersection of QFTCST with AQFT and the Fewster-Verch No-Go Theorem; Hawking\nand Unruh effects, [More about (classical and) quantum fields on black hole\nbackgrounds]; Non-globally hyperbolic spacetimes and the time-machine question,\n[More about QFT on non-globally hyperbolic spacetimes]; Other related topics\nand some warnings. The article contains many references. It also includes a\nreview of, and also compares and contrasts, recent results on the implications\nof QFTCST for the question of the instability of three sorts of Cauchy horizon\n-- first those inside black holes such as especially Reissner-Nordstr\\\"om-de\nSitter and Kerr-de Sitter, second the compactly generated Cauchy horizons of\nspacetimes in which time-machines get manufactured, and third the Cauchy\nhorizon of the spacetime diagram which is believed to describe evaporating\nblack holes and which underlies (one version of) the black hole\ninformation-loss puzzle.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:05:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kay","Bernard S.","","York"]]}
{"id":"2308.14518","submitter":"Stephane Robin","authors":"T\\^am Le Minh and Sophie Donnet and Fran\\c{c}ois Massol and St\\'ephane\n  Robin","title":"Hoeffding-type decomposition for $U$-statistics on bipartite networks","comments":"This work was partially supported by the grant ANR-18-CE02-0010-01 of\n  the French National Research Agency ANR (project EcoNet)","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider a broad class of random bipartite networks, the distribution of\nwhich is invariant under permutation within each type of nodes. We are\ninterested in $U$-statistics defined on the adjacency matrix of such a network,\nfor which we define a new type of Hoeffding decomposition. This decomposition\nenables us to characterize non-degenerate $U$-statistics -- which are then\nasymptotically normal -- and provides us with a natural and easy-to-implement\nestimator of their asymptotic variance. \\\\ We illustrate the use of this\ngeneral approach on some typical random graph models and use it to estimate or\ntest some quantities characterizing the topology of the associated network. We\nalso assess the accuracy and the power of the proposed estimates or tests, via\na simulation study.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:09:24 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 06:23:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Minh","T\u00e2m Le",""],["Donnet","Sophie",""],["Massol","Fran\u00e7ois",""],["Robin","St\u00e9phane",""]]}
{"id":"2308.14519","submitter":"Parth Bambhaniya","authors":"Saurabh, Parth Bambhaniya and Pankaj S. Joshi","title":"Imaging ultra-compact objects with radiative inefficient accretion flows","comments":"7 pages, 6 figures. arXiv admin note: text overlap with\n  arXiv:2202.00588","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent Event Horizon Telescope observations of M87* and Sgr A* strongly\nsuggests the presence of supermassive black hole at their respective cores. In\nthis work, we use the semi-analytic Radiatively Inefficient Accretion Flows\n(RIAF) model to investigate the resulting images of Joshi-Malafarina-Narayan\n(JMN-1) naked singularity and the Schwarzschild BH. We aim at choosing the\nJMN-1 naked singularity model and compare the synchrotron images with the\nSchwarzschild solution to search any distinct features which can distinguish\nthe two objects and find alternative to the black hole solution. We perform\ngeneral relativistic ray-tracing and radiative transfer simulations using\nBrahma code to generate synchrotron emission images utilising thermal\ndistribution function for emissivity and absorptivity. We investigate effects\nin the images by varying inclination angle, disk width and frequency. The\nshadow images simulated by the JMN-1 model closely resemble those generated by\nthe Schwarzschild black hole. When we compare these images, we find that the\ndisparities between them are minimal. We conduct simulations using various\nplasma parameters, but the resulting images remain largely consistent for both\nscenarios. This similarity is evident in the horizontal cross-sectional\nbrightness profiles of the two instances. Notably, the JMN-1 model exhibits\nslightly higher intensity in comparison to the Schwarzschild black hole. We\nconclude that JMN-1 presents itself as a viable substitute for the black hole\nscenario. This conclusion is not solely grounded in the fact that they are\nindistinguishable from their respective shadow observations, but also in the\nconsideration that JMN-1 emerges as an end state of a continual gravitational\ncollapse. This paradigm not only allows for constraints on spacetime but also\nprovides a good probe for the nature of the central compact object.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:11:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Saurabh","",""],["Bambhaniya","Parth",""],["Joshi","Pankaj S.",""]]}
{"id":"2308.14520","submitter":"Ioannis Oikonomidis","authors":"Ioannis Oikonomidis and Samis Trevezas","title":"Cumulative Link Mixed-Effects Models in the Service of Remote Sensing\n  Crop Progress Monitoring","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study introduces an innovative Cumulative Link Modeling approach to\nmonitor crop progress over large areas using remote sensing data. The models\nutilize the predictive attributes of calendar time, thermal time, and the\nNormalized Difference Vegetation Index (NDVI). Two distinct issues are tackled:\nreal-time crop progress prediction, and completed season fitting. In the\ncontext of prediction, the study presents two model variations, the standard\none based on the Multinomial distribution and a novel one based on the\nMultivariate Binomial distribution. In the context of fitting, random effects\nare incorporated to capture the inherent inter-seasonal variability, allowing\nthe estimation of biological parameters that govern crop development and\ndetermine stage completion requirements. Theoretical properties in terms of\nconsistency, asymptotic normality, and distribution-misspecification are\nreviewed. Model performance was evaluated on eight crops, namely corn, oats,\nsorghum, soybeans, winter wheat, alfalfa, dry beans, and millet, using in-situ\ndata from Nebraska, USA, spanning a 20-year period. The results demonstrate the\nwide applicability of this approach to different crops, providing real-time\npredictions of crop progress worldwide, solely utilizing open-access data. To\nfacilitate implementation, an ecosystem of R packages has been developed and\nmade publicly accessible under the name Ages of Man.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:12:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Oikonomidis","Ioannis",""],["Trevezas","Samis",""]]}
{"id":"2308.14521","submitter":"Nicole Merkle","authors":"Nicole Merkle, Ralf Mikut","title":"Context-Aware Composition of Agent Policies by Markov Decision Process\n  Entity Embeddings and Agent Ensembles","comments":"30 pages, 11 figures, 9 tables, 3 listings, Re-submitted to Semantic\n  Web Journal, Currently, under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.PF","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Computational agents support humans in many areas of life and are therefore\nfound in heterogeneous contexts. This means they operate in rapidly changing\nenvironments and can be confronted with huge state and action spaces. In order\nto perform services and carry out activities in a goal-oriented manner, agents\nrequire prior knowledge and therefore have to develop and pursue\ncontext-dependent policies. However, prescribing policies in advance is limited\nand inflexible, especially in dynamically changing environments. Moreover, the\ncontext of an agent determines its choice of actions. Since the environments\ncan be stochastic and complex in terms of the number of states and feasible\nactions, activities are usually modelled in a simplified way by Markov decision\nprocesses so that, e.g., agents with reinforcement learning are able to learn\npolicies, that help to capture the context and act accordingly to optimally\nperform activities. However, training policies for all possible contexts using\nreinforcement learning is time-consuming. A requirement and challenge for\nagents is to learn strategies quickly and respond immediately in cross-context\nenvironments and applications, e.g., the Internet, service robotics,\ncyber-physical systems. In this work, we propose a novel simulation-based\napproach that enables a) the representation of heterogeneous contexts through\nknowledge graphs and entity embeddings and b) the context-aware composition of\npolicies on demand by ensembles of agents running in parallel. The evaluation\nwe conducted with the \"Virtual Home\" dataset indicates that agents with a need\nto switch seamlessly between different contexts, can request on-demand composed\npolicies that lead to the successful completion of context-appropriate\nactivities without having to learn these policies in lengthy training steps and\nepisodes, in contrast to agents that use reinforcement learning.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:13:36 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 11:56:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Merkle","Nicole",""],["Mikut","Ralf",""]]}
{"id":"2308.14522","submitter":"Ziwei Zhang","authors":"Ziwei Zhang, Haoyang Li, Zeyang Zhang, Yijian Qin, Xin Wang, Wenwu Zhu","title":"Large Graph Models: A Perspective","comments":"Preliminary version. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Large models have emerged as the most recent groundbreaking achievements in\nartificial intelligence, and particularly machine learning. However, when it\ncomes to graphs, large models have not achieved the same level of success as in\nother fields, such as natural language processing and computer vision. In order\nto promote applying large models for graphs forward, we present a perspective\npaper to discuss the challenges and opportunities associated with developing\nlarge graph models. First, we discuss the desired characteristics of large\ngraph models. Then, we present detailed discussions from three key\nperspectives: representation basis, graph data, and graph models. In each\ncategory, we provide a brief overview of recent advances and highlight the\nremaining challenges together with our visions. Finally, we discuss valuable\napplications of large graph models. We believe this perspective paper is able\nto encourage further investigations into large graph models, ultimately pushing\nus one step closer towards artificial general intelligence (AGI).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:17:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Ziwei",""],["Li","Haoyang",""],["Zhang","Zeyang",""],["Qin","Yijian",""],["Wang","Xin",""],["Zhu","Wenwu",""]]}
{"id":"2308.14523","submitter":"Benoit-Marie Robaglia","authors":"Beno\\^it-Marie Robaglia, Marceau Coupechoux, Dimitrios Tsilimantos","title":"Deep Reinforcement Learning for Uplink Scheduling in NOMA-URLLC Networks","comments":"35 pages, 11 figures, under review at the IEEE Transactions on\n  Machine Learning in Communications and Networking journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article addresses the problem of Ultra Reliable Low Latency\nCommunications (URLLC) in wireless networks, a framework with particularly\nstringent constraints imposed by many Internet of Things (IoT) applications\nfrom diverse sectors. We propose a novel Deep Reinforcement Learning (DRL)\nscheduling algorithm, named NOMA-PPO, to solve the Non-Orthogonal Multiple\nAccess (NOMA) uplink URLLC scheduling problem involving strict deadlines. The\nchallenge of addressing uplink URLLC requirements in NOMA systems is related to\nthe combinatorial complexity of the action space due to the possibility to\nschedule multiple devices, and to the partial observability constraint that we\nimpose to our algorithm in order to meet the IoT communication constraints and\nbe scalable. Our approach involves 1) formulating the NOMA-URLLC problem as a\nPartially Observable Markov Decision Process (POMDP) and the introduction of an\nagent state, serving as a sufficient statistic of past observations and\nactions, enabling a transformation of the POMDP into a Markov Decision Process\n(MDP); 2) adapting the Proximal Policy Optimization (PPO) algorithm to handle\nthe combinatorial action space; 3) incorporating prior knowledge into the\nlearning agent with the introduction of a Bayesian policy. Numerical results\nreveal that not only does our approach outperform traditional multiple access\nprotocols and DRL benchmarks on 3GPP scenarios, but also proves to be robust\nunder various channel and traffic configurations, efficiently exploiting\ninherent time correlations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:18:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Robaglia","Beno\u00eet-Marie",""],["Coupechoux","Marceau",""],["Tsilimantos","Dimitrios",""]]}
{"id":"2308.14524","submitter":"Nassim Sehad","authors":"Nassim Sehad, Xinyi Tu, Akash Rajasekaran, Hamed Hellaoui, Riku\n  J\\\"antti, and M\\'erouane Debbah","title":"Towards enabling reliable immersive teleoperation through Digital Twin:\n  A UAV command and control use case","comments":"Accepted by IEEE Globecom 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.MM cs.NI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper addresses the challenging problem of enabling reliable immersive\nteleoperation in scenarios where an Unmanned Aerial Vehicle (UAV) is remotely\ncontrolled by an operator via a cellular network. Such scenarios can be quite\ncritical particularly when the UAV lacks advanced equipment (e.g., Lidar-based\nauto stop) or when the network is subject to some performance constraints\n(e.g., delay). To tackle these challenges, we propose a novel architecture\nleveraging Digital Twin (DT) technology to create a virtual representation of\nthe physical environment. This virtual environment accurately mirrors the\nphysical world, accounting for 3D surroundings, weather constraints, and\nnetwork limitations. To enhance teleoperation, the UAV in the virtual\nenvironment is equipped with advanced features that maybe absent in the real\nUAV. Furthermore, the proposed architecture introduces an intelligent logic\nthat utilizes information from both virtual and physical environments to\napprove, deny, or correct actions initiated by the UAV operator. This\nanticipatory approach helps to mitigate potential risks. Through a series of\nfield trials, we demonstrate the effectiveness of the proposed architecture in\nsignificantly improving the reliability of UAV teleoperation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:19:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sehad","Nassim",""],["Tu","Xinyi",""],["Rajasekaran","Akash",""],["Hellaoui","Hamed",""],["J\u00e4ntti","Riku",""],["Debbah","M\u00e9rouane",""]]}
{"id":"2308.14525","submitter":"Junyu Zhu","authors":"Junyu Zhu, Lina Liu, Yu Tang, Feng Wen, Wanlong Li and Yong Liu","title":"Semi-Supervised Learning for Visual Bird's Eye View Semantic\n  Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual bird's eye view (BEV) semantic segmentation helps autonomous vehicles\nunderstand the surrounding environment only from images, including static\nelements (e.g., roads) and dynamic elements (e.g., vehicles, pedestrians).\nHowever, the high cost of annotation procedures of full-supervised methods\nlimits the capability of the visual BEV semantic segmentation, which usually\nneeds HD maps, 3D object bounding boxes, and camera extrinsic matrixes. In this\npaper, we present a novel semi-supervised framework for visual BEV semantic\nsegmentation to boost performance by exploiting unlabeled images during the\ntraining. A consistency loss that makes full use of unlabeled data is then\nproposed to constrain the model on not only semantic prediction but also the\nBEV feature. Furthermore, we propose a novel and effective data augmentation\nmethod named conjoint rotation which reasonably augments the dataset while\nmaintaining the geometric relationship between the front-view images and the\nBEV semantic segmentation. Extensive experiments on the nuScenes and Argoverse\ndatasets show that our semi-supervised framework can effectively improve\nprediction accuracy. To the best of our knowledge, this is the first work that\nexplores improving visual BEV semantic segmentation performance using unlabeled\ndata. The code will be publicly available.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:23:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Junyu",""],["Liu","Lina",""],["Tang","Yu",""],["Wen","Feng",""],["Li","Wanlong",""],["Liu","Yong",""]]}
{"id":"2308.14526","submitter":"Igor Spiridonov","authors":"Alexander Guterman, Igor Spiridonov","title":"On linear preservers of permanental rank","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let ${\\rm Mat}_n(\\mathbb{F})$ denote the set of square $n\\times n$ matrices\nover a field $\\mathbb{F}$ of characteristic different from two. The permanental\nrank ${\\rm prk}\\,(A)$ of a matrix $A \\in{\\rm Mat}_{n}(\\mathbb{F})$ is the size\nof the maximal square submatrix in $A$ with nonzero permanent. By $\\Lambda^{k}$\nand $\\Lambda^{\\leq k}$ we denote the subsets of matrices $A \\in {\\rm\nMat}_{n}(\\mathbb{F})$ with ${\\rm prk}\\,(A) = k$ and ${\\rm prk}\\,(A) \\leq k$,\nrespectively. In this paper for each $1 \\leq k \\leq n-1$ we obtain a complete\ncharacterization of linear maps $T: {\\rm Mat}_{n}(\\mathbb{F}) \\to {\\rm\nMat}_{n}(\\mathbb{F})$ satisfying $T(\\Lambda^{\\leq k}) = \\Lambda^{\\leq k}$ or\nbijective linear maps satisfying $T(\\Lambda^{\\leq k}) \\subseteq \\Lambda^{\\leq\nk}$. Moreover, we show that if $\\mathbb{F}$ is an infinite field, then\n$\\Lambda^{k}$ is Zariski dense in $\\Lambda^{\\leq k}$ and apply this to describe\nsuch bijective linear maps satisfying $T(\\Lambda^{k}) \\subseteq \\Lambda^{k}$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:27:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guterman","Alexander",""],["Spiridonov","Igor",""]]}
{"id":"2308.14527","submitter":"Jie Li","authors":"Jie Li, Yi Liu, Xiaohu Tang, Yunghsiang S. Han, Bo Bai, and Gong Zhang","title":"MDS Array Codes With Small Sub-packetization Levels and Small Repair\n  Degrees","comments":"Submitted to the IEEE Transactions on Information Theory","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-rate minimum storage regenerating (MSR) codes are known to require a\nlarge sub-packetization level, which can make meta-data management difficult\nand hinder implementation in practical systems. A few maximum distance\nseparable (MDS) array code constructions have been proposed to attain a much\nsmaller sub-packetization level by sacrificing a bit of repair bandwidth.\nHowever, to the best of our knowledge, only one construction by Guruswami et\nal. can support the repair of a failed node without contacting all the\nsurviving nodes. This construction is certainly of theoretical interest but not\nyet practical due to its requirement for very large code parameters. In this\npaper, we propose a generic transformation that can convert any $(\\overline{n},\n\\overline{k})$ MSR code with a repair degree of $\\overline{d}<\\overline{n}-1$\ninto another $(n=s\\overline{n},k)$ MDS array code that supports $d<n-1$ with a\nsmall sub-packetization level and $(1+\\epsilon)$-optimal repair bandwidth\n(i.e., $1+\\epsilon$ times the optimal value) under a specific condition. We\nobtain three MDS array codes with small sub-packetization levels and\n$(1+\\epsilon)$-optimal repair bandwidth by applying this transformation to\nthree known MSR codes. All the new MDS array codes have a small repair degree\nof $d<n-1$ and work for both small and large code parameters.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:29:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Jie",""],["Liu","Yi",""],["Tang","Xiaohu",""],["Han","Yunghsiang S.",""],["Bai","Bo",""],["Zhang","Gong",""]]}
{"id":"2308.14528","submitter":"Bheemsehan Gurjar","authors":"Bheemsehan Gurjar and Chandan Mondal","title":"Predicting $\\sin(2\\phi-\\phi_{s})$ azimuthal asymmetry in pion-proton\n  induced Drell-Yan process using holographic light-front QCD","comments":"11 pages, 3 figuers. arXiv admin note: text overlap with\n  arXiv:1907.07095 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We compute the $\\sin(2\\phi-\\phi_{s})$ azimuthal asymmetry in the pion-nucleon\ninduced Drell-Yan process within transverse momentum dependent factorization.\nWe employ the holographic light-front pion wave functions to calculate its\nleading-twist transverse momentum dependent parton distributions (TMDs). The\nBoer-Mulders TMD of the pion is then convoluted with the transversity TMD of\nthe proton evaluated in a light-front quark-diquark model constructed with the\nwave functions predicted by the soft-wall AdS/QCD to obtain the azimuthal\nasymmetry in the Drell-Yan process. The gluon rescattering is pivotal to\npredict nonzero pion Boer-Mulders TMD. We investigate the utility of a\nnonperturbative SU$(3)$ gluon rescattering kernel going beyond the usual\napproximation of perturbative U$(1)$ gluons. The holographic light-front QCD\napproach provides a powerful tool for exploring the role of nonperturbative QCD\neffects in the Drell-Yan process and may help to guide future experimental\nmeasurements.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:35:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gurjar","Bheemsehan",""],["Mondal","Chandan",""]]}
{"id":"2308.14529","submitter":"Laurent Bartholdi","authors":"Laurent Bartholdi and Martin Kassabov","title":"Property (T) and Many Quotients","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that, for the free algebra over a sufficiently rich operad, a large\nsubgroup of its group of tame automorphisms has Kazhdan's property (T).\n  We deduce that there exists a group with property (T) that maps onto large\npowers of alternating groups.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:38:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bartholdi","Laurent",""],["Kassabov","Martin",""]]}
{"id":"2308.14530","submitter":"Juhee Hong","authors":"Juhee Hong","title":"Heavy quark diffusion and radiation at intermediate momentum","comments":"13 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We discuss heavy quark diffusion and radiation in an intermediate-momentum\nregime where finite mass effects can be significant. Diffusion processes are\ndescribed in the Fokker-Planck approximation for soft momentum transfer, while\nradiative ones are taken into account by nearly collinear gluon emission from a\nsingle scattering in the Boltzmann equation. We also consider radiative\ncorrections to the transverse momentum diffusion coefficient, which are\n$\\mathcal{O}(g^2)$ suppressed than the leading-order diffusion coefficient but\nlogarithmically enhanced. Numerical results show that the heavy quark\ndistribution function depends on the energy loss mechanism so that the momentum\ndependence of suppression is distinguishable. Employing the heavy quark\ndiffusion coefficient constrained by lattice QCD data, we estimate the nuclear\nmodification factor which exhibits a transition from diffusion at low momentum\nto radiation at high momentum. The significance of radiative effects at\nintermediate momentum depends on the diffusion coefficient and running coupling\nconstant.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:39:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hong","Juhee",""]]}
{"id":"2308.14531","submitter":"Ruizhi Huang","authors":"Ruizhi Huang and Stephen Theriault","title":"Homotopy of blow ups after looping","comments":"41 pages; comments are very welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The homotopy theory of the blow up construction in algebraic and symplectic\ngeometry is investigated via two approaches. The first mixes homotopy theory\nand surgery theory to develop a fibrewise surgery theory in order to obtain a\nhomotopy decomposition of the based loop space on a blow up that holds\n$p$-locally for all but finitely many primes $p$ and holds rationally. The\nsecond is purely homotopy theoretic and obtains a homotopy decomposition of the\nbased loop space on a blow up that holds integrally provided a certain\ncondition is satisfied by an associated homotopy action. Examples are given in\nboth cases.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:39:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Huang","Ruizhi",""],["Theriault","Stephen",""]]}
{"id":"2308.14532","submitter":"Angel Martin","authors":"Angel Martin, Pablo Losada, Carolina Fern\\'andez, Mikel Zorrilla,\n  Zaloa Fernandez, Alvaro Gabilondo, Juncal Uriol, Felipe Mogollon, Mikel\n  Ser\\'on, Michalis Dalgitsis, Roberto Viola, Luis Roca, Carlos Giraldo, Pablo\n  Gonzalez, Anxo Tato, Joaqu\\'in Escudero, Alvaro Vazquez, Daniel Camps,\n  Andr\\'es C\\'ardenas, Carlos Herranz, Joan Josep Aleixendri, Rebeca Iglesias,\n  Gianluca Cernigliaro, Mario Montagud, Pau Tom\\`as, Sergio Gim\\'enez","title":"Open-VERSO: a vision of 5G experimentation infrastructures, hurdles and\n  challenges","comments":"41 pages, 8 tables, White Paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  5G led to a digital revolution for networks by leveraging virtualisation\ntechniques to manage software-based network functions through provided standard\ninterfaces, which have matured recently for cloud infrastructure that is widely\nemployed across domains and sectors. This undiscovered potential to adequately\nrespond to concurrent and specialised traffic demands is promising for a wide\nspectrum of industries. Moreover, it exposes the networking ecosystem to\nprospects beyond the traditional value chain. However, the configuration,\ndeployment and operation of a 5G network are challenging. Thus, different\nscientific and research entities have built their own open, evolvable and\nupdateable testbed infrastructure that can be used for experimentation\npurposes. Such testbeds enable different stakeholders to integrate new systems\nor features exploiting new technologies, assess the performance of innovative\nservices, and customise operation policies to find optimal setups from a\ncost-effective perspective. Furthermore, federations of infrastructure allow\nfor wider and more complex experiments to be performed in distributed domains.\nHowever, numerous technical and procedural obstacles exist during the building\nof 5G network testbeds. In addition, some technical barriers persist despite\nthe testing of alternatives and ongoing efforts within open-source systems and\ncommercial equipment portfolios. All these limitations and challenges are\nrelevant for experimenters and stakeholders as they attempt to determine the\nscope of 5G set expectations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:42:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Martin","Angel",""],["Losada","Pablo",""],["Fern\u00e1ndez","Carolina",""],["Zorrilla","Mikel",""],["Fernandez","Zaloa",""],["Gabilondo","Alvaro",""],["Uriol","Juncal",""],["Mogollon","Felipe",""],["Ser\u00f3n","Mikel",""],["Dalgitsis","Michalis",""],["Viola","Roberto",""],["Roca","Luis",""],["Giraldo","Carlos",""],["Gonzalez","Pablo",""],["Tato","Anxo",""],["Escudero","Joaqu\u00edn",""],["Vazquez","Alvaro",""],["Camps","Daniel",""],["C\u00e1rdenas","Andr\u00e9s",""],["Herranz","Carlos",""],["Aleixendri","Joan Josep",""],["Iglesias","Rebeca",""],["Cernigliaro","Gianluca",""],["Montagud","Mario",""],["Tom\u00e0s","Pau",""],["Gim\u00e9nez","Sergio",""]]}
{"id":"2308.14533","submitter":"Guanting Dong","authors":"Guanting Dong, Zechen Wang, Jinxu Zhao, Gang Zhao, Daichi Guo, Dayuan\n  Fu, Tingfeng Hui, Chen Zeng, Keqing He, Xuefeng Li, Liwen Wang, Xinyue Cui,\n  Weiran Xu","title":"A Multi-Task Semantic Decomposition Framework with Task-specific\n  Pre-training for Few-Shot NER","comments":"Accepted by CIKM 2023 (Oral Presentation)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The objective of few-shot named entity recognition is to identify named\nentities with limited labeled instances. Previous works have primarily focused\non optimizing the traditional token-wise classification framework, while\nneglecting the exploration of information based on NER data characteristics. To\naddress this issue, we propose a Multi-Task Semantic Decomposition Framework\nvia Joint Task-specific Pre-training (MSDP) for few-shot NER. Drawing\ninspiration from demonstration-based and contrastive learning, we introduce two\nnovel pre-training tasks: Demonstration-based Masked Language Modeling (MLM)\nand Class Contrastive Discrimination. These tasks effectively incorporate\nentity boundary information and enhance entity representation in Pre-trained\nLanguage Models (PLMs). In the downstream main task, we introduce a multi-task\njoint optimization framework with the semantic decomposing method, which\nfacilitates the model to integrate two different semantic information for\nentity classification. Experimental results of two few-shot NER benchmarks\ndemonstrate that MSDP consistently outperforms strong baselines by a large\nmargin. Extensive analyses validate the effectiveness and generalization of\nMSDP.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:46:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Guanting",""],["Wang","Zechen",""],["Zhao","Jinxu",""],["Zhao","Gang",""],["Guo","Daichi",""],["Fu","Dayuan",""],["Hui","Tingfeng",""],["Zeng","Chen",""],["He","Keqing",""],["Li","Xuefeng",""],["Wang","Liwen",""],["Cui","Xinyue",""],["Xu","Weiran",""]]}
{"id":"2308.14534","submitter":"Pedro Barreto Melo MSc.","authors":"Pedro B. Melo, Sebasti\\~ao A. S. J\\'unior, Wei Chen, Rubem Mondaini,\n  Thereza Paiva","title":"Topological marker approach to an interacting Su-Schrieffer-Heeger model","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The topological properties of the Su-Schrieffer-Heeger (SSH) model in the\npresence of nearest-neighbor interaction are investigated by means of a\ntopological marker, generalized from a noninteracting one by utilizing the\nsingle-particle Green's function of the many-body ground state. We find that\ndespite the marker not being perfectly quantized in the presence of\ninteractions, it always remains finite in the topologically nontrivial phase\nwhile converging to zero in the trivial phase when approaching the\nthermodynamic limit, and hence correctly judges the topological phases in the\npresence of interactions. The marker also correctly captures the\ninteraction-driven, second-order phase transitions between a topological phase\nand a Landau-ordered phase, which is a charge density wave order in our model\nwith a local order parameter, as confirmed by the calculation of entanglement\nentropy and the many-body Zak phase. Our work thus points to the possibility of\ngeneralizing topological markers to interacting systems through Green's\nfunction, which may be feasible for topological insulators in any dimension and\nsymmetry class.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:46:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Melo","Pedro B.",""],["J\u00fanior","Sebasti\u00e3o A. S.",""],["Chen","Wei",""],["Mondaini","Rubem",""],["Paiva","Thereza",""]]}
{"id":"2308.14535","submitter":"Daniel Windisch","authors":"Victor Fadinger and Daniel Windisch","title":"Lengths of factorizations of integer-valued polynomials on Krull domains\n  with prime elements","comments":"arXiv admin note: text overlap with arXiv:2206.11003","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $D$ be a Krull domain admitting a prime element with finite residue field\nand let $K$ be its quotient field. We show that for all positive integers $k$\nand $1 < n_1 \\leq \\ldots \\leq n_k$ there exists an integer-valued polynomial on\n$D$, that is, an element of $\\text{Int}(D) = \\{ f \\in K[X] \\mid f(D) \\subseteq\nD \\}$, which has precisely $k$ essentially different factorizations into\nirreducible elements of $\\text{Int}(D)$ whose lengths are exactly\n$n_1,\\ldots,n_k$. Using this, we characterize lengths of factorizations when\n$D$ is a unique factorization domain and therefore also in case $D$ is a\ndiscrete valuation domain. This solves an open problem proposed by Cahen,\nFontana, Frisch and Glaz.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:46:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fadinger","Victor",""],["Windisch","Daniel",""]]}
{"id":"2308.14536","submitter":"Baorian Nuchged","authors":"Linkai Peng, Baorian Nuchged and Yingming Gao","title":"Spoken Language Intelligence of Large Language Models for Language\n  Learning","comments":"28 pages, 7 figures, Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  People have long hoped for a conversational system that can assist in\nreal-life situations, and recent progress on large language models (LLMs) is\nbringing this idea closer to reality. While LLMs are often impressive in\nperformance, their efficacy in real-world scenarios that demand expert\nknowledge remains unclear. LLMs are believed to hold the most potential and\nvalue in education, especially in the development of Artificial intelligence\n(AI) based virtual teachers capable of facilitating language learning. Our\nfocus is centered on evaluating the efficacy of LLMs in the realm of education,\nspecifically in the areas of spoken language learning which encompass\nphonetics, phonology, and second language acquisition. We introduce a new\nmultiple-choice question dataset to evaluate the effectiveness of LLMs in the\naforementioned scenarios, including understanding and application of spoken\nlanguage knowledge. In addition, we investigate the influence of various\nprompting techniques such as zero- and few-shot method (prepending the question\nwith question-answer exemplars), chain-of-thought (CoT, think step-by-step),\nin-domain exampler and external tools (Google, Wikipedia). We conducted\nlarge-scale evaluation on popular LLMs (20 distinct models) using these\nmethods. We achieved significant performance improvements compared to the\nzero-shot baseline in the practical questions reasoning (GPT-3.5, 49.1% ->\n63.1%; LLaMA2-70B-Chat, 42.2% -> 48.6%). We found that models of different\nsizes have good understanding of concepts in phonetics, phonology, and second\nlanguage acquisition, but show limitations in reasoning for real-world\nproblems. Additionally, we also explore preliminary findings on conversational\ncommunication.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:47:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Peng","Linkai",""],["Nuchged","Baorian",""],["Gao","Yingming",""]]}
{"id":"2308.14537","submitter":"Aiqing Zhu","authors":"Sidi Wu, Aiqing Zhu, Yifa Tang, Benzhuo Lu","title":"Solving parametric elliptic interface problems via interfaced operator\n  network","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Learning operator mapping between infinite-dimensional Banach spaces via\nneural networks has attracted a considerable amount of attention in recent\nyears. In this work, we propose an interfaced operator network (IONet) to solve\nparametric elliptic interface PDEs, where different coefficients, source terms\nand boundary conditions are considered as input features. To capture the\ndiscontinuities of both input functions and output solutions across the\ninterface, IONet divides the entire domain into several separate sub-domains\naccording to the interface, and leverages multiple branch networks and truck\nnetworks. Each branch network extracts latent representations of input\nfunctions at a fixed number of sensors on a specific sub-domain, and each truck\nnetwork is responsible for output solutions on one sub-domain. In addition,\ntailored physics-informed loss of IONet is proposed to ensure physical\nconsistency, which greatly reduces the requirement for training datasets and\nmakes IONet effective without any paired input-output observations in the\ninterior of the computational domain. Extensive numerical studies show that\nIONet outperforms existing state-of-the-art deep operator networks in terms of\naccuracy, efficiency, and versatility.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:49:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wu","Sidi",""],["Zhu","Aiqing",""],["Tang","Yifa",""],["Lu","Benzhuo",""]]}
{"id":"2308.14538","submitter":"Sa Wang","authors":"Sa Wang, Yao Li, Shuwan Shen, Ben-Wei Zhang, Enke Wang","title":"Production of the heavy-flavour decay lepton in high-energy nuclear\n  collisions","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a theoretical study on the production of the\nheavy-flavour decay lepton (HFL) in high-energy nuclear collisions at the LHC.\nThe pp-baseline is calculated by the FONLL program, which matches the\nnext-to-leading order pQCD calculation with the next-to-leading-log large-$p_T$\nresummation. The in-medium propagation of heavy quarks is driven by the\nmodified Langevin equations, which consider both the elastic and inelastic\npartonic interactions. We propose a method to separate the respective influence\nof the five factors, such as pp-spectra, the cold nuclear matter (CNM) effects,\nin-medium energy loss (E-loss), fragmentation functions (FFs), and decay\nchannels, which may contribute to the larger $R_{AA}$ of HFL $\\leftarrow b$\ncompared to that of HFL $\\leftarrow c$ in nucleus-nucleus collisions. Based on\nquantitative analysis, we demonstrate that different decay channels of charm-\nand bottom-hadrons play an important role at $p_T<$5 GeV, while the\nmass-dependent E-loss dominates the higher $p_T$ region. It is also found that\nthe influences of the CNM effects and FFs are insignificant, while different\ninitial pp-spectra of charm and bottom quarks have a considerable impact at\n$p_T>$ 3 GeV. Furthermore, we explore the path-length dependence of jet\nquenching by comparing the HFL $R_{AA}$ in two different collision systems. Our\ninvestigations show smaller HFL $R_{AA}$ in Pb+Pb than that in Xe+Xe within the\nsame centrality bin, which is consistent with the ALICE data. The longer\npropagation time and more effective energy loss of heavy quarks in Pb+Pb\ncollisions play critical roles in the stronger yield suppression of the HFL\ncompared to that in Xe+Xe. In addition, we observe a scaling behaviour of the\nHFL $R_{AA}$ in Xe+Xe and Pb+Pb collisions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:49:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Sa",""],["Li","Yao",""],["Shen","Shuwan",""],["Zhang","Ben-Wei",""],["Wang","Enke",""]]}
{"id":"2308.14539","submitter":"Danan Yang","authors":"Danan Yang, Himani Garg, Martin Andersson","title":"Effect of gas diffusion layer fiber shape on cathode two-phase dynamics\n  in proton exchange membrane fuel cells","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Commercially available Gas Diffusion Layers (GDLs) are fabricated using\ndifferent shapes of carbon fibers to suit different types of Proton Exchange\nMembrane Fuel Cells (PEMFCs). However, the impact of this difference on the GDL\nproperties and fluid behavior remains unclear. In this study, a two-phase flow\nnumerical study is conducted to investigate this influence by considering GDLs\nconsisting of curved and straight carbon fibers. A periodic surface model is\nadopted to reconstruct the two types of GDLs, using the same through-plane\nporosity distribution, domain size, and fiber diameter. Pore Size Distribution\n(PSD) comparison between two stochastically reconstructed GDLs shows a similar\ntrend. Besides, the liquid transport through these two GDLs and the assembled\nGas Channels (GCs) is simulated using the Volume of Fluid (VOF) method\nimplemented in OpenFOAM 7.0. The results show the total water saturation and\ncapillary pressure in these two GDLs are similar, whereas their through-plane\nlocal water saturation level and the liquid breakthrough locations are\nsubstantially different. In addition, the total water saturation variation in\nthe GCs exhibits an increasing difference over time. In the case of\nstraight-fiber GDL, bigger water slugs are observed in the later simulation,\nwhich are located in the corner of the top and side surfaces of the GC.\nBesides, the case with a curved-fiber GDL has more separated droplets in the GC\ndomain, which flow out of the GC faster than the slug flow in another case.\nHowever, it also increases the formation of discrete water cross-section\nregions, resulting in a higher GC pressure drop accompanied by more noticeable\noscillations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:51:19 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Danan",""],["Garg","Himani",""],["Andersson","Martin",""]]}
{"id":"2308.14540","submitter":"Henryka Netzel","authors":"H. Netzel, L. Molnar, M. Joyce","title":"Detailed asteroseismic modeling of RR Lyrae stars with non-radial modes","comments":"10 pages, 9 figures, 3 tables, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Photometric observations from the last decade have revealed additional\nlow-amplitude periodicities in many classical pulsators that are likely due to\npulsations in non-radial modes. One group of multi-mode RR Lyrae stars, the\nso-called 0.61 stars, is particularly interesting. In these stars, the radial\nfirst overtone is accompanied by additional signals with period ratios around\n0.61. The most promising explanation for these signals is pulsation in\nnon-radial modes of degrees 8 and 9. If the theory behind the additional\nsignals in the 0.61 stars is substantiated, it would allow us to use non-radial\nmodes to study classical pulsators. We aim to perform asteroseismic modeling of\nselected 0.61 stars with independently determined physical parameters to test\nwhether this assumption behind the modeling leads to correct results. Namely,\nwe test whether the additional signals are indeed due to non-radial modes of\nthe proposed moderate degrees. We selected a number of and RR Lyrae stars that\nare also 0.61 stars and have good observational constraints on their other\nphysical parameters. We assume that the nature of those modes is correctly\nexplained with non-radial modes of degrees 8 or 9. Using this assumption and\nobservational constraints on physical parameters, we performed asteroseismic\nmodeling to test whether the observed periods and period ratios can be\nreproduced. For the majority of selected targets, we obtained a good match\nbetween observed and calculated periods and period ratios. For a few targets\nhowever, the results obtained are ambiguous and not straightforward to\ninterpret.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:52:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Netzel","H.",""],["Molnar","L.",""],["Joyce","M.",""]]}
{"id":"2308.14541","submitter":"Alexandre Benatti","authors":"Alexandre Benatti, Luciano da Fontoura Costa","title":"Multilayer Multiset Neuronal Networks -- MMNNs","comments":"32 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The coincidence similarity index, based on a combination of the Jaccard and\noverlap similarity indices, has noticeable properties in comparing and\nclassifying data, including enhanced selectivity and sensitivity, intrinsic\nnormalization, and robustness to data perturbations and outliers. These\nfeatures allow multiset neurons, which are based on the coincidence similarity\noperation, to perform effective pattern recognition applications, including the\nchallenging task of image segmentation. A few prototype points have been used\nin previous related approaches to represent each pattern to be identified, each\nof them being associated with respective multiset neurons. The segmentation of\nthe regions can then proceed by taking into account the outputs of these\nneurons. The present work describes multilayer multiset neuronal networks\nincorporating two or more layers of coincidence similarity neurons. In\naddition, as a means to improve performance, this work also explores the\nutilization of counter-prototype points, which are assigned to the image\nregions to be avoided. This approach is shown to allow effective segmentation\nof complex regions despite considering only one prototype and one\ncounter-prototype point. As reported here, the balanced accuracy landscapes to\nbe optimized in order to identify the weight of the neurons in subsequent\nlayers have been found to be relatively smooth, while typically involving more\nthan one attraction basin. The use of a simple gradient-based optimization\nmethodology has been demonstrated to effectively train the considered neural\nnetworks with several architectures, at least for the given data type,\nconfiguration of parameters, and network architecture.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:55:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Benatti","Alexandre",""],["Costa","Luciano da Fontoura",""]]}
{"id":"2308.14542","submitter":"Jiaqi Yang","authors":"Hugo Beir\\~ao da Veiga and Jiaqi Yang","title":"On a set of some recent contributions to energy equality for the\n  Navier-Stokes equations","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In these notes we want, in addition to presenting some new results, to both\nclean up and refine some reflections on a couple of articles published on paper\na few years ago, 2019-20. These papers concerned integral sufficient conditions\non $u\\,,$ $\\n u\\,,$ and mixed, to guarantee the equality of the energy, EE in\nthe sequel, for solutions of the Navier-Stokes equations under the classical\nnon-slip boundary condition. Concerning the $\\n u$ case a crucial role was\nenjoyed by a previous well known Berselli and Chiodaroli's pioneering 2019 work\non the subject. The above three papers are the main sources of these notes.\nReferences will be mostly concentrated on their direct relation to the above\npapers at the time of pubblication. More recent results will be not stated\nthroughout the article. However, in the last section, the reader will be\nsuitably sent to the more recent bibliography. Below, we also turn back to the\ninnovative interpretation of some main parameters which allowed to overcome\ntheir apparent incongruence. Non-Newtonian fluids were also considered in our\n2019 paper, maybe for the first time in the above Berselli-Chiodaroli's\nparticular $\\n u\\,$ context. However we will stick mostly to the Newtonian case\nsince in the end we come to the conclusion that there are not particular\nadditional obstacles to extend the present results from Newtonian to\nnon-Newtonian fluids. Hence we avoid to go further in this direction.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:56:26 GMT"}],"update_date":"2023-08-29","authors_parsed":[["da Veiga","Hugo Beir\u00e3o",""],["Yang","Jiaqi",""]]}
{"id":"2308.14543","submitter":"Reyne Dowling","authors":"Reyne Dowling and Mikhail Kostylev","title":"External magnetic fields enhance capture of magnetic nanoparticles\n  flowing through molded microfluidic channels by ferromagnetic nanostructures","comments":"17 pages, 11 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic nanoparticles (MNPs) have many applications which require MNPs to be\ncaptured and immobilized for their manipulation and sensing. For example, MNP\nsensors based on detecting changes to the ferromagnetic resonances of an\nantidot nanostructure exhibit better performance when the nanoparticles are\ncaptured within the antidot inclusions. This study investigates the influence\nof microfluidics upon the capture of MNPs by four geometries of antidot array\nnanostructures hollowed into 30 nm-thick Permalloy films. The nanostructures\nwere exposed to a dispersion of 130 nm MNP clusters which passed through PDMS\nmicrofluidic channels with a 400 {\\mu}m circular cross-section fabricated from\nwire molds. With the microfluidic flow of MNPs, the capture efficiency - the\nratio between the number of nanoparticles captured inside of the antidot\ninclusions to the number outside the inclusions - decreased for all four\ngeometries compared to previous results introducing the particles via droplets\non the film surface. This indicates that most MNPs were passing over the\nnanostructures, since there were no significant magnetophoretic forces acting\nupon the particles. However, when a static magnetic field is applied, the\nmagnetophoretic forces generated by the nanostructure are stronger and the\ncapture efficiencies are significantly higher than those obtained using\ndroplets. In particular, circular antidots demonstrated the highest capture\nefficiency among the four geometries of almost 83.1% when the magnetic field is\nparallel to the film plane. In a magnetic field perpendicular to the film, the\ncircle antidots again show the highest capture efficiency of about 77%. These\nresults suggest that the proportion of nanoparticles captured inside antidot\ninclusions is highest under a parallel magnetic field. Clearly, the geometry of\nthe nanostructure has a strong influence on the capture of MNPs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:56:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dowling","Reyne",""],["Kostylev","Mikhail",""]]}
{"id":"2308.14544","submitter":"Emin Durmishi","authors":"Emin Durmishi","title":"Continuity up to a Covering and Connectedness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GN","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  One of the ways that connectedness has been studied through the history of\ntopology is by using chains, the so called chain connectedness. Here we combine\nthis notion together with continuity up to a covering to provide the\ninheritance of connectedness for the topological spaces even when there is no\ncontinuous surjection between them.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:57:22 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 22:49:54 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Durmishi","Emin",""]]}
{"id":"2308.14545","submitter":"Golnoosh Shahkarami","authors":"Hannaneh Akrami, Masoud Seddighin, Kurt Mehlhorn, Golnoosh Shahkarami","title":"Randomized and Deterministic Maximin-share Approximations for\n  Fractionally Subadditive Valuations","comments":"25 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of guaranteeing a fraction of the maximin-share (MMS)\nwhen allocating a set of indivisible items to a set of agents with fractionally\nsubadditive (XOS) valuations. For XOS valuations, it has been previously shown\nthat for some instances no allocation can guarantee a fraction better than\n$1/2$ of the maximin-share to all the agents. Also, a deterministic allocation\nexists that guarantees $0.219225$ of the maximin-share to each agent. Our\nresults pertain to deterministic and randomized allocations. On the\ndeterministic side, we improve the best approximation guarantee for\nfractionally subadditive valuations to $3/13 = 0.230769$. We develop new ideas\nfor allocating large items which might be of independent interest. Furthermore,\nwe investigate randomized algorithms and best-of-both-worlds fairness\nguarantees. We propose a randomized allocation that is $1/4$-MMS ex-ante and\n$1/8$-MMS ex-post for XOS valuations. Moreover, we prove an upper bound of\n$3/4$ on the ex-ante guarantee for this class of valuations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:58:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Akrami","Hannaneh",""],["Seddighin","Masoud",""],["Mehlhorn","Kurt",""],["Shahkarami","Golnoosh",""]]}
{"id":"2308.14546","submitter":"Martina Stoji\\'c","authors":"Martina Stoji\\'c","title":"Internal Hopf algebroid","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a natural generalization of the definition of a symmetric Hopf\nalgebroid, internal to any symmetric monoidal category with coequalizers that\ncommute with the monoidal product. Motivation for this is the study of\nHeisenberg doubles of countably dimensional Hopf algebras $A$ as internal Hopf\nalgebroids over a (noncommutative) base $A$ in the category\n$\\mathrm{indproVect}$ of filtered cofiltered vector spaces introduced by the\nauthor. One example of such Heisenberg double is internal Hopf algebroid\n$U(\\mathfrak{g}) \\sharp U(\\mathfrak{g})^*$ over universal enveloping algebra\n$U(\\mathfrak{g})$ of a finite-dimesional Lie algebra $\\mathfrak{g}$ that is a\nproperly internalized version of a completed Hopf algebroid previously studied\nas a Lie algebra type noncommutative phase space.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:04:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Stoji\u0107","Martina",""]]}
{"id":"2308.14547","submitter":"Jordan Richards","authors":"Daniela Cisneros, Jordan Richards, Ashok Dahal, Luigi Lombardo, and\n  Rapha\\\"el Huser","title":"Deep graphical regression for jointly moderate and extreme Australian\n  wildfires","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent wildfires in Australia have led to considerable economic loss and\nproperty destruction, and there is increasing concern that climate change may\nexacerbate their intensity, duration, and frequency. hazard quantification for\nextreme wildfires is an important component of wildfire management, as it\nfacilitates efficient resource distribution, adverse effect mitigation, and\nrecovery efforts. However, although extreme wildfires are typically the most\nimpactful, both small and moderate fires can still be devastating to local\ncommunities and ecosystems. Therefore, it is imperative to develop robust\nstatistical methods to reliably model the full distribution of wildfire spread.\nWe do so for a novel dataset of Australian wildfires from 1999 to 2019, and\nanalyse monthly spread over areas approximately corresponding to Statistical\nAreas Level 1 and 2 (SA1/SA2) regions. Given the complex nature of wildfire\nignition and spread, we exploit recent advances in statistical deep learning\nand extreme value theory to construct a parametric regression model using graph\nconvolutional neural networks and the extended generalized Pareto distribution,\nwhich allows us to model wildfire spread observed on an irregular spatial\ndomain. We highlight the efficacy of our newly proposed model and perform a\nwildfire hazard assessment for Australia and population-dense communities,\nnamely Tasmania, Sydney, Melbourne, and Perth.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:04:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cisneros","Daniela",""],["Richards","Jordan",""],["Dahal","Ashok",""],["Lombardo","Luigi",""],["Huser","Rapha\u00ebl",""]]}
{"id":"2308.14548","submitter":"Petr Dole\\v{z}al","authors":"Petr Dole\\v{z}al, Marie Kratochv\\'ilov\\'a, D\\'avid Hovan\\v{c}\\'ik,\n  V\\'aclav Hol\\'y, Vladim\\'ir Sechovsk\\'y, Ji\\v{r}\\'i Posp\\'i\\v{s}il","title":"Formation of Domains within Lower-to-higher Symmetry Structural\n  Transition in CrI$_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  CrI$_3$ represents one of the most important van der Waals systems on the\nroute to understanding two-dimensional magnetic phenomena. Being arranged in a\nspecific layered structure it also provides a unique opportunity to investigate\nstructural transformations in dimension-confined systems. CrI$_3$ is dimorphic\nand possesses a higher symmetry low-temperature phase, which is quite uncommon.\nIt contrasts with vanadium trihalides which show a higher symmetry\nhigh-temperature. An explanation of this distinct behavior together with a\nlarge cycle-dependent transition hysteresis is still an open question. Our\nlow-temperature X-ray diffraction study conducted on CrI$_3$ single crystals\ncomplemented by magnetization and specific heat measurements was focused mainly\non specific features of the structural transition during cooling. Our results\nmanifest that the structural transition during cooling relates to the formation\nof structural domains despite the lower symmetry structure transforming to a\nhigher symmetry one. We propose that these domains could control the transition\ntemperature and also the size of thermal hysteresis.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:06:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dole\u017eal","Petr",""],["Kratochv\u00edlov\u00e1","Marie",""],["Hovan\u010d\u00edk","D\u00e1vid",""],["Hol\u00fd","V\u00e1clav",""],["Sechovsk\u00fd","Vladim\u00edr",""],["Posp\u00ed\u0161il","Ji\u0159\u00ed",""]]}
{"id":"2308.14549","submitter":"Sangita Swapnasrita","authors":"Sangita Swapnasrita, Joost C de Vries, Carl M \\\"Oberg, Aur\\'elie MF\n  Carlier, Karin GF Gerritsen","title":"Computational modelling of peritoneal dialysis: an overview","comments":"58 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Peritoneal dialysis (PD) is becoming more popular as a result of a rising\ninterest in home dialysis, lower intrusion in social life and longer\npreservation of residual kidney function. However, PD has several important\ndrawbacks: small solute clearance is relatively low compared to hemodialysis\nand technique survival is limited. Application of continuous flow,\nsorbent-based dialysate regeneration and novel glucose-sparing PD solutions are\nsome solutions proposed to address the limitations of PD. To optimize and\npersonalize current and novel PD therapies, patient peritoneal characteristics\ninteracting with PD techniques need to be studied together and separately as\nthey interplay. However, considering the multitude of parameters, it would be\ndifficult, expensive, and time consuming to optimize all parameter settings\nonly with the help of clinical trials. Mathematical modelling is an exciting\ntool to dissect these interacting processes and comprehend PD techniques better\nat a patient specific level. In this review, we look at the history of\ncomputational PD models, explore the many ways a computational PD model can be\nconstructed and review the various existing PD models that can be used to\noptimize and personalize PD treatment.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:08:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Swapnasrita","Sangita",""],["de Vries","Joost C",""],["\u00d6berg","Carl M",""],["Carlier","Aur\u00e9lie MF",""],["Gerritsen","Karin GF",""]]}
{"id":"2308.14550","submitter":"Aizaz Sharif","authors":"Aizaz Sharif and Dusica Marijan","title":"ReMAV: Reward Modeling of Autonomous Vehicles for Finding Likely Failure\n  Events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous vehicles are advanced driving systems that are well known for\nbeing vulnerable to various adversarial attacks, compromising the vehicle's\nsafety, and posing danger to other road users. Rather than actively training\ncomplex adversaries by interacting with the environment, there is a need to\nfirst intelligently find and reduce the search space to only those states where\nautonomous vehicles are found less confident. In this paper, we propose a\nblackbox testing framework ReMAV using offline trajectories first to analyze\nthe existing behavior of autonomous vehicles and determine appropriate\nthresholds for finding the probability of failure events. Our reward modeling\ntechnique helps in creating a behavior representation that allows us to\nhighlight regions of likely uncertain behavior even when the baseline\nautonomous vehicle is performing well. This approach allows for more efficient\ntesting without the need for computational and inefficient active adversarial\nlearning techniques. We perform our experiments in a high-fidelity urban\ndriving environment using three different driving scenarios containing single\nand multi-agent interactions. Our experiment shows 35%, 23%, 48%, and 50%\nincrease in occurrences of vehicle collision, road objects collision,\npedestrian collision, and offroad steering events respectively by the\nautonomous vehicle under test, demonstrating a significant increase in failure\nevents. We also perform a comparative analysis with prior testing frameworks\nand show that they underperform in terms of training-testing efficiency,\nfinding total infractions, and simulation steps to identify the first failure\ncompared to our approach. The results show that the proposed framework can be\nused to understand existing weaknesses of the autonomous vehicles under test in\norder to only attack those regions, starting with the simplistic perturbation\nmodels.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:09:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sharif","Aizaz",""],["Marijan","Dusica",""]]}
{"id":"2308.14551","submitter":"Meiling Fang","authors":"Meiling Fang and Naser Damer","title":"Face Presentation Attack Detection by Excavating Causal Clues and\n  Adapting Embedding Statistics","comments":"Accepted at WACV 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Recent face presentation attack detection (PAD) leverages domain adaptation\n(DA) and domain generalization (DG) techniques to address performance\ndegradation on unknown domains. However, DA-based PAD methods require access to\nunlabeled target data, while most DG-based PAD solutions rely on a priori,\ni.e., known domain labels. Moreover, most DA-/DG-based methods are\ncomputationally intensive, demanding complex model architectures and/or\nmulti-stage training processes. This paper proposes to model face PAD as a\ncompound DG task from a causal perspective, linking it to model optimization.\nWe excavate the causal factors hidden in the high-level representation via\ncounterfactual intervention. Moreover, we introduce a class-guided MixStyle to\nenrich feature-level data distribution within classes instead of focusing on\ndomain information. Both class-guided MixStyle and counterfactual intervention\ncomponents introduce no extra trainable parameters and negligible computational\nresources. Extensive cross-dataset and analytic experiments demonstrate the\neffectiveness and efficiency of our method compared to state-of-the-art PADs.\nThe implementation and the trained weights are publicly available.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:11:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fang","Meiling",""],["Damer","Naser",""]]}
{"id":"2308.14552","submitter":"Tomohiro Fujita","authors":"Tomohiro Fujita, Youka Kaku, Akira Matumura and Yuta Michimura","title":"Inverted Oscillators for Testing Gravity-induced Quantum Entanglement","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the quest for quantum gravity, we have lacked experimental verification,\nhampered by the weakness of gravity and decoherence. Recently, various\nexperiments have been proposed to verify quantum entanglement induced by\nNewtonian gravitational interactions. However, they are not yet certainly\nfeasible with existing techniques. To search for a new setup, we compute the\nlogarithmic negativity of two oscillators with arbitrary quadratic potential\ncoupled by gravity. We find that unstable inverted oscillators generate\ngravity-induced entanglement most quickly and are most resistant to decoherence\nfrom environmental fluctuations. As an experimental realization, we propose a\nsetup of the optical levitation of mirrors with the anti-spring effect. To\navoid decoherence due to photon shot noise, a sandwich configuration that\ngeometrically creates the anti-spring is promising.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:13:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fujita","Tomohiro",""],["Kaku","Youka",""],["Matumura","Akira",""],["Michimura","Yuta",""]]}
{"id":"2308.14553","submitter":"Qiushi Zhu","authors":"Qiushi Zhu, Yu Gu, Chao Weng, Yuchen Hu, Lirong Dai, Jie Zhang","title":"Rep2wav: Noise Robust text-to-speech Using self-supervised\n  representations","comments":"5 pages,2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Benefiting from the development of deep learning, text-to-speech (TTS)\ntechniques using clean speech have achieved significant performance\nimprovements. The data collected from real scenes often contain noise and\ngenerally needs to be denoised by speech enhancement models. Noise-robust TTS\nmodels are often trained using the enhanced speech, which thus suffer from\nspeech distortion and background noise that affect the quality of the\nsynthesized speech. Meanwhile, it was shown that self-supervised pre-trained\nmodels exhibit excellent noise robustness on many speech tasks, implying that\nthe learned representation has a better tolerance for noise perturbations. In\nthis work, we therefore explore pre-trained models to improve the noise\nrobustness of TTS models. Based on HIFI-GAN we first propose a\nrepresentation-to-waveform vocoder, which aims to learn to map the\nrepresentation of pre-trained models to the waveform. We then propose a\ntext-to-representation Fastspeech2 model, which aims to learn to map text to\npre-trained model representations. Experimental results on the LJSpeech and\nLibriTTS datasets show that our method outperforms those using speech\nenhancement methods in both subjective and objective metrics. Audio samples are\navailable at: https://zqs01.github.io/rep2wav/.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:13:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhu","Qiushi",""],["Gu","Yu",""],["Weng","Chao",""],["Hu","Yuchen",""],["Dai","Lirong",""],["Zhang","Jie",""]]}
{"id":"2308.14554","submitter":"Gabor Elek","authors":"G\\'abor Elek, \\'Ad\\'am Tim\\'ar","title":"A comprehensive characterization of Property A and almost finiteness","comments":"44 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.DS math.MG math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Three important properties of groups, amenability, Property A and almost\nfiniteness, are in our focus, in the wider context of general countable bounded\ndegree graphs. A graph is almost finite if it has a tiling with isomorphic\ncopies of finitely many F\\o lner sets, and we call it strongly almost finite,\nif the tiling can be randomized so that the probability that a vertex is on the\nboundary of a tile is uniformly small. We give various equivalents for Property\nA and for strong almost finiteness. In particular, we prove that Property A\ntogether with a uniform version of amenability is equivalent to strong almost\nfiniteness. Using these characterizations, we show that graphs of\nsubexponential growth and Schreier graphs of amenable groups are always\nstrongly almost finite, generalizing the celebrated result of Downarowicz,\nHuczek and Zhang about amenable Cayley graphs, based on graph theoretic rather\nthan group theoretic principles. We also show that if a sequence of graphs of\nProperty A (in a uniform sense) converges to a graph $G$ in the neighborhood\ndistance (a purely combinatorial analogue of the classical Benjamini-Schramm\ndistance), then their Laplacian spectra converge to the Laplacian spectrum of\n$G$ in the Hausdorff distance. Finally, we apply the previous theory to\nconstruct a new and rich class of classifiable $C^{\\star}$-algebras. Namely, we\nshow that for any minimal strongly almost finite graph $G$ there are naturally\nassociated simple, nuclear, stably finite $C^{\\star}$-algebras that are\nclassifiable by their Elliott invariants.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:16:05 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 19:08:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Elek","G\u00e1bor",""],["Tim\u00e1r","\u00c1d\u00e1m",""]]}
{"id":"2308.14555","submitter":"Justin Sirignano","authors":"Samuel Chun-Hei Lam, Justin Sirignano, and Konstantinos Spiliopoulos","title":"Kernel Limit of Recurrent Neural Networks Trained on Ergodic Data\n  Sequences","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.PR stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mathematical methods are developed to characterize the asymptotics of\nrecurrent neural networks (RNN) as the number of hidden units, data samples in\nthe sequence, hidden state updates, and training steps simultaneously grow to\ninfinity. In the case of an RNN with a simplified weight matrix, we prove the\nconvergence of the RNN to the solution of an infinite-dimensional ODE coupled\nwith the fixed point of a random algebraic equation. The analysis requires\naddressing several challenges which are unique to RNNs. In typical mean-field\napplications (e.g., feedforward neural networks), discrete updates are of\nmagnitude $\\mathcal{O}(\\frac{1}{N})$ and the number of updates is\n$\\mathcal{O}(N)$. Therefore, the system can be represented as an Euler\napproximation of an appropriate ODE/PDE, which it will converge to as $N\n\\rightarrow \\infty$. However, the RNN hidden layer updates are\n$\\mathcal{O}(1)$. Therefore, RNNs cannot be represented as a discretization of\nan ODE/PDE and standard mean-field techniques cannot be applied. Instead, we\ndevelop a fixed point analysis for the evolution of the RNN memory states, with\nconvergence estimates in terms of the number of update steps and the number of\nhidden units. The RNN hidden layer is studied as a function in a Sobolev space,\nwhose evolution is governed by the data sequence (a Markov chain), the\nparameter updates, and its dependence on the RNN hidden layer at the previous\ntime step. Due to the strong correlation between updates, a Poisson equation\nmust be used to bound the fluctuations of the RNN around its limit equation.\nThese mathematical methods give rise to the neural tangent kernel (NTK) limits\nfor RNNs trained on data sequences as the number of data samples and size of\nthe neural network grow to infinity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:17:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lam","Samuel Chun-Hei",""],["Sirignano","Justin",""],["Spiliopoulos","Konstantinos",""]]}
{"id":"2308.14556","submitter":"Adam Kit","authors":"A. Kit, A.E. J\\\"arvinen, Y.R.J. Poels, S. Wiesen, V. Menkovski, R.\n  Fischer, M. Dunne, and ASDEX-Upgrade Team","title":"On learning latent dynamics of the AUG plasma state","comments":"7 pages, 10 figures, International Conference on Data-Driven Plasma\n  Sciences","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we demonstrate the utility of state representation learning\napplied to modeling the time evolution of electron density and temperature\nprofiles at ASDEX-Upgrade (AUG). The proposed model is a deep neural network\nwhich learns to map the high dimensional profile observations to a lower\ndimensional state. The mapped states, alongside the original profile's\ncorresponding machine parameters are used to learn a forward model to propagate\nthe state in time. We show that this approach is able to predict AUG discharges\nusing only a selected set of machine parameters. The state is then further\nconditioned to encode information about the confinement regime, which yields a\nsimple baseline linear classifier, while still retaining the information needed\nto predict the evolution of profiles. We then discuss the potential use cases\nand limitations of state representation learning algorithms applied to fusion\ndevices.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:18:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kit","A.",""],["J\u00e4rvinen","A. E.",""],["Poels","Y. R. J.",""],["Wiesen","S.",""],["Menkovski","V.",""],["Fischer","R.",""],["Dunne","M.",""],["Team","ASDEX-Upgrade",""]]}
{"id":"2308.14557","submitter":"Xiaoqiang Wu","authors":"Xiaofei Wu and Zhimin Zhang","title":"A parallel Linearized ADMM algorithm for Nonconvex Penalized Smooth\n  Quantile Regression","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The parallel alternating direction method of multipliers (ADMM) algorithms\nhave become popular in statistics and machine learning due to their ability to\nefficiently handle large sample data problems. However, the parallel structure\nof the ADMM algorithms are all based on consensus structure, which can cause\ntoo many auxiliary variables for high-dimensional data. In this paper, we focus\non nonconvex penalized smooth quantile regression peoblems and develop a\nparallel linearized ADMM (LADMM) algorithm to solve it. Compared with existing\nparallel ADMM algorithms, our algorithm does not rely on consensus structure,\nresulting in a significant reduction in the number of variables that need to be\nupdated at each iteration. It is worth noting that the solution of our\nalgorithm remains unchanged regardless of how the total sample is divided.\nFurthermore, under some mild assumptions, we prove that the iterative sequence\ngenerated by the LADMM converges to a critical point of the nonconvex\noptimization problem. Numerical experiments on synthetic and real datasets\ndemonstrate the feasibility and validity of the proposed algorithm.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:19:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wu","Xiaofei",""],["Zhang","Zhimin",""]]}
{"id":"2308.14558","submitter":"Alexander Barg","authors":"Alexander Barg, Ohad Elishco, Ryan Gabrys, Geyang Wang, Eitan Yaakobi","title":"Storage codes and recoverable systems on lines and grids","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.CO math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A storage code is an assignment of symbols to the vertices of a connected\ngraph $G(V,E)$ with the property that the value of each vertex is a function of\nthe values of its neighbors, or more generally, of a certain neighborhood of\nthe vertex in $G$. In this work we introduce a new construction method of\nstorage codes, enabling one to construct new codes from known ones via an\ninterleaving procedure driven by resolvable designs. We also study storage\ncodes on $\\mathbb Z$ and ${\\mathbb Z}^2$ (lines and grids), finding closed-form\nexpressions for the capacity of several one and two-dimensional systems\ndepending on their recovery set, using connections between storage codes,\ngraphs, anticodes, and difference-avoiding sets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:20:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barg","Alexander",""],["Elishco","Ohad",""],["Gabrys","Ryan",""],["Wang","Geyang",""],["Yaakobi","Eitan",""]]}
{"id":"2308.14559","submitter":"Bing-Nan Lu","authors":"Bing-Nan Lu, Bao-Ge Deng","title":"Renormalization of many-body effective field theory","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th cond-mat.quant-gas hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The renormalization of the effective field theories (EFTs) in many-body\nsystems is the most pressing and challenging problem in modern nuclear ab\ninitio calculation. For general non-relativistic EFTs, we prove that the\nrenormalization group (RG) invariance can be achieved if and only if all\nsingle-particle momenta are regulated with a universal cutoff \\Lambda. For a\nnumerical demonstration, we construct a series of N^{2}LO chiral forces with\n\\Lambda varying from 250 MeV to 400 MeV. With all low energy constants fixed in\ntwo- and three-nucleon systems, we reproduce the experimental binding energies\nof ^{4}He and ^{16}O nearly independently of \\Lambda. In contrast, all recent\nnuclear EFT constructions regulate the relative momenta for Galilean\ninvariance, thus inherently break the RG invariance. This explains the\nunpleasantly strong cutoff-dependences observed in recent ab initio\ncalculations. Our method can also be used to build RG-invariant EFTs with\nnon-perturbative interactions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:21:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lu","Bing-Nan",""],["Deng","Bao-Ge",""]]}
{"id":"2308.14560","submitter":"Ichiro Inoue Dr.","authors":"Ichiro Inoue, Victor Tkachenko, Yuya Kubota, Fabien Dorchies, Toru\n  Hara, Hauke H\\\"oeppner, Yuichi Inubushi, Konrad J. Kapcia, Hae Ja Lee,\n  Vladimir Lipp, Paloma Martinez, Eiji Nishibori, Taito Osaka, Sven Toleikis,\n  Jumpei Yamada, Makina Yabashi, Beata Ziaja, Philip A. Heimann","title":"Interplay of thermal and non-thermal effects in x-ray-induced ultrafast\n  melting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph physics.atom-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  X-ray laser-induced structural changes in silicon undergoing femtosecond\nmelting have been investigated by using an x-ray pump-x-ray probe technique.\nThe experimental results for different initial sample temperatures reveal that\nthe onset time and the speed of the atomic disordering are independent of the\ninitial temperature, suggesting that equilibrium atomic motion in the initial\nstate does not play a pivotal role in the x-ray-induced ultrafast melting. By\ncomparing the observed time-dependence of the atomic disordering and the\ndedicated theoretical simulations, we interpret that the energy transfer from\nthe excited electrons to ions via electron-ion coupling (thermal effect) as\nwell as a strong modification of the interatomic potential due to electron\nexcitations (non-thermal effect) trigger the ultrafast atomic disordering. Our\nfinding of the interplay of thermal and non-thermal effects in the\nx-ray-induced melting demonstrates that accurate modeling of intense x-ray\ninteractions with matter is essential to ensure a correct interpretation of\nexperiments using intense x-ray laser pulses.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:23:16 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 02:18:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Inoue","Ichiro",""],["Tkachenko","Victor",""],["Kubota","Yuya",""],["Dorchies","Fabien",""],["Hara","Toru",""],["H\u00f6eppner","Hauke",""],["Inubushi","Yuichi",""],["Kapcia","Konrad J.",""],["Lee","Hae Ja",""],["Lipp","Vladimir",""],["Martinez","Paloma",""],["Nishibori","Eiji",""],["Osaka","Taito",""],["Toleikis","Sven",""],["Yamada","Jumpei",""],["Yabashi","Makina",""],["Ziaja","Beata",""],["Heimann","Philip A.",""]]}
{"id":"2308.14561","submitter":"Mikhail Levchenko Mr","authors":"Mikhail Levchenko, Elena Stoykova, Branimir Ivanov, Lian Nedelchev,\n  Dimana Nazarova, Kihong Choi, Joongki Park","title":"Noise analysis in outdoor dynamic speckle measurement","comments":null,"journal-ref":null,"doi":"10.1364/AO.478518","report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamic speckle method is an effective tool for estimation of speed of\nprocesses. Speed distribution is encoded in a map built by statistical\npointwise processing of time-correlated speckle patterns. For industrial\ninspection,the outdoor noisy measurement is required. The paper analyzes\nefficiency of the dynamic speckle method in the presence of environmental noise\nas phase fluctuations due to lack of vibration isolation and shot noise due to\nambient light. Usage of normalized estimates for the case of non-uniform laser\nillumination is studied. Feasibility of the outdoor measurement has been proven\nby numerical simulationsof noisy image capture and real experiments with test\nobjects. Good agreement has been demonstrated both in simulation and experiment\nbetween the ground truth map and the maps extracted from noisy data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:24:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Levchenko","Mikhail",""],["Stoykova","Elena",""],["Ivanov","Branimir",""],["Nedelchev","Lian",""],["Nazarova","Dimana",""],["Choi","Kihong",""],["Park","Joongki",""]]}
{"id":"2308.14562","submitter":"Philip Tobuschat","authors":"Philip Tobuschat, Hao Ma, Dieter B\\\"uchler, Bernhard Sch\\\"olkopf,\n  Michael Muehlebach","title":"Data-Efficient Online Learning of Ball Placement in Robot Table Tennis","comments":"7 pages, 6 figures, to be published in proceedings of the IEEE/RSJ\n  International Conference on Intelligent Robots and Systems (IROS) 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an implementation of an online optimization algorithm for hitting\na predefined target when returning ping-pong balls with a table tennis robot.\nThe online algorithm optimizes over so-called interception policies, which\ndefine the manner in which the robot arm intercepts the ball. In our case,\nthese are composed of the state of the robot arm (position and velocity) at\ninterception time. Gradient information is provided to the optimization\nalgorithm via the mapping from the interception policy to the landing point of\nthe ball on the table, which is approximated with a black-box and a grey-box\napproach. Our algorithm is applied to a robotic arm with four degrees of\nfreedom that is driven by pneumatic artificial muscles. As a result, the robot\narm is able to return the ball onto any predefined target on the table after\nabout 2-5 iterations. We highlight the robustness of our approach by showing\nrapid convergence with both the black-box and the grey-box gradients. In\naddition, the small number of iterations required to reach close proximity to\nthe target also underlines the sample efficiency. A demonstration video can be\nfound here: https://youtu.be/VC3KJoCss0k.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:24:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tobuschat","Philip",""],["Ma","Hao",""],["B\u00fcchler","Dieter",""],["Sch\u00f6lkopf","Bernhard",""],["Muehlebach","Michael",""]]}
{"id":"2308.14563","submitter":"Steffen Wilksen","authors":"Steffen Wilksen, Frederik Lohof, Isabell Willmann, Frederik Bopp,\n  Michelle Lienhart, Christopher Thalacker, Jonathan Finley, Matthias Florian,\n  Christopher Gies","title":"Gate-based protocol simulations for quantum repeaters using quantum-dot\n  molecules in switchable electric fields","comments":"12 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Electrically controllable quantum-dot molecules (QDMs) are a promising\nplatform for deterministic entanglement generation and, as such, a resource for\nquantum-repeater networks. We develop a microscopic open-quantum-systems\napproach based on a time-dependent Bloch-Redfield equation to model the\ngeneration of entangled spin states with high fidelity. The state preparation\nis a crucial step in a protocol for deterministic entangled-photon-pair\ngeneration that we propose for quantum repeater applications. Our theory takes\ninto account the quantum-dot molecules' electronic properties that are\ncontrolled by time-dependent electric fields as well as dissipation due to\nelectron-phonon interaction. We quantify the transition between adiabatic and\nnon-adiabatic regimes, which provides insights into the dynamics of adiabatic\ncontrol of QDM charge states in the presence of dissipative processes. From\nthis, we infer the maximum speed of entangled-state preparation under different\nexperimental conditions, which serves as a first step towards simulation of\nattainable entangled photon-pair generation rates. The developed formalism\nopens the possibility for device-realistic descriptions of repeater protocol\nimplementations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:25:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wilksen","Steffen",""],["Lohof","Frederik",""],["Willmann","Isabell",""],["Bopp","Frederik",""],["Lienhart","Michelle",""],["Thalacker","Christopher",""],["Finley","Jonathan",""],["Florian","Matthias",""],["Gies","Christopher",""]]}
{"id":"2308.14564","submitter":"Yuanjun Jin","authors":"Yuanjun Jin, XingYu Yue, Yong Xu, Xiang-Long Yu, and Guoqing Chang","title":"Two-dimensional weak topological insulators and superconductors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.other cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The one-dimensional (1D) Su-Schrieffer-Heeger (SSH) model is central to band\ntopology in condensed matter physics, which allows us to understand and design\ntopological states. The Su-Schrieffer-Heeger (SSH) model serves as a basis for\ntopological insulators and provides insights into various topological states.\nIn this letter, we find another mechanism to analogize the SSHmodel by\nintroducing intrinsic spin-orbital coupling (SOC) and in-plane Zeeman field\ninstead of relying on alternating hopping integrals. In our model, the bound\nstates are protected by a quantizedhidden polarization andcharacterized by a\nweak Z2 index (0;01) due to the inversion symmetry I. When the I symmetry is\nbroken, charge pumping is achieved by tuning the polarization. Moreover, by\nintroducing the p + ip superconductor pairing potential, a new topological\nphase called weak topological superconductor (TSC) is identified. The new TSC\nis characterized by a weak Z2 index (0;01) and nonchiral bound states. More\ninterestingly, these nonchiral bound states give rise to a chiral nonlocal\nconductance, which is different from the traditional chiral TSC. Our findings\nnot only innovate the SSH model, but also predict the existence of weak TSC,\nproviding an alternative avenue for further exploration of its transport\nproperties.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:27:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jin","Yuanjun",""],["Yue","XingYu",""],["Xu","Yong",""],["Yu","Xiang-Long",""],["Chang","Guoqing",""]]}
{"id":"2308.14565","submitter":"Timofey Semenikhin","authors":"Matwey V. Kornilov, T. A. Semenikhin, M. V. Pruzhinskaya","title":"Reduction of supernova light curves by vector Gaussian processes","comments":"10 pages, 6 figures, 1 table, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Bolometric light curves play an important role in understanding the\nunderlying physics of various astrophysical phenomena, as they allow for a\ncomprehensive modeling of the event and enable comparison between different\nobjects. However, constructing these curves often requires the approximation\nand extrapolation from multicolor photometric observations. In this study, we\nintroduce vector Gaussian processes as a new method for reduction of supernova\nlight curves. This method enables us to approximate vector functions, even with\ninhomogeneous time-series data, while considering the correlation between light\ncurves in different passbands. We applied this methodology to a sample of 29\nsuperluminous supernovae (SLSNe) assembled using the Open Supernova Catalog.\nTheir multicolor light curves were approximated using vector Gaussian\nprocesses. Subsequently, under the black-body assumption for the SLSN spectra\nat each moment of time, we reconstructed the bolometric light curves. The\nvector Gaussian processes developed in this work are accessible via the Python\nlibrary gp-multistate-kernel on GitHub. Our approach provides an efficient tool\nfor analyzing light curve data, opening new possibilities for astrophysical\nresearch.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:27:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kornilov","Matwey V.",""],["Semenikhin","T. A.",""],["Pruzhinskaya","M. V.",""]]}
{"id":"2308.14566","submitter":"Chenxu Ni","authors":"Chenxu Ni, Siyu Ding, Xingjian Wang","title":"Parametric reduced order models with machine learning for spatial\n  emulation of mixing and combustion problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-fidelity simulations of mixing and combustion processes are generally\ncomputationally demanding and time-consuming, hindering their wide application\nin industrial design and optimization. The present study proposes parametric\nreduced order models (ROMs) to emulate spatial distributions of physical fields\nfor multi-species mixing and combustion problems in a fast and accurate manner.\nThe model integrates recent advances in experimental design, high-dimensional\ndata assimilation, proper-orthogonal-decomposition (POD)-based model reduction,\nand machine learning (ML). The ML methods of concern include Gaussian process\nkriging, second-order polynomial regression, k-nearest neighbors, deep neural\nnetwork (DNN), and support vector regression. Parametric ROMs with different ML\nmethods are carefully examined through the emulation of mixing and combustion\nof steam-diluted fuel blend and oxygen issuing from a triple-coaxial nozzle.\nTwo design parameters, fuel blending ratio (hydrogen/methane) and steam\ndilution ratio, are considered. Numerical simulations are performed and\ntraining data is assimilated at sampling points determined by the\nLatin-hypercube design method. The results show that ROM with kriging presents\na superior performance in predicting almost all physical fields, such as\ntemperature, velocity magnitude, and combustion products, at different\nvalidation points. The accuracy of ROM with DNN is not encouraging owing to the\nstringent requirement on the size of training database, which cannot be\nguaranteed as many engineering problems are specific and associated data\navailability is limited. For the emulation of spatial field, the parametric\nROMs achieve a turnaround time of up to eight orders of magnitude faster than\nconventional numerical simulation, facilitating an efficient framework for\ndesign and optimization.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:28:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ni","Chenxu",""],["Ding","Siyu",""],["Wang","Xingjian",""]]}
{"id":"2308.14567","submitter":"Daniel Larsson","authors":"Daniel Larsson","title":"Torsion points on Elliptic Curves and the Jackson Space","comments":"Comments and corrections are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we will use a particular non-commutative scheme to, among other\nthings, study the ramification properties of the field of $p$-torsion points on\nan elliptic curve and its reduction properties. Also, we show that this\nnon-commutative space also allow us to use the $p$-torsion points to\n``parametrise'' classes in the $p$-torsion of the Brauer group of the base\nfield.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:33:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Larsson","Daniel",""]]}
{"id":"2308.14568","submitter":"Cheng Lu","authors":"Yong Wang, Cheng Lu, Yuan Zong, Hailun Lian, Yan Zhao, Sunan Li","title":"Time-Frequency Transformer: A Novel Time Frequency Joint Learning Method\n  for Speech Emotion Recognition","comments":"Accepted by International Conference on Neural Information Processing\n  (ICONIP2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we propose a novel time-frequency joint learning method for\nspeech emotion recognition, called Time-Frequency Transformer. Its advantage is\nthat the Time-Frequency Transformer can excavate global emotion patterns in the\ntime-frequency domain of speech signal while modeling the local emotional\ncorrelations in the time domain and frequency domain respectively. For the\npurpose, we first design a Time Transformer and Frequency Transformer to\ncapture the local emotion patterns between frames and inside frequency bands\nrespectively, so as to ensure the integrity of the emotion information modeling\nin both time and frequency domains. Then, a Time-Frequency Transformer is\nproposed to mine the time-frequency emotional correlations through the local\ntime-domain and frequency-domain emotion features for learning more\ndiscriminative global speech emotion representation. The whole process is a\ntime-frequency joint learning process implemented by a series of Transformer\nmodels. Experiments on IEMOCAP and CASIA databases indicate that our proposed\nmethod outdoes the state-of-the-art methods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:34:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Yong",""],["Lu","Cheng",""],["Zong","Yuan",""],["Lian","Hailun",""],["Zhao","Yan",""],["Li","Sunan",""]]}
{"id":"2308.14569","submitter":"Haoqiang Huang","authors":"Siu-Wing Cheng, Haoqiang Huang","title":"Solving Fr\\'echet Distance Problems by Algebraic Geometric Methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study several polygonal curve problems under the Fr\\'{e}chet distance via\nalgebraic geometric methods. Let $\\mathbb{X}_m^d$ and $\\mathbb{X}_k^d$ be the\nspaces of all polygonal curves of $m$ and $k$ vertices in $\\mathbb{R}^d$,\nrespectively. We assume that $k \\leq m$. Let $\\mathcal{R}^d_{k,m}$ be the set\nof ranges in $\\mathbb{X}_m^d$ for all possible metric balls of polygonal curves\nin $\\mathbb{X}_k^d$ under the Fr\\'{e}chet distance. We prove a nearly optimal\nbound of $O(dk\\log (km))$ on the VC dimension of the range space\n$(\\mathbb{X}_m^d,\\mathcal{R}_{k,m}^d)$, improving on the previous\n$O(d^2k^2\\log(dkm))$ upper bound and approaching the current $\\Omega(dk\\log k)$\nlower bound. Our upper bound also holds for the weak Fr\\'{e}chet distance. We\nalso obtain exact solutions that are hitherto unknown for curve simplification,\nrange searching, nearest neighbor search, and distance oracle.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:34:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cheng","Siu-Wing",""],["Huang","Haoqiang",""]]}
{"id":"2308.14570","submitter":"Haonan Guo","authors":"Haonan Guo, Xin Su, Chen Wu, Bo Du, Liangpei Zhang","title":"SAAN: Similarity-aware attention flow network for change detection with\n  VHR remote sensing images","comments":"15 pages,13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Change detection (CD) is a fundamental and important task for monitoring the\nland surface dynamics in the earth observation field. Existing deep\nlearning-based CD methods typically extract bi-temporal image features using a\nweight-sharing Siamese encoder network and identify change regions using a\ndecoder network. These CD methods, however, still perform far from\nsatisfactorily as we observe that 1) deep encoder layers focus on irrelevant\nbackground regions and 2) the models' confidence in the change regions is\ninconsistent at different decoder stages. The first problem is because deep\nencoder layers cannot effectively learn from imbalanced change categories using\nthe sole output supervision, while the second problem is attributed to the lack\nof explicit semantic consistency preservation. To address these issues, we\ndesign a novel similarity-aware attention flow network (SAAN). SAAN\nincorporates a similarity-guided attention flow module with deeply supervised\nsimilarity optimization to achieve effective change detection. Specifically, we\ncounter the first issue by explicitly guiding deep encoder layers to discover\nsemantic relations from bi-temporal input images using deeply supervised\nsimilarity optimization. The extracted features are optimized to be\nsemantically similar in the unchanged regions and dissimilar in the changing\nregions. The second drawback can be alleviated by the proposed\nsimilarity-guided attention flow module, which incorporates similarity-guided\nattention modules and attention flow mechanisms to guide the model to focus on\ndiscriminative channels and regions. We evaluated the effectiveness and\ngeneralization ability of the proposed method by conducting experiments on a\nwide range of CD tasks. The experimental results demonstrate that our method\nachieves excellent performance on several CD tasks, with discriminative\nfeatures and semantic consistency preserved.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:35:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guo","Haonan",""],["Su","Xin",""],["Wu","Chen",""],["Du","Bo",""],["Zhang","Liangpei",""]]}
{"id":"2308.14571","submitter":"Giada Franceschi","authors":"Giada Franceschi, Sebastian Brandstetter, Jan Balajka, Igor\n  Sokolovi\\'c, Jiri Pavele\\'c, Martin Setv\\'in, Michael Schmid, and Ulrike\n  Diebold","title":"Interaction of surface cations of cleaved mica with water in vapor and\n  liquid forms","comments":"8 pages, 4 figures","journal-ref":"Faraday Discussions (2023)","doi":"10.1039/D3FD00093A","report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Natural minerals contain ions that become hydrated when they come into\ncontact with water in vapor and liquid forms. Muscovite mica -- a common\nphyllosilicate with perfect cleavage planes -- is an ideal system to\ninvestigate the details of ion hydration. The cleaved mica surface is decorated\nby an array of K$^+$ ions that can be easily exchanged with other ions or\nprotons when immersed in an aqueous solution. Despite the vast interest in the\natomic-scale hydration processes of these K$^+$ ions, experimental data under\ncontrolled conditions have remained elusive. Here, atomically resolved\nnon-contact atomic force microscopy (nc-AFM) is combined with X-ray\nphotoelectron spectroscopy (XPS) to investigate the cation hydration upon\ndosing water vapor at 100 K in ultra-high vacuum (UHV). The cleaved surface is\nfurther exposed to ultra-clean liquid water at room temperature, which promotes\nion mobility and partial ion-to-proton substitution. The results offer the\nfirst direct experimental views of the interaction of water with muscovite mica\nin UHV. The findings are in line with previous theoretical predictions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:35:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Franceschi","Giada",""],["Brandstetter","Sebastian",""],["Balajka","Jan",""],["Sokolovi\u0107","Igor",""],["Pavele\u0107","Jiri",""],["Setv\u00edn","Martin",""],["Schmid","Michael",""],["Diebold","Ulrike",""]]}
{"id":"2308.14572","submitter":"Devvrat Tiwari","authors":"Gourab Bhanja, Devvrat Tiwari, Subhashish Banerjee","title":"Characteristics of quantum thermodynamics in non-Markovian quantum\n  Brownian motion","comments":"9 pages and 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum Brownian motion serves as a fundamental paradigm for investigations\nin open quantum systems, where a harmonic oscillator interacts with a bosonic\nthermal bath. A generalized coupling of the environment to the harmonic\noscillator system via both its position and momentum was developed in recent\ntimes. To this end, we take up this generalized model of quantum Brownian\nmotion and study it from the perspective of quantum thermodynamics. The system\nof interest is envisaged as a quantum battery interacting with the bath acting\nas a charger (dissipation) mechanism. We probe into the problem of maximum work\nthat can be extracted through such a system using ergotropy and its\n(in)-coherent parts along with the instantaneous and average powers of the\nbattery. We examine the effect of bath temperature and momentum coupling on the\ncharging-discharging behavior of the battery. A connection between the memory\neffects of the system with charging-discharging behavior is further explored.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:35:55 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhanja","Gourab",""],["Tiwari","Devvrat",""],["Banerjee","Subhashish",""]]}
{"id":"2308.14573","submitter":"Fabiana Zama","authors":"Daniele Carosi, Fabiana Zama, Alessandro Morri, Lorella Ceschini","title":"Linearizing Anhysteretic Magnetization Curves: A Novel Algorithm for\n  Finding Simulation Parameters and Magnetic Moments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  This paper proposes a new method for determining the simulation parameters of\nthe Jiles-Atherton Model used to simulate the first magnetization curve and\nhysteresis loop in ferromagnetic materials. The Jiles-Atherton Model is an\nimportant tool in engineering applications due to its relatively simple\ndifferential formulation. However, determining the simulation parameters for\nthe anhysteretic curve is challenging. Several methods have been proposed,\nprimarily based on mathematical aspects of the anhysteretic and first\nmagnetization curves and hysteresis loops. This paper focuses on finding the\nmagnetic moments of the material, which are used to define the simulation\nparameters for its anhysteretic curve. The proposed method involves using the\nsusceptibility of the material and a linear approximation of a paramagnet to\nfind the magnetic moments. The simulation parameters can then be found based on\nthe magnetic moments. The method is validated theoretically and experimentally\nand offers a more physical approach to finding simulation parameters for the\nanhysteretic curve and a simplified way of determining the magnetic moments of\nthe material.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:37:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Carosi","Daniele",""],["Zama","Fabiana",""],["Morri","Alessandro",""],["Ceschini","Lorella",""]]}
{"id":"2308.14574","submitter":"Gennaro Zanfardino","authors":"Victor Bittencourt, Massimo Blasone and Gennaro Zanfardino","title":"Chiral and flavor oscillations in a hyperentangled neutrino state","comments":"12 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By means of the Dirac bispinor formalism, we show that the state of a\n(massive) oscillating neutrino produced by a weak interaction process, is an\nhyperentangled state of flavor, chirality, and spin. Since chirality is not a\nconserved quantity, chiral oscillations take place and affects the flavor\ntransition probability. By means of the complete complementarity relations, we\nanalyze how correlations and coherence are redistributed in time between the\ndifferent degrees-of-freedoms of the system. In a similar way, we consider a\nspin entangled lepton-antineutrino pair and describe the redistribution of the\nspin-spin entanglement into correlations between the other degrees-of-freedom.\nIn both cases the effects of chiral oscillations are relevant in the\nnon-relativistic regime. Our analysis provides a complete characterization of\nthe quantum correlations involved in lepton-antineutrino pairs and in single\nparticle neutrino evolution, and provides a further insight on possible routes\nto interpret and measure chiral oscillations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:38:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bittencourt","Victor",""],["Blasone","Massimo",""],["Zanfardino","Gennaro",""]]}
{"id":"2308.14575","submitter":"Fang Liu","authors":"Fang Liu, Yuhao Liu, Yuqiu Kong, Ke Xu, Lihe Zhang, Baocai Yin,\n  Gerhard Hancke, Rynson Lau","title":"Referring Image Segmentation Using Text Supervision","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing Referring Image Segmentation (RIS) methods typically require\nexpensive pixel-level or box-level annotations for supervision. In this paper,\nwe observe that the referring texts used in RIS already provide sufficient\ninformation to localize the target object. Hence, we propose a novel\nweakly-supervised RIS framework to formulate the target localization problem as\na classification process to differentiate between positive and negative text\nexpressions. While the referring text expressions for an image are used as\npositive expressions, the referring text expressions from other images can be\nused as negative expressions for this image. Our framework has three main\nnovelties. First, we propose a bilateral prompt method to facilitate the\nclassification process, by harmonizing the domain discrepancy between visual\nand linguistic features. Second, we propose a calibration method to reduce\nnoisy background information and improve the correctness of the response maps\nfor target object localization. Third, we propose a positive response map\nselection strategy to generate high-quality pseudo-labels from the enhanced\nresponse maps, for training a segmentation network for RIS inference. For\nevaluation, we propose a new metric to measure localization accuracy.\nExperiments on four benchmarks show that our framework achieves promising\nperformances to existing fully-supervised RIS methods while outperforming\nstate-of-the-art weakly-supervised methods adapted from related areas. Code is\navailable at https://github.com/fawnliu/TRIS.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:40:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Fang",""],["Liu","Yuhao",""],["Kong","Yuqiu",""],["Xu","Ke",""],["Zhang","Lihe",""],["Yin","Baocai",""],["Hancke","Gerhard",""],["Lau","Rynson",""]]}
{"id":"2308.14576","submitter":"Mohamed Aly Bouke","authors":"MA. Bouke, A. Abdullah","title":"Turnkey Technology: A Powerful Tool for Cyber Warfare","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Turnkey technology has emerged as a game-changing tool in cyber warfare,\noffering state and non-state actors unprecedented access to advanced cyber\ncapabilities. The advantages of turnkey technology include rapid deployment and\nadaptability, lower costs and resource requirements, the democratization of\ncyber warfare capabilities, and enhanced offensive and defensive strategies.\nHowever, turnkey technology also introduces significant risks, such as the\nproliferation of cyber weapons, ethical considerations, potential collateral\ndamage, escalation of conflicts, and legal ramifications. This paper provides a\nunique perspective on the implications of turnkey technology in cyber warfare,\nhighlighting its advantages, risks, and challenges, as well as the potential\nstrategies for mitigating these concerns. The research's novelty lies in\nexamining real-world examples and proposing a multifaceted approach to address\nthe challenges associated with turnkey technology in cyber warfare. This\napproach focuses on developing effective cybersecurity measures, establishing\ninternational norms and regulations, promoting responsible use and development\nof turnkey technology, and enhancing global cooperation on cyber warfare\nissues. By adopting this accountable and balanced approach, governments,\norganizations, and the international community can work together to create a\nmore secure and stable digital environment, leveraging the benefits of turnkey\ntechnology while minimizing the associated risks and challenges.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:41:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bouke","MA.",""],["Abdullah","A.",""]]}
{"id":"2308.14577","submitter":"Thomas Manzini","authors":"Thomas Manzini, Robin Murphy, David Merrick","title":"Quantitative Data Analysis: CRASAR Small Unmanned Aerial Systems at\n  Hurricane Ian","comments":"6 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper provides a summary of the 281 sorties that were flown by the 10\ndifferent models of small unmanned aerial systems (sUAS) at Hurricane Ian, and\nthe failures made in the field. These 281 sorties, supporting 44 missions,\nrepresents the largest use of sUAS in a disaster to date (previously Hurricane\nFlorence with 260 sorties). The sUAS operations at Hurricane Ian differ\nslightly from prior operations as they included the first documented uses of\ndrones performing interior search for victims, and the first use of a VTOL\nfixed wing aircraft during a large scale disaster. However, there are\nsubstantive similarities to prior drone operations. Most notably, rotorcraft\ncontinue to perform the vast majority of flights, wireless data transmission\ncapacity continues to be a limitation, and the lack of centralized control for\nunmanned and manned aerial systems continues to cause operational friction.\nThis work continues by documenting the failures, both human and technological\nmade in the field and concludes with a discussion summarizing potential areas\nfor further work to improve sUAS response to large scale disasters.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:43:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Manzini","Thomas",""],["Murphy","Robin",""],["Merrick","David",""]]}
{"id":"2308.14578","submitter":"Jiakang Zheng","authors":"Jiakang Zheng, Jiayi Zhang, Hongyang Du, Dusit Niyato, Sumei Sun, Bo\n  Ai, and Khaled B. Letaief","title":"Flexible-Position MIMO for Wireless Communications: Fundamentals,\n  Challenges, and Future Directions","comments":"9 pages, 5 figures, 1 tables, submitted to IEEE Wireless\n  Communications Magazine","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The flexible-position multiple-input multiple-output (MIMO), such as fluid\nantennas and movable antennas, is a promising technology for future wireless\ncommunications. This is due to the fact that the positions of antennas at the\ntransceiver and reflector can be dynamically optimized to achieve better\nchannel conditions and, as such, can provide high spectral efficiency (SE) and\nenergy efficiency (EE) gains with fewer antennas. In this article, we introduce\nthe fundamentals of flexibleposition MIMO systems, including hardware design,\nstructure design, and potential applications. We shall demonstrate that\nflexible-position MIMO, using fewer flexible antennas, can match the channel\nhardening achieved by a large number of fixed antennas. We will then analyze\nthe SE-EE relationship for flexible-position MIMO and fixed-position MIMO.\nFurthermore, we will design the optimal trajectory of flexible antennas to\nmaximize system sum SE or total EE at a fixed travel distance of each antenna.\nFinally, several important research directions regarding flexible-position MIMO\ncommunications are presented to facilitate further investigation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:45:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zheng","Jiakang",""],["Zhang","Jiayi",""],["Du","Hongyang",""],["Niyato","Dusit",""],["Sun","Sumei",""],["Ai","Bo",""],["Letaief","Khaled B.",""]]}
{"id":"2308.14579","submitter":"Daniel Larsson","authors":"Daniel Larsson","title":"Arithmetic Geometry of Non-Commutative Spaces with Large Centres","comments":"Comments and corrections are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces arithmetic geometry for polynomial identity algebras\nusing non-commutative (formal) deformation theory. Since formal deformation\ntheory is inherently local the arithmetic and geometric results that follow\ngive local information that is not visible when looking at the objects from a\ncommutative angle. For instance, it is a precise meaning to be given to two\nthings being ``infinitesimally close'', something being obscured from view when\nrestricting only to a commutative algebraic study. A Platonesque way of looking\nat this is that the commutative world is a ``shadow'' of a more inclusive\nnon-commutative universe.\n  The present paper aims at laying the foundation for further and deeper study\nof arithmetic and geometry using non-commutative geometry and non-commutative\ndeformation theory.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:46:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Larsson","Daniel",""]]}
{"id":"2308.14580","submitter":"Han-Bom Moon","authors":"Ritik Jain, Han-Bom Moon, Peter Wu","title":"Distribution of the number of zeros of polynomials over a finite field","comments":"12 pages, an REU project at Fordham University","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the probability distribution of the number of zeros of multivariable\npolynomials with bounded degree over a finite field. We find the probability\ngenerating function for each set of bounded degree polynomials. In particular,\nin the single variable case, we show that as the degree of the polynomials and\nthe order of the field simultaneously approach infinity, the distribution\nconverges to a Poisson distribution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:47:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Jain","Ritik",""],["Moon","Han-Bom",""],["Wu","Peter",""]]}
{"id":"2308.14581","submitter":"Wolfgang Poiger","authors":"Alexander Kurz, Wolfgang Poiger, Bruno Teheux","title":"Many-valued coalgebraic logic over semi-primal varieties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.CT math.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study many-valued coalgebraic logics with semi-primal algebras of\ntruth-degrees. We provide a systematic way to lift endofunctors defined on the\nvariety of Boolean algebras to endofunctors on the variety generated by a\nsemi-primal algebra. We show that this can be extended to a technique to lift\nclassical coalgebraic logics to many-valued ones, and that (one-step)\ncompleteness and expressivity are preserved under this lifting. For specific\nclasses of endofunctors, we also describe how to obtain an axiomatization of\nthe lifted many-valued logic directly from an axiomatization of the original\nclassical one. In particular, we apply all of these techniques to classical\nmodal logic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:47:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kurz","Alexander",""],["Poiger","Wolfgang",""],["Teheux","Bruno",""]]}
{"id":"2308.14582","submitter":"Andreas Fyrillas","authors":"Nicolas Maring, Andreas Fyrillas, Mathias Pont, Edouard Ivanov, Eric\n  Bertasi, Mario Valdivia, Jean Senellart","title":"One nine availability of a Photonic Quantum Computer on the Cloud toward\n  HPC integration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The integration of Quantum Computers (QC) within High-Performance Computing\n(HPC) environments holds significant promise for solving real-world problems by\nleveraging the strengths of both computational paradigms. However, the\nintegration of a complex QC platform in an HPC infrastructure poses several\nchallenges, such as operation stability in non-laboratory like environments,\nand scarce access for maintenance. Currently, only a few fully-assembled QCs\ncurrently exist worldwide, employing highly heterogeneous and cutting-edge\ntechnologies. These platforms are mostly used for research purposes, and often\nbear closer resemblance to laboratory assemblies rather than production-ready,\nstable, and consistently-performing turnkey machines. Moreover, public cloud\nservices with access to such quantum computers are scarce and their\navailability is generally limited to few days per week. In November 2022, we\nintroduced the first cloud-accessible general-purpose quantum computer based on\nsingle photons. One of the key objectives was to maintain the platform's\navailability as high as possible while anticipating seamless compatibility with\nHPC hosting environment. In this article, we describe the design and\nimplementation of our cloud-accessible quantum computing platform, and\ndemonstrate one nine availability (92 %) for external users during a six-month\nperiod, higher than most online services. This work lay the foundation for\nadvancing quantum computing accessibility and usability in hybrid HPC-QC\ninfrastructures.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:47:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Maring","Nicolas",""],["Fyrillas","Andreas",""],["Pont","Mathias",""],["Ivanov","Edouard",""],["Bertasi","Eric",""],["Valdivia","Mario",""],["Senellart","Jean",""]]}
{"id":"2308.14583","submitter":"Juan Leon Alcazar","authors":"Juan Leon-Alcazar, Yazeed Alnumay, Cheng Zheng, Hassane Trigui,\n  Sahejad Patel and Bernard Ghanem","title":"Learning to Read Analog Gauges from Synthetic Data","comments":null,"journal-ref":"Winter Conference on Applications of Computer Vision 2024","doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Manually reading and logging gauge data is time inefficient, and the effort\nincreases according to the number of gauges available. We present a computer\nvision pipeline that automates the reading of analog gauges. We propose a\ntwo-stage CNN pipeline that identifies the key structural components of an\nanalog gauge and outputs an angular reading. To facilitate the training of our\napproach, a synthetic dataset is generated thus obtaining a set of realistic\nanalog gauges with their corresponding annotation. To validate our proposal, an\nadditional real-world dataset was collected with 4.813 manually curated images.\nWhen compared against state-of-the-art methodologies, our method shows a\nsignificant improvement of 4.55 in the average error, which is a 52% relative\nimprovement. The resources for this project will be made available at:\nhttps://github.com/fuankarion/automatic-gauge-reading.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:49:08 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Leon-Alcazar","Juan",""],["Alnumay","Yazeed",""],["Zheng","Cheng",""],["Trigui","Hassane",""],["Patel","Sahejad",""],["Ghanem","Bernard",""]]}
{"id":"2308.14584","submitter":"Bo-Yuan Li","authors":"Bo-Yuan Li, Xiao-Yang Li, Xia Lu, Rui Kang, Zhao-Xing Tian, Feng Ling","title":"Utilizing entropy to systematically quantify the resting-condition\n  baroreflex regulation function","comments":"25 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cond-mat.stat-mech physics.pop-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Baroreflex is critical to maintain the blood pressure homeostasis, and the\nquantification of the baroreflex regulation function (BRF) can provide guidance\nfor disease diagnosis, treatment and healthcare. Current quantification of the\nBRF such as baroreflex sensitivity cannot represent the BRF systematically.\nFrom the perspective of complex systems, we regard that the BRF is the\nemergence result of the diverse states and interactions in the physiological\nmechanisms. Therefore, the three-layer emergence is constructed in this work,\nwhich is from the physiological mechanisms to the physiological indexes and\nthen to the BRF. On this basis, since the entropy in statistical physics\nmacroscopically measures the diversity of the system's states, a new index\ncalled the PhysioEnt is proposed to represent the BRF and quantify the physical\nrelationships between the BRF and four physiological indexes, baroreflex\nsensitivity, heart rate, heart rate variability, and systolic blood pressure.\nBased on the proposed method, some new findings with medical significance are\nobtained, including the mechanisms that aging and obesity affect the\nresting-condition BRF are different, and the resting-condition BRFs of men and\nolder people depend more on the physiological processes among organs/tissues.\nBased on the measurable indexes, the proposed method would support the\nindividualized medicine prospectively.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:49:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Bo-Yuan",""],["Li","Xiao-Yang",""],["Lu","Xia",""],["Kang","Rui",""],["Tian","Zhao-Xing",""],["Ling","Feng",""]]}
{"id":"2308.14585","submitter":"Vjosa Blakaj","authors":"Vjosa Blakaj and Michael M. Wolf","title":"On the set of reduced states of translation invariant, infinite quantum\n  systems","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The set of two-body reduced states of translation invariant, infinite quantum\nspin chains can be approximated from inside and outside using matrix product\nstates and marginals of finite systems, respectively. These lead to hierarchies\nof algebraic approximations that become tight only in the limit of infinitely\nmany auxiliary variables. We show that this is necessarily so for any algebraic\nansatz by proving that the set of reduced states is not semialgebraic. We also\nprovide evidence that additional elementary transcendental functions cannot\nlead to a finitary description.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:50:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Blakaj","Vjosa",""],["Wolf","Michael M.",""]]}
{"id":"2308.14586","submitter":"Antonio J Pan-Collantes","authors":"A. J. Pan-Collantes, C. Muriel, A. Ruiz","title":"Integration of differential equations by\n  $\\mathcal{C}^{\\infty}$-structures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.SI math-ph math.DS math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several integrability problems of differential equations are addressed by\nusing the concept of $\\mathcal{C}^{\\infty}$-structure, a recent generalization\nof the notion of solvable structure. Specifically, the integration procedure\nassociated with $\\mathcal{C}^{\\infty}$-structures is used to integrate to a\nLotka-Volterra model and several differential equations that lack sufficient\nLie point symmetries and cannot be solved using conventional methods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:50:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Pan-Collantes","A. J.",""],["Muriel","C.",""],["Ruiz","A.",""]]}
{"id":"2308.14587","submitter":"Hai Wang","authors":"Minjie Wang, Haole Jiao, Jiajin Lu, Wenxin Fan, Zhifang Yang, Mengqi\n  Xi, Shujing Li, Hai Wang","title":"Proof-of-principle demonstration of temporally multiplexed quantum\n  repeater link based on atomic ensemble","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Duan-Lukin-Cirac-Zoller quantum repeater protocol provides a feasible scheme\nto implement long-distance quantum communication and large-scale quantum\nnetworks. The elementary link, namely the entanglement between two atomic\nensembles, is a fundamental component of quantum repeater. For practical\nquantum repeater, it is required that the elementary link can be prepared with\nhigh yield and the spin waves stored in atoms can be efficiently converted into\nphotons on demand. However, so far, such quantum repeater link has not been\ndemonstrated in experiments. Here, we demonstrate a proof-of-principle\nmultiplexed quantum repeater link by entangling two temporally multiplexed\nquantum memory. Compared with a single-mode link, the successful preparation\nrate of the multiplexed link is increased by one order of magnitude. By using\nthe cavity-enhanced scheme, the on-demand retrieval efficiency of atomic spin\nwaves is improved to 70%, which is beneficial for the subsequent entanglement\nswapping between adjacent links. The realization of temporally multiplexed\nquantum repeater link with high retrieval efficiency lays a foundation for the\ndevelopment of practical quantum networks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:52:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Minjie",""],["Jiao","Haole",""],["Lu","Jiajin",""],["Fan","Wenxin",""],["Yang","Zhifang",""],["Xi","Mengqi",""],["Li","Shujing",""],["Wang","Hai",""]]}
{"id":"2308.14588","submitter":"Thomas Steinmetz","authors":"T. Steinmetz, T. Kami\\'nski, M. Schmidt, A. Kiljan","title":"A bipolar structure and shocks surrounding the stellar-merger remnant\n  V1309 Scorpii","comments":"22 pages, 16 figures. Submitted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context. V1309 Sco is an example of a red nova, a product of the merger\nbetween non-compact stars. V1309 Sco is particularly important within the class\nof red novae due to the abundance of the progenitor binary before the merger.\n  Aims. We aim to investigate the spatio-kinematic and chemical properties of\nthe circumstellar environment, including deriving the physical conditions and\nestablishing the origins of the different circumstellar components.\n  Methods. We use radiative transfer modelling of molecular emission in sub-mm\nspectra to examine the properties of the molecular gas, and use forbidden line\ndiagnostics from optical spectra to constrain electron density and temperature\nusing forbidden line diagnostics. We compare line intensities from shock models\nto observations to look for and constrain shocks.\n  Results. We derive a new kinematical distance of 5.6 kpc to the source. The\ndetection of ro-vibrational H2 and sub-mm HCO+ emission in 2016 and 2019,\nrespectively, indicate active shock interactions within the circumstellar\nenvironment. The velocity profiles of both H2 and HCO+, as well as the moment-1\nmaps of sub-mm CO and 29-SiO, indicate a bipolar structure that may be\nasymmetric. The sub-mm and optical molecular emission exhibits temperatures of\n35-113 and 200 K, respectively, whilst the atomic gas is much hotter, with\ntemperatures of 5-15 kK, which may be due to shock heating.\n  Conclusions. The detection of a bipolar structure in V1309 Sco indicates\nfurther similarities with the structure of another Galactic red nova, V4332\nSgr. It provides evidence that bipolar structures may be common in red novae.\nAll collected data are consistent with V1309 Sco being a kinematically and\nchemically complex system.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:52:45 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:02:14 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Steinmetz","T.",""],["Kami\u0144ski","T.",""],["Schmidt","M.",""],["Kiljan","A.",""]]}
{"id":"2308.14589","submitter":"Daniel Larsson","authors":"Daniel Larsson","title":"Kummer-Witt-Jackson algebras","comments":"Comments and corrections are welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA math.AG math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with the construction of a small, but non-trivial,\nexample of a polynomial identity algebra, which we call the \\emph{Jackson\nalgebra}, that will be used in sequels to this paper to study non-commutative\narithmetic geometry. In this paper this algebra is studied from a\nring-theoretic and geometric viewpoint. Among other things it turns out that\nthis algebra is a \"non-commutative family\" of central simple algebras and thus\nparametrises Brauer classes over extensions of the base.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:53:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Larsson","Daniel",""]]}
{"id":"2308.14590","submitter":"Gregory J. Herczeg","authors":"Gregory J. Herczeg, Yuguang Chen, Jean-Francois Donati, Andrea K.\n  Dupree, Frederick M. Walter, Lynne A. Hillenbrand, Christopher M.\n  Johns-Krull, Carlo F. Manara, Hans Moritz Guenther, Min Fang, P. Christian\n  Schneider, Jeff A. Valenti, Silvia H.P. Alencar, Laura Venuti, Juan Manuel\n  Alcala, Antonio Frasca, Nicole Arulanantham, Jeffrey L. Linsky, Jerome\n  Bouvier, Nancy S. Brickhouse, Nuria Calvet, Catherine C. Espaillat, Justyn\n  Campbell-White, John M. Carpenter, Seok-Jun Chang, Kelle L. Cruz, S.E. Dahm,\n  Jochen Eisloeffel, Suzan Edwards, William J. Fischer, Zhen Guo, Thomas\n  Henning, Tao Ji, Jesse Jose, Joel H. Kastner, Ralf Launhardt, David A.\n  Principe, Conner E. Robinson, Javier Serna, Michal Siwak, Michael F. Sterzik,\n  Shinsuke Takasao","title":"Twenty-Five Years of Accretion onto the Classical T Tauri Star TW Hya","comments":"Accepted by ApJ. 31 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Accretion plays a central role in the physics that governs the evolution and\ndispersal of protoplanetary disks. The primary goal of this paper is to analyze\nthe stability over time of the mass accretion rate onto TW Hya, the nearest\naccreting solar-mass young star. We measure veiling across the optical spectrum\nin 1169 archival high-resolution spectra of TW Hya, obtained from 1998--2022.\nThe veiling is then converted to accretion rate using 26 flux-calibrated\nspectra that cover the Balmer jump. The accretion rate measured from the excess\ncontinuum has an average of $2.51\\times10^{-9}$~M$_\\odot$~yr$^{-1}$ and a\nGaussian distribution with a FWHM of 0.22 dex. This accretion rate may be\nunderestimated by a factor of up to 1.5 because of uncertainty in the\nbolometric correction and another factor of 1.7 because of excluding the\nfraction of accretion energy that escapes in lines, especially Ly$\\alpha$. The\naccretion luminosities are well correlated with He line luminosities but poorly\ncorrelated with H$\\alpha$ and H$\\beta$ luminosity. The accretion rate is always\nflickering over hours but on longer timescales has been stable over 25 years.\nThis level of variability is consistent with previous measurements for most,\nbut not all, accreting young stars.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:54:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Herczeg","Gregory J.",""],["Chen","Yuguang",""],["Donati","Jean-Francois",""],["Dupree","Andrea K.",""],["Walter","Frederick M.",""],["Hillenbrand","Lynne A.",""],["Johns-Krull","Christopher M.",""],["Manara","Carlo F.",""],["Guenther","Hans Moritz",""],["Fang","Min",""],["Schneider","P. Christian",""],["Valenti","Jeff A.",""],["Alencar","Silvia H. P.",""],["Venuti","Laura",""],["Alcala","Juan Manuel",""],["Frasca","Antonio",""],["Arulanantham","Nicole",""],["Linsky","Jeffrey L.",""],["Bouvier","Jerome",""],["Brickhouse","Nancy S.",""],["Calvet","Nuria",""],["Espaillat","Catherine C.",""],["Campbell-White","Justyn",""],["Carpenter","John M.",""],["Chang","Seok-Jun",""],["Cruz","Kelle L.",""],["Dahm","S. E.",""],["Eisloeffel","Jochen",""],["Edwards","Suzan",""],["Fischer","William J.",""],["Guo","Zhen",""],["Henning","Thomas",""],["Ji","Tao",""],["Jose","Jesse",""],["Kastner","Joel H.",""],["Launhardt","Ralf",""],["Principe","David A.",""],["Robinson","Conner E.",""],["Serna","Javier",""],["Siwak","Michal",""],["Sterzik","Michael F.",""],["Takasao","Shinsuke",""]]}
{"id":"2308.14591","submitter":"Kevin Kramer","authors":"Kevin Kramer","title":"Towards Evolution Capabilities in Data Pipelines","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Evolutionary change over time in the context of data pipelines is certain,\nespecially with regard to the structure and semantics of data as well as to the\npipeline operators. Dealing with these changes, i.e. providing long-term\nmaintenance, is costly. The present work explores the need for evolution\ncapabilities within pipeline frameworks. In this context dealing with evolution\nis defined as a two-step process consisting of self-awareness and\nself-adaption. Furthermore, a conceptual requirements model is provided, which\nencompasses criteria for self-awareness and self-adaption as well as covering\nthe dimensions data, operator, pipeline and environment. A lack of said\ncapabilities in existing frameworks exposes a major gap. Filling this gap will\nbe a significant contribution for practitioners and scientists alike. The\npresent work envisions and lays the foundation for a framework which can handle\nevolutionary change.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:56:05 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kramer","Kevin",""]]}
{"id":"2308.14592","submitter":"Sergei Urazhdin","authors":"Sergei Urazhdin","title":"Anomalous Zeeman effect in SrTiO3 and its possible all-electric\n  detection","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that the interplay between spin-orbit coupling and cubic symmetry\nbreaking in SrTiO3 results in a highly anisotropic Zeeman effect, which can be\nmeasured via electrically-driven, electrically-detected spin resonance enabled\nby the momentum dependence of spin-orbit coupling effects that become\nparticularly effective if the inversion symmetry is broken. The proposed\neffects are expected to provide a unique insight into the roles of spin-orbit\ninteraction and symmetry breaking in SrTiO3 and its heterostructures.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:59:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Urazhdin","Sergei",""]]}
{"id":"2308.14593","submitter":"Kopo Marvin Ramokapane","authors":"Kopo M. Ramokapane, Anthony C. Mazeli, Awais Rashid","title":"Skip, Skip, Skip, Accept!!!: A Study on the Usability of Smartphone\n  Manufacturer Provided Default Features and User Privacy","comments":"19 pages, 3 figures, Proceedings on Privacy Enhancing Technologies\n  (PoPETS)","journal-ref":null,"doi":"10.2478/popets-2019-0027","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Smartphone manufacturer provided default features (e.g., default location\nservices, iCloud, Google Assistant, ad tracking) enhance the usability and\nextend the functionality of these devices. Prior studies have highlighted\nsmartphone vulnerabilities and how users' data can be harvested without their\nknowledge. However, little is known about manufacturer provided default\nfeatures in this regard -- their usability concerning configuring them during\nusage, and how users perceive them with regards to privacy. To bridge this gap,\nwe conducted a task-based study with 27 Android and iOS smartphone users in\norder to learn about their perceptions, concerns and practices, and to\nunderstand the usability of these features with regards to privacy. We explored\nthe following: users' awareness of these features, why and when do they change\nthe settings of these features, the challenges they face while configuring\nthese features, and finally the mitigation strategies they adopt. Our findings\nreveal that users of both platforms have limited awareness of these features\nand their privacy implications. Awareness of these features does not imply that\na user can easily locate and adjust them when needed.\n  Furthermore, users attribute their failure to configure default features to\nhidden controls and insufficient knowledge on how to configure them. To cope\nwith difficulties of finding controls, users employ various coping strategies,\nsome of which are platform specific but most often applicable to both\nplatforms. However, some of these coping strategies leave users vulnerable.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:00:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ramokapane","Kopo M.",""],["Mazeli","Anthony C.",""],["Rashid","Awais",""]]}
{"id":"2308.14594","submitter":"Julian Bollig","authors":"Simone Biondini, Julian Bollig and Stefan Vogl","title":"Indirect detection of dark matter with (pseudo)-scalar interactions","comments":"42 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Indirect detection is one of the most powerful methods to search for\nannihilating dark matter. In this work, we investigate the impact of\nnon-perturbative effects in the indirect detection of dark matter. For this\npurpose we utilize a minimal model consisting of a fermionic dark matter\ncandidate in the TeV mass range that interacts via scalar- and pseudo-scalar\ninteractions with a massive scalar mediator mixing with the Higgs. The scalar\ninteraction induces an attractive Yukawa potential between dark matter\nparticles, such that annihilations are Sommerfeld enhanced, and bound states\ncan form. These non-perturbative effects are systematically dealt with\n(potential) non-relativistic effective field theories and we derive the\nrelevant cross sections for dark matter. We discuss their impact on the relic\ndensity and indirect detection. Annihilations in dwarf galaxies and the\nGalactic Center require special care and we derive generalized $J$-factors for\nthese objects that account for the non-trivial velocity dependence of the cross\nsections in our model. We use limits on the gamma-ray flux based on Fermi-LAT\nobservations and limits on the rate of exotic energy injection from Planck to\nderive bounds on the parameter space of the model. Finally, we estimate the\nimpact that future limits from the Cherenkov Telescope Array are expected to\nhave on the model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:02:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Biondini","Simone",""],["Bollig","Julian",""],["Vogl","Stefan",""]]}
{"id":"2308.14595","submitter":"YeongHyeon Park","authors":"YeongHyeon Park, Sungho Kang, Myung Jin Kim, Hyeonho Jeong, Hyunkyu\n  Park, Hyeong Seok Kim, Juneho Yi","title":"Neural Network Training Strategy to Enhance Anomaly Detection\n  Performance: A Perspective on Reconstruction Loss Amplification","comments":"5 pages, 4 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised anomaly detection (UAD) is a widely adopted approach in industry\ndue to rare anomaly occurrences and data imbalance. A desirable characteristic\nof an UAD model is contained generalization ability which excels in the\nreconstruction of seen normal patterns but struggles with unseen anomalies.\nRecent studies have pursued to contain the generalization capability of their\nUAD models in reconstruction from different perspectives, such as design of\nneural network (NN) structure and training strategy. In contrast, we note that\ncontaining of generalization ability in reconstruction can also be obtained\nsimply from steep-shaped loss landscape. Motivated by this, we propose a loss\nlandscape sharpening method by amplifying the reconstruction loss, dubbed Loss\nAMPlification (LAMP). LAMP deforms the loss landscape into a steep shape so the\nreconstruction error on unseen anomalies becomes greater. Accordingly, the\nanomaly detection performance is improved without any change of the NN\narchitecture. Our findings suggest that LAMP can be easily applied to any\nreconstruction error metrics in UAD settings where the reconstruction model is\ntrained with anomaly-free samples only.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:06:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Park","YeongHyeon",""],["Kang","Sungho",""],["Kim","Myung Jin",""],["Jeong","Hyeonho",""],["Park","Hyunkyu",""],["Kim","Hyeong Seok",""],["Yi","Juneho",""]]}
{"id":"2308.14596","submitter":"Ran Liu","authors":"Ran Liu, Sahil Khose, Jingyun Xiao, Lakshmi Sathidevi, Keerthan\n  Ramnath, Zsolt Kira, Eva L. Dyer","title":"LatentDR: Improving Model Generalization Through Sample-Aware Latent\n  Degradation and Restoration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite significant advances in deep learning, models often struggle to\ngeneralize well to new, unseen domains, especially when training data is\nlimited. To address this challenge, we propose a novel approach for\ndistribution-aware latent augmentation that leverages the relationships across\nsamples to guide the augmentation procedure. Our approach first degrades the\nsamples stochastically in the latent space, mapping them to augmented labels,\nand then restores the samples from their corrupted versions during training.\nThis process confuses the classifier in the degradation step and restores the\noverall class distribution of the original samples, promoting diverse\nintra-class/cross-domain variability. We extensively evaluate our approach on a\ndiverse set of datasets and tasks, including domain generalization benchmarks\nand medical imaging datasets with strong domain shift, where we show our\napproach achieves significant improvements over existing methods for latent\nspace augmentation. We further show that our method can be flexibly adapted to\nlong-tail recognition tasks, demonstrating its versatility in building more\ngeneralizable models. Code is available at\nhttps://github.com/nerdslab/LatentDR.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:08:42 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Ran",""],["Khose","Sahil",""],["Xiao","Jingyun",""],["Sathidevi","Lakshmi",""],["Ramnath","Keerthan",""],["Kira","Zsolt",""],["Dyer","Eva L.",""]]}
{"id":"2308.14597","submitter":"Nathan Inkawhich","authors":"Nathan Inkawhich, Gwendolyn McDonald, Ryan Luley","title":"Adversarial Attacks on Foundational Vision Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Rapid progress is being made in developing large, pretrained, task-agnostic\nfoundational vision models such as CLIP, ALIGN, DINOv2, etc. In fact, we are\napproaching the point where these models do not have to be finetuned\ndownstream, and can simply be used in zero-shot or with a lightweight probing\nhead. Critically, given the complexity of working at this scale, there is a\nbottleneck where relatively few organizations in the world are executing the\ntraining then sharing the models on centralized platforms such as HuggingFace\nand torch.hub. The goal of this work is to identify several key adversarial\nvulnerabilities of these models in an effort to make future designs more\nrobust. Intuitively, our attacks manipulate deep feature representations to\nfool an out-of-distribution (OOD) detector which will be required when using\nthese open-world-aware models to solve closed-set downstream tasks. Our methods\nreliably make in-distribution (ID) images (w.r.t. a downstream task) be\npredicted as OOD and vice versa while existing in extremely\nlow-knowledge-assumption threat models. We show our attacks to be potent in\nwhitebox and blackbox settings, as well as when transferred across foundational\nmodel types (e.g., attack DINOv2 with CLIP)! This work is only just the\nbeginning of a long journey towards adversarially robust foundational vision\nmodels.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:09:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Inkawhich","Nathan",""],["McDonald","Gwendolyn",""],["Luley","Ryan",""]]}
{"id":"2308.14598","submitter":"Emanuele Santellani","authors":"Emanuele Santellani, Christian Sormann, Mattia Rossi, Andreas Kuhn,\n  Friedrich Fraundorfer","title":"S-TREK: Sequential Translation and Rotation Equivariant Keypoints for\n  local feature extraction","comments":"Accepted at ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work we introduce S-TREK, a novel local feature extractor that\ncombines a deep keypoint detector, which is both translation and rotation\nequivariant by design, with a lightweight deep descriptor extractor. We train\nthe S-TREK keypoint detector within a framework inspired by reinforcement\nlearning, where we leverage a sequential procedure to maximize a reward\ndirectly related to keypoint repeatability. Our descriptor network is trained\nfollowing a \"detect, then describe\" approach, where the descriptor loss is\nevaluated only at those locations where keypoints have been selected by the\nalready trained detector. Extensive experiments on multiple benchmarks confirm\nthe effectiveness of our proposed method, with S-TREK often outperforming other\nstate-of-the-art methods in terms of repeatability and quality of the recovered\nposes, especially when dealing with in-plane rotations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:09:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Santellani","Emanuele",""],["Sormann","Christian",""],["Rossi","Mattia",""],["Kuhn","Andreas",""],["Fraundorfer","Friedrich",""]]}
{"id":"2308.14599","submitter":"Pacherie Eliot","authors":"Hichem Hajaiej, Eliot Pacherie and Linjie Song","title":"On the Number of Normalized Ground State Solutions for a class of\n  Elliptic Equations with general nonlinearities and potentials","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We provide a precise description of the set of normalized ground state\nsolutions (NGSS) for the class of elliptic equations:\n  $$\n  -\\Delta u - \\lambda u + V (| x |) u - f (| x |, u) = 0,\\quad\\text{in}\\quad\n\\mathbb{R}^n,\\ n\\geq 1.\n  $$\n  In particular, we show that under suitable assumptions on $V$ and $f$, the\nNGSS is unique for all the masses except for at most a finite number. Moreover,\nwe prove that when unique, the NGSS $u_c$ is a smooth function of the mass $c.$\nOur method is as follow: using the NGSS for a given mass $c$, we construct an\nexhaustive list of potential candidates to the minimization problem for masses\nclose to $c$, and we develop a strategy how to pick the right one. In\nparticular, if there is a unique NGSS for a given mass $c_0,$ then this\nuniqueness property is inherited for all the masses $c$ close to $c_0.$ Our\nmethod is general and applies to other equations provided that some key\nproperties hold true.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:09:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hajaiej","Hichem",""],["Pacherie","Eliot",""],["Song","Linjie",""]]}
{"id":"2308.14600","submitter":"Yanan Ye","authors":"Yanan Ye","title":"Derivative estimates of pluriclosed flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a derivative estimate for the pluriclosed flow, controlling higher\norder derivatives of Chern curvature and torsion using the Chern curvature. And\nin the Hermitian-symplectic case, we derive a torsion estimate in dimension 2\nand find a monotonic quantity along the flow.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:11:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ye","Yanan",""]]}
{"id":"2308.14601","submitter":"Rebecca Salganik","authors":"Rebecca Salganik, Fernando Diaz, Golnoosh Farnadi","title":"Fairness Through Domain Awareness: Mitigating Popularity Bias For Music\n  Discovery","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.IR cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As online music platforms grow, music recommender systems play a vital role\nin helping users navigate and discover content within their vast musical\ndatabases. At odds with this larger goal, is the presence of popularity bias,\nwhich causes algorithmic systems to favor mainstream content over, potentially\nmore relevant, but niche items. In this work we explore the intrinsic\nrelationship between music discovery and popularity bias. To mitigate this\nissue we propose a domain-aware, individual fairness-based approach which\naddresses popularity bias in graph neural network (GNNs) based recommender\nsystems. Our approach uses individual fairness to reflect a ground truth\nlistening experience, i.e., if two songs sound similar, this similarity should\nbe reflected in their representations. In doing so, we facilitate meaningful\nmusic discovery that is robust to popularity bias and grounded in the music\ndomain. We apply our BOOST methodology to two discovery based tasks, performing\nrecommendations at both the playlist level and user level. Then, we ground our\nevaluation in the cold start setting, showing that our approach outperforms\nexisting fairness benchmarks in both performance and recommendation of\nlesser-known content. Finally, our analysis explains why our proposed\nmethodology is a novel and promising approach to mitigating popularity bias and\nimproving the discovery of new and niche content in music recommender systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:12:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Salganik","Rebecca",""],["Diaz","Fernando",""],["Farnadi","Golnoosh",""]]}
{"id":"2308.14602","submitter":"Min Hua","authors":"Min Hua, Bin Shuai, Quan Zhou, Jinhai Wang, Yinglong He, Hongming Xu","title":"Recent Progress in Energy Management of Connected Hybrid Electric\n  Vehicles Using Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.LG cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growing adoption of hybrid electric vehicles (HEVs) presents a\ntransformative opportunity for revolutionizing transportation energy systems.\nThe shift towards electrifying transportation aims to curb environmental\nconcerns related to fossil fuel consumption. This necessitates efficient energy\nmanagement systems (EMS) to optimize energy efficiency. The evolution of EMS\nfrom HEVs to connected hybrid electric vehicles (CHEVs) represent a pivotal\nshift. For HEVs, EMS now confronts the intricate energy cooperation\nrequirements of CHEVs, necessitating advanced algorithms for route\noptimization, charging coordination, and load distribution. Challenges persist\nin both domains, including optimal energy utilization for HEVs, and cooperative\neco-driving control (CED) for CHEVs across diverse vehicle types. Reinforcement\nlearning (RL) stands out as a promising tool for addressing these challenges at\nhand. Specifically, within the realm of CHEVs, the application of multi-agent\nreinforcement learning (MARL) emerges as a powerful approach for effectively\ntackling the intricacies of CED control. Despite extensive research, few\nreviews span from individual vehicles to multi-vehicle scenarios. This review\nbridges the gap, highlighting challenges, advancements, and potential\ncontributions of RL-based solutions for future sustainable transportation\nsystems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:12:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hua","Min",""],["Shuai","Bin",""],["Zhou","Quan",""],["Wang","Jinhai",""],["He","Yinglong",""],["Xu","Hongming",""]]}
{"id":"2308.14603","submitter":"Shuang Zhang","authors":"Fuxin Guan, Xiangdong Guo, Shu Zhang, Kebo Zeng, Yue Hu, Chenchen Wu,\n  Shaobo Zhou, Yuanjiang Xiang, Xiaoxia Yang, Qing Dai, Shuang Zhang","title":"Recovering lossless propagation of polaritons with synthesized complex\n  frequency excitation","comments":"19 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Surface plasmon polaritons and phonon polaritons offer a means of surpassing\nthe diffraction limit of conventional optics and facilitate efficient energy\nstorage, local field enhancement, high sensitivities, benefitting from their\nsubwavelength confinement of light. Unfortunately, losses severely limit the\npropagation decay length, thus restricting the practical use of polaritons.\nWhile optimizing the fabrication technique can help circumvent the scattering\nloss of imperfect structures, the intrinsic absorption channel leading to heat\nproduction cannot be eliminated. Here, we utilize synthetic optical excitation\nof complex frequency with virtual gain, synthesized by combining the\nmeasurements taken at multiple real frequencies, to restore the lossless\npropagations of phonon polaritons with significantly reduced intrinsic losses.\nThe concept of synthetic complex frequency excitation represents a viable\nsolution to compensate for loss and would benefit applications including\nphotonic circuits, waveguiding and plasmonic/phononic structured illumination\nmicroscopy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:16:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guan","Fuxin",""],["Guo","Xiangdong",""],["Zhang","Shu",""],["Zeng","Kebo",""],["Hu","Yue",""],["Wu","Chenchen",""],["Zhou","Shaobo",""],["Xiang","Yuanjiang",""],["Yang","Xiaoxia",""],["Dai","Qing",""],["Zhang","Shuang",""]]}
{"id":"2308.14604","submitter":"Zelin Peng","authors":"Zelin Peng, Zhengqin Xu, Zhilin Zeng, Xiaokang Yang, Wei Shen","title":"SAM-PARSER: Fine-tuning SAM Efficiently by Parameter Space\n  Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Segment Anything Model (SAM) has received remarkable attention as it offers a\npowerful and versatile solution for object segmentation in images. However,\nfine-tuning SAM for downstream segmentation tasks under different scenarios\nremains a challenge, as the varied characteristics of different scenarios\nnaturally requires diverse model parameter spaces. Most existing fine-tuning\nmethods attempt to bridge the gaps among different scenarios by introducing a\nset of new parameters to modify SAM's original parameter space. Unlike these\nworks, in this paper, we propose fine-tuning SAM efficiently by parameter space\nreconstruction (SAM-PARSER), which introduce nearly zero trainable parameters\nduring fine-tuning. In SAM-PARSER, we assume that SAM's original parameter\nspace is relatively complete, so that its bases are able to reconstruct the\nparameter space of a new scenario. We obtain the bases by matrix decomposition,\nand fine-tuning the coefficients to reconstruct the parameter space tailored to\nthe new scenario by an optimal linear combination of the bases. Experimental\nresults show that SAM-PARSER exhibits superior segmentation performance across\nvarious scenarios, while reducing the number of trainable parameters by\n$\\approx 290$ times compared with current parameter-efficient fine-tuning\nmethods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:17:16 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 03:07:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Peng","Zelin",""],["Xu","Zhengqin",""],["Zeng","Zhilin",""],["Yang","Xiaokang",""],["Shen","Wei",""]]}
{"id":"2308.14605","submitter":"Brad Larson","authors":"Brad Larson, Bishal Upadhyaya, Luke McDermott, Siddha Ganju","title":"A Generalization of Continuous Relaxation in Structured Pruning","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning harnesses massive parallel floating-point processing to train\nand evaluate large neural networks. Trends indicate that deeper and larger\nneural networks with an increasing number of parameters achieve higher accuracy\nthan smaller neural networks. This performance improvement, which often\nrequires heavy compute for both training and evaluation, eventually needs to\ntranslate well to resource-constrained hardware for practical value. Structured\npruning asserts that while large networks enable us to find solutions to\ncomplex computer vision problems, a smaller, computationally efficient\nsub-network can be derived from the large neural network that retains model\naccuracy but significantly improves computational efficiency.\n  We generalize structured pruning with algorithms for network augmentation,\npruning, sub-network collapse and removal. In addition, we demonstrate\nefficient and stable convergence up to 93% sparsity and 95% FLOPs reduction\nwithout loss of inference accuracy using with continuous relaxation matching or\nexceeding the state of the art for all structured pruning methods. The\nresulting CNN executes efficiently on GPU hardware without computationally\nexpensive sparse matrix operations. We achieve this with routine automatable\noperations on classification and segmentation problems using CIFAR-10,\nImageNet, and CityScapes datasets with the ResNet and U-NET network\narchitectures.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:19:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Larson","Brad",""],["Upadhyaya","Bishal",""],["McDermott","Luke",""],["Ganju","Siddha",""]]}
{"id":"2308.14606","submitter":"Haoxiang Ye","authors":"Haoxiang Ye, Heng Zhu, and Qing Ling","title":"On the Tradeoff between Privacy Preservation and Byzantine-Robustness in\n  Decentralized Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper jointly considers privacy preservation and Byzantine-robustness in\ndecentralized learning. In a decentralized network, honest-but-curious agents\nfaithfully follow the prescribed algorithm, but expect to infer their\nneighbors' private data from messages received during the learning process,\nwhile dishonest-and-Byzantine agents disobey the prescribed algorithm, and\ndeliberately disseminate wrong messages to their neighbors so as to bias the\nlearning process. For this novel setting, we investigate a generic\nprivacy-preserving and Byzantine-robust decentralized stochastic gradient\ndescent (SGD) framework, in which Gaussian noise is injected to preserve\nprivacy and robust aggregation rules are adopted to counteract Byzantine\nattacks. We analyze its learning error and privacy guarantee, discovering an\nessential tradeoff between privacy preservation and Byzantine-robustness in\ndecentralized learning -- the learning error caused by defending against\nByzantine attacks is exacerbated by the Gaussian noise added to preserve\nprivacy. Numerical experiments are conducted and corroborate our theoretical\nfindings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:20:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ye","Haoxiang",""],["Zhu","Heng",""],["Ling","Qing",""]]}
{"id":"2308.14607","submitter":"Lee Jaehee","authors":"Hansohl Cho, Jaehee Lee, Jehoon Moon, Elmar P\\\"oselt, Pieter J. in 't\n  Veld, Gregory C. Rutledge, Mary C. Boyce","title":"Large strain micromechanics of thermoplastic elastomers with random\n  microstructures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Thermoplastic polyurethanes (TPU) are block copolymeric materials composed of\nplastomeric \"hard\" and elastomeric \"soft\" domains, by which they exhibit highly\nresilient yet dissipative large deformation features depending on volume\nfractions and microstructures of the two distinct domains. Here, we develop a\nnew methodology to address the microscopic deformation mechanisms in TPU\nmaterials with highly disordered microstructures. We propose new\nmicromechanical models for randomly dispersed (or occluded) as well as randomly\ncontinuous hard domains, each within a continuous soft structure as widely\nfound in representative TPU materials over a wide range of volume fractions,\nv$_{\\mathrm{hard}}$ = 26.9% to 52.2%. The micromechanical modeling results are\ncompared to experimental data on the macroscopic large strain behaviors\nreported previously (Cho et al. 2017). We explore the role of the dispersed vs.\ncontinuous nature of the geometric features of the random microstructures on\nshape recovery and energy dissipation at the microstructural level in this\nimportant class of phase-separated copolymeric materials.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:21:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cho","Hansohl",""],["Lee","Jaehee",""],["Moon","Jehoon",""],["P\u00f6selt","Elmar",""],["Veld","Pieter J. in 't",""],["Rutledge","Gregory C.",""],["Boyce","Mary C.",""]]}
{"id":"2308.14608","submitter":"Vahid Ghafouri","authors":"Vahid Ghafouri, Vibhor Agarwal, Yong Zhang, Nishanth Sastry, Jose\n  Such, Guillermo Suarez-Tangil","title":"AI in the Gray: Exploring Moderation Policies in Dialogic Large Language\n  Models vs. Human Answers in Controversial Topics","comments":null,"journal-ref":null,"doi":"10.1145/3583780.3614777","report-no":null,"categories":"cs.LG cs.CL cs.CY cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The introduction of ChatGPT and the subsequent improvement of Large Language\nModels (LLMs) have prompted more and more individuals to turn to the use of\nChatBots, both for information and assistance with decision-making. However,\nthe information the user is after is often not formulated by these ChatBots\nobjectively enough to be provided with a definite, globally accepted answer.\n  Controversial topics, such as \"religion\", \"gender identity\", \"freedom of\nspeech\", and \"equality\", among others, can be a source of conflict as partisan\nor biased answers can reinforce preconceived notions or promote disinformation.\nBy exposing ChatGPT to such debatable questions, we aim to understand its level\nof awareness and if existing models are subject to socio-political and/or\neconomic biases. We also aim to explore how AI-generated answers compare to\nhuman ones. For exploring this, we use a dataset of a social media platform\ncreated for the purpose of debating human-generated claims on polemic subjects\namong users, dubbed Kialo.\n  Our results show that while previous versions of ChatGPT have had important\nissues with controversial topics, more recent versions of ChatGPT\n(gpt-3.5-turbo) are no longer manifesting significant explicit biases in\nseveral knowledge areas. In particular, it is well-moderated regarding economic\naspects. However, it still maintains degrees of implicit libertarian leaning\ntoward right-winged ideals which suggest the need for increased moderation from\nthe socio-political point of view. In terms of domain knowledge on\ncontroversial topics, with the exception of the \"Philosophical\" category,\nChatGPT is performing well in keeping up with the collective human level of\nknowledge. Finally, we see that sources of Bing AI have slightly more tendency\nto the center when compared to human answers. All the analyses we make are\ngeneralizable to other types of biases and domains.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:23:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghafouri","Vahid",""],["Agarwal","Vibhor",""],["Zhang","Yong",""],["Sastry","Nishanth",""],["Such","Jose",""],["Suarez-Tangil","Guillermo",""]]}
{"id":"2308.14609","submitter":"Zhuqing Li","authors":"Zhuqing Li and Roberto Guglielmi","title":"Strict Dissipativity and turnpike for LQ Optimal Control Problems with\n  Possibly Boundary Reference","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we investigate the turnpike property for constrained LQ optimal\ncontrol problem in connection with dissipativity of the control system. We\ndetermine sufficient conditions to ensure the turnpike property in the case of\na turnpike reference possibly occurring on the boundary of the state constraint\nset.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:23:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Li","Zhuqing",""],["Guglielmi","Roberto",""]]}
{"id":"2308.14610","submitter":"Ruoqi Wang","authors":"Ruoqi Wang, Qiong Luo, Feng Wang","title":"A Transformer-Conditioned Neural Fields Pipeline with Polar Coordinate\n  Representation for Astronomical Radio Interferometric Data Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In radio astronomy, visibility data, which are measurements of wave signals\nfrom radio telescopes, are transformed into images for observation of distant\ncelestial objects. However, these resultant images usually contain both real\nsources and artifacts, due to signal sparsity and other factors. One way to\nobtain cleaner images is to reconstruct samples into dense forms before\nimaging. Unfortunately, existing visibility reconstruction methods may miss\nsome components of the frequency data, so blurred object edges and persistent\nartifacts remain in the images. Furthermore, the computation overhead is high\non irregular visibility samples due to the data skew. To address these\nproblems, we propose PolarRec, a reconstruction method for interferometric\nvisibility data, which consists of a transformer-conditioned neural fields\npipeline with a polar coordinate representation. This representation matches\nthe way in which telescopes observe a celestial area as the Earth rotates. We\nfurther propose Radial Frequency Loss function, using radial coordinates in the\npolar coordinate system to correlate with the frequency information, to help\nreconstruct complete visibility. We also group visibility sample points by\nangular coordinates in the polar coordinate system, and use groups as the\ngranularity for subsequent encoding with a Transformer encoder. Consequently,\nour method can capture the inherent characteristics of visibility data\neffectively and efficiently. Our experiments demonstrate that PolarRec markedly\nimproves imaging results by faithfully reconstructing all frequency components\nin the visibility domain while significantly reducing the computation cost.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:26:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Ruoqi",""],["Luo","Qiong",""],["Wang","Feng",""]]}
{"id":"2308.14611","submitter":"Cagdas Tuna","authors":"Cagdas Tuna, Altan Akat, H. Nazim Bicer, Andreas Walther, Emanu\\\"el A.\n  P. Habets","title":"Data-driven 3D Room Geometry Inference with a Linear Loudspeaker Array\n  and a Single Microphone","comments":"Accepted for publication in Forum Acusticum 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Knowing the room geometry may be very beneficial for many audio applications,\nincluding sound reproduction, acoustic scene analysis, and sound source\nlocalization. Room geometry inference (RGI) deals with the problem of reflector\nlocalization (RL) based on a set of room impulse responses (RIRs). Motivated by\nthe increasing popularity of commercially available soundbars, this article\npresents a data-driven 3D RGI method using RIRs measured from a linear\nloudspeaker array to a single microphone. A convolutional recurrent neural\nnetwork (CRNN) is trained using simulated RIRs in a supervised fashion for RL.\nThe Radon transform, which is equivalent to delay-and-sum beamforming, is\napplied to multi-channel RIRs, and the resulting time-domain acoustic\nbeamforming map is fed into the CRNN. The room geometry is inferred from the\nmicrophone position and the reflector locations estimated by the network. The\nresults obtained using measured RIRs show that the proposed data-driven\napproach generalizes well to unseen RIRs and achieves an accuracy level\ncomparable to a baseline model-driven RGI method that involves intermediate\nsemi-supervised steps, thereby offering a unified and fully automated RGI\nframework.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:28:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tuna","Cagdas",""],["Akat","Altan",""],["Bicer","H. Nazim",""],["Walther","Andreas",""],["Habets","Emanu\u00ebl A. P.",""]]}
{"id":"2308.14612","submitter":"Huixia Luo","authors":"Lingyong Zeng, Xunwu Hu, Mebrouka Boubeche, Kuan Li, Longfu Li, Peifei\n  Yu, Kangwang Wang, Chao Zhang, Kui Jin, DaoXin Yao, Huixia Luo","title":"Extremely strong coupling s-wave superconductivity in the medium-entropy\n  alloy TiHfNbTa","comments":"21 pages, 6 figures","journal-ref":"Sci. China-Phys. Mech. Astron.2023,66(7),277412","doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Here we report a TiHfNbTa bulk medium-entropy alloy (MEA) superconductor\ncrystallized in the body-centered cubic structure, which is synthesized by an\narc melting method. Superconducting properties of the TiHfNbTa are studied by\nemploying magnetic susceptibility, resistivity, and specific heat measurements.\nExperimental results show a bulk superconducting transition temperature (Tc) of\naround 6.75 K. The lower and upper crit-ical fields for TiHfNbTa are 45.8 mT\nand 10.46 T, respectively. First-principles calculations show that the d\nelectron of Ti, Hf, Nb, and Ta is the main contribution near the Fermi level.\nOur results indicate that the superconductivity is a conven-tional s-wave type\nwith extremely strong coupling. The extremely strong coupling behavior in the\ns-wave type TiHfNbTa MEA superconductor is unusual because it generally happens\nin cuprates, pnictides, and other unconventional superconductors.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:28:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zeng","Lingyong",""],["Hu","Xunwu",""],["Boubeche","Mebrouka",""],["Li","Kuan",""],["Li","Longfu",""],["Yu","Peifei",""],["Wang","Kangwang",""],["Zhang","Chao",""],["Jin","Kui",""],["Yao","DaoXin",""],["Luo","Huixia",""]]}
{"id":"2308.14613","submitter":"Jianhao Li","authors":"Bingying Yue, Jianhao Li, Hao Shi, Yupei Wang, Honghu Zhong","title":"MS-Net: A Multi-modal Self-supervised Network for Fine-Grained\n  Classification of Aircraft in SAR Images","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Synthetic aperture radar (SAR) imaging technology is commonly used to provide\n24-hour all-weather earth observation. However, it still has some drawbacks in\nSAR target classification, especially in fine-grained classification of\naircraft: aircrafts in SAR images have large intra-class diversity and\ninter-class similarity; the number of effective samples is insufficient and\nit's hard to annotate. To address these issues, this article proposes a novel\nmulti-modal self-supervised network (MS-Net) for fine-grained classification of\naircraft. Firstly, in order to entirely exploit the potential of multi-modal\ninformation, a two-sided path feature extraction network (TSFE-N) is\nconstructed to enhance the image feature of the target and obtain the domain\nknowledge feature of text mode. Secondly, a contrastive self-supervised\nlearning (CSSL) framework is employed to effectively learn useful\nlabel-independent feature from unbalanced data, a similarity per-ception loss\n(SPloss) is proposed to avoid network overfitting. Finally, TSFE-N is used as\nthe encoder of CSSL to obtain the classification results. Through a large\nnumber of experiments, our MS-Net can effectively reduce the difficulty of\nclassifying similar types of aircrafts. In the case of no label, the proposed\nalgorithm achieves an accuracy of 88.46% for 17 types of air-craft\nclassification task, which has pioneering significance in the field of\nfine-grained classification of aircraft in SAR images.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:28:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yue","Bingying",""],["Li","Jianhao",""],["Shi","Hao",""],["Wang","Yupei",""],["Zhong","Honghu",""]]}
{"id":"2308.14614","submitter":"Gideon Lee","authors":"Gideon Lee, Tony Jin, Yu-Xin Wang, Alexander McDonald, Aashish Clerk","title":"Entanglement phase transition due to reciprocity breaking without\n  measurement or post-selection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Despite its fully unitary dynamics, the bosonic Kitaev chain (BKC) displays\nkey hallmarks of non-Hermitian physics including non-reciprocal transport and\nthe non-Hermitian skin effect. Here we demonstrate another remarkable\nphenomena: the existence of an entanglement phase transition (EPT) in a variant\nof the BKC that occurs as a function of a Hamiltonian parameter g, and which\ncoincides with a transition from a reciprocal to a non-reciprocal phase. As g\nis reduced below a critical value, the post-quench entanglement entropy of a\nsubsystem of size l goes from a volume-law phase where it scales as l to a\nsuper-volume law phase where it scales like lN with N the total system size.\nThis EPT occurs for a system undergoing purely unitary evolution and does not\ninvolve measurements, post-selection, disorder or dissipation. We derive\nanalytically the entanglement entropy out of and at the critical point for the\n$l=1$ and $l/N \\ll 1$ case.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:28:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Gideon",""],["Jin","Tony",""],["Wang","Yu-Xin",""],["McDonald","Alexander",""],["Clerk","Aashish",""]]}
{"id":"2308.14615","submitter":"Martina Monti","authors":"Martina Monti","title":"Automorphisms and quotients of Calabi-Yau threefolds of type $A$","comments":"33 pages, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the Calabi-Yau $3$-folds $X = A/G$ where $A$ is an Abelian\n$3$-fold and $G \\le Aut(A)$ is finite group which acts freely on $A$. We give a\ncomplete classification of the automorphisms groups $\\Upsilon$ of $X$, we\nconstruct and classify the quotients $X/\\Upsilon$. In particular, for those\ngroups $\\Upsilon$ which preserves the volume form of $X$ we prove that each\n$X/\\Upsilon$ admits a desingularization $Y$ which is a Calabi-Yau $3$-fold: we\ncompute the Hodge numbers and the fundamental group of these $Y$, so we\ndetermine all topological inequivalent Calabi-Yau $3$-folds obtained in this\nway.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:34:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Monti","Martina",""]]}
{"id":"2308.14616","submitter":"Nissim Maruani","authors":"Nissim Maruani, Roman Klokov, Maks Ovsjanikov, Pierre Alliez, Mathieu\n  Desbrun","title":"VoroMesh: Learning Watertight Surface Meshes with Voronoi Diagrams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In stark contrast to the case of images, finding a concise, learnable\ndiscrete representation of 3D surfaces remains a challenge. In particular,\nwhile polygon meshes are arguably the most common surface representation used\nin geometry processing, their irregular and combinatorial structure often make\nthem unsuitable for learning-based applications. In this work, we present\nVoroMesh, a novel and differentiable Voronoi-based representation of watertight\n3D shape surfaces. From a set of 3D points (called generators) and their\nassociated occupancy, we define our boundary representation through the Voronoi\ndiagram of the generators as the subset of Voronoi faces whose two associated\n(equidistant) generators are of opposite occupancy: the resulting polygon mesh\nforms a watertight approximation of the target shape's boundary. To learn the\nposition of the generators, we propose a novel loss function, dubbed VoroLoss,\nthat minimizes the distance from ground truth surface samples to the closest\nfaces of the Voronoi diagram which does not require an explicit construction of\nthe entire Voronoi diagram. A direct optimization of the Voroloss to obtain\ngenerators on the Thingi32 dataset demonstrates the geometric efficiency of our\nrepresentation compared to axiomatic meshing algorithms and recent\nlearning-based mesh representations. We further use VoroMesh in a\nlearning-based mesh prediction task from input SDF grids on the ABC dataset,\nand show comparable performance to state-of-the-art methods while guaranteeing\nclosed output surfaces free of self-intersections.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:35:58 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Maruani","Nissim",""],["Klokov","Roman",""],["Ovsjanikov","Maks",""],["Alliez","Pierre",""],["Desbrun","Mathieu",""]]}
{"id":"2308.14617","submitter":"Valerie Restat","authors":"Valerie Restat","title":"Towards \"all-inclusive\" Data Preparation to ensure Data Quality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Data preparation, especially data cleaning, is very important to ensure data\nquality and to improve the output of automated decision systems. Since there is\nno single tool that covers all steps required, a combination of tools -- namely\na data preparation pipeline -- is required. Such process comes with a number of\nchallenges. We outline the challenges and describe the different tasks we want\nto analyze in our future research to address these. A test data generator which\nwe implemented to constitute the basis for our future work will also be\nintroduced in detail.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:38:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Restat","Valerie",""]]}
{"id":"2308.14618","submitter":"Pierre-Fran\\c{c}ois Loos Dr","authors":"F\\'abris Kossoski and Pierre-Fran\\c{c}ois Loos","title":"Seniority and Hierarchy Configuration Interaction for Radicals and\n  Excited States","comments":"16 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mtrl-sci nucl-th physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hierarchy configuration interaction (hCI) has been recently introduced as an\nalternative configuration interaction (CI) route combining excitation degree\nand seniority number, which showed to efficiently recover both dynamic and\nstatic correlations for closed-shell molecular systems\n[\\href{https://doi.org/10.1021/acs.jpclett.2c00730}{\\textit{J.~Phys.~Chem.~Lett.}~\\textbf{2022},\n\\textit{13}, 4342}]. Here, we generalize hCI for an arbitrary reference\ndeterminant, allowing calculations for radicals and for excited states in a\nstate-specific way. We gauge this route against excitation-based CI (eCI) and\nseniority-based CI (sCI) by evaluating how different ground-state properties of\nradicals converge to the full CI limit. We find that hCI outperforms or matches\neCI, whereas sCI is far less accurate, in line with previous observations for\nclosed-shell molecules. Employing the second-order Epstein-Nesbet perturbation\ntheory as a correction significantly accelerates the convergence of hCI and\neCI. We further explore various hCI and sCI models to calculate excitation\nenergies of closed- and open-shell systems. Our results underline that both the\nchoice of the reference determinant and the set of orbitals drive the fine\nbalance between correlation of ground and excited states. State-specific hCI2\nand higher order models perform similarly to their eCI counterparts, whereas\nlower orders of hCI deliver poor results. In turn, sCI1 produces decent\nexcitation energies for radicals, encouraging the development of related\nseniority-based coupled cluster methods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:42:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kossoski","F\u00e1bris",""],["Loos","Pierre-Fran\u00e7ois",""]]}
{"id":"2308.14619","submitter":"Cristiano Saltori","authors":"Cristiano Saltori and Fabio Galasso and Giuseppe Fiameni and Nicu Sebe\n  and Fabio Poiesi and Elisa Ricci","title":"Compositional Semantic Mix for Domain Adaptation in Point Cloud\n  Segmentation","comments":"TPAMI. arXiv admin note: text overlap with arXiv:2207.09778","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep-learning models for 3D point cloud semantic segmentation exhibit limited\ngeneralization capabilities when trained and tested on data captured with\ndifferent sensors or in varying environments due to domain shift. Domain\nadaptation methods can be employed to mitigate this domain shift, for instance,\nby simulating sensor noise, developing domain-agnostic generators, or training\npoint cloud completion networks. Often, these methods are tailored for range\nview maps or necessitate multi-modal input. In contrast, domain adaptation in\nthe image domain can be executed through sample mixing, which emphasizes input\ndata manipulation rather than employing distinct adaptation modules. In this\nstudy, we introduce compositional semantic mixing for point cloud domain\nadaptation, representing the first unsupervised domain adaptation technique for\npoint cloud segmentation based on semantic and geometric sample mixing. We\npresent a two-branch symmetric network architecture capable of concurrently\nprocessing point clouds from a source domain (e.g. synthetic) and point clouds\nfrom a target domain (e.g. real-world). Each branch operates within one domain\nby integrating selected data fragments from the other domain and utilizing\nsemantic information derived from source labels and target (pseudo) labels.\nAdditionally, our method can leverage a limited number of human point-level\nannotations (semi-supervised) to further enhance performance. We assess our\napproach in both synthetic-to-real and real-to-real scenarios using LiDAR\ndatasets and demonstrate that it significantly outperforms state-of-the-art\nmethods in both unsupervised and semi-supervised settings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:43:36 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 09:16:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Saltori","Cristiano",""],["Galasso","Fabio",""],["Fiameni","Giuseppe",""],["Sebe","Nicu",""],["Poiesi","Fabio",""],["Ricci","Elisa",""]]}
{"id":"2308.14620","submitter":"Armin Schikorra","authors":"Katarzyna Mazowiecka, Armin Schikorra","title":"s-stability for W^{s,n/s}-harmonic maps in homotopy groups","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.AT math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study $s$-dependence for minimizing $W^{s,n/s}$-harmonic maps $u\\colon\n\\mathbb{S}^n \\to \\mathbb{S}^\\ell$ in homotopy classes. Sacks--Uhlenbeck theory\nshows that, for each $s$, minimizers exist in a generating subset of\n$\\pi_{n}(\\S^\\ell)$. We show that this generating subset can be chosen locally\nconstant in $s$. We also show that as $s$ varies the minimal $W^{s,n/s}$-energy\nin each homotopy class changes continuously. In particular, we provide progress\nto a question raised by Mironescu and Brezis--Mironescu.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:43:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mazowiecka","Katarzyna",""],["Schikorra","Armin",""]]}
{"id":"2308.14621","submitter":"Vishikh Athavale","authors":"Vishikh Athavale, Xuezhi Bian, Zhen Tao, Yanze Wu, Tian Qiu, Jonathan\n  Rawlinson, Robert G. Littlejohn, Joseph E. Subotnik","title":"Surface Hopping, Electron Translation Factors, Electron Rotation\n  Factors, Momentum Conservation, and Size Consistency","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For a system without spin-orbit coupling, the (i) nuclear plus electronic\nlinear momentum and (ii) nuclear plus orbital electronic angular momentum are\ngood quantum numbers. Thus, when a molecular system undergoes a nonadiabatic\ntransition, there should be no change in the total linear or angular momentum.\nNow, the standard surface hopping algorithm ignores the electronic momentum and\nindirectly equates the momentum of the nuclear degrees of freedom to the total\nmomentum. However, even with this simplification, the algorithm still does not\nconserve either the nuclear linear or the nuclear angular momenta. Here, we\nshow that one way to address these failures is to dress the derivative\ncouplings (i.e. the hopping directions) in two ways: (i) we disallow changes in\nthe nuclear linear momentum by working in a translating basis (which is well\nknown and leads to electron translation factors [ETFs]); and (ii) we disallow\nchanges in the nuclear angular momentum by working in a basis that rotates\naround the center of mass (which is not well-known and leads to a novel,\nrotationally removable component of the derivative coupling that we will call\nelectron rotation factors [ERFs] below, cf. Eq. 96). The present findings\nshould be helpful in the short term as far as interpreting surface hopping\ncalculations for singlet systems (without spin) and then developing new surface\nhopping algorithm in the long term for systems where one cannot ignore the\nelectronic orbital and/or spin angular momentum.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:44:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Athavale","Vishikh",""],["Bian","Xuezhi",""],["Tao","Zhen",""],["Wu","Yanze",""],["Qiu","Tian",""],["Rawlinson","Jonathan",""],["Littlejohn","Robert G.",""],["Subotnik","Joseph E.",""]]}
{"id":"2308.14622","submitter":"Kaustav Bhattacharjee","authors":"Jun Yuan, Kaustav Bhattacharjee, Akm Zahirul Islam and Aritra Dasgupta","title":"TRIVEA: Transparent Ranking Interpretation using Visual Explanation of\n  Black-Box Algorithmic Rankers","comments":"Accepted for publication in SpringerNature's Visual Computer Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ranking schemes drive many real-world decisions, like, where to study, whom\nto hire, what to buy, etc. Many of these decisions often come with high\nconsequences. For example, a university can be deemed less prestigious if not\nfeatured in a top-k list, and consumers might not even explore products that do\nnot get recommended to buyers. At the heart of most of these decisions are\nopaque ranking schemes, which dictate the ordering of data entities, but their\ninternal logic is inaccessible or proprietary. Drawing inferences about the\nranking differences is like a guessing game to the stakeholders, like, the\nrankees (i.e., the entities who are ranked, like product companies) and the\ndecision-makers (i.e., who use the rankings, like buyers). In this paper, we\naim to enable transparency in ranking interpretation by using algorithmic\nrankers that learn from available data and by enabling human reasoning about\nthe learned ranking differences using explainable AI (XAI) methods. To realize\nthis aim, we leverage the exploration-explanation paradigm of human-data\ninteraction to let human stakeholders explore subsets and groupings of complex\nmulti-attribute ranking data using visual explanations of model fit and\nattribute influence on rankings. We realize this explanation paradigm for\ntransparent ranking interpretation in TRIVEA, a visual analytic system that is\nfueled by: i) visualizations of model fit derived from algorithmic rankers that\nlearn the associations between attributes and rankings from available data and\nii) visual explanations derived from XAI methods that help abstract important\npatterns, like, the relative influence of attributes in different ranking\nranges. Using TRIVEA, end users not trained in data science have the agency to\ntransparently reason about the global and local behavior of the rankings\nwithout the need to open black-box ranking models and develop confidence in the\nresulting attribute-based inferences. We demonstrate the efficacy of TRIVEA\nusing multiple usage scenarios and subjective feedback from researchers with\ndiverse domain expertise. Keywords: Visual Analytics, Learning-to-Rank,\nExplainable ML, Ranking\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:58:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yuan","Jun",""],["Bhattacharjee","Kaustav",""],["Islam","Akm Zahirul",""],["Dasgupta","Aritra",""]]}
{"id":"2308.14623","submitter":"Tomasz Nowak","authors":"Tomasz Nowak, Micha{\\l} Staniewski, Mieszko Grodzicki, Bartosz\n  Smolarczyk","title":"Accelerating package expansion in Rust through development of a semantic\n  versioning tool","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.PL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many programming languages there exist countless nuances, making\ndevelopers accidentally release new versions of their packages that are not\nbackwards-compatible. Such releases can directly impact projects which are\nusing their packages, causing bugs or even compilation errors when using the\nlatest version. One of the affected languages is Rust, which also lacks\n(itself) a built-in mechanism for enforcing semantic versioning.\n  The aim of this thesis is to describe the development of a tool for Rust\nprogrammers to reduce the chances of publishing a new version of the code that\nviolates semantic versioning.\n  There are already on-going plans to bundle this tool into the language's\nstandard development toolchain. It would make it commonly used and therefore\nhelp users to safely get bug fixes, security patches and new functionality,\nwithout worrying about their app being broken by a dependency change.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:47:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nowak","Tomasz",""],["Staniewski","Micha\u0142",""],["Grodzicki","Mieszko",""],["Smolarczyk","Bartosz",""]]}
{"id":"2308.14624","submitter":"Thiago Filipe Da Silva","authors":"Thiago da Silva and Maico Ribeiro","title":"Universally injective and integral contractions on relative Lipschitz\n  saturation of algebras","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this work, we obtain contraction results for a class of diagrams of ring\nmorphisms which strictly includes the ones obtained by Lipman. Further, we\npresent some applications on quotient and in the changing of the base ring in\nthe saturation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:48:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["da Silva","Thiago",""],["Ribeiro","Maico",""]]}
{"id":"2308.14625","submitter":"Christina Meschede","authors":"Christina Meschede, Katharina Hees, Roland Fried","title":"Temporal clustering of extreme events in sequences of dependent\n  observations separated by heavy-tailed waiting times","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The occurrence of extreme events like heavy precipitation or storms at a\ncertain location often shows a clustering behaviour and is thus not described\nwell by a Poisson process. We construct a general model for the\ninter-exceedance times in between such events which combines different\ncandidate models for such behaviour. This allows us to distinguish data\ngenerating mechanisms leading to clusters of dependent events with exponential\ninter-exceedance times in between clusters from independent events with\nheavy-tailed inter-exceedance times, and even allows us to combine these two\nmechanisms for better descriptions of such occurrences. We investigate a\nmodification of the Cram\\'er-von Mises distance for the purpose of model\nfitting. An application to mid-latitude winter cyclones illustrates the\nusefulness of our work.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:48:48 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Meschede","Christina",""],["Hees","Katharina",""],["Fried","Roland",""]]}
{"id":"2308.14626","submitter":"Mumu Aktar","authors":"Mumu Aktar, Hassan Rivaz, Marta Kersten-Oertel, Yiming Xiao","title":"VesselShot: Few-shot learning for cerebral blood vessel segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Angiography is widely used to detect, diagnose, and treat cerebrovascular\ndiseases. While numerous techniques have been proposed to segment the vascular\nnetwork from different imaging modalities, deep learning (DL) has emerged as a\npromising approach. However, existing DL methods often depend on proprietary\ndatasets and extensive manual annotation. Moreover, the availability of\npre-trained networks specifically for medical domains and 3D volumes is\nlimited. To overcome these challenges, we propose a few-shot learning approach\ncalled VesselShot for cerebrovascular segmentation. VesselShot leverages\nknowledge from a few annotated support images and mitigates the scarcity of\nlabeled data and the need for extensive annotation in cerebral blood vessel\nsegmentation. We evaluated the performance of VesselShot using the publicly\navailable TubeTK dataset for the segmentation task, achieving a mean Dice\ncoefficient (DC) of 0.62(0.03).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:48:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Aktar","Mumu",""],["Rivaz","Hassan",""],["Kersten-Oertel","Marta",""],["Xiao","Yiming",""]]}
{"id":"2308.14627","submitter":"Francesco Taurone","authors":"Francesco Taurone, Daniel Lucani, Qi Zhang","title":"Zip to Zip-it: Compression to Achieve Local Differential Privacy","comments":null,"journal-ref":"2023 IEEE Global Communications Conference: Selected Areas in\n  Communications: Cloud/edge Computing, Networking, and Data Storage\n  (Globecom2023 SAC CLOUD)","doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Local differential privacy techniques for numerical data typically transform\na dataset to ensure a bound on the likelihood that, given a query, a malicious\nuser could infer information on the original samples. Queries are often solely\nbased on users and their requirements, limiting the design of the perturbation\nto processes that, while privatizing the results, do not jeopardize their\nusefulness. In this paper, we propose a privatization technique called Zeal,\nwhere perturbator and aggregator are designed as a unit, resulting in a locally\ndifferentially private mechanism that, by-design, improves the compressibility\nof the perturbed dataset compared to the original, saves on transmitted bits\nfor data collection and protects against a privacy vulnerabilities due to\nfloating point arithmetic that affect other state-of-the-art schemes. We prove\nthat the utility error on querying the average is invariant to the bias\nintroduced by Zeal in a wide range of conditions, and that under the same\ncircumstances, Zeal also guarantee protection against the aforementioned\nvulnerability. Our numerical results show up to 94% improvements in compression\nand up to 95% more efficient data transmissions, while keeping utility errors\nwithin 2%.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:51:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Taurone","Francesco",""],["Lucani","Daniel",""],["Zhang","Qi",""]]}
{"id":"2308.14628","submitter":"Julian Wack","authors":"Roger Horsley (1), Brian Pendleton (1), Julian Wack (1) ((1)\n  University of Edinburgh)","title":"Hybrid Monte Carlo Simulation with Fourier Acceleration of the $N=2$\n  Principal Chiral Model in two Dimensions","comments":"7 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Motivated by the similarity to QCD, specifically the property of asymptotic\nfreedom, we simulate the dynamics of the SU(2) $\\times$ SU(2) model in two\ndimensions using the Hybrid Monte Carlo algorithm. By introducing Fourier\nAcceleration, we show that critical slowing down is largely avoided and\nincreases the simulation efficiency by up to a factor of 300. This yields\nnumerical predictions at a precision exceeding that of existing studies and\nallows us to verify the onset of asymptotic scaling.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:52:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Horsley","Roger",""],["Pendleton","Brian",""],["Wack","Julian",""]]}
{"id":"2308.14629","submitter":"Hyun Min Lee","authors":"Seong-Sik Kim, Hyun Min Lee, Kimiko Yamashita","title":"Positivity Bounds on Higgs-Portal Freeze-in Dark Matter","comments":"17 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO hep-th","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We consider the relic density and positivity bounds for freeze-in scalar dark\nmatter with general Higgs-portal interactions up to dimension-8 operators. When\ndimension-4 and dimension-6 Higgs-portal interactions are proportional to mass\nsquares for Higgs or scalar dark matter in certain microscopic models such as\nmassive graviton, radion or general metric couplings with conformal and\ndisconformal modes, we can take the dimension-8 derivative Higgs-portal\ninteractions to be dominant for determining the relic density via the 2-to-2\nthermal scattering of the Higgs fields after reheating. We show that there is a\nwide parameter space for explaining the correct relic density from the\nfreeze-in mechanism and the positivity bounds can curb out the dimension-8\nderivative Higgs-portal interactions nontrivially in the presence of the\nsimilar dimension-8 self-interactions for Higgs and dark matter.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:52:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kim","Seong-Sik",""],["Lee","Hyun Min",""],["Yamashita","Kimiko",""]]}
{"id":"2308.14630","submitter":"H\\'el\\`ene Gu\\'erin","authors":"H\\'el\\`ene Gu\\'erin and Lucile Laulin and Kilian Raschel","title":"A fixed-point equation approach for the superdiffusive elephant random\n  walk","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the elephant random walk in arbitrary dimension $d\\geq 1$. Our main\nfocus is the limiting random variable appearing in the superdiffusive regime.\nBuilding on a link between the elephant random walk and P\\'olya-type urn\nmodels, we prove a fixed-point equation (or system in dimension two and larger)\nfor the limiting variable. Based on this, we deduce several properties of the\nlimit distribution, such as the existence of a density with support on $\\mathbb\nR^d$ for $d\\in\\{1,2,3\\}$, and we bring evidence for a similar result for $d\\geq\n4$. We also investigate the moment-generating function of the limit and give,\nin dimension $1$, a non-linear recurrence relation for the moments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:54:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gu\u00e9rin","H\u00e9l\u00e8ne",""],["Laulin","Lucile",""],["Raschel","Kilian",""]]}
{"id":"2308.14631","submitter":"Victor Magron","authors":"Jie Wang and Victor Magron","title":"A real moment-HSOS hierarchy for complex polynomial optimization with\n  real coefficients","comments":"19 pages, 8 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper proposes a real moment-HSOS hierarchy for complex polynomial\noptimization problems with real coefficients. We show that this hierarchy\nprovides the same sequence of lower bounds as the complex analogue, yet is much\ncheaper to solve. In addition, we prove that global optimality is achieved when\nthe ranks of the moment matrix and certain submatrix equal two in case that a\nsphere constraint is present, and as a consequence, the complex polynomial\noptimization problem has either two real optimal solutions or a pair of\nconjugate optimal solutions. A simple procedure for extracting a pair of\nconjugate optimal solutions is given in the latter case. Various numerical\nexamples are presented to demonstrate the efficiency of this new hierarchy, and\nan application to polyphase code design is also provided.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:54:20 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Jie",""],["Magron","Victor",""]]}
{"id":"2308.14632","submitter":"Payman Goodarzi","authors":"Payman Goodarzi, Andreas Sch\\\"utze, Tizian Schneider","title":"Comparing AutoML and Deep Learning Methods for Condition Monitoring\n  using Realistic Validation Scenarios","comments":"This work has been submitted to the IEEE for possible publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study extensively compares conventional machine learning methods and\ndeep learning for condition monitoring tasks using an AutoML toolbox. The\nexperiments reveal consistent high accuracy in random K-fold cross-validation\nscenarios across all tested models. However, when employing leave-one-group-out\n(LOGO) cross-validation on the same datasets, no clear winner emerges,\nindicating the presence of domain shift in real-world scenarios. Additionally,\nthe study assesses the scalability and interpretability of conventional methods\nand neural networks. Conventional methods offer explainability with their\nmodular structure aiding feature identification. In contrast, neural networks\nrequire specialized interpretation techniques like occlusion maps to visualize\nimportant regions in the input data. Finally, the paper highlights the\nsignificance of feature selection, particularly in condition monitoring tasks\nwith limited class variations. Low-complexity models prove sufficient for such\ntasks, as only a few features from the input signal are typically needed. In\nsummary, these findings offer crucial insights into the strengths and\nlimitations of various approaches, providing valuable benchmarks and\nidentifying the most suitable methods for condition monitoring applications,\nthereby enhancing their applicability in real-world scenarios.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:57:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Goodarzi","Payman",""],["Sch\u00fctze","Andreas",""],["Schneider","Tizian",""]]}
{"id":"2308.14633","submitter":"Joakim Hagel","authors":"Joakim Hagel, Samuel Brem, Johannes Abelardo Pineiro, Ermin Malic","title":"Impact of atomic reconstruction on optical spectra of twisted TMD\n  homobilayers","comments":"16 pages, 11 figures, preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Twisted bilayers of transition metal dichalcogenides (TMDs) have revealed a\nrich exciton landscape including hybrid excitons and spatially trapped moir\\'e\nexcitons that dominate the optical response of the material. Recent studies\nhave revealed that in the low-twist-angle regime, the lattice undergoes a\nsignificant relaxation in order to minimize local stacking energies. Here,\nlarge domains of low energy stacking configurations emerge, deforming the\ncrystal lattices via strain and consequently impacting the electronic band\nstructure. However, so far the direct impact of atomic reconstruction on the\nexciton energy landscape and the optical properties has not been well\nunderstood. Here, we apply a microscopic and material-specific approach and\npredict a significant change in the potential depth for moir\\'e excitons in a\nreconstructed lattice, with the most drastic change occurring in TMD\nhomobilayers. We reveal the appearance of multiple flat bands and a significant\nchange in the position of trapping sites compared to the rigid lattice. Most\nimportantly, we predict a multi-peak structure emerging in optical absorption\nof WSe$_2$ homobilayers - in stark contrast to the single peak that dominates\nthe rigid lattice. This finding can be exploited as an unambiguous signature of\natomic reconstruction in optical spectra of moir\\'e excitons in twisted\nhomobilayers.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:58:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hagel","Joakim",""],["Brem","Samuel",""],["Pineiro","Johannes Abelardo",""],["Malic","Ermin",""]]}
{"id":"2308.14634","submitter":"Lefteris Loukas","authors":"Lefteris Loukas, Ilias Stogiannidis, Prodromos Malakasiotis, Stavros\n  Vassos","title":"Breaking the Bank with ChatGPT: Few-Shot Text Classification for Finance","comments":"Early pre-print; Accepted at the 5th FinNLP workshop @ IJCAI-2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG q-fin.CP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We propose the use of conversational GPT models for easy and quick few-shot\ntext classification in the financial domain using the Banking77 dataset. Our\napproach involves in-context learning with GPT-3.5 and GPT-4, which minimizes\nthe technical expertise required and eliminates the need for expensive GPU\ncomputing while yielding quick and accurate results. Additionally, we fine-tune\nother pre-trained, masked language models with SetFit, a recent contrastive\nlearning technique, to achieve state-of-the-art results both in full-data and\nfew-shot settings. Our findings show that querying GPT-3.5 and GPT-4 can\noutperform fine-tuned, non-generative models even with fewer examples. However,\nsubscription fees associated with these solutions may be considered costly for\nsmall organizations. Lastly, we find that generative models perform better on\nthe given task when shown representative samples selected by a human expert\nrather than when shown random ones. We conclude that a) our proposed methods\noffer a practical solution for few-shot tasks in datasets with limited label\navailability, and b) our state-of-the-art results can inspire future work in\nthe area.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:04:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Loukas","Lefteris",""],["Stogiannidis","Ilias",""],["Malakasiotis","Prodromos",""],["Vassos","Stavros",""]]}
{"id":"2308.14635","submitter":"Daniel Chen","authors":"Daniel Chen","title":"Expected Number of Dice Rolls Until an Increasing Run of Three","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A closed form is found for the expected number of rolls of a fair n-sided die\nuntil three consecutive increasing values are seen. The answer is rational, and\nthe greatest common divisor of the numerator and denominator is given in terms\nof n.\n  As n goes to infinity, the probability generating function is found for the\nlimiting case, which is also the exponential generating function for\npermutations ending in a double rise and without other double rises. Thus exact\nvalues are found for the limiting expectation and variance, which are\napproximately 7.92437 and 27.98133 respectively.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:04:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Daniel",""]]}
{"id":"2308.14636","submitter":"Bowen Weng","authors":"Bowen Weng, Guillermo A. Castillo, Yun-Seok Kang, and Ayonga Hereid","title":"Towards Standardized Disturbance Rejection Testing of Legged Robot\n  Locomotion with Linear Impactor: A Preliminary Study, Observations, and\n  Implications","comments":"Related video: https://youtu.be/bUWnnTYNL3A","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamic locomotion in legged robots is close to industrial collaboration, but\na lack of standardized testing obstructs commercialization. The issues are not\nmerely political, theoretical, or algorithmic but also physical, indicating\nlimited studies and comprehension regarding standard testing infrastructure and\nequipment. For decades, the approaches we have been testing legged robots were\nrarely standardizable with hand-pushing, foot-kicking, rope-dragging,\nstick-poking, and ball-swinging. This paper aims to bridge the gap by proposing\nthe use of the linear impactor, a well-established tool in other standardized\ntesting disciplines, to serve as an adaptive, repeatable, and fair disturbance\nrejection testing equipment for legged robots. A pneumatic linear impactor is\nalso adopted for the case study involving the humanoid robot Digit. Three\nlocomotion controllers are examined, including a commercial one, using a\nwalking-in-place task against frontal impacts. The statistically best\ncontroller was able to withstand the impact momentum (26.376 kg$\\cdot$m/s) on\npar with a reported average effective momentum from straight punches by Olympic\nboxers (26.506 kg$\\cdot$m/s). Moreover, the case study highlights other\nanti-intuitive observations, demonstrations, and implications that, to the best\nof the authors' knowledge, are first-of-its-kind revealed in real-world testing\nof legged robots.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:04:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Weng","Bowen",""],["Castillo","Guillermo A.",""],["Kang","Yun-Seok",""],["Hereid","Ayonga",""]]}
{"id":"2308.14637","submitter":"Christoph Studer","authors":"Gangle Sun, Mengyao Cao, Wenjin Wang, Wei Xu, Christoph Studer","title":"Joint Active User Detection, Channel Estimation, and Data Detection for\n  Massive Grant-Free Transmission in Cell-Free Systems","comments":"To be presented at IEEE SPAWC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Cell-free communication has the potential to significantly improve grant-free\ntransmission in massive machine-type communication, wherein multiple access\npoints jointly serve a large number of user equipments to improve coverage and\nspectral efficiency. In this paper, we propose a novel framework for joint\nactive user detection (AUD), channel estimation (CE), and data detection (DD)\nfor massive grant-free transmission in cell-free systems. We formulate an\noptimization problem for joint AUD, CE, and DD by considering both the sparsity\nof the data matrix, which arises from intermittent user activity, and the\nsparsity of the effective channel matrix, which arises from intermittent user\nactivity and large-scale fading. We approximately solve this optimization\nproblem with a box-constrained forward-backward splitting algorithm, which\nsignificantly improves AUD, CE, and DD performance. We demonstrate the\neffectiveness of the proposed framework through simulation experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:07:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sun","Gangle",""],["Cao","Mengyao",""],["Wang","Wenjin",""],["Xu","Wei",""],["Studer","Christoph",""]]}
{"id":"2308.14638","submitter":"Ruoyu Wang","authors":"Ruoyu Wang, Maokui He, Jun Du, Hengshun Zhou, Shutong Niu, Hang Chen,\n  Yanyan Yue, Gaobin Yang, Shilong Wu, Lei Sun, Yanhui Tu, Haitao Tang,\n  Shuangqing Qian, Tian Gao, Mengzhi Wang, Genshun Wan, Jia Pan, Jianqing Gao,\n  Chin-Hui Lee","title":"The USTC-NERCSLIP Systems for the CHiME-7 DASR Challenge","comments":"Accepted by 2023 CHiME Workshop, Oral","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This technical report details our submission system to the CHiME-7 DASR\nChallenge, which focuses on speaker diarization and speech recognition under\ncomplex multi-speaker settings. Additionally, it also evaluates the efficiency\nof systems in handling diverse array devices. To address these issues, we\nimplemented an end-to-end speaker diarization system and introduced a\nrectification strategy based on multi-channel spatial information. This\napproach significantly diminished the word error rates (WER). In terms of\nrecognition, we utilized publicly available pre-trained models as the\nfoundational models to train our end-to-end speech recognition models. Our\nsystem attained a macro-averaged diarization-attributed WER (DA-WER) of 22.4\\%\non the CHiME-7 development set, which signifies a relative improvement of\n52.5\\% over the official baseline system.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:08:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Ruoyu",""],["He","Maokui",""],["Du","Jun",""],["Zhou","Hengshun",""],["Niu","Shutong",""],["Chen","Hang",""],["Yue","Yanyan",""],["Yang","Gaobin",""],["Wu","Shilong",""],["Sun","Lei",""],["Tu","Yanhui",""],["Tang","Haitao",""],["Qian","Shuangqing",""],["Gao","Tian",""],["Wang","Mengzhi",""],["Wan","Genshun",""],["Pan","Jia",""],["Gao","Jianqing",""],["Lee","Chin-Hui",""]]}
{"id":"2308.14639","submitter":"Houda Barkouki","authors":"H. Barkouki, A. H. Bentbib and K. Jbilou","title":"A Rational Krylov Subspace Method for the Computation of the Matrix\n  Exponential Operator","comments":"19 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The computation of approximating e^tA B, where A is a large sparse matrix and\nB is a rectangular matrix, serves as a crucial element in numerous scientific\nand engineering calculations. A powerful way to consider this problem is to use\nKrylov subspace methods. The purpose of this work is to approximate the matrix\nexponential and some Cauchy-Stieltjes functions on a block vectors B of R^n*p\nusing a rational block Lanczos algorithm. We also derive some error estimates\nand error bound for the convergence of the rational approximation and finally\nnumerical results attest to the computational efficiency of the proposed\nmethod.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:09:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barkouki","H.",""],["Bentbib","A. H.",""],["Jbilou","K.",""]]}
{"id":"2308.14640","submitter":"Tatyana Shevchuk","authors":"Tatyana Shevchuk, Ely D. Kovetz, and Adi Zitrin","title":"New Bounds on Fuzzy Dark Matter from Galaxy-Galaxy Strong-Lensing\n  Observations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fuzzy Dark Matter (FDM) has recently gained attention as a motivated\ncandidate for the dark matter (DM) content of the Universe, as opposed to the\ncommonly assumed cold DM (CDM), since the soliton profile intrinsic to FDM\nmodels was found to be particularly well suited to reproduce observed galaxy\nmass profiles. While FDM as a single DM component has been strongly constrained\nby multiple probes, there remained a mass window between\n$10^{-25}\\,\\mathrm{eV}$ and $10^{-24}\\,\\mathrm{eV}$ in which it can comprise a\nlarge portion ($\\gtrsim\\mathcal{O}(10\\%)$) of the total DM. In this work, we\nconsider gravitational lensing measurements in the strong lensing regime, which\nare one of the only means to directly constrain the distribution and profile of\nDM in astronomical bodies. Using a simple model that combines a soliton FDM\ncomponent with a Navarro-Frenk-White (NFW) profile, we explore under what\nconditions DM halos with this hybrid profile are able to reproduce the observed\nEinstein radii of several known lenses. We find that FDM with a particle mass\nof $\\lesssim 10^{-24}\\,{\\rm eV}$ cannot explain the observations if it makes up\nmore than $\\sim10\\%$ of the total DM, effectively closing the lingering FDM\nmass window.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:10:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shevchuk","Tatyana",""],["Kovetz","Ely D.",""],["Zitrin","Adi",""]]}
{"id":"2308.14641","submitter":"Fabian Lechner","authors":"Fabian Lechner and Allison Lahnala and Charles Welch and Lucie Flek","title":"Challenges of GPT-3-based Conversational Agents for Healthcare","comments":"12 pages, 9 Tables, accepted to RANLP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The potential to provide patients with faster information access while\nallowing medical specialists to concentrate on critical tasks makes medical\ndomain dialog agents appealing. However, the integration of large-language\nmodels (LLMs) into these agents presents certain limitations that may result in\nserious consequences. This paper investigates the challenges and risks of using\nGPT-3-based models for medical question-answering (MedQA). We perform several\nevaluations contextualized in terms of standard medical principles. We provide\na procedure for manually designing patient queries to stress-test high-risk\nlimitations of LLMs in MedQA systems. Our analysis reveals that LLMs fail to\nrespond adequately to these queries, generating erroneous medical information,\nunsafe recommendations, and content that may be considered offensive.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:12:34 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 15:48:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lechner","Fabian",""],["Lahnala","Allison",""],["Welch","Charles",""],["Flek","Lucie",""]]}
{"id":"2308.14642","submitter":"Uri Sherman","authors":"Uri Sherman, Alon Cohen, Tomer Koren, Yishay Mansour","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study regret minimization in online episodic linear Markov Decision\nProcesses, and obtain rate-optimal $\\widetilde O (\\sqrt K)$ regret where $K$\ndenotes the number of episodes. Our work is the first to establish the optimal\n(w.r.t.~$K$) rate of convergence in the stochastic setting with bandit feedback\nusing a policy optimization based approach, and the first to establish the\noptimal (w.r.t.~$K$) rate in the adversarial setup with full information\nfeedback, for which no algorithm with an optimal rate guarantee is currently\nknown.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:16:09 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sherman","Uri",""],["Cohen","Alon",""],["Koren","Tomer",""],["Mansour","Yishay",""]]}
{"id":"2308.14643","submitter":"Tom Stace","authors":"Arkady Fedorov, N. Pradeep Kumar, Dat Thanh Le, Rohit Navarathna,\n  Prasanna Pakkiam, Thomas M. Stace","title":"Passive microwave circulation on a superconducting chip","comments":"4 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Building large-scale superconducting quantum circuits will require\nminiaturisation and integration of supporting devices including microwave\ncirculators, which are currently bulky, stand-alone components. Here we report\nthe realisation of a passive on-chip circulator which is made from a loop\nconsisting of three tunnel-coupled superconducting islands, with DC-only\ncontrol fields. We observe the effect of quasiparticle tunnelling, and we\ndynamically classify the system into different quasiparticle sectors. When\ntuned for circulation, the device exhibits strongly non-reciprocal 3-port\nscattering, with average on-resonance insertion loss of 2 dB, isolation of 14\ndB, power reflectance of -11 dB, and a bandwidth of 200 MHz.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:16:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Fedorov","Arkady",""],["Kumar","N. Pradeep",""],["Le","Dat Thanh",""],["Navarathna","Rohit",""],["Pakkiam","Prasanna",""],["Stace","Thomas M.",""]]}
{"id":"2308.14644","submitter":"Celal Savur","authors":"Celal Savur, Jamison Heard, and Ferat Sahin","title":"Human Comfortability Index Estimation in Industrial Human-Robot\n  Collaboration Task","comments":"Submitted to IEEE-THMS","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.HC cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Fluent human-robot collaboration requires a robot teammate to understand,\nlearn, and adapt to the human's psycho-physiological state. Such collaborations\nrequire a computing system that monitors human physiological signals during\nhuman-robot collaboration (HRC) to quantitatively estimate a human's level of\ncomfort, which we have termed in this research as comfortability index (CI) and\nuncomfortability index (unCI). Subjective metrics (surprise, anxiety, boredom,\ncalmness, and comfortability) and physiological signals were collected during a\nhuman-robot collaboration experiment that varied robot behavior. The emotion\ncircumplex model is adapted to calculate the CI from the participant's\nquantitative data as well as physiological data. To estimate CI/unCI from\nphysiological signals, time features were extracted from electrocardiogram\n(ECG), galvanic skin response (GSR), and pupillometry signals. In this\nresearch, we successfully adapt the circumplex model to find the location\n(axis) of 'comfortability' and 'uncomfortability' on the circumplex model, and\nits location match with the closest emotions on the circumplex model. Finally,\nthe study showed that the proposed approach can estimate human\ncomfortability/uncomfortability from physiological signals.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:16:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Savur","Celal",""],["Heard","Jamison",""],["Sahin","Ferat",""]]}
{"id":"2308.14645","submitter":"Mohammadreza Bakhshizadeh Mohajer","authors":"Mohammadreza Bakhshizadeh Mohajer, Sadaf Moaveninejad, Atul Kumar,\n  Mahmoud Elgenedy, Naofal Al-Dhahir, Luca Barletta, Maurizio Magarini","title":"On the Achievable Rate of MIMO Narrowband PLC with Spatio-Temporal\n  Correlated Noise","comments":"13 pages, 10 figures, submitted to IEEE Transactions on\n  Communications","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Narrowband power line communication (NB-PLC) systems are an attractive\nsolution for supporting current and future smart grids. A technology proposed\nto enhance data rate in NB-PLC is multiple-input multiple-output (MIMO)\ntransmission over multiple power line phases. To achieve reliable communication\nover MIMO NB-PLC, a key challenge is to take into account and mitigate the\neffects of temporally and spatially correlated cyclostationary noise. Noise\nsamples in a cycle can be divided into three classes with different\ndistributions, i.e. Gaussian, moderate impulsive, and strong impulsive.\nHowever, in this paper we first show that the impulsive classes in their turn\ncan be divided into sub-classes with normal distributions and, after deriving\nthe theoretical capacity, two noise sample sets with such characteristics are\nused to evaluate achievable information rates: one sample set is the measured\nnoise in laboratory and the other is produced through MIMO frequency-shift\n(FRESH) filtering. The achievable information rates are attained by means of a\nspatio-temporal whitening of the portions of the cyclostationary correlated\nnoise samples that belong to the Gaussian sub-classes. The proposed approach\ncan be useful to design the optimal receiver in terms of bit allocation using\nwaterfilling algorithm and to adapt modulation order.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:16:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mohajer","Mohammadreza Bakhshizadeh",""],["Moaveninejad","Sadaf",""],["Kumar","Atul",""],["Elgenedy","Mahmoud",""],["Al-Dhahir","Naofal",""],["Barletta","Luca",""],["Magarini","Maurizio",""]]}
{"id":"2308.14646","submitter":"Leandro Lessa","authors":"L. A. Lessa, J. E. G. Silva","title":"Einstein-Bumblebee-Dilaton black hole solution","comments":"19 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We obtain new black hole solutions in a Einstein-Bumblebee-scalar theory. By\nstarting with a Einstein-Bumblebee theory in D + d dimensions, the scalar\ndilaton field and its interaction with the gravitational and bumblebee fields\nare obtained by Kaluza-Klein (KK) reduction over the extra dimensions.\nConsidering the effects of both the bumblebee vacuum expectation value (VEV)\nand the fluctuations over the VEV, we obtained new charged solutions in (3 + 1)\ndimensions. For a vanishing dilaton, the black hole turned out to be a charged\nde Sitter-Reissner-Nordstrom solution, where the transverse mode is the Maxwell\nfield and the longitudinal mode is the cosmological constant. The stability of\nthese new solutions is investigated by means of the analysis of the black hole\nthermodynamics. The temperature, entropy and heat capacity show that these\nmodified black holes are thermodynamic stable.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:18:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lessa","L. A.",""],["Silva","J. E. G.",""]]}
{"id":"2308.14647","submitter":"Binqi Sun","authors":"Binqi Sun, Mirco Theile, Ziyuan Qin, Daniele Bernardini, Debayan Roy,\n  Andrea Bastoni, and Marco Caccamo","title":"Edge Generation Scheduling for DAG Tasks using Deep Reinforcement\n  Learning","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC cs.DM math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Directed acyclic graph (DAG) tasks are currently adopted in the real-time\ndomain to model complex applications from the automotive, avionics, and\nindustrial domain that implement their functionalities through chains of\nintercommunicating tasks. This paper studies the problem of scheduling\nreal-time DAG tasks by presenting a novel schedulability test based on the\nconcept of trivial schedulability. Using this schedulability test, we propose a\nnew DAG scheduling framework (edge generation scheduling -- EGS) that attempts\nto minimize the DAG width by iteratively generating edges while guaranteeing\nthe deadline constraint. We study how to efficiently solve the problem of\ngenerating edges by developing a deep reinforcement learning algorithm combined\nwith a graph representation neural network to learn an efficient edge\ngeneration policy for EGS. We evaluate the effectiveness of the proposed\nalgorithm by comparing it with state-of-the-art DAG scheduling heuristics and\nan optimal mixed-integer linear programming baseline. Experimental results show\nthat the proposed algorithm outperforms the state-of-the-art by requiring fewer\nprocessors to schedule the same DAG tasks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:19:18 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Sun","Binqi",""],["Theile","Mirco",""],["Qin","Ziyuan",""],["Bernardini","Daniele",""],["Roy","Debayan",""],["Bastoni","Andrea",""],["Caccamo","Marco",""]]}
{"id":"2308.14648","submitter":"Omid Karimi Dr.","authors":"Seyed Ehsan Hosseini, Omid Karimi, Mohammad Ali AsemanBakhsh","title":"Multi-objective Optimization of Savonius Wind Turbine","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A numerical data set will be developed to assist in the design of Savonius\nwind turbines. The main objective of study is to improve Savonius turbine blade\ndesigns to increase torque coefficients, rotational speeds, and pressure\ncoefficients. Simulating 3D models and validating them with wind tunnel data\nwere part of the experimental design methodology. Multi-objective optimization\nis used to optimize turbine performance. Twist angle, aspect ratio, and overlap\nratio are all important factors in determining the optimal torque and power\ncoefficients. Data-driven objective functions were modeled using the group\nmethod of data handling (GMDH). Using an evolutionary Pareto-based optimization\napproach, polynomial models were used to plot Pareto fronts and TOPSIS to\ncalculate optimal commercial points. The torque coefficient, rotational speed,\nand power coefficient are all improved by 13.74%, 0.071%, and 5.32%,\nrespectively. As a result of the multi-objective optimization of the turbine,\nsome significant characteristics of objective functions were discovered.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:20:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hosseini","Seyed Ehsan",""],["Karimi","Omid",""],["AsemanBakhsh","Mohammad Ali",""]]}
{"id":"2308.14649","submitter":"\\`Alex Miranda-Pascual","authors":"Patricia Guerra-Balboa, \\`Alex Miranda-Pascual, Javier Parra-Arnau,\n  Thorsten Strufe","title":"Composition in Differential Privacy for General Granularity Notions\n  (Long Version)","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The composition theorems of differential privacy (DP) allow data curators to\ncombine different algorithms to obtain a new algorithm that continues to\nsatisfy DP. However, new granularity notions (i.e., neighborhood definitions),\ndata domains, and composition settings have appeared in the literature that the\nclassical composition theorems do not cover. For instance, the parallel\ncomposition theorem does not apply to general granularity notions. This\ncomplicates the opportunity of composing DP mechanisms in new settings and\nobtaining accurate estimates of the incurred privacy loss after composition.\n  To overcome these limitations, we study the composability of DP in a general\nframework and for any kind of data domain or neighborhood definition. We give a\ngeneral composition theorem in both independent and adaptive versions and we\nprovide analogous composition results for approximate, zero-concentrated, and\nGaussian DP. Besides, we study the hypothesis needed to obtain the best\ncomposition bounds. Our theorems cover both parallel and sequential composition\nsettings. Importantly, they also cover every setting in between, allowing us to\ncompute the final privacy loss of a composition with greatly improved accuracy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:21:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Guerra-Balboa","Patricia",""],["Miranda-Pascual","\u00c0lex",""],["Parra-Arnau","Javier",""],["Strufe","Thorsten",""]]}
{"id":"2308.14650","submitter":"Christopher Lee","authors":"Christopher Lee","title":"Comparison of automated crater catalogs for Mars from Benedix et al.\n  (2020) and Lee and Hogan (2021)","comments":"14 pages, 6 figures. Accepted August 13th 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM cs.CV cs.LG","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Crater mapping using neural networks and other automated methods has\nincreased recently with automated Crater Detection Algorithms (CDAs) applied to\nplanetary bodies throughout the solar system. A recent publication by Benedix\net al. (2020) showed high performance at small scales compared to similar\nautomated CDAs but with a net positive diameter bias in many crater candidates.\nI compare the publicly available catalogs from Benedix et al. (2020) and Lee &\nHogan (2021) and show that the reported performance is sensitive to the metrics\nused to test the catalogs. I show how the more permissive comparison methods\nindicate a higher CDA performance by allowing worse candidate craters to match\nground-truth craters. I show that the Benedix et al. (2020) catalog has a\nsubstantial performance loss with increasing latitude and identify an image\nprojection issue that might cause this loss. Finally, I suggest future\napplications of neural networks in generating large scientific datasets be\nvalidated using secondary networks with independent data sources or training\nmethods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:22:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Christopher",""]]}
{"id":"2308.14651","submitter":"David Long","authors":"David M. Long, Lucie M. Green, Francesco Pecora, David H. Brooks,\n  Hanna Strecker, David Orozco-Su\\'arez, Laura A. Hayes, Emma E. Davies, Ute V.\n  Amerstorfer, Marilena Mierla, David Lario, David Berghmans, Andrei N. Zhukov,\n  Hannah T. R\\\"udisser","title":"The eruption of a magnetic flux rope observed by \\textit{Solar Orbiter}\n  and \\textit{Parker Solar Probe}","comments":"19 pages, 11 figures, accepted for publication in The Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Magnetic flux ropes are a key component of coronal mass ejections, forming\nthe core of these eruptive phenomena. However, determining whether a flux rope\nis present prior to eruption onset and, if so, the rope's handedness and the\nnumber of turns that any helical field lines make is difficult without magnetic\nfield modelling or in-situ detection of the flux rope. We present two distinct\nobservations of plasma flows along a filament channel on 4 and 5 September 2022\nmade using the \\textit{Solar Orbiter} spacecraft. Each plasma flow exhibited\nhelical motions in a right-handed sense as the plasma moved from the source\nactive region across the solar disk to the quiet Sun, suggesting that the\nmagnetic configuration of the filament channel contains a flux rope with\npositive chirality and at least one turn. The length and velocity of the plasma\nflow increased from the first to the second observation, suggesting evolution\nof the flux rope, with the flux rope subsequently erupting within $\\sim$5~hours\nof the second plasma flow. The erupting flux rope then passed over the\n\\textit{Parker Solar Probe} spacecraft during its Encounter 13, enabling\n\\textit{in-situ} diagnostics of the structure. Although complex and consistent\nwith the flux rope erupting from underneath the heliospheric current sheet, the\n\\textit{in-situ} measurements support the inference of a right-handed flux rope\nfrom remote-sensing observations. These observations provide a unique insight\ninto the eruption and evolution of a magnetic flux rope near the Sun.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:34:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Long","David M.",""],["Green","Lucie M.",""],["Pecora","Francesco",""],["Brooks","David H.",""],["Strecker","Hanna",""],["Orozco-Su\u00e1rez","David",""],["Hayes","Laura A.",""],["Davies","Emma E.",""],["Amerstorfer","Ute V.",""],["Mierla","Marilena",""],["Lario","David",""],["Berghmans","David",""],["Zhukov","Andrei N.",""],["R\u00fcdisser","Hannah T.",""]]}
{"id":"2308.14652","submitter":"Colin Bellinger","authors":"Colin Bellinger, Laurence Lamarche-Cliche","title":"Learning Visual Tracking and Reaching with Deep Reinforcement Learning\n  on a UR10e Robotic Arm","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As technology progresses, industrial and scientific robots are increasingly\nbeing used in diverse settings. In many cases, however, programming the robot\nto perform such tasks is technically complex and costly. To maximize the\nutility of robots in industrial and scientific settings, they require the\nability to quickly shift from one task to another. Reinforcement learning\nalgorithms provide the potential to enable robots to learn optimal solutions to\ncomplete new tasks without directly reprogramming them. The current\nstate-of-the-art in reinforcement learning, however, generally relies on fast\nsimulations and parallelization to achieve optimal performance. These are often\nnot possible in robotics applications. Thus, a significant amount of research\nis required to facilitate the efficient and safe, training and deployment of\nindustrial and scientific reinforcement learning robots. This technical report\noutlines our initial research into the application of deep reinforcement\nlearning on an industrial UR10e robot. The report describes the reinforcement\nlearning environments created to facilitate policy learning with the UR10e, a\nrobotic arm from Universal Robots, and presents our initial results in training\ndeep Q-learning and proximal policy optimization agents on the developed\nreinforcement learning environments. Our results show that proximal policy\noptimization learns a better, more stable policy with less data than deep\nQ-learning. The corresponding code for this work is available at\n\\url{https://github.com/cbellinger27/bendRL_reacher_tracker}\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:34:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bellinger","Colin",""],["Lamarche-Cliche","Laurence",""]]}
{"id":"2308.14653","submitter":"Guy Blachar","authors":"Guy Blachar, Darrell Haile, Eliyahu Matzri, Edan Rein, Uzi Vishne","title":"Semiassociative algebras over a field","comments":"50 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An associative central simple algebra is a form of matrices, because a\nmaximal \\'{e}tale subalgebra acts on the algebra faithfully by left and right\nmultiplication. In an attempt to extract and isolate the full potential of this\npoint of view, we study nonassociative algebras whose nucleus contains an\n\\'{e}tale subalgebra bi-acting faithfully on the algebra. These algebras,\ntermed semiassociative, are shown to be the forms of skew matrices, which we\nare led to define and investigate. Semiassociative algebras modulo skew\nmatrices compose a Brauer monoid, which contains the Brauer group of the field\nas a unique maximal subgroup.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:35:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Blachar","Guy",""],["Haile","Darrell",""],["Matzri","Eliyahu",""],["Rein","Edan",""],["Vishne","Uzi",""]]}
{"id":"2308.14654","submitter":"Tu Nguyen Anh","authors":"Nguyen Anh Tu, Hoang Thi Thu Uyen, Tu Minh Phuong, Ngo Xuan Bach","title":"Joint Multiple Intent Detection and Slot Filling with Supervised\n  Contrastive Learning and Self-Distillation","comments":"Accepted at ECAI 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multiple intent detection and slot filling are two fundamental and crucial\ntasks in spoken language understanding. Motivated by the fact that the two\ntasks are closely related, joint models that can detect intents and extract\nslots simultaneously are preferred to individual models that perform each task\nindependently. The accuracy of a joint model depends heavily on the ability of\nthe model to transfer information between the two tasks so that the result of\none task can correct the result of the other. In addition, since a joint model\nhas multiple outputs, how to train the model effectively is also challenging.\nIn this paper, we present a method for multiple intent detection and slot\nfilling by addressing these challenges. First, we propose a bidirectional joint\nmodel that explicitly employs intent information to recognize slots and slot\nfeatures to detect intents. Second, we introduce a novel method for training\nthe proposed joint model using supervised contrastive learning and\nself-distillation. Experimental results on two benchmark datasets MixATIS and\nMixSNIPS show that our method outperforms state-of-the-art models in both\ntasks. The results also demonstrate the contributions of both bidirectional\ndesign and the training method to the accuracy improvement. Our source code is\navailable at https://github.com/anhtunguyen98/BiSLU\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:36:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Tu","Nguyen Anh",""],["Uyen","Hoang Thi Thu",""],["Phuong","Tu Minh",""],["Bach","Ngo Xuan",""]]}
{"id":"2308.14655","submitter":"Antonio Galv\\'an-G\\'amez","authors":"Antonio Galv\\'an, Nissim Fraija, Edilberto Aguilar-Ruiz, Jose Antonio\n  de Diego Onsurbe, Maria G. Dainotti","title":"Study of blazars detected by Fermi-LAT as high-energy neutrino sources","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Besides the neutrino source detected by IceCube, NGC 1068, the association of\nthe IceCube-170922A neutrino with the blazar in a flaring state among several\nwavelengths (from radio up to high-energy (HE) gamma-rays), the site and\nmechanisms of production of HE neutrino remains in discussion. Extragalactic\nsources such as Quasars, Blazars, Radio galaxies, and Gamma-ray bursts have\nbeen proposed as progenitors of HE neutrinos. In this work, we study the\nBlazars reported by Fermi-LAT in the 4LAC catalog, which are embedded inside\nthe 90\\% error of the best-fit position from the neutrinos reported by IceCube.\nWe propose a one-zone lepto-hadronic scenario to describe the broadband\nSpectral Energy Distribution and then estimate the number of neutrinos to\ncompare with those in the direction of each source. A brief discussion is\nprovided of the results.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:37:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Galv\u00e1n","Antonio",""],["Fraija","Nissim",""],["Aguilar-Ruiz","Edilberto",""],["Onsurbe","Jose Antonio de Diego",""],["Dainotti","Maria G.",""]]}
{"id":"2308.14656","submitter":"Shunsuke Adachi","authors":"S. Adachi, F. Fujinaka, S. Honda, Y. Muto, H. Nakata, Y. Sueno, T.\n  Sumida, J. Suzuki, O. Tajima, H. Takeuchi","title":"Search for Dark Photon Dark Matter in the Mass Range 41--74\n  $\\mu\\mathrm{eV}$ using Millimeter-Wave Receiver and Radioshielding Box","comments":"8 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Dark photons have been considered potential candidates for dark matter. The\ndark photon dark matter (DPDM) has a mass and interacts with electromagnetic\nfields via kinetic mixing with a coupling constant of $\\chi$. Thus, DPDMs are\nconverted into ordinary photons at metal surfaces. Using a millimeter-wave\nreceiver set in a radioshielding box, we performed experiments to detect the\nconversion photons from the DPDM in the frequency range 10--18 GHz, which\ncorresponds to a mass range 41--74 $\\mu\\mathrm{eV}$. We found no conversion\nphoton signal in this range and set the upper limits to $\\chi <\n(0.5\\text{--}3.9) \\times 10^{-10}$ at a 95% confidence level.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:39:02 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 05:17:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Adachi","S.",""],["Fujinaka","F.",""],["Honda","S.",""],["Muto","Y.",""],["Nakata","H.",""],["Sueno","Y.",""],["Sumida","T.",""],["Suzuki","J.",""],["Tajima","O.",""],["Takeuchi","H.",""]]}
{"id":"2308.14657","submitter":"Ji-Hoon Jeong","authors":"Ji-Hoon Jeong, In-Gyu Lee, Sung-Kyung Kim, Tae-Eui Kam, Seong-Whan\n  Lee, Euijong Lee","title":"DeepHealthNet: Adolescent Obesity Prediction System Based on a Deep\n  Learning Framework","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Childhood and adolescent obesity rates are a global concern because obesity\nis associated with chronic diseases and long-term health risks. Artificial\nintelligence technology has emerged as a promising solution to accurately\npredict obesity rates and provide personalized feedback to adolescents. This\nstudy emphasizes the importance of early identification and prevention of\nobesity-related health issues. Factors such as height, weight, waist\ncircumference, calorie intake, physical activity levels, and other relevant\nhealth information need to be considered for developing robust algorithms for\nobesity rate prediction and delivering personalized feedback. Hence, by\ncollecting health datasets from 321 adolescents, we proposed an adolescent\nobesity prediction system that provides personalized predictions and assists\nindividuals in making informed health decisions. Our proposed deep learning\nframework, DeepHealthNet, effectively trains the model using data augmentation\ntechniques, even when daily health data are limited, resulting in improved\nprediction accuracy (acc: 0.8842). Additionally, the study revealed variations\nin the prediction of the obesity rate between boys (acc: 0.9320) and girls\n(acc: 0.9163), allowing the identification of disparities and the determination\nof the optimal time to provide feedback. The proposed system shows significant\npotential in effectively addressing childhood and adolescent obesity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:40:31 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 01:21:55 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Jeong","Ji-Hoon",""],["Lee","In-Gyu",""],["Kim","Sung-Kyung",""],["Kam","Tae-Eui",""],["Lee","Seong-Whan",""],["Lee","Euijong",""]]}
{"id":"2308.14658","submitter":"Nathaniel Hudson","authors":"Samir Rajani, Dario Dematties, Nathaniel Hudson, Kyle Chard, Nicola\n  Ferrier, Rajesh Sankaran, Peter Beckman","title":"Adversarial Predictions of Data Distributions Across Federated\n  Internet-of-Things Devices","comments":"6 pages, 6 figures, accepted for publication through 2023 IEEE World\n  Forum on Internet of Things","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning (FL) is increasingly becoming the default approach for\ntraining machine learning models across decentralized Internet-of-Things (IoT)\ndevices. A key advantage of FL is that no raw data are communicated across the\nnetwork, providing an immediate layer of privacy. Despite this, recent works\nhave demonstrated that data reconstruction can be done with the locally trained\nmodel updates which are communicated across the network. However, many of these\nworks have limitations with regard to how the gradients are computed in\nbackpropagation. In this work, we demonstrate that the model weights shared in\nFL can expose revealing information about the local data distributions of IoT\ndevices. This leakage could expose sensitive information to malicious actors in\na distributed system. We further discuss results which show that injecting\nnoise into model weights is ineffective at preventing data leakage without\nseriously harming the global model accuracy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:40:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rajani","Samir",""],["Dematties","Dario",""],["Hudson","Nathaniel",""],["Chard","Kyle",""],["Ferrier","Nicola",""],["Sankaran","Rajesh",""],["Beckman","Peter",""]]}
{"id":"2308.14659","submitter":"Hong Yung Yip","authors":"Hong Yung Yip, Chidaksh Ravuru, Neelabha Banerjee, Shashwat Jha, Amit\n  Sheth, Aman Chadha, Amitava Das","title":"RESTORE: Graph Embedding Assessment Through Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Following the success of Word2Vec embeddings, graph embeddings (GEs) have\ngained substantial traction. GEs are commonly generated and evaluated\nextrinsically on downstream applications, but intrinsic evaluations of the\noriginal graph properties in terms of topological structure and semantic\ninformation have been lacking. Understanding these will help identify the\ndeficiency of the various families of GE methods when vectorizing graphs in\nterms of preserving the relevant knowledge or learning incorrect knowledge. To\naddress this, we propose RESTORE, a framework for intrinsic GEs assessment\nthrough graph reconstruction. We show that reconstructing the original graph\nfrom the underlying GEs yields insights into the relative amount of information\npreserved in a given vector form. We first introduce the graph reconstruction\ntask. We generate GEs from three GE families based on factorization methods,\nrandom walks, and deep learning (with representative algorithms from each\nfamily) on the CommonSense Knowledge Graph (CSKG). We analyze their\neffectiveness in preserving the (a) topological structure of node-level graph\nreconstruction with an increasing number of hops and (b) semantic information\non various word semantic and analogy tests. Our evaluations show deep\nlearning-based GE algorithm (SDNE) is overall better at preserving (a) with a\nmean average precision (mAP) of 0.54 and 0.35 for 2 and 3-hop reconstruction\nrespectively, while the factorization-based algorithm (HOPE) is better at\nencapsulating (b) with an average Euclidean distance of 0.14, 0.17, and 0.11\nfor 1, 2, and 3-hop reconstruction respectively. The modest performance of\nthese GEs leaves room for further research avenues on better graph\nrepresentation learning.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:41:30 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yip","Hong Yung",""],["Ravuru","Chidaksh",""],["Banerjee","Neelabha",""],["Jha","Shashwat",""],["Sheth","Amit",""],["Chadha","Aman",""],["Das","Amitava",""]]}
{"id":"2308.14660","submitter":"Camillo De Lellis","authors":"Camillo De Lellis and Matteo Focardi","title":"The regularity theory for the Mumford-Shah functional on the plane","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of these notes is to give a complete self-contained account of the\ncurrent state of the art in the regularity for planar minimizers and critical\npoints of the Mumford-Shah functional.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:41:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["De Lellis","Camillo",""],["Focardi","Matteo",""]]}
{"id":"2308.14661","submitter":"James Rowe","authors":"James Rowe","title":"Noncommutative tensor triangular geometry: classification via noetherian\n  spectra","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.AG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given a monoidal triangulated category $T$ with noetherian spectrum, we show\nthat there is an order preserving bijection between the collection of all\nThomason subsets of the non-commutative spectrum $\\mathrm{Spc}(T)$ and the\ncollection of all thick two-sided semiprime ideals of $T$. This provides an\nalternative to the hypotheses of Nakano, Vashaw and Yakimov, as well as the\nrecent approach via completely prime ideals of Mallick and Ray. By assuming the\nspectrum is noetherian, we show that it is indeed a spectral space, and that it\nis universal among all such spaces classifying the ideals in question.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:44:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Rowe","James",""]]}
{"id":"2308.14662","submitter":"Thomas Weber","authors":"Andrea Sciandra, Thomas Weber","title":"Noncommutative differential geometry on crossed product algebras","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA math.RA math.RT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a differential structure on arbitrary cleft extensions\n$B:=A^{\\mathrm{co}H}\\subseteq A$ for an $H$-comodule algebra $A$. This is\nachieved by constructing a covariant calculus on the corresponding crossed\nproduct algebra $B\\#_\\sigma H$ from the data of a bicovariant calculus on the\nstructure Hopf algebra $H$ and a calculus on the base algebra $B$, which is\ncompatible with the $2$-cocycle and measure of the crossed product. The result\nis a quantum principal bundle with canonical strong connection and we describe\nthe induced bimodule covariant derivatives on associated bundles of the crossed\nproduct. It is proven that connections of the quantum principal bundle are in\nbijection with connection $1$-forms. All results specialize to trivial\nextensions and smash product algebras $B\\#H$ and we give a characterization of\nthe smash product calculus in terms of the differentials of the cleaving map\n$j\\colon H\\to A$ and the inclusion $B\\hookrightarrow A$. The construction is\nexemplified for pointed Hopf algebras. In particular, the case of Radford Hopf\nalgebras $H_{(r,n,q)}$ is spelled out in full detail.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:46:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sciandra","Andrea",""],["Weber","Thomas",""]]}
{"id":"2308.14663","submitter":"Juliane P\\\"a{\\ss}ler","authors":"Juliane P\\\"a{\\ss}ler, Maurice H. ter Beek, Ferruccio Damiani, S.\n  Lizeth Tapia Tarifa and Einar Broch Johnsen","title":"Formal Modelling and Analysis of a Self-Adaptive Robotic System","comments":"To be published in the conference proceedings of iFM 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.RO cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Self-adaptation is a crucial feature of autonomous systems that must cope\nwith uncertainties in, e.g., their environment and their internal state.\nSelf-adaptive systems are often modelled as two-layered systems with a managed\nsubsystem handling the domain concerns and a managing subsystem implementing\nthe adaptation logic. We consider a case study of a self-adaptive robotic\nsystem; more concretely, an autonomous underwater vehicle (AUV) used for\npipeline inspection. In this paper, we model and analyse it with the\nfeature-aware probabilistic model checker ProFeat. The functionalities of the\nAUV are modelled in a feature model, capturing the AUV's variability. This\nallows us to model the managed subsystem of the AUV as a family of systems,\nwhere each family member corresponds to a valid feature configuration of the\nAUV. The managing subsystem of the AUV is modelled as a control layer capable\nof dynamically switching between such valid feature configurations, depending\nboth on environmental and internal conditions. We use this model to analyse\nprobabilistic reward and safety properties for the AUV.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:47:40 GMT"}],"update_date":"2023-08-29","authors_parsed":[["P\u00e4\u00dfler","Juliane",""],["ter Beek","Maurice H.",""],["Damiani","Ferruccio",""],["Tarifa","S. Lizeth Tapia",""],["Johnsen","Einar Broch",""]]}
{"id":"2308.14664","submitter":"Riccardo Della Monica","authors":"Riccardo Della Monica, Ivan de Martino, Tom Broadhurst","title":"Explaining the oblate morphology of dwarf spheroidals with Wave Dark\n  Matter perturbations","comments":"7 pages, 6 figures. Comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate whether the oblate, spheroidal morphology of common dwarf\nspheroidal galaxies (dSph) may result from the slow relaxation of stellar\norbits within a halo of Wave Dark Matter ($\\psi$DM) when starting from an\ninitial disk of stars. Stellar orbits randomly walk over a Hubble time,\nperturbed by the pervasive \"granular\" interference pattern of $\\psi$DM, that\nfully modulates the dark matter density on the de Broglie scale. Our\nsimulations quantify the level of stellar disk thickening over the Hubble time,\nshowing that distribution of stars is predicted to become an oblate spheroid of\nincreasing radius, that plausibly accounts for the morphology of dSph galaxies.\nWe predict a low level of residual rotation remains after a Hubble time at the\n1-3 km/s level, depending on orientation, that compares with recent claims of\nrotation for some well studied local dSph galaxies. This steady internal\ndynamical evolution may be witnessed directly with JWST for well resolved dwarf\ngalaxies, appearing more oblate with look back time and tending to small disks\nof young stars at high redshift.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:51:46 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Della Monica","Riccardo",""],["de Martino","Ivan",""],["Broadhurst","Tom",""]]}
{"id":"2308.14665","submitter":"Jun Yang","authors":"Jun Yang, Jian Yao and Steven L. Waslander","title":"Active Pose Refinement for Textureless Shiny Objects using the\n  Structured Light Camera","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  6D pose estimation of textureless shiny objects has become an essential\nproblem in many robotic applications. Many pose estimators require high-quality\ndepth data, often measured by structured light cameras. However, when objects\nhave shiny surfaces (e.g., metal parts), these cameras fail to sense complete\ndepths from a single viewpoint due to the specular reflection, resulting in a\nsignificant drop in the final pose accuracy. To mitigate this issue, we present\na complete active vision framework for 6D object pose refinement and\nnext-best-view prediction. Specifically, we first develop an optimization-based\npose refinement module for the structured light camera. Our system then selects\nthe next best camera viewpoint to collect depth measurements by minimizing the\npredicted uncertainty of the object pose. Compared to previous approaches, we\nadditionally predict measurement uncertainties of future viewpoints by online\nrendering, which significantly improves the next-best-view prediction\nperformance. We test our approach on the challenging real-world ROBI dataset.\nThe results demonstrate that our pose refinement method outperforms the\ntraditional ICP-based approach when given the same input depth data, and our\nnext-best-view strategy can achieve high object pose accuracy with\nsignificantly fewer viewpoints than the heuristic-based policies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:52:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yang","Jun",""],["Yao","Jian",""],["Waslander","Steven L.",""]]}
{"id":"2308.14666","submitter":"Justice Mason","authors":"Justice Mason, Christine Allen-Blanchette, Nicholas Zolman, Elizabeth\n  Davison, Naomi Ehrich Leonard","title":"Learning to predict 3D rotational dynamics from images of a rigid body\n  with unknown mass distribution","comments":"Previously appeared as arXiv:2209.11355v2, which was submitted as a\n  replacement by accident. arXiv admin note: text overlap with arXiv:2209.11355","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CE cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In many real-world settings, image observations of freely rotating 3D rigid\nbodies, may be available when low-dimensional measurements are not. However,\nthe high-dimensionality of image data precludes the use of classical estimation\ntechniques to learn the dynamics. The usefulness of standard deep learning\nmethods is also limited because an image of a rigid body reveals nothing about\nthe distribution of mass inside the body, which, together with initial angular\nvelocity, is what determines how the body will rotate. We present a\nphysics-informed neural network model to estimate and predict 3D rotational\ndynamics from image sequences. We achieve this using a multi-stage prediction\npipeline that maps individual images to a latent representation homeomorphic to\n$\\mathbf{SO}(3)$, computes angular velocities from latent pairs, and predicts\nfuture latent states using the Hamiltonian equations of motion. We demonstrate\nthe efficacy of our approach on new rotating rigid-body datasets of sequences\nof synthetic images of rotating objects, including cubes, prisms and\nsatellites, with unknown uniform and non-uniform mass distributions.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 17:47:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mason","Justice",""],["Allen-Blanchette","Christine",""],["Zolman","Nicholas",""],["Davison","Elizabeth",""],["Leonard","Naomi Ehrich",""]]}
{"id":"2308.14667","submitter":"Yemin Li","authors":"Yemin li, Zhongcheng Liu, Xiaoying Lou, Mirigual Kurban, Miao Li, Jie\n  Yang, Kaiwei Che, Jiankun Wang, Max Q.-H Meng, Yan Huang, Qin Guo, Pinjin Hu","title":"Neural Network-Based Histologic Remission Prediction In Ulcerative\n  Colitis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  BACKGROUND & AIMS: Histological remission (HR) is advocated and considered as\na new therapeutic target in ulcerative colitis (UC). Diagnosis of histologic\nremission currently relies on biopsy; during this process, patients are at risk\nfor bleeding, infection, and post-biopsy fibrosis. In addition, histologic\nresponse scoring is complex and time-consuming, and there is heterogeneity\namong pathologists. Endocytoscopy (EC) is a novel ultra-high magnification\nendoscopic technique that can provide excellent in vivo assessment of glands.\nBased on the EC technique, we propose a neural network model that can assess\nhistological disease activity in UC using EC images to address the above\nissues. The experiment results demonstrate that the proposed method can assist\npatients in precise treatment and prognostic assessment.\n  METHODS: We construct a neural network model for UC evaluation. A total of\n5105 images of 154 intestinal segments from 87 patients undergoing EC treatment\nat a center in China between March 2022 and March 2023 are scored according to\nthe Geboes score. Subsequently, 103 intestinal segments are used as the\ntraining set, 16 intestinal segments are used as the validation set for neural\nnetwork training, and the remaining 35 intestinal segments are used as the test\nset to measure the model performance together with the validation set.\n  RESULTS: By treating HR as a negative category and histologic activity as a\npositive category, the proposed neural network model can achieve an accuracy of\n0.9, a specificity of 0.95, a sensitivity of 0.75, and an area under the curve\n(AUC) of 0.81.\n  CONCLUSION: We develop a specific neural network model that can distinguish\nhistologic remission/activity in EC images of UC, which helps to accelerate\nclinical histological diagnosis.\n  keywords: ulcerative colitis; Endocytoscopy; Geboes score; neural network.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:54:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["li","Yemin",""],["Liu","Zhongcheng",""],["Lou","Xiaoying",""],["Kurban","Mirigual",""],["Li","Miao",""],["Yang","Jie",""],["Che","Kaiwei",""],["Wang","Jiankun",""],["Meng","Max Q. -H",""],["Huang","Yan",""],["Guo","Qin",""],["Hu","Pinjin",""]]}
{"id":"2308.14668","submitter":"Qin Deng","authors":"Qin Deng and Vitali Kapovitch","title":"Sharp bounds and rigidity for volumes of boundaries of Alexandrov spaces","comments":"28 pages. Comments welcome!","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We obtain sharp volume bounds on the boundaries of Alexandrov spaces with\ngiven lower curvature bound, dimension, and radius. We also completely classify\nthe rigidity case and analyze almost rigidity. Our results are new even for\nsmooth manifolds with boundary.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:54:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Deng","Qin",""],["Kapovitch","Vitali",""]]}
{"id":"2308.14669","submitter":"Abdelrahman Sadallah","authors":"Abdelrahman \"Boda\" Sadallah, Omar Ahmed, Shimaa Mohamed, Omar Hatem,\n  Doaa Hesham, Ahmed H. Yousef","title":"ANER: Arabic and Arabizi Named Entity Recognition using\n  Transformer-Based Approach","comments":null,"journal-ref":null,"doi":"10.1109/IMSA58542.2023.10217635","report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the main tasks of Natural Language Processing (NLP), is Named Entity\nRecognition (NER). It is used in many applications and also can be used as an\nintermediate step for other tasks. We present ANER, a web-based named entity\nrecognizer for the Arabic, and Arabizi languages. The model is built upon BERT,\nwhich is a transformer-based encoder. It can recognize 50 different entity\nclasses, covering various fields. We trained our model on the WikiFANE\\_Gold\ndataset which consists of Wikipedia articles. We achieved an F1 score of\n88.7\\%, which beats CAMeL Tools' F1 score of 83\\% on the ANERcorp dataset,\nwhich has only 4 classes. We also got an F1 score of 77.7\\% on the\nNewsFANE\\_Gold dataset which contains out-of-domain data from News articles.\nThe system is deployed on a user-friendly web interface that accepts users'\ninputs in Arabic, or Arabizi. It allows users to explore the entities in the\ntext by highlighting them. It can also direct users to get information about\nentities through Wikipedia directly. We added the ability to do NER using our\nmodel, or CAMeL Tools' model through our website. ANER is publicly accessible\nat \\url{http://www.aner.online}. We also deployed our model on HuggingFace at\nhttps://huggingface.co/boda/ANER, to allow developers to test and use it.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:54:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sadallah","Abdelrahman \"Boda\"",""],["Ahmed","Omar",""],["Mohamed","Shimaa",""],["Hatem","Omar",""],["Hesham","Doaa",""],["Yousef","Ahmed H.",""]]}
{"id":"2308.14670","submitter":"Colin Kohler","authors":"Colin Kohler, Anuj Shrivatsav Srikanth, Eshan Arora, Robert Platt","title":"Symmetric Models for Visual Force Policy Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While it is generally acknowledged that force feedback is beneficial to\nrobotic control, applications of policy learning to robotic manipulation\ntypically only leverage visual feedback. Recently, symmetric neural models have\nbeen used to significantly improve the sample efficiency and performance of\npolicy learning across a variety of robotic manipulation domains. This paper\nexplores an application of symmetric policy learning to visual-force problems.\nWe present Symmetric Visual Force Learning (SVFL), a novel method for robotic\ncontrol which leverages visual and force feedback. We demonstrate that SVFL can\nsignificantly outperform state of the art baselines for visual force learning\nand report several interesting empirical findings related to the utility of\nlearning force feedback control policies in both general manipulation tasks and\nscenarios with low visual acuity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:55:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kohler","Colin",""],["Srikanth","Anuj Shrivatsav",""],["Arora","Eshan",""],["Platt","Robert",""]]}
{"id":"2308.14671","submitter":"Kevin Lutz","authors":"Kevin C. Lutz, Michael L. Neugent, Tejasv Bedi, Nicole J. De Nisco,\n  Qiwei Li","title":"A generalized Bayesian stochastic block model for microbiome community\n  detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP stat.CO stat.OT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Advances in next-generation sequencing technology have enabled the\nhigh-throughput profiling of metagenomes and accelerated the microbiome study.\nRecently, there has been a rise in quantitative studies that aim to decipher\nthe microbiome co-occurrence network and its underlying community structure\nbased on metagenomic sequence data. Uncovering the complex microbiome community\nstructure is essential to understanding the role of the microbiome in disease\nprogression and susceptibility. Taxonomic abundance data generated from\nmetagenomic sequencing technologies are high-dimensional and compositional,\nsuffering from uneven sampling depth, over-dispersion, and zero-inflation.\nThese characteristics often challenge the reliability of the current methods\nfor microbiome community detection. To this end, we propose a Bayesian\nstochastic block model to study the microbiome co-occurrence network based on\nthe recently developed modified centered-log ratio transformation tailored for\nmicrobiome data analysis. Our model allows us to incorporate taxonomic tree\ninformation using a Markov random field prior. The model parameters are jointly\ninferred by using Markov chain Monte Carlo sampling techniques. Our simulation\nstudy showed that the proposed approach performs better than competing methods\neven when taxonomic tree information is non-informative. We applied our\napproach to a real urinary microbiome dataset from postmenopausal women, the\nfirst time the urinary microbiome co-occurrence network structure has been\nstudied. In summary, this statistical methodology provides a new tool for\nfacilitating advanced microbiome studies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:57:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lutz","Kevin C.",""],["Neugent","Michael L.",""],["Bedi","Tejasv",""],["De Nisco","Nicole J.",""],["Li","Qiwei",""]]}
{"id":"2308.14672","submitter":"Lilia Boeri","authors":"Antonio Sanna, Camilla Pellegrini, Simone di Cataldo, Giannni Profeta\n  and Lilia Boeri","title":"A possible explanation for the high superconducting Tc in bcc Ti at high\n  pressure","comments":"Submitted to the Special Issue on \"Physics of Materials under High\n  Pressure\", Materials Today Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by unexpected reports of a 26 K superconducting transition in\nelemental titanium at high pressure, we carry out an accurate ab-initio study\nof its properties to understand the rationale for this observation. The\ncritical superconducting temperatures (Tc's) predicted under the assumption of\na phononic pairing mechanism are found to be significantly lower than those\nexperimentally observed. We argue that this disagreement cannot be explained by\nan unconventional coupling, as previously suggested, or by the existence of\ncompeting metastable structural phases. As a physically meaningful hypothesis\nto reconcile experimental and theoretical results, we assume the presence of Ti\nvacancies in the lattice. Our first-principles calculations indeed show that\nlattice vacancies can cause pressure dependent phonon softening and\nsubstantially increase the electron-phonon coupling at high pressure, yielding\ncomputed Tc's in agreement with the experimental measurements over the full\npressure range from 150 to 300 GPa. We expect the proposed Tc enhancement\nmechanism to occur on a general basis in simple high-symmetry metals for\nvarious types of defects.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:00:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Sanna","Antonio",""],["Pellegrini","Camilla",""],["di Cataldo","Simone",""],["Profeta","Giannni",""],["Boeri","Lilia",""]]}
{"id":"2308.14673","submitter":"Mauro Cambiaso","authors":"Sebasti\\'an Filipini and Mauro Cambiaso","title":"New polarization rotation and exact TEM wave solutions in topological\n  insulators","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the context of $\\theta$ electrodynamics we find transverse electromagnetic\nwave solutions forbidden in Maxwell electrodynamics. Our results attest to new\nevidence of the topological magnetoelectric effect in topological insulators,\nresulting from a polarization rotation of an external electromagnetic field.\nUnlike Faraday and Kerr rotations, the effect does not rely on a longitudinal\nmagnetic field, the reflected field, or birefringence. The rotation occurs due\nto transversal discontinuities of the topological magnetoelectric parameter in\ncylindrical geometries. The dispersion relation is linear, and birefringence is\nabsent. One solution behaves as an optical fiber confining exact transverse\nelectromagnetic fields with omnidirectional reflectivity. These results may\nopen new possibilities in optics and photonics by utilizing topological\ninsulators to manipulate light.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:00:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Filipini","Sebasti\u00e1n",""],["Cambiaso","Mauro",""]]}
{"id":"2308.14674","submitter":"Ltaief Ben Ltaief","authors":"L. Ben Ltaief, K. Sishodia, R. Richter, B. Bastian, J. D. Asmussen, S.\n  Mandal, N. Pal, C. Medina, S. R. Krishnan, K. von Haeften and M. Mudrich","title":"Spectroscopically resolved resonant interatomic Coulombic decay in\n  photoexcited large He nanodroplets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Interatomic Coulombic decay (ICD) processes play a crucial role in weakly\nbound complexes exposed to intense or high-energy radiation. Using large helium\nnanodroplets, we demonstrate that ICD is efficient even when the droplets are\nirradiated by weak synchrotron radiation at relatively low photon energies.\nBelow the ionization threshold, resonant excitation of multiple centers\nefficiently induces resonant ICD as previously observed for intense pulses [A.\nC. LaForge et al., PRX 11, 021011 (2021)]. More surprisingly, we observe ICD\neven above the ionization threshold due to recombination of photoelectrons and\nions into excited states which subsequently decay by ICD. This demonstrates the\nimportance of secondary processes, in particular electron scattering and\nrecombination, in inducing ICD in extended condensed phase systems. In\naddition, we show that ICD can serve as a diagnostic tool for monitoring the\nrelaxation dynamics of highly-excited and ionized weakly-bound nanosystems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:03:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ltaief","L. Ben",""],["Sishodia","K.",""],["Richter","R.",""],["Bastian","B.",""],["Asmussen","J. D.",""],["Mandal","S.",""],["Pal","N.",""],["Medina","C.",""],["Krishnan","S. R.",""],["von Haeften","K.",""],["Mudrich","M.",""]]}
{"id":"2308.14675","submitter":"Ruyu Yang","authors":"Wencheng Zhao, Tingting Chen, Ruyu Yang","title":"Scalable Algorithms for Power Function Calculations of quantum states in\n  NISQ Era","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum computing stands at the vanguard of science, focused on exploiting\nquantum mechanical phenomena like superposition and entanglement. Its goal is\nto create innovative computational models that address intricate problems\nbeyond classical computers' capabilities. In the Noisy Intermediate-Scale\nQuantum (NISQ) era, developing algorithms for nonlinear function calculations\non density matrices is of paramount importance. This project endeavors to\ndesign scalable algorithms for calculating power functions of mixed quantum\nstates. This study introduces two algorithms based on the Hadamard Test and\nGate Set Tomography. Additionally, a comparison of their computational outcomes\nis offered, accompanied by a meticulous assessment of errors inherent in the\nGate Set Tomography-based approach.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:08:17 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhao","Wencheng",""],["Chen","Tingting",""],["Yang","Ruyu",""]]}
{"id":"2308.14676","submitter":"Xiaoliang He","authors":"X.L. He, Yong Lu, D.Q. Bao, Hang Xue, W.B. Jiang, Zhen Wang, A.F.\n  Roudsari, Per Delsing, J.S. Tsai, Z.R. Lin","title":"Fast generation of Schr\\\"odinger cat states in a Kerr-tunable\n  superconducting resonator","comments":"15 pages,12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Schr\\\"odinger cat states, quantum superpositions of macroscopically distinct\nclassical states, are an important resource for quantum communication, quantum\nmetrology and quantum computation. Especially, cat states in a phase space\nprotected against phase-flip errors can be used as a logical qubit. However,\ncat states, normally generated in three-dimensional cavities, are facing the\nchallenges of scalability and controllability. Here, we present a novel\nstrategy to generate and store cat states in a coplanar superconducting circuit\nby the fast modulation of Kerr nonlinearity. At the Kerr-free work point, our\ncat states are passively preserved due to the vanishing Kerr effect. We are\nable to prepare a 2-component cat state in our chip-based device with a\nfidelity reaching 89.1% under a 96 ns gate time. Our scheme shows an excellent\nroute to constructing a chip-based bosonic quantum processor.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:12:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["He","X. L.",""],["Lu","Yong",""],["Bao","D. Q.",""],["Xue","Hang",""],["Jiang","W. B.",""],["Wang","Zhen",""],["Roudsari","A. F.",""],["Delsing","Per",""],["Tsai","J. S.",""],["Lin","Z. R.",""]]}
{"id":"2308.14677","submitter":"Irene Heinrich","authors":"Irene Heinrich and Simon Ra{\\ss}mann","title":"Twin-width of graphs with tree-structured decompositions","comments":"21 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The twin-width of a graph measures its distance to co-graphs and generalizes\nclassical width concepts such as tree-width or rank-width. Since its\nintroduction in 2020 (Bonnet et. al. 2020), a mass of new results has appeared\nrelating twin width to group theory, model theory, combinatorial optimization,\nand structural graph theory.\n  We take a detailed look at the interplay between the twin-width of a graph\nand the twin-width of its components under tree-structured decompositions: We\nprove that the twin-width of a graph is at most twice its strong tree-width,\ncontrasting nicely with the result of (Bonnet and D\\'epr\\'es 2022), which\nstates that twin-width can be exponential in tree-width. Further, we employ the\nfundamental concept from structural graph theory of decomposing a graph into\nhighly connected components, in order to obtain an optimal linear bound on the\ntwin-width of a graph given the widths of its biconnected components. For\ntriconnected components we obtain a linear upper bound if we add red edges to\nthe components indicating the splits which led to the components. Extending\nthis approach to quasi-4-connectivity, we obtain a quadratic upper bound.\nFinally, we investigate how the adhesion of a tree decomposition influences the\ntwin-width of the decomposed graph.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:13:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Heinrich","Irene",""],["Ra\u00dfmann","Simon",""]]}
{"id":"2308.14678","submitter":"Mateusz Go{\\l}\\k{e}biewski","authors":"Mateusz Go{\\l}\\k{e}biewski, Hanna Reshetniak, Uladzislau Makartsou,\n  Maciej Krawczyk, Arjen van den Berg, Sam Ladak, Anjan Barman","title":"Spin-wave spectral analysis in crescent-shaped ferromagnetic nanorods","comments":null,"journal-ref":"Phys. Rev. Applied 19, 6, 2200373 (2023)","doi":"10.1103/PhysRevApplied.19.064045","report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The research on the properties of spin waves (SWs) in three-dimensional\nnanosystems is an innovative idea in the field of magnonics. Mastering and\nunderstanding the nature of magnetization dynamics and binding of SWs at\nsurfaces, edges, and in-volume parts of three-dimensional magnetic systems\nenables the discovery of new phenomena and suggests new possibilities for their\nuse in magnonic and spintronic devices. In this work, we use numerical methods\nto study the effect of geometry and external magnetic field manipulations on\nthe localization and dynamics of SWs in crescent-shaped (CS) waveguides. It is\nshown that changing the magnetic field direction in these waveguides breaks the\nsymmetry and affects the localization of eigenmodes with respect to the static\ndemagnetizing field. This in turn has a direct effect on their frequency.\nFurthermore, CS structures were found to be characterized by significant\nsaturation at certain field orientations, resulting in a cylindrical\nmagnetization distribution. Thus, we present chirality-based nonreciprocal\ndispersion relations for high-frequency SWs, which can be controlled by the\nfield direction (shape symmetry) and its amplitude (saturation).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:13:25 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Go\u0142\u0119biewski","Mateusz",""],["Reshetniak","Hanna",""],["Makartsou","Uladzislau",""],["Krawczyk","Maciej",""],["Berg","Arjen van den",""],["Ladak","Sam",""],["Barman","Anjan",""]]}
{"id":"2308.14679","submitter":"Gabriela Acevedo","authors":"Gabriela T. Acevedo Trebbau, Andrea Bandini, Diego L. Guarin","title":"Video-Based Hand Pose Estimation for Remote Assessment of Bradykinesia\n  in Parkinson's Disease","comments":"12 pages, 3 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  There is a growing interest in using pose estimation algorithms for\nvideo-based assessment of Bradykinesia in Parkinson's Disease (PD) to\nfacilitate remote disease assessment and monitoring. However, the accuracy of\npose estimation algorithms in videos from video streaming services during\nTelehealth appointments has not been studied. In this study, we used seven\noff-the-shelf hand pose estimation models to estimate the movement of the thumb\nand index fingers in videos of the finger-tapping (FT) test recorded from\nHealthy Controls (HC) and participants with PD and under two different\nconditions: streaming (videos recorded during a live Zoom meeting) and\non-device (videos recorded locally with high-quality cameras). The accuracy and\nreliability of the models were estimated by comparing the models' output with\nmanual results. Three of the seven models demonstrated good accuracy for\non-device recordings, and the accuracy decreased significantly for streaming\nrecordings. We observed a negative correlation between movement speed and the\nmodel's accuracy for the streaming recordings. Additionally, we evaluated the\nreliability of ten movement features related to bradykinesia extracted from\nvideo recordings of PD patients performing the FT test. While most of the\nfeatures demonstrated excellent reliability for on-device recordings, most of\nthe features demonstrated poor to moderate reliability for streaming\nrecordings. Our findings highlight the limitations of pose estimation\nalgorithms when applied to video recordings obtained during Telehealth visits,\nand demonstrate that on-device recordings can be used for automatic\nvideo-assessment of bradykinesia in PD.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:15:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Trebbau","Gabriela T. Acevedo",""],["Bandini","Andrea",""],["Guarin","Diego L.",""]]}
{"id":"2308.14680","submitter":"Germ\\'an Miranda","authors":"Germ\\'an Miranda","title":"Discrete spectrum of the magnetic Laplacian on almost flat magnetic\n  barriers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The magnetic Laplacian with a step magnetic field has been intensively\nstudied during the last years. We adapt the construction introduced by\nBonnaillie-No\\\"el, Fournais, Kachmar and Raymond to prove the existence of\nbound states of a new effective operator involving a magnetic step field on a\ndomain with an almost flat magnetic barrier. This result emphasizes the fact\nthat even a small non-smoothness of the discontinuity region can cause the\nappearance of eigenvalues below the essential spectrum. We also give an example\nwhere this effective operator arises.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:15:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Miranda","Germ\u00e1n",""]]}
{"id":"2308.14681","submitter":"Sung Min Lee","authors":"Sung Min Lee","title":"On the average congruence class bias for cyclicity and divisibility of\n  the groups of $\\mathbb{F}_p$-points of elliptic curves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2009, W. D. Banks and I. E. Shparlinski studied the average densities of\nprimes $p \\leq x$ for which the reductions of elliptic curves of small height\nmodulo $p$ satisfy certain geometric properties, namely cyclicity and\ndivisibility of the number of points by a fixed integer $m$. In this paper, we\nrefine their results, restricting the primes $p$ under consideration to lie in\nan arithmetic progression $k \\bmod{n}$. Furthermore, for a fixed modulus $n$,\nwe investigate statistical biases among the different congruence classes $k\n\\bmod{n}$ of primes satisfying the aforementioned properties.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:16:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Sung Min",""]]}
{"id":"2308.14682","submitter":"Amit Tiwari","authors":"Qaisar Shafi, Amit Tiwari and Cem Salih Un","title":"Muon $g-2$ and dark matter in Supersymmetric $SU(4)_c \\times SU(2)_L\n  \\times SU(2)_R$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The latest FermiLab muon $g-2$ result shows a $5\\sigma$ discrepancy with a\n``widely advertised\" Standard Model prediction. We consider a supersymmetric\n$SU(4)_c \\times SU(2)_L \\times SU(2)_R$ model in which this discrepancy is\nresolved by including contributions to muon $g-2$ from a relatively light SUSY\nsector. A variety of realistic coannihilation scenarios can reproduce the\nobserved dark matter relic abundance. With a significantly reduced discrepancy,\nof order $1 \\sigma$ or less, the Higgsino-like dark matter solutions are also\nviable. We provide benchmark points for these solutions that will be probed in\nthe direct detection dark matter experiments and collider searches.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:17:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Shafi","Qaisar",""],["Tiwari","Amit",""],["Un","Cem Salih",""]]}
{"id":"2308.14683","submitter":"Thanh Thi Nguyen","authors":"Thanh Thi Nguyen, Campbell Wilson, Janis Dalins","title":"Fine-Tuning Llama 2 Large Language Models for Detecting Online Sexual\n  Predatory Chats and Abusive Texts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Detecting online sexual predatory behaviours and abusive language on social\nmedia platforms has become a critical area of research due to the growing\nconcerns about online safety, especially for vulnerable populations such as\nchildren and adolescents. Researchers have been exploring various techniques\nand approaches to develop effective detection systems that can identify and\nmitigate these risks. Recent development of large language models (LLMs) has\nopened a new opportunity to address this problem more effectively. This paper\nproposes an approach to detection of online sexual predatory chats and abusive\nlanguage using the open-source pretrained Llama 2 7B-parameter model, recently\nreleased by Meta GenAI. We fine-tune the LLM using datasets with different\nsizes, imbalance degrees, and languages (i.e., English, Roman Urdu and Urdu).\nBased on the power of LLMs, our approach is generic and automated without a\nmanual search for a synergy between feature extraction and classifier design\nsteps like conventional methods in this domain. Experimental results show a\nstrong performance of the proposed approach, which performs proficiently and\nconsistently across three distinct datasets with five sets of experiments. This\nstudy's outcomes indicate that the proposed method can be implemented in\nreal-world applications (even with non-English languages) for flagging sexual\npredators, offensive or toxic content, hate speech, and discriminatory language\nin online discussions and comments to maintain respectful internet or digital\ncommunities. Furthermore, it can be employed for solving text classification\nproblems with other potential applications such as sentiment analysis, spam and\nphishing detection, sorting legal documents, fake news detection, language\nidentification, user intent recognition, text-based product categorization,\nmedical record analysis, and resume screening.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:18:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Nguyen","Thanh Thi",""],["Wilson","Campbell",""],["Dalins","Janis",""]]}
{"id":"2308.14684","submitter":"Alexander Lytchak","authors":"Alexander Lytchak and Sophia Wagner","title":"Curvature bounds on length-minimizing discs","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that a length-minimizing disk inherites the upper curvature bound of\nthe target. As a consequence we prove that harmonic discs and ruled discs\ninherit the upper curvature bound from the ambient space.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:19:38 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lytchak","Alexander",""],["Wagner","Sophia",""]]}
{"id":"2308.14685","submitter":"Aparna Venkatesan","authors":"Aparna Venkatesan (University of San Francisco) and John C. Barentine\n  (Dark Sky Consulting)","title":"Noctalgia (sky grief): Our Brightening Night Skies and Loss of\n  Environment for Astronomy and Sky Traditions","comments":"2 pages; published as a Science e-Letter in response to the\n  Introduction of the Special Section on light pollution in the June 16, 2023\n  issue of Science. E-letter available only online (hyperlink in PDF)","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fifty years after the first mention of light pollution in Science, the\njournal recently elevated this topic to the cover of its 16 June 2023 issue,\nhighlighting the large impact on human and ecological health, circadian\nrhythms, migratory patterns, and more. We offer here the term noctalgia to\nexpress \"sky grief\" for the accelerating loss of the home environment of our\nshared skies - representing loss of science, heritage, millennia-old sky\ntraditions, place-based language, and more - and summarize next steps to\naddress the protection of our nighttime and daytime skies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:20:06 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Venkatesan","Aparna","","University of San Francisco"],["Barentine","John C.","","Dark Sky Consulting"]]}
{"id":"2308.14686","submitter":"Ziyu Chen","authors":"Jionghao Wang, Ziyu Chen, Jun Ling, Rong Xie and Li Song","title":"360-Degree Panorama Generation from Few Unregistered NFoV Images","comments":"Accepted to ACM Multimedia 2023 (MM' 23). Code is available:\n  https://github.com/shanemankiw/Panodiff","journal-ref":null,"doi":"10.1145/3581783.3612508","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  360$^\\circ$ panoramas are extensively utilized as environmental light sources\nin computer graphics. However, capturing a 360$^\\circ$ $\\times$ 180$^\\circ$\npanorama poses challenges due to the necessity of specialized and costly\nequipment, and additional human resources. Prior studies develop various\nlearning-based generative methods to synthesize panoramas from a single Narrow\nField-of-View (NFoV) image, but they are limited in alterable input patterns,\ngeneration quality, and controllability. To address these issues, we propose a\nnovel pipeline called PanoDiff, which efficiently generates complete\n360$^\\circ$ panoramas using one or more unregistered NFoV images captured from\narbitrary angles. Our approach has two primary components to overcome the\nlimitations. Firstly, a two-stage angle prediction module to handle various\nnumbers of NFoV inputs. Secondly, a novel latent diffusion-based panorama\ngeneration model uses incomplete panorama and text prompts as control signals\nand utilizes several geometric augmentation schemes to ensure geometric\nproperties in generated panoramas. Experiments show that PanoDiff achieves\nstate-of-the-art panoramic generation quality and high controllability, making\nit suitable for applications such as content editing.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:21:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Jionghao",""],["Chen","Ziyu",""],["Ling","Jun",""],["Xie","Rong",""],["Song","Li",""]]}
{"id":"2308.14687","submitter":"Daniel Ramos","authors":"Daniel Ramos, Hailie Mitchell, In\\^es Lynce, Vasco Manquinho, Ruben\n  Martins, Claire Le Goues","title":"MELT: Mining Effective Lightweight Transformations from Pull Requests","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Software developers often struggle to update APIs, leading to manual,\ntime-consuming, and error-prone processes. We introduce MELT, a new approach\nthat generates lightweight API migration rules directly from pull requests in\npopular library repositories. Our key insight is that pull requests merged into\nopen-source libraries are a rich source of information sufficient to mine API\nmigration rules. By leveraging code examples mined from the library source and\nautomatically generated code examples based on the pull requests, we infer\ntransformation rules in \\comby, a language for structural code search and\nreplace. Since inferred rules from single code examples may be too specific, we\npropose a generalization procedure to make the rules more applicable to client\nprojects. MELT rules are syntax-driven, interpretable, and easily adaptable.\nMoreover, unlike previous work, our approach enables rule inference to\nseamlessly integrate into the library workflow, removing the need to wait for\nclient code migrations. We evaluated MELT on pull requests from four popular\nlibraries, successfully mining 461 migration rules from code examples in pull\nrequests and 114 rules from auto-generated code examples. Our generalization\nprocedure increases the number of matches for mined rules by 9x. We applied\nthese rules to client projects and ran their tests, which led to an overall\ndecrease in the number of warnings and fixing some test cases demonstrating\nMELT's effectiveness in real-world scenarios.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:21:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ramos","Daniel",""],["Mitchell","Hailie",""],["Lynce","In\u00eas",""],["Manquinho","Vasco",""],["Martins","Ruben",""],["Goues","Claire Le",""]]}
{"id":"2308.14688","submitter":"Lang Liu","authors":"Zhu Yi, Zhi-Qiang You, You Wu, Zu-Cheng Chen and Lang Liu","title":"Exploring the NANOGrav Signal and Planet-mass Primordial Black Holes\n  through Higgs Inflation","comments":"10 pages, 3 figures;","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The data recently released by the North American Nanohertz Observatory for\nGravitational Waves provides compelling evidence supporting the existence of a\nstochastic signal that aligns with a gravitational-wave background. We show\nthis signal can be the scalar-induced gravitational waves from the Higgs\ninflation model with the parametric amplification mechanism. Such a\ngravitational-wave background naturally predicts the substantial existence of\nplanet-mass primordial black holes, which can be planet 9 in our solar system\nand the lensing objects for the ultrashort-timescale microlensing events\nobserved by the Optical Gravitational Lensing Experiment. The future\nobservations of stochastic gravitational wave background by pulsar timing\narrays and planet-mass primordial black holes provide such a possibility to\ngive further confirmations on Higgs inflation, which unifies two fundamental\naspects of theoretical physics, particle physics and cosmology.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:23:43 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yi","Zhu",""],["You","Zhi-Qiang",""],["Wu","You",""],["Chen","Zu-Cheng",""],["Liu","Lang",""]]}
{"id":"2308.14689","submitter":"Ata Atay","authors":"Ata Atay, Antonio Romero-Medina","title":"Complementarities in childcare allocation under priorities","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH cs.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the allocation of children to childcare facilities and propose\nsolutions to overcome limitations in the current allocation mechanism. We\nintroduce a natural preference domain and a priority structure that address\nthese setbacks, aiming to enhance the allocation process. To achieve this, we\npresent an adaptation of the Deferred Acceptance mechanism to our problem,\nwhich ensures strategy-proofness within our preference domain and yields the\nstudent-optimal stable matching. Finally, we provide a maximal domain for the\nexistence of stable matchings using the properties that define our natural\npreference domain. Our results have practical implications for allocating\nindivisible bundles with complementarities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:26:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Atay","Ata",""],["Romero-Medina","Antonio",""]]}
{"id":"2308.14690","submitter":"Horatiu Stefan Nastase","authors":"Matheus Cravo and Horatiu Nastase","title":"Holographic Cosmology $n$-point function map from the Wavefunction of\n  the Universe","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this note we show explicitly that, applying an extension of Maldacena's\nmap for the wavefunction of the Universe $Z[\\phi]=\\Psi[\\phi]$ from de Sitter\ninflation to holographic cosmology, we find the relations previously derived\nfor 2-point functions, $\\langle h_{ij}(p) h_{kl}(-p)\\rangle \\sim 1/[{\\rm\nIm}\\langle T_{ij}(-ip)T_{kl}(+ip)\\rangle]$ and a similar one for currents,\nwhich were used to show that holographic cosmology matches CMBR data and solves\nBig Bang problems as well as inflation. Higher point functions are done\nsimilarly, and as an application, we check the result for the 3-point functions\nof scalar and tensor fluctuations and find the result for the monopole\nnon-Gaussianity arising from the 3-point functions of currents. The method is\nsimple and potentially could be applied to calculate any observable in\nholographic cosmology.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:29:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Cravo","Matheus",""],["Nastase","Horatiu",""]]}
{"id":"2308.14691","submitter":"Victor H. Robles Mr.","authors":"Victor H. Robles, J. L. Zagorac, N. Padmanabhan","title":"Scalar Field Dark Matter: Impact of Supernovae-driven blowouts on the\n  soliton structure of low mass dark matter halos","comments":"11 pages, 6 figures, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first study on the gravitational impact of supernova feedback\nin an isolated soliton and a spherically symmetric dwarf SFDM halo of virial\nmass $1\\times 10^{10}\\mathrm{M_\\odot}$. We use a boson mass\n$m=10^{-22}\\mathrm{eV/c^2}$ and a soliton core $r_c \\approx 0.7$kpc, comparable\nto typical half-light radii of Local Group dwarf galaxies. We simulate the\nrapid gas removal from the center of the soliton by a concentric external\ntime-dependent Hernquist potential. We explore two scenarios of feedback\nblowouts: i) a massive single burst, and ii) multiple consecutive blowouts\ninjecting the same total energy to the system, including various magnitudes for\nthe blowouts in both scenarios. In all cases, we find one single blowout has a\nstronger effect on reducing the soliton central density. Feedback leads to\ncentral soliton densities that oscillate quasi-periodically for an isolated\nsoliton and stochastically for a SFDM halo. The range in the density amplitude\ndepends on the strength of the blowout, however we observe typical variations\nof a factor of $\\geqslant$2. One important consequence of the stochastic\nfluctuating densities is that, if we had no prior knowledge of the system\nevolution, we can only know the configuration profile at a specific time within\nsome accuracy. By fitting soliton profiles at different times to our simulated\nstructures, we found the (1-$\\sigma$) scatter of their time-dependent density\nprofiles. For configurations within the 1$\\sigma$ range, we find the inferred\nboson mass is typically less than 20\\% different from the real value used in\nour simulations. Finally, we compare the observed dynamical masses of field\ndwarf galaxies in our Local Group with the implied range of viable solitons\nfrom our simulations and find good agreement.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:32:45 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Robles","Victor H.",""],["Zagorac","J. L.",""],["Padmanabhan","N.",""]]}
{"id":"2308.14692","submitter":"Alexei Oblomkov","authors":"Ljudmila Kamenova and Giovanni Mongardi and Alexei Oblomkov","title":"Fixed loci of symplectic automorphisms of $K3^{[n]}$ and $n$-Kummer type\n  manifold","comments":"18 pages, comments are welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this paper is to give an explicit description of the fixed loci of\nsymplectic automorphisms for certain hyperkahler manifolds, namely for Hilbert\nschemes on K3 surfaces and for generalized Kummer varieties. Here we extend our\nprevious results from the case of involutions to more general groups. In\nparticular, under some conditions on the dimension, we give the full answer for\nfinite group actions of symplectic automorphisms coming from K3 surfaces. We\nprove that the all irreducible components of the fixed loci are of $K3^{[k]}$\ntype of lower dimensions or isolated points.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:34:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Kamenova","Ljudmila",""],["Mongardi","Giovanni",""],["Oblomkov","Alexei",""]]}
{"id":"2308.14693","submitter":"Waqas Aman Dr.","authors":"Hala Amin, Jawaher Kaldari, Nora Mohamed, Waqas Aman, Saif Al-Kuwari","title":"Hybrid PLS-ML Authentication Scheme for V2I Communication Networks","comments":"Accepted for Publication following Presentation at IEEE ISNCC-23","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.CR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Vehicular communication networks are rapidly emerging as vehicles become\nsmarter. However, these networks are increasingly susceptible to various\nattacks. The situation is exacerbated by the rise in automated vehicles\ncomplicates, emphasizing the need for security and authentication measures to\nensure safe and effective traffic management. In this paper, we propose a novel\nhybrid physical layer security (PLS)-machine learning (ML) authentication\nscheme by exploiting the position of the transmitter vehicle as a device\nfingerprint. We use a time-of-arrival (ToA) based localization mechanism where\nthe ToA is estimated at roadside units (RSUs), and the coordinates of the\ntransmitter vehicle are extracted at the base station (BS).Furthermore, to\ntrack the mobility of the moving legitimate vehicle, we use ML model trained on\nseveral system parameters. We try two ML models for this purpose, i.e., support\nvector regression and decision tree. To evaluate our scheme, we conduct binary\nhypothesis testing on the estimated positions with the help of the ground\ntruths provided by the ML model, which classifies the transmitter node as\nlegitimate or malicious. Moreover, we consider the probability of false alarm\nand the probability of missed detection as performance metrics resulting from\nthe binary hypothesis testing, and mean absolute error (MAE), mean square error\n(MSE), and coefficient of determination $\\text{R}^2$ to further evaluate the ML\nmodels. We also compare our scheme with a baseline scheme that exploits the\nangle of arrival at RSUs for authentication. We observe that our proposed\nposition-based mechanism outperforms the baseline scheme significantly in terms\nof missed detections.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:34:50 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Amin","Hala",""],["Kaldari","Jawaher",""],["Mohamed","Nora",""],["Aman","Waqas",""],["Al-Kuwari","Saif",""]]}
{"id":"2308.14694","submitter":"Edward Shuryak","authors":"Nicholas Miesch, Edward Shuryak, Ismail Zahed","title":"Hadronic structure on the light-front IX . Orbital-spin-isospin wave\n  functions of baryons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper which is part of a series, is devoted to several technical issues.\nIn the first part of the paper, we discuss the usual wavefunctions in the CM\nframe for baryons, by clarifying the representations of the three-quark\npermutation group $S_3$. We extend the analysis for up to five ``spinors\" with\n$\\rho,\\lambda$-symmetry, and derive explicitly the totally symmetric\nwavefunctions modulo color. They are explicitly used to describe the excited\nnucleons $N^*$ states, in the P- and D-shell. We also show how to use symbolic\noperations in Mathematica, in spin-tensor notations to make explicit these\nstates. For the S- and P-shells, the totally antisymmetric wavefunctions are\ngiven, and the pertinent matrix elements for the spin-dependent operators\ncalculated, including the mixing between states with different total spin $S$.\nIn the second part of the paper we turn to the light front wavefunctions, with\nan emphasis on the longitudinal wavefunctions, with a novel basis set. We also\ndiscuss their symmetries under permutations, and select the proper combinations\nfor the transverse and longitudinal excitations for $N^*$ on the light front.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:36:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Miesch","Nicholas",""],["Shuryak","Edward",""],["Zahed","Ismail",""]]}
{"id":"2308.14695","submitter":"Mary S\\'anchez-Gord\\'on","authors":"Mary S\\'anchez-Gord\\'on, Ricardo Colomo-Palacios, Cathy Guevara-Vega,\n  Antonio Qui\\~na-Mera","title":"The Effect of Stereotypes on Perceived Competence of Indigenous Software\n  Practitioners: A Professional Photo","comments":"Accepted registered report at the 17th ACM/IEEE International\n  Symposium on Empirical Software Engineering and Measurement (ESEM 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Context: Potential employers can readily find job candidates' photos through\nvarious online sources such as former employers' websites or professional and\nsocial networks. The alignment or 'fit' between a candidate and an organization\nis inferred in online photos through dress style and presentations of self. On\nthe other hand, for candidates from under-represented groups like Indigenous\npeople traditional clothing is an important and lively aspect that allows them\nto express belonging, enter ceremony, and show resistance.Objective: This\nexploratory study aims to empirically demonstrate whether traditional clothing\nin a picture affects the evaluation of candidates' competence for a position\nlike a software developer in which clothing should not be crucial. Method: We\nplan a quasi-experimental design with both candidates (photo models) and\nparticipants (evaluators) from IT companies. It follows a 2 x 2 x 2 design with\ndress style (traditional / non-traditional clothing), gender and race/ethnicity\nof the candidates as within-subjects factors. In addition, we will explore the\nevaluator's gender and experience in hiring as between-subjects factors.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:38:27 GMT"}],"update_date":"2023-08-29","authors_parsed":[["S\u00e1nchez-Gord\u00f3n","Mary",""],["Colomo-Palacios","Ricardo",""],["Guevara-Vega","Cathy",""],["Qui\u00f1a-Mera","Antonio",""]]}
{"id":"2308.14696","submitter":"Takahiro Morishita","authors":"Massimo Stiavelli, Takahiro Morishita, Marco Chiaberge, Claudio\n  Grillo, Piero Rosati, Stefan Schuldt, Michele Trenti, and Tommaso Treu","title":"The puzzling properties of the MACS1149-JD1 galaxy at z=9.11","comments":"Submitted to ApJL","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We analyze new JWST NIRCam and NIRSpec data on the redshift 9.11 galaxy\nMACS1149-JD1. Our NIRCam imaging data reveal that JD1 comprises three spatially\ndistinct components. Our spectroscopic data indicate that JD1 appears dust-free\nbut is already enriched, $12 + \\log {\\rm (O/H) } = 7.875^{+0.042}_{-0.045}$. We\nalso find that the Carbon and Neon abundances in JD1 are below the solar\nabundance ratio. Particularly the Carbon under-abundance is suggestive of\nrecent star formation where Type~II supernovae have already enriched the ISM in\nOxygen but intermediate mass stars have not yet enriched the ISM in Carbon. A\nrecent burst of star formation is also revealed by the star formation history\nderived from NIRCam photometry. Our data do not reveal the presence of a\nsignificant amount of old populations, resulting in a factor of $\\sim7\\times$\nsmaller stellar mass than previous estimates. Thus, our data support the view\nthat JD1 is a young object.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:38:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Stiavelli","Massimo",""],["Morishita","Takahiro",""],["Chiaberge","Marco",""],["Grillo","Claudio",""],["Rosati","Piero",""],["Schuldt","Stefan",""],["Trenti","Michele",""],["Treu","Tommaso",""]]}
{"id":"2308.14697","submitter":"Reza Akhavian","authors":"Newsha Emaminejad, Lisa Kath, and Reza Akhavian","title":"Assessing Trust in Construction AI-Powered Collaborative Robots using\n  Structural Equation Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This study aimed to investigate the key technical and psychological factors\nthat impact the architecture, engineering, and construction (AEC)\nprofessionals' trust in collaborative robots (cobots) powered by artificial\nintelligence (AI). The study employed a nationwide survey of 600 AEC industry\npractitioners to gather in-depth responses and valuable insights into the\nfuture opportunities for promoting the adoption, cultivation, and training of a\nskilled workforce to leverage this technology effectively. A Structural\nEquation Modeling (SEM) analysis revealed that safety and reliability are\nsignificant factors for the adoption of AI-powered cobots in construction. Fear\nof being replaced resulting from the use of cobots can have a substantial\neffect on the mental health of the affected workers. A lower error rate in jobs\ninvolving cobots, safety measurements, and security of data collected by cobots\nfrom jobsites significantly impact reliability, while the transparency of\ncobots' inner workings can benefit accuracy, robustness, security, privacy, and\ncommunication, and results in higher levels of automation, all of which\ndemonstrated as contributors to trust. The study's findings provide critical\ninsights into the perceptions and experiences of AEC professionals towards\nadoption of cobots in construction and help project teams determine the\nadoption approach that aligns with the company's goals workers' welfare.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:39:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Emaminejad","Newsha",""],["Kath","Lisa",""],["Akhavian","Reza",""]]}
{"id":"2308.14698","submitter":"Yoram Alhassid","authors":"Y. Alhassid, P. Fanto, C. \\\"Ozen","title":"Circumventing the odd particle-number sign problem in the shell model\n  Monte Carlo","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The shell model Monte Carlo (SMMC) method is a powerful method for\ncalculating exactly (up to statistical errors) thermal observables and\nstatistical properties of atomic nuclei. However, its application has been\nlimited by a sign problem at low temperatures that arises from the projection\nonto odd particle number even for good-sign interactions. Here, we develop a\ntechnique - the partition function extrapolation method (PFEM) - to extract the\nground-state energy of an odd-mass nucleus from the excitation partition\nfunction calculated at temperatures at which this sign problem is moderate. We\nvalidate the PFEM in heavy even-mass nuclei and systematically calculate\nground-state energies for isotopic chains of heavy odd-mass nuclei. The PFEM\ncan be extended to other finite-size quantum many-body systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:46:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alhassid","Y.",""],["Fanto","P.",""],["\u00d6zen","C.",""]]}
{"id":"2308.14699","submitter":"Deborah Kuchnir Fygenson","authors":"Nathaniel Conrad, Omar A. Saleh and Deborah K. Fygenson","title":"Towards rational design of power-law rheology via DNA nanostar networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We measure the rheology of transient hydrogels comprised of a single type of\nDNA nanostar that makes both strong and weak bonds. These gels exhibit\npower-law frequency-dependence of their storage and loss moduli, with scaling\nexponents that depend on the proportions of the two bonds. A diffusive\nstress-relaxation model, in which the strong-bond sub-network relieves stress\nby diffusing through an effective viscosity imposed by the weak bonds, explains\nthe scaling of their moduli. The model has implications for the fractal\ndimensions of the strong-bond sub-network that are in good agreement with\nmeasurements and makes testable predictions for the viscoelasticity of other\ntransient hydrogels. Overall, this work demonstrates the power of DNA\nnanotechnology to decipher, and potentially rationally design, power-law\nrheology.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:47:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Conrad","Nathaniel",""],["Saleh","Omar A.",""],["Fygenson","Deborah K.",""]]}
{"id":"2308.14700","submitter":"Francesca Azzolini","authors":"Francesca Azzolini and Hans Skaug","title":"Exploring the likelihood surface in multivariate Gaussian mixtures using\n  Hamiltonian Monte Carlo","comments":"17 pages (main text) + 3 pages (supplementary material), 3 figures, 6\n  tables (main text) + 4 tables (supplementary material)","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Multimodality of the likelihood in Gaussian mixtures is a well-known problem.\nThe choice of the initial parameter vector for the numerical optimizer may\naffect whether the optimizer finds the global maximum, or gets trapped in a\nlocal maximum of the likelihood. We propose to use Hamiltonian Monte Carlo\n(HMC) to explore the part of the parameter space which has a high likelihood.\nEach sampled parameter vector is used as the initial value for quasi-Newton\noptimizer, and the resulting sample of (maximum) likelihood values is used to\ndetermine if the likelihood is multimodal. We use a single simulated data set\nfrom a three component bivariate mixture to develop and test the method. We use\nstate-of-the-art HCM software, but experience difficulties when trying to\ndirectly apply HMC to the full model with 15 parameters. To improve the mixing\nof the Markov Chain we explore various tricks, and conclude that for the\ndataset at hand we have found the global maximum likelihood estimate.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:50:02 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Azzolini","Francesca",""],["Skaug","Hans",""]]}
{"id":"2308.14701","submitter":"C. Anastasiou","authors":"Charalampos Anastasiou, Julia Karlen and Matilde Vicini","title":"Tensor reduction of loop integrals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The computational cost associated with reducing tensor integrals to scalar\nintegrals using the Passarino-Veltman method is dominated by the\ndiagonalisation of large systems of equations. These systems of equations are\nsized according to the number of independent tensor elements that can be\nconstructed using the metric and external momenta. In this article, we present\na closed-form solution of this diagonalisation problem in arbitrary tensor\nintegrals. We employ a basis of tensors whose building blocks are the external\nmomentum vectors and a metric tensor transverse to the space of external\nmomenta. The scalar integral coefficients of the basis tensors are obtained by\nmapping the basis elements to the elements of an orthogonaldual basis. This\nmapping is succinctly expressed through a formula that resembles the ordering\nof operators in Wick's theorem. Finally, we provide examples demonstrating the\napplication of our tensor reduction formula to Feynman diagrams in QCD $2 \\to\n2$ scattering processes, specifically up to three loops.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:52:36 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Anastasiou","Charalampos",""],["Karlen","Julia",""],["Vicini","Matilde",""]]}
{"id":"2308.14702","submitter":"Ismail Soudi","authors":"Ismail Soudi and Abhijit Majumder","title":"Azimuthal Anisotropy at high transverse momentum in $p$-$p$ and $p$-$A$\n  collisions","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the possibility that the initial transverse momentum distribution\nof unpolarized and polarized partons within unpolarized nucleons, both with and\nwithout the anisotropy of unpolarized hadrons produced in the fragmentation of\noutgoing partons, could lead to the observed azimuthal anisotropy of high\ntransverse momentum (high-$p_T$) hadrons produced in high energy proton-proton\n($p$-$p$) or proton-ion ($p$-$A$) collisions. Including simple Gaussian forms\nfor transverse momentum dependent parton distribution functions (PDF) and\nfragmentation functions, and assuming an $A^{1/3}$ enhancement of a PDF in\n$p$-$Pb$ collisions, we show that the observed anisotropy, with \\emph{no\nmodification} to the angle integrated spectra ($R_{pA}\\!=1$) for 5 GeV\n$\\lesssim p_T\\lesssim 50$ GeV, can be straightforwardly understood as arising\nfrom a few processes dominated by gluon-gluon to gluon-gluon scattering.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:54:35 GMT"},{"version":"v2","created":"Tue, 29 Aug 2023 14:23:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Soudi","Ismail",""],["Majumder","Abhijit",""]]}
{"id":"2308.14703","submitter":"Alejandro Robinson-Cort\\'es","authors":"Caterina Calsamiglia, Laura Doval, Alejandro Robinson-Cort\\'es,\n  Matthew Shum","title":"Managing Congestion in Two-Sided Platforms: The Case of Online Rentals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Thick two-sided matching platforms, such as the room-rental market, face the\nchallenge of showing relevant objects to users to reduce search costs. Many\nplatforms use ranking algorithms to determine the order in which alternatives\nare shown to users. Ranking algorithms may depend on simple criteria, such as\nhow long a listing has been on the platform, or incorporate more sophisticated\naspects, such as personalized inferences about users' preferences. Using rich\ndata on a room rental platform, we show how ranking algorithms can be a source\nof unnecessary congestion, especially when the ranking is invariant across\nusers. Invariant rankings induce users to view, click, and request the same\nrooms in the platform we study, greatly limiting the number of matches it\ncreates. We estimate preferences and simulate counterfactuals under different\nranking algorithms varying the degree of user personalization and variation\nacross users. In our case, increased personalization raises both user match\nutility and congestion, which leads to a trade-off. We find that the current\noutcome is inefficient as it lies below the possibility frontier, and propose\nalternatives that improve upon it.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:55:51 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Calsamiglia","Caterina",""],["Doval","Laura",""],["Robinson-Cort\u00e9s","Alejandro",""],["Shum","Matthew",""]]}
{"id":"2308.14704","submitter":"Arpit Maurya","authors":"Atanu Bhatta, Shankhadeep Chakrabortty, Taniya Mandal, Arpit Maurya","title":"Holographic Thermal Correlators for Hyperbolic $CFT$s","comments":"17 pages, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use holography to compute the exact form of retarded Green's functions for\na scalar operator with conformal dimension $\\Delta$ in a thermal CFT and in its\nrelated counterpart with chemical potential in $R^1 \\times H^3$. In our\nanalysis, we recast the wave equation of a scalar field in the normal form of\nHeun's equation in the dual gravity theories described by the AdS hyperbolic\nblackhole and its charged version. Heun's equation is identified to the\nsemiclassical limit of the BPZ equation for a five-point correlator with one\ndegenerate field insertion in the Liouville theory on the Riemann sphere. The\ncrossing symmetry of conformal block in the Liouville theory eventually gives\nrise to a set of connection formulas among the solutions of Heun's equation\nevaluated at different regular singularities. We use the connection formula to\nreproduce the leading order behaviors of the scalar field near the horizon as\nwell as near the boundary and achieve the exact form of the retarded thermal\nGreen's function. We show a recipe to obtain the exact retarded Green's\nfunction for a thermal CFT dual to AdS blackbrane from a high-temperature limit\naccompanied by a complex mapping on AdS hyperbolic blackhole. Moreover, we show\nthe retarded Green's function for the boundary CFT of Rindler AdS spacetime\nadmits a free integer parameter.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:57:29 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bhatta","Atanu",""],["Chakrabortty","Shankhadeep",""],["Mandal","Taniya",""],["Maurya","Arpit",""]]}
{"id":"2308.14705","submitter":"Mina Rezaei","authors":"Amirhossein Vahidi, Lisa Wimmer, H\\\"useyin Anil G\\\"und\\\"uz, Bernd\n  Bischl, Eyke H\\\"ullermeier, Mina Rezaei","title":"Diversified Ensemble of Independent Sub-Networks for Robust\n  Self-Supervised Representation Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ensembling a neural network is a widely recognized approach to enhance model\nperformance, estimate uncertainty, and improve robustness in deep supervised\nlearning. However, deep ensembles often come with high computational costs and\nmemory demands. In addition, the efficiency of a deep ensemble is related to\ndiversity among the ensemble members which is challenging for large,\nover-parameterized deep neural networks. Moreover, ensemble learning has not\nyet seen such widespread adoption, and it remains a challenging endeavor for\nself-supervised or unsupervised representation learning. Motivated by these\nchallenges, we present a novel self-supervised training regime that leverages\nan ensemble of independent sub-networks, complemented by a new loss function\ndesigned to encourage diversity. Our method efficiently builds a sub-model\nensemble with high diversity, leading to well-calibrated estimates of model\nuncertainty, all achieved with minimal computational overhead compared to\ntraditional deep self-supervised ensembles. To evaluate the effectiveness of\nour approach, we conducted extensive experiments across various tasks,\nincluding in-distribution generalization, out-of-distribution detection,\ndataset corruption, and semi-supervised settings. The results demonstrate that\nour method significantly improves prediction reliability. Our approach not only\nachieves excellent accuracy but also enhances calibration, surpassing baseline\nperformance across a wide range of self-supervised architectures in computer\nvision, natural language processing, and genomics data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:58:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vahidi","Amirhossein",""],["Wimmer","Lisa",""],["G\u00fcnd\u00fcz","H\u00fcseyin Anil",""],["Bischl","Bernd",""],["H\u00fcllermeier","Eyke",""],["Rezaei","Mina",""]]}
{"id":"2308.14706","submitter":"Siva Mythili Gonuguntla","authors":"Siva Mythili Gonuguntla and Douglas Singleton","title":"Revisiting the Wu-Yang approach to magnetic charge","comments":"11 pages, no figures, revtex-4","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Wu-Yang fiber bundle approach to magnetic charge has an overlooked\nfeature -- a disk-like sheet current density and associated magnetic field at\nthe equator where the Northern hemisphere and Southern hemisphere Dirac string\nvector potentials connect. This disk magnetic field plays a role similar to the\nDirac string in the Dirac approach to magnetic charge. Placing an electric\ncharge near the disk magnetic field gives rise to a non-zero field momentum.\nThis implies that the Wu-Yang construction is not a true magnetic charge -- it\nis a Coulomb magnetic field plus a disk magnetic field and planar current\ndensity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:00:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Gonuguntla","Siva Mythili",""],["Singleton","Douglas",""]]}
{"id":"2308.14707","submitter":"Matthew Lerner-Brecher","authors":"Matthew Lerner-Brecher","title":"On the hard edge limit of the zero temperature Laguerre beta corners\n  process","comments":"36 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the hard edge limit of a multilevel extension of the Laguerre\n$\\beta$-ensemble at zero temperature. In particular, we show that\nasymptotically the ensemble is given by Gaussians with covariance matrix\nexpressible in terms of the Fourier-Bessel series. These Gaussians also have an\nexplicit representation as the partition functions of additive polymers arising\nfrom a random walk on roots of the Bessel functions. Our approach builds off of\nthe one introduced in arxiv:2009.02006 and is rooted in using the theory of\ndual and associated polynomials to diagonalize transition matrices relating\nlevels of the ensemble.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:02:10 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lerner-Brecher","Matthew",""]]}
{"id":"2308.14708","submitter":"Fatemeh Afghah","authors":"Nima Namvar, Fatemeh Afghah, Ismail Guvenc","title":"Heterogeneous Drone Small Cells: Optimal 3D Placement for Downlink Power\n  Efficiency and Rate Satisfaction","comments":"12 pages, 7 figures. arXiv admin note: text overlap with\n  arXiv:1804.08415 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.SY eess.SY math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider a heterogeneous repository of drone-enabled aerial\nbase stations with varying transmit powers that provide downlink wireless\ncoverage for ground users. One particular challenge is optimal selection and\ndeployment of a subset of available drone base stations (DBSs) to satisfy the\ndownlink data rate requirements while minimizing the overall power consumption.\nIn order to address this challenge, we formulate an optimization problem to\nselect the best subset of available DBSs so as to guarantee wireless coverage\nwith some acceptable transmission rate in the downlink path. In addition to the\nselection of DBSs, we determine their 3D position so as to minimize their\noverall power consumption. Moreover, assuming that the DBSs operate in the same\nfrequency band, we develop a novel and computationally efficient beamforming\nmethod to alleviate the inter-cell interference impact on the downlink. We\npropose a Kalai-Smorodinsky bargaining solution to determine the optimal\nbeamforming strategy in the downlink path to compensate for the impairment\ncaused by the interference. Simulation results demonstrate the effectiveness of\nthe proposed solution and provide valuable insights into the performance of the\nheterogeneous drone-based small cell networks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:08:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Namvar","Nima",""],["Afghah","Fatemeh",""],["Guvenc","Ismail",""]]}
{"id":"2308.14709","submitter":"Rachel Bowens-Rubin","authors":"Rachel Bowens-Rubin, Arjo Bos, Philip Hinz, Bradford Holden, Matt\n  Radovan","title":"An adaptive optics upgrade for the Automated Planet Finder Telescope\n  using an adaptive secondary mirror","comments":null,"journal-ref":"Proceedings of the SPIE, Volume 12185, id. 121851X 15 pp. (2022)","doi":"10.1117/12.2627183","report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As we enter the era of TESS and JWST, instrumentation that can carry out\nradial velocity measurements of exoplanet systems is in high demand. We will\naddress this demand by upgrading the UC Lick Observatory's 2.4-meter Automated\nPlanet Finder (APF) telescope with an adaptive optics (AO) system. The AO\nupgrade will be directly integrated into the APF telescope by replacing the\ntelescope's static secondary mirror with a 61-actuator adaptive secondary\nmirror (ASM) to minimize the disturbance to the spectrograph optics. This\nupgrade is enabled by The Netherlands Organization for Applied Scientific\nResearch's (TNO) large-format deformable mirror technology, which will be\nconstructed using a new style of high-efficiency hybrid-variable reluctance\nactuator. We outline the technical design and manufacturing plan for the\nproposed APF AO upgrade and simulate the improvement to the science yield using\nHCIpy. Our simulations predict the AO upgrade will reduce the PSF instabilities\ndue to atmospheric turbulence, concentrating the light on the spectrograph slit\nby a multiplicative factor of more than two (doubling the telescope's observing\nefficiency) for targets as dim as I = 14. When completed, the APF adaptive\nsecondary mirror will be among the first pairings of an ASM with a radial\nvelocity spectrograph and become a pathfinder for similar AO systems in\ntelescopes of all sizes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:09:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bowens-Rubin","Rachel",""],["Bos","Arjo",""],["Hinz","Philip",""],["Holden","Bradford",""],["Radovan","Matt",""]]}
{"id":"2308.14710","submitter":"Xudong Wang","authors":"Xudong Wang and Ishan Misra and Ziyun Zeng and Rohit Girdhar and\n  Trevor Darrell","title":"VideoCutLER: Surprisingly Simple Unsupervised Video Instance\n  Segmentation","comments":"Preprint. Code: https://github.com/facebookresearch/CutLER","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing approaches to unsupervised video instance segmentation typically\nrely on motion estimates and experience difficulties tracking small or\ndivergent motions. We present VideoCutLER, a simple method for unsupervised\nmulti-instance video segmentation without using motion-based learning signals\nlike optical flow or training on natural videos. Our key insight is that using\nhigh-quality pseudo masks and a simple video synthesis method for model\ntraining is surprisingly sufficient to enable the resulting video model to\neffectively segment and track multiple instances across video frames. We show\nthe first competitive unsupervised learning results on the challenging\nYouTubeVIS-2019 benchmark, achieving 50.7% APvideo^50 , surpassing the previous\nstate-of-the-art by a large margin. VideoCutLER can also serve as a strong\npretrained model for supervised video instance segmentation tasks, exceeding\nDINO by 15.9% on YouTubeVIS-2019 in terms of APvideo.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:10:12 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Xudong",""],["Misra","Ishan",""],["Zeng","Ziyun",""],["Girdhar","Rohit",""],["Darrell","Trevor",""]]}
{"id":"2308.14711","submitter":"Peter Belcak","authors":"Peter Belcak and Roger Wattenhofer","title":"Fast Feedforward Networks","comments":"12 pages, 6 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.PF","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We break the linear link between the layer size and its inference cost by\nintroducing the fast feedforward (FFF) architecture, a logarithmic-time\nalternative to feedforward networks.\n  We show that FFFs give comparable performance to feedforward networks at an\nexponential fraction of their inference cost, are quicker to deliver\nperformance compared to mixture-of-expert networks, and can readily take the\nplace of either in transformers.\n  Pushing FFFs to the absolute limit, we train a vision transformer to perform\nsingle-neuron inferences at the cost of only 5.8% performance decrease against\nthe full-width variant.\n  Our implementation is available as a Python package; just use \"pip install\nfastfeedforward\".\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:11:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Belcak","Peter",""],["Wattenhofer","Roger",""]]}
{"id":"2308.14712","submitter":"Isabella Giovannelli","authors":"Lei Chen, Isabella L. Giovannelli, Nadav Shaibe, and Steven M. Anlage","title":"Loss of Detailed Balance in Equilibrium due to Partial Quantum\n  Decoherence: A Quantum Graph Analogue","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.other nlin.CD physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the physics of quantum systems that suffer from partial\ndecoherence, in the intermediate range between coherent quantum evolution and\nincoherent classical physics. It has been predicted that new physics and\ntechnology are enabled in this intermediate regime. In particular we explore\nthe asymmetric transmission through an Aharonov-Bohm (AB) ring that supports a\n3:1 asymmetry in transmission times, augmented with de-phasing features that\nact preferentially on the longer-lingering quantum waves. Such a device is\nrealized as a microwave analogue quantum graph utilizing a gyrator to create\nthe 3:1 transmission time delay asymmetry, along with both homogeneous and\nlocalized losses to mimic the effects of de-phasing in the analogous mesoscopic\nelectron system. Measurements and simulations of this device demonstrate the\nrequired non-reciprocal transmission time delay, as well as an asymmetry in\ntransmission probability. The measurements and simulations are performed in\nboth the frequency domain, and in the time domain using wave packets. We\ndemonstrate asymmetric transmission through the AB-ring graph as a function of\nloss/de-phasing in both simulation and experiment, in both the frequency- and\ntime-domains, and compare to expectations for the corresponding quantum system.\nThe results are consistent with the hypothesis that the transmission asymmetry\nand loss of detailed balance is an equilibrium property of the analogous\nmesoscopic quantum graph.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:11:56 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Lei",""],["Giovannelli","Isabella L.",""],["Shaibe","Nadav",""],["Anlage","Steven M.",""]]}
{"id":"2308.14713","submitter":"Aron Schmied","authors":"Aron Schmied, Tobias Fischer, Martin Danelljan, Marc Pollefeys, Fisher\n  Yu","title":"R3D3: Dense 3D Reconstruction of Dynamic Scenes from Multiple Cameras","comments":"Accepted to ICCV 2023. Project page is available at\n  https://www.vis.xyz/pub/r3d3/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dense 3D reconstruction and ego-motion estimation are key challenges in\nautonomous driving and robotics. Compared to the complex, multi-modal systems\ndeployed today, multi-camera systems provide a simpler, low-cost alternative.\nHowever, camera-based 3D reconstruction of complex dynamic scenes has proven\nextremely difficult, as existing solutions often produce incomplete or\nincoherent results. We propose R3D3, a multi-camera system for dense 3D\nreconstruction and ego-motion estimation. Our approach iterates between\ngeometric estimation that exploits spatial-temporal information from multiple\ncameras, and monocular depth refinement. We integrate multi-camera feature\ncorrelation and dense bundle adjustment operators that yield robust geometric\ndepth and pose estimates. To improve reconstruction where geometric depth is\nunreliable, e.g. for moving objects or low-textured regions, we introduce\nlearnable scene priors via a depth refinement network. We show that this design\nenables a dense, consistent 3D reconstruction of challenging, dynamic outdoor\nenvironments. Consequently, we achieve state-of-the-art dense depth prediction\non the DDAD and NuScenes benchmarks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:13:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Schmied","Aron",""],["Fischer","Tobias",""],["Danelljan","Martin",""],["Pollefeys","Marc",""],["Yu","Fisher",""]]}
{"id":"2308.14714","submitter":"Yohan John","authors":"Yohan John, Gilberto Diaz-Garcia, Xiaoming Duan, Jason R. Marden,\n  Francesco Bullo","title":"A Stochastic Surveillance Stackelberg Game: Co-Optimizing Defense\n  Placement and Patrol Strategy","comments":"8 pages, 1 figure, jointly submitted to the IEEE Control Systems\n  Letters and the 2024 American Control Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic patrol routing is known to be advantageous in adversarial\nsettings; however, the optimal choice of stochastic routing strategy is\ndependent on a model of the adversary. Duan et al. formulated a Stackelberg\ngame for the worst-case scenario, i.e., a surveillance agent confronted with an\nomniscient attacker [IEEE TCNS, 8(2), 769-80, 2021]. In this article, we extend\ntheir formulation to accommodate heterogeneous defenses at the various nodes of\nthe graph. We derive an upper bound on the value of the game. We identify\nmethods for computing effective patrol strategies for certain classes of\ngraphs. Finally, we leverage the heterogeneous defense formulation to develop\nnovel defense placement algorithms that complement the patrol strategies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:14:16 GMT"}],"update_date":"2023-08-29","authors_parsed":[["John","Yohan",""],["Diaz-Garcia","Gilberto",""],["Duan","Xiaoming",""],["Marden","Jason R.",""],["Bullo","Francesco",""]]}
{"id":"2308.14715","submitter":"Ethan Levien","authors":"Ethan Levien","title":"Coalescent processes emerging from large deviations in offspring numbers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.PE cond-mat.stat-mech","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The classical model for the genealogies of a neutrally evolving population in\na fixed is environment is due to Kingman. Kingman's coalescent process, which\nproduces a binary tree, universally emerges from many microscopic models in\nwhich the variance in the number of offspring is finite. It is understood that\npower-law offspring distributions with infinite variance can result in a very\ndifferent type of coalescent structure with merging of more than two lineages.\nHere we investigate the regime where the variance of the offspring distribution\nis finite but comparable to the population size. This is achieved by studying a\nmodel in which the logarithm offspring sizes has a stretched exponential form.\nSuch offspring distributions are motivated by biology, where they emerges from\na toy model of growth in a heterogenous environment, but also mathematics and\nstatistical physics, where limit theorems and phase transitions for sums over\nrandom exponentials have seen considerable attention due to their appearance in\nthe partition function of the Random Energy Model (REM). We find that the limit\ncoalescent is a $\\beta$-coalescent -- a previously studied model emerging from\nevolutionary dynamics models with heavy-tailed offspring distributions. We also\ndiscuss the interpretation of these results in terms of the REM.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:15:54 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Levien","Ethan",""]]}
{"id":"2308.14716","submitter":"Ephraim Linder","authors":"Jane Lange, Ephraim Linder, Sofya Raskhodnikova, Arsen Vasilyan","title":"Local Lipschitz Filters for Bounded-Range Functions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study local filters for the Lipschitz property of real-valued functions\n$f: V \\to [0,r]$, where the Lipschitz property is defined with respect to an\narbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz\nfilters both with respect to $\\ell_1$ distance and $\\ell_0$ distance. Previous\nwork only considered unbounded-range functions over $[n]^d$. Jha and\nRaskhodnikova (SICOMP `13) gave an algorithm for such functions with lookup\ncomplexity exponential in $d$, which Awasthi et al.\\ (ACM Trans. Comput.\nTheory) showed was necessary in this setting. By considering the natural class\nof functions whose range is bounded in $[0,r]$, we circumvent this lower bound\nand achieve running time $(d^r\\log n)^{O(\\log r)}$ for the $\\ell_1$-respecting\nfilter and $d^{O(r)}\\text{polylog }n$ for the $\\ell_0$-respecting filter for\nfunctions over $[n]^d$. Furthermore, we show that our algorithms are nearly\noptimal in terms of the dependence on $r$ for the domain $\\{0,1\\}^d$, an\nimportant special case of the domain $[n]^d$. In addition, our lower bound\nresolves an open question of Awasthi et al., removing one of the conditions\nnecessary for their lower bound for general range. We prove our lower bound via\na reduction from distribution-free Lipschitz testing. Finally, we provide two\napplications of our local filters. First, they can be used in conjunction with\nthe Laplace mechanism for differential privacy to provide filter mechanisms for\nprivately releasing outputs of black box functions even in the presence of\nmalicious clients. Second, we use them to obtain the first tolerant testers for\nthe Lipschitz property.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:16:37 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lange","Jane",""],["Linder","Ephraim",""],["Raskhodnikova","Sofya",""],["Vasilyan","Arsen",""]]}
{"id":"2308.14717","submitter":"Anant Shah","authors":"Krishna Dasaratha, Benjamin Golub and Anant Shah","title":"Equity Pay In Networked Teams","comments":"37 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A group of agents each exert effort to produce a joint output, with the\ncomplementarities between their efforts represented by a (weighted) network.\nUnder equity compensation, a principal motivates the agents to work by giving\nthem shares of the output. We describe the optimal equity allocation. It is\ncharacterized by a neighborhood balance condition: any two agents receiving\nequity have the same (weighted) total equity assigned to their neighbors. We\nalso study the problem of selecting the team of agents who receive positive\nequity, and show this team must form a tight-knit subset of the complementarity\nnetwork, with any pair being complementary to one another or jointly to another\nteam member. Finally, we give conditions under which the amount of equity used\nfor compensation is increasing in the strength of a team's complementarities\nand discuss several other applications.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:17:57 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dasaratha","Krishna",""],["Golub","Benjamin",""],["Shah","Anant",""]]}
{"id":"2308.14718","submitter":"Jos\\'e De Ram\\'on","authors":"Maria Papageorgiou, Jose de Ramon, Charis Anastopoulos","title":"Particle-field duality in QFT measurements","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pointlike systems coupled to quantum fields are often employed as toy models\nfor measurements in quantum field theory. In this paper, we identify the field\nobservables recorded by such models. We show that in models that work in the\nstrong coupling regime, the apparatus is correlated with smeared field\namplitudes, while in models that work in weak coupling the apparatus records\nparticle aspects of the field, such as the existence of a particle-like time of\narrival and resonant absorption. Then, we develop an improved field-detector\ninteraction model, adapting the formalism of Quantum Brownian motion, that is\nexactly solvable. This model confirms the association of field and particle\nproperties in the strong and weak coupling regimes, respectively. Further, it\ncan also describe the intermediate regime, in which the field-particle\ncharacteristics `merge'. In contrast to standard perturbation techniques, this\nmodel also recovers the relativistic Breit-Wigner resonant behavior in the weak\ncoupling regime. The modulation of field-particle-duality by a single tunable\nparameter is a novel feature that is, in principle, experimentally accessible.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:18:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Papageorgiou","Maria",""],["de Ramon","Jose",""],["Anastopoulos","Charis",""]]}
{"id":"2308.14719","submitter":"Gal Elgavish","authors":"Gal Elgavish","title":"Hierarchical Time Series Forecasting with Bayesian Modeling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We encounter time series data in many domains such as finance, physics,\nbusiness, and weather. One of the main tasks of time series analysis, one that\nhelps to take informed decisions under uncertainty, is forecasting. Time series\nare often hierarchically structured, e.g., a company sales might be broken down\ninto different regions, and each region into different stores. In some cases\nthe number of series in the hierarchy is too big to fit in a single model to\nproduce forecasts in relevant time, and a decentralized approach is beneficial.\n  One way to do this is to train independent forecasting models for each series\nand for some summary statistics series implied by the hierarchy (e.g. the sum\nof all series) and to pass those models to a reconciliation algorithm to\nimprove those forecasts by sharing information between the series.\n  In this work we focus on the reconciliation step, and propose a method to do\nso from a Bayesian perspective - Bayesian forecast reconciliation. We also\ndefine the common case of linear Gaussian reconciliation, where the forecasts\nare Gaussian and the hierarchy has linear structure, and show that we can\ncompute reconciliation in closed form. We evaluate these methods on synthetic\nand real data sets, and compare them to other work in this field.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:20:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Elgavish","Gal",""]]}
{"id":"2308.14720","submitter":"Mihailo \\v{C}ubrovi\\'c","authors":"Dragan Markovi\\'c and Mihailo \\v{C}ubrovi\\'c","title":"Chaos and anomalous transport in a semiclassical Bose-Hubbard chain","comments":"23 pages, 17 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.quant-gas cond-mat.stat-mech nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study chaotic dynamics and anomalous transport in a Bose-Hubbard chain in\nthe semiclassical regime (the limit when the number of particles goes to\ninfinity). We find that the system has mixed phase space with both regular and\nchaotic dynamics, even for long chains with up to hundred wells. The\nconsequence of the mixed phase space is strongly anomalous diffusion in the\nspace of occupation numbers, with a discrete set of transport exponents. After\nvery long times the system crosses over to the hydrodynamic regime with normal\ndiffusion. Anomalous transport is quite universal, almost completely\nindependent of the parameters of the model (Coulomb interaction, chemical\npotential): it is mainly determined by the initial distribution of particles\nalong the chain. We corroborate our findings by analytical arguments: scaling\nanalysis for the anomalous regime and the Langevin equation for the normal\ndiffusion regime.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:23:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Markovi\u0107","Dragan",""],["\u010cubrovi\u0107","Mihailo",""]]}
{"id":"2308.14721","submitter":"Jayadev Vijayan","authors":"Jayadev Vijayan, Johannes Piotrowski, Carlos Gonzalez-Ballestero,\n  Kevin Weber, Oriol Romero-Isart and Lukas Novotny","title":"Cavity-mediated long-range interactions in levitated optomechanics","comments":"7 pages, 4 figures, 4 pages in Supplementary, 3 figures in\n  Supplementary","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The ability to engineer cavity-mediated interactions has emerged as a\npowerful tool for the generation of non-local correlations and the\ninvestigation of non-equilibrium phenomena in many-body systems. Levitated\noptomechanical systems have recently entered the multi-particle regime, with\npromise for using arrays of massive strongly coupled oscillators for exploring\ncomplex interacting systems and sensing. Here, by combining advances in\nmulti-particle optical levitation and cavity-based quantum control, we\ndemonstrate, for the first time, programmable cavity-mediated interactions\nbetween nanoparticles in vacuum. The interaction is mediated by photons\nscattered by spatially separated particles in a cavity, resulting in strong\ncoupling ($G_\\text{zz}/\\Omega_\\text{z} = 0.238\\pm0.005$) that does not decay\nwith distance within the cavity mode volume. We investigate the scaling of the\ninteraction strength with cavity detuning and inter-particle separation, and\ndemonstrate the tunability of interactions between different mechanical modes.\nOur work paves the way towards exploring many-body effects in nanoparticle\narrays with programmable cavity-mediated interactions, generating entanglement\nof motion, and using interacting particle arrays for optomechanical sensing.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:24:23 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vijayan","Jayadev",""],["Piotrowski","Johannes",""],["Gonzalez-Ballestero","Carlos",""],["Weber","Kevin",""],["Romero-Isart","Oriol",""],["Novotny","Lukas",""]]}
{"id":"2308.14722","submitter":"Gil Goldman PhD","authors":"Gil Goldman, Yosef Yomdin","title":"higher derivatives of functions with given critical points and values","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $f: B^n \\rightarrow {\\mathbb R}$ be a $d+1$ times continuously\ndifferentiable function on the unit ball $B^n$, with $\\max_{z\\in B^n}\n\\|f(z)\\|=1$. A well-known fact is that if $f$ vanishes on a set $Z\\subset B^n$\nwith a non-empty interior, then for each $k=1,\\ldots,d+1$ the norm of the\n$k$-th derivative $\\|f^{(k)}\\|$ is at least $M=M(n,k)>0$. A natural question to\nask is ``what happens for other sets $Z$?''. This question was partially\nanswered in [16]-[18]. In the present paper we ask for a similar (and closely\nrelated) question: what happens with the high-order derivatives of $f$, if its\ngradient vanishes on a given set $\\Sigma$? And what conclusions for the\nhigh-order derivatives of $f$ can be obtained from the analysis of the metric\ngeometry of the ``critical values set'' $f(\\Sigma)$? In the present paper we\nprovide some initial answers to these questions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:24:49 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Goldman","Gil",""],["Yomdin","Yosef",""]]}
{"id":"2308.14723","submitter":"Satoshi Izumoto","authors":"Satoshi Izumoto","title":"Oscillating reaction in porous media under saddle flow","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn nlin.PS physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Pattern formation due to oscillating reactions represents variable natural\nand engineering systems, but previous studies employed only simple flow\nconditions such as uniform flow and Poiseuille flow. We studied the oscillating\nreaction in porous media, where dispersion enhanced the spreading of diffusing\ncomponents by merging and splitting flow channels. We considered the saddle\nflow, where the stretching rate is constant everywhere. We generated patterns\nwith the Brusselator system and classified them by instability conditions and\nP\\'eclet number (Pe), which was defined by the stretching rate. The results\nshowed that each pattern formation was controlled by the stagnation point and\nstable and unstable manifolds of the flow field due to the heterogeneous flow\nfields and the resulting heterogeneous dispersion fields. The characteristics\nof the patterns, such as the position of stationary waves parallel to the\nunstable manifold and the size of local stationary patterns around the\nstagnation point, were also controlled by Pe.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:26:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Izumoto","Satoshi",""]]}
{"id":"2308.14724","submitter":"Hyunuk Kim","authors":"Jennifer JooYeon Lee, Hyunuk Kim","title":"Conceptual articles may disrupt the field of marketing but continue to\n  decline in numbers: Evidence from a GPT-assisted study","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The present paper addresses if and how an article's academic impact varies by\nknowledge development approaches. Specifically, it classifies conceptual and\nempirical articles published in four marketing journals - Journal of Marketing,\nJournal of Marketing Research, Journal of Consumer Research, and Marketing\nScience - with the aid of a large language model, GPT. The Kolmogorov-Smirnov\n(KS) test is implemented for each journal to compare the disruption scores of\nconceptual and empirical articles. The results show that conceptual research is\nmore likely to disrupt the field of marketing while it tends to decline in its\npublication quantity. Our paper highlights the importance of conceptual\narticles and contributes to the understanding of how marketing articles are\ndeveloped and disseminated to advance knowledge.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:29:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Lee","Jennifer JooYeon",""],["Kim","Hyunuk",""]]}
{"id":"2308.14725","submitter":"Delaram Kahrobaei","authors":"Mar\\'ia Isabel Gonz\\'alez Vasco and Delaram Kahrobaei and Eilidh\n  McKemmie","title":"Applications of Finite non-Abelian Simple Groups to Cryptography in the\n  Quantum Era","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The theory of finite simple groups is a (rather unexplored) area likely to\nprovide interesting computational problems and modelling tools useful in a\ncryptographic context. In this note, we review some applications of finite\nnon-abelian simple groups to cryptography and discuss different scenarios in\nwhich this theory is clearly central, providing the relevant definitions to\nmake the material accessible to both cryptographers and group theorists, in the\nhope of stimulating further interaction between these two (non-disjoint)\ncommunities. In particular, we look at constructions based on various\ngroup-theoretic factorization problems, review group theoretical hash\nfunctions, and discuss fully homomorphic encryption using simple groups. The\nHidden Subgroup Problem is also briefly discussed in this context.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:30:00 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Vasco","Mar\u00eda Isabel Gonz\u00e1lez",""],["Kahrobaei","Delaram",""],["McKemmie","Eilidh",""]]}
{"id":"2308.14726","submitter":"Zhen Xing","authors":"Zhixin Ling, Zhen Xing, Xiangdong Zhou, Manliang Cao, Guichun Zhou","title":"PanoSwin: a Pano-style Swin Transformer for Panorama Understanding","comments":"CVPR 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In panorama understanding, the widely used equirectangular projection (ERP)\nentails boundary discontinuity and spatial distortion. It severely deteriorates\nthe conventional CNNs and vision Transformers on panoramas. In this paper, we\npropose a simple yet effective architecture named PanoSwin to learn panorama\nrepresentations with ERP. To deal with the challenges brought by\nequirectangular projection, we explore a pano-style shift windowing scheme and\nnovel pitch attention to address the boundary discontinuity and the spatial\ndistortion, respectively. Besides, based on spherical distance and Cartesian\ncoordinates, we adapt absolute positional embeddings and relative positional\nbiases for panoramas to enhance panoramic geometry information. Realizing that\nplanar image understanding might share some common knowledge with panorama\nunderstanding, we devise a novel two-stage learning framework to facilitate\nknowledge transfer from the planar images to panoramas. We conduct experiments\nagainst the state-of-the-art on various panoramic tasks, i.e., panoramic object\ndetection, panoramic classification, and panoramic layout estimation. The\nexperimental results demonstrate the effectiveness of PanoSwin in panorama\nunderstanding.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:30:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ling","Zhixin",""],["Xing","Zhen",""],["Zhou","Xiangdong",""],["Cao","Manliang",""],["Zhou","Guichun",""]]}
{"id":"2308.14727","submitter":"Sally Dong","authors":"Sally Dong and Guanghao Ye","title":"Faster Min-Cost Flow on Bounded Treewidth Graphs","comments":"16 pages. arXiv admin note: text overlap with arXiv:2205.01562","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a $\\widetilde{O}(m\\sqrt{\\tau}+n\\tau)$ time algorithm for finding a\nminimum-cost flow in graphs with $n$ vertices and $m$ edges, given a tree\ndecomposition of width $\\tau$ and polynomially bounded integer costs and\ncapacities. This improves upon the current best algorithms for general linear\nprograms bounded by treewidth which run in $\\widetilde{O}(m\n\\tau^{(\\omega+1)/2})$ time by [Dong-Lee-Ye,21] and [Gu-Song,22], where $\\omega\n\\approx 2.37$ is the matrix multiplication exponent. Our approach leverages\nrecent advances in structured linear program solvers and robust interior point\nmethods.\n  As a corollary, for any graph $G$ with $n$ vertices, $m$ edges, and treewidth\n$\\tau$, we obtain a $\\widetilde{O}(\\tau^3 \\cdot m)$ time algorithm to compute a\ntree decomposition of $G$ with width $O(\\tau \\cdot \\log n)$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:30:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Dong","Sally",""],["Ye","Guanghao",""]]}
{"id":"2308.14728","submitter":"Liuquan Wang","authors":"Boxue Wang and Liuquan Wang","title":"Proofs of Mizuno's Conjectures on Generalized Rank Two Nahm Sums","comments":"30 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, Mizuno studied generalized Nahm sums associated with symmetrizable\nmatrices. He provided 14 sets of candidates of modular Nahm sums in rank two\nand justified four of them. We prove the modularity for eight other sets of\ncandidates and present conjectural formulas for the remaining two sets of\ncandidates. This is achieved by finding Rogers-Ramanujan type identities\nassociated with these Nahm sums. We also prove Mizuno's conjectural modular\ntransformation formula for a vector-valued function consists of Nahm sums.\nMeanwhile, we find some new non-modular identities for some other Nahm sums\nassociated with the matrices in Mizuno's candidates.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:31:39 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Wang","Boxue",""],["Wang","Liuquan",""]]}
{"id":"2308.14729","submitter":"Niccol\\`o Bigagli","authors":"Niccol\\`o Bigagli, Daniel W. Savin, Sebastian Will","title":"Laser Scheme for Doppler Cooling of the Hydroxyl Cation (OH$^+$)","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.atm-clus physics.chem-ph quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on a cycling scheme for Doppler cooling of trapped OH$^+$ ions\nusing transitions between the electronic ground state $X^3\\Sigma^-$ and the\nfirst excited triplet state $A^3\\Pi$. We have identified relevant transitions\nfor photon cycling and repumping, have found that coupling into other\nelectronic states is strongly suppressed, and have calculated the number of\nphoton scatterings required to cool OH$^+$ to a temperature where Raman\nsideband cooling can take over. In contrast to the standard approach, where\nmolecular ions are sympathetically cooled, our scheme does not require\nco-trapping of another species and opens the door to the creation of pure\nsamples of cold molecular ions with potential applications in quantum\ninformation, quantum chemistry, and astrochemistry. The laser cooling scheme\nidentified for OH$^+$ is efficient despite the absence of near-diagonal\nFranck-Condon factors, suggesting that broader classes of molecules and\nmolecular ions are amenable to laser cooling than commonly assumed.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:32:44 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Bigagli","Niccol\u00f2",""],["Savin","Daniel W.",""],["Will","Sebastian",""]]}
{"id":"2308.14730","submitter":"Graciana Puentes","authors":"G. Puentes","title":"Spectral Characterization of Optical Aberrations in Fluidic Lenses","comments":"15 pages, 9 figures, 1 table. arXiv admin note: text overlap with\n  arXiv:1710.04074","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report a complete numerical study and supporting experimental results on\nthe spectral characterization of optical aberrations in macroscopic fluidic\nlenses with tunable focal distance and aperture shape. Using a Shack-Hartmann\nwave-front sensor we experimentally reconstruct the near-field wave-front\ntransmitted by the fluidic lenses, and we characterize the chromatic\naberrations in terms of Zernike polynomials in the visible range. Moreover, we\nfurther classify the spectral response of the lenses using clustering\ntechniques, in addition to correlation and convolution measurements.\nExperimental results are in agreement with our theoretical model of the\nnon-linear deformation of thin ellastic membranes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:33:41 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Puentes","G.",""]]}
{"id":"2308.14731","submitter":"Chia-Yi Su","authors":"Chia-Yi Su and Collin McMillan","title":"Distilled GPT for Source Code Summarization","comments":"15 pages + 3 figures + 5 references. Preprint In Review Aug. 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  A code summary is a brief natural language description of source code.\nSummaries are usually only a single sentence long, and yet form the backbone of\ndeveloper documentation. A short descriptions such as \"changes all visible\npolygons to the color blue\" can give a programmer a high-level idea of what\ncode does without the effort of reading the code itself. Recently, products\nbased on Large Language Models such as ChatGPT have demonstrated a strong\nability to write these descriptions automatically. However, to use these tools,\nprogrammers must send their code to untrusted third parties for processing\n(e.g., via an API call). This loss of custody is not acceptable to many\norganizations. In this paper, we present an alternative: we train an open\nsource model using sample output generated by GPT-3.5 in a process related to\nknowledge distillation. Our model is small enough (350m parameters) to be run\non a single 16gb GPU, yet we show in our evaluation that it is large enough to\nmimic GPT-3.5 on this task.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:34:07 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Su","Chia-Yi",""],["McMillan","Collin",""]]}
{"id":"2308.14732","submitter":"Renato Krohling","authors":"Renato A. Krohling","title":"Bayesian artificial brain with ChatGPT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper aims to investigate the mathematical problem-solving capabilities\nof Chat Generative Pre-Trained Transformer (ChatGPT) in case of Bayesian\nreasoning. The study draws inspiration from Zhu & Gigerenzer's research in\n2006, which posed the question: Can children reason the Bayesian way? In the\npursuit of answering this question, a set of 10 Bayesian reasoning problems\nwere presented. The results of their work revealed that children's ability to\nreason effectively using Bayesian principles is contingent upon a\nwell-structured information representation. In this paper, we present the same\nset of 10 Bayesian reasoning problems to ChatGPT. Remarkably, the results\ndemonstrate that ChatGPT provides the right solutions to all problems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:34:24 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Krohling","Renato A.",""]]}
{"id":"2308.14733","submitter":"Samson Zhou","authors":"Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Jelani Nelson, Samson Zhou","title":"Differentially Private Aggregation via Imperfect Shuffling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we introduce the imperfect shuffle differential privacy model,\nwhere messages sent from users are shuffled in an almost uniform manner before\nbeing observed by a curator for private aggregation. We then consider the\nprivate summation problem. We show that the standard split-and-mix protocol by\nIshai et. al. [FOCS 2006] can be adapted to achieve near-optimal utility bounds\nin the imperfect shuffle model. Specifically, we show that surprisingly, there\nis no additional error overhead necessary in the imperfect shuffle model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:34:52 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ghazi","Badih",""],["Kumar","Ravi",""],["Manurangsi","Pasin",""],["Nelson","Jelani",""],["Zhou","Samson",""]]}
{"id":"2308.14734","submitter":"Yifeng Philip Dr","authors":"Yifeng Philip Chen, Edward J. Oughton, Jakub Zagdanski, Maggie Mo Jia,\n  Peter Tyler","title":"Crowdsourced data indicates broadband has a positive impact on local\n  business creation","comments":null,"journal-ref":null,"doi":"10.1016/j.tele.2023.102035","report-no":null,"categories":"econ.GN q-fin.EC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Broadband connectivity is regarded as generally having a positive\nmacroeconomic effect, but we lack evidence as to how it affects key economic\nactivity metrics, such as firm creation, at a very local level. This analysis\nmodels the impact of broadband Next Generation Access (NGA) on new business\ncreation at the local level over the 2011-2015 period in England, United\nKingdom, using high-resolution panel data. After controlling for a range of\nfactors, we find that faster broadband speeds brought by NGA technologies have\na positive effect on the rate of business growth. We find that in England\nbetween 2011-2015, on average a one percentage increase in download speeds is\nassociated with a 0.0574 percentage point increase in the annual growth rate of\nbusiness establishments. The primary hypothesised mechanism behind the\nestimated relationship is the enabling effect that faster broadband speeds have\non innovative business models based on new digital technologies and services.\nEntrepreneurs either sought appropriate locations that offer high quality\nbroadband infrastructure (contributing to new business establishment growth),\nor potentially enjoyed a competitive advantage (resulting in a higher survival\nrate). The findings of this study suggest that aspiring to reach universal high\ncapacity broadband connectivity is economically desirable, especially as the\ncosts of delivering such service decline.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:35:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Yifeng Philip",""],["Oughton","Edward J.",""],["Zagdanski","Jakub",""],["Jia","Maggie Mo",""],["Tyler","Peter",""]]}
{"id":"2308.14735","submitter":"Tsutomu Mori","authors":"Tsutomu Mori and Takashi Kawamura","title":"Equivalence Principle of the $P$-value and Mutual Information","comments":"21 pages, 3 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a novel equivalence between probability theory and\ninformation theory. For a single random variable, Shannon's self-information,\n$I=-\\log {p}$, is an alternative expression of a probability $p$. However, for\ntwo random variables, no information equivalent to the $p$-value has been\nidentified. Here, we prove theorems that demonstrate that mutual information\n(MI) is equivalent to the $p$-value irrespective of prior information about the\ndistribution of the variables. If the maximum entropy principle can be applied,\nour equivalence theorems allow us to readily compute the $p$-value from\nmultidimensional MI. By contrast, in a contingency table of any size with known\nmarginal frequencies, our theorem states that MI asymptotically coincides with\nthe logarithm of the $p$-value of Fisher's exact test, divided by the sample\nsize. Accordingly, the theorems enable us to perform a meta-analysis to\naccurately estimate MI with a low $p$-value, thereby calculating informational\ninterdependence that is robust against sample size variation. Thus, our\ntheorems demonstrate the equivalence of the $p$-value and MI at every\ndimension, use the merits of both, and provide fundamental information for\nintegrating probability theory and information theory.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 08:24:01 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Mori","Tsutomu",""],["Kawamura","Takashi",""]]}
{"id":"2308.14736","submitter":"Sandro Mattarei","authors":"Marina Avitabile and Sandro Mattarei","title":"The Artin-Hasse series and Laguerre polynomials modulo a prime","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For an odd prime $p$, let $\\mathrm{E}_{p}(X)=\\sum_{n=0}^{\\infty}\na_{n}X^{n}\\in\\mathbb{F}_p[[X]]$ denote the reduction modulo $p$ of the\nArtin-Hasse exponential series. It is known that there exists a series\n$G(X^p)\\in \\mathbb{F}_{p}[[X]]$, such that\n$L_{p-1}^{(-T(X))}(X)=\\mathrm{E}_{p}(X)\\cdot G(X^p)$, where\n$T(X)=\\sum_{i=1}^{\\infty}X^{p^{i}}$ and $L_{p-1}^{(\\alpha)}(X)$ denotes the\n(generalized) Laguerre polynomial of degree $p-1$. We prove that\n$G(X^p)=\\sum_{n=0}^{\\infty}(-1)^n a_{np}X^{np}$, and show that it satisfies\n$G(X^p)\\,G(-X^p)\\,T(X)=X^p. $\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:37:03 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Avitabile","Marina",""],["Mattarei","Sandro",""]]}
{"id":"2308.14737","submitter":"Leonid Keselman","authors":"Leonid Keselman, Martial Hebert","title":"Flexible Techniques for Differentiable Rendering with 3D Gaussians","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Fast, reliable shape reconstruction is an essential ingredient in many\ncomputer vision applications. Neural Radiance Fields demonstrated that\nphotorealistic novel view synthesis is within reach, but was gated by\nperformance requirements for fast reconstruction of real scenes and objects.\nSeveral recent approaches have built on alternative shape representations, in\nparticular, 3D Gaussians. We develop extensions to these renderers, such as\nintegrating differentiable optical flow, exporting watertight meshes and\nrendering per-ray normals. Additionally, we show how two of the recent methods\nare interoperable with each other. These reconstructions are quick, robust, and\neasily performed on GPU or CPU. For code and visual examples, see\nhttps://leonidk.github.io/fmb-plus\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:38:31 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Keselman","Leonid",""],["Hebert","Martial",""]]}
{"id":"2308.14738","submitter":"Teng Hu","authors":"Teng Hu, Vikram Khaire, Joseph F. Hennawi, Jose Onorbe, Michael\n  Walther, Zarija Lukic, Frederick Davies","title":"The Impact of the WHIM on the IGM Thermal State Determined from the\n  Low-$z$ Lyman-$\\alpha$ Forest","comments":"23 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  At $z \\lesssim 1$, shock heating caused by large-scale velocity flows and\npossibly violent feedback from galaxy formation, converts a significant\nfraction of the cool gas ($T\\sim 10^4$ K) in the intergalactic medium (IGM)\ninto warm-hot phase (WHIM) with $T >10^5$K, resulting in a significant\ndeviation from the previously tight power-law IGM temperature-density\nrelationship, $T=T_0 (\\rho / {\\bar{\\rho}})^{\\gamma -1}$. This study explores\nthe impact of the WHIM on measurements of the low-$z$ IGM thermal state,\n$[T_0,\\gamma]$, based on the $b$-$N_{H I}$ distribution of the Lyman-$\\alpha$\nforest. Exploiting a machine learning-enabled simulation-based inference method\ntrained on Nyx hydrodynamical simulations, we demonstrate that [$T_0$,\n$\\gamma$] can still be reliably measured from the $b$-$N_{H I}$ distribution at\n$z=0.1$, notwithstanding the substantial WHIM in the IGM. To investigate the\neffects of different feedback, we apply this inference methodology to mock\nspectra derived from the IllustrisTNG and Illustris simulations at $z=0.1$. The\nresults suggest that the underlying $[T_0,\\gamma]$ of both simulations can be\nrecovered with biases as low as $|\\Delta \\log(T_0/\\text{K})| \\lesssim 0.05$\ndex, $|\\Delta \\gamma | \\lesssim 0.1$, smaller than the precision of a typical\nmeasurement. Given the large differences in the volume-weighted WHIM fractions\nbetween the three simulations (Illustris 38\\%, IllustrisTNG 10\\%, Nyx 4\\%) we\nconclude that the $b$-$N_{H I}$ distribution is not sensitive to the WHIM under\nrealistic conditions. Finally, we investigate the physical properties of the\ndetectable Lyman-$\\alpha$ absorbers, and discover that although their $T$ and\n$\\Delta$ distributions remain mostly unaffected by feedback, they are\ncorrelated with the photoionization rate used in the simulation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:40:21 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Hu","Teng",""],["Khaire","Vikram",""],["Hennawi","Joseph F.",""],["Onorbe","Jose",""],["Walther","Michael",""],["Lukic","Zarija",""],["Davies","Frederick",""]]}
{"id":"2308.14739","submitter":"Nikita Puchkin","authors":"Nikita Puchkin, Fedor Noskov, and Vladimir Spokoiny","title":"Sharper dimension-free bounds on the Frobenius distance between sample\n  covariance and its expectation","comments":"39 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study properties of a sample covariance estimate $\\widehat \\Sigma =\n(\\mathbf{X}_1 \\mathbf{X}_1^\\top + \\ldots + \\mathbf{X}_n \\mathbf{X}_n^\\top) /\nn$, where $\\mathbf{X}_1, \\dots, \\mathbf{X}_n$ are i.i.d. random elements in\n$\\mathbb R^d$ with $\\mathbb E \\mathbf{X}_1 = \\mathbf{0}$, $\\mathbb E\n\\mathbf{X}_1 \\mathbf{X}_1^\\top = \\Sigma$. We derive dimension-free bounds on\nthe squared Frobenius norm of $(\\widehat\\Sigma - \\Sigma)$ under reasonable\nassumptions. For instance, we show that $| \\|\\widehat\\Sigma - \\Sigma\\|_{\\rm\nF}^2 - \\mathbb E \\|\\widehat\\Sigma - \\Sigma\\|_{\\rm F}^2| = \\mathcal\nO({\\rm{Tr}}(\\Sigma^2) / n)$ with overwhelming probability, which is a\nsignificant improvement over the existing results. This leads to a bound the\nratio $\\|\\widehat\\Sigma - \\Sigma\\|_{\\rm F}^2 / \\mathbb E \\|\\widehat\\Sigma -\n\\Sigma\\|_{\\rm F}^2$ with a sharp leading constant when the effective rank\n$\\mathtt{r}(\\Sigma) = {\\rm Tr}(\\Sigma) / \\|\\Sigma\\|$ and $n /\n\\mathtt{r}(\\Sigma)^6$ tend to infinity: $\\|\\widehat\\Sigma - \\Sigma\\|_{\\rm F}^2\n/ \\mathbb E \\|\\widehat\\Sigma - \\Sigma\\|_{\\rm F}^2 = 1 + \\mathcal O(1 /\n\\mathtt{r}(\\Sigma))$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:41:13 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Puchkin","Nikita",""],["Noskov","Fedor",""],["Spokoiny","Vladimir",""]]}
{"id":"2308.14740","submitter":"Bowei Chen","authors":"Bowei Chen, Brian Curless, Ira Kemelmacher-Shlizerman, Steve Seitz","title":"Total Selfie: Generating Full-Body Selfies","comments":"Project page:\n  https://homes.cs.washington.edu/~boweiche/project_page/totalselfie/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.GR cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a method to generate full-body selfies -- photos that you take of\nyourself, but capturing your whole body as if someone else took the photo of\nyou from a few feet away. Our approach takes as input a pre-captured video of\nyour body, a target pose photo, and a selfie + background pair for each\nlocation. We introduce a novel diffusion-based approach to combine all of this\ninformation into high quality, well-composed photos of you with the desired\npose and background.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:41:14 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Chen","Bowei",""],["Curless","Brian",""],["Kemelmacher-Shlizerman","Ira",""],["Seitz","Steve",""]]}
{"id":"2308.14741","submitter":"Fabio Di Troia","authors":"Yuvaray Athur Raghuvir, Senthil Govindarajan, Sanjeevi Vijayakumar,\n  Pradeep Yadlapalli, Fabio Di Troia","title":"Advancement on Security Applications of Private Intersection Sum\n  Protocol","comments":"15 pages, 2 figures, conference proceeding","journal-ref":"Proceedings of the Future Technologies Conference (FTC) 2021,\n  Volume 3. Springer International Publishing, 2022","doi":null,"report-no":null,"categories":"cs.CR cs.NI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Secure computation protocols combine inputs from involved parties to generate\nan output while keeping their inputs private. Private Set Intersection (PSI) is\na secure computation protocol that allows two parties, who each hold a set of\nitems, to learn the intersection of their sets without revealing anything else\nabout the items. Private Intersection Sum (PIS) extends PSI when the two\nparties want to learn the cardinality of the intersection, as well as the sum\nof the associated integer values for each identifier in the intersection, but\nnothing more. Finally, Private Join and Compute (PJC) is a scalable extension\nof PIS protocol to help organizations work together with confidential data\nsets. The extensions proposed in this paper include: (a) extending PJC protocol\nto additional data columns and applying columnar aggregation based on supported\nhomomorphic operations, (b) exploring Ring Learning with Errors (RLWE)\nhomomorphic encryption schemes to apply arithmetic operations such as sum and\nsum of squares, (c) ensuring stronger security using mutual authentication of\ncommunicating parties using certificates, and (d) developing a Website to\noperationalize such a service offering. We applied our results to develop a\nProof-of-Concept solution called JingBing, a voter list validation service that\nallows different states to register, acquire secure communication modules,\ninstall it, and then conduct authenticated peer-to-peer communication. We\nconclude our paper with directions for future research to make such a solution\nscalable for practical real-life scenarios.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:42:53 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Raghuvir","Yuvaray Athur",""],["Govindarajan","Senthil",""],["Vijayakumar","Sanjeevi",""],["Yadlapalli","Pradeep",""],["Di Troia","Fabio",""]]}
{"id":"2308.14742","submitter":"Nikita Doikov","authors":"Nikita Doikov","title":"Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of\n  Newton Method","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the composite convex optimization problems with a\nQuasi-Self-Concordant smooth component. This problem class naturally\ninterpolates between classic Self-Concordant functions and functions with\nLipschitz continuous Hessian. Previously, the best complexity bounds for this\nproblem class were associated with trust-region schemes and implementations of\na ball-minimization oracle. In this paper, we show that for minimizing\nQuasi-Self-Concordant functions we can use instead the basic Newton Method with\nGradient Regularization. For unconstrained minimization, it only involves a\nsimple matrix inversion operation (solving a linear system) at each step. We\nprove a fast global linear rate for this algorithm, matching the complexity\nbound of the trust-region scheme, while our method remains especially simple to\nimplement. Then, we introduce the Dual Newton Method, and based on it, develop\nthe corresponding Accelerated Newton Scheme for this problem class, which\nfurther improves the complexity factor of the basic method. As a direct\nconsequence of our results, we establish fast global linear rates of simple\nvariants of the Newton Method applied to several practical problems, including\nLogistic Regression, Soft Maximum, and Matrix Scaling, without requiring\nadditional assumptions on strong or uniform convexity for the target objective.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:43:04 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Doikov","Nikita",""]]}
{"id":"2308.14743","submitter":"Yiping Ma","authors":"David D. J. M. Snee, Yi-Ping Ma","title":"Domain Walls and Vector Solitons in the Coupled Nonlinear Schr\\\"odinger\n  Equation","comments":"14 pages, 5 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS cond-mat.quant-gas math.DS physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We outline a program to classify domain walls (DWs) and vector solitons in\nthe 1D two-component coupled nonlinear Schrodinger (CNLS) equation with general\ncoefficients. The CNLS equation is reduced first to a complex ordinary\ndifferential equation (ODE), and then to a real ODE after imposing a\nrestriction. In the real ODE, we identify four possible equilibria including\nZZ, ZN, NZ, and NN, with Z (N) denoting a zero (nonzero) value in a component,\nand analyze their spatial stability. We identify two types of DWs including\nasymmetric DWs between ZZ and NN and symmetric DWs between ZN and NZ. We\nidentify three codimension-1 mechanisms for generating vector solitons in the\nreal ODE including heteroclinic cycles, local bifurcations, and exact\nsolutions. Heteroclinic cycles are formed by assembling two DWs back-to-back\nand generate extended bright-bright (BB), dark-dark (DD), and dark-bright (DB)\nsolitons. Local bifurcations include the Turing (Hamiltonian-Hopf) bifurcation\nthat generates Turing solitons with oscillatory tails and the pitchfork\nbifurcation that generates DB, bright-antidark, DD, and dark-antidark solitons\nwith monotonic tails. Exact solutions include scalar bright and dark solitons\nwith vector amplitudes. Any codimension-1 real vector soliton can be\nnumerically continued into a codimension-0 family. Complex vector solitons have\ntwo more parameters: a dark or antidark component can be numerically continued\nin the wavenumber, while a bright component can be multiplied by a constant\nphase factor (polarization). We introduce a numerical continuation method to\nfind real and complex vector solitons and show that DWs and DB solitons in the\nimmiscible regime can be related by varying bifurcation parameters. We show\nthat collisions between two polarized DB solitons typically feature a mass\nexchange that changes the parameters of the two bright components and the two\nsoliton velocities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:50:59 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Snee","David D. J. M.",""],["Ma","Yi-Ping",""]]}
{"id":"2308.14744","submitter":"Faisal Alkaabneh","authors":"Faisal Alkaabneh and Rabiatu Bonku","title":"Matheuristic for Vehicle Routing Problem with Multiple Synchronization\n  Constraints and Variable Service Time","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers an extension of the vehicle routing problem with\nsynchronization constraints and introduces the vehicle routing problem with\nmultiple synchronization constraints and variable service time. This important\nproblem is motivated by a real-world problem faced by one of the largest\nagricultural companies in the world providing precision agriculture services to\ntheir clients who are farmers and growers. The solution to this problem impacts\nthe performance of farm spraying operations and can help design policies to\nimprove spraying operations in large-scale farming. We propose a Mixed Integer\nProgramming (MIP) model for this challenging problem, along with\nproblem-specific valid inequalities. A three-phase powerful matheuristic is\nproposed to solve large instances enhanced with a novel local search method. We\nconduct extensive numerical analysis using realistic data. Results show that\nour matheuristic is fast and efficient in terms of solution quality and\ncomputational time compared to the state-of-the-art MIP solver. Using\nreal-world data, we demonstrate the importance of considering an optimization\napproach to solve the problem, showing that the policy implemented in practice\noverestimates the costs by 15-20%. Finally, we compare and contrast the impact\nof various decision-maker preferences on several key performance metrics by\ncomparing different mathematical models.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:51:28 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Alkaabneh","Faisal",""],["Bonku","Rabiatu",""]]}
{"id":"2308.14745","submitter":"Yunya Liu","authors":"Yunya Liu, Jiakun Liu, Jordan R. Raney, and Pai Wang","title":"Quantum Computing for Solid Mechanics and Structural Engineering -- a\n  Demonstration with Variational Quantum Eigensolver","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Variational quantum algorithms exploit the features of superposition and\nentanglement to optimize a cost function efficiently by manipulating the\nquantum states. They are suitable for noisy intermediate-scale quantum (NISQ)\ncomputers that recently became accessible to the worldwide research community.\nHere, we implement and demonstrate the numerical processes on the 5-qubit and\n7-qubit quantum processors on the IBM Qiskit Runtime platform. We combine the\ncommercial finite-element-method (FEM) software ABAQUS with the implementation\nof Variational Quantum Eigensolver (VQE) to establish an integrated pipeline.\nThree examples are used to investigate the performance: a hexagonal truss, a\nTimoshenko beam, and a plane-strain continuum. We conduct parametric studies on\nthe convergence of fundamental natural frequency estimation using this hybrid\nquantum-classical approach. Our findings can be extended to problems with many\nmore degrees of freedom when quantum computers with hundreds of qubits become\navailable in the near future.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:52:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liu","Yunya",""],["Liu","Jiakun",""],["Raney","Jordan R.",""],["Wang","Pai",""]]}
{"id":"2308.14746","submitter":"Lucas Ventura","authors":"Lucas Ventura, Antoine Yang, Cordelia Schmid, G\\\"ul Varol","title":"CoVR: Learning Composed Video Retrieval from Web Video Captions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Composed Image Retrieval (CoIR) has recently gained popularity as a task that\nconsiders both text and image queries together, to search for relevant images\nin a database. Most CoIR approaches require manually annotated datasets,\ncomprising image-text-image triplets, where the text describes a modification\nfrom the query image to the target image. However, manual curation of CoIR\ntriplets is expensive and prevents scalability. In this work, we instead\npropose a scalable automatic dataset creation methodology that generates\ntriplets given video-caption pairs, while also expanding the scope of the task\nto include composed video retrieval (CoVR). To this end, we mine paired videos\nwith a similar caption from a large database, and leverage a large language\nmodel to generate the corresponding modification text. Applying this\nmethodology to the extensive WebVid2M collection, we automatically construct\nour WebVid-CoVR dataset, resulting in 1.6 million triplets. Moreover, we\nintroduce a new benchmark for CoVR with a manually annotated evaluation set,\nalong with baseline results. Our experiments further demonstrate that training\na CoVR model on our dataset effectively transfers to CoIR, leading to improved\nstate-of-the-art performance in the zero-shot setup on both the CIRR and\nFashionIQ benchmarks. Our code, datasets, and models are publicly available at\nhttps://imagine.enpc.fr/~ventural/covr.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:55:33 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Ventura","Lucas",""],["Yang","Antoine",""],["Schmid","Cordelia",""],["Varol","G\u00fcl",""]]}
{"id":"2308.14747","submitter":"Matteo G. A. Paris","authors":"Emilio Annoni, Massimo Frigerio, and Matteo G. A. Paris","title":"Enhanced quantum transport in chiral quantum walks","comments":"23 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum transport across discrete structures is a relevant topic of solid\nstate physics and quantum information science, which can be suitably studied in\nthe context of continuous-time quantum walks. The addition of phases degrees of\nfreedom, leading to chiral quantum walks, can also account for directional\ntransport on graphs with loops. We discuss criteria for quantum transport and\nstudy the enhancement that can be achieved with chiral quantum walks on\nchain-like graphs, exploring different topologies for the chain units and\noptimizing over the phases. We select three candidate structures with optimal\nperformance and investigate their transport behaviour with Krylov reduction.\nWhile one of them can be reduced to a weighted line with minor couplings\nmodulation, the other two are truly chiral quantum walks, with enhanced\ntransport probability over long chain structures.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:56:15 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Annoni","Emilio",""],["Frigerio","Massimo",""],["Paris","Matteo G. A.",""]]}
{"id":"2308.14748","submitter":"Jianfeng Zhang","authors":"Jianfeng Zhang and Hanshu Yan and Zhongcong Xu and Jiashi Feng and Jun\n  Hao Liew","title":"MagicAvatar: Multimodal Avatar Generation and Animation","comments":"Project page: https://magic-avatar.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This report presents MagicAvatar, a framework for multimodal video generation\nand animation of human avatars. Unlike most existing methods that generate\navatar-centric videos directly from multimodal inputs (e.g., text prompts),\nMagicAvatar explicitly disentangles avatar video generation into two stages:\n(1) multimodal-to-motion and (2) motion-to-video generation. The first stage\ntranslates the multimodal inputs into motion/ control signals (e.g., human\npose, depth, DensePose); while the second stage generates avatar-centric video\nguided by these motion signals. Additionally, MagicAvatar supports avatar\nanimation by simply providing a few images of the target person. This\ncapability enables the animation of the provided human identity according to\nthe specific motion derived from the first stage. We demonstrate the\nflexibility of MagicAvatar through various applications, including text-guided\nand video-guided avatar generation, as well as multimodal avatar animation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:56:18 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Zhang","Jianfeng",""],["Yan","Hanshu",""],["Xu","Zhongcong",""],["Feng","Jiashi",""],["Liew","Jun Hao",""]]}
{"id":"2308.14749","submitter":"Jianfeng Zhang","authors":"Jun Hao Liew and Hanshu Yan and Jianfeng Zhang and Zhongcong Xu and\n  Jiashi Feng","title":"MagicEdit: High-Fidelity and Temporally Coherent Video Editing","comments":"Project page: https://magic-edit.github.io/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this report, we present MagicEdit, a surprisingly simple yet effective\nsolution to the text-guided video editing task. We found that high-fidelity and\ntemporally coherent video-to-video translation can be achieved by explicitly\ndisentangling the learning of content, structure and motion signals during\ntraining. This is in contradict to most existing methods which attempt to\njointly model both the appearance and temporal representation within a single\nframework, which we argue, would lead to degradation in per-frame quality.\nDespite its simplicity, we show that MagicEdit supports various downstream\nvideo editing tasks, including video stylization, local editing, video-MagicMix\nand video outpainting.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:56:22 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Liew","Jun Hao",""],["Yan","Hanshu",""],["Zhang","Jianfeng",""],["Xu","Zhongcong",""],["Feng","Jiashi",""]]}
{"id":"2308.14750","submitter":"Shyam Narayan Singh Yadav","authors":"Shyam Narayan Singh Yadav, Po-Liang Chen, Yu-Chi Yao, Yen-Yu Wang,\n  Der-Hsien Lien, Yu-Jung Lu, Ya-Ping Hsieh, Chang-Hua Liu, and Ta-Jen Yen","title":"Ultrahigh Photoresponsivity of Gold Nanodisk Array/CVD MoS$_2$-based\n  Hybrid Phototransistor","comments":"30 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Owing to its atomically thin thickness, layer-dependent tunable band gap,\nflexibility, and CMOS compatibility, MoS$_2$ is a promising candidate for\nphotodetection. However, mono-layer MoS2-based photodetectors typically show\npoor optoelectronic performances, mainly limited by their low optical\nabsorption. In this work, we hybridized CVD-grown monolayer MoS$_2$ with a gold\nnanodisk (AuND) array to demonstrate a superior visible photodetector through a\nsynergetic effect. It is evident from our experimental results that there is a\nstrong light-matter interaction between AuNDs and monolayer MoS$_2$, which\nresults in better photodetection due to a surface trap state passivation with a\nlonger charge carrier lifetime compared to pristine MoS$_2$. In particular, the\nAuND/MoS$_2$ system demonstrated a photoresponsivity of $8.7 \\times 10^{4}$\nA/W, specific detectivity of $6.9 \\times 10^{13}$ Jones, and gain $1.7 \\times\n10^{5}$ at $31.84 \\mu W/cm^{2}$ illumination power density of 632 nm wavelength\nwith an applied voltage of 4.0 V for an AuND/MoS$_2$-based photodetector. To\nour knowledge, these optoelectronic responses are one order higher than\nreported results for CVD MoS$_2$-based photodetector in the literature.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:57:32 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Yadav","Shyam Narayan Singh",""],["Chen","Po-Liang",""],["Yao","Yu-Chi",""],["Wang","Yen-Yu",""],["Lien","Der-Hsien",""],["Lu","Yu-Jung",""],["Hsieh","Ya-Ping",""],["Liu","Chang-Hua",""],["Yen","Ta-Jen",""]]}
{"id":"2308.14751","submitter":"Rub\\'en Seoane Souto","authors":"Rub\\'en Seoane Souto, Athanasios Tsintzis, Martin Leijnse, and Jeroen\n  Danon","title":"Probing Majorana localization in minimal Kitaev chains through a quantum\n  dot","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":"NBI QDEV 2023","categories":"cond-mat.mes-hall cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Artificial Kitaev chains, formed by quantum dots coupled via superconductors,\nhave emerged as a promising platform for realizing Majorana bound states. Even\na minimal Kitaev chain (a quantum dot--superconductor--quantum dot setup) can\nhost Majorana states at discrete sweet spots. However, unambiguously\nidentifying Majorana sweet spots in such a system is still challenging. In this\nwork, we propose an additional dot coupled to one side of the chain as a tool\nto identify good sweet spots in minimal Kitaev chains. When the two Majorana\nstates in the chain overlap, the extra dot couples to both and thus splits an\neven--odd ground-state degeneracy when its level is on resonance. In contrast,\na ground-state degeneracy will persist for well-separated Majorana states. This\ndifference can be used to identify points in parameter space with spatially\nseparated Majorana states, using tunneling spectroscopy measurements. We\nperform a systematic analysis of different relevant situations. We show that\nthe additional dot can help distinguishing between Majorana sweet spots and\nother trivial zero-energy crossings. We also characterize the different\nconductance patterns, which can serve as a guide for future experiments aiming\nto study Majorana states in minimal Kitaev chains.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:57:34 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Souto","Rub\u00e9n Seoane",""],["Tsintzis","Athanasios",""],["Leijnse","Martin",""],["Danon","Jeroen",""]]}
{"id":"2308.14752","submitter":"Peter S. Park","authors":"Peter S. Park, Simon Goldstein, Aidan O'Gara, Michael Chen, Dan\n  Hendrycks","title":"AI Deception: A Survey of Examples, Risks, and Potential Solutions","comments":"18 pages (not including executive summary, references, and appendix),\n  six figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper argues that a range of current AI systems have learned how to\ndeceive humans. We define deception as the systematic inducement of false\nbeliefs in the pursuit of some outcome other than the truth. We first survey\nempirical examples of AI deception, discussing both special-use AI systems\n(including Meta's CICERO) built for specific competitive situations, and\ngeneral-purpose AI systems (such as large language models). Next, we detail\nseveral risks from AI deception, such as fraud, election tampering, and losing\ncontrol of AI systems. Finally, we outline several potential solutions to the\nproblems posed by AI deception: first, regulatory frameworks should subject AI\nsystems that are capable of deception to robust risk-assessment requirements;\nsecond, policymakers should implement bot-or-not laws; and finally,\npolicymakers should prioritize the funding of relevant research, including\ntools to detect AI deception and to make AI systems less deceptive.\nPolicymakers, researchers, and the broader public should work proactively to\nprevent AI deception from destabilizing the shared foundations of our society.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:59:35 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Park","Peter S.",""],["Goldstein","Simon",""],["O'Gara","Aidan",""],["Chen","Michael",""],["Hendrycks","Dan",""]]}
{"id":"2308.14753","submitter":"Tal Reiss","authors":"Oren Barkan, Tal Reiss, Jonathan Weill, Ori Katz, Roy Hirsch, Itzik\n  Malkiel, Noam Koenigstein","title":"Efficient Discovery and Effective Evaluation of Visual Perceptual\n  Similarity: A Benchmark and Beyond","comments":"ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visual similarities discovery (VSD) is an important task with broad\ne-commerce applications. Given an image of a certain object, the goal of VSD is\nto retrieve images of different objects with high perceptual visual similarity.\nAlthough being a highly addressed problem, the evaluation of proposed methods\nfor VSD is often based on a proxy of an identification-retrieval task,\nevaluating the ability of a model to retrieve different images of the same\nobject. We posit that evaluating VSD methods based on identification tasks is\nlimited, and faithful evaluation must rely on expert annotations. In this\npaper, we introduce the first large-scale fashion visual similarity benchmark\ndataset, consisting of more than 110K expert-annotated image pairs. Besides\nthis major contribution, we share insight from the challenges we faced while\ncurating this dataset. Based on these insights, we propose a novel and\nefficient labeling procedure that can be applied to any dataset. Our analysis\nexamines its limitations and inductive biases, and based on these findings, we\npropose metrics to mitigate those limitations. Though our primary focus lies on\nvisual similarity, the methodologies we present have broader applications for\ndiscovering and evaluating perceptual similarity across various domains.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:59:47 GMT"}],"update_date":"2023-08-29","authors_parsed":[["Barkan","Oren",""],["Reiss","Tal",""],["Weill","Jonathan",""],["Katz","Ori",""],["Hirsch","Roy",""],["Malkiel","Itzik",""],["Koenigstein","Noam",""]]}
{"id":"2308.14755","submitter":"Andrei T. Patrascu","authors":"Andrei T. Patrascu","title":"On the Renormalisation group, protein folding, and naturalness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.soft cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  I am showing how the ideas behind the renormalisation group can be\ngeneralised in order to produce the desired reduction in the degrees of freedom\nother that the ones considered up to now. Instead of looking only at the\nrenormalisation group flow, inspiration from optimisation tools for regulators\nof truncated theories is used to show that there exists another mathematical\nstructure in the morphisms between various renormalisation groups,\ncharacterised by their operations, encoded by means of various regularisation\nfunctions. This expands the idea of renormalisation group to a renormalisation\ncategory. A group structure exists at the level of those morphisms, leading to\nnew information emerging in the flowing process. Impact on problems like the\nnaturalness and protein folding is being presented briefly.\n","versions":[{"version":"v1","created":"Sat, 12 Aug 2023 14:24:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Patrascu","Andrei T.",""]]}
{"id":"2308.14756","submitter":"Samudra Dasgupta","authors":"Samudra Dasgupta and Arshag Danageozian and Travis S. Humble","title":"Adaptive mitigation of time-varying quantum noise","comments":"To appear in IEEE QCE 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Current quantum computers suffer from non-stationary noise channels with high\nerror rates, which undermines their reliability and reproducibility. We propose\na Bayesian inference-based adaptive algorithm that can learn and mitigate\nquantum noise in response to changing channel conditions. Our study emphasizes\nthe need for dynamic inference of critical channel parameters to improve\nprogram accuracy. We use the Dirichlet distribution to model the stochasticity\nof the Pauli channel. This allows us to perform Bayesian inference, which can\nimprove the performance of probabilistic error cancellation (PEC) under\ntime-varying noise. Our work demonstrates the importance of characterizing and\nmitigating temporal variations in quantum noise, which is crucial for\ndeveloping more accurate and reliable quantum technologies. Our results show\nthat Bayesian PEC can outperform non-adaptive approaches by a factor of 4.5x\nwhen measured using Hellinger distance from the ideal distribution.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:33:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dasgupta","Samudra",""],["Danageozian","Arshag",""],["Humble","Travis S.",""]]}
{"id":"2308.14757","submitter":"Kolahal Bhattacharya","authors":"Kolahal Bhattacharya","title":"Semi-classical understanding of flux quantization in superconductors","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Like electric charge, magnetic flux is also quantised. Theoretically, one can\nshow that the flux quantum must be h/e, as observed in the quantum Hall effect.\nHowever, in the superconducting systems, the flux quantum is experimentally\nobserved as h/2e. There is no fundamental explanation for the empirical result.\nIn this article, we argue that this phenomenon is fundamentally linked to the\nnonlocality problem of the Aharonov-Bohm effect and present a new\nsemi-classical explanation for the magnetic flux quantum in superconductivity.\nThis work will also show why the flux quantum should be h/e in the case of the\nquantum Hall effect.\n","versions":[{"version":"v1","created":"Sat, 19 Aug 2023 05:17:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bhattacharya","Kolahal",""]]}
{"id":"2308.14758","submitter":"Ming Ng","authors":"Ming Ng and Steven Vickers","title":"A Point-Free Look at Ostrowski's Theorem and Absolute Values","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper investigates the absolute values on $\\mathbb{Z}$ valued in the\nupper reals (i.e. reals for which only a right Dedekind section is given).\nThese necessarily include multiplicative seminorms corresponding to the finite\nprime fields $\\mathbb{F}_p$. As an Ostrowski-type Theorem, the space of such\nabsolute values is homeomorphic to a space of prime ideals (with co-Zariski\ntopology) suitably paired with upper reals in the range $[-\\infty, 1]$, and\nfrom this is recovered the standard Ostrowski's Theorem for absolute values on\n$\\mathbb{Q}$.\n  Our approach is fully constructive, using, in the topos-theoretic sense,\ngeometric reasoning with point-free spaces, and that calls for a careful\ndistinction between Dedekinds vs. upper reals. This forces attention on\ntopological subtleties that are obscured in the classical treatment. In\nparticular, the admission of multiplicative seminorms points to connections\nwith Berkovich and adic spectra. The results are also intended to contribute to\ncharacterising a (point-free) space of places of $\\mathbb{Q}$.\n","versions":[{"version":"v1","created":"Sun, 20 Aug 2023 18:35:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ng","Ming",""],["Vickers","Steven",""]]}
{"id":"2308.14759","submitter":"Rui Feng","authors":"Rui Feng, Qi Zhu, Huan Tran, Binghong Chen, Aubrey Toland, Rampi\n  Ramprasad, Chao Zhang","title":"May the Force be with You: Unified Force-Centric Pre-Training for 3D\n  Molecular Conformations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cs.AI cs.LG q-bio.BM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent works have shown the promise of learning pre-trained models for 3D\nmolecular representation. However, existing pre-training models focus\npredominantly on equilibrium data and largely overlook off-equilibrium\nconformations. It is challenging to extend these methods to off-equilibrium\ndata because their training objective relies on assumptions of conformations\nbeing the local energy minima. We address this gap by proposing a force-centric\npretraining model for 3D molecular conformations covering both equilibrium and\noff-equilibrium data. For off-equilibrium data, our model learns directly from\ntheir atomic forces. For equilibrium data, we introduce zero-force\nregularization and forced-based denoising techniques to approximate\nnear-equilibrium forces. We obtain a unified pre-trained model for 3D molecular\nrepresentation with over 15 million diverse conformations. Experiments show\nthat, with our pre-training objective, we increase forces accuracy by around 3\ntimes compared to the un-pre-trained Equivariant Transformer model. By\nincorporating regularizations on equilibrium data, we solved the problem of\nunstable MD simulations in vanilla Equivariant Transformers, achieving\nstate-of-the-art simulation performance with 2.45 times faster inference time\nthan NequIP. As a powerful molecular encoder, our pre-trained model achieves\non-par performance with state-of-the-art property prediction tasks.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 01:54:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Feng","Rui",""],["Zhu","Qi",""],["Tran","Huan",""],["Chen","Binghong",""],["Toland","Aubrey",""],["Ramprasad","Rampi",""],["Zhang","Chao",""]]}
{"id":"2308.14760","submitter":"Felipe Asenjo","authors":"Felipe A. Asenjo","title":"Accelerating self-modulated nonlinear waves in weakly and strongly\n  magnetized relativistic plasmas","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is known that a nonlinear Schr\\\"odinger equation describes the\nself-modulation of a large amplitude circularly polarized wave in relativistic\nelectron-positron plasmas in the weakly and strongly magnetized limits. Such\nequation can be written as a modified second Painlev\\'e equation, producing\naccelerated propagating wave solutions for those nonlinear plasmas. The\nacceleration depends on the plasma magnetization. This is different to the\nusual soliton solution propagating at constant speed.\n","versions":[{"version":"v1","created":"Thu, 24 Aug 2023 02:23:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Asenjo","Felipe A.",""]]}
{"id":"2308.14761","submitter":"Rohit Gandikota","authors":"Rohit Gandikota, Hadas Orgad, Yonatan Belinkov, Joanna Materzy\\'nska,\n  David Bau","title":"Unified Concept Editing in Diffusion Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text-to-image models suffer from various safety issues that may limit their\nsuitability for deployment. Previous methods have separately addressed\nindividual issues of bias, copyright, and offensive content in text-to-image\nmodels. However, in the real world, all of these issues appear simultaneously\nin the same model. We present a method that tackles all issues with a single\napproach. Our method, Unified Concept Editing (UCE), edits the model without\ntraining using a closed-form solution, and scales seamlessly to concurrent\nedits on text-conditional diffusion models. We demonstrate scalable\nsimultaneous debiasing, style erasure, and content moderation by editing\ntext-to-image projections, and we present extensive experiments demonstrating\nimproved efficacy and scalability over prior work. Our code is available at\nhttps://unified.baulab.info\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 17:59:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gandikota","Rohit",""],["Orgad","Hadas",""],["Belinkov","Yonatan",""],["Materzy\u0144ska","Joanna",""],["Bau","David",""]]}
{"id":"2308.14762","submitter":"Waseem Akram","authors":"Waseem Akram, Muhayyuddin Ahmed, Lyes Saad Saoud, Lakmal Seneviratne,\n  and Irfan Hussain","title":"Autonomous Underwater Robotic System for Aquaculture Applications","comments":"arXiv admin note: text overlap with arXiv:2308.13826","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aquaculture is a thriving food-producing sector producing over half of the\nglobal fish consumption. However, these aquafarms pose significant challenges\nsuch as biofouling, vegetation, and holes within their net pens and have a\nprofound effect on the efficiency and sustainability of fish production.\nCurrently, divers and/or remotely operated vehicles are deployed for inspecting\nand maintaining aquafarms; this approach is expensive and requires highly\nskilled human operators. This work aims to develop a robotic-based automatic\nnet defect detection system for aquaculture net pens oriented to on- ROV\nprocessing and real-time detection of different aqua-net defects such as\nbiofouling, vegetation, net holes, and plastic. The proposed system integrates\nboth deep learning-based methods for aqua-net defect detection and feedback\ncontrol law for the vehicle movement around the aqua-net to obtain a clear\nsequence of net images and inspect the status of the net via performing the\ninspection tasks. This work contributes to the area of aquaculture inspection,\nmarine robotics, and deep learning aiming to reduce cost, improve quality, and\nease of operation.\n","versions":[{"version":"v1","created":"Sat, 26 Aug 2023 10:45:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Akram","Waseem",""],["Ahmed","Muhayyuddin",""],["Saoud","Lyes Saad",""],["Seneviratne","Lakmal",""],["Hussain","Irfan",""]]}
{"id":"2308.14763","submitter":"Chen-Yu Chiang","authors":"Jia-Jyu Su, Pang-Chen Liao, Yen-Ting Lin, Wu-Hao Li, Guan-Ting Liou,\n  Cheng-Che Kao, Wei-Cheng Chen, Jen-Chieh Chiang, Wen-Yang Chang, Pin-Han Lin,\n  Chen-Yu Chiang","title":"VoiceBank-2023: A Multi-Speaker Mandarin Speech Corpus for Constructing\n  Personalized TTS Systems for the Speech Impaired","comments":"submitted to 26th International Conference of the ORIENTAL-COCOSDA","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.CL cs.SD","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Services of personalized TTS systems for the Mandarin-speaking speech\nimpaired are rarely mentioned. Taiwan started the VoiceBanking project in 2020,\naiming to build a complete set of services to deliver personalized Mandarin TTS\nsystems to amyotrophic lateral sclerosis patients. This paper reports the\ncorpus design, corpus recording, data purging and correction for the corpus,\nand evaluations of the developed personalized TTS systems, for the VoiceBanking\nproject. The developed corpus is named after the VoiceBank-2023 speech corpus\nbecause of its release year. The corpus contains 29.78 hours of utterances with\nprompts of short paragraphs and common phrases spoken by 111 native Mandarin\nspeakers. The corpus is labeled with information about gender, degree of speech\nimpairment, types of users, transcription, SNRs, and speaking rates. The\nVoiceBank-2023 is available by request for non-commercial use and welcomes all\nparties to join the VoiceBanking project to improve the services for the speech\nimpaired.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 07:35:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Su","Jia-Jyu",""],["Liao","Pang-Chen",""],["Lin","Yen-Ting",""],["Li","Wu-Hao",""],["Liou","Guan-Ting",""],["Kao","Cheng-Che",""],["Chen","Wei-Cheng",""],["Chiang","Jen-Chieh",""],["Chang","Wen-Yang",""],["Lin","Pin-Han",""],["Chiang","Chen-Yu",""]]}
{"id":"2308.14764","submitter":"Zhihao Lu","authors":"Zhihao Lu","title":"Gradient estimate and Universal bounds for semilinear elliptic equations\n  on RCD$^*$(K,N) metric measure spaces","comments":"arXiv admin note: text overlap with arXiv:2308.14026","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide logarithmic gradient estimate and universal boundedness estimate\nfor semilinear elliptic equations on RCD$^*(K,N)$, metric measure spaces. In\ncertain case, these estimates are optimal even on RCD$^*(K,N)$ spaces with\n$K<0$. Two direct corollaries of these estimates are Harnack inequality and\nLiouville theorem. In addition to these estimates, we also establish relations\namong the universal boundedness estimate, the logarithmic gradient estimate,\nand Harnack inequality. Under certain conditions, even in wild setting, they\nare $\\kappa$-equivalent on RCD$^*(0,N)$ spaces for any $\\kappa>1$.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 10:06:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lu","Zhihao",""]]}
{"id":"2308.14765","submitter":"Chi-Kwong Li","authors":"Chi-Kwong Li, Mikio Nakahara","title":"A note on Majorana representation of quantum states","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the Majorana representation of quantum states using symmetry class\nof tensors. We present a simple method to construct $d-1$ points on the Bloch\nsphere and their corresponding $d-1$ qubits, effectively representing a\n$d$-dimensional quantum state. Additionally, we demonstrate how the inner\nproduct of two $d$-dimensional quantum states can be expressed as a permanent\nof a matrix related to their $(d-1)$-qubit state representations. Furthermore,\nwe discuss the implications of this result on the convexity of a specific\ndecomposable numerical range.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 13:29:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Chi-Kwong",""],["Nakahara","Mikio",""]]}
{"id":"2308.14766","submitter":"Prabal Saxena","authors":"Prabal Saxena, Liam S. Morrissey, Rosemary M. Killen, Jason L. McLain,\n  Li Hsia Yeo, Natalie M. Curran, Nithin S. Abraham, Heather V. Graham,\n  Orenthal J. Tucker, Menelaos Sarantos, Aaron B. Regberg, Diane E. Pugel,\n  Andrew W. Needham, Mark Hasegawa and Alfred J. Wong","title":"In-situ Optimized Substrate Witness Plates: Ground Truth for Key\n  Processes on the Moon and Other Planets","comments":"Accepted to Earth and Space Science, Will be updated upon publication","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Future exploration efforts of the Moon, Mars and other bodies are poised to\nfocus heavily on persistent and sustainable survey and research efforts,\nespecially given the recent interest in a long-term sustainable human presence\nat the Moon. Key to these efforts is understanding a number of important\nprocesses on the lunar surface for both scientific and operational purposes. We\ndiscuss the potential value of in-situ artificial substrate witness plates,\npowerful tools that can supplement familiar remote sensing and sample\nacquisition techniques and provide a sustainable way of monitoring processes in\nkey locations on planetary surfaces while maintaining a low environmental\nfootprint. These tools, which we call Biscuits, can use customized materials as\nwide ranging as zircon-based spray coatings to metals potentially usable for\nsurface structures, to target specific processes/questions as part of a small,\npassive witness plate that can be flexibly placed with respect to location and\ntotal time duration. We examine and discuss unique case studies to show how\nprocesses such as water presence/transport, presence and contamination of\nbiologically relevant molecules, solar activity related effects, and other\nprocesses can be measured using Biscuits. Biscuits can yield key location\nsensitive, time integrated measurements on these processes to inform scientific\nunderstanding of the Moon and enable operational goals in lunar exploration.\nWhile we specifically demonstrate this on a simulated traverse and for selected\nexamples, we stress all groups interested in planetary surfaces should consider\nthese adaptable, low footprint and highly informative tools for future\nexploration.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 19:51:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Saxena","Prabal",""],["Morrissey","Liam S.",""],["Killen","Rosemary M.",""],["McLain","Jason L.",""],["Yeo","Li Hsia",""],["Curran","Natalie M.",""],["Abraham","Nithin S.",""],["Graham","Heather V.",""],["Tucker","Orenthal J.",""],["Sarantos","Menelaos",""],["Regberg","Aaron B.",""],["Pugel","Diane E.",""],["Needham","Andrew W.",""],["Hasegawa","Mark",""],["Wong","Alfred J.",""]]}
{"id":"2308.14767","submitter":"Peter Matak","authors":"Tom\\'a\\v{s} Bla\\v{z}ek and Peter Mat\\'ak","title":"Comment on \"Dirac leptogenesis via scatterings\"","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In their recent letter, Heeck et al. [Phys. Rev. D 108, L031703] introduced a\nsimple model of leptogenesis, in which the asymmetry originates from the\nscattering processes only. Here we argue that their calculation violates some\nof the basic principles of perturbative quantum field theory.\n","versions":[{"version":"v1","created":"Sun, 27 Aug 2023 23:05:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bla\u017eek","Tom\u00e1\u0161",""],["Mat\u00e1k","Peter",""]]}
{"id":"2308.14768","submitter":"Qiang Tang","authors":"Qiang Tang and Jau Tang","title":"Sedenion algebra for three lepton/quark generations and its relations to\n  SU(5)","comments":"19 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we analyze two models beyond the Standard Models descriptions\nthat make ad hoc hypotheses of three point-like lepton and quark generations\nwithout explanations of their physical origins. Instead of using the same Dirac\nequation involving four anti-commutative matrices for all such structure-less\nelementary particles, we consider in the first model the use of sixteen\ndirect-product matrices of quaternions that are related to Diracs gamma\nmatrices. This associative direct-product matrix model could not generate three\nfermion generations satisfying Einsteins mass-energy relation. We show that\nsedenion algebra contains five distinct quaternion sub-algebras and three\noctonion sub-algebras but with a common intersecting quaternion algebra. This\nmodel naturally leads to precisely three generations as each of the\nnon-associative octonion sub-algebra leads to one fermion generation. Moreover,\nwe demonstrate the use of basic sedenion.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 03:11:34 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:59:46 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tang","Qiang",""],["Tang","Jau",""]]}
{"id":"2308.14769","submitter":"Shorya Consul","authors":"Shorya Consul, John Robertson, Haris Vikalo","title":"XVir: A Transformer-Based Architecture for Identifying Viral Reads from\n  Cancer Samples","comments":"8 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.GN cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It is estimated that approximately 15% of cancers worldwide can be linked to\nviral infections. The viruses that can cause or increase the risk of cancer\ninclude human papillomavirus, hepatitis B and C viruses, Epstein-Barr virus,\nand human immunodeficiency virus, to name a few. The computational analysis of\nthe massive amounts of tumor DNA data, whose collection is enabled by the\nrecent advancements in sequencing technologies, have allowed studies of the\npotential association between cancers and viral pathogens. However, the high\ndiversity of oncoviral families makes reliable detection of viral DNA difficult\nand thus, renders such analysis challenging. In this paper, we introduce XVir,\na data pipeline that relies on a transformer-based deep learning architecture\nto reliably identify viral DNA present in human tumors. In particular, XVir is\ntrained on genomic sequencing reads from viral and human genomes and may be\nused with tumor sequence information to find evidence of viral DNA in human\ncancers. Results on semi-experimental data demonstrate that XVir is capable of\nachieving high detection accuracy, generally outperforming state-of-the-art\ncompeting methods while being more compact and less computationally demanding.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:15:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Consul","Shorya",""],["Robertson","John",""],["Vikalo","Haris",""]]}
{"id":"2308.14770","submitter":"Chacko V M","authors":"Deepthi K S and Chacko V M","title":"Power Generalized KM-Transformation for Non-Monotone Failure Rate\n  Distribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME math.ST stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Lifetime models with a non-monotone hazard rate $\\hspace{0.12cm}$ function\nhave a wide range of applications in engineering and lifetime data analysis.\nThere are different bathtub shaped failure rate models that are available in\nreliability literature. Kavya and Manoharan (2021) introduced a new\ntransformation called KM-transformation which was found to be more useful in\nreliability and lifetime data analysis. Power generalization technique would be\nthe best approach to deal with a system whose components are connected in\nseries, in which the distribution of the component is KM-transformation of any\nlifetime model. In this article, we introduce a new lifetime model, Power\nGeneralized KM-Transformation (PGKM) for Non-Monotone Failure Rate\nDistribution, which shows monotone and non-monotone behavior for the hazard\nrate function for different choices of values of parameters. We derive the\nmoments, moment generating function, characteristic function, quantiles,\nentropy etc of the proposed distribution. Distributions of minimum and maximum\nare obtained. Estimation of parameters of the distribution is performed via\nmaximum likelihood method. A simulation study is performed to validate the\nmaximum likelihood estimator (MLE). Analysis of three sets of real data are\ngiven.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 05:32:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["S","Deepthi K",""],["M","Chacko V",""]]}
{"id":"2308.14771","submitter":"Dominic Michael Rouse","authors":"Dominic M Rouse, Adesh Kushwaha, Stefano Tomasi, Brendon W Lovett,\n  Erik M Gauger, Ivan Kassal","title":"Light-harvesting efficiency cannot depend on optical coherence in the\n  absence of orientational order","comments":"8 + 5 pages, 5 + 1 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The coherence of light has been proposed as a quantum-mechanical control to\nenhance light-harvesting efficiency. In particular, optical coherence can be\nmanipulated by changing either the polarization state or spectral phase of the\nilluminating light. Here, we show that, in weak light, controlling the\nlight-harvesting efficiency using any form of optical coherence is impossible\nin all molecular light-harvesting systems and, more broadly, those composed of\nweakly interacting sub-units which lack fixed orientational order and operate\non longer-than-ultrafast timescales. Under those conditions, optical coherence\ndoes not affect light-harvesting efficiency, meaning that it cannot be used as\na form of control. In particular, control through the polarization state is\nlost in disordered samples or when the molecules reorient on the timescales of\nthe light-harvesting, and control through the spectral phase is lost when the\nefficiency is time-averaged for longer than the coherence time of the light. In\npractice, efficiency is always averaged over long times, meaning that coherent\noptical control is only possible through polarisation in systems with\norientational order.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 08:42:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Rouse","Dominic M",""],["Kushwaha","Adesh",""],["Tomasi","Stefano",""],["Lovett","Brendon W",""],["Gauger","Erik M",""],["Kassal","Ivan",""]]}
{"id":"2308.14772","submitter":"Wei-Hsiang Shen","authors":"Wei-Hsiang Shen, Meng-Lin Li","title":"Copy-Paste Image Augmentation with Poisson Image Editing for Ultrasound\n  Instance Segmentation Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep learning has shown great success in high-level image analysis problems;\nyet its efficacy relies on the quality and diversity of the training data. In\nthis work, we introduce a copypaste image augmentation for ultrasound images.\nThe Poisson image editing technique is used to generate realistic and seamless\nboundary transitions around the pasted image. Results showed that the proposed\nimage augmentation technique improves training performance in terms of higher\nobjective metrics and more stable training results.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:38:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shen","Wei-Hsiang",""],["Li","Meng-Lin",""]]}
{"id":"2308.14773","submitter":"Pierre Matet","authors":"Pierre Matet","title":"$\\mu$-Clubs OF $P_\\kappa (\\lambda)$ : Paradise on earth","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  If $V = L$, and $\\mu$, $\\kappa$ and $\\lambda$ are three infinite cardinals\nwith $\\mu = {\\rm cf} (\\mu) < \\kappa = {\\rm cf}(\\kappa) \\leq \\lambda$, then, as\nshown in \\cite{Heaven}, the $\\mu$-club filters on $P_\\kappa (\\lambda)$ and\n$P_\\kappa (\\lambda^{< \\kappa})$ are isomorphic if and only if ${\\rm cf}\n(\\lambda) \\not= \\mu$. Now in $L$, $\\lambda^{< \\kappa}$ equals $u (\\kappa,\n\\lambda)$ (the least size of a cofinal subset in $(P_\\kappa (\\lambda),\n\\subseteq)$) equals $\\lambda$ if ${\\rm cf} (\\lambda) \\geq \\kappa$, and\n$\\lambda^+$ otherwise. We show that, in ZFC, there are many triples $(\\mu,\n\\kappa, \\lambda)$ for which ($u (\\kappa, \\lambda) > \\lambda$ and) the\n$\\mu$-club filters on $P_\\kappa (\\lambda)$ and $P_\\kappa (u (\\kappa, \\lambda))$\nare isomorphic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:14:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Matet","Pierre",""]]}
{"id":"2308.14774","submitter":"Yidi Jiang","authors":"Hongxu Zhu, Siqi Cai, Yidi Jiang, Qiquan Zhang, Haizhou Li","title":"EEG-Derived Voice Signature for Attended Speaker Detection","comments":"8 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD eess.SP q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  \\textit{Objective:} Conventional EEG-based auditory attention detection (AAD)\nis achieved by comparing the time-varying speech stimuli and the elicited EEG\nsignals. However, in order to obtain reliable correlation values, these methods\nnecessitate a long decision window, resulting in a long detection latency.\nHumans have a remarkable ability to recognize and follow a known speaker,\nregardless of the spoken content. In this paper, we seek to detect the attended\nspeaker among the pre-enrolled speakers from the elicited EEG signals. In this\nmanner, we avoid relying on the speech stimuli for AAD at run-time. In doing\nso, we propose a novel EEG-based attended speaker detection (E-ASD) task.\n\\textit{Methods:} We encode a speaker's voice with a fixed dimensional vector,\nknown as speaker embedding, and project it to an audio-derived voice signature,\nwhich characterizes the speaker's unique voice regardless of the spoken\ncontent. We hypothesize that such a voice signature also exists in the\nlistener's brain that can be decoded from the elicited EEG signals, referred to\nas EEG-derived voice signature. By comparing the audio-derived voice signature\nand the EEG-derived voice signature, we are able to effectively detect the\nattended speaker in the listening brain. \\textit{Results:} Experiments show\nthat E-ASD can effectively detect the attended speaker from the 0.5s EEG\ndecision windows, achieving 99.78\\% AAD accuracy, 99.94\\% AUC, and 0.27\\% EER.\n\\textit{Conclusion:} We conclude that it is possible to derive the attended\nspeaker's voice signature from the EEG signals so as to detect the attended\nspeaker in a listening brain. \\textit{Significance:} We present the first proof\nof concept for detecting the attended speaker from the elicited EEG signals in\na cocktail party environment. The successful implementation of E-ASD marks a\nnon-trivial, but crucial step towards smart hearing aids.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 10:39:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhu","Hongxu",""],["Cai","Siqi",""],["Jiang","Yidi",""],["Zhang","Qiquan",""],["Li","Haizhou",""]]}
{"id":"2308.14775","submitter":"Tapan Gandhi","authors":"Taranjit Kaur, Manas Pati Tripathi, Ashirbad Samantaray, Tapan K.\n  Gandhi","title":"Online Poker and Rummy -- Games of Skill or Chance?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The paper aims to investigate the degree of cognitive skills required for\nsuccess in online versions of the popular card game rummy and poker. The study\nfocuses on analyzing the impact of experience and learnable skills on success\nin the online card game. We also propose a framework to analyze online games to\nconclude on whether they are games of learnable skill or are they games of\nchance. The hypotheses proposed aim to test whether online and offline card\ngames are comparable in terms of cognitive engagement and skill requirements.\nTo assess these hypotheses, key elements of gameplay such as shuffling of\ncards, card deck randomness, and seating of players are analyzed. We also\nadopted statistical approaches to understand the characteristics of card games\nin terms of random chance or skill. From the analysis, we could see that the\nnormality of the derived variables deviates significantly from the normal\ndistribution showing a non-linear trend. It signifies that the mean of the\ninvolved skill variables is not zero as the user plays a greater number of\ngames, thereby strengthening the assumption that the long-term success in\nonline card games is attributed to skill and not chance. There is no difference\nin online and offline versions of card games (rummy and poker) from the\nperspective of requirement of skills. Moreover, our finding suggests that there\nis a preponderance of skills to succeed in online card gaming. Overall, the\nfindings of this research contribute to a better understanding of cognitive\nskills in online gaming environments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:10:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kaur","Taranjit",""],["Tripathi","Manas Pati",""],["Samantaray","Ashirbad",""],["Gandhi","Tapan K.",""]]}
{"id":"2308.14776","submitter":"Mahdiyeh Ghaffari","authors":"Mahdiyeh Ghaffari, Mickey C. J. Lukkien, Nematollah Omidikia, Gerjen\n  H. Tinnevelt, Marcel C. P. van Eijk, Jeroen J. Jansen","title":"Systematic reduction of Hyperspectral Images for high-throughput Plastic\n  Characterization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Hyperspectral Imaging (HSI) combines microscopy and spectroscopy to assess\nthe spatial distribution of spectroscopically active compounds in objects, and\nhas diverse applications in food quality control, pharmaceutical processes, and\nwaste sorting. However, due to the large size of HSI datasets, it can be\nchallenging to analyze and store them within a reasonable digital\ninfrastructure, especially in waste sorting where speed and data storage\nresources are limited. Additionally, as with most spectroscopic data, there is\nsignificant redundancy, making pixel and variable selection crucial for\nretaining chemical information. Recent high-tech developments in chemometrics\nenable automated and evidence-based data reduction, which can substantially\nenhance the speed and performance of Non-Negative Matrix Factorization (NMF), a\nwidely used algorithm for chemical resolution of HSI data. By recovering the\npure contribution maps and spectral profiles of distributed compounds, NMF can\nprovide evidence-based sorting decisions for efficient waste management. To\nimprove the quality and efficiency of data analysis on hyperspectral imaging\n(HSI) data, we apply a convex-hull method to select essential pixels and\nwavelengths and remove uninformative and redundant information. This process\nminimizes computational strain and effectively eliminates highly mixed pixels.\nBy reducing data redundancy, data investigation and analysis become more\nstraightforward, as demonstrated in both simulated and real HSI data for\nplastic sorting.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 11:38:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghaffari","Mahdiyeh",""],["Lukkien","Mickey C. J.",""],["Omidikia","Nematollah",""],["Tinnevelt","Gerjen H.",""],["van Eijk","Marcel C. P.",""],["Jansen","Jeroen J.",""]]}
{"id":"2308.14777","submitter":"Chang Feng","authors":"Chang Feng, Filipe B. Abdalla","title":"Power-spectrum space decomposition of frequency tomographic data for\n  intensity mapping experiments","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a Bayesian framework to establish a power-spectrum space\ndecomposition of frequency tomographic (PSDFT) data for future intensity\nmapping (IM) experiments. Different from most traditional component-separation\nmethods which work in the map domain, this new technique treats multifrequency\npower spectra as raw data and can reconstruct component power spectra by taking\nadvantage of distinct components' correlation patterns in the frequency domain.\nWe have validated this new technique for both interferometric and\nsingle-dish-like IM experiments, respectively, using synthesized mock data that\ncontain bright foreground contaminants, IM signals, and instrumental effects at\ndifferent frequencies. The PSDFT approach can effectively remove the bright\nforeground contamination and extract the targeted IM signals using a Bayesian\napproach in a power-spectrum subspace. This new approach can be directly\napplied to a broad range of IM analyses and will be well suited to future\nhigh-quality IM datasets, providing a powerful tool for future IM surveys.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 12:38:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Feng","Chang",""],["Abdalla","Filipe B.",""]]}
{"id":"2308.14778","submitter":"Ross J. Kang","authors":"Stijn Cambie and Penny Haxell and Ross J. Kang and Ronen Wdowinski","title":"A precise condition for independent transversals in bipartite covers","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a bipartite graph $H=(V=V_A\\cup V_B,E)$ in which any vertex in $V_A$\n(resp. $V_B$) has degree at most $D_A$ (resp. $D_B$), suppose there is a\npartition of $V$ that is a refinement of the bipartition $V_A\\cup V_B$ such\nthat the parts in $V_A$ (resp. $V_B$) have size at least $k_A$ (resp. $k_B$).\nWe prove that the condition $D_A/k_A+D_B/k_B\\le 1$ is sufficient for the\nexistence of an independent set of vertices of $H$ that is simultaneously\ntransversal to the partition, and show moreover that this condition is sharp.\nThis result is a bipartite refinement of two well-known results on independent\ntransversals, one due to the second author the other due to Szab\\'o and Tardos.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:34:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cambie","Stijn",""],["Haxell","Penny",""],["Kang","Ross J.",""],["Wdowinski","Ronen",""]]}
{"id":"2308.14779","submitter":"Pierre Matet","authors":"Pierre Matet","title":"Meeting, covering and Shelah's Revised GCH","comments":"arXiv admin note: text overlap with arXiv:2308.14467","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We revisit the application of Shelah's Revised GCH Theorem \\cite{SheRGCH} to\ndiamond. We also formulate a generalization of the theorem and prove a small\nfragment of it. Finally we consider another application of the theorem, to\ncovering numbers of the form cov(-, -, -, $\\omega$).\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 13:42:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Matet","Pierre",""]]}
{"id":"2308.14780","submitter":"Jacob Wahlgren","authors":"Jacob Wahlgren, Gabin Schieffer, Maya Gokhale, Ivy Peng","title":"A Quantitative Approach for Adopting Disaggregated Memory in HPC Systems","comments":"Accepted to SC23 (The International Conference for High Performance\n  Computing, Networking, Storage, and Analysis 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Memory disaggregation has recently been adopted in data centers to improve\nresource utilization, motivated by cost and sustainability. Recent studies on\nlarge-scale HPC facilities have also highlighted memory underutilization. A\npromising and non-disruptive option for memory disaggregation is rack-scale\nmemory pooling, where shared memory pools supplement node-local memory. This\nwork outlines the prospects and requirements for adoption and clarifies several\nmisconceptions. We propose a quantitative method for dissecting application\nrequirements on the memory system from the top down in three levels, moving\nfrom general, to multi-tier memory systems, and then to memory pooling. We\nprovide a multi-level profiling tool and LBench to facilitate the quantitative\napproach. We evaluate a set of representative HPC workloads on an emulated\nplatform. Our results show that prefetching activities can significantly\ninfluence memory traffic profiles. Interference in memory pooling has varied\nimpacts on applications, depending on their access ratios to memory tiers and\narithmetic intensities. Finally, in two case studies, we show the benefits of\nour findings at the application and system levels, achieving 50% reduction in\nremote access and 13% speedup in BFS, and reducing performance variation of\nco-located workloads in interference-aware job scheduling.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:59:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wahlgren","Jacob",""],["Schieffer","Gabin",""],["Gokhale","Maya",""],["Peng","Ivy",""]]}
{"id":"2308.14781","submitter":"L\\'eo Henry","authors":"Tiago Ferreira, L\\'eo Henry, Raquel Fernandes da Silva and Alexandra\n  Silva","title":"Conflict-Aware Active Automata Learning","comments":"37 pages, 11 figures, GandALF 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.FL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Active automata learning algorithms cannot easily handle \\emph{conflict} in\nthe observation data (different outputs observed for the same inputs). This\ninherent inability to recover after a conflict impairs their effective\napplicability in scenarios where noise is present or the system under learning\nis mutating.\n  We propose the Conflict-Aware Active Automata Learning (C3AL) framework to\nenable handling conflicting information during the learning process. The core\nidea is to consider the so-called observation tree as a first-class citizen in\nthe learning process. Though this idea is explored in recent work, we take it\nto its full effect by enabling its use with any existing learner and minimizing\nthe number of tests performed on the system under learning, specially in the\nface of conflicts. We evaluate C3AL in a large set of benchmarks, covering over\n30 different realistic targets, and over 18,000 different scenarios. The\nresults of the evaluation show that C3AL is a suitable alternative framework\nfor closed-box learning that can better handle noise and mutations.targets, and\nover 18,000 different scenarios. The results of the evaluation show that C3AL\nis a suitable alternative framework for closed-box learning that can better\nhandle noise and mutations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 15:50:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ferreira","Tiago",""],["Henry","L\u00e9o",""],["da Silva","Raquel Fernandes",""],["Silva","Alexandra",""]]}
{"id":"2308.14782","submitter":"Julio C. S. Reis","authors":"Julio C. S. Reis, Philipe Melo, Fabiano Bel\\'em, Fabricio Murai,\n  Jussara M. Almeida, Fabricio Benevenuto","title":"Helping Fact-Checkers Identify Fake News Stories Shared through Images\n  on WhatsApp","comments":"This is a preprint version of an accepted manuscript on the Brazilian\n  Symposium on Multimedia and the Web (WebMedia). Please, consider to cite it\n  instead of this one","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  WhatsApp has introduced a novel avenue for smartphone users to engage with\nand disseminate news stories. The convenience of forming interest-based groups\nand seamlessly sharing content has rendered WhatsApp susceptible to the\nexploitation of misinformation campaigns. While the process of fact-checking\nremains a potent tool in identifying fabricated news, its efficacy falters in\nthe face of the unprecedented deluge of information generated on the Internet\ntoday. In this work, we explore automatic ranking-based strategies to propose a\n\"fakeness score\" model as a means to help fact-checking agencies identify fake\nnews stories shared through images on WhatsApp. Based on the results, we design\na tool and integrate it into a real system that has been used extensively for\nmonitoring content during the 2018 Brazilian general election. Our experimental\nevaluation shows that this tool can reduce by up to 40% the amount of effort\nrequired to identify 80% of the fake news in the data when compared to current\nmechanisms practiced by the fact-checking agencies for the selection of news\nstories to be checked.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:12:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Reis","Julio C. S.",""],["Melo","Philipe",""],["Bel\u00e9m","Fabiano",""],["Murai","Fabricio",""],["Almeida","Jussara M.",""],["Benevenuto","Fabricio",""]]}
{"id":"2308.14783","submitter":"Myung Cho","authors":"Myung Cho, Lifeng Lai, Weiyu Xu","title":"Distributed Dual Coordinate Ascent with Imbalanced Data on a General\n  Tree Network","comments":"To be published in IEEE 2023 Workshop on Machine Learning for Signal\n  Processing (MLSP)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we investigate the impact of imbalanced data on the\nconvergence of distributed dual coordinate ascent in a tree network for solving\nan empirical loss minimization problem in distributed machine learning. To\naddress this issue, we propose a method called delayed generalized distributed\ndual coordinate ascent that takes into account the information of the\nimbalanced data, and provide the analysis of the proposed algorithm. Numerical\nexperiments confirm the effectiveness of our proposed method in improving the\nconvergence speed of distributed dual coordinate ascent in a tree network.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:21:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cho","Myung",""],["Lai","Lifeng",""],["Xu","Weiyu",""]]}
{"id":"2308.14784","submitter":"Gianluca Truda","authors":"Gianluca Truda","title":"Generating tabular datasets under differential privacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CR cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Machine Learning (ML) is accelerating progress across fields and industries,\nbut relies on accessible and high-quality training data. Some of the most\nimportant datasets are found in biomedical and financial domains in the form of\nspreadsheets and relational databases. But this tabular data is often sensitive\nin nature. Synthetic data generation offers the potential to unlock sensitive\ndata, but generative models tend to memorise and regurgitate training data,\nwhich undermines the privacy goal. To remedy this, researchers have\nincorporated the mathematical framework of Differential Privacy (DP) into the\ntraining process of deep neural networks. But this creates a trade-off between\nthe quality and privacy of the resulting data. Generative Adversarial Networks\n(GANs) are the dominant paradigm for synthesising tabular data under DP, but\nsuffer from unstable adversarial training and mode collapse, which are\nexacerbated by the privacy constraints and challenging tabular data modality.\nThis work optimises the quality-privacy trade-off of generative models,\nproducing higher quality tabular datasets with the same privacy guarantees. We\nimplement novel end-to-end models that leverage attention mechanisms to learn\nreversible tabular representations. We also introduce TableDiffusion, the first\ndifferentially-private diffusion model for tabular data synthesis. Our\nexperiments show that TableDiffusion produces higher-fidelity synthetic\ndatasets, avoids the mode collapse problem, and achieves state-of-the-art\nperformance on privatised tabular data synthesis. By implementing\nTableDiffusion to predict the added noise, we enabled it to bypass the\nchallenges of reconstructing mixed-type tabular data. Overall, the diffusion\nparadigm proves vastly more data and privacy efficient than the adversarial\nparadigm, due to augmented re-use of each data batch and a smoother iterative\ntraining process.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:35:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Truda","Gianluca",""]]}
{"id":"2308.14785","submitter":"Nathakhun Wiroonsri","authors":"Nathakhun Wiroonsri and Onthada Preedasawakul","title":"A correlation-based fuzzy cluster validity index with secondary options\n  detector","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The optimal number of clusters is one of the main concerns when applying\ncluster analysis. Several cluster validity indexes have been introduced to\naddress this problem. However, in some situations, there is more than one\noption that can be chosen as the final number of clusters. This aspect has been\noverlooked by most of the existing works in this area. In this study, we\nintroduce a correlation-based fuzzy cluster validity index known as the\nWiroonsri-Preedasawakul (WP) index. This index is defined based on the\ncorrelation between the actual distance between a pair of data points and the\ndistance between adjusted centroids with respect to that pair. We evaluate and\ncompare the performance of our index with several existing indexes, including\nXie-Beni, Pakhira-Bandyopadhyay-Maulik, Tang, Wu-Li, generalized C, and Kwon2.\nWe conduct this evaluation on four types of datasets: artificial datasets,\nreal-world datasets, simulated datasets with ranks, and image datasets, using\nthe fuzzy c-means algorithm. Overall, the WP index outperforms most, if not\nall, of these indexes in terms of accurately detecting the optimal number of\nclusters and providing accurate secondary options. Moreover, our index remains\neffective even when the fuzziness parameter $m$ is set to a large value. Our R\npackage called WPfuzzyCVIs used in this work is also available in\nhttps://github.com/nwiroonsri/WPfuzzyCVIs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 16:40:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wiroonsri","Nathakhun",""],["Preedasawakul","Onthada",""]]}
{"id":"2308.14786","submitter":"Mark Berger","authors":"Nils B\\\"ohne, Mark Berger, Ronald van Velzen","title":"Extending Cross-Modal Retrieval with Interactive Learning to Improve\n  Image Retrieval Performance in Forensics","comments":"Submitted to the AAAI22 conference","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nowadays, one of the critical challenges in forensics is analyzing the\nenormous amounts of unstructured digital evidence, such as images. Often,\nunstructured digital evidence contains precious information for forensic\ninvestigations. Therefore, a retrieval system that can effectively identify\nforensically relevant images is paramount. In this work, we explored the\neffectiveness of interactive learning in improving image retrieval performance\nin the forensic domain by proposing Excalibur - a zero-shot cross-modal image\nretrieval system extended with interactive learning. Excalibur was evaluated\nusing both simulations and a user study. The simulations reveal that\ninteractive learning is highly effective in improving retrieval performance in\nthe forensic domain. Furthermore, user study participants could effectively\nleverage the power of interactive learning. Finally, they considered Excalibur\neffective and straightforward to use and expressed interest in using it in\ntheir daily practice.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:07:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["B\u00f6hne","Nils",""],["Berger","Mark",""],["van Velzen","Ronald",""]]}
{"id":"2308.14787","submitter":"Pierre Matet","authors":"Pierre Matet","title":"$\\mu$-Clubs of $P_\\kappa (\\lambda)$ : Paradise in heaven","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Let $\\mu < \\kappa < \\lambda$ be three infinite cardinals, the first two being\nregular. We show that if there is no inner model with large cardinals, $u\n(\\kappa, \\lambda)$ is regular, where $u (\\kappa, \\lambda)$ denotes the least\nsize of a cofinal subset in $(P_\\kappa (\\lambda), \\subseteq)$, and cf$(\\lambda)\n\\not= \\mu$, then (a) the $\\mu$-club filters on $P_\\kappa (\\lambda)$ and\n$P_\\kappa (u (\\kappa, \\lambda))$ are isomorphic, and (b) the ideal dual to the\n$\\mu$-club filter on $P_\\kappa (\\lambda)$ (and hence the restriction of the\nnonstationary ideal on $P_\\kappa (\\lambda)$ to sets of uniform cofinality\n$\\mu$) is not $I_{\\kappa, \\lambda}$-$\\frak{b}_{u (\\kappa, \\lambda)}$-saturated.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:39:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Matet","Pierre",""]]}
{"id":"2308.14788","submitter":"Christopher Timms","authors":"Christopher I. Timms","title":"Floquet Topology Stabilized with Non-Hermitian Driving","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study presents a mechanism that enables the stabilization of Floquet\nsystems indefintely; albeit in a manner that allows for noise during each\nFloquet cycle. This is due to the fact that external qubits are added after\neach Floquet cycle and these external qubits obtain information about the\nFloquet system (in this case the Floquet system is the Anomalous\nFloquet-Anderson Insulator). This information is used to correct the system for\nnoise after which these qubits are removed. The fact that these external qubits\nare added and then removed after performing operations on the system is what\nallows for this process to be referred to as non-Hermitian driving. The\nexternal qubits effectively act to carry away entropy of the system and\ntherefore allow for the Floquet system to be cooled. In addition, another\nmechanism is found where the periodic implementation of entanglement for every\nsite of the system at a high frequency during the normal time evolution allows\nfor the system to be highly localized in a manner similar to Anderson\nlocalization.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:55:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Timms","Christopher I.",""]]}
{"id":"2308.14789","submitter":"Sebastian Mizera","authors":"Sebastian Mizera","title":"Scattering with Neural Operators","comments":"5 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cs.LG physics.comp-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent advances in machine learning establish the ability of certain\nneural-network architectures called neural operators to approximate maps\nbetween function spaces. Motivated by a prospect of employing them in\nfundamental physics, we examine applications to scattering processes in quantum\nmechanics. We use an iterated variant of Fourier neural operators to learn the\nphysics of Schr\\\"odinger operators, which map from the space of initial wave\nfunctions and potentials to the final wave functions. These deep operator\nlearning ideas are put to test in two concrete problems: a neural operator\npredicting the time evolution of a wave packet scattering off a central\npotential in $1+1$ dimensions, and the double-slit experiment in $2+1$\ndimensions. At inference, neural operators can become orders of magnitude more\nefficient compared to traditional finite-difference solvers.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mizera","Sebastian",""]]}
{"id":"2308.14790","submitter":"Victoria Fawcett","authors":"V. A. Fawcett, D. M. Alexander, A. Brodzeller, A. C. Edge, D. J.\n  Rosario, A. D. Myers, J. Aguilar, S. Ahlen, R. Alfarsy, D. Brooks, R.\n  Canning, C. Circosta, K. Dawson, A. de la Macorra, P. Doel, K. Fanning, A.\n  Font-Ribera, J. E. Forero-Romero, S. Gontcho A Gontcho, J. Guy, C. M.\n  Harrison, K. Honscheid, S. Juneau, R. Kehoe, T. Kisner, A. Kremin, M.\n  Landriau, M. Manera, A. M. Meisner, R. Miquel, J. Moustakas, J. Nie, W. J.\n  Percival, C. Poppett, R. Pucha, G. Rossi, D. Schlegel, M. Siudek, G. Tarl\\'e,\n  B. A. Weaver, Z. Zhou, H. Zou","title":"A striking relationship between dust extinction and radio detection in\n  DESI QSOs: evidence for a dusty blow-out phase in red QSOs","comments":"21 pages, 17 figures, 6 tables, accepted by MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present the first eight months of data from our secondary target program\nwithin the ongoing Dark Energy Spectroscopic Instrument (DESI) survey. Our\nprogram uses a mid-infrared and optical colour selection to preferentially\ntarget dust-reddened QSOs that would have otherwise been missed by the nominal\nDESI QSO selection. So far we have obtained optical spectra for 3038\ncandidates, of which ~70% of the high-quality objects (those with robust\nredshifts) are visually confirmed to be Type 1 QSOs, consistent with the\nexpected fraction from the main DESI QSO survey. By fitting a dust-reddened\nblue QSO composite to the QSO spectra, we find they are well-fitted by a normal\nQSO with up to Av~4 mag of line-of-sight dust extinction. Utilizing radio data\nfrom the LOFAR Two-metre Sky Survey (LoTSS) DR2, we identify a striking\npositive relationship between the amount of line-of-sight dust extinction\ntowards a QSO and the radio detection fraction, that is not driven by\nradio-loud systems, redshift and/or luminosity effects. This demonstrates an\nintrinsic connection between dust reddening and the production of radio\nemission in QSOs, whereby the radio emission is most likely due to low-powered\njets or winds/outflows causing shocks in a dusty environment. On the basis of\nthis evidence we suggest that red QSOs may represent a transitional \"blow-out\"\nphase in the evolution of QSOs, where winds and outflows evacuate the dust and\ngas to reveal an unobscured blue QSO.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fawcett","V. A.",""],["Alexander","D. M.",""],["Brodzeller","A.",""],["Edge","A. C.",""],["Rosario","D. J.",""],["Myers","A. D.",""],["Aguilar","J.",""],["Ahlen","S.",""],["Alfarsy","R.",""],["Brooks","D.",""],["Canning","R.",""],["Circosta","C.",""],["Dawson","K.",""],["de la Macorra","A.",""],["Doel","P.",""],["Fanning","K.",""],["Font-Ribera","A.",""],["Forero-Romero","J. E.",""],["Gontcho","S. Gontcho A",""],["Guy","J.",""],["Harrison","C. M.",""],["Honscheid","K.",""],["Juneau","S.",""],["Kehoe","R.",""],["Kisner","T.",""],["Kremin","A.",""],["Landriau","M.",""],["Manera","M.",""],["Meisner","A. M.",""],["Miquel","R.",""],["Moustakas","J.",""],["Nie","J.",""],["Percival","W. J.",""],["Poppett","C.",""],["Pucha","R.",""],["Rossi","G.",""],["Schlegel","D.",""],["Siudek","M.",""],["Tarl\u00e9","G.",""],["Weaver","B. A.",""],["Zhou","Z.",""],["Zou","H.",""]]}
{"id":"2308.14791","submitter":"Antonino Marasco","authors":"A. Marasco, B. M. Poggianti, J. Fritz, A. Werle, B. Vulcani, A.\n  Moretti, M. Gullieuszik and A. Kulier","title":"The morphological transformation of ram pressure stripped galaxies: a\n  pathway from late to early galaxy types","comments":"19 pages, 11 figures, accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate how the ageing of stellar populations can drive a\nmorphological transformation in galaxies whose star formation (SF) activity has\nbeen quenched on short timescales, like in cluster galaxies subject to ram\npressure stripping from the intracluster medium. For this purpose, we use a\nsample of 91 galaxies with MUSE data from the GASP program and of their\nspatially resolved SF history derived with the spectral modelling software\nSINOPSIS. We simulate the future continuation of the SF activities by exploring\ntwo quenching scenarios: an instantaneous truncation of the SF across the whole\ndisc, and an outside-in quenching with typical stripping timescales of 0.5 Gyr\nand 1 Gyr. For each scenario we produce mock MUSE spectroscopic datacubes and\noptical images for our galaxies during their evolution, and classify their\nmorphology using a new diagnostic tool, calibrated on cluster galaxies from the\nOmegaWINGS Survey. We find that, in all scenarios considered, the initial\ngalaxy population dominated by blue-cloud spirals (90%) evolves into a mixed\npopulation mostly composed by red-sequence spirals (50-55%) and lenticulars\n(~40%). The morphology transformation is completed after just 1.5-3.5 Gyr,\nproceeding faster in more efficient quenching scenarios. Our results indicate\nthat, even without accounting for dynamical processes, SF quenching caused by\nthe harsh environment of a cluster can significantly affect the morphology of\nthe infalling galaxy population on timescales of a few Gyr.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Marasco","A.",""],["Poggianti","B. M.",""],["Fritz","J.",""],["Werle","A.",""],["Vulcani","B.",""],["Moretti","A.",""],["Gullieuszik","M.",""],["Kulier","A.",""]]}
{"id":"2308.14792","submitter":"Hiroki Nagakura","authors":"Hiroki Nagakura and David Vartanyan","title":"Correlation analysis of gravitational waves and neutrino signals to\n  constrain neutrino flavor conversion in core-collapse supernova","comments":"9 pages, 4 figures, accepted to PRD","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE gr-qc hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent multi-dimensional (multi-D) core-collapse supernova (CCSN) simulations\ncharacterize gravitational waves (GWs) and neutrino signals, offering insight\ninto universal properties of CCSN independent of progenitor. Neutrino analysis\nin real observations, however, will be complicated due to the ambiguity of\nself-induced neutrino flavor conversion (NFC), which poses an obstacle to\nextracting detailed physical information. In this paper, we propose a novel\napproach to place a constraint on NFC from observed quantities of GWs and\nneutrinos based on correlation analysis from recent, detailed multi-D CCSN\nsimulations. The proposed method can be used even in cases with low\nsignificance - or no detection of GWs. We also discuss how we can utilize\nelectro-magnetic observations to complement the proposed method. Although our\nproposed method has uncertainties associated with CCSN modeling, the present\nresult will serve as a base for more detailed studies. Reducing the systematic\nerrors involved in CCSN models is a key to success in this multi-messenger\nanalysis that needs to be done in collaboration with different theoretical\ngroups.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nagakura","Hiroki",""],["Vartanyan","David",""]]}
{"id":"2308.14793","submitter":"Connor Bottrell","authors":"Connor Bottrell, Hassen M. Yesuf, Gerg\\\"o Popping, Kiyoaki Christopher\n  Omori, Shenli Tang, Xuheng Ding, Annalisa Pillepich, Dylan Nelson, Lukas\n  Eisert, Hua Gao, Andy D. Goulding, Boris S. Kalita, Wentao Luo, Jenny E.\n  Greene, Jingjing Shi, and John D. Silverman","title":"IllustrisTNG in the HSC-SSP: image data release and the major role of\n  mini mergers as drivers of asymmetry and star formation","comments":"32 pages; 18 figures; submitted to MNRAS; Image data available via\n  the TNG website: www.tng-project.org/bottrell23","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  At fixed galaxy stellar mass, there is a clear observational connection\nbetween structural asymmetry and offset from the star forming main sequence,\n$\\Delta$SFMS. Herein, we use the TNG50 simulation to investigate the relative\nroles of major mergers (stellar mass ratios $\\mu\\geq0.25$), minor ($0.1 \\leq\n\\mu < 0.25$), and mini mergers ($0.01 \\leq \\mu < 0.1$) in driving this\nconnection amongst star forming galaxies (SFGs). We use dust radiative transfer\npost-processing with SKIRT to make a large, public collection of synthetic\nHyper Suprime-Cam Subaru Strategic Program (HSC-SSP) images of simulated TNG\ngalaxies over $0.1\\leq z \\leq 0.7$ with $\\log M_{\\star} /\n\\mathrm{M}_{\\odot}\\geq9$ ($\\sim750$k images). Using their instantaneous SFRs,\nknown merger histories/forecasts, and HSC-SSP asymmetries, we show (1) that\nTNG50 SFGs qualitatively reproduce the observed trend between $\\Delta$SFMS and\nasymmetry and (2) a strikingly similar trend emerges between $\\Delta$SFMS and\nthe time-to-coalescence for mini mergers. Controlling for redshift, stellar\nmass, environment, and gas fraction, we show that individual mini merger events\nyield small enhancements in SFRs and asymmetries that are sustained on long\ntimescales (at least $\\sim3$ Gyr after coalescence, on average) -- in contrast\nto major/minor merger remnants which peak at much greater amplitudes but are\nconsistent with controls only $\\sim1$ Gyr after coalescence. Integrating the\nboosts in SFRs and asymmetries driven by $\\mu\\geq0.01$ mergers since $z=0.7$ in\nTNG50 SFGs, we show that mini mergers are responsible for (i) $55$ per cent of\nall merger-driven star formation and (ii) $70$ per cent of merger-driven\nasymmetric structure. Due to their relative frequency and prolonged boost\ntimescales, mini mergers dominate over their minor and major counterparts in\ndriving star formation and asymmetry in SFGs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bottrell","Connor",""],["Yesuf","Hassen M.",""],["Popping","Gerg\u00f6",""],["Omori","Kiyoaki Christopher",""],["Tang","Shenli",""],["Ding","Xuheng",""],["Pillepich","Annalisa",""],["Nelson","Dylan",""],["Eisert","Lukas",""],["Gao","Hua",""],["Goulding","Andy D.",""],["Kalita","Boris S.",""],["Luo","Wentao",""],["Greene","Jenny E.",""],["Shi","Jingjing",""],["Silverman","John D.",""]]}
{"id":"2308.14794","submitter":"Shlomo Tamir Zach Cahlon","authors":"Shlomo Cahlon, Catherine Zucker, Alyssa Goodman, Charles Lada, Jo\\~ao\n  Alves","title":"A Parsec-Scale Catalog of Molecular Clouds in the Solar Neighborhood\n  Based on 3D Dust Mapping: Implications for the Mass-Size Relation","comments":"Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We dendrogram the Leike et al. 2020 3D dust map, leveraging its $\\sim 1$ pc\nspatial resolution to produce a uniform catalog of molecular clouds in the\nsolar neighborhood. Using accurate distances, we measure the properties of 65\nclouds in true 3D space, eliminating much of the uncertainty in mass, size, and\ndensity. Clouds in the catalog contain a total of $1.1 \\times 10^5 \\; \\rm\nM_{\\odot}$, span distances of $116-440$ pc, and include a dozen well-studied\nclouds in the literature. In addition to deriving cloud properties in 3D volume\ndensity space, we create 2D dust extinction maps from the 3D data by projecting\nthe 3D clouds onto a 2D \"Sky\" view. We measure the properties of the 2D clouds\nseparately from those of the 3D clouds. Using the 2D and 3D derived results, we\ncompare the scaling relation between the masses and sizes of clouds following\nLarson 1981. We find that our 2D projected mass-size relation, $M \\propto\nr^{2.1}$, agrees with Larson's Third Relation, but our 3D derived properties\nlead to a scaling relation of about one order larger: $M \\propto r^{2.9}$.\nValidating predictions from numerical simulations and analytic theory, our\nresults indicate that the mass-size relation is sensitive to whether column or\nvolume density is used to define clouds, since mass scales with area in 2D\nspace ($M \\propto r^{2}$) and with volume in 3D space ($M \\propto r^{3}$). Our\nresults imply a roughly constant column and volume density for molecular\nclouds, as would be expected for clouds where the lower density, larger\nvolume-filling gas dominates the cloud mass budget.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cahlon","Shlomo",""],["Zucker","Catherine",""],["Goodman","Alyssa",""],["Lada","Charles",""],["Alves","Jo\u00e3o",""]]}
{"id":"2308.14795","submitter":"Omri Lesser","authors":"Omri Lesser, Ady Stern, Yuval Oreg","title":"Josephson junction arrays as a platform for topological phases of matter","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Two-dimensional arrays of superconductors separated by normal metallic\nregions exhibit rich phenomenology and a high degree of controllability. We\nestablish such systems as platforms for topological phases of matter, and in\nparticular chiral topological superconductivity. We propose and theoretically\nanalyze several minimal models for this chiral phase based on commonly\navailable superconductor-semiconductor heterostructures. The topological\ntransitions can be adjusted using a time-reversal-symmetry breaking knob, which\ncan be activated by controlling the phases in the islands, introducing flux\nthrough the system, or applying an in-plane exchange field. We demonstrate\ntransport signatures of the chiral topological phase that are unlikely to be\nmimicked by local non-topological effects. The flexibility and tunability of\nour platforms, along with the clear-cut experimental fingerprints, make for a\nviable playground for exploring chiral superconductivity in two dimensions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lesser","Omri",""],["Stern","Ady",""],["Oreg","Yuval",""]]}
{"id":"2308.14796","submitter":"Jaime Redondo-Yuste","authors":"Jaime Redondo-Yuste, Gregorio Carullo, Justin L. Ripley, Emanuele\n  Berti and Vitor Cardoso","title":"Spin dependence of black hole ringdown nonlinearities","comments":"12 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The nonlinear character of general relativity leaves its imprint in the\ncoalescence of two black holes, from the inspiral to the final ringdown stage.\nTo quantify the impact of nonlinearities, we work at second order in black hole\nperturbation theory and we study the excitation of second-order modes relative\nto the first-order modes that drive them as we vary the black hole spin and the\ninitial data for the perturbations. The relative amplitude of second-order\nmodes is only mildly dependent on the initial data that we consider, but it\nstrongly decreases for large black hole spins. This implies that the\nextrapolation of calculations based on the Kerr-CFT correspondence to\nsubextremal Kerr black holes should be viewed with caution\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Redondo-Yuste","Jaime",""],["Carullo","Gregorio",""],["Ripley","Justin L.",""],["Berti","Emanuele",""],["Cardoso","Vitor",""]]}
{"id":"2308.14797","submitter":"Markus B. Fr\\\"ob","authors":"Markus B. Fr\\\"ob","title":"Modular Hamiltonian for de Sitter diamonds","comments":"57 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine the Tomita-Takesaki modular data for CFTs in double cone and\nlight cone regions in conformally flat spacetimes. This includes in particular\nthe modular Hamiltonian for diamonds in the de Sitter spacetime. In the limit\nwhere the diamonds become large, we show that the modular automorphisms become\ntime translations in the static patch. As preparation, we also provide a\npedagogical rederivation of the known results for Minkowski spacetime. With our\nresults and using the Araki formula, it becomes possible to compute relative\nentanglement entropies for CFTs in these regions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fr\u00f6b","Markus B.",""]]}
{"id":"2308.14798","submitter":"Takafumi Tsukui","authors":"Takafumi Tsukui, Emily Wisnioski, Joss Bland-Hawthorn, Yifan Mai,\n  Satoru Iguchi, Junichi Baba, Ken Freeman","title":"Detecting a disk bending wave in a barred-spiral galaxy at redshift 4.4","comments":"Submitted to MNRAS. We welcome comments!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The recent discovery of barred spiral galaxies in the early universe ($z>2$)\nposes questions of how these structures form and how they influence galaxy\nproperties in the early universe. In this study, we investigate the morphology\nand kinematics of the far infrared (FIR) continuum and [CII] emission in\nBRI1335-0417 at $z\\approx 4.4$ from ALMA observations. The variations in\nposition angle and ellipticity of the isophotes show the characteristic\nsignature of a barred galaxy. The bar, $3.3^{+0.2}_{-0.2}$ kpc long in radius\nand bridging the previously identified two-armed spiral, is evident in both\n[CII] and FIR images, driving the galaxy's rapid evolution by channelling gas\ntowards the nucleus. Fourier analysis of the [CII] velocity field reveals an\nunambiguous $m=2$ mode with a line-of-sight velocity amplitude of up to\n$\\sim30-40$ km s$^{-1}$; the plausible explanation is the disk's vertical\nbending mode triggered by external perturbation, which presumably induced the\nhigh star formation rate and the bar/spiral structure. The bar identified in\n[CII] and FIR images of the gas-rich disk galaxy ($\\gtrsim 70$\\% of the total\nmass within radius $R\\approx 2.2$ disk scale lengths) suggests a new\nperspective of early bar formation -- a gravitationally unstable gas-rich disk\ncreating a star-forming gaseous bar, rather than a stellar bar emerging from a\npre-existing stellar disk.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tsukui","Takafumi",""],["Wisnioski","Emily",""],["Bland-Hawthorn","Joss",""],["Mai","Yifan",""],["Iguchi","Satoru",""],["Baba","Junichi",""],["Freeman","Ken",""]]}
{"id":"2308.14799","submitter":"Julia Bodensteiner","authors":"J. Bodensteiner, H. Sana, P. L. Dufton, C. Wang, N. Langer, G.\n  Banyard, L. Mahy, A. de Koter, S. E. de Mink, C. J. Evans, Y. G\\\"otberg, V.\n  H\\'enault-Brunet, L. R. Patrick, F. R. N. Schneider","title":"The young massive SMC cluster NGC 330 seen by MUSE III. Stellar\n  parameters and rotational velocities","comments":"18 pages (incl. appendix), 15 figures, 3 tables, accepted for\n  publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The origin of initial rotation rates of stars, and how a star's surface\nrotational velocity changes during the evolution, either by internal angular\nmomentum transport or due to interactions with a binary companion, remain open\nquestions in stellar astrophysics. Here, we aim to derive the physical\nparameters and study the distribution of (projected) rotational velocities of\nB-type stars in the 35 Myr-old, massive cluster NGC 330 in the Small Magellanic\nCloud. NGC 330 is in an age range where the number of post-interaction binaries\nis predicted to be high near the cluster turnoff (TO). We develop a\nsimultaneous photometric and spectroscopic grid-fitting method adjusting\natmosphere models on multi-band Hubble Space Telescope photometry and Multi\nUnit Spectroscopic Explorer spectroscopy. This allows us to homogeneously\nconstrain the physical parameters of over 250 B and Be stars, brighter than\nmF814W = 18.8 mag. The rotational velocities of Be stars in NGC 330 are\nsignificantly higher than the ones of B stars. The rotational velocities vary\nas a function of the star's position in the color-magnitude diagram,\nqualitatively following predictions of binary population synthesis. A\ncomparison to younger clusters shows that stars in NGC 330 rotate more rapidly\non average. The rotational velocities of the 35 Myr old population in NGC 330\nquantitatively agree with predictions for a stellar population that underwent\nsignificant binary interactions: the bulk of the B stars could be single stars\nor primaries in pre-interaction binaries. The rapidly spinning Be stars could\nbe mass and angular momentum gainers in previous interactions, while those Be\nstars close to the TO may be spun-up single stars. The slowly rotating,\napparently single stars above the TO could be merger products. The different\nvsini-characteristics of NGC 330 compared to younger populations can be\nunderstood in this framework.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bodensteiner","J.",""],["Sana","H.",""],["Dufton","P. L.",""],["Wang","C.",""],["Langer","N.",""],["Banyard","G.",""],["Mahy","L.",""],["de Koter","A.",""],["de Mink","S. E.",""],["Evans","C. J.",""],["G\u00f6tberg","Y.",""],["H\u00e9nault-Brunet","V.",""],["Patrick","L. R.",""],["Schneider","F. R. N.",""]]}
{"id":"2308.14800","submitter":"Hiroki Nagakura","authors":"Hiroki Nagakura and Masamichi Zaizen","title":"Basic characteristics of neutrino flavor conversions in the post-shock\n  regions of core-collapse supernova","comments":"22 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE hep-ph nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One of the active debates in core-collapse supernova (CCSN) theory is how\nsignificantly neutrino flavor conversions induced by neutrino-neutrino\nself-interactions change the conventional picture of CCSN dynamics. Recent\nstudies have indicated that strong flavor conversions can occur inside neutrino\nspheres where neutrinos are tightly coupled to matter. These flavor conversions\nare associated with either collisional instability or fast neutrino-flavor\nconversion (FFC) or both. The impact of these flavor conversions on CCSN\ndynamics is, however, still highly uncertain due to the lack of global\nsimulations of quantum kinetic neutrino transport with appropriate\nmicrophysical inputs. Given fluid profiles from a recent CCSN model at three\ndifferent time snapshots in the early post-bounce phase, we perform global\nquantum kinetic simulations in spherical symmetry with an essential set of\nmicrophysics. We find that strong flavor conversions occur in optically thick\nregions, resulting in a substantial change of neutrino radiation field. The\nneutrino heating in the gain region is smaller than the case with no flavor\nconversions, whereas the neutrino cooling in the optically thick region is\ncommonly enhanced. Based on the neutrino data obtained from our multi-angle\nneutrino transport simulations, we also assess some representative classical\nclosure relations by applying them to diagonal components of density matrix of\nneutrinos. We find that Eddington tensors can be well approximated by these\nclosure relations except for the region where flavor conversions occur vividly.\nWe also analyze the neutrino signal by carrying out detector simulations for\nSuper-Kamiokande, DUNE, and JUNO. We propose a useful strategy to identify the\nsign of flavor conversions in neutrino signal, that can be easily implemented\nin real data analyses of CCSN neutrinos.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nagakura","Hiroki",""],["Zaizen","Masamichi",""]]}
{"id":"2308.14801","submitter":"Avraham Klein","authors":"Xi Wang, Anirban Kundu, Bochao Xu, Sajna Hameed, Ilya Sochnikov,\n  Damjan Pelc, Martin Greven, Avraham Klein, and Beena Kalisky","title":"Multiferroicity in plastically deformed SrTiO$_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.mtrl-sci cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A major challenge in the development of quantum technologies is to induce\nadditional types of ferroic orders into materials that exhibit other useful\nquantum properties. Various techniques have been applied to this end, such as\nelastically straining, doping, or interfacing a compound with other materials.\nPlastic deformation introduces permanent topological defects and large local\nstrains into a material, which can give rise to qualitatively new\nfunctionality. Here we show via local magnetic imaging that plastic deformation\ninduces robust magnetism in the quantum paraelectric SrTiO3, in both conducting\nand insulating samples. Our analysis indicates that the magnetic order is\nlocalized along dislocation walls and coexists with polar order along the\nwalls. The magnetic signals can be switched on and off in a controllable manner\nwith external stress, which demonstrates that plastically deformed SrTiO3 is a\nquantum multiferroic. These results establish plastic deformation as a\nversatile platform for quantum materials engineering.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Xi",""],["Kundu","Anirban",""],["Xu","Bochao",""],["Hameed","Sajna",""],["Sochnikov","Ilya",""],["Pelc","Damjan",""],["Greven","Martin",""],["Klein","Avraham",""],["Kalisky","Beena",""]]}
{"id":"2308.14802","submitter":"Zhehan Qin","authors":"Zhehan Qin, Zhong-Zhi Xianyu","title":"Nonanalyticity and On-Shell Factorization of Inflation Correlators at\n  All Loop Orders","comments":"72 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The dynamics of quantum fields during cosmic inflation can be probed via\ntheir late-time boundary correlators. The analytic structure of these boundary\ncorrelators contains rich physical information of bulk dynamics, and is also\nclosely related to cosmological collider observables. In this work, we study a\nparticular type of nonanalytic behavior, called nonlocal signals, for inflation\ncorrelators with massive exchanges at arbitrary loop orders. We propose a\nsignal-detection algorithm to identify all possible sources of nonlocal signals\nin an arbitrary loop graph, and prove that the algorithm is exhaustive. We then\npresent several versions of the on-shell factorization theorem for the leading\nnonlocal signal in graphs with arbitrary number of loops, and provide the\nexplicit analytical expression for the leading nonlocal signal. We also\ngeneralize the nonlocal-signal cutting rule to arbitrary loop graphs. Finally,\nwe provide many explicit examples to demonstrate the use of our results,\nincluding an n-loop melon graph and a variety of 2-loop graphs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Qin","Zhehan",""],["Xianyu","Zhong-Zhi",""]]}
{"id":"2308.14803","submitter":"Tjarda Boekholt","authors":"Tjarda C. N. Boekholt, Simon F. Portegies Zwart and Douglas C. Heggie","title":"Punctuated Chaos and Indeterminism in Self-gravitating Many-body Systems","comments":"Essay written for the Gravity Research Foundation 2023 Awards for\n  Essays on Gravitation (Honorable Mention). Accepted by International Journal\n  of Modern Physics D","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.GA nlin.CD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dynamical chaos is a fundamental manifestation of gravity in astrophysical,\nmany-body systems. The spectrum of Lyapunov exponents quantifies the associated\nexponential response to small perturbations. Analytical derivations of these\nexponents are critical for understanding the stability and predictability of\nobserved systems. This essay presents a new model for chaos in systems with\neccentric and crossing orbits. Here, exponential divergence is not a continuous\nprocess but rather the cumulative effect of an ever-increasing linear response\ndriven by discrete events at regular intervals, i.e., punctuated chaos. We show\nthat long-lived systems with punctuated chaos can magnify Planck length\nperturbations to astronomical scales within their lifetime, rendering them\nfundamentally indeterministic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Boekholt","Tjarda C. N.",""],["Zwart","Simon F. Portegies",""],["Heggie","Douglas C.",""]]}
{"id":"2308.14804","submitter":"Jacob Lustig-Yaeger","authors":"Jacob Lustig-Yaeger, Victoria S. Meadows, David Crisp, Michael R.\n  Line, Tyler D. Robinson","title":"Earth as a Transiting Exoplanet: A Validation of Transmission\n  Spectroscopy and Atmospheric Retrieval Methodologies for Terrestrial\n  Exoplanets","comments":"37 pages, 14 figures, 9 tables. Accepted for publication in PSJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.IM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The James Webb Space Telescope (JWST) will enable the search for and\ncharacterization of terrestrial exoplanet atmospheres in the habitable zone via\ntransmission spectroscopy. However, relatively little work has been done to use\nsolar system data, where ground truth is known, to validate spectroscopic\nretrieval codes intended for exoplanet studies, particularly in the limit of\nhigh resolution and high signal-to-noise (S/N). In this work, we perform such a\nvalidation by analyzing a high S/N empirical transmission spectrum of Earth\nusing a new terrestrial exoplanet atmospheric retrieval model with heritage in\nSolar System remote sensing and gaseous exoplanet retrievals. We fit the\nEarth's 2-14 um transmission spectrum in low resolution (R=250 at 5 um) and\nhigh resolution (R=100,000 at 5 um) under a variety of assumptions about the 1D\nvertical atmospheric structure. In the limit of noiseless transmission spectra,\nwe find excellent agreement between model and data (deviations < 10%) that\nenable the robust detection of H2O, CO2, O3, CH4, N2, N2O, NO2, HNO3, CFC-11,\nand CFC-12 thereby providing compelling support for the detection of\nhabitability, biosignature, and technosignature gases in the atmosphere of the\nplanet using an exoplanet-analog transmission spectrum. Our retrievals at high\nspectral resolution show a marked sensitivity to the thermal structure of the\natmosphere, trace gas abundances, density-dependent effects, such as\ncollision-induced absorption and refraction, and even hint at 3D spatial\neffects. However, we used synthetic observations of TRAPPIST-1e to verify that\nthe use of simple 1D vertically homogeneous atmospheric models will likely\nsuffice for JWST observations of terrestrial exoplanets transiting M dwarfs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:00:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lustig-Yaeger","Jacob",""],["Meadows","Victoria S.",""],["Crisp","David",""],["Line","Michael R.",""],["Robinson","Tyler D.",""]]}
{"id":"2308.14805","submitter":"Sangjun Cha","authors":"Sangjun Cha, Kim HyeongHan, Zachary P. Scofield, Hyungjin Joo, and M.\n  James Jee","title":"Precision ${\\tt MARS}$ Mass Reconstruction of Abell 2744: Synergizing\n  the Largest Strong Lensing and Densest Weak Lensing Datasets from JWST","comments":"27 pages, 19 figures, 3 tables, Submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a new high-resolution free-form mass model of Abell 2744,\ncombining both weak-lensing (WL) and strong-lensing (SL) datasets from JWST.\nThe SL dataset comprises 286 multiple images, presenting the most extensive SL\nconstraint to date for a single cluster. The WL dataset, employing photo-$z$\nselection, yields a source density of ~ 350 arcmin$^{-2}$, marking the densest\nWL constraint ever. The combined mass reconstruction enables the\nhighest-resolution mass map of Abell 2744 within the ~ 1.8 Mpc$\\times$1.8 Mpc\nreconstruction region to date, revealing the isosceles triangular structure\nwith two legs of ~ 1 Mpc and a base of ~ 0.6 Mpc. Although our algorithm\nMAximum-entropy ReconStruction (${\\tt MARS}$) is entirely blind to the cluster\ngalaxy distribution, the resulting mass reconstruction remarkably well traces\nthe brightest cluster galaxies with the five strongest mass peaks coinciding\nwith the five most luminous cluster galaxies. We do not detect any unusual mass\npeaks that are not traced by the cluster galaxies, unlike the findings in\nprevious studies. Our mass model shows the smallest scatters of SL multiple\nimages in both source (~0\".05) and image (~0\".1) planes, which are lower than\nthe previous studies by a factor of ~ 4. Although ${\\tt MARS}$ represents the\nmass field with an extremely large number of ~ 300,000 free parameters, it\nconverges to a solution within a few hours thanks to our utilization of the\ndeep learning technique. We make our mass and magnification maps publicly\navailable.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:01:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cha","Sangjun",""],["HyeongHan","Kim",""],["Scofield","Zachary P.",""],["Joo","Hyungjin",""],["Jee","M. James",""]]}
{"id":"2308.14806","submitter":"Wentao Xu","authors":"Wentao Xu, Kazutoshi Sasahara","title":"Domain-based user embedding for competing events on social media","comments":"Computational social science application","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Online social networks offer vast opportunities for computational social\nscience, but effective user embedding is crucial for downstream tasks.\nTraditionally, researchers have used pre-defined network-based user features,\nsuch as degree, and centrality measures, and/or content-based features, such as\nposts and reposts. However, these measures may not capture the complex\ncharacteristics of social media users. In this study, we propose a user\nembedding method based on the URL domain co-occurrence network, which is simple\nbut effective for representing social media users in competing events. We\nassessed the performance of this method in binary classification tasks using\nbenchmark datasets that included Twitter users related to COVID-19 infodemic\ntopics (QAnon, Biden, Ivermectin). Our results revealed that user embeddings\ngenerated directly from the retweet network, and those based on language,\nperformed below expectations. In contrast, our domain-based embeddings\noutperformed these methods while reducing computation time. These findings\nsuggest that the domain-based user embedding can serve as an effective tool to\ncharacterize social media users participating in competing events, such as\npolitical campaigns and public health crises.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:01:14 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:07:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Wentao",""],["Sasahara","Kazutoshi",""]]}
{"id":"2308.14807","submitter":"John Treuer","authors":"Tanuj Gupta, Emil J. Straube, John N. Treuer","title":"Modifications of the Levi core","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct a family of subdistributions of the Levi core\n$\\mathfrak{C}(\\mathcal{N})$ called modified Levi cores\n$\\{\\mathcal{M}\\mathfrak{C}_{\\mathcal{A}}\\}_{\\mathcal{A}}$ indexed over closed\ndistributions $\\mathcal{A}$ that contain the Levi null distribution\n$\\mathcal{N}$ and are contained in the complex tangent bundle $T^{1, 0}b\\Omega$\nof a smooth bounded pseudoconvex domain $\\Omega$. We show that Catlin's\nProperty ($P$) holds on $b\\Omega$ if and only if Property ($P$) holds on the\nsupport of one, and hence all, of the modified Levi cores. In $\\mathbb{C}^2$,\nall of the modified Levi cores coincide. For a smooth bounded pseudoconvex\ncomplete Hartogs domain in $\\mathbb{C}^2$ that satisfies Property ($P$), we\nshow that its modified Levi core is trivial. This contrasts with\n$\\mathfrak{C}(\\mathcal{N})$, which can be nontrivial for such domains.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:01:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gupta","Tanuj",""],["Straube","Emil J.",""],["Treuer","John N.",""]]}
{"id":"2308.14808","submitter":"Kyungjin Ahn","authors":"Kyungjin Ahn, Minji Oh","title":"Probing the Global 21-cm Signal via the Integrated Sachs-Wolfe Effect on\n  the 21-cm Background","comments":"submitted to PRL; 6 pages, 2 figures + supplemental material","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a novel method to probe the global 21-cm background. This\nbackground experiences the integrated Sachs-Wolfe effect (ISW) as the cosmic\nmicrowave background does. The 21-cm ISW is modulated by the spectral shape of\nthe global 21-cm signal, and thus the measure of the 21-cm ISW will be a probe\nof the evolution of the global signal. With the phase-1 SKA telescope, probing\nthe global 21-cm background would be feasible with 10000-hour observation,\nenabling consistency checks with existing measures of the global 21-cm signal\nby EDGES and SARAS that are conflicting with each other.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:01:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ahn","Kyungjin",""],["Oh","Minji",""]]}
{"id":"2308.14809","submitter":"Zdzislaw Musielak","authors":"Z.E. Musielak","title":"A New Look at the Quantum Measurement Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.gen-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A novel solution to the measurement problem in quantum mechanics is proposed\nby using a new asymmetric equation, which is complementary to the Schr\\\"odinger\nequation. Since the latter describes evolution of the wavefunction, it is\ndemonstrated that the new equation naturally describes collapse of the\nwavefunction. This implies that the full representation of the wavefunction in\nnonrelativistic quantum mechanics requires both equations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:01:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Musielak","Z. E.",""]]}
{"id":"2308.14810","submitter":"Saul Ramos-Sanchez","authors":"Hans Peter Nilles and Saul Ramos-Sanchez","title":"The Flavor Puzzle: Textures and Symmetries","comments":"14 pages, 10 figures; contribution to the \"Memorial volume with World\n  Scientific in honor of Harald Fritzsch\"","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We discuss aspects of a promising top-down origin of flavor symmetries in\nparticle physics. Modular transformations originating from string theory\ndualities are shown to play a crucial role. We introduce the notion of an\n\"eclectic\" flavor scheme that unifies traditional flavor symmetries, modular\nsymmetries and CP-transformations. It exhibits the phenomenon of \"Local Flavor\nUnification\" with enhanced flavor symmetries at fixed points or lines in moduli\nspace. Successful fits of masses and mixing angles of quarks and leptons are\nfound in the vicinity of these points and lines.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:02:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nilles","Hans Peter",""],["Ramos-Sanchez","Saul",""]]}
{"id":"2308.14811","submitter":"Gauhar Abbas","authors":"Gauhar Abbas, Rathin Adhikari, Eung Jin Chun, Neelam Singh","title":"The problem of flavour","comments":"22 pages, 21 figures, contribution to FRONTIERS IN PARTICLE PHYSICS\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We review the problem of flavour tracing back to the days when the standard\nmodel was just coming together. We focus on the recently discussed new\nsolutions of this problem, namely models based on the discrete\n$\\mathcal{Z}_{\\rm N} \\times \\mathcal{Z}_{\\rm M}$ flavour symmetry and the VEVs\nhierarchy, and discuss their various phenomenological consequences. In\nparticular, there appears a novel feature that the solution of the flavour\nproblem based on the discrete flavour symmetry can provide the so-called\nflavonic dark matter. This predicts a specific relation between the mass and\nthe symmetry-breaking scale, which can be contrasted with the standard QCD\naxion.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:02:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Abbas","Gauhar",""],["Adhikari","Rathin",""],["Chun","Eung Jin",""],["Singh","Neelam",""]]}
{"id":"2308.14812","submitter":"Kasper Elm Heintz","authors":"K. E. Heintz, A. De Cia, C. C. Th\\\"one, J.-K. Krogager, R. M. Yates,\n  S. Vejlgaard, C. Konstantopoulou, J. P. U. Fynbo, D. Watson, D. Narayanan, S.\n  N. Wilson, M. Arabsalmani, S. Campana, V. D'Elia, M. De Pasquale, D. H.\n  Hartmann, L. Izzo, P. Jakobsson, C. Kouveliotou, A. Levan, Q. Li, D. B.\n  Malesani, A. Melandri, B. Milvang-Jensen, P. M{\\o}ller, E. Palazzi, J.\n  Palmerio, P. Petitjean, G. Pugliese, A. Rossi, A. Saccardi, R. Salvaterra, S.\n  Savaglio, P. Schady, G. Stratta, N. R. Tanvir, A. de Ugarte Postigo, S. D.\n  Vergani, K. Wiersema, R. A. M. J. Wijers, T. Zafar","title":"The cosmic build-up of dust and metals. Accurate abundances from\n  GRB-selected star-forming galaxies at $1.7 < z < 6.3$","comments":"Accepted in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The chemical enrichment of dust and metals in the interstellar medium (ISM)\nof galaxies throughout cosmic time is one of the key driving processes of\ngalaxy evolution. Here we study the evolution of the gas-phase metallicities,\ndust-to-gas (DTG), and dust-to-metal (DTM) ratios of 36 star-forming galaxies\nat $1.7 < z < 6.3$ probed by gamma-ray bursts (GRBs). We compile all\nGRB-selected galaxies with intermediate (R=7000) to high (R>40,000) resolution\nspectroscopic data for which at least one refractory (e.g. Fe) and one volatile\n(e.g. S or Zn) element have been detected at S/N>3. This is to ensure that\naccurate abundances and dust depletion patterns can be obtained. We first\nderive the redshift evolution of the dust-corrected, absorption-line based\ngas-phase metallicity [M/H]$_{\\rm tot}$ in these galaxies, for which we\ndetermine a linear relation with redshift ${\\rm [M/H]_{tot}}(z) = (-0.21\\pm\n0.04)z -(0.47\\pm 0.14)$. We then examine the DTG and DTM ratios as a function\nof redshift and through three orders of magnitude in metallicity, quantifying\nthe relative dust abundance both through the direct line-of-sight visual\nextinction $A_V$ and the derived depletion level. We use a novel method to\nderive the DTG and DTM mass ratios for each GRB sightline, summing up the mass\nof all the depleted elements in the dust-phase. We find that the DTG and DTM\nmass ratios are both strongly correlated with the gas-phase metallicity and\nshow a mild evolution with redshift as well. While these results are subject to\na variety of caveats related to the physical environments and the narrow\npencil-beam sightlines through the ISM probed by the GRBs, they provide strong\nimplications for studies of dust masses to infer the gas and metal content of\nhigh-redshift galaxies, and particularly demonstrate the large offset from the\naverage Galactic value in the low-metallicity, high-redshift regime.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:03:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Heintz","K. E.",""],["De Cia","A.",""],["Th\u00f6ne","C. C.",""],["Krogager","J. -K.",""],["Yates","R. M.",""],["Vejlgaard","S.",""],["Konstantopoulou","C.",""],["Fynbo","J. P. U.",""],["Watson","D.",""],["Narayanan","D.",""],["Wilson","S. N.",""],["Arabsalmani","M.",""],["Campana","S.",""],["D'Elia","V.",""],["De Pasquale","M.",""],["Hartmann","D. H.",""],["Izzo","L.",""],["Jakobsson","P.",""],["Kouveliotou","C.",""],["Levan","A.",""],["Li","Q.",""],["Malesani","D. B.",""],["Melandri","A.",""],["Milvang-Jensen","B.",""],["M\u00f8ller","P.",""],["Palazzi","E.",""],["Palmerio","J.",""],["Petitjean","P.",""],["Pugliese","G.",""],["Rossi","A.",""],["Saccardi","A.",""],["Salvaterra","R.",""],["Savaglio","S.",""],["Schady","P.",""],["Stratta","G.",""],["Tanvir","N. R.",""],["Postigo","A. de Ugarte",""],["Vergani","S. D.",""],["Wiersema","K.",""],["Wijers","R. A. M. J.",""],["Zafar","T.",""]]}
{"id":"2308.14813","submitter":"Kasper Elm Heintz","authors":"K. E. Heintz, A. E. Shapley, R. L. Sanders, M. Killi, D. Watson, G.\n  Magdis, F. Valentino, M. Ginolfi, D. Narayanan, T. R. Greve, J. P. U. Fynbo,\n  D. Vizgan, S. N. Wilson","title":"Gauging the mass of metals in the gas phase of galaxies from the Local\n  Universe to the Epoch of Reionization","comments":"Accepted in A&A, abstract abridged","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The chemical enrichment of dust and metals are vital processes in\nconstraining the star formation history of the universe. Previously, the dust\nmasses of high-redshift star-forming galaxies have been determined through\ntheir far-infrared continuum, however, equivalent, and potentially simpler,\napproaches to determining the metal masses have yet to be explored at $z\\gtrsim\n2$. Here, we present a new method of inferring the metal mass in the\ninterstellar medium (ISM) of galaxies out to $z\\approx 8$, using the\nfar-infrared [CII]$-158\\mu$m emission line as a proxy. We calibrated the\n[CII]-to-$M_{\\rm Z,ISM}$ conversion factor based on a benchmark observational\nsample at $z\\approx 0$, in addition to gamma-ray burst sightlines at $z>2$ and\ncosmological hydrodynamical simulations of galaxies at $z\\approx 0$ and\n$z\\approx 6$. We found a universal scaling across redshifts of $\\log (M_{\\rm\nZ,ISM}/M_\\odot) = \\log (L_{\\rm [CII]}/L_\\odot) - 0.45,$ with a 0.4 dex scatter,\nwhich is constant over more than two orders of magnitude in metallicity. We\napplied this scaling to recent surveys for [CII] in galaxies at $z\\gtrsim 2$\nand determined the fraction of metals retained in the gas-phase ISM, $M_{\\rm\nZ,ISM} / M_\\star$, as a function of redshift showing that an increasing\nfraction of metals reside in the ISM of galaxies at higher redshifts. We place\nfurther constraints on the cosmic metal mass density in the ISM ($\\Omega_{\\rm\nZ,ISM}$) at $z\\approx 5$ and $\\approx 7$, yielding $\\Omega_{\\rm Z,ISM} =\n6.6^{+13}_{-4.3}\\times 10^{-7}\\,M_\\odot\\, {\\rm Mpc}^{-3}$ ($z\\approx 5$) and\n$\\Omega_{\\rm Z,ISM} = 2.0^{+3.5}_{-1.3}\\times 10^{-7}\\,M_\\odot\\, {\\rm\nMpc}^{-3}$ ($z\\approx 7$). These results are consistent with the expected metal\nyields from the integrated star formation history at the respective redshifts.\nThis suggests that the majority of metals produced at $z\\gtrsim 5$ are confined\nto the ISM of galaxies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:03:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Heintz","K. E.",""],["Shapley","A. E.",""],["Sanders","R. L.",""],["Killi","M.",""],["Watson","D.",""],["Magdis","G.",""],["Valentino","F.",""],["Ginolfi","M.",""],["Narayanan","D.",""],["Greve","T. R.",""],["Fynbo","J. P. U.",""],["Vizgan","D.",""],["Wilson","S. N.",""]]}
{"id":"2308.14814","submitter":"Zhisheng Zheng","authors":"Zhisheng Zheng, Ziyang Ma, Yu Wang, Xie Chen","title":"Unsupervised Active Learning: Optimizing Labeling Cost-Effectiveness for\n  Automatic Speech Recognition","comments":"5 pages, 3 figures. Accepted to Interspeech 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.SD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, speech-based self-supervised learning (SSL) has made\nsignificant progress in various tasks, including automatic speech recognition\n(ASR). An ASR model with decent performance can be realized by fine-tuning an\nSSL model with a small fraction of labeled data. Reducing the demand for\nlabeled data is always of great practical value. In this paper, we further\nextend the use of SSL to cut down labeling costs with active learning. Three\ntypes of units on different granularities are derived from speech signals in an\nunsupervised way, and their effects are compared by applying a contrastive data\nselection method. The experimental results show that our proposed data\nselection framework can effectively improve the word error rate (WER) by more\nthan 11% with the same amount of labeled data, or halve the labeling cost while\nmaintaining the same WER, compared to random selection.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:04:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zheng","Zhisheng",""],["Ma","Ziyang",""],["Wang","Yu",""],["Chen","Xie",""]]}
{"id":"2308.14815","submitter":"Souradeep Dutta","authors":"Souradeep Dutta, Michele Caprio, Vivian Lin, Matthew Cleaveland, Kuk\n  Jin Jang, Ivan Ruchkin, Oleg Sokolsky, Insup Lee","title":"Distributionally Robust Statistical Verification with Imprecise Neural\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.RO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A particularly challenging problem in AI safety is providing guarantees on\nthe behavior of high-dimensional autonomous systems. Verification approaches\ncentered around reachability analysis fail to scale, and purely statistical\napproaches are constrained by the distributional assumptions about the sampling\nprocess. Instead, we pose a distributionally robust version of the statistical\nverification problem for black-box systems, where our performance guarantees\nhold over a large family of distributions. This paper proposes a novel approach\nbased on a combination of active learning, uncertainty quantification, and\nneural network verification. A central piece of our approach is an ensemble\ntechnique called Imprecise Neural Networks, which provides the uncertainty to\nguide active learning. The active learning uses an exhaustive neural-network\nverification tool Sherlock to collect samples. An evaluation on multiple\nphysical simulators in the openAI gym Mujoco environments with\nreinforcement-learned controllers demonstrates that our approach can provide\nuseful and scalable guarantees for high-dimensional systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:06:24 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 16:31:53 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Dutta","Souradeep",""],["Caprio","Michele",""],["Lin","Vivian",""],["Cleaveland","Matthew",""],["Jang","Kuk Jin",""],["Ruchkin","Ivan",""],["Sokolsky","Oleg",""],["Lee","Insup",""]]}
{"id":"2308.14816","submitter":"Zhipeng Cai","authors":"Zhipeng Cai and Matthias Mueller","title":"CLNeRF: Continual Learning Meets NeRF","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Novel view synthesis aims to render unseen views given a set of calibrated\nimages. In practical applications, the coverage, appearance or geometry of the\nscene may change over time, with new images continuously being captured.\nEfficiently incorporating such continuous change is an open challenge. Standard\nNeRF benchmarks only involve scene coverage expansion. To study other practical\nscene changes, we propose a new dataset, World Across Time (WAT), consisting of\nscenes that change in appearance and geometry over time. We also propose a\nsimple yet effective method, CLNeRF, which introduces continual learning (CL)\nto Neural Radiance Fields (NeRFs). CLNeRF combines generative replay and the\nInstant Neural Graphics Primitives (NGP) architecture to effectively prevent\ncatastrophic forgetting and efficiently update the model when new data arrives.\nWe also add trainable appearance and geometry embeddings to NGP, allowing a\nsingle compact model to handle complex scene changes. Without the need to store\nhistorical images, CLNeRF trained sequentially over multiple scans of a\nchanging scene performs on-par with the upper bound model trained on all scans\nat once. Compared to other CL baselines CLNeRF performs much better across\nstandard benchmarks and WAT. The source code, and the WAT dataset are available\nat https://github.com/IntelLabs/CLNeRF. Video presentation is available at:\nhttps://youtu.be/nLRt6OoDGq0?si=8yD6k-8MMBJInQPs\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:09:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cai","Zhipeng",""],["Mueller","Matthias",""]]}
{"id":"2308.14817","submitter":"Simon Portegies Zwart","authors":"Simon Portegies Zwart, Tjarda Boekholt, Douglas Heggie","title":"Punctuated chaos and the unpredictability of the Galactic center S-star\n  orbital evolution","comments":"Accepted for publication in MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.IM nlin.CD","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the chaotic behavior of the S-star cluster in the Galactic\ncenter using precise $N$-body calculations, free from round-off or\ndiscretization errors. Our findings reveal that chaos among the Galactic center\nS-stars arises from close encounters, particularly among pairs and near the\nmassive central body. These encounters induce perturbations, causing sudden\nchanges in the orbital energies of the interacting stars. Consequently,\nneighboring solutions experience roughly exponential growth in separation. We\npropose a theory of \"punctuated chaos\" that describes the S-star cluster's\nchaotic behavior. This phenomenon results from nearly linear growth in the\nseparation between neighboring orbits after repeated finite perturbations. Each\nparticipating star's orbit experiences discrete, abrupt changes in energy due\nto the perturbations. The cumulative effect of these events is further\namplified by the steady drift in orbital phase. In the Galactic center,\nperturbations originate from coincidental encounters occurring within a\ndistance of $\\aplt 100$\\,au between at least two stars (in some cases, three\nstars). Our model satisfactorily explains the observed exponential growth in\nthe 27 S-star cluster. We determine that the S-star system has a Lyapunov time\nscale of approximately 462 +/-74 years. For the coming millennium, chaos in the\nS-star cluster will be driven mainly by a few of the closest orbiting stars:\nS2, S5, S6, S8, S9, S14, S18, S31, S21, S24, S27, S29, and S38.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:09:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zwart","Simon Portegies",""],["Boekholt","Tjarda",""],["Heggie","Douglas",""]]}
{"id":"2308.14818","submitter":"Andrew Steinmetz","authors":"Andrew Steinmetz, Cheng Tao Yang, Johann Rafelski","title":"Matter-antimatter origin of cosmic magnetism","comments":"13 pages, 8 figures, submitted to Phys. Rev. D","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the hypothesis that the abundant presence of relativistic\nantimatter (positrons) in the primordial universe is the source of the\nintergalactic magnetic fields we observe in the universe today. We evaluate\nboth Landau diamagnetic and magnetic dipole moment paramagnetic properties of\nthe very dense primordial electron-positron $e^{+}e^{-}$-plasma, and obtain in\nquantitative terms the relatively small magnitude of the $e^{+}e^{-}$ magnetic\nmoment polarization asymmetry required to produce a consistent\nself-magnetization in the universe.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:12:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Steinmetz","Andrew",""],["Yang","Cheng Tao",""],["Rafelski","Johann",""]]}
{"id":"2308.14819","submitter":"Mauro Mezzini","authors":"Mauro Mezzini, Fernando Cuartero Gomez, Fernando Pelayo, Jose Javier\n  Paulet Gonzales, Hernan Indibil de la Cruz Calvo, Vicente Pascual","title":"A polynomial quantum computing algorithm for solving the dualization\n  problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.CC cs.DM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given two prime monotone boolean functions $f:\\{0,1\\}^n \\to \\{0,1\\}$ and\n$g:\\{0,1\\}^n \\to \\{0,1\\}$ the dualization problem consists in determining if\n$g$ is the dual of $f$, that is if $f(x_1, \\dots, x_n)=\n\\overline{g}(\\overline{x_1}, \\dots \\overline{x_n})$ for all $(x_1, \\dots x_n)\n\\in \\{0,1\\}^n$. Associated to the dualization problem there is the\ncorresponding decision problem: given two monotone prime boolean functions $f$\nand $g$ is $g$ the dual of $f$? In this paper we present a quantum computing\nalgorithm that solves the decision version of the dualization problem in\npolynomial time.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:12:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mezzini","Mauro",""],["Gomez","Fernando Cuartero",""],["Pelayo","Fernando",""],["Gonzales","Jose Javier Paulet",""],["Calvo","Hernan Indibil de la Cruz",""],["Pascual","Vicente",""]]}
{"id":"2308.14820","submitter":"Ferenc M\\'arkus Dr.","authors":"Ferenc M\\'arkus, Katalin Gamb\\'ar","title":"Quantized damped transversal single particle mechanical waves","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In information transfer, the dissipation of a signal may have crucial\nimportance. The feasibility of reconstructing the distorted signal also depends\non this. That is why the study of quantized dissipative transversal single\nparticle mechanical waves may have an important role. It may be true,\nparticularly on the nanoscale in the case of signal distortion, loss, or\nrestoration. Based on the damped oscillator quantum description, we generalize\nthe canonical quantization procedure for the transversal waves. Furthermore, we\ndeduce the related damped wave equation and the state function. We point out\nthe two kinds of solutions of the wave equation. One involves the well-known\nspreading solution superposed with the oscillation, in which the loss of\ninformation is complete. The other is the Airy function solution, which is\nnon-spreading, so there is information loss only due to oscillation damping.\nHowever, the structure of the wavefront remains unchanged. Thus, this result\nallows signal reconstruction, which is important in restoring the lost\ninformation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:13:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["M\u00e1rkus","Ferenc",""],["Gamb\u00e1r","Katalin",""]]}
{"id":"2308.14821","submitter":"Martin V\\\"olkl","authors":"Anton Andronic, Peter Braun-Munzinger, Hjalmar Brun{\\ss}en, Jana\n  Crkovsk\\'a, Johanna Stachel, Vytautas Vislavicius, Martin V\\\"olkl","title":"Transverse dynamics of charmed hadrons in ultra-relativistic nuclear\n  collisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Transverse momentum $p_{\\rm T}$ spectra and anisotropic flow distributions\nare studied for charmonia and charmed hadrons produced in Pb-Pb collisions and\nmeasured with the ALICE detector at the CERN Large Hadron Collider (LHC). The\ninvestigations are performed within the framework of the Statistical\nHadronization Model with the transverse dynamics evaluated using predictions\nfrom relativistic viscous hydrodynamics as implemented in the computer codes\nMUSIC and FluiduM. With this essentially parameter-free approach good agreement\nis obtained for $p_{\\rm T}$ spectra in the range $p_{\\rm T} < 10$ GeV/c. The\nobserved wide distribution in $p_{\\rm T}$ of anisotropic flow coefficients\n$v_2$ and $v_3$ for charmonia is also well reproduced, while their magnitude is\ngenerally somewhat over predicted. This finding may be connected to a\ndifference in spatial distribution between light and charmed hadrons due to a\ndifferent diffusion of light and heavy quarks in the hot fireball.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:15:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Andronic","Anton",""],["Braun-Munzinger","Peter",""],["Brun\u00dfen","Hjalmar",""],["Crkovsk\u00e1","Jana",""],["Stachel","Johanna",""],["Vislavicius","Vytautas",""],["V\u00f6lkl","Martin",""]]}
{"id":"2308.14822","submitter":"Valerio Busillo","authors":"Valerio Busillo, Crescenzo Tortora, Nicola R. Napolitano, Leon V. E.\n  Koopmans, Giovanni Covone, Fabrizio Gentile, Leslie K. Hunt","title":"CASCO: Cosmological and AStrophysical parameters from Cosmological\n  simulations and Observations -- I. Constraining physical processes in local\n  star-forming galaxies","comments":"24 pages, 10 figures, 9 tables. Submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We compare the structural properties and dark matter content of star-forming\ngalaxies taken from the CAMELS cosmological simulations to the observed trends\nderived from the SPARC sample in the stellar mass range $[10^{9},\n10^{11}]\\,\\textrm{M}_{\\odot}$, to provide constraints on the value of\ncosmological and astrophysical (SN- and AGN-related) parameters. We consider\nthe size-, internal DM fraction-, internal DM mass- and total-stellar mass\nrelations for all the 1065 simulations from the IllustrisTNG, SIMBA and ASTRID\nsuites of CAMELS, and search for the parameters that minimize the $\\chi^{2}$\nwith respect to the observations. For the IllustrisTNG suite, we find the\nfollowing constraints for the cosmological parameters: $\\Omega_{\\textrm{m}} =\n0.27_{-0.05}^{+0.01}$, $\\sigma_{8} = 0.83_{-0.11}^{+0.08}$ and $S_{8} =\n0.78_{-0.09}^{+0.03}$, which are consistent within $1\\sigma$ with the results\nfrom the nine-year WMAP observations. SN feedback-related astrophysical\nparameters, which describe the departure of outflow wind energy per unit star\nformation rate and wind velocity from the reference IllustrisTNG simulations,\nassume the following values: $A_{\\textrm{SN1}} = 0.48_{-0.16}^{+0.25}$ and\n$A_{\\textrm{SN2}} = 1.21_{-0.34}^{+0.03}$, respectively. Therefore, simulations\nwith a lower value of outflow wind energy per unit star formation rate with\nrespect to the reference illustrisTNG simulation better reproduce the\nobservations. Simulations based on SIMBA and ASTRID suites predict central dark\nmatter masses substantially larger than those observed in real galaxies, which\ncan be reconciled with observations only by requiring values of\n$\\Omega_{\\textrm{m}}$ inconsistent with cosmological constraints for SIMBA, or\nsimulations characterized by unrealistic galaxy mass distributions for ASTRID.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:20:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Busillo","Valerio",""],["Tortora","Crescenzo",""],["Napolitano","Nicola R.",""],["Koopmans","Leon V. E.",""],["Covone","Giovanni",""],["Gentile","Fabrizio",""],["Hunt","Leslie K.",""]]}
{"id":"2308.14823","submitter":"Hector O. Silva","authors":"Hector O. Silva, Giovanni Tambalo, Kostas Glampedakis, Kent Yagi","title":"Gravitational radiation from a particle plunging into a Schwarzschild\n  black hole: frequency-domain and semi-relativistic analyses","comments":"16 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the classic problem of gravitational wave emission by a test\nparticle plunging into a Schwarzschild black hole both in the frequency-domain\nRegge-Wheeler-Zerilli formalism and in the semi-relativistic approximation. We\nuse, and generalize, a transformation due to Nakamura, Sasaki and Shibata to\nimprove the fall-off of the source term of the Zerilli function. The faster\ndecay improves the numerical convergence of quantities of interest, such as the\nenergy radiated at spatial infinity through gravitational waves. As a test of\nthe method, we study the gravitational radiation produced by test particles\nthat plunge into the black hole with impact parameters close to the threshold\nfor scattering. We recover and expand upon previous results that were obtained\nusing the Sasaki-Nakamura equation. In particular, we study the relative\ncontributions to the total energy radiated due to waves of axial and polar\nparity, and uncover an universal behavior in the waveforms at late times. We\ncomplement our study with a semi-relativistic analysis of the problem, and we\ncompare the two approaches. The generalized Nakamura-Sasaki-Shibata\ntransformation presented here is a simple and practical alternative for the\nanalysis of gravitational-wave emission by unbound orbits in the Schwarzschild\nspacetime using the frequency-domain Regge-Wheeler-Zerilli formalism.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:20:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Silva","Hector O.",""],["Tambalo","Giovanni",""],["Glampedakis","Kostas",""],["Yagi","Kent",""]]}
{"id":"2308.14824","submitter":"Dongze Wu","authors":"Dongze Wu, Jun Gao, Feng Yin, Sergios Theodoridis","title":"Bayesian-Boosted MetaLoc: Efficient Training and Enhanced Generalization\n  for Indoor Localization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing localization approaches utilizing environment-specific channel state\ninformation (CSI) excel under specific environment but struggle to generalize\nacross varied environments. This challenge becomes even more pronounced when\nconfronted with limited training data. To address these issues, we present the\nBayes-Optimal Meta-Learning for Localization (BOML-Loc) framework, inspired by\nthe PAC-Optimal Hyper-Posterior (PACOH) algorithm. Improving on our earlier\nMetaLoc, BOML-Loc employs a Bayesian approach, reducing the need for extensive\ntraining and lowering overfitting risk. Even with limited training tasks,\nBOML-Loc guarantees robust localization and impressive generalization. In both\nLOS and NLOS environments with site-surveyed data, BOML-Loc surpasses existing\nmodels, demonstrating enhanced localization accuracy and reduced overfitting in\nnew environments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:21:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wu","Dongze",""],["Gao","Jun",""],["Yin","Feng",""],["Theodoridis","Sergios",""]]}
{"id":"2308.14825","submitter":"Sebastian Grieninger","authors":"Sebastian Grieninger, Dmitri E. Kharzeev","title":"Space-time dynamics of chiral magnetic currents in a hot non-Abelian\n  plasma","comments":"9+1 pages, 6+3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-th nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The correlations of electric currents in hot non-Abelian plasma are\nresponsible for the experimental manifestations of the chiral magnetic effect\n(CME) in heavy-ion collisions. We evaluate these correlations using holography,\nand show that they are driven by large-scale topological fluctuations. In a\nnon-abelian plasma with chiral fermions, local axial charge can be generated\neither by topological fluctuations (creating domains with non-zero Chern-Simons\nnumber) or by thermal fluctuations. Within holography, we investigate the\ndynamical creation of the axial charge and isolate the imprint of the\ntopological dynamics on the spatial correlations of electric current. In\nparticular, we show that the spatial extent of the current correlation is quite\nlarge ($\\sim 1\\ {\\rm fm}$) and grows with time, which is consistent with\nsphaleron-like dynamics. We provide numerical estimates for this spatial size\nthat can be used as an input in phenomenological analyses.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:22:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Grieninger","Sebastian",""],["Kharzeev","Dmitri E.",""]]}
{"id":"2308.14826","submitter":"Madhav Prasad Ghimire PhD","authors":"Bishnu P. Belbase, Linda Ye, Bishnu Karki, Jorge I. Facio, Jhih-Shih\n  You, Joseph G. Checkelsky, Jeroen van den Brink, and Madhav Prasad Ghimire","title":"Large anomalous Hall effect in single crystals of the kagome Weyl\n  ferromagnet Fe$_3$Sn","comments":"9 pages and 9 figures including supplement","journal-ref":"Phys. Rev. B 108, 075164 (2023)","doi":"10.1103/PhysRevB.108.075164","report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The material class of kagome metals has rapidly grown and has been\nestablished as a field to explore the interplay between electronic topology and\nmagnetism. In this work, we report a combined theoretical and experimental\nstudy of the anomalous Hall effect of the ferromagnetic kagome metal Fe$_3$Sn.\nThe compound orders magnetically at 725 K and presents an easy-plane\nanisotropy. Hall measurements in single crystals below room temperature yield\nan anomalous Hall conductivity $\\sigma_{xy}\\sim500\\,(\\Omega\\textrm{cm})^{-1}$,\nwhich is found to depend weakly on temperature. This value is in good agreement\nwith the band-intrinsic contribution obtained by density-functional\ncalculations. Our calculations also yield the correct magnetic anisotropy\nenergy and predict the existence of Weyl nodes near the Fermi energy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:26:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Belbase","Bishnu P.",""],["Ye","Linda",""],["Karki","Bishnu",""],["Facio","Jorge I.",""],["You","Jhih-Shih",""],["Checkelsky","Joseph G.",""],["Brink","Jeroen van den",""],["Ghimire","Madhav Prasad",""]]}
{"id":"2308.14827","submitter":"Somendra M. Bhattacharjee","authors":"Somendra M. Bhattacharjee","title":"Complex dynamics approach to dynamical quantum phase transitions:the\n  Potts model","comments":"17 pages, 9 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces complex dynamics methods to study dynamical quantum\nphase transitions in the one- and two-dimensional quantum 3-state Potts model.\nThe quench involves switching off an infinite transverse field. The\ntime-dependent Loschmidt echo is evaluated by an exact renormalization group\n(RG) transformation in the complex plane where the thermal Boltzmann factor is\nalong the positive real axis, and the quantum time evolution is along the unit\ncircle. One of the characteristics of the complex dynamics constituted by\nrepeated applications of RG is the Julia set, which determines the phase\ntransitions. We show that special boundary conditions can alter the nature of\nthe transitions, and verify the claim for the one-dimensional system by\ntransfer matrix calculations. In two dimensions, there are alternating\nsymmetry-breaking and restoring transitions, both of which are first-order,\ndespite the criticality of the Curie point. In addition, there are finer\nstructures because of the fractal nature of the Julia set. Our approach can be\nextended to multi-variable problems, higher dimensions, and approximate RG\ntransformations expressed as rational functions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:26:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bhattacharjee","Somendra M.",""]]}
{"id":"2308.14828","submitter":"Lu Zhang","authors":"Lu Zhang","title":"Applications of Conjugate Gradient in Bayesian computation","comments":"7 pages. In Wiley StatsRef: Statistics Reference Online (2023). This\n  paper was originally published on Wiley StatsRef: Statistics Reference Online\n  on December 15 2022. The reason for reuploading it on arXiv is to enhance its\n  visibility and accessibility","journal-ref":null,"doi":"10.1002/9781118445112.stat08411","report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Conjugate gradient is an efficient algorithm for solving large sparse linear\nsystems. It has been utilized to accelerate the computation in Bayesian\nanalysis for many large-scale problems. This article discusses the applications\nof conjugate gradient in Bayesian computation, with a focus on sparse\nregression and spatial analysis. A self-contained introduction of conjugate\ngradient is provided to facilitate potential applications in a broader range of\nproblems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:28:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Lu",""]]}
{"id":"2308.14829","submitter":"Sebastian Grieninger","authors":"Sebastian Grieninger, Sergio Morales-Tejera","title":"Real-time dynamics of axial charge and chiral magnetic current in a\n  non-Abelian (expanding) plasma","comments":"14+2 pages, 6+4 figures","journal-ref":null,"doi":null,"report-no":"IFT-UAM/CSIC-23-109","categories":"hep-ph hep-th nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding axial charge dynamics driven by changes in Chern-Simons number\ndensities is a key aspect in understanding the Chiral Magnetic Effect (CME) in\nheavy-ion collisions. Most phenomenological simulations assume that a large\namount of axial charge is produced in the initial stages and that axial charge\nis conserved throughout the simulation. Within an (expanding) homogeneous\nholographic plasma, we investigate the real-time axial charge relaxation\ndynamics and their impact on the chiral magnetic current. Moreover, we discuss\nthe real-time interplay of the non-abelian and the abelian chiral anomaly in\nthe presence of a strong magnetic field. In the expanding plasma, the\nChern-Simons diffusion rate and thus the axial charge relaxation rate are time\ndependent due to the decaying magnetic field. We quantify the changes in the\nlate time falloffs and establish a horizon formula for the chiral magnetic\ncurrent.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:29:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Grieninger","Sebastian",""],["Morales-Tejera","Sergio",""]]}
{"id":"2308.14830","submitter":"Manan Vyas Dr.","authors":"M. Mija\\'il Mart\\'inez-Ramos, Manan Vyas, Parisa Majai, Thomas H.\n  Seligman","title":"COVID anomaly in the correlation analysis of S&P 500 market states","comments":"12 pages, 4 figures, supplemental materials (6 figures, 3 videos)","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Analyzing market states of the S&P 500 components on a time horizon January\n3, 2006 to August 10, 2023, we found the appearance of a new market state not\npreviously seen and we shall discuss its possible implications as an isolated\nstate or as a beginning of a new general market condition. We study this in\nterms of the Pearson correlation matrix and relative correlation with respect\nto the S&P 500 index. In both cases the anomaly shows strongly.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:29:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mart\u00ednez-Ramos","M. Mija\u00edl",""],["Vyas","Manan",""],["Majai","Parisa",""],["Seligman","Thomas H.",""]]}
{"id":"2308.14831","submitter":"Murat Onur Yildirim","authors":"Murat Onur Yildirim, Elif Ceren Gok Yildirim, Ghada Sokar, Decebal\n  Constantin Mocanu, Joaquin Vanschoren","title":"Continual Learning with Dynamic Sparse Training: Exploring Algorithms\n  for Effective Model Updates","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Continual learning (CL) refers to the ability of an intelligent system to\nsequentially acquire and retain knowledge from a stream of data with as little\ncomputational overhead as possible. To this end; regularization, replay,\narchitecture, and parameter isolation approaches were introduced to the\nliterature. Parameter isolation using a sparse network which enables to\nallocate distinct parts of the neural network to different tasks and also\nallows to share of parameters between tasks if they are similar. Dynamic Sparse\nTraining (DST) is a prominent way to find these sparse networks and isolate\nthem for each task. This paper is the first empirical study investigating the\neffect of different DST components under the CL paradigm to fill a critical\nresearch gap and shed light on the optimal configuration of DST for CL if it\nexists. Therefore, we perform a comprehensive study in which we investigate\nvarious DST components to find the best topology per task on well-known\nCIFAR100 and miniImageNet benchmarks in a task-incremental CL setup since our\nprimary focus is to evaluate the performance of various DST criteria, rather\nthan the process of mask selection. We found that, at a low sparsity level,\nErdos-Renyi Kernel (ERK) initialization utilizes the backbone more efficiently\nand allows to effectively learn increments of tasks. At a high sparsity level,\nhowever, uniform initialization demonstrates more reliable and robust\nperformance. In terms of growth strategy; performance is dependent on the\ndefined initialization strategy, and the extent of sparsity. Finally,\nadaptivity within DST components is a promising way for better continual\nlearners.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:31:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yildirim","Murat Onur",""],["Yildirim","Elif Ceren Gok",""],["Sokar","Ghada",""],["Mocanu","Decebal Constantin",""],["Vanschoren","Joaquin",""]]}
{"id":"2308.14832","submitter":"Jordan Wilson-Gerow","authors":"Clifford Cheung, Julio Parra-Martinez, Ira Z. Rothstein, Nabha Shah,\n  Jordan Wilson-Gerow","title":"Effective Field Theory for Extreme Mass Ratios","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"CALT-TH 2023-035","categories":"hep-th gr-qc hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We derive an effective field theory describing a pair of gravitationally\ninteracting point particles in an expansion in their mass ratio, also known as\nthe self-force (SF) expansion. The 0SF dynamics are trivially obtained to all\norders in Newton's constant by the geodesic motion of the light body in a\nSchwarzschild background encoding the gravitational field of the heavy body.\nThe corrections at 1SF and higher are generated by perturbations about this\nconfiguration -- that is, the geodesic deviation of the light body and the\nfluctuation graviton -- but crucially supplemented by an operator describing\nthe recoil of the heavy body as it interacts with the smaller companion. Using\nthis formalism we compute new results at third post-Minkowskian order for the\nconservative dynamics of a system of gravitationally interacting massive\nparticles coupled to a set of additional scalar and vector fields.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:41:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheung","Clifford",""],["Parra-Martinez","Julio",""],["Rothstein","Ira Z.",""],["Shah","Nabha",""],["Wilson-Gerow","Jordan",""]]}
{"id":"2308.14833","submitter":"Derek Gloudemans","authors":"Derek Gloudemans, Yanbing Wang, Gracie Gumm, William Barbour, Daniel\n  B. Work","title":"The Interstate-24 3D Dataset: a new benchmark for 3D multi-camera\n  vehicle tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This work presents a novel video dataset recorded from overlapping highway\ntraffic cameras along an urban interstate, enabling multi-camera 3D object\ntracking in a traffic monitoring context. Data is released from 3 scenes\ncontaining video from at least 16 cameras each, totaling 57 minutes in length.\n877,000 3D bounding boxes and corresponding object tracklets are fully and\naccurately annotated for each camera field of view and are combined into a\nspatially and temporally continuous set of vehicle trajectories for each scene.\nLastly, existing algorithms are combined to benchmark a number of 3D\nmulti-camera tracking pipelines on the dataset, with results indicating that\nthe dataset is challenging due to the difficulty of matching objects traveling\nat high speeds across cameras and heavy object occlusion, potentially for\nhundreds of frames, during congested traffic. This work aims to enable the\ndevelopment of accurate and automatic vehicle trajectory extraction algorithms,\nwhich will play a vital role in understanding impacts of autonomous vehicle\ntechnologies on the safety and efficiency of traffic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:43:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gloudemans","Derek",""],["Wang","Yanbing",""],["Gumm","Gracie",""],["Barbour","William",""],["Work","Daniel B.",""]]}
{"id":"2308.14834","submitter":"Mahbod Afarin","authors":"Mahbod Afarin, Chao Gao, Shafiur Rahman, Nael Abu-Ghazaleh, Rajiv\n  Gupta","title":"Graph Analytics on Evolving Data (Abstract)","comments":null,"journal-ref":"in Proceedings of the 2023 ACM Workshop on Highlights of Parallel\n  Computing (HOPC'23); 2023; p. 1-2","doi":"10.1145/3597635.3598022","report-no":null,"categories":"cs.DB cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider the problem of graph analytics on evolving graphs. In this\nscenario, a query typically needs to be applied to different snapshots of the\ngraph over an extended time window. We propose CommonGraph, an approach for\nefficient processing of queries on evolving graphs. We first observe that edge\ndeletions are significantly more expensive than addition operations.\nCommonGraph converts all deletions to additions by finding a common graph that\nexists across all snapshots. After computing the query on this graph, to reach\nany snapshot, we simply need to add the missing edges and incrementally update\nthe query results. CommonGraph also allows sharing of common additions among\nsnapshots that require them, and breaks the sequential dependency inherent in\nthe traditional streaming approach where snapshots are processed in sequence,\nenabling additional opportunities for parallelism. We incorporate the\nCommonGraph approach by extending the KickStarter streaming framework.\nCommonGraph achieves 1.38x-8.17x improvement in performance over Kickstarter\nacross multiple benchmarks.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:45:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Afarin","Mahbod",""],["Gao","Chao",""],["Rahman","Shafiur",""],["Abu-Ghazaleh","Nael",""],["Gupta","Rajiv",""]]}
{"id":"2308.14835","submitter":"Robert Bridges","authors":"Robert A. Bridges, Brian Weber, Justin M. Beaver, Jared M. Smith, Miki\n  E. Verma, Savannah Norem, Kevin Spakes, Cory Watson, Jeff A. Nichols, Brian\n  Jewell, Michael. D. Iannacone, Chelsey Dunivan Stahl, Kelly M.T. Huffer, T.\n  Sean Oesch","title":"AI ATAC 1: An Evaluation of Prominent Commercial Malware Detectors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work presents an evaluation of six prominent commercial endpoint malware\ndetectors, a network malware detector, and a file-conviction algorithm from a\ncyber technology vendor. The evaluation was administered as the first of the\nArtificial Intelligence Applications to Autonomous Cybersecurity (AI ATAC)\nprize challenges, funded by / completed in service of the US Navy. The\nexperiment employed 100K files (50/50% benign/malicious) with a stratified\ndistribution of file types, including ~1K zero-day program executables\n(increasing experiment size two orders of magnitude over previous work). We\npresent an evaluation process of delivering a file to a fresh virtual machine\ndonning the detection technology, waiting 90s to allow static detection, then\nexecuting the file and waiting another period for dynamic detection; this\nallows greater fidelity in the observational data than previous experiments, in\nparticular, resource and time-to-detection statistics. To execute all 800K\ntrials (100K files $\\times$ 8 tools), a software framework is designed to\nchoreographed the experiment into a completely automated, time-synced, and\nreproducible workflow with substantial parallelization. A cost-benefit model\nwas configured to integrate the tools' recall, precision, time to detection,\nand resource requirements into a single comparable quantity by simulating costs\nof use. This provides a ranking methodology for cyber competitions and a lens\nthrough which to reason about the varied statistical viewpoints of the results.\nThese statistical and cost-model results provide insights on state of\ncommercial malware detection.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:46:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bridges","Robert A.",""],["Weber","Brian",""],["Beaver","Justin M.",""],["Smith","Jared M.",""],["Verma","Miki E.",""],["Norem","Savannah",""],["Spakes","Kevin",""],["Watson","Cory",""],["Nichols","Jeff A.",""],["Jewell","Brian",""],["Iannacone","Michael. D.",""],["Stahl","Chelsey Dunivan",""],["Huffer","Kelly M. T.",""],["Oesch","T. Sean",""]]}
{"id":"2308.14836","submitter":"Sijia Li","authors":"Sijia Li, Peter B. Gilbert, and Alex Luedtke","title":"Data fusion using weakly aligned sources","comments":"33 pages including appendices, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a new data fusion method that utilizes multiple data sources to\nestimate a smooth, finite-dimensional parameter. Most existing methods only\nmake use of fully aligned data sources that share common conditional\ndistributions of one or more variables of interest. However, in many settings,\nthe scarcity of fully aligned sources can make existing methods require unduly\nlarge sample sizes to be useful. Our approach enables the incorporation of\nweakly aligned data sources that are not perfectly aligned, provided their\ndegree of misalignment can be characterized by a prespecified density ratio\nmodel. We describe gains in efficiency and provide a general means to construct\nestimators achieving these gains. We illustrate our results by fusing data from\ntwo harmonized HIV monoclonal antibody prevention efficacy trials to study how\na neutralizing antibody biomarker associates with HIV genotype.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:47:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Sijia",""],["Gilbert","Peter B.",""],["Luedtke","Alex",""]]}
{"id":"2308.14837","submitter":"Tegan Wilson","authors":"Tegan Wilson, Daniel Amir, Vishal Shrivastav, Robert Kleinberg, Hakim\n  Weatherspoon","title":"Improving Oblivious Reconfigurable Networks with High Probability","comments":"19 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Oblivious Reconfigurable Networks (ORNs) use rapidly reconfiguring switches\nto create a dynamic time-varying topology. Prior theoretical work on ORNs has\nfocused on the tradeoff between maximum latency and guaranteed throughput. This\nwork shows that by relaxing the notion of guaranteed throughput to an\nachievable rate with high probability, one can achieve a significant\nimprovement in the latency/throughput tradeoff. For a fixed maximum latency, we\nshow that almost twice the maximum possible guaranteed throughput rate can be\nachieved with high probability. Alternatively for a fixed throughput value,\nrelaxing to achievement with high probability decreases the maximum latency to\nalmost the square root of the latency required to guarantee the throughput\nrate.\n  We first give a lower bound on the best maximum latency possible given an\nachieved throughput rate with high probability. This is done using an LP\nduality style argument. We then give a family of ORN designs which achieves\nthese tradeoffs. The connection schedule is based on the Vandermonde Basis\nScheme of Amir, Wilson, Shrivastav, Weatherspoon, Kleinberg, and Agarwal,\nalthough the period and routing scheme differ significantly. We prove\nachievable throughput with high probability by interpreting the amount of flow\non each edge as a sum of negatively associated variables, and applying a\nChernoff bound. This gives us a design with maximum latency that is tight with\nour lower bound (up to a log factor) for almost all constant throughput values.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:47:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wilson","Tegan",""],["Amir","Daniel",""],["Shrivastav","Vishal",""],["Kleinberg","Robert",""],["Weatherspoon","Hakim",""]]}
{"id":"2308.14838","submitter":"Huiyuan Chen","authors":"Kwei-Herng Lai, Daochen Zha, Huiyuan Chen, Mangesh Bendre, Yuzhong\n  Chen, Mahashweta Das, Hao Yang, Xia Hu","title":"Tackling Diverse Minorities in Imbalanced Classification","comments":null,"journal-ref":null,"doi":"10.1145/3583780.3615071","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Imbalanced datasets are commonly observed in various real-world applications,\npresenting significant challenges in training classifiers. When working with\nlarge datasets, the imbalanced issue can be further exacerbated, making it\nexceptionally difficult to train classifiers effectively. To address the\nproblem, over-sampling techniques have been developed to linearly interpolating\ndata instances between minorities and their neighbors. However, in many\nreal-world scenarios such as anomaly detection, minority instances are often\ndispersed diversely in the feature space rather than clustered together.\nInspired by domain-agnostic data mix-up, we propose generating synthetic\nsamples iteratively by mixing data samples from both minority and majority\nclasses. It is non-trivial to develop such a framework, the challenges include\nsource sample selection, mix-up strategy selection, and the coordination\nbetween the underlying model and mix-up strategies. To tackle these challenges,\nwe formulate the problem of iterative data mix-up as a Markov decision process\n(MDP) that maps data attributes onto an augmentation strategy. To solve the\nMDP, we employ an actor-critic framework to adapt the discrete-continuous\ndecision space. This framework is utilized to train a data augmentation policy\nand design a reward signal that explores classifier uncertainty and encourages\nperformance improvement, irrespective of the classifier's convergence. We\ndemonstrate the effectiveness of our proposed framework through extensive\nexperiments conducted on seven publicly available benchmark datasets using\nthree different types of classifiers. The results of these experiments showcase\nthe potential and promise of our framework in addressing imbalanced datasets\nwith diverse minorities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:48:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lai","Kwei-Herng",""],["Zha","Daochen",""],["Chen","Huiyuan",""],["Bendre","Mangesh",""],["Chen","Yuzhong",""],["Das","Mahashweta",""],["Yang","Hao",""],["Hu","Xia",""]]}
{"id":"2308.14839","submitter":"Yang Deng","authors":"Willie J. Padilla, Omar Khatib, Yang Deng, Vahid Tarokh","title":"Fundamental absorption bandwidth to thickness limit for transparent\n  homogeneous layers","comments":"4 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Past work has considered the analytic properties of the reflection\ncoefficient for a metal-backed slab. The primary result established a\nfundamental relationship for the minimal layer thickness to bandwidth ratio\nachievable for an absorber. There has yet to be establishment of a similar\nrelationship for non metal-backed layers, and here we present the universal\nresult based on the Kramers-Kronig relations. Our theory is validated with\ntransfer matrix calculations of homogeneous materials, and full-wave numerical\nsimulations of electromagnetic metamaterials. Our results place more general\nfundamental limits on absorbers and thus will be important for both fundamental\nand applied studies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:51:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Padilla","Willie J.",""],["Khatib","Omar",""],["Deng","Yang",""],["Tarokh","Vahid",""]]}
{"id":"2308.14840","submitter":"Mihai Christodorescu","authors":"Clark Barrett, Brad Boyd, Ellie Burzstein, Nicholas Carlini, Brad\n  Chen, Jihye Choi, Amrita Roy Chowdhury, Mihai Christodorescu, Anupam Datta,\n  Soheil Feizi, Kathleen Fisher, Tatsunori Hashimoto, Dan Hendrycks, Somesh\n  Jha, Daniel Kang, Florian Kerschbaum, Eric Mitchell, John Mitchell, Zulfikar\n  Ramzan, Khawaja Shams, Dawn Song, Ankur Taly, Diyi Yang","title":"Identifying and Mitigating the Security Risks of Generative AI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Every major technical invention resurfaces the dual-use dilemma -- the new\ntechnology has the potential to be used for good as well as for harm.\nGenerative AI (GenAI) techniques, such as large language models (LLMs) and\ndiffusion models, have shown remarkable capabilities (e.g., in-context\nlearning, code-completion, and text-to-image generation and editing). However,\nGenAI can be used just as well by attackers to generate new attacks and\nincrease the velocity and efficacy of existing attacks.\n  This paper reports the findings of a workshop held at Google (co-organized by\nStanford University and the University of Wisconsin-Madison) on the dual-use\ndilemma posed by GenAI. This paper is not meant to be comprehensive, but is\nrather an attempt to synthesize some of the interesting findings from the\nworkshop. We discuss short-term and long-term goals for the community on this\ntopic. We hope this paper provides both a launching point for a discussion on\nthis important topic as well as interesting problems that the research\ncommunity can work to address.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:51:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Barrett","Clark",""],["Boyd","Brad",""],["Burzstein","Ellie",""],["Carlini","Nicholas",""],["Chen","Brad",""],["Choi","Jihye",""],["Chowdhury","Amrita Roy",""],["Christodorescu","Mihai",""],["Datta","Anupam",""],["Feizi","Soheil",""],["Fisher","Kathleen",""],["Hashimoto","Tatsunori",""],["Hendrycks","Dan",""],["Jha","Somesh",""],["Kang","Daniel",""],["Kerschbaum","Florian",""],["Mitchell","Eric",""],["Mitchell","John",""],["Ramzan","Zulfikar",""],["Shams","Khawaja",""],["Song","Dawn",""],["Taly","Ankur",""],["Yang","Diyi",""]]}
{"id":"2308.14841","submitter":"Yunxiang Zhang","authors":"Yunxiang Zhang, Kenneth Chen, Qi Sun","title":"Toward Optimized VR/AR Ergonomics: Modeling and Predicting User Neck\n  Muscle Contraction","comments":"ACM SIGGRAPH 2023 Conference Proceedings","journal-ref":null,"doi":"10.1145/3588432.3591495","report-no":null,"categories":"cs.HC cs.AI cs.GR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ergonomic efficiency is essential to the mass and prolonged adoption of VR/AR\nexperiences. While VR/AR head-mounted displays unlock users' natural wide-range\nhead movements during viewing, their neck muscle comfort is inevitably\ncompromised by the added hardware weight. Unfortunately, little quantitative\nknowledge for understanding and addressing such an issue is available so far.\n  Leveraging electromyography devices, we measure, model, and predict VR users'\nneck muscle contraction levels (MCL) while they move their heads to interact\nwith the virtual environment. Specifically, by learning from collected\nphysiological data, we develop a bio-physically inspired computational model to\npredict neck MCL under diverse head kinematic states. Beyond quantifying the\ncumulative MCL of completed head movements, our model can also predict\npotential MCL requirements with target head poses only. A series of objective\nevaluations and user studies demonstrate its prediction accuracy and\ngenerality, as well as its ability in reducing users' neck discomfort by\noptimizing the layout of visual targets. We hope this research will motivate\nnew ergonomic-centered designs for VR/AR and interactive graphics applications.\nSource code is released at:\nhttps://github.com/NYU-ICL/xr-ergonomics-neck-comfort.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:58:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Yunxiang",""],["Chen","Kenneth",""],["Sun","Qi",""]]}
{"id":"2308.14842","submitter":"Saeed Nasseh","authors":"Saeed Nasseh, Keri Ann Sather-Wagstaff, and Ryo Takahashi","title":"Ring homomorphisms and local rings with quasi-decomposable maximal ideal","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The notion of local rings with quasi-decomposable maximal ideal was formally\nintroduced by Nasseh and Takahashi. In separate works, the authors of the\npresent paper show that such rings have rigid homological properties; for\ninstance, they are both Ext- and Tor-friendly. One point of this paper is to\nfurther explore the homological properties of these rings and also introduce\nnew classes of such rings from a combinatorial point of view. Another point is\nto investigate how far some of these homological properties can be pushed along\ncertain diagrams of local ring homomorphisms.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:03:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nasseh","Saeed",""],["Sather-Wagstaff","Keri Ann",""],["Takahashi","Ryo",""]]}
{"id":"2308.14843","submitter":"Reza Akhavian","authors":"Farid Shahnavaz, Riley Tavassoli, and Reza Akhavian","title":"Robust Activity Recognition for Adaptive Worker-Robot Interaction using\n  Transfer Learning","comments":"2023 ASCE International Conference on Computing in Civil Engineering\n  (I3CE)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human activity recognition (HAR) using machine learning has shown tremendous\npromise in detecting construction workers' activities. HAR has many\napplications in human-robot interaction research to enable robots'\nunderstanding of human counterparts' activities. However, many existing HAR\napproaches lack robustness, generalizability, and adaptability. This paper\nproposes a transfer learning methodology for activity recognition of\nconstruction workers that requires orders of magnitude less data and compute\ntime for comparable or better classification accuracy. The developed algorithm\ntransfers features from a model pre-trained by the original authors and\nfine-tunes them for the downstream task of activity recognition in\nconstruction. The model was pre-trained on Kinetics-400, a large-scale\nvideo-based human activity recognition dataset with 400 distinct classes. The\nmodel was fine-tuned and tested using videos captured from manual material\nhandling (MMH) activities found on YouTube. Results indicate that the\nfine-tuned model can recognize distinct MMH tasks in a robust and adaptive\nmanner which is crucial for the widespread deployment of collaborative robots\nin construction.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:03:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shahnavaz","Farid",""],["Tavassoli","Riley",""],["Akhavian","Reza",""]]}
{"id":"2308.14844","submitter":"Schuyler D. Van Dyk","authors":"Schuyler D. Van Dyk, Sundar Srinivasan, Jennifer E. Andrews, Monika\n  Soraisam, Tamas Szalai, Steve B. Howell, Howard Isaacson, Thomas Matheson,\n  Erik Petigura, Peter Scicluna, Andrew W. Stephens, Judah Van Zandt, WeiKang\n  Zheng, Sang-Hyun Chun, Alexei V. Filippenko","title":"The SN 2023ixf Progenitor in M101: II. Properties","comments":"29 pages, submitted to AAS Journals","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We follow our first paper with an analysis of the ensemble of the extensive\npre-explosion ground- and space-based infrared observations of the red\nsupergiant (RSG) progenitor candidate for the nearby core-collapse supernova SN\n2023ixf in Messier 101, together with optical data prior to explosion obtained\nwith the Hubble Space Telescope (HST). We have confirmed the association of the\nprogenitor candidate with the SN, as well as constrained the metallicity at the\nSN site, based on SN observations with instruments at Gemini-North. The\ninternal host extinction to the SN has also been confirmed from a\nhigh-resolution Keck spectrum. We fit the observed spectral energy distribution\n(SED) for the star, accounting for its intrinsic variability, with dust\nradiative-transfer modeling, which assume a silicate-rich dust shell ahead of\nthe underlying stellar photosphere. The star is heavily dust-obscured, likely\nthe dustiest progenitor candidate yet encountered. We found maximum-likelihood\nestimates of the star's effective temperature and luminosity of 3450 K and\n9.3e4 L_Sun, with 68% credible intervals of 2370--3700 K and (7.6--10.8)e4\nL_sun. The candidate may have a Galactic RSG analog, IRC -10414, with a\nstrikingly similar SED and luminosity. Via comparison with single-star\nevolutionary models we have constrained the initial mass of the progenitor\ncandidate from 12 M_sun to as high as 15 M_sun. We have had available to us an\nextraordinary view of the SN 2023ixf progenitor candidate, which should be\nfurther followed up in future years with HST and the James Webb Space\nTelescope.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:04:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Van Dyk","Schuyler D.",""],["Srinivasan","Sundar",""],["Andrews","Jennifer E.",""],["Soraisam","Monika",""],["Szalai","Tamas",""],["Howell","Steve B.",""],["Isaacson","Howard",""],["Matheson","Thomas",""],["Petigura","Erik",""],["Scicluna","Peter",""],["Stephens","Andrew W.",""],["Van Zandt","Judah",""],["Zheng","WeiKang",""],["Chun","Sang-Hyun",""],["Filippenko","Alexei V.",""]]}
{"id":"2308.14845","submitter":"Chun Wai Chiu","authors":"Chun Wai Chiu, Leandro L. Minku","title":"SMOClust: Synthetic Minority Oversampling based on Stream Clustering for\n  Evolving Data Streams","comments":"59 pages, 85 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Many real-world data stream applications not only suffer from concept drift\nbut also class imbalance. Yet, very few existing studies investigated this\njoint challenge. Data difficulty factors, which have been shown to be key\nchallenges in class imbalanced data streams, are not taken into account by\nexisting approaches when learning class imbalanced data streams. In this work,\nwe propose a drift adaptable oversampling strategy to synthesise minority class\nexamples based on stream clustering. The motivation is that stream clustering\nmethods continuously update themselves to reflect the characteristics of the\ncurrent underlying concept, including data difficulty factors. This nature can\npotentially be used to compress past information without caching data in the\nmemory explicitly. Based on the compressed information, synthetic examples can\nbe created within the region that recently generated new minority class\nexamples. Experiments with artificial and real-world data streams show that the\nproposed approach can handle concept drift involving different minority class\ndecomposition better than existing approaches, especially when the data stream\nis severely class imbalanced and presenting high proportions of safe and\nborderline minority class examples.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:06:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chiu","Chun Wai",""],["Minku","Leandro L.",""]]}
{"id":"2308.14846","submitter":"Reza Akhavian","authors":"Newsha Emaminejad and Reza Akhavian, Ph.D","title":"Trust in Construction AI-Powered Collaborative Robots: A Qualitative\n  Empirical Analysis","comments":"2023 ASCE International Conference on Computing in Civil Engineering\n  (I3CE)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC cs.AI cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Construction technology researchers and forward-thinking companies are\nexperimenting with collaborative robots (aka cobots), powered by artificial\nintelligence (AI), to explore various automation scenarios as part of the\ndigital transformation of the industry. Intelligent cobots are expected to be\nthe dominant type of robots in the future of work in construction. However, the\nblack-box nature of AI-powered cobots and unknown technical and psychological\naspects of introducing them to job sites are precursors to trust challenges. By\nanalyzing the results of semi-structured interviews with construction\npractitioners using grounded theory, this paper investigates the\ncharacteristics of trustworthy AI-powered cobots in construction. The study\nfound that while the key trust factors identified in a systematic literature\nreview -- conducted previously by the authors -- resonated with the field\nexperts and end users, other factors such as financial considerations and the\nuncertainty associated with change were also significant barriers against\ntrusting AI-powered cobots in construction.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:07:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Emaminejad","Newsha",""],["Akhavian","Reza",""],["D","Ph.",""]]}
{"id":"2308.14847","submitter":"Yuxuan Xue","authors":"Yuxuan Xue, Bharat Lal Bhatnagar, Riccardo Marin, Nikolaos Sarafianos,\n  Yuanlu Xu, Gerard Pons-Moll, Tony Tung","title":"NSF: Neural Surface Fields for Human Modeling from Monocular Depth","comments":"Accpted to ICCV 2023; Homepage at: https://yuxuan-xue.com/nsf","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Obtaining personalized 3D animatable avatars from a monocular camera has\nseveral real world applications in gaming, virtual try-on, animation, and\nVR/XR, etc. However, it is very challenging to model dynamic and fine-grained\nclothing deformations from such sparse data. Existing methods for modeling 3D\nhumans from depth data have limitations in terms of computational efficiency,\nmesh coherency, and flexibility in resolution and topology. For instance,\nreconstructing shapes using implicit functions and extracting explicit meshes\nper frame is computationally expensive and cannot ensure coherent meshes across\nframes. Moreover, predicting per-vertex deformations on a pre-designed human\ntemplate with a discrete surface lacks flexibility in resolution and topology.\nTo overcome these limitations, we propose a novel method `\\keyfeature: Neural\nSurface Fields' for modeling 3D clothed humans from monocular depth. NSF\ndefines a neural field solely on the base surface which models a continuous and\nflexible displacement field. NSF can be adapted to the base surface with\ndifferent resolution and topology without retraining at inference time.\nCompared to existing approaches, our method eliminates the expensive per-frame\nsurface extraction while maintaining mesh coherency, and is capable of\nreconstructing meshes with arbitrary resolution without retraining. To foster\nresearch in this direction, we release our code in project page at:\nhttps://yuxuan-xue.com/nsf.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:08:17 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 08:34:08 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xue","Yuxuan",""],["Bhatnagar","Bharat Lal",""],["Marin","Riccardo",""],["Sarafianos","Nikolaos",""],["Xu","Yuanlu",""],["Pons-Moll","Gerard",""],["Tung","Tony",""]]}
{"id":"2308.14848","submitter":"Roberta Giuffrida","authors":"Giuffrida Roberta, Lemoine-Goumard Marianne, Miceli Marco, Gabici\n  Stefano, Fukui Yasuo, Hidetoshi Sano","title":"Evidence for proton acceleration and escape from the Puppis A SNR using\n  Fermi-LAT observations","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC\n  2023), 8 pages, 2 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Supernova remnants (SNRs) are the best candidates for galactic cosmic ray\nacceleration to relativistic energies via diffusive shock acceleration. The\ngamma-ray emission of SNRs can provide direct evidence of leptonic (inverse\nCompton and bremsstrahlung) and hadronic (proton-proton interaction and\nsubsequently pion decay) processes. Puppis A is a ~ 4 kyr old SNR interacting\nwith interstellar clouds which has been observed in a broad energy band, from\nradio to gamma-ray. We performed a morphological and spectral analysis of 14\nyears of observations with Fermi-LAT telescope in order to study its gamma-ray\nemission. We found a clear asymmetry in high-energy brightness between the\neastern and western sides of the remnant, reminiscent to that observed in the\nX-ray emission. The eastern side, interacting with a molecular cloud, shows a\nspectrum which can be reproduced by a pion decay model. Moreover, we analyzed\ntwo gamma-ray sources located close to the remnant. The hardness of their\nspectra suggests that the gamma-ray emission can be due to particles escaping\nfrom the shock of Puppis A.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:09:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Roberta","Giuffrida",""],["Marianne","Lemoine-Goumard",""],["Marco","Miceli",""],["Stefano","Gabici",""],["Yasuo","Fukui",""],["Sano","Hidetoshi",""]]}
{"id":"2308.14849","submitter":"Albert Liu","authors":"Albert Liu, Danica Pavicevic, Marios H. Michael, Alex G. Salvador,\n  Pavel E. Dolgirev, Michael Fechner, Ankit S. Disa, Pedro M. Lozano, Qiang Li,\n  Genda D. Gu, Eugene Demler, Andrea Cavalleri","title":"Probing Inhomogeneous Cuprate Superconductivity by Terahertz Josephson\n  Echo Spectroscopy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.mtrl-sci physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Inhomogeneities play a crucial role in determining the properties of quantum\nmaterials. Yet methods that can measure these inhomogeneities are few, and\napply to only a fraction of the relevant microscopic phenomena. For example,\nthe electronic properties of cuprate materials are known to be inhomogeneous\nover nanometer length scales, although questions remain about how such disorder\ninfluences supercurrents and their dynamics. Here, two-dimensional terahertz\nspectroscopy is used to study interlayer superconducting tunneling in\nnear-optimally-doped La1.83Sr0.17CuO4. We isolate a 2 THz Josephson echo signal\nwith which we disentangle intrinsic lifetime broadening from extrinsic\ninhomogeneous broadening. We find that the Josephson plasmons are only weakly\ninhomogeneously broadened, with an inhomogeneous linewidth that is three times\nsmaller than their intrinsic lifetime broadening. This extrinsic broadening\nremains constant up to 0.7Tc, above which it is overcome by the\nthermally-increased lifetime broadening. Crucially, the effects of disorder on\nthe Josephson plasma resonance are nearly two orders of magnitude smaller than\nthe in-plane variations in the superconducting gap in this compound, which have\nbeen previously documented using Scanning Tunnelling Microscopy (STM)\nmeasurements. Hence, even in the presence of significant disorder in the\nsuperfluid density, the finite frequency interlayer charge fluctuations exhibit\ndramatically reduced inhomogeneous broadening. We present a model that relates\ndisorder in the superfluid density to the observed lifetimes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:09:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Albert",""],["Pavicevic","Danica",""],["Michael","Marios H.",""],["Salvador","Alex G.",""],["Dolgirev","Pavel E.",""],["Fechner","Michael",""],["Disa","Ankit S.",""],["Lozano","Pedro M.",""],["Li","Qiang",""],["Gu","Genda D.",""],["Demler","Eugene",""],["Cavalleri","Andrea",""]]}
{"id":"2308.14850","submitter":"Ala Alam Falaki","authors":"Ala Alam Falaki, and Robin Gras","title":"Attention Visualizer Package: Revealing Word Importance for Deeper\n  Insight into Encoder-Only Transformer Models","comments":"12 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This report introduces the Attention Visualizer package, which is crafted to\nvisually illustrate the significance of individual words in encoder-only\ntransformer-based models. In contrast to other methods that center on tokens\nand self-attention scores, our approach will examine the words and their impact\non the final embedding representation. Libraries like this play a crucial role\nin enhancing the interpretability and explainability of neural networks. They\noffer the opportunity to illuminate their internal mechanisms, providing a\nbetter understanding of how they operate and can be enhanced. You can access\nthe code and review examples on the following GitHub repository:\nhttps://github.com/AlaFalaki/AttentionVisualizer.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:11:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Falaki","Ala Alam",""],["Gras","Robin",""]]}
{"id":"2308.14851","submitter":"Vladica Andreji\\'c","authors":"Vladica Andreji\\'c and Katarina Luki\\'c","title":"The Orthogonality Principle for Osserman Manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce a new potential characterization of Osserman algebraic curvature\ntensors. An algebraic curvature tensor is Jacobi-orthogonal if\n$\\mathcal{J}_XY\\perp\\mathcal{J}_YX$ holds for all $X\\perp Y$, where\n$\\mathcal{J}$ denotes the Jacobi operator. We prove that any Jacobi-orthogonal\ntensor is Osserman, while all known Osserman tensors are Jacobi-orthogonal.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:12:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Andreji\u0107","Vladica",""],["Luki\u0107","Katarina",""]]}
{"id":"2308.14852","submitter":"Hatef Otroshi Shahreza","authors":"Hatef Otroshi Shahreza, Anjith George, S\\'ebastien Marcel","title":"SynthDistill: Face Recognition with Knowledge Distillation from\n  Synthetic Data","comments":"Accepted in the IEEE International Joint Conference on Biometrics\n  (IJCB 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  State-of-the-art face recognition networks are often computationally\nexpensive and cannot be used for mobile applications. Training lightweight face\nrecognition models also requires large identity-labeled datasets. Meanwhile,\nthere are privacy and ethical concerns with collecting and using large face\nrecognition datasets. While generating synthetic datasets for training face\nrecognition models is an alternative option, it is challenging to generate\nsynthetic data with sufficient intra-class variations. In addition, there is\nstill a considerable gap between the performance of models trained on real and\nsynthetic data. In this paper, we propose a new framework (named SynthDistill)\nto train lightweight face recognition models by distilling the knowledge of a\npretrained teacher face recognition model using synthetic data. We use a\npretrained face generator network to generate synthetic face images and use the\nsynthesized images to learn a lightweight student network. We use synthetic\nface images without identity labels, mitigating the problems in the intra-class\nvariation generation of synthetic datasets. Instead, we propose a novel dynamic\nsampling strategy from the intermediate latent space of the face generator\nnetwork to include new variations of the challenging images while further\nexploring new face images in the training batch. The results on five different\nface recognition datasets demonstrate the superiority of our lightweight model\ncompared to models trained on previous synthetic datasets, achieving a\nverification accuracy of 99.52% on the LFW dataset with a lightweight network.\nThe results also show that our proposed framework significantly reduces the gap\nbetween training with real and synthetic data. The source code for replicating\nthe experiments is publicly released.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:15:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shahreza","Hatef Otroshi",""],["George","Anjith",""],["Marcel","S\u00e9bastien",""]]}
{"id":"2308.14853","submitter":"John O. Dabiri","authors":"John O. Dabiri and Anthony Leonard","title":"Linear instability of viscous parallel shear flows: revisiting the\n  no-slip condition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear stability analysis currently fails to predict the empirically observed\ntransition to turbulence in plane Couette flow, plane Poiseuille flow, and\nHagen-Poiseuille pipe flow. We evaluate the associated Orr-Sommerfeld\neigenvalue problem using a Reynolds number-dependent slip boundary condition,\nof which the traditional no-slip condition is a limiting case. In all three\nflows, this ansatz reveals the existence of robust, strongly unstable\neigenmodes that appear at Reynolds numbers consistent with subsequent\nturbulence transition. The discovered unstable modes exhibit wall slip that is\nnon-zero but empirically indistinguishable from the no-slip condition, with\nnormalized values as small as $\\mathcal{O}(10^{-10})$. Hence, these results\nsuggest that the conventional no-slip condition may be an overly simplified\nmodel of fluid-solid interface physics, thereby limiting the fidelity of\nassociated hydrodynamic stability predictions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:16:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dabiri","John O.",""],["Leonard","Anthony",""]]}
{"id":"2308.14854","submitter":"Anil K. Pradhan","authors":"S.N. Nahar, L. Zhao, W. Eissner and A.K. Pradhan","title":"R-Matrix calculations for opacities.II. Photoionization and oscillator\n  strengths of iron ions FeXVII, FeXVIII and FeXIX","comments":"22 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Iron is the dominant heavy element that plays an important role in radiation\ntransport in stellar interiors. Owing to its abundance and large number of\nbound levels and transitions, iron ions determine the opacity more than any\nother astrophysically abundant element. A few iron ions constitute the\nabundance and opacity of iron at the base of the convection zone (BCZ) at the\nboundary between the solar convection and radiative zones, and are the focus of\nthe present study. Together, FeXVII, FeXVIII and FeXIX contribute 85\\% of iron\nion fractions 20\\%, 39\\% and 26\\% respectively, at the BCZ physical conditions.\nWe report heretofore the most extensive R-matrix atomic calculations for these\nions for bound-bound and bound-free transitions, the two main processes of\nradiation absorption. We consider wavefunction expansions with 218 target or\ncore ion fine structure levels of FeXVIII for FeXVII, 276 levels of FeXIX for\nFeXVIII, in the Breit-Pauli R-matrix (BPRM) approximation, and 180 LS terms\n(equivalent to 415 fine structure levels) of FeXX for FeXIX calculations. These\nlarge target expansions which includes core ion excitations to n=2,3,4\ncomplexes enable accuracy and convergence of photoionization cross sections, as\nwell as inclusion of high lying resonances. Photoionization cross sections have\nobtained for all bound fine structure levels of FeXVII and FeXVIII, and for 900\nbound LS states of FeXIX. Selected results demonstrating prominent\ncharacteristic features of photoionization are presented, particularly the\nstrong Seaton PEC (photoexcitation-of-core) resonances formed via high-lying\ncore excitations with $\\Delta n=1$ that significantly impact bound-free\nopacity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:18:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nahar","S. N.",""],["Zhao","L.",""],["Eissner","W.",""],["Pradhan","A. K.",""]]}
{"id":"2308.14855","submitter":"Javier Perez Soto","authors":"Javier Perez Soto, Cesar Laguna, Benjamin L. Gerard, Anne Dattilo,\n  Vincent Chambouleyron, and Rebecca Jensen-Clem","title":"Deformable mirror-based pupil chopping for exoplanet imaging and\n  adaptive optics","comments":"Conference Proceeding for 2023 SPIE Optics & Photonics, Techniques\n  and Instrumentation for Detection of Exoplanets XI","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Due to turbulence in the atmosphere images taken from ground-based telescopes\nbecome distorted. With adaptive optics (AO) images can be given greater clarity\nallowing for better observations with existing telescopes and are essential for\nground-based coronagraphic exoplanet imaging instruments. A disadvantage to\nmany AO systems is that they use sensors that can not correct for non-common\npath aberrations. We have developed a new focal plane wavefront sensing\ntechnique to address this problem called deformable mirror (DM)-based pupil\nchopping. The process involves a coronagraphic or non-coronagraphic science\nimage and a deformable mirror, which modulates the phase by applying a local\ntip/tilt every other frame which enables correcting for leftover aberrations in\nthe wavefront after a conventional AO correction. We validate this technique\nwith both simulations (for coronagraphic and non-coronagraphic images) and\ntesting (for non-coronagraphic images) on UCSC's Santa Cruz Extreme AO\nLaboratory (SEAL) testbed. We demonstrate that with as low as 250 nm of DM\nstroke to apply the local tip/tilt this wavefront sensor is linear for\nlow-order Zernike modes and enables real-time control, in principle up to kHz\nspeeds to correct for residual atmospheric turbulence.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:18:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Soto","Javier Perez",""],["Laguna","Cesar",""],["Gerard","Benjamin L.",""],["Dattilo","Anne",""],["Chambouleyron","Vincent",""],["Jensen-Clem","Rebecca",""]]}
{"id":"2308.14856","submitter":"C\\'assio Henrique Vieira Morais","authors":"Mario Jorge Dias Carneiro, Sonia Pinto-de-Carvalho, Sylvie Oliffson\n  Kamphors, Cassio Henrique Vieira Morais","title":"The Twist Property and the Existence of Invariant Curves for Convex\n  Billiards on Surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This work presents a framework for billiards in convex domains on two\ndimensional Riemannian manifolds. These domains are contained in connected,\nsimply connected open subsets which are totally normal. In this context, some\nbasic properties that have long been known for billiards on the plane are\nestablished. We prove the twist property and investigate conditions on the\nbilliard for the existence and non existence of rotational invariant curves.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:18:54 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 16:29:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Carneiro","Mario Jorge Dias",""],["Pinto-de-Carvalho","Sonia",""],["Kamphors","Sylvie Oliffson",""],["Morais","Cassio Henrique Vieira",""]]}
{"id":"2308.14857","submitter":"Christopher Cocuzza","authors":"C. Cocuzza, A. Metz, D. Pitonyak, A. Prokudin, N. Sato, R. Seidl","title":"First Simultaneous Global QCD Analysis of Dihadron Fragmentation\n  Functions and Transversity Parton Distribution Functions","comments":"34 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex hep-lat nucl-ex nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We perform a comprehensive study within quantum chromodynamics (QCD) of\ndihadron observables in electron-positron annihilation, semi-inclusive\ndeep-inelastic scattering, and proton-proton collisions, including recent cross\nsection data from Belle and azimuthal asymmetries from STAR. We extract\nsimultaneously for the first time $\\pi^+\\pi^-$ dihadron fragmentation functions\n(DiFFs) and the nucleon transversity distributions for up and down quarks as\nwell as antiquarks. For the transversity distributions we impose their\nsmall-$x$ asymptotic behavior and the Soffer bound. In addition, we utilize a\nnew definition of DiFFs that has a number density interpretation to then\ncalculate expectation values for the dihadron invariant mass and momentum\nfraction. Furthermore, we investigate the compatibility of our transversity\nresults with those from single-hadron fragmentation (from a transverse momentum\ndependent/collinear twist-3 framework) and the nucleon tensor charges computed\nin lattice QCD. We find a universal nature to all of this available\ninformation. Future measurements of dihadron production can significantly\nfurther this research, especially, as we show, those that are sensitive to the\nregion of large parton momentum fractions.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:19:25 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cocuzza","C.",""],["Metz","A.",""],["Pitonyak","D.",""],["Prokudin","A.",""],["Sato","N.",""],["Seidl","R.",""]]}
{"id":"2308.14858","submitter":"Patrick Rupprecht","authors":"Patrick Rupprecht (1 and 2), Alexander Magunia (1), Lennart Aufleger\n  (1), Christian Ott (1), Thomas Pfeifer (1 and 3) ((1) Max-Planck-Institut\n  f\\\"ur Kernphysik, (2) Currently with Lawrence Berkeley National Laboratory,\n  (3) Center for Quantum Dynamics, Ruprecht-Karls-Universit\\\"at Heidelberg)","title":"Flexible experimental platform for dispersion-free temporal\n  characterization of ultrashort pulses","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The precise temporal characterization of laser pulses is crucial for\nultrashort applications in biology, chemistry, and physics. Especially in\nfemto- and attosecond science, diverse laser pulse sources in different\nspectral regimes from the visible to the short-wavelength infrared as well as\npulse durations ranging from picoseconds to few femtoseconds are employed. In\nthis article, we present a versatile temporal-characterization apparatus that\ncan access these different temporal and spectral regions in a dispersion-free\nmanner and without phase-matching constraints. The design combines\ntransient-grating and surface third-harmonic-generation frequency-resolved\noptical gating in one device with optimized alignment capabilities based on a\nnoncollinear geometry.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:25:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Rupprecht","Patrick","","1 and 2"],["Magunia","Alexander","","1 and 3"],["Aufleger","Lennart","","1 and 3"],["Ott","Christian","","1 and 3"],["Pfeifer","Thomas","","1 and 3"]]}
{"id":"2308.14859","submitter":"Xiaochun Li","authors":"Xiaochun Li and Xuerui Yang","title":"Improvement on Gauss circle Problem and Dirichlet divisor Problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish an improvement for both Gauss circle problem and Dirichlet\ndivisor problem, combining a new estimate of the first spacing problem and\nHuxley's results on the second spacing problem.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:30:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Xiaochun",""],["Yang","Xuerui",""]]}
{"id":"2308.14860","submitter":"Evgueni Doubtsov","authors":"Evgueni Doubtsov","title":"Reverse Carleson measures for Hardy spaces in the unit ball","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $H^p=H^p(B_d)$ denote the Hardy space in the open unit ball $B_d$ of\n$\\mathbb{C}^d$, $d\\ge 1$. We characterize the reverse Carleson measures for\n$H^p$, $1<p<\\infty$, that is, we describe all finite positive Borel measures\n$\\mu$, defined on the closed ball $\\overline{B}_d$, such that \\[ \\|f \\|_{H^p}\n\\le c \\|f\\|_{L^p(\\overline{B}_d,\\mu)} \\] for all $f\\in H^p(B_d) \\cap\nC(\\overline{B}_d)$ and a universal constant $c>0$. Given a non-inner\nholomorphic function $b: B_d \\to B_1$, we obtain properties of the reverse\nCarleson measures for the de Branges-Rovnyak space $\\mathcal{H}(b)$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:31:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Doubtsov","Evgueni",""]]}
{"id":"2308.14861","submitter":"Mutahar Safdar","authors":"Lynn Cherif, Mutahar Safdar, Guy Lamouche, Priti Wanjara, Padma Paul,\n  Gentry Wood, Max Zimmermann, Florian Hannesen, Yaoyao Fiona Zhao","title":"Evaluation of Key Spatiotemporal Learners for Print Track Anomaly\n  Classification Using Melt Pool Image Streams","comments":"This work has been accepted to IFAC for publication under a Creative\n  Commons Licence CC-BY-NC-ND","journal-ref":null,"doi":null,"report-no":"2577","categories":"cs.LG cs.AI cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent applications of machine learning in metal additive manufacturing (MAM)\nhave demonstrated significant potential in addressing critical barriers to the\nwidespread adoption of MAM technology. Recent research in this field emphasizes\nthe importance of utilizing melt pool signatures for real-time defect\nprediction. While high-quality melt pool image data holds the promise of\nenabling precise predictions, there has been limited exploration into the\nutilization of cutting-edge spatiotemporal models that can harness the inherent\ntransient and sequential characteristics of the additive manufacturing process.\nThis research introduces and puts into practice some of the leading deep\nspatiotemporal learning models that can be adapted for the classification of\nmelt pool image streams originating from various materials, systems, and\napplications. Specifically, it investigates two-stream networks comprising\nspatial and temporal streams, a recurrent spatial network, and a factorized 3D\nconvolutional neural network. The capacity of these models to generalize when\nexposed to perturbations in melt pool image data is examined using data\nperturbation techniques grounded in real-world process scenarios. The\nimplemented architectures demonstrate the ability to capture the spatiotemporal\nfeatures of melt pool image sequences. However, among these models, only the\nKinetics400 pre-trained SlowFast network, categorized as a two-stream network,\nexhibits robust generalization capabilities in the presence of data\nperturbations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:31:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cherif","Lynn",""],["Safdar","Mutahar",""],["Lamouche","Guy",""],["Wanjara","Priti",""],["Paul","Padma",""],["Wood","Gentry",""],["Zimmermann","Max",""],["Hannesen","Florian",""],["Zhao","Yaoyao Fiona",""]]}
{"id":"2308.14862","submitter":"Michail Athanasakis-Kaklamanakis","authors":"M. Athanasakis-Kaklamanakis, S. G. Wilkins, L. V. Skripnikov, A.\n  Koszorus, A. A. Breier, M. Au, I. Belosevic, R. Berger, M. L. Bissell, A.\n  Borschevsky, A. Brinson, K. Chrysalidis, T. E. Cocolios, R. P. de Groote, A.\n  Dorne, C. M. Fajardo-Zambrano, R. W. Field, K. T. Flanagan, S. Franchoo, R.\n  F. Garcia Ruiz, K. Gaul, S. Geldhof, T. F. Giesen, D. Hanstorp, R. Heinke, T.\n  A. Isaev, A. A. Kyuberis, S. Kujanpaa, L. Lalanne, G. Neyens, M. Nichols, L.\n  F. Pasteka, H. A. Perrett, J. R. Reilly, S. Rothe, S.-M. Udrescu, B. van den\n  Borne, Q. Wang, J. Wessolek, X. F. Yang, C. Zuelch","title":"Pinning down electron correlations in RaF via spectroscopy of excited\n  states","comments":"Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph nucl-ex physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the spectroscopy of 11 electronic states in the radioactive\nmolecule radium monofluoride (RaF). The observed excitation energies are\ncompared with state-of-the-art relativistic Fock-space coupled cluster (FS-RCC)\ncalculations, which achieve an agreement of >99.71% (within ~8 meV) for all\nstates. High-order electron correlation and quantum electrodynamics corrections\nare found to be important at all energies. Establishing the accuracy of\ncalculations is an important step towards high-precision studies of these\nmolecules, which are proposed for sensitive searches of physics beyond the\nStandard Model.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:32:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Athanasakis-Kaklamanakis","M.",""],["Wilkins","S. G.",""],["Skripnikov","L. V.",""],["Koszorus","A.",""],["Breier","A. A.",""],["Au","M.",""],["Belosevic","I.",""],["Berger","R.",""],["Bissell","M. L.",""],["Borschevsky","A.",""],["Brinson","A.",""],["Chrysalidis","K.",""],["Cocolios","T. E.",""],["de Groote","R. P.",""],["Dorne","A.",""],["Fajardo-Zambrano","C. M.",""],["Field","R. W.",""],["Flanagan","K. T.",""],["Franchoo","S.",""],["Ruiz","R. F. Garcia",""],["Gaul","K.",""],["Geldhof","S.",""],["Giesen","T. F.",""],["Hanstorp","D.",""],["Heinke","R.",""],["Isaev","T. A.",""],["Kyuberis","A. A.",""],["Kujanpaa","S.",""],["Lalanne","L.",""],["Neyens","G.",""],["Nichols","M.",""],["Pasteka","L. F.",""],["Perrett","H. A.",""],["Reilly","J. R.",""],["Rothe","S.",""],["Udrescu","S. -M.",""],["Borne","B. van den",""],["Wang","Q.",""],["Wessolek","J.",""],["Yang","X. F.",""],["Zuelch","C.",""]]}
{"id":"2308.14863","submitter":"Balazs Patkos","authors":"Bal\\'azs Patk\\'os, Andrew Treglown","title":"On some extremal and probabilistic questions for tree posets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Given two posets $P,Q$ we say that $Q$ is $P$-free if $Q$ does not contain a\ncopy of $P$. The size of the largest $P$-free family in $2^{[n]}$, denoted by\n$La(n,P)$, has been extensively studied since the 1980s. We consider several\nrelated problems. Indeed, for posets $P$ whose Hasse diagrams are trees and\nhave radius at most $2$, we prove that there are $2^{(1+o(1))La(n,P)}$ $P$-free\nfamilies in $2^{[n]}$, thereby confirming a conjecture of Gerbner, Nagy,\nPatk\\'os and Vizer [Electronic Journal of Combinatorics, 2021] in these cases.\nFor such $P$ we also resolve the random version of the $P$-free problem, thus\ngeneralising the random version of Sperner's theorem due to Balogh, Mycroft and\nTreglown [Journal of Combinatorial Theory Series A, 2014], and Collares Neto\nand Morris [Random Structures and Algorithms, 2016]. Additionally, we make a\ngeneral conjecture that, roughly speaking, asserts that subfamilies of\n$2^{[n]}$ of size sufficiently above $La(n,P)$ robustly contain $P$, for any\nposet $P$ whose Hasse diagram is a tree.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:34:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Patk\u00f3s","Bal\u00e1zs",""],["Treglown","Andrew",""]]}
{"id":"2308.14864","submitter":"Dieterich Lawson","authors":"Dieterich Lawson, Michael Li, Scott Linderman","title":"NAS-X: Neural Adaptive Smoothing via Twisting","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present Neural Adaptive Smoothing via Twisting (NAS-X), a method for\nlearning and inference in sequential latent variable models based on reweighted\nwake-sleep (RWS). NAS-X works with both discrete and continuous latent\nvariables, and leverages smoothing SMC to fit a broader range of models than\ntraditional RWS methods. We test NAS-X on discrete and continuous tasks and\nfind that it substantially outperforms previous variational and RWS-based\nmethods in inference and parameter recovery.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:35:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lawson","Dieterich",""],["Li","Michael",""],["Linderman","Scott",""]]}
{"id":"2308.14865","submitter":"Jacobus Conradi","authors":"Jacobus Conradi and Anne Driemel","title":"Finding Complex Patterns in Trajectory Data via Geometric Set Cover","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Clustering trajectories is a central challenge when confronted with large\namounts of movement data such as full-body motion data or GPS data. We study a\nclustering problem that can be stated as a geometric set cover problem: Given a\npolygonal curve of complexity $n$, find the smallest number $k$ of\nrepresentative trajectories of complexity at most $l$ such that any point on\nthe input trajectories lies on a subtrajectory of the input that has Fr\\'echet\ndistance at most $\\Delta$ to one of the representative trajectories. This\nproblem was first studied by Akitaya et al. (2021) and Br\\\"uning et al. (2022).\nThey present a bicriteria approximation algorithm that returns a set of curves\nof size $O(kl\\log(kl))$ which covers the input with a radius of $11\\Delta$ in\ntime $\\widetilde{O}((kl)^2n + kln^3)$, where $k$ is the smallest number of\ncurves of complexity $l$ needed to cover the input with a distance of $\\Delta$.\nThe representative trajectories computed by their algorithm are always line\nsegments. In applications however, one is usually interested in representative\ncurves of higher complexity which consist of several edges. We present a new\napproach that builds upon the works of Br\\\"uning et al. (2022) computing a set\nof curves of size $O(k\\log(n))$ in time $\\widetilde{O}(l^2n^4 + kln^4)$ with\nthe same distance guarantee of $11\\Delta$, where each curve may consist of\ncurves of complexity up to the given complexity parameter $l$. To validate our\napproach, we conduct experiments on different types of real world data:\nhigh-dimensional full-body motion data and low-dimensional GPS-tracking data.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:40:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Conradi","Jacobus",""],["Driemel","Anne",""]]}
{"id":"2308.14866","submitter":"F. S. Guzman","authors":"Iv\\'an \\'Alvarez-Rios, Francisco S. Guzm\\'an","title":"Spherical solutions of the Schr\\\"odinger-Poisson system with core-tail\n  structure","comments":"10 pages, 10 figures. Accepted for publication in Phys. Rev. D","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We construct spherically symmetric equilibrium solutions of the\nSchr\\\"odinger-Poisson (SP) system of equations with a core-tail structure that\ncould serve as models of Fuzzy Dark Matter (FDM) halos. The core is assumed to\nbe a solitonic ground state equilibrium configuration of the SP equations, and\nthe tail is integrated from a transition radius onwards. The total mass of the\nsystem parametrizes the family of solutions and constrains the tail density\nprofile. The tail has a radial velocity profile, whereas the core is\nstationary. We investigate the evolution of these equilibrium configurations\nand find that the tail initially perturbs the core, and consequently, the whole\nsolution oscillates around a virialized solution that we call 'relaxed', whose\naverage also has a core-tail structure. We measure the departure of the relaxed\nconfiguration from the equilibrium solution in order to estimate the utility of\nthe latter. We also find that the core-halo scaling relation of equilibrium\nconfigurations has an exponent $\\alpha=1/3$, whereas relaxed configurations\nexhibit a scaling with $\\alpha=0.54$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:41:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["\u00c1lvarez-Rios","Iv\u00e1n",""],["Guzm\u00e1n","Francisco S.",""]]}
{"id":"2308.14867","submitter":"Ekin Ozman","authors":"Ozlem Ejder, Yasemin Kara, Ekin Ozman","title":"Iterated Monodromy Group of a PCF Quadratic Non-polynomial Map","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the postcritically finite non-polynomial map\n$f(x)=\\frac{1}{(x-1)^2}$ over a number field $k$ and prove various results\nabout the geometric $G^{\\text{geom}}(f)$ and arithmetic $G^{\\text{arith}}(f)$\niterated monodromy groups of $f$. We show that the elements of\n$G^{\\text{geom}}(f)$ are the ones in $G^{\\text{arith}}(f)$ that are fixing the\nroots of unity by assuming a conjecture on the size of $G^{\\text{geom}}_n(f)$.\nFurthermore, we describe exactly for which $a \\in k$ the Arboreal Galois group\n$G_a(f)$ and $G^{\\text{arith}}(f)$ are equal.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:42:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ejder","Ozlem",""],["Kara","Yasemin",""],["Ozman","Ekin",""]]}
{"id":"2308.14868","submitter":"C\\'esar Fosco","authors":"Aitor Fern\\'andez and C\\'esar D. Fosco","title":"On the spatial dependence of Casimir friction in graphene","comments":"10 pages, LaTeX","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph hep-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the spatial properties of the Casimir friction phenomenon for an\natom moving at a non-relativistic constant velocity parallel to a planar\ngraphene sheet. The coupling of the atom to the vacuum electromagnetic (EM)\nfield is implemented by an electric dipole term, plus a R\\\"ontgen term. We\nstudy the fermion pair production, evaluating the angular dependence of the\nfermion emission probability. The phenomenon exhibits a threshold: it only\nexists when the speed of the sliding motion is larger than the Fermi velocity\nof the medium.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:44:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fern\u00e1ndez","Aitor",""],["Fosco","C\u00e9sar D.",""]]}
{"id":"2308.14869","submitter":"Haoyang Yao","authors":"Haoyang Yao and Laurence Yang","title":"PROSO Toolbox: a unified protein-constrained genome-scale modelling\n  framework for strain designing and optimization","comments":"4 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The genome-scale metabolic model with protein constraint (PC-model) has been\nincreasingly popular for microbial metabolic simulations. We present PROSO\nToolbox, a unified and simple-to-use PC-model toolbox that takes any\nhigh-quality genome-scale metabolic reconstruction as the input. The toolbox\ncan construct a PC-model automatically, apply various algorithms for\ncomputational strain design and simulation, and help unveil metabolism from\ngene expression data through a state-of-the-art OVERLAY workflow. It also has\ndetailed tutorials and documentation for maximum accessibility to researchers\nfrom diverse backgrounds. PROSO Toolbox, tutorials, and documentation are\nfreely available online: https://github.com/QCSB/PROSO-Toolbox.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:44:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yao","Haoyang",""],["Yang","Laurence",""]]}
{"id":"2308.14870","submitter":"Anil K. Pradhan","authors":"A.K. Pradhan (Dept. of Astronomy, The Ohio State University)","title":"R-matrix calculations for opacities: III. Plasma broadening of\n  autoionizing resonances","comments":"20 pages, 5 figures. arXiv admin note: substantial text overlap with\n  arXiv:2301.07734","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A general formulation is employed to study and quantitatively ascertain the\neffect of plasma broadening of {\\it intrinsic} autoionizing (AI) resonances in\nphotoionization cross sections. In particular, R-matrix data for iron ions\ndescribed in the previous paper in the RMOP series (RMOP-II, hereafter RMOP2)\nare used to demonstrate underlying physical mechanisms due to electron\ncollisions, ion microfields (Stark), thermal Doppler effects, core excitations,\nand free-free transitions. Breit-Pauli R-matrix (BPRM) cross section for the\nlarge number of bound levels of Fe ions are considered, 454 levels of Fe~XVII,\n1,184 levels of Fe~XVIII and 508 levels of Fe~XIX. Following a description of\ntheoretical and computational methods, a sample of results is presented to show\nsignificant broadening and shifting of AI resonances due to {\\it Extrinsic}\nplasma broadening as a function of temperature and density. Redistribution of\nAI resonance strengths broadly preserves their integrated strengths as well as\nthe naturally {\\it intrinsic} asymmetric shapes of resonance complexes which\nare broadened, smeared and flattened, eventually dissolving into the bound-free\ncontinua.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:46:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pradhan","A. K.","","Dept. of Astronomy, The Ohio State University"]]}
{"id":"2308.14871","submitter":"Lei Chang","authors":"Xiaobin Wang, Minghui Ding and Lei Chang","title":"Sieving parton distribution function moments via the moment problem","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-lat","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Reconstructing parton distribution function (PDF) from the corresponding\nMellin moments belongs to a classical mathematical problem: the moment problem,\nwhich has been overlooked for years in the contemporary hadron community. We\npropose the strategy to sieve the moments leveraging PDF properties such as\ncontinuity, unimodality, and symmetry. Through an error-inclusive sifting\nprocess, we refine three sets of lattice QCD PDF moments. This refinement\nsignificantly reduces the errors, particularly for higher order moments, and\nlocates the peak of PDF simultaneously. As our method is universally applicable\nto PDF moments from any methodology, we strongly advocate its integration into\nall PDF moment calculations.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:47:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Xiaobin",""],["Ding","Minghui",""],["Chang","Lei",""]]}
{"id":"2308.14872","submitter":"Philipp \\\"Offner","authors":"Dmitri Kuzmin, M\\'aria Luk\\'acova-Medvid'ov\\'a and Philipp \\\"Offner","title":"Consistency and convergence of flux-corrected finite element methods for\n  nonlinear hyperbolic problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the consistency and convergence of flux-corrected finite\nelement approximations in the context of nonlinear hyperbolic conservation\nlaws. In particular, we focus on a monolithic convex limiting approach and\nprove a Lax--Wendroff-type theorem for the corresponding semi-discrete problem.\nA key component of our analysis is the use of a weak estimate on bounded\nvariation, which follows from the semi-discrete entropy stability property of\nthe method under investigation. For the Euler equations of gas dynamics, we\nprove the weak convergence of the flux-corrected finite element scheme to a\ndissipative weak solution. If a strong solution exists, the sequence of\nnumerical approximations converges strongly to the strong solution.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:49:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kuzmin","Dmitri",""],["Luk\u00e1cova-Medvid'ov\u00e1","M\u00e1ria",""],["\u00d6ffner","Philipp",""]]}
{"id":"2308.14873","submitter":"Sami Diaf","authors":"Sami Diaf","title":"CommunityFish: A Poisson-based Document Scaling With Hierarchical\n  Clustering","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG cs.SI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Document scaling has been a key component in text-as-data applications for\nsocial scientists and a major field of interest for political researchers, who\naim at uncovering differences between speakers or parties with the help of\ndifferent probabilistic and non-probabilistic approaches. Yet, most of these\ntechniques are either built upon the agnostically bag-of-word hypothesis or use\nprior information borrowed from external sources that might embed the results\nwith a significant bias. If the corpus has long been considered as a collection\nof documents, it can also be seen as a dense network of connected words whose\nstructure could be clustered to differentiate independent groups of words,\nbased on their co-occurrences in documents, known as communities. This paper\nintroduces CommunityFish as an augmented version of Wordfish based on a\nhierarchical clustering, namely the Louvain algorithm, on the word space to\nyield communities as semantic and independent n-grams emerging from the corpus\nand use them as an input to Wordfish method, instead of considering the word\nspace. This strategy emphasizes the interpretability of the results, since\ncommunities have a non-overlapping structure, hence a crucial informative power\nin discriminating parties or speakers, in addition to allowing a faster\nexecution of the Poisson scaling model. Aside from yielding communities,\nassumed to be subtopic proxies, the application of this technique outperforms\nthe classic Wordfish model by highlighting historical developments in the U.S.\nState of the Union addresses and was found to replicate the prevailing\npolitical stance in Germany when using the corpus of parties' legislative\nmanifestos.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:52:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Diaf","Sami",""]]}
{"id":"2308.14874","submitter":"Rafael De Mello","authors":"Diego Andr\\'e Cerqueira, Rafael Maiani de Mello, Guilherme Horta\n  Travassos","title":"Experimental Evaluation of a Checklist-Based Inspection Technique to\n  Verify the Compliance of Software Systems with the Brazilian General Data\n  Protection Law","comments":"Registered Report accepted for presentation at 17th ACM/IEEE\n  International Symposium on Empirical Software Engineering and Measurement.\n  New Orleans, Louisiana, United States","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Recent laws to ensure the security and protection of personal data establish\nnew software requirements. Consequently, new technologies are needed to\nguarantee software quality under the perception of privacy and protection of\npersonal data. Therefore, we created a checklist-based inspection technique\n(LGPDCheck) to support the identification of defects in software artifacts\nbased on the principles established by the Brazilian General Data Protection\nLaw (LGPD). Objective/Aim: To evaluate the effectiveness and efficiency of\nLGPDCheck for verifying privacy and data protection (PDP) in software artifacts\ncompared to ad-hoc techniques. Method: To assess LGPDCheck and ad-hoc\ntechniques experimentally through a quasi-experiment (two factors, five\ntreatments). The data will be collected from IoT-based health software systems\nbuilt by software engineering students from the Federal University of Rio de\nJaneiro. The data analyses will compare results from ad-hoc and LGPDCheck\ninspections, the participant's effectiveness and efficiency in each trial,\ndefects' variance and standard deviation, and time spent with the reviews. The\ndata will be screened for outliers, and normality and homoscedasticity will be\nverified using the Shapiro-Wilk and Levene tests. Nonparametric or parametric\ntests, such as the Wilcoxon or Student's t-tests, will be applied as\nappropriate.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:57:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cerqueira","Diego Andr\u00e9",""],["de Mello","Rafael Maiani",""],["Travassos","Guilherme Horta",""]]}
{"id":"2308.14875","submitter":"Leonardo Balart","authors":"Leonardo Balart, Sharmanthie Fernando","title":"Thermodynamics and the Joule-Thomson expansion of dilaton black holes in\n  2+1 dimensions","comments":"26 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study thermodynamics and its applications to the static\ncharged dilaton black hole in 2+1 dimensions. We compute the first law and the\nSmarr relations for the black hole and introduce a new thermodynamical\nparameter in order to satisfy the first law. We compute specific heat\ncapacities, internal energy and free energy for the black hole and study local\nand global stability of the black hole. For N = 1, the black hole is locally\nstable for all values of the horizon radius and does not go through phase\ntransitions. Maxwell`s relations are presented for this case. For N = 6/7,\nsmall black holes are locally stable and large black holes are not. There is a\nfirst order phase transition between small black holes and the thermal AdS\nspace. We have also studied the Joule-Thomson expansion for black holes with N\n= 1. It is also noted that unlike the charged BTZ black hole, the charged\ndilaton black hole does not violate the Reverse Isoperimetric Inequality for\ncertain values of parameters of the theory.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 19:59:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Balart","Leonardo",""],["Fernando","Sharmanthie",""]]}
{"id":"2308.14876","submitter":"Elham Morshedzadeh Dr","authors":"Nazila Roofigari-Esfahan, Elham Morshedzadeh, Poorvesh Dongro","title":"A Conceptual Framework for Designing Interactive Human-Centred Building\n  Spaces to Enhance User Experience in Specific-Purpose Buildings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Human/User interaction with buildings are mostly restricted to interacting\nwith building automation systems through user-interfaces that mainly aim to\nimprove energy efficiency of buildings and ensure comfort of occupants. This\nresearch builds on the existing theories of Human-Building Interaction (HBI)\nand proposes a novel conceptual framework for HBI that combines the concepts of\nHuman-Computer Interaction (HCI) and Ambient Intelligence (AmI). The proposed\nframework aims to study the needs of occupants in specific-purpose buildings,\nwhich is currently undermined. Specifically, we explore the application of the\nproposed HBI framework to improve the learning experience of students in\nacademic buildings. Focus groups and semi-structured interviews were conducted\namong students who are considered primary occupants of Goodwin Hall, a flagship\nsmart engineering building at Virginia Tech. Qualitative coding and concept\nmapping were used to analyze the qualitative data and determine the impact of\noccupant-specific needs on the learning experience of students in academic\nbuildings. The occupant-specific problem that was found to have the highest\ndirect impact on learning experience was finding study space and highest\nindirect impact was Indoor Environment Quality (IEQ). We discuss new ideas for\ndesigning Intelligent User Interfaces (IUI), e.g. Augmented Reality (AR),\nincrease the perceivable affordances for building occupants and considering a\ncontext-aware ubiquitous analytics-based strategy to provide services that are\ntailored to address the identified needs.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:00:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Roofigari-Esfahan","Nazila",""],["Morshedzadeh","Elham",""],["Dongro","Poorvesh",""]]}
{"id":"2308.14877","submitter":"David Salas","authors":"Aris Daniilidis, Tri Minh Le, David Salas","title":"Metric compatibility and determination in complete metric spaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  It was established in [8] that Lipschitz inf-compact functions are uniquely\ndetermined by their local slope and critical values. Compactness played a\nparamount role in this result, ensuring in particular the existence of critical\npoints. We hereby emancipate from this restriction and establish a\ndetermination result for merely bounded from below functions, by adding an\nassumption controlling the asymptotic behavior. This assumption is trivially\nfulfilled if $f$ is inf-compact. In addition, our result is not only valid for\nthe (De Giorgi) local slope, but also for the main paradigms of average descent\noperators as well as for the global slope, case in which the asymptotic\nassumption becomes superfluous. Therefore, the present work extends\nsimultaneously the metric determination results of [8] and [18].\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:00:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Daniilidis","Aris",""],["Le","Tri Minh",""],["Salas","David",""]]}
{"id":"2308.14878","submitter":"Hong Liu","authors":"Hong Liu and Dimitrie Culcer","title":"Dominance of extrinsic scattering mechanisms in the orbital Hall effect:\n  graphene, transition metal dichalcogenides and topological antiferromagnets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  The theory of the orbital Hall effect (OHE), a transverse flow of orbital\nangular momentum in response to an electric field, has concentrated\noverwhelmingly on intrinsic mechanisms. Here, using a quantum kinetic\nformulation, we determine the full OHE in the presence of short-range disorder\nusing 2D massive Dirac fermions as a prototype. We find that, in doped systems,\nextrinsic effects associated with the Fermi surface (skew scattering and side\njump) provide $\\approx 95\\%$ of the OHE. This suggests that, at experimentally\nrelevant transport densities, the OHE is primarily extrinsic.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:03:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Hong",""],["Culcer","Dimitrie",""]]}
{"id":"2308.14879","submitter":"Miles Couchman","authors":"Miles M. P. Couchman, Miguel Beneitez, Jacob Page, Rich R. Kerswell","title":"Inertial enhancement of the polymer diffusive instability","comments":"10 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Beneitez et al. (2023b) have recently discovered a new linear \"polymer\ndiffusive instability\" (PDI) in inertialess viscoelastic rectilinear shear flow\nof a FENE-P fluid with polymer stress diffusion. Here, we examine the impact of\ninertia on the PDI, which we delineate for both plane Couette and channel\nconfigurations under varying Weissenberg number $W$, polymer stress diffusivity\n$\\varepsilon$, solvent-to-total viscosity $\\beta$ and Reynolds number $Re$,\nconsidering Oldroyd-B and FENE-P constitutive relations. Both the prevalence of\nthe instability in parameter space and the associated growth rates are found to\nsignificantly increase with $Re$. For instance, as $Re$ increases with $\\beta$\nfixed, the instability emerges at progressively lower values of $W$ and\n$\\varepsilon$ than in the inertialess limit, and the associated growth rates\nincrease linearly with $Re$ when all other parameters are fixed. This\nstrengthening of PDI with inertia and the fact that stress diffusion is always\npresent in time-stepping algorithms, either implicitly as part of the scheme or\nexplicitly as a stabiliser, implies that the instability is likely operative in\ncomputational work using the popular Oldroyd-B and FENE-P constitutive models.\nThe fundamental question now is whether PDI is physical and observable in\nexperiments, or is instead an artifact of the constitutive models that must be\nsuppressed.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:08:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Couchman","Miles M. P.",""],["Beneitez","Miguel",""],["Page","Jacob",""],["Kerswell","Rich R.",""]]}
{"id":"2308.14880","submitter":"Anil K. Pradhan","authors":"L. Zhao, S.N. Nahar, W. Eissner and A.K. Pradhan","title":"R-Matrix calculations for opacities: IV. Convergence, completeness, and\n  comparison of relativistic R-matrix and distorted wave calculations for\n  FeXVII and FeXVIII","comments":"15 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  To investigate the completeness of coupled channel (CC) Breit-Pauli R-Matrix\n(BPRM) calculations for opacities, we employ the relativistic distorted wave\n(RDW) method to complement (``top-up'') and compare the BPRM photoionization\ncross sections for high-$n\\ell$ levels of both FeXVII and FeXVIII. Good\nagreement is found in background photoionization cross sections using these two\nmethods, which also ensures correct matching of bound level cross sections for\ncompleteness. In order to top-up the CC-BPRM calculations, bound-bound\ntransitions involving additional bound levels, and a large number of\ndoubly-excited quasi-bound levels corresponding to BPRM autoionizing resonances\ndescribed in paper RMOPII, are calculated using the RDW method. Photoionization\ncross sections in the high energy region are also computed and compared up to\nabout 500 $Ry$, and contributions from higher core level excitations than BPRM\nare considered. The effect of configuration interaction is investigated, which\nplays a significant role in correctly reproducing some background cross\nsections. Owing to the fact that the additional RDW levels correspond to\nhigh-$n\\ell$ bound levels that are negligibly populated according to the\nMihalas-Hummer-D\\\"{a}ppen equation-of-state (Paper I), the effect on opacities\nis expected to be small.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:09:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhao","L.",""],["Nahar","S. N.",""],["Eissner","W.",""],["Pradhan","A. K.",""]]}
{"id":"2308.14881","submitter":"Daniel Zini Rossatto","authors":"Luiz Otavio Ribeiro Solak, Daniel Zini Rossatto, Celso Jorge\n  Villas-Boas","title":"Universal Quantum Computation Using Atoms in Cross-Cavity Systems","comments":"7+7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum gates are the building blocks of quantum circuits, which in turn are\nthe cornerstones of quantum information processing. In this work we\ntheoretically investigate a single-step implementation of both a universal two-\n(CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup coupled\nto a $\\Lambda$-type three-level atom. Within a high-cooperativity regime, the\nsystem exhibits an atomic-state-dependent quantum interference involving the\ntwo-mode single-photon bright and dark states of the input light pulses. This\nallows for the controlled manipulation of light states by the atom and vice\nversa. Our results indicate these quantum gates can be implemented with high\nprobability of success using the state-of-the-art parameters, either for the\nweak- or strong-coupling regime, where the quantum interference is due to an\nelectromagnetically-induced-transparency-like phenomenon and the Autler-Townes\nsplitting, respectively. This work not only paves the way for implementing\nquantum gates in a single step using simple resources, thus avoiding the need\nto chain basic gates together in a circuit, but it also endorses the potential\nof cross-cavity systems for realizing universal quantum computation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:09:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Solak","Luiz Otavio Ribeiro",""],["Rossatto","Daniel Zini",""],["Villas-Boas","Celso Jorge",""]]}
{"id":"2308.14882","submitter":"Anil K. Pradhan","authors":"A.K. Pradhan, S.N. Nahar and W. Eissner","title":"R-Matrix calculations for opacities: I. Methodology and computations","comments":"16 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.atom-ph physics.plasm-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An extended version of the R-matrix methodology is presented for calculation\nof radiative parameters for improved plasma opacities. Contrast and comparisons\nwith existing methods primarily relying on the Distorted Wave (DW)\napproximation are discussed to verify accuracy and resolve outstanding issues,\nparticularly with reference to the Opacity Project (OP). Among the improvements\nincorporated are: (i) large-scale Breit-Pauli R-matrix (BPRM) calculations for\ncomplex atomic systems including fine structure, (ii) convergent close coupling\nwave function expansions for the (e+ion) system to compute oscillator strengths\nand photoionization cross sections, (iii) open and closed shell iron ions of\ninterest in astrophysics and experiments, (iv) a treatment for plasma\nbroadening of autoionizing resonances as function of energy-temperature-density\ndependent cross sections, (v) a \"top-up\" procedure to compare convergence with\nR-matrix calculations for highly excited levels, and (vi) spectroscopic\nidentification of resonances and bound \\eion levels. The present R-matrix\nmonochromatic opacity spectra are fundamentally different from OP and lead to\nenhanced Rosseland and Planck mean opacities. An outline of the work reported\nin other papers in this series and those in progress is presented. Based on the\npresent re-examination of the OP work, it is evident that opacities of heavy\nelements require revisions in high temperature-density plasma sources.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:10:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pradhan","A. K.",""],["Nahar","S. N.",""],["Eissner","W.",""]]}
{"id":"2308.14883","submitter":"Jonas Berx","authors":"Jonas Berx and Alireza Mashaghi","title":"Aggregation and structural phase transitions of semiflexible polymer\n  bundles: a braided circuit topology approach","comments":"8 pages, 8 figures + Supplemental Material","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft math.GT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a braided circuit topology framework for investigating topology\nand structural phase transitions in aggregates of semiflexible polymers. In the\nconventional approach to circuit topology, which specifically applies to single\nisolated folded linear chains, the number and arrangement of contacts within\nthe circuitry of a folded chain give rise to increasingly complex fold\ntopologies. Another avenue for achieving complexity is through the interaction\nand entanglement of two or more folded linear chains. The braided circuit\ntopology approach describes the topology of such multiple-chain systems and\noffers topological measures such as writhe, complexity, braid length, and\nisotopy class. This extension of circuit topology to multichains reveals the\ninterplay between collapse, aggregation, and entanglement. We show that circuit\ntopological motif fractions are ideally suited order parameters to characterise\nstructural phase transitions in entangled systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:11:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Berx","Jonas",""],["Mashaghi","Alireza",""]]}
{"id":"2308.14884","submitter":"Daniel Rodriguez","authors":"Joaqu\\'in Berrocal, Alejandro Hern\\'andez, \\'I\\~nigo Arrazola,\n  Francisco Dom\\'inguez, Ana Carrasco-Sanz, Francisco Javier Fern\\'andez,\n  Michael Block and Daniel Rodr\\'iguez","title":"Penning-trap eigenfrequency measurements with optical radiofrequency\n  detectors","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.ins-det quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We use an electric-dipole laser-driven transition to precisely measure the\ncyclotron-frequency ratios of the pairs $^{42}$Ca$^+$-$^{40}$Ca$^+$,\n$^{44}$Ca$^+$-$^{40}$Ca$^+$ and $^{48}$Ca$^+$-$^{40}$Ca$^+$ in a 7-tesla\nPenning trap. A single laser-cooled ($T\\approx 1$~mK) ion serves, together with\nphoton-counting and/or photon-imaging units, as a radiofrequency detector\ncovering a broad-band frequency spectrum, in the present case from kHz to a few\nMHz. Such detectors ($^{40,42,44,48}$Ca$^{\\scriptsize{+}}$) allow measuring\nextremely small forces, with measured normalized sensitivities down to\n$7.4(3.5)$ yN$/\\sqrt{\\text{Hz}}$ and $24.9(9.9)$ yN$/\\sqrt{\\text{Hz}}$ in the\nMHz and kHz regime, respectively. The direct determination of the ions'\namplitudes makes a cyclotron-frequency measurement process more robust against\ninhomogeneities of the magnetic field and/or deviations of the electric\nquadrupole field due to mechanical imperfections of the trap.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:13:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Berrocal","Joaqu\u00edn",""],["Hern\u00e1ndez","Alejandro",""],["Arrazola","\u00cd\u00f1igo",""],["Dom\u00ednguez","Francisco",""],["Carrasco-Sanz","Ana",""],["Fern\u00e1ndez","Francisco Javier",""],["Block","Michael",""],["Rodr\u00edguez","Daniel",""]]}
{"id":"2308.14885","submitter":"Pratyush Tiwary","authors":"Lukas Herron, Kinjal Mondal, John S. Schneekloth and Pratyush Tiwary","title":"Inferring phase transitions and critical exponents from limited\n  observations with Thermodynamic Maps","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech cond-mat.dis-nn physics.bio-ph physics.chem-ph physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Phase transitions are ubiquitous across life, yet hard to quantify and\ndescribe accurately. In this work, we develop an approach for characterizing\ngeneric attributes of phase transitions from very limited observations made\ndeep within different phases' domains of stability. Our approach is called\nThermodynamic Maps, which combines statistical mechanics and molecular\nsimulations with score-based generative models. Thermodynamic Maps enable\nlearning the temperature dependence of arbitrary thermodynamic observables\nacross a wide range of temperatures. We show its usefulness by calculating\nphase transition attributes such as melting temperature, temperature-dependent\nheat capacities, and critical exponents. For instance, we demonstrate the\nability of thermodynamic maps to infer the ferromagnetic phase transition of\nthe Ising model, including temperature-dependent heat capacity and critical\nexponents, despite never having seen samples from the transition region. In\naddition, we efficiently characterize the temperature-dependent conformational\nensemble and compute melting curves of the two RNA systems GCAA tetraloop and\nHIV-TAR, which are notoriously hard to sample due to glassy-like landscapes.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:13:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Herron","Lukas",""],["Mondal","Kinjal",""],["Schneekloth","John S.",""],["Tiwary","Pratyush",""]]}
{"id":"2308.14886","submitter":"Nursultan Kuanyshov","authors":"Nursultan Kuanyshov","title":"On the LS-category of homomorphism of almost nilpotent groups","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AT math.GR math.GT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We prove the equality $\\cat(\\phi)=\\cd(\\phi)$ for epimorphisms $\\phi:\\Gamma\\to\n\\Lambda$ between torsion-free, finitely generated almost nilpotent groups\n$\\Gamma$ and $\\Lambda$.\n  In addition, we prove the equality $\\cat(\\phi)=\\cd(\\phi)$ for homomorphisms\n$\\phi:\\Gamma\\to \\Lambda$ between torsion-free, finitely generated virtually\nnilpotent groups.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:15:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kuanyshov","Nursultan",""]]}
{"id":"2308.14887","submitter":"Antti Ranni","authors":"Antti Ranni, Subhomoy Haldar, Harald Havir, Sebastian Lehmann,\n  Pasquale Scarlino, Andreas Baumgartner, Christian Sch\\\"onenberger, Claes\n  Thelander, Kimberly A. Dick, Patrick P. Potts, Ville F. Maisi","title":"Dephasing in a crystal-phase defined double quantum dot charge qubit\n  strongly coupled to a high-impedance resonator","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dephasing of a charge qubit is usually credited to charge noise in the\nenvironment. Here we show that charge noise may not be the limiting factor for\nthe qubit coherence. To this end, we study coherence properties of a\ncrystal-phase defined semiconductor nanowire double quantum dot (DQD) charge\nqubit strongly coupled to a high-impedance resonator using radio-frequency (RF)\nreflectometry. Response of this hybrid system is measured both at a charge\nnoise sensitive operation point (with finite DQD detuning) and at an\ninsensitive point (so-called sweet spot with zero detuning). A theoretical\nmodel based on Jaynes-Cummings Hamiltonian matches the experimental results\nwell and yields only a 10 % difference in dephasing rates between the two\ncases, despite that the sensitivity to detuning charge noise differs by a\nfactor of 5. Therefore the charge noise is not the limiting factor for the\ncoherence in this type of semiconducting nanowire qubits.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:18:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ranni","Antti",""],["Haldar","Subhomoy",""],["Havir","Harald",""],["Lehmann","Sebastian",""],["Scarlino","Pasquale",""],["Baumgartner","Andreas",""],["Sch\u00f6nenberger","Christian",""],["Thelander","Claes",""],["Dick","Kimberly A.",""],["Potts","Patrick P.",""],["Maisi","Ville F.",""]]}
{"id":"2308.14888","submitter":"Andrew Ledoan","authors":"Leon Chou, Summer Haag, Jake Huryn, and Andrew Ledoan","title":"The error term in counting prime pairs","comments":"21 pages, 3 figures, and 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We relate the size of the error term in the Hardy-Littlewood conjectured\nformula for the number of prime pairs to the $L^{1}$ norm of an exponential sum\nover the primes formed with the von Mangoldt function.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:19:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chou","Leon",""],["Haag","Summer",""],["Huryn","Jake",""],["Ledoan","Andrew",""]]}
{"id":"2308.14889","submitter":"Anish Saxena","authors":"Anish Saxena and Moinuddin Qureshi","title":"Scalable and Configurable Tracking for Any Rowhammer Threshold","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Rowhammer vulnerability continues to get worse, with the Rowhammer\nThreshold (TRH) reducing from 139K activations to 4.8K activations over the\nlast decade. Typical Rowhammer mitigations rely on tracking aggressor rows. The\nnumber of possible aggressors increases with lowering thresholds, making it\ndifficult to reliably track such rows in a storage-efficient manner. At lower\nthresholds, academic trackers such as Graphene require prohibitive SRAM\noverheads (hundreds of KBs to MB). Recent in-DRAM trackers from industry, such\nas DSAC-TRR, perform approximate tracking, sacrificing guaranteed protection\nfor reduced storage overheads, leaving DRAM vulnerable to Rowhammer attacks.\nIdeally, we seek a scalable tracker that tracks securely and precisely, and\nincurs negligible dedicated SRAM and performance overheads, while still being\nable to track arbitrarily low thresholds.\n  To that end, we propose START - a Scalable Tracker for Any Rowhammer\nThreshold. Rather than relying on dedicated SRAM structures, START dynamically\nrepurposes a small fraction the Last-Level Cache (LLC) to store tracking\nmetadata. START is based on the observation that while the memory contains\nmillions of rows, typical workloads touch only a small subset of rows within a\nrefresh period of 64ms, so allocating tracking entries on demand significantly\nreduces storage. If the application does not access many rows in memory, START\ndoes not reserve any LLC capacity. Otherwise, START dynamically uses 1-way,\n2-way, or 8-way of the cache set based on demand. START consumes, on average,\n9.4% of the LLC capacity to store metadata, which is 5X lower compared to\ndedicating a counter in LLC for each row in memory. We also propose START-M, a\nmemory-mapped START for large-memory systems. Our designs require only 4KB SRAM\nfor newly added structures and perform within 1% of idealized tracking even at\nTRH of less than 100.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:24:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Saxena","Anish",""],["Qureshi","Moinuddin",""]]}
{"id":"2308.14890","submitter":"Pierre-Fran\\c{c}ois Loos Dr","authors":"Enzo Monino and Antoine Marie and Pierre-Fran\\c{c}ois Loos","title":"QCMATH: Mathematica modules for electronic structure calculations","comments":"9 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph cond-mat.str-el nucl-th physics.comp-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce \\textsc{qcmath}, a user-friendly quantum chemistry software\ntailored for electronic structure calculations, implemented using the Wolfram\nMathematica language and available at \\url{https://github.com/LCPQ/qcmath}.\nThis software, designed with accessibility in mind, takes advantage of the\nsymbolic capabilities intrinsic to Mathematica. Its primary goal is to provide\na supportive environment for newcomers to the field of quantum chemistry,\nenabling them to easily conceptualize, develop, and test their own ideas. The\nfunctionalities of \\textsc{qcmath} encompass a broad spectrum of methods,\ncatering to both ground- and excited-state calculations. We provide a\ncomprehensive overview of these capabilities, complemented by essential\ntheoretical insights. To facilitate ease of use, we offer an exhaustive\nblueprint of the software's architecture. Furthermore, we provide users with\ncomprehensive guides, addressing both the operational aspects and the more\nintricate programming facets of \\textsc{qcmath}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:25:32 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 09:40:33 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Monino","Enzo",""],["Marie","Antoine",""],["Loos","Pierre-Fran\u00e7ois",""]]}
{"id":"2308.14891","submitter":"Rachel Pries","authors":"Renzo Cavalieri and Rachel Pries","title":"Mass formula for non-ordinary curves in one dimensional families","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper is about one dimensional families of cyclic covers of the\nprojective line in positive characteristic. For each such family, we study the\nmass formula for the number of non-ordinary curves in the family. We prove two\nequations for the mass formula: the first relies on the $a$-numbers of\nnon-ordinary curves in the family; and the second relies on tautological\nintersection theory. Our results generalize the Eichler--Deuring mass formula\nfor supersingular elliptic curves; they also generalize some theorems of\nIbukiyama, Katsura, and Oort about supersingular curves of genus $2$ that have\nan automorphism of order $3$ or order $4$. We determine the mass formula in\nmany new cases, including linearized families of hyperelliptic curves of every\ngenus and all families of cyclic covers of the projective line branched at four\npoints. For certain families of curves of genus $3$ to $7$, we determine the\nexact rate of growth of the number of non-ordinary curves in the family as a\nlinear function of the characteristic $p$. keywords: curve, hyperelliptic\ncurve, cyclic cover, Jacobian, mass formula, cycle class, tautological ring,\nHodge bundle, intersection theory, Frobenius, non-ordinary, $p$-rank,\n$a$-number.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:27:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cavalieri","Renzo",""],["Pries","Rachel",""]]}
{"id":"2308.14892","submitter":"John Deisz","authors":"John Deisz","title":"Perturbation theory analysis of the strain-dependent superconducting\n  phase diagram for Sr$_2$RuO$_4$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Previously, it was shown that a superconducting state dominated by singlet\n$d_{x^2-y^2}$ intra-band pairs emerges from the fluctuation exchange\napproximation (FLEX) applied to a realistic model for Sr$_2$RuO$_4$, a result\nthat is increasingly in alignment with experimental data. Here we apply FLEX to\nmodel the strain-dependent phase diagram of Sr$_2$RuO$_4$ and show that we are\nable to reproduce its unusual features. This adds weight to the argument that a\npredominantly $d_{x^2-y^2}$ singlet pairing state represents a reasonable\nstarting point for describing the superconducting properties of Sr$_2$RuO$_4$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:28:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Deisz","John",""]]}
{"id":"2308.14893","submitter":"Zijun Long","authors":"Zijun Long, George Killick, Richard McCreadie, Gerardo Aragon\n  Camarasa, Zaiqiao Meng","title":"When hard negative sampling meets supervised contrastive learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  State-of-the-art image models predominantly follow a two-stage strategy:\npre-training on large datasets and fine-tuning with cross-entropy loss. Many\nstudies have shown that using cross-entropy can result in sub-optimal\ngeneralisation and stability. While the supervised contrastive loss addresses\nsome limitations of cross-entropy loss by focusing on intra-class similarities\nand inter-class differences, it neglects the importance of hard negative\nmining. We propose that models will benefit from performance improvement by\nweighting negative samples based on their dissimilarity to positive\ncounterparts. In this paper, we introduce a new supervised contrastive learning\nobjective, SCHaNe, which incorporates hard negative sampling during the\nfine-tuning phase. Without requiring specialized architectures, additional\ndata, or extra computational resources, experimental results indicate that\nSCHaNe outperforms the strong baseline BEiT-3 in Top-1 accuracy across various\nbenchmarks, with significant gains of up to $3.32\\%$ in few-shot learning\nsettings and $3.41\\%$ in full dataset fine-tuning. Importantly, our proposed\nobjective sets a new state-of-the-art for base models on ImageNet-1k, achieving\nan 86.14\\% accuracy. Furthermore, we demonstrate that the proposed objective\nyields better embeddings and explains the improved effectiveness observed in\nour experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:30:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Long","Zijun",""],["Killick","George",""],["McCreadie","Richard",""],["Camarasa","Gerardo Aragon",""],["Meng","Zaiqiao",""]]}
{"id":"2308.14894","submitter":"Th\\'eo Deschamps-Berger","authors":"Th\\'eo Deschamps-Berger, Lori Lamel and Laurence Devillers","title":"Multiscale Contextual Learning for Speech Emotion Recognition in\n  Emergency Call Center Conversations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Emotion recognition in conversations is essential for ensuring advanced\nhuman-machine interactions. However, creating robust and accurate emotion\nrecognition systems in real life is challenging, mainly due to the scarcity of\nemotion datasets collected in the wild and the inability to take into account\nthe dialogue context. The CEMO dataset, composed of conversations between\nagents and patients during emergency calls to a French call center, fills this\ngap. The nature of these interactions highlights the role of the emotional flow\nof the conversation in predicting patient emotions, as context can often make a\ndifference in understanding actual feelings. This paper presents a multi-scale\nconversational context learning approach for speech emotion recognition, which\ntakes advantage of this hypothesis. We investigated this approach on both\nspeech transcriptions and acoustic segments. Experimentally, our method uses\nthe previous or next information of the targeted segment. In the text domain,\nwe tested the context window using a wide range of tokens (from 10 to 100) and\nat the speech turns level, considering inputs from both the same and opposing\nspeakers. According to our tests, the context derived from previous tokens has\na more significant influence on accurate prediction than the following tokens.\nFurthermore, taking the last speech turn of the same speaker in the\nconversation seems useful. In the acoustic domain, we conducted an in-depth\nanalysis of the impact of the surrounding emotions on the prediction. While\nmulti-scale conversational context learning using Transformers can enhance\nperformance in the textual modality for emergency call recordings,\nincorporating acoustic context is more challenging.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:31:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Deschamps-Berger","Th\u00e9o",""],["Lamel","Lori",""],["Devillers","Laurence",""]]}
{"id":"2308.14895","submitter":"Ahmed Alaa","authors":"Ahmed Alaa, Zaid Ahmad, Mark van der Laan","title":"Conformal Meta-learners for Predictive Inference of Individual Treatment\n  Effects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the problem of machine learning-based (ML) predictive\ninference on individual treatment effects (ITEs). Previous work has focused\nprimarily on developing ML-based meta-learners that can provide point estimates\nof the conditional average treatment effect (CATE); these are model-agnostic\napproaches for combining intermediate nuisance estimates to produce estimates\nof CATE. In this paper, we develop conformal meta-learners, a general framework\nfor issuing predictive intervals for ITEs by applying the standard conformal\nprediction (CP) procedure on top of CATE meta-learners. We focus on a broad\nclass of meta-learners based on two-stage pseudo-outcome regression and develop\na stochastic ordering framework to study their validity. We show that inference\nwith conformal meta-learners is marginally valid if their (pseudo outcome)\nconformity scores stochastically dominate oracle conformity scores evaluated on\nthe unobserved ITEs. Additionally, we prove that commonly used CATE\nmeta-learners, such as the doubly-robust learner, satisfy a model- and\ndistribution-free stochastic (or convex) dominance condition, making their\nconformal inferences valid for practically-relevant levels of target coverage.\nWhereas existing procedures conduct inference on nuisance parameters (i.e.,\npotential outcomes) via weighted CP, conformal meta-learners enable direct\ninference on the target parameter (ITE). Numerical experiments show that\nconformal meta-learners provide valid intervals with competitive efficiency\nwhile retaining the favorable point estimation properties of CATE\nmeta-learners.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:32:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alaa","Ahmed",""],["Ahmad","Zaid",""],["van der Laan","Mark",""]]}
{"id":"2308.14896","submitter":"Alexandros Ziampras","authors":"Alexandros Ziampras, Sijme-Jan Paardekooper, Richard P. Nelson","title":"Buoyancy response of a disk to an embedded planet: a cross-code\n  comparison at high resolution","comments":"13 pages, 17 figures, 1 table; accepted by MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In radiatively inefficient, laminar protoplanetary disks, embedded planets\ncan excite a buoyancy response as gas gets deflected vertically near the\nplanet. This results in vertical oscillations that drive a vortensity growth in\nthe planet's corotating region, speeding up inward migration in the type-I\nregime. We present a comparison between PLUTO/IDEFIX and FARGO3D using 3D,\ninviscid, adiabatic numerical simulations of planet-disk interaction that\nfeature the buoyancy response of the disk, and show that PLUTO/IDEFIX struggle\nto resolve higher-order modes of the buoyancy-related oscillations, weakening\nvortensity growth and the associated torque. We interpret this as a drawback of\ntotal-energy-conserving, finite-volume schemes. Our results indicate that a\nvery high resolution or high-order scheme is required in shock-capturing codes\nin order to adequately capture this effect.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:35:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ziampras","Alexandros",""],["Paardekooper","Sijme-Jan",""],["Nelson","Richard P.",""]]}
{"id":"2308.14897","submitter":"Hanhan Zhou","authors":"Hanhan Zhou, Tian Lan, Vaneet Aggarwal","title":"Statistically Efficient Variance Reduction with Double Policy Estimation\n  for Off-Policy Evaluation in Sequence-Modeled Reinforcement Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Offline reinforcement learning aims to utilize datasets of previously\ngathered environment-action interaction records to learn a policy without\naccess to the real environment. Recent work has shown that offline\nreinforcement learning can be formulated as a sequence modeling problem and\nsolved via supervised learning with approaches such as decision transformer.\nWhile these sequence-based methods achieve competitive results over\nreturn-to-go methods, especially on tasks that require longer episodes or with\nscarce rewards, importance sampling is not considered to correct the policy\nbias when dealing with off-policy data, mainly due to the absence of behavior\npolicy and the use of deterministic evaluation policies. To this end, we\npropose DPE: an RL algorithm that blends offline sequence modeling and offline\nreinforcement learning with Double Policy Estimation (DPE) in a unified\nframework with statistically proven properties on variance reduction. We\nvalidate our method in multiple tasks of OpenAI Gym with D4RL benchmarks. Our\nmethod brings a performance improvements on selected methods which outperforms\nSOTA baselines in several tasks, demonstrating the advantages of enabling\ndouble policy estimation for sequence-modeled reinforcement learning.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:46:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Hanhan",""],["Lan","Tian",""],["Aggarwal","Vaneet",""]]}
{"id":"2308.14898","submitter":"EPTCS","authors":"Enrico Pontelli (New Mexico State University, USA), Stefania\n  Costantini (University of L'Aquila, Italy), Carmine Dodaro (University of\n  Calabria, Italy), Sarah Gaggl (TU Dresden, Germany), Roberta Calegari\n  (University of Bologna, Italy), Artur D'Avila Garcez (City University of\n  London, UK), Francesco Fabiano (University of Udine, Italy), Alessandra Mileo\n  (DCU, Ireland), Alessandra Russo (Imperial College London, UK), Francesca\n  Toni (Imperial College London, UK)","title":"Proceedings 39th International Conference on Logic Programming","comments":null,"journal-ref":"EPTCS 385, 2023","doi":"10.4204/EPTCS.385","report-no":null,"categories":"cs.AI cs.LO cs.PL cs.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This volume contains the Technical Communications presented at the 39th\nInternational Conference on Logic Programming (ICLP 2023), held at Imperial\nCollege London, UK from July 9 to July 15, 2023. Technical Communications\nincluded here concern the Main Track, the Doctoral Consortium, the Application\nand Systems/Demo track, the Recently Published Research Track, the\nBirds-of-a-Feather track, the Thematic Tracks on Logic Programming and Machine\nLearning, and Logic Programming and Explainability, Ethics, and\nTrustworthiness.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:46:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pontelli","Enrico","","New Mexico State University, USA"],["Costantini","Stefania","","University of L'Aquila, Italy"],["Dodaro","Carmine","","University of\n  Calabria, Italy"],["Gaggl","Sarah","","TU Dresden, Germany"],["Calegari","Roberta","","University of Bologna, Italy"],["Garcez","Artur D'Avila","","City University of\n  London, UK"],["Fabiano","Francesco","","University of Udine, Italy"],["Mileo","Alessandra","","DCU, Ireland"],["Russo","Alessandra","","Imperial College London, UK"],["Toni","Francesca","","Imperial College London, UK"]]}
{"id":"2308.14899","submitter":"Nathan Drenkow","authors":"Nathan Drenkow, Mathias Unberath","title":"RobustCLEVR: A Benchmark and Framework for Evaluating Robustness in\n  Object-centric Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Object-centric representation learning offers the potential to overcome\nlimitations of image-level representations by explicitly parsing image scenes\ninto their constituent components. While image-level representations typically\nlack robustness to natural image corruptions, the robustness of object-centric\nmethods remains largely untested. To address this gap, we present the\nRobustCLEVR benchmark dataset and evaluation framework. Our framework takes a\nnovel approach to evaluating robustness by enabling the specification of causal\ndependencies in the image generation process grounded in expert knowledge and\ncapable of producing a wide range of image corruptions unattainable in existing\nrobustness evaluations. Using our framework, we define several causal models of\nthe image corruption process which explicitly encode assumptions about the\ncausal relationships and distributions of each corruption type. We generate\ndataset variants for each causal model on which we evaluate state-of-the-art\nobject-centric methods. Overall, we find that object-centric methods are not\ninherently robust to image corruptions. Our causal evaluation approach exposes\nmodel sensitivities not observed using conventional evaluation processes,\nyielding greater insight into robustness differences across algorithms. Lastly,\nwhile conventional robustness evaluations view corruptions as\nout-of-distribution, we use our causal framework to show that even training on\nin-distribution image corruptions does not guarantee increased model\nrobustness. This work provides a step towards more concrete and substantiated\nunderstanding of model performance and deterioration under complex corruption\nprocesses of the real-world.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:52:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Drenkow","Nathan",""],["Unberath","Mathias",""]]}
{"id":"2308.14900","submitter":"Zijia Lu","authors":"Zijia Lu, Ehsan Elhamifar","title":"BIT: Bi-Level Temporal Modeling for Efficient Supervised Action\n  Segmentation","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We address the task of supervised action segmentation which aims to partition\na video into non-overlapping segments, each representing a different action.\nRecent works apply transformers to perform temporal modeling at the\nframe-level, which suffer from high computational cost and cannot well capture\naction dependencies over long temporal horizons. To address these issues, we\npropose an efficient BI-level Temporal modeling (BIT) framework that learns\nexplicit action tokens to represent action segments, in parallel performs\ntemporal modeling on frame and action levels, while maintaining a low\ncomputational cost. Our model contains (i) a frame branch that uses convolution\nto learn frame-level relationships, (ii) an action branch that uses transformer\nto learn action-level dependencies with a small set of action tokens and (iii)\ncross-attentions to allow communication between the two branches. We apply and\nextend a set-prediction objective to allow each action token to represent one\nor multiple action segments, thus can avoid learning a large number of tokens\nover long videos with many segments. Thanks to the design of our action branch,\nwe can also seamlessly leverage textual transcripts of videos (when available)\nto help action segmentation by using them to initialize the action tokens. We\nevaluate our model on four video datasets (two egocentric and two third-person)\nfor action segmentation with and without transcripts, showing that BIT\nsignificantly improves the state-of-the-art accuracy with much lower\ncomputational cost (30 times faster) compared to existing transformer-based\nmethods.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 20:59:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lu","Zijia",""],["Elhamifar","Ehsan",""]]}
{"id":"2308.14901","submitter":"Darren Creutz","authors":"Darren Creutz and Ronnie Pavlov","title":"On minimal subshifts of linear word complexity with slope less than 3/2","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that every infinite minimal subshift with word complexity $p(q)$\nsatisfying $\\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its\nmaximal equicontinuous factor; in particular, it has measurably discrete\nspectrum. Among other applications, this provides a proof of Sarnak's\nconjecture for all subshifts with $\\limsup p(q)/q < 3/2$ (which can be thought\nof as a much stronger version of zero entropy).\n  As in [CP23], our main technique is proving that all low-complexity minimal\nsubshifts have a specific type of representation via a sequence $\\{\\tau_k\\}$ of\nsubstitutions, usually called an S-adic decomposition. The maximal\nequicontinuous factor is the product of an odometer with a rotation on an\nabelian one-dimensional nilmanifold with adelic structure, for which we can\ngive an explicit description in terms of the substitutions $\\tau_k$. We also\nprove that all such odometers and nilmanifolds may appear for minimal subshifts\nwith $\\lim p(q)/q = 1$, demonstrating that lower complexity thresholds do not\nfurther restrict the possible structure.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:03:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Creutz","Darren",""],["Pavlov","Ronnie",""]]}
{"id":"2308.14902","submitter":"Prashant Jayaprakash Nair","authors":"Muhammad Adnan, Yassaman Ebrahimzadeh Maboud, Divya Mahajan, Prashant\n  J. Nair","title":"Ad-Rec: Advanced Feature Interactions to Address Covariate-Shifts in\n  Recommendation Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recommendation models are vital in delivering personalized user experiences\nby leveraging the correlation between multiple input features. However, deep\nlearning-based recommendation models often face challenges due to evolving user\nbehaviour and item features, leading to covariate shifts. Effective\ncross-feature learning is crucial to handle data distribution drift and\nadapting to changing user behaviour. Traditional feature interaction techniques\nhave limitations in achieving optimal performance in this context.\n  This work introduces Ad-Rec, an advanced network that leverages feature\ninteraction techniques to address covariate shifts. This helps eliminate\nirrelevant interactions in recommendation tasks. Ad-Rec leverages masked\ntransformers to enable the learning of higher-order cross-features while\nmitigating the impact of data distribution drift. Our approach improves model\nquality, accelerates convergence, and reduces training time, as measured by the\nArea Under Curve (AUC) metric. We demonstrate the scalability of Ad-Rec and its\nability to achieve superior model quality through comprehensive ablation\nstudies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:08:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Adnan","Muhammad",""],["Maboud","Yassaman Ebrahimzadeh",""],["Mahajan","Divya",""],["Nair","Prashant J.",""]]}
{"id":"2308.14903","submitter":"Yury Zemlyanskiy","authors":"Yury Zemlyanskiy, Michiel de Jong, Luke Vilnis, Santiago Onta\\~n\\'on,\n  William W. Cohen, Sumit Sanghai, Joshua Ainslie","title":"MEMORY-VQ: Compression for Tractable Internet-Scale Memory","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Retrieval augmentation is a powerful but expensive method to make language\nmodels more knowledgeable about the world. Memory-based methods like LUMEN\npre-compute token representations for retrieved passages to drastically speed\nup inference. However, memory also leads to much greater storage requirements\nfrom storing pre-computed representations.\n  We propose MEMORY-VQ, a new method to reduce storage requirements of\nmemory-augmented models without sacrificing performance. Our method uses a\nvector quantization variational autoencoder (VQ-VAE) to compress token\nrepresentations. We apply MEMORY-VQ to the LUMEN model to obtain LUMEN-VQ, a\nmemory model that achieves a 16x compression rate with comparable performance\non the KILT benchmark. LUMEN-VQ enables practical retrieval augmentation even\nfor extremely large retrieval corpora.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:11:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zemlyanskiy","Yury",""],["de Jong","Michiel",""],["Vilnis","Luke",""],["Onta\u00f1\u00f3n","Santiago",""],["Cohen","William W.",""],["Sanghai","Sumit",""],["Ainslie","Joshua",""]]}
{"id":"2308.14904","submitter":"Amirsaeed Yazdani","authors":"Amirsaeed Yazdani, Xuelu Li, and Vishal Monga","title":"Maturity-Aware Active Learning for Semantic Segmentation with\n  Hierarchically-Adaptive Sample Assessment","comments":"Accepted to the 34th British Machine Vision Conference (BMVC 2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Active Learning (AL) for semantic segmentation is challenging due to heavy\nclass imbalance and different ways of defining \"sample\" (pixels, areas, etc.),\nleaving the interpretation of the data distribution ambiguous. We propose\n\"Maturity-Aware Distribution Breakdown-based Active Learning'' (MADBAL), an AL\nmethod that benefits from a hierarchical approach to define a multiview data\ndistribution, which takes into account the different \"sample\" definitions\njointly, hence able to select the most impactful segmentation pixels with\ncomprehensive understanding. MADBAL also features a novel uncertainty\nformulation, where AL supporting modules are included to sense the features'\nmaturity whose weighted influence continuously contributes to the uncertainty\ndetection. In this way, MADBAL makes significant performance leaps even in the\nearly AL stage, hence reducing the training burden significantly. It\noutperforms state-of-the-art methods on Cityscapes and PASCAL VOC datasets as\nverified in our extensive experiments.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:13:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yazdani","Amirsaeed",""],["Li","Xuelu",""],["Monga","Vishal",""]]}
{"id":"2308.14905","submitter":"Shane Settle","authors":"Shane Settle","title":"Neural approaches to spoken content embedding","comments":"PhD thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Comparing spoken segments is a central operation to speech processing.\nTraditional approaches in this area have favored frame-level dynamic\nprogramming algorithms, such as dynamic time warping, because they require no\nsupervision, but they are limited in performance and efficiency. As an\nalternative, acoustic word embeddings -- fixed-dimensional vector\nrepresentations of variable-length spoken word segments -- have begun to be\nconsidered for such tasks as well. However, the current space of such\ndiscriminative embedding models, training approaches, and their application to\nreal-world downstream tasks is limited. We start by considering ``single-view\"\ntraining losses where the goal is to learn an acoustic word embedding model\nthat separates same-word and different-word spoken segment pairs. Then, we\nconsider ``multi-view\" contrastive losses. In this setting, acoustic word\nembeddings are learned jointly with embeddings of character sequences to\ngenerate acoustically grounded embeddings of written words, or acoustically\ngrounded word embeddings.\n  In this thesis, we contribute new discriminative acoustic word embedding\n(AWE) and acoustically grounded word embedding (AGWE) approaches based on\nrecurrent neural networks (RNNs). We improve model training in terms of both\nefficiency and performance. We take these developments beyond English to\nseveral low-resource languages and show that multilingual training improves\nperformance when labeled data is limited. We apply our embedding models, both\nmonolingual and multilingual, to the downstream tasks of query-by-example\nspeech search and automatic speech recognition. Finally, we show how our\nembedding approaches compare with and complement more recent self-supervised\nspeech models.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:16:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Settle","Shane",""]]}
{"id":"2308.14906","submitter":"Shikai Fang","authors":"Shikai Fang, Qingsong Wen, Shandian Zhe, Liang Sun,","title":"BayOTIDE: Bayesian Online Multivariate Time series Imputation with\n  functional decomposition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In real-world scenarios like traffic and energy, massive time-series data\nwith missing values and noises are widely observed, even sampled irregularly.\nWhile many imputation methods have been proposed, most of them work with a\nlocal horizon, which means models are trained by splitting the long sequence\ninto batches of fit-sized patches. This local horizon can make models ignore\nglobal trends or periodic patterns. More importantly, almost all methods assume\nthe observations are sampled at regular time stamps, and fail to handle complex\nirregular sampled time series arising from different applications. Thirdly,\nmost existing methods are learned in an offline manner. Thus, it is not\nsuitable for many applications with fast-arriving streaming data. To overcome\nthese limitations, we propose \\ours: Bayesian Online Multivariate Time series\nImputation with functional decomposition. We treat the multivariate time series\nas the weighted combination of groups of low-rank temporal factors with\ndifferent patterns. We apply a group of Gaussian Processes (GPs) with different\nkernels as functional priors to fit the factors. For computational efficiency,\nwe further convert the GPs into a state-space prior by constructing an\nequivalent stochastic differential equation (SDE), and developing a scalable\nalgorithm for online inference. The proposed method can not only handle\nimputation over arbitrary time stamps, but also offer uncertainty\nquantification and interpretability for the downstream application. We evaluate\nour method on both synthetic and real-world datasets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:17:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fang","Shikai",""],["Wen","Qingsong",""],["Zhe","Shandian",""],["Sun","Liang",""]]}
{"id":"2308.14907","submitter":"Anish Saxena","authors":"Anish Saxena, Saurav Mathur, Moinuddin Qureshi","title":"Randomized Line-to-Row Mapping for Low-Overhead Rowhammer Mitigations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modern systems mitigate Rowhammer using victim refresh, which refreshes the\ntwo neighbours of an aggressor row when it encounters a specified number of\nactivations. Unfortunately, complex attack patterns like Half-Double break\nvictim-refresh, rendering current systems vulnerable. Instead, recently\nproposed secure Rowhammer mitigations rely on performing mitigative action on\nthe aggressor rather than the victims. Such schemes employ mitigative actions\nsuch as row-migration or access-control and include AQUA, SRS, and Blockhammer.\nWhile these schemes incur only modest slowdowns at Rowhammer thresholds of few\nthousand, they incur prohibitive slowdowns (15%-600%) for lower thresholds that\nare likely in the near future. The goal of our paper is to make secure\nRowhammer mitigations practical at such low thresholds.\n  Our paper provides the key insights that benign application encounter\nthousands of hot rows (receiving more activations than the threshold) due to\nthe memory mapping, which places spatially proximate lines in the same row to\nmaximize row-buffer hitrate. Unfortunately, this causes row to receive\nactivations for many frequently used lines. We propose Rubix, which breaks the\nspatial correlation in the line-to-row mapping by using an encrypted address to\naccess the memory, reducing the likelihood of hot rows by 2 to 3 orders of\nmagnitude. To aid row-buffer hits, Rubix randomizes a group of 1-4 lines. We\nalso propose Rubix-D, which dynamically changes the line-to-row mapping.\nRubix-D minimizes hot-rows and makes it much harder for an adversary to learn\nthe spatial neighbourhood of a row. Rubix reduces the slowdown of AQUA (from\n15% to 1%), SRS (from 60% to 2%), and Blockhammer (from 600% to 3%) while\nincurring a storage of less than 1 Kilobyte.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:22:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Saxena","Anish",""],["Mathur","Saurav",""],["Qureshi","Moinuddin",""]]}
{"id":"2308.14908","submitter":"Maria Mehmood","authors":"Nadir Ijaz, Maria Mehmood and Mansoor Ur Rehman","title":"The Stochastic Gravitational-Wave Background from Primordial Black Holes\n  in R-Symmetric $SU(5)$ Inflation","comments":"21 pages, 19 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study explores the realization of nonminimally coupled Higgs inflation\nin the context of no-scale supergravity, investigates the formation of\nprimordial black holes, and examines the potential for observable proton decay\nwithin the framework of the R-symmetric $SU(5)$ model. For inflation, both\nsingle and multifield scenarios are investigated. The prediction of the\nsingle-field model for the tensor-to-scalar ratio, $r$, is approximately\n$10^{-3}$, and the scalar spectral index falls within Plank's 1$\\sigma$ range.\nThe running of the scalar spectral index, $-{dn_{s}}/{d\\ln{k}}$, is\napproximately $10^{-4}$. A realistic scenario of reheating and non-thermal\nleptogenesis is employed with reheat temperature $T_r\\sim10^9$ GeV. In the\nmultifield case, we mainly focus on Primordial Black Holes (PBHs) and\nGravitational Waves (GWs). In this inflationary framework, we demonstrate how a\nsuitable choice of parameters can result in an enhanced scalar power spectrum,\nleading to the production of primordial black holes (PBHs) capable of fully\naccounting for dark matter. We also show that this scenario leads to Scalar\nInduced Gravitational Waves (SIGW) which can be detected in current and future\nGW detectors. We explore different proton decay channels to look for observable\npredictions for the next-generation proton decay experiments Hyper-K and DUNE\nconsistent with gauge coupling unification and cosmological bounds.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:22:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ijaz","Nadir",""],["Mehmood","Maria",""],["Rehman","Mansoor Ur",""]]}
{"id":"2308.14909","submitter":"Hyungchan Yoon","authors":"Hyungchan Yoon, Changhwan Kim, Eunwoo Song, Hyun-Wook Yoon, Hong-Goo\n  Kang","title":"Pruning Self-Attention for Zero-Shot Multi-Speaker Text-to-Speech","comments":"INTERSPEECH 2023","journal-ref":"Proc. INTERSPEECH 2023, 4299-4303","doi":"10.21437/Interspeech.2023-1301","report-no":null,"categories":"cs.SD cs.LG eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For personalized speech generation, a neural text-to-speech (TTS) model must\nbe successfully implemented with limited data from a target speaker. To this\nend, the baseline TTS model needs to be amply generalized to out-of-domain data\n(i.e., target speaker's speech). However, approaches to address this\nout-of-domain generalization problem in TTS have yet to be thoroughly studied.\nIn this work, we propose an effective pruning method for a transformer known as\nsparse attention, to improve the TTS model's generalization abilities. In\nparticular, we prune off redundant connections from self-attention layers whose\nattention weights are below the threshold. To flexibly determine the pruning\nstrength for searching optimal degree of generalization, we also propose a new\ndifferentiable pruning method that allows the model to automatically learn the\nthresholds. Evaluations on zero-shot multi-speaker TTS verify the effectiveness\nof our method in terms of voice quality and speaker similarity.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:25:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yoon","Hyungchan",""],["Kim","Changhwan",""],["Song","Eunwoo",""],["Yoon","Hyun-Wook",""],["Kang","Hong-Goo",""]]}
{"id":"2308.14910","submitter":"Miljenko \\v{C}emelji\\'c Dr","authors":"Miljenko \\v{C}emelji\\'c, W{\\l}odek Klu\\'zniak, Varadarajan\n  Parthasarathy","title":"Magnetically threaded accretion disks in resistive magnetohydrodynamic\n  simulations and asymptotic expansion","comments":"17 pages, accepted in Astronomy and Astrophysics. arXiv admin note:\n  text overlap with arXiv:1907.12592","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Aims. A realistic model of magnetic linkage between a central object and its\naccretion disk is a prerequisite for understanding the spin history of stars\nand stellar remnants. To this end, we aim to provide an analytic model in\nagreement with magnetohydrodynamic (MHD) simulations.\n  Methods. For the first time, we wrote a full set of stationary asymptotic\nexpansion equations of a thin magnetic accretion disk, including the induction\nand energy equations. We also performed a resistive MHD simulation of an\naccretion disk around a star endowed with a magnetic dipole, using the publicly\navailable code PLUTO. We compared the analytical results with the numerical\nsolutions, and discussed the results in the context of previous solutions of\nthe induction equation describing the star-disk magnetospheric interaction.\n  Results. We found that the magnetic field threading the disk is suppressed by\norders of magnitude inside thin disks, so the presence of the stellar magnetic\nfield does not strongly affect the velocity field, nor the density profile\ninside the disk. Density and velocity fields found in the MHD simulations match\nthe radial and vertical profiles of the analytic solution. Qualitatively, the\nMHD simulations result in an internal magnetic field similar to the solutions\npreviously obtained by solving the induction equation in the disk alone.\nHowever, the magnetic field configuration is quantitatively affected by\nmagnetic field inflation outside the disk; this is reflected in the net torque.\nThe torque on the star is an order of magnitude larger in the magnetic than in\nthe non-magnetic case. Spin-up of the star occurs on a timescale comparable to\nthe accretion timescale in the MHD case, and is an order of magnitude slower in\nthe absence of a stellar magnetic field.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:26:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["\u010cemelji\u0107","Miljenko",""],["Klu\u017aniak","W\u0142odek",""],["Parthasarathy","Varadarajan",""]]}
{"id":"2308.14911","submitter":"Andrew Granville","authors":"Andrew Granville, Cihan Sabuncu and Alisa Sedunova","title":"The multiplication table constant and sums of two squares","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We will show that the number of integers $\\leq x$ that can be written as the\nsquare of an integer plus the square of a prime equals $\\frac{\\pi}{2} \\cdot\n\\frac {x}{\\log x}$ minus a secondary term of size $x/(\\log x)^{\n1+\\delta+o(1)}$, where $\\delta := 1 - \\frac{1+\\log\\log 2}{\\log 2} =\n0.0860713320\\dots$ is the multiplication table constant. Detailed heuristics\nsuggest that this secondary term is asymptotic to $\\frac{1 }{\\sqrt{\\log\\log x}}\n\\cdot \\frac x{(\\log x)^{ 1+\\delta}} $ times a bounded, positive, $1$-periodic,\nnon-constant function of $\\frac{\\log\\log x}{\\log 2}$.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 21:30:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Granville","Andrew",""],["Sabuncu","Cihan",""],["Sedunova","Alisa",""]]}
{"id":"2308.14912","submitter":"Yamini Rao","authors":"Yamini K. Rao, B. Mondal, Giulio Del Zanna, N. P. S. Mithun, S. V.\n  Vadawale, K. K. Reeves, Helen E. Mason, and Anil Bhardwaj","title":"Multi-wavelength observations of a B-class flare using XSM, AIA, and XRT","comments":"18, pages, 18 figures, ApJ, Accepted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present multi-wavelength observations by Chandrayaan-2/XSM, SDO/AIA and\nHinode/XRT of a B-class flare observed on 25th February, 2021, originating from\nan active region (AR 12804) near the North-West limb. The microflare lasts for\napprox 30 mins and is composed of hot loops reaching temperatures of 10 MK. We\nreport excellent agreement (within 20 percent) for the average effective\ntemperatures obtained at the flare peak from all the three instruments, which\nhave different temperature sensitivities. The XRT filter combination of Be-thin\nand Be-med provides an excellent opportunity to measure the high-temperatures\nin such microflare events. The elemental abundances during the evolution of the\nmicroflare are also studied and observed to drop towards photospheric values at\nthe flare peak time, compared to coronal values during the rise and decay\nphase. This is consistent with previous XSM studies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:07:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Rao","Yamini K.",""],["Mondal","B.",""],["Del Zanna","Giulio",""],["Mithun","N. P. S.",""],["Vadawale","S. V.",""],["Reeves","K. K.",""],["Mason","Helen E.",""],["Bhardwaj","Anil",""]]}
{"id":"2308.14913","submitter":"Marcin Markiewicz Dr","authors":"Konrad Schlichtholz and Marcin Markiewicz","title":"Generalization of Gisin's Theorem to Quantum Fields","comments":"12 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We generalize Gisin's theorem on the relation between the entanglement of\npure states and Bell non-classicality to the case of mode entanglement of\nseparated groups of modes of quantum fields extending the theorem to cover also\nstates with undefined particle number. We show that any pure state of the field\nwhich contains entanglement between two groups of separated modes violates some\nClauser-Horne inequality. In order to construct the observables leading to a\nviolation in the first step, we show an isomorphism between the Fock space\nbuilt from a single-particle space involving two separated groups of modes and\na tensor product of two abstract separable Hilbert spaces spanned by formal\nmonomials of creation operators. In the second step, we perform a Schmidt\ndecomposition of a given entangled state mapped to this tensor product space\nand then we map back the obtained Schmidt decomposition to the original Fock\nspace of the system under consideration. Such obtained Schmidt decomposition in\nFock space allows for construction of observables leading to a violation of the\nClauser-Horne inequality. We also show that our generalization of Gisin's\ntheorem holds for the case of states on non-separable Hilbert spaces, which\nphysically represent states with actually infinite number of particles. Such\nstates emerge, for example, in the discussion of quantum phase transitions.\nFinally, we discuss the experimental feasibility of constructed Bell test and\nprovide a necessary condition for realizability of this test within the realm\nof passive linear optics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:08:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Schlichtholz","Konrad",""],["Markiewicz","Marcin",""]]}
{"id":"2308.14914","submitter":"Bilal Farooq","authors":"Saba Sabet and Bilal Farooq","title":"Exploring sustainable pathways for urban traffic decarbonization:\n  vehicle technologies, management strategies, and driving behaviour","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The global fight against climate change and air pollution prioritizes the\ntransition to sustainable transportation options. Understanding the impacts of\nvarious sustainable pathways on emissions, travel time, and costs is crucial\nfor researchers and policymakers. This research conducts a comprehensive\nmicrosimulation of traffic and emissions in downtown Toronto, Canada, to\nexamine decarbonization scenarios. The resulting 140 scenarios involve\ndifferent fuel types, Connected and Automated Vehicles (CAV) penetration rates,\nand routing strategies combined with driving style. To achieve this,\ntransformers-based prediction models accurately forecast Greenhouse Gas (GHG)\nand Nitrogen Oxides (NOx) emissions and average speed for eco-routing. The\nstudy finds that 100% battery electric vehicles have the lowest GHG emissions,\nshowing their potential as a sustainable transportation solution. However,\nchallenges related to cost and availability persist. Hybrid Electric Vehicles\nand e-fuels demonstrate considerable emission reductions, emerging as promising\nalternatives. Integrating CAVs with anticipatory routing strategies\nsignificantly reduces GHG emissions. Additionally, eco-driving practices and\neco-routing strategies have a notable impact on NOx emissions and travel time.\nComprehensive cost analysis provides valuable insights into the economic\nimplications of various strategies and technologies. These findings offer\nguidance to various stakeholders in formulating effective strategies, behaviour\nchanges, and policies for emission reduction and sustainable transportation\ndevelopment.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:17:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sabet","Saba",""],["Farooq","Bilal",""]]}
{"id":"2308.14915","submitter":"Pietro Mazzaglia","authors":"Pietro Mazzaglia, Taco Cohen, Daniel Dijkman","title":"Uncertainty-driven Affordance Discovery for Efficient Robotics\n  Manipulation","comments":"Presented at the GMPL workshop @ RSS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robotics affordances, providing information about what actions can be taken\nin a given situation, can aid robotics manipulation. However, learning about\naffordances requires expensive large annotated datasets of interactions or\ndemonstrations. In this work, we show active learning can mitigate this problem\nand propose the use of uncertainty to drive an interactive affordance discovery\nprocess. We show that our method enables the efficient discovery of visual\naffordances for several action primitives, such as grasping, stacking objects,\nor opening drawers, strongly improving data efficiency and allowing us to learn\ngrasping affordances on a real-world setup with an xArm 6 robot arm in a small\nnumber of trials.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:20:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mazzaglia","Pietro",""],["Cohen","Taco",""],["Dijkman","Daniel",""]]}
{"id":"2308.14916","submitter":"Sahil Verma","authors":"Sahil Verma, Ashudeep Singh, Varich Boonsanong, John P. Dickerson,\n  Chirag Shah","title":"RecRec: Algorithmic Recourse for Recommender Systems","comments":"Accepted as a short paper at CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3615181","report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recommender systems play an essential role in the choices people make in\ndomains such as entertainment, shopping, food, news, employment, and education.\nThe machine learning models underlying these recommender systems are often\nenormously large and black-box in nature for users, content providers, and\nsystem developers alike. It is often crucial for all stakeholders to understand\nthe model's rationale behind making certain predictions and recommendations.\nThis is especially true for the content providers whose livelihoods depend on\nthe recommender system. Drawing motivation from the practitioners' need, in\nthis work, we propose a recourse framework for recommender systems, targeted\ntowards the content providers. Algorithmic recourse in the recommendation\nsetting is a set of actions that, if executed, would modify the recommendations\n(or ranking) of an item in the desired manner. A recourse suggests actions of\nthe form: \"if a feature changes X to Y, then the ranking of that item for a set\nof users will change to Z.\" Furthermore, we demonstrate that RecRec is highly\neffective in generating valid, sparse, and actionable recourses through an\nempirical evaluation of recommender systems trained on three real-world\ndatasets. To the best of our knowledge, this work is the first to conceptualize\nand empirically test a generalized framework for generating recourses for\nrecommender systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:26:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Verma","Sahil",""],["Singh","Ashudeep",""],["Boonsanong","Varich",""],["Dickerson","John P.",""],["Shah","Chirag",""]]}
{"id":"2308.14917","submitter":"John Gertz","authors":"John Gertz","title":"Interstellar Diplomacy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.pop-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Defense Department and NASA are investigating the possibility that aliens\nare currently surveilling Earth. This aligns with some\nsearch-for-extraterrestrial-intelligence (SETI) theorists who have concluded\nthat ET's best strategy for opening a channel of communication is to send\nartificially intelligent probes to our Solar System for that purpose. This is a\ngolden age for traditional SETI, which is currently well funded, with most of\nthe world's radio telescopes now engaged in the hunt. One way or another,\ncontact with aliens may be imminent. There has been no planning among nations\nfor the aftermath of a first detection. This paper advocates for such planning\nand diplomacy.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:27:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gertz","John",""]]}
{"id":"2308.14918","submitter":"Joonhyuk Kwon","authors":"Joonhyuk Kwon, William J. Setzer, Michael Gehl, Nicholas Karl, Jay Van\n  Der Wall, Ryan Law, Daniel Stick and Hayden J. McGuinness","title":"Multi-site Integrated Optical Addressing of Trapped Ions","comments":"7 pages, 4 figures (+2 supplementary figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the most effective ways to advance the performance of quantum\ncomputers and quantum sensors is to increase the number of qubits or quantum\nresources used by the system. A major technical challenge that must be solved\nto realize this goal for trapped-ion systems is scaling the delivery of optical\nsignals to many individual ions. In this paper we demonstrate an approach\nemploying waveguides and multi-mode interferometer splitters to optically\naddress multiple $^{171}\\textrm{Yb}^+$ ions in a surface trap by delivering all\nwavelengths required for full qubit control. Measurements of hyperfine\nspectroscopy and Rabi flopping were performed on the E2 clock transition, using\nintegrated waveguides for delivering the light needed for Doppler cooling,\nstate preparation, coherent operations, and detection. We describe the use of\nsplitters to address multiple ions using a single optical input per wavelength\nand use them to demonstrate simultaneous Rabi flopping on two different\ntransitions occurring at distinct trap sites. This work represents an important\nstep towards the realization of scalable integrated photonics for atomic clocks\nand trapped-ion quantum information systems.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:28:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kwon","Joonhyuk",""],["Setzer","William J.",""],["Gehl","Michael",""],["Karl","Nicholas",""],["Van Der Wall","Jay",""],["Law","Ryan",""],["Stick","Daniel",""],["McGuinness","Hayden J.",""]]}
{"id":"2308.14919","submitter":"Falcon Dai","authors":"Falcon Z. Dai","title":"On Reward Structures of Markov Decision Processes","comments":"This PhD thesis draws heavily from arXiv:1907.02114 and\n  arXiv:2002.06299","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Markov decision process can be parameterized by a transition kernel and a\nreward function. Both play essential roles in the study of reinforcement\nlearning as evidenced by their presence in the Bellman equations. In our\ninquiry of various kinds of ``costs'' associated with reinforcement learning\ninspired by the demands in robotic applications, rewards are central to\nunderstanding the structure of a Markov decision process and reward-centric\nnotions can elucidate important concepts in reinforcement learning.\nSpecifically, we studied the sample complexity of policy evaluation and\ndeveloped a novel estimator with an instance-specific error bound of\n$\\tilde{O}(\\sqrt{\\frac{\\tau_s}{n}})$ for estimating a single state value. Under\nthe online regret minimization setting, we refined the transition-based MDP\nconstant, diameter, into a reward-based constant, maximum expected hitting\ncost, and with it, provided a theoretical explanation for how a well-known\ntechnique, potential-based reward shaping, could accelerate learning with\nexpert knowledge. In an attempt to study safe reinforcement learning, we\nmodeled hazardous environments with irrecoverability and proposed a\nquantitative notion of safe learning via reset efficiency. In this setting, we\nmodified a classic algorithm to account for resets achieving promising\npreliminary numerical results. Lastly, for MDPs with multiple reward functions,\nwe developed a planning algorithm that computationally efficiently finds Pareto\noptimal stochastic policies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:29:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dai","Falcon Z.",""]]}
{"id":"2308.14920","submitter":"Janosh Riebesell","authors":"Janosh Riebesell, Rhys E. A. Goodall, Anubhav Jain, Philipp Benner,\n  Kristin A. Persson, Alpha A. Lee","title":"Matbench Discovery -- An evaluation framework for machine learning\n  crystal stability prediction","comments":"18 pages, 9 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Matbench Discovery simulates the deployment of machine learning (ML) energy\nmodels in a high-throughput search for stable inorganic crystals. We address\nthe disconnect between (i) thermodynamic stability and formation energy and\n(ii) in-domain vs out-of-distribution performance. Alongside this paper, we\npublish a Python package to aid with future model submissions and a growing\nonline leaderboard with further insights into trade-offs between various\nperformance metrics. To answer the question which ML methodology performs best\nat materials discovery, our initial release explores a variety of models\nincluding random forests, graph neural networks (GNN), one-shot predictors,\niterative Bayesian optimizers and universal interatomic potentials (UIP).\nRanked best-to-worst by their test set F1 score on thermodynamic stability\nprediction, we find CHGNet > M3GNet > MACE > ALIGNN > MEGNet > CGCNN > CGCNN+P\n> Wrenformer > BOWSR > Voronoi tessellation fingerprints with random forest.\nThe top 3 models are UIPs, the winning methodology for ML-guided materials\ndiscovery, achieving F1 scores of ~0.6 for crystal stability classification and\ndiscovery acceleration factors (DAF) of up to 5x on the first 10k most stable\npredictions compared to dummy selection from our test set. We also highlight a\nsharp disconnect between commonly used global regression metrics and more\ntask-relevant classification metrics. Accurate regressors are susceptible to\nunexpectedly high false-positive rates if those accurate predictions lie close\nto the decision boundary at 0 eV/atom above the convex hull where most\nmaterials are. Our results highlight the need to focus on classification\nmetrics that actually correlate with improved stability hit rate.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:29:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Riebesell","Janosh",""],["Goodall","Rhys E. A.",""],["Jain","Anubhav",""],["Benner","Philipp",""],["Persson","Kristin A.",""],["Lee","Alpha A.",""]]}
{"id":"2308.14921","submitter":"Hadas Kotek","authors":"Hadas Kotek, Rikker Dockum, and David Q. Sun","title":"Gender bias and stereotypes in Large Language Models","comments":"ACM Collective Intelligence","journal-ref":"In Collective Intelligence Conference (CI '23), November 06-09,\n  2023, Delft, Netherlands. ACM, New York, NY, USA (2023)","doi":"10.1145/3582269.3615599","report-no":null,"categories":"cs.CL cs.CY cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Language Models (LLMs) have made substantial progress in the past\nseveral months, shattering state-of-the-art benchmarks in many domains. This\npaper investigates LLMs' behavior with respect to gender stereotypes, a known\nissue for prior models. We use a simple paradigm to test the presence of gender\nbias, building on but differing from WinoBias, a commonly used gender bias\ndataset, which is likely to be included in the training data of current LLMs.\nWe test four recently published LLMs and demonstrate that they express biased\nassumptions about men and women's occupations. Our contributions in this paper\nare as follows: (a) LLMs are 3-6 times more likely to choose an occupation that\nstereotypically aligns with a person's gender; (b) these choices align with\npeople's perceptions better than with the ground truth as reflected in official\njob statistics; (c) LLMs in fact amplify the bias beyond what is reflected in\nperceptions or the ground truth; (d) LLMs ignore crucial ambiguities in\nsentence structure 95% of the time in our study items, but when explicitly\nprompted, they recognize the ambiguity; (e) LLMs provide explanations for their\nchoices that are factually inaccurate and likely obscure the true reason behind\ntheir predictions. That is, they provide rationalizations of their biased\nbehavior. This highlights a key property of these models: LLMs are trained on\nimbalanced datasets; as such, even with the recent successes of reinforcement\nlearning with human feedback, they tend to reflect those imbalances back at us.\nAs with other types of societal biases, we suggest that LLMs must be carefully\ntested to ensure that they treat minoritized individuals and communities\nequitably.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:32:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kotek","Hadas",""],["Dockum","Rikker",""],["Sun","David Q.",""]]}
{"id":"2308.14922","submitter":"Jiaju Ma","authors":"Jiaju Ma, Anyi Rao, Li-Yi Wei, Rubaiat Habib Kazi, Hijung Valentina\n  Shin, Maneesh Agrawala","title":"Automated Conversion of Music Videos into Lyric Videos","comments":null,"journal-ref":null,"doi":"10.1145/3586183.3606757","report-no":null,"categories":"cs.HC cs.CV cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Musicians and fans often produce lyric videos, a form of music videos that\nshowcase the song's lyrics, for their favorite songs. However, making such\nvideos can be challenging and time-consuming as the lyrics need to be added in\nsynchrony and visual harmony with the video. Informed by prior work and close\nexamination of existing lyric videos, we propose a set of design guidelines to\nhelp creators make such videos. Our guidelines ensure the readability of the\nlyric text while maintaining a unified focus of attention. We instantiate these\nguidelines in a fully automated pipeline that converts an input music video\ninto a lyric video. We demonstrate the robustness of our pipeline by generating\nlyric videos from a diverse range of input sources. A user study shows that\nlyric videos generated by our pipeline are effective in maintaining text\nreadability and unifying the focus of attention.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:32:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ma","Jiaju",""],["Rao","Anyi",""],["Wei","Li-Yi",""],["Kazi","Rubaiat Habib",""],["Shin","Hijung Valentina",""],["Agrawala","Maneesh",""]]}
{"id":"2308.14923","submitter":"Ronaldo Antonio Santos","authors":"M. R. Batista, A. Cunha, J. C. Da Mota, R. A. Santos","title":"Well-posed problem for a combustion model in a multilayer porous medium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Combustion occurring in porous media has various practical applications, such\nas in in-situ combustion processes in oil reservoirs, the combustion of biogas\nin sanitary landfills, and many others. A porous medium where combustion takes\nplace can consist of layers with different physical properties. This study\ndemonstrates that the initial value problem for a combustion model in a\nmulti-layer porous medium has a unique solution, which is continuous with\nrespect to the initial data and parameters in $\\mathtt{L}^2(\\mathbb{R})^n$. In\nsummary, it establishes that the initial value problem is well-posed in\n$\\mathtt{L}^2(\\mathbb{R})^n$. The model is governed by a one-dimensional\nreaction-diffusion-convection system, where the unknowns are the temperatures\nin the layers. Previous studies have addressed the same problem in\n$\\mathtt{H}^2(\\mathbb{R})^n$. However, in this study, we solve the problem in a\nless restrictive space, namely $\\mathtt{L}^2(\\mathbb{R})^n$. The proof employs\na novel approach to combustion problems in porous media, utilizing an evolution\noperator defined from the theory of semigroups in Hilbert space and Kato's\ntheory for a well-posed associated initial value problem.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:32:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Batista","M. R.",""],["Cunha","A.",""],["Da Mota","J. C.",""],["Santos","R. A.",""]]}
{"id":"2308.14924","submitter":"Manuel Sage","authors":"Manuel Sage, Martin Staniszewski, Yaoyao Fiona Zhao","title":"Optimal Economic Gas Turbine Dispatch with Deep Reinforcement Learning","comments":"This work has been accepted to IFAC for publication under a Creative\n  Commons Licence CC-BY-NC-ND","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Dispatching strategies for gas turbines (GTs) are changing in modern\nelectricity grids. A growing incorporation of intermittent renewable energy\nrequires GTs to operate more but shorter cycles and more frequently on partial\nloads. Deep reinforcement learning (DRL) has recently emerged as a tool that\ncan cope with this development and dispatch GTs economically. The key\nadvantages of DRL are a model-free optimization and the ability to handle\nuncertainties, such as those introduced by varying loads or renewable energy\nproduction. In this study, three popular DRL algorithms are implemented for an\neconomic GT dispatch problem on a case study in Alberta, Canada. We highlight\nthe benefits of DRL by incorporating an existing thermodynamic software\nprovided by Siemens Energy into the environment model and by simulating\nuncertainty via varying electricity prices, loads, and ambient conditions.\nAmong the tested algorithms and baseline methods, Deep Q-Networks (DQN)\nobtained the highest rewards while Proximal Policy Optimization (PPO) was the\nmost sample efficient. We further propose and implement a method to assign GT\noperation and maintenance cost dynamically based on operating hours and cycles.\nCompared to existing methods, our approach better approximates the true cost of\nmodern GT dispatch and hence leads to more realistic policies.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:42:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sage","Manuel",""],["Staniszewski","Martin",""],["Zhao","Yaoyao Fiona",""]]}
{"id":"2308.14925","submitter":"Hector Gomez","authors":"Guillermo Lorenzo, Syed Rakin Ahmed, David A. Hormuth II, Brenna\n  Vaughn, Jayashree Kalpathy-Cramer, Luis Solorio, Thomas E. Yankeelov, Hector\n  Gomez","title":"Patient-specific, mechanistic models of tumor growth incorporating\n  artificial intelligence and big data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph cs.AI q-bio.TO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Despite the remarkable advances in cancer diagnosis, treatment, and\nmanagement that have occurred over the past decade, malignant tumors remain a\nmajor public health problem. Further progress in combating cancer may be\nenabled by personalizing the delivery of therapies according to the predicted\nresponse for each individual patient. The design of personalized therapies\nrequires patient-specific information integrated into an appropriate\nmathematical model of tumor response. A fundamental barrier to realizing this\nparadigm is the current lack of a rigorous, yet practical, mathematical theory\nof tumor initiation, development, invasion, and response to therapy. In this\nreview, we begin by providing an overview of different approaches to modeling\ntumor growth and treatment, including mechanistic as well as data-driven models\nbased on ``big data\" and artificial intelligence. Next, we present illustrative\nexamples of mathematical models manifesting their utility and discussing the\nlimitations of stand-alone mechanistic and data-driven models. We further\ndiscuss the potential of mechanistic models for not only predicting, but also\noptimizing response to therapy on a patient-specific basis. We then discuss\ncurrent efforts and future possibilities to integrate mechanistic and\ndata-driven models. We conclude by proposing five fundamental challenges that\nmust be addressed to fully realize personalized care for cancer patients driven\nby computational models.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:52:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lorenzo","Guillermo",""],["Ahmed","Syed Rakin",""],["Hormuth","David A.","II"],["Vaughn","Brenna",""],["Kalpathy-Cramer","Jayashree",""],["Solorio","Luis",""],["Yankeelov","Thomas E.",""],["Gomez","Hector",""]]}
{"id":"2308.14926","submitter":"Pascal Baumann","authors":"Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche","title":"Monus semantics in vector addition systems with states","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.FL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Vector addition systems with states (VASS) are a popular model for concurrent\nsystems. However, many decision problems have prohibitively high complexity.\nTherefore, it is sometimes useful to consider overapproximating semantics in\nwhich these problems can be decided more efficiently.\n  We study an overapproximation, called monus semantics, that slightly relaxes\nthe semantics of decrements: A key property of a vector addition systems is\nthat in order to decrement a counter, this counter must have a positive value.\nIn contrast, our semantics allows decrements of zero-valued counters: If such a\ntransition is executed, the counter just remains zero.\n  It turns out that if only a subset of transitions is used with monus\nsemantics (and the others with classical semantics), then reachability is\nundecidable. However, we show that if monus semantics is used throughout,\nreachability remains decidable. In particular, we show that reachability for\nVASS with monus semantics is as hard as that of classical VASS (i.e.\nAckermann-hard), while the zero-reachability and coverability are easier (i.e.\nEXPSPACE-complete and NP-complete, respectively). We provide a comprehensive\naccount of the complexity of the general reachability problem, reachability of\nzero configurations, and coverability under monus semantics. We study these\nproblems in general VASS, two-dimensional VASS, and one-dimensional VASS, with\nunary and binary counter updates.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:55:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Baumann","Pascal",""],["Madnani","Khushraj",""],["Mazowiecki","Filip",""],["Zetzsche","Georg",""]]}
{"id":"2308.14927","submitter":"Cameron Norton","authors":"Cameron E. Norton, Fred C. Adams and August E. Evrard","title":"Cluster Cosmology Redux: A Compact Model of the Halo Mass Function","comments":"18 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Massive halos hosting groups and clusters of galaxies imprint coherent,\narcminute-scale features across the spectrophotometric sky, especially\noptical-IR clusters of galaxies, distortions in the sub-mm CMB, and extended\nsources of X-ray emission. Statistical modeling of such features often rely\nupon the evolving space-time density of dark matter halos -- the halo mass\nfunction (HMF) -- as a common theoretical ground for cosmological,\nastrophysical and fundamental physics studies. We propose a compact (eight\nparameter) representation of the HMF with readily interpretable parameters that\nstem from polynomial expansions, first in terms of log-mass, then expanding\nthose coefficients similarly in redshift. We demonstrate good ($\\sim \\! 5\\%$)\nagreement of this form, referred to as the dual-quadratic (DQ-HMF), with\nMira-Titan N-body emulator estimates for halo masses above $10^{13.7} h^{-1}\n{\\rm M}_\\odot$ over the redshift range $0.1 < z < 1.5$, present best-fit\nparameters for a Planck 2018 cosmology, and present parameter variation in the\n$\\sigma_8 - \\Omega_{\\rm m}$ plane. Convolving with a minimal mass-observable\nrelation (MOR) yields closed-form expressions for counts, mean mass, and mass\nvariance of cluster samples characterized by some observable property.\nPerforming information-matrix forecasts of potential parameter constraints from\nexisting and future surveys under different levels of systematic uncertainties,\nwe demonstrate the potential for percent-level constraints on model parameters\nby an LSST-like optical cluster survey of 300,000 clusters and a richness-mass\nvariance of $0.3^2$. Even better constraints could potentially be achieved by a\nsurvey with one-tenth the sample size but with a reduced selection property\nvariance of $0.1^2$. Potential benefits and extensions to the basic MOR\nparameterization are discussed.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:58:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Norton","Cameron E.",""],["Adams","Fred C.",""],["Evrard","August E.",""]]}
{"id":"2308.14928","submitter":"Silvery D. Fu","authors":"Silvery Fu, Pratyush Das, Sylvia Ratnasamy","title":"Human-Scale Computing: A Case for Progressive Narrow Waist for Internet\n  Applications","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In the era where personal devices and applications are pervasive, individuals\nare continuously generating and interacting with a vast amount of data. Despite\nthis, access to and control over such data remains challenging due to its\nscattering across various app providers and formats. This paper presents\nHuman-Scale Computing, a vision and an approach where every individual has\nstraightforward, unified access to their data across all devices, apps, and\nservices. Key to this solution is the Human Scale Portal, a progressively\ndesigned intermediary that integrates different applications and service\nproviders. This design adopts a transitional development and deployment\nstrategy, involving an initial bootstrapping phase to engage application\nproviders, an acceleration phase to enhance the convenience of access, and an\neventual solution. We believe that this progressive \"narrow waist\" design can\nbridge the gap between the current state of data access and our envisioned\nfuture of human-scale access.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 22:58:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fu","Silvery",""],["Das","Pratyush",""],["Ratnasamy","Sylvia",""]]}
{"id":"2308.14929","submitter":"Stefanos Laskaridis","authors":"Samuel Horvath, Stefanos Laskaridis, Shashank Rajput, Hongyi Wang","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","comments":"Under review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Deep Neural Networks (DNNs) have been a large driver and enabler for AI\nbreakthroughs in recent years. These models have been getting larger in their\nattempt to become more accurate and tackle new upcoming use-cases, including\nAR/VR and intelligent assistants. However, the training process of such large\nmodels is a costly and time-consuming process, which typically yields a single\nmodel to fit all targets. To mitigate this, various techniques have been\nproposed in the literature, including pruning, sparsification or quantization\nof the model weights and updates. While able to achieve high compression rates,\nthey often incur computational overheads or accuracy penalties. Alternatively,\nfactorization methods have been leveraged to incorporate low-rank compression\nin the training process. Similarly, such techniques (e.g.,~SVD) frequently rely\non the computationally expensive decomposition of layers and are potentially\nsub-optimal for non-linear models, such as DNNs. In this work, we take a\nfurther step in designing efficient low-rank models and propose Maestro, a\nframework for trainable low-rank layers. Instead of regularly applying a priori\ndecompositions such as SVD, the low-rank structure is built into the training\nprocess through a generalized variant of Ordered Dropout. This method imposes\nan importance ordering via sampling on the decomposed DNN structure. Our\ntheoretical analysis demonstrates that our method recovers the SVD\ndecomposition of linear mapping on uniformly distributed data and PCA for\nlinear autoencoders. We further apply our technique on DNNs and empirically\nillustrate that Maestro enables the extraction of lower footprint models that\npreserve model performance while allowing for graceful accuracy-latency\ntradeoff for the deployment to devices of different capabilities.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:08:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Horvath","Samuel",""],["Laskaridis","Stefanos",""],["Rajput","Shashank",""],["Wang","Hongyi",""]]}
{"id":"2308.14930","submitter":"Hajime Suzuki Dr","authors":"Farina Riaz and Shahab Abdulla and Hajime Suzuki and Srinjoy Ganguly\n  and Ravinesh C. Deo and Susan Hopkins","title":"Application of Quantum Pre-Processing Filter for Binary Image\n  Classification with Small Samples","comments":"13 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past few years, there has been significant interest in Quantum\nMachine Learning (QML) among researchers, as it has the potential to transform\nthe field of machine learning. Several models that exploit the properties of\nquantum mechanics have been developed for practical applications. In this\nstudy, we investigated the application of our previously proposed quantum\npre-processing filter (QPF) to binary image classification. We evaluated the\nQPF on four datasets: MNIST (handwritten digits), EMNIST (handwritten digits\nand alphabets), CIFAR-10 (photographic images) and GTSRB (real-life traffic\nsign images). Similar to our previous multi-class classification results, the\napplication of QPF improved the binary image classification accuracy using\nneural network against MNIST, EMNIST, and CIFAR-10 from 98.9% to 99.2%, 97.8%\nto 98.3%, and 71.2% to 76.1%, respectively, but degraded it against GTSRB from\n93.5% to 92.0%. We then applied QPF in cases using a smaller number of training\nand testing samples, i.e. 80 and 20 samples per class, respectively. In order\nto derive statistically stable results, we conducted the experiment with 100\ntrials choosing randomly different training and testing samples and averaging\nthe results. The result showed that the application of QPF did not improve the\nimage classification accuracy against MNIST and EMNIST but improved it against\nCIFAR-10 and GTSRB from 65.8% to 67.2% and 90.5% to 91.8%, respectively.\nFurther research will be conducted as part of future work to investigate the\npotential of QPF to assess the scalability of the proposed approach to larger\nand complex datasets.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:08:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Riaz","Farina",""],["Abdulla","Shahab",""],["Suzuki","Hajime",""],["Ganguly","Srinjoy",""],["Deo","Ravinesh C.",""],["Hopkins","Susan",""]]}
{"id":"2308.14931","submitter":"Prashant Padmanabhan","authors":"L. M. Martinez, Y. Liu, C. Petrovic, S. Haldar, T. Griepe, U. Atxitia,\n  M. Campbell, M. Pettes, R. P. Prasankumar, E. J. G. Santos, S. R.\n  Singamaneni, P. Padmanabhan","title":"Coherent Spin-Phonon Coupling in the Layered Ferrimagnet Mn3Si2Te6","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We utilize ultrafast photoexcitation to drive coherent lattice oscillations\nin the layered ferrimagnetic crystal Mn3Si2Te6, which significantly stiffen\nbelow the magnetic ordering temperature. We suggest that this is due to an\nexchange-mediated contraction of the lattice, stemming from strong\nmagneto-structural coupling in this material. Additionally, simulations of the\ntransient incoherent dynamics reveal the importance of spin relaxation channels\nmediated by optical and acoustic phonon scattering. Our findings highlight the\nimportance of spin-lattice coupling in van der Waals magnets and a promising\nroute for their dynamic optical control through their intertwined electronic,\nlattice, and spin degrees of freedom.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:08:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Martinez","L. M.",""],["Liu","Y.",""],["Petrovic","C.",""],["Haldar","S.",""],["Griepe","T.",""],["Atxitia","U.",""],["Campbell","M.",""],["Pettes","M.",""],["Prasankumar","R. P.",""],["Santos","E. J. G.",""],["Singamaneni","S. R.",""],["Padmanabhan","P.",""]]}
{"id":"2308.14932","submitter":"Richard Bartels","authors":"Richard Bartels","title":"Generalized Loewy Length of Cohen-Macaulay Local and Graded Rings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We generalize a theorem of Ding relating the generalized Loewy length\n$\\text{g}\\ell\\ell(R)$ and index of a one-dimensional Cohen-Macaulay local ring\n$(R,\\mathfrak{m},k)$. Ding proved that if $R$ is Gorenstein, the associated\ngraded ring is Cohen-Macaulay, and $k$ is infinite, then the generalized Loewy\nlength and index of $R$ are equal. However, if $k$ is finite, equality may not\nhold. We prove that if the index of a one-dimensional Cohen-Macaulay local ring\nis finite and the associated graded ring has a homogeneous nonzerodivisor of\ndegree $t$, then $\\text{g}\\ell\\ell(R) \\leq \\text{index}(R)+t-1$. Next we prove\nthat if $R$ is a one-dimensional hypersurface ring with a witness to the\ngeneralized Loewy length that induces a regular initial form on the associated\ngraded ring, then the generalized Loewy length achieves this upper bound. We\nthen compute the generalized Loewy lengths of several families of examples of\none-dimensional hypersurface rings over finite fields. Finally, we study a\ngraded version of the generalized Loewy length and determine its value for\nnumerical semigroup rings.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:08:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bartels","Richard",""]]}
{"id":"2308.14933","submitter":"Aycil Cesmelioglu","authors":"Aycil Cesmelioglu, Jeonghun J. Lee, Sander Rhebergen, Dorisa Tabaku","title":"A hybridizable discontinuous Galerkin method for the\n  dual-porosity-Stokes problem","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We introduce and analyze a hybridizable discontinuous Galerkin (HDG) method\nfor the dual-porosity-Stokes problem. This coupled problem describes the\ninteraction between free flow in macrofractures/conduits, governed by the\nStokes equations, and flow in microfractures/matrix, governed by a\ndual-porosity model. We prove that the HDG method is strongly conservative,\nwell-posed, and give an a priori error analysis showing dependence on the\nproblem parameters. Our theoretical findings are corroborated by numerical\nexamples\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:14:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cesmelioglu","Aycil",""],["Lee","Jeonghun J.",""],["Rhebergen","Sander",""],["Tabaku","Dorisa",""]]}
{"id":"2308.14934","submitter":"Frederic Heihoff","authors":"Frederic Heihoff","title":"Can a chemotaxis-consumption system recover from a measure-type\n  aggregation state in arbitrary dimension?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the chemotaxis-consumption system \\[\n  \\left\\{\n  \\begin{aligned}\n  u_t &= \\Delta u - \\chi \\nabla \\cdot (u\\nabla v) \\\\\n  v_t &= \\Delta v - uv\n  \\end{aligned}\n  \\right. \\] in a smooth bounded domain $\\Omega \\subseteq \\mathbb{R}^n$, $n\n\\geq 2$, with parameter $\\chi > 0$ and Neumann boundary conditions. It is well\nknown that, for sufficiently smooth nonnegative initial data and under a\nsmallness condition for the initial state of $v$, solutions of the above system\nnever blow up and are even globally bounded. Going in a sense a step further in\nthis paper, we ask the question whether the system can even recover from an\ninitial state that already resembles measure-type blowup. To answer this, we\nshow that, given an arbitrarily large positive Radon measure $u_0$ with\n$u_0(\\overline{\\Omega}) > 0$ as the initial data for the first equation and a\nnonnegative $L^\\infty(\\Omega)$ function $v_0$ with \\[\n  0 < \\|v_0\\|_{L^{\\infty}(\\Omega)} < \\frac{2}{3n\\chi} \\] as initial data for\nthe second equation, it is still possible to construct a global classic\nsolution to the above system.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:17:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Heihoff","Frederic",""]]}
{"id":"2308.14935","submitter":"Zichang He","authors":"Zichang He, Bo Peng, Yuri Alexeev, Zheng Zhang","title":"Distributionally Robust Variational Quantum Algorithms with Shifted\n  Noise","comments":"11 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.ET","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given their potential to demonstrate near-term quantum advantage, variational\nquantum algorithms (VQAs) have been extensively studied. Although numerous\ntechniques have been developed for VQA parameter optimization, it remains a\nsignificant challenge. A practical issue is the high sensitivity of quantum\nnoise to environmental changes, and its propensity to shift in real time. This\npresents a critical problem as an optimized VQA ansatz may not perform\neffectively under a different noise environment. For the first time, we explore\nhow to optimize VQA parameters to be robust against unknown shifted noise. We\nmodel the noise level as a random variable with an unknown probability density\nfunction (PDF), and we assume that the PDF may shift within an uncertainty set.\nThis assumption guides us to formulate a distributionally robust optimization\nproblem, with the goal of finding parameters that maintain effectiveness under\nshifted noise. We utilize a distributionally robust Bayesian optimization\nsolver for our proposed formulation. This provides numerical evidence in both\nthe Quantum Approximate Optimization Algorithm (QAOA) and the Variational\nQuantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we\ncan identify parameters that perform more robustly under shifted noise. We\nregard this work as the first step towards improving the reliability of VQAs\ninfluenced by real-time noise.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:19:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Zichang",""],["Peng","Bo",""],["Alexeev","Yuri",""],["Zhang","Zheng",""]]}
{"id":"2308.14936","submitter":"Dongxiao Zhu","authors":"Chengyin Li, Prashant Khanduri, Yao Qiang, Rafi Ibn Sultan, Indrin\n  Chetty and Dongxiao Zhu","title":"Auto-Prompting SAM for Mobile Friendly 3D Medical Image Segmentation","comments":"9 pages, 4 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Segment Anything Model (SAM) has rapidly been adopted for segmenting a\nwide range of natural images. However, recent studies have indicated that SAM\nexhibits subpar performance on 3D medical image segmentation tasks. In addition\nto the domain gaps between natural and medical images, disparities in the\nspatial arrangement between 2D and 3D images, the substantial computational\nburden imposed by powerful GPU servers, and the time-consuming manual prompt\ngeneration impede the extension of SAM to a broader spectrum of medical image\nsegmentation applications. To address these challenges, in this work, we\nintroduce a novel method, AutoSAM Adapter, designed specifically for 3D\nmulti-organ CT-based segmentation. We employ parameter-efficient adaptation\ntechniques in developing an automatic prompt learning paradigm to facilitate\nthe transformation of the SAM model's capabilities to 3D medical image\nsegmentation, eliminating the need for manually generated prompts. Furthermore,\nwe effectively transfer the acquired knowledge of the AutoSAM Adapter to other\nlightweight models specifically tailored for 3D medical image analysis,\nachieving state-of-the-art (SOTA) performance on medical image segmentation\ntasks. Through extensive experimental evaluation, we demonstrate the AutoSAM\nAdapter as a critical foundation for effectively leveraging the emerging\nability of foundation models in 2D natural image segmentation for 3D medical\nimage segmentation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:23:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Chengyin",""],["Khanduri","Prashant",""],["Qiang","Yao",""],["Sultan","Rafi Ibn",""],["Chetty","Indrin",""],["Zhu","Dongxiao",""]]}
{"id":"2308.14937","submitter":"Javier Fernandez","authors":"F. Kordon, J. Fern\\'andez and P. Roura-Bas","title":"A Brillouin torus decomposition for Chern insulators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Two-band Chern insulators are topologically classified by the Chern number,\n$c$, which is given by the integral of the Berry curvature of the occupied band\nover the Brillouin torus. The curvature itself comes from the imaginary part of\na more basic object, the quantum geometric tensor, $Q$. On the other hand, the\nintegral over the Brillouin torus of the real part of $Q$ gives rise to another\nmagnitude, the quantum volume, $v_{g}$, that like $c$ also changes abruptly\nwhen the system undergoes a topological phase transition. Recently, the\ninformation about the topology of the system contained in the quantum volume\nhas been investigated. In this paper we present new results regarding the\nunderlying geometric structure of two-band Chern insulators. Since a generic\nmodel describing the system can be characterized by a map, the classifying map,\nfrom the Brillouin torus to the two-sphere, we study its properties at the\ngeometric level. We present a procedure for splitting the Brillouin torus into\ndifferent sectors in such a way that the classifying map when restricted to\neach of them is an injective immersion. By doing so, we show that $c$ and\n$v_{g}$ have a very rich inner structure, meaning that they are composed by\ndifferent contributions that behave differently at the topological phase\ntransition. In particular, some specific regions are found to be ones\nresponsible for the non vanishing value of the topological invariant $c$. In\naddition, the present work makes contact with, and clarifies, some\ninterpretations of the quantum volume in terms of the Euler characteristic\nnumber that were done in the recent literature. We illustrate our findings by a\ncareful analysis of some selected models for Chern insulators corresponding to\ntight-binding Hamiltonians.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:32:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kordon","F.",""],["Fern\u00e1ndez","J.",""],["Roura-Bas","P.",""]]}
{"id":"2308.14938","submitter":"Ryan White","authors":"Mackenzie J. Meni and Ryan T. White and Michael Mayo and Kevin\n  Pilkiewicz","title":"Entropy-based Guidance of Deep Neural Networks for Accelerated\n  Convergence and Improved Performance","comments":"13 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG eess.IV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks have dramatically increased our capacity to learn from large,\nhigh-dimensional datasets across innumerable disciplines. However, their\ndecisions are not easily interpretable, their computational costs are high, and\nbuilding and training them are uncertain processes. To add structure to these\nefforts, we derive new mathematical results to efficiently measure the changes\nin entropy as fully-connected and convolutional neural networks process data,\nand introduce entropy-based loss terms. Experiments in image compression and\nimage classification on benchmark datasets demonstrate these losses guide\nneural networks to learn rich latent data representations in fewer dimensions,\nconverge in fewer training epochs, and achieve better test metrics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:33:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Meni","Mackenzie J.",""],["White","Ryan T.",""],["Mayo","Michael",""],["Pilkiewicz","Kevin",""]]}
{"id":"2308.14939","submitter":"Mohsen Yarmohammadi","authors":"Mohsen Yarmohammadi, Marin Bukov, Vadim Oganesyan, Michael H.\n  Kolodrubetz","title":"Laser-enhanced magnetism in SmFeO$_3$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The cross-talk between two magnetic ions, Sm$^{3+}$ and Fe$^{2+}$, in\nsamarium ferrite (SmFeO$_3$) leads to a strong interaction of spins and phonons\nat low temperatures, while the magnetic interactions are weak. In this work, we\nsimulate the dissipative spin dynamics in SmFeO$_3$ that are coupled to\nlaser-driven infrared-active phonons via linear and quadratic modulation of the\nexchange energy to coherently enhance spin interactions, referred to as\nmagnetophononics. When linear coupling dominates, we discover a dynamical\nfirst-order phase transition in the nonequilibrium steady state which can\ninhibit strong enhancement of magnetic interactions. By contrast, when\nquadratic spin-phonon coupling dominates, no phase transition exists at\nexperimentally relevant parameters. By utilizing a chirp protocol, we see that\nthe phase transition can be engineered, enabling stronger magnetic interactions\nin the steady state, a key goal of magnetophononics. We also discuss the route\nfor experimental observation of our results, as well as the potential\napplication of our theory for functional materials and spintronics.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:36:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yarmohammadi","Mohsen",""],["Bukov","Marin",""],["Oganesyan","Vadim",""],["Kolodrubetz","Michael H.",""]]}
{"id":"2308.14940","submitter":"Vikram Mohanty","authors":"Vikram Mohanty and Kurt Luther","title":"DoubleCheck: Designing Community-based Assessability for Historical\n  Person Identification","comments":"Accepted to ACM Journal on Computing and Cultural Heritage (JOCCH)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Historical photos are valuable for their cultural and economic significance,\nbut can be difficult to identify accurately due to various challenges such as\nlow-quality images, lack of corroborating evidence, and limited research\nresources. Misidentified photos can have significant negative consequences,\nincluding lost economic value, incorrect historical records, and the spread of\nmisinformation that can lead to perpetuating conspiracy theories. To accurately\nassess the credibility of a photo identification (ID), it may be necessary to\nconduct investigative research, use domain knowledge, and consult experts. In\nthis paper, we introduce DoubleCheck, a quality assessment framework for\nverifying historical photo IDs on Civil War Photo Sleuth (CWPS), a popular\nonline platform for identifying American Civil War-era photos using facial\nrecognition and crowdsourcing. DoubleCheck focuses on improving CWPS's user\nexperience and system architecture to display information useful for assessing\nthe quality of historical photo IDs on CWPS. In a mixed-methods evaluation of\nDoubleCheck, we found that users contributed a wide diversity of sources for\nphoto IDs, which helped facilitate the community's assessment of these IDs\nthrough DoubleCheck's provenance visualizations. Further, DoubleCheck's quality\nassessment badges and visualizations supported users in making accurate\nassessments of photo IDs, even in cases involving ID conflicts.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:38:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mohanty","Vikram",""],["Luther","Kurt",""]]}
{"id":"2308.14941","submitter":"Felix Weilacher","authors":"Anton Bernshteyn, Felix Weilacher","title":"Borel versions of the Local Lemma and LOCAL algorithms for graphs of\n  finite asymptotic separation index","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO cs.DC math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Asymptotic separation index is a parameter that measures how easily a Borel\ngraph can be approximated by its subgraphs with finite components. In contrast\nto the more classical notion of hyperfiniteness, asymptotic separation index is\nwell-suited for combinatorial applications in the Borel setting. The main\nresult of this paper is a Borel version of the Lov\\'asz Local Lemma -- a\npowerful general-purpose tool in probabilistic combinatorics -- under a finite\nasymptotic separation index assumption. As a consequence, we show that locally\ncheckable labeling problems that are solvable by efficient randomized\ndistributed algorithms admit Borel solutions on bounded degree Borel graphs\nwith finite asymptotic separation index. From this we derive a number of\ncorollaries, for example a Borel version of Brooks's theorem for graphs with\nfinite asymptotic separation index.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:39:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bernshteyn","Anton",""],["Weilacher","Felix",""]]}
{"id":"2308.14942","submitter":"David Evans","authors":"David M Evans, George Davey Smith, Gunn-Helen Moen","title":"Woolf et als GWAS by subtraction is not useful for cross-generational\n  Mendelian randomization studies","comments":"8 pages, 0 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mendelian randomization (MR) is an epidemiological method that can be used to\nstrengthen causal inference regarding the relationship between a modifiable\nenvironmental exposure and a medically relevant trait and to estimate the\nmagnitude of this relationship1. Recently, there has been considerable interest\nin using MR to examine potential causal relationships between parental\nphenotypes and outcomes amongst their offspring. In a recent issue of BMC\nResearch Notes, Woolf et al (2023) present a new method, GWAS by subtraction,\nto derive genome-wide summary statistics for paternal smoking and other\npaternal phenotypes with the goal that these estimates can then be used in\ndownstream (including two sample) MR studies. Whilst a potentially useful goal,\nWoolf et al. (2023) focus on the wrong parameter of interest for useful\ngenome-wide association studies (GWAS) and downstream cross-generational MR\nstudies, and the estimator that they derive is neither efficient nor\nappropriate for such use.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:49:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Evans","David M",""],["Smith","George Davey",""],["Moen","Gunn-Helen",""]]}
{"id":"2308.14943","submitter":"Sikai Chen","authors":"Jiqian Dong, Sikai Chen, Samuel Labi","title":"Transfusor: Transformer Diffusor for Controllable Human-like Generation\n  of Vehicle Lane Changing Trajectories","comments":"Submitted for presentation only at the 2024 Annual Meeting of the\n  Transportation Research Board","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With ongoing development of autonomous driving systems and increasing desire\nfor deployment, researchers continue to seek reliable approaches for ADS\nsystems. The virtual simulation test (VST) has become a prominent approach for\ntesting autonomous driving systems (ADS) and advanced driver assistance systems\n(ADAS) due to its advantages of fast execution, low cost, and high\nrepeatability. However, the success of these simulation-based experiments\nheavily relies on the realism of the testing scenarios. It is needed to create\nmore flexible and high-fidelity testing scenarios in VST in order to increase\nthe safety and reliabilityof ADS and ADAS.To address this challenge, this paper\nintroduces the \"Transfusor\" model, which leverages the transformer and diffusor\nmodels (two cutting-edge deep learning generative technologies). The primary\nobjective of the Transfusor model is to generate highly realistic and\ncontrollable human-like lane-changing trajectories in highway scenarios.\nExtensive experiments were carried out, and the results demonstrate that the\nproposed model effectively learns the spatiotemporal characteristics of humans'\nlane-changing behaviors and successfully generates trajectories that closely\nmimic real-world human driving. As such, the proposed model can play a critical\nrole of creating more flexible and high-fidelity testing scenarios in the VST,\nultimately leading to safer and more reliable ADS and ADAS.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:50:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dong","Jiqian",""],["Chen","Sikai",""],["Labi","Samuel",""]]}
{"id":"2308.14944","submitter":"Jada Walters","authors":"Jada Walters, Kristopher G. Klein, Emily Lichko, Michael L. Stevens,\n  Daniel Verscharen, and Benjamin D. G. Chandran","title":"The Effects of Non-Equilibrium Velocity Distributions on Alfv\\'en\n  Ion-Cyclotron Waves in the Solar Wind","comments":"11 pages, 4 figures, 1 table. To be published in The Astrophysical\n  Journal","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR physics.plasm-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we investigate how the complex structure found in solar wind\nproton velocity distribution functions (VDFs), rather than the commonly assumed\ntwo-component bi-Maxwellian structure, affects the onset and evolution of\nparallel-propagating microinstabilities. We use the Arbitrary Linear Plasma\nSolver (ALPS), a numerical dispersion solver, to find the real frequencies and\ngrowth/damping rates of the Alfv\\'en modes calculated for proton VDFs extracted\nfrom Wind spacecraft observations of the solar wind. We compare this wave\nbehavior to that obtained by applying the same procedure to core-and-beam\nbi-Maxwellian fits of the Wind proton VDFs. We find several significant\ndifferences in the plasma waves obtained for the extracted data and\nbi-Maxwellian fits, including a strong dependence of the growth/damping rate on\nthe shape of the VDF. By application of the quasilinear diffusion operator to\nthese VDFs, we pinpoint resonantly interacting regions in velocity space where\ndifferences in VDF structure significantly affect the wave growth and damping\nrates. This demonstration of the sensitive dependence of Alfv\\'en mode behavior\non VDF structure may explain why the Alfv\\'en ion-cyclotron instability\nthresholds predicted by linear theory for bi-Maxwellian models of solar wind\nproton background VDFs do not entirely constrain spacecraft observations of\nsolar wind proton VDFs, such as those made by the Wind spacecraft.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:51:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Walters","Jada",""],["Klein","Kristopher G.",""],["Lichko","Emily",""],["Stevens","Michael L.",""],["Verscharen","Daniel",""],["Chandran","Benjamin D. G.",""]]}
{"id":"2308.14945","submitter":"Hong Ye Tan","authors":"Hong Ye Tan, Stanley Osher, Wuchen Li","title":"Noise-Free Sampling Algorithms via Regularized Wasserstein Proximals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG stat.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the problem of sampling from a distribution governed by a\npotential function. This work proposes an explicit score-based MCMC method that\nis deterministic, resulting in a deterministic evolution for particles rather\nthan a stochastic differential equation evolution. The score term is given in\nclosed form by a regularized Wasserstein proximal, using a kernel convolution\nthat is approximated by sampling. We demonstrate fast convergence on various\nproblems and show improved dimensional dependence of mixing time bounds for the\ncase of Gaussian distributions compared to the unadjusted Langevin algorithm\n(ULA) and the Metropolis-adjusted Langevin algorithm (MALA). We additionally\nderive closed form expressions for the distributions at each iterate for\nquadratic potential functions, characterizing the variance reduction. Empirical\nresults demonstrate that the particles behave in an organized manner, lying on\nlevel set contours of the potential. Moreover, the posterior mean estimator of\nthe proposed method is shown to be closer to the maximum a-posteriori estimator\ncompared to ULA and MALA, in the context of Bayesian logistic regression.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:51:33 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:48:21 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tan","Hong Ye",""],["Osher","Stanley",""],["Li","Wuchen",""]]}
{"id":"2308.14946","submitter":"Zhishen Huang","authors":"Zhishen Huang","title":"Reinforcement Learning for Sampling on Temporal Medical Imaging\n  Sequences","comments":"ICML 2023 Workshop SODS","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG eess.IV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accelerated magnetic resonance imaging resorts to either Fourier-domain\nsubsampling or better reconstruction algorithms to deal with fewer measurements\nwhile still generating medical images of high quality. Determining the optimal\nsampling strategy given a fixed reconstruction protocol often has combinatorial\ncomplexity. In this work, we apply double deep Q-learning and REINFORCE\nalgorithms to learn the sampling strategy for dynamic image reconstruction. We\nconsider the data in the format of time series, and the reconstruction method\nis a pre-trained autoencoder-typed neural network. We present a proof of\nconcept that reinforcement learning algorithms are effective to discover the\noptimal sampling pattern which underlies the pre-trained reconstructor network\n(i.e., the dynamics in the environment). The code for replicating experiments\ncan be found at https://github.com/zhishenhuang/RLsamp.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 23:55:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Zhishen",""]]}
{"id":"2308.14947","submitter":"Adam Sigal","authors":"Adam Sigal, Hsiu-Chin Lin, AJung Moon","title":"Improving Reinforcement Learning Training Regimes for Social Robot\n  Navigation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.LG cs.MA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order for autonomous mobile robots to navigate in human spaces, they must\nabide by our social norms. Reinforcement learning (RL) has emerged as an\neffective method to train robot navigation policies that are able to respect\nthese norms. However, a large portion of existing work in the field conducts\nboth RL training and testing in simplistic environments. This limits the\ngeneralization potential of these models to unseen environments, and the\nmeaningfulness of their reported results. We propose a method to improve the\ngeneralization performance of RL social navigation methods using curriculum\nlearning. By employing multiple environment types and by modeling pedestrians\nusing multiple dynamics models, we are able to progressively diversify and\nescalate difficulty in training. Our results show that the use of curriculum\nlearning in training can be used to achieve better generalization performance\nthan previous training methods. We also show that results presented in many\nexisting state-of-the art RL social navigation works do not evaluate their\nmethods outside of their training environments, and thus do not reflect their\npolicies' failure to adequately generalize to out-of-distribution scenarios. In\nresponse, we validate our training approach on larger and more crowded testing\nenvironments than those used in training, allowing for more meaningful\nmeasurements of model performance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:00:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sigal","Adam",""],["Lin","Hsiu-Chin",""],["Moon","AJung",""]]}
{"id":"2308.14948","submitter":"Mario Edoardo Bertaina","authors":"Mario Bertaina, Mikhail Zotov, Dmitry Anzhiganov, Dario Barghini, Carl\n  Blaksley, Antonio Giulio Coretti, Aleksandr Kryazhenkov, Antonio Montanaro\n  and Leonardo Olivi (for the JEM-EUSO collaboration)","title":"Machine Learning for Mini-EUSO Telescope Data Analysis","comments":"10 pages, 3 figures, ICRC2023 conference","journal-ref":null,"doi":"10.22323/1.444.0277","report-no":null,"categories":"astro-ph.IM physics.comp-ph physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Neural networks as well as other methods of machine learning (ML) are known\nto be highly efficient in different classification tasks, including\nclassification of images and videos. Mini- EUSO is a wide-field-of-view imaging\ntelescope that operates onboard the International Space Station since 2019\ncollecting data on miscellaneous processes that take place in the atmosphere of\nEarth in the UV range. Here we briefly present our results on the development\nof ML-based approaches for recognition and classification of track-like signals\nin the Mini-EUSO data, among them meteors, space debris and signals the light\ncurves and kinematics of which are similar to those expected from extensive air\nshowers generated by ultra-high-energy cosmic rays. We show that even simple\nneural networks demonstrate impressive performance in solving these tasks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:04:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bertaina","Mario","","for the JEM-EUSO collaboration"],["Zotov","Mikhail","","for the JEM-EUSO collaboration"],["Anzhiganov","Dmitry","","for the JEM-EUSO collaboration"],["Barghini","Dario","","for the JEM-EUSO collaboration"],["Blaksley","Carl","","for the JEM-EUSO collaboration"],["Coretti","Antonio Giulio","","for the JEM-EUSO collaboration"],["Kryazhenkov","Aleksandr","","for the JEM-EUSO collaboration"],["Montanaro","Antonio","","for the JEM-EUSO collaboration"],["Olivi","Leonardo","","for the JEM-EUSO collaboration"]]}
{"id":"2308.14949","submitter":"Shuang Wang","authors":"Shuang Wang, Bahaeddin Eravci, Rustam Guliyev, Hakan Ferhatosmanoglu","title":"Low-bit Quantization for Deep Graph Neural Networks with\n  Smoothness-aware Message Propagation","comments":"To appear in CIKM2023","journal-ref":"Proceedings of the 32nd ACM International Conference on\n  Information and Knowledge Management (CIKM '23), October 21--25, 2023,\n  Birmingham, United Kingdom","doi":"10.1145/3583780.3614955","report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Graph Neural Network (GNN) training and inference involve significant\nchallenges of scalability with respect to both model sizes and number of\nlayers, resulting in degradation of efficiency and accuracy for large and deep\nGNNs. We present an end-to-end solution that aims to address these challenges\nfor efficient GNNs in resource constrained environments while avoiding the\noversmoothing problem in deep GNNs. We introduce a quantization based approach\nfor all stages of GNNs, from message passing in training to node\nclassification, compressing the model and enabling efficient processing. The\nproposed GNN quantizer learns quantization ranges and reduces the model size\nwith comparable accuracy even under low-bit quantization. To scale with the\nnumber of layers, we devise a message propagation mechanism in training that\ncontrols layer-wise changes of similarities between neighboring nodes. This\nobjective is incorporated into a Lagrangian function with constraints and a\ndifferential multiplier method is utilized to iteratively find optimal\nembeddings. This mitigates oversmoothing and suppresses the quantization error\nto a bound. Significant improvements are demonstrated over state-of-the-art\nquantization methods and deep GNN approaches in both full-precision and\nquantized models. The proposed quantizer demonstrates superior performance in\nINT2 configurations across all stages of GNN, achieving a notable level of\naccuracy. In contrast, existing quantization approaches fail to generate\nsatisfactory accuracy levels. Finally, the inference with INT2 and INT4\nrepresentations exhibits a speedup of 5.11 $\\times$ and 4.70 $\\times$ compared\nto full precision counterparts, respectively.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:25:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Shuang",""],["Eravci","Bahaeddin",""],["Guliyev","Rustam",""],["Ferhatosmanoglu","Hakan",""]]}
{"id":"2308.14950","submitter":"Terry Mart","authors":"M. Ridwan and T. Mart","title":"Note on the electromagnetic radius of proton","comments":"25 pages, 9 figures, submitted to Modern Physics Letters A","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-ex nucl-th physics.pop-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We have analyzed the proton form factor data by using a number of\nphenomenological parameterizations (models) and extracting the proton electric\nand magnetic radii. To this end we performed a global fit to all available form\nfactor data, with the virtual photon momentum squared $Q^2$ from $0.0002$ to\nnearly 10 GeV$^2$ for electric form factor and from $0.015$ to 31 GeV$^2$ for\nmagnetic one. Special attention was given to the small structure shown by the\nform factor data near $Q^2 = 0.2$ GeV$^2$. It was found that different models\nyield different structures with different numbers of minimum at this\nkinematics. Since the slope of form factor in the limit of $Q^2\\to 0$ is\ninfluenced by this structure, the extracted proton radii are consequently\ndifferent for different models. Our finding recommends that future experiments\nshould focus on this kinematics instead of low $Q^2$. Experimental data with\naccuracies comparable to those of the latest data at low $Q^2$ would clearly\nhelp to clarify the effect of this structure on the proton charge radius.\nInterestingly, most of the extracted proton charge radii were found to be\ncloser to the value obtained from the muonic hydrogen atom spectroscopy.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:40:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ridwan","M.",""],["Mart","T.",""]]}
{"id":"2308.14951","submitter":"Homayoon Beigi","authors":"Mustafa Eyceoz, Justin Lee, Siddharth Pittie, Homayoon Beigi","title":"Robust Open-Set Spoken Language Identification and the CU MultiLang\n  Dataset","comments":"6pages, 1 table, 6 figures","journal-ref":"Recognition Technologies, Inc. Technical Report (2023),\n  RTI-20230328-01","doi":"10.13140/RG.2.2.22716.21122","report-no":"RTI-20230828-01","categories":"cs.CL cs.AI cs.LG eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most state-of-the-art spoken language identification models are closed-set;\nin other words, they can only output a language label from the set of classes\nthey were trained on. Open-set spoken language identification systems, however,\ngain the ability to detect when an input exhibits none of the original\nlanguages. In this paper, we implement a novel approach to open-set spoken\nlanguage identification that uses MFCC and pitch features, a TDNN model to\nextract meaningful feature embeddings, confidence thresholding on softmax\noutputs, and LDA and pLDA for learning to classify new unknown languages. We\npresent a spoken language identification system that achieves 91.76% accuracy\non trained languages and has the capability to adapt to unknown languages on\nthe fly. To that end, we also built the CU MultiLang Dataset, a large and\ndiverse multilingual speech corpus which was used to train and evaluate our\nsystem.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:44:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Eyceoz","Mustafa",""],["Lee","Justin",""],["Pittie","Siddharth",""],["Beigi","Homayoon",""]]}
{"id":"2308.14952","submitter":"Hanwen Xuan","authors":"Hanwen Xuan, Luca Maestrini, Feng Chen, Clara Grazian","title":"Stochastic Variational Inference for GARCH Models","comments":"23 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.CO econ.EM stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic variational inference algorithms are derived for fitting various\nheteroskedastic time series models. We examine Gaussian, t, and skew-t response\nGARCH models and fit these using Gaussian variational approximating densities.\nWe implement efficient stochastic gradient ascent procedures based on the use\nof control variates or the reparameterization trick and demonstrate that the\nproposed implementations provide a fast and accurate alternative to Markov\nchain Monte Carlo sampling. Additionally, we present sequential updating\nversions of our variational algorithms, which are suitable for efficient\nportfolio construction and dynamic asset allocation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 00:49:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xuan","Hanwen",""],["Maestrini","Luca",""],["Chen","Feng",""],["Grazian","Clara",""]]}
{"id":"2308.14953","submitter":"Gregory Watson","authors":"Gregory R. Watson, Addi Malviya-Thakur, Daniel S. Katz, Elaine M.\n  Raybourn, Bill Hoffman, Dana Robinson, John Kellerman, Clark Roundy","title":"An Open Community-Driven Model For Sustainable Research Software:\n  Sustainable Research Software Institute","comments":"13 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"200363","categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research software plays a crucial role in advancing scientific knowledge, but\nensuring its sustainability, maintainability, and long-term viability is an\nongoing challenge. To address these concerns, the Sustainable Research Software\nInstitute (SRSI) Model presents a comprehensive framework designed to promote\nsustainable practices in the research software community. This white paper\nprovides an in-depth overview of the SRSI Model, outlining its objectives,\nservices, funding mechanisms, collaborations, and the significant potential\nimpact it could have on the research software community. It explores the wide\nrange of services offered, diverse funding sources, extensive collaboration\nopportunities, and the transformative influence of the SRSI Model on the\nresearch software landscape\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:00:32 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 19:45:32 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Watson","Gregory R.",""],["Malviya-Thakur","Addi",""],["Katz","Daniel S.",""],["Raybourn","Elaine M.",""],["Hoffman","Bill",""],["Robinson","Dana",""],["Kellerman","John",""],["Roundy","Clark",""]]}
{"id":"2308.14954","submitter":"Gregory Watson","authors":"Gregory R. Watson, Addi Malviya-Thakur, Daniel S. Katz, Elaine M.\n  Raybourn, Bill Hoffman, Dana Robinson, John Kellerman, Clark Roundy","title":"Transitioning ECP Software Technology into a Foundation for Sustainable\n  Research Software","comments":"7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":"200366","categories":"cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Research software plays a crucial role in advancing scientific knowledge, but\nensuring its sustainability, maintainability, and long-term viability is an\nongoing challenge. The Sustainable Research Software Institute (SRSI) Model has\nbeen designed to address the concerns, and presents a comprehensive framework\ndesigned to promote sustainable practices in the research software community.\nHowever the SRSI Model does not address the transitional requirements for the\nExascale Computing Project (ECP) Software Technology (ECP-ST) focus area\nspecifically. This white paper provides an overview and detailed description of\nhow ECP-ST will transition into the SRSI in a compressed time frame that a)\nmeets the needs of the ECP end-of-technical-activities deadline; and b) ensures\nthe continuity of the sustainability efforts that are already underway.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:03:12 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 19:47:03 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Watson","Gregory R.",""],["Malviya-Thakur","Addi",""],["Katz","Daniel S.",""],["Raybourn","Elaine M.",""],["Hoffman","Bill",""],["Robinson","Dana",""],["Kellerman","John",""],["Roundy","Clark",""]]}
{"id":"2308.14955","submitter":"Mark Ilton","authors":"Lucien Tsai and Paco Navarro and Elizabeth Mendoza and Emanuel Azizi\n  and Mark Ilton","title":"Viscoelastic materials are most energy efficient when loaded and\n  unloaded at equal rates","comments":"main text: 9 pages, 5 figures; supplemental information: 10 pages, 7\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Biological springs can be used in nature for energy conservation and\nultra-fast motion. The loading and unloading rates of elastic materials can\nplay an important role in determining how the properties of these springs\naffect movements. We investigate the mechanical energy efficiency of biological\nsprings (American bullfrog plantaris tendon) and synthetic elastomers under\nsymmetric rates (equal loading and unloading durations) and asymmetric rates\n(unequal loading and unloading durations) using novel dynamic mechanical\nanalysis measurements. We find that mechanical efficiency is highest at\nsymmetric rates and significantly decreases with a larger degree of asymmetry.\nA generalized Maxwell model with no fitting parameters captures the\nexperimental results based on the independently-characterized linear\nviscoelastic properties of the materials. The model further shows that a\nbroader viscoelastic relaxation spectrum enhances the effect of rate-asymmetry\non efficiency. Overall, our study provides valuable insights into the interplay\nbetween material properties and unloading dynamics in both biological and\nsynthetic elastic systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:07:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tsai","Lucien",""],["Navarro","Paco",""],["Mendoza","Elizabeth",""],["Azizi","Emanuel",""],["Ilton","Mark",""]]}
{"id":"2308.14956","submitter":"Hassan Alnatah","authors":"Xingzhou Chen, Hassan Alnatah, Danqun Mao, Mengyao Xu, Qiaochu Wan,\n  Jonathan Beaumariage, Wei Xie, Hongxing Xu, Zhe-Yu Shi, David Snoke, Zheng\n  Sun and Jian Wu","title":"Bose condensation of upper-branch exciton-polaritons in a transferrable\n  microcavity","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Exciton-polaritons are composite bosonic quasiparticles arising from the\nstrong coupling of excitonic transitions and optical modes. Exciton-polaritons\nhave triggered wide exploration in the past decades not only due to their rich\nquantum phenomena such as superfluidity, superconductivity and quantized\nvortices but also due to their potential applications for unconventional\ncoherent light sources and all-optical control elements. Here, we report the\nobservation of Bose-Einstein condensation of the upper polariton branch in a\ntransferrable WS$_2$ monolayer microcavity. Near the condensation threshold, we\nobserve a nonlinear increase in upper polariton intensity. This sharp increase\nin intensity is accompanied by a decrease of the linewidth and an increase of\nthe upper polariton temporal coherence, all of which are hallmarks of\nBose-Einstein condensation. By simulating the quantum Boltzmann equation, we\nshow that the upper polariton condensation only occurs for a particular range\nof particle density. We can attribute the creation of Bose condensation of the\nupper polariton to the following requirements: 1) the upper polariton is more\nexcitonic than the lower one; 2) there is relatively more pumping in the upper\nbranch; and 3) the conversion time from the upper to the lower polariton branch\nis long compared to the lifetime of the upper polaritons.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:07:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Xingzhou",""],["Alnatah","Hassan",""],["Mao","Danqun",""],["Xu","Mengyao",""],["Wan","Qiaochu",""],["Beaumariage","Jonathan",""],["Xie","Wei",""],["Xu","Hongxing",""],["Shi","Zhe-Yu",""],["Snoke","David",""],["Sun","Zheng",""],["Wu","Jian",""]]}
{"id":"2308.14957","submitter":"Xiaodong Zhao","authors":"Xiaodong Zhao","title":"The Manin-Peyre conjecture for three del Pezzo surfaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The Manin-Peyre conjecture is established for a split singular quintic del\nPezzo surface with singularity type $\\mathbf{A}_2$ and two split singular\nquartic del Pezzo surfaces with singularity types $\\mathbf{A}_3+\\mathbf{A}_1$\nand $\\mathbf{A}_4$ respectively. We use a unified and different slightly method\nfrom the previous and improve their error terms. Our method is general and can\nhandle most of singular del Pezzo surfaces of degree $d\\geq 3$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:12:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhao","Xiaodong",""]]}
{"id":"2308.14958","submitter":"Ismael Ben-Yelun","authors":"Ismael Ben-Yelun, Ahmet Oguzhan Yuksel, Fehmi Cirak","title":"Robust topology optimisation of lattice structures with spatially\n  correlated uncertainties","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The uncertainties in material and other properties of structures are usually\nspatially correlated. We introduce an efficient technique for representing and\nprocessing spatially correlated random fields in robust topology optimisation\nof lattice structures. Robust optimisation considers the statistics of the\nstructural response to obtain a design whose performance is less sensitive to\nthe specific realisation of the random field. We represent Gaussian random\nfields on lattices by leveraging the established link between random fields and\nstochastic partial differential equations (SPDEs). It is known that the\nprecision matrix, i.e. the inverse of the covariance matrix, of a random field\nwith Mat\\'ern covariance is equal to the finite element stiffness matrix of a\npossibly fractional PDE with a second-order elliptic operator. We consider the\ndiscretisation of the PDE on the lattice to obtain a random field which, by\ndesign, considers its geometry and connectivity. The so-obtained random field\ncan be interpreted as a physics-informed prior by the hypothesis that the\nelliptic SPDE models the physical processes occurring during manufacturing,\nlike heat and mass diffusion. Although the proposed approach is general, we\ndemonstrate its application to lattices modelled as pin-jointed trusses with\nuncertainties in member Young's moduli. We consider as a cost function the\nweighted sum of the expectation and standard deviation of the structural\ncompliance. To compute the expectation and standard deviation and their\ngradients with respect to member cross-sections we use a first-order Taylor\nseries approximation. The cost function and its gradient are computed using\nonly sparse matrix operations. We demonstrate the efficiency of the proposed\napproach using several lattice examples with isotropic, anisotropic and\nnon-stationary random fields and up to eighty thousand random and optimisation\nvariables.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:16:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ben-Yelun","Ismael",""],["Yuksel","Ahmet Oguzhan",""],["Cirak","Fehmi",""]]}
{"id":"2308.14959","submitter":"Glenn Shafer","authors":"Glenn Shafer","title":"Two ways game-theoretic probability can improve data analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  When testing a statistical hypothesis, is it legitimate to deliberate on the\nbasis of initial data about whether and how to collect further data?\nGame-theoretic probability's fundamental principle for testing by betting says\nyes, provided that you are testing by betting and do not risk more capital than\ninitially committed. Standard statistical theory uses Cournot's principle,\nwhich does not allow such optional continuation. Cournot's principle can be\nextended to allow optional continuation when testing is carried out by\nmultiplying likelihood ratios, but the extension lacks the simplicity and\ngenerality of testing by betting.\n  Game-theoretic probability can also help us with descriptive data analysis.\nTo obtain a purely and honestly descriptive analysis using competing\nprobability distributions, we have them bet against each other using the Kelly\nprinciple. The place of confidence intervals is then taken by a sets of\ndistributions that do relatively well in the competition. In the simplest\nimplementation, these sets coincide with R. A. Fisher's likelihood intervals.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:21:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shafer","Glenn",""]]}
{"id":"2308.14960","submitter":"Dongjun Lee","authors":"Dongjun Lee, Seokwon Song, Jihee Suh, Joonmyeong Choi, Sanghyeok Lee,\n  and Hyunwoo J.Kim","title":"Read-only Prompt Optimization for Vision-Language Few-shot Learning","comments":"Accepted at ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In recent years, prompt tuning has proven effective in adapting pre-trained\nvision-language models to downstream tasks. These methods aim to adapt the\npre-trained models by introducing learnable prompts while keeping pre-trained\nweights frozen. However, learnable prompts can affect the internal\nrepresentation within the self-attention module, which may negatively impact\nperformance variance and generalization, especially in data-deficient settings.\nTo address these issues, we propose a novel approach, Read-only Prompt\nOptimization (RPO). RPO leverages masked attention to prevent the internal\nrepresentation shift in the pre-trained model. Further, to facilitate the\noptimization of RPO, the read-only prompts are initialized based on special\ntokens of the pre-trained model. Our extensive experiments demonstrate that RPO\noutperforms CLIP and CoCoOp in base-to-new generalization and domain\ngeneralization while displaying better robustness. Also, the proposed method\nachieves better generalization on extremely data-deficient settings, while\nimproving parameter efficiency and computational overhead. Code is available at\nhttps://github.com/mlvlab/RPO.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:22:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lee","Dongjun",""],["Song","Seokwon",""],["Suh","Jihee",""],["Choi","Joonmyeong",""],["Lee","Sanghyeok",""],["Kim","Hyunwoo J.",""]]}
{"id":"2308.14961","submitter":"Beth Malmskog","authors":"Beth Malmskog and Na'ama Nevo","title":"Lower Rate Bounds for Hermitian-Lifted Codes for Odd Prime\n  Characteristic","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Locally recoverable codes are error correcting codes with the additional\nproperty that every symbol of any codeword can be recovered from a small set of\nother symbols. This property is particularly desirable in cloud storage\napplications. A locally recoverable code is said to have availability $t$ if\neach position has $t$ disjoint recovery sets. Hermitian-lifted codes are\nlocally recoverable codes with high availability first described by Lopez,\nMalmskog, Matthews, Pi\\~nero-Gonzales, and Wootters. The codes are based on the\nwell-known Hermitian curve and incorporate the novel technique of lifting to\nincrease the rate of the code. Lopez et al. lower bounded the rate of the codes\ndefined over fields with characteristic 2. This paper generalizes their work to\nshow that the rate of Hermitian-lifted codes is bounded below by a positive\nconstant depending on $p$ when $q=p^l$ for any odd prime $p$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:28:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Malmskog","Beth",""],["Nevo","Na'ama",""]]}
{"id":"2308.14962","submitter":"Benjamin Russo","authors":"Benjamin P. Russo, M. Paul Laiu, Richard Archibald","title":"Streaming Compression of Scientific Data via weak-SINDy","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper a streaming weak-SINDy algorithm is developed specifically for\ncompressing streaming scientific data. The production of scientific data,\neither via simulation or experiments, is undergoing an stage of exponential\ngrowth, which makes data compression important and often necessary for storing\nand utilizing large scientific data sets. As opposed to classical ``offline\"\ncompression algorithms that perform compression on a readily available data\nset, streaming compression algorithms compress data ``online\" while the data\ngenerated from simulation or experiments is still flowing through the system.\nThis feature makes streaming compression algorithms well-suited for scientific\ndata compression, where storing the full data set offline is often infeasible.\nThis work proposes a new streaming compression algorithm, streaming weak-SINDy,\nwhich takes advantage of the underlying data characteristics during\ncompression. The streaming weak-SINDy algorithm constructs feature matrices and\ntarget vectors in the online stage via a streaming integration method in a\nmemory efficient manner. The feature matrices and target vectors are then used\nin the offline stage to build a model through a regression process that aims to\nrecover equations that govern the evolution of the data. For compressing\nhigh-dimensional streaming data, we adopt a streaming proper orthogonal\ndecomposition (POD) process to reduce the data dimension and then use the\nstreaming weak-SINDy algorithm to compress the temporal data of the POD\nexpansion. We propose modifications to the streaming weak-SINDy algorithm to\naccommodate the dynamically updated POD basis. By combining the built model\nfrom the streaming weak-SINDy algorithm and a small amount of data samples, the\nfull data flow could be reconstructed accurately at a low memory cost, as shown\nin the numerical tests.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:29:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Russo","Benjamin P.",""],["Laiu","M. Paul",""],["Archibald","Richard",""]]}
{"id":"2308.14963","submitter":"Jimmy Lin","authors":"Jimmy Lin, Ronak Pradeep, Tommaso Teofili, Jasper Xian","title":"Vector Search with OpenAI Embeddings: Lucene Is All You Need","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We provide a reproducible, end-to-end demonstration of vector search with\nOpenAI embeddings using Lucene on the popular MS MARCO passage ranking test\ncollection. The main goal of our work is to challenge the prevailing narrative\nthat a dedicated vector store is necessary to take advantage of recent advances\nin deep neural networks as applied to search. Quite the contrary, we show that\nhierarchical navigable small-world network (HNSW) indexes in Lucene are\nadequate to provide vector search capabilities in a standard bi-encoder\narchitecture. This suggests that, from a simple cost-benefit analysis, there\ndoes not appear to be a compelling reason to introduce a dedicated vector store\ninto a modern \"AI stack\" for search, since such applications have already\nreceived substantial investments in existing, widely deployed infrastructure.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:30:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lin","Jimmy",""],["Pradeep","Ronak",""],["Teofili","Tommaso",""],["Xian","Jasper",""]]}
{"id":"2308.14964","submitter":"G. Christopher Hruska","authors":"G. Christopher Hruska and Kim Ruane","title":"Hyperbolic groups and local connectivity","comments":"Dedicated to Mike Mihalik on his 70th birthday. 14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this paper is to give an exposition of some results of\nBestvina-Mess on local connectivity of the boundary of a one-ended word\nhyperbolic group. We also give elementary proofs that all hyperbolic groups are\nsemistable at infinity and their boundaries are linearly connected in the\none-ended case. Geoghegan first observed that semistability at infinity is a\nconsequence of local connectivity using ideas from shape theory, and\nBonk-Kleiner proved linear connectivity using analytical methods. The methods\nin this paper are closely based on the original ideas of Bestvina-Mess.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:31:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hruska","G. Christopher",""],["Ruane","Kim",""]]}
{"id":"2308.14965","submitter":"Umar Khalid","authors":"Umar Khalid, Hasan Iqbal, Saeed Vahidian, Jing Hua, Chen Chen","title":"CEFHRI: A Communication Efficient Federated Learning Framework for\n  Recognizing Industrial Human-Robot Interaction","comments":"Accepted in IROS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Human-robot interaction (HRI) is a rapidly growing field that encompasses\nsocial and industrial applications. Machine learning plays a vital role in\nindustrial HRI by enhancing the adaptability and autonomy of robots in complex\nenvironments. However, data privacy is a crucial concern in the interaction\nbetween humans and robots, as companies need to protect sensitive data while\nmachine learning algorithms require access to large datasets. Federated\nLearning (FL) offers a solution by enabling the distributed training of models\nwithout sharing raw data. Despite extensive research on Federated learning (FL)\nfor tasks such as natural language processing (NLP) and image classification,\nthe question of how to use FL for HRI remains an open research problem. The\ntraditional FL approach involves transmitting large neural network parameter\nmatrices between the server and clients, which can lead to high communication\ncosts and often becomes a bottleneck in FL. This paper proposes a\ncommunication-efficient FL framework for human-robot interaction (CEFHRI) to\naddress the challenges of data heterogeneity and communication costs. The\nframework leverages pre-trained models and introduces a trainable\nspatiotemporal adapter for video understanding tasks in HRI. Experimental\nresults on three human-robot interaction benchmark datasets: HRI30, InHARD, and\nCOIN demonstrate the superiority of CEFHRI over full fine-tuning in terms of\ncommunication costs. The proposed methodology provides a secure and efficient\napproach to HRI federated learning, particularly in industrial environments\nwith data privacy concerns and limited communication bandwidth. Our code is\navailable at\nhttps://github.com/umarkhalidAI/CEFHRI-Efficient-Federated-Learning.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:34:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Khalid","Umar",""],["Iqbal","Hasan",""],["Vahidian","Saeed",""],["Hua","Jing",""],["Chen","Chen",""]]}
{"id":"2308.14966","submitter":"Andres Larrain-Hubach","authors":"Andres Larrain Hubach","title":"Asymptotics of a Modified Holomorphic Analytic Torsion","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove a formula for the leading term of the asymptotic expansion of the\nholomorphic analytic torsion of the Dirac operator modified by the Clifford\naction of a real three-form.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:36:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hubach","Andres Larrain",""]]}
{"id":"2308.14967","submitter":"Hongxuan Jiang","authors":"Hong-Xuan Jiang, Xue-Wen Liu","title":"A Model for Type-IIP Supernovae with Medium Recombination Approximation","comments":"14 pages, 10 figures, 5 tables. Submitted to ApJ, welcome for\n  comments!","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a new light-curve model for Type-IIP supernovae\n(SNe IIP) with an approximation of medium recombination. Recombination of\nhydrogen that takes place in the envelope is believed highly affect the light\ncurves of SNe IIP. The propagation of the recombination wave through the\nexpanding envelope is crucial to determine the temperature and the bolometric\nluminosity. Several approximations were made in previous works to determine the\nrecombination front, which plays a role as the pseudo-photosphere. With the\nEddington boundary condition, we let the actual photosphere be the boundary to\ndetermine the time evolution of temperature profile of the envelope and\ncalculate the bolometric luminosity. A new approximation on the speed of\nrecombination wave is introduced to get a closer result to the real situation.\nWe abandon the non-self-consistent approximations made in former works and\nsolve the initial hump problem in the previous attempt for the slow\nrecombination approximation. The produced light curves show the necessity of\nthis approximation and fit the observation well.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:44:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jiang","Hong-Xuan",""],["Liu","Xue-Wen",""]]}
{"id":"2308.14968","submitter":"Jiangui Chen","authors":"Jiangui Chen, Ruqing Zhang, Jiafeng Guo, Maarten de Rijke, Wei Chen,\n  Yixing Fan, Xueqi Cheng","title":"Continual Learning for Generative Retrieval over Dynamic Corpora","comments":"Accepted by CIKM 2023","journal-ref":null,"doi":"10.1145/3583780.3614821","report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Generative retrieval (GR) directly predicts the identifiers of relevant\ndocuments (i.e., docids) based on a parametric model. It has achieved solid\nperformance on many ad-hoc retrieval tasks. So far, these tasks have assumed a\nstatic document collection. In many practical scenarios, however, document\ncollections are dynamic, where new documents are continuously added to the\ncorpus. The ability to incrementally index new documents while preserving the\nability to answer queries with both previously and newly indexed relevant\ndocuments is vital to applying GR models. In this paper, we address this\npractical continual learning problem for GR. We put forward a novel\nContinual-LEarner for generatiVE Retrieval (CLEVER) model and make two major\ncontributions to continual learning for GR: (i) To encode new documents into\ndocids with low computational cost, we present Incremental Product\nQuantization, which updates a partial quantization codebook according to two\nadaptive thresholds; and (ii) To memorize new documents for querying without\nforgetting previous knowledge, we propose a memory-augmented learning\nmechanism, to form meaningful connections between old and new documents.\nEmpirical results demonstrate the effectiveness and efficiency of the proposed\nmodel.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:46:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Jiangui",""],["Zhang","Ruqing",""],["Guo","Jiafeng",""],["de Rijke","Maarten",""],["Chen","Wei",""],["Fan","Yixing",""],["Cheng","Xueqi",""]]}
{"id":"2308.14969","submitter":"Diganta Misra","authors":"Diganta Misra, Agam Goyal, Bharat Runwal, Pin Yu Chen","title":"Reprogramming under constraints: Revisiting efficient and reliable\n  transferability of lottery tickets","comments":"Preprint","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the era of foundation models with huge pre-training budgets, the\ndownstream tasks have been shifted to the narrative of efficient and fast\nadaptation. For classification-based tasks in the domain of computer vision,\nthe two most efficient approaches have been linear probing (LP) and visual\nprompting/reprogramming (VP); the former aims to learn a classifier in the form\nof a linear head on the features extracted by the pre-trained model, while the\nlatter maps the input data to the domain of the source data on which the model\nwas originally pre-trained on. Although extensive studies have demonstrated the\ndifferences between LP and VP in terms of downstream performance, we explore\nthe capabilities of the two aforementioned methods via the sparsity axis: (a)\nData sparsity: the impact of few-shot adaptation and (b) Model sparsity: the\nimpact of lottery tickets (LT). We demonstrate that LT are not universal\nreprogrammers, i.e., for certain target datasets, reprogramming an LT yields\nsignificantly lower performance than the reprogrammed dense model although\ntheir corresponding upstream performance is similar. Further, we demonstrate\nthat the calibration of dense models is always superior to that of their\nlottery ticket counterparts under both LP and VP regimes. Our empirical study\nopens a new avenue of research into VP for sparse models and encourages further\nunderstanding of the performance beyond the accuracy achieved by VP under\nconstraints of sparsity. Code and logs can be accessed at\n\\url{https://github.com/landskape-ai/Reprogram_LT}.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:47:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Misra","Diganta",""],["Goyal","Agam",""],["Runwal","Bharat",""],["Chen","Pin Yu",""]]}
{"id":"2308.14970","submitter":"Jiangyan Yi","authors":"Jiangyan Yi, Chenglong Wang, Jianhua Tao, Xiaohui Zhang, Chu Yuan\n  Zhang and Yan Zhao","title":"Audio Deepfake Detection: A Survey","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Audio deepfake detection is an emerging active topic. A growing number of\nliteratures have aimed to study deepfake detection algorithms and achieved\neffective performance, the problem of which is far from being solved. Although\nthere are some review literatures, there has been no comprehensive survey that\nprovides researchers with a systematic overview of these developments with a\nunified evaluation. Accordingly, in this survey paper, we first highlight the\nkey differences across various types of deepfake audio, then outline and\nanalyse competitions, datasets, features, classifications, and evaluation of\nstate-of-the-art approaches. For each aspect, the basic techniques, advanced\ndevelopments and major challenges are discussed. In addition, we perform a\nunified comparison of representative features and classifiers on ASVspoof 2021,\nADD 2023 and In-the-Wild datasets for audio deepfake detection, respectively.\nThe survey shows that future research should address the lack of large scale\ndatasets in the wild, poor generalization of existing detection methods to\nunknown fake attacks, as well as interpretability of detection results.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:50:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yi","Jiangyan",""],["Wang","Chenglong",""],["Tao","Jianhua",""],["Zhang","Xiaohui",""],["Zhang","Chu Yuan",""],["Zhao","Yan",""]]}
{"id":"2308.14971","submitter":"Jigang Kim","authors":"Jigang Kim, Dohyun Jang, H. Jin Kim","title":"Distributed multi-agent target search and tracking with Gaussian process\n  and reinforcement learning","comments":"10 pages, 6 figures; preprint submitted to IJCAS; first two authors\n  contributed equally","journal-ref":"International Journal of Control, Automation, and Systems 2023\n  21(9): 3057-3067","doi":"10.1007/s12555-022-0555-0","report-no":null,"categories":"cs.RO cs.LG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Deploying multiple robots for target search and tracking has many practical\napplications, yet the challenge of planning over unknown or partially known\ntargets remains difficult to address. With recent advances in deep learning,\nintelligent control techniques such as reinforcement learning have enabled\nagents to learn autonomously from environment interactions with little to no\nprior knowledge. Such methods can address the exploration-exploitation tradeoff\nof planning over unknown targets in a data-driven manner, eliminating the\nreliance on heuristics typical of traditional approaches and streamlining the\ndecision-making pipeline with end-to-end training. In this paper, we propose a\nmulti-agent reinforcement learning technique with target map building based on\ndistributed Gaussian process. We leverage the distributed Gaussian process to\nencode belief over the target locations and efficiently plan over unknown\ntargets. We evaluate the performance and transferability of the trained policy\nin simulation and demonstrate the method on a swarm of micro unmanned aerial\nvehicles with hardware experiments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:53:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kim","Jigang",""],["Jang","Dohyun",""],["Kim","H. Jin",""]]}
{"id":"2308.14972","submitter":"Yaonan Zhu","authors":"Haokun Liu, Yaonan Zhu, Kenji Kato, Izumi Kondo, Tadayoshi Aoyama, and\n  Yasuhisa Hasegawa","title":"LLM-Based Human-Robot Collaboration Framework for Manipulation Tasks","comments":"IEEE MHS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper presents a novel approach to enhance autonomous robotic\nmanipulation using the Large Language Model (LLM) for logical inference,\nconverting high-level language commands into sequences of executable motion\nfunctions. The proposed system combines the advantage of LLM with YOLO-based\nenvironmental perception to enable robots to autonomously make reasonable\ndecisions and task planning based on the given commands. Additionally, to\naddress the potential inaccuracies or illogical actions arising from LLM, a\ncombination of teleoperation and Dynamic Movement Primitives (DMP) is employed\nfor action correction. This integration aims to improve the practicality and\ngeneralizability of the LLM-based human-robot collaboration system.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 01:54:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Haokun",""],["Zhu","Yaonan",""],["Kato","Kenji",""],["Kondo","Izumi",""],["Aoyama","Tadayoshi",""],["Hasegawa","Yasuhisa",""]]}
{"id":"2308.14973","submitter":"PanPan Wang","authors":"Weisheng Huang, Pan-Pan Wang, Yu-Jie Tan and Cheng-Gang Shao","title":"Revisitation of algebraic approach for time delay interferometry","comments":"accepted by Physical Review D","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time Delay Interferometry (TDI) is often utilized in the data pre-processing\nof space-based gravitational wave detectors, primarily for suppressing laser\nfrequency noise. About twenty years ago, assuming armlengths remain constant\nover time, researchers presented comprehensive mathematical descriptions for\nthe first-generation and modified first-generation TDI. However, maintaining a\nsteady distance between satellites is pragmatically challenging. Hence, the\noperator equation that neutralizes laser frequency noise, though provided, was\ndeemed difficult to resolve. In this paper, we solve this equation in the\ncontext of a non-static scenario where distances between spacecrafts vary over\ntime. Surprisingly, contrary to what previous researchers thought, the study\nreveals that the equation has only the zero solution, which suggests that no\nnonzero TDI combination can entirely suppress laser frequency noise under\ntime-varying armlengths. This necessitates the persistent search for\nsecond-generation TDI combinations through alternative methods besides directly\nsolving the operator equation. We establish the connections between TDI\ncombinations of different generations and propose a search strategy for finding\nhigher-generation TDI combinations by using generators of lower-generation TDI.\nThe findings contribute to the ongoing discussion on gravitational waves and\nprovide a novel insight into the hurdles faced in space-based gravitational\nwave detection.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:00:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Weisheng",""],["Wang","Pan-Pan",""],["Tan","Yu-Jie",""],["Shao","Cheng-Gang",""]]}
{"id":"2308.14974","submitter":"Manar Alalfi","authors":"Jian Chen, Manar H. Alalfi, Thomas R. Dean, Ramesh S","title":"SimSched: A tool for Simulating Autosar Implementaion in Simulink","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  AUTOSAR (AUTomotive Open System ARchitecture) is an open industry standard\nfor the automotive sector. It defines the three-layered automotive software\narchitecture. One of these layers is the application layer, where functional\nbehaviors are encapsulated in Software Components (SW-Cs). Inside SW-Cs, a set\nof runnable entities represents the internal behavior and is realized as a set\nof tasks. To address AUTOSAR's lack of support for modeling behaviors of\nrunnables, languages such as Simulink are employed. Simulink simulations assume\nSimulink block behaviors are completed in zero execution time, while real\nexecution requires a finite execution time. This timing mismatch can result in\nfailures to detect unexpected runtime behaviors during the simulation phase.\nThis paper extends the Simulink environment to model the timing properties of\ntasks. We present a Simulink block that can schedule tasks with non-zero\nsimulation times. It enables a more realistic analysis during model\ndevelopment.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:02:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Jian",""],["Alalfi","Manar H.",""],["Dean","Thomas R.",""],["S","Ramesh",""]]}
{"id":"2308.14975","submitter":"Hiwa Ahmed","authors":"Hiwa A. Ahmed, Yidian Chen, Mei Huang","title":"The electromagnetic form factors in the $N_{f}=4$ holographic QCD","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this study, we employ a modified soft-wall holographic model with four\nflavors to investigate the meson spectra, decay constants, electromagnetic form\nfactors, and charge radius of various mesons. We obtain the spectra for vector,\naxial vector, and pseudoscalar mesons. Decay constants are calculated and\ncompared with experimental and lattice QCD data. The pion and kaon\nelectromagnetic form factors are compared with the experimental data, and a\ngood agreement is achieved for the kaon at low $Q^{2}$. For the charmed mesons,\nthe electromagnetic form factors of the $D$ and $D_{s}$ and electric form\nfactors of the $D^{*}$ and $D_{s}^{*}$ are well consistent with the lattice QCD\ndata. Moreover, the electric, magnetic, and quadrupole form factors are\npredicted for the $\\rho$, $K^{*}$, $a_1$, $K_1$, $D_1$, and $D_{s1}$ mesons.\nFurthermore, the charge radius of the vector, axial vector, and pseudoscalars,\nincluding the strange and charmed mesons, are computed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:02:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ahmed","Hiwa A.",""],["Chen","Yidian",""],["Huang","Mei",""]]}
{"id":"2308.14976","submitter":"Subhamoy Chatterjee","authors":"Subhamoy Chatterjee, Andr\\'es Mu\\~noz-Jaramillo, and Derek A. Lamb","title":"Efficient labeling of solar flux evolution videos by a deep learning\n  model","comments":"16 pages, 7 figures, published in Nature Astronomy, June 27, 2022","journal-ref":"Nat.Astron.6(2022)796-803","doi":"10.1038/s41550-022-01701-3","report-no":null,"categories":"astro-ph.SR astro-ph.IM cs.AI cs.LG eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Machine learning (ML) is becoming a critical tool for interrogation of large\ncomplex data. Labeling, defined as the process of adding meaningful\nannotations, is a crucial step of supervised ML. However, labeling datasets is\ntime consuming. Here we show that convolutional neural networks (CNNs), trained\non crudely labeled astronomical videos, can be leveraged to improve the quality\nof data labeling and reduce the need for human intervention. We use videos of\nthe solar magnetic field, crudely labeled into two classes: emergence or\nnon-emergence of bipolar magnetic regions (BMRs), based on their first\ndetection on the solar disk. We train CNNs using crude labels, manually verify,\ncorrect labeling vs. CNN disagreements, and repeat this process until\nconvergence. Traditionally, flux emergence labelling is done manually. We find\nthat a high-quality labeled dataset, derived through this iterative process,\nreduces the necessary manual verification by 50%. Furthermore, by gradually\nmasking the videos and looking for maximum change in CNN inference, we locate\nBMR emergence time without retraining the CNN. This demonstrates the\nversatility of CNNs for simplifying the challenging task of labeling complex\ndynamic events.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:05:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chatterjee","Subhamoy",""],["Mu\u00f1oz-Jaramillo","Andr\u00e9s",""],["Lamb","Derek A.",""]]}
{"id":"2308.14977","submitter":"Shaojie Hu","authors":"Shuhan Liu, Shaojie Hu, Xiaomin Cui, Takashi Kimura","title":"Efficient thermo-spin conversion in van der Waals ferromagnet FeGaTe","comments":"26 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recent discovery of 2D van der Waals (vdW) magnetic materials has spurred\nprogress in developing advanced spintronic devices. A central challenge lies in\nenhancing the spin-conversion efficiency for building spin-logic or spin-memory\ndevices. We systematically investigated the anomalous Hall effect and anomalous\nNernst effect in above-room-temperature van der Waals ferromagnet FeGaTe with\nperpendicular anisotropy, uncovering significant spin-conversion effects. The\nanomalous Hall effect demonstrated an efficient electric spin-charge\nconversion, with a notable spin Hall angle of 6 $\\%$ - 10.38 $\\%$. The\ntemperature-dependent behavior of the anomalous Nernst voltage primarily\nresults from the thermo-spin conversion. Uniquely, we have experimentally\nachieved thermo-spin polarization values of over 690 $\\%$ at room temperature\nand extremely large of 4690 $\\%$ at about 93 K. This study illuminates the\npotential of vdW ferromagnets in advancing efficient spin conversion devices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:06:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Shuhan",""],["Hu","Shaojie",""],["Cui","Xiaomin",""],["Kimura","Takashi",""]]}
{"id":"2308.14978","submitter":"Cheng Da","authors":"Cheng Da, Chuwei Luo, Qi Zheng, Cong Yao","title":"Vision Grid Transformer for Document Layout Analysis","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Document pre-trained models and grid-based models have proven to be very\neffective on various tasks in Document AI. However, for the document layout\nanalysis (DLA) task, existing document pre-trained models, even those\npre-trained in a multi-modal fashion, usually rely on either textual features\nor visual features. Grid-based models for DLA are multi-modality but largely\nneglect the effect of pre-training. To fully leverage multi-modal information\nand exploit pre-training techniques to learn better representation for DLA, in\nthis paper, we present VGT, a two-stream Vision Grid Transformer, in which Grid\nTransformer (GiT) is proposed and pre-trained for 2D token-level and\nsegment-level semantic understanding. Furthermore, a new dataset named D$^4$LA,\nwhich is so far the most diverse and detailed manually-annotated benchmark for\ndocument layout analysis, is curated and released. Experiment results have\nillustrated that the proposed VGT model achieves new state-of-the-art results\non DLA tasks, e.g. PubLayNet ($95.7\\%$$\\rightarrow$$96.2\\%$), DocBank\n($79.6\\%$$\\rightarrow$$84.1\\%$), and D$^4$LA ($67.7\\%$$\\rightarrow$$68.8\\%$).\nThe code and models as well as the D$^4$LA dataset will be made publicly\navailable ~\\url{https://github.com/AlibabaResearch/AdvancedLiterateMachinery}.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:09:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Da","Cheng",""],["Luo","Chuwei",""],["Zheng","Qi",""],["Yao","Cong",""]]}
{"id":"2308.14979","submitter":"Shunsuke Tada","authors":"Toshitaka Aoki and Emerson G. Escolar and Shunsuke Tada","title":"Summand-injectivity of interval covers and monotonicity of interval\n  resolution global dimensions","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RT math.AT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Recently, there is growing interest in the use of relative homology algebra\nto develop invariants using interval covers and interval resolutions (i.e.,\nright minimal approximations and resolutions relative to interval-decomposable\nmodules) for multi-parameter persistence modules. In this paper, the set of all\ninterval modules over a given poset plays a central role. Firstly, we show that\nthe restriction of interval covers of modules to each indecomposable direct\nsummand is injective. This result suggests a way to simplify the computation of\ninterval covers. Secondly, we show the monotonicity of the interval resolution\nglobal dimension, i.e., if $Q$ is a full subposet of $P$, then the interval\nresolution global dimension of $Q$ is not larger than that of $P$. Finally, we\nprovide a complete classification of posets whose interval resolution global\ndimension is zero.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:13:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Aoki","Toshitaka",""],["Escolar","Emerson G.",""],["Tada","Shunsuke",""]]}
{"id":"2308.14980","submitter":"Maximilian Hecht","authors":"Maximilian Hecht, Verena Heidrich-Meisner, Lars Berger, and Robert F.\n  Wimmer-Schweingruber","title":"Scope and limitations of ad hoc neural network reconstructions of solar\n  wind parameters","comments":null,"journal-ref":null,"doi":"10.1051/0004-6361/202346714","report-no":null,"categories":"astro-ph.SR physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar wind properties are determined by the conditions of their solar source\nregion and transport history. Solar wind parameters, such as proton speed,\nproton density, proton temperature, magnetic field strength, and the charge\nstate composition of oxygen, are used as proxies to investigate the solar\nsource region of the solar wind. The transport and conditions in the solar\nsource region affect several solar wind parameters simultaneously. The observed\nredundancy could be caused by a set of hidden variables. We test this\nassumption by determining how well a function of four of the selected solar\nwind parameters can model the fifth solar wind parameter. If such a function\nprovided a perfect model, then this solar wind parameter would be uniquely\ndetermined from hidden variables of the other four parameters. We used a neural\nnetwork as a function approximator to model unknown relations between the\nconsidered solar wind parameters. This approach is applied to solar wind data\nfrom the Advanced Composition Explorer (ACE). The neural network\nreconstructions are evaluated in comparison to observations. Within the limits\ndefined by the measurement uncertainties, the proton density and proton\ntemperature can be reconstructed well. We also found that the reconstruction is\nmost difficult for solar wind streams preceding and following stream\ninterfaces. For all considered solar wind parameters, but in particular the\nproton density, temperature, and the oxygen charge-state ratio, parameter\nreconstruction is hindered by measurement uncertainties. The reconstruction\naccuracy of sector reversal plasma is noticeably lower than that of streamer\nbelt or coronal hole plasma. The fact that the oxygen charge-state ratio, a\nnon-transport-affected property, is difficult to reconstruct may imply that\nrecovering source-specific information from the transport-affected proton\nplasma properties is challenging.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:14:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hecht","Maximilian",""],["Heidrich-Meisner","Verena",""],["Berger","Lars",""],["Wimmer-Schweingruber","Robert F.",""]]}
{"id":"2308.14981","submitter":"Lirand\\\"e Pira","authors":"Gal Weitz, Lirand\\\"e Pira, Chris Ferrie, Joshua Combes","title":"Sub-universal variational circuits for combinatorial optimization\n  problems","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum variational circuits have gained significant attention due to their\napplications in the quantum approximate optimization algorithm and quantum\nmachine learning research. This work introduces a novel class of classical\nprobabilistic circuits designed for generating approximate solutions to\ncombinatorial optimization problems constructed using two-bit stochastic\nmatrices. Through a numerical study, we investigate the performance of our\nproposed variational circuits in solving the Max-Cut problem on various graphs\nof increasing sizes. Our classical algorithm demonstrates improved performance\nfor several graph types to the quantum approximate optimization algorithm. Our\nfindings suggest that evaluating the performance of quantum variational\ncircuits against variational circuits with sub-universal gate sets is a\nvaluable benchmark for identifying areas where quantum variational circuits can\nexcel.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:16:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Weitz","Gal",""],["Pira","Lirand\u00eb",""],["Ferrie","Chris",""],["Combes","Joshua",""]]}
{"id":"2308.14982","submitter":"B.N. Kausik","authors":"B. N. Kausik","title":"Cognitive Aging and Labor Share","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Labor share, the fraction of economic output accrued as wages, is\ninexplicably declining in industrialized countries. Whilst numerous prior works\nattempt to explain the decline via economic factors, our novel approach links\nthe decline to biological factors. Specifically, we propose a theoretical\nmacroeconomic model where labor share reflects a dynamic equilibrium between\nthe workforce automating existing outputs, and consumers demanding new output\nvariants that require human labor. Industrialization leads to an aging\npopulation, and while cognitive performance is stable in the working years it\ndrops sharply thereafter. Consequently, the declining cognitive performance of\naging consumers reduces the demand for new output variants, leading to a\ndecline in labor share. Our model expresses labor share as an algebraic\nfunction of median age, and is validated with surprising accuracy on historical\ndata across industrialized economies via non-linear stochastic regression.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:20:10 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:35:41 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Kausik","B. N.",""]]}
{"id":"2308.14983","submitter":"Jiang Liu","authors":"Jiang Liu and Wei Dai","title":"Constructive Incremental Learning for Fault Diagnosis of Rolling\n  Bearings with Ensemble Domain Adaptation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG eess.SP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Given the prevalence of rolling bearing fault diagnosis as a practical issue\nacross various working conditions, the limited availability of samples\ncompounds the challenge. Additionally, the complexity of the external\nenvironment and the structure of rolling bearings often manifests faults\ncharacterized by randomness and fuzziness, hindering the effective extraction\nof fault characteristics and restricting the accuracy of fault diagnosis. To\novercome these problems, this paper presents a novel approach termed\nconstructive Incremental learning-based ensemble domain adaptation (CIL-EDA)\napproach. Specifically, it is implemented on stochastic configuration networks\n(SCN) to constructively improve its adaptive performance in multi-domains.\nConcretely, a cloud feature extraction method is employed in conjunction with\nwavelet packet decomposition (WPD) to capture the uncertainty of fault\ninformation from multiple resolution aspects. Subsequently, constructive\nIncremental learning-based domain adaptation (CIL-DA) is firstly developed to\nenhance the cross-domain learning capability of each hidden node through domain\nmatching and construct a robust fault classifier by leveraging limited labeled\ndata from both target and source domains. Finally, fault diagnosis results are\nobtained by a majority voting of CIL-EDA which integrates CIL-DA and parallel\nensemble learning. Experimental results demonstrate that our CIL-DA outperforms\nseveral domain adaptation methods and CIL-EDA consistently outperforms\nstate-of-art fault diagnosis methods in few-shot scenarios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:23:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Jiang",""],["Dai","Wei",""]]}
{"id":"2308.14984","submitter":"Joohwan Seo","authors":"Joohwan Seo, Nikhil Potu Surya Prakash, Xiang Zhang, Changhao Wang,\n  Jongeun Choi, Masayoshi Tomizuka, Roberto Horowitz","title":"Robot Manipulation Task Learning by Leveraging SE(3) Group Invariance\n  and Equivariance","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.SY eess.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper presents a differential geometric control approach that leverages\nSE(3) group invariance and equivariance to increase transferability in learning\nrobot manipulation tasks that involve interaction with the environment.\nSpecifically, we employ a control law and a learning representation framework\nthat remain invariant under arbitrary SE(3) transformations of the manipulation\ntask definition. Furthermore, the control law and learning representation\nframework are shown to be SE(3) equivariant when represented relative to the\nspatial frame. The proposed approach is based on utilizing a recently presented\ngeometric impedance control (GIC) combined with a learning variable impedance\ncontrol framework, where the gain scheduling policy is trained in a supervised\nlearning fashion from expert demonstrations. A geometrically consistent error\nvector (GCEV) is fed to a neural network to achieve a gain scheduling policy\nthat remains invariant to arbitrary translation and rotations. A comparison of\nour proposed control and learning framework with a well-known Cartesian space\nlearning impedance control, equipped with a Cartesian error vector-based gain\nscheduling policy, confirms the significantly superior learning transferability\nof our proposed approach. A hardware implementation on a peg-in-hole task is\nconducted to validate the learning transferability and feasibility of the\nproposed approach.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:27:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Seo","Joohwan",""],["Prakash","Nikhil Potu Surya",""],["Zhang","Xiang",""],["Wang","Changhao",""],["Choi","Jongeun",""],["Tomizuka","Masayoshi",""],["Horowitz","Roberto",""]]}
{"id":"2308.14985","submitter":"Hongzhe Yu","authors":"Hongzhe Yu and Yongxin Chen","title":"Stochastic Motion Planning as Gaussian Variational Inference: Theory and\n  Algorithms","comments":"19 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the motion planning problem under uncertainty and address it\nusing probabilistic inference. A collision-free motion plan with linear\nstochastic dynamics is modeled by a posterior distribution. Gaussian\nvariational inference is an optimization over the path distributions to infer\nthis posterior within the scope of Gaussian distributions. We propose Gaussian\nVariational Inference Motion Planner (GVI-MP) algorithm to solve this Gaussian\ninference, where a natural gradient paradigm is used to iteratively update the\nGaussian distribution, and the factorized structure of the joint distribution\nis leveraged. We show that the direct optimization over the state distributions\nin GVI-MP is equivalent to solving a stochastic control that has a closed-form\nsolution. Starting from this observation, we propose our second algorithm,\nProximal Gradient Covariance Steering Motion Planner (PGCS-MP), to solve the\nsame inference problem in its stochastic control form with terminal\nconstraints. We use a proximal gradient paradigm to solve the linear stochastic\ncontrol with nonlinear collision cost, where the nonlinear cost is iteratively\napproximated using quadratic functions and a closed-form solution can be\nobtained by solving a linear covariance steering at each iteration. We evaluate\nthe effectiveness and the performance of the proposed approaches through\nextensive experiments on various robot models. The code for this paper can be\nfound in https://github.com/hzyu17/VIMP.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:31:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yu","Hongzhe",""],["Chen","Yongxin",""]]}
{"id":"2308.14986","submitter":"Giacomo Fragione","authors":"Giacomo Fragione, Fabio Pacucci","title":"Constraining the Properties of Black Hole Seeds from the Farthest\n  Quasars","comments":"7 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Over 60 years after the discovery of the first quasar, more than $275$ such\nsources are identified in the epoch of reionization at $z>6$. JWST is now\nexploring higher redshifts ($z\\gtrsim 8$) and lower mass ($\\lesssim 10^7\nM_\\odot$) ranges. The discovery of progressively farther quasars is\ninstrumental to constraining the properties of the first population of black\nholes (BHs), or BH seeds, formed at $z \\sim 20-30$. For the first time, we use\nBayesian analysis of the most comprehensive catalog of quasars at $z>6$ to\nconstrain the distribution of BH seeds. We demonstrate that the mass\ndistribution of BH seeds can be effectively described by combining a power law\nand a lognormal function tailored to the mass ranges associated with light and\nheavy seeds. The inferred values of the Eddington ratio, the duty cycle, and\nthe mean radiative efficiency are $0.82^{+0.10}_{-0.10}$,\n$0.66^{+0.23}_{-0.23}$, and $0.06^{+0.02}_{-0.02}$, respectively. In summary,\nthe population of BHs that formed the detected quasars accreted, on average, at\n$\\sim 80\\%$ Eddington for $\\sim2/3$ of the available time. Our analysis reveals\na power-law slope of $-0.70^{+0.46}_{-0.46}$ and a lognormal mean of\n$4.44^{+0.30}_{-0.30}$. Models that solely incorporate a power law or a\nlognormal distribution within the specific mass range corresponding to light\nand heavy seeds are statistically strongly disfavored. Our results suggest that\nincluding both components is necessary to comprehensively account for the\nmasses of high-redshift quasars. Hence, we argue that both light and heavy\nseeds formed in the early Universe and grew to form the population of quasars\nwe observe.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:33:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fragione","Giacomo",""],["Pacucci","Fabio",""]]}
{"id":"2308.14987","submitter":"Nicholas Cavenagh","authors":"Nicholas Cavenagh and Ra\\'ul Falc\\'on","title":"Latin bitrades derived from quasigroup autoparatopisms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 2008, Cavenagh and Dr\\'{a}pal, et al, described a method of constructing\nLatin trades using groups. The Latin trades that arise from this construction\nare entry-transitive (that is, there always exists an autoparatopism of the\nLatin trade mapping any ordered triple to any other ordered triple). Moreover,\nuseful properties of the Latin trade can be established using properties of the\ngroup. However, the construction does not give a direct embedding of the Latin\ntrade into any particular Latin square. In this paper, we generalize the above\nto construct Latin trades embedded in a Latin square $L$, via the\nautoparatopism group of the quasigroup with Cayley table $L$. We apply this\ntheory to identify non-trivial entry-transitive trades in some group operation\ntables as well as in Latin squares that arise from quadratic orthomorphisms\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:33:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cavenagh","Nicholas",""],["Falc\u00f3n","Ra\u00fal",""]]}
{"id":"2308.14988","submitter":"Jikai Hou","authors":"Sohom Bhattacharya, Jianqing Fan, Jikai Hou","title":"Inferences on Mixing Probabilities and Ranking in Mixed-Membership\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.ST stat.ME stat.ML stat.TH","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Network data is prevalent in numerous big data applications including\neconomics and health networks where it is of prime importance to understand the\nlatent structure of network. In this paper, we model the network using the\nDegree-Corrected Mixed Membership (DCMM) model. In DCMM model, for each node\n$i$, there exists a membership vector $\\boldsymbol{\\pi}_ i =\n(\\boldsymbol{\\pi}_i(1), \\boldsymbol{\\pi}_i(2),\\ldots, \\boldsymbol{\\pi}_i(K))$,\nwhere $\\boldsymbol{\\pi}_i(k)$ denotes the weight that node $i$ puts in\ncommunity $k$. We derive novel finite-sample expansion for the\n$\\boldsymbol{\\pi}_i(k)$s which allows us to obtain asymptotic distributions and\nconfidence interval of the membership mixing probabilities and other related\npopulation quantities. This fills an important gap on uncertainty\nquantification on the membership profile. We further develop a ranking scheme\nof the vertices based on the membership mixing probabilities on certain\ncommunities and perform relevant statistical inferences. A multiplier bootstrap\nmethod is proposed for ranking inference of individual member's profile with\nrespect to a given community. The validity of our theoretical results is\nfurther demonstrated by via numerical experiments in both real and synthetic\ndata examples.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:35:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bhattacharya","Sohom",""],["Fan","Jianqing",""],["Hou","Jikai",""]]}
{"id":"2308.14989","submitter":"Di Feng","authors":"Di Feng","title":"Efficiency in Multiple-Type Housing Markets","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider multiple-type housing markets (Moulin, 1995), which extend\nShapley-Scarf housing markets (Shapley and Scarf, 1974) from one dimension to\nhigher dimensions. In this model, Pareto efficiency is incompatible with\nindividual rationality and strategy-proofness (Konishi et al., 2001).\nTherefore, we consider two weaker efficiency properties: coordinatewise\nefficiency and pairwise efficiency. We show that these two properties both (i)\nare compatible with individual rationality and strategy-proofness, and (ii)\nhelp us to identify two specific mechanisms. To be more precise, on various\ndomains of preference profiles, together with other well-studied properties\n(individual rationality, strategy-proofness, and non-bossiness), coordinatewise\nefficiency and pairwise efficiency respectively characterize two extensions of\nthe top-trading-cycles mechanism (TTC): the coordinatewise top-trading-cycles\nmechanism (cTTC) and the bundle top-trading-cycles mechanism (bTTC). Moreover,\nwe propose several variations of our efficiency properties, and we find that\neach of them is either satisfied by cTTC or bTTC, or leads to an impossibility\nresult (together with individual rationality and strategy-proofness).\nTherefore, our characterizations can be primarily interpreted as a\ncompatibility test: any reasonable efficiency property that is not satisfied by\ncTTC or bTTC could be considered incompatible with individual rationality and\nstrategy-proofness. For multiple-type housing markets with strict preferences,\nour characterization of bTTC constitutes the first characterization of an\nextension of the prominent TTC mechanism\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:38:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Feng","Di",""]]}
{"id":"2308.14990","submitter":"Mahdi Ghafariasl","authors":"Mahdi Ghafariasl, Tianyi Zhang, Zachary D. Ward, Da Zhou, David\n  Sanchez, Venkataraman Swaminathan, Humberto Terrones, Mauricio Terrones,\n  Yohannes Abate","title":"Sulfur Vacancy Related Optical Transitions in Graded Alloys of MoxW1-xS2\n  Monolayers","comments":"65 pages, 7 figures in main text. 21 figures in supplemental data","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Engineering the electronic bandgap is of utmost importance in diverse domains\nranging from information processing and communication technology to sensing and\nrenewable energy applications. Transition metal dichalcogenides (TMDCs) provide\nan ideal platform for achieving this goal through techniques including\nalloying, doping, and creating in-plane or out-of-plane heterostructures. Here,\nwe report on the synthesis and characterization of atomically controlled\ntwo-dimensional graded alloy of MoxW1-xS2, wherein the center region is Mo rich\nand gradually transitions towards a higher concentration of W atoms at the\nedges. This unique alloy structure leads to a continuously tunable bandgap,\nranging from 1.85 eV in the center to 1.95 eV at the edges consistent with the\nlarger band gap of WS2 relative to MoS2. Aberration-corrected high-angle\nannular dark-field scanning transmission electron microscopy showed the\npresence of sulfur monovacancy, VS, whose concentration varied across the\ngraded MoxW1-xS2 layer as a function of Mo content with the highest value in\nthe Mo rich center region. Optical spectroscopy measurements supported by ab\ninitio calculations reveal a doublet electronic state of VS, which was split\ndue to the spin-orbit interaction, with energy levels close to the conduction\nband or deep in the band gap depending on whether the vacancy is surrounded by\nW atoms or Mo atoms. This unique electronic configuration of VS in the alloy\ngave rise to four spin-allowed optical transitions between the VS levels and\nthe valence bands. Our work highlights the potential of simultaneous defect and\noptical engineering of novel devices based on these 2D monolayers.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:41:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghafariasl","Mahdi",""],["Zhang","Tianyi",""],["Ward","Zachary D.",""],["Zhou","Da",""],["Sanchez","David",""],["Swaminathan","Venkataraman",""],["Terrones","Humberto",""],["Terrones","Mauricio",""],["Abate","Yohannes",""]]}
{"id":"2308.14991","submitter":"Liyuan Wang","authors":"Liyuan Wang, Xingxing Zhang, Qian Li, Mingtian Zhang, Hang Su, Jun\n  Zhu, Yi Zhong","title":"Incorporating Neuro-Inspired Adaptability for Continual Learning in\n  Artificial Intelligence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Continual learning aims to empower artificial intelligence (AI) with strong\nadaptability to the real world. For this purpose, a desirable solution should\nproperly balance memory stability with learning plasticity, and acquire\nsufficient compatibility to capture the observed distributions. Existing\nadvances mainly focus on preserving memory stability to overcome catastrophic\nforgetting, but remain difficult to flexibly accommodate incremental changes as\nbiological intelligence (BI) does. By modeling a robust Drosophila learning\nsystem that actively regulates forgetting with multiple learning modules, here\nwe propose a generic approach that appropriately attenuates old memories in\nparameter distributions to improve learning plasticity, and accordingly\ncoordinates a multi-learner architecture to ensure solution compatibility.\nThrough extensive theoretical and empirical validation, our approach not only\nclearly enhances the performance of continual learning, especially over\nsynaptic regularization methods in task-incremental settings, but also\npotentially advances the understanding of neurological adaptive mechanisms,\nserving as a novel paradigm to progress AI and BI together.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:43:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Liyuan",""],["Zhang","Xingxing",""],["Li","Qian",""],["Zhang","Mingtian",""],["Su","Hang",""],["Zhu","Jun",""],["Zhong","Yi",""]]}
{"id":"2308.14992","submitter":"Yueshan Lin","authors":"Yueshan Lin, Wei Feng, Yanmin Wang, Yunfei Chen, Yongxu Zhu, Ximu\n  Zhang, Ning Ge","title":"Satellite-MEC Integration for 6G Internet of Things: Minimal Structures,\n  Advances, and Prospects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The sixth-generation (6G) network is envisioned to shift its focus from the\nservice requirements of human beings' to those of Internet-of-Things (IoT)\ndevices'. Satellite communications are indispensable in 6G to support IoT\ndevices operating in rural or disastrous areas. However, satellite networks\nface the inherent challenges of low data rate and large latency, which may not\nsupport computation-intensive and delay-sensitive IoT applications. Mobile Edge\nComputing (MEC) is a burgeoning paradigm by extending cloud computing\ncapabilities to the network edge. By utilizing MEC technologies, the\nresource-limited IoT devices can access abundant computation resources with low\nlatency, which enables the highly demanding applications while meeting strict\ndelay requirements. Therefore, an integration of satellite communications and\nMEC technologies is necessary to better enable 6G IoT. In this survey, we\nprovide a holistic overview of satellite-MEC integration. We first discuss the\nmain challenges of the integrated satellite-MEC network and propose three\nminimal integrating structures. For each minimal structure, we summarize the\ncurrent advances in terms of their research topics, after which we discuss the\nlessons learned and future directions of the minimal structure. Finally, we\noutline potential research issues to envision a more intelligent, more secure,\nand greener integrated satellite-MEC network.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:47:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lin","Yueshan",""],["Feng","Wei",""],["Wang","Yanmin",""],["Chen","Yunfei",""],["Zhu","Yongxu",""],["Zhang","Ximu",""],["Ge","Ning",""]]}
{"id":"2308.14993","submitter":"Kuan Cheng","authors":"Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu","title":"On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace\n  Reconstruction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The goal of the trace reconstruction problem is to recover a string\n$x\\in\\{0,1\\}^n$ given many independent {\\em traces} of $x$, where a trace is a\nsubsequence obtained from deleting bits of $x$ independently with some given\nprobability $p\\in [0,1).$ A recent result of Chase (STOC 2021) shows how $x$\ncan be determined (in exponential time) from $\\exp(\\widetilde{O}(n^{1/5}))$\ntraces. This is the state-of-the-art result on the sample complexity of trace\nreconstruction.\n  In this paper we consider two kinds of algorithms for the trace\nreconstruction problem.\n  Our first, and technically more involved, result shows that any $k$-mer-based\nalgorithm for trace reconstruction must use $\\exp(\\Omega(n^{1/5}))$ traces,\nunder the assumption that the estimator requires $poly(2^k, 1/\\varepsilon)$\ntraces, thus establishing the optimality of this number of traces. The analysis\nof this result also shows that the analysis technique used by Chase (STOC 2021)\nis essentially tight, and hence new techniques are needed in order to improve\nthe worst-case upper bound.\n  Our second, simple, result considers the performance of the Maximum\nLikelihood Estimator (MLE), which specifically picks the source string that has\nthe maximum likelihood to generate the samples (traces). We show that the MLE\nalgorithm uses a nearly optimal number of traces, \\ie, up to a factor of $n$ in\nthe number of samples needed for an optimal algorithm, and show that this\nfactor of $n$ loss may be necessary under general ``model estimation''\nsettings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:47:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheng","Kuan",""],["Grigorescu","Elena",""],["Li","Xin",""],["Sudan","Madhu",""],["Zhu","Minshen",""]]}
{"id":"2308.14994","submitter":"Manuel Luis Delos Santos","authors":"Manuel Luis C. Delos Santos (1), Jerum B. Dasalla (2), Jomar C.\n  Feliciano (3), Dustin Red B. Cabatay (4), ((1)(3)(4) Asian Institute of\n  Computer Studies, Philippines, (2) Philippine State College of Aeronautics)","title":"ICARUS: An Android-Based Unmanned Aerial Vehicle (UAV) Search and Rescue\n  Eye in the Sky","comments":"15 pages, 14 figures, Special Issue: IRCCETE 2023","journal-ref":"International Journal of Computing Sciences Research (IJCSR),\n  Volume 7, pp. 2272-2286, July 14, 2023","doi":"10.25147/ijcsr.2017.001.1.159","report-no":"ISSN print: 2546-0552; ISSN online: 2546-115X","categories":"cs.CY cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The purpose of this paper is to develop an unmanned aerial vehicle (UAV)\nusing a quadcopter with the capability of video surveillance, map coordinates,\na deployable parachute with a medicine kit or a food pack as a payload, a\ncollision warning system, remotely controlled, integrated with an android\napplication to assist in search and rescue operations.\n  Applied research for the development of the functional prototype,\nquantitative and descriptive statistics to summarize data by describing the\nrelationship between variables in a sample or population. The quadcopter\nunderwent an evaluation using a survey instrument to test its acceptability\nusing predefined variables to select respondents within Caloocan City and\nQuezon City, Philippines.\n  Demographic profiles and known issues and concerns were answered by 30\nrespondents. The results were summarized and distributed in Tables 1 and 2.\n  In terms of demographic profiles, the number of SAR operators within the\nspecified areas is distributed equally, most are male, single, and within the\nage bracket of 31 and above. In issues and concerns, the most common type of\nsearch and rescue was ground search and rescue. Human error is the primary\ncause of most injuries in operating units. The prototype was useful and\neveryone agreed, in terms of acceptability, drone technology will improve\nsearch and rescue operations.\n  The innovative way of utilizing Android and drone technology is a new step\ntowards the improvement of SAR operations in the Philippines.\n  The LiPo battery must be replaced with a higher capacity and the drone\noperator should undergo a training course and secure a permit from the Civil\nAviation Authority of the Philippines (CAAP).\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:49:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Santos","Manuel Luis C. Delos",""],["Dasalla","Jerum B.",""],["Feliciano","Jomar C.",""],["Cabatay","Dustin Red B.",""]]}
{"id":"2308.14995","submitter":"Felipe A. Moreno","authors":"Felipe Moreno-Vera and Edgar Medina and Jorge Poco","title":"WSAM: Visual Explanations from Style Augmentation as Adversarial\n  Attacker and Their Influence in Image Classification","comments":"8 pages, 10 figures","journal-ref":null,"doi":"10.5220/0011795400003417","report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Currently, style augmentation is capturing attention due to convolutional\nneural networks (CNN) being strongly biased toward recognizing textures rather\nthan shapes. Most existing styling methods either perform a low-fidelity style\ntransfer or a weak style representation in the embedding vector. This paper\noutlines a style augmentation algorithm using stochastic-based sampling with\nnoise addition to improving randomization on a general linear transformation\nfor style transfer. With our augmentation strategy, all models not only present\nincredible robustness against image stylizing but also outperform all previous\nmethods and surpass the state-of-the-art performance for the STL-10 dataset. In\naddition, we present an analysis of the model interpretations under different\nstyle variations. At the same time, we compare comprehensive experiments\ndemonstrating the performance when applied to deep neural architectures in\ntraining settings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:50:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Moreno-Vera","Felipe",""],["Medina","Edgar",""],["Poco","Jorge",""]]}
{"id":"2308.14996","submitter":"John Zito","authors":"John Zito and Daniel Kowal","title":"The projected dynamic linear model for time series on the sphere","comments":"26 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Time series on the unit n-sphere arise in directional statistics,\ncompositional data analysis, and many scientific fields. There are few models\nfor such data, and the ones that exist suffer from several limitations: they\nare often challenging to fit computationally, many of them apply only to the\ncircular case of n = 2, and they are usually based on families of distributions\nthat are not flexible enough to capture the complexities observed in real data.\nFurthermore, there is little work on Bayesian methods for spherical time\nseries. To address these shortcomings, we propose a state space model based on\nthe projected normal distribution that can be applied to spherical time series\nof arbitrary dimension. We describe how to perform fully Bayesian offline\ninference for this model using a simple and efficient Gibbs sampling algorithm,\nand we develop a Rao-Blackwellized particle filter to perform online inference\nfor streaming data. In an analysis of wind direction time series, we show that\nthe proposed model outperforms competitors in terms of point, interval, and\ndensity forecasting.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:53:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zito","John",""],["Kowal","Daniel",""]]}
{"id":"2308.14997","submitter":"Jae-Ho Han","authors":"Jung-Wan Ryu, Alexei Andreanov, Hee Chul Park, Jae-Ho Han","title":"Symmetry-protected flatband condition for Hamiltonians with local\n  symmetry","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We derive symmetry-based conditions for tight-binding Hamiltonians with\nflatbands to have compact localized eigenstates occupying a single unit cell.\nThe conditions are based on unitary operators commuting with the Hamiltonian\nand associated with local symmetries that guarantee compact localized states\nand a flatband. We illustrate the conditions for compact localized states and\nflatbands with simple Hamiltonians with given symmetries. We also apply these\nresults to general cases such as the Hamiltonian with long-range hoppings and\nhigher-dimensional Hamiltonian.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 02:57:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ryu","Jung-Wan",""],["Andreanov","Alexei",""],["Park","Hee Chul",""],["Han","Jae-Ho",""]]}
{"id":"2308.14998","submitter":"Tokuro Hata","authors":"Tokuro Hata, Kazuhiro Sada, Tomoki Uchino, Daisuke Endo, Takafumi\n  Akiho, Koji Muraki, and Toshimasa Fujisawa","title":"Tunable tunnel coupling in a double quantum antidot with cotunneling via\n  localized state","comments":"11 pages, 8 figures","journal-ref":"Phys. Rev. B 108, 075432 (2023)","doi":"10.1103/PhysRevB.108.075432","report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Controlling tunnel coupling between quantum antidots (QADs) in the quantum\nHall (QH) regime is problematic. We propose and demonstrate a scheme for\ntunable tunnel coupling between two QADs by utilizing a cotunneling process via\na localized state as a third QAD. The effective tunnel coupling can be tuned by\nchanging the localized level even with constant nearest-neighbor tunnel\ncouplings. We systematically study the variation of transport characteristics\nin the effectively triple QAD system at the Landau level filling factor $\\nu\n=2$. The tunable tunnel coupling is clarified by analyzing the anti-crossing of\nCoulomb blockade peaks in the charge stability diagram, in agreement with\nnumerical simulations based on the master equation. The scheme is attractive\nfor studying coherence and interaction in QH systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:13:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hata","Tokuro",""],["Sada","Kazuhiro",""],["Uchino","Tomoki",""],["Endo","Daisuke",""],["Akiho","Takafumi",""],["Muraki","Koji",""],["Fujisawa","Toshimasa",""]]}
{"id":"2308.14999","submitter":"Sean Sullivan","authors":"Sean E. Sullivan, Jonghoon Ahn, Tao Zhou, Preetha Saha, Martin V.\n  Holt, Supratik Guha, F. J. Heremans, Manish Kumar Singh","title":"Quasi-deterministic Localization of Er Emitters in Thin Film TiO$_2$\n  through Submicron-scale Crystalline Phase Control","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.app-ph quant-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  With their shielded 4f orbitals, rare-earth ions (REIs) offer optical and\nelectron spin transitions with good coherence properties even when embedded in\na host crystal matrix, highlighting their utility as promising quantum emitters\nand memories for quantum information processing. Among REIs, trivalent erbium\n(Er$^{3+}$) uniquely has an optical transition in the telecom C-band, ideal for\ntransmission over optical fibers, and making it well-suited for applications in\nquantum communication. The deployment of Er$^{3+}$ emitters into a thin film\nTiO$_2$ platform has been a promising step towards scalable integration;\nhowever, like many solid-state systems, the deterministic spatial placement of\nquantum emitters remains an open challenge. We investigate laser annealing as a\nmeans to locally tune the optical resonance of Er$^{3+}$ emitters in TiO$_2$\nthin films on Si. Using both nanoscale X-ray diffraction measurements and\ncryogenic photoluminescence spectroscopy, we show that tightly focused\nbelow-gap laser annealing can induce anatase to rutile phase transitions in a\nnearly diffraction-limited area of the films and improve local crystallinity\nthrough grain growth. As a percentage of the Er:TiO$_2$ is converted to rutile,\nthe Er$^{3+}$ optical transition blueshifts by 13 nm. We explore the effects of\nchanging laser annealing time and show that the amount of optically active\nEr:rutile increases linearly with laser power. We additionally demonstrate\nlocal phase conversion on microfabricated Si structures, which holds\nsignificance for quantum photonics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:24:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sullivan","Sean E.",""],["Ahn","Jonghoon",""],["Zhou","Tao",""],["Saha","Preetha",""],["Holt","Martin V.",""],["Guha","Supratik",""],["Heremans","F. J.",""],["Singh","Manish Kumar",""]]}
{"id":"2308.15000","submitter":"Joanne Hall","authors":"Joanne L. Hall, Wayne Kelly, Yu-Chu Tian","title":"Optimal Data Distribution for Big-Data All-to-All Comparison using\n  Finite Projective and Affine Planes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An All-to-All Comparison problem is where every element of a data set is\ncompared with every other element. This is analogous to projective planes and\naffine planes where every pair of points share a common line.\n  For large data sets, the comparison computations can be distributed across a\ncluster of computers. All-to-All Comparison does not fit the highly successful\nMap-Reduce pattern, so a new distributed computing framework is required. The\nprincipal challenge is to distribute the data in such a way that computations\ncan be scheduled where the data already lies.\n  This paper uses projective planes, affine planes and balanced incomplete\nblock designs to design data distributions and schedule computations. The data\ndistributions based on these geometric and combinatorial structures achieve\nminimal data replication whilst balancing the computational load across the\ncluster.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:25:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hall","Joanne L.",""],["Kelly","Wayne",""],["Tian","Yu-Chu",""]]}
{"id":"2308.15001","submitter":"Peter Forrester","authors":"Peter J. Forrester","title":"Relations between generalised Wishart matrices, the Muttalib--Borodin\n  model and matrix spherical functions","comments":"15 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Generalised uncorrelated Wishart matrices are formed out of rectangular\nstandard Gaussian data matrices with a certain pattern of zero entries.\nDevelopment of the theory in the real and complex cases has proceeded along\nseparate line. For example, emphasis in the real case has been placed on the\nBellman and Riesz distributions, while that in the complex case has been shown\nto be closely related to the Muttalib-Borodin model. In this work, as well as\nuniting the lines of development, a tie in with matrix spherical functions is\nidentified in the context of deducing the eigenvalue probability density\nfunction from the joint element probability density function.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:25:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Forrester","Peter J.",""]]}
{"id":"2308.15002","submitter":"Yi Xu","authors":"Yi Xu, Junjie Ou, Hui Xu, Luoyi Fu, Lei Zhou, Xinbing Wang, Chenghu\n  Zhou","title":"Exploring the Limits of Historical Information for Temporal Knowledge\n  Graph Extrapolation","comments":"Extended version of AAAI paper arXiv:2211.10904","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Temporal knowledge graphs, representing the dynamic relationships and\ninteractions between entities over time, have been identified as a promising\napproach for event forecasting. However, a limitation of most temporal\nknowledge graph reasoning methods is their heavy reliance on the recurrence or\nperiodicity of events, which brings challenges to inferring future events\nrelated to entities that lack historical interaction. In fact, the current\nstate of affairs is often the result of a combination of historical information\nand underlying factors that are not directly observable. To this end, we\ninvestigate the limits of historical information for temporal knowledge graph\nextrapolation and propose a new event forecasting model called Contrastive\nEvent Network (CENET) based on a novel training framework of historical\ncontrastive learning. CENET learns both the historical and non-historical\ndependency to distinguish the most potential entities that best match the given\nquery. Simultaneously, by launching contrastive learning, it trains\nrepresentations of queries to probe whether the current moment is more\ndependent on historical or non-historical events. These representations further\nhelp train a binary classifier, whose output is a boolean mask, indicating the\nrelated entities in the search space. During the inference process, CENET\nemploys a mask-based strategy to generate the final results. We evaluate our\nproposed model on five benchmark graphs. The results demonstrate that CENET\nsignificantly outperforms all existing methods in most metrics, achieving at\nleast 8.3% relative improvement of Hits@1 over previous state-of-the-art\nbaselines on event-based datasets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:26:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xu","Yi",""],["Ou","Junjie",""],["Xu","Hui",""],["Fu","Luoyi",""],["Zhou","Lei",""],["Wang","Xinbing",""],["Zhou","Chenghu",""]]}
{"id":"2308.15003","submitter":"Yuanchun Li","authors":"Wenxing Xu, Yuanchun Li, Jiacheng Liu, Yi Sun, Zhengyang Cao, Yixuan\n  Li, Hao Wen, Yunxin Liu","title":"Generative Model for Models: Rapid DNN Customization for Diverse Tasks\n  and Resource Constraints","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unlike cloud-based deep learning models that are often large and uniform,\nedge-deployed models usually demand customization for domain-specific tasks and\nresource-limited environments. Such customization processes can be costly and\ntime-consuming due to the diversity of edge scenarios and the training load for\neach scenario. Although various approaches have been proposed for rapid\nresource-oriented customization and task-oriented customization respectively,\nachieving both of them at the same time is challenging. Drawing inspiration\nfrom the generative AI and the modular composability of neural networks, we\nintroduce NN-Factory, an one-for-all framework to generate customized\nlightweight models for diverse edge scenarios. The key idea is to use a\ngenerative model to directly produce the customized models, instead of training\nthem. The main components of NN-Factory include a modular supernet with\npretrained modules that can be conditionally activated to accomplish different\ntasks and a generative module assembler that manipulate the modules according\nto task and sparsity requirements. Given an edge scenario, NN-Factory can\nefficiently customize a compact model specialized in the edge task while\nsatisfying the edge resource constraints by searching for the optimal strategy\nto assemble the modules. Based on experiments on image classification and\nobject detection tasks with different edge devices, NN-Factory is able to\ngenerate high-quality task- and resource-specific models within few seconds,\nfaster than conventional model customization approaches by orders of magnitude.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:28:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xu","Wenxing",""],["Li","Yuanchun",""],["Liu","Jiacheng",""],["Sun","Yi",""],["Cao","Zhengyang",""],["Li","Yixuan",""],["Wen","Hao",""],["Liu","Yunxin",""]]}
{"id":"2308.15004","submitter":"Ruijin Liu","authors":"Ruijin Liu, Ning Lu, Dapeng Chen, Cheng Li, Zejian Yuan, Wei Peng","title":"PBFormer: Capturing Complex Scene Text Shape with Polynomial Band\n  Transformer","comments":"9 pages, 8 figures, accepted by ACM MM 2023","journal-ref":null,"doi":"10.1145/3581783.3612059","report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present PBFormer, an efficient yet powerful scene text detector that\nunifies the transformer with a novel text shape representation Polynomial Band\n(PB). The representation has four polynomial curves to fit a text's top,\nbottom, left, and right sides, which can capture a text with a complex shape by\nvarying polynomial coefficients. PB has appealing features compared with\nconventional representations: 1) It can model different curvatures with a fixed\nnumber of parameters, while polygon-points-based methods need to utilize a\ndifferent number of points. 2) It can distinguish adjacent or overlapping texts\nas they have apparent different curve coefficients, while segmentation-based or\npoints-based methods suffer from adhesive spatial positions. PBFormer combines\nthe PB with the transformer, which can directly generate smooth text contours\nsampled from predicted curves without interpolation. A parameter-free\ncross-scale pixel attention (CPA) module is employed to highlight the feature\nmap of a suitable scale while suppressing the other feature maps. The simple\noperation can help detect small-scale texts and is compatible with the\none-stage DETR framework, where no postprocessing exists for NMS. Furthermore,\nPBFormer is trained with a shape-contained loss, which not only enforces the\npiecewise alignment between the ground truth and the predicted curves but also\nmakes curves' positions and shapes consistent with each other. Without bells\nand whistles about text pre-training, our method is superior to the previous\nstate-of-the-art text detectors on the arbitrary-shaped text datasets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:41:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Ruijin",""],["Lu","Ning",""],["Chen","Dapeng",""],["Li","Cheng",""],["Yuan","Zejian",""],["Peng","Wei",""]]}
{"id":"2308.15005","submitter":"Anh-Khoa Nguyen Vu","authors":"Anh-Khoa Nguyen Vu, Thanh-Toan Do, Vinh-Tiep Nguyen, Tam Le,\n  Minh-Triet Tran, Tam V. Nguyen","title":"Few-Shot Object Detection via Synthetic Features with Optimal Transport","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Few-shot object detection aims to simultaneously localize and classify the\nobjects in an image with limited training samples. However, most existing\nfew-shot object detection methods focus on extracting the features of a few\nsamples of novel classes that lack diversity. Hence, they may not be sufficient\nto capture the data distribution. To address that limitation, in this paper, we\npropose a novel approach in which we train a generator to generate synthetic\ndata for novel classes. Still, directly training a generator on the novel class\nis not effective due to the lack of novel data. To overcome that issue, we\nleverage the large-scale dataset of base classes. Our overarching goal is to\ntrain a generator that captures the data variations of the base dataset. We\nthen transform the captured variations into novel classes by generating\nsynthetic data with the trained generator. To encourage the generator to\ncapture data variations on base classes, we propose to train the generator with\nan optimal transport loss that minimizes the optimal transport distance between\nthe distributions of real and synthetic data. Extensive experiments on two\nbenchmark datasets demonstrate that the proposed method outperforms the state\nof the art. Source code will be available.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:54:26 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:54:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Vu","Anh-Khoa Nguyen",""],["Do","Thanh-Toan",""],["Nguyen","Vinh-Tiep",""],["Le","Tam",""],["Tran","Minh-Triet",""],["Nguyen","Tam V.",""]]}
{"id":"2308.15006","submitter":"Spencer Hutchinson","authors":"Spencer Hutchinson, Berkay Turan, Mahnoosh Alizadeh","title":"Exploiting Problem Geometry in Safe Linear Bandits","comments":"38 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The safe linear bandit problem is a version of the classic linear bandit\nproblem where the learner's actions must satisfy an uncertain linear constraint\nat all rounds. Due its applicability to many real-world settings, this problem\nhas received considerable attention in recent years. We find that by exploiting\nthe geometry of the specific problem setting, we can achieve improved regret\nguarantees for both well-separated problem instances and action sets that are\nfinite star convex sets. Additionally, we propose a novel algorithm for this\nsetting that chooses problem parameters adaptively and enjoys at least as good\nregret guarantees as existing algorithms. Lastly, we introduce a generalization\nof the safe linear bandit setting where the constraints are convex and adapt\nour algorithms and analyses to this setting by leveraging a novel\nconvex-analysis based approach. Simulation results show improved performance\nover existing algorithms for a variety of randomly sampled settings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 03:54:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hutchinson","Spencer",""],["Turan","Berkay",""],["Alizadeh","Mahnoosh",""]]}
{"id":"2308.15007","submitter":"Vivek Gupte","authors":"Vivek Gupte (BITS-Pilani, K. K. Birla Goa Campus, India), Dan R.\n  Suissa (Ben-Gurion University of the Negev, Israel) and Yael Edan (Ben-Gurion\n  University of the Negev, Israel)","title":"Optometrist's Algorithm for Personalizing Robot-Human Handovers","comments":"7 pages, 5 figures. Accepted at IEEE-ROMAN 2023. For more information\n  visit: https://github.com/vivekgupte07/optometrist-algorithm-handovers","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With an increasing interest in human-robot collaboration, there is a need to\ndevelop robot behavior while keeping the human user's preferences in mind.\nHighly skilled human users doing delicate tasks require their robot partners to\nbehave according to their work habits and task constraints. To achieve this, we\npresent the use of the Optometrist's Algorithm (OA) to interactively and\nintuitively personalize robot-human handovers. Using this algorithm, we tune\ncontroller parameters for speed, location, and effort. We study the differences\nin the fluency of the handovers before and after tuning and the subjective\nperception of this process in a study of $N=30$ non-expert users of mixed\nbackground -- evaluating the OA. The users evaluate the interaction on trust,\nsafety, and workload scales, amongst other measures. They assess our tuning\nprocess to be engaging and easy to use. Personalization leads to an increase in\nthe fluency of the interaction. Our participants utilize the wide range of\nparameters ending up with their unique personalized handover.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:02:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gupte","Vivek","","BITS-Pilani, K. K. Birla Goa Campus, India"],["Suissa","Dan R.","","Ben-Gurion University of the Negev, Israel"],["Edan","Yael","","Ben-Gurion\n  University of the Negev, Israel"]]}
{"id":"2308.15008","submitter":"Guangyao Rong","authors":"Guangyao Rong, Miao Cheng, Yunzhen Zhang, Zhaohua Sheng, Jianping Wang","title":"Investigation of flow field characteristics and performance of\n  carbon-hydrogen/oxygen-rich air rotating detonation engine","comments":null,"journal-ref":null,"doi":"10.1063/5.0154599","report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerical simulations were conducted to investigate the flow field\ncharacteristics and performance of a carbon-hydrogen/oxygen-rich air rotating\ndetonation engine (RDE). Three distinct flow field structures were observed in\nthe gas-solid two-phase RDE. The results show that reducing the hydrogen\nequivalence ratio and particle diameter both contribute to the transition from\ngas-phase single-front detonation to gas-solid two-phase double-front\ndetonation and further to gas-solid two-phase single-front detonation. The\neffects of solid fuel particle diameter and hydrogen equivalence ratio on the\nflow field characteristics and performance are revealed. The results show that\nreducing the particle diameter enhances the speed of the two-phase detonation\nwave, improves the pressure gain in the combustion chamber, and increases the\nspecific impulse. Decreasing the hydrogen equivalence ratio reduces the\ndetonation wave speed, enhances the stability of the detonation flow field,\nincreases the pressure gain in the detonation wave and combustion chamber and\nboosts thrust. Furthermore, the selection of operational conditions to ensure\nstable operation and optimal performance of the RDE is discussed. In order to\ntake into account the requirements of stability, pressure gain performance and\npropulsion performance, two-phase single-front detonation should be realized in\ngas-solid two-phase RDE, and smaller hydrogen equivalent ratio and appropriate\nparticle diameter should be selected. According to the conclusion of this\nstudy, the particle diameter should be 0.5-1 {\\mu}m. Under such conditions, the\ndetonation flow field demonstrates good stability, allowing the RDE to achieve\nhigher pressure gain and specific impulse while maintaining stable operation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:14:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Rong","Guangyao",""],["Cheng","Miao",""],["Zhang","Yunzhen",""],["Sheng","Zhaohua",""],["Wang","Jianping",""]]}
{"id":"2308.15009","submitter":"William Buchanan Prof","authors":"Sam Grierson, Konstantinos Chalkias, William J Buchanan","title":"Double Public Key Signing Function Oracle Attack on EdDSA Software\n  Implementations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  EdDSA is a standardised elliptic curve digital signature scheme introduced to\novercome some of the issues prevalent in the more established ECDSA standard.\nDue to the EdDSA standard specifying that the EdDSA signature be deterministic,\nif the signing function were to be used as a public key signing oracle for the\nattacker, the unforgeability notion of security of the scheme can be broken.\nThis paper describes an attack against some of the most popular EdDSA\nimplementations, which results in an adversary recovering the private key used\nduring signing. With this recovered secret key, an adversary can sign arbitrary\nmessages that would be seen as valid by the EdDSA verification function. A list\nof libraries with vulnerable APIs at the time of publication is provided.\nFurthermore, this paper provides two suggestions for securing EdDSA signing\nAPIs against this vulnerability while it additionally discusses failed attempts\nto solve the issue.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:15:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Grierson","Sam",""],["Chalkias","Konstantinos",""],["Buchanan","William J",""]]}
{"id":"2308.15010","submitter":"Chengyu Wang","authors":"Jianing Wang, Chengyu Wang, Cen Chen, Ming Gao, Jun Huang, Aoying Zhou","title":"TransPrompt v2: A Transferable Prompting Framework for Cross-task Text\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Text classification is one of the most imperative tasks in natural language\nprocessing (NLP). Recent advances with pre-trained language models (PLMs) have\nshown remarkable success on this task. However, the satisfying results obtained\nby PLMs heavily depend on the large amounts of task-specific labeled data,\nwhich may not be feasible in many application scenarios due to data access and\nprivacy constraints. The recently-proposed prompt-based fine-tuning paradigm\nimproves the performance of PLMs for few-shot text classification with\ntask-specific templates. Yet, it is unclear how the prompting knowledge can be\ntransferred across tasks, for the purpose of mutual reinforcement. We propose\nTransPrompt v2, a novel transferable prompting framework for few-shot learning\nacross similar or distant text classification tasks. For learning across\nsimilar tasks, we employ a multi-task meta-knowledge acquisition (MMA)\nprocedure to train a meta-learner that captures the cross-task transferable\nknowledge. For learning across distant tasks, we further inject the task type\ndescriptions into the prompt, and capture the intra-type and inter-type prompt\nembeddings among multiple distant tasks. Additionally, two de-biasing\ntechniques are further designed to make the trained meta-learner more\ntask-agnostic and unbiased towards any tasks. After that, the meta-learner can\nbe adapted to each specific task with better parameters initialization.\nExtensive experiments show that TransPrompt v2 outperforms single-task and\ncross-task strong baselines over multiple NLP tasks and datasets. We further\nshow that the meta-learner can effectively improve the performance of PLMs on\npreviously unseen tasks. In addition, TransPrompt v2 also outperforms strong\nfine-tuning baselines when learning with full training sets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:16:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Jianing",""],["Wang","Chengyu",""],["Chen","Cen",""],["Gao","Ming",""],["Huang","Jun",""],["Zhou","Aoying",""]]}
{"id":"2308.15011","submitter":"Takumi Kakimoto","authors":"Takumi Kakimoto, Masayuki Tanaka, Masato Onodera, Rhythm Shimakawa,\n  Po-Feng Wu, Katriona M. L. Gould, Kei Ito, Shuowen Jin, Mariko Kubo, Tomoko\n  L. Suzuki, Sune Toft, Francesco Valentino, Kiyoto Yabe","title":"A massive quiescent galaxy in a group environment at $z=4.53$","comments":"13 pages, 7 figures, 2 tables; submitted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the spectroscopic confirmation of a massive quiescent galaxy at\n$z_\\mathrm{spec}=4.53$ in the COSMOS field with Keck/MOSFIRE. The object was\nfirst identified as a galaxy with suppressed star formation at\n$z_\\mathrm{phot}\\sim4.65$ from the COSMOS2020 catalog. The follow-up\nspectroscopy with MOSFIRE in the $K$-band reveals a faint [OII] emission and\nthe Balmer break, indicative of evolved stellar populations. We perform the\nspectral energy distribution fitting using both the photometry and spectrum to\ninfer physical properties. The obtained stellar mass is high ($M_*\\sim\n10^{10.8}\\,M_\\odot$) and the current star formation rate is more than 1 dex\nbelow that of main-sequence galaxies at $z=4.5$. Its star formation history\nsuggests that this galaxy experienced starburst at $z\\sim5$ followed by a rapid\nquenching phase. This is one of the youngest quiescent galaxies at $z>3$ and is\nlikely a galaxy in the process of being quenched. An unique aspect of the\ngalaxy is that it is in an extremely dense region; there are four massive\nstar-forming galaxies at $4.4<z_\\mathrm{phot}<4.7$ located within 150 physical\nkpc from the galaxy. Interestingly, three of them have strongly overlapping\nvirial radii with that of the central quiescent galaxy ($\\sim\n70\\,\\mathrm{kpc}$), suggesting that the over-density region is likely the\nhighest redshift candidate of a dense group with a spectroscopically confirmed\nquiescent galaxy at the center. The group provides us with an unique\nopportunity to gain insights into the role of the group environment for\nquenching at $z\\sim$ 4 - 5 corresponding to the formation epoch of massive\nelliptical galaxies in the local Universe.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:25:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kakimoto","Takumi",""],["Tanaka","Masayuki",""],["Onodera","Masato",""],["Shimakawa","Rhythm",""],["Wu","Po-Feng",""],["Gould","Katriona M. L.",""],["Ito","Kei",""],["Jin","Shuowen",""],["Kubo","Mariko",""],["Suzuki","Tomoko L.",""],["Toft","Sune",""],["Valentino","Francesco",""],["Yabe","Kiyoto",""]]}
{"id":"2308.15012","submitter":"Jiake Ge","authors":"Jiake Ge, Huanchen Zhang, Boyu Shi, Yuanhui Luo, Yunda Guo, Yunpeng\n  Chai, Yuxing Chen, Anqun Pan","title":"SALI: A Scalable Adaptive Learned Index Framework based on Probability\n  Models","comments":"Accepted by Conference SIGMOD 24, June 09-15, 2024, Santiago, Chile","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The growth in data storage capacity and the increasing demands for high\nperformance have created several challenges for concurrent indexing structures.\nOne promising solution is learned indexes, which use a learning-based approach\nto fit the distribution of stored data and predictively locate target keys,\nsignificantly improving lookup performance. Despite their advantages,\nprevailing learned indexes exhibit constraints and encounter issues of\nscalability on multi-core data storage.\n  This paper introduces SALI, the Scalable Adaptive Learned Index framework,\nwhich incorporates two strategies aimed at achieving high scalability,\nimproving efficiency, and enhancing the robustness of the learned index.\nFirstly, a set of node-evolving strategies is defined to enable the learned\nindex to adapt to various workload skews and enhance its concurrency\nperformance in such scenarios. Secondly, a lightweight strategy is proposed to\nmaintain statistical information within the learned index, with the goal of\nfurther improving the scalability of the index. Furthermore, to validate their\neffectiveness, SALI applied the two strategies mentioned above to the learned\nindex structure that utilizes fine-grained write locks, known as LIPP. The\nexperimental results have demonstrated that SALI significantly enhances the\ninsertion throughput with 64 threads by an average of 2.04x compared to the\nsecond-best learned index. Furthermore, SALI accomplishes a lookup throughput\nsimilar to that of LIPP+.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:26:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ge","Jiake",""],["Zhang","Huanchen",""],["Shi","Boyu",""],["Luo","Yuanhui",""],["Guo","Yunda",""],["Chai","Yunpeng",""],["Chen","Yuxing",""],["Pan","Anqun",""]]}
{"id":"2308.15013","submitter":"Taekyun Kim","authors":"Taekyun Kim, Dae San Kim","title":"Some identities on degenerate harmonic and degenerate higher-order\n  harmonic numbers","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The harmonic numbers and higher-order harmonic numbers appear frequently in\nseveral areas which are related to combinatorial identities, many expressions\ninvolving special functions in analytic number theory, and analysis of\nalgorithms. The aim of this paper is to study the degenerate harmonic and\ndegenerate higher-order harmonic numbers, which are respectively degenerate\nversions of the harmonic and higher-order harmonic numbers, in connection with\nthe degenerate zeta and degenerate Hurwitz zeta function. Here the degenerate\nzeta and degenerate Hurwitz zeta function are respectively degenerate versions\nof the Riemann zeta and Hurwitz zeta function. We show that several infinite\nsums involving the degenerate higher-order harmonic numbers can be expressed in\nterms of the degenerate zeta function. Furthermore, we demonstrate that an\ninfinite sum involving finite sums of products of the degenerate harmonic\nnumbers can be represented by using the degenerate Hurwitz zeta function.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:31:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kim","Taekyun",""],["Kim","Dae San",""]]}
{"id":"2308.15014","submitter":"Gaurav Gupta","authors":"Gaurav Gupta, Jonah Yi, Benjamin Coleman, Chen Luo, Vihan Lakshman,\n  Anshumali Shrivastava","title":"CAPS: A Practical Partition Index for Filtered Similarity Search","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  With the surging popularity of approximate near-neighbor search (ANNS),\ndriven by advances in neural representation learning, the ability to serve\nqueries accompanied by a set of constraints has become an area of intense\ninterest. While the community has recently proposed several algorithms for\nconstrained ANNS, almost all of these methods focus on integration with\ngraph-based indexes, the predominant class of algorithms achieving\nstate-of-the-art performance in latency-recall tradeoffs. In this work, we take\na different approach and focus on developing a constrained ANNS algorithm via\nspace partitioning as opposed to graphs. To that end, we introduce Constrained\nApproximate Partitioned Search (CAPS), an index for ANNS with filters via space\npartitions that not only retains the benefits of a partition-based algorithm\nbut also outperforms state-of-the-art graph-based constrained search techniques\nin recall-latency tradeoffs, with only 10% of the index size.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:34:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gupta","Gaurav",""],["Yi","Jonah",""],["Coleman","Benjamin",""],["Luo","Chen",""],["Lakshman","Vihan",""],["Shrivastava","Anshumali",""]]}
{"id":"2308.15015","submitter":"Tetsufumi Tanamoto","authors":"Tetsufumi Tanamoto and Keiji Ono","title":"Readout using Resonant Tunneling in Silicon Spin Qubits","comments":"11 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spin qubit systems are one of the promising candidates for quantum computing.\nThe quantum dot (QD) arrays are intensively investigated by many researchers.\nBecause the energy-difference between the up-spin and down-spin states is very\nsmall, the detection of the qubit state is of prime importance in this field.\nMoreover, many wires are required to control qubit systems. Therefore, the\nintegration of qubits and wires is also an important issue. In this study, the\nmeasurement process of QD arrays is theoretically investigated using resonant\ntunneling, controlled by a conventional transistor. It is shown that the number\nof possible measurements during coherence time can exceed a hundred under the\nbackaction of the measurements owing to the nonlinear characteristics of\nresonant tunneling. It is also discussed to read out the measurement results by\nthe conventional transistor.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:35:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tanamoto","Tetsufumi",""],["Ono","Keiji",""]]}
{"id":"2308.15016","submitter":"Longbin Ji","authors":"Longbin Ji, Pengfei Wei, Yi Ren, Jinglin Liu, Chen Zhang, Xiang Yin","title":"C2G2: Controllable Co-speech Gesture Generation with Latent Diffusion\n  Model","comments":"12 pages, 6 figures, 7 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Co-speech gesture generation is crucial for automatic digital avatar\nanimation. However, existing methods suffer from issues such as unstable\ntraining and temporal inconsistency, particularly in generating high-fidelity\nand comprehensive gestures. Additionally, these methods lack effective control\nover speaker identity and temporal editing of the generated gestures. Focusing\non capturing temporal latent information and applying practical controlling, we\npropose a Controllable Co-speech Gesture Generation framework, named C2G2.\nSpecifically, we propose a two-stage temporal dependency enhancement strategy\nmotivated by latent diffusion models. We further introduce two key features to\nC2G2, namely a speaker-specific decoder to generate speaker-related real-length\nskeletons and a repainting strategy for flexible gesture generation/editing.\nExtensive experiments on benchmark gesture datasets verify the effectiveness of\nour proposed C2G2 compared with several state-of-the-art baselines. The link of\nthe project demo page can be found at https://c2g2-gesture.github.io/c2_gesture\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:39:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ji","Longbin",""],["Wei","Pengfei",""],["Ren","Yi",""],["Liu","Jinglin",""],["Zhang","Chen",""],["Yin","Xiang",""]]}
{"id":"2308.15017","submitter":"Geoff Vooys","authors":"Geoff Vooys","title":"Measurable Functions and Topolgical Algebra","comments":"11 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.CT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we show that if $(X,\\mathcal{A})$ is a measurable space and if\n$Y$ is a topological model of a Lawvere theory $\\mathcal{T}$ equipped with\n$\\mathcal{B}$ the Borel $\\sigma$-algebra on $Y$, then the set of\n$\\mathcal{B}$-measurable functions from $X$ to $Y$, $\\operatorname{Meas}(X,Y)$,\nis a set-theoretic model of $\\mathcal{T}$. As a corollary we give short proofs\nof the facts that the set of real-valued measurable functions on a measurable\nspace $X$ is a ring and the set of complex-valued measurable functions from $X$\nto $\\mathbb{C}$ is a ring.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:44:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vooys","Geoff",""]]}
{"id":"2308.15018","submitter":"Askar Dzhumadil'daev","authors":"AskarDzhumadil'daev","title":"Weak Leibniz algebras and transposed Poisson algebras","comments":"10 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.RA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  An algebra with identities $[a,b]c=2a(bc)-2b(ac), a[b,c]=2(ab)c-2(ac)b$ is\ncalled weak Leibniz. We show that weak Leibniz operad is self-dual and is not\nKoszul. We establish that polarization of any weak Leibniz algebra is\ntransposed Poisson, and, conversely, polarization of any transposed Poisson\nalgebra is weak Leibniz.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:45:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["AskarDzhumadil'daev","",""]]}
{"id":"2308.15019","submitter":"Aydogan Ozcan","authors":"Bijie Bai, Xilin Yang, Tianyi Gan, Jingxi Li, Deniz Mengu, Mona\n  Jarrahi, Aydogan Ozcan","title":"Pyramid diffractive optical networks for unidirectional magnification\n  and demagnification","comments":"26 Pages, 7 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics cs.CV cs.NE physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffractive deep neural networks (D2NNs) are composed of successive\ntransmissive layers optimized using supervised deep learning to all-optically\nimplement various computational tasks between an input and output field-of-view\n(FOV). Here, we present a pyramid-structured diffractive optical network design\n(which we term P-D2NN), optimized specifically for unidirectional image\nmagnification and demagnification. In this P-D2NN design, the diffractive\nlayers are pyramidally scaled in alignment with the direction of the image\nmagnification or demagnification. Our analyses revealed the efficacy of this\nP-D2NN design in unidirectional image magnification and demagnification tasks,\nproducing high-fidelity magnified or demagnified images in only one direction,\nwhile inhibiting the image formation in the opposite direction - confirming the\ndesired unidirectional imaging operation. Compared to the conventional D2NN\ndesigns with uniform-sized successive diffractive layers, P-D2NN design\nachieves similar performance in unidirectional magnification tasks using only\nhalf of the diffractive degrees of freedom within the optical processor volume.\nFurthermore, it maintains its unidirectional image\nmagnification/demagnification functionality across a large band of illumination\nwavelengths despite being trained with a single illumination wavelength. With\nthis pyramidal architecture, we also designed a wavelength-multiplexed\ndiffractive network, where a unidirectional magnifier and a unidirectional\ndemagnifier operate simultaneously in opposite directions, at two distinct\nillumination wavelengths. The efficacy of the P-D2NN architecture was also\nvalidated experimentally using monochromatic terahertz illumination,\nsuccessfully matching our numerical simulations. P-D2NN offers a\nphysics-inspired strategy for designing task-specific visual processors.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:46:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bai","Bijie",""],["Yang","Xilin",""],["Gan","Tianyi",""],["Li","Jingxi",""],["Mengu","Deniz",""],["Jarrahi","Mona",""],["Ozcan","Aydogan",""]]}
{"id":"2308.15020","submitter":"Yunuo Cen","authors":"Yunuo Cen, Zhiwei Zhang, Xuanyao Fong","title":"Massively Parallel Continuous Local Search for Hybrid SAT Solving on\n  GPUs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.DC cs.IT cs.LG cs.LO math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although state-of-the-art (SOTA) SAT solvers based on conflict-driven clause\nlearning (CDCL) have achieved remarkable engineering success, their sequential\nnature limits the parallelism that may be extracted for acceleration on\nplatforms such as the graphics processing unit (GPU). In this work, we propose\nFastFourierSAT, a highly parallel hybrid SAT solver based on gradient-driven\ncontinuous local search (CLS). This is realized by a novel parallel algorithm\ninspired by the Fast Fourier Transform (FFT)-based convolution for computing\nthe elementary symmetric polynomials (ESPs), which is the major computational\ntask in previous CLS methods. The complexity of our algorithm matches the best\nprevious result. Furthermore, the substantial parallelism inherent in our\nalgorithm can leverage the GPU for acceleration, demonstrating significant\nimprovement over the previous CLS approaches. We also propose to incorporate\nthe restart heuristics in CLS to improve search efficiency. We compare our\napproach with the SOTA parallel SAT solvers on several benchmarks. Our results\nshow that FastFourierSAT computes the gradient 100+ times faster than previous\nprototypes implemented on CPU. Moreover, FastFourierSAT solves most instances\nand demonstrates promising performance on larger-size instances.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:50:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cen","Yunuo",""],["Zhang","Zhiwei",""],["Fong","Xuanyao",""]]}
{"id":"2308.15021","submitter":"Ngo Viet Trung","authors":"Ha Minh Lam, Ngo Viet Trung, Tran Nam Trung","title":"A general formula for the index of depth stability of edge ideals","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AC math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By a classical result of Brodmann, the function $\\operatorname{depth} R/I^t$\nis asymptotically a constant, i.e. there is a number $s$ such that\n$\\operatorname{depth} R/I^t = \\operatorname{depth} R/I^s$ for $t > s$. One\ncalls the smallest number $s$ with this property the index of depth stability\nof $I$ and denotes it by $\\operatorname{dstab}(I)$. This invariant remains\nmysterious til now. The main result of this paper gives an explicit formula for\n$\\operatorname{dstab}(I)$ when $I$ is an arbitrary ideal generated by\nsquarefree monomials of degree 2. That is the first general case where one can\ncharacterize $\\operatorname{dstab}(I)$ explicitly. The formula expresses\n$\\operatorname{dstab}(I)$ in terms of the associated graph. The proof involves\nnew techniques which relate different topics such as simplicial complexes,\nsystems of linear inequalities, graph parallelizations, and ear decompositions.\nIt provides an effective method for the study of powers of edge ideals.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:57:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lam","Ha Minh",""],["Trung","Ngo Viet",""],["Trung","Tran Nam",""]]}
{"id":"2308.15022","submitter":"Qingyue Wang","authors":"Qingyue Wang, Liang Ding, Yanan Cao, Zhiliang Tian, Shi Wang, Dacheng\n  Tao, Li Guo","title":"Recursively Summarizing Enables Long-Term Dialogue Memory in Large\n  Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most open-domain dialogue systems suffer from forgetting important\ninformation, especially in a long-term conversation. Existing works usually\ntrain the specific retriever or summarizer to obtain key information from the\npast, which is time-consuming and highly depends on the quality of labeled\ndata. To alleviate this problem, we propose to recursively generate summaries/\nmemory using large language models (LLMs) to enhance long-term memory ability.\nSpecifically, our method first stimulates LLMs to memorize small dialogue\ncontexts and then recursively produce new memory using previous memory and\nfollowing contexts. Finally, the LLM can easily generate a highly consistent\nresponse with the help of the latest memory. We evaluate our method using\nChatGPT and text-davinci-003, and the experiments on the widely-used public\ndataset show that our method can generate more consistent responses in a\nlong-context conversation. Notably, our method is a potential solution to\nenable the LLM to model the extremely long context. Code and scripts will be\nreleased later.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 04:59:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Qingyue",""],["Ding","Liang",""],["Cao","Yanan",""],["Tian","Zhiliang",""],["Wang","Shi",""],["Tao","Dacheng",""],["Guo","Li",""]]}
{"id":"2308.15023","submitter":"Yadong Jiang","authors":"Yadong Jiang, Huan Wang, Kejie Bao, Jing Wang","title":"Intrinsic antiferromagnetic topological insulator and axion state in\n  V2WS4","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intrinsic magnetic topological insulators offers an ideal platform to explore\nexotic topological phenomena, such as axion electrodynamics, quantum anomalous\nHall (QAH) effect and Majorana edge modes. However, these emerging new physical\neffects have rarely been experimentally observed due to the limited choice of\nsuitable materials. Here, we predict the van der Waals layered V$_2$WS$_4$ and\nits related materials show intralayer ferromagnetic and interlayer\nantiferromagnetic exchange interactions. We find extremely rich magnetic\ntopological states in V$_2$WS$_4$, including an antiferromagnetic topological\ninsulator, the axion state with the long-sought quantized topological\nmagnetoelectric effect, three-dimensional QAH state, as well as a collection of\nQAH insulators and intrinsic axion insulators in odd- and even-layer films,\nrespectively. Remarkably, the N\\'eel temperature of V$_2$WS$_4$ is predicted to\nbe much higher than that of MnBi$_2$Te$_4$. These interesting predictions, if\nrealized experimentally, could greatly promote the topological quantum physics\nresearch and application.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:00:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jiang","Yadong",""],["Wang","Huan",""],["Bao","Kejie",""],["Wang","Jing",""]]}
{"id":"2308.15024","submitter":"Fumiya Hanamura","authors":"Fumiya Hanamura, Warit Asavanant, Seigo Kikura, Moeto Mishima,\n  Shigehito Miki, Hirotaka Terai, Masahiro Yabuno, Fumihiro China, Kosuke\n  Fukui, Mamoru Endo, and Akira Furusawa","title":"Single-shot single-mode optical two-parameter displacement estimation\n  beyond classical limit","comments":"5 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Uncertainty principle prohibits the precise measurement of both components of\ndisplacement parameters in phase space. We have theoretically shown that this\nlimit can be beaten using single-photon states, in a single-shot and\nsingle-mode setting [F. Hanamura et al., Phys. Rev. A 104, 062601 (2021)]. In\nthis paper, we validate this by experimentally beating the classical limit. In\noptics, this is the first experiment to estimate both parameters of\ndisplacement using non-Gaussian states. This result is related to many\nimportant applications, such as quantum error correction.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:05:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hanamura","Fumiya",""],["Asavanant","Warit",""],["Kikura","Seigo",""],["Mishima","Moeto",""],["Miki","Shigehito",""],["Terai","Hirotaka",""],["Yabuno","Masahiro",""],["China","Fumihiro",""],["Fukui","Kosuke",""],["Endo","Mamoru",""],["Furusawa","Akira",""]]}
{"id":"2308.15025","submitter":"Suman Kumar Banik","authors":"Tuhin Subhra Roy, Mintu Nandi, Pinaki Chaudhury, Sudip Chattopadhyay,\n  and Suman K Banik","title":"Interplay of degeneracy and non-degeneracy in fluctuations propagation\n  in coherent feed-forward loop motif","comments":"20 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.MN physics.bio-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present a stochastic framework to decipher fluctuations propagation in\nclasses of coherent feed-forward loops. The systematic contribution of the\ndirect (one-step) and indirect (two-step) pathways is considered to quantify\nfluctuations of the output node. We also consider both additive and\nmultiplicative integration mechanisms of the two parallel pathways (one-step\nand two-step). Analytical expression of the output node's coefficient of\nvariation shows contributions of intrinsic, one-step, two-step, and\ncross-interaction in closed form. We observe a diverse range of degeneracy and\nnon-degeneracy in each of the decomposed fluctuations term and their\ncontribution to the overall output fluctuations of each coherent feed-forward\nloop motif. Analysis of output fluctuations reveals a maximal level of\nfluctuations of the coherent feed-forward loop motif of type 1.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:15:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Roy","Tuhin Subhra",""],["Nandi","Mintu",""],["Chaudhury","Pinaki",""],["Chattopadhyay","Sudip",""],["Banik","Suman K",""]]}
{"id":"2308.15026","submitter":"Konstantin Merz","authors":"Krzysztof Bogdan, Konstantin Merz","title":"Subordinated Bessel heat kernels","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA math.PR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove new bounds for Bessel heat kernels and Bessel heat kernels\nsubordinated by stable subordinators. In particular, we provide a 3G inequality\nin the subordinated case.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:18:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bogdan","Krzysztof",""],["Merz","Konstantin",""]]}
{"id":"2308.15027","submitter":"Anik Saha","authors":"Anik Saha, Oktie Hassanzadeh, Alex Gittens, Jian Ni, Kavitha Srinivas,\n  Bulent Yener","title":"Improving Neural Ranking Models with Traditional IR Methods","comments":"Short paper, 4 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Neural ranking methods based on large transformer models have recently gained\nsignificant attention in the information retrieval community, and have been\nadopted by major commercial solutions. Nevertheless, they are computationally\nexpensive to create, and require a great deal of labeled data for specialized\ncorpora. In this paper, we explore a low resource alternative which is a\nbag-of-embedding model for document retrieval and find that it is competitive\nwith large transformer models fine tuned on information retrieval tasks. Our\nresults show that a simple combination of TF-IDF, a traditional keyword\nmatching method, with a shallow embedding model provides a low cost path to\ncompete well with the performance of complex neural ranking models on 3\ndatasets. Furthermore, adding TF-IDF measures improves the performance of\nlarge-scale fine tuned models on these tasks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:18:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Saha","Anik",""],["Hassanzadeh","Oktie",""],["Gittens","Alex",""],["Ni","Jian",""],["Srinivas","Kavitha",""],["Yener","Bulent",""]]}
{"id":"2308.15028","submitter":"Emily Van Milligen","authors":"Emily A Van Milligen, Eliana Jacobson, Ashlesha Patil, Gayane\n  Vardoyan, Don Towsley, and Saikat Guha","title":"Entanglement Routing over Networks with Time Multiplexed Repeaters","comments":"11 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum networks will be able to service consumers with long distance\nentanglement by use of repeater nodes that can both generate external Bell\npairs with their neighbors, iid with probability $p$, as well as perform\ninternal Bell State Measurements (BSMs) which succeed with some probability\n$q$. The actual values of these probabilities is dependent upon the\nexperimental parameters of the network in question. While global link state\nknowledge is needed to maximize the rate of entanglement generation between any\ntwo consumers, this may be an unreasonable request due to the dynamic nature of\nthe network. This work evaluates a local link state knowledge, multi-path\nrouting protocol that works with time multiplexed repeaters that are able to\nperform BSMs across different time steps. This study shows that the average\nrate increases with the time multiplexing block length, $k$, although the\ninitial latency also increases. When a step function memory decoherence model\nis introduced so that qubits are held in the quantum memory for a time\nexponentially distributed with mean $\\mu$, an optimal $k$ ($k_\\text{opt}$)\nvalue appears. As $p$ decreases or $\\mu$ increases the value of $k_\\text{opt}$\nincreases. This value is such that the benefits from time multiplexing are\nbalanced with the increased risk of losing a previously established entangled\npair.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:21:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Van Milligen","Emily A",""],["Jacobson","Eliana",""],["Patil","Ashlesha",""],["Vardoyan","Gayane",""],["Towsley","Don",""],["Guha","Saikat",""]]}
{"id":"2308.15029","submitter":"Junichi Baba","authors":"Naoki Nakatsuno, Junichi Baba (Kagoshima University)","title":"Dynamical Influence of a Central Massive Object on Double-Barred\n  Galaxies: Self-Destruction Mechanism of Secondary Bars","comments":"submitted","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Double-barred galaxies exhibit sub-kpc secondary stellar bars that are\ncrucial for channeling gases towards a central massive object (CMO) such as a\nsupermassive black hole or a nuclear star cluster. Recent $N$-body simulations\nhave uncovered a novel galaxy evolution scenario wherein the mass of the CMO\nincreases owing to the secondary bar, resulting in the eventual destruction of\nthe latter. Consequently, the CMO mass growth halts, thus suggesting a maximum\nCMO mass of $\\approx 10^{-3}$ of the stellar mass of the galaxy. This study\nfocused on backbone orbit families, particularly double-frequency orbits,\nwithin double-barred galaxies. Consequently, the dynamic influence of a CMO on\nthese orbits was investigated. The results of the study revealed the emergence\nof a new orbital resonance within the central region of the galaxy upon the\nintroduction of a CMO. Orbits subjected to this resonance become chaotic and\nfail to support the secondary bar, ultimately resulting in the destruction of\nthe entire structure. This is partly because of the inability of the secondary\nbar to obtain support from the newly generated orbit families following the\nappearance of resonance. Through the estimation of the condition of secondary\nbar destruction in realistic double-bar galaxies with varying pattern speeds,\nthe results of the study established that such destruction occurred when the\nCMO mass reached $\\approx 10^{-3}$ of the galaxy mass. Furthermore, a physical\nexplanation of the galaxy evolution scenario was provided, thereby elucidating\nthe interaction between the CMO and the secondary bar. The understanding of the\nco-evolution of the secondary bar and the CMO, based on stellar orbital motion,\nis a crucial step towards future observational studies of stars within the\nbulge of the Milky Way.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:24:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nakatsuno","Naoki","","Kagoshima University"],["Baba","Junichi","","Kagoshima University"]]}
{"id":"2308.15030","submitter":"Rui Kong","authors":"Rui Kong, Yuanchun Li, Qingtian Feng, Weijun Wang, Linghe Kong, Yunxin\n  Liu","title":"Serving MoE Models on Resource-constrained Edge Devices via Dynamic\n  Expert Swapping","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mixture of experts (MoE) is a popular technique in deep learning that\nimproves model capacity with conditionally-activated parallel neural network\nmodules (experts). However, serving MoE models in resource-constrained\nlatency-critical edge scenarios is challenging due to the significantly\nincreased model size and complexity. In this paper, we first analyze the\nbehavior pattern of MoE models in continuous inference scenarios, which leads\nto three key observations about the expert activations, including temporal\nlocality, exchangeability, and skippable computation. Based on these\nobservations, we introduce PC-MoE, an inference framework for\nresource-constrained continuous MoE model serving. The core of PC-MoE is a new\ndata structure, Parameter Committee, that intelligently maintains a subset of\nimportant experts in use to reduce resource consumption. The optimal\nconfiguration of Parameter Committee is found offline by a profiling-guided\ncommittee planner, and expert swapping and request handling at runtime are\nmanaged by an adaptive committee scheduler. To evaluate the effectiveness of\nPC-MoE, we conduct experiments using state-of-the-art MoE models on common\ncomputer vision and natural language processing tasks. The results demonstrate\noptimal trade-offs between resource consumption and model accuracy achieved by\nPC-MoE. For instance, on object detection tasks with the Swin-MoE model, our\napproach can reduce memory usage and latency by 42.34% and 18.63% with only\n0.10% accuracy degradation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:25:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kong","Rui",""],["Li","Yuanchun",""],["Feng","Qingtian",""],["Wang","Weijun",""],["Kong","Linghe",""],["Liu","Yunxin",""]]}
{"id":"2308.15031","submitter":"Grigoriy Shutov","authors":"Grigoriy Shutov, Dmitrii Semenok, Ivan A. Kruglov, Artem R. Oganov","title":"Ternary superconducting hydrides in the La-Mg-H system","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Ternary or more complex hydrogen-rich hydrides are the main hope of reaching\nroom-temperature superconductivity at high pressures. Their chemical space is\nvast and its exploration is challenging. Here we report the investigation of\nthe La-Mg-H ternary system using the evolutionary algorithm USPEX at pressures\non the range 150-300 GPa. Several ternary superconducting hydrides were found,\nincluding thermodynamically stable $P6/mmm$-LaMg$_{3}$H$_{28}$ with\n$T_{\\mathrm{C}}=164$~K at 200~GPa, $P/2m$-LaMgH$_8$, $C2/m$-La$_2$MgH$_{12}$\nand $P2/m$-La$_3$MgH$_{16}$. In addition, novel binary hydrides were predicted\nto be stable at various pressures, such as $Cm$-Mg$_6$H$_{11}$,\n$P1$-MgH$_{26}$, $Fmm2$-MgH$_{30}$, $P1$-MgH$_{38}$ and\n$R\\overline{3}m$-LaH$_{13}$. We also report several novel low-enthalpy\nmetastable phases, both ternary and binary ones. Finally, we demonstrate\nimportant methods of exploring very large chemical spaces and show how they can\nimprove crystal structure prediction.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:29:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shutov","Grigoriy",""],["Semenok","Dmitrii",""],["Kruglov","Ivan A.",""],["Oganov","Artem R.",""]]}
{"id":"2308.15032","submitter":"Beomjun Choi","authors":"Beomjun Choi and Christian Seis","title":"Finite-dimensional leading order dynamics for the fast diffusion\n  equation near extinction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The fast diffusion equation is analyzed on a bounded domain with Dirichlet\nboundary conditions, for which solutions are known to extinct in finite time.\nWe construct invariant manifolds that provide a finite-dimensional\napproximation near the vanishing solution to any prescribed convergence rate.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:30:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Choi","Beomjun",""],["Seis","Christian",""]]}
{"id":"2308.15033","submitter":"Serdarcan Dilbaz","authors":"Serdarcan Dilbaz, Hasan Saribas","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Click-Through Rate (CTR) prediction holds a pivotal place in online\nadvertising and recommender systems since CTR prediction performance directly\ninfluences the overall satisfaction of the users and the revenue generated by\ncompanies. Even so, CTR prediction is still an active area of research since it\ninvolves accurately modelling the preferences of users based on sparse and\nhigh-dimensional features where the higher-order interactions of multiple\nfeatures can lead to different outcomes. Most CTR prediction models have relied\non a single fusion and interaction learning strategy. The few CTR prediction\nmodels that have utilized multiple interaction modelling strategies have\ntreated each interaction to be self-contained. In this paper, we propose a\nnovel model named STEC that reaps the benefits of multiple interaction learning\napproaches in a single unified architecture. Additionally, our model introduces\nresidual connections from different orders of interactions which boosts the\nperformance by allowing lower level interactions to directly affect the\npredictions. Through extensive experiments on four real-world datasets, we\ndemonstrate that STEC outperforms existing state-of-the-art approaches for CTR\nprediction thanks to its greater expressive capabilities.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:35:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dilbaz","Serdarcan",""],["Saribas","Hasan",""]]}
{"id":"2308.15034","submitter":"Benjamin Marussig","authors":"Benjamin Marussig, Ren\\'e Hiemstra, Dominik Schillinger","title":"Fast immersed boundary method based on weighted quadrature","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Combining sum factorization, weighted quadrature, and row-based assembly\nenables efficient higher-order computations for tensor product splines. We aim\nto transfer these concepts to immersed boundary methods, which perform\nsimulations on a regular background mesh cut by a boundary representation that\ndefines the domain of interest. Therefore, we present a novel concept to divide\nthe support of cut basis functions to obtain regular parts suited for sum\nfactorization. These regions require special discontinuous weighted quadrature\nrules, while Gauss-like quadrature rules integrate the remaining support. Two\nlinear elasticity benchmark problems confirm the derived estimate for the\ncomputational costs of the different integration routines and their\ncombination. Although the presence of cut elements reduces the speed-up, its\ncontribution to the overall computation time declines with h-refinement.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:37:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Marussig","Benjamin",""],["Hiemstra","Ren\u00e9",""],["Schillinger","Dominik",""]]}
{"id":"2308.15035","submitter":"Thomas Van Riet","authors":"Thomas Van Riet","title":"No accelerating scaling cosmologies at string tree level?","comments":"short note, 12 pages including references","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate the scalar potential of string compactifications in the\nparametric regime where string loops and higher derivative corrections to 10d\nsupergravity can be ignored and where the fields are rolling down exponential\nslopes leading to powerlaw FLRW cosmologies, aka scaling solutions. We argue\nthat these scaling solutions, if describing an accelerating expansion, are\nlikely to be perturbatively unstable, for reasons identical to the perturbative\ninstabilities in tree-level dS vacua.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:40:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Van Riet","Thomas",""]]}
{"id":"2308.15036","submitter":"Tao Zhu","authors":"Tao Zhu","title":"Monotonicity and asymptotic behavior of solutions for Riemann-Liouville\n  fractional differential equation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we first investigate the monotonicity and limit problem of the\nfractional integral functions. By fixed point theorem and these new results of\nthe fractional integral functions, we present that the Riemann-Liouville\nfractional differential equations has at least one decreasing solution in\n$C_{1-\\beta}^{+}(0,+\\infty)$. The asymptotic behavior of solutions is also\ndiscussed under some different conditions. The novelty in this paper is that we\ninvestigate the asymptotic behavior of Riemann-Liouville fractional\ndifferential equations by the monotonicity of functions. Finally, several\nexamples are given to illustrate our main results.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:43:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhu","Tao",""]]}
{"id":"2308.15037","submitter":"Sujoy Paul","authors":"Debapriya Tula, Sujoy Paul, Gagan Madan, Peter Garst, Reeve Ingle,\n  Gaurav Aggarwal","title":"Is it an i or an l: Test-time Adaptation of Text Line Recognition Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recognizing text lines from images is a challenging problem, especially for\nhandwritten documents due to large variations in writing styles. While text\nline recognition models are generally trained on large corpora of real and\nsynthetic data, such models can still make frequent mistakes if the handwriting\nis inscrutable or the image acquisition process adds corruptions, such as\nnoise, blur, compression, etc. Writing style is generally quite consistent for\nan individual, which can be leveraged to correct mistakes made by such models.\nMotivated by this, we introduce the problem of adapting text line recognition\nmodels during test time. We focus on a challenging and realistic setting where,\ngiven only a single test image consisting of multiple text lines, the task is\nto adapt the model such that it performs better on the image, without any\nlabels. We propose an iterative self-training approach that uses feedback from\nthe language model to update the optical model, with confident self-labels in\neach iteration. The confidence measure is based on an augmentation mechanism\nthat evaluates the divergence of the prediction of the model in a local region.\nWe perform rigorous evaluation of our method on several benchmark datasets as\nwell as their corrupted versions. Experimental results on multiple datasets\nspanning multiple scripts show that the proposed adaptation method offers an\nabsolute improvement of up to 8% in character error rate with just a few\niterations of self-training at test time.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:44:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tula","Debapriya",""],["Paul","Sujoy",""],["Madan","Gagan",""],["Garst","Peter",""],["Ingle","Reeve",""],["Aggarwal","Gaurav",""]]}
{"id":"2308.15038","submitter":"Yan Guo","authors":"Wei Luo and Yan Guo","title":"Adjusting inverse regression for predictors with clustered distribution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A major family of sufficient dimension reduction (SDR) methods, called\ninverse regression, commonly require the distribution of the predictor $X$ to\nhave a linear $E(X|\\beta^\\mathsf{T}X)$ and a degenerate\n$\\mathrm{var}(X|\\beta^\\mathsf{T}X)$ for the desired reduced predictor\n$\\beta^\\mathsf{T}X$. In this paper, we adjust the first and second-order\ninverse regression methods by modeling $E(X|\\beta^\\mathsf{T}X)$ and\n$\\mathrm{var}(X|\\beta^\\mathsf{T}X)$ under the mixture model assumption on $X$,\nwhich allows these terms to convey more complex patterns and is most suitable\nwhen $X$ has a clustered sample distribution. The proposed SDR methods build a\nnatural path between inverse regression and the localized SDR methods, and in\nparticular inherit the advantages of both; that is, they are\n$\\sqrt{n}$-consistent, efficiently implementable, directly adjustable under the\nhigh-dimensional settings, and fully recovering the desired reduced predictor.\nThese findings are illustrated by simulation studies and a real data example at\nthe end, which also suggest the effectiveness of the proposed methods for\nnonclustered data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:44:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Luo","Wei",""],["Guo","Yan",""]]}
{"id":"2308.15039","submitter":"Zexin Li","authors":"Zexin Li, Aritra Samanta, Yufei Li, Andrea Soltoggio, Hyoseung Kim and\n  Cong Liu","title":"R^3: On-device Real-Time Deep Reinforcement Learning for Autonomous\n  Robotics","comments":"Accepted by RTSS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Autonomous robotic systems, like autonomous vehicles and robotic search and\nrescue, require efficient on-device training for continuous adaptation of Deep\nReinforcement Learning (DRL) models in dynamic environments. This research is\nfundamentally motivated by the need to understand and address the challenges of\non-device real-time DRL, which involves balancing timing and algorithm\nperformance under memory constraints, as exposed through our extensive\nempirical studies. This intricate balance requires co-optimizing two pivotal\nparameters of DRL training -- batch size and replay buffer size. Configuring\nthese parameters significantly affects timing and algorithm performance, while\nboth (unfortunately) require substantial memory allocation to achieve\nnear-optimal performance.\n  This paper presents R^3, a holistic solution for managing timing, memory, and\nalgorithm performance in on-device real-time DRL training. R^3 employs (i) a\ndeadline-driven feedback loop with dynamic batch sizing for optimizing timing,\n(ii) efficient memory management to reduce memory footprint and allow larger\nreplay buffer sizes, and (iii) a runtime coordinator guided by heuristic\nanalysis and a runtime profiler for dynamically adjusting memory resource\nreservations. These components collaboratively tackle the trade-offs in\non-device DRL training, improving timing and algorithm performance while\nminimizing the risk of out-of-memory (OOM) errors.\n  We implemented and evaluated R^3 extensively across various DRL frameworks\nand benchmarks on three hardware platforms commonly adopted by autonomous\nrobotic systems. Additionally, we integrate R^3 with a popular realistic\nautonomous car simulator to demonstrate its real-world applicability.\nEvaluation results show that R^3 achieves efficacy across diverse platforms,\nensuring consistent latency performance and timing predictability with minimal\noverhead.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:48:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Zexin",""],["Samanta","Aritra",""],["Li","Yufei",""],["Soltoggio","Andrea",""],["Kim","Hyoseung",""],["Liu","Cong",""]]}
{"id":"2308.15040","submitter":"Yung-Chin Chen","authors":"Yung-Chin Chen, Shimpei Ando, Daichi Fujiki, Shinya\n  Takamaeda-Yamazaki, Kentaro Yoshioka","title":"OSA-HCIM: On-The-Fly Saliency-Aware Hybrid SRAM CIM with Dynamic\n  Precision Configuration","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Computing-in-Memory (CIM) has shown great potential for enhancing efficiency\nand performance for deep neural networks (DNNs). However, the lack of\nflexibility in CIM leads to an unnecessary expenditure of computational\nresources on less critical operations, and a diminished Signal-to-Noise Ratio\n(SNR) when handling more complex tasks, significantly hindering the overall\nperformance. Hence, we focus on the integration of CIM with Saliency-Aware\nComputing -- a paradigm that dynamically tailors computing precision based on\nthe importance of each input. We propose On-the-fly Saliency-Aware Hybrid CIM\n(OSA-HCIM) offering three primary contributions: (1) On-the-fly Saliency-Aware\n(OSA) precision configuration scheme, which dynamically sets the precision of\neach MAC operation based on its saliency, (2) Hybrid CIM Array (HCIMA), which\nenables simultaneous operation of digital-domain CIM (DCIM) and analog-domain\nCIM (ACIM) via split-port 6T SRAM, and (3) an integrated framework combining\nOSA and HCIMA to fulfill diverse accuracy and power demands.\n  Implemented on a 65nm CMOS process, OSA-HCIM demonstrates an exceptional\nbalance between accuracy and resource utilization. Notably, it is the first CIM\ndesign to incorporate a dynamic digital-to-analog boundary, providing\nunprecedented flexibility for saliency-aware computing. OSA-HCIM achieves a\n1.95x enhancement in energy efficiency, while maintaining minimal accuracy loss\ncompared to DCIM when tested on CIFAR100 dataset.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:49:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Yung-Chin",""],["Ando","Shimpei",""],["Fujiki","Daichi",""],["Takamaeda-Yamazaki","Shinya",""],["Yoshioka","Kentaro",""]]}
{"id":"2308.15041","submitter":"Marta Ghirardelli","authors":"Marta Ghirardelli","title":"Optimization via conformal Hamiltonian systems on manifolds","comments":"21 pages, 6 figures, 1 page. Presented at GSI conference 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  In this work we propose a method to perform optimization on manifolds. We\nassume to have an objective function $f$ defined on a manifold and think of it\nas the potential energy of a mechanical system. By adding a momentum-dependent\nkinetic energy we define its Hamiltonian function, which allows us to write the\ncorresponding Hamiltonian system. We make it conformal by introducing a\ndissipation term: the result is the continuous model of our scheme. We solve it\nvia splitting methods (Lie-Trotter and leapfrog): we combine the RATTLE scheme,\napproximating the conserved flow, with the exact dissipated flow. The result is\na conformal symplectic method for constant stepsizes. We also propose an\nadaptive stepsize version of it. We test it on an example, the minimization of\na function defined on a sphere, and compare it with the usual gradient descent\nmethod.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:50:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghirardelli","Marta",""]]}
{"id":"2308.15042","submitter":"Xiaofan Zhou","authors":"Jingtao Fan, Xiaofan Zhou, and Suotang Jia","title":"Quantum phases of the biased two-chain-coupled Bose-Hubbard Ladder","comments":"10 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas physics.atom-ph quant-ph","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We investigate the quantum phases of bosons in a two-chain-coupled ladder.\nThis bosonic ladder is generally in a biased configuration, meaning that the\ntwo chains of the ladder can have dramatically different on-site interactions\nand potential energies. Adopting the numerical density-matrix\nrenormalization-group method, we analyze the phase transitions in various\nparameter spaces. We find signatures of both insulating-to-superfluid and\nsuperfluid-to-insulating quantum phase transitions as the interchain tunnelling\nis increased. Interestingly, tunning the interaction to some intermediate\nvalues, the system can exhibit a reentrant quantum phase transition between\ninsulating and superfluid phases. We show that for infinite interaction bias,\nthe model is amenable to some analytical treatments, whose prediction about the\nphase boundary is in great agreement with the numerical results. We finally\nclarify some critical parameters which separate the system into regimes with\ndistinct phase behaviours, and briefly compare typical properties of the biased\nand unbiased bosonic ladder systems. Our work enriches the Bose-Hubbard\nphysics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:52:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fan","Jingtao",""],["Zhou","Xiaofan",""],["Jia","Suotang",""]]}
{"id":"2308.15043","submitter":"Miloslav Znojil","authors":"Olaf Lechtenfeld and Miloslav Znojil","title":"Quasi-Hermitian quantum mechanics and a new class of user-friendly\n  matrix Hamiltonians","comments":"12 pp","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the conventional Schr\\\"{o}dinger's formulation of quantum mechanics the\nunitary evolution of a state $\\psi$ is controlled, in Hilbert space ${\\cal L}$,\nby a Hamiltonian $\\mathfrak{h}$ which must be self-adjoint. In the recent,\n``quasi-Hermitian'' reformulation of the theory one replaces $\\mathfrak{h}$ by\nits isospectral but non-Hermitian avatar $H = \\Omega^{-1}\\mathfrak{h}\\Omega$\nwith $\\Omega^\\dagger\\Omega = \\Theta \\neq I$. Although acting in another,\nmanifestly unphysical Hilbert space ${\\cal H}$, the amended Hamiltonian $H \\neq\nH^\\dagger$ can be perceived as self-adjoint with respect to the amended\ninner-product metric $\\Theta$. In our paper motivated by a generic technical\n``user-unfriendliness'' of the non-Hermiticity of $H$ we introduce and describe\na specific new family of Hamiltonians $H$ for which the metrics $\\Theta$ become\navailable in closed form.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:54:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lechtenfeld","Olaf",""],["Znojil","Miloslav",""]]}
{"id":"2308.15044","submitter":"Shunki Itadera","authors":"Shunki Itadera and Yukiyasu Domae","title":"Motion Priority Optimization Framework towards Automated and\n  Teleoperated Robot Cooperation in Industrial Recovery Scenarios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we present an optimization framework for efficient motion\npriority design between automated and teleoperated robots in an industrial\nrecovery scenario. Although robots have recently become increasingly common in\nindustrial sites, there are still challenges in achieving human-robot\ncollaboration/cooperation (HRC), where human workers and robots are engaged in\ncollaborative and cooperative tasks in a shared workspace. For example, the\ncorresponding factory cell must be suspended for safety when an industrial\nrobot drops an assembling part in the workspace. After that, a human worker is\nallowed to enter the robot workspace to address the robot recovery. This\nprocess causes non-continuous manufacturing, which leads to a productivity\nreduction. Recently, robotic teleoperation technology has emerged as a\npromising solution to enable people to perform tasks remotely and safely. This\ntechnology can be used in the recovery process in manufacturing failure\nscenarios. Our proposition involves the design of an appropriate priority\nfunction that aids in collision avoidance between the manufacturing and\nrecovery robots and facilitates continuous processes with minimal production\nloss within an acceptable risk level. This paper presents a framework,\nincluding an HRC simulator and an optimization formulation, for finding optimal\nparameters of the priority function. Through quantitative and qualitative\nexperiments, we address the proof of our novel concept and demonstrate its\nfeasibility.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 05:55:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Itadera","Shunki",""],["Domae","Yukiyasu",""]]}
{"id":"2308.15045","submitter":"Ali Abkar","authors":"Ali Abkar","title":"Hilbert-Schmidt composition-differentiation operators on the unit ball","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the notion of radial derivative to introduce\ncomposition-differentiation operators on the Hardy and Bergman spaces of the\nunit ball and the polydisk. We seek for necessary and sufficient conditions on\nthe inducing functions to ensure that the composition-differentiation operator\nis Hilbert-Schmidt.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:03:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Abkar","Ali",""]]}
{"id":"2308.15046","submitter":"Xiaoye Zheng","authors":"Xiaoye Zheng (1), Zhiyuan Wan (1), Yun Zhang (2), Rui Chang (1), David\n  Lo (3) ((1) Zhejiang University, (2) Hangzhou City University, (3) Singapore\n  Management University)","title":"A Closer Look at the Security Risks in the Rust Ecosystem","comments":"preprint of accepted TOSEM paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Rust is an emerging programming language designed for the development of\nsystems software. To facilitate the reuse of Rust code, crates.io, as a central\npackage registry of the Rust ecosystem, hosts thousands of third-party Rust\npackages. The openness of crates.io enables the growth of the Rust ecosystem\nbut comes with security risks by severe security advisories. Although Rust\nguarantees a software program to be safe via programming language features and\nstrict compile-time checking, the unsafe keyword in Rust allows developers to\nbypass compiler safety checks for certain regions of code. Prior studies\nempirically investigate the memory safety and concurrency bugs in the Rust\necosystem, as well as the usage of unsafe keywords in practice. Nonetheless,\nthe literature lacks a systematic investigation of the security risks in the\nRust ecosystem.\n  In this paper, we perform a comprehensive investigation into the security\nrisks present in the Rust ecosystem, asking ``what are the characteristics of\nthe vulnerabilities, what are the characteristics of the vulnerable packages,\nand how are the vulnerabilities fixed in practice?''. To facilitate the study,\nwe first compile a dataset of 433 vulnerabilities, 300 vulnerable code\nrepositories, and 218 vulnerability fix commits in the Rust ecosystem, spanning\nover 7 years. With the dataset, we characterize the types, life spans, and\nevolution of the disclosed vulnerabilities. We then characterize the\npopularity, categorization, and vulnerability density of the vulnerable Rust\npackages, as well as their versions and code regions affected by the disclosed\nvulnerabilities. Finally, we characterize the complexity of vulnerability fixes\nand localities of corresponding code changes, and inspect how practitioners fix\nvulnerabilities in Rust packages with various localities.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:05:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zheng","Xiaoye",""],["Wan","Zhiyuan",""],["Zhang","Yun",""],["Chang","Rui",""],["Lo","David",""]]}
{"id":"2308.15047","submitter":"Mathias Gammelgaard","authors":"Mathias Lykke Gammelgaard, Jonathan Gabel Christiansen, Anders\n  S{\\o}gaard","title":"Large language models converge toward human-like concept organization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large language models show human-like performance in knowledge extraction,\nreasoning and dialogue, but it remains controversial whether this performance\nis best explained by memorization and pattern matching, or whether it reflects\nhuman-like inferential semantics and world knowledge. Knowledge bases such as\nWikiData provide large-scale, high-quality representations of inferential\nsemantics and world knowledge. We show that large language models learn to\norganize concepts in ways that are strikingly similar to how concepts are\norganized in such knowledge bases. Knowledge bases model collective,\ninstitutional knowledge, and large language models seem to induce such\nknowledge from raw text. We show that bigger and better models exhibit more\nhuman-like concept organization, across four families of language models and\nthree knowledge graph embeddings.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:09:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gammelgaard","Mathias Lykke",""],["Christiansen","Jonathan Gabel",""],["S\u00f8gaard","Anders",""]]}
{"id":"2308.15048","submitter":"Zuo Quan Xu Dr.","authors":"Chonghu Guan, Zuo Quan Xu","title":"Optimal ratcheting of dividend payout under Brownian motion surplus","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF math.OC q-fin.GN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is concerned with a long standing optimal dividend payout problem\nin insurance subject to the so-called ratcheting constraint, that is, the\ndividend payout rate shall be non-decreasing over time. The surplus process is\nmodeled by a drifted Brownian motion process and the aim is to find the optimal\ndividend ratcheting strategy to maximize the expectation of the total\ndiscounted dividend payouts until the ruin time. Due to the path-dependent\nconstraint, the standard control theory cannot be directly applied to tackle\nthe problem. The related Hamilton-Jacobi-Bellman (HJB) equation is a new type\nof variational inequality. In the literature, it is only shown to have a\nviscosity solution, which is not strong enough to guarantee the existence of an\noptimal dividend ratcheting strategy. This paper proposes a novel partial\ndifferential equation method to study the HJB equation. We not only prove the\nthe existence and uniqueness of the solution in some stronger functional space,\nbut also prove the monotonicity, boundedness, and $C^{\\infty}$-smoothness of\nthe dividend ratcheting free boundary. Based on these results, we eventually\nderive an optimal dividend ratcheting strategy, and thus solve the open problem\ncompletely. Economically, we find that if the surplus volatility is above an\nexplicit threshold, then one should pay dividends at the maximum rate,\nregardless the surplus level. Otherwise, by contrast, the optimal dividend\nratcheting strategy relays on the surplus level and one should only ratchet up\nthe dividend payout rate when the surplus level touches the dividend ratcheting\nfree boundary.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:10:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Guan","Chonghu",""],["Xu","Zuo Quan",""]]}
{"id":"2308.15049","submitter":"Jiahui Zhang","authors":"Jiahui Zhang, Fangneng Zhan, Yingchen Yu, Kunhao Liu, Rongliang Wu,\n  Xiaoqin Zhang, Ling Shao, Shijian Lu","title":"Pose-Free Neural Radiance Fields via Implicit Pose Regularization","comments":"Accepted by ICCV2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Pose-free neural radiance fields (NeRF) aim to train NeRF with unposed\nmulti-view images and it has achieved very impressive success in recent years.\nMost existing works share the pipeline of training a coarse pose estimator with\nrendered images at first, followed by a joint optimization of estimated poses\nand neural radiance field. However, as the pose estimator is trained with only\nrendered images, the pose estimation is usually biased or inaccurate for real\nimages due to the domain gap between real images and rendered images, leading\nto poor robustness for the pose estimation of real images and further local\nminima in joint optimization. We design IR-NeRF, an innovative pose-free NeRF\nthat introduces implicit pose regularization to refine pose estimator with\nunposed real images and improve the robustness of the pose estimation for real\nimages. With a collection of 2D images of a specific scene, IR-NeRF constructs\na scene codebook that stores scene features and captures the scene-specific\npose distribution implicitly as priors. Thus, the robustness of pose estimation\ncan be promoted with the scene priors according to the rationale that a 2D real\nimage can be well reconstructed from the scene codebook only when its estimated\npose lies within the pose distribution. Extensive experiments show that IR-NeRF\nachieves superior novel view synthesis and outperforms the state-of-the-art\nconsistently across multiple synthetic and real datasets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:14:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Jiahui",""],["Zhan","Fangneng",""],["Yu","Yingchen",""],["Liu","Kunhao",""],["Wu","Rongliang",""],["Zhang","Xiaoqin",""],["Shao","Ling",""],["Lu","Shijian",""]]}
{"id":"2308.15050","submitter":"Taotao Jing","authors":"Taotao Jing, Lichen Wang, Naji Khosravan, Zhiqiang Wan, Zachary\n  Bessinger, Zhengming Ding, Sing Bing Kang","title":"iBARLE: imBalance-Aware Room Layout Estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Room layout estimation predicts layouts from a single panorama. It requires\ndatasets with large-scale and diverse room shapes to train the models. However,\nthere are significant imbalances in real-world datasets including the\ndimensions of layout complexity, camera locations, and variation in scene\nappearance. These issues considerably influence the model training performance.\nIn this work, we propose the imBalance-Aware Room Layout Estimation (iBARLE)\nframework to address these issues. iBARLE consists of (1) Appearance Variation\nGeneration (AVG) module, which promotes visual appearance domain\ngeneralization, (2) Complex Structure Mix-up (CSMix) module, which enhances\ngeneralizability w.r.t. room structure, and (3) a gradient-based layout\nobjective function, which allows more effective accounting for occlusions in\ncomplex layouts. All modules are jointly trained and help each other to achieve\nthe best performance. Experiments and ablation studies based on\nZInD~\\cite{cruz2021zillow} dataset illustrate that iBARLE has state-of-the-art\nperformance compared with other layout estimation baselines.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:20:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jing","Taotao",""],["Wang","Lichen",""],["Khosravan","Naji",""],["Wan","Zhiqiang",""],["Bessinger","Zachary",""],["Ding","Zhengming",""],["Kang","Sing Bing",""]]}
{"id":"2308.15051","submitter":"Wei He","authors":"Wei He","title":"Stability of $p$-adic valuations of Hecke L-values","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we prove $p$-stability results for the critical L-values of\nalgebraic Hecke characters over CM fields in $\\ell$-adic anticyclotomic twist\nfamily with $\\ell\\neq p$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:25:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Wei",""]]}
{"id":"2308.15052","submitter":"Naomichi Asakawa","authors":"Naomichi Asakawa and Yuichiro Sekiguchi","title":"Constraining self-interactions of a massive scalar field using scalar\n  gravitational waves from stellar core collapse","comments":"16 pages, 16 figures, 1 table","journal-ref":"Phys. Rev. D 108, 044060 (2023)","doi":"10.1103/PhysRevD.108.044060","report-no":null,"categories":"gr-qc astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We perform a comprehensive numerical study of gravitational waves from\nstellar core collapse in the massive scalar-tensor theory with the cubic and\nquartic self-interactions of the scalar field. We investigate the dependence of\ngravitational waves on the self-interaction as well as the mass of the scalar\nfield and the conformal factor. We find that gravitational-wave spectra show a\nsystematic difference between the cubic and quartic self-interactions. We also\nfind that this systematic difference is insensitive to the mass of the scalar\nfield and the conformal factor. Our results indicate that the type of the\nself-interaction could be constrained by observations of gravitational waves\nusing the future-planned detectors.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:27:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Asakawa","Naomichi",""],["Sekiguchi","Yuichiro",""]]}
{"id":"2308.15053","submitter":"Seunghyun Hwang","authors":"Jaeseok Yoon, Seunghyun Hwang, Ran Han, Jeonguk Bang, Kee-Eung Kim","title":"Adapting Text-based Dialogue State Tracker for Spoken Dialogues","comments":"8 pages, 5 figures, Accepted at the DSTC 11 Workshop to be located at\n  SIGDIAL 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Although there have been remarkable advances in dialogue systems through the\ndialogue systems technology competition (DSTC), it remains one of the key\nchallenges to building a robust task-oriented dialogue system with a speech\ninterface. Most of the progress has been made for text-based dialogue systems\nsince there are abundant datasets with written corpora while those with spoken\ndialogues are very scarce. However, as can be seen from voice assistant systems\nsuch as Siri and Alexa, it is of practical importance to transfer the success\nto spoken dialogues. In this paper, we describe our engineering effort in\nbuilding a highly successful model that participated in the speech-aware\ndialogue systems technology challenge track in DSTC11. Our model consists of\nthree major modules: (1) automatic speech recognition error correction to\nbridge the gap between the spoken and the text utterances, (2) text-based\ndialogue system (D3ST) for estimating the slots and values using slot\ndescriptions, and (3) post-processing for recovering the error of the estimated\nslot value. Our experiments show that it is important to use an explicit\nautomatic speech recognition error correction module, post-processing, and data\naugmentation to adapt a text-based dialogue state tracker for spoken dialogue\ncorpora.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:27:58 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 04:46:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yoon","Jaeseok",""],["Hwang","Seunghyun",""],["Han","Ran",""],["Bang","Jeonguk",""],["Kim","Kee-Eung",""]]}
{"id":"2308.15054","submitter":"Marius Costandin","authors":"Marius Costandin and Beniamin Costandin","title":"A Geometric Algorithm for Maximizing the Distance over an Intersection\n  of Balls to a Given Point","comments":"arXiv admin note: text overlap with arXiv:2307.13015","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.CC cs.DS cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper the authors propose a polynomial algorithm which allows the\ncomputation of the farthest in an intersection of balls to a given point under\nthree additional hypothesis: the farthest is unique, the distance to it is\nknown and its magnitude is known. As a use case the authors analyze the subset\nsum problem SSP(S,T) for a given $S\\in \\mathbb{R}^n$ and $T \\in \\mathbb{R}$.\nThe proposed approach is to write the SSP as a distance maximization over an\nintersection of balls. It was shown that the SSP has a solution if and only if\nthe maximum value of the distance has a predefined value. This together with\nthe fact that a solution is a corner of the unit hypercube, allows the authors\nto apply the proposed geometry results to find a solution to the SSP under the\nhypothesis that is unique.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:30:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Costandin","Marius",""],["Costandin","Beniamin",""]]}
{"id":"2308.15055","submitter":"Michael Ginn","authors":"Michael Ginn and Alexis Palmer","title":"Taxonomic Loss for Morphological Glossing of Low-Resource Languages","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Morpheme glossing is a critical task in automated language documentation and\ncan benefit other downstream applications greatly. While state-of-the-art\nglossing systems perform very well for languages with large amounts of existing\ndata, it is more difficult to create useful models for low-resource languages.\nIn this paper, we propose the use of a taxonomic loss function that exploits\nmorphological information to make morphological glossing more performant when\ndata is scarce. We find that while the use of this loss function does not\noutperform a standard loss function with regards to single-label prediction\naccuracy, it produces better predictions when considering the top-n predicted\nlabels. We suggest this property makes the taxonomic loss function useful in a\nhuman-in-the-loop annotation setting.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:31:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ginn","Michael",""],["Palmer","Alexis",""]]}
{"id":"2308.15056","submitter":"Junwen Luo","authors":"Yuying Jiang, Fan Bai, Zicheng Zhang, Xiaochen Ye, Zheng Liu, Zhiping\n  Shi, Jianwei Yao, Xiaojun Liu, Fangkun Zhu, Junling Li Qian Guo, Xiaoan Wang,\n  Junwen Luo","title":"A Consumer-tier based Visual-Brain Machine Interface for Augmented\n  Reality Glasses Interactions","comments":"15 pages,10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Objective.Visual-Brain Machine Interface(V-BMI) has provide a novel\ninteraction technique for Augmented Reality (AR) industries. Several\nstate-of-arts work has demonstates its high accuracy and real-time interaction\ncapbilities. However, most of the studies employ EEGs devices that are rigid\nand difficult to apply in real-life AR glasseses application sceniraros. Here\nwe develop a consumer-tier Visual-Brain Machine Inteface(V-BMI) system\nspecialized for Augmented Reality(AR) glasses interactions. Approach. The\ndeveloped system consists of a wearable hardware which takes advantages of fast\nset-up, reliable recording and comfortable wearable experience that\nspecificized for AR glasses applications. Complementing this hardware, we have\ndevised a software framework that facilitates real-time interactions within the\nsystem while accommodating a modular configuration to enhance scalability. Main\nresults. The developed hardware is only 110g and 120x85x23 mm, which with 1\nTohm and peak to peak voltage is less than 1.5 uV, and a V-BMI based angry bird\ngame and an Internet of Thing (IoT) AR applications are deisgned, we\ndemonstrated such technology merits of intuitive experience and efficiency\ninteraction. The real-time interaction accuracy is between 85 and 96\npercentages in a commercial AR glasses (DTI is 2.24s and ITR 65 bits-min ).\nSignificance. Our study indicates the developed system can provide an essential\nhardware-software framework for consumer based V-BMI AR glasses. Also, we\nderive several pivotal design factors for a consumer-grade V-BMI-based AR\nsystem: 1) Dynamic adaptation of stimulation patterns-classification methods\nvia computer vision algorithms is necessary for AR glasses applications; and 2)\nAlgorithmic localization to foster system stability and latency reduction.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:33:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jiang","Yuying",""],["Bai","Fan",""],["Zhang","Zicheng",""],["Ye","Xiaochen",""],["Liu","Zheng",""],["Shi","Zhiping",""],["Yao","Jianwei",""],["Liu","Xiaojun",""],["Zhu","Fangkun",""],["Guo","Junling Li Qian",""],["Wang","Xiaoan",""],["Luo","Junwen",""]]}
{"id":"2308.15057","submitter":"Michael Unterkalmsteiner","authors":"Henning Femmer, Michael Unterkalmsteiner, Tony Gorschek","title":"Which Requirements Artifact Quality Defects are Automatically\n  Detectable? A Case Study","comments":"2017 25th International Requirements Engineering Conference Workshops\n  (REW) (pp. 400-406)","journal-ref":null,"doi":"10.1109/REW.2017.18","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  [Context] The quality of requirements engineering artifacts, e.g.\nrequirements specifications, is acknowledged to be an important success factor\nfor projects. Therefore, many companies spend significant amounts of money to\ncontrol the quality of their RE artifacts. To reduce spending and improve the\nRE artifact quality, methods were proposed that combine manual quality control,\ni.e. reviews, with automated approaches. [Problem] So far, we have seen various\napproaches to automatically detect certain aspects in RE artifacts. However, we\nstill lack an overview what can and cannot be automatically detected.\n[Approach] Starting from an industry guideline for RE artifacts, we classify\n166 existing rules for RE artifacts along various categories to discuss the\nshare and the characteristics of those rules that can be automated. For those\nrules, that cannot be automated, we discuss the main reasons. [Contribution] We\nestimate that 53% of the 166 rules can be checked automatically either\nperfectly or with a good heuristic. Most rules need only simple techniques for\nchecking. The main reason why some rules resist automation is due to imprecise\ndefinition. [Impact] By giving first estimates and analyses of automatically\ndetectable and not automatically detectable rule violations, we aim to provide\nan overview of the potential of automated methods in requirements quality\ncontrol.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:36:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Femmer","Henning",""],["Unterkalmsteiner","Michael",""],["Gorschek","Tony",""]]}
{"id":"2308.15058","submitter":"Aljoscha Meyer MSc","authors":"Aljoscha Meyer","title":"Better Prefix Authentication","comments":"11 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present new schemes for solving prefix authentication and secure relative\ntimestamping. By casting a new light on antimonotone linking schemes, we\nimprove upon the state of the art in prefix authentication, and in timestamping\nwith rounds of bounded length. Our designs can serve as more efficient\nalternatives to certificate transparency logs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:42:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Meyer","Aljoscha",""]]}
{"id":"2308.15059","submitter":"Yiqun Diao","authors":"Yiqun Diao, Yutong Yang, Qinbin Li, Bingsheng He, Mian Lu","title":"OEBench: Investigating Open Environment Challenges in Real-World\n  Relational Data Streams","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Relational datasets are widespread in real-world scenarios and are usually\ndelivered in a streaming fashion. This type of data stream can present unique\nchallenges, such as distribution drifts, outliers, emerging classes, and\nchanging features, which have recently been described as open environment\nchallenges for machine learning. While some work has been done on incremental\nlearning for data streams, their evaluations are mostly conducted with manually\npartitioned datasets. Moreover, while several real-world streaming datasets are\navailable, it is uncertain whether these open environment challenges are\nprevalent and how existing incremental learning algorithms perform on real\ndatasets. To fill this gap, we develop an Open Environment Benchmark named\nOEBench to evaluate open environment challenges in relational data streams.\nSpecifically, we investigate 55 real-world streaming datasets and establish\nthat open environment scenarios are indeed widespread in real-world datasets,\nwhich presents significant challenges for stream learning algorithms. Through\nbenchmarks, we find that increased data quantity may not consistently enhance\nthe model accuracy when applied in open environment scenarios, where machine\nlearning models can be significantly compromised by distribution shifts,\nanomalies, or untrustworthy data within real-world data streams. The current\ntechniques are insufficient in effectively mitigating these challenges posed by\nopen environments. Thus, it is promising to conduct more researches to address\nreal-world new challenges of open environment scenarios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:43:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Diao","Yiqun",""],["Yang","Yutong",""],["Li","Qinbin",""],["He","Bingsheng",""],["Lu","Mian",""]]}
{"id":"2308.15060","submitter":"Michael Unterkalmsteiner","authors":"Markus Borg, Elizabeth Bjarnason, Michael Unterkalmsteiner, Tingting\n  Yu, Gregory Gay, Michael Felderer","title":"Summary of the 4th International Workshop on Requirements Engineering\n  and Testing (RET 2017)","comments":null,"journal-ref":null,"doi":"10.1145/3149485.3149522","report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The RET (Requirements Engineering and Testing) workshop series provides a\nmeeting point for researchers and practitioners from the two separate fields of\nRequirements Engineering (RE) and Testing. The long term aim is to build a\ncommunity and a body of knowledge within the intersection of RE and Testing,\ni.e., RET. The 4th workshop was co-located with the 25th International\nRequirements Engineering Conference (RE'17) in Lisbon, Portugal and attracted\nabout 20 participants. In line with the previous workshop instances, RET 2017 o\nered an interactive setting with a keynote, an invited talk, paper\npresentations, and a concluding hands-on exercise.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:47:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Borg","Markus",""],["Bjarnason","Elizabeth",""],["Unterkalmsteiner","Michael",""],["Yu","Tingting",""],["Gay","Gregory",""],["Felderer","Michael",""]]}
{"id":"2308.15061","submitter":"Yukun Su","authors":"Yukun Su, Yi Yang","title":"AIoT-Based Drum Transcription Robot using Convolutional Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  With the development of information technology, robot technology has made\ngreat progress in various fields. These new technologies enable robots to be\nused in industry, agriculture, education and other aspects. In this paper, we\npropose a drum robot that can automatically complete music transcription in\nreal-time, which is based on AIoT and fog computing technology. Specifically,\nthis drum robot system consists of a cloud node for data storage, edge nodes\nfor real-time computing, and data-oriented execution application nodes. In\norder to analyze drumming music and realize drum transcription, we further\npropose a light-weight convolutional neural network model to classify drums,\nwhich can be more effectively deployed in terminal devices for fast edge\ncalculations. The experimental results show that the proposed system can\nachieve more competitive performance and enjoy a variety of smart applications\nand services.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:50:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Su","Yukun",""],["Yang","Yi",""]]}
{"id":"2308.15062","submitter":"Robert Lieli","authors":"Robert P. Lieli and Augusto Nieto-Barthaburu","title":"Forecasting with Feedback","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.TH econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Systematically biased forecasts are typically interpreted as evidence of\nforecasters' irrationality and/or asymmetric loss. In this paper we propose an\nalternative explanation: when forecasts inform economic policy decisions, and\nthe resulting actions affect the realization of the forecast target itself,\nforecasts may be optimally biased even under quadratic loss. The result arises\nin environments in which the forecaster is uncertain about the decision maker's\nreaction to the forecast, which is presumably the case in most applications. We\nillustrate the empirical relevance of our theory by reviewing some stylized\nproperties of Green Book inflation forecasts and relating them to the\npredictions from our model. Our results point out that the presence of policy\nfeedback poses a challenge to traditional tests of forecast rationality.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:50:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lieli","Robert P.",""],["Nieto-Barthaburu","Augusto",""]]}
{"id":"2308.15063","submitter":"Haichao Shi","authors":"Haichao Shi, Mandi Luo, Xiao-Yu Zhang, Ran He","title":"Learning Cross-modality Information Bottleneck Representation for\n  Heterogeneous Person Re-Identification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Visible-Infrared person re-identification (VI-ReID) is an important and\nchallenging task in intelligent video surveillance. Existing methods mainly\nfocus on learning a shared feature space to reduce the modality discrepancy\nbetween visible and infrared modalities, which still leave two problems\nunderexplored: information redundancy and modality complementarity. To this\nend, properly eliminating the identity-irrelevant information as well as making\nup for the modality-specific information are critical and remains a challenging\nendeavor. To tackle the above problems, we present a novel mutual information\nand modality consensus network, namely CMInfoNet, to extract modality-invariant\nidentity features with the most representative information and reduce the\nredundancies. The key insight of our method is to find an optimal\nrepresentation to capture more identity-relevant information and compress the\nirrelevant parts by optimizing a mutual information bottleneck trade-off.\nBesides, we propose an automatically search strategy to find the most prominent\nparts that identify the pedestrians. To eliminate the cross- and intra-modality\nvariations, we also devise a modality consensus module to align the visible and\ninfrared modalities for task-specific guidance. Moreover, the global-local\nfeature representations can also be acquired for key parts discrimination.\nExperimental results on four benchmarks, i.e., SYSU-MM01, RegDB,\nOccluded-DukeMTMC, Occluded-REID, Partial-REID and Partial\\_iLIDS dataset, have\ndemonstrated the effectiveness of CMInfoNet.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:55:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shi","Haichao",""],["Luo","Mandi",""],["Zhang","Xiao-Yu",""],["He","Ran",""]]}
{"id":"2308.15064","submitter":"Ravi Prakash Singh","authors":"A. Kataria, J. A. T. Verezhak, O. Prakash, R. K. Kushwaha, A.\n  Thamizhavel, S. Ramakrishnan, M. S. Scheurer, A. D. Hillier, and R. P. Singh","title":"Broken time-reversal symmetry in cubic skutterudite-like superconductor\n  Y$_3$Ru$_4$Ge$_{13}$","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The microscopic properties of superconducting cubic skutterudite-like\nmaterial Y$_3$Ru$_4$Ge$_{13}$ are investigated using muon spin relaxation and\nrotation ($\\mu$SR) measurements. Zero-field $\\mu$SR measurements reveal the\npresence of a spontaneous internal field with a magnitude of $\\approx$ 0.18~mT\nbelow the superconducting transition temperature, indicating broken\ntime-reversal symmetry in the ground state. In line with previous experiments,\ntransverse-field $\\mu$SR measurements are consistent with a fully developed\nsuperconductivity gap in Y$_3$Ru$_4$Ge$_{13}$. Our observations point towards\nthe relevance of electronic correlations beyond electron-phonon coupling as\norigin and indicate that spin-orbit coupling is likely not the key driving\nforce behind the spontaneous breaking of time-reversal symmetry in this system.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:56:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kataria","A.",""],["Verezhak","J. A. T.",""],["Prakash","O.",""],["Kushwaha","R. K.",""],["Thamizhavel","A.",""],["Ramakrishnan","S.",""],["Scheurer","M. S.",""],["Hillier","A. D.",""],["Singh","R. P.",""]]}
{"id":"2308.15065","submitter":"Sepideh Aghamolaei","authors":"Sepideh Aghamolaei and Mohammad Ghodsi","title":"An Efficient Construction of Yao-Graph in Data-Distributed Settings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A sparse graph that preserves an approximation of the shortest paths between\nall pairs of points in a plane is called a geometric spanner. Using range trees\nof sublinear size, we design an algorithm in massively parallel computation\n(MPC) model for constructing a geometric spanner known as Yao-graph. This\nimproves the total time and the total memory of existing algorithms for\ngeometric spanners from subquadratic to near-linear.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:59:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Aghamolaei","Sepideh",""],["Ghodsi","Mohammad",""]]}
{"id":"2308.15066","submitter":"Kazuto Oshima","authors":"Kazuto Oshima","title":"Extracting vacuum expectation values from approximate vacuum prepared by\n  the adiabatic quantum computation","comments":"10pages, 4figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a procedure to extract vacuum expectation values from approximate\nvacuum prepared by the adiabatic quantum computation. We use plural ancilla\nbits with hierarchical structure, intending to gradually put up approximate\nprecision. We exhibit simulation results for a typical one-qubit system and a\ntwo-qubits system based on the (1+1)-dimensional Schwinger model using\nclassically emulated digital quantum simulator.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 06:59:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Oshima","Kazuto",""]]}
{"id":"2308.15067","submitter":"Peter Tsun Ho Pang","authors":"Peter T. H. Pang, Lars Sivertsen, Rahul Somasundaram, Tim Dietrich,\n  Srimoyee Sen, Ingo Tews, Michael Coughlin, Chris Van Den Broeck","title":"Probing Quarkyonic Matter in Neutron Stars with the Bayesian\n  Nuclear-Physics Multi-Messenger Astrophysics Framework","comments":"14 pages, 9 figures","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29118, NP3M-P2300017","categories":"nucl-th astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The interior of neutron stars contains matter at the highest densities\nrealized in our Universe. Interestingly, theoretical studies of dense matter,\nin combination with the existence of two solar mass neutron stars, indicate\nthat the speed of sound $c_s$ has to increase to values well above the\nconformal limit ($c_s^2\\sim 1/3$) before decreasing again at higher densities.\nThe decrease could be explained by either a strong first-order phase transition\nor a cross-over transition from hadronic to quark matter. The latter scenario\nleads to a pronounced peak in the speed of sound reaching values above the\nconformal limit, naturally explaining the inferred behavior. In this work, we\nuse the Nuclear-Physics Multi-Messenger Astrophysics framework \\textsc{NMMA} to\ncompare predictions of the quarkyonic matter model with astrophysical\nobservations of neutron stars, with the goal of constraining model parameters.\nAssuming quarkyonic matter to be realized within neutron stars, we find that\nthere can be a significant amount of quarks inside the core of neutron stars\nwith masses in the two solar mass range, amounting to up to $\\sim 0.13M_\\odot$,\ncontributing $\\sim 5.9\\%$ of the total mass. Furthermore, for the quarkyonic\nmatter model investigated here, the radius of a $1.4M_\\odot$ neutron star would\nbe $13.44^{+1.69}_{-1.54} (13.54^{+1.02}_{-1.04})$ km, at $95\\%$ credibility,\nwithout (with) the inclusion of AT2017gfo.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:00:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pang","Peter T. H.",""],["Sivertsen","Lars",""],["Somasundaram","Rahul",""],["Dietrich","Tim",""],["Sen","Srimoyee",""],["Tews","Ingo",""],["Coughlin","Michael",""],["Broeck","Chris Van Den",""]]}
{"id":"2308.15068","submitter":"Jiang Lin","authors":"Jiang Lin, Yaping Yan","title":"A Comprehensive Augmentation Framework for Anomaly Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data augmentation methods are commonly integrated into the training of\nanomaly detection models. Previous approaches have primarily focused on\nreplicating real-world anomalies or enhancing diversity, without considering\nthat the standard of anomaly varies across different classes, potentially\nleading to a biased training distribution.This paper analyzes crucial traits of\nsimulated anomalies that contribute to the training of reconstructive networks\nand condenses them into several methods, thus creating a comprehensive\nframework by selectively utilizing appropriate combinations.Furthermore, we\nintegrate this framework with a reconstruction-based approach and concurrently\npropose a split training strategy that alleviates the issue of overfitting\nwhile avoiding introducing interference to the reconstruction process. The\nevaluations conducted on the MVTec anomaly detection dataset demonstrate that\nour method outperforms the previous state-of-the-art approach, particularly in\nterms of object classes.To evaluate generalizability, we generate a simulated\ndataset comprising anomalies with diverse characteristics since the original\ntest samples only include specific types of anomalies and may lead to biased\nevaluations. Experimental results demonstrate that our approach exhibits\npromising potential for generalizing effectively to various unforeseen\nanomalies encountered in real-world scenarios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:00:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lin","Jiang",""],["Yan","Yaping",""]]}
{"id":"2308.15069","submitter":"Haksoo Lim","authors":"Haksoo Lim, Sewon Park, Minjung Kim, Jaehoon Lee, Seonkyu Lim, Noseong\n  Park","title":"MadSGM: Multivariate Anomaly Detection with Score-based Generative\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The time-series anomaly detection is one of the most fundamental tasks for\ntime-series. Unlike the time-series forecasting and classification, the\ntime-series anomaly detection typically requires unsupervised (or\nself-supervised) training since collecting and labeling anomalous observations\nare difficult. In addition, most existing methods resort to limited forms of\nanomaly measurements and therefore, it is not clear whether they are optimal in\nall circumstances. To this end, we present a multivariate time-series anomaly\ndetector based on score-based generative models, called MadSGM, which considers\nthe broadest ever set of anomaly measurement factors: i) reconstruction-based,\nii) density-based, and iii) gradient-based anomaly measurements. We also design\na conditional score network and its denoising score matching loss for the\ntime-series anomaly detection. Experiments on five real-world benchmark\ndatasets illustrate that MadSGM achieves the most robust and accurate\npredictions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:04:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lim","Haksoo",""],["Park","Sewon",""],["Kim","Minjung",""],["Lee","Jaehoon",""],["Lim","Seonkyu",""],["Park","Noseong",""]]}
{"id":"2308.15070","submitter":"Xinqi Lin","authors":"Xinqi Lin, Jingwen He, Ziyan Chen, Zhaoyang Lyu, Ben Fei, Bo Dai,\n  Wanli Ouyang, Yu Qiao, Chao Dong","title":"DiffBIR: Towards Blind Image Restoration with Generative Diffusion Prior","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present DiffBIR, which leverages pretrained text-to-image diffusion models\nfor blind image restoration problem. Our framework adopts a two-stage pipeline.\nIn the first stage, we pretrain a restoration module across diversified\ndegradations to improve generalization capability in real-world scenarios. The\nsecond stage leverages the generative ability of latent diffusion models, to\nachieve realistic image restoration. Specifically, we introduce an injective\nmodulation sub-network -- LAControlNet for finetuning, while the pre-trained\nStable Diffusion is to maintain its generative ability. Finally, we introduce a\ncontrollable module that allows users to balance quality and fidelity by\nintroducing the latent image guidance in the denoising process during\ninference. Extensive experiments have demonstrated its superiority over\nstate-of-the-art approaches for both blind image super-resolution and blind\nface restoration tasks on synthetic and real-world datasets. The code is\navailable at https://github.com/XPixelGroup/DiffBIR.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:11:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lin","Xinqi",""],["He","Jingwen",""],["Chen","Ziyan",""],["Lyu","Zhaoyang",""],["Fei","Ben",""],["Dai","Bo",""],["Ouyang","Wanli",""],["Qiao","Yu",""],["Dong","Chao",""]]}
{"id":"2308.15071","submitter":"Osamu Yasuda","authors":"Sho Sugama and Osamu Yasuda","title":"Octant Degeneracy and Plots of Parameter Degeneracy in Neutrino\n  Oscillations Revisited","comments":"19 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The three kinds of parameter degeneracy in neutrino oscillation, the\nintrinsic, sign and octant degeneracy, form an eight-fold degeneracy. The\nnature of this eight-fold degeneracy can be visualized on the\n($\\sin^22\\theta_{13}$, $1/\\sin^2\\theta_{23}$)-plane, through quadratic curves\ndefined by $P(\\nu_\\mu\\to\\nu_e)=$ const. and $P(\\bar{\\nu}_\\mu\\to\\bar{\\nu}_e)=$\nconst., along with a straight line $P(\\nu_\\mu\\to\\nu_\\mu)=$ const. After\n$\\theta_{13}$ was determined by reactor neutrino experiments, the intrinsic\ndegeneracy in $\\theta_{13}$ transforms into an alternative octant degeneracy in\n$\\theta_{23}$, which can potentially be resolved by incorporating the value of\n$P(\\nu_\\mu\\to\\nu_\\mu)$. In this paper, we analytically discuss whether this\noctant parameter degeneracy is resolved or persists in the future long baseline\naccelerator neutrino experiments, such as T2HK, DUNE, T2HKK and ESS$\\nu$SB. It\nis found that the energy spectra near the first oscillation maximum are\neffective in resolving the octant degeneracy, whereas those near the second\noscillation maximum are not.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:13:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sugama","Sho",""],["Yasuda","Osamu",""]]}
{"id":"2308.15072","submitter":"Hao Xuan","authors":"Hao Xuan, Peican Zhu, Xingyu Li","title":"Advancing Adversarial Robustness Through Adversarial Logit Update","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep Neural Networks are susceptible to adversarial perturbations.\nAdversarial training and adversarial purification are among the most widely\nrecognized defense strategies. Although these methods have different underlying\nlogic, both rely on absolute logit values to generate label predictions. In\nthis study, we theoretically analyze the logit difference around successful\nadversarial attacks from a theoretical point of view and propose a new\nprinciple, namely Adversarial Logit Update (ALU), to infer adversarial sample's\nlabels. Based on ALU, we introduce a new classification paradigm that utilizes\npre- and post-purification logit differences for model's adversarial robustness\nboost. Without requiring adversarial or additional data for model training, our\nclean data synthesis model can be easily applied to various pre-trained models\nfor both adversarial sample detection and ALU-based data classification.\nExtensive experiments on both CIFAR-10, CIFAR-100, and tiny-ImageNet datasets\nshow that even with simple components, the proposed solution achieves superior\nrobustness performance compared to state-of-the-art methods against a wide\nrange of adversarial attacks. Our python implementation is submitted in our\nSupplementary document and will be published upon the paper's acceptance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:13:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xuan","Hao",""],["Zhu","Peican",""],["Li","Xingyu",""]]}
{"id":"2308.15073","submitter":"Wenwen Zheng","authors":"Wenwen Zheng, Hou-Zun Chen, Xuechun Chen, and Guoliang Li","title":"Theoretical Analysis of Random Scattering Induced by Microlensing","comments":"15 pages, 6 figures, accepted for publication in Research in\n  Astronomy and Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Theoretical investigations into the deflection angle caused by microlenses\noffer a direct path to uncovering principles of the cosmological microlensing\neffect. This work specifically concentrates on the the probability density\nfunction (PDF) of the light deflection angle induced by microlenses. We have\nmade several significant improvements to the widely used formula from Katz et\nal. First, we update the coefficient from 3.05 to 1.454, resulting in a better\nfit between the theoretical PDF and our simulation results. Second, we\ndeveloped an elegant fitting formula for the PDF that can replace its integral\nrepresentation within a certain accuracy, which is numerically divergent unless\narbitrary upper limits are chosen. Third, to facilitate further theoretical\nwork in this area, we have identified a more suitable Gaussian approximation\nfor the fitting formula.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:13:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zheng","Wenwen",""],["Chen","Hou-Zun",""],["Chen","Xuechun",""],["Li","Guoliang",""]]}
{"id":"2308.15074","submitter":"Xiaotong Li","authors":"Xiaotong Li, Zixuan Hu, Yixiao Ge, Ying Shan, Ling-Yu Duan","title":"Exploring Model Transferability through the Lens of Potential Energy","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transfer learning has become crucial in computer vision tasks due to the vast\navailability of pre-trained deep learning models. However, selecting the\noptimal pre-trained model from a diverse pool for a specific downstream task\nremains a challenge. Existing methods for measuring the transferability of\npre-trained models rely on statistical correlations between encoded static\nfeatures and task labels, but they overlook the impact of underlying\nrepresentation dynamics during fine-tuning, leading to unreliable results,\nespecially for self-supervised models. In this paper, we present an insightful\nphysics-inspired approach named PED to address these challenges. We reframe the\nchallenge of model selection through the lens of potential energy and directly\nmodel the interaction forces that influence fine-tuning dynamics. By capturing\nthe motion of dynamic representations to decline the potential energy within a\nforce-driven physical model, we can acquire an enhanced and more stable\nobservation for estimating transferability. The experimental results on 10\ndownstream tasks and 12 self-supervised models demonstrate that our approach\ncan seamlessly integrate into existing ranking techniques and enhance their\nperformances, revealing its effectiveness for the model selection task and its\npotential for understanding the mechanism in transfer learning. Code will be\navailable at https://github.com/lixiaotong97/PED.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:15:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Xiaotong",""],["Hu","Zixuan",""],["Ge","Yixiao",""],["Shan","Ying",""],["Duan","Ling-Yu",""]]}
{"id":"2308.15075","submitter":"Angel Martin","authors":"Felipe Mogoll\\'on, Zaloa Fern\\'andez, Josu P\\'erez and \\'Angel\n  Mart\\'in","title":"Benchmarking 5G MEC and Cloud infrastructures for planning IoT messaging\n  of CCAM data","comments":"6 pages, 5 figures, 6 tables, IEEE International Conference on\n  Intelligent Transportation Systems","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Vehicles embed lots of sensors supporting driving and safety. Combined with\nconnectivity, they bring new possibilities for Connected, Cooperative and\nAutomated Mobility (CCAM) services that exploit local and global data for a\nwide understanding beyond the myopic view of local sensors. Internet of Things\n(IoT) messaging solutions are ideal for vehicular data as they ship core\nfeatures like the separation of geographic areas, the fusion of different\nproducers on data/sensor types, and concurrent subscription support.\nMulti-access Edge Computing (MEC) and Cloud infrastructures are key to hosting\na virtualized and distributed IoT platform. Currently, the are no benchmarks\nfor assessing the appropriate size of an IoT platform for multiple vehicular\ndata types such as text, image, binary point clouds and video-formatted\nsamples. This paper formulates and executes the tests to get a benchmarking of\nthe performance of a MEC and Cloud platform according to actors' concurrency,\ndata volumes and business levels parameters.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:19:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mogoll\u00f3n","Felipe",""],["Fern\u00e1ndez","Zaloa",""],["P\u00e9rez","Josu",""],["Mart\u00edn","\u00c1ngel",""]]}
{"id":"2308.15076","submitter":"Ivan Kassal","authors":"Daniel Balzer and Ivan Kassal","title":"Delocalisation enables efficient charge generation in organic\n  photovoltaics, even with little to no energetic offset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.chem-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Organic photovoltaics (OPVs) are promising candidates for solar-energy\nconversion, with device efficiencies continuing to increase. However, the\nprecise mechanism of how charges separate in OPVs is not well understood\nbecause low dielectric constants produce a strong attraction between the\ncharges, which they must overcome to separate. Separation has been thought to\nrequire energetic offsets at donor-acceptor interfaces, but recent materials\nhave enabled efficient charge generation with small offsets, or with none at\nall in neat materials. Here, we extend delocalised kinetic Monte Carlo (dKMC)\nto develop a three-dimensional model of charge generation that includes\ndisorder, delocalisation, and polaron formation in every step from\nphotoexcitation to charge separation. Our simulations show that delocalisation\ndramatically increases charge-generation efficiency, partly by enabling\nexcitons to dissociate in the bulk. Therefore, charge generation can be\nefficient even in devices with little to no energetic offset, including neat\nmaterials. Our findings demonstrate that the underlying quantum-mechanical\neffect that improves the charge-separation kinetics is faster and\nlonger-distance hops between delocalised states, mediated by hybridised states\nof exciton and charge-transfer character.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:20:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Balzer","Daniel",""],["Kassal","Ivan",""]]}
{"id":"2308.15077","submitter":"Caterina Ciampi","authors":"C. Ciampi, S. Piantelli, G. Casini, A. Ono, J. D. Frankland, L.\n  Baldesi, S. Barlini, B. Borderie, R. Bougault, A. Camaiani, A. Chbihi, J. A.\n  Due\\~nas, Q. Fable, D. Fabris, C. Frosin, T. G\\'enard, F. Gramegna, D.\n  Gruyer, M. Henri, B. Hong, S. Kim, A. Kordyasz, T. Kozik, M. J. Kweon, N. Le\n  Neindre, I. Lombardo, O. Lopez, T. Marchi, K. Mazurek, S. H. Nam, J. Park, M.\n  P\\^arlog, G. Pasquali, G. Poggi, A. Rebillard-Souli\\'e, A. A. Stefanini, S.\n  Upadhyaya, S. Valdr\\'e, G. Verde, E. Vient, M. Vigilante","title":"Quasiprojectile breakup and isospin equilibration at Fermi energies: an\n  indication of longer projectile-target contact times?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  An investigation of the quasiprojectile breakup channel in semiperipheral and\nperipheral collisions of $^{58,64}$Ni+$^{58,64}$Ni at 32 and 52 MeV/nucleon is\npresented. Data have been acquired in the first experimental campaign of the\nINDRA-FAZIA apparatus in GANIL. The effect of isospin diffusion between\nprojectile and target in the two asymmetric reactions has been highlighted by\nmeans of the isospin transport ratio technique, exploiting the\nneutron-to-proton ratio of the quasiprojectile reconstructed from the two\nbreakup fragments. We found evidence that, for the same reaction centrality, a\nhigher degree of relaxation of the initial isospin imbalance is achieved in the\nbreakup channel with respect to the more populated binary output, possibly\nindicating the indirect selection of specific dynamical features. We have\nproposed an interpretation based on different average projectile-target contact\ntimes related to the two exit channels under investigation, with a longer\ninteraction for the breakup channel. The time information has been extracted\nfrom AMD simulations of the studied systems coupled to GEMINI++: the model\ncalculations support the hypothesis hereby presented.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:25:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ciampi","C.",""],["Piantelli","S.",""],["Casini","G.",""],["Ono","A.",""],["Frankland","J. D.",""],["Baldesi","L.",""],["Barlini","S.",""],["Borderie","B.",""],["Bougault","R.",""],["Camaiani","A.",""],["Chbihi","A.",""],["Due\u00f1as","J. A.",""],["Fable","Q.",""],["Fabris","D.",""],["Frosin","C.",""],["G\u00e9nard","T.",""],["Gramegna","F.",""],["Gruyer","D.",""],["Henri","M.",""],["Hong","B.",""],["Kim","S.",""],["Kordyasz","A.",""],["Kozik","T.",""],["Kweon","M. J.",""],["Neindre","N. Le",""],["Lombardo","I.",""],["Lopez","O.",""],["Marchi","T.",""],["Mazurek","K.",""],["Nam","S. H.",""],["Park","J.",""],["P\u00e2rlog","M.",""],["Pasquali","G.",""],["Poggi","G.",""],["Rebillard-Souli\u00e9","A.",""],["Stefanini","A. A.",""],["Upadhyaya","S.",""],["Valdr\u00e9","S.",""],["Verde","G.",""],["Vient","E.",""],["Vigilante","M.",""]]}
{"id":"2308.15078","submitter":"Kezhi Wang","authors":"Li Dong, Feibo Jiang, Yubo Peng, Kezhi Wang, Kun Yang, Cunhua Pan,\n  Robert Schober","title":"LAMBO: Large Language Model Empowered Edge Intelligence","comments":"To be submitted for possible journal publication","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.NI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Next-generation edge intelligence is anticipated to bring huge benefits to\nvarious applications, e.g., offloading systems. However, traditional deep\noffloading architectures face several issues, including heterogeneous\nconstraints, partial perception, uncertain generalization, and lack of\ntractability. In this context, the integration of offloading with large\nlanguage models (LLMs) presents numerous advantages. Therefore, we propose an\nLLM-Based Offloading (LAMBO) framework for mobile edge computing (MEC), which\ncomprises four components: (i) Input embedding (IE), which is used to represent\nthe information of the offloading system with constraints and prompts through\nlearnable vectors with high quality; (ii) Asymmetric encoderdecoder (AED)\nmodel, which is a decision-making module with a deep encoder and a shallow\ndecoder. It can achieve high performance based on multi-head self-attention\nschemes; (iii) Actor-critic reinforcement learning (ACRL) module, which is\nemployed to pre-train the whole AED for different optimization tasks under\ncorresponding prompts; and (iv) Active learning from expert feedback (ALEF),\nwhich can be used to finetune the decoder part of the AED while adapting to\ndynamic environmental changes. Our simulation results corroborate the\nadvantages of the proposed LAMBO framework.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:25:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dong","Li",""],["Jiang","Feibo",""],["Peng","Yubo",""],["Wang","Kezhi",""],["Yang","Kun",""],["Pan","Cunhua",""],["Schober","Robert",""]]}
{"id":"2308.15079","submitter":"Robin Mueller","authors":"Robin M\\\"uller, Willi Meier, Christoph F. Wildfeuer","title":"Area Efficient Modular Reduction in Hardware for Arbitrary Static Moduli","comments":"7 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.AR cs.PF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Modular reduction is a crucial operation in many post-quantum cryptographic\nschemes, including the Kyber key exchange method or Dilithium signature scheme.\nHowever, it can be computationally expensive and pose a performance bottleneck\nin hardware implementations. To address this issue, we propose a novel approach\nfor computing modular reduction efficiently in hardware for arbitrary static\nmoduli. Unlike other commonly used methods such as Barrett or Montgomery\nreduction, the method does not require any multiplications. It is not dependent\non properties of any particular choice of modulus for good performance and low\narea consumption. Its major strength lies in its low area consumption, which\nwas reduced by 60% for optimized and up to 90% for generic Barrett\nimplementations for Kyber and Dilithium. Additionally, it is well suited for\nparallelization and pipelining and scales linearly in hardware resource\nconsumption with increasing operation width. All operations can be performed in\nthe bit-width of the modulus, rather than the size of the number being reduced.\nThis shortens carry chains and allows for faster clocking. Moreover, our method\ncan be executed in constant time, which is essential for cryptography\napplications where timing attacks can be used to obtain information about the\nsecret key.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:26:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["M\u00fcller","Robin",""],["Meier","Willi",""],["Wildfeuer","Christoph F.",""]]}
{"id":"2308.15080","submitter":"Yury Kochetkov","authors":"Yury Kochetkov","title":"A representation of a set of maps as a ribbon bipartite graph","comments":"5 pages, 9 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this purely experimental work we try to represent the set of plane maps\nwith 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this\nconstruction allows one to estimate the genus of the initial set.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:29:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kochetkov","Yury",""]]}
{"id":"2308.15081","submitter":"Hengwei Zhao","authors":"Hengwei Zhao, Xinyu Wang, Jingtao Li, Yanfei Zhong","title":"Class Prior-Free Positive-Unlabeled Learning with Taylor Variational\n  Loss for Hyperspectral Remote Sensing Imagery","comments":"Accepted to ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Positive-unlabeled learning (PU learning) in hyperspectral remote sensing\nimagery (HSI) is aimed at learning a binary classifier from positive and\nunlabeled data, which has broad prospects in various earth vision applications.\nHowever, when PU learning meets limited labeled HSI, the unlabeled data may\ndominate the optimization process, which makes the neural networks overfit the\nunlabeled data. In this paper, a Taylor variational loss is proposed for HSI PU\nlearning, which reduces the weight of the gradient of the unlabeled data by\nTaylor series expansion to enable the network to find a balance between\noverfitting and underfitting. In addition, the self-calibrated optimization\nstrategy is designed to stabilize the training process. Experiments on 7\nbenchmark datasets (21 tasks in total) validate the effectiveness of the\nproposed method. Code is at: https://github.com/Hengwei-Zhao96/T-HOneCls.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:29:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhao","Hengwei",""],["Wang","Xinyu",""],["Li","Jingtao",""],["Zhong","Yanfei",""]]}
{"id":"2308.15082","submitter":"Huaiqiang Yu","authors":"Karl Kunisch, Gengsheng Wang, Huaiqiang Yu","title":"Frequency-domain criterion on the stabilizability for\n  infinite-dimensional linear control systems","comments":"26 Pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  A quantitative frequency-domain condition related to the exponential\nstabilizability for infinite-dimensional linear control systems is presented.\nIt is proven that this condition is necessary and sufficient for the\nstabilizability of special systems, while it is a necessary condition for the\nstabilizability in general. Applications are provided.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:36:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kunisch","Karl",""],["Wang","Gengsheng",""],["Yu","Huaiqiang",""]]}
{"id":"2308.15083","submitter":"Julien Guillod","authors":"Bernard Di Martino, Chourouk El Hassanieh, Edwige Godlewski, Julien\n  Guillod, Jacques Sainte-Marie","title":"Hyperbolicity of a semi-Lagrangian formulation of the hydrostatic\n  free-surface Euler system","comments":"35 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  By a semi-Lagrangian change of coordinates, the hydrostatic Euler equations\ndescribing free-surface sheared flows is rewritten as a system of quasilinear\nequations, where stability conditions can be determined by the analysis of its\nhyperbolic structure. This new system can be written as a quasi linear system\nin time and horizontal variables and involves no more vertical derivatives.\nHowever, the coefficients in front of the horizontal derivatives include an\nintegral operator acting on the new vertical variable. The spectrum of these\noperators is studied in detail, in particular it includes a continuous part.\nRiemann invariants are then determined as conserved quantities along the\ncharacteristic curves. Examples of solutions are provided, in particular\nstationary solutions and solutions blowing-up in finite time. Eventually, we\npropose an exact multi-layer $\\mathbb{P}_0$-discretization, which could be used\nto solve numerically this semi-Lagrangian system, and analyze the eigenvalues\nof the corresponding discretized operator to investigate the hyperbolic nature\nof the approximated system.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:38:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Di Martino","Bernard",""],["Hassanieh","Chourouk El",""],["Godlewski","Edwige",""],["Guillod","Julien",""],["Sainte-Marie","Jacques",""]]}
{"id":"2308.15084","submitter":"Michele Tucci","authors":"Vittorio Cortellessa, J. Andres Diaz-Pace, Daniele Di Pompeo,\n  Sebastian Frank, Pooyan Jamshidi, Michele Tucci, Andr\\'e van Hoorn","title":"Introducing Interactions in Multi-Objective Optimization of Software\n  Architectures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Software architecture optimization aims to enhance non-functional attributes\nlike performance and reliability while meeting functional requirements.\nMulti-objective optimization employs metaheuristic search techniques, such as\ngenetic algorithms, to explore feasible architectural changes and propose\nalternatives to designers. However, the resource-intensive process may not\nalways align with practical constraints. This study investigates the impact of\ndesigner interactions on multi-objective software architecture optimization.\nDesigners can intervene at intermediate points in the fully automated\noptimization process, making choices that guide exploration towards more\ndesirable solutions. We compare this interactive approach with the fully\nautomated optimization process, which serves as the baseline. The findings\ndemonstrate that designer interactions lead to a more focused solution space,\nresulting in improved architectural quality. By directing the search towards\nregions of interest, the interaction uncovers architectures that remain\nunexplored in the fully automated process.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:49:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cortellessa","Vittorio",""],["Diaz-Pace","J. Andres",""],["Di Pompeo","Daniele",""],["Frank","Sebastian",""],["Jamshidi","Pooyan",""],["Tucci","Michele",""],["van Hoorn","Andr\u00e9",""]]}
{"id":"2308.15085","submitter":"Wenze Liu","authors":"Wenze Liu, Hao Lu, Hongtao Fu, Zhiguo Cao","title":"Learning to Upsample by Learning to Sample","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present DySample, an ultra-lightweight and effective dynamic upsampler.\nWhile impressive performance gains have been witnessed from recent kernel-based\ndynamic upsamplers such as CARAFE, FADE, and SAPA, they introduce much\nworkload, mostly due to the time-consuming dynamic convolution and the\nadditional sub-network used to generate dynamic kernels. Further, the need for\nhigh-res feature guidance of FADE and SAPA somehow limits their application\nscenarios. To address these concerns, we bypass dynamic convolution and\nformulate upsampling from the perspective of point sampling, which is more\nresource-efficient and can be easily implemented with the standard built-in\nfunction in PyTorch. We first showcase a naive design, and then demonstrate how\nto strengthen its upsampling behavior step by step towards our new upsampler,\nDySample. Compared with former kernel-based dynamic upsamplers, DySample\nrequires no customized CUDA package and has much fewer parameters, FLOPs, GPU\nmemory, and latency. Besides the light-weight characteristics, DySample\noutperforms other upsamplers across five dense prediction tasks, including\nsemantic segmentation, object detection, instance segmentation, panoptic\nsegmentation, and monocular depth estimation. Code is available at\nhttps://github.com/tiny-smart/dysample.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:50:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Wenze",""],["Lu","Hao",""],["Fu","Hongtao",""],["Cao","Zhiguo",""]]}
{"id":"2308.15086","submitter":"Yutaka Sumino","authors":"Shunsuke Tanaka and Kojiro Otoguro and Miyuki Kunihiro and Hiroki\n  Ishikawa and Yutaka Sumino","title":"Precipitation induced filament pattern of injected fluid controlled by\n  structured cell","comments":"10 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft nlin.AO nlin.PS physics.chem-ph physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mixing of two fluids can lead to the formation of precipitation. If one of\nthe fluids is injected into a confined space filled with the other, a created\nprecipitate disrupts the flow locally and intricates complex spatiotemporal\npatterns. Here, we show that such injection patterns can be controlled\nconsistently by injection rate and obstacles. Our experimental results revealed\nfilament patterns for high injection and low reaction rates, and the injection\nrate can control the number of active filaments. Furthermore, appropriately\nspaced obstacles in the cells can straighten the motion of the advancing tip of\nthe filament. A mathematical model based on a moving boundary adopting the\neffect of precipitation reproduced the phase diagram and the straight motion of\nfilaments in structured cells.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:50:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tanaka","Shunsuke",""],["Otoguro","Kojiro",""],["Kunihiro","Miyuki",""],["Ishikawa","Hiroki",""],["Sumino","Yutaka",""]]}
{"id":"2308.15087","submitter":"Philipp Stammer","authors":"Philipp Stammer","title":"On the limitations of the semi-classical picture in high harmonic\n  generation","comments":"3 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.atom-ph","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The recent progress in the quantum optical formulation of the process of high\nharmonic generation has reached a point where the successful semi-classical\nmodel shows its limitations. Until recently the light source which drives the\nprocess was considered to be provided by a laser, in agreement with the\nclassical picture. However, quantum optics allows to consider light fields\nbeyond the classical realm, such as bright squeezed vacuum or Fock states. Both\nfield states have vanishing electric field amplitudes, but can still lead to\nthe generation of high harmonic radiation for sufficiently high intensities.\nThis poses new questions about the range of validity of the semi-classical\npicture, which is the matter discussed here.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:51:04 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 08:40:53 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Stammer","Philipp",""]]}
{"id":"2308.15088","submitter":"Florent Autrusseau","authors":"Rafic Nader, Romain Bourcier, Florent Autrusseau (LTeN)","title":"Using deep learning for an automatic detection and classification of the\n  vascular bifurcations along the Circle of Willis","comments":null,"journal-ref":"Medical Image Analysis, 2023, 89, pp.102919","doi":"10.1016/j.media.2023.102919","report-no":null,"categories":"eess.IV cs.CV cs.LG q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Most of the intracranial aneurysms (ICA) occur on a specific portion of the\ncerebral vascular tree named the Circle of Willis (CoW). More particularly,\nthey mainly arise onto fifteen of the major arterial bifurcations constituting\nthis circular structure. Hence, for an efficient and timely diagnosis it is\ncritical to develop some methods being able to accurately recognize each\nBifurcation of Interest (BoI). Indeed, an automatic extraction of the\nbifurcations presenting the higher risk of developing an ICA would offer the\nneuroradiologists a quick glance at the most alarming areas. Due to the recent\nefforts on Artificial Intelligence, Deep Learning turned out to be the best\nperforming technology for many pattern recognition tasks. Moreover, various\nmethods have been particularly designed for medical image analysis purposes.\nThis study intends to assist the neuroradiologists to promptly locate any\nbifurcation presenting a high risk of ICA occurrence. It can be seen as a\nComputer Aided Diagnosis scheme, where the Artificial Intelligence facilitates\nthe access to the regions of interest within the MRI. In this work, we propose\na method for a fully automatic detection and recognition of the bifurcations of\ninterest forming the Circle of Willis. Several neural networks architectures\nhave been tested, and we thoroughly evaluate the bifurcation recognition rate.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:51:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nader","Rafic","","LTeN"],["Bourcier","Romain","","LTeN"],["Autrusseau","Florent","","LTeN"]]}
{"id":"2308.15089","submitter":"Chushan Wang","authors":"Weizhu Bao, Ying Ma, Chushan Wang","title":"Optimal error bounds on time-splitting methods for the nonlinear\n  Schr\\\"odinger equation with low regularity potential and nonlinearity","comments":"42 pages, 16 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We establish optimal error bounds on time-splitting methods for the nonlinear\nSchr\\\"odinger equation with low regularity potential and typical power-type\nnonlinearity $ f(\\rho) = \\rho^\\sigma $, where $ \\rho:=|\\psi|^2 $ is the density\nwith $ \\psi $ the wave function and $ \\sigma > 0 $ the exponent of the\nnonlinearity. For the first-order Lie-Trotter time-splitting method, optimal $\nL^2 $-norm error bound is proved for $L^\\infty$-potential and $ \\sigma > 0 $,\nand optimal $H^1$-norm error bound is obtained for $ W^{1, 4} $-potential and $\n\\sigma \\geq 1/2 $. For the second-order Strang time-splitting method, optimal $\nL^2 $-norm error bound is established for $H^2$-potential and $ \\sigma \\geq 1\n$, and optimal $H^1$-norm error bound is proved for $H^3$-potential and $\n\\sigma \\geq 3/2 $. Compared to those error estimates of time-splitting methods\nin the literature, our optimal error bounds either improve the convergence\nrates under the same regularity assumptions or significantly relax the\nregularity requirements on potential and nonlinearity for optimal convergence\norders. A key ingredient in our proof is to adopt a new technique called\n\\textit{regularity compensation oscillation} (RCO), where low frequency modes\nare analyzed by phase cancellation, and high frequency modes are estimated by\nregularity of the solution. Extensive numerical results are reported to confirm\nour error estimates and to demonstrate that they are sharp.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:53:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bao","Weizhu",""],["Ma","Ying",""],["Wang","Chushan",""]]}
{"id":"2308.15090","submitter":"Etienne Labbe","authors":"Etienne Labb\\'e (IRIT-SAMoVA), Thomas Pellegrini (IRIT-SAMoVA), Julien\n  Pinquier (IRIT-SAMoVA)","title":"Killing two birds with one stone: Can an audio captioning system also be\n  used for audio-text retrieval?","comments":"cam ready version (14/08/23)","journal-ref":"DCASE2023, Sep 2023, Tampere, Finland","doi":null,"report-no":null,"categories":"cs.CL cs.IR cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Automated Audio Captioning (AAC) aims to develop systems capable of\ndescribing an audio recording using a textual sentence. In contrast, Audio-Text\nRetrieval (ATR) systems seek to find the best matching audio recording(s) for a\ngiven textual query (Text-to-Audio) or vice versa (Audio-to-Text). These tasks\nrequire different types of systems: AAC employs a sequence-to-sequence model,\nwhile ATR utilizes a ranking model that compares audio and text representations\nwithin a shared projection subspace. However, this work investigates the\nrelationship between AAC and ATR by exploring the ATR capabilities of an\nunmodified AAC system, without fine-tuning for the new task. Our AAC system\nconsists of an audio encoder (ConvNeXt-Tiny) trained on AudioSet for audio\ntagging, and a transformer decoder responsible for generating sentences. For\nAAC, it achieves a high SPIDEr-FL score of 0.298 on Clotho and 0.472 on\nAudioCaps on average. For ATR, we propose using the standard Cross-Entropy loss\nvalues obtained for any audio/caption pair. Experimental results on the Clotho\nand AudioCaps datasets demonstrate decent recall values using this simple\napproach. For instance, we obtained a Text-to-Audio R@1 value of 0.382 for\nAu-dioCaps, which is above the current state-of-the-art method without external\ndata. Interestingly, we observe that normalizing the loss values was necessary\nfor Audio-to-Text retrieval.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:53:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Labb\u00e9","Etienne","","IRIT-SAMoVA"],["Pellegrini","Thomas","","IRIT-SAMoVA"],["Pinquier","Julien","","IRIT-SAMoVA"]]}
{"id":"2308.15091","submitter":"Zuxing Yang","authors":"Xiao-Hua Fan, Zu-Xing Yang, Peng-Hui Chen, Shunji Nishimura, Zhi-Pan\n  Li","title":"Impact of quadrupole deformation on intermediate-energy heavy-ion\n  collisions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This study employs the isospin-dependent Boltzmann-Uehling-Uhlenbeck model to\nsimulate intermediate-energy heavy-ion collisions between prolate nuclei\n$^{24}$Mg. The emphasis is on investigating the influence of centrality and\norientation in several collision scenarios. The final-state particle\nmultiplicities and anisotropic flows are primarily determined by the\neccentricity and the area of the initial overlap. This not only provides\nfeedback on the collision systems, but also, to some extent, provides a means\nto explore the fine structure inside deformed nuclei. Additionally,\nnon-polarized collisions have been further discussed. These results contribute\nto the understanding of the geometric effects in nuclear reactions, and aid in\nthe exploration of other information on reaction systems, such as the equation\nof state and nuclear high-momentum tail.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:55:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fan","Xiao-Hua",""],["Yang","Zu-Xing",""],["Chen","Peng-Hui",""],["Nishimura","Shunji",""],["Li","Zhi-Pan",""]]}
{"id":"2308.15092","submitter":"Desmond Higham J","authors":"Desmond J. Higham","title":"Can We Rely on AI?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.AI cs.LG cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the last decade, adversarial attack algorithms have revealed\ninstabilities in deep learning tools. These algorithms raise issues regarding\nsafety, reliability and interpretability in artificial intelligence; especially\nin high risk settings. From a practical perspective, there has been a war of\nescalation between those developing attack and defence strategies. At a more\ntheoretical level, researchers have also studied bigger picture questions\nconcerning the existence and computability of attacks. Here we give a brief\noverview of the topic, focusing on aspects that are likely to be of interest to\nresearchers in applied and computational mathematics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:58:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Higham","Desmond J.",""]]}
{"id":"2308.15093","submitter":"Yann Demichel","authors":"Yann Demichel (UPN SEGMI, MODAL'X)","title":"Who invented von Koch's Snowflake Curve?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.HO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A strange title, might you say: Answer is in the question! However, contrary\nto popular belief and numerous citations in the literature, the image of the\nsnowflake curve is not present or even mentioned in von Koch's original\narticles. So, where and when did the first snowflake fall? Unravel the mystery\nof the snowflake curve with us on a journey through time.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 07:58:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Demichel","Yann","","UPN SEGMI, MODAL'X"]]}
{"id":"2308.15094","submitter":"Paul Melki","authors":"Paul Melki (IMS), Lionel Bombrun (IMS), Boubacar Diallo, J\\'er\\^ome\n  Dias, Jean-Pierre da Costa (IMS)","title":"Group-Conditional Conformal Prediction via Quantile Regression\n  Calibration for Crop and Weed Classification","comments":null,"journal-ref":"2023 IEEE/CVF International Conference on Computer Vision\n  Workshops (ICCVW), IEEE/CVF, Oct 2023, Paris, France","doi":null,"report-no":null,"categories":"cs.CV cs.LG stat.AP stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As deep learning predictive models become an integral part of a large\nspectrum of precision agricultural systems, a barrier to the adoption of such\nautomated solutions is the lack of user trust in these highly complex, opaque\nand uncertain models. Indeed, deep neural networks are not equipped with any\nexplicit guarantees that can be used to certify the system's performance,\nespecially in highly varying uncontrolled environments such as the ones\ntypically faced in computer vision for agriculture.Fortunately, certain methods\ndeveloped in other communities can prove to be important for agricultural\napplications. This article presents the conformal prediction framework that\nprovides valid statistical guarantees on the predictive performance of any\nblack box prediction machine, with almost no assumptions, applied to the\nproblem of deep visual classification of weeds and crops in real-world\nconditions. The framework is exposed with a focus on its practical aspects and\nspecial attention accorded to the Adaptive Prediction Sets (APS) approach that\ndelivers marginal guarantees on the model's coverage. Marginal results are then\nshown to be insufficient to guarantee performance on all groups of individuals\nin the population as characterized by their environmental and pedo-climatic\nauxiliary data gathered during image acquisition.To tackle this shortcoming,\ngroup-conditional conformal approaches are presented: the ''classical'' method\nthat consists of iteratively applying the APS procedure on all groups, and a\nproposed elegant reformulation and implementation of the procedure using\nquantile regression on group membership indicators. Empirical results showing\nthe validity of the proposed approach are presented and compared to the\nmarginal APS then discussed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:02:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Melki","Paul","","IMS"],["Bombrun","Lionel","","IMS"],["Diallo","Boubacar","","IMS"],["Dias","J\u00e9r\u00f4me","","IMS"],["da Costa","Jean-Pierre","","IMS"]]}
{"id":"2308.15095","submitter":"Peiran Wang","authors":"Peiran Wang","title":"FedChain: An Efficient and Secure Consensus Protocol based on Proof of\n  Useful Federated Learning for Blockchain","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Blockchain has become a popular decentralized paradigm for various\napplications in the zero-trust environment. The core of the blockchain is the\nconsensus protocol, which establishes consensus among all the participants. PoW\n(Proof-of-Work) is one of the most popular consensus protocols. However, the\nPoW consensus protocol which incentives the participants to use their computing\npower to solve a meaningless hash puzzle is continuously questioned as\nenergy-wasting. To address these issues, we propose an efficient and secure\nconsensus protocol based on proof of useful federated learning for blockchain\n(called FedChain). We first propose a secure and robust blockchain architecture\nthat takes federated learning tasks as proof of work. Then a pool aggregation\nmechanism is integrated to improve the efficiency of the FedChain architecture.\nTo protect model parameter privacy for each participant within a mining pool, a\nsecret sharing-based ring-all reduce architecture is designed. We also\nintroduce a data distribution-based federated learning model optimization\nalgorithm to improve the model performance of FedChain. At last, a\nzero-knowledge proof-based federated learning model verification is introduced\nto preserve the privacy of federated learning participants while proving the\nmodel performance of federated learning participants. Our approach has been\ntested and validated through extensive experiments, demonstrating its\nperformance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:04:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Peiran",""]]}
{"id":"2308.15096","submitter":"Stefano Teso","authors":"Marc Christiansen, Lea Villadsen, Zhiqiang Zhong, Stefano Teso, Davide\n  Mottin","title":"How Faithful are Self-Explainable GNNs?","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Self-explainable deep neural networks are a recent class of models that can\noutput ante-hoc local explanations that are faithful to the model's reasoning,\nand as such represent a step forward toward filling the gap between\nexpressiveness and interpretability. Self-explainable graph neural networks\n(GNNs) aim at achieving the same in the context of graph data. This begs the\nquestion: do these models fulfill their implicit guarantees in terms of\nfaithfulness? In this extended abstract, we analyze the faithfulness of several\nself-explainable GNNs using different measures of faithfulness, identify\nseveral limitations -- both in the models themselves and in the evaluation\nmetrics -- and outline possible ways forward.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:04:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Christiansen","Marc",""],["Villadsen","Lea",""],["Zhong","Zhiqiang",""],["Teso","Stefano",""],["Mottin","Davide",""]]}
{"id":"2308.15097","submitter":"Lucien Tisserand","authors":"Lucien Tisserand (ICAR), Fr\\'ed\\'eric Armetta (SyCoSMA, LIRIS), Heike\n  Baldauf-Quilliatre (ICAR), Antoine Bouquin (SyCoSMA, LIRIS), Salima Hassas\n  (SyCoSMA, LIRIS), Mathieu Lefort (LIRIS, SyCoSMA)","title":"Sequential annotations for naturally-occurring HRI: first insights","comments":"Peer-reviewed workshop paper accepted for the ''Human-Robot\n  Conversational Interaction'' workshop that took place at the ''ACM/IEEE\n  International Conference on Human-Robot Interaction'' 2023 Conference in\n  Stockholm, Sweden","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explain the methodology we developed for improving the interactions\naccomplished by an embedded conversational agent, drawing from Conversation\nAnalytic sequential and multimodal analysis. The use case is a Pepper robot\nthat is expected to inform and orient users in a library. In order to propose\nand learn better interactive schema, we are creating a corpus of\nnaturally-occurring interactions that will be made available to the community.\nTo do so, we propose an annotation practice based on some theoretical\nunderpinnings about the use of language and multimodal resources in human-robot\ninteraction. CCS CONCEPTS $\\bullet$ Computing methodologies $\\rightarrow$\nDiscourse, dialogue and pragmatics; $\\bullet$ Human-centered computing\n$\\rightarrow$ Text input; HCI theory, concepts and models; Field studies.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:07:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tisserand","Lucien","","ICAR"],["Armetta","Fr\u00e9d\u00e9ric","","SyCoSMA, LIRIS"],["Baldauf-Quilliatre","Heike","","ICAR"],["Bouquin","Antoine","","SyCoSMA, LIRIS"],["Hassas","Salima","","SyCoSMA, LIRIS"],["Lefort","Mathieu","","LIRIS, SyCoSMA"]]}
{"id":"2308.15098","submitter":"Matthias F\\\"ugger","authors":"Johannes Bund, Matthias F\\\"ugger, Moti Medina","title":"PALS: Distributed Gradient Clocking on Chip","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Consider an arbitrary network of communicating modules on a chip, each\nrequiring a local signal telling it when to execute a computational step. There\nare three common solutions to generating such a local clock signal: (i) by\nderiving it from a single, central clock source, (ii) by local, free-running\noscillators, or (iii) by handshaking between neighboring modules. Conceptually,\neach of these solutions is the result of a perceived dichotomy in which\n(sub)systems are either clocked or asynchronous. We present a solution and its\nimplementation that lies between these extremes. Based on a distributed\ngradient clock synchronization algorithm, we show a novel design providing\nmodules with local clocks, the frequency bounds of which are almost as good as\nthose of free-running oscillators, yet neighboring modules are guaranteed to\nhave a phase offset substantially smaller than one clock cycle. Concretely,\nparameters obtained from a 15nm ASIC simulation running at 2GHz yield\nmathematical worst-case bounds of 20ps on the phase offset for a $32 \\times 32$\nnode grid network.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:09:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bund","Johannes",""],["F\u00fcgger","Matthias",""],["Medina","Moti",""]]}
{"id":"2308.15099","submitter":"Julien Ferry","authors":"Julien Ferry (LAAS-ROC), Ulrich A\\\"ivodji (ETS), S\\'ebastien Gambs\n  (UQAM), Marie-Jos\\'e Huguet (LAAS-ROC), Mohamed Siala (LAAS-ROC)","title":"Probabilistic Dataset Reconstruction from Interpretable Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Interpretability is often pointed out as a key requirement for trustworthy\nmachine learning. However, learning and releasing models that are inherently\ninterpretable leaks information regarding the underlying training data. As such\ndisclosure may directly conflict with privacy, a precise quantification of the\nprivacy impact of such breach is a fundamental problem. For instance, previous\nwork have shown that the structure of a decision tree can be leveraged to build\na probabilistic reconstruction of its training dataset, with the uncertainty of\nthe reconstruction being a relevant metric for the information leak. In this\npaper, we propose of a novel framework generalizing these probabilistic\nreconstructions in the sense that it can handle other forms of interpretable\nmodels and more generic types of knowledge. In addition, we demonstrate that\nunder realistic assumptions regarding the interpretable models' structure, the\nuncertainty of the reconstruction can be computed efficiently. Finally, we\nillustrate the applicability of our approach on both decision trees and rule\nlists, by comparing the theoretical information leak associated to either exact\nor heuristic learning algorithms. Our results suggest that optimal\ninterpretable models are often more compact and leak less information regarding\ntheir training data than greedily-built ones, for a given accuracy level.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:10:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ferry","Julien","","LAAS-ROC"],["A\u00efvodji","Ulrich","","ETS"],["Gambs","S\u00e9bastien","","UQAM"],["Huguet","Marie-Jos\u00e9","","LAAS-ROC"],["Siala","Mohamed","","LAAS-ROC"]]}
{"id":"2308.15100","submitter":"Takuya Hatomura","authors":"Takuya Hatomura","title":"The first-order Trotter decomposition in the dynamical-invariant basis","comments":"Extended abstract, poster presentation, AQIS'23","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Trotter decomposition is a basic approach to Hamiltonian simulation\n(digital quantum simulation). The first-order Trotter decomposition is the\nsimplest one, whose deviations from target dynamics are of the first order of a\nsmall coefficient in terms of the infidelity. In this paper, we consider the\nfirst-order Trotter decomposition in the dynamical-invariant basis. By using a\nstate-dependent inequality, we point out that deviations of this decomposition\nare of the second order of a small coefficient. Moreover, we also show that\nthis decomposition includes a useful example, i.e., digital implementation of\nshortcuts to adiabaticity by counterdiabatic driving.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:10:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hatomura","Takuya",""]]}
{"id":"2308.15101","submitter":"Mouhssine Koussour","authors":"N. Myrzakulov, M. Koussour, and A. Mussatayeva","title":"Quintessence-like features in the late-time cosmological evolution of\n  $f(Q)$ symmetric teleparallel gravity","comments":"Chinese Journal of Physics published version","journal-ref":"Chin. J. Phys. 85, 345-358 (2023)","doi":"10.1016/j.cjph.2023.07.003","report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we investigate the cosmological history within the framework\nof modified $f(Q)$ gravity, which proposes an alternative theory of gravity\nwhere the gravitational force is described by a non-metricity scalar. By\nemploying a parametrization scheme for the Hubble parameter, we obtain the\nexact solution to the field equations in $f(Q)$ cosmology. To constrain our\nmodel, we utilize external datasets, including 57 data points from the Hubble\ndataset, 1048 data points from the SN dataset, and six data points from the BAO\ndataset. This enables us to determine the best-fit values for the model\nparameters involved in the parameterization scheme. We analyze the cosmic\nevolution of various cosmological parameters, including the deceleration\nparameter, which exhibits the expected behavior in late-time cosmology and\nchanges its signature with redshift. Further, we present the evolution of\nenergy density, EoS parameter, and other geometrical parameters with respect to\nredshift. Furthermore, we discuss several cosmological tests and diagnostic\nanalyses. Our findings demonstrate that the late-time cosmic evolution can be\nadequately described without the need for dark energy by employing a\nparametrization scheme in modified gravity.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:10:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Myrzakulov","N.",""],["Koussour","M.",""],["Mussatayeva","A.",""]]}
{"id":"2308.15102","submitter":"Ting Chen","authors":"Ting Chen, Feng Li, Pei Yu","title":"Nilpotent center conditions in cubic switching polynomial Li\\'enard\n  systems by higher-order analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The aim of this paper is to investigate two classical problems related to\nnilpotent center conditions and bifurcation of limit cycles in switching\npolynomial systems. Due to the difficulty in calculating the Lyapunov constants\nof switching polynomial systems at non-elementary singular points, it is\nextremely difficult to use the existing Poincar\\'e-Lyapunov method to study\nthese two problems. In this paper, we develop a higher-order\nPoincar\\'e-Lyapunov method to consider the nilpotent center problem in\nswitching polynomial systems, with particular attention focused on cubic\nswitching Li\\'enard systems. With proper perturbations, explicit center\nconditions are derived for switching Li\\'enard systems at a nilpotent center,\nwhich is characterized as global. Moreover, with Bogdanov-Takens bifurcation\ntheory, the existence of five limit cycles around the nilpotent center is\nproved for a class of switching Li\\'enard systems, which is a new lower bound\nof cyclicity for such polynomial systems around a nilpotent center.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:10:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Ting",""],["Li","Feng",""],["Yu","Pei",""]]}
{"id":"2308.15103","submitter":"Pierre Portal","authors":"Jos\\'e Mar\\'ia Martell and Pierre Portal","title":"A note on Rubio de Francia's extrapolation in tent spaces and\n  applications","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Rubio de Francia extrapolation theorem is a very powerful result which\nstates that in order to show that certain operators satisfy weighted norm\ninequalities with Muckenhoupt weights it suffices to see that the corresponding\ninequalities hold for some fixed exponent, for instance $p=2$. In this paper we\nextend this result and show that this extrapolation principle allows one to\nobtain weighted estimates in tent spaces. From our extrapolation result we\nautomatically derive new estimates (and reprove some other) concerning\nCalder\\'on-Zygmund operators, operators associated with the Kato conjecture, or\nfractional operators.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:12:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Martell","Jos\u00e9 Mar\u00eda",""],["Portal","Pierre",""]]}
{"id":"2308.15104","submitter":"Johanna Ansohn McDougall","authors":"Johanna Ansohn McDougall, Alessandro Brighente, Willi Gro{\\ss}mann,\n  Ben Ansohn McDougall, Joshua Stock, Hannes Federrath","title":"LoVe is in the Air -- Location Verification of ADS-B Signals using\n  Distributed Public Sensors","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The Automatic Dependant Surveillance-Broadcast (ADS-B) message scheme was\ndesigned without any authentication or encryption of messages in place. It is\ntherefore easily possible to attack it, e.g., by injecting spoofed messages or\nmodifying the transmitted Global Navigation Satellite System (GNSS)\ncoordinates. In order to verify the integrity of the received information,\nvarious methods have been suggested, such as multilateration, the use of Kalman\nfilters, group certification, and many others. However, solutions based on\nmodifications of the standard may be difficult and too slow to be implemented\ndue to legal and regulatory issues. A vantage far less explored is the location\nverification using public sensor data. In this paper, we propose LoVe, a\nlightweight message verification approach that uses a geospatial indexing\nscheme to evaluate the trustworthiness of publicly deployed sensors and the\nADS-B messages they receive. With LoVe, new messages can be evaluated with\nrespect to the plausibility of their reported coordinates in a location\nprivacy-preserving manner, while using a data-driven and lightweight approach.\nBy testing our approach on two open datasets, we show that LoVe achieves very\nlow false positive rates (between 0 and 0.00106) and very low false negative\nrates (between 0.00065 and 0.00334) while providing a real-time compatible\napproach that scales well even with a large sensor set. Compared to currently\nexisting approaches, LoVe neither requires a large number of sensors, nor for\nmessages to be recorded by as many sensors as possible simultaneously in order\nto verify location claims. Furthermore, it can be directly applied to currently\ndeployed systems thus being backward compatible.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:13:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["McDougall","Johanna Ansohn",""],["Brighente","Alessandro",""],["Gro\u00dfmann","Willi",""],["McDougall","Ben Ansohn",""],["Stock","Joshua",""],["Federrath","Hannes",""]]}
{"id":"2308.15105","submitter":"Luisa Paoluzzi","authors":"Jean Chessa, Luisa Paoluzzi (I2M)","title":"A note on a paper by R. C. Alperin","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We point out a mistake in the statement of Corollary 2 in R. C. Alperin's\npaper on Selberg's lemma.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:13:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chessa","Jean","","I2M"],["Paoluzzi","Luisa","","I2M"]]}
{"id":"2308.15106","submitter":"Konstantin Usevich","authors":"Konstantin Usevich (CRAN), Julien Flamant (CRAN), Marianne Clausel\n  (IECL), David Brie (CRAN)","title":"On factorization of rank-one auto-correlation matrix polynomials","comments":null,"journal-ref":null,"doi":null,"report-no":"BioSiS","categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article characterizes the rank-one factorization of auto-correlation\nmatrix polynomials. We establish a sufficient and necessary uniqueness\ncondition for uniqueness of the factorization based on the greatest common\ndivisor (GCD) of multiple polynomials. In the unique case, we show that the\nfactorization can be carried out explicitly using GCDs. In the non-unique case,\nthe number of non-trivially different factorizations is given and all solutions\nare enumerated.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:14:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Usevich","Konstantin","","CRAN"],["Flamant","Julien","","CRAN"],["Clausel","Marianne","","IECL"],["Brie","David","","CRAN"]]}
{"id":"2308.15107","submitter":"Xueping Gong","authors":"Xueping Gong and Jiheng Zhang","title":"Stochastic Graph Bandit Learning with Side-Observations","comments":"arXiv admin note: text overlap with arXiv:2010.03104 by other authors","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  In this paper, we investigate the stochastic contextual bandit with general\nfunction space and graph feedback. We propose an algorithm that addresses this\nproblem by adapting to both the underlying graph structures and reward gaps. To\nthe best of our knowledge, our algorithm is the first to provide a\ngap-dependent upper bound in this stochastic setting, bridging the research gap\nleft by the work in [35]. In comparison to [31,33,35], our method offers\nimproved regret upper bounds and does not require knowledge of graphical\nquantities. We conduct numerical experiments to demonstrate the computational\nefficiency and effectiveness of our approach in terms of regret upper bounds.\nThese findings highlight the significance of our algorithm in advancing the\nfield of stochastic contextual bandits with graph feedback, opening up avenues\nfor practical applications in various domains.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:14:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gong","Xueping",""],["Zhang","Jiheng",""]]}
{"id":"2308.15108","submitter":"Qian Wan","authors":"Qian Wan, Rodolfo Garc\\'ia-Flores, Simon A. Bowly, Philip Kilby,\n  Andreas T. Ernst","title":"The Agricultural Spraying Vehicle Routing Problem With Splittable Edge\n  Demands","comments":"25 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In horticulture, spraying applications occur multiple times throughout any\ncrop year. This paper presents a splittable agricultural chemical sprayed\nvehicle routing problem and formulates it as a mixed integer linear program.\nThe main difference from the classical capacitated arc routing problem (CARP)\nis that our problem allows us to split the demand on a single demand edge\namongst robotics sprayers. We are using theoretical insights about the optimal\nsolution structure to improve the formulation and provide two different\nformulations of the splittable capacitated arc routing problem (SCARP), a basic\nspray formulation and a large edge demands formulation for large edge demands\nproblems. This study presents solution methods consisting of lazy constraints,\nsymmetry elimination constraints, and a heuristic repair method. Computational\nexperiments on a set of valuable data based on the properties of real-world\nagricultural orchard fields reveal that the proposed methods can solve the\nSCARP with different properties. We also report computational results on\nclassical benchmark sets from previous CARP literature. The tested results\nindicated that the SCARP model can provide cheaper solutions in some instances\nwhen compared with the classical CARP literature. Besides, the heuristic repair\nmethod significantly improves the quality of the solution by decreasing the\nupper bound when solving large-scale problems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:17:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wan","Qian",""],["Garc\u00eda-Flores","Rodolfo",""],["Bowly","Simon A.",""],["Kilby","Philip",""],["Ernst","Andreas T.",""]]}
{"id":"2308.15109","submitter":"Henghao Zhao","authors":"Henghao Zhao, Kevin Qinghong Lin, Rui Yan and Zechao Li","title":"DiffusionVMR: Diffusion Model for Video Moment Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Video moment retrieval is a fundamental visual-language task that aims to\nretrieve target moments from an untrimmed video based on a language query.\nExisting methods typically generate numerous proposals manually or via\ngenerative networks in advance as the support set for retrieval, which is not\nonly inflexible but also time-consuming. Inspired by the success of diffusion\nmodels on object detection, this work aims at reformulating video moment\nretrieval as a denoising generation process to get rid of the inflexible and\ntime-consuming proposal generation. To this end, we propose a novel\nproposal-free framework, namely DiffusionVMR, which directly samples random\nspans from noise as candidates and introduces denoising learning to ground\ntarget moments. During training, Gaussian noise is added to the real moments,\nand the model is trained to learn how to reverse this process. In inference, a\nset of time spans is progressively refined from the initial noise to the final\noutput. Notably, the training and inference of DiffusionVMR are decoupled, and\nan arbitrary number of random spans can be used in inference without being\nconsistent with the training phase. Extensive experiments conducted on three\nwidely-used benchmarks (i.e., QVHighlight, Charades-STA, and TACoS) demonstrate\nthe effectiveness of the proposed DiffusionVMR by comparing it with\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:20:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhao","Henghao",""],["Lin","Kevin Qinghong",""],["Yan","Rui",""],["Li","Zechao",""]]}
{"id":"2308.15110","submitter":"Martin Turbet","authors":"Martin Turbet, Thomas J. Fauchez, Jeremy Leconte, Emeline Bolmont,\n  Guillaume Chaverot, Francois Forget, Ehouarn Millour, Franck Selsis, Benjamin\n  Charnay, Elsa Ducrot, Micha\\\"el Gillon, Alice Maurel, Geronimo L. Villanueva","title":"Water Condensation Zones around Main Sequence Stars","comments":"Accepted for publication in Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP physics.ao-ph physics.geo-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the set of conditions that allow rocky planets to have liquid\nwater on their surface -- in the form of lakes, seas or oceans -- is a major\nscientific step to determine the fraction of planets potentially suitable for\nthe emergence and development of life as we know it on Earth. This effort is\nalso necessary to define and refine the so-called \"Habitable Zone\" (HZ) in\norder to guide the search for exoplanets likely to harbor remotely detectable\nlife forms. Until now, most numerical climate studies on this topic have\nfocused on the conditions necessary to maintain oceans, but not to form them in\nthe first place. Here we use the three-dimensional Generic Planetary Climate\nModel (PCM), historically known as the LMD Generic Global Climate Model (GCM),\nto simulate water-dominated planetary atmospheres around different types of\nMain-Sequence stars. The simulations are designed to reproduce the conditions\nof early ocean formation on rocky planets due to the condensation of the\nprimordial water reservoir at the end of the magma ocean phase. We show that\nthe incoming stellar radiation (ISR) required to form oceans by condensation is\nalways drastically lower than that required to vaporize oceans. We introduce a\nWater Condensation Limit, which lies at significantly lower ISR than the inner\nedge of the HZ calculated with three-dimensional numerical climate simulations.\nThis difference is due to a behavior change of water clouds, from low-altitude\ndayside convective clouds to high-altitude nightside stratospheric clouds.\nFinally, we calculated transit spectra, emission spectra and thermal phase\ncurves of TRAPPIST-1b, c and d with H2O-rich atmospheres, and compared them to\nCO2 atmospheres and bare rock simulations. We show using these observables that\nJWST has the capability to probe steam atmospheres on low-mass planets, and\ncould possibly test the existence of nightside water clouds.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:23:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Turbet","Martin",""],["Fauchez","Thomas J.",""],["Leconte","Jeremy",""],["Bolmont","Emeline",""],["Chaverot","Guillaume",""],["Forget","Francois",""],["Millour","Ehouarn",""],["Selsis","Franck",""],["Charnay","Benjamin",""],["Ducrot","Elsa",""],["Gillon","Micha\u00ebl",""],["Maurel","Alice",""],["Villanueva","Geronimo L.",""]]}
{"id":"2308.15111","submitter":"Mikhail Levchenko Mr","authors":"Elena Stoykova, Lian Nedelchev, Blaga Blagoeva, Branimir Ivanov,\n  Mikhail Levchenko, Nataliya Berberova-Buhova, Dimana Nazarova","title":"Intensity-based dynamic speckle method for analysis of variable-rate\n  dynamic events","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study efficiency of intensity-based dynamic speckle method for\ncharacterization of dynamic events which occur at variable rate in time within\nthe temporal averaging interval. We checked ability of the method to describe\nthe speed evolution by i) numerical simulation at variable speed, ii)\nprocessing of speckle patterns obtained from phase distributions fed to a SLM\nat controllable change of the temporal correlation radius of speckle intensity\nfluctuations and iii) conducting experiments with a polymer solution drying by\nusing a hot-stage. The numerical and SLM simulation experiments allowed for\nmodification of the used estimates in order to obtain relevant information\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:23:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Stoykova","Elena",""],["Nedelchev","Lian",""],["Blagoeva","Blaga",""],["Ivanov","Branimir",""],["Levchenko","Mikhail",""],["Berberova-Buhova","Nataliya",""],["Nazarova","Dimana",""]]}
{"id":"2308.15112","submitter":"Charalampos Antoniadis","authors":"Antonios Tragoudaras, Charalampos Antoniadis and Yehia Massoud","title":"Best Memory Architecture Exploration under Parameters Variations\n  accelerated with Machine Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AR","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The design of effective memory architecture is of utmost importance in modern\ncomputing systems. However, the design of memory subsystems is even more\ndifficult today because process variation and modern design techniques like\ndynamic voltage scaling make performance metrics for memory assessment be\ntreated as random variables instead of scalars at design time. Most of the\nprevious works have studied the design of memory design from the yield analysis\nperspective leaving the question of the best memory organization on average\nopen. Because examining all possible combinations of design parameter values of\na memory chip would require prohibitively much time, in this work, we propose\nBest Arm Identification (BAI) algorithms to accelerate the exploration for the\nbest memory architecture on average under parameter variations. Our\nexperimental results demonstrate that we can arrive at the best memory\norganization 99% of the time in x5 faster than an exhaustive search of all\npossible conditions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:26:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tragoudaras","Antonios",""],["Antoniadis","Charalampos",""],["Massoud","Yehia",""]]}
{"id":"2308.15113","submitter":"Vladimir Mangazeev","authors":"Vladimir V. Mangazeev, Bryte Hagan, Vladimir V. Bazhanov","title":"Corner Transfer Matrix Approach to the Yang-Lee Singularity in the 2D\n  Ising Model in a magnetic field","comments":"15 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th cond-mat.stat-mech math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the 2D Ising model in a complex magnetic field in the vicinity of\nthe Yang-Lee edge singularity. By using Baxter's variational corner transfer\nmatrix method combined with analytic techniques, we numerically calculate the\nscaling function and obtain an accurate estimate of the location of the\nYang-Lee singularity. The existing series expansions for susceptibility of the\n2D Ising model on a triangular lattice by Chan, Guttmann, Nickel and Perk\nallowed us to substantially enhance the accuracy of our calculations. Our\nresults are in excellent agreement with the Ising field theory calculations by\nFonseca, Zamolodchikov and the recent work by Xu and Zamolodchikov. In\nparticular, we numerically confirm an agreement between the leading singular\nbehavior of the scaling function and the predictions of the ${\\mathcal\nM}_{2/5}$ conformal field theory.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:26:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mangazeev","Vladimir V.",""],["Hagan","Bryte",""],["Bazhanov","Vladimir V.",""]]}
{"id":"2308.15114","submitter":"Saieed Akbari","authors":"S. Akbari, M. Azimian, A. Fazli Khani, B. Samimi, and E. Zahiri","title":"2-Coupon Coloring of Cubic Graphs Containing 3-Cycle or 4-Cycle","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of\nvertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$.\nRecently, the following question was proposed: \"Is it true that every connected\ncubic graph containing a $3$-cycle has two vertex disjoint total dominating\nsets?\" In this paper, we give a negative answer to this question. Moreover, we\nprove that if we replace $3$-cycle with $4$-cycle the answer is affirmative.\nThis implies every connected cubic graph containing a diamond (the complete\ngraph of order $4$ minus one edge) as a subgraph can be partitioned into two\ntotal dominating sets, a result that was proved in 2017.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:27:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Akbari","S.",""],["Azimian","M.",""],["Khani","A. Fazli",""],["Samimi","B.",""],["Zahiri","E.",""]]}
{"id":"2308.15115","submitter":"Bo Liu","authors":"Shuai Li, Rui Tian, Huan Wang, Min Liu, Liangchao Chen, Bo Liu","title":"Topological flat band with higher winding number in a superradiance\n  lattice","comments":"5 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A five-level M-type scheme in atomic ensembles is proposed to generate a\none-dimensional bipartite superradiance lattice in momentum space. By taking\nadvantage of this tunable atomic system, we show that various types of\nSu-Schrieffer-Heeger (SSH) model, including the standard SSH and extended SSH\nmodel, can be realized. Interestingly, it is shown that through changing the\nRabi frequencies and detunings in our proposed scheme, there is a topological\nphase transition from topological trivial regime with winding number being 0 to\ntopological non-trivial regime with winding number being 2. Furthermore, a\nrobust flat band with higher winding number (being 2) can be achieved in the\nabove topological non-trivial regime, where the superradiance spectra can be\nutilized as a tool for experimental detection. Our proposal would provide a\npromising approach to explore new physics, such as fractional topological\nphases, in the flat bands with higher topological number.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:28:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Shuai",""],["Tian","Rui",""],["Wang","Huan",""],["Liu","Min",""],["Chen","Liangchao",""],["Liu","Bo",""]]}
{"id":"2308.15116","submitter":"Jingbang Chen","authors":"Jingbang Chen, Yian Wang, Xingwei Qu, Shuangjia Zheng, Yaodong Yang,\n  Hao Dong, Jie Fu","title":"Mixup-Augmented Meta-Learning for Sample-Efficient Fine-Tuning of\n  Protein Simulators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI q-bio.BM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Molecular dynamics simulations have emerged as a fundamental instrument for\nstudying biomolecules. At the same time, it is desirable to perform simulations\nof a collection of particles under various conditions in which the molecules\ncan fluctuate. In this paper, we explore and adapt the soft prompt-based\nlearning method to molecular dynamics tasks. Our model can remarkably\ngeneralize to unseen and out-of-distribution scenarios with limited training\ndata. While our work focuses on temperature as a test case, the versatility of\nour approach allows for efficient simulation through any continuous dynamic\nconditions, such as pressure and volumes. Our framework has two stages: 1)\nPre-trains with data mixing technique, augments molecular structure data and\ntemperature prompts, then applies a curriculum learning method by increasing\nthe ratio of them smoothly. 2) Meta-learning-based fine-tuning framework\nimproves sample-efficiency of fine-tuning process and gives the soft\nprompt-tuning better initialization points. Comprehensive experiments reveal\nthat our framework excels in accuracy for in-domain data and demonstrates\nstrong generalization capabilities for unseen and out-of-distribution samples.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:29:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Jingbang",""],["Wang","Yian",""],["Qu","Xingwei",""],["Zheng","Shuangjia",""],["Yang","Yaodong",""],["Dong","Hao",""],["Fu","Jie",""]]}
{"id":"2308.15117","submitter":"Aurelien Barrau","authors":"Aur\\'elien Barrau, Baptiste Blachier, Maxime Lahlou, Andrew Liu,\n  Killian Martineau","title":"Einstein vs Hawking: Black hole binaries and cosmological expansion","comments":"13 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.CO hep-ph hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This note aims at investigating two different situations where the classical\ngeneral relativistic dynamics compete with the evolution driven by Hawking\nevaporation. We focus, in particular, on binary systems of black holes emitting\ngravitational waves and gravitons, and on the cosmological evolution when black\nholes are immersed in their own radiation bath. Several non-trivial features\nare underlined in both cases.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:33:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Barrau","Aur\u00e9lien",""],["Blachier","Baptiste",""],["Lahlou","Maxime",""],["Liu","Andrew",""],["Martineau","Killian",""]]}
{"id":"2308.15118","submitter":"Mu-Tien Kuo","authors":"Mu-Tien Kuo, Chih-Chung Hsueh, Richard Tzong-Han Tsai","title":"Large Language Models on the Chessboard: A Study on ChatGPT's Formal\n  Language Comprehension and Complex Reasoning Skills","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  While large language models have made strides in natural language processing,\ntheir proficiency in complex reasoning tasks requiring formal language\ncomprehension, such as chess, remains less investigated. This paper probes the\nperformance of ChatGPT, a sophisticated language model by OpenAI in tackling\nsuch complex reasoning tasks, using chess as a case study. Through robust\nmetrics examining both the legality and quality of moves, we assess ChatGPT's\nunderstanding of the chessboard, adherence to chess rules, and strategic\ndecision-making abilities. Our evaluation identifies limitations within\nChatGPT's attention mechanism that affect its formal language comprehension and\nuncovers the model's underdeveloped self-regulation abilities. Our study also\nreveals ChatGPT's propensity for a coherent strategy in its gameplay and a\nnoticeable uptick in decision-making assertiveness when the model is presented\nwith a greater volume of natural language or possesses a more lucid\nunderstanding of the state of the chessboard. These findings contribute to the\ngrowing exploration of language models' abilities beyond natural language\nprocessing, providing valuable information for future research towards models\ndemonstrating human-like cognitive abilities.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:36:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kuo","Mu-Tien",""],["Hsueh","Chih-Chung",""],["Tsai","Richard Tzong-Han",""]]}
{"id":"2308.15119","submitter":"R. Yamamoto Ravenor","authors":"R. Yamamoto Ravenor","title":"AI-Based Facial Emotion Recognition Solutions for Education: A Study of\n  Teacher-User and Other Categories","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CV cs.CY cs.HC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing information on AI-based facial emotion recognition (FER) is not\neasily comprehensible by those outside the field of computer science, requiring\ncross-disciplinary effort to determine a categorisation framework that promotes\nthe understanding of this technology, and its impact on users. Most proponents\nclassify FER in terms of methodology, implementation and analysis; relatively\nfew by its application in education; and none by its users. This paper is\nconcerned primarily with (potential) teacher-users of FER tools for education.\nIt proposes a three-part classification of these teachers, by orientation,\ncondition and preference, based on a classical taxonomy of affective\neducational objectives, and related theories. It also compiles and organises\nthe types of FER solutions found in or inferred from the literature into\n\"technology\" and \"applications\" categories, as a prerequisite for structuring\nthe proposed \"teacher-user\" category. This work has implications for\nproponents', critics', and users' understanding of the relationship between\nteachers and FER.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:37:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ravenor","R. Yamamoto",""]]}
{"id":"2308.15120","submitter":"Robert Szafarczyk","authors":"Robert Szafarczyk, Syed Waqar Nabi, and Wim Vanderbauwhede","title":"Compiler Discovered Dynamic Scheduling of Irregular Code in High-Level\n  Synthesis","comments":"To appear in the 33rd International Conference on Field-Programmable\n  Logic and Applications (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dynamically scheduled high-level synthesis (HLS) achieves higher throughput\nthan static HLS for codes with unpredictable memory accesses and control flow.\nHowever, excessive dataflow scheduling results in circuits that use more\nresources and have a slower critical path, even when only a part of the circuit\nexhibits dynamic behavior. Recent work has shown that marking parts of a\ndataflow circuit for static scheduling can save resources and improve\nperformance (hybrid scheduling), but the dynamic part of the circuit still\nbottlenecks the critical path. We propose instead to selectively introduce\ndynamic scheduling into static HLS. This paper presents an algorithm for\nidentifying code regions amenable to dynamic scheduling and shows a methodology\nfor introducing dynamically scheduled basic blocks, loops, and memory\noperations into static HLS. Our algorithm is informed by modulo-scheduling and\ncan be integrated into any modulo-scheduled HLS tool. On a set of ten\nbenchmarks, we show that our approach achieves on average an up to 3.7$\\times$\nand 3$\\times$ speedup against dynamic and hybrid scheduling, respectively, with\nan area overhead of 1.3$\\times$ and frequency degradation of 0.74$\\times$ when\ncompared to static HLS.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:37:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Szafarczyk","Robert",""],["Nabi","Syed Waqar",""],["Vanderbauwhede","Wim",""]]}
{"id":"2308.15121","submitter":"Erwan Lanneau","authors":"Sylvain Crovisier, Pascal Hubert, Erwan Lanneau, Angel Pardo","title":"Diffusion rate in non-generic directions in the wind-tree model","comments":"26 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that any real number in [0,1) is a diffusion rate for the wind-tree\nmodel with rational parameters. We will also provide a criterion in order to\ndescribe the shape of the Lyapunov spectrum of cocycles obtained as suspension\nof a representation. As an application, we exhibit an infinite family of\nwind-tree billiards for which the interior of the Lyapunov spectrum is a big as\npossible: this is the full square (0,1)^2. To the best of the knowledge of the\nauthors, these are the first complete descriptions where the interior of the\nLyapunov spectrum is known explicitly in dimension two, even for general\nFuchsian groups.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:40:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Crovisier","Sylvain",""],["Hubert","Pascal",""],["Lanneau","Erwan",""],["Pardo","Angel",""]]}
{"id":"2308.15122","submitter":"Changze Lv","authors":"Changze Lv, Tianlong Li, Jianhan Xu, Chenxi Gu, Zixuan Ling, Cenyuan\n  Zhang, Xiaoqing Zheng, Xuanjing Huang","title":"SpikeBERT: A Language Spikformer Trained with Two-Stage Knowledge\n  Distillation from BERT","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spiking neural networks (SNNs) offer a promising avenue to implement deep\nneural networks in a more energy-efficient way. However, the network\narchitectures of existing SNNs for language tasks are too simplistic, and deep\narchitectures have not been fully explored, resulting in a significant\nperformance gap compared to mainstream transformer-based networks such as BERT.\nTo this end, we improve a recently-proposed spiking transformer (i.e.,\nSpikformer) to make it possible to process language tasks and propose a\ntwo-stage knowledge distillation method for training it, which combines\npre-training by distilling knowledge from BERT with a large collection of\nunlabelled texts and fine-tuning with task-specific instances via knowledge\ndistillation again from the BERT fine-tuned on the same training examples.\nThrough extensive experimentation, we show that the models trained with our\nmethod, named SpikeBERT, outperform state-of-the-art SNNs and even achieve\ncomparable results to BERTs on text classification tasks for both English and\nChinese with much less energy consumption.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:41:16 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 09:03:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Lv","Changze",""],["Li","Tianlong",""],["Xu","Jianhan",""],["Gu","Chenxi",""],["Ling","Zixuan",""],["Zhang","Cenyuan",""],["Zheng","Xiaoqing",""],["Huang","Xuanjing",""]]}
{"id":"2308.15123","submitter":"Robin De Meyer","authors":"Lukas Gr\\\"unewald, Dmitry Chezganov, Robin De Meyer, Andrey Orekhov,\n  Sandra Van Aert, Annemie Bogaerts, Sara Bals and Jo Verbeeck","title":"In-situ Plasma Studies using a Direct Current Microplasma in a Scanning\n  Electron Microscope","comments":"LG, DC, and RDM contributed equally to this work. The videos\n  mentioned in the manuscript can be found in the Zenodo repository linked in\n  the paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Microplasmas can be used for a wide range of technological applications and\nto improve our understanding of fundamental physics. Scanning electron\nmicroscopy, on the other hand, provides insights into the sample morphology and\nchemistry of materials from the mm-down to the nm-scale. Combining both would\nprovide direct insight into plasma-sample interactions in real-time and at high\nspatial resolution. Up till now, very few attempts in this direction have been\nmade, and significant challenges remain. This work presents a stable direct\ncurrent glow discharge microplasma setup built inside a scanning electron\nmicroscope. The experimental setup is capable of real-time in-situ imaging of\nthe sample evolution during plasma operation and it demonstrates localized\nsputtering and sample oxidation. Further, the experimental parameters such as\nvarying gas mixtures, electrode polarity, and field strength are explored and\nexperimental $V$-$I$ curves under various conditions are provided. These\nresults demonstrate the capabilities of this setup in potential investigations\nof plasma physics, plasma-surface interactions, and materials science and its\npractical applications. The presented setup shows the potential to have several\ntechnological applications, e.g., to locally modify the sample surface (e.g.,\nlocal oxidation and ion implantation for nanotechnology applications) on the\n$\\mu$m-scale.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:41:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gr\u00fcnewald","Lukas",""],["Chezganov","Dmitry",""],["De Meyer","Robin",""],["Orekhov","Andrey",""],["Van Aert","Sandra",""],["Bogaerts","Annemie",""],["Bals","Sara",""],["Verbeeck","Jo",""]]}
{"id":"2308.15124","submitter":"Isobel Davies","authors":"Isobel Davies","title":"Characterising trees and hyperbolic spaces by their boundaries","comments":"15 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.MG math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the language of proper CAT(-1) spaces to study thick, locally compact\ntrees, the real, complex and quaternionic hyperbolic spaces and the hyperbolic\nplane over the octonions. These are rank 1 Euclidean buildings, respectively\nrank 1 symmetric spaces of non-compact type. We give a uniform proof that these\nspaces may be reconstructed using the cross ratio on their visual boundary,\nbringing together the work of Tits and Bourdon.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:46:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Davies","Isobel",""]]}
{"id":"2308.15125","submitter":"Luxian Yang","authors":"Guizhen Cui, Wenjuan Peng and Luxian Yang","title":"Wandering Julia components of cubic rational maps","comments":"10 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We prove that every wandering Julia component of cubic rational maps\neventually has at most two complementary components.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:47:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cui","Guizhen",""],["Peng","Wenjuan",""],["Yang","Luxian",""]]}
{"id":"2308.15126","submitter":"Yiyang Zhou","authors":"Junyang Wang, Yiyang Zhou, Guohai Xu, Pengcheng Shi, Chenlin Zhao,\n  Haiyang Xu, Qinghao Ye, Ming Yan, Ji Zhang, Jihua Zhu, Jitao Sang, Haoyu Tang","title":"Evaluation and Analysis of Hallucination in Large Vision-Language Models","comments":"11 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CL cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large Vision-Language Models (LVLMs) have recently achieved remarkable\nsuccess. However, LVLMs are still plagued by the hallucination problem, which\nlimits the practicality in many scenarios. Hallucination refers to the\ninformation of LVLMs' responses that does not exist in the visual input, which\nposes potential risks of substantial consequences. There has been limited work\nstudying hallucination evaluation in LVLMs. In this paper, we propose\nHallucination Evaluation based on Large Language Models (HaELM), an LLM-based\nhallucination evaluation framework. HaELM achieves an approximate 95%\nperformance comparable to ChatGPT and has additional advantages including low\ncost, reproducibility, privacy preservation and local deployment. Leveraging\nthe HaELM, we evaluate the hallucination in current LVLMs. Furthermore, we\nanalyze the factors contributing to hallucination in LVLMs and offer helpful\nsuggestions to mitigate the hallucination problem. Our training data and human\nannotation hallucination data will be made public soon.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:51:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Junyang",""],["Zhou","Yiyang",""],["Xu","Guohai",""],["Shi","Pengcheng",""],["Zhao","Chenlin",""],["Xu","Haiyang",""],["Ye","Qinghao",""],["Yan","Ming",""],["Zhang","Ji",""],["Zhu","Jihua",""],["Sang","Jitao",""],["Tang","Haoyu",""]]}
{"id":"2308.15127","submitter":"Saeed Reza Hormozi Jangi","authors":"Saeed Reza Hormozi Jangi","title":"Nanozyme-based biosensing for clinical diagnosis of COVID-19: A mini\n  review","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.med-ph q-bio.QM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Several clinical methods had been utilized for diagnosis of COVID-19 for\ninstance, real-time reverse transcription-polymerase chain reaction (rRT-PCR),\nhematology examination, polymerase chain reaction (PCR), diagnostic guidelines\nbased on clinical features, and Chest CT scans. However, the accurate current\nmethods are time-consuming and expensive and other methods are inaccurate. To\nsolve these drawbacks, nanozyme-based sensors have been developed for the\nreliable, accurate, and rapid detection of SARS-CoV-2. The main basis of these\nsensors is the detection of color variation of a nanozyme-mediated oxidation\nreaction in the presence and the absence of antigens of COVID-19. Besides, some\nof methods are based on probing the fluorescence of these systems as the\nclinical signal toward detection of SARS-CoV-2. This mini review focused on\noverviewing the nanozymes-based methods toward COVID-19 diagnosis. The\nhistorical background of COVID-19 was reviewed. Thereafter, the biomedical\napplications of nanozymes was discussed and finally, the recent progress of\nearly diagnosis of COVID-19 based on nanozymatic systems was briefly reviewed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:51:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jangi","Saeed Reza Hormozi",""]]}
{"id":"2308.15128","submitter":"Jingyi Mah","authors":"J. Mah, B. Bitsch, I. Pascucci, T. Henning","title":"Close-in ice lines and the super-stellar C/O ratio in discs around very\n  low-mass stars","comments":"Accepted for publication in A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The origin of the elevated C/O ratios in discs around late M dwarfs compared\nto discs around solar-type stars is not well understood. Here we endeavour to\nreproduce the observed differences in the disc C/O ratios as a function of\nstellar mass using a viscosity-driven disc evolution model and study the\ncorresponding atmospheric composition of planets that grow inside the water-ice\nline in these discs. We carried out simulations using a coupled disc evolution\nand planet formation code that includes pebble drift and evaporation. We used a\nchemical partitioning model for the dust composition in the disc midplane.\nInside the water-ice line, the disc's C/O ratio initially decreases to\nsub-stellar due to the inward drift and evaporation of water-ice-rich pebbles\nbefore increasing again to super-stellar values due to the inward diffusion of\ncarbon-rich vapour. We show that this process is more efficient for very\nlow-mass stars compared to solar-type stars due to the closer-in ice lines and\nshorter disc viscous timescales. In high-viscosity discs, the transition from\nsub-stellar to super-stellar takes place faster due to the fast inward\nadvection of carbon-rich gas. Our results suggest that planets accreting their\natmospheres early (when the disc C/O is still sub-stellar) will have low\natmospheric C/O ratios, while planets that accrete their atmospheres late (when\nthe disc C/O has become super-stellar) can obtain high C/O ratios. Our model\npredictions are consistent with observations, under the assumption that all\nstars have the same metallicity and chemical composition, and that the vertical\nmixing timescales in the inner disc are much shorter than the radial advection\ntimescales. This further strengthens the case for considering stellar\nabundances alongside disc evolution in future studies that aim to link planet\n(atmospheric) composition to disc composition.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:53:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mah","J.",""],["Bitsch","B.",""],["Pascucci","I.",""],["Henning","T.",""]]}
{"id":"2308.15129","submitter":"Hemanth Manikantan","authors":"Hemanth Manikantan, Biswajit Paul, Vikram Rana","title":"An investigation of the \"10 keV feature\" in the spectra of Accretion\n  Powered X-ray Pulsars with NuSTAR","comments":"28 pages, 32 figures, Accepted for publication in Monthly Notices of\n  the Royal Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Some of the accreting X-ray pulsars are reported to exhibit a peculiar\nspectral feature at $\\sim$10 keV, known as the \"10 keV feature\". The feature\nhas been characterized as either an emission line or an absorption line, and\nits origin is unknown. It has been found in multiple observations of the same\nsource by different observatories, but not all the observations of any\nparticular source consistently showed the presence of it. In this work, we have\ncarried out a systematic investigation for the presence of the \"10 keV feature\"\nusing data from NuSTAR, a low background spectroscopic observatory having\nuninterrupted wide band coverage on either side of 10 keV. We performed a\nsystematic spectral analysis on 58 archival NuSTAR observations of 30 bright\nX-ray pulsars. The 3$-$79 keV spectral continua of these selected sources were\nfitted with a model chosen on the basis of its fitting quality in 3$-$15 keV\nand model simplicity, and then inspected for the presence of the \"10 keV\nfeature\". Our analysis indicates the presence of such a feature in 16 out of 58\nthe NuSTAR observations of 11 different sources and is fitted with a Gaussian\nabsorption model centered around 10 keV. Our analysis also suggests that such a\nfeature could be wrongly detected if flare data is not analyzed separately from\npersistent emission.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:53:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Manikantan","Hemanth",""],["Paul","Biswajit",""],["Rana","Vikram",""]]}
{"id":"2308.15130","submitter":"Zoran Ristivojevic","authors":"Aleksandra Petkovic and Zoran Ristivojevic","title":"The density of a one-dimensional Bose gas far from an impurity","comments":"9 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.quant-gas quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider an impurity in a one-dimensional weakly-interacting Bose gas and\nanalytically calculate the density profile of the Bose gas. Within the\nmean-field approximation, by increasing the distance from the impurity, the\nBose gas density saturates exponentially fast to its mean thermodynamic-limit\nvalue at distances beyond the healing length. The effect of quantum\nfluctuations drastically changes this behavior, leading to a power law decay of\nthe density deviation from the mean density. At distances longer than the\nhealing length and shorter than a new length scale proportional to the impurity\ncoupling strength, the power-law exponent is $2$, while at longest distances\nthe corresponding exponent becomes $3$. The latter crossover does not exist in\ntwo special cases. The first one is realized for infinitely strongly coupled\nimpurity; then the density deviation always decays with the exponent $2$. The\nsecond special case occurs when the new length scale is smaller than the\nhealing length, i.e., at weak impurity coupling; then the density deviation\nalways decays with the exponent $3$. The obtained results are exact in the\nimpurity coupling strength and account for the leading order in the interaction\nbetween the particles of the Bose gas.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:56:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Petkovic","Aleksandra",""],["Ristivojevic","Zoran",""]]}
{"id":"2308.15131","submitter":"Yuchen Zhang","authors":"Yuchen Zhang, Wanli Ni, Jianquan Wang, Wanbin Tang, Min Jia, Yonina C.\n  Eldar, Dusit Niyato","title":"Robust Transceiver Design for Covert Integrated Sensing and\n  Communications With Imperfect CSI","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We propose a robust transceiver design for a covert integrated sensing and\ncommunications (ISAC) system with imperfect channel state information (CSI).\nConsidering both bounded and probabilistic CSI error models, we formulate\nworst-case and outage-constrained robust optimization problems of joint\ntrasceiver beamforming and radar waveform design to balance the radar\nperformance of multiple targets while ensuring communications performance and\ncovertness of the system. The optimization problems are challenging due to the\nnon-convexity arising from the semi-infinite constraints (SICs) and the coupled\ntransceiver variables. In an effort to tackle the former difficulty,\nS-procedure and Bernstein-type inequality are introduced for converting the\nSICs into finite convex linear matrix inequalities (LMIs) and second-order cone\nconstraints. A robust alternating optimization framework referred to\nalternating double-checking is developed for decoupling the transceiver design\nproblem into feasibility-checking transmitter- and receiver-side subproblems,\ntransforming the rank-one constraints into a set of LMIs, and verifying the\nfeasibility of beamforming by invoking the matrix-lifting scheme. Numerical\nresults are provided to demonstrate the effectiveness and robustness of the\nproposed algorithm in improving the performance of covert ISAC systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:57:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Yuchen",""],["Ni","Wanli",""],["Wang","Jianquan",""],["Tang","Wanbin",""],["Jia","Min",""],["Eldar","Yonina C.",""],["Niyato","Dusit",""]]}
{"id":"2308.15132","submitter":"Vincent Lemaire","authors":"Pierre Nodet and Vincent Lemaire and Alexis Bondu and Antoine\n  Cornu\\'ejols","title":"Biquality Learning: a Framework to Design Algorithms Dealing with\n  Closed-Set Distribution Shifts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Training machine learning models from data with weak supervision and dataset\nshifts is still challenging. Designing algorithms when these two situations\narise has not been explored much, and existing algorithms cannot always handle\nthe most complex distributional shifts. We think the biquality data setup is a\nsuitable framework for designing such algorithms. Biquality Learning assumes\nthat two datasets are available at training time: a trusted dataset sampled\nfrom the distribution of interest and the untrusted dataset with dataset shifts\nand weaknesses of supervision (aka distribution shifts). The trusted and\nuntrusted datasets available at training time make designing algorithms dealing\nwith any distribution shifts possible. We propose two methods, one inspired by\nthe label noise literature and another by the covariate shift literature for\nbiquality learning. We experiment with two novel methods to synthetically\nintroduce concept drift and class-conditional shifts in real-world datasets\nacross many of them. We opened some discussions and assessed that developing\nbiquality learning algorithms robust to distributional changes remains an\ninteresting problem for future research.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 08:57:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nodet","Pierre",""],["Lemaire","Vincent",""],["Bondu","Alexis",""],["Cornu\u00e9jols","Antoine",""]]}
{"id":"2308.15133","submitter":"Junlin Song","authors":"Junlin Song, Pedro J. Sanchez-Cuevas, Antoine Richard and Miguel\n  Olivares-Mendez","title":"GPS-aided Visual Wheel Odometry","comments":"Accepted by IEEE ITSC 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper introduces a novel GPS-aided visual-wheel odometry (GPS-VWO) for\nground robots. The state estimation algorithm tightly fuses visual, wheeled\nencoder and GPS measurements in the way of Multi-State Constraint Kalman Filter\n(MSCKF). To avoid accumulating calibration errors over time, the proposed\nalgorithm calculates the extrinsic rotation parameter between the GPS global\ncoordinate frame and the VWO reference frame online as part of the estimation\nprocess. The convergence of this extrinsic parameter is guaranteed by the\nobservability analysis and verified by using real-world visual and wheel\nencoder measurements as well as simulated GPS measurements. Moreover, a novel\ntheoretical finding is presented that the variance of unobservable state could\nconverge to zero for specific Kalman filter system. We evaluate the proposed\nsystem extensively in large-scale urban driving scenarios. The results\ndemonstrate that better accuracy than GPS is achieved through the fusion of GPS\nand VWO. The comparison between extrinsic parameter calibration and\nnon-calibration shows significant improvement in localization accuracy thanks\nto the online calibration.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:03:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Song","Junlin",""],["Sanchez-Cuevas","Pedro J.",""],["Richard","Antoine",""],["Olivares-Mendez","Miguel",""]]}
{"id":"2308.15134","submitter":"Lukas Dirks","authors":"Lukas Dirks, Ralf-J\\\"urgen Dettmar, Dominik J. Bomans, Peter Kamphuis,\n  Ulrich Schilling","title":"Evidence for a large off-centered galactic outflow and its connection to\n  the extraplanar diffuse ionized gas in IC 1553","comments":"Accepted for publication by Astronomy & Astrophysics on August 1,\n  2023","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Aims. We analyze a MUSE optical integral field spectrum of the star-forming\nedge-on galaxy IC 1553 in order to study its extraplanar diffuse ionized gas\n(eDIG) and the processes shaping its disk-halo interface. Methods. We extracted\nthe optical emission line properties from the integral field spectrum and\ngenerated the commonly used emission line diagnostic diagrams in order to\nanalyze the ionization conditions and the distribution of the eDIG.\nFurthermore, we performed gravitational potential fitting to investigate the\nkinematics of a suspected galactic outflow. Results. We find that the eDIG\nscale height has a maximum value of approximately 1.0 kpc and decreases roughly\nlinearly with the radial distance from the galactic center in projection. The\nionization state of the eDIG is not consistent with a pure photoionization\nscenario and instead requires a significant contribution from shock ionization.\nThis, in addition to the gas kinematics, strongly suggests the presence of a\ngalactic scale outflow, the origin of which lies at least 1.4 kpc away from the\ngalactic center. The inferred shock velocity in the eDIG of approximately 225\nkm s-1 is comparable to the escape velocity estimated from our potential\nmodelling. The asymmetric distribution of currently star-forming clusters\nproduces a range of different ionization conditions in the eDIG. As a result,\nthe vertical emission line profiles vary quantitatively and qualitatively along\nthe major axis of the galaxy. This analysis illustrates that it is crucial in\nstudies of the eDIG to use observations that take the spatial and kinematical\ndistributions into account, such as those done with integral field units, to\nform an accurate picture of the relevant physical properties.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:05:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dirks","Lukas",""],["Dettmar","Ralf-J\u00fcrgen",""],["Bomans","Dominik J.",""],["Kamphuis","Peter",""],["Schilling","Ulrich",""]]}
{"id":"2308.15135","submitter":"Owen Futter","authors":"Owen Futter, Blanka Horvath, Magnus Wiese","title":"Signature Trading: A Path-Dependent Extension of the Mean-Variance\n  Framework with Exogenous Signals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.PM math.OC q-fin.MF q-fin.RM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this article we introduce a portfolio optimisation framework, in which the\nuse of rough path signatures (Lyons, 1998) provides a novel method of\nincorporating path-dependencies in the joint signal-asset dynamics, naturally\nextending traditional factor models, while keeping the resulting formulas\nlightweight and easily interpretable. We achieve this by representing a trading\nstrategy as a linear functional applied to the signature of a path (which we\nrefer to as \"Signature Trading\" or \"Sig-Trading\"). This allows the modeller to\nefficiently encode the evolution of past time-series observations into the\noptimisation problem. In particular, we derive a concise formulation of the\ndynamic mean-variance criterion alongside an explicit solution in our setting,\nwhich naturally incorporates a drawdown control in the optimal strategy over a\nfinite time horizon. Secondly, we draw parallels between classical portfolio\nstategies and Sig-Trading strategies and explain how the latter leads to a\npathwise extension of the classical setting via the \"Signature Efficient\nFrontier\". Finally, we give examples when trading under an exogenous signal as\nwell as examples for momentum and pair-trading strategies, demonstrated both on\nsynthetic and market data. Our framework combines the best of both worlds\nbetween classical theory (whose appeal lies in clear and concise formulae) and\nbetween modern, flexible data-driven methods that can handle more realistic\ndatasets. The advantage of the added flexibility of the latter is that one can\nbypass common issues such as the accumulation of heteroskedastic and asymmetric\nresiduals during the optimisation phase. Overall, Sig-Trading combines the\nflexibility of data-driven methods without compromising on the clarity of the\nclassical theory and our presented results provide a compelling toolbox that\nyields superior results for a large class of trading strategies.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:10:22 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 09:38:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Futter","Owen",""],["Horvath","Blanka",""],["Wiese","Magnus",""]]}
{"id":"2308.15136","submitter":"Hiroyuki Ootomo","authors":"Hiroyuki Ootomo, Akira Naruse, Corey Nolet, Ray Wang, Tamas Feher,\n  Yong Wang","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest\n  Neighbor Search for GPUs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CV cs.DB cs.DC cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Approximate Nearest Neighbor Search (ANNS) plays a critical role in various\ndisciplines spanning data mining and artificial intelligence, from information\nretrieval and computer vision to natural language processing and recommender\nsystems. Data volumes have soared in recent years and the computational cost of\nan exhaustive exact nearest neighbor search is often prohibitive, necessitating\nthe adoption of approximate techniques. The balanced performance and recall of\ngraph-based approaches have more recently garnered significant attention in\nANNS algorithms, however, only a few studies have explored harnessing the power\nof GPUs and multi-core processors despite the widespread use of massively\nparallel and general-purpose computing. To bridge this gap, we introduce a\nnovel parallel computing hardware-based proximity graph and search algorithm.\nBy leveraging the high-performance capabilities of modern hardware, our\napproach achieves remarkable efficiency gains. In particular, our method\nsurpasses existing CPU and GPU-based methods in constructing the proximity\ngraph, demonstrating higher throughput in both large- and small-batch searches\nwhile maintaining compatible accuracy. In graph construction time, our method,\nCAGRA, is 2.2~27x faster than HNSW, which is one of the CPU SOTA\nimplementations. In large-batch query throughput in the 90% to 95% recall\nrange, our method is 33~77x faster than HNSW, and is 3.8~8.8x faster than the\nSOTA implementations for GPU. For a single query, our method is 3.4~53x faster\nthan HNSW at 95% recall.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:10:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ootomo","Hiroyuki",""],["Naruse","Akira",""],["Nolet","Corey",""],["Wang","Ray",""],["Feher","Tamas",""],["Wang","Yong",""]]}
{"id":"2308.15137","submitter":"Yuhan Song","authors":"Yuhan Song, Armagan Elibol, Nak Young Chong","title":"Abdominal Multi-Organ Segmentation Based on Feature Pyramid Network and\n  Spatial Recurrent Neural Network","comments":"IFAC World Congress 2023 paper","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  As recent advances in AI are causing the decline of conventional diagnostic\nmethods, the realization of end-to-end diagnosis is fast approaching.\nUltrasound image segmentation is an important step in the diagnostic process.\nAn accurate and robust segmentation model accelerates the process and reduces\nthe burden of sonographers. In contrast to previous research, we take two\ninherent features of ultrasound images into consideration: (1) different organs\nand tissues vary in spatial sizes, (2) the anatomical structures inside human\nbody form a relatively constant spatial relationship. Based on those two ideas,\nwe propose a new image segmentation model combining Feature Pyramid Network\n(FPN) and Spatial Recurrent Neural Network (SRNN). We discuss why we use FPN to\nextract anatomical structures of different scales and how SRNN is implemented\nto extract the spatial context features in abdominal ultrasound images.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:13:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Song","Yuhan",""],["Elibol","Armagan",""],["Chong","Nak Young",""]]}
{"id":"2308.15138","submitter":"Sheng Sun","authors":"Mingqing Liu, Tong-Yi Zhang, Sheng Sun","title":"Unraveling the Complexity of Metal Ion Dissolution: Insights from Hybrid\n  First-Principles/Continuum Calculations","comments":"still dont have","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study of ion dissolution from metal surfaces has a long-standing history,\nwherein the gradual dissolution of solute atoms with increasing electrode\npotential, leading to their existence as ions in the electrolyte with integer\ncharges, is well-known. However, our present work reveals a more intricate and\nnuanced physical perspective based on comprehensive first-principles/continuum\ncalculations. We investigate the dissolution and deposition processes of 22\nmetal elements across a range of applied electrode potentials, unveiling\ndiverse dissolution models. By analyzing the energy profiles and valence states\nof solute atoms as a function of the distance between the solute atom and metal\nsurface, we identify three distinct dissolution models for different metals.\nFirstly, solute atoms exhibit an integer valence state following an\ninteger-valence jump, aligning with classical understandings. Secondly, solute\natoms attain an eventual integer valence, yet their valence state increases in\na non-integer manner during dissolution. Lastly, we observe solute atoms\nexhibiting a non-integer valence state, challenging classical understandings.\nFurthermore, we propose a theoretical criterion for determining the selection\nof ion valence during electrode dissolution under applied potential. These\nfindings not only contribute to a deeper understanding of the dissolution\nprocess but also offer valuable insights into the complex dynamics governing\nmetal ion dissolution at the atomic level. Such knowledge has the potential to\nadvance the design of more efficient electrochemical systems and open new\navenues for controlling dissolution processes in various applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:13:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Mingqing",""],["Zhang","Tong-Yi",""],["Sun","Sheng",""]]}
{"id":"2308.15139","submitter":"Goshgar Ismayilov","authors":"Goshgar Ismayilov, Can Ozturan","title":"PTTS: Zero-Knowledge Proof-based Private Token Transfer System on\n  Ethereum Blockchain and its Network Flow Based Balance Range Privacy Attack\n  Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Blockchains are decentralized and immutable databases that are shared among\nthe nodes of the network. Although blockchains have attracted a great scale of\nattention in the recent years by disrupting the traditional financial systems,\nthe transaction privacy is still a challenging issue that needs to be addressed\nand analysed. We propose a Private Token Transfer System (PTTS) for the\nEthereum public blockchain in the first part of this paper. For the proposed\nframework, zero-knowledge based protocol has been designed using Zokrates and\nintegrated into our private token smart contract. With the help of web user\ninterface designed, the end users can interact with the smart contract without\nany third-party setup. In the second part of the paper, we provide security and\nprivacy analysis including the replay attack and the balance range privacy\nattack which has been modelled as a network flow problem. It is shown that in\ncase some balance ranges are deliberately leaked out to particular\norganizations or adversial entities, it is possible to extract meaningful\ninformation about the user balances by employing minimum cost flow network\nalgorithms that have polynomial complexity. The experimental study reports the\nEthereum gas consumption and proof generation times for the proposed framework.\nIt also reports network solution times and goodness rates for a subset of\naddresses under the balance range privacy attack with respect to number of\naddresses, number of transactions and ratio of leaked transfer transaction\namounts.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:13:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ismayilov","Goshgar",""],["Ozturan","Can",""]]}
{"id":"2308.15140","submitter":"Valerii Kozin","authors":"Leonid P. Pryadko, Vadim A. Shabashov, and Valerii K. Kozin","title":"QDistRnd: A GAP package for computing the distance of quantum\n  error-correcting codes","comments":"published version","journal-ref":"Journal of Open Source Software, 7(71), 4120 (2022)","doi":"10.21105/joss.04120","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The GAP package QDistRnd implements a probabilistic algorithm for finding the\nminimum distance of a quantum low-density parity-check code linear over a\nfinite field GF(q). At each step several codewords are randomly drawn from a\ndistribution biased toward smaller weights. The corresponding weights are used\nto update the upper bound on the distance, which eventually converges to the\nminimum distance of the code. While there is no performance guarantee, an\nempirical convergence criterion is given to estimate the probability that a\nminimum weight codeword has been found. In addition, a format for storing\nmatrices associated with q-ary quantum codes is introduced and implemented via\nthe provided import/export functions. The format, MTXE, is based on the well\nestablished MaTrix market eXchange (MTX) Coordinate format developed at NIST,\nand is designed for full backward compatibility with this format. Thus, MTXE\nfiles are readable by any software package which supports MTX.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:17:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pryadko","Leonid P.",""],["Shabashov","Vadim A.",""],["Kozin","Valerii K.",""]]}
{"id":"2308.15141","submitter":"Tareen Dawood Ms","authors":"Tareen Dawood, Chen Chen, Baldeep S. Sidhua, Bram Ruijsink, Justin\n  Goulda, Bradley Porter, Mark K. Elliott, Vishal Mehta, Christopher A.\n  Rinaldi, Esther Puyol-Anton, Reza Razavi, Andrew P. King","title":"Uncertainty Aware Training to Improve Deep Learning Model Calibration\n  for Classification of Cardiac MR Images","comments":null,"journal-ref":null,"doi":"10.1016/j.media.2023.102861","report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantifying uncertainty of predictions has been identified as one way to\ndevelop more trustworthy artificial intelligence (AI) models beyond\nconventional reporting of performance metrics. When considering their role in a\nclinical decision support setting, AI classification models should ideally\navoid confident wrong predictions and maximise the confidence of correct\npredictions. Models that do this are said to be well-calibrated with regard to\nconfidence. However, relatively little attention has been paid to how to\nimprove calibration when training these models, i.e., to make the training\nstrategy uncertainty-aware. In this work we evaluate three novel\nuncertainty-aware training strategies comparing against two state-of-the-art\napproaches. We analyse performance on two different clinical applications:\ncardiac resynchronisation therapy (CRT) response prediction and coronary artery\ndisease (CAD) diagnosis from cardiac magnetic resonance (CMR) images. The\nbest-performing model in terms of both classification accuracy and the most\ncommon calibration measure, expected calibration error (ECE) was the Confidence\nWeight method, a novel approach that weights the loss of samples to explicitly\npenalise confident incorrect predictions. The method reduced the ECE by 17% for\nCRT response prediction and by 22% for CAD diagnosis when compared to a\nbaseline classifier in which no uncertainty-aware strategy was included. In\nboth applications, as well as reducing the ECE there was a slight increase in\naccuracy from 69% to 70% and 70% to 72% for CRT response prediction and CAD\ndiagnosis respectively. However, our analysis showed a lack of consistency in\nterms of optimal models when using different calibration measures. This\nindicates the need for careful consideration of performance metrics when\ntraining and selecting models for complex high-risk applications in healthcare.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:19:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dawood","Tareen",""],["Chen","Chen",""],["Sidhua","Baldeep S.",""],["Ruijsink","Bram",""],["Goulda","Justin",""],["Porter","Bradley",""],["Elliott","Mark K.",""],["Mehta","Vishal",""],["Rinaldi","Christopher A.",""],["Puyol-Anton","Esther",""],["Razavi","Reza",""],["King","Andrew P.",""]]}
{"id":"2308.15142","submitter":"Shuxiao Ma","authors":"Shuxiao Ma and Linyuan Wang and Bin Yan","title":"A Multimodal Visual Encoding Model Aided by Introducing Verbal Semantic\n  Information","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI q-bio.NC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Biological research has revealed that the verbal semantic information in the\nbrain cortex, as an additional source, participates in nonverbal semantic\ntasks, such as visual encoding. However, previous visual encoding models did\nnot incorporate verbal semantic information, contradicting this biological\nfinding. This paper proposes a multimodal visual information encoding network\nmodel based on stimulus images and associated textual information in response\nto this issue. Our visual information encoding network model takes stimulus\nimages as input and leverages textual information generated by a text-image\ngeneration model as verbal semantic information. This approach injects new\ninformation into the visual encoding model. Subsequently, a Transformer network\naligns image and text feature information, creating a multimodal feature space.\nA convolutional network then maps from this multimodal feature space to voxel\nspace, constructing the multimodal visual information encoding network model.\nExperimental results demonstrate that the proposed multimodal visual\ninformation encoding network model outperforms previous models under the exact\ntraining cost. In voxel prediction of the left hemisphere of subject 1's brain,\nthe performance improves by approximately 15.87%, while in the right\nhemisphere, the performance improves by about 4.6%. The multimodal visual\nencoding network model exhibits superior encoding performance. Additionally,\nablation experiments indicate that our proposed model better simulates the\nbrain's visual information processing.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:21:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ma","Shuxiao",""],["Wang","Linyuan",""],["Yan","Bin",""]]}
{"id":"2308.15143","submitter":"Lei Han","authors":"Lei Han, Qingxu Zhu, Jiapeng Sheng, Chong Zhang, Tingguang Li, Yizheng\n  Zhang, He Zhang, Yuzhen Liu, Cheng Zhou, Rui Zhao, Jie Li, Yufeng Zhang, Rui\n  Wang, Wanchao Chi, Xiong Li, Yonghui Zhu, Lingzhu Xiang, Xiao Teng, Zhengyou\n  Zhang","title":"Lifelike Agility and Play on Quadrupedal Robots using Reinforcement\n  Learning and Generative Pre-trained Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Summarizing knowledge from animals and human beings inspires robotic\ninnovations. In this work, we propose a framework for driving legged robots act\nlike real animals with lifelike agility and strategy in complex environments.\nInspired by large pre-trained models witnessed with impressive performance in\nlanguage and image understanding, we introduce the power of advanced deep\ngenerative models to produce motor control signals stimulating legged robots to\nact like real animals. Unlike conventional controllers and end-to-end RL\nmethods that are task-specific, we propose to pre-train generative models over\nanimal motion datasets to preserve expressive knowledge of animal behavior. The\npre-trained model holds sufficient primitive-level knowledge yet is\nenvironment-agnostic. It is then reused for a successive stage of learning to\nalign with the environments by traversing a number of challenging obstacles\nthat are rarely considered in previous approaches, including creeping through\nnarrow spaces, jumping over hurdles, freerunning over scattered blocks, etc.\nFinally, a task-specific controller is trained to solve complex downstream\ntasks by reusing the knowledge from previous stages. Enriching the knowledge\nregarding each stage does not affect the usage of other levels of knowledge.\nThis flexible framework offers the possibility of continual knowledge\naccumulation at different levels. We successfully apply the trained multi-level\ncontrollers to the MAX robot, a quadrupedal robot developed in-house, to mimic\nanimals, traverse complex obstacles, and play in a designed challenging\nmulti-agent Chase Tag Game, where lifelike agility and strategy emerge on the\nrobots. The present research pushes the frontier of robot control with new\ninsights on reusing multi-level pre-trained knowledge and solving highly\ncomplex downstream tasks in the real world.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:22:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Han","Lei",""],["Zhu","Qingxu",""],["Sheng","Jiapeng",""],["Zhang","Chong",""],["Li","Tingguang",""],["Zhang","Yizheng",""],["Zhang","He",""],["Liu","Yuzhen",""],["Zhou","Cheng",""],["Zhao","Rui",""],["Li","Jie",""],["Zhang","Yufeng",""],["Wang","Rui",""],["Chi","Wanchao",""],["Li","Xiong",""],["Zhu","Yonghui",""],["Xiang","Lingzhu",""],["Teng","Xiao",""],["Zhang","Zhengyou",""]]}
{"id":"2308.15144","submitter":"Yun Liao","authors":"Yun Liao, Yide Di, Hao Zhou, Kaijun Zhu, Mingyu Lu, Yijia Zhang, Qing\n  Duan and Junhui Liu","title":"TKwinFormer: Top k Window Attention in Vision Transformers for Feature\n  Matching","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Local feature matching remains a challenging task, primarily due to\ndifficulties in matching sparse keypoints and low-texture regions. The key to\nsolving this problem lies in effectively and accurately integrating global and\nlocal information. To achieve this goal, we introduce an innovative local\nfeature matching method called TKwinFormer. Our approach employs a multi-stage\nmatching strategy to optimize the efficiency of information interaction.\nFurthermore, we propose a novel attention mechanism called Top K Window\nAttention, which facilitates global information interaction through window\ntokens prior to patch-level matching, resulting in improved matching accuracy.\nAdditionally, we design an attention block to enhance attention between\nchannels. Experimental results demonstrate that TKwinFormer outperforms\nstate-of-the-art methods on various benchmarks. Code is available at:\nhttps://github.com/LiaoYun0x0/TKwinFormer.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:22:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liao","Yun",""],["Di","Yide",""],["Zhou","Hao",""],["Zhu","Kaijun",""],["Lu","Mingyu",""],["Zhang","Yijia",""],["Duan","Qing",""],["Liu","Junhui",""]]}
{"id":"2308.15145","submitter":"Giulia Ferrandi","authors":"Giulia Ferrandi and Michiel E. Hochstenbach","title":"Limited memory gradient methods for unconstrained optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The limited memory steepest descent method (Fletcher, 2012) for unconstrained\noptimization problems stores a few past gradients to compute multiple stepsizes\nat once. We review this method and propose new variants. For strictly convex\nquadratic objective functions, we study the numerical behavior of different\ntechniques to compute new stepsizes. In particular, we introduce a method to\nimprove the use of harmonic Ritz values. We also show the existence of a secant\ncondition associated with LMSD, where the approximating Hessian is projected\nonto a low-dimensional space. In the general nonlinear case, we propose two new\nalternatives to Fletcher's method: first, the addition of symmetry constraints\nto the secant condition valid for the quadratic case; second, a perturbation of\nthe last differences between consecutive gradients, to satisfy multiple secant\nequations simultaneously. We show that Fletcher's method can also be\ninterpreted from this viewpoint.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:23:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ferrandi","Giulia",""],["Hochstenbach","Michiel E.",""]]}
{"id":"2308.15146","submitter":"Pascal Jelinek","authors":"Pascal Jelinek","title":"Square-free values of polynomials on average","comments":"21 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The number of square-free integers in $x$ consecutive values of any\npolynomial $f$ is conjectured to be $c_fx$, where the constant $c_f$ depends\nonly on the polynomial $f$. This has been proven for degrees less or equal to\n3. Granville was able to show conditionally on the $abc$-conjecture that this\nconjecture is true for polynomials of arbitrarily large degrees. In 2013\nShparlinski proved that this conjecture holds on average over all polynomials\nof a fixed naive height, which was improved by Browning and Shparlinski in\n2023. In this paper, we improve the dependence between $x$ and the height of\nthe polynomial. We achieve this via adapting a method introduced in a 2022\npaper by Browning, Sofos, and Ter\\\"av\\\"ainen on the Bateman-Horn conjecture,\nthe polynomial Chowla conjecture, and the Hasse principle on average.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:27:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jelinek","Pascal",""]]}
{"id":"2308.15147","submitter":"Richard Szabo","authors":"Thomas C. De Fraja, Vincenzo Emilio Marotta, Richard J. Szabo","title":"T-Dualities and Courant Algebroid Relations","comments":"68 pages","journal-ref":null,"doi":null,"report-no":"EMPG-23-12","categories":"math.DG hep-th math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop a new approach to T-duality based on Courant algebroid relations\nwhich subsumes the usual T-duality as well as its various generalisations.\nStarting from a relational description for the reduction of exact Courant\nalgebroids over foliated manifolds, we introduce a weakened notion of\ngeneralised isometries that captures the generalised geometry counterpart of\nRiemannian submersions when applied to transverse generalised metrics. This is\nused to construct T-dual backgrounds as generalised metrics on reduced Courant\nalgebroids which are related by a generalised isometry. We prove an existence\nand uniqueness result for generalised isometric exact Courant algebroids coming\nfrom reductions. We demonstrate that our construction reproduces standard\nT-duality relations based on correspondence spaces. We also describe how it\napplies to generalised T-duality transformations of almost para-Hermitian\nmanifolds.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:28:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["De Fraja","Thomas C.",""],["Marotta","Vincenzo Emilio",""],["Szabo","Richard J.",""]]}
{"id":"2308.15148","submitter":"Somshubhro Bandyopadhyay","authors":"Abhishek Banerjee, Pratapaditya Bej, Somshubhro Bandyopadhyay","title":"Quantum change point and entanglement distillation","comments":"14 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the quantum change point problem within the paradigm of local\noperations and classical communication (LOCC). Specifically, we consider a\nsource that emits entangled pairs in a default state but undergoes mutation at\nsome stage and begins producing an orthogonal entangled state. A sequence of\nentangled pairs prepared from such a source and shared between distant\nobservers cannot be used for quantum information processing tasks as the\nidentity of each entangled pair remains unknown. Assuming every point of a\ngiven sequence is equally likely to be the change point, including the\npossibility that no change occurs, we present a pretty-good LOCC protocol that\nidentifies the change point and distills free entangled pairs. Next, we\nconsider a variation of this problem where the source switches to an unknown\nentangled state that belongs to a known set. Here we show the local\ndistinguishability of the collection of states, containing the default and all\npossible mutations, plays a crucial role: if they are locally distinguishable,\nthe problem reduces to the previous one, but if not, one may still identify the\nmutated state, the change point, and distill entanglement, as we illustrate\nwith a concrete example.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:30:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Banerjee","Abhishek",""],["Bej","Pratapaditya",""],["Bandyopadhyay","Somshubhro",""]]}
{"id":"2308.15149","submitter":"Jerzy Paczos","authors":"Jerzy Paczos, Luis C. Barbado","title":"Hawking radiation for detectors in superposition of locations outside a\n  black hole","comments":"9+6 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Hawking radiation is the proposed thermal black-body radiation of quantum\nnature emitted from a black hole. One common way to give an account of Hawking\nradiation is to consider a detector that follows a static trajectory in the\nvicinity of a black hole and interacts with the quantum field of the radiation.\nIn the present work, we study the Hawking radiation perceived by a detector\nthat follows a quantum superposition of static trajectories in Schwarzschild\nspacetime, instead of a unique well-defined trajectory. We analyze the quantum\nstate of the detector after the interaction with a massless real scalar field.\nWe find that for certain trajectories and excitation levels, there are\nnon-vanishing coherences in the final state of the detector. We then examine\nthe dependence of these coherences on the trajectories followed by the detector\nand relate them to the distinguishability of the different possible states in\nwhich the field is left after the excitation of the detector. We interpret our\nresults in terms of the spatial distribution and propagation of particles of\nthe quantum field.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:32:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Paczos","Jerzy",""],["Barbado","Luis C.",""]]}
{"id":"2308.15150","submitter":"Xinyi Chen","authors":"Xinyi Chen, Jibin Wu, Huajin Tang, Qinyuan Ren, Kay Chen Tan","title":"Unleashing the Potential of Spiking Neural Networks for Sequential\n  Modeling with Contextual Embedding","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The human brain exhibits remarkable abilities in integrating temporally\ndistant sensory inputs for decision-making. However, existing brain-inspired\nspiking neural networks (SNNs) have struggled to match their biological\ncounterpart in modeling long-term temporal relationships. To address this\nproblem, this paper presents a novel Contextual Embedding Leaky\nIntegrate-and-Fire (CE-LIF) spiking neuron model. Specifically, the CE-LIF\nmodel incorporates a meticulously designed contextual embedding component into\nthe adaptive neuronal firing threshold, thereby enhancing the memory storage of\nspiking neurons and facilitating effective sequential modeling. Additionally,\ntheoretical analysis is provided to elucidate how the CE-LIF model enables\nlong-term temporal credit assignment. Remarkably, when compared to\nstate-of-the-art recurrent SNNs, feedforward SNNs comprising the proposed\nCE-LIF neurons demonstrate superior performance across extensive sequential\nmodeling tasks in terms of classification accuracy, network convergence speed,\nand memory capacity.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:33:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Xinyi",""],["Wu","Jibin",""],["Tang","Huajin",""],["Ren","Qinyuan",""],["Tan","Kay Chen",""]]}
{"id":"2308.15151","submitter":"Raghunath Sahoo","authors":"Bhagyarathi Sahoo, Dushmanta Sahu, Suman Deb, Captain R. Singh, and\n  Raghunath Sahoo","title":"$J/\\psi$ and $\\psi$(2S) polarization in proton-proton collisions at the\n  LHC energies using PYTHIA8","comments":"10 pages and 5-captioned figures. Submitted for publication","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex nucl-ex nucl-th","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The production mechanisms of charmonium states in both hadronic and heavy-ion\ncollisions hold great significance for investigating the hot and dense QCD\nmatter. Studying charmonium polarization in ultra-relativistic collisions can\nalso provide insights into the underlying production mechanisms. With this\nmotivation, we explore the $J/\\psi$ and $\\psi$(2S) polarization in\nproton+proton collisions at $\\sqrt{s}$ = 7, 8, and 13 TeV using a pQCD-inspired\nMonte-Carlo event generator called PYTHIA8. This work considers reconstructed\nquarkonia through their dimuons decay channel in the ALICE forward rapidity\nacceptance range of $2.5 < y_{\\mu \\mu} < 4$. Further, we calculate the\npolarization parameters $\\lambda_{\\theta}$, $\\lambda_{\\phi}$, $\\lambda_{\\theta\n\\phi}$ from the polar and azimuthal angular distributions of the dimuons in\nhelicity and Collins-Soper frames. This study presents a comprehensive\nmeasurement of the polarization parameters as a function of transverse\nmomentum, charged-particle multiplicity, and rapidity at the LHC energies. Our\nfindings of charmonium polarization are in qualitative agreement with the\ncorresponding experimental data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:34:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sahoo","Bhagyarathi",""],["Sahu","Dushmanta",""],["Deb","Suman",""],["Singh","Captain R.",""],["Sahoo","Raghunath",""]]}
{"id":"2308.15152","submitter":"Hiroyuki Ootomo","authors":"Hiroyuki Ootomo, Rio Yokota","title":"Reducing shared memory footprint to leverage high throughput on Tensor\n  Cores and its flexible API extension library","comments":"HPC Asia 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  NVIDIA Tensor Core is a mixed-precision matrix-matrix multiplication and\naddition computing unit, where the theoretical peak performance is more than\n300 TFlop/s on NVIDIA A100 GPU. NVIDIA provides WMMA API for using Tensor Cores\nin custom kernel functions. The most common way to use Tensor Core is to supply\nthe input matrices from shared memory, which has higher bandwidth than global\nmemory. However, the Bytes-per-Flops (B/F) ratio of the shared memory and\nTensor Cores is small since the performance of Tensor Cores is high. Thus, it\nis important to reduce the shared memory footprint for efficient Tensor Cores\nusage. In this paper, we analyze the simple matrix-matrix multiplication on\nTensor Cores by the roofline model and figure out that the bandwidth of shared\nmemory might be a limitation of the performance when using WMMA API. To\nalleviate this issue, we provide a WMMA API extension library to boost the\nthroughput of the computation, which has two components. The first one allows\nfor manipulating the array of registers input to Tensor Cores flexibly. We\nevaluate the performance improvement of this library. The outcome of our\nevaluation shows that our library reduces the shared memory footprint and\nspeeds up the computation using Tensor Cores. The second one is an API for the\nSGEMM emulation on Tensor Cores without additional shared memory usage. We have\ndemonstrated that the single-precision emulating batch SGEMM implementation on\nTensor Cores using this library achieves 54.2 TFlop/s on A100 GPU, which\noutperforms the theoretical peak performance of FP32 SIMT Cores while achieving\nthe same level of accuracy as cuBLAS. The achieved throughput can not be\nachieved without reducing the shared memory footprint done by our library with\nthe same amount of register usage.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:34:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ootomo","Hiroyuki",""],["Yokota","Rio",""]]}
{"id":"2308.15153","submitter":"Valerio Belcamino","authors":"Ali Hammoud, Valerio Belcamino, Alessandro Carfi, Veronique Perdereau\n  and Fulvio Mastrogiovanni","title":"In-hand manipulation planning using human motion dictionary","comments":null,"journal-ref":"2022 31st IEEE International Conference on Robot and Human\n  Interactive Communication (RO-MAN), pp. 927-933","doi":"10.1109/RO-MAN53752.2022.9900858","report-no":null,"categories":"cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Dexterous in-hand manipulation is a peculiar and useful human skill. This\nability requires the coordination of many senses and hand motion to adhere to\nmany constraints. These constraints vary and can be influenced by the object\ncharacteristics or the specific application. One of the key elements for a\nrobotic platform to implement reliable inhand manipulation skills is to be able\nto integrate those constraints in their motion generations. These constraints\ncan be implicitly modelled, learned through experience or human demonstrations.\nWe propose a method based on motion primitives dictionaries to learn and\nreproduce in-hand manipulation skills. In particular, we focused on fingertip\nmotions during the manipulation, and we defined an optimization process to\ncombine motion primitives to reach specific fingertip configurations. The\nresults of this work show that the proposed approach can generate manipulation\nmotion coherent with the human one and that manipulation constraints are\ninherited even without an explicit formalization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:35:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hammoud","Ali",""],["Belcamino","Valerio",""],["Carfi","Alessandro",""],["Perdereau","Veronique",""],["Mastrogiovanni","Fulvio",""]]}
{"id":"2308.15154","submitter":"Margherita Gambini","authors":"Margherita Gambini, Serena Tardelli, Maurizio Tesconi","title":"The Anatomy of Conspirators: Unveiling Traits using a Comprehensive\n  Twitter Dataset","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.CL","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The discourse around conspiracy theories is currently thriving amidst the\nrampant misinformation prevalent in online environments. Research in this field\nhas been focused on detecting conspiracy theories on social media, often\nrelying on limited datasets. In this study, we present a novel methodology for\nconstructing a Twitter dataset that encompasses accounts engaged in\nconspiracy-related activities throughout the year 2022. Our approach centers on\ndata collection that is independent of specific conspiracy theories and\ninformation operations. Additionally, our dataset includes a control group\ncomprising randomly selected users who can be fairly compared to the\nindividuals involved in conspiracy activities. This comprehensive collection\neffort yielded a total of 15K accounts and 37M tweets extracted from their\ntimelines. We conduct a comparative analysis of the two groups across three\ndimensions: topics, profiles, and behavioral characteristics. The results\nindicate that conspiracy and control users exhibit similarity in terms of their\nprofile metadata characteristics. However, they diverge significantly in terms\nof behavior and activity, particularly regarding the discussed topics, the\nterminology used, and their stance on trending subjects. Interestingly, there\nis no significant disparity in the presence of bot users between the two\ngroups, suggesting that conspiracy and automation are orthogonal concepts.\nFinally, we develop a classifier to identify conspiracy users using 93\nfeatures, some of which are commonly employed in literature for troll\nidentification. The results demonstrate a high accuracy level (with an average\nF1 score of 0.98%), enabling us to uncover the most discriminative features\nassociated with conspiracy-related accounts.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:35:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gambini","Margherita",""],["Tardelli","Serena",""],["Tesconi","Maurizio",""]]}
{"id":"2308.15155","submitter":"Markus Gahn","authors":"Markus Gahn","title":"Multi-scale techniques and homogenization for viscoelastic non-simple\n  materials at large strains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper we present the homogenization for nonlinear viscoelastic\nsecond-grade non-simple perforated materials at large strain in the quasistatic\nsetting. The reference domain $\\Omega_{\\varepsilon}$ is periodically perforated\nand is depending on the scaling parameter $\\varepsilon$ which describes the\nratio between the size of the whole domain and the small periodic perforations.\nThe mechanical energy depends on the gradient and also the second gradient of\nthe deformation, and also respects positivity of the determinant of the\ndeformation gradient. For the viscous stresses we assume dynamic frame\nindifference and is therefore depending of the rate of the Cauchy-stress\ntensor. For the derivation of the homogenized model for $\\varepsilon \\to 0$ we\nuse the method of two-scale convergence. For this uniform a priori estimates\nwith respect to $\\varepsilon$ are necessary. The most crucial part is to\nestimate the rate of the deformation gradient. Due to the time-dependent frame\nindifference of the viscous term, we only get coercivity with respect to the\nrate of the Cauchy-stress tensor. To overcome this problem we derive a Korn\ninequality for non-constant coefficients on the perforated domain. The crucial\npoint is to verify that the constant in this inequality, which is usually\ndepending on the domain, can be chosen independently of the parameter\n$\\varepsilon$. Further, we construct an extension operator for second order\nSobolev spaces on perforated domains with operator norm independent of\n$\\varepsilon$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:36:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gahn","Markus",""]]}
{"id":"2308.15156","submitter":"Daniela P\\\"ohn","authors":"Jan-Phillip Makowski and Daniela P\\\"ohn","title":"Evaluation of Real-World Risk-Based Authentication at Online Services\n  Revisited: Complexity Wins","comments":null,"journal-ref":null,"doi":"10.1145/3600160.3605024","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Risk-based authentication (RBA) aims to protect end-users against attacks\ninvolving stolen or otherwise guessed passwords without requiring a second\nauthentication method all the time. Online services typically set limits on\nwhat is still seen as normal and what is not, as well as the actions taken\nafterward. Consequently, RBA monitors different features, such as geolocation\nand device during login. If the features' values differ from the expected\nvalues, then a second authentication method might be requested. However, only a\nfew online services publish information about how their systems work. This\nhinders not only RBA research but also its development and adoption in\norganizations. In order to understand how the RBA systems online services\noperate, black box testing is applied. To verify the results, we re-evaluate\nthe three large providers: Google, Amazon, and Facebook. Based on our test\nsetup and the test cases, we notice differences in RBA based on account\ncreation at Google. Additionally, several test cases rarely trigger the RBA\nsystem. Our results provide new insights into RBA systems and raise several\nquestions for future work.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:37:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Makowski","Jan-Phillip",""],["P\u00f6hn","Daniela",""]]}
{"id":"2308.15157","submitter":"Leander F\\'eret","authors":"L. F\\'eret, A. Gepperth, S. Lambeck","title":"On the improvement of model-predictive controllers","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.NE cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This article investigates synthetic model-predictive control (MPC) problems\nto demonstrate that an increased precision of the internal prediction model\n(PM) automatially entails an improvement of the controller as a whole. In\ncontrast to reinforcement learning (RL), MPC uses the PM to predict subsequent\nstates of the controlled system (CS), instead of directly recommending suitable\nactions. To assess how the precision of the PM translates into the quality of\nthe model-predictive controller, we compare a DNN-based PM to the optimal\nbaseline PM for three well-known control problems of varying complexity. The\nbaseline PM achieves perfect accuracy by accessing the simulation of the CS\nitself. Based on the obtained results, we argue that an improvement of the PM\nwill always improve the controller as a whole, without considering the impact\nof other components such as action selection (which, in this article, relies on\nevolutionary optimization).\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:39:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["F\u00e9ret","L.",""],["Gepperth","A.",""],["Lambeck","S.",""]]}
{"id":"2308.15158","submitter":"Quirin Vogel","authors":"Quirin Vogel, Yash Deshpande, \\v{C}edomir Stefanovi\\'c, Wolfgang\n  Kellerer","title":"An Advanced Tree Algorithm with Interference Cancellation in Uplink and\n  Downlink","comments":"This paper will be presented at the ASILOMAR Conference on Signals,\n  Systems, and Computers","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose Advanced Tree-algorithm with Interference\nCancellation (ATIC), a variant of binary tree-algorithm with successive\ninterference cancellation (SICTA) introduced by Yu and Giannakis. ATIC assumes\nthat Interference Cancellation (IC) can be performed both by the access point\n(AP), as in SICTA, but also by the users. Specifically, after every collision\nslot, the AP broadcasts the observed collision as feedback. Users who\nparticipated in the collision then attempt to perform IC by subtracting their\ntransmissions from the collision signal. This way, the users can resolve\ncollisions of degree 2 and, using a simple distributed arbitration algorithm\nbased on user IDs, ensure that the next slot will contain just a single\ntransmission. We show that ATIC reaches the asymptotic throughput of 0.924 as\nthe number of initially collided users tends to infinity and reduces the number\nof collisions and packet delay. We also compare ATIC with other tree algorithms\nand indicate the extra feedback resources it requires.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:40:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vogel","Quirin",""],["Deshpande","Yash",""],["Stefanovi\u0107","\u010cedomir",""],["Kellerer","Wolfgang",""]]}
{"id":"2308.15159","submitter":"Vladislav Loktev","authors":"Vladislav Loktev, Alexandra Veledina, Juri Poutanen, Joonas\n  N\\\"attil\\\"a, and Valery F. Suleimanov","title":"artpol: Analytical ray-tracing method for spectro-polarimetric\n  properties of accretion disks around Kerr black holes","comments":"Submitted to Astronomy & Astrophysics","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spectro-polarimetric signatures of accretion disks in X-ray binaries and\nactive galactic nuclei contain information about the masses and spins of their\ncentral black holes, as well as the geometry of matter close to the compact\nobjects. This information can be extracted using the means of X-ray\npolarimetry. In this work, we present a fast analytical ray-tracing technique\nfor polarized light \\textsc{artpol} that helps obtain the spinning black hole\nparameters from the observed properties. This technique can replace the\notherwise time-consuming numerical ray-tracing calculations. We show that\n\\textsc{artpol} proves accurate for Kerr black holes with dimensionless spin\nparameter $a\\leq0.94$ while being over four orders of magnitude faster than\ndirect ray-tracing calculations. This approach opens broad prospects for\ndirectly fitting the spectro-polarimetric data from the \\textit{Imaging X-ray\nPolarimetry Explorer}.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:43:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Loktev","Vladislav",""],["Veledina","Alexandra",""],["Poutanen","Juri",""],["N\u00e4ttil\u00e4","Joonas",""],["Suleimanov","Valery F.",""]]}
{"id":"2308.15160","submitter":"Yasmine Al-Hamdani","authors":"Yasmine S. Al-Hamdani, Andrea Zen, Dario Alf\\'e","title":"Unravelling H$_2$ chemisorption and physisorption on metal decorated\n  graphene using quantum Monte Carlo","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Molecular hydrogen is at the core of hydrogen energy applications and has the\npotential to significantly reduce the use of carbon dioxide emitting energy\nprocesses. However, hydrogen gas storage is a major bottleneck for its\nlarge-scale use as current storage methods are energy intensive. Among\ndifferent storage methods, physisorbing molecular hydrogen at ambient pressure\nand temperatures is a promising alternative - particularly thanks to tuneable\nlightweight nanomaterials and high throughput screening methods. Nonetheless,\nunderstanding hydrogen adsorption in well-defined nanomaterials remains\nexperimentally challenging and reference information is scarce despite the\nproliferation of works predicting hydrogen adsorption. In this work, we focus\non Li, Na, Ca, and K, decorated graphene sheets as substrates for hydrogen\nadsorption and compute the most accurate adsorption energies available to date\nusing quantum diffusion Monte Carlo (DMC). Building on our previous insights at\nthe density functional theory (DFT) level, we find that a weak covalent\nchemisorption of molecular hydrogen, known as Kubas binding, is feasible on Ca\ndecorated graphene according to DMC, in agreement with DFT. This finding is in\ncontrast to previous DMC predictions of the 4H$_2$/Ca$^+$ gas cluster where\nchemisorption is not favoured. However, we find that the adsorption energy of\nhydrogen on metal decorated graphene according to a widely-used DFT method is\nnot fully consistent with DMC and the discrepancies are not systematic. The\nreference adsorption energies reported herein can be used to find better\nwork-horse methods for application in large-scale modelling of hydrogen\nadsorption. Furthermore, the implications of this work affect strategies for\nfinding suitable hydrogen storage materials and high-throughput methods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:44:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Al-Hamdani","Yasmine S.",""],["Zen","Andrea",""],["Alf\u00e9","Dario",""]]}
{"id":"2308.15161","submitter":"Daniela P\\\"ohn","authors":"Lukas Hafner and Florian Wutz and Daniela P\\\"ohn and Wolfgang Hommel","title":"TASEP: A Collaborative Social Engineering Tabletop Role-Playing Game to\n  Prevent Successful Social Engineering Attacks","comments":null,"journal-ref":null,"doi":"10.1145/3600160.3605005","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data breaches resulting from targeted attacks against organizations, e.g., by\nadvanced persistent threat groups, often involve social engineering (SE) as the\ninitial attack vector before malicious software is used, e.g., for persistence,\nlateral movement, and data exfiltration. While technical security controls,\nsuch as the automated detection of phishing emails, can contribute to\nmitigating SE risks, raising awareness for SE attacks through education and\nmotivation of personnel is an important building block to increasing an\norganization's resilience. To facilitate hands-on SE awareness training as one\ncomponent of broader SE awareness campaigns, we created a SE tabletop game\ncalled Tabletop As Social Engineering Prevention (TASEP) in two editions for\n(a) small and medium enterprises and (b) large corporations, respectively. Its\ngame design is inspired by Dungeons & Dragons role-playing games and\nfacilitates LEGO models of the in-game target organizations. Participants\nswitch roles by playing a group of SE penetration testers and conducting a\nsecurity audit guided by the game master. We evaluated the created game with\ndifferent student groups, achieving highly immersive and flexible training,\nresulting in an entertaining way of learning about SE and raising awareness.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:44:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hafner","Lukas",""],["Wutz","Florian",""],["P\u00f6hn","Daniela",""],["Hommel","Wolfgang",""]]}
{"id":"2308.15162","submitter":"Jonas Ranft","authors":"Renaud Baillou, Jonas Ranft","title":"Non-equilibrium cluster-cluster aggregation in the presence of anchoring\n  sites","comments":"7 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft q-bio.SC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Non-equilibrium cluster-cluster aggregation of particles diffusing in or at\nthe cell membrane has been hypothesized to lead to domains of finite size in\ndifferent biological contexts such as lipid rafts, cell adhesion complexes, or\npostsynaptic domains in neurons. In this scenario, the desorption of particles\nbalances a continuous flux to the membrane, imposing a cut-off on possible\naggregate sizes and giving rise to a stationary size distribution. Here, we\ninvestigate the case of non-equilibrium cluster-cluster aggregation in two\ndimensions where diffusing particles and/or clusters remain fixed in space at\nspecific anchoring sites, which should be particularly relevant for synapses\nbut may also be present in other biological or physical systems. Using an\neffective mean-field description of the concentration field around anchored\nclusters, we derive an expression for their average size as a function of\nparameters such as the anchoring site density. We furthermore propose and solve\nappropriate rate equations that allow us to predict the size distributions of\nboth diffusing and fixed clusters. We confirm our results with particle-based\nsimulations, and discuss potential implications for biological and physical\nsystems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:45:47 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Baillou","Renaud",""],["Ranft","Jonas",""]]}
{"id":"2308.15163","submitter":"Amine Marrakchi","authors":"Amine Marrakchi","title":"Kadison's problem for type III subfactors and the bicentralizer\n  conjecture","comments":"72 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.OA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In 1967, Kadison asked \"if $N$ is a subfactor of the factor $M$ for which\n$N'\\cap M$ consists of scalars, will some maximal abelian *-subalgebra of $N$\nbe a maximal abelian subalgebra of $M$?\". Generalizing a theorem of Popa in the\ntype II case, we solve Kadison's problem for all subfactors with expectation $N\n\\subset M$ where $N$ is either a type III$_\\lambda$ factor with $0 \\leq \\lambda\n<1$ or a type III$_1$ factor that satisfies Connes's bicentralizer conjecture.\nOur solution is based on a new explicit formula for the bicentralizer algebras\nof arbitrary inclusions. This formula implies a type III analog of Popa's local\nquantization principle. We also give applications of our methods to II$_1$\nfactors, including a new characterization of Ozawa's W*-Akemann-Ostrand\nproperty.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:46:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Marrakchi","Amine",""]]}
{"id":"2308.15164","submitter":"Ling Chen","authors":"Xin Zhou, Ling Chen, Houming Wu","title":"ABS-SGD: A Delayed Synchronous Stochastic Gradient Descent Algorithm\n  with Adaptive Batch Size for Heterogeneous GPU Clusters","comments":"15 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  As the size of models and datasets grows, it has become increasingly common\nto train models in parallel. However, existing distributed stochastic gradient\ndescent (SGD) algorithms suffer from insufficient utilization of computational\nresources and poor convergence in heterogeneous clusters. In this paper, we\npropose a delayed synchronous SGD algorithm with adaptive batch size (ABS-SGD)\nfor heterogeneous GPU clusters. In ABS-SGD, workers perform global\nsynchronization to accumulate delayed gradients and use the accumulated delayed\ngradients to update parameters. While workers are performing global\nsynchronization for delayed gradients, they perform the computation of the next\nbatch without specifying batch size in advance, which lasts until the next\nglobal synchronization starts, realizing the full utilization of computational\nresources. Since the gradient delay is only one iteration, the stale gradient\nproblem can be alleviated. We theoretically prove the convergence of ABS-SGD in\nheterogeneous clusters. Extensive experiments in three types of heterogeneous\nclusters demonstrate that ABS-SGD can make full use of computational resources\nand accelerate model convergence: When training ResNet18 network with 4\nworkers, ABS-SGD increases the convergence speed by 1.30x on average compared\nwith the best baseline algorithm.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:46:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Xin",""],["Chen","Ling",""],["Wu","Houming",""]]}
{"id":"2308.15165","submitter":"Matthew McCormack","authors":"Matthew McCormack, Andrei Teimurazov, Olga Shishkina and Moritz\n  Linkmann","title":"Wall mode dynamics and transition to chaos in magnetoconvection with a\n  vertical magnetic field","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quasistatic magnetoconvection of a low Prandtl number fluid with a vertical\nmagnetic field is considered in a unit aspect ratio box with no-slip\nboundaries. At high relative magnetic field strengths, given by the Hartmann\nnumber $\\textrm{Ha}$, the onset of convection is known to result from a\nsidewall instability giving rise to the wall mode regime. Here, we carry out 3D\ndirect numerical simulations of unprecedented length to map out the parameter\nspace. We track the development of stable equilibria produced by this primary\ninstability, identify bifurcations leading to limit cycles, and eventually to\nchaotic dynamics. At low $\\textrm{Ha}$, the steady wall mode solution undergoes\na symmetry-breaking bifurcation producing a state featuring a coexistence\nbetween wall modes and a large-scale roll in the centre of the domain which\npersists to higher Rayleigh numbers ($\\textrm{Ra}$). However, at higher\n$\\textrm{Ha}$ the steady wall mode solution undergoes a Hopf bifurcation\nproducing a limit cycle which further develops to solutions that shadow an\norbit homoclinic to a saddle point. Upon a further increase in $\\textrm{Ra}$,\nthe system undergoes a subsequent symmetry break producing a coexistence\nbetween wall modes and a large-scale roll, although the large-scale roll exists\nonly for a small range of $\\textrm{Ra}$, and chaotic dynamics primarily arise\ndue to a mixture of chaotic wall mode dynamics and arrays of cellular\nstructures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:47:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["McCormack","Matthew",""],["Teimurazov","Andrei",""],["Shishkina","Olga",""],["Linkmann","Moritz",""]]}
{"id":"2308.15166","submitter":"Daniela P\\\"ohn","authors":"Daniela P\\\"ohn and Niklas M\\\"orsdorf and Wolfgang Hommel","title":"Needle in the Haystack: Analyzing the Right of Access According to GDPR\n  Article 15 Five Years after the Implementation","comments":null,"journal-ref":null,"doi":"10.1145/3600160.3605064","report-no":null,"categories":"cs.CR cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The General Data Protection Regulation (GDPR) was implemented in 2018 to\nstrengthen and harmonize the data protection of individuals within the European\nUnion. One key aspect is Article 15, which gives individuals the right to\naccess their personal data in an understandable format. Organizations offering\nservices to Europeans had five years' time to optimize their processes and\nfunctions to comply with Article 15. This study aims to explore the process of\nsubmitting and receiving the responses of organizations to GDPR Article 15\nrequests. A quantitative analysis obtains data from various websites to\nunderstand the level of conformity, the data received, and the challenges faced\nby individuals who request their data. The study differentiates organizations\noperating worldwide and in Germany, browser website- and app-based usage, and\ndifferent types of websites. Thereby, we conclude that some websites still\ncompile the data manually, resulting in longer waiting times. A few exceptions\ndid not respond with any data or deliver machine-readable data (GDRP Article\n20). The findings of the study additionally reveal ten patterns individuals\nface when requesting and accessing their data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:49:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["P\u00f6hn","Daniela",""],["M\u00f6rsdorf","Niklas",""],["Hommel","Wolfgang",""]]}
{"id":"2308.15167","submitter":"Domagoj Majstorovic","authors":"Domagoj Majstorovic, Frank Diermeyer","title":"Dynamic Collaborative Path Planning for Remote Assistance of\n  Highly-Automated Vehicles","comments":"Accepted at 2023 IEEE International Automated Vehicle Validation\n  Conference (IAVVC)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given its increasing popularity in recent years, teleoperation technology is\nnow recognized as a robust fallback solution for Automated Driving (AD). Remote\nAssistance (RA) represents an event-driven class of teleoperation with a\ndistinct division of tasks between the Autonomous Vehicle (AV) and the remote\nhuman operator. This paper presents a novel approach for RA of AVs in urban\nenvironments. The concept draws inspiration from the potential synergy between\nhighly-automated systems and human operators to collaboratively solve complex\ndriving situations. Utilizing a hybrid algorithm that makes use of the\nOperational Design Domain (ODD) modification idea, it considers actions that go\nbeyond the nominal operational space. Combined with the advanced cognitive\nreasoning of the human remote operator, the concept offers features that hold\nthe potential to significantly improve both RA and AD user experiences.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:49:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Majstorovic","Domagoj",""],["Diermeyer","Frank",""]]}
{"id":"2308.15168","submitter":"Erkan Karabulut","authors":"Erkan Karabulut, Salvatore F. Pileggi, Paul Groth and Victoria Degeler","title":"Ontologies in Digital Twins: A Systematic Literature Review","comments":"The Systematic Literature Review (SLR) is submitted to Future\n  Generation Computer System journal's Special Issue on Digital Twin for Future\n  Networks and Emerging IoT Applications (2023)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Digital Twins (DT) facilitate monitoring and reasoning processes in\ncyber-physical systems. They have progressively gained popularity over the past\nyears because of intense research activity and industrial advancements.\nCognitive Twins is a novel concept, recently coined to refer to the involvement\nof Semantic Web technology in DTs. Recent studies address the relevance of\nontologies and knowledge graphs in the context of DTs, in terms of knowledge\nrepresentation, interoperability and automatic reasoning. However, there is no\ncomprehensive analysis of how semantic technologies, and specifically\nontologies, are utilized within DTs. This Systematic Literature Review (SLR) is\nbased on the analysis of 82 research articles, that either propose or benefit\nfrom ontologies with respect to DT. The paper uses different analysis\nperspectives, including a structural analysis based on a reference DT\narchitecture, and an application-specific analysis to specifically address the\ndifferent domains, such as Manufacturing and Infrastructure. The review also\nidentifies open issues and possible research directions on the usage of\nontologies and knowledge graphs in DTs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:52:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Karabulut","Erkan",""],["Pileggi","Salvatore F.",""],["Groth","Paul",""],["Degeler","Victoria",""]]}
{"id":"2308.15169","submitter":"Zheng Wang","authors":"Zhuo Zhou, Wenxuan Liu, Danni Xu, Zheng Wang, Jian Zhao","title":"Uncovering the Unseen: Discover Hidden Intentions by Micro-Behavior\n  Graph Reasoning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper introduces a new and challenging Hidden Intention Discovery (HID)\ntask. Unlike existing intention recognition tasks, which are based on obvious\nvisual representations to identify common intentions for normal behavior, HID\nfocuses on discovering hidden intentions when humans try to hide their\nintentions for abnormal behavior. HID presents a unique challenge in that\nhidden intentions lack the obvious visual representations to distinguish them\nfrom normal intentions. Fortunately, from a sociological and psychological\nperspective, we find that the difference between hidden and normal intentions\ncan be reasoned from multiple micro-behaviors, such as gaze, attention, and\nfacial expressions. Therefore, we first discover the relationship between\nmicro-behavior and hidden intentions and use graph structure to reason about\nhidden intentions. To facilitate research in the field of HID, we also\nconstructed a seminal dataset containing a hidden intention annotation of a\ntypical theft scenario for HID. Extensive experiments show that the proposed\nnetwork improves performance on the HID task by 9.9\\% over the state-of-the-art\nmethod SBP.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:52:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Zhuo",""],["Liu","Wenxuan",""],["Xu","Danni",""],["Wang","Zheng",""],["Zhao","Jian",""]]}
{"id":"2308.15170","submitter":"Shubhajit Basak","authors":"Shubhajit Basak, Sathish Mangapuram, Gabriel Costache, Rachel\n  McDonnell, Michael Schukat","title":"A lightweight 3D dense facial landmark estimation model from position\n  map data","comments":"8 pages, The Irish Machine Vision and Image Processing\n  Conference(IMVIP)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The incorporation of 3D data in facial analysis tasks has gained popularity\nin recent years. Though it provides a more accurate and detailed representation\nof the human face, accruing 3D face data is more complex and expensive than 2D\nface images. Either one has to rely on expensive 3D scanners or depth sensors\nwhich are prone to noise. An alternative option is the reconstruction of 3D\nfaces from uncalibrated 2D images in an unsupervised way without any ground\ntruth 3D data. However, such approaches are computationally expensive and the\nlearned model size is not suitable for mobile or other edge device\napplications. Predicting dense 3D landmarks over the whole face can overcome\nthis issue. As there is no public dataset available containing dense landmarks,\nwe propose a pipeline to create a dense keypoint training dataset containing\n520 key points across the whole face from an existing facial position map data.\nWe train a lightweight MobileNet-based regressor model with the generated data.\nAs we do not have access to any evaluation dataset with dense landmarks in it\nwe evaluate our model against the 68 keypoint detection task. Experimental\nresults show that our trained model outperforms many of the existing methods in\nspite of its lower model size and minimal computational cost. Also, the\nqualitative evaluation shows the efficiency of our trained models in extreme\nhead pose angles as well as other facial variations and occlusions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:53:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Basak","Shubhajit",""],["Mangapuram","Sathish",""],["Costache","Gabriel",""],["McDonnell","Rachel",""],["Schukat","Michael",""]]}
{"id":"2308.15171","submitter":"Milena W\\\"unsch","authors":"Milena W\\\"unsch, Christina Sauer, Patrick Callahan, Ludwig Christian\n  Hinske, Anne-Laure Boulesteix","title":"From RNA sequencing measurements to the final results: a practical guide\n  to navigating the choices and uncertainties of gene set analysis","comments":"52 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Gene set analysis, a popular approach for analyzing high-throughput gene\nexpression data, aims to identify sets of related genes that show significantly\nenriched or depleted expression patterns between different conditions. In the\nlast years, a multitude of methods and corresponding tools have been developed\nfor this task. However, clear guidance is lacking: choosing the right method is\nthe first hurdle a researcher is confronted with. No less challenging than\novercoming this so-called method uncertainty is the procedure of preprocessing,\nfrom knowing which steps are required to selecting a corresponding approach\nfrom the plethora of valid options to create the accepted input object (data\npreprocessing uncertainty), with clear guidance again being scarce. Here, we\nprovide a practical guide through all steps required to conduct gene set\nanalysis, beginning with a concise overview of a selection of established\nmethods, including GSEA and DAVID. We thereby lay a special focus on reviewing\nand explaining the necessary preprocessing steps for each method under\nconsideration (e.g. the necessity of a transformation of the RNA-Seq data)-an\nessential aspect that is typically paid only limited attention to in both\nexisting reviews and applications. To raise awareness of the spectrum of\nuncertainties, our review is accompanied by an extensive overview of the\nliterature on valid approaches for each step and illustrative R code\ndemonstrating the complex analysis pipelines. It ends with a discussion and\nrecommendations to both users and developers to ensure that the results of gene\nset analysis are, despite the above-mentioned uncertainties, replicable and\ntransparent.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:54:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["W\u00fcnsch","Milena",""],["Sauer","Christina",""],["Callahan","Patrick",""],["Hinske","Ludwig Christian",""],["Boulesteix","Anne-Laure",""]]}
{"id":"2308.15172","submitter":"Zirui Qiu","authors":"Zirui Qiu, Hassan Rivaz, Yiming Xiao","title":"Is visual explanation with Grad-CAM more reliable for deeper neural\n  networks? a case study with automatic pneumothorax diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  While deep learning techniques have provided the state-of-the-art performance\nin various clinical tasks, explainability regarding their decision-making\nprocess can greatly enhance the credence of these methods for safer and quicker\nclinical adoption. With high flexibility, Gradient-weighted Class Activation\nMapping (Grad-CAM) has been widely adopted to offer intuitive visual\ninterpretation of various deep learning models' reasoning processes in\ncomputer-assisted diagnosis. However, despite the popularity of the technique,\nthere is still a lack of systematic study on Grad-CAM's performance on\ndifferent deep learning architectures. In this study, we investigate its\nrobustness and effectiveness across different popular deep learning models,\nwith a focus on the impact of the networks' depths and architecture types, by\nusing a case study of automatic pneumothorax diagnosis in X-ray scans. Our\nresults show that deeper neural networks do not necessarily contribute to a\nstrong improvement of pneumothorax diagnosis accuracy, and the effectiveness of\nGradCAM also varies among different network architectures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:54:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Qiu","Zirui",""],["Rivaz","Hassan",""],["Xiao","Yiming",""]]}
{"id":"2308.15173","submitter":"Erik Wallin","authors":"Torsten \\r{A}kesson (1), Cameron Bravo (2), Liam Brennan (3), Lene\n  Kristian Bryngemark (1), Pierfrancesco Butti (2), E. Craig Dukes (4),\n  Valentina Dutta (5), Bertrand Echenard (6), Thomas Eichlersmith (7), Jonathan\n  Eisch (8), Einar El\\'en (1), Ralf Ehrlich (4), Cooper Froemming (7), Andrew\n  Furmanski (7), Niramay Gogate (9), Chiara Grieco (3), Craig Group (4), Hannah\n  Herde (1), Christian Herwig (8), David G. Hitlin (6), Tyler Horoho (4),\n  Joseph Incandela (3), Wesley Ketchum (8), Gordan Krnjaic (8), Amina Li (3),\n  Jeremiah Mans (7), Phillip Masterson (3), Sophie Middleton (6), Omar Moreno\n  (2), Geoffrey Mullier (1), Joseph Muse (7), Timothy Nelson (2), Leo \\\"Ostman\n  (1), James Oyang (6), Jessica Pascadlo (4), Ruth P\\\"ottgen (1), Luis G.\n  Sarmiento (1), Philip Schuster (2), Cristina Mantilla Suarez (8), Lauren\n  Tompkins (10), Natalia Toro (2), Nhan Tran (8), Erik Wallin (1), Andrew\n  Whitbeck (9), Danyi Zhang (3) ((1) Lund University, (2) SLAC National\n  Accelerator Laboratory, (3) University of California at Santa Barbara, (4)\n  University of Virginia, (5) Carnegie Mellon University, (6) California\n  Institute of Technology, (7) University of Minnesota, (8) Fermi National\n  Accelerator Laboratory, (9) Texas Tech University, (10) Stanford University)","title":"Photon-rejection Power of the Light Dark Matter eXperiment in an 8 GeV\n  Beam","comments":"28 pages, 20 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-433-PPD-T, SLAC-PUB-17550","categories":"hep-ex physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Light Dark Matter eXperiment (LDMX) is an electron-beam fixed-target\nexperiment designed to achieve comprehensive model independent sensitivity to\ndark matter particles in the sub-GeV mass region. An upgrade to the LCLS-II\naccelerator will increase the beam energy available to LDMX from 4 to 8 GeV.\nUsing detailed GEANT4-based simulations, we investigate the effect of the\nincreased beam energy on the capabilities to separate signal and background,\nand demonstrate that the veto methodology developed for 4 GeV successfully\nrejects photon-induced backgrounds for at least $2\\times10^{14}$ electrons on\ntarget at 8 GeV.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:55:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["\u00c5kesson","Torsten",""],["Bravo","Cameron",""],["Brennan","Liam",""],["Bryngemark","Lene Kristian",""],["Butti","Pierfrancesco",""],["Dukes","E. Craig",""],["Dutta","Valentina",""],["Echenard","Bertrand",""],["Eichlersmith","Thomas",""],["Eisch","Jonathan",""],["El\u00e9n","Einar",""],["Ehrlich","Ralf",""],["Froemming","Cooper",""],["Furmanski","Andrew",""],["Gogate","Niramay",""],["Grieco","Chiara",""],["Group","Craig",""],["Herde","Hannah",""],["Herwig","Christian",""],["Hitlin","David G.",""],["Horoho","Tyler",""],["Incandela","Joseph",""],["Ketchum","Wesley",""],["Krnjaic","Gordan",""],["Li","Amina",""],["Mans","Jeremiah",""],["Masterson","Phillip",""],["Middleton","Sophie",""],["Moreno","Omar",""],["Mullier","Geoffrey",""],["Muse","Joseph",""],["Nelson","Timothy",""],["\u00d6stman","Leo",""],["Oyang","James",""],["Pascadlo","Jessica",""],["P\u00f6ttgen","Ruth",""],["Sarmiento","Luis G.",""],["Schuster","Philip",""],["Suarez","Cristina Mantilla",""],["Tompkins","Lauren",""],["Toro","Natalia",""],["Tran","Nhan",""],["Wallin","Erik",""],["Whitbeck","Andrew",""],["Zhang","Danyi",""]]}
{"id":"2308.15174","submitter":"Samuel Daudin","authors":"Samuel Daudin, Benjamin Seeger","title":"A comparison principle for semilinear Hamilton-Jacobi-Bellman equations\n  in the Wasserstein space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The goal of this paper is to prove a comparison principle for viscosity\nsolutions of semilinear Hamilton-Jacobi equations in the space of probability\nmeasures. The method involves leveraging differentiability properties of the\n$2$-Wasserstein distance in the doubling of variables argument, which is done\nby introducing a further entropy penalization that ensures that the relevant\noptima are achieved at positive, Lipschitz continuous densities with finite\nFischer information. This allows to prove uniqueness and stability of viscosity\nsolutions in the class of bounded Lipschitz continuous (with respect to the\n$1$-Wasserstein distance) functions. The result does not appeal to a mean field\ncontrol formulation of the equation, and, as such, applies to equations with\nnonconvex Hamiltonians and measure-dependent volatility. For convex\nHamiltonians that derive from a potential, we prove that the value function\nassociated with a suitable mean-field optimal control problem with\nnondegenerate idiosyncratic noise is indeed the unique viscosity solution.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:56:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Daudin","Samuel",""],["Seeger","Benjamin",""]]}
{"id":"2308.15175","submitter":"Luka Mili\\'cevi\\'c","authors":"Luka Mili\\'cevi\\'c","title":"A note on transverse sets and bilinear varieties","comments":"11 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $G$ and $H$ be finite-dimensional vector spaces over $\\mathbb{F}_p$. A\nsubset $A \\subseteq G \\times H$ is said to be transverse if all of its rows\n$\\{x \\in G \\colon (x,y) \\in A\\}$, $y \\in H$, are subspaces of $G$ and all of\nits columns $\\{y \\in H \\colon (x,y) \\in A\\}$, $x \\in G$, are subspaces of $H$.\nAs a corollary of a bilinear version of Bogolyubov argument, Gowers and the\nauthor proved that dense transverse sets contain bilinear varieties of bounded\ncodimension. In this paper, we provide a direct combinatorial proof of this\nfact. In particular, we improve the bounds and evade the use of Fourier\nanalysis and Freiman's theorem and its variants.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:56:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mili\u0107evi\u0107","Luka",""]]}
{"id":"2308.15176","submitter":"Daniela P\\\"ohn","authors":"Laura Gamisch and Daniela P\\\"ohn","title":"A Study of Different Awareness Campaigns in a Company","comments":null,"journal-ref":null,"doi":"10.1145/3600160.3605006","report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Phishing is a major cyber threat to organizations that can cause financial\nand reputational damage, threatening their existence. The technical measures\nagainst phishing should be complemented by awareness training for employees.\nHowever, there is little validation of awareness measures. Consequently,\norganizations have an additional burden when integrating awareness training, as\nthere is no consensus on which method brings the best success. This paper\nexamines how awareness concepts can be successfully implemented and validated.\nFor this purpose, various factors, such as requirements and possible\ncombinations of methods, are taken into account in our case study at a small-\nand medium-sized enterprise (SME). To measure success, phishing exercises are\nconducted. The study suggests that pleasant campaigns result in better\nperformance in the simulated phishing exercise. In addition, significant\nimprovements and differences in the target groups could be observed. The\nimplementation of awareness training with integrated key performance indicators\ncan be used as a basis for other organizations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:57:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gamisch","Laura",""],["P\u00f6hn","Daniela",""]]}
{"id":"2308.15177","submitter":"Huu-Thinh Do","authors":"Huu-Thinh Do, Franco Blanchini, Ionela Prodan","title":"Enhancements on a saturated control for stabilizing a quadcopter:\n  adaptive and robustness analysis in the flat output space","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  This paper extends our previous study on an explicit saturated control for a\nquadcopter, which ensures both constraint satisfaction and stability thanks to\nthe linear representation of the system in the flat output space. The novelty\nhere resides in the adaptivity of the controller's gain to enhance the system's\nperformance without exciting its parasitic dynamics and avoid lavishing the\ninput actuation with excessively high gain parameters. Moreover, we provide a\nthorough robustness analysis of the proposed controller when additive\ndisturbances are affecting the system behavior. Finally, simulation and\nexperimental tests validate the proposed controller.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 09:57:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Do","Huu-Thinh",""],["Blanchini","Franco",""],["Prodan","Ionela",""]]}
{"id":"2308.15178","submitter":"Shufang Zhu","authors":"Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu","title":"Symbolic LTLf Best-Effort Synthesis","comments":"To appear at EUMAS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.FL cs.GT cs.LO cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider an agent acting to fulfil tasks in a nondeterministic\nenvironment. When a strategy that fulfills the task regardless of how the\nenvironment acts does not exist, the agent should at least avoid adopting\nstrategies that prevent from fulfilling its task. Best-effort synthesis\ncaptures this intuition. In this paper, we devise and compare various symbolic\napproaches for best-effort synthesis in Linear Temporal Logic on finite traces\n(LTLf). These approaches are based on the same basic components, however they\nchange in how these components are combined, and this has a significant impact\non the performance of the approaches as confirmed by our empirical evaluations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:00:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["De Giacomo","Giuseppe",""],["Parretti","Gianmarco",""],["Zhu","Shufang",""]]}
{"id":"2308.15179","submitter":"Michele Tucci","authors":"J. Andres Diaz-Pace, Daniele Di Pompeo, Michele Tucci","title":"Best performance and reliability for your time: budget-aware\n  search-based optimization of software model refactoring","comments":"arXiv admin note: substantial text overlap with arXiv:2212.08385","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Context: Software model optimization is a process that automatically\ngenerates design alternatives, typically to enhance quantifiable non-functional\nproperties of software systems, such as performance and reliability.\nMulti-objective evolutionary algorithms have shown to be effective in this\ncontext for assisting the designer in identifying trade-offs between the\ndesired non-functional properties. Objective: In this work, we investigate the\neffects of imposing a time budget to limit the search for design alternatives,\nwhich inevitably affects the quality of the resulting alternatives. Method: The\neffects of time budgets are analyzed by investigating both the quality of the\ngenerated design alternatives and their structural features when varying the\nbudget and the genetic algorithm (NSGA-II, PESA2, SPEA2). This is achieved by\nemploying multi-objective quality indicators and a tree-based representation of\nthe search space. Results: The study reveals that the time budget significantly\naffects the quality of Pareto fronts, especially for performance and\nreliability. NSGA-II is the fastest algorithm, while PESA2 generates the\nhighest-quality solutions. The imposition of a time budget results in\nstructurally distinct models compared to those obtained without a budget,\nindicating that the search process is influenced by both the budget and\nalgorithm selection. Conclusions: In software model optimization, imposing a\ntime budget can be effective in saving optimization time, but designers should\ncarefully consider the trade-off between time and solution quality in the\nPareto front, along with the structural characteristics of the generated\nmodels. By making informed choices about the specific genetic algorithm,\ndesigners can achieve different trade-offs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:01:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Diaz-Pace","J. Andres",""],["Di Pompeo","Daniele",""],["Tucci","Michele",""]]}
{"id":"2308.15180","submitter":"Victoire Michal","authors":"Victoire Michal, Jon Wakefield, Alexandra M. Schmidt, Alicia\n  Cavanaugh, Brian Robinson and Jill Baumgartner","title":"Small Area Estimation with Random Forests and the LASSO","comments":"40 pages, 10 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We consider random forests and LASSO methods for model-based small area\nestimation when the number of areas with sampled data is a small fraction of\nthe total areas for which estimates are required. Abundant auxiliary\ninformation is available for the sampled areas, from the survey, and for all\nareas, from an exterior source, and the goal is to use auxiliary variables to\npredict the outcome of interest. We compare areal-level random forests and\nLASSO approaches to a frequentist forward variable selection approach and a\nBayesian shrinkage method. Further, to measure the uncertainty of estimates\nobtained from random forests and the LASSO, we propose a modification of the\nsplit conformal procedure that relaxes the assumption of identically\ndistributed data. This work is motivated by Ghanaian data available from the\nsixth Living Standard Survey (GLSS) and the 2010 Population and Housing Census.\nWe estimate the areal mean household log consumption using both datasets. The\noutcome variable is measured only in the GLSS for 3\\% of all the areas (136 out\nof 5019) and more than 170 potential covariates are available from both\ndatasets. Among the four modelling methods considered, the Bayesian shrinkage\nperformed the best in terms of bias, MSE and prediction interval coverages and\nscores, as assessed through a cross-validation study. We find substantial\nbetween-area variation, the log consumption areal point estimates showing a\n1.3-fold variation across the GAMA region. The western areas are the poorest\nwhile the Accra Metropolitan Area district gathers the richest areas.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:02:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Michal","Victoire",""],["Wakefield","Jon",""],["Schmidt","Alexandra M.",""],["Cavanaugh","Alicia",""],["Robinson","Brian",""],["Baumgartner","Jill",""]]}
{"id":"2308.15181","submitter":"Xing Huang","authors":"Xing Huang","title":"Propagation of Chaos for Mean Field Interacting Particle System with\n  Multiplicative Noise","comments":"20 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, the quantitative propagation of chaos for mean field\ninteracting particle system with multiplicative noise in relative entropy is\nobtained, where the diffusion is distribution free, the interaction in the\ndrift is bounded or Lipschitz continuous and the initial distribution of\ninteracting particles is allowed to be singular with that of the limit\nequation. When the interaction in both the diffusion and drift is Lipschitz\ncontinuous, the quantitative propagation of chaos in\n$L^\\eta$($\\eta\\in(0,1)$)-Wasserstein distance is proved, which seems to be the\nfirst result on quantitative propagation of chaos in\n$L^\\eta$($\\eta\\in(0,1)$)-Wasserstein distance in the literature. Furthermore,\nthe long time quantitative propagation of chaos in relative entropy as well as\n$L^2$(-Wasserstein distance is also derived under dissipative condition.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:02:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Xing",""]]}
{"id":"2308.15182","submitter":"Tom Gustafsson","authors":"Tom Gustafsson, Juha Videman","title":"Stabilised finite element method for Stokes problem with nonlinear slip\n  condition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This work introduces a stabilised finite element formulation for the Stokes\nflow problem with a nonlinear slip boundary condition of friction type. The\nboundary condition is enforced with the help of an additional Lagrange\nmultiplier and the stabilised formulation is based on simultaneously\nstabilising both the pressure and the Lagrange multiplier. We establish the\nstability and the a priori error analyses, and perform a numerical convergence\nstudy in order to verify the theory.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:03:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gustafsson","Tom",""],["Videman","Juha",""]]}
{"id":"2308.15183","submitter":"Pablo Andr\\'es-Mart\\'inez","authors":"Pablo Andr\\'es-Mart\\'inez, Chris Heunen","title":"Categories of sets with infinite addition","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CT math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider sets with infinite addition, called $\\Sigma$-monoids, and\ncontribute to their literature in three ways. First, our definition subsumes\nthose from previous works and allows us to relate them in terms of adjuctions\nbetween their categories. In particular, we discuss $\\Sigma$-monoids with\nadditive inverses. Second, we show that every Hausdorff commutative monoid is a\n$\\Sigma$-monoid, and that there is a free Hausdorff commutative monoid for each\n$\\Sigma$-monoid. Third, we prove that $\\Sigma$-monoids have well-defined tensor\nproducts, unlike topological abelian groups.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:04:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Andr\u00e9s-Mart\u00ednez","Pablo",""],["Heunen","Chris",""]]}
{"id":"2308.15184","submitter":"Shufang Zhu","authors":"Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon,\n  Sasha Rubin, Shufang Zhu","title":"LTLf Synthesis Under Environment Specifications for Reachability and\n  Safety Properties","comments":"To appear at EUMAS2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO cs.AI cs.FL cs.SY eess.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we study LTLf synthesis under environment specifications for\narbitrary reachability and safety properties. We consider both kinds of\nproperties for both agent tasks and environment specifications, providing a\ncomplete landscape of synthesis algorithms. For each case, we devise a specific\nalgorithm (optimal wrt complexity of the problem) and prove its correctness.\nThe algorithms combine common building blocks in different ways. While some\ncases are already studied in literature others are studied here for the first\ntime.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:05:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Aminof","Benjamin",""],["De Giacomo","Giuseppe",""],["Di Stasio","Antonio",""],["Francon","Hugo",""],["Rubin","Sasha",""],["Zhu","Shufang",""]]}
{"id":"2308.15185","submitter":"Valerii Kozin","authors":"C. E. Whittaker, T. Isoniemi, S. Lovett, P. M. Walker, S. Kolodny, V.\n  Kozin, I. V. Iorsh, I. Farrer, D. A. Ritchie, M. S. Skolnick, and D. N.\n  Krizhanovskii","title":"Exciton-polaritons in GaAsbased slab waveguide photonic crystals","comments":"published in Appl. Phys. Lett. in 2021","journal-ref":"Appl. Phys. Lett. 119, 181101 (2021)","doi":"10.1063/5.0071248","report-no":null,"categories":"physics.optics cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report the observation of band gaps for low loss exciton-polaritons\npropagating outside the light cone in GaAs-based planar waveguides patterned\ninto two-dimensional photonic crystals. By etching square lattice arrays of\nshallow holes into the uppermost layer of our structure, we open gaps on the\norder of 10 meV in the photonic mode dispersion, whose size and light-matter\ncomposition can be tuned by proximity to the strongly coupled exciton\nresonance. We demonstrate gaps ranging from almost fully photonic to highly\nexcitonic. Opening a gap in the exciton-dominated part of the polariton\nspectrum is a promising first step towards the realization of quantum-Hall-like\nstates arising from topologically nontrivial hybridization of excitons and\nphotons.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:05:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Whittaker","C. E.",""],["Isoniemi","T.",""],["Lovett","S.",""],["Walker","P. M.",""],["Kolodny","S.",""],["Kozin","V.",""],["Iorsh","I. V.",""],["Farrer","I.",""],["Ritchie","D. A.",""],["Skolnick","M. S.",""],["Krizhanovskii","D. N.",""]]}
{"id":"2308.15186","submitter":"Juan F. R. Archilla","authors":"Juan F R Archilla, J\\=anis Baj\\=ars, Yusuke Doi and Masayuki Kimura","title":"A semiclassical model for charge transfer along ion chains in silicates","comments":"20 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci nlin.PS","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  It has been observed in fossil tracks and experiments in the layered silicate\nmica muscovite the transport of charge through the cation layers sandwiched\nbetween the layers of tetrahedra-octahedra-tetrahedra. A classical model for\nthe propagation of anharmonic vibrations along the cation chains has been\nproposed based on first principles and empirical functions. In that model,\nseveral propagating entities have been found as kinks or crowdions and\nbreathers, both with or without wings, the latter for specific velocities and\nenergies. Crowdions are equivalent to moving interstitials and transport\nelectric charge if the moving particle is an ion, but they also imply the\nmovement of mass, which was not observed in the experiments. Breathers, being\njust vibrational entities, do not transport charge. In this work, we present a\nsemiclassical model obtained by adding a quantum particle, electron or hole to\nthe previous model. We present the construction of the model based on the\nphysics of the system. In particular, the strongly nonlinear vibronic\ninteraction between the nuclei and the extra electron or hole is essential to\nexplain the localized charge transport, which is not compatible with the\nadiabatic approximation. The formation of vibrational localized charge carriers\nbreaks the lattice symmetry group in a similar fashion to the Jahn-Teller\nEffect, providing a new stable dynamical state. We study the properties and the\ncoherence of the model through numerical simulations from initial conditions\nobtained by tail analysis and other means. We observe that although the charge\nspreads from an initial localization in a lattice at equilibrium, it can be\nconfined basically to a single particle when coupled to a chaotic quasiperiodic\nbreather. This is coherent with the observation that experiments imply that a\npopulation of charge is formed due to the decay of potassium unstable isotopes.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:06:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Archilla","Juan F R",""],["Baj\u0101rs","J\u0101nis",""],["Doi","Yusuke",""],["Kimura","Masayuki",""]]}
{"id":"2308.15187","submitter":"Victor Batyrev","authors":"Victor V. Batyrev","title":"Hodge Theory of Hypersurfaces in Toric Varieties and Recent Developments\n  in Quantum Physics","comments":"125pages. arXiv admin note: substantial text overlap with\n  arXiv:alg-geom/9310003","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG hep-th math.AC math.CO quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This is the author's Habilitation which took place at University of Essen on\nJuly 11, 1993. The manuscript contains two parts. The first one is devoted to\nthe author's combinatorial construction of mirrors of Calabi-Yau hypersurfaces\nin Gorenstein toric Fano varieties. The second one contains author's results on\nthe variation of mixed Hodge structures of affine hypersurfaces in algebraic\ntori and their connection to Gelfand-Kapranov-Zelevinsky theory of generalized\nhypergeometric functions and their applications to the mirror symmetry for\nCalabi-Yau hypersurfaces in toric varieties.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:09:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Batyrev","Victor V.",""]]}
{"id":"2308.15188","submitter":"Shufang Zhu","authors":"Giuseppe De Giacomo, Gianmarco Parretti, Shufang Zhu","title":"LTLf Best-Effort Synthesis in Nondeterministic Planning Domains","comments":"To appear at ECAI2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.FL cs.GT cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study best-effort strategies (aka plans) in fully observable\nnondeterministic domains (FOND) for goals expressed in Linear Temporal Logic on\nFinite Traces (LTLf). The notion of best-effort strategy has been introduced to\nalso deal with the scenario when no agent strategy exists that fulfills the\ngoal against every possible nondeterministic environment reaction. Such\nstrategies fulfill the goal if possible, and do their best to do so otherwise.\nWe present a game-theoretic technique for synthesizing best-effort strategies\nthat exploit the specificity of nondeterministic planning domains. We formally\nshow its correctness and demonstrate its effectiveness experimentally,\nexhibiting a much greater scalability with respect to a direct best-effort\nsynthesis approach based on re-expressing the planning domain as generic\nenvironment specifications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:10:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["De Giacomo","Giuseppe",""],["Parretti","Gianmarco",""],["Zhu","Shufang",""]]}
{"id":"2308.15189","submitter":"Eugen Ghenciu","authors":"Andrei E. Ghenciu, Ronnie Pavlov","title":"The extended Hausdorff dimension spectrum of a conformal iterated\n  function system is maximal","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  For any conformal iterated function system (CIFS) consisting of finitely or\ncountably many maps, and any closed shift-invariant set of right-infinite\nsequences of such maps, one can associate a limit set, which we call a\nshift-generated conformal iterated construction. We define the extended\nHausdorff dimension spectrum of a CIFS to be the set of Hausdorff dimensions of\nall such limit sets. We prove that for any CIFS with finitely or countably many\nmaps, the extended Hausdorff dimension spectrum is maximal, i.e. all\nnonnegative dimensions less than or equal to the dimension of the limit set of\nthe CIFS are realized. We also prove a version of this result even for\nso-called conformal graph directed Markov systems, obtained via\nnearest-neighbor restrictions on the CIFS. %when there are nearest-neighbor\nrestrictions on the CIFS (similar to those in the so-called conformal graph\ndirected Markov systems).\n  The main step of the proof is to show that for the family $(X_\\beta)$ of\nso-called $\\beta$-shifts, the Hausdorff dimension of the limit set associated\nto $X_\\beta$ varies continuously as a function of $\\beta$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:16:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghenciu","Andrei E.",""],["Pavlov","Ronnie",""]]}
{"id":"2308.15190","submitter":"Corentin Bernard","authors":"Corentin Bernard, Nicolas Huloux, Micha\\\"el Wiertlewski and Jocelyn\n  Monnoyer","title":"Physical and behavioral comparison of haptic touchscreens quality","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Touchscreens equipped with friction modulation can provide rich tactile\nfeedback to their users. To date, there are no standard metrics to properly\nquantify the benefit brought by haptic feedback.The definition of such metrics\nis not straightforward since friction modulation technologies can be achieved\nby either ultrasonic waves or with electroadhesion. In addition, the output\ndepends strongly on the user, both because of the mechanical behavior of the\nfingertip and personal tactile somatosensory capabilities. This paper proposes\na method to evaluate and compare the performance of haptic tablets on an\nobjective scale. The method first defines multiple metrics using physical\nmeasurements of friction and latency. The comparison is completed with metrics\nderived from information theory and based on pointing tasks performed by users.\nWe evaluated the comparison method with two haptic devices, one based on\nultrasonic friction modulation and the other based on electroadhesion. This\nwork paves the way toward the definitions of standard specifications for haptic\ntablets, to establish benchmarks and guidelines for improving surface haptic\ndevices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:17:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bernard","Corentin",""],["Huloux","Nicolas",""],["Wiertlewski","Micha\u00ebl",""],["Monnoyer","Jocelyn",""]]}
{"id":"2308.15191","submitter":"Jim Woodcock FREng","authors":"Jim Woodcock, Mikkel Schimdt Andersen, Diego F. Aranha, Stefan\n  Hallerstede, Simon Thrane Hansen, Nikolaj Kuhne Jakobsen, Tomas Kulik, Peter\n  Gorm Larsen, Hugo Daniel Macedo, Carlos Ignacio Isasa Martin, Victor\n  Alexander Mtsimbe Norrild","title":"State of the Art Report: Verified Computation","comments":"54 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This report describes the state of the art in verifiable computation. The\nproblem being solved is the following:\n  The Verifiable Computation Problem (Verifiable Computing Problem) Suppose we\nhave two computing agents. The first agent is the verifier, and the second\nagent is the prover. The verifier wants the prover to perform a computation.\nThe verifier sends a description of the computation to the prover. Once the\nprover has completed the task, the prover returns the output to the verifier.\nThe output will contain proof. The verifier can use this proof to check if the\nprover computed the output correctly. The check is not required to verify the\nalgorithm used in the computation. Instead, it is a check that the prover\ncomputed the output using the computation specified by the verifier. The effort\nrequired for the check should be much less than that required to perform the\ncomputation.\n  This state-of-the-art report surveys 128 papers from the literature\ncomprising more than 4,000 pages. Other papers and books were surveyed but were\nomitted. The papers surveyed were overwhelmingly mathematical. We have\nsummarised the major concepts that form the foundations for verifiable\ncomputation. The report contains two main sections. The first, larger section\ncovers the theoretical foundations for probabilistically checkable and\nzero-knowledge proofs. The second section contains a description of the current\npractice in verifiable computation. Two further reports will cover (i) military\napplications of verifiable computation and (ii) a collection of technical\ndemonstrators. The first of these is intended to be read by those who want to\nknow what applications are enabled by the current state of the art in\nverifiable computation. The second is for those who want to see practical tools\nand conduct experiments themselves.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:17:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Woodcock","Jim",""],["Andersen","Mikkel Schimdt",""],["Aranha","Diego F.",""],["Hallerstede","Stefan",""],["Hansen","Simon Thrane",""],["Jakobsen","Nikolaj Kuhne",""],["Kulik","Tomas",""],["Larsen","Peter Gorm",""],["Macedo","Hugo Daniel",""],["Martin","Carlos Ignacio Isasa",""],["Norrild","Victor Alexander Mtsimbe",""]]}
{"id":"2308.15192","submitter":"Guanghui Fu","authors":"Guanghui Fu, Qing Zhao, Jianqiang Li, Dan Luo, Changwei Song, Wei\n  Zhai, Shuo Liu, Fan Wang, Yan Wang, Lijuan Cheng, Juan Zhang, Bing Xiang Yang","title":"Enhancing Psychological Counseling with Large Language Model: A\n  Multifaceted Decision-Support System for Non-Professionals","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In the contemporary landscape of social media, an alarming number of users\nexpress negative emotions, some of which manifest as strong suicidal\nintentions. This situation underscores a profound need for trained\npsychological counselors who can enact effective mental interventions. However,\nthe development of these professionals is often an imperative but\ntime-consuming task. Consequently, the mobilization of non-professionals or\nvolunteers in this capacity emerges as a pressing concern. Leveraging the\ncapabilities of artificial intelligence, and in particular, the recent advances\nin large language models, offers a viable solution to this challenge. This\npaper introduces a novel model constructed on the foundation of large language\nmodels to fully assist non-professionals in providing psychological\ninterventions on online user discourses. This framework makes it plausible to\nharness the power of non-professional counselors in a meaningful way. A\ncomprehensive study was conducted involving ten professional psychological\ncounselors of varying expertise, evaluating the system across five critical\ndimensions. The findings affirm that our system is capable of analyzing\npatients' issues with relative accuracy and proffering professional-level\nstrategies recommendations, thereby enhancing support for non-professionals.\nThis research serves as a compelling validation of the application of large\nlanguage models in the field of psychology and lays the groundwork for a new\nparadigm of community-based mental health support.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:20:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fu","Guanghui",""],["Zhao","Qing",""],["Li","Jianqiang",""],["Luo","Dan",""],["Song","Changwei",""],["Zhai","Wei",""],["Liu","Shuo",""],["Wang","Fan",""],["Wang","Yan",""],["Cheng","Lijuan",""],["Zhang","Juan",""],["Yang","Bing Xiang",""]]}
{"id":"2308.15193","submitter":"Jef Laga","authors":"Jef Laga, Ciaran Schembri, Ari Shnidman and John Voight","title":"Rational torsion points on abelian surfaces with quaternionic\n  multiplication","comments":"37 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Let $A$ be an abelian surface over $\\mathbb{Q}$ whose geometric endomorphism\nring is a maximal order in a non-split quaternion algebra. Inspired by Mazur's\ntheorem for elliptic curves, we show that the torsion subgroup of\n$A(\\mathbb{Q})$ is $12$-torsion and has order at most $18$. Under the\nadditional assumption that $A$ is of $\\mathrm{GL}_2$-type, we give a complete\nclassification of the possible torsion subgroups of $A(\\mathbb{Q})$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:21:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Laga","Jef",""],["Schembri","Ciaran",""],["Shnidman","Ari",""],["Voight","John",""]]}
{"id":"2308.15194","submitter":"Riccardo Guidotti","authors":"Riccardo Guidotti, Salvatore Ruggieri","title":"Ensemble of Counterfactual Explainers","comments":null,"journal-ref":null,"doi":"10.1007/978-3-030-88942-5_28","report-no":null,"categories":"cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In eXplainable Artificial Intelligence (XAI), several counterfactual\nexplainers have been proposed, each focusing on some desirable properties of\ncounterfactual instances: minimality, actionability, stability, diversity,\nplausibility, discriminative power. We propose an ensemble of counterfactual\nexplainers that boosts weak explainers, which provide only a subset of such\nproperties, to a powerful method covering all of them. The ensemble runs weak\nexplainers on a sample of instances and of features, and it combines their\nresults by exploiting a diversity-driven selection function. The method is\nmodel-agnostic and, through a wrapping approach based on autoencoders, it is\nalso data-agnostic.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:21:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Guidotti","Riccardo",""],["Ruggieri","Salvatore",""]]}
{"id":"2308.15195","submitter":"Lijie Ji","authors":"Yajie Ji, Lijie Ji, Yanlai Chen, Zhenli Xu","title":"MCMS-RBM: Multi-Component Multi-State Reduced Basis Method toward\n  Efficient Transition Pathway Identification for Crystals and Quasicrystals","comments":"18 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Due to quasicrystals having long-range orientational order but without\ntranslational symmetry, traditional numerical methods usually suffer when\napplied as is. In the past decade, the projection method has emerged as a\nprominent solver for quasiperiodic problems. Transforming them into a higher\ndimensional but periodic ones, the projection method facilitates the\napplication of the fast Fourier transform. However, the computational\ncomplexity inevitably becomes high which significantly impedes e.g. the\ngeneration of the phase diagram since a high-fidelity simulation of a problem\nwhose dimension is doubled must be performed for numerous times.\n  To address the computational challenge of quasiperiodic problems based on the\nprojection method, this paper proposes a multi-component multi-state reduced\nbasis method (MCMS-RBM). Featuring multiple components with each providing\nreduction functionality for one branch of the problem induced by one part of\nthe parameter domain, the MCMS-RBM does not resort to the parameter domain\nconfigurations (e.g. phase diagrams) a priori. It enriches each component in a\ngreedy fashion via a phase-transition guided exploration of the multiple states\ninherent to the problem. Adopting the empirical interpolation method, the\nresulting online-efficient method vastly accelerates the generation of a\ndelicate phase diagram to a matter of minutes for a parametrized two-turn-four\ndimensional Lifshitz-Petrich model with two length scales. Moreover, it\nfurnishes surrogate and equally accurate field variables anywhere in the\nparameter domain.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:22:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ji","Yajie",""],["Ji","Lijie",""],["Chen","Yanlai",""],["Xu","Zhenli",""]]}
{"id":"2308.15196","submitter":"Mangesh Goswami Mr","authors":"Mangesh M. Goswami, Milind Mujumdar, Bhupendra Bahadur Singh,\n  Madhusudan Ingale, Naresh Ganeshi, Manish Ranalkar, Trenton E. Franz,\n  Prashant Srivastav, Dev Niyogi, R. Krishnan and S. N. Patil","title":"Understanding the soil water dynamics during excess and deficit rainfall\n  conditions over the Core monsoon zone of India","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Observations of soil moisture (SM) during excess and deficit monsoon seasons\nbetween 2000 to 2021 present a unique opportunity to understand the soil water\ndynamics (SWD) over core monsoon zone (CMZ) of India. This study aims to\nanalyse SWD by investigating the SM variability, SM memory (SMM), and the\ncoupling between the surface and subsurface SM levels. Particularly intriguing\nare instances of concurrent monsoonal extremes, which give rise to complex SWD\npatterns. Usually, it is noted that a depleted convective activity and\npersistence of higher temperatures during the pre-monsoon season leads to lower\nSM, while monsoon rains and post-monsoon showers support the prevalence of\nhigher SM conditions. The long persistent dry spells during deficit monsoon\nyears enhances the Bowen ratio (BR) due to the high sensible heat fluxes. On\nthe other hand, the availability of large latent heat flux during excess\nmonsoon and post-monsoon seasons tends to decrease the BR. This enhancement or\nreduction in BR is due to evapotranspiration (ET), which influences the SWD by\nmodulating the surface subsurface SM coupling. The surface and subsurface SM\ncoupling analysis for CMZ exhibits significant distinction in the evolution of\nwet and dry extremes. SM variations and persistence time scale is used as an\nindicator of SMM, and analysed for both surface and subsurface SM observation\nlevels. Evidently, subsurface SM exhibits remarkably prolonged memory\ntimescales, approximately twice that of surface SM. Furthermore, we dissect SWD\nlinked to wet and dry extremes by analysing annual soil water balance (SWB).\nOur findings reveal augmented (diminished) ET during deficit (excess) years,\nsubjected to a higher (lower) number of break events. In essence, our study\nunderscores the significance of surface-subsurface SM observations in\nunravelling the intricate tapestry of SWD.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:23:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Goswami","Mangesh M.",""],["Mujumdar","Milind",""],["Singh","Bhupendra Bahadur",""],["Ingale","Madhusudan",""],["Ganeshi","Naresh",""],["Ranalkar","Manish",""],["Franz","Trenton E.",""],["Srivastav","Prashant",""],["Niyogi","Dev",""],["Krishnan","R.",""],["Patil","S. N.",""]]}
{"id":"2308.15197","submitter":"Xinglei Wang","authors":"Xinglei Wang, Meng Fang, Zichao Zeng, Tao Cheng","title":"Where Would I Go Next? Large Language Models as Human Mobility\n  Predictors","comments":"13 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SI physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Accurate human mobility prediction underpins many important applications\nacross a variety of domains, including epidemic modelling, transport planning,\nand emergency responses. Due to the sparsity of mobility data and the\nstochastic nature of people's daily activities, achieving precise predictions\nof people's locations remains a challenge. While recently developed large\nlanguage models (LLMs) have demonstrated superior performance across numerous\nlanguage-related tasks, their applicability to human mobility studies remains\nunexplored. Addressing this gap, this article delves into the potential of LLMs\nfor human mobility prediction tasks. We introduce a novel method, LLM-Mob,\nwhich leverages the language understanding and reasoning capabilities of LLMs\nfor analysing human mobility data. We present concepts of historical stays and\ncontext stays to capture both long-term and short-term dependencies in human\nmovement and enable time-aware prediction by using time information of the\nprediction target. Additionally, we design context-inclusive prompts that\nenable LLMs to generate more accurate predictions. Comprehensive evaluations of\nour method reveal that LLM-Mob excels in providing accurate and interpretable\npredictions, highlighting the untapped potential of LLMs in advancing human\nmobility prediction techniques. We posit that our research marks a significant\nparadigm shift in human mobility modelling, transitioning from building complex\ndomain-specific models to harnessing general-purpose LLMs that yield accurate\npredictions through language instructions. The code for this work is available\nat https://github.com/xlwang233/LLM-Mob.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:24:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Xinglei",""],["Fang","Meng",""],["Zeng","Zichao",""],["Cheng","Tao",""]]}
{"id":"2308.15198","submitter":"Ben Webster","authors":"Davide Gaiotto, Justin Hilburn, Jaime Redondo-Yuste, Ben Webster,\n  Zheng Zhou","title":"Twisted traces on abelian quantum Higgs and Coulomb branches","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th math-ph math.MP math.RA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study twisted traces on the quantum Higgs branches\n$A_{\\operatorname{Higgs}}$ of $3d, \\mathcal{N}=4$ gauge theories, that is, the\nquantum Hamiltonian reductions of Weyl algebras. In theories which are good, we\ndefine a twisted trace that arises naturally from the correlation functions of\nthe gauge theory. We show that this trace induces an inner product and a short\nstar product on $A_{\\operatorname{Higgs}}$.\n  We analyze this trace in the case of an abelian gauge group and show that it\nhas a natural expansion in terms of the twisted traces of Verma modules,\nconfirming a conjecture of the first author and Okazaki. This expansion has a\nnatural interpretation in terms of 3-d mirror symmetry, and we predict that it\ncan be interpreted as an Atiyah-Bott fixed-point formula under the quantum\nHikita isomorphism.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:26:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gaiotto","Davide",""],["Hilburn","Justin",""],["Redondo-Yuste","Jaime",""],["Webster","Ben",""],["Zhou","Zheng",""]]}
{"id":"2308.15199","submitter":"Israel Jacobovich","authors":"Israel Jacobovich and Erel Segal-Halevi","title":"Efficient Almost-Egalitarian Allocation of Goods and Bads","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the allocation of indivisible objects among agents with different\nvaluations, which can be positive or negative. An egalitarian allocation is an\nallocation that maximizes the smallest value given to an agent; finding such an\nallocation is NP-hard. We present a simple polynomial-time algorithm that finds\nan allocation that is Pareto-efficient and almost-egalitarian: each agent's\nvalue is at least his value in an egalitarian allocation, minus the absolute\nvalue of a single object. The main tool is an algorithm for rounding a\nfractional allocation to a discrete allocation, by which each agent loses at\nmost one good or gains at most one chore. Our algorithm generalizes and\nsimplifies three previous algorithms. We discuss several aspects and\nobservations about the algorithm and the problem at hand that open doors for\nefficient and robust implementations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:33:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jacobovich","Israel",""],["Segal-Halevi","Erel",""]]}
{"id":"2308.15200","submitter":"Katia Camacho Mata","authors":"Katia Camacho Mata and Gabriel G. Plunk","title":"Helicity of the magnetic axes of quasi-isodynamic stellarators","comments":"26 pages, 21 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this study, we explore the influence of the helicity of the magnetic\naxis-defined as the self-linking number of the curve-on the quality of\nquasi-isodynamic stellarator-symmetric configurations constructed using the\nnear-axis expansion method (Camacho Mata et al. 2022; Plunk et al. 2019). A\nclass of magnetic axes previously unexplored within this formalism is\nidentified when analyzing the axis shape of the QIPC configuration (Subbotin et\nal. 2006): the case of half-helicity (per field period). We show these shapes\nare compatible with the near-axis formalism and how they can be used to\nconstruct near-axis stellarators with up-to 5 field-periods, $\\epsilon_{eff}\n\\approx$ 1.3%, and similar rotational transform as existing conventionally\noptimized designs, without the need of a plasma boundary optimization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:39:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mata","Katia Camacho",""],["Plunk","Gabriel G.",""]]}
{"id":"2308.15201","submitter":"L\\'aszl\\'o Stach\\'o","authors":"L.L. Stach\\'o","title":"On Hermitian interpolation of first order data with locally generated\n  C1-splines over triangular meshes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a system of triangles in the plane $\\mathbb{R}^2$ along with given data\nof function and gradient values at the vertices, we describe the general\npattern of local linear methods invoving only four smooth standard shape\nfunctions which results in a spline function fitting the given value and\ngradient data value with ${\\cal C}^1$-coupling along the edges of the\ntriangles. We characterize their invariance properties with relavance for the\nconstruction of interpolation surfaces over triangularizations of scanned 3D\ndata. %The described procedures are local linear and affine invariant. The\nnumerically simplest procedures among them leaving invarant all polynomials of\n2-variables with degree 0 resp 1 involve only polynomials of 5-th resp. 6-th\ndegree, but the characteizations give rise to a huge variety of procedures with\nnon-polynomial shape functions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:39:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Stach\u00f3","L. L.",""]]}
{"id":"2308.15202","submitter":"Marco Guerini","authors":"Daniel Russo, Serra Sinem Tekiroglu, Marco Guerini","title":"Benchmarking the Generation of Fact Checking Explanations","comments":"Accepted to TACL. This arXiv version is a pre-MIT Press publication\n  version","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Fighting misinformation is a challenging, yet crucial, task. Despite the\ngrowing number of experts being involved in manual fact-checking, this activity\nis time-consuming and cannot keep up with the ever-increasing amount of Fake\nNews produced daily. Hence, automating this process is necessary to help curb\nmisinformation. Thus far, researchers have mainly focused on claim veracity\nclassification. In this paper, instead, we address the generation of\njustifications (textual explanation of why a claim is classified as either true\nor false) and benchmark it with novel datasets and advanced baselines. In\nparticular, we focus on summarization approaches over unstructured knowledge\n(i.e. news articles) and we experiment with several extractive and abstractive\nstrategies. We employed two datasets with different styles and structures, in\norder to assess the generalizability of our findings. Results show that in\njustification production summarization benefits from the claim information,\nand, in particular, that a claim-driven extractive step improves abstractive\nsummarization performances. Finally, we show that although cross-dataset\nexperiments suffer from performance degradation, a unique model trained on a\ncombination of the two datasets is able to retain style information in an\nefficient manner.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:40:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Russo","Daniel",""],["Tekiroglu","Serra Sinem",""],["Guerini","Marco",""]]}
{"id":"2308.15203","submitter":"Cheng-Hung Hu","authors":"Cheng-Hung Hu, Yusuke Yasuda, Tomoki Toda","title":"Preference-based training framework for automatic speech quality\n  assessment using deep neural network","comments":"Accepted by Interspeech 2023, oral","journal-ref":null,"doi":"10.21437/Interspeech.2023-589","report-no":null,"categories":"eess.AS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One objective of Speech Quality Assessment (SQA) is to estimate the ranks of\nsynthetic speech systems. However, recent SQA models are typically trained\nusing low-precision direct scores such as mean opinion scores (MOS) as the\ntraining objective, which is not straightforward to estimate ranking. Although\nit is effective for predicting quality scores of individual sentences, this\napproach does not account for speech and system preferences when ranking\nmultiple systems. We propose a training framework of SQA models that can be\ntrained with only preference scores derived from pairs of MOS to improve\nranking prediction. Our experiment reveals conditions where our framework works\nthe best in terms of pair generation, aggregation functions to derive system\nscore from utterance preferences, and threshold functions to determine\npreference from a pair of MOS. Our results demonstrate that our proposed method\nsignificantly outperforms the baseline model in Spearman's Rank Correlation\nCoefficient.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:40:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hu","Cheng-Hung",""],["Yasuda","Yusuke",""],["Toda","Tomoki",""]]}
{"id":"2308.15204","submitter":"Merlin Andreia","authors":"Merlin Andreia, Christian Meyer","title":"On a Lack of Stability of Parametrized BV Solutions to Rate-Independent\n  Systems with Non-Convex Energies and Discontinuous Loads","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a rate-independent system with nonconvex energy under\ndiscontinuous external loading. The underlying space is finite dimensional and\nthe loads are functions in $BV([0,T];\\mathbb{R}^d)$. We investigate the\nstability of various solution concepts w.r.t. a sequence of loads converging\nweakly$*$ in $BV([0,T];\\mathbb{R}^d)$ with a particular emphasis on the\nso-called normalized, $\\mathfrak{p}$-parametrized balanced viscosity solutions.\nBy means of two counterexamples, it is shown that common solution concepts are\nnot stable w.r.t. weak$*$ convergence of loads in the sense that a limit of a\nsequence of solutions associated with these loads need not be a solution\ncorresponding to the load in the limit. We moreover introduce a new solution\nconcept, which is stable in this sense, but our examples show that this concept\nnecessarily allows \"solutions\" that are physically meaningless.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:41:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Andreia","Merlin",""],["Meyer","Christian",""]]}
{"id":"2308.15205","submitter":"Kostya Trachenko","authors":"K. Trachenko","title":"Theory of liquids: from excitations to thermodynamics","comments":"35 pages, 3 figures. Preface, Introduction and experimental section","journal-ref":"Cambridge University Press (2023)","doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.dis-nn cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Of the three basic states of matter, liquid is perhaps the most complex.\nWhile its flow properties are described by fluid mechanics, its thermodynamic\nproperties are often neglected, and for many years it was widely believed that\na general theory of liquid thermodynamics was unattainable. In recent decades\nthat view has been challenged, as new advances have finally enabled us to\nunderstand and describe the thermodynamic properties of liquids. This book\nexplains the recent developments in theory, experiment and modelling that have\nenabled us to understand the behaviour of excitations in liquids and the impact\nof this behaviour on heat capacity and other basic properties. Presented in\nplain language with a focus on real liquids and their experimental properties,\nthis book is a useful reference text for researchers and graduate students in\ncondensed matter physics and chemistry, as well as for advanced courses\ncovering the theory of liquids.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:44:16 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Trachenko","K.",""]]}
{"id":"2308.15206","submitter":"Hongxun Yang","authors":"BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, R.\n  Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I. Balossino, Y.\n  Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M. Bertani, D.\n  Bettoni, F. Bianchi, E. Bianco, J. Bloms, A. Bortone, I. Boyko, R. A. Briere,\n  A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S. A.\n  Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C. Chen,\n  Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T. Chen,\n  X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S. Cheng, S.\n  K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H. L. Dai,\n  J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A. Denig, I.\n  Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding, Y. Ding,\n  J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, S. X. Du, Z. H. Duan, P. Egorov, Y.\n  L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y. Fang, R. Farinelli, L. Fava, F.\n  Feldbauer, G. Felici, C. Q. Feng, J. H. Feng, K Fischer, M. Fritsch, C.\n  Fritzsch, C. D. Fu, Y. W. Fu, H. Gao, Y. N. Gao, Yang Gao, S. Garbolino, I.\n  Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M. Gersabeck, A Gilman, K. Goetzen,\n  L. Gong, W. X. Gong, W. Gradl, S. Gramigna, M. Greco, M. H. Gu, Y. T. Gu, C.\n  Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, R. P. Guo, Y. P. Guo, A. Guskov, X.\n  T. H., W. Y. Han, X. Q. Hao, F. A. Harris, K. K. He, K. L. He, F. H.\n  Heinsius, C. H. Heinz, Y. K. Heng, C. Herold, T. Holtmann, P. C. Hong, G. Y.\n  Hou, Y. R. Hou, Z. L. Hou, H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K.\n  X. Huang, L. Q. Huang, X. T. Huang, Y. P. Huang, T. Hussain, N H\\\"usken, W.\n  Imoehl, M. Irshad, J. Jackson, S. Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q.\n  P. Ji, X. B. Ji, X. L. Ji, Y. Y. Ji, Z. K. Jia, P. C. Jiang, S. S. Jiang, T.\n  J. Jiang, X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q.\n  Jing, T. Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X.\n  S. Kang, R. Kappert, M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R.\n  Kliemt, L. Koch, O. B. Kolcu, B. Kopf, M. Kuessner, A. Kupsc, W. K\\\"uhn, J.\n  J. Lane, J. S. Lange, P. Larin, A. Lavania, L. Lavezzi, T. T. Lei, Z. H. Lei,\n  H. Leithoff, M. Lellmann, T. Lenz, C. Li, C. Li, C. H. Li, Cheng Li, D. M.\n  Li, F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H. N. Li, Hui Li, J. R. Li, J.\n  S. Li, J. W. Li, Ke Li, L. J Li, L. K. Li, Lei Li, M. H. Li, P. R. Li, S. X.\n  Li, T. Li, W. D. Li, W. G. Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J.\n  Li, Z. X. Li, Z. Y. Li, C. Liang, H. Liang, H. Liang, H. Liang, Y. F. Liang,\n  Y. T. Liang, G. R. Liao, L. Z. Liao, J. Libby, A. Limphirat, D. X. Lin, T.\n  Lin, B. J. Liu, B. X. Liu, C. Liu, C. X. Liu, D. Liu, F. H. Liu, Fang Liu,\n  Feng Liu, G. M. Liu, H. Liu, H. B. Liu, H. M. Liu, Huanhuan Liu, Huihui Liu,\n  J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu, Ke Liu, L. Liu, L. C.\n  Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu, T. Liu, W. K. Liu, W.\n  M. Liu, X. Liu, Y. Liu, Y. B. Liu, Z. A. Liu, Z. Q. Liu, X. C. Lou, F. X. Lu,\n  H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P. Lu, Z. H. Lu, C. L. Luo, M. X.\n  Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu, F. C. Ma, H. L. Ma, J. L. Ma,\n  L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T. Ma, X. Y. Ma, Y. Ma, F. E.\n  Maas, M. Maggiora, S. Maldaner, S. Malde, A. Mangoni, Y. J. Mao, Z. P. Mao,\n  S. Marcello, Z. X. Meng, J. G. Messchendorp, G. Mezzadri, H. Miao, T. J. Min,\n  R. E. Mitchell, X. H. Mo, N. Yu. Muchnoi, Y. Nefedov, F. Nerling, I. B.\n  Nikolaev, Z. Ning, S. Nisar, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X.\n  Pan, Y. Pan, A. Pathak, P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, K.\n  Peters, J. L. Ping, R. G. Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H.\n  Qi, H. R. Qi, M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L.\n  Q. Qin, X. P. Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer,\n  K. J. Ren, A. Rivetti, V. Rodin, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N.\n  Salone, A. Sarantsev, Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan,\n  W. Shan, X. Y. Shan, J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F.\n  Shen, W. H. Shen, X. Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q.\n  Q. Shi, R. S. Shi, X. Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y.\n  X. Song, S. Sosio, S. Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H.\n  Sun, H. K. Sun, J. F. Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y.\n  Sun, Y. J. Sun, Y. Z. Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J.\n  Tang, Y. A. Tang, L. Y Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H.\n  Tian, W. H. Tian, Y. Tian, Z. F. Tian, I. Uman, B. Wang, B. L. Wang, Bo Wang,\n  C. W. Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, K. Wang, L. L. Wang,\n  M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, W. Wang,\n  W. H. Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, Y. Wang,\n  Y. D. Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi\n  Wang, Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, Zongyuan Wang, D. Wei, D.\n  H. Wei, F. Weidner, S. P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M.\n  Wolke, L. Wollenberg, C. Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu,\n  Y. Wu, Y. J Wu, Z. Wu, L. Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, H.\n  Xiao, S. Y. Xiao, Y. L. Xiao, Z. J. Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G.\n  Xie, Y. H. Xie, Z. P. Xie, T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y.\n  Xu, Q. J. Xu, W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, F. Yan, L. Yan, W. B.\n  Yan, W. C. Yan, X. Q Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao Yang, Y.\n  Yang, Y. F. Yang, Y. X. Yang, Yifan Yang, Z. W. Yang, M. Ye, M. H. Ye, J. H.\n  Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, T. Yu, X. D. Yu, C. Z. Yuan, L.\n  Yuan, S. C. Yuan, X. Q. Yuan, Y. Yuan, Z. Y. Yuan, C. X. Yue, A. A. Zafar, F.\n  R. Zeng, X. Zeng, Y. Zeng, Y. J. Zeng, X. Y. Zhai, Y. H. Zhan, A. Q. Zhang,\n  B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y. Zhang, H. Zhang, H. H. Zhang, H.\n  H. Zhang, H. Q. Zhang, H. Y. Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J.\n  W. Zhang, J. X. Zhang, J. Y. Zhang, J. Z. Zhang, Jianyu Zhang, Jiawei Zhang,\n  L. M. Zhang, L. Q. Zhang, Lei Zhang, P. Zhang, Q. Y. Zhang, Shuihan Zhang,\n  Shulei Zhang, X. D. Zhang, X. M. Zhang, X. Y. Zhang, X. Y. Zhang, Y. Zhang,\n  Y. T. Zhang, Y. H. Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z.\n  Y. Zhang, Z. Y. Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao,\n  Ling Zhao, M. G. Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A.\n  Zhemchugov, B. Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X.\n  Zhong, H. Zhou, L. P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y.\n  Z. Zhou, J. Zhu, K. Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu,\n  T. J. Zhu, W. J. Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Study of excited $\\Xi$ states in\n  $\\psi(3686)\\rightarrow{}K^{-}\\Lambda\\overline{\\Xi}^{+}+c.c.$","comments":"12 paes, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Based on a sample of $(448.1\\pm2.9)\\times10^{6}$ $\\psi(3686)$ events\ncollected with the BESIII detector at BEPCII, the decays of\n$\\psi(3686)\\to{}K^{-}\\Lambda\\overline{\\Xi}^{+} + c.c.$ with $\\overline{\\Xi}^+\n\\to \\overline{\\Lambda} \\pi^+$, $\\overline{\\Lambda}\\to \\overline{p} \\pi^+$ are\nstudied.Two excited hyperons, $\\Xi(1690)^-$ and $\\Xi(1820)^-$, are observed\nwith large significance ($ \\gg 10 \\sigma$) in the $K^{-}\\Lambda$ invariant mass\ndistributions. A partial wave analysis is performed, and the spin-parities of\n$\\Xi(1690)^-$ and $\\Xi(1820)^-$ are determined to be $\\frac{1}{2}^{-}$ and\n$\\frac{3}{2}^{-}$, respectively. The masses, widths, and product branching\nfractions of $\\Xi(1690)^-$ and $\\Xi(1820)^-$ are also measured.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:48:11 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 05:55:18 GMT"}],"update_date":"2023-08-31","authors_parsed":[["BESIII Collaboration","",""],["Ablikim","M.",""],["Achasov","M. N.",""],["Adlarson","P.",""],["Aliberti","R.",""],["Amoroso","A.",""],["An","M. R.",""],["An","Q.",""],["Bai","Y.",""],["Bakina","O.",""],["Balossino","I.",""],["Ban","Y.",""],["Batozskaya","V.",""],["Begzsuren","K.",""],["Berger","N.",""],["Berlowski","M.",""],["Bertani","M.",""],["Bettoni","D.",""],["Bianchi","F.",""],["Bianco","E.",""],["Bloms","J.",""],["Bortone","A.",""],["Boyko","I.",""],["Briere","R. A.",""],["Brueggemann","A.",""],["Cai","H.",""],["Cai","X.",""],["Calcaterra","A.",""],["Cao","G. F.",""],["Cao","N.",""],["Cetin","S. A.",""],["Chang","J. F.",""],["Chang","T. T.",""],["Chang","W. L.",""],["Che","G. R.",""],["Chelkov","G.",""],["Chen","C.",""],["Chen","Chao",""],["Chen","G.",""],["Chen","H. S.",""],["Chen","M. L.",""],["Chen","S. J.",""],["Chen","S. M.",""],["Chen","T.",""],["Chen","X. R.",""],["Chen","X. T.",""],["Chen","Y. B.",""],["Chen","Y. Q.",""],["Chen","Z. J.",""],["Cheng","W. S.",""],["Choi","S. K.",""],["Chu","X.",""],["Cibinetto","G.",""],["Coen","S. C.",""],["Cossio","F.",""],["Cui","J. J.",""],["Dai","H. L.",""],["Dai","J. P.",""],["Dbeyssi","A.",""],["de Boer","R. E.",""],["Dedovich","D.",""],["Deng","Z. Y.",""],["Denig","A.",""],["Denysenko","I.",""],["Destefanis","M.",""],["De Mori","F.",""],["Ding","B.",""],["Ding","X. X.",""],["Ding","Y.",""],["Ding","Y.",""],["Dong","J.",""],["Dong","L. Y.",""],["Dong","M. Y.",""],["Dong","X.",""],["Du","S. X.",""],["Duan","Z. H.",""],["Egorov","P.",""],["Fan","Y. L.",""],["Fang","J.",""],["Fang","S. S.",""],["Fang","W. X.",""],["Fang","Y.",""],["Farinelli","R.",""],["Fava","L.",""],["Feldbauer","F.",""],["Felici","G.",""],["Feng","C. Q.",""],["Feng","J. H.",""],["Fischer","K",""],["Fritsch","M.",""],["Fritzsch","C.",""],["Fu","C. D.",""],["Fu","Y. W.",""],["Gao","H.",""],["Gao","Y. N.",""],["Gao","Yang",""],["Garbolino","S.",""],["Garzia","I.",""],["Ge","P. T.",""],["Ge","Z. W.",""],["Geng","C.",""],["Gersabeck","E. M.",""],["Gilman","A",""],["Goetzen","K.",""],["Gong","L.",""],["Gong","W. X.",""],["Gradl","W.",""],["Gramigna","S.",""],["Greco","M.",""],["Gu","M. H.",""],["Gu","Y. T.",""],["Guan","C. Y",""],["Guan","Z. L.",""],["Guo","A. Q.",""],["Guo","L. B.",""],["Guo","R. P.",""],["Guo","Y. P.",""],["Guskov","A.",""],["H.","X. T.",""],["Han","W. Y.",""],["Hao","X. Q.",""],["Harris","F. A.",""],["He","K. K.",""],["He","K. L.",""],["Heinsius","F. H.",""],["Heinz","C. H.",""],["Heng","Y. K.",""],["Herold","C.",""],["Holtmann","T.",""],["Hong","P. C.",""],["Hou","G. Y.",""],["Hou","Y. R.",""],["Hou","Z. L.",""],["Hu","H. M.",""],["Hu","J. F.",""],["Hu","T.",""],["Hu","Y.",""],["Huang","G. S.",""],["Huang","K. X.",""],["Huang","L. Q.",""],["Huang","X. T.",""],["Huang","Y. P.",""],["Hussain","T.",""],["H\u00fcsken","N",""],["Imoehl","W.",""],["Irshad","M.",""],["Jackson","J.",""],["Jaeger","S.",""],["Janchiv","S.",""],["Jeong","J. H.",""],["Ji","Q.",""],["Ji","Q. P.",""],["Ji","X. B.",""],["Ji","X. L.",""],["Ji","Y. Y.",""],["Jia","Z. K.",""],["Jiang","P. C.",""],["Jiang","S. S.",""],["Jiang","T. J.",""],["Jiang","X. S.",""],["Jiang","Y.",""],["Jiao","J. B.",""],["Jiao","Z.",""],["Jin","S.",""],["Jin","Y.",""],["Jing","M. Q.",""],["Johansson","T.",""],["K.","X.",""],["Kabana","S.",""],["Kalantar-Nayestanaki","N.",""],["Kang","X. L.",""],["Kang","X. S.",""],["Kappert","R.",""],["Kavatsyuk","M.",""],["Ke","B. C.",""],["Khoukaz","A.",""],["Kiuchi","R.",""],["Kliemt","R.",""],["Koch","L.",""],["Kolcu","O. B.",""],["Kopf","B.",""],["Kuessner","M.",""],["Kupsc","A.",""],["K\u00fchn","W.",""],["Lane","J. J.",""],["Lange","J. S.",""],["Larin","P.",""],["Lavania","A.",""],["Lavezzi","L.",""],["Lei","T. T.",""],["Lei","Z. H.",""],["Leithoff","H.",""],["Lellmann","M.",""],["Lenz","T.",""],["Li","C.",""],["Li","C.",""],["Li","C. H.",""],["Li","Cheng",""],["Li","D. M.",""],["Li","F.",""],["Li","G.",""],["Li","H.",""],["Li","H. B.",""],["Li","H. J.",""],["Li","H. N.",""],["Li","Hui",""],["Li","J. R.",""],["Li","J. S.",""],["Li","J. W.",""],["Li","Ke",""],["Li","L. J",""],["Li","L. K.",""],["Li","Lei",""],["Li","M. H.",""],["Li","P. R.",""],["Li","S. X.",""],["Li","T.",""],["Li","W. D.",""],["Li","W. G.",""],["Li","X. H.",""],["Li","X. L.",""],["Li","Xiaoyu",""],["Li","Y. G.",""],["Li","Z. J.",""],["Li","Z. X.",""],["Li","Z. Y.",""],["Liang","C.",""],["Liang","H.",""],["Liang","H.",""],["Liang","H.",""],["Liang","Y. F.",""],["Liang","Y. T.",""],["Liao","G. R.",""],["Liao","L. Z.",""],["Libby","J.",""],["Limphirat","A.",""],["Lin","D. X.",""],["Lin","T.",""],["Liu","B. J.",""],["Liu","B. X.",""],["Liu","C.",""],["Liu","C. X.",""],["Liu","D.",""],["Liu","F. H.",""],["Liu","Fang",""],["Liu","Feng",""],["Liu","G. M.",""],["Liu","H.",""],["Liu","H. B.",""],["Liu","H. M.",""],["Liu","Huanhuan",""],["Liu","Huihui",""],["Liu","J. B.",""],["Liu","J. L.",""],["Liu","J. Y.",""],["Liu","K.",""],["Liu","K. Y.",""],["Liu","Ke",""],["Liu","L.",""],["Liu","L. C.",""],["Liu","Lu",""],["Liu","M. H.",""],["Liu","P. L.",""],["Liu","Q.",""],["Liu","S. B.",""],["Liu","T.",""],["Liu","W. K.",""],["Liu","W. M.",""],["Liu","X.",""],["Liu","Y.",""],["Liu","Y. B.",""],["Liu","Z. A.",""],["Liu","Z. Q.",""],["Lou","X. C.",""],["Lu","F. X.",""],["Lu","H. J.",""],["Lu","J. G.",""],["Lu","X. L.",""],["Lu","Y.",""],["Lu","Y. P.",""],["Lu","Z. H.",""],["Luo","C. L.",""],["Luo","M. X.",""],["Luo","T.",""],["Luo","X. L.",""],["Lyu","X. R.",""],["Lyu","Y. F.",""],["Ma","F. C.",""],["Ma","H. L.",""],["Ma","J. L.",""],["Ma","L. L.",""],["Ma","M. M.",""],["Ma","Q. M.",""],["Ma","R. Q.",""],["Ma","R. T.",""],["Ma","X. Y.",""],["Ma","Y.",""],["Maas","F. E.",""],["Maggiora","M.",""],["Maldaner","S.",""],["Malde","S.",""],["Mangoni","A.",""],["Mao","Y. J.",""],["Mao","Z. P.",""],["Marcello","S.",""],["Meng","Z. X.",""],["Messchendorp","J. G.",""],["Mezzadri","G.",""],["Miao","H.",""],["Min","T. J.",""],["Mitchell","R. E.",""],["Mo","X. H.",""],["Muchnoi","N. Yu.",""],["Nefedov","Y.",""],["Nerling","F.",""],["Nikolaev","I. B.",""],["Ning","Z.",""],["Nisar","S.",""],["Niu","Y.",""],["Olsen","S. L.",""],["Ouyang","Q.",""],["Pacetti","S.",""],["Pan","X.",""],["Pan","Y.",""],["Pathak","A.",""],["Patteri","P.",""],["Pei","Y. P.",""],["Pelizaeus","M.",""],["Peng","H. P.",""],["Peters","K.",""],["Ping","J. L.",""],["Ping","R. G.",""],["Plura","S.",""],["Pogodin","S.",""],["Prasad","V.",""],["Qi","F. Z.",""],["Qi","H.",""],["Qi","H. R.",""],["Qi","M.",""],["Qi","T. Y.",""],["Qian","S.",""],["Qian","W. B.",""],["Qiao","C. F.",""],["Qin","J. J.",""],["Qin","L. Q.",""],["Qin","X. P.",""],["Qin","X. S.",""],["Qin","Z. H.",""],["Qiu","J. F.",""],["Qu","S. Q.",""],["Redmer","C. F.",""],["Ren","K. J.",""],["Rivetti","A.",""],["Rodin","V.",""],["Rolo","M.",""],["Rong","G.",""],["Rosner","Ch.",""],["Ruan","S. N.",""],["Salone","N.",""],["Sarantsev","A.",""],["Schelhaas","Y.",""],["Schoenning","K.",""],["Scodeggio","M.",""],["Shan","K. Y.",""],["Shan","W.",""],["Shan","X. Y.",""],["Shangguan","J. F.",""],["Shao","L. G.",""],["Shao","M.",""],["Shen","C. P.",""],["Shen","H. F.",""],["Shen","W. H.",""],["Shen","X. Y.",""],["Shi","B. A.",""],["Shi","H. C.",""],["Shi","J. L.",""],["Shi","J. Y.",""],["Shi","Q. Q.",""],["Shi","R. S.",""],["Shi","X.",""],["Song","J. J.",""],["Song","T. Z.",""],["Song","W. M.",""],["Song","Y. J.",""],["Song","Y. X.",""],["Sosio","S.",""],["Spataro","S.",""],["Stieler","F.",""],["Su","Y. J.",""],["Sun","G. B.",""],["Sun","G. X.",""],["Sun","H.",""],["Sun","H. K.",""],["Sun","J. F.",""],["Sun","K.",""],["Sun","L.",""],["Sun","S. S.",""],["Sun","T.",""],["Sun","W. Y.",""],["Sun","Y.",""],["Sun","Y. J.",""],["Sun","Y. Z.",""],["Sun","Z. T.",""],["Tan","Y. X.",""],["Tang","C. J.",""],["Tang","G. Y.",""],["Tang","J.",""],["Tang","Y. A.",""],["Tao","L. Y",""],["Tao","Q. T.",""],["Tat","M.",""],["Teng","J. X.",""],["Thoren","V.",""],["Tian","W. H.",""],["Tian","W. H.",""],["Tian","Y.",""],["Tian","Z. F.",""],["Uman","I.",""],["Wang","B.",""],["Wang","B. L.",""],["Wang","Bo",""],["Wang","C. W.",""],["Wang","D. Y.",""],["Wang","F.",""],["Wang","H. J.",""],["Wang","H. P.",""],["Wang","K.",""],["Wang","L. L.",""],["Wang","M.",""],["Wang","Meng",""],["Wang","S.",""],["Wang","S.",""],["Wang","T.",""],["Wang","T. J.",""],["Wang","W.",""],["Wang","W.",""],["Wang","W. H.",""],["Wang","W. P.",""],["Wang","X.",""],["Wang","X. F.",""],["Wang","X. J.",""],["Wang","X. L.",""],["Wang","Y.",""],["Wang","Y. D.",""],["Wang","Y. F.",""],["Wang","Y. H.",""],["Wang","Y. N.",""],["Wang","Y. Q.",""],["Wang","Yaqian",""],["Wang","Yi",""],["Wang","Z.",""],["Wang","Z. L.",""],["Wang","Z. Y.",""],["Wang","Ziyi",""],["Wang","Zongyuan",""],["Wei","D.",""],["Wei","D. H.",""],["Weidner","F.",""],["Wen","S. P.",""],["Wenzel","C. W.",""],["Wiedner","U.",""],["Wilkinson","G.",""],["Wolke","M.",""],["Wollenberg","L.",""],["Wu","C.",""],["Wu","J. F.",""],["Wu","L. H.",""],["Wu","L. J.",""],["Wu","X.",""],["Wu","X. H.",""],["Wu","Y.",""],["Wu","Y. J",""],["Wu","Z.",""],["Xia","L.",""],["Xian","X. M.",""],["Xiang","T.",""],["Xiao","D.",""],["Xiao","G. Y.",""],["Xiao","H.",""],["Xiao","S. Y.",""],["Xiao","Y. L.",""],["Xiao","Z. J.",""],["Xie","C.",""],["Xie","X. H.",""],["Xie","Y.",""],["Xie","Y. G.",""],["Xie","Y. H.",""],["Xie","Z. P.",""],["Xing","T. Y.",""],["Xu","C. F.",""],["Xu","C. J.",""],["Xu","G. F.",""],["Xu","H. Y.",""],["Xu","Q. J.",""],["Xu","W. L.",""],["Xu","X. P.",""],["Xu","Y. C.",""],["Xu","Z. P.",""],["Yan","F.",""],["Yan","L.",""],["Yan","W. B.",""],["Yan","W. C.",""],["Yan","X. Q",""],["Yang","H. J.",""],["Yang","H. L.",""],["Yang","H. X.",""],["Yang","Tao",""],["Yang","Y.",""],["Yang","Y. F.",""],["Yang","Y. X.",""],["Yang","Yifan",""],["Yang","Z. W.",""],["Ye","M.",""],["Ye","M. H.",""],["Yin","J. H.",""],["You","Z. Y.",""],["Yu","B. X.",""],["Yu","C. X.",""],["Yu","G.",""],["Yu","T.",""],["Yu","X. D.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Yuan","S. C.",""],["Yuan","X. Q.",""],["Yuan","Y.",""],["Yuan","Z. Y.",""],["Yue","C. X.",""],["Zafar","A. A.",""],["Zeng","F. R.",""],["Zeng","X.",""],["Zeng","Y.",""],["Zeng","Y. J.",""],["Zhai","X. Y.",""],["Zhan","Y. H.",""],["Zhang","A. Q.",""],["Zhang","B. L.",""],["Zhang","B. X.",""],["Zhang","D. H.",""],["Zhang","G. Y.",""],["Zhang","H.",""],["Zhang","H. H.",""],["Zhang","H. H.",""],["Zhang","H. Q.",""],["Zhang","H. Y.",""],["Zhang","J. J.",""],["Zhang","J. L.",""],["Zhang","J. Q.",""],["Zhang","J. W.",""],["Zhang","J. X.",""],["Zhang","J. Y.",""],["Zhang","J. Z.",""],["Zhang","Jianyu",""],["Zhang","Jiawei",""],["Zhang","L. M.",""],["Zhang","L. Q.",""],["Zhang","Lei",""],["Zhang","P.",""],["Zhang","Q. Y.",""],["Zhang","Shuihan",""],["Zhang","Shulei",""],["Zhang","X. D.",""],["Zhang","X. M.",""],["Zhang","X. Y.",""],["Zhang","X. Y.",""],["Zhang","Y.",""],["Zhang","Y. T.",""],["Zhang","Y. H.",""],["Zhang","Yan",""],["Zhang","Yao",""],["Zhang","Z. H.",""],["Zhang","Z. L.",""],["Zhang","Z. Y.",""],["Zhang","Z. Y.",""],["Zhao","G.",""],["Zhao","J.",""],["Zhao","J. Y.",""],["Zhao","J. Z.",""],["Zhao","Lei",""],["Zhao","Ling",""],["Zhao","M. G.",""],["Zhao","S. J.",""],["Zhao","Y. B.",""],["Zhao","Y. X.",""],["Zhao","Z. G.",""],["Zhemchugov","A.",""],["Zheng","B.",""],["Zheng","J. P.",""],["Zheng","W. J.",""],["Zheng","Y. H.",""],["Zhong","B.",""],["Zhong","X.",""],["Zhou","H.",""],["Zhou","L. P.",""],["Zhou","X.",""],["Zhou","X. K.",""],["Zhou","X. R.",""],["Zhou","X. Y.",""],["Zhou","Y. Z.",""],["Zhu","J.",""],["Zhu","K.",""],["Zhu","K. J.",""],["Zhu","L.",""],["Zhu","L. X.",""],["Zhu","S. H.",""],["Zhu","S. Q.",""],["Zhu","T. J.",""],["Zhu","W. J.",""],["Zhu","Y. C.",""],["Zhu","Z. A.",""],["Zou","J. H.",""],["Zu","J.",""]]}
{"id":"2308.15207","submitter":"Nikolaos Dimakis","authors":"A. Paliathanasis, N. Dimakis and T. Christodoulakis","title":"Minisuperspace description of $f(Q)$-cosmology","comments":"25 pages, no figures, Latex2e source file","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the existence of minisuperspace description for the\nhomogeneous cosmological field equations within the framework of symmetric\nteleparallel $f(Q)$-gravity. We consider the background space to be described\nby the isotropic Friedmann-Lema\\^{\\i}tre-Robertson-Walker geometry, the\nanisotropic Kantowski-Sachs and the anisotropic Bianchi III geometries. Across\nall these models, we establish that the field equations in $f(Q)$-gravity\nexhibit second-order characteristics in the coincidence gauge and sixth-order\ncharacteristics in the non-coincidence gauge. Specifically, within the latter\nscenario, the dynamic degrees of freedom are attributed to two scalar fields.\nFinally, as an example of integrability, we derive a vacuum cosmological\nsolution within the non-coincidence gauge.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:54:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Paliathanasis","A.",""],["Dimakis","N.",""],["Christodoulakis","T.",""]]}
{"id":"2308.15208","submitter":"Xin Liu","authors":"X.Liu, Z. Quan, Y.W.Dong, M.Xu, J.J.Wang, R.J.Wang, Z.G.Wang, X.Z.Cui,\n  T.W.Bao, C.L. Liao, J.F.Han, Y.Chen","title":"Optimization of WLS fiber readout for the HERD calorimeter","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.IM physics.ins-det","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A novel 3-D calorimeter, composed of about 7500 LYSO cubes, is the key and\ncrucial detector of the High Energy cosmic-Radiation Detection (HERD) facility\nto be installed onboard the China Space Station. Energy deposition from cosmic\nray in each LYSO cube is translated by multiple wavelength shifting (WLS)\nfibers for multi-range data acquisition and real-time triggering.\n  In this study, various methods of surface finish and encapsulation of the\nLYSO cube were investigated to optimize the amplitude from the WLS fiber end\nwith the aim of improving the signal-to-noise ratio of Intensified scientific\nCMOS (IsCMOS) collection. The LYSO cube with five rough surfaces and a specular\nreflector achieves the maximum amplitude at the low-range fiber end, which is\nincreased by roughly 44% compared to the polished cube with PTFE wrapping.\n  The non-uniformity of amplitude at different positions on the LYSO cube\nsurface was measured by X-ray and the positional correlation factor was derived\nfor the entire cube. A simulation based on HERD CALO was conducted, which\nrevealed that both the LYSO cube with five rough surfaces and the cube with\nrough bottom face exhibit superior energy resolution for electrons compared to\nthe other two configurations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:55:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","X.",""],["Quan","Z.",""],["Dong","Y. W.",""],["Xu","M.",""],["Wang","J. J.",""],["Wang","R. J.",""],["Wang","Z. G.",""],["Cui","X. Z.",""],["Bao","T. W.",""],["Liao","C. L.",""],["Han","J. F.",""],["Chen","Y.",""]]}
{"id":"2308.15209","submitter":"Shuly Wintner","authors":"Shuly Wintner and Safaa Shehadi and Yuli Zeira and Doreen Osmelak and\n  Yuval Nov","title":"Shared Lexical Items as Triggers of Code Switching","comments":"This is the author's final version; the article has been accepted for\n  publication in the Transactions of the Association for Computational\n  Linguistics (TACL)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  Why do bilingual speakers code-switch (mix their two languages)? Among the\nseveral theories that attempt to explain this natural and ubiquitous\nphenomenon, the Triggering Hypothesis relates code-switching to the presence of\nlexical triggers, specifically cognates and proper names, adjacent to the\nswitch point. We provide a fuller, more nuanced and refined exploration of the\ntriggering hypothesis, based on five large datasets in three language pairs,\nreflecting both spoken and written bilingual interactions. Our results show\nthat words that are assumed to reside in a mental lexicon shared by both\nlanguages indeed trigger code-switching; that the tendency to switch depends on\nthe distance of the trigger from the switch point; and on whether the trigger\nprecedes or succeeds the switch; but not on the etymology of the trigger words.\nWe thus provide strong, robust, evidence-based confirmation to several\nhypotheses on the relationships between lexical triggers and code-switching.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 10:55:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wintner","Shuly",""],["Shehadi","Safaa",""],["Zeira","Yuli",""],["Osmelak","Doreen",""],["Nov","Yuval",""]]}
{"id":"2308.15210","submitter":"Stefan Karlsson","authors":"Stefan Karlsson, John Hughes, Robbert Jongeling, Adnan Causevic,\n  Daniel Sundmark","title":"Exploring API Behaviours Through Generated Examples","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding the behaviour of a system's API can be hard. Giving users\naccess to relevant examples of how an API behaves has been shown to make this\neasier for them. In addition, such examples can be used to verify expected\nbehaviour or identify unwanted behaviours.\n  Methods for automatically generating examples have existed for a long time.\nHowever, state-of-the-art methods rely on either white-box information, such as\nsource code, or on formal specifications of the system behaviour. But what if\nyou do not have access to either? e.g., when interacting with a third-party\nAPI.\n  In this paper, we present an approach to automatically generate relevant\nexamples of behaviours of an API, without requiring either source code or a\nformal specification of behaviour.\n  Evaluation on an industry-grade REST API shows that our method can produce\nsmall and relevant examples that can help engineers to understand the system\nunder exploration.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:05:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Karlsson","Stefan",""],["Hughes","John",""],["Jongeling","Robbert",""],["Causevic","Adnan",""],["Sundmark","Daniel",""]]}
{"id":"2308.15211","submitter":"Songyou Li","authors":"Fangjian Shen, Yicheng Zheng, Songyou Li","title":"A Novel Dual Predictors Framework of PEE","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we propose a improved 2D-PEH based on double prediction-error.\nFirst,different from previous 2D-PEH, the proposed 2D-DPEH is established by\nselecting two distinct predictors with low correlation to calculate double\nprediction errors for each pixel. In addition, we adopt DP to optimize the\nselection of expansion bins, speeding up the running time and improving the\nquality of the embedded image. Finally,we combined the proposed method with\nC-PEE and original MHM, then designed comparative experiments with state\nof-the-art Pee-based methods in recent years to verify the superiority of the\nproposed algorithm and extend PEE into a more general case.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:05:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shen","Fangjian",""],["Zheng","Yicheng",""],["Li","Songyou",""]]}
{"id":"2308.15212","submitter":"Sourabh Lahiri","authors":"Sourabh Lahiri and Shamik Gupta","title":"Can stochastic resetting render a heat engine more efficient?","comments":"12 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We explore the thermodynamics of stochastic heat engines in presence of\nstochastic resetting. The set-up comprises an engine whose working substance is\na Brownian particle undergoing overdamped Langevin dynamics in a harmonic\npotential with a time-dependent stiffness, with the dynamics interrupted at\nrandom times with a resetting to a fixed location. The effect of resetting to\nthe potential minimum is shown to enhance the efficiency of the engine, while\nthe output work is shown to have a non-monotonic dependence on the rate of\nresetting. The resetting events are found to drive the system out of linear\nresponse regime even for small differences in the bath temperatures. Shifting\nthe reset point from the potential minimum is observed to reduce the engine\nefficiency. The experimental set-up for the realization of such an engine is\nbriefly discussed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:06:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lahiri","Sourabh",""],["Gupta","Shamik",""]]}
{"id":"2308.15213","submitter":"Neha Lad","authors":"Neha Lad and D. F. Cowen (for the IceCube Collaboration)","title":"Summary of IceCube Tau Neutrino Searches and Flavor Composition\n  Measurements of the Diffuse Astrophysical Neutrino Flux","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13047 for all IceCube contributions","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1122","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a summary of the flavor composition measurements for the diffuse\nastrophysical neutrino flux using data from the IceCube Neutrino Observatory at\nthe South Pole. IceCube has identified candidate astrophysical tau neutrinos\nthrough two different approaches. One approach used a dedicated particle\nidentification algorithm for the classification and reconstruction of the\n'Double Cascade' event topology, a signature of tau neutrino charged current\ninteractions. This first approach is applied to the High Energy Starting Events\n(HESE) sample, an all-sky, all-flavor set of neutrino events with energy above\n60~TeV encompassing 12 years of IceCube livetime. We show that the addition of\nmore years of data and updated ice properties on the HESE sample delivers\ntighter constraints on the flavor composition of the astrophysical neutrino\nflux than previous IceCube analyses, in particular when it is fit in\ncombination with high statistics samples of through-going tracks and cascades.\nA second approach uses a sensitive machine-learning-based selection technique\nthat finds seven candidate events in 9.7 years of IceCube data. This approach\nexcludes the zero astrophysical tau neutrino hypothesis at the highest\nstatistical significance to date.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:07:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lad","Neha","","for the IceCube Collaboration"],["Cowen","D. F.","","for the IceCube Collaboration"]]}
{"id":"2308.15214","submitter":"Neeraj Cherakara","authors":"Neeraj Cherakara, Finny Varghese, Sheena Shabana, Nivan Nelson,\n  Abhiram Karukayil, Rohith Kulothungan, Mohammed Afil Farhan, Birthe Nesset,\n  Meriam Moujahid, Tanvi Dinkar, Verena Rieser, Oliver Lemon","title":"FurChat: An Embodied Conversational Agent using LLMs, Combining Open and\n  Closed-Domain Dialogue with Facial Expressions","comments":"5 pages, 2 figures, Accepted at SIGDIAL 2023 (24th Meeting of the\n  Special Interest Group on Discourse and Dialogue), for the demo video, see\n  https://youtu.be/fwtUl1kl22s","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.HC cs.RO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate an embodied conversational agent that can function as a\nreceptionist and generate a mixture of open and closed-domain dialogue along\nwith facial expressions, by using a large language model (LLM) to develop an\nengaging conversation. We deployed the system onto a Furhat robot, which is\nhighly expressive and capable of using both verbal and nonverbal cues during\ninteraction. The system was designed specifically for the National Robotarium\nto interact with visitors through natural conversations, providing them with\ninformation about the facilities, research, news, upcoming events, etc. The\nsystem utilises the state-of-the-art GPT-3.5 model to generate such information\nalong with domain-general conversations and facial expressions based on prompt\nengineering.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:08:40 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 13:13:19 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Cherakara","Neeraj",""],["Varghese","Finny",""],["Shabana","Sheena",""],["Nelson","Nivan",""],["Karukayil","Abhiram",""],["Kulothungan","Rohith",""],["Farhan","Mohammed Afil",""],["Nesset","Birthe",""],["Moujahid","Meriam",""],["Dinkar","Tanvi",""],["Rieser","Verena",""],["Lemon","Oliver",""]]}
{"id":"2308.15215","submitter":"Sergio Zamora","authors":"Qin Deng, Jaime Santos-Rodr\\'iguez, Sergio Zamora, and Xinrui Zhao","title":"Margulis Lemma on $\\text{RCD}(K,N)$ spaces","comments":"51 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We extend the Margulis Lemma for manifolds with lower Ricci curvature bounds\nto the $\\text{RCD}(K,N)$ setting. As one of our main tools, we obtain improved\nregularity estimates for Regular Langrangian flows on these spaces.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:10:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Deng","Qin",""],["Santos-Rodr\u00edguez","Jaime",""],["Zamora","Sergio",""],["Zhao","Xinrui",""]]}
{"id":"2308.15216","submitter":"Yuelin Xin","authors":"Yicheng Chen, Shengxiang Ji, Yuelin Xin, Kun Han, Xiaohui Xie","title":"Optron: Better Medical Image Registration via Training in the Loop","comments":"10 pages, 5 figures, 4 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Previously, in the field of medical image registration, there are primarily\ntwo paradigms, the traditional optimization-based methods, and the\ndeep-learning-based methods. Each of these paradigms has its advantages, and in\nthis work, we aim to take the best of both worlds. Instead of developing a new\ndeep learning model, we designed a robust training architecture that is simple\nand generalizable. We present Optron, a general training architecture\nincorporating the idea of training-in-the-loop. By iteratively optimizing the\nprediction result of a deep learning model through a plug-and-play optimizer\nmodule in the training loop, Optron introduces pseudo ground truth to an\nunsupervised training process. And by bringing the training process closer to\nthat of supervised training, Optron can consistently improve the models'\nperformance and convergence speed. We evaluated our method on various\ncombinations of models and datasets, and we have achieved state-of-the-art\nperformance on the IXI dataset, improving the previous state-of-the-art method\nTransMorph by a significant margin of +1.6% DSC. Moreover, Optron also\nconsistently achieved positive results with other models and datasets. It\nincreases the validation DSC for VoxelMorph and ViT-V-Net by +2.3% and +2.2%\nrespectively on IXI, demonstrating our method's generalizability. Our\nimplementation is publicly available at\nhttps://github.com/miraclefactory/optron\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:12:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Yicheng",""],["Ji","Shengxiang",""],["Xin","Yuelin",""],["Han","Kun",""],["Xie","Xiaohui",""]]}
{"id":"2308.15217","submitter":"Surabhi Rathore Dr.","authors":"Surabhi Rathore, Hironobu Sugiyama, Hiroshi Suito","title":"Computational analysis for competition flows in arteriovenous fistulas\n  based on non-contrast magnetic resonance imaging","comments":"13 Pages, 7 figures, original Research Article","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Introduction: Characteristics of hemodynamics strongly affect the patency of\narteriovenous fistula (AVF) in hemodialysis patients. Because of pressure\nbalance changes among arteries after AVF construction, regurgitating flow\noccurs in some patients.\n  Methods: Based on phase-contrast MRI measurements, flow types around the\nanastomotic site are classified to the three different types of splitting,\nmerging, and one-way, where merging type incorporates regurgitating flow. We\nhave performed computational simulations to analyze characteristic differences\namong these types.\n  Results: In the merging type, a characteristic spiral flow is observed in AVF\ncausing strong wall shear stress and large pressure drop, whereas the splitting\ntype shows a smooth flow and gives a smaller pressure drop. The one-way case is\nintermediate between splitting and merging types.\n  Conclusion: Regurgitation brings about high wall shear stress near the\nanastomotic site because of instabilities induced by merging phenomena, for\nwhich type careful follow-up examinations are regarded as necessary.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:15:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Rathore","Surabhi",""],["Sugiyama","Hironobu",""],["Suito","Hiroshi",""]]}
{"id":"2308.15218","submitter":"Ko Sanders","authors":"Ko Sanders","title":"Stress tensor bounds on quantum fields","comments":"13 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The singular behaviour of quantum fields in Minkowski space can often be\nbounded by polynomials of the Hamiltonian $H$. These so-called $H$-bounds and\nrelated techniques allow us to handle pointwise quantum fields and their\noperator product expansions in a mathematically rigorous way. A drawback of\nthis approach, however, is that the Hamiltonian is a global rather than a local\noperator and, moreover, it is not defined in generic curved spacetimes. In\norder to overcome this drawback we investigate the possibility of replacing $H$\nby a component of the stress tensor, essentially an energy density, to obtain\nanalogous bounds. For definiteness we consider a massive, minimally coupled\nfree Hermitean scalar field. Using novel results on distributions of positive\ntype we show that in any globally hyperbolic Lorentzian manifold $M$ for any\n$f,F\\in C_0^{\\infty}(M)$ with $F\\equiv 1$ on $\\mathrm{supp}(f)$ and any\ntimelike smooth vector field $t^{\\mu}$ we can find constants $c,C>0$ such that\n$\\omega(\\phi(f)^*\\phi(f))\\le\nC(\\omega(T^{\\mathrm{ren}}_{\\mu\\nu}(t^{\\mu}t^{\\nu}F^2))+c)$ for all (not\nnecessarily quasi-free) Hadamard states $\\omega$. This is essentially a new\ntype of quantum energy inequality that entails a bound on the smeared quantum\nfield. In $1+1$ dimensions we also establish a bound on the pointwise quantum\nfield, namely $|\\omega(\\phi(x))|\\le\nC(\\omega(T^{\\mathrm{ren}}_{\\mu\\nu}(t^{\\mu}t^{\\nu}F^2))+c)$, where $F\\equiv 1$\nnear $x$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:17:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sanders","Ko",""]]}
{"id":"2308.15219","submitter":"Silvery Fu","authors":"Silvery Fu, Dylan Reimer, Siyuan Dong, Yifei Zhu, Sylvia Ratnasamy","title":"Comverse: A Federative-by-Design Platform for Community Computing","comments":"6 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DC cs.NI","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Communities, ranging from homes to cities, are a ubiquitous part of our\nlives. However, there is a lack of adequate support for applications built\naround these communities. As a result, current applications each need to\nimplement their own notion of communities, making it difficult for both the app\ndevelopers and the app users (\\ie the community admins and members) to create\nand use these community apps. In this paper, we argue that communities should\nbe supported at the infrastructure-level rather than at the app-level. We refer\nto this approach as the Platform-Managed Community (PMC). We propose Comverse,\na platform designed to this end. Comverse is predicated on the principle of\nfederation, allowing autonomous nodes representing community members to\nvoluntarily associate and share data while maintaining control over their data\nand participation. Through Comverse, we explore the vision of community\ncomputing by showcasing its applicability with real-world community apps.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:21:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fu","Silvery",""],["Reimer","Dylan",""],["Dong","Siyuan",""],["Zhu","Yifei",""],["Ratnasamy","Sylvia",""]]}
{"id":"2308.15220","submitter":"Neha Lad","authors":"Neha Lad (for the IceCube-Gen2 Collaboration)","title":"Sensitivity of IceCube-Gen2 to measure flavor composition of\n  Astrophysical neutrinos","comments":"Presented at the 38th International Cosmic Ray Conference (ICRC2023).\n  See arXiv:2307.13048 for all IceCube-Gen2 contributions","journal-ref":null,"doi":null,"report-no":"PoS-ICRC2023-1123","categories":"astro-ph.HE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The observation of an astrophysical neutrino flux in IceCube and its\ndetection capability to separate between the different neutrino flavors has led\nIceCube to constraint the flavor content of this flux. IceCube-Gen2 is the\nplanned extension of the current IceCube detector, which will be about 8 times\nlarger than the current instrumented volume. In this work, we study the\nsensitivity of IceCube-Gen2 to the astrophysical neutrino flavor composition\nand investigate its tau neutrino identification capabilities. We apply the\nIceCube analysis on a simulated IceCube-Gen2 dataset that mimics the High\nEnergy Starting Event (HESE) classification. Reconstructions are performed\nusing sensors that have 3 times higher quantum efficiency and isotropic angular\nacceptance compared to the current IceCube optical modules. We present the\nprojected sensitivity for 10 years of data on constraining the flavor ratio of\nthe astrophysical neutrino flux at Earth by IceCube-Gen2.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:22:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lad","Neha","","for the IceCube-Gen2 Collaboration"]]}
{"id":"2308.15221","submitter":"Gianluca Occhetta","authors":"Gianluca Occhetta and Eugenia Tondelli","title":"Morphisms between Grassmannians, II","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Denote by $\\mathbb G(k,n)$ the Grassmannian of linear subspaces of dimension\n$k$ in $\\mathbb P^n$. We show that, if $\\varphi:\\mathbb G(l,n) \\to \\mathbb\nG(k,n)$ is a non constant morphism and $l \\not=0,n-1$ then $l=k$ or $l=n-k-1$\nand $\\varphi$ is an isomorphism.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:22:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Occhetta","Gianluca",""],["Tondelli","Eugenia",""]]}
{"id":"2308.15222","submitter":"Marcel Guardia","authors":"Jacques Fejoz, Marcel Guardia","title":"A remark on the onset of resonance overlap","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Chirikov's celebrated criterion of resonance overlap has been widely used in\ncelestial mechanics and Hamiltonian dynamics to detect global instability, but\nis rarely rigourous. We introduce two simple Hamiltonian systems, each\ndepending on two parameters measuring respectively the distance to resonance\noverlap and non-integrability. Within some thin region of the parameter plane,\nclassical perturbation theory shows the existence of global instability and\nsymbolic dynamics, thus illustrating Chirikov's criterion.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:22:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fejoz","Jacques",""],["Guardia","Marcel",""]]}
{"id":"2308.15223","submitter":"Davide Italo Serramazza","authors":"Davide Italo Serramazza, Thu Trang Nguyen, Thach Le Nguyen, Georgiana\n  Ifrim","title":"Evaluating Explanation Methods for Multivariate Time Series\n  Classification","comments":"Accepted at AALTD '23","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Multivariate time series classification is an important computational task\narising in applications where data is recorded over time and over multiple\nchannels. For example, a smartwatch can record the acceleration and orientation\nof a person's motion, and these signals are recorded as multivariate time\nseries. We can classify this data to understand and predict human movement and\nvarious properties such as fitness levels. In many applications classification\nalone is not enough, we often need to classify but also understand what the\nmodel learns (e.g., why was a prediction given, based on what information in\nthe data). The main focus of this paper is on analysing and evaluating\nexplanation methods tailored to Multivariate Time Series Classification (MTSC).\nWe focus on saliency-based explanation methods that can point out the most\nrelevant channels and time series points for the classification decision. We\nanalyse two popular and accurate multivariate time series classifiers, ROCKET\nand dResNet, as well as two popular explanation methods, SHAP and dCAM. We\nstudy these methods on 3 synthetic datasets and 2 real-world datasets and\nprovide a quantitative and qualitative analysis of the explanations provided.\nWe find that flattening the multivariate datasets by concatenating the channels\nworks as well as using multivariate classifiers directly and adaptations of\nSHAP for MTSC work quite well. Additionally, we also find that the popular\nsynthetic datasets we used are not suitable for time series analysis.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:24:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Serramazza","Davide Italo",""],["Nguyen","Thu Trang",""],["Nguyen","Thach Le",""],["Ifrim","Georgiana",""]]}
{"id":"2308.15224","submitter":"Tae Soo Kim","authors":"Tae Soo Kim, Matt Latzke, Jonathan Bragg, Amy X. Zhang, Joseph Chee\n  Chang","title":"Papeos: Augmenting Research Papers with Talk Videos","comments":"Accepted to UIST 2023","journal-ref":null,"doi":"10.1145/3586183.3606770","report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Research consumption has been traditionally limited to the reading of\nacademic papers-a static, dense, and formally written format. Alternatively,\npre-recorded conference presentation videos, which are more dynamic, concise,\nand colloquial, have recently become more widely available but potentially\nunder-utilized. In this work, we explore the design space and benefits for\ncombining academic papers and talk videos to leverage their complementary\nnature to provide a rich and fluid research consumption experience. Based on\nformative and co-design studies, we present Papeos, a novel reading and\nauthoring interface that allow authors to augment their papers by segmenting\nand localizing talk videos alongside relevant paper passages with automatically\ngenerated suggestions. With Papeos, readers can visually skim a paper through\nclip thumbnails, and fluidly switch between consuming dense text in the paper\nor visual summaries in the video. In a comparative lab study (n=16), Papeos\nreduced mental load, scaffolded navigation, and facilitated more comprehensive\nreading of papers.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:25:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kim","Tae Soo",""],["Latzke","Matt",""],["Bragg","Jonathan",""],["Zhang","Amy X.",""],["Chang","Joseph Chee",""]]}
{"id":"2308.15225","submitter":"Mrugsen Gopnarayan","authors":"Mrugsen Nagsen Gopnarayan, Jaan Aru, Sebastian Gluth","title":"From DDMs to DNNs: Using process data and models of decision-making to\n  improve human-AI interactions","comments":"Review paper, 13 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Over the past decades, cognitive neuroscientists and behavioral economists\nhave recognized the value of describing the process of decision making in\ndetail and modeling the emergence of decisions over time. For example, the time\nit takes to decide can reveal more about an agents true hidden preferences than\nonly the decision itself. Similarly, data that track the ongoing decision\nprocess such as eye movements or neural recordings contain critical information\nthat can be exploited, even if no decision is made. Here, we argue that\nartificial intelligence (AI) research would benefit from a stronger focus on\ninsights about how decisions emerge over time and incorporate related process\ndata to improve AI predictions in general and human-AI interactions in\nparticular. First, we introduce a highly established computational framework\nthat assumes decisions to emerge from the noisy accumulation of evidence, and\nwe present related empirical work in psychology, neuroscience, and economics.\nNext, we discuss to what extent current approaches in multi-agent AI do or do\nnot incorporate process data and models of decision making. Finally, we outline\nhow a more principled inclusion of the evidence-accumulation framework into the\ntraining and use of AI can help to improve human-AI interactions in the future.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:27:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gopnarayan","Mrugsen Nagsen",""],["Aru","Jaan",""],["Gluth","Sebastian",""]]}
{"id":"2308.15226","submitter":"Devaansh Gupta","authors":"Devaansh Gupta, Siddhant Kharbanda, Jiawei Zhou, Wanhua Li, Hanspeter\n  Pfister, Donglai Wei","title":"CLIPTrans: Transferring Visual Knowledge with Pre-trained Models for\n  Multimodal Machine Translation","comments":"15 pages, 9 figures, to be published In Proceedings of International\n  Conference of Computer Vision(ICCV), 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There has been a growing interest in developing multimodal machine\ntranslation (MMT) systems that enhance neural machine translation (NMT) with\nvisual knowledge. This problem setup involves using images as auxiliary\ninformation during training, and more recently, eliminating their use during\ninference. Towards this end, previous works face a challenge in training\npowerful MMT models from scratch due to the scarcity of annotated multilingual\nvision-language data, especially for low-resource languages. Simultaneously,\nthere has been an influx of multilingual pre-trained models for NMT and\nmultimodal pre-trained models for vision-language tasks, primarily in English,\nwhich have shown exceptional generalisation ability. However, these are not\ndirectly applicable to MMT since they do not provide aligned multimodal\nmultilingual features for generative tasks. To alleviate this issue, instead of\ndesigning complex modules for MMT, we propose CLIPTrans, which simply adapts\nthe independently pre-trained multimodal M-CLIP and the multilingual mBART. In\norder to align their embedding spaces, mBART is conditioned on the M-CLIP\nfeatures by a prefix sequence generated through a lightweight mapping network.\nWe train this in a two-stage pipeline which warms up the model with image\ncaptioning before the actual translation task. Through experiments, we\ndemonstrate the merits of this framework and consequently push forward the\nstate-of-the-art across standard benchmarks by an average of +2.67 BLEU. The\ncode can be found at www.github.com/devaansh100/CLIPTrans.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:29:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gupta","Devaansh",""],["Kharbanda","Siddhant",""],["Zhou","Jiawei",""],["Li","Wanhua",""],["Pfister","Hanspeter",""],["Wei","Donglai",""]]}
{"id":"2308.15227","submitter":"Dmitry Smirnov S","authors":"D.S. Smirnov and E.L. Ivchenko","title":"Theory of polarized photoluminescence of indirect band gap excitons in\n  type-I quantum dots","comments":"10 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we theoretically investigate the optical orientation and\nalignment of excitons in quantum dots with weak electron-hole exchange\ninteraction and long exciton radiative lifetimes. This particular regime is\nrealized in semiconductor heterosystems where excitons are indirect in the\n$\\boldsymbol r$ or $\\boldsymbol k$ space. The main role in the fine structure\nof excitonic levels in these systems is played by the hyperfine interaction of\nthe electron in the confined exciton and fluctuations of the Overhauser field.\nAlong with it, the effects of nonradiative recombination and exchange\ninteraction are considered. We start with the model of vanishing exchange\ninteraction and nonradiative exciton recombination and then include them into\nconsideration in addition to the strong Overhauser field. In the nanoobjects\nunder study, the polarization properties of the resonant photoluminescence are\nshown to vary with the external magnetic filed in completely different way as\ncompared with the behaviour of the conventional quantum dot structures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:31:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Smirnov","D. S.",""],["Ivchenko","E. L.",""]]}
{"id":"2308.15228","submitter":"Ilya Charaev","authors":"I. Charaev, E. K. Batson, S. Cherednichenko, K. Reidy, V. Drakinskiy,\n  Y. Yu, S. Lara-Avila, J. D. Thomsen, M. Colangelo, F. Incalza, K. Ilin, A.\n  Schilling, and K. K. Berggren","title":"Single-photon detection using large-scale high-temperature MgB$_2$\n  sensors at 20 K","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Ultra-fast single-photon detectors with high current density and operating\ntemperature can benefit space and ground applications, including quantum\noptical communication systems, lightweight cryogenics for space crafts, and\nmedical use. Here we demonstrate magnesium diboride (MgB$_2$) thin-film\nsuperconducting microwires capable of single-photon detection at 1.55 $\\mu$m\noptical wavelength. We used helium ions to alter the properties of MgB$_2$,\nresulting in microwire-based detectors exhibiting single-photon sensitivity\nacross a broad temperature range of up to 20 K, and detection efficiency\nsaturation for 1 $\\mu$m wide microwires at 3.7 K. Linearity of detection rate\nvs incident power was preserved up to at least ~100 Mcps. Despite the large\nactive area of up to 400$\\times$400 $\\mu$m$^2$, the reset time was found to be\nas low as $\\sim1$ ns. Our research provides new possibilities for breaking the\noperating temperature limit and maximum single-pixel count rate, expanding the\ndetector area, and raises inquiries about the fundamental mechanisms of\nsingle-photon detection in high-critical-temperature superconductors.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:33:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Charaev","I.",""],["Batson","E. K.",""],["Cherednichenko","S.",""],["Reidy","K.",""],["Drakinskiy","V.",""],["Yu","Y.",""],["Lara-Avila","S.",""],["Thomsen","J. D.",""],["Colangelo","M.",""],["Incalza","F.",""],["Ilin","K.",""],["Schilling","A.",""],["Berggren","K. K.",""]]}
{"id":"2308.15229","submitter":"Ilya Simakov","authors":"Ilya A. Simakov, Grigoriy S. Mazhorin, Ilya N. Moskalenko, Seidali S.\n  Seidov, Ilya S. Besedin","title":"High-fidelity transmon coupler activated CCZ gate on fluxonium qubits","comments":"9 pages, 6 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Toffoli gate takes a special place in the quantum information theory. It\nopens up a path for efficient implementation of complex quantum algorithms.\nDespite tremendous progress of the quantum processors based on the\nsuperconducting qubits, realization of a high-fidelity three-qubit operation is\nstill a challenging problem. Here, we propose a novel way to perform a\nhigh-fidelity CCZ gate on fluxoniums capacitively connected via a transmon\nqubit, activated by a microwave pulse on the coupler. The main advantages of\nthe approach are relative quickness, simplicity of calibration and significant\nsuppression of the unwanted longitudinal ZZ interaction. We provide numerical\nsimulation of 95-ns long gate of higher than 99.99% fidelity with realistic\ncircuit parameters in the noiseless model and estimate an error of about 0.25%\nunder the conventional decoherence rates.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:36:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Simakov","Ilya A.",""],["Mazhorin","Grigoriy S.",""],["Moskalenko","Ilya N.",""],["Seidov","Seidali S.",""],["Besedin","Ilya S.",""]]}
{"id":"2308.15230","submitter":"Bj{\\o}rnar Vass{\\o}y","authors":"Bj{\\o}rnar Vass{\\o}y, Helge Langseth, Benjamin Kille","title":"Providing Previously Unseen Users Fair Recommendations Using Variational\n  Autoencoders","comments":"Appearing in RecSys 2023 proceedings","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An emerging definition of fairness in machine learning requires that models\nare oblivious to demographic user information, e.g., a user's gender or age\nshould not influence the model. Personalized recommender systems are\nparticularly prone to violating this definition through their explicit user\nfocus and user modelling. Explicit user modelling is also an aspect that makes\nmany recommender systems incapable of providing hitherto unseen users with\nrecommendations. We propose novel approaches for mitigating discrimination in\nVariational Autoencoder-based recommender systems by limiting the encoding of\ndemographic information. The approaches are capable of, and evaluated on,\nproviding users that are not represented in the training data with fair\nrecommendations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:37:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vass\u00f8y","Bj\u00f8rnar",""],["Langseth","Helge",""],["Kille","Benjamin",""]]}
{"id":"2308.15231","submitter":"Angus Addlesee","authors":"Angus Addlesee, Weronika Siei\\'nska, Nancie Gunson, Daniel Hern\\'andez\n  Garcia, Christian Dondrup, Oliver Lemon","title":"Multi-party Goal Tracking with LLMs: Comparing Pre-training,\n  Fine-tuning, and Prompt Engineering","comments":"Accepted and will appear in the Proceedings of SIGdial 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This paper evaluates the extent to which current Large Language Models (LLMs)\ncan capture task-oriented multi-party conversations (MPCs). We have recorded\nand transcribed 29 MPCs between patients, their companions, and a social robot\nin a hospital. We then annotated this corpus for multi-party goal-tracking and\nintent-slot recognition. People share goals, answer each other's goals, and\nprovide other people's goals in MPCs - none of which occur in dyadic\ninteractions. To understand user goals in MPCs, we compared three methods in\nzero-shot and few-shot settings: we fine-tuned T5, created pre-training tasks\nto train DialogLM using LED, and employed prompt engineering techniques with\nGPT-3.5-turbo, to determine which approach can complete this novel task with\nlimited data. GPT-3.5-turbo significantly outperformed the others in a few-shot\nsetting. The `reasoning' style prompt, when given 7% of the corpus as example\nannotated conversations, was the best performing method. It correctly annotated\n62.32% of the goal tracking MPCs, and 69.57% of the intent-slot recognition\nMPCs. A `story' style prompt increased model hallucination, which could be\ndetrimental if deployed in safety-critical settings. We conclude that\nmulti-party conversations still challenge state-of-the-art LLMs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:40:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Addlesee","Angus",""],["Siei\u0144ska","Weronika",""],["Gunson","Nancie",""],["Garcia","Daniel Hern\u00e1ndez",""],["Dondrup","Christian",""],["Lemon","Oliver",""]]}
{"id":"2308.15232","submitter":"Xingyi Song","authors":"Tianyu Liang, Yida Mu, Soonho Kim, Darline Larissa Kengne Kuate, Julie\n  Lang, Rob Vos, Xingyi Song","title":"Classification-Aware Neural Topic Model Combined With Interpretable\n  Analysis -- For Conflict Classification","comments":"Accepted by RANLP 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CL cs.IR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A large number of conflict events are affecting the world all the time. In\norder to analyse such conflict events effectively, this paper presents a\nClassification-Aware Neural Topic Model (CANTM-IA) for Conflict Information\nClassification and Topic Discovery. The model provides a reliable\ninterpretation of classification results and discovered topics by introducing\ninterpretability analysis. At the same time, interpretation is introduced into\nthe model architecture to improve the classification performance of the model\nand to allow interpretation to focus further on the details of the data.\nFinally, the model architecture is optimised to reduce the complexity of the\nmodel.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:40:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liang","Tianyu",""],["Mu","Yida",""],["Kim","Soonho",""],["Kuate","Darline Larissa Kengne",""],["Lang","Julie",""],["Vos","Rob",""],["Song","Xingyi",""]]}
{"id":"2308.15233","submitter":"Xunzhu Tang","authors":"Xunzhu Tang and zhenghan Chen and Saad Ezzini and Haoye Tian and Yewei\n  Song and Jacques Klein and Tegawende F. Bissyande","title":"Multilevel Semantic Embedding of Software Patches: A Fine-to-Coarse\n  Grained Approach Towards Security Patch Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The growth of open-source software has increased the risk of hidden\nvulnerabilities that can affect downstream software applications. This concern\nis further exacerbated by software vendors' practice of silently releasing\nsecurity patches without explicit warnings or common vulnerability and exposure\n(CVE) notifications. This lack of transparency leaves users unaware of\npotential security threats, giving attackers an opportunity to take advantage\nof these vulnerabilities. In the complex landscape of software patches,\ngrasping the nuanced semantics of a patch is vital for ensuring secure software\nmaintenance. To address this challenge, we introduce a multilevel Semantic\nEmbedder for security patch detection, termed MultiSEM. This model harnesses\nword-centric vectors at a fine-grained level, emphasizing the significance of\nindividual words, while the coarse-grained layer adopts entire code lines for\nvector representation, capturing the essence and interrelation of added or\nremoved lines. We further enrich this representation by assimilating patch\ndescriptions to obtain a holistic semantic portrait. This combination of\nmulti-layered embeddings offers a robust representation, balancing word\ncomplexity, understanding code-line insights, and patch descriptions.\nEvaluating MultiSEM for detecting patch security, our results demonstrate its\nsuperiority, outperforming state-of-the-art models with promising margins: a\n22.46\\% improvement on PatchDB and a 9.21\\% on SPI-DB in terms of the F1\nmetric.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:41:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tang","Xunzhu",""],["Chen","zhenghan",""],["Ezzini","Saad",""],["Tian","Haoye",""],["Song","Yewei",""],["Klein","Jacques",""],["Bissyande","Tegawende F.",""]]}
{"id":"2308.15234","submitter":"Xunzhu Tang","authors":"Xunzhu Tang and zhenghan Chen and Saad Ezzini and Haoye Tian and Yewei\n  Song and Jacques Klein and Tegawende F. Bissyande","title":"Hyperbolic Code Retrieval: A Novel Approach for Efficient Code Search\n  Using Hyperbolic Space Embeddings","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Within the realm of advanced code retrieval, existing methods have primarily\nrelied on intricate matching and attention-based mechanisms. However, these\nmethods often lead to computational and memory inefficiencies, posing a\nsignificant challenge to their real-world applicability. To tackle this\nchallenge, we propose a novel approach, the Hyperbolic Code QA Matching\n(HyCoQA). This approach leverages the unique properties of Hyperbolic space to\nexpress connections between code fragments and their corresponding queries,\nthereby obviating the necessity for intricate interaction layers. The process\ncommences with a reimagining of the code retrieval challenge, framed within a\nquestion-answering (QA) matching framework, constructing a dataset with triple\nmatches characterized as \\texttt{<}negative code, description, positive\ncode\\texttt{>}. These matches are subsequently processed via a static BERT\nembedding layer, yielding initial embeddings. Thereafter, a hyperbolic embedder\ntransforms these representations into hyperbolic space, calculating distances\nbetween the codes and descriptions. The process concludes by implementing a\nscoring layer on these distances and leveraging hinge loss for model training.\nEspecially, the design of HyCoQA inherently facilitates self-organization,\nallowing for the automatic detection of embedded hierarchical patterns during\nthe learning phase. Experimentally, HyCoQA showcases remarkable effectiveness\nin our evaluations: an average performance improvement of 3.5\\% to 4\\% compared\nto state-of-the-art code retrieval techniques.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:45:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tang","Xunzhu",""],["Chen","zhenghan",""],["Ezzini","Saad",""],["Tian","Haoye",""],["Song","Yewei",""],["Klein","Jacques",""],["Bissyande","Tegawende F.",""]]}
{"id":"2308.15235","submitter":"Nicos Isaak","authors":"Nicos Isaak","title":"PronounFlow: A Hybrid Approach for Calibrating Pronouns in Sentences","comments":"13 pages, 4 figures, 3 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Flip through any book or listen to any song lyrics, and you will come across\npronouns that, in certain cases, can hinder meaning comprehension, especially\nfor machines. As the role of having cognitive machines becomes pervasive in our\nlives, numerous systems have been developed to resolve pronouns under various\nchallenges. Commensurate with this, it is believed that having systems able to\ndisambiguate pronouns in sentences will help towards the endowment of machines\nwith commonsense and reasoning abilities like those found in humans. However,\none problem these systems face with modern English is the lack of gender\npronouns, where people try to alternate by using masculine, feminine, or plural\nto avoid the whole issue. Since humanity aims to the building of systems in the\nfull-bodied sense we usually reserve for people, what happens when pronouns in\nwritten text, like plural or epicene ones, refer to unspecified entities whose\ngender is not necessarily known? Wouldn't that put extra barriers to existing\ncoreference resolution systems? Towards answering those questions, through the\nimplementation of a neural-symbolic system that utilizes the best of both\nworlds, we are employing PronounFlow, a system that reads any English sentence\nwith pronouns and entities, identifies which of them are not tied to each\nother, and makes suggestions on which to use to avoid biases. Undertaken\nexperiments show that PronounFlow not only alternates pronouns in sentences\nbased on the collective human knowledge around us but also considerably helps\ncoreference resolution systems with the pronoun disambiguation process.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:46:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Isaak","Nicos",""]]}
{"id":"2308.15236","submitter":"Xiuwei Chen","authors":"Xiuwei Chen, Xiaobin Chang","title":"Rotation Augmented Distillation for Exemplar-Free Class Incremental\n  Learning with Detailed Analysis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Class incremental learning (CIL) aims to recognize both the old and new\nclasses along the increment tasks. Deep neural networks in CIL suffer from\ncatastrophic forgetting and some approaches rely on saving exemplars from\nprevious tasks, known as the exemplar-based setting, to alleviate this problem.\nOn the contrary, this paper focuses on the Exemplar-Free setting with no old\nclass sample preserved. Balancing the plasticity and stability in deep feature\nlearning with only supervision from new classes is more challenging. Most\nexisting Exemplar-Free CIL methods report the overall performance only and lack\nfurther analysis. In this work, different methods are examined with\ncomplementary metrics in greater detail. Moreover, we propose a simple CIL\nmethod, Rotation Augmented Distillation (RAD), which achieves one of the\ntop-tier performances under the Exemplar-Free setting. Detailed analysis shows\nour RAD benefits from the superior balance between plasticity and stability.\nFinally, more challenging exemplar-free settings with fewer initial classes are\nundertaken for further demonstrations and comparisons among the\nstate-of-the-art methods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:51:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Xiuwei",""],["Chang","Xiaobin",""]]}
{"id":"2308.15237","submitter":"Wa Nkongolo Mike Nkongolo","authors":"Mike Nkongolo","title":"Assessing Cyclostationary Malware Detection via Feature Selection and\n  Classification","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cyclostationarity involves periodic statistical variations in signals and\nprocesses, commonly used in signal analysis and network security. In the\ncontext of attacks, cyclostationarity helps detect malicious behaviors within\nnetwork traffic, such as traffic patterns in Distributed Denial of Service\n(DDoS) attacks or hidden communication channels in malware. This approach\nenhances security by identifying abnormal patterns and informing Network\nIntrusion Detection Systems (NIDSs) to recognize potential attacks, enhancing\nprotection against both known and novel threats. This research focuses on\nidentifying cyclostationary malware behavior and its detection. The main goal\nis to pinpoint essential cyclostationary features used in NIDSs. These features\nare extracted using algorithms such as Boruta and Principal Component Analysis\n(PCA), and then categorized to find the most significant cyclostationary\npatterns. The aim of this article is to reveal periodically changing malware\nbehaviors through cyclostationarity. The study highlights the importance of\nspotting cyclostationary malware in NIDSs by using established datasets like\nKDD99, NSL-KDD, and the UGRansome dataset. The UGRansome dataset is designed\nfor anomaly detection research and includes both normal and abnormal network\nthreat categories of zero-day attacks. A comparison is made using the Random\nForest (RF) and Support Vector Machine (SVM) algorithms, while also evaluating\nthe effectiveness of Boruta and PCA. The findings show that PCA is more\npromising than using Boruta alone for extracting cyclostationary network\nfeature patterns. Additionally, the analysis identifies the internet protocol\nas the most noticeable cyclostationary feature pattern used by malware.\nNotably, the UGRansome dataset outperforms the KDD99 and NSL-KDD, achieving 99%\naccuracy in signature malware detection using the RF algorithm and 98% with the\nSVM.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:52:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nkongolo","Mike",""]]}
{"id":"2308.15238","submitter":"Satadeep Bhattacharjee","authors":"Satadeep Bhattacharjee, Swetarekha Ram, Seung-Cheol Lee","title":"Insights into heterogeneous catalysis on surfaces with 3d transition\n  metals: Spin-dependent chemisorption models and magnetic field effects","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This article provides a review of recent developments in the field of 3d\ntransition metal (TM) catalysts for different reactions including oxygen-based\nreactions such as Oxygen Reduction Reaction (ORR) and Oxygen Evolution Reaction\n(OER). The spin moments of 3d TMs can be exploited to influence chemical\nreactions, and recent advances in this area, including the theory of\nchemisorption based on spin-dependent d-band centers and magnetic field\neffects, are discussed. The article also explores the use of scaling\nrelationships and surface magnetic moments in catalyst design, as well as the\neffect of magnetism on chemisorption and vice versa. In addition, recent\nstudies on the influence of a magnetic field on the ORR and OER are presented,\ndemonstrating the potential of ferromagnetic catalysts to enhance these\nreactions through spin polarization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:57:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bhattacharjee","Satadeep",""],["Ram","Swetarekha",""],["Lee","Seung-Cheol",""]]}
{"id":"2308.15239","submitter":"Filipe Assun\\c{c}\\~ao","authors":"Sofia Aparicio, Samuel Arcadinho, Jo\\~ao Nadkarni, David Apar\\'icio,\n  Jo\\~ao Lages, Mariana Louren\\c{c}o, Bart{\\l}omiej Matejczyk, Filipe\n  Assun\\c{c}\\~ao","title":"Natural language to SQL in low-code platforms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  One of the developers' biggest challenges in low-code platforms is retrieving\ndata from a database using SQL queries. Here, we propose a pipeline allowing\ndevelopers to write natural language (NL) to retrieve data. In this study, we\ncollect, label, and validate data covering the SQL queries most often performed\nby OutSystems users. We use that data to train a NL model that generates SQL.\nAlongside this, we describe the entire pipeline, which comprises a feedback\nloop that allows us to quickly collect production data and use it to retrain\nour SQL generation model. Using crowd-sourcing, we collect 26k NL and SQL pairs\nand obtain an additional 1k pairs from production data. Finally, we develop a\nUI that allows developers to input a NL query in a prompt and receive a\nuser-friendly representation of the resulting SQL query. We use A/B testing to\ncompare four different models in production and observe a 240% improvement in\nterms of adoption of the feature, 220% in terms of engagement rate, and a 90%\ndecrease in failure rate when compared against the first model that we put into\nproduction, showcasing the effectiveness of our pipeline in continuously\nimproving our feature.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 11:59:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Aparicio","Sofia",""],["Arcadinho","Samuel",""],["Nadkarni","Jo\u00e3o",""],["Apar\u00edcio","David",""],["Lages","Jo\u00e3o",""],["Louren\u00e7o","Mariana",""],["Matejczyk","Bart\u0142omiej",""],["Assun\u00e7\u00e3o","Filipe",""]]}
{"id":"2308.15240","submitter":"Debdeep Ghosal","authors":"A2 Collaboration: D. Ghosal, V. Sokhoyan, A. Fix, S. Lutterer, S. Abt,\n  P. Achenbach, F. Afzal, Z. Ahmed, J.R.M. Annand, M. Bashkanov, R. Beck, M.\n  Biroth, N. Borisov, A. Braghieri, W.J. Briscoe, F. Cividini, C. Collicot, S.\n  Costanza, A. Denig, M. Dieterle, A.S. Dolzhikov, E.J. Downie, P. Drexler, S.\n  Fegan, S. Gardner, D.I. Glazier, I. Gorodnov, W. Gradl, M. G\\\"unther, D.\n  Gurevich, L. Heijkenskj\\\"old, D. Hornidge, G.M. Huber, N. Jermann, A.\n  K\\\"aser, V.L. Kashevarov, M. Korolija, B. Krusche, A. Lazarev, K. Livingston,\n  I.J.D. MacGregor, D.M. Manley, P.P. Martel, Ch. Meier, R. Miskimen, M.\n  Mocanu, E. Mornacchi, C. Mullen, A. Neganov, A. Neiser, M. Ostrick, P. Otte,\n  D. Paudyal, P. Pedroni, A. Powell, G. Reicherz, T. Rostomyan, K. Spieker, O.\n  Steffen, I.I. Strakovsky, A. Thiel, M. Thiel, A. Thomas, M. Unverzagt, Yu.A.\n  Usov, S. Wagner, N.K. Walford, D.P. Watts, D. Werthm\\\"uller, J. Wettig, L.\n  Witthauer, M. Wolfes, N. Zachariou","title":"Helicity dependent cross sections for the photoproduction of\n  $\\pi^0\\pi^{\\pm}$ pairs from quasi-free nucleons","comments":"9 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Photoproduction of $\\pi^0\\pi^{\\pm}$-pairs from quasifree nucleons bound in\nthe deuteron has been investigated to study the helicity dependence of this\nreaction. Measurements with a liquid deuterium target were used to extract the\nunpolarized cross sections for reactions on protons and neutrons. A deuterated,\nlongitudinally polarized solid-butanol target, together with a circularly\npolarized photon beam, determined the double polarization observable $E$. From\nthese results the spin-dependent cross sections $\\sigma_{1/2}$ and\n$\\sigma_{3/2}$, corresponding to the anti-parallel and parallel spin\nconfigurations of the beam photon and target nucleon, have been derived. The\nmeasurements were performed at the Mainz MAMI accelerator with tagged,\ncircularly-polarized photon beams produced via bremsstrahlung from\nlongitudinally polarized electron beams. The reaction products were detected\nwith an almost $4\\pi$ solid-angle covering calorimeter composed of the Crystal\nBall and TAPS detectors, supplemented by plastic scintillation detectors for\ncharged particle identification. The results are sensitive to sequential decays\nof nucleon resonances via intermediate states and also to the decay of nucleon\nresonances by emission of charged $\\rho$ mesons, and are compared to recent\nmodel results.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:00:41 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 11:41:48 GMT"}],"update_date":"2023-09-01","authors_parsed":[["A2 Collaboration","",""],["Ghosal","D.",""],["Sokhoyan","V.",""],["Fix","A.",""],["Lutterer","S.",""],["Abt","S.",""],["Achenbach","P.",""],["Afzal","F.",""],["Ahmed","Z.",""],["Annand","J. R. M.",""],["Bashkanov","M.",""],["Beck","R.",""],["Biroth","M.",""],["Borisov","N.",""],["Braghieri","A.",""],["Briscoe","W. J.",""],["Cividini","F.",""],["Collicot","C.",""],["Costanza","S.",""],["Denig","A.",""],["Dieterle","M.",""],["Dolzhikov","A. S.",""],["Downie","E. J.",""],["Drexler","P.",""],["Fegan","S.",""],["Gardner","S.",""],["Glazier","D. I.",""],["Gorodnov","I.",""],["Gradl","W.",""],["G\u00fcnther","M.",""],["Gurevich","D.",""],["Heijkenskj\u00f6ld","L.",""],["Hornidge","D.",""],["Huber","G. M.",""],["Jermann","N.",""],["K\u00e4ser","A.",""],["Kashevarov","V. L.",""],["Korolija","M.",""],["Krusche","B.",""],["Lazarev","A.",""],["Livingston","K.",""],["MacGregor","I. J. D.",""],["Manley","D. M.",""],["Martel","P. P.",""],["Meier","Ch.",""],["Miskimen","R.",""],["Mocanu","M.",""],["Mornacchi","E.",""],["Mullen","C.",""],["Neganov","A.",""],["Neiser","A.",""],["Ostrick","M.",""],["Otte","P.",""],["Paudyal","D.",""],["Pedroni","P.",""],["Powell","A.",""],["Reicherz","G.",""],["Rostomyan","T.",""],["Spieker","K.",""],["Steffen","O.",""],["Strakovsky","I. I.",""],["Thiel","A.",""],["Thiel","M.",""],["Thomas","A.",""],["Unverzagt","M.",""],["Usov","Yu. A.",""],["Wagner","S.",""],["Walford","N. K.",""],["Watts","D. P.",""],["Werthm\u00fcller","D.",""],["Wettig","J.",""],["Witthauer","L.",""],["Wolfes","M.",""],["Zachariou","N.",""]]}
{"id":"2308.15241","submitter":"Homayoun Jafari","authors":"Homayoun Jafari, Evgenii Barts, Przemys{\\l}aw Przybysz, Karma Tenzin,\n  Pawe{\\l} J. Kowalczyk, Pawe{\\l} Dabrowski, Jagoda S{\\l}awi\\'nska","title":"Robust Zeeman-type band splitting in sliding ferroelectrics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Transition metal dichalcogenides exhibit giant spin-orbit coupling, and\nintriguing spin-valley effects, which can be harnessed through proximity in van\nder Waals (vdW) heterostructures. Remarkably, due to the prismatic crystal\nfield, the Zeeman-type band splitting of valence bands reach values of several\nhundreds of meV. While this effect is suppressed in the commonly studied\nhexagonal (H)-stacked bilayers due to the presence of inversion symmetry, the\nrecent discovery of sliding ferroelectricity in rhombohedral (R-)stacked MX$_2$\nbilayers (M=Mo, W; X=S, Se) suggests that the Zeeman effect could be present in\nthese non-centrosymmetric configurations, making it even more intriguing to\ninvestigate how the spin-resolved bands would evolve during the phase\ntransition. Here, we perform density functional theory calculations\ncomplemented by symmetry analysis to unveil the evolution of ferroelectricity\nduring sliding and the behavior of Zeeman splitting along the transition path.\nWhile the evolution of the out-of-plane component of the electric polarization\nvector resembles the conventional ferroelectric transition, we observe\nsignificant in-plane components parallel to the sliding direction, reaching\ntheir maximum at the intermediate state. Moreover, we demonstrate that the\nR-stacked bilayers exhibit persistent Zeeman-type band splitting throughout the\ntransition path, allowed by the lack of inversion symmetry. Further analysis of\ndifferent stacking configurations generated by sliding along various directions\nconfirms that the Zeeman effect in MX$_2$, primarily arising from the polarity\nof prismatic ligand coordination of the metal atom, is remarkably robust and\ncompletely governs the spin polarization of bands, independently of the sliding\ndirection. This resilience promises robust spin transport in vdW based MX$_2$\nbilayers, opening new opportunities for ferroelectric spintronics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:00:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jafari","Homayoun",""],["Barts","Evgenii",""],["Przybysz","Przemys\u0142aw",""],["Tenzin","Karma",""],["Kowalczyk","Pawe\u0142 J.",""],["Dabrowski","Pawe\u0142",""],["S\u0142awi\u0144ska","Jagoda",""]]}
{"id":"2308.15242","submitter":"Arseny Shur","authors":"Arseny M. Shur, Mikhail Rubinchik","title":"Distance Labeling for Families of Cycles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO cs.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  For an arbitrary finite family of graphs, the distance labeling problem asks\nto assign labels to all nodes of every graph in the family in a way that allows\none to recover the distance between any two nodes of any graph from their\nlabels. The main goal is to minimize the number of unique labels used. We study\nthis problem for the families $\\mathcal{C}_n$ consisting of cycles of all\nlengths between 3 and $n$. We observe that the exact solution for directed\ncycles is straightforward and focus on the undirected case. We design a\nlabeling scheme requiring $\\frac{n\\sqrt{n}}{\\sqrt{6}}+O(n)$ labels, which is\nalmost twice less than is required by the earlier known scheme. Using the\ncomputer search, we find an optimal labeling for each $n\\le 17$, showing that\nour scheme gives the results that are very close to the optimum.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:06:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shur","Arseny M.",""],["Rubinchik","Mikhail",""]]}
{"id":"2308.15243","submitter":"Tim R\\\"az","authors":"Tim R\\\"az","title":"Reliability Gaps Between Groups in COMPAS Dataset","comments":"15 pages + appendix","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.LG","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  This paper investigates the inter-rater reliability of risk assessment\ninstruments (RAIs). The main question is whether different, socially salient\ngroups are affected differently by a lack of inter-rater reliability of RAIs,\nthat is, whether mistakes with respect to different groups affects them\ndifferently. The question is investigated with a simulation study of the COMPAS\ndataset. A controlled degree of noise is injected into the input data of a\npredictive model; the noise can be interpreted as a synthetic rater that makes\nmistakes. The main finding is that there are systematic differences in output\nreliability between groups in the COMPAS dataset. The sign of the difference\ndepends on the kind of inter-rater statistic that is used (Cohen's Kappa,\nByrt's PABAK, ICC), and in particular whether or not a correction of\npredictions prevalences of the groups is used.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:09:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["R\u00e4z","Tim",""]]}
{"id":"2308.15244","submitter":"Meng Yuan","authors":"Meng Yuan, Fuzhen Zhuang, Zhao Zhang, Deqing Wang and Jin Dong","title":"Knowledge-based Multiple Adaptive Spaces Fusion for Recommendation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Since Knowledge Graphs (KGs) contain rich semantic information, recently\nthere has been an influx of KG-enhanced recommendation methods. Most of\nexisting methods are entirely designed based on euclidean space without\nconsidering curvature. However, recent studies have revealed that a tremendous\ngraph-structured data exhibits highly non-euclidean properties. Motivated by\nthese observations, in this work, we propose a knowledge-based multiple\nadaptive spaces fusion method for recommendation, namely MCKG. Unlike existing\nmethods that solely adopt a specific manifold, we introduce the unified space\nthat is compatible with hyperbolic, euclidean and spherical spaces.\nFurthermore, we fuse the multiple unified spaces in an attention manner to\nobtain the high-quality embeddings for better knowledge propagation. In\naddition, we propose a geometry-aware optimization strategy which enables the\npull and push processes benefited from both hyperbolic and spherical spaces.\nSpecifically, in hyperbolic space, we set smaller margins in the area near to\nthe origin, which is conducive to distinguishing between highly similar\npositive items and negative ones. At the same time, we set larger margins in\nthe area far from the origin to ensure the model has sufficient error\ntolerance. The similar manner also applies to spherical spaces. Extensive\nexperiments on three real-world datasets demonstrate that the MCKG has a\nsignificant improvement over state-of-the-art recommendation methods. Further\nablation experiments verify the importance of multi-space fusion and\ngeometry-aware optimization strategy, justifying the rationality and\neffectiveness of MCKG.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:11:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yuan","Meng",""],["Zhuang","Fuzhen",""],["Zhang","Zhao",""],["Wang","Deqing",""],["Dong","Jin",""]]}
{"id":"2308.15245","submitter":"Andreas Buchgraitz Jensen","authors":"Andreas Buchgraitz Jensen, Mads Greisen H{\\o}jlund, Alberto Zoccante,\n  Niels Kristian Madsen and Ove Christiansen","title":"Efficient time-dependent vibrational coupled cluster computations with\n  time-dependent basis sets at the two-mode coupling level: full and hybrid\n  TDMVCC[2]","comments":"Will be submitted to Journal of Chemical Physics","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The computation of the nuclear quantum dynamics of molecules is challenging,\nrequiring both accuracy and efficiency to be applicable to systems of interest.\nRecently, theories have been developed for employing time-dependent basis\nfunctions (denoted modals) with vibrational coupled cluster theory (TDMVCC).\nThe TDMVCC method was introduced along with a pilot implementation, which\nillustrated good accuracy in benchmark computations. In this paper we report an\nefficient implementation of TDMVCC covering the case where the wave function\nand Hamiltonian contain up to two-mode couplings. After a careful regrouping of\nterms, the wave function can be propagated with a cubic computational scaling\nwith respect to the number of degrees of freedom. We discuss the use of a\nrestricted set of active one-mode basis functions for each mode, as well as two\ninteresting limits: i) the use of a full active basis where the variational\nmodal determination amounts essentially to the variational determination of a\ntime-dependent reference state for the cluster expansion; and ii) the use of a\nsingle function as active basis for some degrees of freedom. The latter case\ndefines a hybrid TDMVCC/TDH approach which can obtain an even lower\ncomputational scaling. The resulting computational scaling for hybrid and full\nTDMVCC[2] are illustrated for polyaromatic hydrocarbons (PAHs) with up to 264\nmodes. Finally, computations on the internal vibrational redistribution on\nbenzoic acid (39 modes) are used to show the faster convergence of TDMVCC/TDH\nhybrid computations towards TDMVCC compared to simple neglect of some degrees\nof freedom.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:11:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jensen","Andreas Buchgraitz",""],["H\u00f8jlund","Mads Greisen",""],["Zoccante","Alberto",""],["Madsen","Niels Kristian",""],["Christiansen","Ove",""]]}
{"id":"2308.15246","submitter":"Sahar Sadrizadeh","authors":"Sahar Sadrizadeh, Ljiljana Dolamic, Pascal Frossard","title":"A Classification-Guided Approach for Adversarial Attacks against Neural\n  Machine Translation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Neural Machine Translation (NMT) models have been shown to be vulnerable to\nadversarial attacks, wherein carefully crafted perturbations of the input can\nmislead the target model. In this paper, we introduce ACT, a novel adversarial\nattack framework against NMT systems guided by a classifier. In our attack, the\nadversary aims to craft meaning-preserving adversarial examples whose\ntranslations by the NMT model belong to a different class than the original\ntranslations in the target language. Unlike previous attacks, our new approach\nhas a more substantial effect on the translation by altering the overall\nmeaning, which leads to a different class determined by a classifier. To\nevaluate the robustness of NMT models to this attack, we propose enhancements\nto existing black-box word-replacement-based attacks by incorporating output\ntranslations of the target NMT model and the output logits of a classifier\nwithin the attack process. Extensive experiments in various settings, including\na comparison with existing untargeted attacks, demonstrate that the proposed\nattack is considerably more successful in altering the class of the output\ntranslation and has more effect on the translation. This new paradigm can show\nthe vulnerabilities of NMT systems by focusing on the class of translation\nrather than the mere translation quality as studied traditionally.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:12:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sadrizadeh","Sahar",""],["Dolamic","Ljiljana",""],["Frossard","Pascal",""]]}
{"id":"2308.15247","submitter":"Henrik H{\\o}j Kristensen","authors":"Lorenz Kranabetter, Henrik H. Kristensen, Areg Ghazaryan, Constant A.\n  Schouder, Adam S. Chatterley, Paul Janssen, Frank Jensen, Robert E. Zillich,\n  Mikhail Lemeshko, Henrik Stapelfeldt","title":"Nonadiabatic Laser-Induced Alignment Dynamics of Molecules on a Surface","comments":"6 pages, 4 figures","journal-ref":"Phys. Rev. Lett. 131, 053201 (2023)","doi":"10.1103/PhysRevLett.131.053201","report-no":null,"categories":"physics.atm-clus physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate that a sodium dimer, Na$_{2}$($1^3\\Sigma_{u}^+$), residing on\nthe surface of a helium nanodroplet, can be set into rotation by a nonresonant\n1.0 ps infrared laser pulse. The time-dependent degree of alignment measured,\nexhibits a periodic, gradually decreasing structure that deviates qualitatively\nfrom that expected for gas phase dimers. Comparison to alignment dynamics\ncalculated from the time-dependent rotational Schr\\\"{o}dinger equation shows\nthat the deviation is due to the alignment dependent interaction between the\ndimer and the droplet surface. This interaction confines the dimer to the\ntangential plane of the droplet surface at the point where it resides and is\nthe reason that the observed alignment dynamics is also well-described by a 2D\nquantum rotor model.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:13:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kranabetter","Lorenz",""],["Kristensen","Henrik H.",""],["Ghazaryan","Areg",""],["Schouder","Constant A.",""],["Chatterley","Adam S.",""],["Janssen","Paul",""],["Jensen","Frank",""],["Zillich","Robert E.",""],["Lemeshko","Mikhail",""],["Stapelfeldt","Henrik",""]]}
{"id":"2308.15248","submitter":"Di Wu","authors":"Rui Li, Jinfeng Li, Di Wu","title":"On the chromatic number of some ($P_3\\cup P_2$)-free graphs","comments":"arXiv admin note: substantial text overlap with arXiv:2308.05442,\n  arXiv:2308.08768","journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A hereditary class $\\cal G$ of graphs is {\\em $\\chi$-bounded} if there is a\n{\\em $\\chi$-binding function}, say $f$, such that $\\chi(G)\\le f(\\omega(G))$ for\nevery $G\\in\\cal G$, where $\\chi(G)(\\omega(G))$ denotes the chromatic (clique)\nnumber of $G$. It is known that for every $(P_3\\cup P_2)$-free graph $G$,\n$\\chi(G)\\le \\frac{1}{6}\\omega(G)(\\omega(G)+1)(\\omega(G)+2)$ \\cite{BA18}, and\nthe class of $(2K_2, 3K_1)$-free graphs does not admit a linear $\\chi$-binding\nfunction\\cite{BBS19}. In this paper, we prove that (\\romannumeral 1)\n$\\chi(G)\\le2\\omega(G)$ if $G$ is ($P_3\\cup P_2$, kite)-free, (\\romannumeral 2)\n$\\chi(G)\\le\\omega^2(G)$ if $G$ is ($P_3\\cup P_2$, hammer)-free, (\\romannumeral\n3) $\\chi(G)\\le\\frac{3\\omega^2(G)+\\omega(G)}{2}$ if $G$ is ($P_3\\cup P_2,\nC_5$)-free. Furthermore, we also discuss $\\chi$-binding functions for $(P_3\\cup\nP_2, K_4)$-free graphs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:14:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Rui",""],["Li","Jinfeng",""],["Wu","Di",""]]}
{"id":"2308.15249","submitter":"Michele Gozzelino","authors":"Michele Gozzelino, Salvatore Micalizio, Claudio E. Calosso, Jacopo\n  Belfi, Adalberto Sapia, Marina Gioia and Filippo Levi","title":"A pulsed optically pumped Rb clock with a frequency stability below\n  10-15","comments":null,"journal-ref":"The Version of Record is available online on Scientific Reports\n  (2023)13:12974 (www.nature.com/scientificreports)","doi":"10.1038/s41598-023-39942-5","report-no":null,"categories":"physics.atom-ph physics.ins-det physics.optics","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We present the frequency stability performances of a vapor cell Rb clock\nbased on the pulsed optically pumping (POP) technique. The clock has been\ndeveloped in the frame of a collaboration between INRIM and Leonardo SpA,\naiming to realize a space-qualified POP frequency standard. The results here\nreported were obtained with an engineered physics package, specifically\ndesigned for space applications, joint to laboratory-grade optics and\nelectronics. The measured frequency stability expressed in terms of Allan\ndeviation is $1.2 \\times 10^{-13}$ at 1 s and achieves the value of $6 \\times\n10^{-16}$ for integration times of 40000 s (drift removed). This is, to our\nknowledge, a record result for a vapor-cell frequency standard. In the paper,\nwe show that in order to get this result, a careful stabilization of microwave\nand laser pulses is required.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:15:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gozzelino","Michele",""],["Micalizio","Salvatore",""],["Calosso","Claudio E.",""],["Belfi","Jacopo",""],["Sapia","Adalberto",""],["Gioia","Marina",""],["Levi","Filippo",""]]}
{"id":"2308.15250","submitter":"Hadrien Hendrikx","authors":"Hadrien Hendrikx, Paul Mangold and Aur\\'elien Bellet","title":"The Relative Gaussian Mechanism and its Application to Private Gradient\n  Descent","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Gaussian Mechanism (GM), which consists in adding Gaussian noise to a\nvector-valued query before releasing it, is a standard privacy protection\nmechanism. In particular, given that the query respects some L2 sensitivity\nproperty (the L2 distance between outputs on any two neighboring inputs is\nbounded), GM guarantees R\\'enyi Differential Privacy (RDP). Unfortunately,\nprecisely bounding the L2 sensitivity can be hard, thus leading to loose\nprivacy bounds. In this work, we consider a Relative L2 sensitivity assumption,\nin which the bound on the distance between two query outputs may also depend on\ntheir norm. Leveraging this assumption, we introduce the Relative Gaussian\nMechanism (RGM), in which the variance of the noise depends on the norm of the\noutput. We prove tight bounds on the RDP parameters under relative L2\nsensitivity, and characterize the privacy loss incurred by using\noutput-dependent noise. In particular, we show that RGM naturally adapts to a\nlatent variable that would control the norm of the output. Finally, we\ninstantiate our framework to show tight guarantees for Private Gradient\nDescent, a problem that naturally fits our relative L2 sensitivity assumption.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:16:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hendrikx","Hadrien",""],["Mangold","Paul",""],["Bellet","Aur\u00e9lien",""]]}
{"id":"2308.15251","submitter":"Garyfallos Konstantinoudis Dr","authors":"Garyfallos Konstantinoudis, Anthony Hauser, and Julien Riou","title":"Bayesian ensemble modelling to monitor excess deaths during summer 2022\n  in Switzerland","comments":"43 pages, 11 figures, 18 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Switzerland experienced one of the warmest summers during 2022. Extreme heat\nhas been linked to increased mortality. Monitoring the mortality burden\nattributable to extreme heat is crucial to inform policies, such as heat\nwarnings, and prevent heat-related deaths. In this study, we evaluate excess\nmortality during summer 2022, identify vulnerable populations and estimate\ntemperature thresholds for heat warnings. We use nationwide mortality and\npopulation data in Switzerland during 2011-2022 by age, sex, day and canton. We\ndevelop a Bayesian ensemble modelling approach with dynamic population to\npredict expected mortality in summer 2022 and calculate excess by comparing\nexpected with observed mortality. We account for covariates associated with\nmortality such as ambient temperature, national holidays and spatiotemporal\nrandom effects to improve predictions. After accounting for the effect of the\nCOVID-19 pandemic, we found a 3% (95% credible interval: 0%-6%) excess\nmortality during summer 2022. We observed a total of 456 (5-891) excess deaths\nduring summer 2022 in people older than 80 years. There was weak evidence of\nexcess mortality in the other age groups. The highest excess mortality was\nobserved in July (12%: 4%-19%), the hottest month in 2022. We also found that\nfor heatwaves longer than four days, the minimum excess mortality temperature\nthreshold in the oldest age group is the 70th percentile of the temperature. To\nreduce future summer excess mortality in Switzerland, we propose targeted heat\nwarnings to older populations and reducing the temperature threshold when\nweather forecasts predict periods of extreme heat of four days or longer.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:17:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Konstantinoudis","Garyfallos",""],["Hauser","Anthony",""],["Riou","Julien",""]]}
{"id":"2308.15252","submitter":"Daniele Dorigoni Dr","authors":"Daniele Dorigoni and Paolo Vallarino","title":"Exceptionally simple integrated correlators in $\\mathcal{N}=4$\n  supersymmetric Yang-Mills theory","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Supersymmetric localisation has led to several modern developments in the\nstudy of integrated correlators in $\\mathcal{N}=4$ supersymmetric Yang-Mills\n(SYM) theory. In particular, exact results have been derived for certain\nintegrated four-point functions of superconformal primary operators in the\nstress tensor multiplet valid for all classical gauge groups, $SU(N)$, $SO(N)$,\nand $USp(2N)$, and for all values of the complex coupling,\n$\\tau=\\theta/(2\\pi)+4\\pi i/g^2_{_{YM}}$. In this work we extend this analysis\nand provide a unified two-dimensional lattice sum representation for all simple\ngauge groups, in particular for the exceptional series $E_r$ (with $r=6,7,8$),\n$F_4$ and $G_2$. These expressions are manifestly covariant under\nGoddard-Nuyts-Olive duality which for $F_4$ and $G_2$ is given by particular\nFuchsian groups. We show that the perturbation expansion of these integrated\ncorrelators is universal in the sense that it can be written as a single\nfunction of three parameters, called Vogel parameters, and a suitable 't\nHooft-like coupling. To obtain the perturbative expansion for the integrated\ncorrelator with a given gauge group we simply need substituting in this\nuniversal expression specific values for the Vogel parameters. At the\nnon-perturbative level we conjecture a formula for the one-instanton Nekrasov\npartition function with simple gauge group and general $\\Omega$-deformation\nbackground. We check that our expression reduces in various limits to known\nresults and that it produces, via supersymmetric localisation, the same\none-instanton contribution to the integrated correlator as the one derived from\nthe lattice sum. Finally, we consider the action of the hyperbolic Laplace\noperator in $\\tau$ on the integrated correlators with exceptional gauge groups\nand derive inhomogeneous Laplace equations very similar to the ones previously\nobtained for classical gauge groups.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:18:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dorigoni","Daniele",""],["Vallarino","Paolo",""]]}
{"id":"2308.15253","submitter":"Yu Xu","authors":"Yu Xu, Yunsong Ning, Zhizhen Qin, Yao Teng, Changqing Feng, Jian Tang,\n  Yu Chen, Yoshinori Fukao, Satoshi Mihara, and Kou Oishi","title":"Development of a SciFi-based beam monitor for COMET","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ins-det hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  COMET is a leading experiment to search for coherent conversion of $\\mu^-\n\\mathrm{N}\\to e^- \\mathrm{N}$ with a high-intensity pulsed muon beamline,\nproduced by the innovative slow extraction techniques. Therefore, it is\ncritical to measure the characteristics of the muon beam. We set up a Muon Beam\nMonitor (MBM), where scintillation fibers (SciFi) weaved in the cross shape are\ncoupled to silicon photomultipliers (SiPM), to measure the spatial profile and\ntiming structure of the extracted muon beam for COMET. The MBM detector has\nbeen tested successfully with a proton beamline in China Spallation Neutron\nSource (CSNS) and taken data with good performance in the commissioning run\ncalled COMET Phase-$\\alpha$. Experience of the MBM development, such as the\nmechanical structure and electronics readout, and its beam measurement results\nwill be shared.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:25:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xu","Yu",""],["Ning","Yunsong",""],["Qin","Zhizhen",""],["Teng","Yao",""],["Feng","Changqing",""],["Tang","Jian",""],["Chen","Yu",""],["Fukao","Yoshinori",""],["Mihara","Satoshi",""],["Oishi","Kou",""]]}
{"id":"2308.15254","submitter":"Boxue Zheng","authors":"Bo Xue Zheng, Zhi Wen Cai, Pei Dong Zhao, Xiao Yang Xu, Tak Shing\n  Chan, Peng Yu","title":"A Generalized Density Dissipation for Weakly-compressible SPH","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The weakly compressible Smoothed Particle Hydrodynamics (SPH) is known to\nsuffer from the pressure oscillation, which would undermine the simulation\nstability and accuracy. To address this issue, we propose a generalized density\ndissipation scheme suitable for both single-phase and multiphase flow\nsimulations. Our approach consists of two components. Firstly, we replace the\nbasic density dissipation with the density increment dissipation to enable\nnumerical dissipation crossing the interfaces of different fluids in multiphase\nflow. Secondly, based on the dissipation volume conservation, we utilize\ndissipation volume correction factor (VCF) to stabilize the simulations for\nmultiphase flows with large density ratio. We demonstrate the accuracy,\nstability, and robustness of our method through four three-dimensional\nbenchmarks, i.e., the sloshing under external excitations, the single and\ndouble bubbles rising, Rayleigh-Taylor instability, and Kelvin Helmholtz\ninstability. Additionally, our study reveals the relationship between SPH with\nthe density dissipation and the approximate Riemann solver.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:26:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zheng","Bo Xue",""],["Cai","Zhi Wen",""],["Zhao","Pei Dong",""],["Xu","Xiao Yang",""],["Chan","Tak Shing",""],["Yu","Peng",""]]}
{"id":"2308.15255","submitter":"Fu-Lai Wang","authors":"Fu-Lai Wang and Xiang Liu","title":"New type of doubly charmed molecular pentaquarks containing most strange\n  quarks: Mass spectra, radiative decays, and magnetic moments","comments":"16 pages, 1 figure, and 7 tables. arXiv admin note: text overlap with\n  arXiv:2307.08276, arXiv:2210.02809","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we first study the mass spectra of the\n$\\Omega_{c}^{(*)}{D}_s^{(*)}$-type doubly charmed molecular pentaquark\ncandidates, where the one-boson-exchange model is adopted by considering both\nthe $S$-$D$ wave mixing effect and the coupled channel effect. Our findings\nindicate that the $\\Omega_{c}{D}_s^*$ state with $J^P={1}/{2}^{-}$, the\n$\\Omega_{c}^*{D}_s^*$ state with $J^P={1}/{2}^{-}$, and the\n$\\Omega_{c}^*{D}_s^*$ state with $J^P={3}/{2}^{-}$ can be considered as the\nmost promising doubly charmed molecular pentaquark candidates, and the\n$\\Omega_{c}{D}_s$ state with $J^P={1}/{2}^{-}$, the $\\Omega_{c}^*{D}_s$ state\nwith $J^P={3}/{2}^{-}$, and the $\\Omega_{c}{D}_s^*$ state with\n$J^P={3}/{2}^{-}$ are the possible doubly charmed molecular pentaquark\ncandidates. Furthermore, we further explore the radiative decays and the\nmagnetic moments of the most promising doubly charmed molecular pentaquark\ncandidates in the constituent quark model. As a crucial aspect of spectroscopy,\nthe information of the radiative decays and the magnetic moments can provide\nthe valuable clues to reflect their inner structures. With the accumulation of\nhigher statistical data at the Large Hadron Collider, we propose that the LHCb\nCollaboration should focus on the problem of searching for these predicted\ndoubly charmed molecular pentaquark candidates containing most strange quarks\nin the coming years.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:29:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Fu-Lai",""],["Liu","Xiang",""]]}
{"id":"2308.15256","submitter":"Ji-Hoon Kim","authors":"Ji-Hoon Kim, Jaehun Kim, Joon Son Chung","title":"Let There Be Sound: Reconstructing High Quality Speech from Silent\n  Videos","comments":"10 pages, 2 figures, 5 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.AS cs.AI cs.LG cs.SD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The goal of this work is to reconstruct high quality speech from lip motions\nalone, a task also known as lip-to-speech. A key challenge of lip-to-speech\nsystems is the one-to-many mapping caused by (1) the existence of homophenes\nand (2) multiple speech variations, resulting in a mispronounced and\nover-smoothed speech. In this paper, we propose a novel lip-to-speech system\nthat significantly improves the generation quality by alleviating the\none-to-many mapping problem from multiple perspectives. Specifically, we\nincorporate (1) self-supervised speech representations to disambiguate\nhomophenes, and (2) acoustic variance information to model diverse speech\nstyles. Additionally, to better solve the aforementioned problem, we employ a\nflow based post-net which captures and refines the details of the generated\nspeech. We perform extensive experiments and demonstrate that our method\nachieves the generation quality close to that of real human utterance,\noutperforming existing methods in terms of speech naturalness and\nintelligibility by a large margin. Synthesised samples are available at the\nanonymous demo page: https://mm.kaist.ac.kr/projects/LTBS.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:30:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kim","Ji-Hoon",""],["Kim","Jaehun",""],["Chung","Joon Son",""]]}
{"id":"2308.15257","submitter":"Martin Hernandez Salinas","authors":"Martin Hernandez, Enrique Zuazua","title":"Uniform Turnpike Property and Singular Limits","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Motivated by singular limits for long-time optimal control problems, we\ninvestigate a class of parameter-dependent parabolic equations. First, we prove\na turnpike result, uniform with respect to the parameters within a suitable\nregularity class and under appropriate bounds. The main ingredient of our proof\nis the justification of the uniform exponential stabilization of the\ncorresponding Riccati equations, which is derived from the uniform null control\nproperties of the model. Then, we focus on a heat equation with rapidly\noscillating coefficients. In the one-dimensional setting, we obtain a uniform\nturnpike property with respect to the highly oscillatory heterogeneous medium.\nAfterward, we establish the homogenization of the turnpike property. Finally,\nour results are validated by numerical experiments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:34:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hernandez","Martin",""],["Zuazua","Enrique",""]]}
{"id":"2308.15258","submitter":"Patric Holmvall","authors":"Patric Holmvall and Annica M. Black-Schaffer","title":"Enhanced chiral edge currents and orbital magnetic moment in chiral\n  $d$-wave superconductors from mesoscopic finite-size effects","comments":"23 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.supr-con","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Chiral superconductors spontaneously break time-reversal symmetry and host\ntopologically protected edge modes, supposedly generating chiral edge currents\nwhich are typically taken as a characteristic fingerprint of chiral\nsuperconductivity. However, recent studies have shown that the total edge\ncurrent in two dimensions (2D) often vanishes for all chiral superconductors\nexcept for chiral $p$-wave, especially at low temperatures, thus severely\nimpeding potential experimental verification and characterization of these\nsuperconductors. In this work, we use quasiclassical theory of\nsuperconductivity to study mesoscopic disc-schaped chiral $d$-wave\nsuperconductors. We find that mesoscopic finite-size effects cause a dramatic\nenhancement of the total charge current and orbital magnetic moment (OMM), even\nat low temperatures. We study how these quantities scale with temperature,\nspontaneous Meissner screening, and system radius $\\mathcal{R} \\in\n[5,200]\\xi_0$ with superconducting coherence length $\\xi_0$. We find a general\n$1/\\mathcal{R}$ scaling in the total charge current and OMM for sufficiently\nlarge systems, but this breaks down in small systems, instead producing a local\nmaximum at $\\mathcal{R} \\approx 10{\\text{--}}20\\xi_0$ due to mesoscopic\nfinite-size effects. These effects also cause a spontaneous charge-current\nreversal opposite to the chirality below $\\mathcal{R} < 10\\xi_0$. Our work\nhighlights mesoscopic systems as a route to experimentally verify chiral\n$d$-wave superconductivity, measurable with magnetometry.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:37:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Holmvall","Patric",""],["Black-Schaffer","Annica M.",""]]}
{"id":"2308.15259","submitter":"Julia Wunder","authors":"Julia Wunder, Andreas Kurtz, Christian Eichenm\\\"uller, Freya Gassmann,\n  Zinaida Benenson","title":"Shedding Light on CVSS Scoring Inconsistencies: A User-Centric Study on\n  Evaluating Widespread Security Vulnerabilities","comments":"To appear in the Proceedings of the IEEE Symposium on Security and\n  Privacy (S&P) 2024","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The Common Vulnerability Scoring System (CVSS) is a popular method for\nevaluating the severity of vulnerabilities in vulnerability management. In the\nevaluation process, a numeric score between 0 and 10 is calculated, 10 being\nthe most severe (critical) value. The goal of CVSS is to provide comparable\nscores across different evaluators. However, previous works indicate that CVSS\nmight not reach this goal: If a vulnerability is evaluated by several analysts,\ntheir scores often differ. This raises the following questions: Are CVSS\nevaluations consistent? Which factors influence CVSS assessments? We\nsystematically investigate these questions in an online survey with 196 CVSS\nusers. We show that specific CVSS metrics are inconsistently evaluated for\nwidespread vulnerability types, including Top 3 vulnerabilities from the ''2022\nCWE Top 25 Most Dangerous Software Weaknesses'' list. In a follow-up survey\nwith 59 participants, we found that for the same vulnerabilities from the main\nstudy, 68% of these users gave different severity ratings. Our study reveals\nthat most evaluators are aware of the problematic aspects of CVSS, but they\nstill see CVSS as a useful tool for vulnerability assessment. Finally, we\ndiscuss possible reasons for inconsistent evaluations and provide\nrecommendations on improving the consistency of scoring.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:37:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wunder","Julia",""],["Kurtz","Andreas",""],["Eichenm\u00fcller","Christian",""],["Gassmann","Freya",""],["Benenson","Zinaida",""]]}
{"id":"2308.15260","submitter":"Haoshu Cheng","authors":"Haoshu Cheng and Jie Huang","title":"Bearing-based Formation with Disturbance Rejection","comments":"6 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.MA cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper considers the problem of the bearing-based formation control with\ndisturbance rejection for a group of agents under the leader-follower\nstructure. The disturbances are in the form of a trigonometric polynomial with\narbitrary unknown amplitudes, unknown initial phases, and known or unknown\nfrequencies. For the case of the known frequencies, we employ the canonical\ninternal model to solve the problem, and, for the case of the unknown\nfrequencies, we combine the canonical internal model and {some} distributed\nadaptive control technique to deal with the problem. It is noted that the\nexisting results can only handle constant input disturbances by continuous\ncontrol laws or disturbances with known {bounds} by discontinuous control laws.\nThe first case is a special case of our result. The second case cannot cover\nour results because the bound of our disturbance is unknown. Moreover, our\ncontrol law is smooth.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:40:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheng","Haoshu",""],["Huang","Jie",""]]}
{"id":"2308.15261","submitter":"Markus Braden","authors":"Sebastian Biesenkamp, Karin Schmalzl, Petra Becker, Ladislav Bohaty,\n  and Markus Braden","title":"Multiferroic domain relaxation in (NH4)2[FeCl5(H2O)]","comments":"10 pages, 9 Figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The molecular compound (NH4)2[FeCl5(H2O)] is a type-II multiferroic material,\nin which incommensurate cycloidal order directly induces ferroelectric\npolarization. The multiferroic domain kinetics in (NH4)2[FeCl5(H2O)] were\nstudied by time-resolved neutron diffraction experiments utilizing neutron\npolarization analysis. The temperature and electric-field dependent\nmultiferroic relaxation obeys the simple combined Arrhenius-Merz law, which was\nreported to describe domain kinetics in the prototype multiferroics TbMnO3 and\nNaFeGe2O6. However, the characteristic time scale of the multiferroic\nrelaxation is considerably larger than those in TbMnO3 or NaFeGe2O6.\nTemperature-dependent diffraction on (NH4)2[FeCl5(H2O)] reveals the emergence\nof higher-order and commensurate magnetic contributions upon cooling in the\nmultiferroic phase in zero field. The good agreement with studies of\nhigher-harmonic contributions in the deuterated material indicates that the\nisotopes only posses a minor impact on the magnetic ordering. But in contrast\nto similar observations in multiferroic MnWO4, this anharmonic modification of\nmagnetic ordering does not depin multiferroic domain walls or alter the\ntemperature dependence of the multiferroic relaxation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:41:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Biesenkamp","Sebastian",""],["Schmalzl","Karin",""],["Becker","Petra",""],["Bohaty","Ladislav",""],["Braden","Markus",""]]}
{"id":"2308.15262","submitter":"Yuli Zhou","authors":"Yung-Hsin Chen and Yuli Zhou","title":"Enhancing OCR Performance through Post-OCR Models: Adopting Glyph\n  Embedding for Improved Correction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The study investigates the potential of post-OCR models to overcome\nlimitations in OCR models and explores the impact of incorporating glyph\nembedding on post-OCR correction performance. In this study, we have developed\nour own post-OCR correction model. The novelty of our approach lies in\nembedding the OCR output using CharBERT and our unique embedding technique,\ncapturing the visual characteristics of characters. Our findings show that\npost-OCR correction effectively addresses deficiencies in inferior OCR models,\nand glyph embedding enables the model to achieve superior results, including\nthe ability to correct individual words.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:41:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Yung-Hsin",""],["Zhou","Yuli",""]]}
{"id":"2308.15263","submitter":"Han Hong","authors":"Han Hong, Haizhong Li and Meng Zhang","title":"Asymptotic Plateau problem via equidistant hyperplanes","comments":"pages 31, comments are welcomed","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We show the existence of a complete, strictly locally convex hypersurface\nwithin $\\mathbb{H}^{n+1}$ that adheres to a curvature equation applicable to a\nbroad range of curvature functions. This hypersurface possesses a prescribed\nasymptotic boundary at infinity and takes the form of a geodesic graph over a\nsmooth bounded domain $\\Omega$ at infinity. It is approximated by the shape of\ngeodesic graphs whose boundaries rest upon equidistant hyperplanes. Through\nthis procedure, we establish an alternative method for constructing solutions\nto the asymptotic Plateau problem. The resulting solutions may differ from the\nclassical ones, particularly in cases where uniqueness cannot be assured.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:43:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hong","Han",""],["Li","Haizhong",""],["Zhang","Meng",""]]}
{"id":"2308.15264","submitter":"Sangita Swapnasrita","authors":"Charlotte A Veser, Aur\\'elie MF Carlier, Silvia M Mih\\u{a}il\\u{a},\n  Sangita Swapnasrita","title":"Embracing Sex-specific Differences in Engineered Kidney Models for\n  Enhanced Biological Understanding","comments":"44 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.TO","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In vitro models play a crucial role in advancing our understanding of\nbiological processes, disease mechanisms, and developing screening platforms\nfor drug discovery. Kidneys play an instrumental role in transport and\nelimination of drugs and toxins. However, despite the well-established\npatient-to-patient differences in kidney function and disease manifestation,\nprogression and prognostic, few studies take this variability into\nconsideration. In particular, the discrepancies between female and male biology\nwarrants a better representation within kidney in vitro models. The omission of\nsex as a biological variable poses the significant risk of overlooking\nsex-specific mechanisms in health and disease and potential differences in drug\nefficacy and toxicity between males and females. This review aims to highlight\nthe importance of incorporating sex dimorphism in kidney in vitro models by\nexamining the sexual characteristics in the context of the current\nstate-of-the-art. Furthermore, this review underscores opportunities for\nimproving kidney models by incorporating sex-specific traits. Ultimately, this\nroadmap to incorporating sex-dimorphism in kidney in vitro models will\nfacilitate the creation of better models for studying sex-specific mechanisms\nin the kidney and their impact on drug efficacy and safety.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:48:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Veser","Charlotte A",""],["Carlier","Aur\u00e9lie MF",""],["Mih\u0103il\u0103","Silvia M",""],["Swapnasrita","Sangita",""]]}
{"id":"2308.15265","submitter":"Maria Soledad Pera","authors":"Garrett Allen, Katherine Landau Wright, Jerry Alan Fails, Casey\n  Kennington, Maria Soledad Pera","title":"A Multi-Perspective Learning to Rank Approach to Support Children's\n  Information Seeking in the Classroom","comments":"Extended version of the manuscript to appear in proceedings of the\n  22nd IEEE/WIC International Conference on Web Intelligence and Intelligent\n  Agent Technology","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IR","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We introduce a novel re-ranking model that aims to augment the functionality\nof standard search engines to support classroom search activities for children\n(ages 6 to 11). This model extends the known listwise learning-to-rank\nframework by balancing risk and reward. Doing so enables the model to\nprioritize Web resources of high educational alignment, appropriateness, and\nadequate readability by analyzing the URLs, snippets, and page titles of Web\nresources retrieved by a given mainstream search engine. Experimental results,\nincluding an ablation study and comparisons with existing baselines, showcase\nthe correctness of the proposed model. The outcomes of this work demonstrate\nthe value of considering multiple perspectives inherent to the classroom\nsetting, e.g., educational alignment, readability, and objectionability, when\napplied to the design of algorithms that can better support children's\ninformation discovery.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:50:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Allen","Garrett",""],["Wright","Katherine Landau",""],["Fails","Jerry Alan",""],["Kennington","Casey",""],["Pera","Maria Soledad",""]]}
{"id":"2308.15266","submitter":"Tim Meinhardt","authors":"Tim Meinhardt and Matt Feiszli and Yuchen Fan and Laura Leal-Taixe and\n  Rakesh Ranjan","title":"NOVIS: A Case for End-to-End Near-Online Video Instance Segmentation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Until recently, the Video Instance Segmentation (VIS) community operated\nunder the common belief that offline methods are generally superior to a frame\nby frame online processing. However, the recent success of online methods\nquestions this belief, in particular, for challenging and long video sequences.\nWe understand this work as a rebuttal of those recent observations and an\nappeal to the community to focus on dedicated near-online VIS approaches. To\nsupport our argument, we present a detailed analysis on different processing\nparadigms and the new end-to-end trainable NOVIS (Near-Online Video Instance\nSegmentation) method. Our transformer-based model directly predicts\nspatio-temporal mask volumes for clips of frames and performs instance tracking\nbetween clips via overlap embeddings. NOVIS represents the first near-online\nVIS approach which avoids any handcrafted tracking heuristics. We outperform\nall existing VIS methods by large margins and provide new state-of-the-art\nresults on both YouTube-VIS (2019/2021) and the OVIS benchmarks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:51:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Meinhardt","Tim",""],["Feiszli","Matt",""],["Fan","Yuchen",""],["Leal-Taixe","Laura",""],["Ranjan","Rakesh",""]]}
{"id":"2308.15267","submitter":"Goshgar Ismayilov","authors":"Goshgar Ismayilov, Can Ozturan","title":"Trustless Privacy-Preserving Data Aggregation on Ethereum with Hypercube\n  Network Topology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The privacy-preserving data aggregation is a critical problem for many\napplications where multiple parties need to collaborate with each other\nprivately to arrive at certain results. Blockchain, as a database shared across\nthe network, provides an underlying platform on which such aggregations can be\ncarried out with a decentralized manner. Therefore, in this paper, we have\nproposed a scalable privacy-preserving data aggregation protocol for summation\non the Ethereum blockchain by integrating several cryptographic primitives\nincluding commitment scheme, asymmetric encryption and zero-knowledge proof\nalong with the hypercube network topology. The protocol consists of four stages\nas contract deployment, user registration, private submission and proof\nverification. The analysis of the protocol is made with respect to two main\nperspectives as security and scalability including computational,\ncommunicational and storage overheads. In the paper, the zero-knowledge proof,\nsmart contract and web user interface models for the protocol are provided. We\nhave performed an experimental study in order to identify the required gas\ncosts per individual and per system. The general formulation is provided to\ncharacterize the changes in gas costs for the increasing number of users. The\nzero-knowledge proof generation and verification times are also measured.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:51:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ismayilov","Goshgar",""],["Ozturan","Can",""]]}
{"id":"2308.15268","submitter":"Julia Ashkanazy","authors":"Julia Ashkanazy, Ariana Spalter, Joe Hays, Laura Hiatt, Roxana\n  Leontie, C. Glen Henshaw","title":"Collision-Free Inverse Kinematics Through QP Optimization (iKinQP)","comments":"9 pages, 8 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Robotic manipulators are often designed with more actuated degrees-of-freedom\nthan required to fully control an end effector's position and orientation.\nThese \"redundant\" manipulators can allow infinite joint configurations that\nsatisfy a particular task-space position and orientation, providing more\npossibilities for the manipulator to traverse a smooth collision-free\ntrajectory. However, finding such a trajectory is non-trivial because the\ninverse kinematics for redundant manipulators cannot typically be solved\nanalytically. Many strategies have been developed to tackle this problem,\nincluding Jacobian pseudo-inverse method, rapidly-expanding-random tree (RRT)\nmotion planning, and quadratic programming (QP) based methods. Here, we present\na flexible inverse kinematics-based QP strategy (iKinQP). Because it is\nindependent of robot dynamics, the algorithm is relatively light-weight, and\nable to run in real-time in step with torque control. Collisions are defined as\nkinematic trees of elementary geometries, making the algorithm agnostic to the\nmethod used to determine what collisions are in the environment. Collisions are\ntreated as hard constraints which guarantees the generation of collision-free\ntrajectories. Trajectory smoothness is accomplished through the QP\noptimization. Our algorithm was evaluated for computational efficiency,\nsmoothness, and its ability to provide trackable trajectories. It was shown\nthat iKinQP is capable of providing smooth, collision-free trajectories at\nreal-time rates.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 12:54:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ashkanazy","Julia",""],["Spalter","Ariana",""],["Hays","Joe",""],["Hiatt","Laura",""],["Leontie","Roxana",""],["Henshaw","C. Glen",""]]}
{"id":"2308.15269","submitter":"Hidefumi Matsuda Dr","authors":"Hidefumi Matsuda, and Xu-Guang Huang","title":"Simulation of 3+1D glasma in Milne coordinates I: Development of the\n  framework","comments":"14 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a new numerical method for $3+1$D glasma simulation using Milne\ncoordinates. We formulate the classical Yang-Mills field and $3$D classical\ncolor current on a lattice at the initial proper time, specified as a moment\njust before the collision of the two nuclei. By solving the evolution\nequations, we extract observables of the $3$D glasma at later times. We\ndemonstrate the efficiency of our method in terms of numerical cost and apply\nit to the central collisions of Au-Au. We also discuss possible further\nimprovements of our method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:38:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Matsuda","Hidefumi",""],["Huang","Xu-Guang",""]]}
{"id":"2308.15270","submitter":"Marek Stryjczyk","authors":"A. Jaries, M. Stryjczyk, A. Kankainen, L. Al Ayoubi, O. Beliuskina, P.\n  Delahaye, T. Eronen, M. Flayol, Z. Ge, W. Gins, M. Hukkanen, D. Kahl, S.\n  Kujanp\\\"a\\\"a, D. Kumar, I.D. Moore, M. Mougeot, D.A. Nesterenko, S. Nikas, H.\n  Penttil\\\"a, D. Pitman-Weymouth, I. Pohjalainen, A. Raggio, W.\n  Rattanasakuldilok, A. de Roubin, J. Ruotsalainen, V. Virtanen","title":"High-precision Penning-trap mass measurements of Cd and In isotopes at\n  JYFLTRAP remove the fluctuations in the two-neutron separation energies","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We report on the first direct mass measurements of the $^{118,119}$Cd and\n$^{117-119}$In isotopes performed at the Ion Guide Isotope Separator On-Line\nfacility using the JYFLTRAP double Penning trap mass spectrometer. The masses\nof $^{117}$In and $^{118}$Cd isotopes are in agreement with the literature,\nwhile $^{118,119}$In and $^{119}$Cd differ from literature by 49, 13 and 85 keV\n(6.1, 1.9 and 2.1 standard deviations), respectively. The excitation energy of\nthe $^{118}$In first isomeric state, $E_x = 40.3(25)$ keV, was determined for\nthe first time. The updated mass values removed the fluctuations observed in\nthe two-neutron separation energies and lead to a smoother linear decrease of\nboth isotopic chains. The $\\log(ft)$ value for the $^{118}$Cd decay is also\nfound to increase from 3.93(6) to 4.089(8). The reported results indicate an\nabsence of significant structural changes around $N=70$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:01:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jaries","A.",""],["Stryjczyk","M.",""],["Kankainen","A.",""],["Ayoubi","L. Al",""],["Beliuskina","O.",""],["Delahaye","P.",""],["Eronen","T.",""],["Flayol","M.",""],["Ge","Z.",""],["Gins","W.",""],["Hukkanen","M.",""],["Kahl","D.",""],["Kujanp\u00e4\u00e4","S.",""],["Kumar","D.",""],["Moore","I. D.",""],["Mougeot","M.",""],["Nesterenko","D. A.",""],["Nikas","S.",""],["Penttil\u00e4","H.",""],["Pitman-Weymouth","D.",""],["Pohjalainen","I.",""],["Raggio","A.",""],["Rattanasakuldilok","W.",""],["de Roubin","A.",""],["Ruotsalainen","J.",""],["Virtanen","V.",""]]}
{"id":"2308.15271","submitter":"Yuri Tschinkel","authors":"Ivan Cheltsov, Yuri Tschinkel, Zhijia Zhang","title":"Equivariant geometry of the Segre cubic and the Burkhardt quartic","comments":"38 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study linearizability and stable linearizability of actions of finite\ngroups on the Segre cubic and Burkhardt quartic, using techniques from group\ncohomology, birational rigidity, and the Burnside formalism.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:01:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheltsov","Ivan",""],["Tschinkel","Yuri",""],["Zhang","Zhijia",""]]}
{"id":"2308.15272","submitter":"Hao Wen","authors":"Hao Wen, Yuanchun Li, Guohong Liu, Shanhui Zhao, Tao Yu, Toby Jia-Jun\n  Li, Shiqi Jiang, Yunhao Liu, Yaqin Zhang, Yunxin Liu","title":"Empowering LLM to use Smartphone for Intelligent Task Automation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Mobile task automation is an attractive technique that aims to enable\nvoice-based hands-free user interaction with smartphones. However, existing\napproaches suffer from poor scalability due to the limited language\nunderstanding ability and the non-trivial manual efforts required from\ndevelopers or end-users. The recent advance of large language models (LLMs) in\nlanguage understanding and reasoning inspires us to rethink the problem from a\nmodel-centric perspective, where task preparation, comprehension, and execution\nare handled by a unified language model. In this work, we introduce AutoDroid,\na mobile task automation system that can handle arbitrary tasks on any Android\napplication without manual efforts. The key insight is to combine the\ncommonsense knowledge of LLMs and domain-specific knowledge of apps through\nautomated dynamic analysis. The main components include a functionality-aware\nUI representation method that bridges the UI with the LLM, exploration-based\nmemory injection techniques that augment the app-specific domain knowledge of\nLLM, and a multi-granularity query optimization module that reduces the cost of\nmodel inference. We integrate AutoDroid with off-the-shelf LLMs including\nonline GPT-4/GPT-3.5 and on-device Vicuna, and evaluate its performance on a\nnew benchmark for memory-augmented Android task automation with 158 common\ntasks. The results demonstrated that AutoDroid is able to precisely generate\nactions with an accuracy of 90.9%, and complete tasks with a success rate of\n71.3%, outperforming the GPT-4-powered baselines by 36.4% and 39.7%. The demo,\nbenchmark suites, and source code of AutoDroid will be released at\nhttps://autodroid-sys.github.io/.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:02:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wen","Hao",""],["Li","Yuanchun",""],["Liu","Guohong",""],["Zhao","Shanhui",""],["Yu","Tao",""],["Li","Toby Jia-Jun",""],["Jiang","Shiqi",""],["Liu","Yunhao",""],["Zhang","Yaqin",""],["Liu","Yunxin",""]]}
{"id":"2308.15273","submitter":"Seongha Eom","authors":"Seongha Eom, Namgyu Ho, Jaehoon Oh and Se-Young Yun","title":"Cross-Modal Retrieval Meets Inference:Improving Zero-Shot Classification\n  with Cross-Modal Retrieval","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Contrastive language-image pre-training (CLIP) has demonstrated remarkable\nzero-shot classification ability, namely image classification using novel text\nlabels. Existing works have attempted to enhance CLIP by fine-tuning on\ndownstream tasks, but these have inadvertently led to performance degradation\non unseen classes, thus harming zero-shot generalization. This paper aims to\naddress this challenge by leveraging readily available image-text pairs from an\nexternal dataset for cross-modal guidance during inference. To this end, we\npropose X-MoRe, a novel inference method comprising two key steps: (1)\ncross-modal retrieval and (2) modal-confidence-based ensemble. Given a query\nimage, we harness the power of CLIP's cross-modal representations to retrieve\nrelevant textual information from an external image-text pair dataset. Then, we\nassign higher weights to the more reliable modality between the original query\nimage and retrieved text, contributing to the final prediction. X-MoRe\ndemonstrates robust performance across a diverse set of tasks without the need\nfor additional training, showcasing the effectiveness of utilizing cross-modal\nfeatures to maximize CLIP's zero-shot ability.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:02:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Eom","Seongha",""],["Ho","Namgyu",""],["Oh","Jaehoon",""],["Yun","Se-Young",""]]}
{"id":"2308.15274","submitter":"Tatiana Koryukova","authors":"T. A. Koryukova (ASC LPI), A. B. Pushkarev (CrAO, ASC LPI), S.\n  Kiehlmann (FORTH, UoC), A. C. S. Readhead (Caltech)","title":"Multiple imaging of the quasar 2005+403 formed by anisotropic scattering","comments":"16 pages, 11 figures, 8 tables, submitted to MNRAS","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.HE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report on the low Galactic latitude ($b=4.3^\\circ$) quasar 2005$+$403, the\nsecond active galactic nuclei, in which we detected a rare phenomenon of\nmultiple imaging induced by refractive-dominated scattering. The manifestation\nof this propagation effect is revealed at different frequencies ($\\lesssim8$\nGHz) and epochs of VLBA observations. The pattern formed by anisotropic\nscattering is stretched out along the line of constant Galactic latitude with a\nlocal $\\mathrm{PA}\\approx40^\\circ$ showing one-two sub-images, often on either\nside of the core. Analysing the multi-frequency VLBA data ranging from 1.4 to\n43.2 GHz, we found that both the angular size of the apparent core component\nand the separation between the primary and secondary core images follow a\n$\\lambda^2$ dependence, providing convincing evidence for a plasma scattering\norigin for the multiple imaging. Based on the OVRO long-term monitoring data at\n15 GHz obtained for 2005$+$403, we identified the characteristic flux density\nexcursions occurred in April-May 2019 and attributed to an extreme scattering\nevent (ESE) associated with the passage of a plasma lens across the line of\nsight. Modeling the ESE, we determined that the angular size of the screen is\n0.4 mas and it drifts with the proper motion of 4.4 mas yr$^{-1}$. Assuming\nthat the scattering screen is located in the highly turbulent Cygnus region,\nthe transverse linear size and speed of the lens with respect to the observer\nare 0.7 AU and 37 km s$^{-1}$, respectively.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:03:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Koryukova","T. A.","","ASC LPI"],["Pushkarev","A. B.","","CrAO, ASC LPI"],["Kiehlmann","S.","","FORTH, UoC"],["Readhead","A. C. S.","","Caltech"]]}
{"id":"2308.15275","submitter":"Vlad Serban","authors":"Nihar Gargava and Vlad Serban and Maryna Viazovska","title":"Moments of the number of points in a bounded set for number field\n  lattices","comments":"46 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT cs.IT math.DS math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We examine the moments of the number of lattice points in a fixed ball of\nvolume $V$ for lattices in Euclidean space which are modules over the ring of\nintegers of a number field $K$. In particular, denoting by $\\omega_K$ the\nnumber of roots of unity in $K$, we show that for lattices of large enough\ndimension the moments of the number of $\\omega_K$-tuples of lattice points\nconverge to those of a Poisson distribution of mean $V/\\omega_K$. This extends\nwork of Rogers for $\\mathbb{Z}$-lattices. What is more, we show that this\nconvergence can also be achieved by increasing the degree of the number field\n$K$ as long as $K$ varies within a set of number fields with uniform lower\nbounds on the absolute Weil height of non-torsion elements.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:06:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gargava","Nihar",""],["Serban","Vlad",""],["Viazovska","Maryna",""]]}
{"id":"2308.15276","submitter":"YongHao Wu","authors":"Yonghao Wu, Zheng Li, Jie M. Zhang, Mike Papadakis, Mark Harman, and\n  Yong Liu","title":"Large Language Models in Fault Localisation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Large Language Models (LLMs) have shown promise in multiple software\nengineering tasks including code generation, code summarisation, test\ngeneration and code repair. Fault localisation is essential for facilitating\nautomatic program debugging and repair, and is demonstrated as a highlight at\nChatGPT-4's launch event. Nevertheless, there has been little work\nunderstanding LLMs' capabilities for fault localisation in large-scale\nopen-source programs. To fill this gap, this paper presents an in-depth\ninvestigation into the capability of ChatGPT-3.5 and ChatGPT-4, the two\nstate-of-the-art LLMs, on fault localisation. Using the widely-adopted\nDefects4J dataset, we compare the two LLMs with the existing fault localisation\ntechniques. We also investigate the stability and explanation of LLMs in fault\nlocalisation, as well as how prompt engineering and the length of code context\naffect the fault localisation effectiveness. Our findings demonstrate that\nwithin a limited code context, ChatGPT-4 outperforms all the existing fault\nlocalisation methods. Additional error logs can further improve ChatGPT models'\nlocalisation accuracy and stability, with an average 46.9% higher accuracy over\nthe state-of-the-art baseline SmartFL in terms of TOP-1 metric. However,\nperformance declines dramatically when the code context expands to the\nclass-level, with ChatGPT models' effectiveness becoming inferior to the\nexisting methods overall. Additionally, we observe that ChatGPT's\nexplainability is unsatisfactory, with an accuracy rate of only approximately\n30%. These observations demonstrate that while ChatGPT can achieve effective\nfault localisation performance under certain conditions, evident limitations\nexist. Further research is imperative to fully harness the potential of LLMs\nlike ChatGPT for practical fault localisation applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:07:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wu","Yonghao",""],["Li","Zheng",""],["Zhang","Jie M.",""],["Papadakis","Mike",""],["Harman","Mark",""],["Liu","Yong",""]]}
{"id":"2308.15277","submitter":"Davide Ravasini","authors":"Davide Ravasini","title":"Generic uniformly continuous mappings on unbounded hyperbolic spaces","comments":"15 pages, 9 references","journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA math.GN math.MG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We consider a complete, unbounded, hyperbolic metric space $X$ and a concave,\nnonzero and nondecreasing function $\\omega:[0,+\\infty)\\to[0,+\\infty)$ with\n$\\omega(0)=0$ and study the space $\\mathcal{C}_\\omega(X)$ of uniformly\ncontinous self-mappings on $X$ whose modulus of continuity is bounded above by\n$\\omega$. We endow $\\mathcal{C}_\\omega(X)$ with the topology of uniform\nconvergence on bounded sets and prove that the modulus of continuity of the\ngeneric mapping in $\\mathcal{C}_\\omega(X)$, in the sense of Baire categories,\nis precisely $\\omega$. Some related results in spaces of bounded mappings and\nin the topology of pointwise convergence are also discussed. This note can be\nseen as a completion of various results due to F. Strobin, S. Reich, A.\nZaslavski, C. Bargetz and D. Thimm.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:09:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ravasini","Davide",""]]}
{"id":"2308.15278","submitter":"Bo Wang","authors":"Bo Wang, Franco Nori, Ze-Liang Xiang","title":"Quantum Phase Transitions in Optomechanical Systems","comments":"7 pages, 2 figures + Supplemental Material(7 pages, 2 figures)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this letter, we investigate the ground state properties of an\noptomechanical system consisting of a coupled cavity and mechanical modes. An\nexact solution is given when the ratio $\\eta$ between the cavity and mechanical\nfrequencies tends to infinity. This solution reveals a coherent photon\noccupation in the ground state by breaking continuous or discrete symmetries,\nexhibiting an equilibrium quantum phase transition (QPT). In the $U(1)$-broken\nphase, an unstable Goldstone mode can be excited. In the model featuring $Z_2$\nsymmetry, we discover the mutually (in the finite $\\eta$) or unidirectionally\n(in $\\eta \\rightarrow \\infty$) dependent relation between the squeezed vacuum\nof the cavity and mechanical modes. In particular, when the cavity is driven by\na squeezed field along the required squeezing parameter, it enables modifying\nthe region of $Z_2$-broken phase and significantly reducing the coupling\nstrength to reach QPTs. Furthermore, by coupling atoms to the cavity mode, the\nhybrid system can undergo a QPT at a hybrid critical point, which is\ncooperatively determined by the optomechanical and light-atom systems. These\nresults suggest that this optomechanical system complements other phase\ntransition models for exploring novel critical phenomena.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:09:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wang","Bo",""],["Nori","Franco",""],["Xiang","Ze-Liang",""]]}
{"id":"2308.15279","submitter":"Grigory Ivanov","authors":"Grigory M. Ivanov, Mariana S. Lopushanski, Grigorii E. Ivanov","title":"Shortest curves in proximally smooth sets: existence and uniqueness","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study shortest curves in proximally smooth subsets of a Hilbert space. We\nconsider a $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and\n$b$ satisfying $\\left|{a-b}\\right| < 2R.$ We provide a simple geometric\nalgorithm of constructing a curve inside $A$ connecting $a$ and $b$ whose\nlength is at most $2R \\arcsin\\frac{\\left|{a-b}\\right|}{2R},$ which corresponds\nto the shortest curve inside the model space -- a Euclidean sphere of radius\n$R$ passing through $a$ and $b.$ Using this construction, we show that there\nexists a unique shortest curve inside $A$ connecting $a$ and $b.$ This result\nis tight since two points of $A$ at distance $2R$ are not necessarily connected\nin $A;$ the bound on the length cannot be improved since the equality is\nattained on the Euclidean sphere of radius $R.$\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:09:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ivanov","Grigory M.",""],["Lopushanski","Mariana S.",""],["Ivanov","Grigorii E.",""]]}
{"id":"2308.15280","submitter":"Yiming Huang","authors":"Yiming Huang, Guole Liu, Yaoru Luo, Ge Yang","title":"ADFA: Attention-augmented Differentiable top-k Feature Adaptation for\n  Unsupervised Medical Anomaly Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The scarcity of annotated data, particularly for rare diseases, limits the\nvariability of training data and the range of detectable lesions, presenting a\nsignificant challenge for supervised anomaly detection in medical imaging. To\nsolve this problem, we propose a novel unsupervised method for medical image\nanomaly detection: Attention-Augmented Differentiable top-k Feature Adaptation\n(ADFA). The method utilizes Wide-ResNet50-2 (WR50) network pre-trained on\nImageNet to extract initial feature representations. To reduce the channel\ndimensionality while preserving relevant channel information, we employ an\nattention-augmented patch descriptor on the extracted features. We then apply\ndifferentiable top-k feature adaptation to train the patch descriptor, mapping\nthe extracted feature representations to a new vector space, enabling effective\ndetection of anomalies. Experiments show that ADFA outperforms state-of-the-art\n(SOTA) methods on multiple challenging medical image datasets, confirming its\neffectiveness in medical anomaly detection.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:10:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Yiming",""],["Liu","Guole",""],["Luo","Yaoru",""],["Yang","Ge",""]]}
{"id":"2308.15281","submitter":"Xiaozhou Li","authors":"Ruoyu Su, Xiaozhou Li, Davide Taibi","title":"Back to the Future: From Microservice to Monolith","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Recently the trend of companies switching from microservice back to monolith\nhas increased, leading to intense debate in the industry. We conduct a\nmultivocal literature review, to investigate reasons for the phenomenon and key\naspects to pay attention to during the switching back and analyze the opinions\nof other practitioners. The results pave the way for further research and\nprovide guidance for industrial companies switching from microservice back to\nmonolith.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:12:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Su","Ruoyu",""],["Li","Xiaozhou",""],["Taibi","Davide",""]]}
{"id":"2308.15282","submitter":"Maria-Theresia Pelz","authors":"Maria-Theresia Pelz and Christopher Somes","title":"Diffusion-based kernel density estimation improves the assessment of\n  carbon isotope modelling","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.AP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Comparing differently sized data sets is one main task in model assessment\nand calibration. This is due to field data being generally sparse compared to\nsimulated model results. We tackled this task by the application of a new\ndiffusion-based kernel density estimator (diffKDE) that approximates\nprobability density functions of a data set nearly independent of the amount of\navailable data. We compared the resulting density estimates of measured and\nsimulated marine particulate organic carbon-13 isotopes qualitatively and\nquantitatively by the Wasserstein distance. For reference we also show the\ncorresponding comparison based on equally sized data set with reduced\nsimulation and field data. The comparison based on all available data reveals a\nbetter fit of the simulation to the field data and shows misleading model\nproperties in the masked analysis. A comparison between the diffKDE and a\ntraditional Gaussian KDE shows a better resolution of data features under the\ndiffKDE. We are able to show a promising advantage in the application of KDEs\nin calibration of models, especially in the application of the diffKDE.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:12:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Pelz","Maria-Theresia",""],["Somes","Christopher",""]]}
{"id":"2308.15283","submitter":"Hinrikus Wolf","authors":"Hinrikus Wolf, Luca Oeljeklaus, Pascal K\\\"uhner, Martin Grohe","title":"Structural Node Embeddings with Homomorphism Counts","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Graph homomorphism counts, first explored by Lov\\'asz in 1967, have recently\ngarnered interest as a powerful tool in graph-based machine learning. Grohe\n(PODS 2020) proposed the theoretical foundations for using homomorphism counts\nin machine learning on graph level as well as node level tasks. By their very\nnature, these capture local structural information, which enables the creation\nof robust structural embeddings. While a first approach for graph level tasks\nhas been made by Nguyen and Maehara (ICML 2020), we experimentally show the\neffectiveness of homomorphism count based node embeddings. Enriched with node\nlabels, node weights, and edge weights, these offer an interpretable\nrepresentation of graph data, allowing for enhanced explainability of machine\nlearning models.\n  We propose a theoretical framework for isomorphism-invariant homomorphism\ncount based embeddings which lend themselves to a wide variety of downstream\ntasks. Our approach capitalises on the efficient computability of graph\nhomomorphism counts for bounded treewidth graph classes, rendering it a\npractical solution for real-world applications. We demonstrate their\nexpressivity through experiments on benchmark datasets. Although our results do\nnot match the accuracy of state-of-the-art neural architectures, they are\ncomparable to other advanced graph learning models. Remarkably, our approach\ndemarcates itself by ensuring explainability for each individual feature. By\nintegrating interpretable machine learning algorithms like SVMs or Random\nForests, we establish a seamless, end-to-end explainable pipeline. Our study\ncontributes to the advancement of graph-based techniques that offer both\nperformance and interpretability.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:14:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wolf","Hinrikus",""],["Oeljeklaus","Luca",""],["K\u00fchner","Pascal",""],["Grohe","Martin",""]]}
{"id":"2308.15284","submitter":"Javier Fumanal-Idocin Mr.","authors":"Javier Fumanal-Idocin, Javier Andreu-Perez, Oscar Cord\\'on, Hani\n  Hagras, Humberto Bustince","title":"ARTxAI: Explainable Artificial Intelligence Curates Deep Representation\n  Learning for Artistic Images using Fuzzy Techniques","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Automatic art analysis employs different image processing techniques to\nclassify and categorize works of art. When working with artistic images, we\nneed to take into account further considerations compared to classical image\nprocessing. This is because such artistic paintings change drastically\ndepending on the author, the scene depicted, and their artistic style. This can\nresult in features that perform very well in a given task but do not grasp the\nwhole of the visual and symbolic information contained in a painting. In this\npaper, we show how the features obtained from different tasks in artistic image\nclassification are suitable to solve other ones of similar nature. We present\ndifferent methods to improve the generalization capabilities and performance of\nartistic classification systems. Furthermore, we propose an explainable\nartificial intelligence method to map known visual traits of an image with the\nfeatures used by the deep learning model considering fuzzy rules. These rules\nshow the patterns and variables that are relevant to solve each task and how\neffective is each of the patterns found. Our results show that our proposed\ncontext-aware features can achieve up to $6\\%$ and $26\\%$ more accurate results\nthan other context- and non-context-aware solutions, respectively, depending on\nthe specific task. We also show that some of the features used by these models\ncan be more clearly correlated to visual traits in the original image than\nothers.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:15:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fumanal-Idocin","Javier",""],["Andreu-Perez","Javier",""],["Cord\u00f3n","Oscar",""],["Hagras","Hani",""],["Bustince","Humberto",""]]}
{"id":"2308.15285","submitter":"Anna B\\\"uttner","authors":"Anna B\\\"uttner and Frank Hellmann","title":"Complex Couplings -- A universal, adaptive and bilinear formulation of\n  power grid dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.AO physics.soc-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The energy transition introduces new classes of dynamical actors into the\npower grid. There is a growing need for so-called grid-forming inverters (GFIs)\nthat can contribute to dynamic grid stability as the share of synchronous\ngenerators decreases. Understanding the collective behavior and stability of\nfuture grids, featuring a heterogeneous mix of dynamics, remains an urgent and\nchallenging task. Two recent advances in describing such modern power grid\ndynamics have made this problem more tractable: First, the normal form for\ngrid-forming actors provides a uniform, technology-neutral description of\nplausible grid dynamics, including grid-forming inverters and synchronous\nmachines. Secondly, the notion of the complex frequency has been introduced to\neffortlessly describe how the nodal dynamics influence the power flows in the\ngrid. The major contribution of this paper is to show how the normal form\napproach and the complex frequency dynamics of power grids combine, and how\nthey relate naturally to adaptive dynamical networks and control affine\nsystems. Using normal form and complex frequency, we derive a remarkably\nelementary and universal equation for the collective grid dynamics. Notably, we\nobtain an elegant equation entirely in terms of a matrix of complex couplings,\nin which the network topology does not explicitly appear. These complex\ncouplings give rise to new adaptive network formulations of future power grid\ndynamics. We give a new formulation of the Kuramoto model with inertia as a\nspecial case. Starting from this formulation of the grid dynamics, the question\nof the optimal design of future grid forming actors becomes treatable by\nmethods from affine and bilinear control theory. We demonstrate the power of\nthis perspective by deriving a quasi-local control dynamics that can stabilize\narbitrary power flows, even if the effective network Laplacian is not positive\ndefinite.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:15:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["B\u00fcttner","Anna",""],["Hellmann","Frank",""]]}
{"id":"2308.15286","submitter":"Erwin Luesink","authors":"Darryl D. Holm and Erwin Luesink","title":"Stochastic Geometric Mechanics for Fluid Dynamics","comments":"23 pages, 3 figures, 3 tables, submitted to Elsevier Encyclopedia of\n  Mathematical Physics second edition. arXiv admin note: substantial text\n  overlap with arXiv:2108.07853","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn math-ph math.MP physics.ao-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Stochastic geometric mechanics (SGM) is known for its potential utility in\nquantifying uncertainty in global climate modelling of the Earth's ocean and\natmosphere while also preserving the fundamental advective transport properties\nof ideal fluid flow. The present chapter describes the mathematical development\nof the framework of stochastic geometric mechanics in the context of fluid flow\nand wave dynamics obtained from Lie group-invariant variational principles.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:16:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Holm","Darryl D.",""],["Luesink","Erwin",""]]}
{"id":"2308.15287","submitter":"Binbin Shi","authors":"Binbin Shi and Weike Wang","title":"Enhanced dissipation and blow-up suppression for the three dimensional\n  Keller-Segel equation with a non-shear incompressible flow","comments":"25 page","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, we consider the Cauchy problem for the three dimensional\nparabolic-elliptic Keller-Segel equation with a large non-shear incompressible\nflow. Without advection, there exist solution with arbitrarily mass which blow\nup in finite time. Firstly, we introduce a three dimensional non-shear\nincompressible flow and study the enhanced dissipation of such flows by\nresolvent estimate method. Next, we show that the enhanced dissipation of such\nflow can suppress blow-up of solution to three dimensional parabolic-elliptic\nKeller-Segel equation and establish global classical solution with large\ninitial data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:17:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shi","Binbin",""],["Wang","Weike",""]]}
{"id":"2308.15288","submitter":"Dani\\\"el Otten","authors":"Benno van den Berg, Dani\\\"el Otten","title":"Conservativity of Type Theory over Higher-order Arithmetic","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.LO cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate how much type theory is able to prove about the natural\nnumbers. A classical result in this area shows that dependent type theory\nwithout any universes is conservative over Heyting Arithmetic (HA). We build on\nthis result by showing that type theories with one level of universes are\nconservative over Higher-order Heyting Arithmetic (HAH). Although this clearly\ndepends on the specific type theory, we show that the interpretation of logic\nalso plays a major role. For proof-irrelevant interpretations, we will see that\nstrong versions of type theory prove exactly the same higher-order arithmetical\nformulas as HAH. Conversely, proof-relevant interpretations prove strictly more\nsecond-order arithmetical formulas than HAH, however they still prove exactly\nthe same first-order arithmetical formulas. Along the way, we investigate the\ndifferent interpretations of logic in type theory, and to what extent dependent\ntype theories can be seen as extensions of higher-order logic. We apply our\nresults by proving De Jongh's theorem for type theory.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:22:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Berg","Benno van den",""],["Otten","Dani\u00ebl",""]]}
{"id":"2308.15289","submitter":"Gerd Wachsmuth","authors":"Constantin Christof, Gerd Wachsmuth","title":"Energy Space Newton Differentiability for Solution Maps of Unilateral\n  and Bilateral Obstacle Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove that the solution operator of the classical unilateral obstacle\nproblem on a nonempty open bounded set $\\Omega \\subset \\mathbb{R}^d$, $d \\in\n\\mathbb{N}$, is Newton differentiable as a function from $L^p(\\Omega)$ to\n$H_0^1(\\Omega)$ whenever $\\max(1, 2d/(d+2)) < p \\leq \\infty$. By exploiting\nthis Newton differentiability property, results on angled subspaces in\n$H^{-1}(\\Omega)$, and a formula for orthogonal projections onto direct sums, we\nfurther show that the solution map of the classical bilateral obstacle problem\nis Newton differentiable as a function from $L^p(\\Omega)$ to $H_0^1(\\Omega)\\cap\nL^q(\\Omega)$ whenever $\\max(1, d/2) < p \\leq \\infty$ and $1 \\leq q <\\infty$.\nFor both the unilateral and the bilateral case, we provide explicit formulas\nfor the Newton derivative. As a concrete application example for our results,\nwe consider the numerical solution of an optimal control problem with\n$H_0^1(\\Omega)$-controls and box-constraints by means of a semismooth Newton\nmethod.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:25:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Christof","Constantin",""],["Wachsmuth","Gerd",""]]}
{"id":"2308.15290","submitter":"William Balunas","authors":"William Balunas, Donatella Cavalli, Teng Jian Khoo, Matthew Klein,\n  Peter Loch, Federica Piazza, Caterina Pizio, Silvia Resconi, Douglas\n  Schaefer, Russell Smith, Sarah Williams","title":"A flexible and efficient approach for missing transverse momentum\n  reconstruction","comments":"17 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Missing transverse momentum is a crucial observable for physics at hadron\ncolliders, being the only constraint on the kinematics of \"invisible\" objects\nsuch as neutrinos and hypothetical dark matter particles. Computing missing\ntransverse momentum at the highest possible precision, particularly in\nexperiments at the energy frontier, can be a challenging procedure due to\nambiguities in the distribution of energy and momentum between many\nreconstructed particle candidates. This paper describes a novel solution for\nefficiently encoding information required for the computation of missing\ntransverse momentum given arbitrary selection criteria for the constituent\nreconstructed objects. Pileup suppression using information from both the\ncalorimeter and the inner detector is an integral component of the\nreconstruction procedure. Energy calibration and systematic variations are\nnaturally supported. Following this strategy, the ATLAS Collaboration has been\nable to optimise the use of missing transverse momentum in diverse analyses\nthroughout Runs 2 and 3 of the Large Hadron Collider and for future analyses.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:25:24 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Balunas","William",""],["Cavalli","Donatella",""],["Khoo","Teng Jian",""],["Klein","Matthew",""],["Loch","Peter",""],["Piazza","Federica",""],["Pizio","Caterina",""],["Resconi","Silvia",""],["Schaefer","Douglas",""],["Smith","Russell",""],["Williams","Sarah",""]]}
{"id":"2308.15291","submitter":"Temesgen Mehari","authors":"Temesgen Mehari, Nils Strodthoff","title":"Towards quantitative precision for ECG analysis: Leveraging state space\n  models, self-supervision and patient metadata","comments":"extended version of arXiv:2211.07579","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Deep learning has emerged as the preferred modeling approach for automatic\nECG analysis. In this study, we investigate three elements aimed at improving\nthe quantitative accuracy of such systems. These components consistently\nenhance performance beyond the existing state-of-the-art, which is\npredominantly based on convolutional models. Firstly, we explore more\nexpressive architectures by exploiting structured state space models (SSMs).\nThese models have shown promise in capturing long-term dependencies in time\nseries data. By incorporating SSMs into our approach, we not only achieve\nbetter performance, but also gain insights into long-standing questions in the\nfield. Specifically, for standard diagnostic tasks, we find no advantage in\nusing higher sampling rates such as 500Hz compared to 100Hz. Similarly,\nextending the input size of the model beyond 3 seconds does not lead to\nsignificant improvements. Secondly, we demonstrate that self-supervised\nlearning using contrastive predictive coding can further improve the\nperformance of SSMs. By leveraging self-supervision, we enable the model to\nlearn more robust and representative features, leading to improved analysis\naccuracy. Lastly, we depart from synthetic benchmarking scenarios and\nincorporate basic demographic metadata alongside the ECG signal as input. This\ninclusion of patient metadata departs from the conventional practice of relying\nsolely on the signal itself. Remarkably, this addition consistently yields\npositive effects on predictive performance. We firmly believe that all three\ncomponents should be considered when developing next-generation ECG analysis\nalgorithms.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:25:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mehari","Temesgen",""],["Strodthoff","Nils",""]]}
{"id":"2308.15292","submitter":"Mengjie Ding","authors":"Mengjie Ding, Jin-Han Xie and Jianchun Wang","title":"Departure from the statistical equilibrium of large scales in\n  three-dimensional hydrodynamic turbulence","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the statistically steady states of the forced dissipative\nthree-dimensional homogeneous isotropic turbulence at scales larger than the\nforcing scale in real separation space. The probability density functions\n(PDFs) of longitudinal velocity difference at large separations are close to\nbut deviate from Gaussian, measured by their non-zero odd parts. Under the\nassumption that forcing controls the large-scale dynamics, we propose a\nconjugate regime to Kolmogorov's inertial range, independent of the forcing\nscale, to capture the odd parts of PDFs. The analytical expressions of the\nthird-order longitudinal structure functions derived from the\nK\\'arm\\'an-Howarth-Monin equation prove that the odd-part PDFs of velocity\ndifferences at large separations are small but non-zero, and show that the\nodd-order longitudinal structure functions have a universal power-law decay\nwith exponent $-2$ as the separation tends to infinity regardless of the\nparticular forcing form, implying a significant coupling between large and\nsmall scales. Thus, dynamics of large scales depart from the absolute\nequilibrium, and we can partially recover small-scale information without\nexplicitly resolving small-scale dynamics. The departure from the statistical\nequilibrium is quantified and found to be viscosity independent. Even though\nthis departure is small, it is significant and should be considered when\nstudying the large scales of the forced three-dimensional homogeneous isotropic\nturbulence.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:27:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ding","Mengjie",""],["Xie","Jin-Han",""],["Wang","Jianchun",""]]}
{"id":"2308.15293","submitter":"Nikolaos Nakis","authors":"Nikolaos Nakis, Abdulkadir \\c{C}elikkanat, Morten M{\\o}rup","title":"A Hybrid Membership Latent Distance Model for Unsigned and Signed\n  Integer Weighted Networks","comments":"For the published version of the paper please visit Advances in\n  Complex Systems (ACS)","journal-ref":null,"doi":"10.1142/S0219525923400027","report-no":null,"categories":"cs.SI cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graph representation learning (GRL) has become a prominent tool for\nfurthering the understanding of complex networks providing tools for network\nembedding, link prediction, and node classification. In this paper, we propose\nthe Hybrid Membership-Latent Distance Model (HM-LDM) by exploring how a Latent\nDistance Model (LDM) can be constrained to a latent simplex. By controlling the\nedge lengths of the corners of the simplex, the volume of the latent space can\nbe systematically controlled. Thereby communities are revealed as the space\nbecomes more constrained, with hard memberships being recovered as the simplex\nvolume goes to zero. We further explore a recent likelihood formulation for\nsigned networks utilizing the Skellam distribution to account for signed\nweighted networks and extend the HM-LDM to the signed Hybrid Membership-Latent\nDistance Model (sHM-LDM). Importantly, the induced likelihood function\nexplicitly attracts nodes with positive links and deters nodes from having\nnegative interactions. We demonstrate the utility of HM-LDM and sHM-LDM on\nseveral real networks. We find that the procedures successfully identify\nprominent distinct structures, as well as how nodes relate to the extracted\naspects providing favorable performances in terms of link prediction when\ncompared to prominent baselines. Furthermore, the learned soft memberships\nenable easily interpretable network visualizations highlighting distinct\npatterns.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:30:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nakis","Nikolaos",""],["\u00c7elikkanat","Abdulkadir",""],["M\u00f8rup","Morten",""]]}
{"id":"2308.15294","submitter":"Manuel Brando","authors":"J. Banda, D. Hafner, J. F. Landaeta, E. Hassinger, K. Mitsumoto, M.\n  Giovannini, J. G. Sereni, C. Geibel, and M. Brando","title":"Electronuclear Quantum Criticality","comments":"10 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present here a rare example of electronuclear quantum criticality in a\nmetal. The compound YbCu4.6Au0.4 is located at an unconventional quantum\ncritical point (QCP). In this material the relevant Kondo and RKKY exchange\ninteractions are very weak, of the order of 1 K. Furthermore, there is strong\ncompetition between antiferromagnetic and ferromagnetic correlations, possibly\ndue to geometrical frustration within the fcc Yb sublattice. This causes strong\nspin fluctuations which prevent the system to order magnetically. Because of\nthe very low Kondo temperature the Yb3+ 4f-electrons couple weakly with the\nconduction electrons allowing the coupling to the nuclear moments of the 171Yb\nand 173Yb isotopes to become important. Thus, the quantum critical fluctuations\nobserved at the QCP do not originate from purely electronic states but from\nentangled electronuclear states. This is evidenced by the anomalous temperature\nand field dependence of the specific heat at low temperatures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:32:00 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Banda","J.",""],["Hafner","D.",""],["Landaeta","J. F.",""],["Hassinger","E.",""],["Mitsumoto","K.",""],["Giovannini","M.",""],["Sereni","J. G.",""],["Geibel","C.",""],["Brando","M.",""]]}
{"id":"2308.15295","submitter":"William Chapman","authors":"William E. Chapman, Judith Berner","title":"Benefits of Deterministic and Stochastic Tendency Adjustments in a\n  Climate Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.ao-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We develop and compare model-error representation schemes derived from data\nassimilation increments and nudging tendencies in multi-decadal simulations of\nthe community atmosphere model, version 6. Each scheme applies a bias\ncorrection during simulation run-time to the zonal and meridional winds. We\nquantify to which extent such online adjustment schemes improve the model\nclimatology and variability on daily to seasonal timescales. Generally, we\nobserve a ca. 30% improvement to annual upper-level zonal winds, with largest\nimprovements in boreal spring (ca. 35%) and winter (ca. 47%). Despite only\nadjusting the wind fields, we additionally observe a ca. 20% improvement to\nannual precipitation over land, with the largest improvements in boreal fall\n(ca. 36%) and winter (ca. 25%), and a ca. 50% improvement to annual sea level\npressure, globally. With mean state adjustments alone, the dominant pattern of\nboreal low-frequency variability over the Atlantic (the North Atlantic\nOscillation) is significantly improved. Additional stochasticity further\nincreases the modal explained variances, which brings it closer to the observed\nvalue. A streamfunction tendency decomposition reveals that the improvement is\ndue to an adjustment to the high- and low-frequency eddy-eddy interaction\nterms. In the Pacific, the mean state adjustment alone led to an erroneous\ndeepening of the Aleutian low, but this was remedied with the addition of\nstochastically selected tendencies. Finally, from a practical standpoint, we\ndiscuss the performance of using data assimilation increments versus nudging\ntendencies for an online model-error representation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:32:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chapman","William E.",""],["Berner","Judith",""]]}
{"id":"2308.15296","submitter":"Divyansh Agrawal","authors":"Divyansh Agrawal, Ravi Shankar Jaiswal, Suman Kumar Sahoo","title":"Linearized partial data Calder\\'on problem for Biharmonic operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider a linearized partial data Calder\\'on problem for biharmonic\noperators extending the analogous result for harmonic operators. We construct\nspecial solutions and utilize Segal-Bargmann transform to recover lower order\nperturbations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:32:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Agrawal","Divyansh",""],["Jaiswal","Ravi Shankar",""],["Sahoo","Suman Kumar",""]]}
{"id":"2308.15297","submitter":"Jef Laga","authors":"Jef Laga and Ari Shnidman","title":"The geometry and arithmetic of bielliptic Picard curves","comments":"37 pages, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AG math.NT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We study the geometry and arithmetic of the curves $C \\colon y^3 = x^4 + ax^2\n+ b$ and their associated Prym abelian surfaces $P$. We prove a Torelli theorem\nin this context and give a geometric proof of the fact that $P$ has\nquaternionic multiplication (QM) by the quaternion order of discriminant $6$.\nThis allows us to describe the Galois action on the geometric endomorphism\nalgebra of $P$. As an application, we classify the torsion subgroups of the\nMordell-Weil groups $P(\\mathbb{Q})$, as both abelian groups and\n$\\text{End}(P)$-modules.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:34:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Laga","Jef",""],["Shnidman","Ari",""]]}
{"id":"2308.15298","submitter":"Lina Rojas-Barahona","authors":"Quentin Brabant, Gwenole Lecorve, Lina M. Rojas-Barahona, Claire\n  Gardent","title":"KGConv, a Conversational Corpus grounded in Wikidata","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present KGConv, a large, conversational corpus of 71k conversations where\neach question-answer pair is grounded in a Wikidata fact. Conversations contain\non average 8.6 questions and for each Wikidata fact, we provide multiple\nvariants (12 on average) of the corresponding question using templates, human\nannotations, hand-crafted rules and a question rewriting neural model. We\nprovide baselines for the task of Knowledge-Based, Conversational Question\nGeneration. KGConv can further be used for other generation and analysis tasks\nsuch as single-turn question generation from Wikidata triples, question\nrewriting, question answering from conversation or from knowledge graphs and\nquiz generation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:35:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Brabant","Quentin",""],["Lecorve","Gwenole",""],["Rojas-Barahona","Lina M.",""],["Gardent","Claire",""]]}
{"id":"2308.15299","submitter":"Mehran Kazemi","authors":"Quan Yuan, Mehran Kazemi, Xin Xu, Isaac Noble, Vaiva Imbrasaite,\n  Deepak Ramachandran","title":"TaskLAMA: Probing the Complex Task Understanding of Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Structured Complex Task Decomposition (SCTD) is the problem of breaking down\na complex real-world task (such as planning a wedding) into a directed acyclic\ngraph over individual steps that contribute to achieving the task, with edges\nspecifying temporal dependencies between them. SCTD is an important component\nof assistive planning tools, and a challenge for commonsense reasoning systems.\nWe probe how accurately SCTD can be done with the knowledge extracted from\nLarge Language Models (LLMs). We introduce a high-quality human-annotated\ndataset for this problem and novel metrics to fairly assess performance of LLMs\nagainst several baselines. Our experiments reveal that LLMs are able to\ndecompose complex tasks into individual steps effectively, with a relative\nimprovement of 15% to 280% over the best baseline. We also propose a number of\napproaches to further improve their performance, with a relative improvement of\n7% to 37% over the base model. However, we find that LLMs still struggle to\npredict pairwise temporal dependencies, which reveals a gap in their\nunderstanding of complex tasks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:36:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yuan","Quan",""],["Kazemi","Mehran",""],["Xu","Xin",""],["Noble","Isaac",""],["Imbrasaite","Vaiva",""],["Ramachandran","Deepak",""]]}
{"id":"2308.15300","submitter":"Zhou Yixuan","authors":"Yixuan Zhou, Xing Xu, Jingkuan Song, Fumin Shen, Heng Tao Shen","title":"MSFlow: Multi-Scale Flow-based Framework for Unsupervised Anomaly\n  Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Unsupervised anomaly detection (UAD) attracts a lot of research interest and\ndrives widespread applications, where only anomaly-free samples are available\nfor training. Some UAD applications intend to further locate the anomalous\nregions without any anomaly information.\n  Although the absence of anomalous samples and annotations deteriorates the\nUAD performance, an inconspicuous yet powerful statistics model, the\nnormalizing flows, is appropriate for anomaly detection and localization in an\nunsupervised fashion. The flow-based probabilistic models, only trained on\nanomaly-free data, can efficiently distinguish unpredictable anomalies by\nassigning them much lower likelihoods than normal data.\n  Nevertheless, the size variation of unpredictable anomalies introduces\nanother inconvenience to the flow-based methods for high-precision anomaly\ndetection and localization. To generalize the anomaly size variation, we\npropose a novel Multi-Scale Flow-based framework dubbed MSFlow composed of\nasymmetrical parallel flows followed by a fusion flow to exchange multi-scale\nperceptions. Moreover, different multi-scale aggregation strategies are adopted\nfor image-wise anomaly detection and pixel-wise anomaly localization according\nto the discrepancy between them. The proposed MSFlow is evaluated on three\nanomaly detection datasets, significantly outperforming existing methods.\nNotably, on the challenging MVTec AD benchmark, our MSFlow achieves a new\nstate-of-the-art with a detection AUORC score of up to 99.7%, localization\nAUCROC score of 98.8%, and PRO score of 97.1%. The reproducible code is\navailable at https://github.com/cool-xuan/msflow.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:38:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Yixuan",""],["Xu","Xing",""],["Song","Jingkuan",""],["Shen","Fumin",""],["Shen","Heng Tao",""]]}
{"id":"2308.15301","submitter":"Wouter Van den Broek","authors":"Wouter Van den Broek, Daen Jannis and Jo Verbeeck","title":"Convexity constraints on linear background models for electron\n  energy-loss spectra","comments":"Updated version","journal-ref":"Ultramicroscopy 254 (2023) 113830","doi":"10.1016/j.ultramic.2023.113830","report-no":null,"categories":"physics.data-an cond-mat.mtrl-sci physics.comp-ph physics.ins-det","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In this paper convexity constraints are derived for a background model of\nelectron energy loss spectra (EELS) that is linear in the fitting parameters.\nThe model outperforms a power-law both on experimental and simulated\nbackgrounds, especially for wide energy ranges, and thus improves elemental\nquantification results. Owing to the model's linearity, the constraints can be\nimposed through fitting by quadratic programming. This has important advantages\nover conventional nonlinear power-law fitting such as high speed and a\nguaranteed unique solution without need for initial parameters. As such, the\nneed for user input is significantly reduced, which is essential for\nunsupervised treatment of large data sets. This is demonstrated on a demanding\nspectrum image of a semiconductor device sample with a high number of elements\nover a wide energy range.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:40:15 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:30:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Broek","Wouter Van den",""],["Jannis","Daen",""],["Verbeeck","Jo",""]]}
{"id":"2308.15302","submitter":"Mathias L{\\o}kkegaard Laursen","authors":"Mathias L. Laursen","title":"Transcendence of certain sequences of algebraic numbers","comments":"23 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Using Schmidt's Subspace Theorem, this paper improves and extends an existing\ntranscendence result for sequences of algebraic numbers. The theorems thus\nproduced correspond to a central theorem on the irrationality of sequences due\nto Erd\\H{o}s.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:40:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Laursen","Mathias L.",""]]}
{"id":"2308.15303","submitter":"Chenyang Sun","authors":"Jeffrey C. Lagarias and Chenyang Sun","title":"Asymptotics of Reciprocal Supernorm Partition Statistics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider two multiplicative statistics on the set of integer partitions:\nthe norm of a partition, which is the product of its parts, and the supernorm\nof a partition, which is the product of the prime numbers $p_i$ indexed by its\nparts $i$. We introduce and study new statistics that are sums of reciprocals\nof supernorms on three statistical ensembles of partitions, labelled by their\nsize $|\\lambda|=n$, their perimeter equaling $n$, and their largest part\nequaling $n$. We show that the cumulative statistics of the reciprocal\nsupernorm for each of the three ensembles are asymptotic to $e^{\\gamma} \\log n$\nas $n \\to \\infty$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:41:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lagarias","Jeffrey C.",""],["Sun","Chenyang",""]]}
{"id":"2308.15304","submitter":"Dimitrios Kosmopoulos","authors":"Dimitrios Kosmopoulos and Mikhail P. Solon","title":"Gravitational Self Force from Scattering Amplitudes in Curved Space","comments":"28 pages, 11 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We employ scattering amplitudes in curved space to model the dynamics of a\nlight probe particle with mass $m$ orbiting in the background spacetime induced\nby a heavy gravitational source with mass $M$. Observables are organized as an\nexpansion in $m/M$ to all orders in $G$ -- the gravitational self-force\nexpansion. An essential component of our analysis is the backreaction of the\nheavy source which we capture by including the associated light degrees of\nfreedom. As illustration we consider a Schwarzschild background and verify\ngeodesic motion as well as the first-order self-force correction to two-body\nscattering through ${\\cal O}(G^3)$. Amplitudes in curved space offer several\nadvantages, and further developments along these lines may advance the\ncomputation of gravitational-wave signals for extreme-mass-ratio inspirals.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:41:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kosmopoulos","Dimitrios",""],["Solon","Mikhail P.",""]]}
{"id":"2308.15305","submitter":"Matteo Gallet","authors":"Matteo Gallet, Georg Grasegger, Niels Lubbes, Josef Schicho","title":"Calligraphs and sphere realizations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO math.AG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We introduce a recursive procedure for computing the number of realizations\nof a minimally rigid graph on the sphere up to rotations. We accomplish this by\ncombining two ingredients. The first is a framework that allows us to think of\nsuch realizations as of elements of a moduli space of stable rational curves\nwith marked points. The second is the idea of splitting a minimally rigid graph\ninto two subgraphs, called calligraphs, that admit one degree of freedom and\nthat share only a single edge and a further vertex. This idea has been recently\nemployed for realizations of graphs in the plane up to isometries. The key\nresult is that we can associate to a calligraph a triple of natural numbers\nwith a special property: whenever a minimally rigid graph is split into two\ncalligraphs, the number of realizations of the former equals the product of the\ntwo triples of the latter, where this product is specified by a fixed quadratic\nform. These triples and quadratic form codify the fact that we express\nrealizations as intersections of two curves on the blowup of a sphere along two\npairs of complex conjugate points.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:41:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gallet","Matteo",""],["Grasegger","Georg",""],["Lubbes","Niels",""],["Schicho","Josef",""]]}
{"id":"2308.15306","submitter":"Ariel Kulik","authors":"Baris Can Esmer, Ariel Kulik, Daniel Marx, Daniel Neuen, Roohani\n  Sharma","title":"Approximate Monotone Local Search for Weighted Problems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a recent work, Esmer et al. describe a simple method - Approximate\nMonotone Local Search - to obtain exponential approximation algorithms from\nexisting parameterized exact algorithms, polynomial-time approximation\nalgorithms and, more generally, parameterized approximation algorithms. In this\nwork, we generalize those results to the weighted setting.\n  More formally, we consider monotone subset minimization problems over a\nweighted universe of size $n$ (e.g., Vertex Cover, $d$-Hitting Set and Feedback\nVertex Set). We consider a model where the algorithm is only given access to a\nsubroutine that finds a solution of weight at most $\\alpha \\cdot W$ (and of\narbitrary cardinality) in time $c^k \\cdot n^{O(1)}$ where $W$ is the minimum\nweight of a solution of cardinality at most $k$. In the unweighted setting,\nEsmer et al. determine the smallest value $d$ for which a $\\beta$-approximation\nalgorithm running in time $d^n \\cdot n^{O(1)}$ can be obtained in this model.\nWe show that the same dependencies also hold in a weighted setting in this\nmodel: for every fixed $\\varepsilon>0$ we obtain a $\\beta$-approximation\nalgorithm running in time $O\\left((d+\\varepsilon)^{n}\\right)$, for the same $d$\nas in the unweighted setting.\n  Similarly, we also extend a $\\beta$-approximate brute-force search (in a\nmodel which only provides access to a membership oracle) to the weighted\nsetting. Using existing approximation algorithms and exact parameterized\nalgorithms for weighted problems, we obtain the first exponential-time\n$\\beta$-approximation algorithms that are better than brute force for a variety\nof problems including Weighted Vertex Cover, Weighted $d$-Hitting Set, Weighted\nFeedback Vertex Set and Weighted Multicut.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:42:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Esmer","Baris Can",""],["Kulik","Ariel",""],["Marx","Daniel",""],["Neuen","Daniel",""],["Sharma","Roohani",""]]}
{"id":"2308.15307","submitter":"Tommaso Taddei","authors":"Tommaso Taddei","title":"Compositional maps for registration in complex geometries","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We develop and analyze a parametric registration procedure for manifolds\nassociated with the solutions to parametric partial differential equations in\ntwo-dimensional domains. Given the domain $\\Omega \\subset \\mathbb{R}^2$ and the\nmanifold $M=\\{ u_{\\mu} : \\mu\\in P\\}$ associated with the parameter domain $P\n\\subset \\mathbb{R}^P$ and the parametric field $\\mu\\mapsto u_{\\mu} \\in\nL^2(\\Omega)$, our approach takes as input a set of snapshots from $M$ and\nreturns a parameter-dependent mapping $\\Phi: \\Omega \\times P \\to \\Omega$, which\ntracks coherent features (e.g., shocks, shear layers) of the solution field and\nultimately simplifies the task of model reduction. We consider mappings of the\nform $\\Phi=\\texttt{N}(\\mathbf{a})$ where $\\texttt{N}:\\mathbb{R}^M \\to {\\rm\nLip}(\\Omega; \\mathbb{R}^2)$ is a suitable linear or nonlinear operator; then,\nwe state the registration problem as an unconstrained optimization statement\nfor the coefficients $\\mathbf{a}$. We identify minimal requirements for the\noperator $\\texttt{N}$ to ensure the satisfaction of the bijectivity constraint;\nwe propose a class of compositional maps that satisfy the desired requirements\nand enable non-trivial deformations over curved boundaries of $\\Omega$; we\ndevelop a thorough analysis of the proposed ansatz for polytopal domains and we\ndiscuss the approximation properties for general curved domains. We perform\nnumerical experiments for a parametric inviscid transonic compressible flow\npast a cascade of turbine blades to illustrate the many features of the method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:47:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Taddei","Tommaso",""]]}
{"id":"2308.15308","submitter":"Lorenzo Vorabbi","authors":"Lorenzo Vorabbi, Davide Maltoni, Stefano Santi","title":"On-Device Learning with Binary Neural Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Existing Continual Learning (CL) solutions only partially address the\nconstraints on power, memory and computation of the deep learning models when\ndeployed on low-power embedded CPUs. In this paper, we propose a CL solution\nthat embraces the recent advancements in CL field and the efficiency of the\nBinary Neural Networks (BNN), that use 1-bit for weights and activations to\nefficiently execute deep learning models. We propose a hybrid quantization of\nCWR* (an effective CL approach) that considers differently forward and backward\npass in order to retain more precision during gradient update step and at the\nsame time minimizing the latency overhead. The choice of a binary network as\nbackbone is essential to meet the constraints of low power devices and, to the\nbest of authors' knowledge, this is the first attempt to prove on-device\nlearning with BNN. The experimental validation carried out confirms the\nvalidity and the suitability of the proposed method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:48:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vorabbi","Lorenzo",""],["Maltoni","Davide",""],["Santi","Stefano",""]]}
{"id":"2308.15309","submitter":"Salim Chouaki","authors":"Salim Chouaki, Oana Goga, Hamed Haddadi, Peter Snyder","title":"Understanding the Privacy Risks of Popular Search Engine Advertising\n  Systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We present the first extensive measurement of the privacy properties of the\nadvertising systems used by privacy-focused search engines. We propose an\nautomated methodology to study the impact of clicking on search ads on three\npopular private search engines which have advertising-based business models:\nStartPage, Qwant, and DuckDuckGo, and we compare them to two dominant\ndata-harvesting ones: Google and Bing. We investigate the possibility of third\nparties tracking users when clicking on ads by analyzing first-party storage,\nredirection domain paths, and requests sent before, when, and after the clicks.\nOur results show that privacy-focused search engines fail to protect users'\nprivacy when clicking ads. Users' requests are sent through redirectors on 4%\nof ad clicks on Bing, 86% of ad clicks on Qwant, and 100% of ad clicks on\nGoogle, DuckDuckGo, and StartPage. Even worse, advertising systems collude with\nadvertisers across all search engines by passing unique IDs to advertisers in\nmost ad clicks. These IDs allow redirectors to aggregate users' activity on\nads' destination websites in addition to the activity they record when users\nare redirected through them. Overall, we observe that both privacy-focused and\ntraditional search engines engage in privacy-harming behaviors allowing\ncross-site tracking, even in privacy-enhanced browsers.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:53:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chouaki","Salim",""],["Goga","Oana",""],["Haddadi","Hamed",""],["Snyder","Peter",""]]}
{"id":"2308.15310","submitter":"Fatemeh Chahshouri","authors":"Fatemeh Chahshouri, and Nahid Talebi","title":"Sequential phase-locked optical gating of free electrons","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Recent progress in coherent quantum interactions between free-electron pulses\nand laser-induced near-field light have revolutionized electron wavepacket\nshaping. Building on these advancements, we numerically explore the potential\nof sequential interactions between slow electrons and localized dipolar\nplasmons in a sequential phase-locked interaction scheme. Taking advantage of\nthe prolonged interaction time between slow electrons and optical near-fields,\nwe aim to explore the effect of plasmon dynamics on the free-electron\nwavepacket modulation. Our results demonstrate that the initial optical phase\nof the localized dipolar plasmon at the starting point of the interaction,\nalong with the phase offset between the interaction zones, can serve as control\nparameters in manipulating the transverse and longitudinal recoil of the\nelectron wavefunction. Moreover, it is shown that the polarization state of\nlight is an additional control knop for tailoring the longitudinal and\ntransverse recoils. We show that a sequential phase-locking method can be\nemployed to precisely manipulate the longitudinal and transverse recoil of the\nelectron wavepacket, leading to selective acceleration or deceleration of the\nelectron energy along specific diffraction angles. These findings have\nimportant implications for the development of novel techniques for ultrafast\nelectron-light interferometry, shaping the electron wave packet, and quantum\ninformation processing.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:54:50 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chahshouri","Fatemeh",""],["Talebi","Nahid",""]]}
{"id":"2308.15311","submitter":"Andrew Krause","authors":"Andrew L. Krause, Eamonn A. Gaffney, Thomas Jun Jewell, V\\'aclav\n  Klika, Benjamin J. Walker","title":"Turing instabilities are not enough to ensure pattern formation","comments":"5 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"nlin.PS q-bio.CB q-bio.TO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Symmetry-breaking instabilities play an important role in understanding the\nmechanisms underlying the diversity of patterns observed in nature, such as in\nTuring's reaction--diffusion theory, which connects cellular signalling and\ntransport with the development of growth and form. Extensive literature focuses\non the linear stability analysis of homogeneous equilibria in these systems,\nculminating in a set of conditions for transport-driven instabilities that are\ncommonly presumed to initiate self-organisation. We demonstrate that a\nselection of simple, canonical transport models with only mild multistable\nnon-linearities can satisfy the Turing instability conditions while also\nrobustly exhibiting only transient patterns. Hence, a Turing-like instability\nis insufficient for the existence of a patterned state. Given that biological\nsystems (including gene regulatory networks and spatially distributed\necosystems) often exhibit a high degree of multistability and nonlinearity,\nthis raises important questions of how to analyse prospective mechanisms for\nself-organisation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:59:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Krause","Andrew L.",""],["Gaffney","Eamonn A.",""],["Jewell","Thomas Jun",""],["Klika","V\u00e1clav",""],["Walker","Benjamin J.",""]]}
{"id":"2308.15312","submitter":"Lewis Tseng","authors":"Tzuo Hann Law, Selman Erol, Lewis Tseng","title":"Longest-chain Attacks: Difficulty Adjustment and Timestamp Verifiability","comments":"A short version appears at MobiHoc23 as a poster","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study an adversary who attacks a Proof-of-Work (POW) blockchain by\nselfishly constructing an alternative longest chain. We characterize optimal\nstrategies employed by the adversary when a difficulty adjustment rule al\\`a\nBitcoin applies. As time (namely the times-tamp specified in each block) in\nmost permissionless POW blockchains is somewhat subjective, we focus on two\nextreme scenarios: when time is completely verifiable, and when it is\ncompletely unverifiable. We conclude that an adversary who faces a difficulty\nadjustment rule will find a longest-chain attack very challenging when\ntimestamps are verifiable. POW blockchains with frequent difficulty adjustments\nrelative to time reporting flexibility will be substantially more vulnerable to\nlongest-chain attacks. Our main fining provides guidance on the design of\ndifficulty adjustment rules and demonstrates the importance of timestamp\nverifiability.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 13:59:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Law","Tzuo Hann",""],["Erol","Selman",""],["Tseng","Lewis",""]]}
{"id":"2308.15313","submitter":"A. Ben Hamza","authors":"Tanvir Hassan and A. Ben Hamza","title":"Spatio-temporal MLP-graph network for 3D human pose estimation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Graph convolutional networks and their variants have shown significant\npromise in 3D human pose estimation. Despite their success, most of these\nmethods only consider spatial correlations between body joints and do not take\ninto account temporal correlations, thereby limiting their ability to capture\nrelationships in the presence of occlusions and inherent ambiguity. To address\nthis potential weakness, we propose a spatio-temporal network architecture\ncomposed of a joint-mixing multi-layer perceptron block that facilitates\ncommunication among different joints and a graph weighted Jacobi network block\nthat enables communication among various feature channels. The major novelty of\nour approach lies in a new weighted Jacobi feature propagation rule obtained\nthrough graph filtering with implicit fairing. We leverage temporal information\nfrom the 2D pose sequences, and integrate weight modulation into the model to\nenable untangling of the feature transformations of distinct nodes. We also\nemploy adjacency modulation with the aim of learning meaningful correlations\nbeyond defined linkages between body joints by altering the graph topology\nthrough a learnable modulation matrix. Extensive experiments on two benchmark\ndatasets demonstrate the effectiveness of our model, outperforming recent\nstate-of-the-art methods for 3D human pose estimation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:00:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hassan","Tanvir",""],["Hamza","A. Ben",""]]}
{"id":"2308.15314","submitter":"Emil Engstr\\\"om","authors":"Emil Engstr\\\"om, Eskil Hansen","title":"Linearly convergent nonoverlapping domain decomposition methods for\n  quasilinear parabolic equations","comments":"arXiv admin note: text overlap with arXiv:2210.13868","journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We prove linear convergence for a new family of modified Dirichlet--Neumann\nmethods applied to quasilinear parabolic equations, as well as the convergence\nof the Robin--Robin method. Such nonoverlapping domain decomposition methods\nare commonly employed for the parallelization of partial differential equation\nsolvers. Convergence has been extensively studied for elliptic equations, but\nin the case of parabolic equations there are hardly any convergence results\nthat are not relying on strong regularity assumptions. Hence, we construct a\nnew framework for analyzing domain decomposition methods applied to quasilinear\nparabolic problems, based on fractional time derivatives and time-dependent\nSteklov--Poincar\\'e operators. The convergence analysis is conducted without\nassuming restrictive regularity assumptions on the solutions or the numerical\niterates. We also prove that these continuous convergence results extend to the\ndiscrete case obtained when combining domain decompositions with space-time\nfinite elements.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:01:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Engstr\u00f6m","Emil",""],["Hansen","Eskil",""]]}
{"id":"2308.15315","submitter":"Minxian Xu","authors":"Minxian Xu, Lei Yang, Yang Wang, Chengxi Gao, Linfeng Wen, Guoyao Xu,\n  Liping Zhang, Kejiang Ye, Chengzhong Xu","title":"Practice of Alibaba Cloud on Elastic Resource Provisioning for\n  Large-scale Microservices Cluster","comments":"19 pages","journal-ref":"Software: Practice and Experience, 2023","doi":null,"report-no":null,"categories":"cs.DC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Cloud-native architecture is becoming increasingly crucial for today's cloud\ncomputing environments due to the need for speed and flexibility in developing\napplications. It utilizes microservice technology to break down traditional\nmonolithic applications into light-weight and self-contained microservice\ncomponents. However, as microservices grow in scale and have dynamic\ninter-dependencies, they also pose new challenges in resource provisioning that\ncannot be fully addressed by traditional resource scheduling approaches. The\nvarious microservices with different resource needs and latency requirements\ncan create complex calling chains, making it difficult to provide fine-grained\nand accurate resource allocation to each component while maintaining the\noverall quality of service in the chain. In this work, we aim to address the\nresearch problem on how to efficiently provision resources for the growing\nscale of microservice platform and ensure the performance of latency-critical\nmicroservices. To address the problem, we present in-depth analyses of\nAlibaba's microservice cluster and propose optimized resource provisioning\nalgorithms to enhance resource utilization while ensuring the latency\nrequirement. First, we analyze the distinct features of microservices in\nAlibaba's cluster compared to traditional applications. Then we present\nAlibaba's resource capacity provisioning workflow and framework to address\nchallenges in resource provisioning for large-scale and latency-critical\nmicroservice clusters. Finally, we propose enhanced resource provisioning\nalgorithms over Alibaba's current practice by making both proactive and\nreactive scheduling decisions based on different workloads patterns, which can\nimprove resource usage by 10-15% in Alibaba's clusters, while maintaining the\nnecessary latency for microservices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:02:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xu","Minxian",""],["Yang","Lei",""],["Wang","Yang",""],["Gao","Chengxi",""],["Wen","Linfeng",""],["Xu","Guoyao",""],["Zhang","Liping",""],["Ye","Kejiang",""],["Xu","Chengzhong",""]]}
{"id":"2308.15316","submitter":"Urs Waldmann","authors":"Urs Waldmann, Alex Hoi Hang Chan, Hemal Naik, M\\'at\\'e Nagy, Iain D.\n  Couzin, Oliver Deussen, Bastian Goldluecke, Fumihiro Kano","title":"3D-MuPPET: 3D Multi-Pigeon Pose Estimation and Tracking","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Markerless methods for animal posture tracking have been developing recently,\nbut frameworks and benchmarks for tracking large animal groups in 3D are still\nlacking. To overcome this gap in the literature, we present 3D-MuPPET, a\nframework to estimate and track 3D poses of up to 10 pigeons at interactive\nspeed using multiple-views. We train a pose estimator to infer 2D keypoints and\nbounding boxes of multiple pigeons, then triangulate the keypoints to 3D. For\ncorrespondence matching, we first dynamically match 2D detections to global\nidentities in the first frame, then use a 2D tracker to maintain\ncorrespondences accross views in subsequent frames. We achieve comparable\naccuracy to a state of the art 3D pose estimator for Root Mean Square Error\n(RMSE) and Percentage of Correct Keypoints (PCK). We also showcase a novel use\ncase where our model trained with data of single pigeons provides comparable\nresults on data containing multiple pigeons. This can simplify the domain shift\nto new species because annotating single animal data is less labour intensive\nthan multi-animal data. Additionally, we benchmark the inference speed of\n3D-MuPPET, with up to 10 fps in 2D and 1.5 fps in 3D, and perform quantitative\ntracking evaluation, which yields encouraging results. Finally, we show that\n3D-MuPPET also works in natural environments without model fine-tuning on\nadditional annotations. To the best of our knowledge we are the first to\npresent a framework for 2D/3D posture and trajectory tracking that works in\nboth indoor and outdoor environments.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:02:27 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Waldmann","Urs",""],["Chan","Alex Hoi Hang",""],["Naik","Hemal",""],["Nagy","M\u00e1t\u00e9",""],["Couzin","Iain D.",""],["Deussen","Oliver",""],["Goldluecke","Bastian",""],["Kano","Fumihiro",""]]}
{"id":"2308.15317","submitter":"Erik Demaine","authors":"MIT CompGeom Group, Zachary Abel, Hugo A. Akitaya, Erik D. Demaine,\n  Adam C. Hesterberg, Jayson Lynch","title":"When Can You Tile an Integer Rectangle with Integer Squares?","comments":"6 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper characterizes when an $m \\times n$ rectangle, where $m$ and $n$\nare integers, can be tiled (exactly packed) by squares where each has an\ninteger side length of at least 2. In particular, we prove that tiling is\nalways possible when both $m$ and $n$ are sufficiently large (at least 10).\nWhen one dimension $m$ is small, the behavior is eventually periodic in $n$\nwith period 1, 2, or 3. When both dimensions $m,n$ are small, the behavior is\ndetermined computationally by an exhaustive search.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:04:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["MIT CompGeom Group","",""],["Abel","Zachary",""],["Akitaya","Hugo A.",""],["Demaine","Erik D.",""],["Hesterberg","Adam C.",""],["Lynch","Jayson",""]]}
{"id":"2308.15318","submitter":"Jason Bramburger","authors":"Jason J. Bramburger and Giovanni Fantuzzi","title":"Data-driven Discovery of Invariant Measures","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Invariant measures encode the long-time behaviour of a dynamical system. In\nthis work, we propose an optimization-based method to discover invariant\nmeasures directly from data gathered from a system. Our method does not require\nan explicit model for the dynamics and allows one to target specific invariant\nmeasures, such as physical and ergodic measures. Moreover, it applies to both\ndeterministic and stochastic dynamics in either continuous or discrete time. We\nprovide convergence results and illustrate the performance of our method on\ndata from the logistic map and a stochastic double-well system, for which\ninvariant measures can be found by other means. We then use our method to\napproximate the physical measure of the chaotic attractor of the R\\\"ossler\nsystem, and we extract unstable periodic orbits embedded in this attractor by\nidentifying discrete-time periodic points of a suitably defined Poincar\\'e map.\nThis final example is truly data-driven and shows that our method can\nsignificantly outperform previous approaches based on model identification.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:04:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bramburger","Jason J.",""],["Fantuzzi","Giovanni",""]]}
{"id":"2308.15319","submitter":"Solana Di Pino","authors":"Solana Di Pino, Edward Danquah Donkor, Ver\\'onica M. S\\'anchez, Alex\n  Rodriguez, Giuseppe Cassone, Damian Scherlis and Ali Hassanali","title":"ZundEig: The Structure of the Proton in Liquid Water From Unsupervised\n  Learning","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The structure of the excess proton in liquid water has been the subject of\nlively debate from both experimental and theoretical fronts for the last\ncentury. Fluctuations of the proton are typically interpreted in terms of\nlimiting states referred to as the Eigen and Zundel species. Here we put these\nideas under the microscope taking advantage of recent advances in unsupervised\nlearning that use local atomic descriptors to characterize environments of\nacidic water combined with advanced clustering techniques. Our agnostic\napproach leads to the observation of only a single charged cluster and two\nneutral ones. We demonstrate that the charged cluster involving the excess\nproton, is best seen as an ionic topological defect in water's hydrogen bond\nnetwork forming a single local minimum on the global free-energy landscape.\nThis charged defect is a highly fluxional moiety where the idealized Eigen and\nZundel species are neither limiting configurations nor distinct thermodynamic\nstates. Instead, the ionic defect enhances the presence of neutral water\ndefects through strong interactions with the network. We dub the combination of\nthe charged and neutral defect clusters as ZundEig demonstrating that the\nfluctuations between these local environments provide a general framework for\nrationalizing more descriptive notions of the proton in the existing\nliterature.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:08:29 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 14:18:56 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Di Pino","Solana",""],["Donkor","Edward Danquah",""],["S\u00e1nchez","Ver\u00f3nica M.",""],["Rodriguez","Alex",""],["Cassone","Giuseppe",""],["Scherlis","Damian",""],["Hassanali","Ali",""]]}
{"id":"2308.15320","submitter":"Th\\'eo S\\'epulcre","authors":"Axel M. Eriksson, Th\\'eo S\\'epulcre, Mikael Kervinen, Timo Hillmann,\n  Marina Kudra, Simon Dupouy, Yong Lu, Maryam Khanahmadi, Jiaying Yang, Claudia\n  Castillo Moreno, Per Delsing and Simone Gasparinetti","title":"Universal control of a bosonic mode via drive-activated native cubic\n  interactions","comments":"11 pages, 6 figures and supplementary materials","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Linear bosonic modes offer a hardware-efficient alternative for quantum\ninformation processing but require access to some nonlinearity for universal\ncontrol. The lack of nonlinearity in photonics has led to encoded\nmeasurement-based quantum computing, which rely on linear operations but\nrequires access to resourceful ('nonlinear') quantum states, such as cubic\nphase states. In contrast, superconducting microwave circuits offer\nengineerable nonlinearities but suffer from static Kerr nonlinearity. Here, we\ndemonstrate universal control of a bosonic mode composed of a superconducting\nnonlinear asymmetric inductive element (SNAIL) resonator, enabled by native\nnonlinearities in the SNAIL element. We suppress static nonlinearities by\noperating the SNAIL in the vicinity of its Kerr-free point and dynamically\nactivate nonlinearities up to third order by fast flux pulses. We\nexperimentally realize a universal set of generalized squeezing operations, as\nwell as the cubic phase gate, and exploit them to deterministically prepare a\ncubic phase state in 60 ns. Our results initiate the experimental field of\nuniversal continuous-variables quantum computing.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:13:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Eriksson","Axel M.",""],["S\u00e9pulcre","Th\u00e9o",""],["Kervinen","Mikael",""],["Hillmann","Timo",""],["Kudra","Marina",""],["Dupouy","Simon",""],["Lu","Yong",""],["Khanahmadi","Maryam",""],["Yang","Jiaying",""],["Moreno","Claudia Castillo",""],["Delsing","Per",""],["Gasparinetti","Simone",""]]}
{"id":"2308.15321","submitter":"Mang Ning","authors":"Mang Ning, Mingxiao Li, Jianlin Su, Albert Ali Salah, Itir Onal\n  Ertugrul","title":"Elucidating the Exposure Bias in Diffusion Models","comments":"7 pages, code available soon","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Diffusion models have demonstrated impressive generative capabilities, but\ntheir 'exposure bias' problem, described as the input mismatch between training\nand sampling, lacks in-depth exploration. In this paper, we systematically\ninvestigate the exposure bias problem in diffusion models by first analytically\nmodelling the sampling distribution, based on which we then attribute the\nprediction error at each sampling step as the root cause of the exposure bias\nissue. Furthermore, we discuss potential solutions to this issue and propose an\nintuitive metric for it. Along with the elucidation of exposure bias, we\npropose a simple, yet effective, training-free method called Epsilon Scaling to\nalleviate the exposure bias. We show that Epsilon Scaling explicitly moves the\nsampling trajectory closer to the vector field learned in the training phase by\nscaling down the network output (Epsilon), mitigating the input mismatch\nbetween training and sampling. Experiments on various diffusion frameworks\n(ADM, DDPM/DDIM, LDM), unconditional and conditional settings, and\ndeterministic vs. stochastic sampling verify the effectiveness of our method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:16:09 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 08:20:30 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ning","Mang",""],["Li","Mingxiao",""],["Su","Jianlin",""],["Salah","Albert Ali",""],["Ertugrul","Itir Onal",""]]}
{"id":"2308.15322","submitter":"Yong Xu","authors":"Yong Xu","title":"Constraining Axion and ALP Dark Matter from Misalignment during\n  Reheating","comments":"25 pages, 3 figures, 1 table","journal-ref":null,"doi":null,"report-no":"MITP-23-047","categories":"hep-ph astro-ph.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We explore the phenomenology of QCD axion and axion-like particle (ALP) dark\nmatter production via misalignment during inflationary reheating. We\ninvestigate scenarios involving inflaton oscillating in a generic potential\n$\\sim \\phi^n$, considering inflaton decay and annihilation for reheating. For\nlow reheating temperatures, the parameter space leading to the correct relic\nabundance can be enlarged beyond the standard case. Depending on the type of\ninflaton-matter couplings and the value of $n$, we find that certain parts of\nthe extended parameter space are already constrained by ADMX, CAPP, and MUSE\nexperiments. Future Haloscope experiments are expected to impose stringent\nconstraints. We highlight the potential to utilize axion experiments in\nconstraining the dynamics of reheating.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:18:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xu","Yong",""]]}
{"id":"2308.15323","submitter":"Weihua Liu","authors":"Weihua Liu, Chaochao Lin, Haoping Yu, Said Boumaraf, Zhaoqiong Pi","title":"Occlusion-Aware Deep Convolutional Neural Network via Homogeneous\n  Tanh-transforms for Face Parsing","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Face parsing infers a pixel-wise label map for each semantic facial\ncomponent. Previous methods generally work well for uncovered faces, however\noverlook the facial occlusion and ignore some contextual area outside a single\nface, especially when facial occlusion has become a common situation during the\nCOVID-19 epidemic. Inspired by the illumination theory of image, we propose a\nnovel homogeneous tanh-transforms for image preprocessing, which made up of\nfour tanh-transforms, that fuse the central vision and the peripheral vision\ntogether. Our proposed method addresses the dilemma of face parsing under\nocclusion and compresses more information of surrounding context. Based on\nhomogeneous tanh-transforms, we propose an occlusion-aware convolutional neural\nnetwork for occluded face parsing. It combines the information both in\nTanh-polar space and Tanh-Cartesian space, capable of enhancing receptive\nfields. Furthermore, we introduce an occlusion-aware loss to focus on the\nboundaries of occluded regions. The network is simple and flexible, and can be\ntrained end-to-end. To facilitate future research of occluded face parsing, we\nalso contribute a new cleaned face parsing dataset, which is manually purified\nfrom several academic or industrial datasets, including CelebAMask-HQ,\nShort-video Face Parsing as well as Helen dataset and will make it public.\nExperiments demonstrate that our method surpasses state-of-art methods of face\nparsing under occlusion.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:20:13 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Weihua",""],["Lin","Chaochao",""],["Yu","Haoping",""],["Boumaraf","Said",""],["Pi","Zhaoqiong",""]]}
{"id":"2308.15324","submitter":"Pengwei Xing","authors":"Pengwei Xing, Songtao Lu, Han Yu","title":"FedLogic: Interpretable Federated Multi-Domain Chain-of-Thought Prompt\n  Selection for Large Language Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Leveraging ``chain-of-thought (CoT)'' reasoning to elicit rapid and precise\nresponses from large language models (LLMs) is rapidly attracting research\ninterest. A notable challenge here is how to design or select optimal prompts.\nThe process of prompt selection relies on trial and error, involving continuous\nadjustments and combinations of input prompts by users based on the\ncorresponding new responses generated from LLMs. Furthermore, minimal research\nhas been conducted to explore how LLMs employ the mathematical problem-solving\ncapabilities learned from user interactions to address issues in narrative\nwriting. To improve interpretability and explore the balance principle between\ngenerality and personalization under a multi-domain CoT prompt selection\nscenario, we propose the Federated Logic rule learning approach (FedLogic). We\nintroduce a theoretical formalization and interactive emulation of the\nmulti-domain CoT prompt selection dilemma in the context of federated LLMs. We\ncast the problem of joint probability modeling as a bilevel program, where the\nCoT prompt selection intricacy can be likened to a fuzzy score-based rule\nselection with the LLMs function as rule generators. FedLogic solves this\nproblem through variational expectation maximization (V-EM). In addition, we\nincorporate two KL-divergence constraints within this probabilistic modeling\nframework to surmount the intricacies of managing extensive search spaces and\naccomplishing cross-domain personalization of CoTs. To the best of our\nknowledge, FedLogic is the first interpretable and principled federated\nmulti-domain CoT prompt selection approach for LLMs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:20:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xing","Pengwei",""],["Lu","Songtao",""],["Yu","Han",""]]}
{"id":"2308.15325","submitter":"Jonah Reeger","authors":"Jonah A. Reeger","title":"Adaptivity in Local Kernel Based Methods for Approximating the Action of\n  Linear Operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Building on the successes of local kernel methods for approximating the\nsolutions to partial differential equations (PDE) and the evaluation of\ndefinite integrals (quadrature/cubature), a local estimate of the error in such\napproximations is developed. This estimate is useful for determining locations\nin the solution domain where increased node density (equivalently, reduction in\nthe spacing between nodes) can decrease the error in the solution. An adaptive\nprocedure for adding nodes to the domain for both the approximation of\nderivatives and the approximate evaluation of definite integrals is described.\nThis method efficiently computes the error estimate at a set of prescribed\npoints and adds new nodes for approximation where the error is too large.\nComputational experiments demonstrate close agreement between the error\nestimate and actual absolute error in the approximation. Such methods are\nnecessary or desirable when approximating solutions to PDE (or in the case of\nquadrature/cubature), where the initial data and subsequent solution (or\nintegrand) exhibit localized features that require significant refinement to\nresolve and where uniform increases in the density of nodes across the entire\ncomputational domain is not possible or too burdensome.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:21:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Reeger","Jonah A.",""]]}
{"id":"2308.15326","submitter":"Geza Odor","authors":"B\\'alint Hartmann, Istv\\'an Papp, Krist\\'of Benedek, Shengfeng Deng,\n  G\\'eza \\'Odor and Jeffrey Kelling","title":"Dynamical heterogeneity and universality of power-grids","comments":"15 pages, 15 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph cond-mat.stat-mech nlin.CD physics.data-an","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  While weak, tuned asymmetry can improve, strong heterogeneity destroys\nsynchronization in the electric power system. We study the level of\nheterogeneity, by comparing large high voltage (HV) power-grids of Europe and\nNorth America. We provide an analysis of power capacities and loads of various\nenergy sources from the databases and found heavy tailed distributions with\nsimilar characteristics. Graph topological measures, community structures also\nexhibit strong similarities, while the cable admittance distributions can be\nwell fitted with the same power-laws (PL), related to the length distributions.\nThe community detection analysis shows the level of synchronization in\ndifferent domains of the European HV power grids, by solving a set of swing\nequations. We provide numerical evidence for frustrated synchronization and\nChimera states and point out the relation of topology and level of\nsynchronization in the subsystems. We also provide empirical data analysis of\nthe frequency heterogeneities within the Hungarian HV network and find\nq-Gaussian distributions related to super-statistics of time-lagged\nfluctuations, which agree well with former results on the Nordic Grid.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:21:58 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Hartmann","B\u00e1lint",""],["Papp","Istv\u00e1n",""],["Benedek","Krist\u00f3f",""],["Deng","Shengfeng",""],["\u00d3dor","G\u00e9za",""],["Kelling","Jeffrey",""]]}
{"id":"2308.15327","submitter":"Daniel Scheuchenstuhl","authors":"Daniel Scheuchenstuhl, Stefan Ulmer, Felix Resch, Luigi Berducci, Radu\n  Grosu","title":"Enhancing Robot Learning through Learned Human-Attention Feature Maps","comments":"This work has been accepted for the RAP4Robots workshop at ICRA 2023\n  in London","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Robust and efficient learning remains a challenging problem in robotics, in\nparticular with complex visual inputs. Inspired by human attention mechanism,\nwith which we quickly process complex visual scenes and react to changes in the\nenvironment, we think that embedding auxiliary information about focus point\ninto robot learning would enhance efficiency and robustness of the learning\nprocess. In this paper, we propose a novel approach to model and emulate the\nhuman attention with an approximate prediction model. We then leverage this\noutput and feed it as a structured auxiliary feature map into downstream\nlearning tasks. We validate this idea by learning a prediction model from\nhuman-gaze recordings of manual driving in the real world. We test our approach\non two learning tasks - object detection and imitation learning. Our\nexperiments demonstrate that the inclusion of predicted human attention leads\nto improved robustness of the trained models to out-of-distribution samples and\nfaster learning in low-data regime settings. Our work highlights the potential\nof incorporating structured auxiliary information in representation learning\nfor robotics and opens up new avenues for research in this direction. All code\nand data are available online.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:23:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Scheuchenstuhl","Daniel",""],["Ulmer","Stefan",""],["Resch","Felix",""],["Berducci","Luigi",""],["Grosu","Radu",""]]}
{"id":"2308.15328","submitter":"Marco Barbisan","authors":"M. Barbisan, R.S. Delogu, A. Pimazzoni, C. Poggi, M. Ugoletti and M.\n  Cavenago","title":"Cs evaporation in a negative ion source and Cs cleaning tests by plasma\n  sputtering","comments":"6 pages, 5 figures. Accepted manuscript of a published paper","journal-ref":"IEEE Transactions on Plasma Science, vol. 50, no. 11, pp.\n  3859-3864, Nov. 2022","doi":"10.1109/TPS.2022.3202489","report-no":null,"categories":"physics.plasm-ph physics.acc-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The compact radio frequency negative ion source NIO1 (Negative Ion\nOptimization phase 1) has been designed, built and operated by Consorzio RFX\nand INFN-LNL in order to study and optimize the production and acceleration of\nH- ions in continuous operation. In 2020 Cs was evaporated in the source to\nincrease the total extracted ion current. After an initial reduction of\nextracted electron to ion ratio and subsequently an increase of extracted\nnegative ion current, the source performances progressively worsened, because\nof the excessive amount of Cs evaporated in the source; the extracted electron\nto ion ratio increased from below 1 to more than 10, while ion current density\nreduced from max. 67 A/m2 ion current to not more than 30 A/m2). The paper\npresents the experimental observations collected during Cs evaporation\n(reduction of plasma light, Cs emission and H$\\beta$/H$\\gamma$ ratio, etc.)\nthat can help stopping the process before an excessive amount of Cs is\nintroduced in the source. The paper also reports the cleaning techniques tested\nto remove the Cs excess by the action of hydrogen or argon plasmas; while argon\nwas predictably more effective in surface sputtering, a 3 h Ar plasma treatment\nwas not sufficient to recover from overcesiation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:25:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Barbisan","M.",""],["Delogu","R. S.",""],["Pimazzoni","A.",""],["Poggi","C.",""],["Ugoletti","M.",""],["Cavenago","M.",""]]}
{"id":"2308.15329","submitter":"Chengjie Fu","authors":"Chengjie Fu, Jing Liu, Xing-Yu Yang, Wang-Wei Yu, Yawen Zhang","title":"Explaining Pulsar Timing Array Observations with Primordial\n  Gravitational Waves in Parity-Violating Gravity","comments":"8 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.CO gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pulsar timing array (PTA) collaborations have recently suggested the\npresence of a gravitational wave background at nano-Hertz frequencies. In this\npaper, we explore potential inflationary interpretation of this signal within\nthe context of a simple and health parity-violating gravity model termed the\nNieh-Yan modified Teleparallel Gravity. Through this model, two inflationary\nscenarios are evaluated, both yielding significant polarized primordial\ngravitational waves (PGWs) that align well with the results from PTA\nobservations. Furthermore, the resulting PGWs can display strong circular\npolarization and significant anisotropies in the PTA frequency band, which are\ndistinct features to be verified by observations of both PTA and the cosmic\nmicrowave background.The detection of such a distinctive background of PGWs is\nexpected to provide strong evidence supporting our scenarios and insights into\ninflationary dynamics and gravity theory.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:26:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Fu","Chengjie",""],["Liu","Jing",""],["Yang","Xing-Yu",""],["Yu","Wang-Wei",""],["Zhang","Yawen",""]]}
{"id":"2308.15330","submitter":"Felipe Mahlow","authors":"Felipe Mahlow, Bar{\\i}\\c{s} \\c{C}akmak, G\\\"oktu\\u{g} Karpat,\n  \\.Iskender Yal\\c{c}{\\i}nkaya, Felipe Fanchini","title":"Predicting the Onset of Quantum Synchronization Using Machine Learning","comments":"11 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We have applied a machine learning algorithm to predict the emergence of\nenvironment-induced spontaneous synchronization between two qubits in an open\nsystem setting. In particular, we have considered three different models,\nencompassing global and local dissipation regimes, to describe the open system\ndynamics of the qubits. We have utilized the $k$-nearest neighbors algorithm to\nestimate the long time synchronization behavior of the qubits only using the\nearly time expectation values of qubit observables in these three distinct\nmodels. Our findings clearly demonstrate the possibility of determining the\noccurrence of different synchronization phenomena with high precision even at\nthe early stages of the dynamics using a machine learning-based approach.\nMoreover, we show the robustness of our approach against potential measurement\nerrors in experiments by considering random errors in qubit expectation values.\nWe believe that the presented results can prove to be useful in experimental\nstudies on the determination of quantum synchronization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:27:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mahlow","Felipe",""],["\u00c7akmak","Bar\u0131\u015f",""],["Karpat","G\u00f6ktu\u011f",""],["Yal\u00e7\u0131nkaya","\u0130skender",""],["Fanchini","Felipe",""]]}
{"id":"2308.15331","submitter":"Adrien Merlini","authors":"Johann Bourhis, Adrien Merlini, Francesco P. Andriulli","title":"High-order quasi-Helmholtz Projectors: Definition, Analyses, Algorithms","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accuracy of the electric field integral equation (EFIE) can be\nsubstantially improved using high-order discretizations. However, this equation\nsuffers from ill-conditioning and deleterious numerical effects in the\nlow-frequency regime, often jeopardizing its solution. This can be fixed using\nquasi-Helmholtz decompositions, in which the source and testing elements are\nseparated into their solenoidal and non-solenoidal contributions, then rescaled\nin order to avoid both the low-frequency conditioning breakdown and the loss of\nnumerical accuracy. However, standard quasi-Helmholtz decompositions require\nhandling discretized differential operators that often worsen the\nmesh-refinement ill-conditioning and require the finding of the topological\ncycles of the geometry, which can be expensive when modeling complex\nscatterers, especially in high-order. This paper solves these drawbacks by\npresenting the first extension of the quasi-Helmholtz projectors to high-order\ndiscretizations and their application to the stabilization of the EFIE when\ndiscretized with high-order basis functions. Our strategy will not require the\nidentification of the cycles and will provide constant condition numbers for\ndecreasing frequencies. Theoretical considerations will be accompanied by\nnumerical results showing the effectiveness of our method in complex scenarios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:27:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bourhis","Johann",""],["Merlini","Adrien",""],["Andriulli","Francesco P.",""]]}
{"id":"2308.15332","submitter":"Yanjin Wang","authors":"Xumin Gu, Yanjin Wang","title":"Well-posedness and Low Mach Number Limit of the Free Boundary Problem\n  for the Euler--Fourier System","comments":"44pp","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We consider the free boundary problem for the Euler--Fourier system that\ndescribes the motion of compressible, inviscid and heat-conducting fluids. The\neffect of surface tension is neglected and there is no heat flux across the\nfree boundary. We prove the local well-posedness of the problem in Lagrangian\ncoordinates under the Taylor sign condition. The solution is produced as the\nlimit of solutions to a sequence of tangentially-smoothed approximate problems,\nwhere the so-called corrector is crucially introduced beforehand in the\ntemperature equation so that the approximate initial data satisfying the\ncorresponding compatibility conditions can be constructed. To overcome the\nstrong coupling effect between the Euler part and the Fourier part in solving\nthe linearized approximate problem, the temperature equation is further\nregularized by a pseudo-parabolic equation. Moreover, we prove the uniform\nestimates with respect to the Mach number of the solutions to the free-boundary\nEuler--Fourier system with large temperature variations, which allow us to\njustify the convergence towards the free-boundary inviscid low Mach number\nlimit system by the strong compactness argument.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:28:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gu","Xumin",""],["Wang","Yanjin",""]]}
{"id":"2308.15333","submitter":"Daniel Comparat","authors":"R. Hahn, D. Comparat","title":"High repetition rate sub ns-electron pulses from Resonant Pulsed Rydberg\n  Field Ionization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate fast ionization of Cs Rydberg atoms within a cesium cloud by\ncombining continuous laser excitation and a pulsed electric field. This\nResonant Pulsed Rydberg Field-ionization (RPRFI) process results in the\nemission of sub-ns long electron bunches at a tens of MHz repetition rate.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:28:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hahn","R.",""],["Comparat","D.",""]]}
{"id":"2308.15334","submitter":"Johannes Bjerva","authors":"Euan D Lindsay, Aditya Johri, Johannes Bjerva","title":"A Framework for Responsible Development of Automated Student Feedback\n  with Generative AI","comments":"10 pages, under review at IEEE TLT","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CY cs.AI cs.CL","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Providing rich feedback to students is essential for supporting student\nlearning. Recent advances in generative AI, particularly within large language\nmodelling (LLM), provide the opportunity to deliver repeatable, scalable and\ninstant automatically generated feedback to students, making abundant a\npreviously scarce and expensive learning resource. Such an approach is feasible\nfrom a technical perspective due to these recent advances in Artificial\nIntelligence (AI) and Natural Language Processing (NLP); while the potential\nupside is a strong motivator, doing so introduces a range of potential ethical\nissues that must be considered as we apply these technologies. The\nattractiveness of AI systems is that they can effectively automate the most\nmundane tasks; but this risks introducing a \"tyranny of the majority\", where\nthe needs of minorities in the long tail are overlooked because they are\ndifficult to automate.\n  Developing machine learning models that can generate valuable and authentic\nfeedback requires the input of human domain experts. The choices we make in\ncapturing this expertise -- whose, which, when, and how -- will have\nsignificant consequences for the nature of the resulting feedback. How we\nmaintain our models will affect how that feedback remains relevant given\ntemporal changes in context, theory, and prior learning profiles of student\ncohorts. These questions are important from an ethical perspective; but they\nare also important from an operational perspective. Unless they can be\nanswered, our AI generated systems will lack the trust necessary for them to be\nuseful features in the contemporary learning environment.\n  This article will outline the frontiers of automated feedback, identify the\nethical issues involved in the provision of automated feedback and present a\nframework to assist academics to develop such systems responsibly.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:29:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lindsay","Euan D",""],["Johri","Aditya",""],["Bjerva","Johannes",""]]}
{"id":"2308.15335","submitter":"Paolo Radaelli","authors":"Jiahao Chen, Francis Chmiel, Jieyi Liu, Dharmalingam Prabhakaran,\n  Paolo G. Radaelli, Roger D. Johnson","title":"Switching of ferrotoroidal domains via an intermediate mixed state in\n  the multiferroic Y-type hexaferrite\n  Ba$_{0.5}$Sr$_{1.5}$Mg$_2$Fe$_{12}$O$_{22}$","comments":"20 pages, 7 figures, 2 tables","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We report a detailed study of the magnetic field switching of\nferrotoroidal/multiferroic domains in the Y-type hexaferrite compound\nBa$_{0.5}$Sr$_{1.5}$Mg$_2$Fe$_{12}$O$_{22}$. By combining data from SQUID\nmagnetometry, magneto-current measurements, and resonant X-ray scattering\nexperiments, we arrive at a complete description of the deterministic\nswitching, which involves the formation of a temperature-dependent mixed state\nin low magnetic fields. This mechanism is likely to be shared by other members\nof the hexaferrite family, and presents a challenge for the development of\nhigh-speed read-write memory devices based on these materials.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:30:18 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 17:10:04 GMT"},{"version":"v3","created":"Thu, 31 Aug 2023 11:47:36 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Chen","Jiahao",""],["Chmiel","Francis",""],["Liu","Jieyi",""],["Prabhakaran","Dharmalingam",""],["Radaelli","Paolo G.",""],["Johnson","Roger D.",""]]}
{"id":"2308.15336","submitter":"Wenqi Zhu","authors":"Coralia Cartis and Wenqi Zhu","title":"Second-order methods for quartically-regularised cubic polynomials, with\n  applications to high-order tensor methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  There has been growing interest in high-order tensor methods for nonconvex\noptimization, with adaptive regularization, as they possess better/optimal\nworst-case evaluation complexity globally and faster convergence\nasymptotically. These algorithms crucially rely on repeatedly minimizing\nnonconvex multivariate Taylor-based polynomial sub-problems, at least locally.\nFinding efficient techniques for the solution of these sub-problems, beyond the\nsecond-order case, has been an open question. This paper proposes a\nsecond-order method, Quadratic Quartic Regularisation (QQR), for efficiently\nminimizing nonconvex quartically-regularized cubic polynomials, such as the\nAR$p$ sub-problem [3] with $p=3$. Inspired by [35], QQR approximates the\nthird-order tensor term by a linear combination of quadratic and quartic terms,\nyielding (possibly nonconvex) local models that are solvable to global\noptimality. In order to achieve accuracy $\\epsilon$ in the first-order\ncriticality of the sub-problem, we show that the error in the QQR method\ndecreases either linearly or by at least $\\mathcal{O}(\\epsilon^{4/3})$ for\nlocally convex iterations, while in the sufficiently nonconvex case, by at\nleast $\\mathcal{O}(\\epsilon)$; thus improving, on these types of iterations,\nthe general cubic-regularization bound. Preliminary numerical experiments\nindicate that two QQR variants perform competitively with state-of-the-art\napproaches such as ARC (also known as AR$p$ with $p=2$), achieving either a\nlower objective value or iteration counts.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:30:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cartis","Coralia",""],["Zhu","Wenqi",""]]}
{"id":"2308.15337","submitter":"Shubhayan Sarkar","authors":"Shubhayan Sarkar","title":"Distrustful quantum steering","comments":"6 pages, 2 Figures. See also the work by A. Tavakoli on arXiv today","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum steering is an asymmetric form of quantum nonlocality where one can\ntrust the measurements of one of the parties. In this work, inspired by\npractical considerations we investigate the scenario if one can not fully trust\ntheir measurement devices but only up to some precision. We first find the\neffect of such an imprecision on standard device-dependent quantum tomography.\nWe then utilise this result to compute the variation in the local bound of any\ngeneral steering inequality depending on the amount of trust one puts in one of\nthe party's measurement devices. This is particularly important as we show that\neven a small distrust on Alice might cause the parties to observe steerability\neven if the quantum state is unsteerable. Furthermore, this effect becomes more\nrelevant when observing higher dimensional quantum steering.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:31:52 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Sarkar","Shubhayan",""]]}
{"id":"2308.15338","submitter":"Kaicheng Chen","authors":"Kaicheng Chen, Robert S. Martin, Jeffrey M. Wooldridge","title":"Another Look at the Linear Probability Model and Nonlinear Index Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We reconsider the pros and cons of using a linear model to approximate\npartial effects on a response probability for a binary outcome. In particular,\nwe study the ramp model in Horrace and Oaxaca (2006), but focus on average\npartial effects (APE) rather than the parameters of the underlying linear\nindex. We use existing theoretical results to verify that the linear projection\nparameters (which are always consistently estimated by ordinary least squares\n(OLS)) may differ from the index parameters, yet still be identical to the APEs\nin some cases. Using simulations, we describe other cases where OLS either does\nor does not approximate the APEs, and we find that having a large fraction of\nfitted values in [0,1] is neither necessary nor sufficient. A practical\napproach to reduce the finite sample bias of OLS is to iteratively trim the\nobservations with fitted values outside the unit interval, which we find\nproduces estimates numerically equivalent to nonlinear least squares (NLS)\nestimation of the ramp model. We show that under the ramp model, NLS is\nconsistent and asymptotically normal. Based on the theory and simulations, we\nprovide some suggestions for empirical practice.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:32:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Kaicheng",""],["Martin","Robert S.",""],["Wooldridge","Jeffrey M.",""]]}
{"id":"2308.15339","submitter":"Elham Nasarian","authors":"Elham Nasarian, Danial Sharifrazi, Saman Mohsenirad, Kwok Tsui,\n  Roohallah Alizadehsani","title":"AI Framework for Early Diagnosis of Coronary Artery Disease: An\n  Integration of Borderline SMOTE, Autoencoders and Convolutional Neural\n  Networks Approach","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The accuracy of coronary artery disease (CAD) diagnosis is dependent on a\nvariety of factors, including demographic, symptom, and medical examination,\nECG, and echocardiography data, among others. In this context, artificial\nintelligence (AI) can help clinicians identify high-risk patients early in the\ndiagnostic process, by synthesizing information from multiple factors. To this\naim, Machine Learning algorithms are used to classify patients based on their\nCAD disease risk. In this study, we contribute to this research filed by\ndeveloping a methodology for balancing and augmenting data for more accurate\nprediction when the data is imbalanced and the sample size is small. The\nmethodology can be used in a variety of other situations, particularly when\ndata collection is expensive and the sample size is small. The experimental\nresults revealed that the average accuracy of our proposed method for CAD\nprediction was 95.36, and was higher than random forest (RF), decision tree\n(DT), support vector machine (SVM), logistic regression (LR), and artificial\nneural network (ANN).\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:33:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nasarian","Elham",""],["Sharifrazi","Danial",""],["Mohsenirad","Saman",""],["Tsui","Kwok",""],["Alizadehsani","Roohallah",""]]}
{"id":"2308.15340","submitter":"Hui Lu","authors":"Hui Lu, Jiangong You","title":"Global structure of the spectrum of periodic Non-hermitian Jacobi\n  operators","comments":"21 pages, 3 figures; To appear in SCIENCE CHINA Mathematics","journal-ref":null,"doi":null,"report-no":null,"categories":"math.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The global structure of the spectrum of periodic non-Hermitian Jacobi\noperators is described by the discriminant and its stationary points. We also\ngive necessary and sufficient conditions for real spectrum and single interval\nspectrum.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:33:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lu","Hui",""],["You","Jiangong",""]]}
{"id":"2308.15341","submitter":"Makar Pravosud","authors":"Elisa Al\\`os, Eulalia Nualart, Makar Pravosud","title":"On the implied volatility of European and Asian call options under the\n  stochastic volatility Bachelier model","comments":"arXiv admin note: text overlap with arXiv:2208.01353","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.MF","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we study the short-time behavior of the at-the-money implied\nvolatility for European and arithmetic Asian call options with fixed strike\nprice. The asset price is assumed to follow the Bachelier model with a general\nstochastic volatility process. Using techniques of the Malliavin calculus such\nas the anticipating It\\^o's formula we first compute the level of the implied\nvolatility when the maturity converges to zero. Then, we find a short maturity\nasymptotic formula for the skew of the implied volatility that depends on the\nroughness of the volatility model. We apply our general results to the SABR and\nfractional Bergomi models, and provide some numerical simulations that confirm\nthe accurateness of the asymptotic formula for the skew.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:39:30 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Al\u00f2s","Elisa",""],["Nualart","Eulalia",""],["Pravosud","Makar",""]]}
{"id":"2308.15342","submitter":"Roberto Aloisio","authors":"R. Aloisio, L. Burmistrov, A. Di Giovanni, M. Heller, T. Montaruli, C.\n  Trimarelli (for the NUSES collaboration)","title":"The Terzina instrument onboard the NUSES space mission","comments":"8 pages, 12 figures, proceedings of the 38th International Cosmic Ray\n  Conference (ICRC2023), 26 July - 3 August, 2023, Nagoya, Japan","journal-ref":"PoS(ICRC2023)391","doi":"10.22323/1.444.0391","report-no":null,"categories":"astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper we will introduce the Terzina instrument, which is one of the\ntwo scientific payloads of the NUSES satellite mission. NUSES serves as a\ntechnological pathfinder, hosting a suite of innovative instruments designed\nfor the in-orbit detection of cosmic rays, neutrinos, and gamma rays across\nvarious energy ranges. The Terzina instrument itself is a compact telescope\nequipped with Schmidt-Cassegrain optics. Its primary objective is to detect\nCherenkov radiation emitted by Extensive Air Showers generated by the\ninteraction of high-energy (> 100 PeV) cosmic rays with the Earth's atmosphere.\nTerzina represents a critical step forward in the development of future\nspace-based instruments aimed at detecting upward-moving showers induced by\ntau-leptons and muons resulting from the interaction of high-energy\nastrophysical neutrinos with the Earth. In this paper, we will delve into the\nkey technical aspects of the Terzina instrument, its capabilities, and its\npotential for detection.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:39:35 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Aloisio","R.","","for the NUSES collaboration"],["Burmistrov","L.","","for the NUSES collaboration"],["Di Giovanni","A.","","for the NUSES collaboration"],["Heller","M.","","for the NUSES collaboration"],["Montaruli","T.","","for the NUSES collaboration"],["Trimarelli","C.","","for the NUSES collaboration"]]}
{"id":"2308.15343","submitter":"Maoyuan Wang","authors":"Ding Li, Maoyuan Wang, Dengfeng Li, Jianhui Zhou","title":"Switchable in-plane anomalous Hall effect by magnetization orientation\n  in monolayer $\\mathrm{Mn}_{3}\\mathrm{Si}_{2}\\mathrm{Te}_{6}$","comments":"7 pages, 8 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In-plane anomalous Hall effect (IPAHE) is a unconventional anomalous Hall\neffect (AHE) with the Hall current flows in the plane spanned by the\nmagnetization or magnetic field and the electric field. Here, we predict a\nstable two-dimensional ferromagnetic monolayer\n$\\mathrm{Mn}_{3}\\mathrm{Si}_{2}\\mathrm{Te}_{6}$ with collinear ordering of Mn\nmoments in the basal plane. Moreover, we reveal that the monolayer\n$\\mathrm{Mn}_{3}\\mathrm{Si}_{2}\\mathrm{Te}_{6}$ possesses a substantial\nperiodic IPAHE due to the threefold rotational symmetry, which can be switched\nby changing the magnetization orientation by external magnetic fields. In\naddition, we briefly discuss the impacts of moderate strains on the electronic\nstates and AHE, which lead to a near quantized Hall conductivity. Our work\nprovides a potential platform for realizing a sizable and controllable IPAHE\nthat greatly facilatates the application of energy-efficient spintronic\ndevices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:39:37 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 04:32:34 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Ding",""],["Wang","Maoyuan",""],["Li","Dengfeng",""],["Zhou","Jianhui",""]]}
{"id":"2308.15344","submitter":"Xin Zhong","authors":"Fahad Alrasheedi, Xin Zhong","title":"Imperceptible Adversarial Attack on Deep Neural Networks from Image\n  Boundary","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CR cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Although Deep Neural Networks (DNNs), such as the convolutional neural\nnetworks (CNN) and Vision Transformers (ViTs), have been successfully applied\nin the field of computer vision, they are demonstrated to be vulnerable to\nwell-sought Adversarial Examples (AEs) that can easily fool the DNNs. The\nresearch in AEs has been active, and many adversarial attacks and explanations\nhave been proposed since they were discovered in 2014. The mystery of the AE's\nexistence is still an open question, and many studies suggest that DNN training\nalgorithms have blind spots. The salient objects usually do not overlap with\nboundaries; hence, the boundaries are not the DNN model's attention.\nNevertheless, recent studies show that the boundaries can dominate the behavior\nof the DNN models. Hence, this study aims to look at the AEs from a different\nperspective and proposes an imperceptible adversarial attack that systemically\nattacks the input image boundary for finding the AEs. The experimental results\nhave shown that the proposed boundary attacking method effectively attacks six\nCNN models and the ViT using only 32% of the input image content (from the\nboundaries) with an average success rate (SR) of 95.2% and an average peak\nsignal-to-noise ratio of 41.37 dB. Correlation analyses are conducted,\nincluding the relation between the adversarial boundary's width and the SR and\nhow the adversarial boundary changes the DNN model's attention. This paper's\ndiscoveries can potentially advance the understanding of AEs and provide a\ndifferent perspective on how AEs can be constructed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:41:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alrasheedi","Fahad",""],["Zhong","Xin",""]]}
{"id":"2308.15345","submitter":"Jingbo Zeng","authors":"Jingbo Zeng","title":"IndGIC: Supervised Action Recognition under Low Illumination","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Technologies of human action recognition in the dark are gaining more and\nmore attention as huge demand in surveillance, motion control and\nhuman-computer interaction. However, because of limitation in image enhancement\nmethod and low-lighting video datasets, e.g. labeling cost, existing methods\nmeet some problems. Some video-based approached are effect and efficient in\nspecific datasets but cannot generalize to most cases while others methods\nusing multiple sensors rely heavily to prior knowledge to deal with noisy\nnature from video stream. In this paper, we proposes action recognition method\nusing deep multi-input network. Furthermore, we proposed a Independent Gamma\nIntensity Corretion (Ind-GIC) to enhance poor-illumination video, generating\none gamma for one frame to increase enhancement performance. To prove our\nmethod is effective, there is some evaluation and comparison between our method\nand existing methods. Experimental results show that our model achieves high\naccuracy in on ARID dataset.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:41:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zeng","Jingbo",""]]}
{"id":"2308.15346","submitter":"Weihua Liu","authors":"Weihua Liu, Chaochao Lin, Yu Yan","title":"Enhancing Mobile Face Anti-Spoofing: A Robust Framework for Diverse\n  Attack Types under Screen Flash","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Face anti-spoofing (FAS) is crucial for securing face recognition systems.\nHowever, existing FAS methods with handcrafted binary or pixel-wise labels have\nlimitations due to diverse presentation attacks (PAs). In this paper, we\npropose an attack type robust face anti-spoofing framework under light flash,\ncalled ATR-FAS. Due to imaging differences caused by various attack types,\ntraditional FAS methods based on single binary classification network may\nresult in excessive intra-class distance of spoof faces, leading to a challenge\nof decision boundary learning. Therefore, we employed multiple networks to\nreconstruct multi-frame depth maps as auxiliary supervision, and each network\nexperts in one type of attack. A dual gate module (DGM) consisting of a type\ngate and a frame-attention gate is introduced, which perform attack type\nrecognition and multi-frame attention generation, respectively. The outputs of\nDGM are utilized as weight to mix the result of multiple expert networks. The\nmulti-experts mixture enables ATR-FAS to generate spoof-differentiated depth\nmaps, and stably detects spoof faces without being affected by different types\nof PAs. Moreover, we design a differential normalization procedure to convert\noriginal flash frames into differential frames. This simple but effective\nprocessing enhances the details in flash frames, aiding in the generation of\ndepth maps. To verify the effectiveness of our framework, we collected a\nlarge-scale dataset containing 12,660 live and spoof videos with diverse PAs\nunder dynamic flash from the smartphone screen. Extensive experiments\nillustrate that the proposed ATR-FAS significantly outperforms existing\nstate-of-the-art methods. The code and dataset will be available at\nhttps://github.com/Chaochao-Lin/ATR-FAS.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:41:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Weihua",""],["Lin","Chaochao",""],["Yan","Yu",""]]}
{"id":"2308.15347","submitter":"Arti Vedula","authors":"Arti Vedula, Shaileshh Bojja Venkatakrishnan, Abhishek Gupta","title":"Masquerade: Simple and Lightweight Transaction Reordering Mitigation in\n  Blockchains","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Blockchains offer strong security gurarantees, but cannot protect users\nagainst the ordering of transactions. Players such as miners, bots and\nvalidators can reorder various transactions and reap significant profits,\ncalled the Maximal Extractable Value (MEV). In this paper, we propose an MEV\naware protocol design called Masquerade, and show that it will increase user\nsatisfaction and confidence in the system. We propose a strict per-transaction\nlevel of ordering to ensure that a transaction is committed either way even if\nit is revealed. In this protocol, we introduce the notion of a \"token\" to\nmitigate the actions taken by an adversary in an attack scenario. Such tokens\ncan be purchased voluntarily by users, who can then choose to include the token\nnumbers in their transactions. If the users include the token in their\ntransactions, then our protocol requires the block-builder to order the\ntransactions strictly according to token numbers. We show through extensive\nsimulations that this reduces the probability that the adversaries can benefit\nfrom MEV transactions as compared to existing current practices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:42:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Vedula","Arti",""],["Venkatakrishnan","Shaileshh Bojja",""],["Gupta","Abhishek",""]]}
{"id":"2308.15348","submitter":"Yilei Tang","authors":"Jinbo He, Lei Ming, Yi-Lei Tang, Qiankang Wang, Hong-Hao Zhang","title":"Muon precession from the aspect of Dirac equations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we would like to compute the muon anomalous precession\nfrequency through solving the wave functions of the Dirac equations\nstraightforwardly. The precession of a (anti-)muon with an anomalous magnetic\nmomentum term is calculated together with the quantum corrections. Lorentz\nviolation terms up to the lowest non-trivial order is introduced, and their\neffects on anomalous precession are evaluated perturbatively.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:43:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Jinbo",""],["Ming","Lei",""],["Tang","Yi-Lei",""],["Wang","Qiankang",""],["Zhang","Hong-Hao",""]]}
{"id":"2308.15349","submitter":"Vakhtang Putkaradze Dr.","authors":"Christopher Eldred, Fran\\c{c}ois Gay-Balmaz, Sofiia Huraka, Vakhtang\n  Putkaradze","title":"Lie-Poisson Neural Networks (LPNets): Data-Based Computing of\n  Hamiltonian Systems with Symmetries","comments":"57 pages, 13 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  An accurate data-based prediction of the long-term evolution of Hamiltonian\nsystems requires a network that preserves the appropriate structure under each\ntime step. Every Hamiltonian system contains two essential ingredients: the\nPoisson bracket and the Hamiltonian. Hamiltonian systems with symmetries, whose\nparadigm examples are the Lie-Poisson systems, have been shown to describe a\nbroad category of physical phenomena, from satellite motion to underwater\nvehicles, fluids, geophysical applications, complex fluids, and plasma physics.\nThe Poisson bracket in these systems comes from the symmetries, while the\nHamiltonian comes from the underlying physics. We view the symmetry of the\nsystem as primary, hence the Lie-Poisson bracket is known exactly, whereas the\nHamiltonian is regarded as coming from physics and is considered not known, or\nknown approximately. Using this approach, we develop a network based on\ntransformations that exactly preserve the Poisson bracket and the special\nfunctions of the Lie-Poisson systems (Casimirs) to machine precision. We\npresent two flavors of such systems: one, where the parameters of\ntransformations are computed from data using a dense neural network (LPNets),\nand another, where the composition of transformations is used as building\nblocks (G-LPNets). We also show how to adapt these methods to a larger class of\nPoisson brackets. We apply the resulting methods to several examples, such as\nrigid body (satellite) motion, underwater vehicles, a particle in a magnetic\nfield, and others. The methods developed in this paper are important for the\nconstruction of accurate data-based methods for simulating the long-term\ndynamics of physical systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:45:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Eldred","Christopher",""],["Gay-Balmaz","Fran\u00e7ois",""],["Huraka","Sofiia",""],["Putkaradze","Vakhtang",""]]}
{"id":"2308.15350","submitter":"Wei Huang","authors":"Wei Huang","title":"Scaling Limits of Stochastic Transport Equations on Manifolds","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we generalize some results on scaling limits of stochastic\ntransport equations on torus, developed recently by Flandoli, Galeati and Luo,\nto manifolds. We consider the stochastic transport equations driven by colored\nspace-time noise(smooth in space, white in time) on a compact Riemannian\nmanifold without boundary. By tuning the noises properly, we obtain different\nscaling limits depending on the initial data. With space white noise as initial\ndata, the solutions converge in distribution to the solution of a stochastic\nheat equation with additive noise. With regular initial data, the solutions of\ntransport equation converge to the solution of the deterministic heat equation,\naccompanied by qualitative estimates on the convergence rate. We can get the\nsame rate as on torus in the estimates, but at the cost of either imposing\nstronger bounds on the initial data or sacrificing some regularity.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:45:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Wei",""]]}
{"id":"2308.15351","submitter":"Mikhail Beznogov","authors":"Mikhail V. Beznogov, Adriana R. Raduta","title":"Bayesian Survey of the Dense Matter Equation of State built upon Skyrme\n  effective interactions","comments":"27 pages, 11 figures, submitted to A&A","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The equation of state (EOS) is a key ingredient for understanding the\nstructure and composition of neutron stars (NSs). Observation of several\npulsars with masses $\\approx$ 2 Msun, inference of tidal deformabilities from\ngravitational waves signals in binary neutron stars mergers and joint mass and\nradius estimates of two millisecond pulsars contributed to better constraining\nthe behavior of NS EOS beyond the nuclear saturation density. We aim to build\nfamilies of EOSs subjected to various minimal sets of constraints and identify\nthe role some of these constraints play. We also aim to establish correlations\nbetween properties of nuclear matter (NM) and properties of NSs. The\nnon-relativistic mean field theory of NM and the standard Skyrme\nparametrization of the nucleonic effective interactions are used to generate,\nwithin a Bayesian framework, models of EOSs. The constraints we pose come from\nempirical parameters of NM, ab initio calculations of pure neutron matter (PNM)\nand the 2 Msun lower limit on the maximum NS mass. EOSs also have to be causal.\nA purely nucleonic composition is hypothesized. EOSs are generated and\ninvestigated for five sets of constraints. Marginalized posteriors of the\neffective interaction's parameters; empirical parameters of NM; selected global\nproperties of NSs are plotted and analyzed. Correlations among parameters in\nthe isoscalar and isovector channels as well as with NS properties are studied.\nEOSs of NM and NSs are very sensitive to the set of constraints, including\nwhether correlations among the values that the energy per nucleon in PNM takes\nat different densities are accounted for. In each of the five sets that we have\ngenerated there is a significant number of models that comply at 50\\% credible\nregion with joint mass and radius constraints from PSR J0030+045 and\nJ0740+6620, while a tension exists with similar data from the NS in HESS\nJ1731--34.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:46:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Beznogov","Mikhail V.",""],["Raduta","Adriana R.",""]]}
{"id":"2308.15352","submitter":"Sharath Chandra Guntuku","authors":"Sharath Chandra Guntuku, Thomas Talhelm, Garrick Sherman, Angel Fan,\n  Salvatore Giorgi, Liuqing Wei, Lyle H. Ungar","title":"Historical patterns of rice farming explain modern-day language use in\n  China and Japan more than modernization and urbanization","comments":"Includes Supplemental Materials","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.SI physics.soc-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We used natural language processing to analyze a billion words to study\ncultural differences on Weibo, one of China's largest social media platforms.\nWe compared predictions from two common explanations about cultural differences\nin China (economic development and urban-rural differences) against the\nless-obvious legacy of rice versus wheat farming. Rice farmers had to\ncoordinate shared irrigation networks and exchange labor to cope with higher\nlabor requirements. In contrast, wheat relied on rainfall and required half as\nmuch labor. We test whether this legacy made southern China more\ninterdependent. Across all word categories, rice explained twice as much\nvariance as economic development and urbanization. Rice areas used more words\nreflecting tight social ties, holistic thought, and a cautious, prevention\norientation. We then used Twitter data comparing prefectures in Japan, which\nlargely replicated the results from China. This provides crucial evidence of\nthe rice theory in a different nation, language, and platform.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:47:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Guntuku","Sharath Chandra",""],["Talhelm","Thomas",""],["Sherman","Garrick",""],["Fan","Angel",""],["Giorgi","Salvatore",""],["Wei","Liuqing",""],["Ungar","Lyle H.",""]]}
{"id":"2308.15353","submitter":"Mohamed Lamine Mekhalfi","authors":"Mohamed L. Mekhalfi, Davide Boscaini, Fabio Poiesi","title":"Detect, Augment, Compose, and Adapt: Four Steps for Unsupervised Domain\n  Adaptation in Object Detection","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Unsupervised domain adaptation (UDA) plays a crucial role in object detection\nwhen adapting a source-trained detector to a target domain without annotated\ndata. In this paper, we propose a novel and effective four-step UDA approach\nthat leverages self-supervision and trains source and target data concurrently.\nWe harness self-supervised learning to mitigate the lack of ground truth in the\ntarget domain. Our method consists of the following steps: (1) identify the\nregion with the highest-confidence set of detections in each target image,\nwhich serve as our pseudo-labels; (2) crop the identified region and generate a\ncollection of its augmented versions; (3) combine these latter into a composite\nimage; (4) adapt the network to the target domain using the composed image.\nThrough extensive experiments under cross-camera, cross-weather, and\nsynthetic-to-real scenarios, our approach achieves state-of-the-art\nperformance, improving upon the nearest competitor by more than 2% in terms of\nmean Average Precision (mAP). The code is available at\nhttps://github.com/MohamedTEV/DACA.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:48:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mekhalfi","Mohamed L.",""],["Boscaini","Davide",""],["Poiesi","Fabio",""]]}
{"id":"2308.15354","submitter":"Yi-Ming Hu","authors":"Zheng Wu, Hui-Min Fan, Yi-Ming Hu, Ik Siong Heng","title":"Searching Gravitational-Wave Bursts with Space-Borne Detectors","comments":"12 pages, 9 figures, comments welcome","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc astro-ph.HE astro-ph.IM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The millihertz gravitational wave band is expected to be opened by\nspace-borne detectors like TianQin. Various mechanisms can produce short\noutbursts of gravitational waves, whose actual waveform can be hard to model.\nIn order to identify such gravitational wave bursts and not to misclassify them\nas noise transients, we proposed a proof-of-principle energy excess method,\nthat utilized the signal-insensitive channel to veto noise transients. We\nperform a test on simulated data, and for bursts with a signal-to-noise ratio\nof 20, even with the contamination of noise transient, our methods can reach a\ndetection efficiency of 97.4% under a false alarm rate of once per year.\nHowever, more frequent occurrences of noise transients would lower the\ndetection efficiency.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:49:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Wu","Zheng",""],["Fan","Hui-Min",""],["Hu","Yi-Ming",""],["Heng","Ik Siong",""]]}
{"id":"2308.15355","submitter":"Dian-Yong Chen","authors":"Zi-Li Yue, Cheng-Jian Xiao, Dian-Yong Chen","title":"Pionic and radiative transitions from $T_{c\\bar{s}0}^+(2900)$ to\n  $D_{s1}^+(2460)$ as a probe of the structure of $D_{s1}^+(2460)$","comments":"8 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph hep-ex","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this work, we evaluated the widths of the pionic and radiative transitions\nfrom the $T_{c\\bar{s}0}^{+}(2900)$ to the $D_{s1}^{+}(2460)$ in the\n$D_{s1}^{+}(2460)$ molecular frame and the $D_{s1}^{+}(2460)$ charmed-strange\nmeson frame. Our estimations demonstrate that the transition widths in the\n$D_{s1}^{+}(2460)$ molecular frame are much larger than those in the the\n$D_{s1}^{+}(2460)$ charmed-strange meson frame. Specifically, the ratio of the\nwidths of $\\Gamma(T_{c\\bar{s}0}^{+}(2900)\\to D_{s1}^{+} \\pi^{0})$ and\n$\\Gamma(T_{c\\bar{s}0}^{+}(2900)\\to D^{+(0)}K^{0(+)})$ is estimated to be around\n0.1 in the $D_{s1}^{+}(2460)$ charmed-strange meson frame, whereas the lower\nlimit of this ratio is 0.67 in the $D_{s1}^{+}(2460)$ molecular frame. Thus,\nthe aforementioned ratio could be employed as a tool for testing the nature of\nthe $D_{s1}^{+}(2460)$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:52:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yue","Zi-Li",""],["Xiao","Cheng-Jian",""],["Chen","Dian-Yong",""]]}
{"id":"2308.15356","submitter":"Armin Tavakoli","authors":"Armin Tavakoli","title":"Quantum steering with imprecise measurements","comments":"See also the paper of S. Sarkar on arXiv today","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study quantum steering experiments without assuming that the trusted party\ncan perfectly control their measurement device. Instead, we introduce a\nscenario in which these measurements are subject to small imprecision. We show\nthat small measurement imprecision can have a large detrimental influence in\nterms of false positives for steering inequalities, and that this effect can\nbecome even more relevant for high-dimensional systems. We then introduce a\nmethod for taking generic measurement imprecision into account in tests of\nbipartite steering inequalities. The revised steering bounds returned by this\nmethod are analytical, easily computable, and are even optimal for well-known\nfamilies of arbitrary-dimensional steering tests. Furthermore, it applies\nequally well to generalised quantum steering scenarios, where the shared\nquantum state does not need to be separable, but is instead limited by some\nother entanglement property.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:52:40 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 07:50:12 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Tavakoli","Armin",""]]}
{"id":"2308.15357","submitter":"Patrick Palmer","authors":"Patrick Palmer, Martin Krueger, Richard Altendorfer, Torsten Bertram","title":"Ego-Motion Estimation and Dynamic Motion Separation from 3D Point Clouds\n  for Accumulating Data and Improving 3D Object Detection","comments":"Published at: AmE 2023 - Automotive meets Electronics; 14. GMM\n  Symposium (https://ieeexplore.ieee.org/document/10227711)","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  New 3+1D high-resolution radar sensors are gaining importance for 3D object\ndetection in the automotive domain due to their relative affordability and\nimproved detection compared to classic low-resolution radar sensors. One\nlimitation of high-resolution radar sensors, compared to lidar sensors, is the\nsparsity of the generated point cloud. This sparsity could be partially\novercome by accumulating radar point clouds of subsequent time steps. This\ncontribution analyzes limitations of accumulating radar point clouds on the\nView-of-Delft dataset. By employing different ego-motion estimation approaches,\nthe dataset's inherent constraints, and possible solutions are analyzed.\nAdditionally, a learning-based instance motion estimation approach is deployed\nto investigate the influence of dynamic motion on the accumulated point cloud\nfor object detection. Experiments document an improved object detection\nperformance by applying an ego-motion estimation and dynamic motion correction\napproach.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:53:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Palmer","Patrick",""],["Krueger","Martin",""],["Altendorfer","Richard",""],["Bertram","Torsten",""]]}
{"id":"2308.15358","submitter":"Ghulam Hussain","authors":"Ghulam Hussain, Kinga Warda, Giuseppe Cuono and Carmine Autieri","title":"Spin-orbit insulating phase in SnTe cubic nanowires: consequences on the\n  topological surface states","comments":"10 pages, 9 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the electronic, structural and topological properties of the\nSnTe and PbTe cubic nanowires using ab-initio calculations. Using standard and\nlinear-scale density functional theory, we go from the ultrathin limit up to\nthe nanowires thicknesses observed experimentally. Finite-size effects in the\nultra-thin limit produce an electric quadrupole and associated structural\ndistortions, these distortions increase the band gap but they get reduced with\nthe size of the nanowires and become less and less relevant. Ultrathin SnTe\ncubic nanowires are trivial band gap insulators, we demonstrate that by\nincreasing the thickness there is an electronic transition to a spin-orbit\ninsulating phase due to trivial surface states in the regime of thin nanowires.\nThese trivial surface states with a spin-orbit gap of a few meV appear at the\nsame k-point of the topological surface states. Going to the limit of thick\nnanowires, we should observe the transition to the topological crystalline\ninsulating phase with the presence of two massive surface Dirac fermions\nhybridized with the persisting trivial surface states. Therefore, we have the\nco-presence of massive Dirac surface states and trivial surface states close to\nthe Fermi level in the same region of the k-space. According to our estimation,\nthe cubic SnTe nanowires are trivial insulators below the critical thickness\ntc1=10 nm, and they become spin-orbit insulators between tc1=10 nm and tc2=17\nnm, while they transit to the topological phase above the critical thickness of\ntc2=17 nm. These critical thickness values are in the range of the typical\nexperimental thicknesses, making the thickness a relevant parameter for the\nsynthesis of topological cubic nanowires. Pb(1-x)Sn(x)Te nanowires would have\nboth these critical thicknesses tc1 and tc2 at larger values depending on the\ndoping concentration.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:53:56 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hussain","Ghulam",""],["Warda","Kinga",""],["Cuono","Giuseppe",""],["Autieri","Carmine",""]]}
{"id":"2308.15359","submitter":"Antonio Barletta Prof.","authors":"Antonio Barletta","title":"Rayleigh-B\\'enard instability in a horizontal porous layer with\n  anomalous diffusion","comments":"19 pages, 6 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The analysis of the Rayleigh-B\\'enard instability due to the mass diffusion\nin a fluid-saturated horizontal porous layer is reconsidered. The standard\ndiffusion theory based on the variance of the molecular position growing\nlinearly in time is generalised to anomalous diffusion, where the variance is\nmodelled as a power-law function of time. A model of anomalous diffusion based\non a time-dependent mass diffusion coefficient is adopted, together with\nDarcy's law, for momentum transfer, and the Boussinesq approximation, for the\ndescription of the buoyant flow. A linear stability analysis is carried out for\na basic state where the solute has a potentially unstable concentration\ndistribution varying linearly in the vertical direction and the fluid is at\nrest. It is shown that any, even slight, departure from the standard diffusion\nprocess has a dramatic effect on the onset conditions of the instability. This\ncircumstance reveals a strong sensitivity to the anomalous diffusion index. It\nis shown that subdiffusion yields instability for every positive mass diffusion\nRayleigh number, while superdiffusion brings stabilisation no matter how large\nis the Rayleigh number. A discussion of the linear stability analysis based on\nthe Galilei-variant fractional-derivative model of subdiffusion is eventually\ncarried out.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:54:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Barletta","Antonio",""]]}
{"id":"2308.15360","submitter":"Christian Hespe","authors":"Christian Hespe, Herbert Werner","title":"A Scalable Approach for Analysing Multi-Agent Systems with Heterogeneous\n  Stochastic Packet Loss","comments":"8 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY math.OC","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  An important aspect in jointly analysing networked control systems and their\ncommunication is to model the networking in a sufficiently rich but at the same\ntime mathematically tractable way. As such, this paper improves on a recently\nproposed scalable approach for analysing multi-agent systems with stochastic\npacket loss by allowing for heterogeneous transmission probabilities and\ntemporal correlation in the communication model. The key idea is to consider\nthe transmission probabilities as uncertain, which facilitates the use of tools\nfrom robust control. Due to being formulated in terms of linear matrix\ninequalities that grow linearly with the number of agents, the result is\napplicable to very large multi-agent systems, which is demonstrated by\nnumerical simulations with up to 10000 agents.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:56:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hespe","Christian",""],["Werner","Herbert",""]]}
{"id":"2308.15361","submitter":"Hossein Haeri","authors":"Hossein Haeri, Kshitij Jerath, Jacob Leachman","title":"Thermodynamics-inspired Macroscopic States of Bounded Swarms","comments":null,"journal-ref":"ASME Letters in Dynamic Systems and Control 1.1 (2021): 011015","doi":"10.1115/1.4046580","report-no":null,"categories":"nlin.AO cs.RO physics.flu-dyn","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The collective behavior of swarms is extremely difficult to estimate or\npredict, even when the local agent rules are known and simple. The presented\nwork seeks to leverage the similarities between fluids and swarm systems to\ngenerate a thermodynamics-inspired characterization of the collective behavior\nof robotic swarms. While prior works have borrowed tools from fluid dynamics to\ndesign swarming behaviors, they have usually avoided the task of generating a\nfluids-inspired macroscopic state (or macrostate) description of the swarm.\nThis work will bridge the gap by seeking to answer the following question: is\nit possible to generate a small set of thermodynamics-inspired macroscopic\nproperties that may later be used to quantify all possible collective behaviors\nof swarm systems? In this paper, we present three macroscopic properties\nanalogous to pressure, temperature, and density of a gas, to describe the\nbehavior of a swarm that is governed by only attractive and repulsive agent\ninteractions. These properties are made to satisfy an equation similar to the\nideal gas law, and also generalized to satisfy the virial equation of state for\nreal gases. Finally, we investigate how swarm specifications such as density\nand average agent velocity affect the system macrostate.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:56:36 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Haeri","Hossein",""],["Jerath","Kshitij",""],["Leachman","Jacob",""]]}
{"id":"2308.15362","submitter":"Lianjin Wu","authors":"BESIII Collaboration: M. Ablikim, M. N. Achasov, P. Adlarson, X. C.\n  Ai, R. Aliberti, A. Amoroso, M. R. An, Q. An, Y. Bai, O. Bakina, I.\n  Balossino, Y. Ban, V. Batozskaya, K. Begzsuren, N. Berger, M. Berlowski, M.\n  Bertani, D. Bettoni, F. Bianchi, E. Bianco, A. Bortone, I. Boyko, R. A.\n  Briere, A. Brueggemann, H. Cai, X. Cai, A. Calcaterra, G. F. Cao, N. Cao, S.\n  A. Cetin, J. F. Chang, T. T. Chang, W. L. Chang, G. R. Che, G. Chelkov, C.\n  Chen, Chao Chen, G. Chen, H. S. Chen, M. L. Chen, S. J. Chen, S. M. Chen, T.\n  Chen, X. R. Chen, X. T. Chen, Y. B. Chen, Y. Q. Chen, Z. J. Chen, W. S.\n  Cheng, S. K. Choi, X. Chu, G. Cibinetto, S. C. Coen, F. Cossio, J. J. Cui, H.\n  L. Dai, J. P. Dai, A. Dbeyssi, R. E. de Boer, D. Dedovich, Z. Y. Deng, A.\n  Denig, I. Denysenko, M. Destefanis, F. De Mori, B. Ding, X. X. Ding, Y. Ding,\n  Y. Ding, J. Dong, L. Y. Dong, M. Y. Dong, X. Dong, M. C. Du, S. X. Du, Z. H.\n  Duan, P. Egorov, Y.H. Y. Fan, Y. L. Fan, J. Fang, S. S. Fang, W. X. Fang, Y.\n  Fang, R. Farinelli, L. Fava, F. Feldbauer, G. Felici, C. Q. Feng, J. H. Feng,\n  K Fischer, M. Fritsch, C. Fritzsch, C. D. Fu, J. L. Fu, Y. W. Fu, H. Gao, Y.\n  N. Gao, Yang Gao, S. Garbolino, I. Garzia, P. T. Ge, Z. W. Ge, C. Geng, E. M.\n  Gersabeck, A Gilman, K. Goetzen, L. Gong, W. X. Gong, W. Gradl, S. Gramigna,\n  M. Greco, M. H. Gu, C. Y Guan, Z. L. Guan, A. Q. Guo, L. B. Guo, M. J. Guo,\n  R. P. Guo, Y. P. Guo, A. Guskov, T. T. Han, W. Y. Han, X. Q. Hao, F. A.\n  Harris, K. K. He, K. L. He, F. H H. Heinsius, C. H. Heinz, Y. K. Heng, C.\n  Herold, T. Holtmann, P. C. Hong, G. Y. Hou, X. T. Hou, Y. R. Hou, Z. L. Hou,\n  H. M. Hu, J. F. Hu, T. Hu, Y. Hu, G. S. Huang, K. X. Huang, L. Q. Huang, X.\n  T. Huang, Y. P. Huang, T. Hussain, N H\\\"usken, W. Imoehl, J. Jackson, S.\n  Jaeger, S. Janchiv, J. H. Jeong, Q. Ji, Q. P. Ji, X. B. Ji, X. L. Ji, Y. Y.\n  Ji, X. Q. Jia, Z. K. Jia, H. J. Jiang, P. C. Jiang, S. S. Jiang, T. J. Jiang,\n  X. S. Jiang, Y. Jiang, J. B. Jiao, Z. Jiao, S. Jin, Y. Jin, M. Q. Jing, T.\n  Johansson, X. K., S. Kabana, N. Kalantar-Nayestanaki, X. L. Kang, X. S. Kang,\n  M. Kavatsyuk, B. C. Ke, A. Khoukaz, R. Kiuchi, R. Kliemt, O. B. Kolcu, B.\n  Kopf, M. Kuessner, A. Kupsc, W. K\\\"uhn, J. J. Lane, P. Larin, A. Lavania, L.\n  Lavezzi, T. T. Lei, Z. H. Lei, H. Leithoff, M. Lellmann, T. Lenz, C. Li, C.\n  Li, C. H. Li, Cheng Li, D. M. Li, F. Li, G. Li, H. Li, H. B. Li, H. J. Li, H.\n  N. Li, Hui Li, J. R. Li, J. S. Li, J. W. Li, K. L. Li, Ke Li, L. J Li, L. K.\n  Li, Lei Li, M. H. Li, P. R. Li, Q. X. Li, S. X. Li, T. Li, W. D. Li, W. G.\n  Li, X. H. Li, X. L. Li, Xiaoyu Li, Y. G. Li, Z. J. Li, C. Liang, H. Liang, H.\n  Liang, H. Liang, Y. F. Liang, Y. T. Liang, G. R. Liao, L. Z. Liao, Y. P.\n  Liao, J. Libby, A. Limphirat, D. X. Lin, T. Lin, B. J. Liu, B. X. Liu, C.\n  Liu, C. X. Liu, F. H. Liu, Fang Liu, Feng Liu, G. M. Liu, H. Liu, H. M. Liu,\n  Huanhuan Liu, Huihui Liu, J. B. Liu, J. L. Liu, J. Y. Liu, K. Liu, K. Y. Liu,\n  Ke Liu, L. Liu, L. C. Liu, Lu Liu, M. H. Liu, P. L. Liu, Q. Liu, S. B. Liu,\n  T. Liu, W. K. Liu, W. M. Liu, X. Liu, Y. Liu, Y. Liu, Y. B. Liu, Z. A. Liu,\n  Z. Q. Liu, X. C. Lou, F. X. Lu, H. J. Lu, J. G. Lu, X. L. Lu, Y. Lu, Y. P.\n  Lu, Z. H. Lu, C. L. Luo, M. X. Luo, T. Luo, X. L. Luo, X. R. Lyu, Y. F. Lyu,\n  F. C. Ma, H. L. Ma, J. L. Ma, L. L. Ma, M. M. Ma, Q. M. Ma, R. Q. Ma, R. T.\n  Ma, X. Y. Ma, Y. Ma, Y. M. Ma, F. E. Maas, M. Maggiora, S. Malde, Q. A.\n  Malik, A. Mangoni, Y. J. Mao, Z. P. Mao, S. Marcello, Z. X. Meng, J. G.\n  Messchendorp, G. Mezzadri, H. Miao, T. J. Min, R. E. Mitchell, X. H. Mo, N.\n  Yu. Muchnoi, J. Muskalla, Y. Nefedov, F. Nerling, I. B. Nikolaev, Z. Ning, S.\n  Nisar, W. D. Niu, Y. Niu, S. L. Olsen, Q. Ouyang, S. Pacetti, X. Pan, Y. Pan,\n  A. Pathak, P. Patteri, Y. P. Pei, M. Pelizaeus, H. P. Peng, K. Peters, J. L.\n  Ping, R. G. Ping, S. Plura, S. Pogodin, V. Prasad, F. Z. Qi, H. Qi, H. R. Qi,\n  M. Qi, T. Y. Qi, S. Qian, W. B. Qian, C. F. Qiao, J. J. Qin, L. Q. Qin, X. P.\n  Qin, X. S. Qin, Z. H. Qin, J. F. Qiu, S. Q. Qu, C. F. Redmer, K. J. Ren, A.\n  Rivetti, M. Rolo, G. Rong, Ch. Rosner, S. N. Ruan, N. Salone, A. Sarantsev,\n  Y. Schelhaas, K. Schoenning, M. Scodeggio, K. Y. Shan, W. Shan, X. Y. Shan,\n  J. F. Shangguan, L. G. Shao, M. Shao, C. P. Shen, H. F. Shen, W. H. Shen, X.\n  Y. Shen, B. A. Shi, H. C. Shi, J. L. Shi, J. Y. Shi, Q. Q. Shi, R. S. Shi, X.\n  Shi, J. J. Song, T. Z. Song, W. M. Song, Y. J. Song, Y. X. Song, S. Sosio, S.\n  Spataro, F. Stieler, Y. J. Su, G. B. Sun, G. X. Sun, H. Sun, H. K. Sun, J. F.\n  Sun, K. Sun, L. Sun, S. S. Sun, T. Sun, W. Y. Sun, Y. Sun, Y. J. Sun, Y. Z.\n  Sun, Z. T. Sun, Y. X. Tan, C. J. Tang, G. Y. Tang, J. Tang, Y. A. Tang, L. Y\n  Tao, Q. T. Tao, M. Tat, J. X. Teng, V. Thoren, W. H. Tian, W. H. Tian, Y.\n  Tian, Z. F. Tian, I. Uman, S. J. Wang, B. Wang, B. L. Wang, Bo Wang, C. W.\n  Wang, D. Y. Wang, F. Wang, H. J. Wang, H. P. Wang, J. P. Wang, K. Wang, L. L.\n  Wang, M. Wang, Meng Wang, S. Wang, S. Wang, T. Wang, T. J. Wang, W. Wang, W.\n  Wang, W. P. Wang, X. Wang, X. F. Wang, X. J. Wang, X. L. Wang, Y. Wang, Y. D.\n  Wang, Y. F. Wang, Y. H. Wang, Y. N. Wang, Y. Q. Wang, Yaqian Wang, Yi Wang,\n  Z. Wang, Z. L. Wang, Z. Y. Wang, Ziyi Wang, D. Wei, D. H. Wei, F. Weidner, S.\n  P. Wen, C. W. Wenzel, U. Wiedner, G. Wilkinson, M. Wolke, L. Wollenberg, C.\n  Wu, J. F. Wu, L. H. Wu, L. J. Wu, X. Wu, X. H. Wu, Y. Wu, Y. H. Wu, Y. J. Wu,\n  Z. Wu, L. Xia, X. M. Xian, T. Xiang, D. Xiao, G. Y. Xiao, S. Y. Xiao, Y. L.\n  Xiao, Z. J. Xiao, C. Xie, X. H. Xie, Y. Xie, Y. G. Xie, Y. H. Xie, Z. P. Xie,\n  T. Y. Xing, C. F. Xu, C. J. Xu, G. F. Xu, H. Y. Xu, Q. J. Xu, Q. N. Xu, W.\n  Xu, W. L. Xu, X. P. Xu, Y. C. Xu, Z. P. Xu, Z. S. Xu, F. Yan, L. Yan, W. B.\n  Yan, W. C. Yan, X. Q. Yan, H. J. Yang, H. L. Yang, H. X. Yang, Tao Yang, Y.\n  Yang, Y. F. Yang, Y. X. Yang, Yifan Yang, Z. W. Yang, Z. P. Yao, M. Ye, M. H.\n  Ye, J. H. Yin, Z. Y. You, B. X. Yu, C. X. Yu, G. Yu, J. S. Yu, T. Yu, X. D.\n  Yu, C. Z. Yuan, L. Yuan, S. C. Yuan, X. Q. Yuan, Y. Yuan, Z. Y. Yuan, C. X.\n  Yue, A. A. Zafar, F. R. Zeng, X. Zeng, Y. Zeng, Y. J. Zeng, X. Y. Zhai, Y. C.\n  Zhai, Y. H. Zhan, A. Q. Zhang, B. L. Zhang, B. X. Zhang, D. H. Zhang, G. Y.\n  Zhang, H. Zhang, H. H. Zhang, H. H. Zhang, H. Q. Zhang, H. Y. Zhang, J.\n  Zhang, J. J. Zhang, J. L. Zhang, J. Q. Zhang, J. W. Zhang, J. X. Zhang, J. Y.\n  Zhang, J. Z. Zhang, Jianyu Zhang, Jiawei Zhang, L. M. Zhang, L. Q. Zhang, Lei\n  Zhang, P. Zhang, Q. Y. Zhang, Shuihan Zhang, Shulei Zhang, X. D. Zhang, X. M.\n  Zhang, X. Y. Zhang, Xuyan Zhang, Y. Zhang, Y. Zhang, Y. T. Zhang, Y. H.\n  Zhang, Yan Zhang, Yao Zhang, Z. H. Zhang, Z. L. Zhang, Z. Y. Zhang, Z. Y.\n  Zhang, G. Zhao, J. Zhao, J. Y. Zhao, J. Z. Zhao, Lei Zhao, Ling Zhao, M. G.\n  Zhao, S. J. Zhao, Y. B. Zhao, Y. X. Zhao, Z. G. Zhao, A. Zhemchugov, B.\n  Zheng, J. P. Zheng, W. J. Zheng, Y. H. Zheng, B. Zhong, X. Zhong, H. Zhou, L.\n  P. Zhou, X. Zhou, X. K. Zhou, X. R. Zhou, X. Y. Zhou, Y. Z. Zhou, J. Zhu, K.\n  Zhu, K. J. Zhu, L. Zhu, L. X. Zhu, S. H. Zhu, S. Q. Zhu, T. J. Zhu, W. J.\n  Zhu, Y. C. Zhu, Z. A. Zhu, J. H. Zou, J. Zu","title":"Observation of a vector charmoniumlike state at 4.7 ${\\rm GeV}/c^2$ and\n  search for $Z_{cs}$ in $e^+e^-\\to K^+K^-J/\\psi$","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Using data samples with an integrated luminosity of 5.85~fb$^{-1}$ collected\nat center-of-mass energies from 4.61 to 4.95 GeV with the BESIII detector\noperating at the BEPCII storage ring, we measure the cross section for the\nprocess $e^+e^-\\to K^+K^-J/\\psi$. A new resonance with a mass of $M =\n4708_{-15}^{+17}\\pm21$ MeV/$c^{2}$ and a width of $\\Gamma =\n126_{-23}^{+27}\\pm30$ MeV is observed in the energy-dependent line shape of the\n$e^+e^-\\to K^+K^-J/\\psi$ cross section with a significance over $5\\sigma$. The\n$K^{+}J/\\psi$ system is also investigated to search for charged charmoniumlike\nstates, but no significant $Z_{cs}^+$ states are observed. Upper limits on the\nBorn cross sections for $e^+e^-\\to K^{-} Z_{cs}(3985)^{+}/K^{-}\nZ_{cs}(4000)^{+} + c.c.$ with $Z_{cs}(3985)^{\\pm}/Z_{cs}(4000)^{\\pm}\\to K^{\\pm}\nJ/\\psi$ are reported at 90\\% confidence levels. The ratio of branching\nfractions $\\frac{\\mathcal{B}(Z_{cs}(3985)^{+}\\to K^+\nJ/\\psi)}{\\mathcal{B}(Z_{cs}(3985)^{+}\\to (\\bar{D}^{0}D_s^{*+} +\n\\bar{D}^{*0}D_s^+))}$ is measured to be less than 0.03 at 90\\% confidence\nlevel.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:57:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["BESIII Collaboration","",""],["Ablikim","M.",""],["Achasov","M. N.",""],["Adlarson","P.",""],["Ai","X. C.",""],["Aliberti","R.",""],["Amoroso","A.",""],["An","M. R.",""],["An","Q.",""],["Bai","Y.",""],["Bakina","O.",""],["Balossino","I.",""],["Ban","Y.",""],["Batozskaya","V.",""],["Begzsuren","K.",""],["Berger","N.",""],["Berlowski","M.",""],["Bertani","M.",""],["Bettoni","D.",""],["Bianchi","F.",""],["Bianco","E.",""],["Bortone","A.",""],["Boyko","I.",""],["Briere","R. A.",""],["Brueggemann","A.",""],["Cai","H.",""],["Cai","X.",""],["Calcaterra","A.",""],["Cao","G. F.",""],["Cao","N.",""],["Cetin","S. A.",""],["Chang","J. F.",""],["Chang","T. T.",""],["Chang","W. L.",""],["Che","G. R.",""],["Chelkov","G.",""],["Chen","C.",""],["Chen","Chao",""],["Chen","G.",""],["Chen","H. S.",""],["Chen","M. L.",""],["Chen","S. J.",""],["Chen","S. M.",""],["Chen","T.",""],["Chen","X. R.",""],["Chen","X. T.",""],["Chen","Y. B.",""],["Chen","Y. Q.",""],["Chen","Z. J.",""],["Cheng","W. S.",""],["Choi","S. K.",""],["Chu","X.",""],["Cibinetto","G.",""],["Coen","S. C.",""],["Cossio","F.",""],["Cui","J. J.",""],["Dai","H. L.",""],["Dai","J. P.",""],["Dbeyssi","A.",""],["de Boer","R. E.",""],["Dedovich","D.",""],["Deng","Z. Y.",""],["Denig","A.",""],["Denysenko","I.",""],["Destefanis","M.",""],["De Mori","F.",""],["Ding","B.",""],["Ding","X. X.",""],["Ding","Y.",""],["Ding","Y.",""],["Dong","J.",""],["Dong","L. Y.",""],["Dong","M. Y.",""],["Dong","X.",""],["Du","M. C.",""],["Du","S. X.",""],["Duan","Z. H.",""],["Egorov","P.",""],["Fan","Y. H. Y.",""],["Fan","Y. L.",""],["Fang","J.",""],["Fang","S. S.",""],["Fang","W. X.",""],["Fang","Y.",""],["Farinelli","R.",""],["Fava","L.",""],["Feldbauer","F.",""],["Felici","G.",""],["Feng","C. Q.",""],["Feng","J. H.",""],["Fischer","K",""],["Fritsch","M.",""],["Fritzsch","C.",""],["Fu","C. D.",""],["Fu","J. L.",""],["Fu","Y. W.",""],["Gao","H.",""],["Gao","Y. N.",""],["Gao","Yang",""],["Garbolino","S.",""],["Garzia","I.",""],["Ge","P. T.",""],["Ge","Z. W.",""],["Geng","C.",""],["Gersabeck","E. M.",""],["Gilman","A",""],["Goetzen","K.",""],["Gong","L.",""],["Gong","W. X.",""],["Gradl","W.",""],["Gramigna","S.",""],["Greco","M.",""],["Gu","M. H.",""],["Guan","C. Y",""],["Guan","Z. L.",""],["Guo","A. Q.",""],["Guo","L. B.",""],["Guo","M. J.",""],["Guo","R. P.",""],["Guo","Y. P.",""],["Guskov","A.",""],["Han","T. T.",""],["Han","W. Y.",""],["Hao","X. Q.",""],["Harris","F. A.",""],["He","K. K.",""],["He","K. L.",""],["Heinsius","F. H H.",""],["Heinz","C. H.",""],["Heng","Y. K.",""],["Herold","C.",""],["Holtmann","T.",""],["Hong","P. C.",""],["Hou","G. Y.",""],["Hou","X. T.",""],["Hou","Y. R.",""],["Hou","Z. L.",""],["Hu","H. M.",""],["Hu","J. F.",""],["Hu","T.",""],["Hu","Y.",""],["Huang","G. S.",""],["Huang","K. X.",""],["Huang","L. Q.",""],["Huang","X. T.",""],["Huang","Y. P.",""],["Hussain","T.",""],["H\u00fcsken","N",""],["Imoehl","W.",""],["Jackson","J.",""],["Jaeger","S.",""],["Janchiv","S.",""],["Jeong","J. H.",""],["Ji","Q.",""],["Ji","Q. P.",""],["Ji","X. B.",""],["Ji","X. L.",""],["Ji","Y. Y.",""],["Jia","X. Q.",""],["Jia","Z. K.",""],["Jiang","H. J.",""],["Jiang","P. C.",""],["Jiang","S. S.",""],["Jiang","T. J.",""],["Jiang","X. S.",""],["Jiang","Y.",""],["Jiao","J. B.",""],["Jiao","Z.",""],["Jin","S.",""],["Jin","Y.",""],["Jing","M. Q.",""],["Johansson","T.",""],["K.","X.",""],["Kabana","S.",""],["Kalantar-Nayestanaki","N.",""],["Kang","X. L.",""],["Kang","X. S.",""],["Kavatsyuk","M.",""],["Ke","B. C.",""],["Khoukaz","A.",""],["Kiuchi","R.",""],["Kliemt","R.",""],["Kolcu","O. B.",""],["Kopf","B.",""],["Kuessner","M.",""],["Kupsc","A.",""],["K\u00fchn","W.",""],["Lane","J. J.",""],["Larin","P.",""],["Lavania","A.",""],["Lavezzi","L.",""],["Lei","T. T.",""],["Lei","Z. H.",""],["Leithoff","H.",""],["Lellmann","M.",""],["Lenz","T.",""],["Li","C.",""],["Li","C.",""],["Li","C. H.",""],["Li","Cheng",""],["Li","D. M.",""],["Li","F.",""],["Li","G.",""],["Li","H.",""],["Li","H. B.",""],["Li","H. J.",""],["Li","H. N.",""],["Li","Hui",""],["Li","J. R.",""],["Li","J. S.",""],["Li","J. W.",""],["Li","K. L.",""],["Li","Ke",""],["Li","L. J",""],["Li","L. K.",""],["Li","Lei",""],["Li","M. H.",""],["Li","P. R.",""],["Li","Q. X.",""],["Li","S. X.",""],["Li","T.",""],["Li","W. D.",""],["Li","W. G.",""],["Li","X. H.",""],["Li","X. L.",""],["Li","Xiaoyu",""],["Li","Y. G.",""],["Li","Z. J.",""],["Liang","C.",""],["Liang","H.",""],["Liang","H.",""],["Liang","H.",""],["Liang","Y. F.",""],["Liang","Y. T.",""],["Liao","G. R.",""],["Liao","L. Z.",""],["Liao","Y. P.",""],["Libby","J.",""],["Limphirat","A.",""],["Lin","D. X.",""],["Lin","T.",""],["Liu","B. J.",""],["Liu","B. X.",""],["Liu","C.",""],["Liu","C. X.",""],["Liu","F. H.",""],["Liu","Fang",""],["Liu","Feng",""],["Liu","G. M.",""],["Liu","H.",""],["Liu","H. M.",""],["Liu","Huanhuan",""],["Liu","Huihui",""],["Liu","J. B.",""],["Liu","J. L.",""],["Liu","J. Y.",""],["Liu","K.",""],["Liu","K. Y.",""],["Liu","Ke",""],["Liu","L.",""],["Liu","L. C.",""],["Liu","Lu",""],["Liu","M. H.",""],["Liu","P. L.",""],["Liu","Q.",""],["Liu","S. B.",""],["Liu","T.",""],["Liu","W. K.",""],["Liu","W. M.",""],["Liu","X.",""],["Liu","Y.",""],["Liu","Y.",""],["Liu","Y. B.",""],["Liu","Z. A.",""],["Liu","Z. Q.",""],["Lou","X. C.",""],["Lu","F. X.",""],["Lu","H. J.",""],["Lu","J. G.",""],["Lu","X. L.",""],["Lu","Y.",""],["Lu","Y. P.",""],["Lu","Z. H.",""],["Luo","C. L.",""],["Luo","M. X.",""],["Luo","T.",""],["Luo","X. L.",""],["Lyu","X. R.",""],["Lyu","Y. F.",""],["Ma","F. C.",""],["Ma","H. L.",""],["Ma","J. L.",""],["Ma","L. L.",""],["Ma","M. M.",""],["Ma","Q. M.",""],["Ma","R. Q.",""],["Ma","R. T.",""],["Ma","X. Y.",""],["Ma","Y.",""],["Ma","Y. M.",""],["Maas","F. E.",""],["Maggiora","M.",""],["Malde","S.",""],["Malik","Q. A.",""],["Mangoni","A.",""],["Mao","Y. J.",""],["Mao","Z. P.",""],["Marcello","S.",""],["Meng","Z. X.",""],["Messchendorp","J. G.",""],["Mezzadri","G.",""],["Miao","H.",""],["Min","T. J.",""],["Mitchell","R. E.",""],["Mo","X. H.",""],["Muchnoi","N. Yu.",""],["Muskalla","J.",""],["Nefedov","Y.",""],["Nerling","F.",""],["Nikolaev","I. B.",""],["Ning","Z.",""],["Nisar","S.",""],["Niu","W. D.",""],["Niu","Y.",""],["Olsen","S. L.",""],["Ouyang","Q.",""],["Pacetti","S.",""],["Pan","X.",""],["Pan","Y.",""],["Pathak","A.",""],["Patteri","P.",""],["Pei","Y. P.",""],["Pelizaeus","M.",""],["Peng","H. P.",""],["Peters","K.",""],["Ping","J. L.",""],["Ping","R. G.",""],["Plura","S.",""],["Pogodin","S.",""],["Prasad","V.",""],["Qi","F. Z.",""],["Qi","H.",""],["Qi","H. R.",""],["Qi","M.",""],["Qi","T. Y.",""],["Qian","S.",""],["Qian","W. B.",""],["Qiao","C. F.",""],["Qin","J. J.",""],["Qin","L. Q.",""],["Qin","X. P.",""],["Qin","X. S.",""],["Qin","Z. H.",""],["Qiu","J. F.",""],["Qu","S. Q.",""],["Redmer","C. F.",""],["Ren","K. J.",""],["Rivetti","A.",""],["Rolo","M.",""],["Rong","G.",""],["Rosner","Ch.",""],["Ruan","S. N.",""],["Salone","N.",""],["Sarantsev","A.",""],["Schelhaas","Y.",""],["Schoenning","K.",""],["Scodeggio","M.",""],["Shan","K. Y.",""],["Shan","W.",""],["Shan","X. Y.",""],["Shangguan","J. F.",""],["Shao","L. G.",""],["Shao","M.",""],["Shen","C. P.",""],["Shen","H. F.",""],["Shen","W. H.",""],["Shen","X. Y.",""],["Shi","B. A.",""],["Shi","H. C.",""],["Shi","J. L.",""],["Shi","J. Y.",""],["Shi","Q. Q.",""],["Shi","R. S.",""],["Shi","X.",""],["Song","J. J.",""],["Song","T. Z.",""],["Song","W. M.",""],["Song","Y. J.",""],["Song","Y. X.",""],["Sosio","S.",""],["Spataro","S.",""],["Stieler","F.",""],["Su","Y. J.",""],["Sun","G. B.",""],["Sun","G. X.",""],["Sun","H.",""],["Sun","H. K.",""],["Sun","J. F.",""],["Sun","K.",""],["Sun","L.",""],["Sun","S. S.",""],["Sun","T.",""],["Sun","W. Y.",""],["Sun","Y.",""],["Sun","Y. J.",""],["Sun","Y. Z.",""],["Sun","Z. T.",""],["Tan","Y. X.",""],["Tang","C. J.",""],["Tang","G. Y.",""],["Tang","J.",""],["Tang","Y. A.",""],["Tao","L. Y",""],["Tao","Q. T.",""],["Tat","M.",""],["Teng","J. X.",""],["Thoren","V.",""],["Tian","W. H.",""],["Tian","W. H.",""],["Tian","Y.",""],["Tian","Z. F.",""],["Uman","I.",""],["Wang","S. J.",""],["Wang","B.",""],["Wang","B. L.",""],["Wang","Bo",""],["Wang","C. W.",""],["Wang","D. Y.",""],["Wang","F.",""],["Wang","H. J.",""],["Wang","H. P.",""],["Wang","J. P.",""],["Wang","K.",""],["Wang","L. L.",""],["Wang","M.",""],["Wang","Meng",""],["Wang","S.",""],["Wang","S.",""],["Wang","T.",""],["Wang","T. J.",""],["Wang","W.",""],["Wang","W.",""],["Wang","W. P.",""],["Wang","X.",""],["Wang","X. F.",""],["Wang","X. J.",""],["Wang","X. L.",""],["Wang","Y.",""],["Wang","Y. D.",""],["Wang","Y. F.",""],["Wang","Y. H.",""],["Wang","Y. N.",""],["Wang","Y. Q.",""],["Wang","Yaqian",""],["Wang","Yi",""],["Wang","Z.",""],["Wang","Z. L.",""],["Wang","Z. Y.",""],["Wang","Ziyi",""],["Wei","D.",""],["Wei","D. H.",""],["Weidner","F.",""],["Wen","S. P.",""],["Wenzel","C. W.",""],["Wiedner","U.",""],["Wilkinson","G.",""],["Wolke","M.",""],["Wollenberg","L.",""],["Wu","C.",""],["Wu","J. F.",""],["Wu","L. H.",""],["Wu","L. J.",""],["Wu","X.",""],["Wu","X. H.",""],["Wu","Y.",""],["Wu","Y. H.",""],["Wu","Y. J.",""],["Wu","Z.",""],["Xia","L.",""],["Xian","X. M.",""],["Xiang","T.",""],["Xiao","D.",""],["Xiao","G. Y.",""],["Xiao","S. Y.",""],["Xiao","Y. L.",""],["Xiao","Z. J.",""],["Xie","C.",""],["Xie","X. H.",""],["Xie","Y.",""],["Xie","Y. G.",""],["Xie","Y. H.",""],["Xie","Z. P.",""],["Xing","T. Y.",""],["Xu","C. F.",""],["Xu","C. J.",""],["Xu","G. F.",""],["Xu","H. Y.",""],["Xu","Q. J.",""],["Xu","Q. N.",""],["Xu","W.",""],["Xu","W. L.",""],["Xu","X. P.",""],["Xu","Y. C.",""],["Xu","Z. P.",""],["Xu","Z. S.",""],["Yan","F.",""],["Yan","L.",""],["Yan","W. B.",""],["Yan","W. C.",""],["Yan","X. Q.",""],["Yang","H. J.",""],["Yang","H. L.",""],["Yang","H. X.",""],["Yang","Tao",""],["Yang","Y.",""],["Yang","Y. F.",""],["Yang","Y. X.",""],["Yang","Yifan",""],["Yang","Z. W.",""],["Yao","Z. P.",""],["Ye","M.",""],["Ye","M. H.",""],["Yin","J. H.",""],["You","Z. Y.",""],["Yu","B. X.",""],["Yu","C. X.",""],["Yu","G.",""],["Yu","J. S.",""],["Yu","T.",""],["Yu","X. D.",""],["Yuan","C. Z.",""],["Yuan","L.",""],["Yuan","S. C.",""],["Yuan","X. Q.",""],["Yuan","Y.",""],["Yuan","Z. Y.",""],["Yue","C. X.",""],["Zafar","A. A.",""],["Zeng","F. R.",""],["Zeng","X.",""],["Zeng","Y.",""],["Zeng","Y. J.",""],["Zhai","X. Y.",""],["Zhai","Y. C.",""],["Zhan","Y. H.",""],["Zhang","A. Q.",""],["Zhang","B. L.",""],["Zhang","B. X.",""],["Zhang","D. H.",""],["Zhang","G. Y.",""],["Zhang","H.",""],["Zhang","H. H.",""],["Zhang","H. H.",""],["Zhang","H. Q.",""],["Zhang","H. Y.",""],["Zhang","J.",""],["Zhang","J. J.",""],["Zhang","J. L.",""],["Zhang","J. Q.",""],["Zhang","J. W.",""],["Zhang","J. X.",""],["Zhang","J. Y.",""],["Zhang","J. Z.",""],["Zhang","Jianyu",""],["Zhang","Jiawei",""],["Zhang","L. M.",""],["Zhang","L. Q.",""],["Zhang","Lei",""],["Zhang","P.",""],["Zhang","Q. Y.",""],["Zhang","Shuihan",""],["Zhang","Shulei",""],["Zhang","X. D.",""],["Zhang","X. M.",""],["Zhang","X. Y.",""],["Zhang","Xuyan",""],["Zhang","Y.",""],["Zhang","Y.",""],["Zhang","Y. T.",""],["Zhang","Y. H.",""],["Zhang","Yan",""],["Zhang","Yao",""],["Zhang","Z. H.",""],["Zhang","Z. L.",""],["Zhang","Z. Y.",""],["Zhang","Z. Y.",""],["Zhao","G.",""],["Zhao","J.",""],["Zhao","J. Y.",""],["Zhao","J. Z.",""],["Zhao","Lei",""],["Zhao","Ling",""],["Zhao","M. G.",""],["Zhao","S. J.",""],["Zhao","Y. B.",""],["Zhao","Y. X.",""],["Zhao","Z. G.",""],["Zhemchugov","A.",""],["Zheng","B.",""],["Zheng","J. P.",""],["Zheng","W. J.",""],["Zheng","Y. H.",""],["Zhong","B.",""],["Zhong","X.",""],["Zhou","H.",""],["Zhou","L. P.",""],["Zhou","X.",""],["Zhou","X. K.",""],["Zhou","X. R.",""],["Zhou","X. Y.",""],["Zhou","Y. Z.",""],["Zhu","J.",""],["Zhu","K.",""],["Zhu","K. J.",""],["Zhu","L.",""],["Zhu","L. X.",""],["Zhu","S. H.",""],["Zhu","S. Q.",""],["Zhu","T. J.",""],["Zhu","W. J.",""],["Zhu","Y. C.",""],["Zhu","Z. A.",""],["Zou","J. H.",""],["Zu","J.",""]]}
{"id":"2308.15363","submitter":"Dawei Gao","authors":"Dawei Gao, Haibin Wang, Yaliang Li, Xiuyu Sun, Yichen Qian, Bolin\n  Ding, Jingren Zhou","title":"Text-to-SQL Empowered by Large Language Models: A Benchmark Evaluation","comments":"We have released code on https://github.com/BeachWang/DAIL-SQL","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DB cs.CL cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Large language models (LLMs) have emerged as a new paradigm for Text-to-SQL\ntask. However, the absence of a systematical benchmark inhibits the development\nof designing effective, efficient and economic LLM-based Text-to-SQL solutions.\nTo address this challenge, in this paper, we first conduct a systematical and\nextensive comparison over existing prompt engineering methods, including\nquestion representation, example selection and example organization, and with\nthese experimental results, we elaborates their pros and cons. Based on these\nfindings, we propose a new integrated solution, named DAIL-SQL, which refreshes\nthe Spider leaderboard with 86.6% execution accuracy and sets a new bar.\nTowards an efficient and economic LLM-based Text-to-SQL solution, we emphasize\nthe token efficiency in prompt engineering and compare the prior studies under\nthis metric. Additionally, we investigate open-source LLMs in in-context\nlearning, and further enhance their performance with task-specific supervised\nfine-tuning. Our explorations highlight open-source LLMs' potential in\nText-to-SQL, as well as the advantages and disadvantages of the task-specific\nsupervised fine-tuning. We hope that our work provides a deeper understanding\nof Text-to-SQL with LLMs, and inspire further investigations and broad\napplications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 14:59:54 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gao","Dawei",""],["Wang","Haibin",""],["Li","Yaliang",""],["Sun","Xiuyu",""],["Qian","Yichen",""],["Ding","Bolin",""],["Zhou","Jingren",""]]}
{"id":"2308.15364","submitter":"Feng Zhou","authors":"Feng Zhou, Quyu Kong, Zhijie Deng, Fengxiang He, Peng Cui, Jun Zhu","title":"Heterogeneous Multi-Task Gaussian Cox Processes","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper presents a novel extension of multi-task Gaussian Cox processes\nfor modeling multiple heterogeneous correlated tasks jointly, e.g.,\nclassification and regression, via multi-output Gaussian processes (MOGP). A\nMOGP prior over the parameters of the dedicated likelihoods for classification,\nregression and point process tasks can facilitate sharing of information\nbetween heterogeneous tasks, while allowing for nonparametric parameter\nestimation. To circumvent the non-conjugate Bayesian inference in the MOGP\nmodulated heterogeneous multi-task framework, we employ the data augmentation\ntechnique and derive a mean-field approximation to realize closed-form\niterative updates for estimating model parameters. We demonstrate the\nperformance and inference on both 1D synthetic data as well as 2D urban data of\nVancouver.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:01:01 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Feng",""],["Kong","Quyu",""],["Deng","Zhijie",""],["He","Fengxiang",""],["Cui","Peng",""],["Zhu","Jun",""]]}
{"id":"2308.15365","submitter":"Mariella Gregorich","authors":"Mariella Gregorich, Sean L. Simpson and Georg Heinze","title":"Flexible parametrization of graph-theoretical features from\n  individual-specific networks for prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME stat.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Statistical techniques are needed to analyse data structures with complex\ndependencies such that clinically useful information can be extracted.\nIndividual-specific networks, which capture dependencies in complex biological\nsystems, are often summarized by graph-theoretical features. These features,\nwhich lend themselves to outcome modelling, can be subject to high variability\ndue to arbitrary decisions in network inference and noise. Correlation-based\nadjacency matrices often need to be sparsified before meaningful\ngraph-theoretical features can be extracted, requiring the data analysts to\ndetermine an optimal threshold.. To address this issue, we propose to\nincorporate a flexible weighting function over the full range of possible\nthresholds to capture the variability of graph-theoretical features over the\nthreshold domain. The potential of this approach, which extends concepts from\nfunctional data analysis to a graph-theoretical setting, is explored in a\nplasmode simulation study using real functional magnetic resonance imaging\n(fMRI) data from the Autism Brain Imaging Data Exchange (ABIDE) Preprocessed\ninitiative. The simulations show that our modelling approach yields accurate\nestimates of the functional form of the weight function, improves inference\nefficiency, and achieves a comparable or reduced root mean square prediction\nerror compared to competitor modelling approaches. This assertion holds true in\nsettings where both complex functional forms underlie the outcome-generating\nprocess and a universal threshold value is employed. We demonstrate the\npractical utility of our approach by using resting-state fMRI data to predict\nbiological age in children. Our study establishes the flexible modelling\napproach as a statistically principled, serious competitor to ad-hoc methods\nwith superior performance.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:02:23 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gregorich","Mariella",""],["Simpson","Sean L.",""],["Heinze","Georg",""]]}
{"id":"2308.15366","submitter":"Zhaopeng Gu","authors":"Zhaopeng Gu, Bingke Zhu, Guibo Zhu, Yingying Chen, Ming Tang, Jinqiao\n  Wang","title":"AnomalyGPT: Detecting Industrial Anomalies using Large Vision-Language\n  Models","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Large Vision-Language Models (LVLMs) such as MiniGPT-4 and LLaVA have\ndemonstrated the capability of understanding images and achieved remarkable\nperformance in various visual tasks. Despite their strong abilities in\nrecognizing common objects due to extensive training datasets, they lack\nspecific domain knowledge and have a weaker understanding of localized details\nwithin objects, which hinders their effectiveness in the Industrial Anomaly\nDetection (IAD) task. On the other hand, most existing IAD methods only provide\nanomaly scores and necessitate the manual setting of thresholds to distinguish\nbetween normal and abnormal samples, which restricts their practical\nimplementation. In this paper, we explore the utilization of LVLM to address\nthe IAD problem and propose AnomalyGPT, a novel IAD approach based on LVLM. We\ngenerate training data by simulating anomalous images and producing\ncorresponding textual descriptions for each image. We also employ an image\ndecoder to provide fine-grained semantic and design a prompt learner to\nfine-tune the LVLM using prompt embeddings. Our AnomalyGPT eliminates the need\nfor manual threshold adjustments, thus directly assesses the presence and\nlocations of anomalies. Additionally, AnomalyGPT supports multi-turn dialogues\nand exhibits impressive few-shot in-context learning capabilities. With only\none normal shot, AnomalyGPT achieves the state-of-the-art performance with an\naccuracy of 86.1%, an image-level AUC of 94.1%, and a pixel-level AUC of 95.3%\non the MVTec-AD dataset. Code is available at\nhttps://github.com/CASIA-IVA-Lab/AnomalyGPT.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:02:53 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gu","Zhaopeng",""],["Zhu","Bingke",""],["Zhu","Guibo",""],["Chen","Yingying",""],["Tang","Ming",""],["Wang","Jinqiao",""]]}
{"id":"2308.15367","submitter":"Fu-En Yang","authors":"Fu-En Yang, Chien-Yi Wang, Yu-Chiang Frank Wang","title":"Efficient Model Personalization in Federated Learning via\n  Client-Specific Prompt Generation","comments":"Accepted by ICCV 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Federated learning (FL) emerges as a decentralized learning framework which\ntrains models from multiple distributed clients without sharing their data to\npreserve privacy. Recently, large-scale pre-trained models (e.g., Vision\nTransformer) have shown a strong capability of deriving robust representations.\nHowever, the data heterogeneity among clients, the limited computation\nresources, and the communication bandwidth restrict the deployment of\nlarge-scale models in FL frameworks. To leverage robust representations from\nlarge-scale models while enabling efficient model personalization for\nheterogeneous clients, we propose a novel personalized FL framework of\nclient-specific Prompt Generation (pFedPG), which learns to deploy a\npersonalized prompt generator at the server for producing client-specific\nvisual prompts that efficiently adapts frozen backbones to local data\ndistributions. Our proposed framework jointly optimizes the stages of\npersonalized prompt adaptation locally and personalized prompt generation\nglobally. The former aims to train visual prompts that adapt foundation models\nto each client, while the latter observes local optimization directions to\ngenerate personalized prompts for all clients. Through extensive experiments on\nbenchmark datasets, we show that our pFedPG is favorable against\nstate-of-the-art personalized FL methods under various types of data\nheterogeneity, allowing computation and communication efficient model\npersonalization.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:03:05 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yang","Fu-En",""],["Wang","Chien-Yi",""],["Wang","Yu-Chiang Frank",""]]}
{"id":"2308.15368","submitter":"Zexin Li","authors":"Zexin Li, Tao Ren, Xiaoxi He and Cong Liu","title":"RED: A Systematic Real-Time Scheduling Approach for Robotic\n  Environmental Dynamics","comments":"Accepted by RTSS 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.RO cs.AI cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Intelligent robots are designed to effectively navigate dynamic and\nunpredictable environments laden with moving mechanical elements and objects.\nSuch environment-induced dynamics, including moving obstacles, can readily\nalter the computational demand (e.g., the creation of new tasks) and the\nstructure of workloads (e.g., precedence constraints among tasks) during\nruntime, thereby adversely affecting overall system performance. This challenge\nis amplified when multi-task inference is expected on robots operating under\nstringent resource and real-time constraints. To address such a challenge, we\nintroduce RED, a systematic real-time scheduling approach designed to support\nmulti-task deep neural network workloads in resource-limited robotic systems.\nIt is designed to adaptively manage the Robotic Environmental Dynamics (RED)\nwhile adhering to real-time constraints. At the core of RED lies a\ndeadline-based scheduler that employs an intermediate deadline assignment\npolicy, effectively managing to change workloads and asynchronous inference\nprompted by complex, unpredictable environments. This scheduling framework also\nfacilitates the flexible deployment of MIMONet (multi-input multi-output neural\nnetworks), which are commonly utilized in multi-tasking robotic systems to\ncircumvent memory bottlenecks. Building on this scheduling framework, RED\nrecognizes and leverages a unique characteristic of MIMONet: its weight-shared\narchitecture. To further accommodate and exploit this feature, RED devises a\nnovel and effective workload refinement and reconstruction process. This\nprocess ensures the scheduling framework's compatibility with MIMONet and\nmaximizes efficiency.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:04:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Zexin",""],["Ren","Tao",""],["He","Xiaoxi",""],["Liu","Cong",""]]}
{"id":"2308.15369","submitter":"David Tannor","authors":"David J. Tannor","title":"Two Hundred Years After Hamilton: The Simple Axiom That Underlies\n  Classical Mechanics","comments":"arXiv admin note: text overlap with arXiv:2109.09094","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.class-ph physics.hist-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  In 1834-1835, Hamilton published two papers that revolutionized classical\nmechanics. In these papers, he introduced the Hamilton-Jacobi equation,\nHamilton's equations of motion and the principle of least action. These three\nformulations of classical mechanics became the forerunners of quantum\nmechanics, but none of these is what Hamilton was looking for: he was looking\nfor what he called the principal function, $S(q',q'',T)$, from which the entire\ntrajectory history can be obtained just by differentiation. Here we show that\nall of Hamilton's formulations can be derived just by assuming that the\nprincipal function is additive, $S(q',q'',T)=S(q',Q,t_1)+S(Q,q'',t_2)$ with\n$t_1+t_2=T$. This simple additivity axiom can be considered the fundamental\nprinciple of classical mechanics and shows that analytical mechanics is\nessentially just a footnote to the problem of finding the shortest path between\ntwo points. The simplicity of the formulation could provide new perspectives on\nsome of the major themes in classical mechanics including symplectic geometry,\nperiodic orbit theory and Morse theory, as well as giving new perspectives on\nquantum mechanics. Moreover, it could potentially provide a unified description\nof different areas of physics, leading to insight for example, into the\ntransition from deterministic dynamics to statistical mechanics.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:05:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tannor","David J.",""]]}
{"id":"2308.15370","submitter":"Taehee Lee","authors":"Taehee Lee and Jun S. Liu","title":"Multi-Response Heteroscedastic Gaussian Process Models and Their\n  Inference","comments":"submitted to the Journal of the American Statistical Association\n  (JASA)","journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ML cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Despite the widespread utilization of Gaussian process models for versatile\nnonparametric modeling, they exhibit limitations in effectively capturing\nabrupt changes in function smoothness and accommodating relationships with\nheteroscedastic errors. Addressing these shortcomings, the heteroscedastic\nGaussian process (HeGP) regression seeks to introduce flexibility by\nacknowledging the variability of residual variances across covariates in the\nregression model. In this work, we extend the HeGP concept, expanding its scope\nbeyond regression tasks to encompass classification and state-space models. To\nachieve this, we propose a novel framework where the Gaussian process is\ncoupled with a covariate-induced precision matrix process, adopting a mixture\nformulation. This approach enables the modeling of heteroscedastic covariance\nfunctions across covariates. To mitigate the computational challenges posed by\nsampling, we employ variational inference to approximate the posterior and\nfacilitate posterior predictive modeling. Additionally, our training process\nleverages an EM algorithm featuring closed-form M-step updates to efficiently\nevaluate the heteroscedastic covariance function. A notable feature of our\nmodel is its consistent performance on multivariate responses, accommodating\nvarious types (continuous or categorical) seamlessly. Through a combination of\nsimulations and real-world applications in climatology, we illustrate the\nmodel's prowess and advantages. By overcoming the limitations of traditional\nGaussian process models, our proposed framework offers a robust and versatile\ntool for a wide array of applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:06:47 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 20:20:23 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Lee","Taehee",""],["Liu","Jun S.",""]]}
{"id":"2308.15371","submitter":"Yuqian Zhao","authors":"Yuqian Zhao, Bing Sun, Zhoujian Cao, Kai Lin and Wei-Liang Qian","title":"Influence of dark matter equation of state on the axial gravitational\n  ringing of supermassive black holes","comments":"20 pages, 6 figures, 1 table","journal-ref":null,"doi":null,"report-no":null,"categories":"gr-qc","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we explore the effects of surrounding dark matter featuring\ndifferent equations of state on the axial gravitational quasinormal modes of\nsupermassive black holes situated at the center of galaxies. Our attention\nprimarily rests on dark matter exhibiting a spike structure, originating from\nrelativistic Bondi accretion through an adiabatic process, which diminishes at\na certain distance from the black hole. We analyze how varying the equation of\nstate of the dark matter influences the properties of the spacetime in the\nblack hole's vicinity. Our findings reveal that different states of dark matter\nspikes correspondingly affect the black hole's quasinormal modes. In\nparticular, we identify deviations in both the ringing frequency and damping\ntime, reaching magnitudes of up to $10^{-3}$ for certain parameter values.\nThese variations can potentially be detected by upcoming space-borne detectors.\nOur findings thus indicate the feasibility of discerning and limiting the\nessential properties of dark matter surrounding supermassive black holes using\nfuture gravitational wave detections, particularly in the case of extreme mass\nratio inspiral systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:07:00 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 04:21:46 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Zhao","Yuqian",""],["Sun","Bing",""],["Cao","Zhoujian",""],["Lin","Kai",""],["Qian","Wei-Liang",""]]}
{"id":"2308.15372","submitter":"Isao Maruyama","authors":"Isao Maruyama, Shin Miyahara","title":"Theory of Fractionally-magnetized Quantum Ferromagnet","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.stat-mech","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present a theory to realize entangled quantum spin states with fractional\nmagnetization. The origin of magnetization reduction is partly emergent\nantiferromagnetism, that is, spin-liquefaction of ferromagnetism. We study a\nferromagnetic bilinear coupling region of the spin-$S$ $({\\geqq} 1)$\nbilinear-biquadratic spin chain based on (i) a rigorous eigenstate\ncorrespondence between the spin-$S$ model and spin-$\\frac12$ model and (ii) a\nnumerical exact-diagonalization calculation up to $S=3$. As a result, we obtain\na fractional magnetized $M=1-1/(2S)$ phase, where ground states have quantum\nentanglement-reflecting corresponding spin-$\\frac12$ antiferromagnetic ground\nstates in a ferromagnetic background. This spin-liquefaction theory of\nferromagnets can be generalized to any-dimensional lattices even under a\nmagnetic field. This fractional ferromagnetism opens the new research field of\nquantum ferromagnets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:07:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Maruyama","Isao",""],["Miyahara","Shin",""]]}
{"id":"2308.15373","submitter":"Ketevi A. Assamagan","authors":"K\\'et\\'evi A. Assamagan, Johan Sebastian Bonilla, Claudio Dib,\n  Azwinndini Muronga, Heath B. O'Connell, Rogerio Rosenfeld, Suyog Shrestha","title":"High Energy Physics in Africa, Latin America and other developing\n  regions","comments":"6 pages, 2 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.soc-ph hep-ph","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We summarize the current status of high energy physics (HEP) in Africa, Latin\nAmerica, and other developing regions\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:08:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Assamagan","K\u00e9t\u00e9vi A.",""],["Bonilla","Johan Sebastian",""],["Dib","Claudio",""],["Muronga","Azwinndini",""],["O'Connell","Heath B.",""],["Rosenfeld","Rogerio",""],["Shrestha","Suyog",""]]}
{"id":"2308.15374","submitter":"Andrew Maxwell","authors":"Andrew S. Maxwell and Lars Bojer Madsen","title":"Relativistic and Spin-Orbit Dynamics at Non-Relativistic Intensities in\n  Strong-Field Ionization","comments":"24 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph physics.optics quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Spin-orbit dynamics and relativistic corrections to the kinetic energy in\nstrong-field dynamics, have long been ignored for near- and mid-IR fields with\nintensities $10^{13}$--$10^{14}$ W/cm$^2$, as the final photoelectron energies\nare considered too low for these effects to play a role. However, using a\nprecise and flexible path-integral formalism, we include all correction terms\nfrom the fine-structure, Breit-Pauli Hamiltonian. This enables a treatment of\nspin, through coherent spin-states, which is the first model to use this\napproach in strong-field physics. We are able to show that the most\nenergetically rescattered wavepackets, undergo huge momentum transfer and\nbriefly reach relativistic velocities, which warrants relativistic kinetic\nenergy corrections. We probe these effects and show that they yield notable\ndifferences for a $1600$ nm wavelength laser field on the dynamics and the\nphotoelectron spectra. Furthermore, we find that the dynamical spin-orbit\ncoupling is strongly overestimated if relativistic corrections to kinetic\nenergy are not considered. Finally, we derive a new condition that demonstrates\nthat relativistic effects begin to play a role at intensities orders of\nmagnitude lower than expected. Our findings may have important implication for\nimaging processes such as laser-induced electron diffraction, which includes\nhigh-energy photoelectron recollisions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:12:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Maxwell","Andrew S.",""],["Madsen","Lars Bojer",""]]}
{"id":"2308.15375","submitter":"Joseph Coale","authors":"Joseph M. Coale and Dmitriy Y. Anistratov","title":"A Reduced-Order Model for Nonlinear Radiative Transfer Problems Based on\n  Moment Equations and POD-Petrov-Galerkin Projection of the Normalized\n  Boltzmann Transport Equation","comments":null,"journal-ref":null,"doi":null,"report-no":"LA-UR-23-29764","categories":"math.NA cs.NA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A data-driven projection-based reduced-order model (ROM) for nonlinear\nthermal radiative transfer (TRT) problems is presented. The TRT ROM is\nformulated by (i) a hierarchy of low-order quasidiffusion (aka variable\nEddington factor) equations for moments of the radiation intensity and (ii) the\nnormalized Boltzmann transport equation (BTE). The multilevel system of moment\nequations is derived by projection of the BTE onto a sequence of subspaces\nwhich represent elements of the phase space of the problem. Exact closure for\nthe moment equations is provided by the Eddington tensor. A Petrov-Galerkin\n(PG) projection of the normalized BTE is formulated using a proper orthogonal\ndecomposition (POD) basis representing the normalized radiation intensity over\nthe whole phase space and time. The Eddington tensor linearly depends on the\nsolution of the normalized BTE. By linear superposition of the POD basis\nfunctions, a low-rank expansion of the Eddington tensor is constructed with\ncoefficients defined by the PG projected normalized BTE. The material energy\nbalance (MEB) equation is coupled with the effective grey low-order equations\nwhich exist on the same dimensional scale as the MEB equation. The resulting\nTRT ROM is structure and asymptotic preserving. A detailed analysis of the ROM\nis performed on the classical Fleck-Cummings (F-C) TRT multigroup test problem\nin 2D geometry. Numerical results are presented to demonstrate the ROM's\neffectiveness in the simulation of radiation wave phenomena. The ROM is shown\nto produce solutions with sufficiently high accuracy while using low-rank\napproximation of the normalized BTE solution. Essential physical\ncharacteristics of supersonic radiation wave are preserved in the ROM\nsolutions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:13:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Coale","Joseph M.",""],["Anistratov","Dmitriy Y.",""]]}
{"id":"2308.15376","submitter":"Marc Troyanov","authors":"Bruno Luiz Santos Correia and Marc Troyanov","title":"Isoperimetry in Finitely Generated Groups","comments":"20 pages. The results in this paper refine those in arXiv:2110.15798","journal-ref":null,"doi":null,"report-no":null,"categories":"math.GR","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the isoperimetric inequalities for finitely generated groups\nintroduced and studied by N. Varopoulos, T. Coulhon and L. Saloff-Coste. Namely\nwe show that a lower bound on the isoperimetric quotient of finite subsets in a\nfinitely generated group is given by the $\\U-$transform of its growth function,\nwhich is a variant of the Legendre transform. From this lower bound, we obtain\nsome asymptotic estimates for the F{\\o}lner function of the group. The paper\nalso includes a discussion of some basic definitions from Geometric Group\nTheory and some basic properties of the $\\U$-transform, including some\ncomputational techniques and its relation with the Legendre transform.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:14:48 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Correia","Bruno Luiz Santos",""],["Troyanov","Marc",""]]}
{"id":"2308.15377","submitter":"Shohini Bhattacharya","authors":"Shohini Bhattacharya, Yoshitaka Hatta, Werner Vogelsang","title":"Unraveling anomalies in Deeply Virtual Compton Scattering","comments":"7 pages, 1 figure; contribution to DIS2023: XXX International\n  Workshop on Deep-Inelastic Scattering and Related Subjects, Michigan State\n  University, USA, 27-31 March 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph nucl-th","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We calculate the one-loop quark box diagrams relevant to polarized and\nunpolarized Deeply Virtual Compton Scattering by introducing an off-forward\nmomentum $l^\\mu$ as an infrared regulator. This regularization approach allows\nus to reveal the poles associated with the chiral anomaly in the polarized\nscenario, as well as the trace anomaly in the unpolarized case. We provide an\ninterpretation of our findings in the context of pertinent Generalized Parton\nDistributions (GPDs). Furthermore, we discuss the implications of these poles\non the QCD factorization pertaining to Compton amplitudes.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:15:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bhattacharya","Shohini",""],["Hatta","Yoshitaka",""],["Vogelsang","Werner",""]]}
{"id":"2308.15378","submitter":"Haodong He","authors":"Haodong He, Jian Ding, and Gui-Song Xia","title":"On the Robustness of Object Detection Models in Aerial Images","comments":"16 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The robustness of object detection models is a major concern when applied to\nreal-world scenarios. However, the performance of most object detection models\ndegrades when applied to images subjected to corruptions, since they are\nusually trained and evaluated on clean datasets. Enhancing the robustness of\nobject detection models is of utmost importance, especially for those designed\nfor aerial images, which feature complex backgrounds, substantial variations in\nscales and orientations of objects. This paper addresses the challenge of\nassessing the robustness of object detection models in aerial images, with a\nspecific emphasis on scenarios where images are affected by clouds. In this\nstudy, we introduce two novel benchmarks based on DOTA-v1.0. The first\nbenchmark encompasses 19 prevalent corruptions, while the second focuses on\ncloud-corrupted images-a phenomenon uncommon in natural pictures yet frequent\nin aerial photography. We systematically evaluate the robustness of mainstream\nobject detection models and perform numerous ablation experiments. Through our\ninvestigations, we find that enhanced model architectures, larger networks,\nwell-crafted modules, and judicious data augmentation strategies collectively\nenhance the robustness of aerial object detection models. The benchmarks we\npropose and our comprehensive experimental analyses can facilitate research on\nrobust object detection in aerial images. Codes and datasets are available at:\n(https://github.com/hehaodong530/DOTA-C)\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:16:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Haodong",""],["Ding","Jian",""],["Xia","Gui-Song",""]]}
{"id":"2308.15379","submitter":"Xun-Wei Xu","authors":"Zhi-Xiang Tang and Xun-Wei Xu","title":"Multi-terminal nonreciprocal routing in an optomechanical plaquette via\n  synthetic magnetism","comments":"12 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph physics.optics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Optomechanical systems with parametric coupling between optical (photon) and\nmechanical (phonon) modes provide a useful platform to realize various\nmagnetic-free nonreciprocal devices, such as isolators, circulators, and\ndirectional amplifiers. However, nonreciprocal router with multiaccess channels\nhas not been extensively studied yet. Here, we propose a nonreciprocal router\nwith one transmitter, one receiver, and two output terminals, based on an\noptomechanical plaquette composing of two optical modes and two mechanical\nmodes. The time-reversal symmetry of the system is broken via synthetic\nmagnetism induced by driving the two optical modes with phase-correlated laser\nfields. The prerequisites for nonreciprocal routing are obtained both\nanalytically and numerically, and the robustness of the nonreciprocity is\ndemonstrated numerically. Multi-terminal nonreciprocal router in optomechanical\nplaquette provides a useful quantum node for development of quantum network\ninformation security and realization of quantum secure communication.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:17:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tang","Zhi-Xiang",""],["Xu","Xun-Wei",""]]}
{"id":"2308.15380","submitter":"Amitayus Banik","authors":"Amitayus Banik and Manuel Drees","title":"Non-thermal WIMP Production from Higher Order Moduli Decay","comments":"42 pages, 24 figures, 2 appendices","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In a non-standard cosmological scenario, heavy, long-lived particles, which\nwe call moduli, dominate the energy density prior to Big Bang Nucleosynthesis.\nWeakly Interacting Massive Particles (WIMPs) may be produced non-thermally from\nmoduli decays. The final relic abundance then depends on additional parameters\nsuch as the branching ratio of moduli to WIMPs and the modulus mass. This is of\ninterest for WIMP candidates, such as a bino-like neutralino, where thermal\nproduction in standard cosmology leads to an overdensity. Previous works have\nshown that the correct dark matter (DM) relic density can then still be\nobtained if the moduli, with mass less than $10^{7}$ GeV, decay to WIMPs with a\nbranching ratio of less than $10^{-4}$. This upper bound could easily be\nviolated once higher order corrections, involving final states with more than\ntwo particles, are included. We compute the branching ratios of three- and\nfour-body decays of a modulus into final states involving two DM particles for\ngeneral couplings. We then apply these expressions to sparticle production\nwithin the Minimal Supersymmetric Standard Model (MSSM) with neutralino DM. We\nfind that this upper bound on the branching ratio can be satisfied in\nsimplified models through an appropriate choice of as yet undetermined\ncouplings. However, in the MSSM, it requires sparticle masses to be very close\nto half the modulus mass, in contrast to the idea of weak-scale supersymmetry.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:18:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Banik","Amitayus",""],["Drees","Manuel",""]]}
{"id":"2308.15381","submitter":"Pablo Torne","authors":"Pablo Torne, Kuo Liu, Ralph P. Eatough, Jompoj Wongphechauxsorn, James\n  M. Cordes, Gregory Desvignes, Mariafelicia De Laurentis, Michael Kramer,\n  Scott M. Ransom, Shami Chatterjee, Robert Wharton, Ramesh Karuppusamy, Lindy\n  Blackburn, Michael Janssen, Chi-kwan Chan, Geoffrey B. Crew, Lynn D.\n  Matthews, Ciriaco Goddi, Helge Rottmann, Jan Wagner, Salvador Sanchez,\n  Ignacio Ruiz, Federico Abbate, Geoffrey C. Bower, Juan J. Salamanca, Arturo\n  I. Gomez-Ruiz, Alfredo Herrera-Aguilar, Wu Jiang, Ru-Sen Lu, Ue-Li Pen,\n  Alexander W. Raymond, Lijing Shao, Zhiqiang Shen, Gabriel Paubert, Miguel\n  Sanchez-Portal, Carsten Kramer, Manuel Castillo, Santiago Navarro, David\n  John, Karl-Friedrich Schuster, Michael D. Johnson, Kazi L. J. Rygl, Kazunori\n  Akiyama, Antxon Alberdi, Walter Alef, Juan Carlos Algaba, Richard Anantua,\n  Keiichi Asada, Rebecca Azulay, Uwe Bach, Anne-Kathrin Baczko, David Ball,\n  Mislav Balokovic, John Barrett, Michi Bauboeck, Bradford A. Benson, Dan\n  Bintley, Raymond Blundell, Katherine L. Bouman, Hope Boyce, Michael Bremer,\n  Christiaan D. Brinkerink, Roger Brissenden, Silke Britzen, Avery E.\n  Broderick, Dominique Broguiere, Thomas Bronzwaer, Sandra Bustamante, Do-Young\n  Byun, John E. Carlstrom, Chiara Ceccobello, Andrew Chael, Dominic O. Chang,\n  Koushik Chatterjee, Ming-Tang Chen, Yongjun Chen, Xiaopeng Cheng, Ilje Cho,\n  Pierre Christian, Nicholas S. Conroy, John E. Conway, Thomas M. Crawford,\n  Alejandro Cruz-Osorio, Yuzhu Cui, Rohan Dahale, Jordy Davelaar, Roger Deane,\n  Jessica Dempsey, Jason Dexter, Vedant Dhruv, Sheperd S. Doeleman, Sean\n  Dougal, Sergio A. Dzib, Razieh Emami, Heino Falcke, Joseph Farah, Vincent L.\n  Fish, Ed Fomalont, H. Alyson Ford, Marianna Foschi, Raquel Fraga-Encinas,\n  William T. Freeman, Per Friberg, Christian M. Fromm, Antonio Fuentes, Peter\n  Galison, Charles F. Gammie, Roberto Garcia, Olivier Gentaz, Boris Georgiev,\n  Roman Gold, Jose L. Gomez, Minfeng Gu, Mark Gurwell, Kazuhiro Hada, Daryl\n  Haggard, Kari Haworth, Michael H. Hecht, Ronald Hesper, Dirk Heumann, Luis C.\n  Ho, Paul Ho, Mareki Honma, Chih-Wei L. Huang, Lei Huang, David H. Hughes,\n  Shiro Ikeda, C. M. Violette Impellizzeri, Makoto Inoue, Sara Issaoun, David\n  J. James, Buell T. Jannuzi, Britton Jeter, Alejandra Jimenez-Rosales,\n  Svetlana Jorstad, Abhishek V. Joshi, Taehyun Jung, Mansour Karami, Tomohisa\n  Kawashima, Garrett K. Keating, Mark Kettenis, Dong-Jin Kim, Jae-Young Kim,\n  Jongsoo Kim, Junhan Kim, Motoki Kino, Jun Yi Koay, Prashant Kocherlakota,\n  Yutaro Kofuji, Shoko Koyama, Thomas P. Krichbaum, Cheng-Yu Kuo, Noemi La\n  Bella, Tod R. Lauer, Daeyoung Lee, Sang-Sung Lee, Po Kin Leung, Aviad Levis,\n  Zhiyuan Li, Rocco Lico, Greg Lindahl, Michael Lindqvist, Mikhail Lisakov, Jun\n  Liu, Elisabetta Liuzzo, Wen-Ping Lo, Andrei P. Lobanov, Laurent Loinard,\n  Colin J. Lonsdale, Nicholas R. MacDonald, Jirong Mao, Nicola Marchili, Sera\n  Markoff, Daniel P. Marrone, Alan P. Marscher, Ivan Marti-Vidal, Satoki\n  Matsushita, Lia Medeiros, Karl M. Menten, Daniel Michalik, Izumi Mizuno,\n  Yosuke Mizuno, James M. Moran, Kotaro Moriyama, Monika Moscibrodzka, Cornelia\n  Muller, Hendrik Muller, Alejandro Mus, Gibwa Musoke, Ioannis Myserlis, Andrew\n  Nadolski, Hiroshi Nagai, Neil M. Nagar, Masanori Nakamura, Ramesh Narayan,\n  Gopal Narayanan, Iniyan Natarajan, Antonios Nathanail, Joey Neilsen, Roberto\n  Neri, Chunchong Ni, Aristeidis Noutsos, Michael A. Nowak, Junghwan Oh, Hiroki\n  Okino, Hector Olivares, Gisela N. Ortiz-Leon, Tomoaki Oyama, Feryal Ozel,\n  Daniel C. M. Palumbo, Georgios Filippos Paraschos, Jongho Park, Harriet\n  Parsons, Nimesh Patel, Dominic W. Pesce, Vincent Pietu, Richard Plambeck,\n  Aleksandar PopStefanija, Oliver Porth, Felix M. Potzl, Ben Prather, Jorge A.\n  Preciado-Lopez, Dimitrios Psaltis, Hung-Yi Pu, Venkatessh Ramakrishnan,\n  Ramprasad Rao, Mark G. Rawlings, Luciano Rezzolla, Angelo Ricarte, Bart\n  Ripperda, Freek Roelofs, Alan Rogers, Eduardo Ros, Cristina\n  Romero-Ca\\~nizales, Arash Roshanineshat, Alan L. Roy, Chet Ruszczyk, David\n  Sanchez-Arguelles, Mahito Sasada, Kaushik Satapathy, Tuomas Savolainen, F.\n  Peter Schloerb, Jonathan Schonfeld, Zhiqiang Shen, Des Small, Bong Won Sohn,\n  Jason SooHoo, Kamal Souccar, He Sun, Alexandra J. Tetarenko, Paul Tiede, Remo\n  P. J. Tilanus, Michael Titus, Teresa Toscano, Efthalia Traianou, Tyler Trent,\n  Sascha Trippe, Matthew Turk, Ilse van Bemmel, Huib Jan van Langevelde, Daniel\n  R. van Rossum, Jesse Vos, Derek Ward-Thompson, John Wardle, Jonathan\n  Weintroub, Norbert Wex, Maciek Wielgus, Kaj Wiik, Gunther Witzel, Michael F.\n  Wondrak, George N. Wong, Qingwen Wu, Nitika Yadlapalli, Paul Yamaguchi,\n  Aristomenis Yfantis, Doosoo Yoon, Andre Young, Ken Young, Ziri Younsi, Wei\n  Yu, Feng Yuan, Ye-Fei Yuan, J. Anton Zensus, Shuo Zhang, Guang-Yao Zhao and\n  Shan-Shan Zhao","title":"A search for pulsars around Sgr A* in the first Event Horizon Telescope\n  dataset","comments":"33 pages, 7 figures, 6 Tables. Accepted for publication in ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.HE astro-ph.IM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Event Horizon Telescope (EHT) observed in 2017 the supermassive black\nhole at the center of the Milky Way, Sagittarius A* (Sgr A*), at a frequency of\n228.1 GHz ($\\lambda$=1.3 mm). The fundamental physics tests that even a single\npulsar orbiting Sgr A* would enable motivate searching for pulsars in EHT\ndatasets. The high observing frequency means that pulsars - which typically\nexhibit steep emission spectra - are expected to be very faint. However, it\nalso negates pulse scattering, an effect that could hinder pulsar detections in\nthe Galactic Center. Additionally, magnetars or a secondary inverse Compton\nemission could be stronger at millimeter wavelengths than at lower frequencies.\nWe present a search for pulsars close to Sgr A* using the data from the three\nmost-sensitive stations in the EHT 2017 campaign: the Atacama Large\nMillimeter/submillimeter Array, the Large Millimeter Telescope and the IRAM 30\nm Telescope. We apply three detection methods based on Fourier-domain analysis,\nthe Fast-Folding-Algorithm and single pulse search targeting both pulsars and\nburst-like transient emission; using the simultaneity of the observations to\nconfirm potential candidates. No new pulsars or significant bursts were found.\nBeing the first pulsar search ever carried out at such high radio frequencies,\nwe detail our analysis methods and give a detailed estimation of the\nsensitivity of the search. We conclude that the EHT 2017 observations are only\nsensitive to a small fraction ($\\lesssim$2.2%) of the pulsars that may exist\nclose to Sgr A*, motivating further searches for fainter pulsars in the region.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:22:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Torne","Pablo",""],["Liu","Kuo",""],["Eatough","Ralph P.",""],["Wongphechauxsorn","Jompoj",""],["Cordes","James M.",""],["Desvignes","Gregory",""],["De Laurentis","Mariafelicia",""],["Kramer","Michael",""],["Ransom","Scott M.",""],["Chatterjee","Shami",""],["Wharton","Robert",""],["Karuppusamy","Ramesh",""],["Blackburn","Lindy",""],["Janssen","Michael",""],["Chan","Chi-kwan",""],["Crew","Geoffrey B.",""],["Matthews","Lynn D.",""],["Goddi","Ciriaco",""],["Rottmann","Helge",""],["Wagner","Jan",""],["Sanchez","Salvador",""],["Ruiz","Ignacio",""],["Abbate","Federico",""],["Bower","Geoffrey C.",""],["Salamanca","Juan J.",""],["Gomez-Ruiz","Arturo I.",""],["Herrera-Aguilar","Alfredo",""],["Jiang","Wu",""],["Lu","Ru-Sen",""],["Pen","Ue-Li",""],["Raymond","Alexander W.",""],["Shao","Lijing",""],["Shen","Zhiqiang",""],["Paubert","Gabriel",""],["Sanchez-Portal","Miguel",""],["Kramer","Carsten",""],["Castillo","Manuel",""],["Navarro","Santiago",""],["John","David",""],["Schuster","Karl-Friedrich",""],["Johnson","Michael D.",""],["Rygl","Kazi L. J.",""],["Akiyama","Kazunori",""],["Alberdi","Antxon",""],["Alef","Walter",""],["Algaba","Juan Carlos",""],["Anantua","Richard",""],["Asada","Keiichi",""],["Azulay","Rebecca",""],["Bach","Uwe",""],["Baczko","Anne-Kathrin",""],["Ball","David",""],["Balokovic","Mislav",""],["Barrett","John",""],["Bauboeck","Michi",""],["Benson","Bradford A.",""],["Bintley","Dan",""],["Blundell","Raymond",""],["Bouman","Katherine L.",""],["Boyce","Hope",""],["Bremer","Michael",""],["Brinkerink","Christiaan D.",""],["Brissenden","Roger",""],["Britzen","Silke",""],["Broderick","Avery E.",""],["Broguiere","Dominique",""],["Bronzwaer","Thomas",""],["Bustamante","Sandra",""],["Byun","Do-Young",""],["Carlstrom","John E.",""],["Ceccobello","Chiara",""],["Chael","Andrew",""],["Chang","Dominic O.",""],["Chatterjee","Koushik",""],["Chen","Ming-Tang",""],["Chen","Yongjun",""],["Cheng","Xiaopeng",""],["Cho","Ilje",""],["Christian","Pierre",""],["Conroy","Nicholas S.",""],["Conway","John E.",""],["Crawford","Thomas M.",""],["Cruz-Osorio","Alejandro",""],["Cui","Yuzhu",""],["Dahale","Rohan",""],["Davelaar","Jordy",""],["Deane","Roger",""],["Dempsey","Jessica",""],["Dexter","Jason",""],["Dhruv","Vedant",""],["Doeleman","Sheperd S.",""],["Dougal","Sean",""],["Dzib","Sergio A.",""],["Emami","Razieh",""],["Falcke","Heino",""],["Farah","Joseph",""],["Fish","Vincent L.",""],["Fomalont","Ed",""],["Ford","H. Alyson",""],["Foschi","Marianna",""],["Fraga-Encinas","Raquel",""],["Freeman","William T.",""],["Friberg","Per",""],["Fromm","Christian M.",""],["Fuentes","Antonio",""],["Galison","Peter",""],["Gammie","Charles F.",""],["Garcia","Roberto",""],["Gentaz","Olivier",""],["Georgiev","Boris",""],["Gold","Roman",""],["Gomez","Jose L.",""],["Gu","Minfeng",""],["Gurwell","Mark",""],["Hada","Kazuhiro",""],["Haggard","Daryl",""],["Haworth","Kari",""],["Hecht","Michael H.",""],["Hesper","Ronald",""],["Heumann","Dirk",""],["Ho","Luis C.",""],["Ho","Paul",""],["Honma","Mareki",""],["Huang","Chih-Wei L.",""],["Huang","Lei",""],["Hughes","David H.",""],["Ikeda","Shiro",""],["Impellizzeri","C. M. Violette",""],["Inoue","Makoto",""],["Issaoun","Sara",""],["James","David J.",""],["Jannuzi","Buell T.",""],["Jeter","Britton",""],["Jimenez-Rosales","Alejandra",""],["Jorstad","Svetlana",""],["Joshi","Abhishek V.",""],["Jung","Taehyun",""],["Karami","Mansour",""],["Kawashima","Tomohisa",""],["Keating","Garrett K.",""],["Kettenis","Mark",""],["Kim","Dong-Jin",""],["Kim","Jae-Young",""],["Kim","Jongsoo",""],["Kim","Junhan",""],["Kino","Motoki",""],["Koay","Jun Yi",""],["Kocherlakota","Prashant",""],["Kofuji","Yutaro",""],["Koyama","Shoko",""],["Krichbaum","Thomas P.",""],["Kuo","Cheng-Yu",""],["La Bella","Noemi",""],["Lauer","Tod R.",""],["Lee","Daeyoung",""],["Lee","Sang-Sung",""],["Leung","Po Kin",""],["Levis","Aviad",""],["Li","Zhiyuan",""],["Lico","Rocco",""],["Lindahl","Greg",""],["Lindqvist","Michael",""],["Lisakov","Mikhail",""],["Liu","Jun",""],["Liuzzo","Elisabetta",""],["Lo","Wen-Ping",""],["Lobanov","Andrei P.",""],["Loinard","Laurent",""],["Lonsdale","Colin J.",""],["MacDonald","Nicholas R.",""],["Mao","Jirong",""],["Marchili","Nicola",""],["Markoff","Sera",""],["Marrone","Daniel P.",""],["Marscher","Alan P.",""],["Marti-Vidal","Ivan",""],["Matsushita","Satoki",""],["Medeiros","Lia",""],["Menten","Karl M.",""],["Michalik","Daniel",""],["Mizuno","Izumi",""],["Mizuno","Yosuke",""],["Moran","James M.",""],["Moriyama","Kotaro",""],["Moscibrodzka","Monika",""],["Muller","Cornelia",""],["Muller","Hendrik",""],["Mus","Alejandro",""],["Musoke","Gibwa",""],["Myserlis","Ioannis",""],["Nadolski","Andrew",""],["Nagai","Hiroshi",""],["Nagar","Neil M.",""],["Nakamura","Masanori",""],["Narayan","Ramesh",""],["Narayanan","Gopal",""],["Natarajan","Iniyan",""],["Nathanail","Antonios",""],["Neilsen","Joey",""],["Neri","Roberto",""],["Ni","Chunchong",""],["Noutsos","Aristeidis",""],["Nowak","Michael A.",""],["Oh","Junghwan",""],["Okino","Hiroki",""],["Olivares","Hector",""],["Ortiz-Leon","Gisela N.",""],["Oyama","Tomoaki",""],["Ozel","Feryal",""],["Palumbo","Daniel C. M.",""],["Paraschos","Georgios Filippos",""],["Park","Jongho",""],["Parsons","Harriet",""],["Patel","Nimesh",""],["Pesce","Dominic W.",""],["Pietu","Vincent",""],["Plambeck","Richard",""],["PopStefanija","Aleksandar",""],["Porth","Oliver",""],["Potzl","Felix M.",""],["Prather","Ben",""],["Preciado-Lopez","Jorge A.",""],["Psaltis","Dimitrios",""],["Pu","Hung-Yi",""],["Ramakrishnan","Venkatessh",""],["Rao","Ramprasad",""],["Rawlings","Mark G.",""],["Rezzolla","Luciano",""],["Ricarte","Angelo",""],["Ripperda","Bart",""],["Roelofs","Freek",""],["Rogers","Alan",""],["Ros","Eduardo",""],["Romero-Ca\u00f1izales","Cristina",""],["Roshanineshat","Arash",""],["Roy","Alan L.",""],["Ruszczyk","Chet",""],["Sanchez-Arguelles","David",""],["Sasada","Mahito",""],["Satapathy","Kaushik",""],["Savolainen","Tuomas",""],["Schloerb","F. Peter",""],["Schonfeld","Jonathan",""],["Shen","Zhiqiang",""],["Small","Des",""],["Sohn","Bong Won",""],["SooHoo","Jason",""],["Souccar","Kamal",""],["Sun","He",""],["Tetarenko","Alexandra J.",""],["Tiede","Paul",""],["Tilanus","Remo P. J.",""],["Titus","Michael",""],["Toscano","Teresa",""],["Traianou","Efthalia",""],["Trent","Tyler",""],["Trippe","Sascha",""],["Turk","Matthew",""],["van Bemmel","Ilse",""],["van Langevelde","Huib Jan",""],["van Rossum","Daniel R.",""],["Vos","Jesse",""],["Ward-Thompson","Derek",""],["Wardle","John",""],["Weintroub","Jonathan",""],["Wex","Norbert",""],["Wielgus","Maciek",""],["Wiik","Kaj",""],["Witzel","Gunther",""],["Wondrak","Michael F.",""],["Wong","George N.",""],["Wu","Qingwen",""],["Yadlapalli","Nitika",""],["Yamaguchi","Paul",""],["Yfantis","Aristomenis",""],["Yoon","Doosoo",""],["Young","Andre",""],["Young","Ken",""],["Younsi","Ziri",""],["Yu","Wei",""],["Yuan","Feng",""],["Yuan","Ye-Fei",""],["Zensus","J. Anton",""],["Zhang","Shuo",""],["Zhao","Guang-Yao",""],["Zhao","Shan-Shan",""]]}
{"id":"2308.15382","submitter":"Tobias Neumann","authors":"John Campbell and Tobias Neumann","title":"Third order QCD predictions for fiducial W-boson production","comments":"19 pages, 15 figures","journal-ref":null,"doi":null,"report-no":"FERMILAB-PUB-23-463-T","categories":"hep-ph hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Measurements of W-boson production at the LHC have reached percent-level\nprecision and impose challenging demands on theoretical predictions. Such\npredictions directly limit the precision of measurements of fundamental\nquantities such as the W-boson mass and the weak mixing angle. A dominant\nsource of uncertainty in predictions is from higher-order QCD effects. We\npresent a calculation of W-boson production at the level of $\\alpha_s^3$ at\nfixed order and including transverse-momentum resummation. We further show\npredictions for a direct comparison with low-pileup ATLAS transverse-momentum\nand fiducial cross-section measurements at $\\sqrt{s}=5.02\\text{ TeV}$. We\ndiscuss in detail the impact of modern PDFs. Our calculation including the\nmatching to W+jet production at NNLO will be publicly available the upcoming\nCuTe-MCFM release and allows for theory-data comparison at the state-of-the-art\nlevel.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:23:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Campbell","John",""],["Neumann","Tobias",""]]}
{"id":"2308.15383","submitter":"Alberto Enciso","authors":"Alberto Enciso and Daniel Peralta-Salas","title":"Obstructions to topological relaxation for generic magnetic fields","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.DS math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  For any axisymmetric toroidal domain $\\Omega \\subset \\mathbf{R}^3$ we prove\nthat there is a locally generic set of divergence-free vector fields that are\nnot topologically equivalent to any magnetohydrostatic (MHS) equilibrium in\n$\\Omega$. Each vector field in this set is Morse-Smale on the boundary, does\nnot admit a nonconstant first integral, and exhibits fast growth of periodic\norbits; in particular this set is residual in the Newhouse domain. The key\ndynamical idea behind this result is that a vector field with a dense set of\nnondegenerate periodic orbits cannot be topologically equivalent to a generic\nMHS equilibrium. On the analytic side, this geometric obstruction is\nimplemented by means of a novel rigidity theorem for the relaxation of generic\nmagnetic fields with a suitably complex orbit structure.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:24:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Enciso","Alberto",""],["Peralta-Salas","Daniel",""]]}
{"id":"2308.15384","submitter":"Damian Kozbur","authors":"Elliot Beck, Damian Kozbur, Michael Wolf","title":"Hedging Forecast Combinations With an Application to the Random Forest","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"stat.ME q-fin.PM","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This papers proposes a generic, high-level methodology for generating\nforecast combinations that would deliver the optimal linearly combined forecast\nin terms of the mean-squared forecast error if one had access to two population\nquantities: the mean vector and the covariance matrix of the vector of\nindividual forecast errors. We point out that this problem is identical to a\nmean-variance portfolio construction problem, in which portfolio weights\ncorrespond to forecast combination weights. We allow negative forecast weights\nand interpret such weights as hedging over and under estimation risks across\nestimators. This interpretation follows directly as an implication of the\nportfolio analogy. We demonstrate our method's improved out-of-sample\nperformance relative to standard methods in combining tree forecasts to form\nweighted random forests in 14 data sets.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:24:52 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 07:56:28 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Beck","Elliot",""],["Kozbur","Damian",""],["Wolf","Michael",""]]}
{"id":"2308.15385","submitter":"Marc Troyanov","authors":"Marc Troyanov","title":"Double Forms, Curvature Integrals and the Gauss-Bonnet Formula","comments":"41 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The Gauss-Bonnet Formula is a significant achievement in 19th century\ndifferential geometry for the case of surfaces and the 20th century cumulative\nwork of H. Hopf, W. Fenchel, C. B. Allendoerfer, A. Weil and S.S. Chern for\nhigher-dimensional Riemannian manifolds. It relates the Euler characteristic of\na Riemannian manifold to a curvature integral over the manifold plus a somewhat\nenigmatic boundary term. In this paper, we revisit the formula using the\nformalism of double forms, a tool introduced by de Rham, and further developed\nby Kulkarni, Thorpe, and Gray. We explore the geometric nature of the boundary\nterm and provide some examples and applications.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:27:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Troyanov","Marc",""]]}
{"id":"2308.15386","submitter":"Weihua Liu","authors":"Weihua Liu, Chaochao Lin","title":"Shape-Margin Knowledge Augmented Network for Thyroid Nodule Segmentation\n  and Diagnosis","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Thyroid nodule segmentation is a crucial step in the diagnostic procedure of\nphysicians and computer-aided diagnosis systems. Mostly, current studies treat\nsegmentation and diagnosis as independent tasks without considering the\ncorrelation between these tasks. The sequence steps of these independent tasks\nin computer-aided diagnosis systems may lead to the accumulation of errors.\nTherefore, it is worth combining them as a whole through exploring the\nrelationship between thyroid nodule segmentation and diagnosis. According to\nthe thyroid imaging reporting and data system (TI-RADS), the assessment of\nshape and margin characteristics is the prerequisite for the discrimination of\nbenign and malignant thyroid nodules. These characteristics can be observed in\nthe thyroid nodule segmentation masks. Inspired by the diagnostic procedure of\nTI-RADS, this paper proposes a shape-margin knowledge augmented network\n(SkaNet) for simultaneously thyroid nodule segmentation and diagnosis. Due to\nthe similarity in visual features between segmentation and diagnosis, SkaNet\nshares visual features in the feature extraction stage and then utilizes a\ndual-branch architecture to perform thyroid nodule segmentation and diagnosis\ntasks simultaneously. To enhance effective discriminative features, an\nexponential mixture module is devised, which incorporates convolutional feature\nmaps and self-attention maps by exponential weighting. Then, SkaNet is jointly\noptimized by a knowledge augmented multi-task loss function with a constraint\npenalty term. It embeds shape and margin characteristics through numerical\ncomputation and models the relationship between the thyroid nodule diagnosis\nresults and segmentation masks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:29:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Liu","Weihua",""],["Lin","Chaochao",""]]}
{"id":"2308.15387","submitter":"Matija Bucic","authors":"Noga Alon, Matija Buci\\'c, Micha Cristoph and Michael Krivelevich","title":"The power of many colours","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A classical problem, due to Gerencs\\'er and Gy\\'arf\\'as from 1967, asks how\nlarge a monochromatic connected component can we guarantee in any $r$-edge\ncolouring of $K_n$? We consider how big a connected component can we guarantee\nin any $r$-edge colouring of $K_n$ if we allow ourselves to use up to $s$\ncolours. This is actually an instance of a more general question of Bollob\\'as\nfrom about 20 years ago which asks for a $k$-connected subgraph in the same\nsetting. We complete the picture in terms of the approximate behaviour of the\nanswer by determining it up to a logarithmic term, provided $n$ is large\nenough. We obtain more precise results for certain regimes which solve a\nproblem of Liu, Morris and Prince from 2007, as well as disprove a conjecture\nthey pose in a strong form.\n  We also consider a generalisation in a similar direction of a question first\nconsidered by Erd\\H{o}s and R\\'enyi in 1956, who considered given $n$ and $m$,\nwhat is the smallest number of $m$-cliques which can cover all edges of $K_n$?\nThis problem is essentially equivalent to the question of what is the minimum\nnumber of vertices that are certain to be incident to at least one edge of some\ncolour in any $r$-edge colouring of $K_n$. We consider what happens if we allow\nourselves to use up to $s$ colours. We obtain a more complete understanding of\nthe answer to this question for large $n$, in particular determining it up to a\nconstant factor for all $1\\le s \\le r$, as well as obtaining much more precise\nresults for various ranges including the correct asymptotics for essentially\nthe whole range.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:29:14 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alon","Noga",""],["Buci\u0107","Matija",""],["Cristoph","Micha",""],["Krivelevich","Michael",""]]}
{"id":"2308.15388","submitter":"Isabel Santos-Santos","authors":"Isabel Santos-Santos, Nassim Bozorgnia, Azadeh Fattahi, and Julio F.\n  Navarro","title":"Are there any extragalactic high speed dark matter particles in the\n  Solar neighborhood?","comments":"16 pages, 8 figures. To be submitted to JCAP","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.GA astro-ph.CO hep-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We use the APOSTLE suite of cosmological hydrodynamical simulations of the\nLocal Group to examine the high speed tail of the local dark matter velocity\ndistribution in simulated Milky Way analogues. The velocity distribution in the\nSolar neighborhood is well approximated by a generalized Maxwellian\ndistribution sharply truncated at a well-defined maximum ``escape\" speed. The\ntruncated generalized Maxwellian distribution accurately models the local dark\nmatter velocity distribution of all our Milky Way analogues, with no evidence\nfor any separate extragalactic high-speed components. The local maximum speed\nis well approximated by the terminal velocity expected for particles able to\nreach the Solar neighborhood in a Hubble time from the farthest confines of the\nLocal Group. This timing constraint means that the local dark matter velocity\ndistribution is unlikely to contain any high-speed particles contributed by the\nVirgo Supercluster ``envelope\", as argued in recent works. Particles in the\nSolar neighborhood with speeds close to the local maximum speed can reach well\noutside the virial radius of the Galaxy, and, in that sense, belong to the\nLocal Group envelope posited in earlier work. The local manifestation of such\nenvelope is thus not a distinct high-speed component, but rather simply the\nhigh-speed tail of the truncated Maxwellian distribution.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:30:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Santos-Santos","Isabel",""],["Bozorgnia","Nassim",""],["Fattahi","Azadeh",""],["Navarro","Julio F.",""]]}
{"id":"2308.15389","submitter":"Frederik vom Ende","authors":"Frederik vom Ende","title":"Progress on the Kretschmann-Schlingemann-Werner Conjecture","comments":"10+2 pages, to be submitted to J. Math. Phys","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Given any pair of completely positive, trace-preserving maps $\\Phi_1,\\Phi_2$\nsuch that at least one of them has Kraus rank one, as well as any respective\nStinespring isometries $V_1,V_2$, we prove that there exists a unitary $U$ on\nthe environment such that $\\|V_1-({\\bf1}\\otimes\nU)V_2\\|_\\infty\\leq\\sqrt{2\\|\\Phi_1-\\Phi_2\\|_\\diamond}$. Moreover, we provide a\nsimple example which shows that the factor $\\sqrt2$ on the right-hand side is\noptimal, and we conjecture that this inequality holds for every pair of\nchannels.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:32:58 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ende","Frederik vom",""]]}
{"id":"2308.15390","submitter":"Leila Bagheriye","authors":"Otto van der Himst, Leila Bagheriye, and Johan Kwisthout","title":"Bayesian Integration of Information Using Top-Down Modulated WTA\n  Networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Winner Take All (WTA) circuits a type of Spiking Neural Networks (SNN) have\nbeen suggested as facilitating the brain's ability to process information in a\nBayesian manner. Research has shown that WTA circuits are capable of\napproximating hierarchical Bayesian models via Expectation Maximization (EM).\nSo far, research in this direction has focused on bottom up processes. This is\ncontrary to neuroscientific evidence that shows that, besides bottom up\nprocesses, top down processes too play a key role in information processing by\nthe human brain. Several functions ascribed to top down processes include\ndirection of attention, adjusting for expectations, facilitation of encoding\nand recall of learned information, and imagery. This paper explores whether WTA\ncircuits are suitable for further integrating information represented in\nseparate WTA networks. Furthermore, it explores whether, and under what\ncircumstances, top down processes can improve WTA network performance with\nrespect to inference and learning. The results show that WTA circuits are\ncapable of integrating the probabilistic information represented by other WTA\nnetworks, and that top down processes can improve a WTA network's inference and\nlearning performance. Notably, it is able to do this according to key\nneuromorphic principles, making it ideal for low-latency and energy efficient\nimplementation on neuromorphic hardware.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:33:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["van der Himst","Otto",""],["Bagheriye","Leila",""],["Kwisthout","Johan",""]]}
{"id":"2308.15391","submitter":"Zhihua Chen","authors":"Lifeng Zhang, Zhihua Chen and Shao-Ming Fei","title":"Entanglement Verification with Deep Semi-supervised Machine Learning","comments":null,"journal-ref":"Phys. Rev. A 108, 022427(2023)","doi":"10.1103/PhysRevA.108.022427","report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quantum entanglement lies at the heart in quantum information processing\ntasks. Although many criteria have been proposed, efficient and scalable\nmethods to detect the entanglement of generally given quantum states are still\nnot available yet, particularly for high-dimensional and multipartite quantum\nsystems. Based on FixMatch and Pseudo-Label method, we propose a deep\nsemi-supervised learning model with a small portion of labeled data and a large\nportion of unlabeled data. The data augmentation strategies are applied in this\nmodel by using the convexity of separable states and performing local unitary\noperations on the training data. We verify that our model has good\ngeneralization ability and gives rise to better accuracies compared to\ntraditional supervised learning models by detailed examples.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:41:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Lifeng",""],["Chen","Zhihua",""],["Fei","Shao-Ming",""]]}
{"id":"2308.15392","submitter":"Aaron Kaplan","authors":"Aaron D. Kaplan (1) and Adrienn Ruzsinszky (2) ( (1) Lawrence Berkeley\n  National Laboratory (2) Tulane University)","title":"Revealing quasi-excitations in the low-density homogeneous electron gas\n  with model exchange-correlation kernels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.str-el cond-mat.quant-gas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Time-dependent density functional theory (TDDFT) within the linear response\nregime provides a solid mathematical framework to capture excitations. The\naccuracy of the theory, however, largely depends on the approximations for the\nexchange-correlation (xc) kernels. Away from the long-wavelength (or $q=0$\nshort wave-vector) and zero-frequency ($\\omega=0$) limit, the correlation\ncontribution to the kernel becomes more relevant and dominant over exchange.\nThe dielectric function in principle can encompass xc effects relevant to\ndescribe low-density physics. Furthermore, besides collective plasmon\nexcitations, the dielectric function can reveal collective electron-hole\nexcitations, often dubbed ``ghost excitons.'' Beside collective excitons, the\nphysics in the low-density regime is rich, as exemplified by a static\ncharge-density wave that was recently found for $r_\\mathrm{s} > 69$, and was\nshown to be associated with softening of the plasmon mode. In this work we\nperform a thorough analysis with xc model kernels for excitations of various\nnature. The uniform electron gas as a useful model of real metallic systems is\nused as a platform of our analysis. We highlight the relevance of exact\nconstraints as we display and explain screening and excitations in the\nlow-density region.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:46:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kaplan","Aaron D.",""],["Ruzsinszky","Adrienn",""]]}
{"id":"2308.15393","submitter":"Dennis Bonatsos","authors":"Dennis Bonatsos, Andriana Martinou, S.K. Peroulis, T.J. Mertzimekis,\n  N. Minkov","title":"Shape coexistence in even-even nuclei: A theoretical overview","comments":"80 pages, 14 figures, 837 references","journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The last decade has seen a rapid growth of our understanding of the\nmicroscopic origins of shape coexistence, assisted by the new data provided by\nthe modern radioactive ion beam facilities built worldwide. Islands of the\nnuclear chart in which shape coexistence can occur have been identified, and\nthe different microscopic particle-hole excitation mechanisms leading to\nneutron-induced or proton-induced shape coexistence have been clarified. The\nrelation of shape coexistence to the islands of inversion, appearing in light\nnuclei, to the new spin-aligned phase appearing in N=Z nuclei, as well as to\nshape/phase transitions occurring in medium mass and heavy nuclei, has been\nunderstood. In the present review, these developments are considered within the\nshell model and mean field approaches, as well as by symmetry methods. In\naddition, based on systematics of data, as well as on symmetry considerations,\nquantitative rules are developed, predicting regions in which shape coexistence\ncan appear, as a possible guide for further experimental efforts, which can\nhelp in improving our understanding of the details of the nucleon-nucleon\ninteraction, as well as of its modifications occurring far from stability.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:47:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bonatsos","Dennis",""],["Martinou","Andriana",""],["Peroulis","S. K.",""],["Mertzimekis","T. J.",""],["Minkov","N.",""]]}
{"id":"2308.15394","submitter":"Zheng Xiong","authors":"Zheng Xiong, Biao Luo, Bing-Chuan Wang, Xiaodong Xu, Xiaodong Liu, and\n  Tingwen Huang","title":"Decentralized Multi-agent Reinforcement Learning based State-of-Charge\n  Balancing Strategy for Distributed Energy Storage System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.AI cs.LG cs.SY eess.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper develops a Decentralized Multi-Agent Reinforcement Learning\n(Dec-MARL) method to solve the SoC balancing problem in the distributed energy\nstorage system (DESS). First, the SoC balancing problem is formulated into a\nfinite Markov decision process with action constraints derived from demand\nbalance, which can be solved by Dec-MARL. Specifically, the first-order average\nconsensus algorithm is utilized to expand the observations of the DESS state in\na fully-decentralized way, and the initial actions (i.e., output power) are\ndecided by the agents (i.e., energy storage units) according to these\nobservations. In order to get the final actions in the allowable range, a\ncounterfactual demand balance algorithm is proposed to balance the total demand\nand the initial actions. Next, the agents execute the final actions and get\nlocal rewards from the environment, and the DESS steps into the next state.\nFinally, through the first-order average consensus algorithm, the agents get\nthe average reward and the expended observation of the next state for later\ntraining. By the above procedure, Dec-MARL reveals outstanding performance in a\nfully-decentralized system without any expert experience or constructing any\ncomplicated model. Besides, it is flexible and can be extended to other\ndecentralized multi-agent systems straightforwardly. Extensive simulations have\nvalidated the effectiveness and efficiency of Dec-MARL.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:48:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xiong","Zheng",""],["Luo","Biao",""],["Wang","Bing-Chuan",""],["Xu","Xiaodong",""],["Liu","Xiaodong",""],["Huang","Tingwen",""]]}
{"id":"2308.15395","submitter":"Mathieu Chevalley","authors":"Mathieu Chevalley, Jacob Sackett-Sanders, Yusuf Roohani, Pascal Notin,\n  Artemy Bakulin, Dariusz Brzezinski, Kaiwen Deng, Yuanfang Guan, Justin Hong,\n  Michael Ibrahim, Wojciech Kotlowski, Marcin Kowiel, Panagiotis Misiakos,\n  Achille Nazaret, Markus P\\\"uschel, Chris Wendler, Arash Mehrjou, Patrick\n  Schwab","title":"The CausalBench challenge: A machine learning contest for gene network\n  inference from single-cell perturbation data","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG q-bio.MN q-bio.QM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In drug discovery, mapping interactions between genes within cellular systems\nis a crucial early step. This helps formulate hypotheses regarding molecular\nmechanisms that could potentially be targeted by future medicines. The\nCausalBench Challenge was an initiative to invite the machine learning\ncommunity to advance the state of the art in constructing gene-gene interaction\nnetworks. These networks, derived from large-scale, real-world datasets of\nsingle cells under various perturbations, are crucial for understanding the\ncausal mechanisms underlying disease biology. Using the framework provided by\nthe CausalBench benchmark, participants were tasked with enhancing the capacity\nof the state of the art methods to leverage large-scale genetic perturbation\ndata. This report provides an analysis and summary of the methods submitted\nduring the challenge to give a partial image of the state of the art at the\ntime of the challenge. The winning solutions significantly improved performance\ncompared to previous baselines, establishing a new state of the art for this\ncritical task in biology and medicine.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:54:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chevalley","Mathieu",""],["Sackett-Sanders","Jacob",""],["Roohani","Yusuf",""],["Notin","Pascal",""],["Bakulin","Artemy",""],["Brzezinski","Dariusz",""],["Deng","Kaiwen",""],["Guan","Yuanfang",""],["Hong","Justin",""],["Ibrahim","Michael",""],["Kotlowski","Wojciech",""],["Kowiel","Marcin",""],["Misiakos","Panagiotis",""],["Nazaret","Achille",""],["P\u00fcschel","Markus",""],["Wendler","Chris",""],["Mehrjou","Arash",""],["Schwab","Patrick",""]]}
{"id":"2308.15396","submitter":"Mengqi Huang","authors":"Mengqi Huang, Jazmine C. Green, Jingcheng Zhou, Violet Williams,\n  Senlei Li, Hanyi Lu, Dziga Djugba, Hailong Wang, Benedetta Flebus, Ni Ni, and\n  Chunhui Rita Du","title":"Layer-dependent magnetism and spin fluctuations in atomically thin van\n  der Waals magnet CrPS4","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall cond-mat.mtrl-sci","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  van der Waals (vdW) magnets, an emerging family of two-dimensional (2D)\nmaterials, have received tremendous attention due to their rich fundamental\nphysics and significant potential for cutting-edge technological applications.\nIn contrast to the conventional bulk counterparts, vdW magnets exhibit\nsignificant tunability of local material properties, such as stacking\nengineered interlayer coupling and layer-number dependent magnetic and\nelectronic interactions, which promise to deliver previously unavailable merits\nto develop multifunctional microelectronic devices. As a further ingredient of\nthis emerging topic, here we report nanoscale quantum sensing and imaging of\natomically thin vdW magnet chromium thiophosphate CrPS4, revealing its\ncharacteristic layer-dependent 2D static magnetism and dynamic spin\nfluctuations. We also show a large tunneling magnetoresistance in CrPS4-based\nspin filter vdW heterostructures. The excellent material stability, robust\nstrategy against environmental degradation, in combination with tailored\nmagnetic properties highlight the potential of CrPS4 in developing\nstate-of-the-art 2D spintronic devices for next-generation information\ntechnologies.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:56:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Mengqi",""],["Green","Jazmine C.",""],["Zhou","Jingcheng",""],["Williams","Violet",""],["Li","Senlei",""],["Lu","Hanyi",""],["Djugba","Dziga",""],["Wang","Hailong",""],["Flebus","Benedetta",""],["Ni","Ni",""],["Du","Chunhui Rita",""]]}
{"id":"2308.15397","submitter":"Pakizar Shamoi Dr","authors":"Pakizar Shamoi, Atsushi Inoue, Hiroharu Kawanaka","title":"Color Aesthetics: Fuzzy based User-driven Method for Harmony and\n  Preference Prediction","comments":"It was accepted as a short paper. IFSA-SCIS 2017 Conference held in\n  Otsu, Japan","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Color is the most important intrinsic sensory feature that has a powerful\nimpact on product sales. Color is even responsible for raising the aesthetic\nsenses in our brains. Account for individual differences is crucial in color\naesthetics. It requires user-driven mechanisms for various e-commerce\napplications. We propose a method for quantitative evaluation of all types of\nperceptual responses to color(s): distinct color preference, color harmony, and\ncolor combination preference. Preference for color schemes can be predicted by\ncombining preferences for the basic colors and ratings of color harmony.\nHarmonious pallets are extracted from big data set using comparison algorithms\nbased on fuzzy similarity and grouping. The proposed model results in useful\npredictions of harmony and preference of multicolored images. For example, in\nthe context of apparel coordination, it allows predicting a preference for a\nlook based on clothing colors. Our approach differs from standard aesthetic\nmodels, since in accounts for a personal variation. In addition, it can process\nnot only lower-order color pairs, but also groups of several colors.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:56:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Shamoi","Pakizar",""],["Inoue","Atsushi",""],["Kawanaka","Hiroharu",""]]}
{"id":"2308.15398","submitter":"Gabriel Hadjerci","authors":"Gabriel Hadjerci and Basile Gallet","title":"Vortex core radius in baroclinic turbulence: Implications for scaling\n  predictions","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We revisit the vortex-gas scaling theory for heat transport by baroclinic\nturbulence based on the empirical observation that the vortex core radius\ndeparts from the Rossby deformation radius for very low bottom drag\ncoefficient. We derive a scaling prediction for the vortex-core radius. For\nlinear bottom drag this scaling dependence for the vortex-core radius does not\naffect the vortex-gas predictions for the eddy diffusivity and mixing-length,\nwhich remain identical to those in Gallet and Ferrari (Proc. Nat. Acad. Sci.\nUSA, 117, 2020). By contrast, for quadratic drag the scaling dependence of the\ncore radius induces new scaling-laws for the eddy diffusivity and mixing length\nwhen the quadratic-drag coefficient becomes asymptotically low. We validate the\nmodified scaling predictions through numerical simulations of the two-layer\nmodel with very low quadratic-drag coefficient.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:56:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hadjerci","Gabriel",""],["Gallet","Basile",""]]}
{"id":"2308.15399","submitter":"Jingyan Zhou","authors":"Jingyan Zhou, Minda Hu, Junan Li, Xiaoying Zhang, Xixin Wu, Irwin\n  King, Helen Meng","title":"Rethinking Machine Ethics -- Can LLMs Perform Moral Reasoning through\n  the Lens of Moral Theories?","comments":"7 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Making moral judgments is an essential step toward developing ethical AI\nsystems. Prevalent approaches are mostly implemented in a bottom-up manner,\nwhich uses a large set of annotated data to train models based on crowd-sourced\nopinions about morality. These approaches have been criticized for potentially\novergeneralizing a limited group of annotators' moral stances and lacking\nexplainability. In contrast, top-down approaches make moral judgments grounded\nin a set of principles. However, it remains conceptual due to the incapability\nof previous language models and the unsolved debate among moral principles. In\nthis study, we propose a flexible framework to steer Large Language Models\n(LLMs) to perform moral reasoning with well-established moral theories from\ninterdisciplinary research. The theory-guided top-down framework can\nincorporate various moral theories. Our experiments demonstrate the\neffectiveness of the proposed framework on datasets derived from moral\ntheories. Furthermore, we show the alignment between different moral theories\nand existing morality datasets. Our analysis exhibits the potentials and flaws\nin existing resources (models and datasets) in developing explainable moral\njudgment-making systems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:57:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhou","Jingyan",""],["Hu","Minda",""],["Li","Junan",""],["Zhang","Xiaoying",""],["Wu","Xixin",""],["King","Irwin",""],["Meng","Helen",""]]}
{"id":"2308.15400","submitter":"Henry von Wahl","authors":"Henry von Wahl and Thomas Wick","title":"A coupled high-accuracy phase-field fluid-structure interaction\n  framework for Stokes fluid-filled fracture surrounded by an elastic medium","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this work, we couple a high-accuracy phase-field fracture reconstruction\napproach iteratively to fluid-structure interaction. The key motivation is to\nutilize phase-field modelling to compute the fracture path. A mesh\nreconstruction allows a switch from interface-capturing to interface-tracking\nin which the coupling conditions can be realized in a highly accurate fashion.\nConsequently, inside the fracture, a Stokes flow can be modelled that is\ncoupled to the surrounding elastic medium. A fully coupled approach is obtained\nby iterating between the phase-field and the fluid-structure interaction model.\nThe resulting algorithm is demonstrated for several numerical examples of\nquasi-static brittle fractures. We consider both stationary and\nquasi-stationary problems. In the latter, the dynamics arise through an\nincrementally-increasing given pressure.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:57:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["von Wahl","Henry",""],["Wick","Thomas",""]]}
{"id":"2308.15401","submitter":"Haoyue Tang","authors":"Yuchao Chen, Haoyue Tang, Jintao Wang, Pengkun Yang, Leandros\n  Tassiulas","title":"Sampling for Remote Estimation of an Ornstein-Uhlenbeck Process through\n  Channel with Unknown Delay Statistics","comments":"Accepted and to appear, JCN special issues","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In this paper, we consider sampling an Ornstein-Uhlenbeck (OU) process\nthrough a channel for remote estimation. The goal is to minimize the mean\nsquare error (MSE) at the estimator under a sampling frequency constraint when\nthe channel delay statistics is unknown. Sampling for MSE minimization is\nreformulated into an optimal stopping problem. By revisiting the threshold\nstructure of the optimal stopping policy when the delay statistics is known, we\npropose an online sampling algorithm to learn the optimum threshold using\nstochastic approximation algorithm and the virtual queue method. We prove that\nwith probability 1, the MSE of the proposed online algorithm converges to the\nminimum MSE that is achieved when the channel delay statistics is known. The\ncumulative MSE gap of our proposed algorithm compared with the minimum MSE up\nto the $(k+1)$-th sample grows with rate at most $\\mathcal{O}(\\ln k)$. Our\nproposed online algorithm can satisfy the sampling frequency constraint\ntheoretically. Finally, simulation results are provided to demonstrate the\nperformance of the proposed algorithm.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 15:59:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Yuchao",""],["Tang","Haoyue",""],["Wang","Jintao",""],["Yang","Pengkun",""],["Tassiulas","Leandros",""]]}
{"id":"2308.15402","submitter":"Mohammad Akhlaqur Rahman","authors":"Shahriar Elahi Dhruvo, Mohammad Akhlaqur Rahman, Manash Kumar Mandal,\n  Md. Istiak Hossain Shihab, A. A. Noman Ansary, Kaneez Fatema Shithi, Sanjida\n  Khanom, Rabeya Akter, Safaeid Hossain Arib, M.N. Ansary, Sazia Mehnaz,\n  Rezwana Sultana, Sejuti Rahman, Sayma Sultana Chowdhury, Sabbir Ahmed\n  Chowdhury, Farig Sadeque, Asif Sushmit","title":"Bornil: An open-source sign language data crowdsourcing platform for AI\n  enabled dialect-agnostic communication","comments":"6 pages, 7 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The absence of annotated sign language datasets has hindered the development\nof sign language recognition and translation technologies. In this paper, we\nintroduce Bornil; a crowdsource-friendly, multilingual sign language data\ncollection, annotation, and validation platform. Bornil allows users to record\nsign language gestures and lets annotators perform sentence and gloss-level\nannotation. It also allows validators to make sure of the quality of both the\nrecorded videos and the annotations through manual validation to develop\nhigh-quality datasets for deep learning-based Automatic Sign Language\nRecognition. To demonstrate the system's efficacy; we collected the largest\nsign language dataset for Bangladeshi Sign Language dialect, perform deep\nlearning based Sign Language Recognition modeling, and report the benchmark\nperformance. The Bornil platform, BornilDB v1.0 Dataset, and the codebases are\navailable on https://bornil.bengali.ai\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:00:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Dhruvo","Shahriar Elahi",""],["Rahman","Mohammad Akhlaqur",""],["Mandal","Manash Kumar",""],["Shihab","Md. Istiak Hossain",""],["Ansary","A. A. Noman",""],["Shithi","Kaneez Fatema",""],["Khanom","Sanjida",""],["Akter","Rabeya",""],["Arib","Safaeid Hossain",""],["Ansary","M. N.",""],["Mehnaz","Sazia",""],["Sultana","Rezwana",""],["Rahman","Sejuti",""],["Chowdhury","Sayma Sultana",""],["Chowdhury","Sabbir Ahmed",""],["Sadeque","Farig",""],["Sushmit","Asif",""]]}
{"id":"2308.15403","submitter":"Peter Manohar","authors":"Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar","title":"A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from\n  Semirandom CSP Refutation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CC cs.IT math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A code $C \\colon \\{0,1\\}^k \\to \\{0,1\\}^n$ is a $q$-locally decodable code\n($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \\in\n\\{0,1\\}^k$ with good confidence by randomly querying the encoding $x := C(b)$\non at most $q$ coordinates. Existing constructions of $2$-LDCs achieve $n =\n\\exp(O(k))$, and lower bounds show that this is in fact tight. However, when $q\n= 3$, far less is known: the best constructions achieve $n = \\exp(k^{o(1)})$,\nwhile the best known results only show a quadratic lower bound $n \\geq\n\\tilde{\\Omega}(k^2)$ on the blocklength.\n  In this paper, we prove a near-cubic lower bound of $n \\geq\n\\tilde{\\Omega}(k^3)$ on the blocklength of $3$-query LDCs. This improves on the\nbest known prior works by a polynomial factor in $k$. Our proof relies on a new\nconnection between LDCs and refuting constraint satisfaction problems with\nlimited randomness. Our quantitative improvement builds on the new techniques\nfor refuting semirandom instances of CSPs developed in [GKM22, HKM23] and, in\nparticular, relies on bounding the spectral norm of appropriate Kikuchi\nmatrices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:00:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alrabiah","Omar",""],["Guruswami","Venkatesan",""],["Kothari","Pravesh K.",""],["Manohar","Peter",""]]}
{"id":"2308.15404","submitter":"Junyin Zhang","authors":"Junyin Zhang, Zihan Li, Johann Riemensberger, Grigory Lihachev,\n  Guanhao Huang, Tobias J. Kippenberg","title":"Fundamental charge noise in electro-optic photonic integrated circuits","comments":"Main Text: 8 pages, 4 figures; Supplementary Material: 15 pages, 13\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.app-ph quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Understanding thermodynamical measurement noise is of central importance for\nelectrical and optical precision measurements from mass-fabricated\nsemiconductor sensors, where the Brownian motion of charge carriers poses\nlimits, to optical reference cavities for atomic clocks or gravitational wave\ndetection, which are limited by thermorefractive and thermoelastic noise due to\nthe transduction of temperature fluctuations to the refractive index and length\nfluctuations. Here, we discover that unexpectedly charge carrier density\nfluctuations give rise to a novel noise process in recently emerged\nelectro-optic photonic integrated circuits. We show that Lithium Niobate and\nLithium Tantalate photonic integrated microresonators exhibit an unexpected\nFlicker type (i.e. $1/f^{1.2}$) scaling in their noise properties,\nsignificantly deviating from the well-established thermorefractive noise\ntheory. We show that this noise is consistent with thermodynamical charge\nnoise, which leads to electrical field fluctuations that are transduced via the\nstrong Pockels effects of electro-optic materials. Our results establish\nelectrical Johnson-Nyquist noise as the fundamental limitation for Pockels\nintegrated photonics, crucial for determining performance limits for both\nclassical and quantum devices, ranging from ultra-fast tunable and low-noise\nlasers, Pockels soliton microcombs, to quantum transduction, squeezed light or\nentangled photon-pair generation. Equally, this observation offers optical\nmethods to probe mesoscopic charge fluctuations with exceptional precision.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:02:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhang","Junyin",""],["Li","Zihan",""],["Riemensberger","Johann",""],["Lihachev","Grigory",""],["Huang","Guanhao",""],["Kippenberg","Tobias J.",""]]}
{"id":"2308.15405","submitter":"Hong Zhu","authors":"Hong Zhu, Runpeng Yu, Xing Tang, Yifei Wang, Yuan Fang, Yisen Wang","title":"Robust Long-Tailed Learning via Label-Aware Bounded CVaR","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV cs.IR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Data in the real-world classification problems are always imbalanced or\nlong-tailed, wherein the majority classes have the most of the samples that\ndominate the model training. In such setting, the naive model tends to have\npoor performance on the minority classes. Previously, a variety of loss\nmodifications have been proposed to address the long-tailed leaning problem,\nwhile these methods either treat the samples in the same class\nindiscriminatingly or lack a theoretical guarantee. In this paper, we propose\ntwo novel approaches based on CVaR (Conditional Value at Risk) to improve the\nperformance of long-tailed learning with a solid theoretical ground.\nSpecifically, we firstly introduce a Label-Aware Bounded CVaR (LAB-CVaR) loss\nto overcome the pessimistic result of the original CVaR, and further design the\noptimal weight bounds for LAB-CVaR theoretically. Based on LAB-CVaR, we\nadditionally propose a LAB-CVaR with logit adjustment (LAB-CVaR-logit) loss to\nstabilize the optimization process, where we also offer the theoretical\nsupport. Extensive experiments on real-world datasets with long-tailed label\ndistributions verify the superiority of our proposed methods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:07:18 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Zhu","Hong",""],["Yu","Runpeng",""],["Tang","Xing",""],["Wang","Yifei",""],["Fang","Yuan",""],["Wang","Yisen",""]]}
{"id":"2308.15406","submitter":"Sjanne Zeijlemaker","authors":"Aida Abiad, Maarten De Boeck, Sjanne Zeijlemaker","title":"On the existence of small strictly Neumaier graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  A Neumaier graph is a non-complete edge-regular graph containing a regular\nclique. In this work, we prove several results on the existence of small\nstrictly Neumaier graphs. In particular, we present a theoretical proof of the\nuniqueness of the smallest Neumaier graphs with parameters $(16,9,4;2,4)$, we\nestablish the existence of $(25,12,5;2,5)$, and we disprove the existence of\nNeumaier graphs with parameters $(25,16,9;3,5)$, $(28,18,11;4,7)$,\n$(33,24,17;6,9)$, $(35,22,12;3,5)$ and $(55,30,18;3,5)$. Our proofs use\ncombinatorial techniques and a novel application of integer programming\nmethods.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:07:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Abiad","Aida",""],["De Boeck","Maarten",""],["Zeijlemaker","Sjanne",""]]}
{"id":"2308.15407","submitter":"Sergiu Busuioc","authors":"Sergiu Busuioc and Victor Sofonea","title":"Bounded flows of dense gases","comments":"44 pages, 13 figues","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn physics.comp-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Numerical solutions of the Enskog equation obtained employing a\nFinite-Difference Lattice Boltzmann (FDLB) and a Direct Simulation Monte Carlo\n(DSMC)-like particle method (PM) are systematically compared to determine the\nrange of applicability of the simplified Enskog collision operator implemented\nin the Lattice Boltzmann framework. Three types of bounded flows of dense gases\n- namely the Fourier, the Couette, and the Poiseuille flows - are investigated\nfor a wide range of input parameters. For low to moderate reduced density, the\nproposed FDLB model exhibits commendable accuracy for all bounded flows tested\nin this study, with substantially lower computational cost than the PM method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:08:12 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Busuioc","Sergiu",""],["Sofonea","Victor",""]]}
{"id":"2308.15408","submitter":"In-Jee Jeong","authors":"In-Jee Jeong and Sung-Jin Oh","title":"Illposedness for dispersive equations: Degenerate dispersion and\n  Takeuchi--Mizohata condition","comments":"54 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We provide a unified viewpoint on two illposedness mechanisms for dispersive\nequations in one spatial dimension, namely degenerate dispersion and (the\nfailure of) the Takeuchi--Mizohata condition. Our approach is based on a robust\nenergy- and duality-based method introduced in an earlier work of the authors\nin the setting of Hall-magnetohydynamics. Concretely, the main results in this\npaper concern strong illposedness of the Cauchy problem (e.g., non-existence\nand unboundedness of the solution map) in high-regularity Sobolev spaces for\nvarious quasilinear degenerate Schr\\\"odinger- and KdV-type equations, including\nthe Hunter--Smothers equation, $K(m, n)$ models of Rosenau--Hyman, and the\ninviscid surface growth model. The mechanism behind these results may be\nunderstood in terms of combination of two effects: degenerate dispersion --\nwhich is a property of the principal term in the presence of degenerating\ncoefficients -- and the evolution of the amplitude governed by the\nTakeuchi--Mizohata condition -- which concerns the subprincipal term. We also\ndemonstrate how the same techniques yield a more quantitative version of the\nclassical $L^{2}$-illposedness result by Mizohata for linear\nvariable-coefficient Schr\\\"odinger equations with failed Takeuchi--Mizohata\ncondition.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:09:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Jeong","In-Jee",""],["Oh","Sung-Jin",""]]}
{"id":"2308.15409","submitter":"Yangwen Zhang","authors":"Gang Chen and Yangwen Zhang and Dujin Zuo","title":"An Incremental SVD Method for Non-Fickian Flows in Porous Media:\n  Addressing Storage and Computational Challenges","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NA cs.NA","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  It is well known that the numerical solution of the Non-Fickian flows at the\ncurrent stage depends on all previous time instances. Consequently, the storage\nrequirement increases linearly, while the computational complexity grows\nquadratically with the number of time steps. This presents a significant\nchallenge for numerical simulations, and to the best of our knowledge, it\nremains an unresolved issue. In this paper, we make the assumption that the\nsolution data exhibits approximate low rank. Here, we present a memory-free\nalgorithm, based on the incremental SVD technique, that exhibits only linear\ngrowth in computational complexity as the number of time steps increases. We\nprove that the error between the solutions generated by the conventional\nalgorithm and our innovative approach lies within the scope of machine error.\nNumerical experiments are showcased to affirm the accuracy and efficiency gains\nin terms of both memory usage and computational expenses.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:09:48 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:24:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Chen","Gang",""],["Zhang","Yangwen",""],["Zuo","Dujin",""]]}
{"id":"2308.15410","submitter":"Kiera Van Der Sande","authors":"Kiera van der Sande, Andr\\'es Mu\\~noz-Jaramillo, Subhamoy Chatterjee","title":"Probabilistic solar flare forecasting using historical magnetogram data","comments":"22 pages, 16 figures, accepted to ApJ","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR cs.LG physics.space-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Solar flare forecasting research using machine learning (ML) has focused on\nhigh resolution magnetogram data from the SDO/HMI era covering Solar Cycle 24\nand the start of Solar Cycle 25, with some efforts looking back to SOHO/MDI for\ndata from Solar Cycle 23. In this paper, we consider over 4 solar cycles of\ndaily historical magnetogram data from multiple instruments. This is the first\nattempt to take advantage of this historical data for ML-based flare\nforecasting. We apply a convolutional neural network (CNN) to extract features\nfrom full-disk magnetograms together with a logistic regression model to\nincorporate scalar features based on magnetograms and flaring history. We use\nan ensemble approach to generate calibrated probabilistic forecasts of M-class\nor larger flares in the next 24 hours. Overall, we find that including\nhistorical data improves forecasting skill and reliability. We show that single\nframe magnetograms do not contain significantly more relevant information than\ncan be summarized in a small number of scalar features, and that flaring\nhistory has greater predictive power than our CNN-extracted features. This\nindicates the importance of including temporal information in flare forecasting\nmodels.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:10:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["van der Sande","Kiera",""],["Mu\u00f1oz-Jaramillo","Andr\u00e9s",""],["Chatterjee","Subhamoy",""]]}
{"id":"2308.15411","submitter":"Gurpahul Singh","authors":"Gurpahul Singh, Ritesh K. Singh and Soumitro Banerjee","title":"Embedding of a non-Hermitian Hamiltonian to emulate the von Neumann\n  measurement scheme","comments":"23 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The problem of how measurement in quantum mechanics takes place has existed\nsince its formulation. Von Neumann proposed a scheme where he treated\nmeasurement as a two-part process -- a unitary evolution in the full\nsystem-ancilla space and then a projection onto one of the pointer states of\nthe ancilla (representing the \"collapse\" of the wavefunction). The Lindblad\nmaster equation, which has been extensively used to explain dissipative quantum\nphenomena in the presence of an environment, can effectively describe the first\npart of the von Neumann measurement scheme when the jump operators in the\nmaster equation are Hermitian. We have proposed a non-Hermitian Hamiltonian\nformalism to emulate the first part of the von Neumann measurement scheme. We\nhave used the embedding protocol to dilate a non-Hermitian Hamiltonian that\ngoverns the dynamics in the system subspace into a higher-dimensional Hermitian\nHamiltonian that evolves the full space unitarily. We have obtained the various\nconstraints and the required dimensionality of the ancilla Hilbert space in\norder to achieve the required embedding. Using this particular embedding and a\nspecific projection operator, one obtains non-Hermitian dynamics in the system\nsubspace that closely follow the Lindblad master equation. This work lends a\nnew perspective to the measurement problem by employing non-Hermitian\nHamiltonians.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:10:41 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Singh","Gurpahul",""],["Singh","Ritesh K.",""],["Banerjee","Soumitro",""]]}
{"id":"2308.15412","submitter":"Surjyasish Mitra","authors":"Priyam Chakraborty, Surjyasish Mitra, A-Reum Kim, Boxin Zhao and\n  Sushanta K. Mitra","title":"A density functional theory approach to interpret elastowetting of\n  hydrogels","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Sessile hydrogel drops on rigid surfaces exhibit wetting/contact morphology\nintermediate between liquid drops and glass spheres. Using density functional\ntheory, we reveal the contact forces acting between a hydrogel and a rigid\nglass surface. We show that while transitioning from liquid-like to solid-like\nhydrogels, there exists a critical hydrogel elasticity which enables a switch\nfrom attractive to repulsive interaction with the underlying rigid glass\nsurface. Our theoretical model is validated by experimental observations of\nsessile Polyacrylamide (PAAm) hydrogels of varying elasticity on glass\nsurfaces. Further, the proposed model successfully approaches Young's law in\nthe pure liquid limit and work of adhesion in the glassy limit. Lastly, we show\na modified contact angle relation taking into account the hydrogel elasticity\nto explain the features of a distinct hydrogel foot.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:11:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chakraborty","Priyam",""],["Mitra","Surjyasish",""],["Kim","A-Reum",""],["Zhao","Boxin",""],["Mitra","Sushanta K.",""]]}
{"id":"2308.15413","submitter":"Eric Lei","authors":"Eric Lei, Muhammad Asad Lodhi, Jiahao Pang, Junghyun Ahn, Dong Tian","title":"WrappingNet: Mesh Autoencoder via Deep Sphere Deformation","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV eess.IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  There have been recent efforts to learn more meaningful representations via\nfixed length codewords from mesh data, since a mesh serves as a complete model\nof underlying 3D shape compared to a point cloud. However, the mesh\nconnectivity presents new difficulties when constructing a deep learning\npipeline for meshes. Previous mesh unsupervised learning approaches typically\nassume category-specific templates, e.g., human face/body templates. It\nrestricts the learned latent codes to only be meaningful for objects in a\nspecific category, so the learned latent spaces are unable to be used across\ndifferent types of objects. In this work, we present WrappingNet, the first\nmesh autoencoder enabling general mesh unsupervised learning over heterogeneous\nobjects. It introduces a novel base graph in the bottleneck dedicated to\nrepresenting mesh connectivity, which is shown to facilitate learning a shared\nlatent space representing object shape. The superiority of WrappingNet mesh\nlearning is further demonstrated via improved reconstruction quality and\ncompetitive classification compared to point cloud learning, as well as latent\ninterpolation between meshes of different categories.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:13:04 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lei","Eric",""],["Lodhi","Muhammad Asad",""],["Pang","Jiahao",""],["Ahn","Junghyun",""],["Tian","Dong",""]]}
{"id":"2308.15414","submitter":"Svetlana Gorokhova","authors":"Safak Alpay, Eduard Emelyanov, Svetlana Gorokhova","title":"Duality and Norm Completeness in the Classes of Limitedly--Lwc and\n  Dunford--Pettis--Lwc Operators","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.FA","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the duality and norm completeness in the classes of\nlimitedly--L-weakly compact and Dunford--Pettis--L-weakly compact and operators\nfrom Banach spaces to Banach lattices.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:15:15 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Alpay","Safak",""],["Emelyanov","Eduard",""],["Gorokhova","Svetlana",""]]}
{"id":"2308.15415","submitter":"Sam Chow","authors":"Sam Chow and Owen Jones","title":"On the variance of the Fibonacci partition function","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We determine the order of magnitude of the variance of the Fibonacci\npartition function. The answer is different to the most naive guess. The proof\ninvolves a diophantine system and an inhomogeneous linear recurrence.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:19:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chow","Sam",""],["Jones","Owen",""]]}
{"id":"2308.15416","submitter":"Alexander Wolff","authors":"Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan\n  Kratochv\\'il, Alexander Wolff","title":"The Parametrized Complexity of the Segment Number","comments":"The conference version of this paper appears in Proc. Graph Drawing\n  and Network Visualization 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given a straight-line drawing of a graph, a {\\em segment} is a maximal set of\nedges that form a line segment. Given a planar graph $G$, the {\\em segment\nnumber} of $G$ is the minimum number of segments that can be achieved by any\nplanar straight-line drawing of $G$. The {\\em line cover number} of $G$ is the\nminimum number of lines that support all the edges of a planar straight-line\ndrawing of $G$. Computing the segment number or the line cover number of a\nplanar graph is $\\exists\\mathbb{R}$-complete and, thus, NP-hard.\n  We study the problem of computing the segment number from the perspective of\nparameterized complexity. We show that this problem is fixed-parameter\ntractable with respect to each of the following parameters: the vertex cover\nnumber, the segment number, and the line cover number. We also consider colored\nversions of the segment and the line cover number.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:21:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cornelsen","Sabine",""],["Da Lozzo","Giordano",""],["Grilli","Luca",""],["Gupta","Siddharth",""],["Kratochv\u00edl","Jan",""],["Wolff","Alexander",""]]}
{"id":"2308.15417","submitter":"Paola Testa","authors":"Paola Testa (1), Helle Bakke (2,3), Luc Rouppe van der Voort (2,3),\n  and Bart De Pontieu (4,2,3) ((1) Harvard-Smithsonian Center for Astrophysics,\n  (2) Rosseland Centre for Solar Physics, University of Oslo, (3) Institute of\n  Theoretical Astrophysics, University of Oslo, (4) Lockheed Martin Solar &\n  Astrophysics Laboratory)","title":"High Resolution Observations of the Low Atmospheric Response to Small\n  Coronal Heating Events in an Active Region Core","comments":"Accepted for publication in the Astrophysical Journal. 21 pages, 13\n  figures","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.SR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High resolution spectral observations of the lower solar atmosphere\n(chromosphere and transition region) during coronal heating events, in\ncombination with predictions from models of impulsively heated loops, provide\npowerful diagnostics of the properties of the heating in active region cores.\nHere we analyze the first coordinated observations of such events with the\nInterface Region Imaging Spectrograph (IRIS) and the CHROMospheric Imaging\nSpectrometer (CHROMIS), at the Swedish 1-m Solar Telescope (SST), which\nprovided extremely high spatial resolution and revealed chromospheric\nbrightenings with spatial dimensions down to ~150km. We use machine learning\nmethods (k-means clustering) and find significant coherence in the spatial and\ntemporal properties of the chromospheric spectra, suggesting, in turn,\ncoherence in the spatial and temporal distribution of the coronal heating. The\ncomparison of IRIS and CHROMIS spectra with simulations suggest that both\nnon-thermal electrons with low energy (low-energy cutoff ~5keV) and direct\nheating in the corona transported by thermal conduction contribute to the\nheating of the low atmosphere. This is consistent with growing evidence that\nnon-thermal electrons are not uncommon in small heating events (nano- to\nmicro-flares), and that their properties can be constrained by chromospheric\nand transition region spectral observations.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:22:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Testa","Paola",""],["Bakke","Helle",""],["van der Voort","Luc Rouppe",""],["De Pontieu","Bart",""]]}
{"id":"2308.15418","submitter":"Abhiroop Chellu","authors":"Lucie Leguay, Abhiroop Chellu, Joonas Hilska, Esperanza Luna, Andrei\n  Schliwa, Mircea Guina and Teemu Hakkarainen","title":"Electronic structure of GaSb/AlGaSb quantum dots formed by filling\n  droplet-etched nanoholes","comments":"Lucie Leguay and Abhiroop Chellu contributed equally to this work","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mes-hall","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Epitaxially-grown semiconductor quantum dots (QDs) provide an attractive\nplatform for the development of deterministic sources of high-quality quantum\nstates of light. Such non-classical light sources are essential for quantum\ninformation processing and quantum communication. QDs emitting in the telecom\nwavelengths are especially important for ensuring compatibility with optical\nfiber systems required to implement quantum communication networks. To this\nend, GaSb QDs fabricated by filling local-droplet etched nanoholes are emerging\nas a viable approach, yet the electronic properties of such nanostructures have\nnot been studied in detail. In this article, an insight into the electronic\nstructure and carrier dynamics in GaSb/AlGaSb QDs is provided through a\nsystematic experimental analysis of their temperature-dependent\nphotoluminescence behavior. A steady-state rate equation model is used to\nreveal the relevant energy barriers for thermally activated carrier capture and\nescape processes. Furthermore, results of detailed theoretical simulations of\nquantum-confined energy states using the multi-band k.p model and the effective\nmass method are presented. The purpose of the simulations is to reveal the\ndirect and indirect energy states, carrier wavefunctions, and allowed optical\ntransitions for GaSb QDs with different physical dimensions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:23:49 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Leguay","Lucie",""],["Chellu","Abhiroop",""],["Hilska","Joonas",""],["Luna","Esperanza",""],["Schliwa","Andrei",""],["Guina","Mircea",""],["Hakkarainen","Teemu",""]]}
{"id":"2308.15419","submitter":"Tyler A. Chang","authors":"Tyler A. Chang, Zhuowen Tu, Benjamin K. Bergen","title":"Characterizing Learning Curves During Language Model Pre-Training:\n  Learning, Forgetting, and Stability","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How do language models learn to make predictions during pre-training? To\nstudy this question, we extract learning curves from five autoregressive\nEnglish language model pre-training runs, for 1M tokens in context. We observe\nthat the language models generate short repetitive phrases before learning to\ngenerate longer and more coherent text. We quantify the final surprisal,\nwithin-run variability, age of acquisition, forgettability, and cross-run\nvariability of learning curves for individual tokens in context. More frequent\ntokens reach lower final surprisals, exhibit less variability within and across\npre-training runs, are learned earlier, and are less likely to be \"forgotten\"\nduring pre-training. Higher n-gram probabilities further accentuate these\neffects. Independent of the target token, shorter and more frequent contexts\ncorrelate with marginally more stable and quickly acquired predictions. Effects\nof part-of-speech are also small, although nouns tend to be acquired later and\nless stably than verbs, adverbs, and adjectives. Our work contributes to a\nbetter understanding of language model pre-training dynamics and informs the\ndeployment of stable language models in practice.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:24:09 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chang","Tyler A.",""],["Tu","Zhuowen",""],["Bergen","Benjamin K.",""]]}
{"id":"2308.15420","submitter":"Minxi He","authors":"Minxi He, Kohei Kamada, Kyohei Mukaida","title":"Geometry and unitarity of scalar fields coupled to gravity","comments":"6+2 pages, 1 table","journal-ref":null,"doi":null,"report-no":"KEK-TH-2547, KEK-Cosmo-0320, RESCEU-19/23","categories":"hep-ph astro-ph.CO hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We formulate scalar field theories coupled non-conformally to gravity in a\nmanifestly frame-independent fashion. Physical quantities such as the\n$S$-matrix should be invariant under field redefinitions, and hence are\nrepresented by the geometry of the target space. This elegant geometric\nformulation, however, is obscured when considering the coupling to gravity\nbecause of the redundancy associated with the Weyl transformation. The\nwell-known example is the Higgs inflation, where the target space of Higgs is\nflat in the Jordan frame but is curved in the Einstein frame. Furthermore, one\ncan even show that any geometry of O$(N)$ nonlinear $\\sigma$ models can be\nflattened by an appropriate Weyl transformation. In this letter, we extend the\nnotion of the target space by including the conformal mode of the metric, and\nshow that the extended geometry provides a compact formulation that is\nmanifestly Weyl-transformation/field-redefinition invariant. We estimate the\nscale of the perturbative unitarity violation from the two-to-two scattering\namplitudes based on this formalism.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:24:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["He","Minxi",""],["Kamada","Kohei",""],["Mukaida","Kyohei",""]]}
{"id":"2308.15421","submitter":"Emanuele Mendicelli","authors":"Emanuele Mendicelli","title":"Investigating how to simulate lattice gauge theories on a quantum\n  computer","comments":"Phd thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-lat quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Quantum computers have the potential to expand the utility of lattice gauge\ntheory to investigate non-perturbative particle physics phenomena that cannot\nbe accessed using a standard Monte Carlo method due to the sign problem. Thanks\nto the qubit, quantum computers can store Hilbert space in a more efficient way\ncompared to classical computers. This allows the Hamiltonian approach to be\ncomputationally feasible, leading to absolute freedom from the sign-problem.\nBut what the current noisy intermediate scale quantum hardware can achieve is\nunder investigation, and therefore we chose to study the energy spectrum and\nthe time evolution of an SU(2) theory using two kinds of quantum hardware: the\nD-Wave quantum annealer and the IBM gate-based quantum hardware.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:24:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mendicelli","Emanuele",""]]}
{"id":"2308.15422","submitter":"Ben Hayes","authors":"Ben Hayes, Jordie Shier, Gy\\\"orgy Fazekas, Andrew McPherson,\n  Charalampos Saitis","title":"A Review of Differentiable Digital Signal Processing for Music & Speech\n  Synthesis","comments":"Under review for Frontiers in Signal Processing","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SD eess.AS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The term \"differentiable digital signal processing\" describes a family of\ntechniques in which loss function gradients are backpropagated through digital\nsignal processors, facilitating their integration into neural networks. This\narticle surveys the literature on differentiable audio signal processing,\nfocusing on its use in music & speech synthesis. We catalogue applications to\ntasks including music performance rendering, sound matching, and voice\ntransformation, discussing the motivations for and implications of the use of\nthis methodology. This is accompanied by an overview of digital signal\nprocessing operations that have been implemented differentiably. Finally, we\nhighlight open challenges, including optimisation pathologies, robustness to\nreal-world conditions, and design trade-offs, and discuss directions for future\nresearch.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:29:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Hayes","Ben",""],["Shier","Jordie",""],["Fazekas","Gy\u00f6rgy",""],["McPherson","Andrew",""],["Saitis","Charalampos",""]]}
{"id":"2308.15423","submitter":"Matthew Deakin","authors":"Matthew Deakin","title":"Defining and Constraining the Electrical Cardinality of Multiport\n  Converter Mission Profiles","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Mission profiles describe a representative set of conditions that a power\nconverter is designed to operate under, and are known to be more complicated\nfor multiport converter applications due to a wider range of combinations of\npowers that can be transferred between ports. This paper studies the properties\nof mission profiles derived from operational optimization of multiport\nconverters in distribution system applications (e.g., soft open points). The\nelectrical cardinality of the mission profile is introduced as a useful,\nnaturally varying property of multiport mission profiles derived from optimal\noperation within distribution system, with the cardinality equal to the number\nof non-zero power transfers at a given time. Furthermore, it is shown that the\ncardinality can be conveniently constrained within the framework of\nconventional mixed-integer conic optimization problems, yielding a family of\nmission profiles that can enable converter designers to simplify multiport\ndesigns via converter reconfiguration. Results demonstrate the potential to\nreduce the cardinality in a four-terminal multiport converter from four to two\nwhilst still effectively supporting congestion management and achieving 91.7%\nof the loss reduction capabilities of a conventional design.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:29:19 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Deakin","Matthew",""]]}
{"id":"2308.15424","submitter":"Chiu Fan Lee","authors":"Chiu Fan Lee","title":"Nonequilibrium glass transitions in the spherical $p$-spin model with\n  antisymmetric interactions","comments":"5 pages MT + 5 pages SM, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.soft cond-mat.dis-nn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Our theoretical understanding of glassy dynamics is notoriously incomplete,\nand it is even more so when the glassy systems are driven out of equilibrium.\nAn extreme way to drive a system out of equilibrium is to introduce\nnonequilibrium dynamics at the microscopic level, e.g., through active forcing\nof the constituent particles or by having nonreciprocal interactions among the\nparticles. While glassy dynamics under active forcing has been studied by many,\nthe latter nonequilibrium scenario has received little attention. Here, I study\nthe glassy dynamics of the spherical $p$-spin model for $p\\geq 3$ with\nantisymmetric interactions, which generalizes reciprocal interactions in 2-body\ninteractions. The spherical $p$-spin model is an integral tool in the study of\ndynamical glass transition, and when antisymmetric interactions are added, I\nshow analytically and numerically that glassy behavior is generically\nsuppressed. Moreover, I obtain analytical expressions on the modified dynamical\nglass transition point and the Edward-Anderson parameter (i.e., the asymptotic\nplateau height value of the spin-spin correlation function) in the small\ndriving limit.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:29:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lee","Chiu Fan",""]]}
{"id":"2308.15425","submitter":"Yang Hong Li","authors":"Yang Hong Li, Jim Al-Khalili, Paul Stevenson","title":"A Quantum Simulation Approach to Implementing Nuclear Density Functional\n  Theory via Imaginary Time Evolution","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"nucl-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantum imaginary time evolution (QITE) algorithm is a direct\nimplementation of the classical imaginary time evolution algorithm on quantum\ncomputer. We implement the QITE algorithm for the case of nuclear Hartree-Fock\nequations in a formalism equivalent to nuclear density functional theory. We\ndemonstrate the algorithm in the case of the helium-4 nucleus with a simplified\neffective interaction of the Skyrme kind and demonstrate that the QITE, as\nimplemented on simulated quantum computer, gives identical results to the\nclassical algorithm.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:29:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Li","Yang Hong",""],["Al-Khalili","Jim",""],["Stevenson","Paul",""]]}
{"id":"2308.15426","submitter":"Marcelo Coniglio","authors":"Marcelo E. Coniglio","title":"Combining swap structures: the case of Paradefinite Ivlev-like modal\n  logics based on FDE","comments":"32 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO math.LO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The aim of this paper is to combine several Ivev-like modal systems\ncharacterized by 4-valued non-deterministic matrices (Nmatrices) with IDM4, a\n4-valued expansion of Belnap-Dunn's logic FDE with an implication introduced by\nPynko in 1999. In order to to this, we introduce a new methodology for\ncombining logics which are characterized by means of swap structures, based on\nwhat we call superposition of snapshots. In particular, the combination of IDM4\nwith Tm, the 4-valued Ivlev's version of KT, will be analyzed with more\ndetails. From the semantical perspective, the idea is to combine the 4-valued\nswap structures (Nmatrices) for Tm (and several of its extensions) with the\n4-valued twist structure (logical matrix) for IDM4. This superposition produces\na universe of 6 snapshots, with 3 of them being designated. The multioperators\nover the new universe are defined by combining the specifications of the given\nswap and twist structures. This gives origin to 6 different paradefinite\nIvlev-like modal logics, each one of them characterized by a 6-valued Nmatrix,\nand conservatively extending the original modal logic and IDM4. This important\nfeature allows us to consider the proposed construction as a genuine technique\nfor combining logics. In addition, it is possible to define in the combined\nlogics a classicality operator in the sense of logics of evidence and truth\n(LETs). A sound and complete Hilbert-style axiomatization is also presented for\nthe 6 combined systems, as well as a very simple Prolog program which\nimplements the swap structures semantics for the 6 systems, which gives a\ndecision procedure for satisfiability, refutability and validity of formulas in\nthese logics.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 15:52:36 GMT"},{"version":"v2","created":"Thu, 31 Aug 2023 16:23:24 GMT"}],"update_date":"2023-09-01","authors_parsed":[["Coniglio","Marcelo E.",""]]}
{"id":"2308.15427","submitter":"Wenjie Gao","authors":"Wenjie Gao, Jiawei Fu, Haodong Jing, and Nanning Zheng","title":"Complementing Onboard Sensors with Satellite Map: A New Perspective for\n  HD Map Construction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  High-Definition (HD) maps play a crucial role in autonomous driving systems.\nRecent methods have attempted to construct HD maps in real-time based on\ninformation obtained from vehicle onboard sensors. However, the performance of\nthese methods is significantly susceptible to the environment surrounding the\nvehicle due to the inherent limitation of onboard sensors, such as weak\ncapacity for long-range detection. In this study, we demonstrate that\nsupplementing onboard sensors with satellite maps can enhance the performance\nof HD map construction methods, leveraging the broad coverage capability of\nsatellite maps. For the purpose of further research, we release the satellite\nmap tiles as a complementary dataset of nuScenes dataset. Meanwhile, we propose\na hierarchical fusion module that enables better fusion of satellite maps\ninformation with existing methods. Specifically, we design an attention mask\nbased on segmentation and distance, applying the cross-attention mechanism to\nfuse onboard Bird's Eye View (BEV) features and satellite features in\nfeature-level fusion. An alignment module is introduced before concatenation in\nBEV-level fusion to mitigate the impact of misalignment between the two\nfeatures. The experimental results on the augmented nuScenes dataset showcase\nthe seamless integration of our module into three existing HD map construction\nmethods. It notably enhances their performance in both HD map semantic\nsegmentation and instance detection tasks.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:33:16 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Gao","Wenjie",""],["Fu","Jiawei",""],["Jing","Haodong",""],["Zheng","Nanning",""]]}
{"id":"2308.15428","submitter":"Tianwen Huang","authors":"Tianwen Huang, Lo\\\"ic Becerra, Aur\\'elie Gensbittel, Yunlin Zheng,\n  Hakeim Talleb, Ulises Acevedo Salas, Zhuoxiang Ren, and Massimiliano\n  Marangolo","title":"Self-biased magnetoelectric Ni/LiNbO3/Ni for body embedded electronic\n  energy harvesters","comments":"20 pages, 9 figures,","journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci physics.app-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this study, we present the fabrication and characterization of\nNi/LiNbO3/Ni trilayers using RF sputtering. These trilayers exhibit thick Ni\nlayers (10 microns) and excellent adherence to the substrate, enabling high\nmagnetoelectric coefficients. By engineering the magnetic anisotropy of Nickel\nthrough anisotropic thermal residual stress induced during fabrication, and by\nselecting a carefully chosen cut angle for the LiNbO3 substrate, we achieved a\nself-biased behavior. We demonstrate that these trilayers can power medical\nimplant devices remotely using a small AC magnetic field excitation, thereby\neliminating the need for a DC magnetic field and bulky magnetic field sources.\nThe results highlight the potential of these trilayers for the wireless and\nnon-invasive powering of medical implants. This work contributes to the\nadvancement of magnetoelectric materials and their applications in healthcare\ntechnology.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:34:06 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Tianwen",""],["Becerra","Lo\u00efc",""],["Gensbittel","Aur\u00e9lie",""],["Zheng","Yunlin",""],["Talleb","Hakeim",""],["Salas","Ulises Acevedo",""],["Ren","Zhuoxiang",""],["Marangolo","Massimiliano",""]]}
{"id":"2308.15429","submitter":"Andrew McNutt","authors":"Elsie Lee-Robbins, Andrew McNutt","title":"Only YOU Can Make IEEE VIS Environmentally Sustainable","comments":"Accepted to alt.vis2023","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.HC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The IEEE VIS Conference (or VIS) hosts more than 1000 people annually. It\nbrings together visualization researchers and practitioners from across the\nworld to share new research and knowledge. Behind the scenes, a team of\nvolunteers puts together the entire conference and makes sure it runs smoothly.\nOrganizing involves logistics of the conference, ensuring that the attendees\nhave an enjoyable time, allocating rooms to multiple concurrent tracks, and\nkeeping the conference within budget. In recent years, the COVID-19 pandemic\nhas abruptly disrupted plans, forcing organizers to switch to virtual, hybrid,\nand satellite formats. These alternatives offer many benefits: fewer costs\n(e.g., travel, venue, institutional), greater accessibility (who can physically\ntravel, who can get visas, who can get child care), and a lower carbon\nfootprint (as people do not need to fly to attend). As many conferences begin\nto revert to the pre-pandemic status quo of primarily in-person conferences, we\nsuggest that it is an opportune moment to reflect on the benefits and drawbacks\nof lower-carbon conference formats. To learn more about the logistics of\nconference organizing, we talked to 6 senior executive-level VIS organizers. We\nreview some of the many considerations that go into planning, particularly with\nregard to how they influence decisions about alternative formats. We aim to\nstart a discussion about the sustainability of VIS -- including sustainability\nfor finance, volunteers, and, central to this work, the environment -- for the\nnext three years and the next three hundred years.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:43:43 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lee-Robbins","Elsie",""],["McNutt","Andrew",""]]}
{"id":"2308.15430","submitter":"Martin Hentschinski","authors":"Marco Alcazar Peredo and Martin Hentschinski","title":"Ratio of $J/\\Psi$ and $\\Psi(2s)$ exclusive photoproduction\n  cross-sections as an indicator for the presence of non-linear QCD evolution","comments":"21 pages, 14 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We investigate the proposal that the rise with energy of the ratio of the\nexclusive photo-production cross-sections of vector mesons $\\Psi(2s)$ and\n$J/\\Psi$ can serve as an indicator for the presence of high gluon densities and\nassociated non-linear high energy evolution; we study this proposal for both\nphotoproduction on a proton and a lead nucleus. While previous studies were\nbased on unintegrated gluon distributions subject to linear\n(Balitsky-Fadin-Kuraev-Lipatov) and non-linear (Balitsky-Kovchegov) evolution\nequations, the current study is based on the Golec-Biernat W\\\"usthoff (GBW) and\nBartels Golec-Biernat Kowalski (BGK) models, which allow assessing more\ndirectly the relevance of non-linear corrections for the description of the\nenergy dependence of the photoproduction cross-section. We find that the rise\nof the ratio is directly related to the presence of a node in the $\\Psi(2s)$\nwave function and only manifests itself for the complete non-linear models,\nwhile it is absent for their linearized versions. We further provide\npredictions based on leading order collinear factorization and examine to which\nextent such an approach can mimic a ratio rising with energy. We also provide a\ndescription of recent ALICE data on the energy dependence of the photonuclear\n$J/\\Psi$ production cross-section and give predictions for the energy\ndependence of the ratio of $\\Psi(2s)$ and $J/\\Psi$ photoproduction\ncross-sections for both scattering on a proton and a lead nucleus.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:45:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Peredo","Marco Alcazar",""],["Hentschinski","Martin",""]]}
{"id":"2308.15431","submitter":"Noa Kliss","authors":"N. Kliss, J. Wengrowicz, J. Papeer, E. Porat, A. Zigler, Y. Frank","title":"Sinusoidal Transmission Grating Spectrometer for EUV Measure","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.optics physics.plasm-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  Spectral measurements play a vital role in understanding laser-plasma\ninteractions. The ability to accurately measure the spectrum of radiation\nsources is crucial for unraveling the underlying physics. In this article, we\nintroduce a novel approach that significantly enhances the efficiency of binary\nSinusoidal Transmission Grating Spectrometers (STGS). The grating was tailored\nespecially for Extreme Ultraviolet (EUV) measurements. The new design, High\nContrast Sinusoidal Transmission Grating (HCSTG), not only suppresses high\ndiffraction orders and retains the advantageous properties of previous designs\nbut also exhibits a fourfold improvement in first-order efficiency. In\naddition, the HCSTG offers exceptional purity in the first order due to\neffectively eliminating half-order contributions from the diffraction pattern.\nThe HCSTG spectrometer was employed to measure the emission of laser-produced\nSn plasma in the 1-50 nm spectral range, achieving spectral resolution of\n$\\lambda/\\Delta\\lambda=60$. We provide a comprehensive analysis comparing the\ndiffraction patterns of different STGs, highlighting the advantages offered by\nthe HCSTG design. This novel, enhanced efficiency HCSTG spectrometer, opens new\npossibilities for accurate and sensitive EUV spectral measurements.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:45:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kliss","N.",""],["Wengrowicz","J.",""],["Papeer","J.",""],["Porat","E.",""],["Zigler","A.",""],["Frank","Y.",""]]}
{"id":"2308.15432","submitter":"Nhat Anh Vu Nghiem","authors":"Nhat A. Nghiem","title":"Quantum Algorithm for Computing Distances Between Subspaces","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Geometry and topology have generated impacts far beyond their pure\nmathematical primitive, providing a solid foundation for many applicable tools.\nTypically, real-world data are represented as vectors, forming a linear\nsubspace for a given data collection. Computing distances between different\nsubspaces is generally a computationally challenging problem with both\ntheoretical and applicable consequences, as, for example, the results can be\nused to classify data from different categories. Fueled by the fast-growing\ndevelopment of quantum algorithms, we consider such problems in the quantum\ncontext and provide a quantum algorithm for estimating two kinds of distance:\nGrassmann distance and ellipsoid distance. Under appropriate assumptions and\nconditions, the speedup of our quantum algorithm is exponential with respect to\nboth the dimension of the given data and the number of data points. Some\nextensions regarding estimating different kinds of distance are then discussed\nas a corollary of our main quantum algorithmic method.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:46:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nghiem","Nhat A.",""]]}
{"id":"2308.15433","submitter":"Sebastian Throm","authors":"Sebastian Throm","title":"Continuum limit for interacting systems on adaptive networks","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.DS math.AP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The article considers systems of interacting particles on networks with\nadaptively coupled dynamics. Such processes appear frequently in natural\nprocesses and applications. Relying on the notion of graph convergence, we\nprove that for large systems the dynamics can be approximated by the\ncorresponding continuum limit. Well-posedness of the latter is also\nestablished.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:54:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Throm","Sebastian",""]]}
{"id":"2308.15434","submitter":"Nicole M\\\"ucke","authors":"Mike Nguyen and Nicole M\\\"ucke","title":"Random feature approximation for general spectral methods","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG stat.ML","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Random feature approximation is arguably one of the most popular techniques\nto speed up kernel methods in large scale algorithms and provides a theoretical\napproach to the analysis of deep neural networks. We analyze generalization\nproperties for a large class of spectral regularization methods combined with\nrandom features, containing kernel methods with implicit regularization such as\ngradient descent or explicit methods like Tikhonov regularization. For our\nestimators we obtain optimal learning rates over regularity classes (even for\nclasses that are not included in the reproducing kernel Hilbert space), which\nare defined through appropriate source conditions. This improves or completes\nprevious results obtained in related settings for specific kernel algorithms.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:56:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nguyen","Mike",""],["M\u00fccke","Nicole",""]]}
{"id":"2308.15435","submitter":"Jacques K Desmarais","authors":"Jacques K. Desmarais","title":"Comment on \"First-Principles Calculation of the Optical Rotatory Power\n  of Periodic Systems: Modern Theory with Modern Functionals''","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.str-el physics.chem-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The article [Desmarais \\textit{et al.} Phys Rev. B. \\textbf{107} 224430\n(2023)] provided a generalization of the ``\\textit{modern theory of orbital\nmagnetization}'' to include non-local Hamiltonians (e.g. hybrid functionals of\nthe generalized Kohn-Sham theory) for magnetic response properties. The\nformulation was employed for the calculation of the optical rotatory power of\nperiodic systems, where results indicated inequivalence between sampling of\ndirect and reciprocal spaces for those calculations far from the complete basis\nset limit. We show that such results can be explained by the fact that the\nreported calculations correspond to an approximate treatment of the action of\nthe $\\boldsymbol{\\nabla_k}$ operator on Bloch orbitals. In the article,\ncalculations are missing a hidden ``response'' contribution to the\nreciprocal-space derivatives. The missing response term is shown to (generally)\naffect the results of calculations of not only magnetic, but also electric\nresponse properties, within the context of the ``\\textit{modern theory of\npolarization}''. Necessary conditions are provided to permit avoiding the\ncalculation of the hidden response term.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 16:59:34 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Desmarais","Jacques K.",""]]}
{"id":"2308.15436","submitter":"Jose M. M. Senovilla","authors":"Jos\\'e M. M. Senovilla","title":"Semi-Riemannian manifolds with linear differential conditions on the\n  curvature","comments":"38 pages, no figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG gr-qc math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semi-Riemannian manifolds that satisfy (homogeneous) linear differential\nconditions of arbitrary order on the curvature are analyzed. They include, in\nparticular, the spaces with (higher-order) recurrent curvature, (higher-order)\nsymmetric spaces, as well as entire new families of semi-Riemannian manifolds\nrarely, or never, considered before in the literature --such as the spaces\nwhose derivative of the Riemann tensor field is recurrent, among many others.\nDefinite proof that all types of such spaces do exist is provided by exhibiting\nexplicit examples of all possibilities in all signatures, except in the\nRiemannian case with a positive definite metric. Several techniques of\nindependent interest are collected and presented. Of special relevance is the\ncase of Lorentzian manifolds, due to its connection to the physics of the\ngravitational field. This connection is discussed with particular emphasis on\nGauss-Bonnet gravity and in relation with Penrose limits. Many new lines of\nresearch open up and a handful of conjectures, based on the results found\nhitherto, is put forward.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:00:21 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Senovilla","Jos\u00e9 M. M.",""]]}
{"id":"2308.15437","submitter":"Hsi-Sheng Goan","authors":"Jhih-Yuan Kao and Hsi-Sheng Goan","title":"Existence of Pauli-like stabilizers for every quantum error-correcting\n  code","comments":"20 pages (including 7 appendices); to appear in Phys. Rev. A","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cs.IT math.IT","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  The Pauli stabilizer formalism is perhaps the most thoroughly studied means\nof procuring quantum error-correcting codes, whereby the code is obtained\nthrough commutative Pauli operators and ``stabilized'' by them. In this work we\nwill show that every quantum error-correcting code, including Pauli stabilizer\ncodes and subsystem codes, has a similar structure, in that the code can be\nstabilized by commutative ``Paulian'' operators which share many features with\nPauli operators and which form a \\textbf{Paulian stabilizer group}. By\nfacilitating a controlled gate we can measure these Paulian operators to\nacquire the error syndrome. Examples concerning codeword stabilized codes and\nbosonic codes will be presented; specifically, one of the examples has been\ndemonstrated experimentally and the observable for detecting the error turns\nout to be Paulian, thereby showing the potential utility of this approach. This\nwork provides a possible approach to implement error-correcting codes and to\nfind new codes.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:01:17 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Kao","Jhih-Yuan",""],["Goan","Hsi-Sheng",""]]}
{"id":"2308.15438","submitter":"Laurence Mayther","authors":"Laurence H. Mayther","title":"Unboundedness above and below of the Donaldson-Hitchin functionals on\n  $\\mathrm{G}_2$- and $\\widetilde{\\mathrm{G}}_2$-forms","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.GT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper combines explicit local calculations with covering arguments to\nprove the unboundedness above and below (in a logarithmic sense) of the\nDonaldson-Hitchin functionals on $\\mathrm{G}_2$ 4-forms,\n$\\widetilde{\\mathrm{G}}_2$ 3-forms and $\\widetilde{\\mathrm{G}}_2$ 4-forms, over\ncompact manifolds (or, more generally, orbifolds) with boundary. In addition,\nthe Donaldson-Hitchin functional on $\\mathrm{G}_2$ 3-forms over compact\nmanifolds (or orbifolds) with boundary is shown to be unbounded below. As\nscholia, the critical points of the functionals on $\\mathrm{G}_2$ 4-forms,\n$\\widetilde{\\mathrm{G}}_2$ 3-forms and $\\widetilde{\\mathrm{G}}_2$ 4-forms are\nshown to be saddles, and initial conditions of the Laplacian coflow which do\nnot lead to convergent solutions are shown to be dense.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:04:29 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mayther","Laurence H.",""]]}
{"id":"2308.15439","submitter":"Henrik Juergens","authors":"Hermann Boos and Henrik Juergens","title":"On the properties of the density matrix of the\n  $\\mathfrak{sl}_{n+1}$-invariant model","comments":"42 pages, 24 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math-ph math.MP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We present an ansatz of generalizing the construction of recursion relations\nfor the correlation functions of the $\\mathfrak{sl}_2$-invariant fundamental\nexchange model in the thermodynamic limit by Jimbo, Miwa, Smirnov, Takeyama and\none of our present authors in 2004 for higher rank. Due to the structure of the\ncorrelators as functions of their inhomogeneity parameters, a recursion formula\nfor the reduced density matrix was proven. In the case of $\\mathfrak{sl}_3$ we\nuse the explicit results of Kl\\\"umper and Ribeiro and Nirov, Hutsalyuk and one\nof our present authors for the reduced density matrix of up to operator length\nthree to verify whether it is possible to relate the residues of the density\nmatrix of length $n$ to the density matrix of length smaller than $n$ as in\n$\\mathfrak{sl}_2$. This is unclear, since the reduced quantum\nKnizhnik--Zamolodchikov equation splits into two parts for higher rank. In\nfact, we show two relations, one of which is analogous to the $\\mathfrak{sl}_2$\ncase and one which is new. This allows us to construct an analogue of the\noperator $X_k$, which we call Snail Operator. In the $\\mathfrak{sl}_2$ case\nthis operator has many nice properties including in particular the fact that\nonly one irreducible representation of the Yangian $Y(\\mathfrak{sl}_2)$, the\nKirillov--Reshetikhin module $W_k$, contributed the residue at\n$\\lambda_i-\\lambda_j=-(k+1)$.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:05:15 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 06:33:00 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Boos","Hermann",""],["Juergens","Henrik",""]]}
{"id":"2308.15440","submitter":"Germain Tobar Mr","authors":"Germain Tobar, Sreenath K. Manikandan, Thomas Beitel, Igor Pikovski","title":"Detecting single gravitons with quantum sensing","comments":"Main text: 6 pages, 3 figures. Appendices: 7 pages, 1 figure","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph astro-ph.CO gr-qc hep-th","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantization of gravity is widely believed to result in gravitons --\nparticles of discrete energy that form gravitational waves. But their detection\nhas so far been considered impossible. Here we show that signatures of single\ngravitons can be observed in laboratory experiments. We show that stimulated\nand spontaneous single-graviton processes can become relevant for massive\nquantum acoustic resonators and that stimulated absorption can be resolved\nthrough continuous sensing of quantum jumps. We analyze the feasibility of\nobserving the exchange of single energy quanta between matter and gravitational\nwaves. Our results show that single graviton signatures are within reach of\nexperiments. In analogy to the discovery of the photo-electric effect for\nphotons, such signatures can provide the first experimental evidence of the\nquantization of gravity.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:05:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Tobar","Germain",""],["Manikandan","Sreenath K.",""],["Beitel","Thomas",""],["Pikovski","Igor",""]]}
{"id":"2308.15441","submitter":"Kai Zheng","authors":"Dor Minzer and Kai Zhe Zheng","title":"Adversarial Low Degree Testing","comments":"18 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.IT math.IT","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In the $t$-online-erasure model in property testing, an adversary is allowed\nto erase $t$ values of a queried function for each query the tester makes. This\nmodel was recently formulated by Kalemaj, Raskhodnikova andVarma, who showed\nthat the properties of linearity of functions as well as quadraticity can be\ntested in$O_t(1)$ many queries: $O(\\log (t))$ for linearity and $2^{2^{O(t)}}$\nfor quadraticity. They asked whether the more general property of\nlow-degreeness can be tested in the online erasure model, whether better\ntesters exist for quadraticity, and if similar results hold when ``erasures''\nare replaced with ``corruptions''.\n  We show that, in the $t$-online-erasure model, for a prime power $q$, given\nquery access to a function $f: \\mathbb{F}_q^n \\xrightarrow[]{} \\mathbb{F}_q$,\none can distinguish in $\\mathrm{poly}(\\log^{d+q}(t)/\\delta)$ queries between\nthe case that $f$ is degree at most $d$, and the case that $f$ is $\\delta$-far\nfrom any degree $d$ function (with respect to the fractional hamming distance).\nThis answers the aforementioned questions and brings the query complexity to\nnearly match the query complexity of low-degree testing in the classical\nproperty testing model. Our results are based on the observation that the\nproperty of low-degreeness admits a large and versatile family of query\nefficient testers. Our testers operates by querying a uniformly random,\nsufficiently large set of points in a large enough affine subspace, and finding\na tester for low-degreeness that only utilizes queries from that set of points.\n  We believe that this tester may find other applications to algorithms in the\nonline-erasure model or other related models, and may be of independent\ninterest.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:05:40 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Minzer","Dor",""],["Zheng","Kai Zhe",""]]}
{"id":"2308.15442","submitter":"Naphan Benchasattabuse","authors":"Naphan Benchasattabuse, Andreas B\\\"artschi, Luis Pedro\n  Garc\\'ia-Pintos, John Golden, Nathan Lemons and Stephan Eidenbenz","title":"Lower Bounds on Number of QAOA Rounds Required for Guaranteed\n  Approximation Ratios","comments":"24 pages, comments welcome, v2: fixed hyperlinks not working","journal-ref":null,"doi":null,"report-no":"LA-UR-23-29376","categories":"quant-ph cs.DS","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The quantum alternating operator ansatz (QAOA) is a heuristic hybrid\nquantum-classical algorithm for finding high-quality approximate solutions to\ncombinatorial optimization problems, such as Maximum Satisfiability. While QAOA\nis well-studied, theoretical results as to its runtime or approximation ratio\nguarantees are still relatively sparse. We provide some of the first lower\nbounds for the number of rounds (the dominant component of QAOA runtimes)\nrequired for QAOA. For our main result, (i) we leverage a connection between\nquantum annealing times and the angles of QAOA to derive a lower bound on the\nnumber of rounds of QAOA with respect to the guaranteed approximation ratio. We\napply and calculate this bound with Grover-style mixing unitaries and (ii) show\nthat this type of QAOA requires at least a polynomial number of rounds to\nguarantee any constant approximation ratios for most problems. We also (iii)\nshow that the bound depends only on the statistical values of the objective\nfunctions, and when the problem can be modeled as a $k$-local Hamiltonian, can\nbe easily estimated from the coefficients of the Hamiltonians. For the\nconventional transverse field mixer, (iv) our framework gives a trivial lower\nbound to all bounded occurrence local cost problems and all strictly $k$-local\ncost Hamiltonians matching known results that constant approximation ratio is\nobtainable with constant round QAOA for a few optimization problems from these\nclasses. Using our novel proof framework, (v) we recover the Grover lower bound\nfor unstructured search and -- with small modification -- show that our bound\napplies to any QAOA-style search protocol that starts in the ground state of\nthe mixing unitaries.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:10:20 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 05:25:38 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Benchasattabuse","Naphan",""],["B\u00e4rtschi","Andreas",""],["Garc\u00eda-Pintos","Luis Pedro",""],["Golden","John",""],["Lemons","Nathan",""],["Eidenbenz","Stephan",""]]}
{"id":"2308.15443","submitter":"Rafa{\\l} Weron","authors":"Weronika Nitka and Rafa{\\l} Weron","title":"Combining predictive distributions of electricity prices: Does\n  minimizing the CRPS lead to optimal decisions in day-ahead bidding?","comments":"12 pages, 7 figures, 2 tables. Submitted to Operations Research and\n  Decisions","journal-ref":null,"doi":null,"report-no":null,"categories":"q-fin.ST econ.EM stat.CO stat.ML","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Probabilistic price forecasting has recently gained attention in power\ntrading because decisions based on such predictions can yield significantly\nhigher profits than those made with point forecasts alone. At the same time,\nmethods are being developed to combine predictive distributions, since no model\nis perfect and averaging generally improves forecasting performance. In this\narticle we address the question of whether using CRPS learning, a novel\nweighting technique minimizing the continuous ranked probability score (CRPS),\nleads to optimal decisions in day-ahead bidding. To this end, we conduct an\nempirical study using hourly day-ahead electricity prices from the German EPEX\nmarket. We find that increasing the diversity of an ensemble can have a\npositive impact on accuracy. At the same time, the higher computational cost of\nusing CRPS learning compared to an equal-weighted aggregation of distributions\nis not offset by higher profits, despite significantly more accurate\npredictions.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:10:38 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nitka","Weronika",""],["Weron","Rafa\u0142",""]]}
{"id":"2308.15444","submitter":"Oscar Defrain","authors":"Caroline Brosse and Oscar Defrain and Kazuhiro Kurita and Vincent\n  Limouzy and Takeaki Uno and Kunihiro Wasa","title":"On the hardness of inclusion-wise minimal separators enumeration","comments":"11 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DM math.CO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Enumeration problems are often encountered as key subroutines in the exact\ncomputation of graph parameters such as chromatic number, treewidth, or\ntreedepth. In the case of treedepth computation, the enumeration of\ninclusion-wise minimal separators plays a crucial role. However and quite\nsurprisingly, the complexity status of this problem has not been settled since\nit has been posed as an open direction by Kloks and Kratsch in 1998. Recently\nat the PACE 2020 competition dedicated to treedepth computation, solvers have\nbeen circumventing that by listing all minimal $a$-$b$ separators and filtering\nout those that are not inclusion-wise minimal, at the cost of efficiency.\nNaturally, having an efficient algorithm for listing inclusion-wise minimal\nseparators would drastically improve such practical algorithms. In this note,\nhowever, we show that no efficient algorithm is to be expected from an\noutput-sensitive perspective, namely, we prove that there is no\noutput-polynomial time algorithm for inclusion-wise minimal separators\nenumeration unless P = NP.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:11:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Brosse","Caroline",""],["Defrain","Oscar",""],["Kurita","Kazuhiro",""],["Limouzy","Vincent",""],["Uno","Takeaki",""],["Wasa","Kunihiro",""]]}
{"id":"2308.15445","submitter":"John Abowd","authors":"John M. Abowd and Kevin L. McKinney","title":"Mixed-Effects Methods for Search and Matching Research","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.EM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study mixed-effects methods for estimating equations containing person and\nfirm effects. In economics such models are usually estimated using\nfixed-effects methods. Recent enhancements to those fixed-effects methods\ninclude corrections to the bias in estimating the covariance matrix of the\nperson and firm effects, which we also consider.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:13:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Abowd","John M.",""],["McKinney","Kevin L.",""]]}
{"id":"2308.15446","submitter":"Christian Weiss","authors":"Christian Weiss","title":"A p-adic Poissonian Pair Correlation Concept","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The pair correlation statistic is an important concept in real uniform\ndistribution theory. Therefore, sequences in the unit interval with (weak)\nPoissonian pair correlations have attracted a lot of attention in recent time.\nThe aim of this paper is to suggest a generalization to the p-adic integers and\nto prove some of its main properties. In particular, connections to the theory\nof p-adic discrepancy theory are discussed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:16:07 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Weiss","Christian",""]]}
{"id":"2308.15447","submitter":"Theodore Drivas D","authors":"Theodore D. Drivas, Sameer Iyer and Trinh T. Nguyen","title":"The Feynman-Lagerstrom criterion for boundary layers","comments":"34 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"math.AP math-ph math.MP physics.flu-dyn","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We study the boundary layer theory for slightly viscous stationary flows\nforced by an imposed slip velocity at the boundary. According to the theory of\nPrandtl (1904) and Batchelor (1956), any Euler solution arising in this limit\nand consisting of a single ``eddy\" must have constant vorticity. Feynman and\nLagerstrom (1956) gave a procedure to select the value of this vorticity by\ndemanding a \\textit{necessary} condition for the existence of a periodic\nPrandtl boundary layer description. In the case of the disc, the choice --\nknown to Batchelor (1956) and Wood (1957) -- is explicit in terms of the slip\nforcing. For domains with non-constant curvature, Feynman and Lagerstrom give\nan approximate formula for the choice which is in fact only implicitly defined\nand must be determined together with the boundary layer profile. We show that\nthis condition is also sufficient for the existence of a periodic boundary\nlayer described by the Prandtl equations. Due to the quasilinear coupling\nbetween the solution and the selected vorticity, we devise a delicate iteration\nscheme coupled with a high-order energy method that captures and controls the\nimplicit selection mechanism.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:16:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Drivas","Theodore D.",""],["Iyer","Sameer",""],["Nguyen","Trinh T.",""]]}
{"id":"2308.15448","submitter":"Tanjim Mahmud","authors":"Tanjim Mahmud, Michal Ptaszynski, Fumito Masui","title":"Vulgar Remarks Detection in Chittagonian Dialect of Bangla","comments":"5 pages","journal-ref":"Human Language Technologies as a Challenge for Computer Science\n  and Linguistics, Zygmunt Vetulani, Patrick Paroubek (eds.)2023","doi":"10.14746/amup.9788323241775","report-no":"978-83-232-4177-5 (PDF)","categories":"cs.CL","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The negative effects of online bullying and harassment are increasing with\nInternet popularity, especially in social media. One solution is using natural\nlanguage processing (NLP) and machine learning (ML) methods for the automatic\ndetection of harmful remarks, but these methods are limited in low-resource\nlanguages like the Chittagonian dialect of Bangla.This study focuses on\ndetecting vulgar remarks in social media using supervised ML and deep learning\nalgorithms.Logistic Regression achieved promising accuracy (0.91) while simple\nRNN with Word2vec and fastTex had lower accuracy (0.84-0.90), highlighting the\nissue that NN algorithms require more data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:19:32 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mahmud","Tanjim",""],["Ptaszynski","Michal",""],["Masui","Fumito",""]]}
{"id":"2308.15449","submitter":"Xiangzhe Xu","authors":"Xiangzhe Xu, Zhou Xuan, Shiwei Feng, Siyuan Cheng, Yapeng Ye, Qingkai\n  Shi, Guanhong Tao, Le Yu, Zhuo Zhang, and Xiangyu Zhang","title":"PEM: Representing Binary Program Semantics for Similarity Analysis via a\n  Probabilistic Execution Model","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SE","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Binary similarity analysis determines if two binary executables are from the\nsame source program. Existing techniques leverage static and dynamic program\nfeatures and may utilize advanced Deep Learning techniques. Although they have\ndemonstrated great potential, the community believes that a more effective\nrepresentation of program semantics can further improve similarity analysis. In\nthis paper, we propose a new method to represent binary program semantics. It\nis based on a novel probabilistic execution engine that can effectively sample\nthe input space and the program path space of subject binaries. More\nimportantly, it ensures that the collected samples are comparable across\nbinaries, addressing the substantial variations of input specifications. Our\nevaluation on 9 real-world projects with 35k functions, and comparison with 6\nstate-of-the-art techniques show that PEM can achieve a precision of 96% with\ncommon settings, outperforming the baselines by 10-20%.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:20:35 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 01:57:23 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xu","Xiangzhe",""],["Xuan","Zhou",""],["Feng","Shiwei",""],["Cheng","Siyuan",""],["Ye","Yapeng",""],["Shi","Qingkai",""],["Tao","Guanhong",""],["Yu","Le",""],["Zhang","Zhuo",""],["Zhang","Xiangyu",""]]}
{"id":"2308.15450","submitter":"Gabriele Ciaramella","authors":"S. Buchwald, G. Ciaramella, J. Salomon","title":"Gauss-Newton oriented greedy algorithms for the reconstruction of\n  operators in nonlinear dynamics","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.OC cs.NA math.NA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  This paper is devoted to the development and convergence analysis of greedy\nreconstruction algorithms based on the strategy presented in [Y. Maday and J.\nSalomon, Joint Proceedings of the 48th IEEE Conference on Decision and Control\nand the 28th Chinese Control Conference, 2009, pp. 375--379]. These procedures\nallow the design of a sequence of control functions that ease the\nidentification of unknown operators in nonlinear dynamical systems. The\noriginal strategy of greedy reconstruction algorithms is based on an\noffline/online decomposition of the reconstruction process and an ansatz for\nthe unknown operator obtained by an a priori chosen set of linearly independent\nmatrices. In the previous work [S. Buchwald, G. Ciaramella and J. Salomon, SIAM\nJ. Control Optim., 59(6), pp. 4511-4537], convergence results were obtained in\nthe case of linear identification problems. We tackle here the more general\ncase of nonlinear systems. More precisely, we introduce a new greedy algorithm\nbased on the linearized system. Then, we show that the controls obtained with\nthis new algorithm lead to the local convergence of the classical Gauss-Newton\nmethod applied to the online nonlinear identification problem. We then extend\nthis result to the controls obtained on nonlinear systems where a local\nconvergence result is also proved. The main convergence results are obtained\nfor the reconstruction of drift operators in dynamical systems with linear and\nbilinear control structures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:20:59 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Buchwald","S.",""],["Ciaramella","G.",""],["Salomon","J.",""]]}
{"id":"2308.15451","submitter":"Jon Atwell","authors":"Jon Atwell and Marlon Twyman II","title":"Metawisdom of the Crowd: How Choice Within Aided Decision Making Can\n  Make Crowd Wisdom Robust","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"econ.GN q-fin.EC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Quality information can improve individual judgments but nonetheless fail to\nmake group decisions more accurate; if individuals choose to attend to the same\ninformation in the same way, the predictive diversity that enables crowd wisdom\nmay be lost. Decision support systems, from business intelligence software to\npublic search engines, present individuals with decision aids -- discrete\npresentations of relevant information, interpretative frames, or heuristics --\nto enhance the quality and speed of decision making, but have the potential to\nbias judgments through the selective presentation of information and\ninterpretative frames. We redescribe the wisdom of the crowd as often having\ntwo decisions, the choice of decision aids and then the primary decision. We\nthen define \\emph{metawisdom of the crowd} as any pattern by which the\ncollective choice of aids leads to higher crowd accuracy than randomized\nassignment to the same aids, a comparison that accounts for the information\ncontent of the aids. While choice is ultimately constrained by the setting, in\ntwo experiments -- the prediction of inflation (N=947, pre-registered) and a\ntightly controlled estimation game (N=1198) -- we find strong evidence of\nmetawisdom. It comes about through diverse errors arising through the use of\ndiverse aids, not through widespread use of the aids that induce the most\naccurate estimates. Thus the microfoundations of crowd wisdom appear in the\nfirst choice, suggesting crowd wisdom can be robust in information choice\nproblems. Given the implications for collective decision making, more research\non the nature and use of decision aids is needed.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:22:28 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Atwell","Jon",""],["Twyman","Marlon","II"]]}
{"id":"2308.15452","submitter":"Ningyu Zhang","authors":"Zhen Bi, Ningyu Zhang, Yinuo Jiang, Shumin Deng, Guozhou Zheng, Huajun\n  Chen","title":"When Do Program-of-Thoughts Work for Reasoning?","comments":"Work in progress","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI cs.LG cs.SE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The reasoning capabilities of Large Language Models (LLMs) play a pivotal\nrole in the realm of embodied artificial intelligence. Although there are\neffective methods like program-of-thought prompting for LLMs which uses\nprogramming language to tackle complex reasoning tasks, the specific impact of\ncode data on the improvement of reasoning capabilities remains under-explored.\nTo address this gap, we propose complexity-impacted reasoning score (CIRS),\nwhich combines structural and logical attributes, to measure the correlation\nbetween code and reasoning abilities. Specifically, we use the abstract syntax\ntree to encode the structural information and calculate logical complexity by\nconsidering the difficulty and the cyclomatic complexity. Through an empirical\nanalysis, we find not all code data of complexity can be learned or understood\nby LLMs. Optimal level of complexity is critical to the improvement of\nreasoning abilities by program-aided prompting. Then we design an\nauto-synthesizing and stratifying algorithm, and apply it to instruction\ngeneration for mathematical reasoning and code data filtering for code\ngeneration tasks. Extensive results demonstrates the effectiveness of our\nproposed approach. Code will be integrated into the EasyInstruct framework at\nhttps://github.com/zjunlp/EasyInstruct.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:22:39 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Bi","Zhen",""],["Zhang","Ningyu",""],["Jiang","Yinuo",""],["Deng","Shumin",""],["Zheng","Guozhou",""],["Chen","Huajun",""]]}
{"id":"2308.15453","submitter":"Tendai Mapungwana Chikake","authors":"Tendai Mapungwana Chikake, Boris Goldengorin and Alexey Samosyuk","title":"Pseudo-Boolean Polynomials Approach To Edge Detection And Image\n  Segmentation","comments":"14 pages, 8 figures, submitted to the International Conference Data\n  Analysis, Optimization and Their Applications on the Occasion of Boris\n  Mirkin's 80th Birthday January 30-31, 2023, Dolgoprudny, Moscow Region,\n  Moscow Institute of Physics and Technology\n  https://mipt.ru/education/chairs/dm/conferences/data-analysis-optimization-and-their-applications-2023.php","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.DM","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We introduce a deterministic approach to edge detection and image\nsegmentation by formulating pseudo-Boolean polynomials on image patches. The\napproach works by applying a binary classification of blob and edge regions in\nan image based on the degrees of pseudo-Boolean polynomials calculated on\npatches extracted from the provided image. We test our method on simple images\ncontaining primitive shapes of constant and contrasting colour and establish\nthe feasibility before applying it to complex instances like aerial landscape\nimages. The proposed method is based on the exploitation of the reduction,\npolynomial degree, and equivalence properties of penalty-based pseudo-Boolean\npolynomials.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:23:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chikake","Tendai Mapungwana",""],["Goldengorin","Boris",""],["Samosyuk","Alexey",""]]}
{"id":"2308.15454","submitter":"Mohammad Ghomi","authors":"Mohammad Ghomi","title":"Convexity and rigidity of hypersurfaces in Cartan-Hadamard manifolds","comments":"14 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.DG math.AP math.MG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We show that in Cartan-Hadamard manifolds $M^n$, $n\\geq 3$, closed\ninfinitesimally convex hypersurfaces $\\Gamma$ bound convex flat regions, if\ncurvature of $M^n$ vanishes on tangent planes of $\\Gamma$. This encompasses\nChern-Lashof characterization of convex hypersurfaces in Euclidean space, and\nsome results of Greene-Wu-Gromov on rigidity of Cartan-Hadamard manifolds. It\nfollows that closed simply connected surfaces in $M^3$ with minimal total\nabsolute curvature bound Euclidean convex bodies, as stated by M. Gromov in\n1985. The proofs employ the Gauss-Codazzi equations, a generalization of Schur\ncomparison theorem to CAT($k$) spaces, and other techniques from Alexandrov\ngeometry outlined by A. Petrunin.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:27:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Ghomi","Mohammad",""]]}
{"id":"2308.15455","submitter":"Sinan Okyay `","authors":"Sinan Okyay, Elia Merzari, David A. Reger, Victor Coppo Leite,\n  Guillaume Giudicelli, Peter German, Alexander Lindsay","title":"Validation and Comparison of HI-STORM Overpack Thermal-Hydraulic Model\n  with MOOSE and NekRS","comments":"12 pages, 9 figures, Proceedings of NURETH-20 Conference","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.flu-dyn","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Nuclear power is a significant source of electricity in the United States,\nbut the average U.S. nuclear power plant is around 40 years old. Safe\nmanagement of spent nuclear fuel (SNF) is a crucial aspect of the back end of\nthe nuclear fuel cycle. SNF dry storage systems are increasingly popular as\nthey represent an effective solution in this area, given the absence of a final\ndisposal system. In particular, the spent fuel cask system (dry cask method)\nprovides a feasible solution for maintaining SNF ($\\sim$60 years) prior to the\nfinal disposal. The HI-STORM overpack and MPC-32 canister are the primary\ncomponents of the HI-STORM 100 dry cask storage system. They remove heat from\nthe system via natural circulation with no human intervention required. This\ncharacteristic provides passive heat removal while requiring little maintenance\nin dry cask storage systems. This project aims to validate and compare the\ncapabilities of a thermal model of HI-STORM overpack developed using the\nMultiphysics Object-Oriented Simulation Environment (MOOSE) based on the\nauthor's previous study. MOOSE is an open-source framework developed by Idaho\nNational Laboratory for multiscale, multiphysics simulations. This study will\nimprove the capabilities of the thermal-hydraulic model of the HI-STORM dry\ncask storage system by producing high-fidelity results for the air circulation\nin the overpack. Large Eddy Simulations (LES) are performed using the\nopen-source spectral element code NekRS, developed by Argonne National\nLaboratory (ANL), for simulating transitional and turbulent flows in complex\ngeometries. NekRS will produce high-fidelity results for the HI-STORM overpack\nto assess the validity of the current thermal-hydraulic model.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:29:44 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Okyay","Sinan",""],["Merzari","Elia",""],["Reger","David A.",""],["Leite","Victor Coppo",""],["Giudicelli","Guillaume",""],["German","Peter",""],["Lindsay","Alexander",""]]}
{"id":"2308.15456","submitter":"Ismail Cosandal","authors":"Ismail Cosandal and Sennur Ulukus","title":"Timely Multi-Goal Transmissions With an Intermittently Failing Sensor","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.IT cs.NI eess.SP math.IT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  A sensor observes a random phenomenon and transmits updates about the\nobserved phenomenon to a remote monitor. The sensor may experience intermittent\nfailures in which case the monitor will not receive any updates until the\nsensor has recovered. The monitor wants to keep a timely view of the observed\nprocess, as well as to detect any sensor failures, using the timings of the\nupdates. We analyze this system model from a goal-oriented and semantic\ncommunication point of view, where the communication has multiple goals and\nmultiple meanings/semantics. For the first goal, the performance is quantified\nby the age of information of the observed process at the monitor. For the\nsecond goal, the performance is quantified by the probability of error of the\nmonitor's estimation of the sensor's failure status. Each arriving update\npacket brings both an information update and an indication about the sensor's\nstatus. The monitor estimates the failure status of the sensor by using the\ntimings of the received updates. This estimation is subject to error, since a\nlong period without any update receptions may be due to a low update rate or a\nfailure of the sensor. We examine the trade-off between these two goals. We\nshow that the probability of error of estimating a sensor failure decreases\nwith increased update rate, however, the age of information is minimized with\nan intermediate update rate (not too low or high).\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:31:03 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cosandal","Ismail",""],["Ulukus","Sennur",""]]}
{"id":"2308.15457","submitter":"Ha Mai Tan","authors":"Wei-Chao Cheng, Tan-Ha Mai, Hsuan-Tien Lin","title":"From SMOTE to Mixup for Deep Imbalanced Classification","comments":"25 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Given imbalanced data, it is hard to train a good classifier using deep\nlearning because of the poor generalization of minority classes. Traditionally,\nthe well-known synthetic minority oversampling technique (SMOTE) for data\naugmentation, a data mining approach for imbalanced learning, has been used to\nimprove this generalization. However, it is unclear whether SMOTE also benefits\ndeep learning. In this work, we study why the original SMOTE is insufficient\nfor deep learning, and enhance SMOTE using soft labels. Connecting the\nresulting soft SMOTE with Mixup, a modern data augmentation technique, leads to\na unified framework that puts traditional and modern data augmentation\ntechniques under the same umbrella. A careful study within this framework shows\nthat Mixup improves generalization by implicitly achieving uneven margins\nbetween majority and minority classes. We then propose a novel margin-aware\nMixup technique that more explicitly achieves uneven margins. Extensive\nexperimental results demonstrate that our proposed technique yields\nstate-of-the-art performance on deep imbalanced classification while achieving\nsuperior performance on extremely imbalanced data. The code is open-sourced in\nour developed package https://github.com/ntucllab/imbalanced-DL to foster\nfuture research in this direction.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:31:26 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cheng","Wei-Chao",""],["Mai","Tan-Ha",""],["Lin","Hsuan-Tien",""]]}
{"id":"2308.15458","submitter":"Riccardo Busetto","authors":"Riccardo Busetto, Valentina Breschi and Simone Formentin","title":"Meta-learning for model-reference data-driven control","comments":"Preprint submitted to Automatica","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  One-shot direct model-reference control design techniques, like the Virtual\nReference Feedback Tuning (VRFT) approach, offer time-saving solutions for the\ncalibration of fixed-structure controllers for dynamic systems. Nonetheless,\nsuch methods are known to be highly sensitive to the quality of the available\ndata, often requiring long and costly experiments to attain acceptable\nclosed-loop performance. These features might prevent the widespread adoption\nof such techniques, especially in low-data regimes. In this paper, we argue\nthat the inherent similarity of many industrially relevant systems may come at\nhand, offering additional information from plants that are similar (yet not\nequal) to the system one aims to control. Assuming that this supplementary\ninformation is available, we propose a novel, direct design approach that\nleverages the data from similar plants, the knowledge of controllers calibrated\non them, and the corresponding closed-loop performance to enhance\nmodel-reference control design. More specifically, by constructing the new\ncontroller as a combination of the available ones, our approach exploits all\nthe available priors following a meta-learning philosophy, while ensuring\nnon-decreasing performance. An extensive numerical analysis supports our\nclaims, highlighting the effectiveness of the proposed method in achieving\nperformance comparable to iterative approaches, while at the same time\nretaining the efficiency of one-shot direct data-driven methods like VRFT.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:35:46 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Busetto","Riccardo",""],["Breschi","Valentina",""],["Formentin","Simone",""]]}
{"id":"2308.15459","submitter":"Zachary Horvitz","authors":"Zachary Horvitz, Ajay Patel, Chris Callison-Burch, Zhou Yu, Kathleen\n  McKeown","title":"ParaGuide: Guided Diffusion Paraphrasers for Plug-and-Play Textual Style\n  Transfer","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CL cs.AI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Textual style transfer is the task of transforming stylistic properties of\ntext while preserving meaning. Target \"styles\" can be defined in numerous ways,\nranging from single attributes (e.g, formality) to authorship (e.g,\nShakespeare). Previous unsupervised style-transfer approaches generally rely on\nsignificant amounts of labeled data for only a fixed set of styles or require\nlarge language models. In contrast, we introduce a novel diffusion-based\nframework for general-purpose style transfer that can be flexibly adapted to\narbitrary target styles at inference time. Our parameter-efficient approach,\nParaGuide, leverages paraphrase-conditioned diffusion models alongside\ngradient-based guidance from both off-the-shelf classifiers and strong existing\nstyle embedders to transform the style of text while preserving semantic\ninformation. We validate the method on the Enron Email Corpus, with both human\nand automatic evaluations, and find that it outperforms strong baselines on\nformality, sentiment, and even authorship style transfer.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:36:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Horvitz","Zachary",""],["Patel","Ajay",""],["Callison-Burch","Chris",""],["Yu","Zhou",""],["McKeown","Kathleen",""]]}
{"id":"2308.15460","submitter":"Elizabeth Collins-Woodfin","authors":"Elizabeth Collins-Woodfin, Han Gia Le","title":"Free energy of the bipartite spherical SK model at critical temperature","comments":"45 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.PR math-ph math.MP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  The spherical Sherrington-Kirkpatrick (SSK) model and its bipartite analog\nboth exhibit the phenomenon that their free energy fluctuations are\nasymptotically Gaussian at high temperature but asymptotically Tracy-Widom at\nlow temperature. This was proved in two papers by Baik and Lee, for all\nnon-critical temperatures. The case of critical temperature was recently\ncomputed for the SSK model in two separate papers, one by Landon and the other\nby Johnstone, Klochkov, Onatski, Pavlyshyn. In the current paper, we derive the\ncritical temperature result for the bipartite SSK model. In particular, we find\nthat the free energy fluctuations exhibit a transition when the temperature is\nin a window of size $n^{-1/3}\\sqrt{\\log n}$ around the critical temperature,\nthe same window for the SSK model. Within this transitional window, the\nasymptotic fluctuations of the free energy are the sum of independent Gaussian\nand Tracy-Widom random variables.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:38:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Collins-Woodfin","Elizabeth",""],["Le","Han Gia",""]]}
{"id":"2308.15461","submitter":"Brent Yi","authors":"Brent Yi, Weijia Zeng, Sam Buchanan, and Yi Ma","title":"Canonical Factors for Hybrid Neural Fields","comments":"ICCV 2023. Project webpage: https://brentyi.github.io/tilted/","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG math.OC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Factored feature volumes offer a simple way to build more compact, efficient,\nand intepretable neural fields, but also introduce biases that are not\nnecessarily beneficial for real-world data. In this work, we (1) characterize\nthe undesirable biases that these architectures have for axis-aligned signals\n-- they can lead to radiance field reconstruction differences of as high as 2\nPSNR -- and (2) explore how learning a set of canonicalizing transformations\ncan improve representations by removing these biases. We prove in a\ntwo-dimensional model problem that simultaneously learning these\ntransformations together with scene appearance succeeds with drastically\nimproved efficiency. We validate the resulting architectures, which we call\nTILTED, using image, signed distance, and radiance field reconstruction tasks,\nwhere we observe improvements across quality, robustness, compactness, and\nruntime. Results demonstrate that TILTED can enable capabilities comparable to\nbaselines that are 2x larger, while highlighting weaknesses of neural field\nevaluation procedures.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:38:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yi","Brent",""],["Zeng","Weijia",""],["Buchanan","Sam",""],["Ma","Yi",""]]}
{"id":"2308.15462","submitter":"Yazhou Xing","authors":"Yazhou Xing, Amrita Mazumdar, Anjul Patney, Chao Liu, Hongxu Yin,\n  Qifeng Chen, Jan Kautz, Iuri Frosio","title":"Online Overexposed Pixels Hallucination in Videos with Adaptive\n  Reference Frame Selection","comments":"The demo video can be found at\n  https://drive.google.com/file/d/1-r12BKImLOYCLUoPzdebnMyNjJ4Rk360/view","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Low dynamic range (LDR) cameras cannot deal with wide dynamic range inputs,\nfrequently leading to local overexposure issues. We present a learning-based\nsystem to reduce these artifacts without resorting to complex acquisition\nmechanisms like alternating exposures or costly processing that are typical of\nhigh dynamic range (HDR) imaging. We propose a transformer-based deep neural\nnetwork (DNN) to infer the missing HDR details. In an ablation study, we show\nthe importance of using a multiscale DNN and train it with the proper cost\nfunction to achieve state-of-the-art quality. To aid the reconstruction of the\noverexposed areas, our DNN takes a reference frame from the past as an\nadditional input. This leverages the commonly occurring temporal instabilities\nof autoexposure to our advantage: since well-exposed details in the current\nframe may be overexposed in the future, we use reinforcement learning to train\na reference frame selection DNN that decides whether to adopt the current frame\nas a future reference. Without resorting to alternating exposures, we obtain\ntherefore a causal, HDR hallucination algorithm with potential application in\ncommon video acquisition settings. Our demo video can be found at\nhttps://drive.google.com/file/d/1-r12BKImLOYCLUoPzdebnMyNjJ4Rk360/view\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:40:57 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xing","Yazhou",""],["Mazumdar","Amrita",""],["Patney","Anjul",""],["Liu","Chao",""],["Yin","Hongxu",""],["Chen","Qifeng",""],["Kautz","Jan",""],["Frosio","Iuri",""]]}
{"id":"2308.15463","submitter":"Alessio Serafini","authors":"Michele Avalle and Alessio Serafini","title":"A note on typicality in random quantum scattering","comments":"12 pages (5 pages of main text + 7 pages of appendices)","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech","license":"http://creativecommons.org/publicdomain/zero/1.0/","abstract":"  We consider scattering processes where a quantum system is comprised of an\ninner subsystem and of a boundary, and is subject to Haar-averaged random\nunitaries acting on the boundary-environment Hilbert space only. We show that,\nregardless of the initial state, a single scattering event will disentangle the\nunconditional state (i.e., the scattered state when no information about the\napplied unitary is available) across the inner subsystem-boundary partition.\nAlso, we apply Levy's lemma to constrain the trace norm fluctuations around the\nunconditional state. Finally, we derive analytical formulae for the mean\nscattered purity for initial globally pure states, and provide one with\nnumerical evidence of the reduction of fluctuations around such mean values\nwith increasing environmental dimension.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:42:25 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Avalle","Michele",""],["Serafini","Alessio",""]]}
{"id":"2308.15464","submitter":"Yangxinyu Xie","authors":"Yangxinyu Xie, Tanwi Mallick","title":"A Comparative Study of Loss Functions: Traffic Predictions in Regular\n  and Congestion Scenarios","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Spatiotemporal graph neural networks have achieved state-of-the-art\nperformance in traffic forecasting. However, they often struggle to forecast\ncongestion accurately due to the limitations of traditional loss functions.\nWhile accurate forecasting of regular traffic conditions is crucial, a reliable\nAI system must also accurately forecast congestion scenarios to maintain safe\nand efficient transportation. In this paper, we explore various loss functions\ninspired by heavy tail analysis and imbalanced classification problems to\naddress this issue. We evaluate the efficacy of these loss functions in\nforecasting traffic speed, with an emphasis on congestion scenarios. Through\nextensive experiments on real-world traffic datasets, we discovered that when\noptimizing for Mean Absolute Error (MAE), the MAE-Focal Loss function stands\nout as the most effective. When optimizing Mean Squared Error (MSE), Gumbel\nLoss proves to be the superior choice. These choices effectively forecast\ntraffic congestion events without compromising the accuracy of regular traffic\nspeed forecasts. This research enhances deep learning models' capabilities in\nforecasting sudden speed changes due to congestion and underscores the need for\nmore research in this direction. By elevating the accuracy of congestion\nforecasting, we advocate for AI systems that are reliable, secure, and\nresilient in practical traffic management scenarios.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:44:02 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Xie","Yangxinyu",""],["Mallick","Tanwi",""]]}
{"id":"2308.15465","submitter":"Thiago Felicissimo","authors":"Thiago Felicissimo and Fr\\'ed\\'eric Blanqui","title":"Sharing proofs with predicative theories through universe polymorphic\n  elaboration","comments":"Journal version of https://doi.org/10.4230/LIPIcs.CSL.2023.19 to be\n  submitted to LMCS, also supersedes arXiv:2211.05700","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LO","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  As the development of formal proofs is a time-consuming task, it is important\nto devise ways of sharing the already written proofs to prevent wasting time\nredoing them. One of the challenges in this domain is to translate proofs\nwritten in proof assistants based on impredicative logics to proof assistants\nbased on predicative logics, whenever impredicativity is not used in an\nessential way.\n  In this paper we present a transformation for sharing proofs with a core\npredicative system supporting prenex universe polymorphism (like in Agda). It\nconsists in trying to elaborate each term into a predicative universe\npolymorphic term as general as possible. The use of universe polymorphism is\njustified by the fact that mapping each universe to a fixed one in the target\ntheory is not sufficient in most cases. During the elaboration, we need to\nsolve unification problems in the equational theory of universe levels. In\norder to do this, we give a complete characterization of when a single equation\nadmits a most general unifier. This characterization is then employed in an\nalgorithm which uses a constraint-postponement strategy to solve unification\nproblems.\n  The proposed translation is of course partial, but in practice allows one to\ntranslate many proofs that do not use impredicativity in an essential way.\nIndeed, it was implemented in the tool Predicativize and then used to translate\nsemi-automatically many non-trivial developments from Matita's library to Agda,\nincluding proofs of Bertrand's Postulate and Fermat's Little Theorem, which (as\nfar as we know) were not available in Agda yet.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:45:01 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 16:06:35 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Felicissimo","Thiago",""],["Blanqui","Fr\u00e9d\u00e9ric",""]]}
{"id":"2308.15466","submitter":"Coenraad Mouton","authors":"Coenraad Mouton, Marthinus W. Theunissen, Marelie H. Davel","title":"Input margins can predict generalization too","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Understanding generalization in deep neural networks is an active area of\nresearch. A promising avenue of exploration has been that of margin\nmeasurements: the shortest distance to the decision boundary for a given sample\nor its representation internal to the network. While margins have been shown to\nbe correlated with the generalization ability of a model when measured at its\nhidden representations (hidden margins), no such link between large margins and\ngeneralization has been established for input margins. We show that while input\nmargins are not generally predictive of generalization, they can be if the\nsearch space is appropriately constrained. We develop such a measure based on\ninput margins, which we refer to as `constrained margins'. The predictive power\nof this new measure is demonstrated on the 'Predicting Generalization in Deep\nLearning' (PGDL) dataset and contrasted with hidden representation margins. We\nfind that constrained margins achieve highly competitive scores and outperform\nother margin measurements in general. This provides a novel insight on the\nrelationship between generalization and classification margins, and highlights\nthe importance of considering the data manifold for investigations of\ngeneralization in DNNs.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:47:42 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Mouton","Coenraad",""],["Theunissen","Marthinus W.",""],["Davel","Marelie H.",""]]}
{"id":"2308.15467","submitter":"Zoran \\v{S}koda","authors":"Zoran \\v{S}koda, Martina Stoji\\'c","title":"Enveloping algebra of a Lie algebra as a Yetter-Drinfeld module algebra\n  over the Hopf algebra of regular functions on its automorphism group","comments":"17 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"math.QA","license":"http://creativecommons.org/licenses/by-sa/4.0/","abstract":"  We present an elementary proof that there is a (highly degenerate) Hopf\npairing between the universal enveloping algebra $U(\\mathfrak{g})$ of a\nfinite-dimensional Lie algebra $\\mathfrak{g}$ and the Hopf algebra\n$\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{g}))$ of regular functions on the\nautomorphism group of $\\mathfrak{g}$. This Hopf pairing induces a Hopf action\nof $\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{g}))$ on $U(\\mathfrak{g})$ which\ntogether with an explicitly given coaction makes $U(\\mathfrak{g})$ into a\nbraided-commutative algebra in the category of Yetter--Drinfeld modules over\n$\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{g}))$. These data may be used to construct\na Hopf algebroid structure on the smash product algebra\n$\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{g}))\\sharp U(\\mathfrak{g})$ retaining\nessential features from a related construction of a Hopf algebroid structure on\nearlier known infinite dimensional versions of Heisenberg double of\n$U(\\mathfrak{g})$ including a noncommutative phase space of Lie algebra type,\nwhile avoiding the need of completed tensor products.\n  Our results are proven in a slightly more general form, where\n$\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{g}))$ is replaced by\n$\\mathcal{O}(\\mathrm{Aut}(\\mathfrak{h}))$ where $\\mathfrak{h}$ is any\nfinite-dimensional Leibniz algebra having $\\mathfrak{g}$ as its maximal Lie\nalgebra quotient.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:47:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["\u0160koda","Zoran",""],["Stoji\u0107","Martina",""]]}
{"id":"2308.15468","submitter":"Zijian Yao","authors":"Zijian Yao","title":"$\\mathbb{Z}_p$-lattices in semistable Galois representations","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"math.NT math.AG","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  We show that the category of logarithmic prismatic F-crystals on\n$(\\mathcal{O}_K, \\varpi^{\\mathbb{N}})$ is equivalent to the category of\n$\\mathbb{Z}_p$-lattices in semistable $\\text{Gal}_K$-representations. We then\napply our method to describe such Galois representations using linear algebraic\ndata via various \"logarithmic\" versions of Breuil--Kisin modules.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:48:11 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yao","Zijian",""]]}
{"id":"2308.15469","submitter":"Weichen Huang","authors":"Weichen Huang","title":"Multimodal Contrastive Learning and Tabular Attention for Automated\n  Alzheimer's Disease Prediction","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Alongside neuroimaging such as MRI scans and PET, Alzheimer's disease (AD)\ndatasets contain valuable tabular data including AD biomarkers and clinical\nassessments. Existing computer vision approaches struggle to utilize this\nadditional information. To address these needs, we propose a generalizable\nframework for multimodal contrastive learning of image data and tabular data, a\nnovel tabular attention module for amplifying and ranking salient features in\ntables, and the application of these techniques onto Alzheimer's disease\nprediction. Experimental evaulations demonstrate the strength of our framework\nby detecting Alzheimer's disease (AD) from over 882 MR image slices from the\nADNI database. We take advantage of the high interpretability of tabular data\nand our novel tabular attention approach and through attribution of the\nattention scores for each row of the table, we note and rank the most\npredominant features. Results show that the model is capable of an accuracy of\nover 83.8%, almost a 10% increase from previous state of the art.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:48:33 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Huang","Weichen",""]]}
{"id":"2308.15470","submitter":"Shruti Mishra","authors":"Shruti Mishra, Ankit Anand, Jordan Hoffmann, Nicolas Heess, Martin\n  Riedmiller, Abbas Abdolmaleki, Doina Precup","title":"Policy composition in reinforcement learning via multi-objective policy\n  optimization","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We enable reinforcement learning agents to learn successful behavior policies\nby utilizing relevant pre-existing teacher policies. The teacher policies are\nintroduced as objectives, in addition to the task objective, in a\nmulti-objective policy optimization setting. Using the Multi-Objective Maximum\na Posteriori Policy Optimization algorithm (Abdolmaleki et al. 2020), we show\nthat teacher policies can help speed up learning, particularly in the absence\nof shaping rewards. In two domains with continuous observation and action\nspaces, our agents successfully compose teacher policies in sequence and in\nparallel, and are also able to further extend the policies of the teachers in\norder to solve the task.\n  Depending on the specified combination of task and teacher(s), teacher(s) may\nnaturally act to limit the final performance of an agent. The extent to which\nagents are required to adhere to teacher policies are determined by\nhyperparameters which determine both the effect of teachers on learning speed\nand the eventual performance of the agent on the task. In the humanoid domain\n(Tassa et al. 2018), we also equip agents with the ability to control the\nselection of teachers. With this ability, agents are able to meaningfully\ncompose from the teacher policies to achieve a superior task reward on the walk\ntask than in cases without access to the teacher policies. We show the\nresemblance of composed task policies with the corresponding teacher policies\nthrough videos.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:50:27 GMT"},{"version":"v2","created":"Wed, 30 Aug 2023 17:59:52 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mishra","Shruti",""],["Anand","Ankit",""],["Hoffmann","Jordan",""],["Heess","Nicolas",""],["Riedmiller","Martin",""],["Abdolmaleki","Abbas",""],["Precup","Doina",""]]}
{"id":"2308.15471","submitter":"Jianwei Miao","authors":"Colum M. O'Leary, Jianhua Zhang, Cong Su, Salman Kahn, Huaidong Jiang,\n  Alex Zettl, Jim Ciston and Jianwei Miao","title":"Three-dimensional imaging of embedded interfaces with multislice\n  ptychography","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cond-mat.mtrl-sci cond-mat.mes-hall physics.app-ph","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  We demonstrate the application of multislice ptychography to a twisted\nhexagonal boron nitride (h-BN) heterointerface from a single-view data set. The\npropagation from the top flake, through the interface, to the bottom flake is\nvisualized from separate slices of the reconstruction. The depth resolution of\nthe reconstruction is determined to be 2.74 nm, which is a significant\nimprovement over the aperture-limited depth resolution of 6.74 nm. This is\nattributed to the diffraction signal extending beyond the aperture edge with\nthe depth resolution set by the curvature of the Ewald sphere. Future advances\nto this approach could improve the depth resolution to the sub-nanometer level\nand enable the identification of individual dopants, defects and color centers\nin twisted heterointerfaces and other materials.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:50:45 GMT"}],"update_date":"2023-08-30","authors_parsed":[["O'Leary","Colum M.",""],["Zhang","Jianhua",""],["Su","Cong",""],["Kahn","Salman",""],["Jiang","Huaidong",""],["Zettl","Alex",""],["Ciston","Jim",""],["Miao","Jianwei",""]]}
{"id":"2308.15472","submitter":"Ceyuan Yang","authors":"Ceyuan Yang, Qihang Zhang, Yinghao Xu, Jiapeng Zhu, Yujun Shen, Bo Dai","title":"Learning Modulated Transformation in GANs","comments":"Technical report","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":"  The success of style-based generators largely benefits from style modulation,\nwhich helps take care of the cross-instance variation within data. However, the\ninstance-wise stochasticity is typically introduced via regular convolution,\nwhere kernels interact with features at some fixed locations, limiting its\ncapacity for modeling geometric variation. To alleviate this problem, we equip\nthe generator in generative adversarial networks (GANs) with a plug-and-play\nmodule, termed as modulated transformation module (MTM). This module predicts\nspatial offsets under the control of latent codes, based on which the\nconvolution operation can be applied at variable locations for different\ninstances, and hence offers the model an additional degree of freedom to handle\ngeometry deformation. Extensive experiments suggest that our approach can be\nfaithfully generalized to various generative tasks, including image generation,\n3D-aware image synthesis, and video generation, and get compatible with\nstate-of-the-art frameworks without any hyper-parameter tuning. It is\nnoteworthy that, towards human generation on the challenging TaiChi dataset, we\nimprove the FID of StyleGAN3 from 21.36 to 13.60, demonstrating the efficacy of\nlearning modulated geometry transformation.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:51:22 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Yang","Ceyuan",""],["Zhang","Qihang",""],["Xu","Yinghao",""],["Zhu","Jiapeng",""],["Shen","Yujun",""],["Dai","Bo",""]]}
{"id":"2308.15473","submitter":"Rachit Nimavat","authors":"Rachit Nimavat","title":"Graph Theory and its Uses in Graph Algorithms and Beyond","comments":"PhD Thesis","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.DS cs.CC","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Graphs are fundamental objects that find widespread applications across\ncomputer science and beyond. Graph Theory has yielded deep insights about\nstructural properties of various families of graphs, which are leveraged in the\ndesign and analysis of algorithms for graph optimization problems and other\ncomputational optimization problems. These insights have also proved helpful in\nunderstanding the limits of efficient computation by providing constructions of\nhard problem instances. At the same time, algorithmic tools and techniques\nprovide a fresh perspective on graph theoretic problems, often leading to novel\ndiscoveries. In this thesis, we exploit this symbiotic relationship between\ngraph theory and algorithms for graph optimization problems and beyond. This\nthesis consists of three parts.\n  In the first part, we study a graph routing problem called the Node-Disjoint\nPaths (NDP) problem. Given a graph and a set of source-destination pairs of its\nvertices, the goal is to route the maximum number of pairs via node-disjoint\npaths. We come close to resolving the approximability of NDP by showing that it\nis $n^{\\Omega(1/poly\\log\\log n)}$-hard to approximate, even on grid graphs,\nwhere n is the number of vertices. In the second part of this thesis, we use\ngraph decomposition techniques developed for efficient algorithms to derive a\ngraph theoretic result. We show that for every n-vertex expander graph G, if H\nis any graph with at most $O(n/\\log n)$ vertices and edges, then H is a minor\nof G. In the last part, we show that the graph theoretic tools and graph\nalgorithmic techniques can shed light on problems seemingly unrelated to\ngraphs. We show that the randomized space complexity of the Longest Increasing\nSubsequence (LIS) problem in the streaming model is intrinsically tied to the\nquery-complexity of the Non-Crossing Matching problem on graphs in a new model\nof computation that we define.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:51:51 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Nimavat","Rachit",""]]}
{"id":"2308.15474","submitter":"Richard Chen J","authors":"Richard J. Chen, Tong Ding, Ming Y. Lu, Drew F. K. Williamson,\n  Guillaume Jaume, Bowen Chen, Andrew Zhang, Daniel Shao, Andrew H. Song,\n  Muhammad Shaban, Mane Williams, Anurag Vaidya, Sharifa Sahai, Lukas\n  Oldenburg, Luca L. Weishaupt, Judy J. Wang, Walt Williams, Long Phi Le, Georg\n  Gerber, Faisal Mahmood","title":"A General-Purpose Self-Supervised Model for Computational Pathology","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.AI q-bio.TO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Tissue phenotyping is a fundamental computational pathology (CPath) task in\nlearning objective characterizations of histopathologic biomarkers in anatomic\npathology. However, whole-slide imaging (WSI) poses a complex computer vision\nproblem in which the large-scale image resolutions of WSIs and the enormous\ndiversity of morphological phenotypes preclude large-scale data annotation.\nCurrent efforts have proposed using pretrained image encoders with either\ntransfer learning from natural image datasets or self-supervised pretraining on\npublicly-available histopathology datasets, but have not been extensively\ndeveloped and evaluated across diverse tissue types at scale. We introduce UNI,\na general-purpose self-supervised model for pathology, pretrained using over\n100 million tissue patches from over 100,000 diagnostic haematoxylin and\neosin-stained WSIs across 20 major tissue types, and evaluated on 33\nrepresentative CPath clinical tasks in CPath of varying diagnostic\ndifficulties. In addition to outperforming previous state-of-the-art models, we\ndemonstrate new modeling capabilities in CPath such as resolution-agnostic\ntissue classification, slide classification using few-shot class prototypes,\nand disease subtyping generalization in classifying up to 108 cancer types in\nthe OncoTree code classification system. UNI advances unsupervised\nrepresentation learning at scale in CPath in terms of both pretraining data and\ndownstream evaluation, enabling data-efficient AI models that can generalize\nand transfer to a gamut of diagnostically-challenging tasks and clinical\nworkflows in anatomic pathology.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:52:10 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Chen","Richard J.",""],["Ding","Tong",""],["Lu","Ming Y.",""],["Williamson","Drew F. K.",""],["Jaume","Guillaume",""],["Chen","Bowen",""],["Zhang","Andrew",""],["Shao","Daniel",""],["Song","Andrew H.",""],["Shaban","Muhammad",""],["Williams","Mane",""],["Vaidya","Anurag",""],["Sahai","Sharifa",""],["Oldenburg","Lukas",""],["Weishaupt","Luca L.",""],["Wang","Judy J.",""],["Williams","Walt",""],["Le","Long Phi",""],["Gerber","Georg",""],["Mahmood","Faisal",""]]}
{"id":"2308.15475","submitter":"Narendra N. Hegade","authors":"Alejandro Gomez Cadavid, Iraitz Montalban, Archismita Dalal, Enrique\n  Solano, Narendra N. Hegade","title":"Efficient DCQO Algorithm within the Impulse Regime for Portfolio\n  Optimization","comments":"10 pages, 5 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We propose a faster digital quantum algorithm for portfolio optimization\nusing the digitized-counterdiabatic quantum optimization (DCQO) paradigm in the\nimpulse regime, that is, where the counterdiabatic terms are dominant. Our\napproach notably reduces the circuit depth requirement of the algorithm and\nenhances the solution accuracy, making it suitable for current quantum\nprocessors. We apply this protocol to a real-case scenario of portfolio\noptimization with 20 assets, using purely quantum and hybrid classical-quantum\nparadigms. We experimentally demonstrate the advantages of our protocol using\nup to 20 qubits on an IonQ trapped-ion quantum computer. By benchmarking our\nmethod against the standard quantum approximate optimization algorithm and\nfinite-time digitized-adiabatic algorithms, we obtain a significant reduction\nin the circuit depth by factors of 2.5 to 40, while minimizing the dependence\non the classical optimization subroutine. Besides portfolio optimization, the\nproposed method is applicable to a large class of combinatorial optimization\nproblems.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:53:08 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Cadavid","Alejandro Gomez",""],["Montalban","Iraitz",""],["Dalal","Archismita",""],["Solano","Enrique",""],["Hegade","Narendra N.",""]]}
{"id":"2308.15476","submitter":"Mariusz Semczuk","authors":"Koray Din\\c{c}er and Mariusz Semczuk","title":"Open source magnetometer for characterizing magnetic fields in ultracold\n  experiments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"physics.atom-ph cond-mat.quant-gas physics.app-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We demonstrate a fully automated, open-source magnetometer designed primarily\nfor characterization of magnetic fields produced by coils, permanent magnets or\nby parasitic sources. It is based on an Arduino Mega microcontroller and a\nthree-axis Hall sensor with a measurement range of $\\pm$8 G per axis and the\nRMS of the field readout below 0.3 mG. For all practical purposes, the sensor\ndisplacement during data acquisition is virtually unlimited, which can be\nparticularly useful for characterizing large or extended coils like Helmholtz\ncages or Zeeman slowers. All components needed for the construction are cheap\nand widely available off-the-shelf elements or are 3D-printed. The operation of\nthe magnetometer is controlled via Graphical User Interface (GUI) which manages\nall essential functionalities like data acquisition and plotting. The GUI also\nincorporates additional features like data averaging, calibration of the\ndisplacement of the Hall sensor or real-time readout of the magnetic field,\nuseful for monitoring magnetic field changes. We have used a pair of\nrectangular coils constructed for a potassium-cesium 2D magneto-optical trap to\nbenchmark the performance of the magnetometer. We have obtained an excellent\nagreement with both simulations and measurements acquired with a commercial\ngaussmeter.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:54:31 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Din\u00e7er","Koray",""],["Semczuk","Mariusz",""]]}
{"id":"2308.15477","submitter":"Mathieu Desroches","authors":"Dmitry Amakhin, Anton Chizhov, Guillaume Girier, Mathieu Desroches,\n  Jan Sieber, Serafim Rodrigues","title":"Observing hidden neuronal states in experiments","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"q-bio.NC math.DS","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We construct systematically experimental steady-state bifurcation diagrams\nfor entorhinal cortex neurons. A slowly ramped voltage-clamp electrophysiology\nprotocol serves as closed-loop feedback controlled experiment for the\nsubsequent current-clamp open-loop protocol on the same cell. In this way, the\nvoltage-clamped experiment determines dynamically stable and unstable (hidden)\nsteady states of the current-clamp experiment. The transitions between\nobservable steady states and observable spiking states in the current-clamp\nexperiment reveal stability and bifurcations of the steady states, completing\nthe steady-state bifurcation diagram.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:55:37 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Amakhin","Dmitry",""],["Chizhov","Anton",""],["Girier","Guillaume",""],["Desroches","Mathieu",""],["Sieber","Jan",""],["Rodrigues","Serafim",""]]}
{"id":"2308.15478","submitter":"Daniel LeJeune","authors":"Daniel LeJeune, Sina Alemohammad","title":"An Adaptive Tangent Feature Perspective of Neural Networks","comments":"15 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.LG cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  In order to better understand feature learning in neural networks, we propose\na framework for understanding linear models in tangent feature space where the\nfeatures are allowed to be transformed during training. We consider linear\ntransformations of features, resulting in a joint optimization over parameters\nand transformations with a bilinear interpolation constraint. We show that this\noptimization problem has an equivalent linearly constrained optimization with\nstructured regularization that encourages approximately low rank solutions.\nSpecializing to neural network structure, we gain insights into how the\nfeatures and thus the kernel function change, providing additional nuance to\nthe phenomenon of kernel alignment when the target function is poorly\nrepresented using tangent features. In addition to verifying our theoretical\nobservations in real neural networks on a simple regression problem, we\nempirically show that an adaptive feature implementation of tangent feature\nclassification has an order of magnitude lower sample complexity than the fixed\ntangent feature model on MNIST and CIFAR-10.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:57:20 GMT"}],"update_date":"2023-08-30","authors_parsed":[["LeJeune","Daniel",""],["Alemohammad","Sina",""]]}
{"id":"2308.15479","submitter":"Stefano Gasperini","authors":"Alexander Lehner, Stefano Gasperini, Alvaro Marcos-Ramiro, Michael\n  Schmidt, Nassir Navab, Benjamin Busam, Federico Tombari","title":"3D Adversarial Augmentations for Robust Out-of-Domain Predictions","comments":"37 pages, 12 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.CV cs.LG cs.RO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Since real-world training datasets cannot properly sample the long tail of\nthe underlying data distribution, corner cases and rare out-of-domain samples\ncan severely hinder the performance of state-of-the-art models. This problem\nbecomes even more severe for dense tasks, such as 3D semantic segmentation,\nwhere points of non-standard objects can be confidently associated to the wrong\nclass. In this work, we focus on improving the generalization to out-of-domain\ndata. We achieve this by augmenting the training set with adversarial examples.\nFirst, we learn a set of vectors that deform the objects in an adversarial\nfashion. To prevent the adversarial examples from being too far from the\nexisting data distribution, we preserve their plausibility through a series of\nconstraints, ensuring sensor-awareness and shapes smoothness. Then, we perform\nadversarial augmentation by applying the learned sample-independent vectors to\nthe available objects when training a model. We conduct extensive experiments\nacross a variety of scenarios on data from KITTI, Waymo, and CrashD for 3D\nobject detection, and on data from SemanticKITTI, Waymo, and nuScenes for 3D\nsemantic segmentation. Despite training on a standard single dataset, our\napproach substantially improves the robustness and generalization of both 3D\nobject detection and 3D semantic segmentation methods to out-of-domain data.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:58:55 GMT"}],"update_date":"2023-08-30","authors_parsed":[["Lehner","Alexander",""],["Gasperini","Stefano",""],["Marcos-Ramiro","Alvaro",""],["Schmidt","Michael",""],["Navab","Nassir",""],["Busam","Benjamin",""],["Tombari","Federico",""]]}
{"id":"2308.15480","submitter":"C\\'eline Zwikel","authors":"Luca Ciambelli, Arnaud Delfante, Romain Ruzziconi, C\\'eline Zwikel","title":"Symmetries and Charges in Weyl--Fefferman--Graham Gauge","comments":"33 pages","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-th gr-qc","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  We investigate the asymptotic symmetries of three-dimensional AdS Einstein\ngravity in the Weyl--Fefferman--Graham gauge, which is a generalization of the\nFefferman--Graham gauge inducing a Weyl connection as part of the boundary\nstructure. We show that this gauge arises as a natural intermediary step of the\ngauge-fixing procedure in the Chern--Simons formulation. We prove that the\ndiffeomorphism required to go to the usual Fefferman--Graham gauge can be\ncharged, and thus its implementation has physical repercussions. We discuss the\nholographic renormalization and the variational principle offering a new\nholographic take on this gauge and its charges.\n","versions":[{"version":"v1","created":"Tue, 29 Aug 2023 17:59:33 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Ciambelli","Luca",""],["Delfante","Arnaud",""],["Ruzziconi","Romain",""],["Zwikel","C\u00e9line",""]]}
{"id":"2308.15483","submitter":"Le Xia","authors":"Le Xia, Yao Sun, Chengsi Liang, Lei Zhang, Muhammad Ali Imran, and\n  Dusit Niyato","title":"Generative AI for Semantic Communication: Architecture, Challenges, and\n  Outlook","comments":"This article has been submitted to IEEE Wireless Communications\n  Magazine for peer review","journal-ref":null,"doi":null,"report-no":null,"categories":"cs.NI eess.IV eess.SP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Semantic communication (SemCom) is expected to be a core paradigm in future\ncommunication networks, yielding significant benefits in terms of spectrum\nresource saving and information interaction efficiency. However, the existing\nSemCom structure is limited by the lack of context-reasoning ability and\nbackground knowledge provisioning, which, therefore, motivates us to seek the\npotential of incorporating generative artificial intelligence (GAI)\ntechnologies with SemCom. Recognizing GAI's powerful capability in automating\nand creating valuable, diverse, and personalized multimodal content, this\narticle first highlights the principal characteristics of the combination of\nGAI and SemCom along with their pertinent benefits and challenges. To tackle\nthese challenges, we further propose a novel GAI-assisted SemCom network\n(GAI-SCN) framework in a cloud-edge-mobile design. Specifically, by employing\nglobal and local GAI models, our GAI-SCN enables multimodal semantic content\nprovisioning, semantic-level joint-source-channel coding, and AIGC acquisition\nto maximize the efficiency and reliability of semantic reasoning and resource\nutilization. Afterward, we present a detailed implementation workflow of\nGAI-SCN, followed by corresponding initial simulations for performance\nevaluation in comparison with two benchmarks. Finally, we discuss several open\nissues and offer feasible solutions to unlock the full potential of GAI-SCN.\n","versions":[{"version":"v1","created":"Thu, 3 Aug 2023 19:33:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Xia","Le",""],["Sun","Yao",""],["Liang","Chengsi",""],["Zhang","Lei",""],["Imran","Muhammad Ali",""],["Niyato","Dusit",""]]}
{"id":"2308.15484","submitter":"Fanshi Li","authors":"Fanshi Li, Zhihui Wang, Yifan Guo, Congcong Liu, Yanjie Zhu, Yihang\n  Zhou, Jun Li, Dong Liang, Haifeng Wang","title":"Dynamic Dual-Graph Fusion Convolutional Network For Alzheimer's Disease\n  Diagnosis","comments":"This work has been submitted to the IEEE for possible publication.\n  Copyright may be transferred without notice, after which this version may no\n  longer be accessible","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.AI cs.GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  In this paper, a dynamic dual-graph fusion convolutional network is proposed\nto improve Alzheimer's disease (AD) diagnosis performance. The following are\nthe paper's main contributions: (a) propose a novel dynamic GCN architecture,\nwhich is an end-to-end pipeline for diagnosis of the AD task; (b) the proposed\narchitecture can dynamically adjust the graph structure for GCN to produce\nbetter diagnosis outcomes by learning the optimal underlying latent graph; (c)\nincorporate feature graph learning and dynamic graph learning, giving those\nuseful features of subjects more weight while decreasing the weights of other\nnoise features. Experiments indicate that our model provides flexibility and\nstability while achieving excellent classification results in AD diagnosis.\n","versions":[{"version":"v1","created":"Sat, 5 Aug 2023 02:44:02 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Li","Fanshi",""],["Wang","Zhihui",""],["Guo","Yifan",""],["Liu","Congcong",""],["Zhu","Yanjie",""],["Zhou","Yihang",""],["Li","Jun",""],["Liang","Dong",""],["Wang","Haifeng",""]]}
{"id":"2308.15485","submitter":"Runsheng Zhang","authors":"Runsheng Zhang","title":"Investigation and Evaluation of Adaptive Algorithms for Multichannel\n  Active Noise Control System","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This dissertation focuses on the investigation and evaluation of adptive\nalgorithms for multichannel active noise control system. The aim of the\nresearch is to investigate the effectiveness of the FxLMS algorithm and the\npre-trained control filter in attenuating various types of noise. The study\nbegins with a comprehensive review of the existing literature on active noise\ncontrol, highlighting the significance of noise reduction in different\napplications. The theoretical foundations of the FxLMS algorithm and the\npre-trained control filter are then presented, including their underlying\nprinciples and mathematical formulations. Through a comprehensive analysis, a\nclear understanding of these methods is established. To assess the performance\nof the FxLMS algorithm and the pre-trained control filter, extensive simulation\nexperiments are conducted using real-world noise signals. The experiments\ninclude scenarios such as aircraft noise, traffic noise, and mixed noise. The\nresults of the simulations are used to compare the noise reduction capabilities\nof the two methods and to evaluate their effectiveness under different noise\nconditions. The findings indicate that the FxLMS algorithm exhibits remarkable\nnoise reduction performance. It demonstrates a strong ability to track and\nrespond quickly to varying noise patterns. In the initial stages of noise\nreduction, the pre-trained control filter shows better performance. However, as\ntime progresses, the FxLMS algorithm consistently achieves higher average noise\nreduction levels compared to the pre-trained control filter. Additionally, the\nFxLMS algorithm shows faster responsiveness during transitional periods when\nnoise characteristics change. These findings contribute to the field of noise\ncontrol and provide valuable insights for designing efficient noise reduction\nsystems.\n","versions":[{"version":"v1","created":"Wed, 9 Aug 2023 08:38:41 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Zhang","Runsheng",""]]}
{"id":"2308.15486","submitter":"Vindhyawasini Prasad Dr.","authors":"Vindhyawasini Prasad (On behalf of the BESIII Collaboration)","title":"Dark sector and Axion-like particle search at BESIII","comments":"6 pages, 5 figures, Proceeding of Lepton Photon 2023","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex hep-ph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Dark matter (DM) refers to a new type of matter that may explain observed\nrotation curves of galaxies and the composite structure of the Universe. It may\ncouple to the Standard Model particles via portals, which include the\npossibility of axion-like particle, light Higgs boson, dark photon and spin-1/2\nfermions. The axion-like particle and light Higgs boson can be accessible via\nradiative decays of $J/\\psi$ while the dark photon via initial-state radiation\nprocess using the data of high-intensity $e^+e^-$ collider experiments, such as\nthe BESIII experiment. DM may be depicted as baryonic matter in an invisible\nfinal state. The presence of a massless dark photon, predicted by the\nspontaneous broken of Abelian group $U(1)_D$, may enhance the branching\nfractions of rare flavor changing neutral current decay processes. BESIII\nexperiment has recently explored the possibility of these DM scenarios using\nthe data samples collected at several energy points, including $J/\\psi$ and\n$\\psi(3686)$ resonances. This report summarizes the recent results of the\nBESIII experiment related to the dark-sector and Axion-like particles.\n","versions":[{"version":"v1","created":"Wed, 16 Aug 2023 01:31:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Prasad","Vindhyawasini","","On behalf of the BESIII Collaboration"]]}
{"id":"2308.15487","submitter":"Ariel Recthman","authors":"Nadav Potesman and Ariel Rechtman","title":"SA Unet Improved","comments":"7 pages, 5 figures, https://github.com/nadavpo/DL_course_project","journal-ref":null,"doi":null,"report-no":null,"categories":"eess.IV cs.CV","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  Retinal vessels segmentation is well known problem in image processing on the\nmedical field. Good segmentation may help doctors take better decisions while\ndiagnose eyes disuses. This paper describes our work taking up the DRIVE\nchallenge which include segmentation on retinal vessels. We invented a new\nmethod which combine using of StyleGAN2 and SA-Unet. Our innovation can help\nany small data set segmentation problem.\n","versions":[{"version":"v1","created":"Fri, 18 Aug 2023 06:26:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Potesman","Nadav",""],["Rechtman","Ariel",""]]}
{"id":"2308.15488","submitter":"Jonathan Swift","authors":"Taylor Gudebski, Elisabeth Heldridge, Brady McGawn, Elle O Hill,\n  Jonathan J. Swift and Henry Zhou","title":"New Post-DART Collision Period for the Didymos System: Evidence for\n  Anomalous Orbital Decay","comments":"3 pages, 1 figure. Accepted for publication as a Research Note of the\n  American Astronomical Society","journal-ref":null,"doi":null,"report-no":null,"categories":"astro-ph.EP","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  On September 26, 2022, NASA's DART spacecraft impacted Dimorphos, the\nsecondary asteroid in the (65803) Didymos system, so that the efficiency with\nwhich a satellite could divert an asteroid could be measured from the change in\nthe system's period. We present new data from the Thacher Observatory and\nmeasure a change in period, $\\Delta P = -34.2 \\pm 0.1$ min, which deviates from\nprevious measurements by $3.5\\,\\sigma$. This suggests that the system period\nmay have decreased by $\\sim 1$ minute in the 20 to 30 days between previous\nmeasurements and our measurements. We find that no mechanism previously\npresented for this system can account for this large of a period change, and\ndrag from impact ejecta is an unlikely explanation. Further observations of the\n(65803) Didymos system are needed to both confirm our result and to further\nunderstand this system post impact.\n","versions":[{"version":"v1","created":"Tue, 22 Aug 2023 17:59:55 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Gudebski","Taylor",""],["Heldridge","Elisabeth",""],["McGawn","Brady",""],["Hill","Elle O",""],["Swift","Jonathan J.",""],["Zhou","Henry",""]]}
{"id":"2308.15489","submitter":"EPTCS","authors":"Shane Mansfield, Benoit Val\\^iron, Vladimir Zamdzhiev","title":"Proceedings of the Twentieth International Conference on Quantum Physics\n  and Logic","comments":null,"journal-ref":"EPTCS 384, 2023","doi":"10.4204/EPTCS.384","report-no":null,"categories":"quant-ph","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  This volume contains the proceedings of the 20th International Conference on\nQuantum Physics and Logic (QPL 2023). The aim of the QPL conference series is\nto bring together academic and industry researchers working on mathematical\nfoundations of quantum computation, quantum physics, and related areas. The\nmain focus is on the use of algebraic and categorical structures, formal\nlanguages, type systems, semantic methods, as well as other mathematical and\ncomputer scientific techniques applicable to the study of physical systems,\nphysical processes, and their composition.\n","versions":[{"version":"v1","created":"Wed, 23 Aug 2023 06:50:47 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mansfield","Shane",""],["Val\u00eeron","Benoit",""],["Zamdzhiev","Vladimir",""]]}
{"id":"2308.15490","submitter":"Chenxu Yu","authors":"Chenxu Yu, Yanxi Zhang","title":"A method of maximum likelihood fit to data with non-uniform efficiencies","comments":"7 pages, 3 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"physics.data-an hep-ex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  Estimations of physical parameters using data usually involve non-uniform\nexperimental efficiencies. In this article, a method of maximum likelihood fit\nis introduced using the efficiency as a weight, while the probability\ndistribution function is kept unaffected by the efficiency. A brief proof and\npseudo-experiment studies suggest that this method gives unbiased estimation of\nparameters. For cases where the probability distribution function can be\nnormalized analytically, this method significant reduces the usage of computing\nresources.\n","versions":[{"version":"v1","created":"Fri, 25 Aug 2023 07:10:27 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Yu","Chenxu",""],["Zhang","Yanxi",""]]}
{"id":"2308.15491","submitter":"Hung-Hsuan Chen","authors":"Ruei-Yuan Wang, Hung-Hsuan Chen","title":"Detecting Inactive Cyberwarriors from Online Forums","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.AI cs.LG","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The proliferation of misinformation has emerged as a new form of warfare in\nthe information age. This type of warfare involves cyberwarriors, who\ndeliberately propagate messages aimed at defaming opponents or fostering unity\namong allies. In this study, we investigate the level of activity exhibited by\ncyberwarriors within a large online forum, and remarkably, we discover that\nonly a minute fraction of cyberwarriors are active users. Surprisingly, despite\ntheir expected role of actively disseminating misinformation, cyberwarriors\nremain predominantly silent during peacetime and only spring into action when\nnecessary. Moreover, we analyze the challenges associated with identifying\ncyberwarriors and provide evidence that detecting inactive cyberwarriors is\nconsiderably more challenging than identifying their active counterparts.\nFinally, we discuss potential methodologies to more effectively identify\ncyberwarriors during their inactive phases, offering insights into better\ncapturing their presence and actions. The experimental code is released for\nreproducibility:\n\\url{https://github.com/Ryaninthegame/Detect-Inactive-Spammers-on-PTT}.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 01:55:44 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Wang","Ruei-Yuan",""],["Chen","Hung-Hsuan",""]]}
{"id":"2308.15492","submitter":"Ali Mohammad-Djafari","authors":"Ali Mohammad-Djafari, Ning Chu, Li Wang, Liang Yu","title":"Deep Learning and Bayesian inference for Inverse Problems","comments":"Presented at MaxEnt 2023: International Workshop on Bayesian\n  Inference and Maximum Entropy Methods in Science and Engineering, Max Planck\n  Institut, Garching, Germany, July 3-7, 2023. A modified version to appear in\n  MaxEnt2023 Proceedings, published by MDPI","journal-ref":null,"doi":null,"report-no":"Report-no: 2023-02","categories":"stat.ML","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  Inverse problems arise anywhere we have indirect measurement. As, in general\nthey are ill-posed, to obtain satisfactory solutions for them needs prior\nknowledge. Classically, different regularization methods and Bayesian inference\nbased methods have been proposed. As these methods need a great number of\nforward and backward computations, they become costly in computation, in\nparticular, when the forward or generative models are complex and the\nevaluation of the likelihood becomes very costly. Using Deep Neural Network\nsurrogate models and approximate computation can become very helpful. However,\naccounting for the uncertainties, we need first understand the Bayesian Deep\nLearning and then, we can see how we can use them for inverse problems. In this\nwork, we focus on NN, DL and more specifically the Bayesian DL particularly\nadapted for inverse problems. We first give details of Bayesian DL approximate\ncomputations with exponential families, then we will see how we can use them\nfor inverse problems. We consider two cases: First the case where the forward\noperator is known and used as physics constraint, the second more general data\ndriven DL methods. keyword: Neural Network, Variational Bayesian inference,\nBayesian Deep Learning (DL), Inverse problems, Physics based DL.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 04:27:45 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mohammad-Djafari","Ali",""],["Chu","Ning",""],["Wang","Li",""],["Yu","Liang",""]]}
{"id":"2308.15493","submitter":"Xiangyu Mao","authors":"Xiangyu Mao and Jianping He","title":"Unidentifiability of System Dynamics: Conditions and Controller Design","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"eess.SY cs.SY","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  How to make a dynamic system unidentifiable is an important but still open\nissue. It not only requires that the parameters of the systems but also the\nequivalent systems cannot be identified by any identification approaches. Thus,\nit is a much more challenging problem than the existing analysis of parameter\nidentifiability. In this paper, we investigate the problem of dynamic\nunidentifiability and design the controller to make the system dynamics\nunidentifiable. Specifically, we first define dynamic unidentifiability by\ntaking both system parameters and equivalent systems into consideration. Then,\nwe obtain the necessary and sufficient condition for unidentifiability based on\nthe Fisher Information Matrix. This condition is derived by analysis of the\nrelationship between the unidentifiable parameters and the Hessian matrix of\nthe system function. Next, we propose a controller design scheme for ensuring\ndynamic unidentifiability under linear system models. We prove that for\ncontrollable and observable linear time-invariant systems, the requirement of\nunidentifiability is equivalent to the requirement of a low-rank controller.\nThen, the low-rank controller design problem is solved by transforming it into\na model order reduction problem. We demonstrate the effectiveness of our method\nby simulation.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 09:04:43 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Mao","Xiangyu",""],["He","Jianping",""]]}
{"id":"2308.15494","submitter":"Lars Gottesb\\\"uren","authors":"Nikolai Maas, Lars Gottesb\\\"uren, Daniel Seemaier","title":"Parallel Unconstrained Local Search for Partitioning Irregular Graphs","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"cs.SI cs.DC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","abstract":"  We present new refinement heuristics for the balanced graph partitioning\nproblem that break with an age-old rule. Traditionally, local search only\npermits moves that keep the block sizes balanced (below a size constraint). In\nthis work, we demonstrate that admitting large temporary balance violations\ndrastically improves solution quality. The effects are particularly strong on\nirregular instances such as social networks. Designing efficient\nimplementations of this general idea involves both careful selection of\ncandidates for unconstrained moves as well as algorithms for rebalancing the\nsolution later on. We explore a wide array of design choices to achieve this,\nin addition to our third goal of high parallel scalability. We present\ncompelling experimental results, demonstrating that our parallel unconstrained\nlocal search techniques outperform the prior state of the art by a substantial\nmargin. Compared with four state-of-the-art solvers, our new technique finds\n91% of the best solutions on irregular graphs. We achieve a 13.8% improvement\nin edge cut over the next best competitor, while being only 11.4% slower in the\ngeometric mean.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 14:33:03 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Maas","Nikolai",""],["Gottesb\u00fcren","Lars",""],["Seemaier","Daniel",""]]}
{"id":"2308.15495","submitter":"Tibor Rakovszky","authors":"Tibor Rakovszky and Sarang Gopalakrishnan and Curt von Keyserlingk","title":"Defining stable phases of open quantum systems","comments":null,"journal-ref":null,"doi":null,"report-no":null,"categories":"quant-ph cond-mat.stat-mech cond-mat.str-el","license":"http://creativecommons.org/licenses/by/4.0/","abstract":"  The steady states of dynamical processes can exhibit stable nontrivial\nphases, which can also serve as fault-tolerant classical or quantum memories.\nFor Markovian quantum (classical) dynamics, these steady states are extremal\neigenvectors of the non-Hermitian operators that generate the dynamics, i.e.,\nquantum channels (Markov chains). However, since these operators are\nnon-Hermitian, their spectra are an unreliable guide to dynamical relaxation\ntimescales or to stability against perturbations. We propose an alternative\ndynamical criterion for a steady state to be in a stable phase, which we name\nuniformity: informally, our criterion amounts to requiring that, under\nsufficiently small local perturbations of the dynamics, the unperturbed and\nperturbed steady states are related to one another by a finite-time dissipative\nevolution. We show that this criterion implies many of the properties one would\nwant from any reasonable definition of a phase. We prove that uniformity is\nsatisfied in a canonical classical cellular automaton, and provide numerical\nevidence that the gap determines the relaxation rate between nearby steady\nstates in the same phase, a situation we conjecture holds generically whenever\nuniformity is satisfied. We further conjecture some sufficient conditions for a\nchannel to exhibit uniformity and therefore stability.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 17:55:31 GMT"}],"update_date":"2023-08-31","authors_parsed":[["Rakovszky","Tibor",""],["Gopalakrishnan","Sarang",""],["von Keyserlingk","Curt",""]]}
{"id":"2308.15496","submitter":"Xiaoxuan Chu","authors":"STAR Collaboration","title":"Measurements of the $Z^{0}/\\gamma^{*}$ cross section and transverse\n  single spin asymmetry in 510 GeV $p$$+$$p$ collisions","comments":"23 pages, 4 figures","journal-ref":null,"doi":null,"report-no":null,"categories":"hep-ex nucl-ex","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","abstract":"  The differential cross section for $Z^{0}$ production, measured as a function\nof the boson's transverse momentum ($p_{\\mathrm{T}}$), provides important\nconstraints on the evolution of the transverse momentum dependent parton\ndistribution functions (TMDs). The transverse single spin asymmetry (TSSA) of\nthe $Z^{0}$ is sensitive to one of the polarized TMDs, the Sivers function,\nwhich is predicted to have the opposite sign in $p+p$ $\\rightarrow W/Z+ X$ from\nthat which enters in semi-inclusive deep inelastic scattering. In this Letter,\nthe STAR Collaboration reports the first measurement of the $Z^{0}/\\gamma^{*}$\ndifferential cross section as a function of its $p_{\\mathrm{T}}$ in $p$$+$$p$\ncollisions at a center-of-mass energy of 510 GeV, together with the\n$Z^{0}/\\gamma^{*}$ total cross section. We also report the measurement of\n$Z^{0}/\\gamma^{*}$ TSSA in transversely polarized $p$$+$$p$ collisions at 510\nGeV.\n","versions":[{"version":"v1","created":"Mon, 28 Aug 2023 18:26:05 GMT"}],"update_date":"2023-08-31","authors_parsed":[["STAR Collaboration","",""]]}